plugindir = @plugindir@
-plugin_LTLIBRARIES = work.la
+plugin_LTLIBRARIES = lua.la
-work_la_SOURCES = \
+lua_la_SOURCES = \
+ lua_tvb.c \
+ lua_proto.c \
+ lua_tree.c \
+ lua_pinfo.c \
+ lua_tap.c \
packet-lua.c \
+ packet-lua.h \
plugin.c
-work_la_LDFLAGS = -module -avoid-version
-work_la_LIBADD = @PLUGIN_LIBS@
+lua_la_LDFLAGS = -module -avoid-version
+lua_la_LIBADD = @PLUGIN_LIBS@
# Libs must be cleared, or else libtool won't create a shared module.
dummy:
touch dummy
-
+
+GUNZIP = gzip -d
+TAR = tar
+
+lua-5.0.2: lua-5.0.2.tar.gz
+ $(GUNZIP) lua-5.0.2.tar.gz | $(TAR) xf -
+
+lua_tvb.c : lua-5.0.2/lib/liblua.so
+
+lua_proto.c : lua-5.0.2/lib/liblua.so
+
+lua_tree.c : lua-5.0.2/lib/liblua.so
+
+lua_pinfo.c : lua-5.0.2/lib/liblua.so
+
+lua_tap.c : lua-5.0.2/lib/liblua.so
+
+packet-lua.c : lua-5.0.2/lib/liblua.so
+
+packet-lua.h : lua-5.0.2/lib/liblua.so
+
+
+lua-5.0.2/lib/liblua.la:
+ cd lua-5.0.2 ; env -i PATH=$(PATH) make
--- /dev/null
+Lua License
+-----------
+
+Lua is licensed under the terms of the MIT license reproduced below.
+This means that Lua is free software and can be used for both academic
+and commercial purposes at absolutely no cost.
+
+For details and rationale, see http://www.lua.org/license.html .
+
+===============================================================================
+
+Copyright (C) 2003-2004 Tecgraf, 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 of COPYRIGHT)
--- /dev/null
+diff -r lua-5.0/COPYRIGHT lua-5.0.2/COPYRIGHT
+12c12
+< Copyright (C) 2003 Tecgraf, PUC-Rio.
+---
+> Copyright (C) 2003-2004 Tecgraf, PUC-Rio.
+diff -r lua-5.0/Makefile lua-5.0.2/Makefile
+98a99,101
+> newer:
+> @find . -newer MANIFEST -type f
+>
+diff -r lua-5.0/doc/readme.html lua-5.0.2/doc/readme.html
+16c16
+< <LI><A HREF="manual.html">Reference manual</A>
+---
+> <LI><A HREF="contents.html">Reference manual</A>
+31c31
+< Tue Apr 1 14:35:18 EST 2003
+---
+> Thu Mar 11 23:08:56 BRT 2004
+diff -r lua-5.0/include/lua.h lua-5.0.2/include/lua.h
+2c2
+< ** $Id: lua.h,v 1.175 2003/03/18 12:31:39 roberto Exp $
+---
+> ** $Id: lua.h,v 1.175b 2003/03/18 12:31:39 roberto Exp $
+17,18c17,18
+< #define LUA_VERSION "Lua 5.0"
+< #define LUA_COPYRIGHT "Copyright (C) 1994-2003 Tecgraf, PUC-Rio"
+---
+> #define LUA_VERSION "Lua 5.0.2"
+> #define LUA_COPYRIGHT "Copyright (C) 1994-2004 Tecgraf, PUC-Rio"
+368c368
+< * Copyright (C) 1994-2003 Tecgraf, PUC-Rio. All rights reserved.
+---
+> * Copyright (C) 1994-2004 Tecgraf, PUC-Rio. All rights reserved.
+diff -r lua-5.0/src/ldo.c lua-5.0.2/src/ldo.c
+2c2
+< ** $Id: ldo.c,v 1.217 2003/04/03 13:35:34 roberto Exp $
+---
+> ** $Id: ldo.c,v 1.217a 2003/04/03 13:35:34 roberto Exp $
+325,326c325
+< if (nargs >= L->top - L->base)
+< luaG_runerror(L, "cannot resume dead coroutine");
+---
+> lua_assert(nargs < L->top - L->base);
+329c328,329
+< else if (ci->state & CI_YIELD) { /* inside a yield? */
+---
+> else { /* inside a yield */
+> lua_assert(ci->state & CI_YIELD);
+344,345d343
+< else
+< luaG_runerror(L, "cannot resume non-suspended coroutine");
+351a350,358
+> static int resume_error (lua_State *L, const char *msg) {
+> L->top = L->ci->base;
+> setsvalue2s(L->top, luaS_new(L, msg));
+> incr_top(L);
+> lua_unlock(L);
+> return LUA_ERRRUN;
+> }
+>
+>
+355a363,368
+> if (L->ci == L->base_ci) {
+> if (nargs >= L->top - L->base)
+> return resume_error(L, "cannot resume dead coroutine");
+> }
+> else if (!(L->ci->state & CI_YIELD)) /* not inside a yield? */
+> return resume_error(L, "cannot resume non-suspended coroutine");
+diff -r lua-5.0/src/lgc.c lua-5.0.2/src/lgc.c
+2c2
+< ** $Id: lgc.c,v 1.171 2003/04/03 13:35:34 roberto Exp $
+---
+> ** $Id: lgc.c,v 1.171a 2003/04/03 13:35:34 roberto Exp $
+113c113,114
+< void luaC_separateudata (lua_State *L) {
+---
+> size_t luaC_separateudata (lua_State *L) {
+> size_t deadmem = 0;
+127a129
+> deadmem += sizeudata(gcotou(curr)->uv.len);
+136a139
+> return deadmem;
+247c250
+< if (!(ci->state & CI_C) && lim < ci->top)
+---
+> if (lim < ci->top)
+390c393
+< static void checkSizes (lua_State *L) {
+---
+> static void checkSizes (lua_State *L, size_t deadmem) {
+400c403
+< G(L)->GCthreshold = 2*G(L)->nblocks; /* new threshold */
+---
+> G(L)->GCthreshold = 2*G(L)->nblocks - deadmem; /* new threshold */
+454c457,458
+< static void mark (lua_State *L) {
+---
+> static size_t mark (lua_State *L) {
+> size_t deadmem;
+467c471
+< luaC_separateudata(L); /* separate userdata to be preserved */
+---
+> deadmem = luaC_separateudata(L); /* separate userdata to be preserved */
+475a480
+> return deadmem;
+480c485
+< mark(L);
+---
+> size_t deadmem = mark(L);
+482c487
+< checkSizes(L);
+---
+> checkSizes(L, deadmem);
+diff -r lua-5.0/src/lgc.h lua-5.0.2/src/lgc.h
+2c2
+< ** $Id: lgc.h,v 1.19 2003/02/28 19:45:15 roberto Exp $
+---
+> ** $Id: lgc.h,v 1.19a 2003/02/28 19:45:15 roberto Exp $
+18c18
+< void luaC_separateudata (lua_State *L);
+---
+> size_t luaC_separateudata (lua_State *L);
+diff -r lua-5.0/src/lib/lbaselib.c lua-5.0.2/src/lib/lbaselib.c
+2c2
+< ** $Id: lbaselib.c,v 1.130 2003/04/03 13:35:34 roberto Exp $
+---
+> ** $Id: lbaselib.c,v 1.130b 2003/04/03 13:35:34 roberto Exp $
+276a277
+> int n = lua_gettop(L);
+280c281
+< return lua_gettop(L) - 1;
+---
+> return lua_gettop(L) - n;
+327c328
+< char buff[64];
+---
+> char buff[128];
+diff -r lua-5.0/src/lib/liolib.c lua-5.0.2/src/lib/liolib.c
+2c2
+< ** $Id: liolib.c,v 2.39 2003/03/19 21:16:12 roberto Exp $
+---
+> ** $Id: liolib.c,v 2.39a 2003/03/19 21:16:12 roberto Exp $
+161c161
+< if (lua_isnone(L, 1)) {
+---
+> if (lua_isnone(L, 1) && lua_type(L, lua_upvalueindex(1)) == LUA_TTABLE) {
+178c178
+< char buff[32];
+---
+> char buff[128];
+diff -r lua-5.0/src/lparser.c lua-5.0.2/src/lparser.c
+2c2
+< ** $Id: lparser.c,v 1.208 2003/04/03 13:35:34 roberto Exp $
+---
+> ** $Id: lparser.c,v 1.208a 2003/04/03 13:35:34 roberto Exp $
+1143a1144
+> FuncState *fs = ls->fs;
+1145c1146,1147
+< init_exp(&v, VLOCAL, ls->fs->freereg++);
+---
+> init_exp(&v, VLOCAL, fs->freereg);
+> luaK_reserveregs(fs, 1);
+1148c1150,1152
+< luaK_storevar(ls->fs, &v, &b);
+---
+> luaK_storevar(fs, &v, &b);
+> /* debug information will only see the variable after this point! */
+> getlocvar(fs, fs->nactvar - 1).startpc = fs->pc;
+diff -r lua-5.0/src/luac/Makefile lua-5.0.2/src/luac/Makefile
+16c16
+< $(CC) -o $@ $(MYLDFLAGS) $(OBJS) -L$(LIB) -llua -llualib $(EXTRA_LIBS)
+---
+> $(CC) -o $@ $(MYLDFLAGS) $(OBJS) -L$(LIB) -llua -llualib $(EXTRA_LIBS) $(DLLIB)
+diff -r lua-5.0/src/luac/luac.c lua-5.0.2/src/luac/luac.c
+2c2
+< ** $Id: luac.c,v 1.44 2003/04/07 20:34:20 lhf Exp $
+---
+> ** $Id: luac.c,v 1.44a 2003/04/07 20:34:20 lhf Exp $
+184a185
+> lua_lock(L);
+185a187
+> lua_unlock(L);
+diff -r lua-5.0/src/lvm.c lua-5.0.2/src/lvm.c
+2c2
+< ** $Id: lvm.c,v 1.284 2003/04/03 13:35:34 roberto Exp $
+---
+> ** $Id: lvm.c,v 1.284b 2003/04/03 13:35:34 roberto Exp $
+69c69
+< if (mask > LUA_MASKLINE) { /* instruction-hook set? */
+---
+> if (mask & LUA_MASKCOUNT) { /* instruction-hook set? */
+402,403c402,403
+< L->ci->u.l.pc = &pc;
+< if (L->hookmask & LUA_MASKCALL)
+---
+> if (L->hookmask & LUA_MASKCALL) {
+> L->ci->u.l.pc = &pc;
+404a405
+> }
+405a407
+> L->ci->u.l.pc = &pc;
+676,678c678
+< lua_assert(ci->u.l.pc == &pc &&
+< ttisfunction(ci->base - 1) &&
+< (ci->state & CI_SAVEDPC));
+---
+> lua_assert(ttisfunction(ci->base - 1) && (ci->state & CI_SAVEDPC));
+779a780
+>
+diff -r lua-5.0/test/luac.lua lua-5.0.2/test/luac.lua
+4,6c4,6
+< assert(arg[1]~=nil,"usage: lua luac.lua file.lua")
+< f=assert(io.open("luac.out","w"))
+< f:write(string.dump(loadfile(arg[1])))
+---
+> assert(arg[1]~=nil and arg[2]==nil,"usage: lua luac.lua file.lua")
+> f=assert(io.open("luac.out","wb"))
+> f:write(string.dump(assert(loadfile(arg[1]))))
+diff -r lua-5.0/test/table.lua lua-5.0.2/test/table.lua
+8c8
+< local _,_,a,b=string.find(l,'"?(%w+)"?%s*(.*)$')
+---
+> local _,_,a,b=string.find(l,'"?([_%w]+)"?%s*(.*)$')
--- /dev/null
+This is Lua 5.0.
+
+* Changes from version 4.0 to 5.0
+ -------------------------------
+ Language:
+ + lexical scoping.
+ + Lua coroutines.
+ + standard libraries now packaged in tables.
+ + tags replaced by metatables and tag methods replaced by metamethods,
+ stored in metatables.
+ + proper tail calls.
+ + each function can have its own global table, which can be shared.
+ + new __newindex metamethod, called when we insert a new key into a table.
+ + new block comments: --[[ ... ]].
+ + new generic for.
+ + new weak tables.
+ + new boolean type.
+ + new syntax "local function".
+ + (f()) returns the first value returned by f.
+ + {f()} fills a table with all values returned by f.
+ + \n ignored in [[\n .
+ + fixed and-or priorities.
+ + more general syntax for function definition (e.g. function a.x.y:f()...end).
+ + more general syntax for function calls (e.g. (print or write)(9)).
+ + new functions (time/date, tmpfile, unpack, require, load*, etc.).
+ API:
+ + chunks are loaded by using lua_load; new luaL_loadfile and luaL_loadbuffer.
+ + introduced lightweight userdata, a simple "void*" without a metatable.
+ + new error handling protocol: the core no longer prints error messages;
+ all errors are reported to the caller on the stack.
+ + new lua_atpanic for host cleanup.
+ + new, signal-safe, hook scheme.
+ Implementation:
+ + new license: MIT.
+ + new, faster, register-based virtual machine.
+ + support for external multithreading and coroutines.
+ + new and consistent error message format.
+ + the core no longer needs "stdio.h" for anything (except for a single
+ use of sprintf to convert numbers to strings).
+ + lua.c now runs the environment variable LUA_INIT, if present. It can
+ be "@filename", to run a file, or the chunk itself.
+ + support for user extensions in lua.c.
+ sample implementation given for command line editing.
+ + new dynamic loading library, active by default on several platforms.
+ + safe garbage-collector metamethods.
+ + precompiled bytecodes checked for integrity (secure binary dostring).
+ + strings are fully aligned.
+ + position capture in string.find.
+ + read('*l') can read lines with embedded zeros.
+
+* Changes from version 3.2 to 4.0
+ -------------------------------
+ Language:
+ + new "break" and "for" statements (both numerical and for tables).
+ + uniform treatment of globals: globals are now stored in a Lua table.
+ + improved error messages.
+ + no more '$debug': full speed *and* full debug information.
+ + new read form: read(N) for next N bytes.
+ + general read patterns now deprecated.
+ (still available with -DCOMPAT_READPATTERNS.)
+ + all return values are passed as arguments for the last function
+ (old semantics still available with -DLUA_COMPAT_ARGRET)
+ + garbage collection tag methods for tables now deprecated.
+ + there is now only one tag method for order.
+ API:
+ + New API: fully re-entrant, simpler, and more efficient.
+ + New debug API.
+ Implementation:
+ + faster than ever: cleaner virtual machine and new hashing algorithm.
+ + non-recursive garbage-collector algorithm.
+ + reduced memory usage for programs with many strings.
+ + improved treatment for memory allocation errors.
+ + improved support for 16-bit machines (we hope).
+ + code now compiles unmodified as both ANSI C and C++.
+ + numbers in bases other than 10 are converted using strtoul.
+ + new -f option in Lua to support #! scripts.
+ + luac can now combine text and binaries.
+
+* Changes from version 3.1 to 3.2
+ -------------------------------
+ + redirected all output in Lua's core to _ERRORMESSAGE and _ALERT.
+ + increased limit on the number of constants and globals per function
+ (from 2^16 to 2^24).
+ + debugging info (lua_debug and hooks) moved into lua_state and new API
+ functions provided to get and set this info.
+ + new debug lib gives full debugging access within Lua.
+ + new table functions "foreachi", "sort", "tinsert", "tremove", "getn".
+ + new io functions "flush", "seek".
+
+* Changes from version 3.0 to 3.1
+ -------------------------------
+ + NEW FEATURE: anonymous functions with closures (via "upvalues").
+ + new syntax:
+ - local variables in chunks.
+ - better scope control with DO block END.
+ - constructors can now be also written: { record-part; list-part }.
+ - more general syntax for function calls and lvalues, e.g.:
+ f(x).y=1
+ o:f(x,y):g(z)
+ f"string" is sugar for f("string")
+ + strings may now contain arbitrary binary data (e.g., embedded zeros).
+ + major code re-organization and clean-up; reduced module interdependecies.
+ + no arbitrary limits on the total number of constants and globals.
+ + support for multiple global contexts.
+ + better syntax error messages.
+ + new traversal functions "foreach" and "foreachvar".
+ + the default for numbers is now double.
+ changing it to use floats or longs is easy.
+ + complete debug information stored in pre-compiled chunks.
+ + sample interpreter now prompts user when run interactively, and also
+ handles control-C interruptions gracefully.
+
+* Changes from version 2.5 to 3.0
+ -------------------------------
+ + NEW CONCEPT: "tag methods".
+ Tag methods replace fallbacks as the meta-mechanism for extending the
+ semantics of Lua. Whereas fallbacks had a global nature, tag methods
+ work on objects having the same tag (e.g., groups of tables).
+ Existing code that uses fallbacks should work without change.
+ + new, general syntax for constructors {[exp] = exp, ... }.
+ + support for handling variable number of arguments in functions (varargs).
+ + support for conditional compilation ($if ... $else ... $end).
+ + cleaner semantics in API simplifies host code.
+ + better support for writing libraries (auxlib.h).
+ + better type checking and error messages in the standard library.
+ + luac can now also undump.
+
+* Changes from version 2.4 to 2.5
+ -------------------------------
+ + io and string libraries are now based on pattern matching;
+ the old libraries are still available for compatibility
+ + dofile and dostring can now return values (via return statement)
+ + better support for 16- and 64-bit machines
+ + expanded documentation, with more examples
+
+* Changes from version 2.2 to 2.4
+ -------------------------------
+ + external compiler creates portable binary files that can be loaded faster
+ + interface for debugging and profiling
+ + new "getglobal" fallback
+ + new functions for handling references to Lua objects
+ + new functions in standard lib
+ + only one copy of each string is stored
+ + expanded documentation, with more examples
+
+* Changes from version 2.1 to 2.2
+ -------------------------------
+ + functions now may be declared with any "lvalue" as a name
+ + garbage collection of functions
+ + support for pipes
+
+* Changes from version 1.1 to 2.1
+ -------------------------------
+ + object-oriented support
+ + fallbacks
+ + simplified syntax for tables
+ + many internal improvements
+
+(end of HISTORY)
--- /dev/null
+This is Lua 5.0.
+
+* Installation
+ ------------
+ Building Lua on a Unix system should be very easy:
+
+ 1. Read "config" and edit it to suit your platform and needs.
+ We strongly recommend that you enable support for dynamic loading,
+ if your platform allows it.
+ 2. Do "make".
+ 3. If you want to install Lua in an "official" place in your system,
+ then do "make install". The official place and the way to install
+ files are defined in "config". You may have to be root to do this.
+
+ See below for instructions for Windows and other systems.
+
+* What you get
+ ------------
+ If "make" succeeds, you get:
+ * an interpreter in ./bin/lua and a compiler in ./bin/luac;
+ * libraries in ./lib;
+ * include files in ./include.
+ These are the only directories you need for development.
+
+ There are man pages for lua and luac, in both nroff and html; a reference
+ manual in html in ./doc, some sample code in ./test, and some useful stuff
+ in ./etc. You don't need these directories for development.
+
+ See also the README files in the various subdirectories.
+ A convenient starting point is ./doc/readme.html.
+
+* If you have problems (and solutions!)
+ -------------------------------------
+ If "make" fails, please let us know (lua@tecgraf.puc-rio.br).
+ If you make changes to "config" or to the Makefiles, please send them to us.
+
+* Shared libraries
+ ----------------
+ If you are running Linux, do "make so" after "make" succeeds.
+ This will create shared libraries in ./lib.
+ To install those shared libraries in an official place, do "make soinstall".
+
+ If you want the interpreter and the compiler to use shared libraries,
+ then do "make sobin" too. You may want to do this before "make install".
+
+ If you only want the shared libraries, you may want to add -fPIC to MYCFLAGS
+ in "config". Also, you may need to run "ldconfig" as root.
+
+ You may need to include ./lib in the LD_LIBRARY_PATH environment variable
+ to link programs that use the shared libraries if you don't put them in the
+ official places with "make install". (You may need to use the full path.)
+
+ Building shared libraries in other systems is similar but details differ;
+ you may need to fix a few details in the top-level Makefile.
+
+* Installation on Windows and other systems
+ -----------------------------------------------------
+ The instructions for building Lua on other systems machine depend on the
+ particular compiler you are using. The simplest way is to create a folder
+ with all .c and .h files, and then create projects for the core library,
+ the standard library, the interpreter, and the compiler, as follows:
+
+ core lib: lapi.c lcode.c ldebug.c ldo.c ldump.c lfunc.c lgc.c llex.c
+ lmem.c lobject.c lopcodes.c lparser.c lstate.c lstring.c
+ ltable.c ltests.c ltm.c lundump.c lvm.c lzio.c
+
+ standard lib: lauxlib.c lbaselib.c ldblib.c liolib.c lmathlib.c ltablib.c
+ lstrlib.c loadlib.c
+
+ interpreter: core lib, standard lib, lua.c
+
+ compiler: core lib, standard lib, luac.c print.c
+ and also lopcodes.c (with LUA_OPNAMES defined) from core.
+
+ Of course, to use Lua as a library, you'll have to know how to create
+ and use libraries with your compiler.
+
+ Also, read "config" to see what can be customized at compilation time.
+
+(end of INSTALL)
--- /dev/null
+MANIFEST contents of Lua 5.0.2 distribution on Wed Mar 17 17:59:01 BRT 2004
+lua-5.0.2
+lua-5.0.2/COPYRIGHT
+lua-5.0.2/DIFFS
+lua-5.0.2/HISTORY
+lua-5.0.2/INSTALL
+lua-5.0.2/MANIFEST
+lua-5.0.2/Makefile
+lua-5.0.2/README
+lua-5.0.2/UPDATE
+lua-5.0.2/bin
+lua-5.0.2/build
+lua-5.0.2/config
+lua-5.0.2/configure
+lua-5.0.2/doc
+lua-5.0.2/doc/contents.html
+lua-5.0.2/doc/logo.gif
+lua-5.0.2/doc/lua.1
+lua-5.0.2/doc/lua.html
+lua-5.0.2/doc/luac.1
+lua-5.0.2/doc/luac.html
+lua-5.0.2/doc/manual.html
+lua-5.0.2/doc/readme.html
+lua-5.0.2/etc
+lua-5.0.2/etc/Makefile
+lua-5.0.2/etc/README
+lua-5.0.2/etc/bin2c.c
+lua-5.0.2/etc/compat.lua
+lua-5.0.2/etc/doall.lua
+lua-5.0.2/etc/lua.ico
+lua-5.0.2/etc/lua.magic
+lua-5.0.2/etc/lua.xpm
+lua-5.0.2/etc/luser_number.h
+lua-5.0.2/etc/luser_tests.h
+lua-5.0.2/etc/min.c
+lua-5.0.2/etc/noparser.c
+lua-5.0.2/etc/saconfig.c
+lua-5.0.2/etc/trace.c
+lua-5.0.2/include
+lua-5.0.2/include/Makefile
+lua-5.0.2/include/lauxlib.h
+lua-5.0.2/include/lua.h
+lua-5.0.2/include/lualib.h
+lua-5.0.2/lib
+lua-5.0.2/src
+lua-5.0.2/src/Makefile
+lua-5.0.2/src/README
+lua-5.0.2/src/lapi.c
+lua-5.0.2/src/lapi.h
+lua-5.0.2/src/lcode.c
+lua-5.0.2/src/lcode.h
+lua-5.0.2/src/ldebug.c
+lua-5.0.2/src/ldebug.h
+lua-5.0.2/src/ldo.c
+lua-5.0.2/src/ldo.h
+lua-5.0.2/src/ldump.c
+lua-5.0.2/src/lfunc.c
+lua-5.0.2/src/lfunc.h
+lua-5.0.2/src/lgc.c
+lua-5.0.2/src/lgc.h
+lua-5.0.2/src/lib
+lua-5.0.2/src/lib/Makefile
+lua-5.0.2/src/lib/README
+lua-5.0.2/src/lib/lauxlib.c
+lua-5.0.2/src/lib/lbaselib.c
+lua-5.0.2/src/lib/ldblib.c
+lua-5.0.2/src/lib/liolib.c
+lua-5.0.2/src/lib/lmathlib.c
+lua-5.0.2/src/lib/loadlib.c
+lua-5.0.2/src/lib/lstrlib.c
+lua-5.0.2/src/lib/ltablib.c
+lua-5.0.2/src/llex.c
+lua-5.0.2/src/llex.h
+lua-5.0.2/src/llimits.h
+lua-5.0.2/src/lmem.c
+lua-5.0.2/src/lmem.h
+lua-5.0.2/src/lobject.c
+lua-5.0.2/src/lobject.h
+lua-5.0.2/src/lopcodes.c
+lua-5.0.2/src/lopcodes.h
+lua-5.0.2/src/lparser.c
+lua-5.0.2/src/lparser.h
+lua-5.0.2/src/lstate.c
+lua-5.0.2/src/lstate.h
+lua-5.0.2/src/lstring.c
+lua-5.0.2/src/lstring.h
+lua-5.0.2/src/ltable.c
+lua-5.0.2/src/ltable.h
+lua-5.0.2/src/ltests.c
+lua-5.0.2/src/ltm.c
+lua-5.0.2/src/ltm.h
+lua-5.0.2/src/lua
+lua-5.0.2/src/lua/Makefile
+lua-5.0.2/src/lua/README
+lua-5.0.2/src/lua/lua.c
+lua-5.0.2/src/luac
+lua-5.0.2/src/luac/Makefile
+lua-5.0.2/src/luac/README
+lua-5.0.2/src/luac/luac.c
+lua-5.0.2/src/luac/print.c
+lua-5.0.2/src/lundump.c
+lua-5.0.2/src/lundump.h
+lua-5.0.2/src/lvm.c
+lua-5.0.2/src/lvm.h
+lua-5.0.2/src/lzio.c
+lua-5.0.2/src/lzio.h
+lua-5.0.2/test
+lua-5.0.2/test/README
+lua-5.0.2/test/bisect.lua
+lua-5.0.2/test/cf.lua
+lua-5.0.2/test/echo.lua
+lua-5.0.2/test/env.lua
+lua-5.0.2/test/factorial.lua
+lua-5.0.2/test/fib.lua
+lua-5.0.2/test/fibfor.lua
+lua-5.0.2/test/globals.lua
+lua-5.0.2/test/hello.lua
+lua-5.0.2/test/life.lua
+lua-5.0.2/test/lua
+lua-5.0.2/test/luac
+lua-5.0.2/test/luac.lua
+lua-5.0.2/test/printf.lua
+lua-5.0.2/test/readonly.lua
+lua-5.0.2/test/sieve.lua
+lua-5.0.2/test/sort.lua
+lua-5.0.2/test/table.lua
+lua-5.0.2/test/trace-calls.lua
+lua-5.0.2/test/trace-globals.lua
+lua-5.0.2/test/undefined.lua
+lua-5.0.2/test/xd.lua
+END OF MANIFEST
--- /dev/null
+# makefile for Lua hierarchy
+# see INSTALL for installation instructions
+# see config for customization instructions
+
+LUA= .
+
+include $(LUA)/config
+
+# primary targets ("co" and "klean" are used for making the distribution)
+all clean co klean: dirs
+ cd include; $(MAKE) $@
+ cd src; $(MAKE) $@
+ cd src/lib; $(MAKE) $@
+ cd src/luac; $(MAKE) $@
+ cd src/lua; $(MAKE) $@
+
+# in case they were not created during unpacking
+dirs: bin lib
+
+bin lib:
+ mkdir -p $@
+
+# simple test to see Lua working
+test: all
+ bin/lua test/hello.lua
+
+# remove debug information from binaries
+strip:
+ $(STRIP) bin/*
+
+# official installation
+install: all strip
+ mkdir -p $(INSTALL_BIN) $(INSTALL_INC) $(INSTALL_LIB) $(INSTALL_MAN)
+ $(INSTALL_EXEC) bin/* $(INSTALL_BIN)
+ $(INSTALL_DATA) include/*.h $(INSTALL_INC)
+ $(INSTALL_DATA) lib/*.a $(INSTALL_LIB)
+ $(INSTALL_DATA) doc/*.1 $(INSTALL_MAN)
+
+# shared libraries (for Linux)
+so:
+ ld -o lib/liblua.so.$V -shared src/*.o
+ ld -o lib/liblualib.so.$V -shared src/lib/*.o
+ cd lib; ln -fs liblua.so.$V liblua.so; ln -fs liblualib.so.$V liblualib.so
+
+# binaries using shared libraries
+sobin:
+ rm -f bin/*
+ cd src/lua; $(MAKE)
+ cd src/luac; $(MAKE)
+
+# install shared libraries
+soinstall:
+ $(INSTALL_EXEC) lib/*.so.* $(INSTALL_LIB)
+ cd $(INSTALL_LIB); ln -fs liblua.so.$V liblua.so; ln -fs liblualib.so.$V liblualib.so
+
+# clean shared libraries
+soclean:
+ rm -f lib/*.so* bin/*
+
+# echo config parameters
+echo:
+ @echo ""
+ @echo "These are the parameters currently set in $(LUA)/config to build Lua $V:"
+ @echo ""
+ @echo "LOADLIB = $(LOADLIB)"
+ @echo "DLLIB = $(DLLIB)"
+ @echo "NUMBER = $(NUMBER)"
+ @echo "POPEN = $(POPEN)"
+ @echo "TMPNAM = $(TMPNAM)"
+ @echo "DEGREES = $(DEGREES)"
+ @echo "USERCONF = $(USERCONF)"
+ @echo "CC = $(CC)"
+ @echo "WARN = $(WARN)"
+ @echo "MYCFLAGS = $(MYCFLAGS)"
+ @echo "MYLDFLAGS = $(MYLDFLAGS)"
+ @echo "EXTRA_LIBS = $(EXTRA_LIBS)"
+ @echo "AR = $(AR)"
+ @echo "RANLIB = $(RANLIB)"
+ @echo "STRIP = $(STRIP)"
+ @echo "INSTALL_ROOT = $(INSTALL_ROOT)"
+ @echo "INSTALL_BIN = $(INSTALL_BIN)"
+ @echo "INSTALL_INC = $(INSTALL_INC)"
+ @echo "INSTALL_LIB = $(INSTALL_LIB)"
+ @echo "INSTALL_MAN = $(INSTALL_MAN)"
+ @echo "INSTALL_EXEC = $(INSTALL_EXEC)"
+ @echo "INSTALL_DATA = $(INSTALL_DATA)"
+ @echo ""
+ @echo "Edit $(LUA)/config if needed to suit your platform and then run make."
+ @echo ""
+
+# turn config into Lua code
+# uncomment the last sed expression if you want nil instead of empty strings
+lecho:
+ @echo "-- $(LUA)/config for Lua $V"
+ @echo "VERSION = '$(V)'"
+ @make echo | grep = | sed -e 's/= /= "/' -e 's/$$/"/' #-e 's/""/nil/'
+ @echo "-- EOF"
+
+newer:
+ @find . -newer MANIFEST -type f
+
+# (end of Makefile)
--- /dev/null
+This is Lua 5.0.
+See HISTORY for a summary of changes since the last released version.
+
+* What is Lua?
+ ------------
+ Lua is a powerful, light-weight programming language designed for extending
+ applications. Lua is also frequently used as a general-purpose, stand-alone
+ language. Lua is free software.
+
+ For complete information, visit Lua's web site at http://www.lua.org/ .
+ For an executive summary, see http://www.lua.org/about.html .
+
+ Lua has been used in many different projects around the world.
+ For a short list, see http://www.lua.org/uses.html .
+
+* Availability
+ ------------
+ Lua is freely available for both academic and commercial purposes.
+ See COPYRIGHT and http://www.lua.org/license.html for details.
+ Lua can be downloaded from its official site http://www.lua.org/ and
+ several other sites aroung the world. For a complete list of mirror sites,
+ see http://www.lua.org/mirrors.html .
+
+* Installation
+ ------------
+ Lua is implemented in pure ANSI C, and compiles unmodified in all known
+ platforms that have an ANSI C compiler. Under Unix, simply typing "make"
+ should work. See INSTALL for detailed instructions.
+
+* Contacting the authors
+ ----------------------
+ Send your comments, questions, and bug reports to lua@tecgraf.puc-rio.br.
+ For more information about the authors, see http://www.lua.org/authors.html .
+ For reporting bugs, try also the mailing list: lua-l@tecgraf.puc-rio.br.
+ For more information about this list, including instructions on how to
+ subscribe and access the archives, see http://www.lua.org/lua-l.html .
+
+* Origin
+ ------
+ Lua is developed at Tecgraf, the Computer Graphics Technology Group
+ of PUC-Rio (the Pontifical Catholic University of Rio de Janeiro in Brazil).
+ Tecgraf is a laboratory of the Department of Computer Science.
+
+(end of README)
--- /dev/null
+This is Lua 5.0.2, an update of Lua 5.0 that includes the following changes,
+which fix all known bugs in Lua 5.0. For the exact differences, see DIFFS.
+
+src/ldo.c
+ Attempt to resume running coroutine crashed Lua
+src/lgc.c
+ C functions also may have stacks larger than current top
+ Userdata to be collected still counted into new GC threshold
+src/lgc.h
+ Userdata to be collected still counted into new GC threshold
+src/lparser.c
+ Syntax `local function' did not increment stack size
+src/lvm.c
+ `pc' address was invalidated when a coroutine was suspended
+ Count hook might be called without being set
+src/lib/lbaselib.c
+ Buffer overflow for unusual %p representation
+ Wrong number of returns from chunks loaded from stdin
+src/lib/liolib.c
+ `file.close()' could not be called without arguments
+ Buffer overflow for unusual %p representation
+src/luac/luac.c
+ Missing lock/unlock
--- /dev/null
+# If you don't want to use make, run this script.
+# But make sure you read config to see what can be customized.
+
+
+# Easiest way to build bin/lua:
+# cc -O2 -o bin/lua -Iinclude -Isrc src/*.c src/lib/*.c src/lua/*.c -lm -ldl
+
+
+# Easiest way to build Lua libraries and executables:
+echo -n 'building core library... '
+cd src
+cc -O2 -c -I../include *.c
+ar rc ../lib/liblua.a *.o
+rm -f *.o
+
+echo -n 'standard library... '
+cd lib
+cc -O2 -c -I../../include *.c
+ar rc ../../lib/liblualib.a *.o
+rm -f *.o
+
+echo -n 'lua... '
+cd ../lua
+cc -O2 -o ../../bin/lua -I../../include *.c ../../lib/*.a -lm -ldl
+
+echo -n 'luac... '
+cd ../luac
+cc -O2 -o ../../bin/luac -I../../include -I.. *.c -DLUA_OPNAMES ../lopcodes.c ../../lib/*.a
+
+echo 'done'
+
+cd ../..
+bin/lua test/hello.lua
--- /dev/null
+# configuration file for making Lua 5.0
+# see INSTALL for installation instructions
+
+# These are default values. Skip this section and see the explanations below.
+
+LOADLIB=
+DLLIB=
+NUMBER=
+POPEN=
+TMPNAM=
+DEGREES=
+USERCONF=
+
+# == CHANGE THE SETTINGS BELOW TO SUIT YOUR ENVIRONMENT =======================
+
+# --------------------------------------------------------------- Lua libraries
+
+# Support for dynamically loading C libraries for Lua is a very important
+# feature, which we strongly recommend be enabled. By default, this support is
+# enabled on Windows systems (see below) but disabled on other systems because
+# it relies on system-dependent code that is not part of ANSI C. For more
+# information on dynamic loading, read the comments in src/lib/liolib.c .
+#
+# To enable support for dynamic loading on Unix systems that support the dlfcn
+# interface (e.g., Linux, Solaris, IRIX, BSD, AIX, HPUX, and probably others),
+# uncomment the next two lines.
+#
+#LOADLIB= -DUSE_DLOPEN=1
+#DLLIB= -ldl
+#
+# In Linux with gcc, you should also uncomment the next definition for
+# MYLDFLAGS, which passes -E (= -export-dynamic) to the linker. This option
+# allows dynamic libraries to link back to the `lua' program, so that they do
+# not need the Lua libraries. (Other systems may have an equivalent facility.)
+#
+#MYLDFLAGS= -Wl,-E
+#
+# On Windows systems. support for dynamic loading is enabled by default.
+# To disable this support, uncomment the next line.
+#
+#LOADLIB= -DUSE_DLL=0
+
+# The Lua IO library (src/lib/liolib.c) has support for pipes using popen and
+# pclose. This support is enabled by default on POSIX systems.
+# If your system is not POSIX but has popen and pclose, define USE_POPEN=1.
+# If you don't want to support pipes, define USE_POPEN=0.
+#
+#POPEN= -DUSE_POPEN=1
+#POPEN= -DUSE_POPEN=0
+#
+# The form below will probably work in (some) Windows systems.
+#
+#POPEN= -DUSE_POPEN=1 -Dpopen=_popen -Dpclose=_pclose
+
+# The Lua OS library (src/lib/liolib.c) exports an interface to the C function
+# tmpnam, which gcc now thinks is `dangerous'. So, support for tmpnam is
+# disabled by default when compiling with gcc.
+# If you still want to use tmpnam, define USE_TMPNAME=1. If you don't want to
+# use tmpnam even if you're not compiling with gcc, define USE_TMPNAME=0.
+#
+#TMPNAM= -DUSE_TMPNAME=1
+#TMPNAM= -DUSE_TMPNAME=0
+
+# The Lua math library (src/lib/lmathlib.c) now operates in radians, unlike
+# previous versions of Lua, which used degrees. To use degrees instead of
+# radians, define USE_DEGREES.
+#
+#DEGREES= -DUSE_DEGREES
+
+# ------------------------------------------------------------------ Lua core
+
+# Lua uses double for numbers. To change this, uncomment and edit the following
+# line, changing USE_XXX to one of USE_DOUBLE, USE_FLOAT, USE_LONG, USE_INT.
+#
+#NUMBER= -DLUA_USER_H='"../etc/luser_number.h"' -DUSE_XXX
+
+# When compiling Lua with gcc on a Pentium machine, using a fast rounding
+# method for the conversion of doubles to ints can give around 20% speed
+# improvement. To use this rounding method, uncomment the following line.
+#NUMBER= -DLUA_USER_H='"../etc/luser_number.h"' -DUSE_FASTROUND
+
+# For partial compatibility with old upvalue syntax, define LUA_COMPATUPSYNTAX.
+# For partial compatibility with old upvalue behavior in C functions, define
+# LUA_COMPATUPVALUES. Add these definitions to MYCFLAGS.
+#
+# -DLUA_COMPATUPSYNTAX -DLUA_COMPATUPVALUES
+
+# ------------------------------------------------------------- Lua interpreter
+
+# The stand-alone Lua interpreter needs the math functions, which are usually
+# in libm.a (-lm). If your C library already includes the math functions,
+# or if you are using a modified interpreter that does not need them,
+# then comment the following line or add the appropriates libraries.
+#
+EXTRA_LIBS= -lm
+
+# If you want to customize the stand-alone Lua interpreter, uncomment and
+# edit the following two lines; also edit etc/saconfig.c to suit your needs.
+# -DUSE_READLINE adds line editing and history to the interpreter. You need
+# to add -lreadline (and perhaps also -lhistory and -lcurses or -lncurses)
+# to EXTRA_LIBS.
+#
+#USERCONF=-DLUA_USERCONFIG='"$(LUA)/etc/saconfig.c"' -DUSE_READLINE
+#EXTRA_LIBS= -lm -ldl -lreadline # -lhistory -lcurses -lncurses
+
+# ------------------------------------------------------------------ C compiler
+
+# You need an ANSI C compiler. gcc is a popular one. We do not use -ansi in
+# WARN because it disables POSIX features used in the libraries.
+#
+CC= gcc
+WARN= -Wall
+
+# ------------------------------------------------------------------ C options
+
+# Write here any options you may need for your C compiler.
+# If you are using gcc, -O3 will get you a faster but larger code. You can
+# also add -fomit-frame-pointer to get even faster code at the cost of losing
+# debug information. If you only want the shared libraries, you may want to
+# add -fPIC to MYCFLAGS.
+#
+MYCFLAGS= -O2
+#MYCFLAGS= -O3 -fomit-frame-pointer # -fPIC
+
+# Write here any options you may need for your C linker.
+#MYLDFLAGS=
+
+# ------------------------------------------------------------------ librarian
+
+# This should work in all Unix systems.
+#
+AR= ar rcu
+
+# If your system doesn't have (or need) ranlib, use RANLIB=true.
+# On some systems, "ar s" does what ranlib would do.
+#
+RANLIB= ranlib
+#RANLIB= ar s
+#RANLIB= true
+
+# ------------------------------------------------------------------ stripper
+
+# This should work in all Unix systems, but you may want to add options.
+#
+STRIP= strip
+
+# ------------------------------------------------------------------ install
+
+# Locations for "make install". You may need to be root do "make install".
+#
+INSTALL_ROOT= /usr/local
+INSTALL_BIN= $(INSTALL_ROOT)/bin
+INSTALL_INC= $(INSTALL_ROOT)/include
+INSTALL_LIB= $(INSTALL_ROOT)/lib
+INSTALL_MAN= $(INSTALL_ROOT)/man/man1
+
+# You may prefer to use "install" instead of "cp" if you have it.
+# If you use "install", you may also want to change the permissions after -m.
+#
+INSTALL_EXEC= cp
+INSTALL_DATA= cp
+#INSTALL_EXEC= install -m 0755
+#INSTALL_DATA= install -m 0644
+
+# == END OF USER SETTINGS. NO NEED TO CHANGE ANYTHING BELOW THIS LINE =========
+
+V=5.0
+
+BIN= $(LUA)/bin
+INC= $(LUA)/include
+LIB= $(LUA)/lib
+
+INCS= -I$(INC) $(EXTRA_INCS)
+DEFS= $(NUMBER) $(EXTRA_DEFS)
+
+CFLAGS= $(MYCFLAGS) $(WARN) $(INCS) $(DEFS)
+
+# (end of config)
--- /dev/null
+#!/bin/sh
+
+# Lua does not use GNU autoconf; just edit ./config if needed to suit your
+# platform and then run make.
+
+# This shows the parameters currently set in ./config:
+make echo
+
+# If you want config as a Lua program, run "make lecho".
--- /dev/null
+<HTML>
+<HEAD>
+<TITLE>Lua: 5.0 reference manual - contents</TITLE>
+</HEAD>
+
+<BODY BGCOLOR="#FFFFFF">
+
+<HR>
+<H1>
+<A HREF="http://www.lua.org/home.html"><IMG SRC="logo.gif" ALT="Lua" BORDER=0></A>
+Reference manual for Lua 5.0
+</H1>
+
+<A HREF="manual.html">Lua 5.0 Reference Manual</A>
+[
+<A HREF="manual.html">top</A>
+|
+<A HREF="http://www.lua.org/ftp/refman-5.0.ps.gz">ps</A>
+|
+<A HREF="http://www.lua.org/ftp/refman-5.0.pdf">pdf</A>
+]
+<P>
+
+<SMALL>
+<A HREF="http://www.lua.org/copyright.html">Copyright</A>
+© 2003 Tecgraf, PUC-Rio. All rights reserved.</SMALL>
+<HR>
+
+<UL>
+<LI><A HREF="manual.html#1">1 - Introduction</A>
+<LI><A HREF="manual.html#2">2 - The Language</A>
+<UL>
+<LI><A HREF="manual.html#2.1">2.1 - Lexical Conventions</A>
+<LI><A HREF="manual.html#2.2">2.2 - Values and Types</A>
+<UL>
+<LI><A HREF="manual.html#2.2.1">2.2.1 - Coercion</A>
+</UL>
+<LI><A HREF="manual.html#2.3">2.3 - Variables</A>
+<LI><A HREF="manual.html#2.4">2.4 - Statements</A>
+<UL>
+<LI><A HREF="manual.html#2.4.1">2.4.1 - Chunks</A>
+<LI><A HREF="manual.html#2.4.2">2.4.2 - Blocks</A>
+<LI><A HREF="manual.html#2.4.3">2.4.3 - Assignment</A>
+<LI><A HREF="manual.html#2.4.4">2.4.4 - Control Structures</A>
+<LI><A HREF="manual.html#2.4.5">2.4.5 - For Statement</A>
+<LI><A HREF="manual.html#2.4.6">2.4.6 - Function Calls as Statements</A>
+<LI><A HREF="manual.html#2.4.7">2.4.7 - Local Declarations</A>
+</UL>
+<LI><A HREF="manual.html#2.5">2.5 - Expressions</A>
+<UL>
+<LI><A HREF="manual.html#2.5.1">2.5.1 - Arithmetic Operators</A>
+<LI><A HREF="manual.html#2.5.2">2.5.2 - Relational Operators</A>
+<LI><A HREF="manual.html#2.5.3">2.5.3 - Logical Operators</A>
+<LI><A HREF="manual.html#2.5.4">2.5.4 - Concatenation</A>
+<LI><A HREF="manual.html#2.5.5">2.5.5 - Precedence</A>
+<LI><A HREF="manual.html#2.5.6">2.5.6 - Table Constructors</A>
+<LI><A HREF="manual.html#2.5.7">2.5.7 - Function Calls</A>
+<LI><A HREF="manual.html#2.5.8">2.5.8 - Function Definitions</A>
+</UL>
+</UL>
+<UL>
+<LI><A HREF="manual.html#2.6">2.6 - Visibility Rules</A>
+<LI><A HREF="manual.html#2.7">2.7 - Error Handling</A>
+<LI><A HREF="manual.html#2.8">2.8 - Metatables</A>
+<LI><A HREF="manual.html#2.9">2.9 - Garbage Collection</A>
+<UL>
+<LI><A HREF="manual.html#2.9.1">2.9.1 - Garbage-Collection Metamethods</A>
+<LI><A HREF="manual.html#2.9.2">2.9.2 - Weak Tables</A>
+</UL>
+<LI><A HREF="manual.html#2.10">2.10 - Coroutines</A>
+</UL>
+<LI><A HREF="manual.html#3">3 - The Application Program Interface</A>
+<UL>
+<LI><A HREF="manual.html#3.1">3.1 - States</A>
+<LI><A HREF="manual.html#3.2">3.2 - The Stack and Indices</A>
+<LI><A HREF="manual.html#3.3">3.3 - Stack Manipulation</A>
+<LI><A HREF="manual.html#3.4">3.4 - Querying the Stack</A>
+<LI><A HREF="manual.html#3.5">3.5 - Getting Values from the Stack</A>
+<LI><A HREF="manual.html#3.6">3.6 - Pushing Values onto the Stack</A>
+<LI><A HREF="manual.html#3.7">3.7 - Controlling Garbage Collection</A>
+<LI><A HREF="manual.html#3.8">3.8 - Userdata</A>
+<LI><A HREF="manual.html#3.9">3.9 - Metatables</A>
+<LI><A HREF="manual.html#3.10">3.10 - Loading Lua Chunks</A>
+<LI><A HREF="manual.html#3.11">3.11 - Manipulating Tables</A>
+<LI><A HREF="manual.html#3.12">3.12 - Manipulating Environments</A>
+<LI><A HREF="manual.html#3.13">3.13 - Using Tables as Arrays</A>
+<LI><A HREF="manual.html#3.14">3.14 - Calling Functions</A>
+<LI><A HREF="manual.html#3.15">3.15 - Protected Calls</A>
+<LI><A HREF="manual.html#3.16">3.16 - Defining C Functions</A>
+<LI><A HREF="manual.html#3.17">3.17 - Defining C Closures</A>
+<LI><A HREF="manual.html#3.18">3.18 - Registry</A>
+<LI><A HREF="manual.html#3.19">3.19 - Error Handling in C</A>
+<LI><A HREF="manual.html#3.20">3.20 - Threads</A>
+</UL>
+<LI><A HREF="manual.html#4">4 - The Debug Interface</A>
+<UL>
+<LI><A HREF="manual.html#4.1">4.1 - Stack and Function Information</A>
+<LI><A HREF="manual.html#4.2">4.2 - Manipulating Local Variables and Upvalues</A>
+<LI><A HREF="manual.html#4.3">4.3 - Hooks</A>
+</UL>
+<LI><A HREF="manual.html#5">5 - Standard Libraries</A>
+<UL>
+<LI><A HREF="manual.html#5.1">5.1 - Basic Functions</A>
+<LI><A HREF="manual.html#5.2">5.2 - Coroutine Manipulation</A>
+<LI><A HREF="manual.html#5.3">5.3 - String Manipulation</A>
+<LI><A HREF="manual.html#5.4">5.4 - Table Manipulation</A>
+<LI><A HREF="manual.html#5.5">5.5 - Mathematical Functions</A>
+<LI><A HREF="manual.html#5.6">5.6 - Input and Output Facilities</A>
+<LI><A HREF="manual.html#5.7">5.7 - Operating System Facilities</A>
+<LI><A HREF="manual.html#5.8">5.8 - The Reflexive Debug Interface</A>
+</UL>
+<LI><A HREF="manual.html#6">6 - Lua Stand-alone</A>
+<LI><A HREF="manual.html#BNF">The Complete Syntax of Lua</A>
+</UL>
+
+<HR>
+<SMALL>
+Last update:
+Wed May 7 18:34:34 EST 2003
+</SMALL>
+
+</BODY>
+</HTML>
--- /dev/null
+.\" lua.man,v 1.8 2003/04/02 00:05:20 lhf Exp
+.TH LUA 1 "2003/04/02 00:05:20"
+.SH NAME
+lua \- Lua interpreter
+.SH SYNOPSIS
+.B lua
+[
+.I options
+]
+[
+.I script
+[
+.I args
+]
+]
+.SH DESCRIPTION
+.B lua
+is the stand-alone Lua interpreter.
+It loads and executes Lua programs,
+either in textual source form or
+in precompiled binary form.
+(Precompiled binaries are output by
+.BR luac ,
+the Lua compiler.)
+.B lua
+can be used as a batch interpreter and also interactively.
+.LP
+The given
+.I options
+(see below)
+are executed and then
+the Lua program in file
+.I script
+is loaded and executed.
+The given
+.I args
+are available to
+.I script
+as strings in a global table named
+.BR arg .
+If these arguments contain spaces or other characters special to the shell,
+then they should be quoted
+(but note that the quotes will be removed by the shell).
+The arguments in
+.B arg
+start at 0,
+which contains the string
+.RI ` script '.
+The index of the last argument is stored in
+.BR "arg.n" .
+The arguments given in the command line before
+.IR script ,
+including the name of the interpreter,
+are available in negative indices in
+.BR arg .
+.LP
+At the very start,
+before even handling the command line,
+.B lua
+executes the contents of the environment variable
+.BR LUA_INIT ,
+if it is defined.
+If the value of
+.B LUA_INIT
+is of the form
+.RI `@ filename ',
+then
+.I filename
+is executed.
+Otherwise, the string is assumed to be a Lua statement and is executed.
+.LP
+Options start with
+.B \-
+and are described below.
+You can use
+.B "\--"
+to signal the end of options.
+.LP
+If no arguments are given,
+then
+.B "\-v \-i"
+is assumed when the standard input is a terminal;
+otherwise,
+.B "\-"
+is assumed.
+.LP
+In interactive mode,
+.B lua
+prompts the user,
+reads lines from the standard input,
+and executes them as they are read.
+If a line does not contain a complete statement,
+then a secondary prompt is displayed and
+lines are read until a complete statement is formed or
+a syntax error is found.
+So, one way to interrupt the reading of an incomplete statement is
+to force a syntax error:
+adding a
+.B `;'
+in the middle of a statement is a sure way of forcing a syntax error
+(except inside multiline strings and comments; these must be closed explicitly).
+If a line starts with
+.BR `=' ,
+then
+.B lua
+displays the values of all the expressions in the remainder of the
+line. The expressions must be separated by commas.
+The primary prompt is the value of the global variable
+.BR _PROMPT ,
+if this value is a string;
+otherwise, the default prompt is used.
+Similarly, the secondary prompt is the value of the global variable
+.BR _PROMPT2 .
+So,
+to change the prompts,
+set the corresponding variable to a string of your choice.
+You can do that after calling the interpreter
+or on the command line with
+.BR "_PROMPT" "=\'lua: \'" ,
+for example.
+(Note the need for quotes, because the string contains a space.)
+The default prompts are ``> '' and ``>> ''.
+.SH OPTIONS
+.TP
+.B \-
+load and execute the standard input as a file,
+that is,
+not interactively,
+even when the standard input is a terminal.
+.TP
+.BI \-e " stat"
+execute statement
+.IR stat .
+You need to quote
+.I stat
+if it contains spaces, quotes,
+or other characters special to the shell.
+.TP
+.B \-i
+enter interactive mode after
+.I script
+is executed.
+.TP
+.BI \-l " file"
+call
+.BI require( file )
+before executing
+.IR script.
+Typically used to load libraries
+(hence the letter
+.IR l ).
+.TP
+.B \-v
+show version information.
+.SH "SEE ALSO"
+.BR luac (1)
+.br
+http://www.lua.org/
+.SH DIAGNOSTICS
+Error messages should be self explanatory.
+.SH AUTHORS
+R. Ierusalimschy,
+L. H. de Figueiredo,
+and
+W. Celes
+(lua@tecgraf.puc-rio.br)
+.\" EOF
--- /dev/null
+<!-- lua.man,v 1.8 2003/04/02 00:05:20 lhf Exp -->
+<HTML>
+<HEAD>
+<TITLE>LUA man page</TITLE>
+</HEAD>
+
+<BODY BGCOLOR="#FFFFFF">
+
+<H1>NAME</H1>
+lua - Lua interpreter
+<H1>SYNOPSIS</H1>
+<B>lua</B>
+[
+<I>options</I>
+]
+[
+<I>script</I>
+[
+<I>args</I>
+]
+]
+<H1>DESCRIPTION</H1>
+<B>lua</B>
+is the stand-alone Lua interpreter.
+It loads and executes Lua programs,
+either in textual source form or
+in precompiled binary form.
+(Precompiled binaries are output by
+<B>luac</B>,
+the Lua compiler.)
+<B>lua</B>
+can be used as a batch interpreter and also interactively.
+<P>
+The given
+<I>options</I>
+(see below)
+are executed and then
+the Lua program in file
+<I>script</I>
+is loaded and executed.
+The given
+<I>args</I>
+are available to
+<I>script</I>
+as strings in a global table named
+<B>arg</B>.
+If these arguments contain spaces or other characters special to the shell,
+then they should be quoted
+(but note that the quotes will be removed by the shell).
+The arguments in
+<B>arg</B>
+start at 0,
+which contains the string
+`<I>script</I>'.
+The index of the last argument is stored in
+<B>"arg.n"</B>.
+The arguments given in the command line before
+<I>script</I>,
+including the name of the interpreter,
+are available in negative indices in
+<B>arg</B>.
+<P>
+At the very start,
+before even handling the command line,
+<B>lua</B>
+executes the contents of the environment variable
+<B>LUA_INIT</B>,
+if it is defined.
+If the value of
+<B>LUA_INIT</B>
+is of the form
+`@<I>filename</I>',
+then
+<I>filename</I>
+is executed.
+Otherwise, the string is assumed to be a Lua statement and is executed.
+<P>
+Options start with
+<B>-</B>
+and are described below.
+You can use
+<B>"--"</B>
+to signal the end of options.
+<P>
+If no arguments are given,
+then
+<B>"-v -i"</B>
+is assumed when the standard input is a terminal;
+otherwise,
+<B>"-"</B>
+is assumed.
+<P>
+In interactive mode,
+<B>lua</B>
+prompts the user,
+reads lines from the standard input,
+and executes them as they are read.
+If a line does not contain a complete statement,
+then a secondary prompt is displayed and
+lines are read until a complete statement is formed or
+a syntax error is found.
+So, one way to interrupt the reading of an incomplete statement is
+to force a syntax error:
+adding a
+<B>`;' </B>
+in the middle of a statement is a sure way of forcing a syntax error
+(except inside multiline strings and comments; these must be closed explicitly).
+If a line starts with
+<B>`='</B>,
+then
+<B>lua</B>
+displays the values of all the expressions in the remainder of the
+line. The expressions must be separated by commas.
+The primary prompt is the value of the global variable
+<B>_PROMPT</B>,
+if this value is a string;
+otherwise, the default prompt is used.
+Similarly, the secondary prompt is the value of the global variable
+<B>_PROMPT2</B>.
+So,
+to change the prompts,
+set the corresponding variable to a string of your choice.
+You can do that after calling the interpreter
+or on the command line with
+<B>"_PROMPT" "=\'lua: \'"</B>,
+for example.
+(Note the need for quotes, because the string contains a space.)
+The default prompts are ``> '' and ``>> ''.
+<H1>OPTIONS</H1>
+<P>
+<B>-</B>
+load and execute the standard input as a file,
+that is,
+not interactively,
+even when the standard input is a terminal.
+<P>
+<B>-e "</B><I>stat"</I>
+execute statement
+<I>stat</I>.
+You need to quote
+<I>stat </I>
+if it contains spaces, quotes,
+or other characters special to the shell.
+<P>
+<B>-i</B>
+enter interactive mode after
+<I>script</I>
+is executed.
+<P>
+<B>-l "</B><I>file"</I>
+call
+<B>require( file</B><I>)</I>
+before executing
+<I></I>script.
+Typically used to load libraries
+(hence the letter
+<I>l</I>).
+<P>
+<B>-v</B>
+show version information.
+<H1>SEE ALSO</H1>
+<B>luac</B>(1)
+<BR>
+<A HREF="http://www.lua.org/">http://www.lua.org/</A>
+<H1>DIAGNOSTICS</H1>
+Error messages should be self explanatory.
+<H1>AUTHORS</H1>
+R. Ierusalimschy,
+L. H. de Figueiredo,
+and
+W. Celes
+(<A HREF="mailto:lua-NO-SPAM-THANKS@tecgraf.puc-rio.br">lua AT tecgraf.puc-rio.br</A>)
+<!-- EOF -->
+</BODY>
+</HTML>
--- /dev/null
+.\" luac.man,v 1.25 2002/12/13 11:45:12 lhf Exp
+.TH LUAC 1 "2002/12/13 11:45:12"
+.SH NAME
+luac \- Lua compiler
+.SH SYNOPSIS
+.B luac
+[
+.I options
+] [
+.I filenames
+]
+.SH DESCRIPTION
+.B luac
+is the Lua compiler.
+It translates programs written in the Lua programming language
+into binary files that can be latter loaded and executed.
+.LP
+The main advantages of precompiling chunks are:
+faster loading,
+protecting source code from user changes,
+and
+off-line syntax checking.
+.LP
+Pre-compiling does not imply faster execution
+because in Lua chunks are always compiled into bytecodes before being executed.
+.B luac
+simply allows those bytecodes to be saved in a file for later execution.
+.LP
+.B luac
+produces a single output file containing the bytecodes
+for all source files given.
+By default,
+the output file is named
+.BR luac.out ,
+but you can change this with the
+.B \-o
+option.
+.LP
+The binary files created by
+.B luac
+are portable to all architectures with the same word size.
+This means that
+binary files created on a 32-bit platform (such as Intel)
+can be read without change in another 32-bit platform (such as Sparc),
+even if the byte order (``endianness'') is different.
+On the other hand,
+binary files created on a 16-bit platform cannot be read in a 32-bit platform,
+nor vice-versa.
+.LP
+In the command line,
+you can mix
+text files containing Lua source and
+binary files containing precompiled chunks.
+This is useful to combine several precompiled chunks,
+even from different (but compatible) platforms,
+into a single precompiled chunk.
+.LP
+You can use
+.B "\-"
+to indicate the standard input as a source file
+and
+.B "\--"
+to signal the end of options
+(that is,
+all remaining arguments will be treated as files even if they start with
+.BR "\-" ).
+.LP
+The internal format of the binary files produced by
+.B luac
+is likely to change when a new version of Lua is released.
+So,
+save the source files of all Lua programs that you precompile.
+.LP
+.SH OPTIONS
+Options must be separate.
+.TP
+.B \-l
+produce a listing of the compiled bytecode for Lua's virtual machine.
+Listing bytecodes is useful to learn about Lua's virtual machine.
+If no files are given, then
+.B luac
+loads
+.B luac.out
+and lists its contents.
+.TP
+.BI \-o " file"
+output to
+.IR file ,
+instead of the default
+.BR luac.out .
+The output file may be a source file because
+all files are loaded before the output file is written.
+Be careful not to overwrite precious files.
+.TP
+.B \-p
+load files but do not generate any output file.
+Used mainly for syntax checking and for testing precompiled chunks:
+corrupted files will probably generate errors when loaded.
+Lua always performs a thorough integrity test on precompiled chunks.
+Bytecode that passes this test is completely safe,
+in the sense that it will not break the interpreter.
+However,
+there is no guarantee that such code does anything sensible.
+(None can be given, because the halting problem is unsolvable.)
+If no files are given, then
+.B luac
+loads
+.B luac.out
+and tests its contents.
+No messages are displayed if the file passes the integrity test.
+.TP
+.B \-s
+strip debug information before writing the output file.
+This saves some space in very large chunks,
+but if errors occur when running these chunks,
+then the error messages may not contain the full information they usually do
+(line numbers and names of locals are lost).
+.TP
+.B \-v
+show version information.
+.SH FILES
+.TP 15
+.B luac.out
+default output file
+.SH "SEE ALSO"
+.BR lua (1)
+.br
+http://www.lua.org/
+.SH DIAGNOSTICS
+Error messages should be self explanatory.
+.SH AUTHORS
+L. H. de Figueiredo,
+R. Ierusalimschy and
+W. Celes
+(lua@tecgraf.puc-rio.br)
+.\" EOF
--- /dev/null
+<!-- luac.man,v 1.25 2002/12/13 11:45:12 lhf Exp -->
+<HTML>
+<HEAD>
+<TITLE>LUAC man page</TITLE>
+</HEAD>
+
+<BODY BGCOLOR="#FFFFFF">
+
+<H1>NAME</H1>
+luac - Lua compiler
+<H1>SYNOPSIS</H1>
+<B>luac</B>
+[
+<I>options</I>
+] [
+<I>filenames</I>
+]
+<H1>DESCRIPTION</H1>
+<B>luac</B>
+is the Lua compiler.
+It translates programs written in the Lua programming language
+into binary files that can be latter loaded and executed.
+<P>
+The main advantages of precompiling chunks are:
+faster loading,
+protecting source code from user changes,
+and
+off-line syntax checking.
+<P>
+Pre-compiling does not imply faster execution
+because in Lua chunks are always compiled into bytecodes before being executed.
+<B>luac</B>
+simply allows those bytecodes to be saved in a file for later execution.
+<P>
+<B>luac</B>
+produces a single output file containing the bytecodes
+for all source files given.
+By default,
+the output file is named
+<B>luac.out</B>,
+but you can change this with the
+<B>-o</B>
+option.
+<P>
+The binary files created by
+<B>luac</B>
+are portable to all architectures with the same word size.
+This means that
+binary files created on a 32-bit platform (such as Intel)
+can be read without change in another 32-bit platform (such as Sparc),
+even if the byte order (``endianness'') is different.
+On the other hand,
+binary files created on a 16-bit platform cannot be read in a 32-bit platform,
+nor vice-versa.
+<P>
+In the command line,
+you can mix
+text files containing Lua source and
+binary files containing precompiled chunks.
+This is useful to combine several precompiled chunks,
+even from different (but compatible) platforms,
+into a single precompiled chunk.
+<P>
+You can use
+<B>"-"</B>
+to indicate the standard input as a source file
+and
+<B>"--"</B>
+to signal the end of options
+(that is,
+all remaining arguments will be treated as files even if they start with
+<B>"-"</B>).
+<P>
+The internal format of the binary files produced by
+<B>luac</B>
+is likely to change when a new version of Lua is released.
+So,
+save the source files of all Lua programs that you precompile.
+<P>
+<H1>OPTIONS</H1>
+Options must be separate.
+<P>
+<B>-l</B>
+produce a listing of the compiled bytecode for Lua's virtual machine.
+Listing bytecodes is useful to learn about Lua's virtual machine.
+If no files are given, then
+<B>luac</B>
+loads
+<B>luac.out</B>
+and lists its contents.
+<P>
+<B>-o "</B><I>file"</I>
+output to
+<I>file</I>,
+instead of the default
+<B>luac.out</B>.
+The output file may be a source file because
+all files are loaded before the output file is written.
+Be careful not to overwrite precious files.
+<P>
+<B>-p</B>
+load files but do not generate any output file.
+Used mainly for syntax checking and for testing precompiled chunks:
+corrupted files will probably generate errors when loaded.
+Lua always performs a thorough integrity test on precompiled chunks.
+Bytecode that passes this test is completely safe,
+in the sense that it will not break the interpreter.
+However,
+there is no guarantee that such code does anything sensible.
+(None can be given, because the halting problem is unsolvable.)
+If no files are given, then
+<B>luac</B>
+loads
+<B>luac.out</B>
+and tests its contents.
+No messages are displayed if the file passes the integrity test.
+<P>
+<B>-s</B>
+strip debug information before writing the output file.
+This saves some space in very large chunks,
+but if errors occur when running these chunks,
+then the error messages may not contain the full information they usually do
+(line numbers and names of locals are lost).
+<P>
+<B>-v</B>
+show version information.
+<H1>FILES</H1>
+<P>
+<B>luac.out</B>
+default output file
+<H1>SEE ALSO</H1>
+<B>lua</B>(1)
+<BR>
+<A HREF="http://www.lua.org/">http://www.lua.org/</A>
+<H1>DIAGNOSTICS</H1>
+Error messages should be self explanatory.
+<H1>AUTHORS</H1>
+L. H. de Figueiredo,
+R. Ierusalimschy and
+W. Celes
+(<A HREF="mailto:lua-NO-SPAM-THANKS@tecgraf.puc-rio.br">lua AT tecgraf.puc-rio.br</A>)
+<!-- EOF -->
+</BODY>
+</HTML>
--- /dev/null
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
+<html>
+
+<head>
+<TITLE>Lua: 5.0 reference manual</TITLE>
+</head>
+
+<body BGCOLOR="#FFFFFF">
+
+<hr>
+<h1>
+<A HREF="http://www.lua.org/home.html"><IMG SRC="logo.gif" ALT="Lua" BORDER=0></A>
+Lua 5.0 Reference Manual
+</h1>
+
+by Roberto Ierusalimschy, Luiz Henrique de Figueiredo, Waldemar Celes
+<p>
+<small>
+<a HREF="http://www.lua.org/copyright.html">Copyright</a>
+© 2003 Tecgraf, PUC-Rio. All rights reserved.
+</small>
+<hr>
+
+<p>
+<p>
+<!-- ====================================================================== -->
+
+
+
+<a name="1"><h1>1 - Introduction</h1></a>
+
+<p>Lua is an extension programming language designed to support
+general procedural programming with data description
+facilities.
+It also offers good support for object-oriented programming,
+functional programming, and data-driven programming.
+Lua is intended to be used as a powerful, light-weight
+configuration language for any program that needs one.
+Lua is implemented as a library, written in <em>clean</em> C
+(that is, in the common subset of ANSI C and C++).
+
+<p>Being an extension language, Lua has no notion of a "main" program:
+it only works <em>embedded</em> in a host client,
+called the <em>embedding program</em> or simply the <em>host</em>.
+This host program can invoke functions to execute a piece of Lua code,
+can write and read Lua variables,
+and can register C functions to be called by Lua code.
+Through the use of C functions, Lua can be augmented to cope with
+a wide range of different domains,
+thus creating customized programming languages sharing a syntactical framework.
+
+<p>The Lua distribution includes a stand-alone embedding program,
+<code>lua</code>, that uses the Lua library to offer a complete Lua interpreter.
+
+<p>Lua is free software,
+and is provided as usual with no guarantees,
+as stated in its copyright notice.
+The implementation described in this manual is available
+at Lua's official web site, <code>www.lua.org</code>.
+
+<p>Like any other reference manual,
+this document is dry in places.
+For a discussion of the decisions behind the design of Lua,
+see the papers below,
+which are available at Lua's web site.
+<ul>
+<li>
+R. Ierusalimschy, L. H. de Figueiredo, and W. Celes.
+Lua---an extensible extension language.
+<em>Software: Practice & Experience</em> <b>26</b> #6 (1996) 635-652.
+<li>
+L. H. de Figueiredo, R. Ierusalimschy, and W. Celes.
+The design and implementation of a language for extending applications.
+<em>Proceedings of XXI Brazilian Seminar on Software and Hardware</em> (1994) 273-283.
+<li>
+L. H. de Figueiredo, R. Ierusalimschy, and W. Celes.
+Lua: an extensible embedded language.
+<em>Dr. Dobb's Journal</em> <b>21</b> #12 (Dec 1996) 26-33.
+<li>
+R. Ierusalimschy, L. H. de Figueiredo, and W. Celes.
+The evolution of an extension language: a history of Lua,
+<em>Proceedings of V Brazilian Symposium on Programming Languages</em> (2001) B-14-B-28.
+</ul>
+
+<p>Lua means "moon" in Portuguese and is pronounced LOO-ah.
+
+<p>
+<a name="language"><a name="2"><h1>2 - The Language</h1></a></a>
+
+<p>This section describes the lexis, the syntax, and the semantics of Lua.
+In other words,
+this section describes
+which tokens are valid,
+how they can be combined,
+and what their combinations mean.
+
+<p>The language constructs will be explained using the usual extended BNF,
+in which
+{<em>a</em>} means 0 or more <em>a</em>'s, and
+[<em>a</em>] means an optional <em>a</em>.
+Non-terminals are shown in <em>italics</em>,
+keywords are shown in <b>bold</b>,
+and other terminal symbols are shown in <code>typewriter</code> font,
+enclosed in single quotes.
+
+<p><a name="lexical"><a name="2.1"><h2>2.1 - Lexical Conventions</h2></a></a>
+
+<p><em>Identifiers</em> in Lua can be any string of letters,
+digits, and underscores,
+not beginning with a digit.
+This coincides with the definition of identifiers in most languages.
+(The definition of letter depends on the current locale:
+any character considered alphabetic by the current locale
+can be used in an identifier.)
+
+<p>The following <em>keywords</em> are reserved
+and cannot be used as identifiers:
+
+<PRE>
+ and break do else elseif
+ end false for function if
+ in local nil not or
+ repeat return then true until while
+</PRE>
+
+<p>Lua is a case-sensitive language:
+<code>and</code> is a reserved word, but <code>And</code> and <code>AND</code>
+are two different, valid identifiers.
+As a convention, identifiers starting with an underscore followed by
+uppercase letters (such as <code>_VERSION</code>)
+are reserved for internal variables used by Lua.
+
+<p>The following strings denote other tokens:
+<PRE>
+ + - * / ^ =
+ ~= <= >= < > ==
+ ( ) { } [ ]
+ ; : , . .. ...
+</PRE>
+
+<p><em>Literal strings</em>
+can be delimited by matching single or double quotes,
+and can contain the following C-like escape sequences:
+<ul>
+<li><b><code>\a</code></b> --- bell
+<li><b><code>\b</code></b> --- backspace
+<li><b><code>\f</code></b> --- form feed
+<li><b><code>\n</code></b> --- newline
+<li><b><code>\r</code></b> --- carriage return
+<li><b><code>\t</code></b> --- horizontal tab
+<li><b><code>\v</code></b> --- vertical tab
+<li><b><code>\\</code></b> --- backslash
+<li><b><code>\"</code></b> --- quotation mark
+<li><b><code>\'</code></b> --- apostrophe
+<li><b><code>\[</code></b> --- left square bracket
+<li><b><code>\]</code></b> --- right square bracket
+</ul>
+Moreover, a `<code>\</code><em>newline</em>´
+(that is, a backslash followed by a real newline)
+results in a newline in the string.
+A character in a string may also be specified by its numerical value
+using the escape sequence `<code>\</code><em>ddd</em>´,
+where <em>ddd</em> is a sequence of up to three decimal digits.
+Strings in Lua may contain any 8-bit value, including embedded zeros,
+which can be specified as `<code>\0</code>´.
+
+<p>Literal strings can also be delimited by matching double square brackets
+<code>[[</code> · · · <code>]]</code>.
+Literals in this bracketed form may run for several lines,
+may contain nested <code>[[</code> · · · <code>]]</code> pairs,
+and do not interpret any escape sequences.
+For convenience,
+when the opening `<code>[[</code>´ is immediately followed by a newline,
+the newline is not included in the string.
+As an example, in a system using ASCII
+(in which `<code>a</code>´ is coded as 97,
+newline is coded as 10, and `<code>1</code>´ is coded as 49),
+the four literals below denote the same string:
+<PRE>
+ (1) "alo\n123\""
+ (2) '\97lo\10\04923"'
+ (3) [[alo
+ 123"]]
+ (4) [[
+ alo
+ 123"]]
+</PRE>
+
+<p><em>Numerical constants</em> may be written with an optional decimal part
+and an optional decimal exponent.
+Examples of valid numerical constants are
+<PRE>
+ 3 3.0 3.1416 314.16e-2 0.31416E1
+</PRE>
+
+<p><em>Comments</em> start anywhere outside a string with a
+double hyphen (<code>--</code>).
+If the text immediately after <code>--</code> is different from <code>[[</code>,
+the comment is a <em>short comment</em>,
+which runs until the end of the line.
+Otherwise, it is a <em>long comment</em>,
+which runs until the corresponding <code>]]</code>.
+Long comments may run for several lines
+and may contain nested <code>[[</code> · · · <code>]]</code> pairs.
+
+<p>For convenience,
+the first line of a chunk is skipped if it starts with <code>#</code>.
+This facility allows the use of Lua as a script interpreter
+in Unix systems (see <a href="#lua-sa">6</a>).
+
+<p><a name="TypesSec"><a name="2.2"><h2>2.2 - Values and Types</h2></a></a>
+
+<p>Lua is a <em>dynamically typed language</em>.
+That means that
+variables do not have types; only values do.
+There are no type definitions in the language.
+All values carry their own type.
+
+<p>There are eight basic types in Lua:
+<em>nil</em>, <em>boolean</em>, <em>number</em>,
+<em>string</em>, <em>function</em>, <em>userdata</em>, <em>thread</em>, and <em>table</em>.
+<em>Nil</em> is the type of the value <B>nil</B>,
+whose main property is to be different from any other value;
+usually it represents the absence of a useful value.
+<em>Boolean</em> is the type of the values <B>false</B> and <B>true</B>.
+In Lua, both <B>nil</B> and <B>false</B> make a condition false;
+any other value makes it true.
+<em>Number</em> represents real (double-precision floating-point) numbers.
+(It is easy to build Lua interpreters that use other
+internal representations for numbers,
+such as single-precision float or long integers.)
+<em>String</em> represents arrays of characters.
+
+Lua is 8-bit clean:
+Strings may contain any 8-bit character,
+including embedded zeros (<code>'\0'</code>) (see <a href="#lexical">2.1</a>).
+
+<p>Functions are <em>first-class values</em> in Lua.
+That means that functions can be stored in variables,
+passed as arguments to other functions, and returned as results.
+Lua can call (and manipulate) functions written in Lua and
+functions written in C
+(see <a href="#functioncall">2.5.7</a>).
+
+<p>The type <em>userdata</em> is provided to allow arbitrary C data to
+be stored in Lua variables.
+This type corresponds to a block of raw memory
+and has no pre-defined operations in Lua,
+except assignment and identity test.
+However, by using <em>metatables</em>,
+the programmer can define operations for userdata values
+(see <a href="#metatable">2.8</a>).
+Userdata values cannot be created or modified in Lua,
+only through the C API.
+This guarantees the integrity of data owned by the host program.
+
+<p>The type <em>thread</em> represents independent threads of execution
+and it is used to implement coroutines.
+
+<p>The type <em>table</em> implements associative arrays,
+that is, arrays that can be indexed not only with numbers,
+but with any value (except <B>nil</B>).
+Moreover,
+tables can be <em>heterogeneous</em>,
+that is, they can contain values of all types (except <B>nil</B>).
+Tables are the sole data structuring mechanism in Lua;
+they may be used to represent ordinary arrays,
+symbol tables, sets, records, graphs, trees, etc.
+To represent records, Lua uses the field name as an index.
+The language supports this representation by
+providing <code>a.name</code> as syntactic sugar for <code>a["name"]</code>.
+There are several convenient ways to create tables in Lua
+(see <a href="#tableconstructor">2.5.6</a>).
+
+<p>Like indices,
+the value of a table field can be of any type (except <B>nil</B>).
+In particular,
+because functions are first class values,
+table fields may contain functions.
+Thus tables may also carry <em>methods</em> (see <a href="#func-def">2.5.8</a>).
+
+<p>Tables, functions, and userdata values are <em>objects</em>:
+variables do not actually <em>contain</em> these values,
+only <em>references</em> to them.
+Assignment, parameter passing, and function returns
+always manipulate references to such values;
+these operations do not imply any kind of copy.
+
+<p>The library function <code>type</code> returns a string describing the type
+of a given value (see <a href="#pdf-type">5.1</a>).
+
+<p><a name="coercion"><a name="2.2.1"><h3>2.2.1 - Coercion</h3></a></a>
+
+<p>Lua provides automatic conversion between
+string and number values at run time.
+Any arithmetic operation applied to a string tries to convert
+that string to a number, following the usual rules.
+Conversely, whenever a number is used where a string is expected,
+the number is converted to a string, in a reasonable format.
+For complete control of how numbers are converted to strings,
+use the <code>format</code> function from the string library (see <a href="#format">5.3</a>).
+
+<p><a name="variables"><a name="2.3"><h2>2.3 - Variables</h2></a></a>
+
+<p>Variables are places that store values.
+
+There are three kinds of variables in Lua:
+global variables, local variables, and table fields.
+
+<p>A single name can denote a global variable or a local variable
+(or a formal parameter of a function,
+which is a particular form of local variable):
+<pre>
+ var ::= Name
+</pre>
+Variables are assumed to be global unless explicitly declared local
+(see <a href="#localvar">2.4.7</a>).
+Local variables are <em>lexically scoped</em>:
+Local variables can be freely accessed by functions
+defined inside their scope (see <a href="#visibility">2.6</a>).
+
+<p>Before the first assignment to a variable, its value is <B>nil</B>.
+
+<p>Square brackets are used to index a table:
+<pre>
+ var ::= prefixexp `<b>[</b>´ exp `<b>]</b>´
+</pre>
+The first expression (<em>prefixexp</em>)should result in a table value;
+the second expression (<em>exp</em>)
+identifies a specific entry inside that table.
+The expression denoting the table to be indexed has a restricted syntax;
+see <a href="#expressions">2.5</a> for details.
+
+<p>The syntax <code>var.NAME</code> is just syntactic sugar for
+<code>var["NAME"]</code>:
+<pre>
+ var ::= prefixexp `<b>.</b>´ Name
+</pre>
+
+<p>The meaning of accesses to global variables
+and table fields can be changed via metatables.
+An access to an indexed variable <code>t[i]</code> is equivalent to
+a call <code>gettable_event(t,i)</code>.
+(See <a href="#metatable">2.8</a> for a complete description of the
+<code>gettable_event</code> function.
+This function is not defined or callable in Lua.
+We use it here only for explanatory purposes.)
+
+<p>All global variables live as fields in ordinary Lua tables,
+called <em>environment tables</em> or simply <em>environments</em>.
+Functions written in C and exported to Lua (<em>C functions</em>)
+all share a common <em>global environment</em>.
+Each function written in Lua (a <em>Lua function</em>)
+has its own reference to an environment,
+so that all global variables in that function
+will refer to that environment table.
+When a function is created,
+it inherits the environment from the function that created it.
+To change or get the environment table of a Lua function,
+you call <code>setfenv</code> or <code>getfenv</code> (see <a href="#setfenv">5.1</a>).
+
+<p>An access to a global variable <code>x</code>
+is equivalent to <code>_env.x</code>,
+which in turn is equivalent to
+<PRE>
+ gettable_event(_env, "x")
+</PRE>
+where <code>_env</code> is the environment of the running function.
+(The <code>_env</code> variable is not defined in Lua.
+We use it here only for explanatory purposes.)
+
+<p><a name="stats"><a name="2.4"><h2>2.4 - Statements</h2></a></a>
+
+<p>Lua supports an almost conventional set of statements,
+similar to those in Pascal or C.
+This set includes
+assignment, control structures, procedure calls,
+table constructors, and variable declarations.
+
+<p><a name="chunks"><a name="2.4.1"><h3>2.4.1 - Chunks</h3></a></a>
+
+<p>The unit of execution of Lua is called a <em>chunk</em>.
+A chunk is simply a sequence of statements,
+which are executed sequentially.
+Each statement can be optionally followed by a semicolon:
+<pre>
+ chunk ::= {stat [`<b>;</b>´]}
+</pre>
+
+<p>Lua handles a chunk as the body of an anonymous function (see <a href="#func-def">2.5.8</a>).
+As such, chunks can define local variables and return values.
+
+<p>A chunk may be stored in a file or in a string inside the host program.
+When a chunk is executed, first it is pre-compiled into opcodes for
+a virtual machine,
+and then the compiled code is executed
+by an interpreter for the virtual machine.
+
+<p>Chunks may also be pre-compiled into binary form;
+see program <code>luac</code> for details.
+Programs in source and compiled forms are interchangeable;
+Lua automatically detects the file type and acts accordingly.
+
+
+<p><a name="2.4.2"><h3>2.4.2 - Blocks</h3></a>
+A block is a list of statements;
+syntactically, a block is equal to a chunk:
+<pre>
+ block ::= chunk
+</pre>
+
+<p>A block may be explicitly delimited to produce a single statement:
+<pre>
+ stat ::= <b>do</b> block <b>end</b>
+</pre>
+Explicit blocks are useful
+to control the scope of variable declarations.
+Explicit blocks are also sometimes used to
+add a <b>return</b> or <b>break</b> statement in the middle
+of another block (see <a href="#control">2.4.4</a>).
+
+
+<p><a name="assignment"><a name="2.4.3"><h3>2.4.3 - Assignment</h3></a></a>
+
+<p>Lua allows multiple assignment.
+Therefore, the syntax for assignment
+defines a list of variables on the left side
+and a list of expressions on the right side.
+The elements in both lists are separated by commas:
+<pre>
+ stat ::= varlist1 `<b>=</b>´ explist1
+ varlist1 ::= var {`<b>,</b>´ var}
+ explist1 ::= exp {`<b>,</b>´ exp}
+</pre>
+Expressions are discussed in <a href="#expressions">2.5</a>.
+
+<p>Before the assignment,
+the list of values is <em>adjusted</em> to the length of
+the list of variables.
+If there are more values than needed,
+the excess values are thrown away.
+If there are fewer values than needed,
+the list is extended with as many <B>nil</B>'s as needed.
+If the list of expressions ends with a function call,
+then all values returned by that function call enter in the list of values,
+before the adjustment
+(except when the call is enclosed in parentheses; see <a href="#expressions">2.5</a>).
+
+<p>The assignment statement first evaluates all its expressions
+and only then are the assignments performed.
+Thus the code
+<PRE>
+ i = 3
+ i, a[i] = i+1, 20
+</PRE>
+sets <code>a[3]</code> to 20, without affecting <code>a[4]</code>
+because the <code>i</code> in <code>a[i]</code> is evaluated (to 3)
+before it is assigned 4.
+Similarly, the line
+<PRE>
+ x, y = y, x
+</PRE>
+exchanges the values of <code>x</code> and <code>y</code>.
+
+<p>The meaning of assignments to global variables
+and table fields can be changed via metatables.
+An assignment to an indexed variable <code>t[i] = val</code> is equivalent to
+<code>settable_event(t,i,val)</code>.
+(See <a href="#metatable">2.8</a> for a complete description of the
+<code>settable_event</code> function.
+This function is not defined or callable in Lua.
+We use it here only for explanatory purposes.)
+
+<p>An assignment to a global variable <code>x = val</code>
+is equivalent to the assignment
+<code>_env.x = val</code>,
+which in turn is equivalent to
+<PRE>
+ settable_event(_env, "x", val)
+</PRE>
+where <code>_env</code> is the environment of the running function.
+(The <code>_env</code> variable is not defined in Lua.
+We use it here only for explanatory purposes.)
+
+<p><a name="control"><a name="2.4.4"><h3>2.4.4 - Control Structures</h3></a></a>
+The control structures
+<b>if</b>, <b>while</b>, and <b>repeat</b> have the usual meaning and
+familiar syntax:
+
+
+
+<pre>
+ stat ::= <b>while</b> exp <b>do</b> block <b>end</b>
+ stat ::= <b>repeat</b> block <b>until</b> exp
+ stat ::= <b>if</b> exp <b>then</b> block {<b>elseif</b> exp <b>then</b> block} [<b>else</b> block] <b>end</b>
+</pre>
+Lua also has a <b>for</b> statement, in two flavors (see <a href="#for">2.4.5</a>).
+
+<p>The condition expression <em>exp</em> of a
+control structure may return any value.
+Both <B>false</B> and <B>nil</B> are considered false.
+All values different from <B>nil</B> and <B>false</B> are considered true
+(in particular, the number 0 and the empty string are also true).
+
+<p>The <b>return</b> statement is used to return values
+from a function or from a chunk.
+
+Functions and chunks may return more than one value,
+so the syntax for the <b>return</b> statement is
+<pre>
+ stat ::= <b>return</b> [explist1]
+</pre>
+
+<p>The <b>break</b> statement can be used to terminate the execution of a
+<b>while</b>, <b>repeat</b>, or <b>for</b> loop,
+skipping to the next statement after the loop:
+
+<pre>
+ stat ::= <b>break</b>
+</pre>
+A <b>break</b> ends the innermost enclosing loop.
+
+<p>For syntactic reasons, <b>return</b> and <b>break</b>
+statements can only be written as the <em>last</em> statement of a block.
+If it is really necessary to <b>return</b> or <b>break</b> in the
+middle of a block,
+then an explicit inner block can be used,
+as in the idioms
+`<code>do return end</code>´ and
+`<code>do break end</code>´,
+because now <b>return</b> and <b>break</b> are the last statements in
+their (inner) blocks.
+In practice,
+those idioms are only used during debugging.
+
+<p><a name="for"><a name="2.4.5"><h3>2.4.5 - For Statement</h3></a></a>
+
+<p>The <b>for</b> statement has two forms:
+one numeric and one generic.
+
+
+<p>The numeric <b>for</b> loop repeats a block of code while a
+control variable runs through an arithmetic progression.
+It has the following syntax:
+<pre>
+ stat ::= <b>for</b> Name `<b>=</b>´ exp `<b>,</b>´ exp [`<b>,</b>´ exp] <b>do</b> block <b>end</b>
+</pre>
+The <em>block</em> is repeated for <em>name</em> starting at the value of
+the first <em>exp</em>, until it passes the second <em>exp</em> by steps of the
+third <em>exp</em>.
+More precisely, a <b>for</b> statement like
+<PRE>
+ for var = e1, e2, e3 do block end
+</PRE>
+is equivalent to the code:
+<PRE>
+ do
+ local var, _limit, _step = tonumber(e1), tonumber(e2), tonumber(e3)
+ if not (var and _limit and _step) then error() end
+ while (_step>0 and var<=_limit) or (_step<=0 and var>=_limit) do
+ block
+ var = var + _step
+ end
+ end
+</PRE>
+Note the following:
+<ul>
+<li> All three control expressions are evaluated only once,
+before the loop starts.
+They must all result in numbers.
+<li> <code>_limit</code> and <code>_step</code> are invisible variables.
+The names are here for explanatory purposes only.
+<li> The behavior is <em>undefined</em> if you assign to <code>var</code> inside
+the block.
+<li> If the third expression (the step) is absent, then a step of 1 is used.
+<li> You can use <b>break</b> to exit a <b>for</b> loop.
+<li> The loop variable <code>var</code> is local to the statement;
+you cannot use its value after the <b>for</b> ends or is broken.
+If you need the value of the loop variable <code>var</code>,
+then assign it to another variable before breaking or exiting the loop.
+</ul>
+
+<p>The generic <b>for</b> statement works over functions,
+called <em>iterators</em>.
+For each iteration, it calls its iterator function to produce a new value,
+stopping when the new value is <B>nil</B>.
+The generic <b>for</b> loop has the following syntax:
+<pre>
+ stat ::= <b>for</b> Name {`<b>,</b>´ Name} <b>in</b> explist1 <b>do</b> block <b>end</b>
+</pre>
+A <b>for</b> statement like
+<PRE>
+ for var_1, ..., var_n in explist do block end
+</PRE>
+is equivalent to the code:
+<PRE>
+ do
+ local _f, _s, var_1 = explist
+ local var_2, ... , var_n
+ while true do
+ var_1, ..., var_n = _f(_s, var_1)
+ if var_1 == nil then break end
+ block
+ end
+ end
+</PRE>
+Note the following:
+<ul>
+<li> <code>explist</code> is evaluated only once.
+Its results are an <em>iterator</em> function,
+a <em>state</em>, and an initial value for the first <em>iterator variable</em>.
+<li> <code>_f</code> and <code>_s</code> are invisible variables.
+The names are here for explanatory purposes only.
+<li> The behavior is <em>undefined</em> if you assign to
+<code>var_1</code> inside the block.
+<li> You can use <b>break</b> to exit a <b>for</b> loop.
+<li> The loop variables <code>var_i</code> are local to the statement;
+you cannot use their values after the <b>for</b> ends.
+If you need these values,
+then assign them to other variables before breaking or exiting the loop.
+</ul>
+
+<p><a name="funcstat"><a name="2.4.6"><h3>2.4.6 - Function Calls as Statements</h3></a></a>
+To allow possible side-effects,
+function calls can be executed as statements:
+<pre>
+ stat ::= functioncall
+</pre>
+In this case, all returned values are thrown away.
+Function calls are explained in <a href="#functioncall">2.5.7</a>.
+
+<p><a name="localvar"><a name="2.4.7"><h3>2.4.7 - Local Declarations</h3></a></a>
+Local variables may be declared anywhere inside a block.
+The declaration may include an initial assignment:
+<pre>
+ stat ::= <b>local</b> namelist [`<b>=</b>´ explist1]
+ namelist ::= Name {`<b>,</b>´ Name}
+</pre>
+If present, an initial assignment has the same semantics
+of a multiple assignment (see <a href="#assignment">2.4.3</a>).
+Otherwise, all variables are initialized with <B>nil</B>.
+
+<p>A chunk is also a block (see <a href="#chunks">2.4.1</a>),
+so local variables can be declared in a chunk outside any explicit block.
+Such local variables die when the chunk ends.
+
+<p>The visibility rules for local variables are explained in <a href="#visibility">2.6</a>.
+
+<p><a name="expressions"><a name="2.5"><h2>2.5 - Expressions</h2></a></a>
+
+<p>
+The basic expressions in Lua are the following:
+<pre>
+ exp ::= prefixexp
+ exp ::= <b>nil</b> | <b>false</b> | <b>true</b>
+ exp ::= Number
+ exp ::= Literal
+ exp ::= function
+ exp ::= tableconstructor
+ prefixexp ::= var | functioncall | `<b>(</b>´ exp `<b>)</b>´
+</pre>
+
+<p>Numbers and literal strings are explained in <a href="#lexical">2.1</a>;
+variables are explained in <a href="#variables">2.3</a>;
+function definitions are explained in <a href="#func-def">2.5.8</a>;
+function calls are explained in <a href="#functioncall">2.5.7</a>;
+table constructors are explained in <a href="#tableconstructor">2.5.6</a>.
+
+
+<p>An expression enclosed in parentheses always results in only one value.
+Thus,
+<code>(f(x,y,z))</code> is always a single value,
+even if <code>f</code> returns several values.
+(The value of <code>(f(x,y,z))</code> is the first value returned by <code>f</code>
+or <B>nil</B> if <code>f</code> does not return any values.)
+
+<p>Expressions can also be built with arithmetic operators, relational operators,
+and logical operators, all of which are explained below.
+
+<p><a name="2.5.1"><h3>2.5.1 - Arithmetic Operators</h3></a>
+Lua supports the usual arithmetic operators:
+the binary <code>+</code> (addition),
+<code>-</code> (subtraction), <code>*</code> (multiplication),
+<code>/</code> (division), and <code>^</code> (exponentiation);
+and unary <code>-</code> (negation).
+If the operands are numbers, or strings that can be converted to
+numbers (see <a href="#coercion">2.2.1</a>),
+then all operations except exponentiation have the usual meaning.
+Exponentiation calls a global function <code>__pow</code>;
+otherwise, an appropriate metamethod is called (see <a href="#metatable">2.8</a>).
+The standard mathematical library defines function <code>__pow</code>,
+giving the expected meaning to exponentiation
+(see <a href="#mathlib">5.5</a>).
+
+<p><a name="rel-ops"><a name="2.5.2"><h3>2.5.2 - Relational Operators</h3></a></a>
+The relational operators in Lua are
+<PRE>
+ == ~= < > <= >=
+</PRE>
+These operators always result in <B>false</B> or <B>true</B>.
+
+<p>Equality (<code>==</code>) first compares the type of its operands.
+If the types are different, then the result is <B>false</B>.
+Otherwise, the values of the operands are compared.
+Numbers and strings are compared in the usual way.
+Objects (tables, userdata, threads, and functions)
+are compared by <em>reference</em>:
+Two objects are considered equal only if they are the <em>same</em> object.
+Every time you create a new object (a table, userdata, or function),
+this new object is different from any previously existing object.
+
+<p>You can change the way that Lua compares tables and userdata
+using the "eq" metamethod (see <a href="#metatable">2.8</a>).
+
+<p>The conversion rules of <a href="#coercion">2.2.1</a>
+<em>do not</em> apply to equality comparisons.
+Thus, <code>"0"==0</code> evaluates to <B>false</B>,
+and <code>t[0]</code> and <code>t["0"]</code> denote different
+entries in a table.
+
+
+<p>The operator <code>~=</code> is exactly the negation of equality (<code>==</code>).
+
+<p>The order operators work as follows.
+If both arguments are numbers, then they are compared as such.
+Otherwise, if both arguments are strings,
+then their values are compared according to the current locale.
+Otherwise, Lua tries to call the "lt" or the "le"
+metamethod (see <a href="#metatable">2.8</a>).
+
+<p><a name="2.5.3"><h3>2.5.3 - Logical Operators</h3></a>
+The logical operators in Lua are
+
+<PRE>
+ and or not
+</PRE>
+Like the control structures (see <a href="#control">2.4.4</a>),
+all logical operators consider both <B>false</B> and <B>nil</B> as false
+and anything else as true.
+
+
+<p>The operator <b>not</b> always return <B>false</B> or <B>true</B>.
+
+<p>The conjunction operator <b>and</b> returns its first argument
+if this value is <B>false</B> or <B>nil</B>;
+otherwise, <b>and</b> returns its second argument.
+The disjunction operator <b>or</b> returns its first argument
+if this value is different from <B>nil</B> and <B>false</B>;
+otherwise, <b>or</b> returns its second argument.
+Both <b>and</b> and <b>or</b> use short-cut evaluation,
+that is,
+the second operand is evaluated only if necessary.
+For example,
+<PRE>
+ 10 or error() -> 10
+ nil or "a" -> "a"
+ nil and 10 -> nil
+ false and error() -> false
+ false and nil -> false
+ false or nil -> nil
+ 10 and 20 -> 20
+</PRE>
+
+<p><a name="concat"><a name="2.5.4"><h3>2.5.4 - Concatenation</h3></a></a>
+The string concatenation operator in Lua is
+denoted by two dots (`<code>..</code>´).
+If both operands are strings or numbers, then they are converted to
+strings according to the rules mentioned in <a href="#coercion">2.2.1</a>.
+Otherwise, the "concat" metamethod is called (see <a href="#metatable">2.8</a>).
+
+<p><a name="2.5.5"><h3>2.5.5 - Precedence</h3></a>
+Operator precedence in Lua follows the table below,
+from lower to higher priority:
+<PRE>
+ or
+ and
+ < > <= >= ~= ==
+ ..
+ + -
+ * /
+ not - (unary)
+ ^
+</PRE>
+You can use parentheses to change the precedences in an expression.
+The concatenation (`<code>..</code>´) and exponentiation (`<code>^</code>´)
+operators are right associative.
+All other binary operators are left associative.
+
+<p><a name="tableconstructor"><a name="2.5.6"><h3>2.5.6 - Table Constructors</h3></a></a>
+Table constructors are expressions that create tables.
+Every time a constructor is evaluated, a new table is created.
+Constructors can be used to create empty tables,
+or to create a table and initialize some of its fields.
+The general syntax for constructors is
+<pre>
+ tableconstructor ::= `<b>{</b>´ [fieldlist] `<b>}</b>´
+ fieldlist ::= field {fieldsep field} [fieldsep]
+ field ::= `<b>[</b>´ exp `<b>]</b>´ `<b>=</b>´ exp | Name `<b>=</b>´ exp | exp
+ fieldsep ::= `<b>,</b>´ | `<b>;</b>´
+</pre>
+
+<p>Each field of the form <code>[exp1] = exp2</code> adds to the new table an entry
+with key <code>exp1</code> and value <code>exp2</code>.
+A field of the form <code>name = exp</code> is equivalent to
+<code>["name"] = exp</code>.
+Finally, fields of the form <code>exp</code> are equivalent to
+<code>[i] = exp</code>, where <code>i</code> are consecutive numerical integers,
+starting with 1.
+Fields in the other formats do not affect this counting.
+For example,
+<PRE>
+ a = {[f(1)] = g; "x", "y"; x = 1, f(x), [30] = 23; 45}
+</PRE>
+is equivalent to
+<PRE>
+ do
+ local temp = {}
+ temp[f(1)] = g
+ temp[1] = "x" -- 1st exp
+ temp[2] = "y" -- 2nd exp
+ temp.x = 1 -- temp["x"] = 1
+ temp[3] = f(x) -- 3rd exp
+ temp[30] = 23
+ temp[4] = 45 -- 4th exp
+ a = temp
+ end
+</PRE>
+
+<p>If the last field in the list has the form <code>exp</code>
+and the expression is a function call,
+then all values returned by the call enter the list consecutively
+(see <a href="#functioncall">2.5.7</a>).
+To avoid this,
+enclose the function call in parentheses (see <a href="#expressions">2.5</a>).
+
+<p>The field list may have an optional trailing separator,
+as a convenience for machine-generated code.
+
+<p><a name="functioncall"><a name="2.5.7"><h3>2.5.7 - Function Calls</h3></a></a>
+A function call in Lua has the following syntax:
+<pre>
+ functioncall ::= prefixexp args
+</pre>
+In a function call,
+first <em>prefixexp</em> and <em>args</em> are evaluated.
+If the value of <em>prefixexp</em> has type <em>function</em>,
+then that function is called
+with the given arguments.
+Otherwise, its "call" metamethod is called,
+having as first parameter the value of <em>prefixexp</em>,
+followed by the original call arguments
+(see <a href="#metatable">2.8</a>).
+
+<p>The form
+<pre>
+ functioncall ::= prefixexp `<b>:</b>´ Name args
+</pre>
+can be used to call "methods".
+A call <code>v:name(...)</code>
+is syntactic sugar for <code>v.name(v,...)</code>,
+except that <code>v</code> is evaluated only once.
+
+<p>Arguments have the following syntax:
+<pre>
+ args ::= `<b>(</b>´ [explist1] `<b>)</b>´
+ args ::= tableconstructor
+ args ::= Literal
+</pre>
+All argument expressions are evaluated before the call.
+A call of the form <code>f{...}</code> is syntactic sugar for
+<code>f({...})</code>, that is,
+the argument list is a single new table.
+A call of the form <code>f'...'</code>
+(or <code>f"..."</code> or <code>f[[...]]</code>) is syntactic sugar for
+<code>f('...')</code>, that is,
+the argument list is a single literal string.
+
+<p>Because a function can return any number of results
+(see <a href="#control">2.4.4</a>),
+the number of results must be adjusted before they are used.
+If the function is called as a statement (see <a href="#funcstat">2.4.6</a>),
+then its return list is adjusted to zero elements,
+thus discarding all returned values.
+If the function is called inside another expression
+or in the middle of a list of expressions,
+then its return list is adjusted to one element,
+thus discarding all returned values except the first one.
+If the function is called as the last element of a list of expressions,
+then no adjustment is made
+(unless the call is enclosed in parentheses).
+
+<p>Here are some examples:
+<PRE>
+ f() -- adjusted to 0 results
+ g(f(), x) -- f() is adjusted to 1 result
+ g(x, f()) -- g gets x plus all values returned by f()
+ a,b,c = f(), x -- f() is adjusted to 1 result (and c gets nil)
+ a,b,c = x, f() -- f() is adjusted to 2 results
+ a,b,c = f() -- f() is adjusted to 3 results
+ return f() -- returns all values returned by f()
+ return x,y,f() -- returns x, y, and all values returned by f()
+ {f()} -- creates a list with all values returned by f()
+ {f(), nil} -- f() is adjusted to 1 result
+</PRE>
+
+<p>If you enclose a function call in parentheses,
+then it is adjusted to return exactly one value:
+<PRE>
+ return x,y,(f()) -- returns x, y, and the first value from f()
+ {(f())} -- creates a table with exactly one element
+</PRE>
+
+<p>As an exception to the free-format syntax of Lua,
+you cannot put a line break before the `<code>(</code>´ in a function call.
+That restriction avoids some ambiguities in the language.
+If you write
+<PRE>
+ a = f
+ (g).x(a)
+</PRE>
+Lua would read that as <code>a = f(g).x(a)</code>.
+So, if you want two statements, you must add a semi-colon between them.
+If you actually want to call <code>f</code>,
+you must remove the line break before <code>(g)</code>.
+
+<p>A call of the form <code>return</code> <em>functioncall</em> is called
+a <em>tail call</em>.
+Lua implements <em>proper tail calls</em>
+(or <em>proper tail recursion</em>):
+In a tail call,
+the called function reuses the stack entry of the calling function.
+Therefore, there is no limit on the number of nested tail calls that
+a program can execute.
+However, a tail call erases any debug information about the
+calling function.
+Note that a tail call only happens with a particular syntax,
+where the <b>return</b> has one single function call as argument;
+this syntax makes the calling function returns exactly
+the returns of the called function.
+So, all the following examples are not tails calls:
+<PRE>
+ return (f(x)) -- results adjusted to 1
+ return 2 * f(x)
+ return x, f(x) -- additional results
+ f(x); return -- results discarded
+ return x or f(x) -- results adjusted to 1
+</PRE>
+
+<p><a name="func-def"><a name="2.5.8"><h3>2.5.8 - Function Definitions</h3></a></a>
+
+<p>The syntax for function definition is
+<pre>
+ function ::= <b>function</b> funcbody
+ funcbody ::= `<b>(</b>´ [parlist1] `<b>)</b>´ block <b>end</b>
+</pre>
+
+<p>The following syntactic sugar simplifies function definitions:
+<pre>
+ stat ::= <b>function</b> funcname funcbody
+ stat ::= <b>local</b> <b>function</b> Name funcbody
+ funcname ::= Name {`<b>.</b>´ Name} [`<b>:</b>´ Name]
+</pre>
+The statement
+<PRE>
+ function f () ... end
+</PRE>
+translates to
+<PRE>
+ f = function () ... end
+</PRE>
+The statement
+<PRE>
+ function t.a.b.c.f () ... end
+</PRE>
+translates to
+<PRE>
+ t.a.b.c.f = function () ... end
+</PRE>
+The statement
+<PRE>
+ local function f () ... end
+</PRE>
+translates to
+<PRE>
+ local f; f = function () ... end
+</PRE>
+
+<p>A function definition is an executable expression,
+whose value has type <em>function</em>.
+When Lua pre-compiles a chunk,
+all its function bodies are pre-compiled too.
+Then, whenever Lua executes the function definition,
+the function is <em>instantiated</em> (or <em>closed</em>).
+This function instance (or <em>closure</em>)
+is the final value of the expression.
+Different instances of the same function
+may refer to different external local variables
+and may have different environment tables.
+
+<p>Parameters act as local variables that are
+initialized with the argument values:
+<pre>
+ parlist1 ::= namelist [`<b>,</b>´ `<b>...</b>´]
+ parlist1 ::= `<b>...</b>´
+</pre>
+When a function is called,
+the list of arguments is adjusted to
+the length of the list of parameters,
+unless the function is a variadic or <em>vararg function</em>,
+which is
+indicated by three dots (`<code>...</code>´) at the end of its parameter list.
+A vararg function does not adjust its argument list;
+instead, it collects all extra arguments into an implicit parameter,
+called <code>arg</code>.
+The value of <a name="vararg"><code>arg</code></a> is a table,
+with a field <code>n</code> that holds the number of extra arguments
+and with the extra arguments at positions 1, 2, ..., <code>n</code>.
+
+<p>As an example, consider the following definitions:
+<PRE>
+ function f(a, b) end
+ function g(a, b, ...) end
+ function r() return 1,2,3 end
+</PRE>
+Then, we have the following mapping from arguments to parameters:
+<PRE>
+ CALL PARAMETERS
+
+ f(3) a=3, b=nil
+ f(3, 4) a=3, b=4
+ f(3, 4, 5) a=3, b=4
+ f(r(), 10) a=1, b=10
+ f(r()) a=1, b=2
+
+ g(3) a=3, b=nil, arg={n=0}
+ g(3, 4) a=3, b=4, arg={n=0}
+ g(3, 4, 5, 8) a=3, b=4, arg={5, 8; n=2}
+ g(5, r()) a=5, b=1, arg={2, 3; n=2}
+</PRE>
+
+<p>Results are returned using the <b>return</b> statement (see <a href="#control">2.4.4</a>).
+If control reaches the end of a function
+without encountering a <b>return</b> statement,
+then the function returns with no results.
+
+<p>The <em>colon</em> syntax
+is used for defining <em>methods</em>,
+that is, functions that have an implicit extra parameter <code>self</code>.
+Thus, the statement
+<PRE>
+ function t.a.b.c:f (...) ... end
+</PRE>
+is syntactic sugar for
+<PRE>
+ t.a.b.c.f = function (self, ...) ... end
+</PRE>
+
+<p><a name="visibility"><a name="2.6"><h2>2.6 - Visibility Rules</h2></a></a>
+
+
+<p>Lua is a lexically scoped language.
+The scope of variables begins at the first statement <em>after</em>
+their declaration and lasts until the end of the innermost block that
+includes the declaration.
+For instance:
+<PRE>
+ x = 10 -- global variable
+ do -- new block
+ local x = x -- new `x', with value 10
+ print(x) --> 10
+ x = x+1
+ do -- another block
+ local x = x+1 -- another `x'
+ print(x) --> 12
+ end
+ print(x) --> 11
+ end
+ print(x) --> 10 (the global one)
+</PRE>
+Notice that, in a declaration like <code>local x = x</code>,
+the new <code>x</code> being declared is not in scope yet,
+and so the second <code>x</code> refers to the outside variable.
+
+<p>Because of the lexical scoping rules,
+local variables can be freely accessed by functions
+defined inside their scope.
+For instance:
+<PRE>
+ local counter = 0
+ function inc (x)
+ counter = counter + x
+ return counter
+ end
+</PRE>
+A local variable used by an inner function is called
+an <em>upvalue</em>, or <em>external local variable</em>,
+inside the inner function.
+
+<p>Notice that each execution of a <b>local</b> statement
+defines new local variables.
+Consider the following example:
+<PRE>
+ a = {}
+ local x = 20
+ for i=1,10 do
+ local y = 0
+ a[i] = function () y=y+1; return x+y end
+ end
+</PRE>
+The loop creates ten closures
+(that is, ten instances of the anonymous function).
+Each of these closures uses a different <code>y</code> variable,
+while all of them share the same <code>x</code>.
+
+<p><a name="error"><a name="2.7"><h2>2.7 - Error Handling</h2></a></a>
+
+<p>Because Lua is an extension language,
+all Lua actions start from C code in the host program
+calling a function from the Lua library (see <a href="#lua_pcall">3.15</a>).
+Whenever an error occurs during Lua compilation or execution,
+control returns to C,
+which can take appropriate measures
+(such as print an error message).
+
+<p>Lua code can explicitly generate an error by calling the
+<code>error</code> function (see <a href="#pdf-error">5.1</a>).
+If you need to catch errors in Lua,
+you can use the <code>pcall</code> function (see <a href="#pdf-pcall">5.1</a>).
+
+<p><a name="metatable"><a name="2.8"><h2>2.8 - Metatables</h2></a></a>
+
+<p>Every table and userdata object in Lua may have a <em>metatable</em>.
+This <em>metatable</em> is an ordinary Lua table
+that defines the behavior of the original table and userdata
+under certain special operations.
+You can change several aspects of the behavior
+of an object by setting specific fields in its metatable.
+For instance, when an object is the operand of an addition,
+Lua checks for a function in the field <code>"__add"</code> in its metatable.
+If it finds one,
+Lua calls that function to perform the addition.
+
+<p>We call the keys in a metatable <em>events</em>
+and the values <em>metamethods</em>.
+In the previous example, the event is <code>"add"</code>
+and the metamethod is the function that performs the addition.
+
+<p>You can query and change the metatable of an object
+through the <code>set/getmetatable</code>
+functions (see <a href="#pdf-getmetatable">5.1</a>).
+
+<p>A metatable may control how an object behaves in arithmetic operations,
+order comparisons, concatenation, and indexing.
+A metatable can also define a function to be called when a userdata
+is garbage collected.
+For each of those operations Lua associates a specific key
+called an <em>event</em>.
+When Lua performs one of those operations over a table or a userdata,
+it checks whether that object has a metatable with the corresponding event.
+If so, the value associated with that key (the <em>metamethod</em>)
+controls how Lua will perform the operation.
+
+<p>Metatables control the operations listed next.
+Each operation is identified by its corresponding name.
+The key for each operation is a string with its name prefixed by
+two underscores;
+for instance, the key for operation "add" is the
+string <code>"__add"</code>.
+The semantics of these operations is better explained by a Lua function
+describing how the interpreter executes that operation.
+
+<p>The code shown here in Lua is only illustrative;
+the real behavior is hard coded in the interpreter
+and it is much more efficient than this simulation.
+All functions used in these descriptions
+(<code>rawget</code>, <code>tonumber</code>, etc.)
+are described in <a href="#predefined">5.1</a>.
+In particular, to retrieve the metamethod of a given object,
+we use the expression
+<PRE>
+ metatable(obj)[event]
+</PRE>
+This should be read as
+<PRE>
+ rawget(metatable(obj) or {}, event)
+</PRE>
+That is, the access to a metamethod does not invoke other metamethods,
+and the access to objects with no metatables does not fail
+(it simply results in <B>nil</B>).
+
+<p><ul>
+
+<p><li><b>"add":</b>
+the <code>+</code> operation.
+
+<p>The function <code>getbinhandler</code> below defines how Lua chooses a handler
+for a binary operation.
+First, Lua tries the first operand.
+If its type does not define a handler for the operation,
+then Lua tries the second operand.
+<PRE>
+ function getbinhandler (op1, op2, event)
+ return metatable(op1)[event] or metatable(op2)[event]
+ end
+</PRE>
+Using that function,
+the behavior of the <code>op1 + op2</code> is
+<PRE>
+ function add_event (op1, op2)
+ local o1, o2 = tonumber(op1), tonumber(op2)
+ if o1 and o2 then -- both operands are numeric?
+ return o1 + o2 -- `+' here is the primitive `add'
+ else -- at least one of the operands is not numeric
+ local h = getbinhandler(op1, op2, "__add")
+ if h then
+ -- call the handler with both operands
+ return h(op1, op2)
+ else -- no handler available: default behavior
+ error("...")
+ end
+ end
+ end
+</PRE>
+
+<p><li><b>"sub":</b>
+the <code>-</code> operation.
+Behavior similar to the "add" operation.
+
+<p><li><b>"mul":</b>
+the <code>*</code> operation.
+Behavior similar to the "add" operation.
+
+<p><li><b>"div":</b>
+the <code>/</code> operation.
+Behavior similar to the "add" operation.
+
+<p><li><b>"pow":</b>
+the <code>^</code> (exponentiation) operation.
+<PRE>
+ function pow_event (op1, op2)
+ local o1, o2 = tonumber(op1), tonumber(op2)
+ if o1 and o2 then -- both operands are numeric?
+ return __pow(o1, o2) -- call global `__pow'
+ else -- at least one of the operands is not numeric
+ local h = getbinhandler(op1, op2, "__pow")
+ if h then
+ -- call the handler with both operands
+ return h(op1, op2)
+ else -- no handler available: default behavior
+ error("...")
+ end
+ end
+ end
+</PRE>
+
+<p><li><b>"unm":</b>
+the unary <code>-</code> operation.
+<PRE>
+ function unm_event (op)
+ local o = tonumber(op)
+ if o then -- operand is numeric?
+ return -o -- `-' here is the primitive `unm'
+ else -- the operand is not numeric.
+ -- Try to get a handler from the operand
+ local h = metatable(op).__unm
+ if h then
+ -- call the handler with the operand and nil
+ return h(op, nil)
+ else -- no handler available: default behavior
+ error("...")
+ end
+ end
+ end
+</PRE>
+
+<p><li><b>"concat":</b>
+the <code>..</code> (concatenation) operation.
+<PRE>
+ function concat_event (op1, op2)
+ if (type(op1) == "string" or type(op1) == "number") and
+ (type(op2) == "string" or type(op2) == "number") then
+ return op1 .. op2 -- primitive string concatenation
+ else
+ local h = getbinhandler(op1, op2, "__concat")
+ if h then
+ return h(op1, op2)
+ else
+ error("...")
+ end
+ end
+ end
+</PRE>
+
+<p><li><b>"eq":</b>
+the <code>==</code> operation.
+The function <code>getcomphandler</code> defines how Lua chooses a metamethod
+for comparison operators.
+A metamethod only is selected when both objects
+being compared have the same type
+and the same metamethod for the selected operation.
+<PRE>
+ function getcomphandler (op1, op2, event)
+ if type(op1) ~= type(op2) then return nil end
+ local mm1 = metatable(op1)[event]
+ local mm2 = metatable(op2)[event]
+ if mm1 == mm2 then return mm1 else return nil end
+ end
+</PRE>
+The "eq" event is defined as follows:
+<PRE>
+ function eq_event (op1, op2)
+ if type(op1) ~= type(op2) then -- different types?
+ return false -- different objects
+ end
+ if op1 == op2 then -- primitive equal?
+ return true -- objects are equal
+ end
+ -- try metamethod
+ local h = getcomphandler(op1, op2, "__eq")
+ if h then
+ return h(op1, op2)
+ else
+ return false
+ end
+ end
+</PRE>
+<code>a ~= b</code> is equivalent to <code>not (a == b)</code>.
+
+<p><li><b>"lt":</b>
+the <code><</code> operation.
+<PRE>
+ function lt_event (op1, op2)
+ if type(op1) == "number" and type(op2) == "number" then
+ return op1 < op2 -- numeric comparison
+ elseif type(op1) == "string" and type(op2) == "string" then
+ return op1 < op2 -- lexicographic comparison
+ else
+ local h = getcomphandler(op1, op2, "__lt")
+ if h then
+ return h(op1, op2)
+ else
+ error("...");
+ end
+ end
+ end
+</PRE>
+<code>a > b</code> is equivalent to <code>b < a</code>.
+
+<p><li><b>"le":</b>
+the <code><=</code> operation.
+<PRE>
+ function le_event (op1, op2)
+ if type(op1) == "number" and type(op2) == "number" then
+ return op1 <= op2 -- numeric comparison
+ elseif type(op1) == "string" and type(op2) == "string" then
+ return op1 <= op2 -- lexicographic comparison
+ else
+ local h = getcomphandler(op1, op2, "__le")
+ if h then
+ return h(op1, op2)
+ else
+ h = getcomphandler(op1, op2, "__lt")
+ if h then
+ return not h(op2, op1)
+ else
+ error("...");
+ end
+ end
+ end
+ end
+</PRE>
+<code>a >= b</code> is equivalent to <code>b <= a</code>.
+Note that, in the absence of a "le" metamethod,
+Lua tries the "lt", assuming that <code>a <= b</code> is
+equivalent to <code>not (b < a)</code>.
+
+<p><li><b>"index":</b>
+The indexing access <code>table[key]</code>.
+<PRE>
+ function gettable_event (table, key)
+ local h
+ if type(table) == "table" then
+ local v = rawget(table, key)
+ if v ~= nil then return v end
+ h = metatable(table).__index
+ if h == nil then return nil end
+ else
+ h = metatable(table).__index
+ if h == nil then
+ error("...");
+ end
+ end
+ if type(h) == "function" then
+ return h(table, key) -- call the handler
+ else return h[key] -- or repeat operation on it
+ end
+</PRE>
+
+<p><li><b>"newindex":</b>
+The indexing assignment <code>table[key] = value</code>.
+<PRE>
+ function settable_event (table, key, value)
+ local h
+ if type(table) == "table" then
+ local v = rawget(table, key)
+ if v ~= nil then rawset(table, key, value); return end
+ h = metatable(table).__newindex
+ if h == nil then rawset(table, key, value); return end
+ else
+ h = metatable(table).__newindex
+ if h == nil then
+ error("...");
+ end
+ end
+ if type(h) == "function" then
+ return h(table, key,value) -- call the handler
+ else h[key] = value -- or repeat operation on it
+ end
+</PRE>
+
+<p><li><b>"call":</b>
+called when Lua calls a value.
+<PRE>
+ function function_event (func, ...)
+ if type(func) == "function" then
+ return func(unpack(arg)) -- primitive call
+ else
+ local h = metatable(func).__call
+ if h then
+ return h(func, unpack(arg))
+ else
+ error("...")
+ end
+ end
+ end
+</PRE>
+
+<p></ul>
+
+<p><a name="GC"><a name="2.9"><h2>2.9 - Garbage Collection</h2></a></a>
+
+<p>Lua does automatic memory management.
+That means that
+you do not have to worry about allocating memory for new objects
+and freeing it when the objects are no longer needed.
+Lua manages memory automatically by running
+a <em>garbage collector</em> from time to time
+to collect all <em>dead objects</em>
+(that is, those objects that are no longer accessible from Lua).
+All objects in Lua are subject to automatic management:
+tables, userdata, functions, threads, and strings.
+
+<p>Lua uses two numbers to control its garbage-collection cycles.
+One number counts how many bytes of dynamic memory Lua is using;
+the other is a threshold.
+When the number of bytes crosses the threshold,
+Lua runs the garbage collector,
+which reclaims the memory of all dead objects.
+The byte counter is adjusted,
+and then the threshold is reset to twice the new value of the byte counter.
+
+<p>Through the C API, you can query those numbers
+and change the threshold (see <a href="#GC-API">3.7</a>).
+Setting the threshold to zero actually forces an immediate
+garbage-collection cycle,
+while setting it to a huge number effectively stops the garbage collector.
+Using Lua code you have a more limited control over garbage-collection cycles,
+through the <code>gcinfo</code> and <code>collectgarbage</code> functions
+(see <a href="#predefined">5.1</a>).
+
+<p><a name="2.9.1"><h3>2.9.1 - Garbage-Collection Metamethods</h3></a>
+
+<p>Using the C API,
+you can set garbage-collector metamethods for userdata (see <a href="#metatable">2.8</a>).
+These metamethods are also called <em>finalizers</em>.
+Finalizers allow you to coordinate Lua's garbage collection
+with external resource management
+(such as closing files, network or database connections,
+or freeing your own memory).
+
+<p>Free userdata with a field <code>__gc</code> in their metatables are not
+collected immediately by the garbage collector.
+Instead, Lua puts them in a list.
+After the collection,
+Lua does the equivalent of the following function
+for each userdata in that list:
+<PRE>
+ function gc_event (udata)
+ local h = metatable(udata).__gc
+ if h then
+ h(udata)
+ end
+ end
+</PRE>
+
+<p>At the end of each garbage-collection cycle,
+the finalizers for userdata are called in <em>reverse</em>
+order of their creation,
+among those collected in that cycle.
+That is, the first finalizer to be called is the one associated
+with the userdata created last in the program.
+
+<p><a name="weak-table"><a name="2.9.2"><h3>2.9.2 - Weak Tables</h3></a></a>
+
+<p>A <em>weak table</em> is a table whose elements are
+<em>weak references</em>.
+A weak reference is ignored by the garbage collector.
+In other words,
+if the only references to an object are weak references,
+then the garbage collector will collect that object.
+
+<p>A weak table can have weak keys, weak values, or both.
+A table with weak keys allows the collection of its keys,
+but prevents the collection of its values.
+A table with both weak keys and weak values allows the collection of
+both keys and values.
+In any case, if either the key or the value is collected,
+the whole pair is removed from the table.
+The weakness of a table is controlled by the value of the
+<code>__mode</code> field of its metatable.
+If the <code>__mode</code> field is a string containing the character `<code>k</code>´,
+the keys in the table are weak.
+If <code>__mode</code> contains `<code>v</code>´,
+the values in the table are weak.
+
+<p>After you use a table as a metatable,
+you should not change the value of its field <code>__mode</code>.
+Otherwise, the weak behavior of the tables controlled by this
+metatable is undefined.
+
+<p><a name="coroutine"><a name="2.10"><h2>2.10 - Coroutines</h2></a></a>
+
+<p>Lua supports coroutines,
+also called <em>semi-coroutines</em>
+or <em>collaborative multithreading</em>.
+A coroutine in Lua represents an independent thread of execution.
+Unlike threads in multithread systems, however,
+a coroutine only suspends its execution by explicitly calling
+a yield function.
+
+<p>You create a coroutine with a call to <code>coroutine.create</code>.
+Its sole argument is a function
+that is the main function of the coroutine.
+The <code>create</code> function only creates a new coroutine and
+returns a handle to it (an object of type <em>thread</em>);
+it does not start the coroutine execution.
+
+<p>When you first call <code>coroutine.resume</code>,
+passing as its first argument the thread returned by <code>coroutine.create</code>,
+the coroutine starts its execution,
+at the first line of its main function.
+Extra arguments passed to <code>coroutine.resume</code> are given as
+parameters for the coroutine main function.
+After the coroutine starts running,
+it runs until it terminates or <em>yields</em>.
+
+<p>A coroutine can terminate its execution in two ways:
+Normally, when its main function returns
+(explicitly or implicitly, after the last instruction);
+and abnormally, if there is an unprotected error.
+In the first case, <code>coroutine.resume</code> returns <B>true</B>,
+plus any values returned by the coroutine main function.
+In case of errors, <code>coroutine.resume</code> returns <B>false</B>
+plus an error message.
+
+<p>A coroutine yields by calling <code>coroutine.yield</code>.
+When a coroutine yields,
+the corresponding <code>coroutine.resume</code> returns immediately,
+even if the yield happens inside nested function calls
+(that is, not in the main function,
+but in a function directly or indirectly called by the main function).
+In the case of a yield, <code>coroutine.resume</code> also returns <B>true</B>,
+plus any values passed to <code>coroutine.yield</code>.
+The next time you resume the same coroutine,
+it continues its execution from the point where it yielded,
+with the call to <code>coroutine.yield</code> returning any extra
+arguments passed to <code>coroutine.resume</code>.
+
+<p>The <code>coroutine.wrap</code> function creates a coroutine
+like <code>coroutine.create</code>,
+but instead of returning the coroutine itself,
+it returns a function that, when called, resumes the coroutine.
+Any arguments passed to that function
+go as extra arguments to resume.
+The function returns all the values returned by resume,
+except the first one (the boolean error code).
+Unlike <code>coroutine.resume</code>,
+this function does not catch errors;
+any error is propagated to the caller.
+
+<p>As an example,
+consider the next code:
+<PRE>
+function foo1 (a)
+ print("foo", a)
+ return coroutine.yield(2*a)
+end
+
+co = coroutine.create(function (a,b)
+ print("co-body", a, b)
+ local r = foo1(a+1)
+ print("co-body", r)
+ local r, s = coroutine.yield(a+b, a-b)
+ print("co-body", r, s)
+ return b, "end"
+end)
+
+a, b = coroutine.resume(co, 1, 10)
+print("main", a, b)
+a, b, c = coroutine.resume(co, "r")
+print("main", a, b, c)
+a, b, c = coroutine.resume(co, "x", "y")
+print("main", a, b, c)
+a, b = coroutine.resume(co, "x", "y")
+print("main", a, b)
+</PRE>
+When you run it, it produces the following output:
+<PRE>
+co-body 1 10
+foo 2
+main true 4
+co-body r
+main true 11 -9
+co-body x y
+main true 10 end
+main false cannot resume dead coroutine
+</PRE>
+
+<p>
+<a name="API"><a name="3"><h1>3 - The Application Program Interface</h1></a></a>
+
+
+<p>This section describes the C API for Lua, that is,
+the set of C functions available to the host program to communicate
+with Lua.
+All API functions and related types and constants
+are declared in the header file <code>lua.h</code>.
+
+<p>Even when we use the term "function",
+any facility in the API may be provided as a <em>macro</em> instead.
+All such macros use each of its arguments exactly once
+(except for the first argument, which is always a Lua state),
+and so do not generate hidden side-effects.
+
+<p><a name="mangstate"><a name="3.1"><h2>3.1 - States</h2></a></a>
+
+<p>The Lua library is fully reentrant:
+it has no global variables.
+
+The whole state of the Lua interpreter
+(global variables, stack, etc.)
+is stored in a dynamically allocated structure of type <code>lua_State</code>.
+
+A pointer to this state must be passed as the first argument to
+every function in the library, except to <code>lua_open</code>,
+which creates a Lua state from scratch.
+
+<p>Before calling any API function,
+you must create a state by calling <code>lua_open</code>:
+<PRE>
+ lua_State *lua_open (void);
+</PRE>
+
+
+<p>To release a state created with <code>lua_open</code>, call <code>lua_close</code>:
+<PRE>
+ void lua_close (lua_State *L);
+</PRE>
+
+This function destroys all objects in the given Lua state
+(calling the corresponding garbage-collection metamethods, if any)
+and frees all dynamic memory used by that state.
+On several platforms, you may not need to call this function,
+because all resources are naturally released when the host program ends.
+On the other hand,
+long-running programs,
+such as a daemon or a web server,
+might need to release states as soon as they are not needed,
+to avoid growing too large.
+
+<p><a name="3.2"><h2>3.2 - The Stack and Indices</h2></a>
+
+<p>Lua uses a <em>virtual stack</em> to pass values to and from C.
+Each element in this stack represents a Lua value
+(<B>nil</B>, number, string, etc.).
+
+<p>Whenever Lua calls C, the called function gets a new stack,
+which is independent of previous stacks and of stacks of
+C functions that are still active.
+That stack initially contains any arguments to the C function,
+and it is where the C function pushes its results to be returned to the caller (see <a href="#LuacallC">3.16</a>)
+to be returned to the caller.
+
+<p>For convenience,
+most query operations in the API do not follow a strict stack discipline.
+Instead, they can refer to any element in the stack by using an <em>index</em>:
+A positive index represents an <em>absolute</em> stack position
+(starting at 1);
+a negative index represents an <em>offset</em> from the top of the stack.
+More specifically, if the stack has <em>n</em> elements,
+then index 1 represents the first element
+(that is, the element that was pushed onto the stack first)
+and
+index <em>n</em> represents the last element;
+index <em>-1</em> also represents the last element
+(that is, the element at the top)
+and index <em>-n</em> represents the first element.
+We say that an index is <em>valid</em>
+if it lies between 1 and the stack top
+(that is, if <code>1 <= abs(index) <= top</code>).
+
+
+<p>At any time, you can get the index of the top element by calling
+<code>lua_gettop</code>:
+<PRE>
+ int lua_gettop (lua_State *L);
+</PRE>
+Because indices start at 1,
+the result of <code>lua_gettop</code> is equal to the number of elements in the stack
+(and so 0 means an empty stack).
+
+<p>When you interact with Lua API,
+<em>you are responsible for controlling stack overflow</em>.
+The function
+<PRE>
+ int lua_checkstack (lua_State *L, int extra);
+</PRE>
+
+grows the stack size to <code>top + extra</code> elements;
+it returns false if it cannot grow the stack to that size.
+This function never shrinks the stack;
+if the stack is already larger than the new size,
+it is left unchanged.
+
+<p>Whenever Lua calls C,
+it ensures that at least <code>LUA_MINSTACK</code> stack positions are available.
+<code>LUA_MINSTACK</code> is defined in <code>lua.h</code> as 20,
+so that usually you do not have to worry about stack space
+unless your code has loops pushing elements onto the stack.
+
+<p>Most query functions accept as indices any value inside the
+available stack space, that is, indices up to the maximum stack size
+you have set through <code>lua_checkstack</code>.
+Such indices are called <em>acceptable indices</em>.
+More formally, we define an <em>acceptable index</em>
+as follows:
+<PRE>
+ (index < 0 && abs(index) <= top) || (index > 0 && index <= stackspace)
+</PRE>
+Note that 0 is never an acceptable index.
+
+<p>Unless otherwise noted,
+any function that accepts valid indices can also be called with
+<em>pseudo-indices</em>,
+which represent some Lua values that are accessible to the C code
+but are not in the stack.
+Pseudo-indices are used to access the global environment,
+the registry, and the upvalues of a C function (see <a href="#c-closure">3.17</a>).
+
+<p><a name="3.3"><h2>3.3 - Stack Manipulation</h2></a>
+The API offers the following functions for basic stack manipulation:
+<PRE>
+ void lua_settop (lua_State *L, int index);
+ void lua_pushvalue (lua_State *L, int index);
+ void lua_remove (lua_State *L, int index);
+ void lua_insert (lua_State *L, int index);
+ void lua_replace (lua_State *L, int index);
+</PRE>
+
+
+
+<p><code>lua_settop</code> accepts any acceptable index,
+or 0,
+and sets the stack top to that index.
+If the new top is larger than the old one,
+then the new elements are filled with <B>nil</B>.
+If <code>index</code> is 0, then all stack elements are removed.
+A useful macro defined in the <code>lua.h</code> is
+<PRE>
+ #define lua_pop(L,n) lua_settop(L, -(n)-1)
+</PRE>
+
+which pops <code>n</code> elements from the stack.
+
+<p><code>lua_pushvalue</code> pushes onto the stack a copy of the element
+at the given index.
+<code>lua_remove</code> removes the element at the given position,
+shifting down the elements above that position to fill the gap.
+<code>lua_insert</code> moves the top element into the given position,
+shifting up the elements above that position to open space.
+<code>lua_replace</code> moves the top element into the given position,
+without shifting any element (therefore replacing the value at
+the given position).
+All these functions accept only valid indices.
+(You cannot call <code>lua_remove</code> or <code>lua_insert</code> with
+pseudo-indices, as they do not represent a stack position.)
+
+<p>As an example, if the stack starts as <code>10 20 30 40 50*</code>
+(from bottom to top; the `<code>*</code>´ marks the top),
+then
+<PRE>
+ lua_pushvalue(L, 3) --> 10 20 30 40 50 30*
+ lua_pushvalue(L, -1) --> 10 20 30 40 50 30 30*
+ lua_remove(L, -3) --> 10 20 30 40 30 30*
+ lua_remove(L, 6) --> 10 20 30 40 30*
+ lua_insert(L, 1) --> 30 10 20 30 40*
+ lua_insert(L, -1) --> 30 10 20 30 40* (no effect)
+ lua_replace(L, 2) --> 30 40 20 30*
+ lua_settop(L, -3) --> 30 40*
+ lua_settop(L, 6) --> 30 40 nil nil nil nil*
+</PRE>
+
+<p><a name="3.4"><h2>3.4 - Querying the Stack</h2></a>
+
+<p>To check the type of a stack element,
+the following functions are available:
+<PRE>
+ int lua_type (lua_State *L, int index);
+ int lua_isnil (lua_State *L, int index);
+ int lua_isboolean (lua_State *L, int index);
+ int lua_isnumber (lua_State *L, int index);
+ int lua_isstring (lua_State *L, int index);
+ int lua_istable (lua_State *L, int index);
+ int lua_isfunction (lua_State *L, int index);
+ int lua_iscfunction (lua_State *L, int index);
+ int lua_isuserdata (lua_State *L, int index);
+ int lua_islightuserdata (lua_State *L, int index);
+</PRE>
+
+
+
+
+
+These functions can be called with any acceptable index.
+
+<p><code>lua_type</code> returns the type of a value in the stack,
+or <code>LUA_TNONE</code> for a non-valid index
+(that is, if that stack position is "empty").
+The types returned by <code>lua_type</code> are coded by the following constants
+defined in <code>lua.h</code>:
+<code>LUA_TNIL</code>,
+<code>LUA_TNUMBER</code>,
+<code>LUA_TBOOLEAN</code>,
+<code>LUA_TSTRING</code>,
+<code>LUA_TTABLE</code>,
+<code>LUA_TFUNCTION</code>,
+<code>LUA_TUSERDATA</code>,
+<code>LUA_TTHREAD</code>,
+<code>LUA_TLIGHTUSERDATA</code>.
+The following function translates these constants to strings:
+<PRE>
+ const char *lua_typename (lua_State *L, int type);
+</PRE>
+
+
+<p>The <code>lua_is*</code> functions return 1 if the object is compatible
+with the given type, and 0 otherwise.
+<code>lua_isboolean</code> is an exception to this rule:
+It succeeds only for boolean values
+(otherwise it would be useless,
+as any value has a boolean value).
+They always return 0 for a non-valid index.
+<code>lua_isnumber</code> accepts numbers and numerical strings;
+<code>lua_isstring</code> accepts strings and numbers (see <a href="#coercion">2.2.1</a>);
+<code>lua_isfunction</code> accepts both Lua functions and C functions;
+and <code>lua_isuserdata</code> accepts both full and light userdata.
+To distinguish between Lua functions and C functions,
+you can use <code>lua_iscfunction</code>.
+To distinguish between full and light userdata,
+you can use <code>lua_islightuserdata</code>.
+To distinguish between numbers and numerical strings,
+you can use <code>lua_type</code>.
+
+<p>The API also contains functions to compare two values in the stack:
+<PRE>
+ int lua_equal (lua_State *L, int index1, int index2);
+ int lua_rawequal (lua_State *L, int index1, int index2);
+ int lua_lessthan (lua_State *L, int index1, int index2);
+</PRE>
+
+<code>lua_equal</code> and <code>lua_lessthan</code>
+are equivalent to their counterparts in Lua (see <a href="#rel-ops">2.5.2</a>).
+<code>lua_rawequal</code> compares the values for primitive equality,
+without metamethods.
+These functions return 0 (false) if any of the indices are non-valid.
+
+<p><a name="lua-to"><a name="3.5"><h2>3.5 - Getting Values from the Stack</h2></a></a>
+
+<p>To translate a value in the stack to a specific C type,
+you can use the following conversion functions:
+<PRE>
+ int lua_toboolean (lua_State *L, int index);
+ lua_Number lua_tonumber (lua_State *L, int index);
+ const char *lua_tostring (lua_State *L, int index);
+ size_t lua_strlen (lua_State *L, int index);
+ lua_CFunction lua_tocfunction (lua_State *L, int index);
+ void *lua_touserdata (lua_State *L, int index);
+ lua_State *lua_tothread (lua_State *L, int index);
+ void *lua_topointer (lua_State *L, int index);
+</PRE>
+
+
+
+These functions can be called with any acceptable index.
+When called with a non-valid index,
+they act as if the given value had an incorrect type.
+
+<p><code>lua_toboolean</code> converts the Lua value at the given index
+to a C "boolean" value (0 or 1).
+Like all tests in Lua, <code>lua_toboolean</code> returns 1 for any Lua value
+different from <B>false</B> and <B>nil</B>;
+otherwise it returns 0.
+It also returns 0 when called with a non-valid index.
+(If you want to accept only real boolean values,
+use <code>lua_isboolean</code> to test the type of the value.)
+
+<p><code>lua_tonumber</code> converts the Lua value at the given index
+to a number (by default, <code>lua_Number</code> is <code>double</code>).
+
+The Lua value must be a number or a string convertible to number
+(see <a href="#coercion">2.2.1</a>); otherwise, <code>lua_tonumber</code> returns 0.
+
+<p><code>lua_tostring</code> converts the Lua value at the given index to a string
+(<code>const char*</code>).
+The Lua value must be a string or a number;
+otherwise, the function returns <code>NULL</code>.
+If the value is a number,
+then <code>lua_tostring</code> also
+<em>changes the actual value in the stack to a string</em>.
+(This change confuses <code>lua_next</code>
+when <code>lua_tostring</code> is applied to keys.)
+<code>lua_tostring</code> returns a fully aligned pointer
+to a string inside the Lua state.
+This string always has a zero (<code>'\0'</code>)
+after its last character (as in C),
+but may contain other zeros in its body.
+If you do not know whether a string may contain zeros,
+you can use <code>lua_strlen</code> to get its actual length.
+Because Lua has garbage collection,
+there is no guarantee that the pointer returned by <code>lua_tostring</code>
+will be valid after the corresponding value is removed from the stack.
+If you need the string after the current function returns,
+then you should duplicate it or put it into the registry (see <a href="#registry">3.18</a>).
+
+<p><code>lua_tocfunction</code> converts a value in the stack to a C function.
+This value must be a C function;
+otherwise, <code>lua_tocfunction</code> returns <code>NULL</code>.
+The type <code>lua_CFunction</code> is explained in <a href="#LuacallC">3.16</a>.
+
+<p><code>lua_tothread</code> converts a value in the stack to a Lua thread
+(represented as <code>lua_State *</code>).
+This value must be a thread;
+otherwise, <code>lua_tothread</code> returns <code>NULL</code>.
+
+<p><code>lua_topointer</code> converts a value in the stack to a generic
+C pointer (<code>void *</code>).
+The value may be a userdata, a table, a thread, or a function;
+otherwise, <code>lua_topointer</code> returns <code>NULL</code>.
+Lua ensures that different objects of the
+same type return different pointers.
+There is no direct way to convert the pointer back to its original value.
+Typically this function is used for debug information.
+
+<p><code>lua_touserdata</code> is explained in <a href="#userdata">3.8</a>.
+
+<p><a name="pushing"><a name="3.6"><h2>3.6 - Pushing Values onto the Stack</h2></a></a>
+
+<p>The API has the following functions to
+push C values onto the stack:
+<PRE>
+ void lua_pushboolean (lua_State *L, int b);
+ void lua_pushnumber (lua_State *L, lua_Number n);
+ void lua_pushlstring (lua_State *L, const char *s, size_t len);
+ void lua_pushstring (lua_State *L, const char *s);
+ void lua_pushnil (lua_State *L);
+ void lua_pushcfunction (lua_State *L, lua_CFunction f);
+ void lua_pushlightuserdata (lua_State *L, void *p);
+</PRE>
+
+<p>
+
+
+These functions receive a C value,
+convert it to a corresponding Lua value,
+and push the result onto the stack.
+In particular, <code>lua_pushlstring</code> and <code>lua_pushstring</code>
+make an internal copy of the given string.
+<code>lua_pushstring</code> can only be used to push proper C strings
+(that is, strings that end with a zero and do not contain embedded zeros);
+otherwise, you should use the more general <code>lua_pushlstring</code>,
+which accepts an explicit size.
+
+<p>You can also push "formatted" strings:
+<PRE>
+ const char *lua_pushfstring (lua_State *L, const char *fmt, ...);
+ const char *lua_pushvfstring (lua_State *L, const char *fmt, va_list argp);
+</PRE>
+
+These functions push onto the stack a formatted string
+and return a pointer to that string.
+They are similar to <code>sprintf</code> and <code>vsprintf</code>,
+but with some important differences:
+<ul>
+<li> You do not have to allocate the space for the result:
+The result is a Lua string and Lua takes care of memory allocation
+(and deallocation, through garbage collection).
+<li> The conversion specifiers are quite restricted.
+There are no flags, widths, or precisions.
+The conversion specifiers can be simply
+`<code>%%</code>´ (inserts a `<code>%</code>´ in the string),
+`<code>%s</code>´ (inserts a zero-terminated string, with no size restrictions),
+`<code>%f</code>´ (inserts a <code>lua_Number</code>),
+`<code>%d</code>´ (inserts an <code>int</code>), and
+`<code>%c</code>´ (inserts an <code>int</code> as a character).
+</ul>
+
+<p>The function
+<PRE>
+ void lua_concat (lua_State *L, int n);
+</PRE>
+
+concatenates the <code>n</code> values at the top of the stack,
+pops them, and leaves the result at the top.
+If <code>n</code> is 1, the result is that single string
+(that is, the function does nothing);
+if <code>n</code> is 0, the result is the empty string.
+Concatenation is done following the usual semantics of Lua
+(see <a href="#concat">2.5.4</a>).
+
+<p><a name="GC-API"><a name="3.7"><h2>3.7 - Controlling Garbage Collection</h2></a></a>
+
+<p>Lua uses two numbers to control its garbage collection:
+the <em>count</em> and the <em>threshold</em> (see <a href="#GC">2.9</a>).
+The first counts the amount of memory in use by Lua;
+when the count reaches the threshold,
+Lua runs its garbage collector.
+After the collection, the count is updated
+and the threshold is set to twice the count value.
+
+<p>You can access the current values of these two numbers through the
+following functions:
+<PRE>
+ int lua_getgccount (lua_State *L);
+ int lua_getgcthreshold (lua_State *L);
+</PRE>
+
+Both return their respective values in Kbytes.
+You can change the threshold value with
+<PRE>
+ void lua_setgcthreshold (lua_State *L, int newthreshold);
+</PRE>
+
+Again, the <code>newthreshold</code> value is given in Kbytes.
+When you call this function,
+Lua sets the new threshold and checks it against the byte counter.
+If the new threshold is less than the byte counter,
+then Lua immediately runs the garbage collector.
+In particular
+<code>lua_setgcthreshold(L,0)</code> forces a garbage collection.
+After the collection,
+a new threshold is set according to the previous rule.
+
+<p><a name="userdata"><a name="3.8"><h2>3.8 - Userdata</h2></a></a>
+
+<p>Userdata represents C values in Lua.
+Lua supports two types of userdata:
+<em>full userdata</em> and <em>light userdata</em>.
+
+<p>A full userdata represents a block of memory.
+It is an object (like a table):
+You must create it, it can have its own metatable,
+and you can detect when it is being collected.
+A full userdata is only equal to itself (under raw equality).
+
+<p>A light userdata represents a pointer.
+It is a value (like a number):
+You do not create it, it has no metatables,
+it is not collected (as it was never created).
+A light userdata is equal to "any"
+light userdata with the same C address.
+
+<p>In Lua code, there is no way to test whether a userdata is full or light;
+both have type <code>userdata</code>.
+In C code, <code>lua_type</code> returns <code>LUA_TUSERDATA</code> for full userdata,
+and <code>LUA_TLIGHTUSERDATA</code> for light userdata.
+
+<p>You can create a new full userdata with the following function:
+<PRE>
+ void *lua_newuserdata (lua_State *L, size_t size);
+</PRE>
+
+This function allocates a new block of memory with the given size,
+pushes on the stack a new userdata with the block address,
+and returns this address.
+
+<p>To push a light userdata into the stack you use
+<code>lua_pushlightuserdata</code> (see <a href="#pushing">3.6</a>).
+
+<p><code>lua_touserdata</code> (see <a href="#lua-to">3.5</a>) retrieves the value of a userdata.
+When applied on a full userdata, it returns the address of its block;
+when applied on a light userdata, it returns its pointer;
+when applied on a non-userdata value, it returns <code>NULL</code>.
+
+<p>When Lua collects a full userdata,
+it calls the userdata's <code>gc</code> metamethod, if any,
+and then it frees the userdata's corresponding memory.
+
+<p><a name="3.9"><h2>3.9 - Metatables</h2></a>
+
+<p>The following functions allow you to manipulate the metatables
+of an object:
+<PRE>
+ int lua_getmetatable (lua_State *L, int index);
+ int lua_setmetatable (lua_State *L, int index);
+</PRE>
+
+<code>lua_getmetatable</code> pushes on the stack the metatable of a given object.
+If the index is not valid,
+or if the object does not have a metatable,
+<code>lua_getmetatable</code> returns 0 and pushes nothing on the stack.
+
+<p><code>lua_setmetatable</code> pops a table from the stack and
+sets it as the new metatable for the given object.
+<code>lua_setmetatable</code> returns 0 when it cannot
+set the metatable of the given object
+(that is, when the object is neither a userdata nor a table);
+even then it pops the table from the stack.
+
+<p><a name="3.10"><h2>3.10 - Loading Lua Chunks</h2></a>
+
+<p>You can load a Lua chunk with <code>lua_load</code>:
+<PRE>
+ typedef const char * (*lua_Chunkreader)
+ (lua_State *L, void *data, size_t *size);
+
+ int lua_load (lua_State *L, lua_Chunkreader reader, void *data,
+ const char *chunkname);
+</PRE>
+
+The return values of <code>lua_load</code> are:
+<ul>
+<li> 0 --- no errors;
+<li> <code>LUA_ERRSYNTAX</code> ---
+syntax error during pre-compilation.
+<li> <code>LUA_ERRMEM</code> ---
+memory allocation error.
+</ul>
+If there are no errors,
+<code>lua_load</code> pushes the compiled chunk as a Lua
+function on top of the stack.
+Otherwise, it pushes an error message.
+
+<p><code>lua_load</code> automatically detects whether the chunk is text or binary,
+and loads it accordingly (see program <code>luac</code>).
+
+<p><code>lua_load</code> uses a user-supplied <em>reader</em> function to read the chunk.
+Everytime it needs another piece of the chunk,
+<code>lua_load</code> calls the reader,
+passing along its <code>data</code> parameter.
+The reader must return a pointer to a block of memory
+with a new piece of the chunk
+and set <code>size</code> to the block size.
+To signal the end of the chunk, the reader returns <code>NULL</code>.
+The reader function may return pieces of any size greater than zero.
+
+<p>In the current implementation,
+the reader function cannot call any Lua function;
+to ensure that, it always receives <code>NULL</code> as the Lua state.
+
+<p>The <em>chunkname</em> is used for error messages
+and debug information (see <a href="#debugI">4</a>).
+
+<p>See the auxiliary library (<code>lauxlib.c</code>)
+for examples of how to use <code>lua_load</code>
+and for some ready-to-use functions to load chunks
+from files and strings.
+
+<p><a name="3.11"><h2>3.11 - Manipulating Tables</h2></a>
+
+<p>Tables are created by calling
+the function
+<PRE>
+ void lua_newtable (lua_State *L);
+</PRE>
+
+This function creates a new, empty table and pushes it onto the stack.
+
+<p>To read a value from a table that resides somewhere in the stack,
+call
+<PRE>
+ void lua_gettable (lua_State *L, int index);
+</PRE>
+
+where <code>index</code> points to the table.
+<code>lua_gettable</code> pops a key from the stack
+and returns (on the stack) the contents of the table at that key.
+The table is left where it was in the stack.
+As in Lua, this function may trigger a metamethod
+for the "index" event (see <a href="#metatable">2.8</a>).
+To get the real value of any table key,
+without invoking any metamethod,
+use the <em>raw</em> version:
+<PRE>
+ void lua_rawget (lua_State *L, int index);
+</PRE>
+
+
+<p>To store a value into a table that resides somewhere in the stack,
+you push the key and then the value onto the stack,
+and call
+<PRE>
+ void lua_settable (lua_State *L, int index);
+</PRE>
+
+where <code>index</code> points to the table.
+<code>lua_settable</code> pops from the stack both the key and the value.
+The table is left where it was in the stack.
+As in Lua, this operation may trigger a metamethod
+for the "settable" or "newindex" events.
+To set the real value of any table index,
+without invoking any metamethod,
+use the <em>raw</em> version:
+<PRE>
+ void lua_rawset (lua_State *L, int index);
+</PRE>
+
+
+<p>You can traverse a table with the function
+<PRE>
+ int lua_next (lua_State *L, int index);
+</PRE>
+
+where <code>index</code> points to the table to be traversed.
+The function pops a key from the stack,
+and pushes a key-value pair from the table
+(the "next" pair after the given key).
+If there are no more elements, then <code>lua_next</code> returns 0
+(and pushes nothing).
+Use a <B>nil</B> key to signal the start of a traversal.
+
+<p>A typical traversal looks like this:
+<PRE>
+ /* table is in the stack at index `t' */
+ lua_pushnil(L); /* first key */
+ while (lua_next(L, t) != 0) {
+ /* `key' is at index -2 and `value' at index -1 */
+ printf("%s - %s\n",
+ lua_typename(L, lua_type(L, -2)), lua_typename(L, lua_type(L, -1)));
+ lua_pop(L, 1); /* removes `value'; keeps `key' for next iteration */
+ }
+</PRE>
+
+<p>While traversing a table,
+do not call <code>lua_tostring</code> directly on a key,
+unless you know that the key is actually a string.
+Recall that <code>lua_tostring</code> <em>changes</em> the value at the given index;
+this confuses the next call to <code>lua_next</code>.
+
+<p><a name="globals"><a name="3.12"><h2>3.12 - Manipulating Environments</h2></a></a>
+
+<p>All global variables are kept in ordinary Lua tables,
+called environments.
+The initial environment is called the global environment.
+This table is always at pseudo-index <code>LUA_GLOBALSINDEX</code>.
+
+<p>To access and change the value of global variables,
+you can use regular table operations over an environment table.
+For instance, to access the value of a global variable, do
+<PRE>
+ lua_pushstring(L, varname);
+ lua_gettable(L, LUA_GLOBALSINDEX);
+</PRE>
+
+<p>You can change the global environment of a Lua thread using <code>lua_replace</code>.
+
+<p>The following functions get and set the environment of Lua functions:
+<PRE>
+ void lua_getfenv (lua_State *L, int index);
+ int lua_setfenv (lua_State *L, int index);
+</PRE>
+
+<code>lua_getfenv</code> pushes on the stack the environment table of
+the function at index <code>index</code> in the stack.
+If the function is a C function,
+<code>lua_getfenv</code> pushes the global environment.
+<code>lua_setfenv</code> pops a table from the stack and sets it as
+the new environment for the function at index <code>index</code> in the stack.
+If the object at the given index is not a Lua function,
+<code>lua_setfenv</code> returns 0.
+
+<p><a name="3.13"><h2>3.13 - Using Tables as Arrays</h2></a>
+The API has functions that help to use Lua tables as arrays,
+that is,
+tables indexed by numbers only:
+<PRE>
+ void lua_rawgeti (lua_State *L, int index, int n);
+ void lua_rawseti (lua_State *L, int index, int n);
+</PRE>
+
+
+
+<p><code>lua_rawgeti</code> pushes the value of the <em>n</em>-th element of the table
+at stack position <code>index</code>.
+<code>lua_rawseti</code> sets the value of the <em>n</em>-th element of the table
+at stack position <code>index</code> to the value at the top of the stack,
+removing this value from the stack.
+
+<p><a name="3.14"><h2>3.14 - Calling Functions</h2></a>
+
+<p>Functions defined in Lua
+and C functions registered in Lua
+can be called from the host program.
+This is done using the following protocol:
+First, the function to be called is pushed onto the stack;
+then, the arguments to the function are pushed
+in <em>direct order</em>, that is, the first argument is pushed first.
+Finally, the function is called using
+<PRE>
+ void lua_call (lua_State *L, int nargs, int nresults);
+</PRE>
+
+<code>nargs</code> is the number of arguments that you pushed onto the stack.
+All arguments and the function value are popped from the stack,
+and the function results are pushed.
+The number of results are adjusted to <code>nresults</code>,
+unless <code>nresults</code> is <code>LUA_MULTRET</code>.
+In that case, <em>all</em> results from the function are pushed.
+Lua takes care that the returned values fit into the stack space.
+The function results are pushed onto the stack in direct order
+(the first result is pushed first),
+so that after the call the last result is on the top.
+
+<p>The following example shows how the host program may do the
+equivalent to this Lua code:
+<PRE>
+ a = f("how", t.x, 14)
+</PRE>
+Here it is in C:
+<PRE>
+ lua_pushstring(L, "t");
+ lua_gettable(L, LUA_GLOBALSINDEX); /* global `t' (for later use) */
+ lua_pushstring(L, "a"); /* var name */
+ lua_pushstring(L, "f"); /* function name */
+ lua_gettable(L, LUA_GLOBALSINDEX); /* function to be called */
+ lua_pushstring(L, "how"); /* 1st argument */
+ lua_pushstring(L, "x"); /* push the string "x" */
+ lua_gettable(L, -5); /* push result of t.x (2nd arg) */
+ lua_pushnumber(L, 14); /* 3rd argument */
+ lua_call(L, 3, 1); /* call function with 3 arguments and 1 result */
+ lua_settable(L, LUA_GLOBALSINDEX); /* set global variable `a' */
+ lua_pop(L, 1); /* remove `t' from the stack */
+</PRE>
+Note that the code above is "balanced":
+at its end, the stack is back to its original configuration.
+This is considered good programming practice.
+
+<p>(We did this example using only the raw functions provided by Lua's API,
+to show all the details.
+Usually programmers define and use several macros and auxiliary functions
+that provide higher level access to Lua.
+See the source code of the standard libraries for examples.)
+
+<p><a name="lua_pcall"><a name="3.15"><h2>3.15 - Protected Calls</h2></a></a>
+
+<p>When you call a function with <code>lua_call</code>,
+any error inside the called function is propagated upwards
+(with a <code>longjmp</code>).
+If you need to handle errors,
+then you should use <code>lua_pcall</code>:
+<PRE>
+ int lua_pcall (lua_State *L, int nargs, int nresults, int errfunc);
+</PRE>
+Both <code>nargs</code> and <code>nresults</code> have the same meaning as
+in <code>lua_call</code>.
+If there are no errors during the call,
+<code>lua_pcall</code> behaves exactly like <code>lua_call</code>.
+However, if there is any error,
+<code>lua_pcall</code> catches it,
+pushes a single value at the stack (the error message),
+and returns an error code.
+Like <code>lua_call</code>,
+<code>lua_pcall</code> always removes the function
+and its arguments from the stack.
+
+<p>If <code>errfunc</code> is 0,
+then the error message returned is exactly the original error message.
+Otherwise, <code>errfunc</code> gives the stack index for an
+<em>error handler function</em>.
+(In the current implementation, that index cannot be a pseudo-index.)
+In case of runtime errors,
+that function will be called with the error message
+and its return value will be the message returned by <code>lua_pcall</code>.
+
+<p>Typically, the error handler function is used to add more debug
+information to the error message, such as a stack traceback.
+Such information cannot be gathered after the return of <code>lua_pcall</code>,
+since by then the stack has unwound.
+
+<p>The <code>lua_pcall</code> function returns 0 in case of success
+or one of the following error codes
+(defined in <code>lua.h</code>):
+<ul>
+<li> <code>LUA_ERRRUN</code> --- a runtime error.
+<li> <code>LUA_ERRMEM</code> --- memory allocation error.
+For such errors, Lua does not call the error handler function.
+<li> <code>LUA_ERRERR</code> ---
+error while running the error handler function.
+</ul>
+
+<p><a name="LuacallC"><a name="3.16"><h2>3.16 - Defining C Functions</h2></a></a>
+
+<p>Lua can be extended with functions written in C.
+These functions must be of type <code>lua_CFunction</code>,
+which is defined as
+<PRE>
+ typedef int (*lua_CFunction) (lua_State *L);
+</PRE>
+
+A C function receives a Lua state and returns an integer,
+the number of values it wants to return to Lua.
+
+<p>In order to communicate properly with Lua,
+a C function must follow the following protocol,
+which defines the way parameters and results are passed:
+A C function receives its arguments from Lua in its stack
+in direct order (the first argument is pushed first).
+So, when the function starts,
+its first argument (if any) is at index 1.
+To return values to Lua, a C function just pushes them onto the stack,
+in direct order (the first result is pushed first),
+and returns the number of results.
+Any other value in the stack below the results will be properly
+discharged by Lua.
+Like a Lua function, a C function called by Lua can also return
+many results.
+
+<p>As an example, the following function receives a variable number
+of numerical arguments and returns their average and sum:
+<PRE>
+ static int foo (lua_State *L) {
+ int n = lua_gettop(L); /* number of arguments */
+ lua_Number sum = 0;
+ int i;
+ for (i = 1; i <= n; i++) {
+ if (!lua_isnumber(L, i)) {
+ lua_pushstring(L, "incorrect argument to function `average'");
+ lua_error(L);
+ }
+ sum += lua_tonumber(L, i);
+ }
+ lua_pushnumber(L, sum/n); /* first result */
+ lua_pushnumber(L, sum); /* second result */
+ return 2; /* number of results */
+ }
+</PRE>
+
+<p>To register a C function to Lua,
+there is the following convenience macro:
+<PRE>
+ #define lua_register(L,n,f) \
+ (lua_pushstring(L, n), \
+ lua_pushcfunction(L, f), \
+ lua_settable(L, LUA_GLOBALSINDEX))
+ /* lua_State *L; */
+ /* const char *n; */
+ /* lua_CFunction f; */
+</PRE>
+
+which receives the name the function will have in Lua
+and a pointer to the function.
+Thus,
+the C function <code>foo</code> above may be registered in Lua as
+<code>average</code> by calling
+<PRE>
+ lua_register(L, "average", foo);
+</PRE>
+
+<p><a name="c-closure"><a name="3.17"><h2>3.17 - Defining C Closures</h2></a></a>
+
+<p>When a C function is created,
+it is possible to associate some values with it,
+thus creating a <em>C closure</em>;
+these values are then accessible to the function whenever it is called.
+To associate values with a C function,
+first these values should be pushed onto the stack
+(when there are multiple values, the first value is pushed first).
+Then the function
+<PRE>
+ void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n);
+</PRE>
+
+is used to push the C function onto the stack,
+with the argument <code>n</code> telling how many values should be
+associated with the function
+(<code>lua_pushcclosure</code> also pops these values from the stack);
+in fact, the macro <code>lua_pushcfunction</code> is defined as
+<code>lua_pushcclosure</code> with <code>n</code> set to 0.
+
+<p>Then, whenever the C function is called,
+those values are located at specific pseudo-indices.
+Those pseudo-indices are produced by a macro <code>lua_upvalueindex</code>.
+The first value associated with a function is at position
+<code>lua_upvalueindex(1)</code>, and so on.
+Any access to <code>lua_upvalueindex(<em>n</em>)</code>,
+where <em>n</em> is greater than the number of upvalues of the
+current function,
+produces an acceptable (but invalid) index.
+
+<p>For examples of C functions and closures,
+see the standard libraries in the official Lua distribution
+(<code>src/lib/*.c</code>).
+
+<p><a name="registry"><a name="3.18"><h2>3.18 - Registry</h2></a></a>
+
+<p>Lua provides a registry,
+a pre-defined table that can be used by any C code to
+store whatever Lua value it needs to store,
+specially if the C code needs to keep that Lua value
+outside the life span of a C function.
+This table is always located at pseudo-index
+<code>LUA_REGISTRYINDEX</code>.
+Any C library can store data into this table,
+as long as it chooses keys different from other libraries.
+Typically, you should use as key a string containing your library name
+or a light userdata with the address of a C object in your code.
+
+<p>The integer keys in the registry are used by the reference mechanism,
+implemented by the auxiliary library,
+and therefore should not be used by other purposes.
+
+<p><a name="3.19"><h2>3.19 - Error Handling in C</h2></a>
+
+<p>Internally, Lua uses the C <code>longjmp</code> facility to handle errors.
+When Lua faces any error
+(such as memory allocation errors, type errors, syntax errors)
+it <em>raises</em> an error, that is, it does a long jump.
+A <em>protected environment</em> uses <code>setjmp</code>
+to set a recover point;
+any error jumps to the most recent active recover point.
+
+<p>If an error happens outside any protected environment,
+Lua calls a <em>panic function</em>
+and then calls <code>exit(EXIT_FAILURE)</code>.
+You can change the panic function with
+<PRE>
+ lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf);
+</PRE>
+Your new panic function may avoid the application exit by
+never returning (e.g., by doing a long jump).
+Nevertheless, the corresponding Lua state will not be consistent;
+the only safe operation with it is to close it.
+
+<p>Almost any function in the API may raise an error,
+for instance due to a memory allocation error.
+The following functions run in protected mode
+(that is, they create a protected environment to run),
+so they never raise an error:
+<code>lua_open</code>, <code>lua_close</code>, <code>lua_load</code>,
+and <code>lua_pcall</code>.
+
+<p>There is yet another function that runs a given C function in protected mode:
+<PRE>
+ int lua_cpcall (lua_State *L, lua_CFunction func, void *ud);
+</PRE>
+
+<code>lua_cpcall</code> calls <code>func</code> in protected mode.
+<code>func</code> starts with only one element in its stack,
+a light userdata containing <code>ud</code>.
+In case of errors,
+<code>lua_cpcall</code> returns the same error codes as <code>lua_pcall</code>
+(see <a href="#lua_pcall">3.15</a>),
+plus the error object on the top of the stack;
+otherwise, it returns zero, and does not change the stack.
+Any value returned by <code>func</code> is discarded.
+
+<p>C code can generate a Lua error calling the function
+<PRE>
+ void lua_error (lua_State *L);
+</PRE>
+
+The error message (which actually can be any type of object)
+must be on the stack top.
+This function does a long jump,
+and therefore never returns.
+
+<p><a name="3.20"><h2>3.20 - Threads</h2></a>
+
+<p>Lua offers partial support for multiple threads of execution.
+If you have a C library that offers multi-threading,
+then Lua can cooperate with it to implement the equivalent facility in Lua.
+Also, Lua implements its own coroutine system on top of threads.
+The following function creates a new thread in Lua:
+<PRE>
+ lua_State *lua_newthread (lua_State *L);
+</PRE>
+
+This function pushes the thread on the stack and returns a pointer to
+a <code>lua_State</code> that represents this new thread.
+The new state returned by this function shares with the original state
+all global objects (such as tables),
+but has an independent run-time stack.
+
+<p>Each thread has an independent global environment table.
+When you create a thread, this table is the same as that of the given state,
+but you can change each one independently.
+
+<p>There is no explicit function to close or to destroy a thread.
+Threads are subject to garbage collection,
+like any Lua object.
+
+<p>To manipulate threads as coroutines,
+Lua offers the following functions:
+<PRE>
+ int lua_resume (lua_State *L, int narg);
+ int lua_yield (lua_State *L, int nresults);
+</PRE>
+
+To start a coroutine, you first create a new thread;
+then you push on its stack the body function plus any eventual arguments;
+then you call <code>lua_resume</code>,
+with <code>narg</code> being the number of arguments.
+This call returns when the coroutine suspends or finishes its execution.
+When it returns, the stack contains all values passed to <code>lua_yield</code>,
+or all values returned by the body function.
+<code>lua_resume</code> returns 0 if there are no errors running the coroutine,
+or an error code (see <a href="#lua_pcall">3.15</a>).
+In case of errors,
+the stack contains only the error message.
+To restart a coroutine, you put on its stack only the values to
+be passed as results from <code>yield</code>,
+and then call <code>lua_resume</code>.
+
+<p>The <code>lua_yield</code> function can only be called as the
+return expression of a C function, as follows:
+<PRE>
+ return lua_yield (L, nresults);
+</PRE>
+When a C function calls <code>lua_yield</code> in that way,
+the running coroutine suspends its execution,
+and the call to <code>lua_resume</code> that started this coroutine returns.
+The parameter <code>nresults</code> is the number of values from the stack
+that are passed as results to <code>lua_resume</code>.
+
+<p>To exchange values between different threads,
+you may use <code>lua_xmove</code>:
+<PRE>
+ void lua_xmove (lua_State *from, lua_State *to, int n);
+</PRE>
+It pops <code>n</code> values from the stack <code>from</code>,
+and puhses them into the stack <code>to</code>.
+
+<p>
+<a name="debugI"><a name="4"><h1>4 - The Debug Interface</h1></a></a>
+
+<p>Lua has no built-in debugging facilities.
+Instead, it offers a special interface
+by means of functions and <em>hooks</em>.
+This interface allows the construction of different
+kinds of debuggers, profilers, and other tools
+that need "inside information" from the interpreter.
+
+<p><a name="4.1"><h2>4.1 - Stack and Function Information</h2></a>
+
+<p>The main function to get information about the interpreter runtime stack is
+<PRE>
+ int lua_getstack (lua_State *L, int level, lua_Debug *ar);
+</PRE>
+
+This function fills parts of a <code>lua_Debug</code> structure with
+an identification of the <em>activation record</em>
+of the function executing at a given level.
+Level 0 is the current running function,
+whereas level <em>n+1</em> is the function that has called level <em>n</em>.
+When there are no errors, <code>lua_getstack</code> returns 1;
+when called with a level greater than the stack depth,
+it returns 0.
+
+<p>The structure <code>lua_Debug</code> is used to carry different pieces of
+information about an active function:
+<PRE>
+ typedef struct lua_Debug {
+ int event;
+ const char *name; /* (n) */
+ const char *namewhat; /* (n) `global', `local', `field', `method' */
+ const char *what; /* (S) `Lua' function, `C' function, Lua `main' */
+ const char *source; /* (S) */
+ int currentline; /* (l) */
+ int nups; /* (u) number of upvalues */
+ int linedefined; /* (S) */
+ char short_src[LUA_IDSIZE]; /* (S) */
+
+ /* private part */
+ ...
+ } lua_Debug;
+</PRE>
+
+<code>lua_getstack</code> fills only the private part
+of this structure, for later use.
+To fill the other fields of <code>lua_Debug</code> with useful information,
+call
+<PRE>
+ int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar);
+</PRE>
+
+This function returns 0 on error
+(for instance, an invalid option in <code>what</code>).
+Each character in the string <code>what</code>
+selects some fields of the structure <code>ar</code> to be filled,
+as indicated by the letter in parentheses in the definition of <code>lua_Debug</code>
+above:
+`<code>S</code>´ fills in the fields <code>source</code>, <code>linedefined</code>,
+and <code>what</code>;
+`<code>l</code>´ fills in the field <code>currentline</code>, etc.
+Moreover, `<code>f</code>´ pushes onto the stack the function that is
+running at the given level.
+
+<p>To get information about a function that is not active
+(that is, not in the stack),
+you push it onto the stack
+and start the <code>what</code> string with the character `<code>></code>´.
+For instance, to know in which line a function <code>f</code> was defined,
+you can write
+<PRE>
+ lua_Debug ar;
+ lua_pushstring(L, "f");
+ lua_gettable(L, LUA_GLOBALSINDEX); /* get global `f' */
+ lua_getinfo(L, ">S", &ar);
+ printf("%d\n", ar.linedefined);
+</PRE>
+The fields of <code>lua_Debug</code> have the following meaning:
+<ul>
+
+<p><li><b><code>source</code></b>
+If the function was defined in a string,
+then <code>source</code> is that string.
+If the function was defined in a file,
+then <code>source</code> starts with a `<code>@</code>´ followed by the file name.
+
+<p><li><b><code>short_src</code></b>
+A "printable" version of <code>source</code>, to be used in error messages.
+
+<p><li><b><code>linedefined</code></b>
+the line number where the definition of the function starts.
+
+<p><li><b><code>what</code></b> the string <code>"Lua"</code> if this is a Lua function,
+<code>"C"</code> if this is a C function,
+<code>"main"</code> if this is the main part of a chunk,
+and <code>"tail"</code> if this was a function that did a tail call.
+In the latter case,
+Lua has no other information about this function.
+
+<p><li><b><code>currentline</code></b>
+the current line where the given function is executing.
+When no line information is available,
+<code>currentline</code> is set to <em>-1</em>.
+
+<p><li><b><code>name</code></b>
+a reasonable name for the given function.
+Because functions in Lua are first class values,
+they do not have a fixed name:
+Some functions may be the value of multiple global variables,
+while others may be stored only in a table field.
+The <code>lua_getinfo</code> function checks how the function was
+called or whether it is the value of a global variable to
+find a suitable name.
+If it cannot find a name,
+then <code>name</code> is set to <code>NULL</code>.
+
+<p><li><b><code>namewhat</code></b>
+Explains the <code>name</code> field.
+The value of <code>namewhat</code> can be
+<code>"global"</code>, <code>"local"</code>, <code>"method"</code>,
+<code>"field"</code>, or <code>""</code> (the empty string),
+according to how the function was called.
+(Lua uses the empty string when no other option seems to apply.)
+
+<p><li><b><code>nups</code></b>
+The number of upvalues of the function.
+
+<p></ul>
+
+<p><a name="4.2"><h2>4.2 - Manipulating Local Variables and Upvalues</h2></a>
+
+<p>For the manipulation of local variables and upvalues,
+the debug interface uses indices:
+The first parameter or local variable has index 1, and so on,
+until the last active local variable.
+Upvalues have no particular order,
+as they are active through the whole function.
+
+<p>The following functions allow the manipulation of the
+local variables of a given activation record:
+<PRE>
+ const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n);
+ const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n);
+</PRE>
+
+The parameter <code>ar</code> must be a valid activation record that was
+filled by a previous call to <code>lua_getstack</code> or
+given as argument to a hook (see <a href="#sub-hooks">4.3</a>).
+<code>lua_getlocal</code> gets the index <code>n</code> of a local variable,
+pushes the variable's value onto the stack,
+and returns its name.
+<code>lua_setlocal</code> assigns the value at the top of the stack
+to the variable and returns its name.
+Both functions return <code>NULL</code>
+when the index is greater than
+the number of active local variables.
+
+<p>The following functions allow the manipulation of the
+upvalues of a given function
+(unlike local variables,
+the upvalues of a function are accessible even when the
+function is not active):
+<PRE>
+ const char *lua_getupvalue (lua_State *L, int funcindex, int n);
+ const char *lua_setupvalue (lua_State *L, int funcindex, int n);
+</PRE>
+
+These functions operate both on Lua functions and on C functions.
+(For Lua functions,
+upvalues are the external local variables that the function uses,
+and that consequently are included in its closure.)
+<code>funcindex</code> points to a function in the stack.
+<code>lua_getpuvalue</code> gets the index <code>n</code> of an upvalue,
+pushes the upvalue's value onto the stack,
+and returns its name.
+<code>lua_setupvalue</code> assigns the value at the top of the stack
+to the upvalue and returns its name.
+Both functions return <code>NULL</code>
+when the index is greater than the number of upvalues.
+For C functions, these functions use the empty string <code>""</code>
+as a name for all upvalues.
+
+<p>As an example, the following function lists the names of all
+local variables and upvalues for a function at a given level of the stack:
+<PRE>
+ int listvars (lua_State *L, int level) {
+ lua_Debug ar;
+ int i;
+ const char *name;
+ if (lua_getstack(L, level, &ar) == 0)
+ return 0; /* failure: no such level in the stack */
+ i = 1;
+ while ((name = lua_getlocal(L, &ar, i++)) != NULL) {
+ printf("local %d %s\n", i-1, name);
+ lua_pop(L, 1); /* remove variable value */
+ }
+ lua_getinfo(L, "f", &ar); /* retrieves function */
+ i = 1;
+ while ((name = lua_getpuvalue(L, -1, i++)) != NULL) {
+ printf("upvalue %d %s\n", i-1, name);
+ lua_pop(L, 1); /* remove upvalue value */
+ }
+ return 1;
+ }
+</PRE>
+
+<p><a name="sub-hooks"><a name="4.3"><h2>4.3 - Hooks</h2></a></a>
+
+<p>Lua offers a mechanism of hooks, which are
+user-defined C functions that are called during the program execution.
+A hook may be called in four different events:
+a <em>call</em> event, when Lua calls a function;
+a <em>return</em> event, when Lua returns from a function;
+a <em>line</em> event, when Lua starts executing a new line of code;
+and a <em>count</em> event, which happens every "count" instructions.
+Lua identifies these events with the following constants:
+<code>LUA_HOOKCALL</code>,
+<code>LUA_HOOKRET</code> (or <code>LUA_HOOKTAILRET</code>, see below),
+<code>LUA_HOOKLINE</code>,
+and <code>LUA_HOOKCOUNT</code>.
+
+<p>A hook has type <code>lua_Hook</code>, defined as follows:
+<PRE>
+ typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar);
+</PRE>
+
+You can set the hook with the following function:
+<PRE>
+ int lua_sethook (lua_State *L, lua_Hook func, int mask, int count);
+</PRE>
+
+<code>func</code> is the hook.
+<code>mask</code> specifies on which events the hook will be called:
+It is formed by a disjunction of the constants
+<code>LUA_MASKCALL</code>,
+<code>LUA_MASKRET</code>,
+<code>LUA_MASKLINE</code>,
+and <code>LUA_MASKCOUNT</code>.
+The <code>count</code> argument is only meaningful when the mask
+includes <code>LUA_MASKCOUNT</code>.
+For each event, the hook is called as explained below:
+<ul>
+<li><b>The call hook</b> is called when the interpreter calls a function.
+The hook is called just after Lua enters the new function.
+<li><b>The return hook</b> is called when the interpreter returns from a function.
+The hook is called just before Lua leaves the function.
+<li><b>The line hook</b> is called when the interpreter is about to
+start the execution of a new line of code,
+or when it jumps back in the code (even to the same line).
+(This event only happens while Lua is executing a Lua function.)
+<li><b>The count hook</b> is called after the interpreter executes every
+<code>count</code> instructions.
+(This event only happens while Lua is executing a Lua function.)
+</ul>
+
+<p>A hook is disabled by setting <code>mask</code> to zero.
+
+<p>You can get the current hook, the current mask,
+and the current count with the next functions:
+<PRE>
+ lua_Hook lua_gethook (lua_State *L);
+ int lua_gethookmask (lua_State *L);
+ int lua_gethookcount (lua_State *L);
+</PRE>
+
+
+<p>Whenever a hook is called, its <code>ar</code> argument has its field
+<code>event</code> set to the specific event that triggered the hook.
+Moreover, for line events, the field <code>currentline</code> is also set.
+To get the value of any other field in <code>ar</code>,
+the hook must call <code>lua_getinfo</code>.
+For return events, <code>event</code> may be <code>LUA_HOOKRET</code>,
+the normal value, or <code>LUA_HOOKTAILRET</code>.
+In the latter case, Lua is simulating a return from
+a function that did a tail call;
+in this case, it is useless to call <code>lua_getinfo</code>.
+
+<p>While Lua is running a hook, it disables other calls to hooks.
+Therefore, if a hook calls back Lua to execute a function or a chunk,
+that execution occurs without any calls to hooks.
+
+<p>
+<a name="libraries"><a name="5"><h1>5 - Standard Libraries</h1></a></a>
+
+<p>The standard libraries provide useful functions
+that are implemented directly through the C API.
+Some of these functions provide essential services to the language
+(e.g., <code>type</code> and <code>getmetatable</code>);
+others provide access to "outside" services (e.g., I/O);
+and others could be implemented in Lua itself,
+but are quite useful or have critical performance to
+deserve an implementation in C (e.g., <code>sort</code>).
+
+<p>All libraries are implemented through the official C API
+and are provided as separate C modules.
+Currently, Lua has the following standard libraries:
+<ul>
+<li> basic library;
+<li> string manipulation;
+<li> table manipulation;
+<li> mathematical functions (sin, log, etc.);
+<li> input and output;
+<li> operating system facilities;
+<li> debug facilities.
+</ul>
+Except for the basic library,
+each library provides all its functions as fields of a global table
+or as methods of its objects.
+
+<p>To have access to these libraries,
+the C host program must first call the functions
+<code>luaopen_base</code> (for the basic library),
+<code>luaopen_string</code> (for the string library),
+<code>luaopen_table</code> (for the table library),
+<code>luaopen_math</code> (for the mathematical library),
+<code>luaopen_io</code> (for the I/O and the Operating System libraries),
+and <code>luaopen_debug</code> (for the debug library).
+These functions are declared in <code>lualib.h</code>.
+
+
+
+
+
+
+
+<p><a name="predefined"><a name="5.1"><h2>5.1 - Basic Functions</h2></a></a>
+
+<p>The basic library provides some core functions to Lua.
+If you do not include this library in your application,
+you should check carefully whether you need to provide some alternative
+implementation for some of its facilities.
+
+<p><h3><code>assert (v [, message])</code></h3>
+Issues an error when
+the value of its argument <code>v</code> is <B>nil</B> or <B>false</B>;
+otherwise, returns this value.
+<code>message</code> is an error message;
+when absent, it defaults to "assertion failed!"
+
+<p><h3><code>collectgarbage ([limit])</code></h3>
+
+<p>Sets the garbage-collection threshold to the given limit
+(in Kbytes) and checks it against the byte counter.
+If the new threshold is smaller than the byte counter,
+then Lua immediately runs the garbage collector (see <a href="#GC">2.9</a>).
+If <code>limit</code> is absent, it defaults to zero
+(thus forcing a garbage-collection cycle).
+
+<p><h3><code>dofile (filename)</code></h3>
+Opens the named file and executes its contents as a Lua chunk.
+When called without arguments,
+<code>dofile</code> executes the contents of the standard input (<code>stdin</code>).
+Returns any value returned by the chunk.
+In case of errors, <code>dofile</code> propagates the error
+to its caller (that is, it does not run in protected mode).
+
+<p><a name="pdf-error"><h3><code>error (message [, level])</code></h3></a>
+
+Terminates the last protected function called
+and returns <code>message</code> as the error message.
+Function <code>error</code> never returns.
+
+<p>The <code>level</code> argument specifies where the error
+message points the error.
+With level 1 (the default), the error position is where the
+<code>error</code> function was called.
+Level 2 points the error to where the function
+that called <code>error</code> was called; and so on.
+
+<p><h3><code>_G</code></h3>
+A global variable (not a function) that
+holds the global environment (that is, <code>_G._G = _G</code>).
+Lua itself does not use this variable;
+changing its value does not affect any environment.
+(Use <code>setfenv</code> to change environments.)
+
+<p><h3><code>getfenv (f)</code></h3>
+Returns the current environment in use by the function.
+<code>f</code> can be a Lua function or a number,
+which specifies the function at that stack level:
+Level 1 is the function calling <code>getfenv</code>.
+If the given function is not a Lua function,
+or if <code>f</code> is 0,
+<code>getfenv</code> returns the global environment.
+The default for <code>f</code> is 1.
+
+<p>If the environment has a <code>"__fenv"</code> field,
+returns the associated value, instead of the environment.
+
+<p><a name="pdf-getmetatable"><h3><code>getmetatable (object)</code></h3></a>
+
+
+<p>If the object does not have a metatable, returns <B>nil</B>.
+Otherwise,
+if the object's metatable has a <code>"__metatable"</code> field,
+returns the associated value.
+Otherwise, returns the metatable of the given object.
+
+<p><h3><code>gcinfo ()</code></h3>
+
+<p>Returns two results:
+the number of Kbytes of dynamic memory that Lua is using
+and the current garbage collector threshold (also in Kbytes).
+
+<p><h3><code>ipairs (t)</code></h3>
+
+<p>Returns an iterator function, the table <code>t</code>, and 0,
+so that the construction
+<PRE>
+ for i,v in ipairs(t) do ... end
+</PRE>
+will iterate over the pairs (<code>1,t[1]</code>), (<code>2,t[2]</code>), ...,
+up to the first integer key with a nil value in the table.
+
+<p><h3><code>loadfile (filename)</code></h3>
+
+<p>Loads a file as a Lua chunk (without running it).
+If there are no errors,
+returns the compiled chunk as a function;
+otherwise, returns <B>nil</B> plus the error message.
+The environment of the returned function is the global environment.
+
+<p><h3><code>loadlib (libname, funcname)</code></h3>
+
+<p>Links the program with the dynamic C library <code>libname</code>.
+Inside this library, looks for a function <code>funcname</code>
+and returns this function as a C function.
+
+<p><code>libname</code> must be the complete file name of the C library,
+including any eventual path and extension.
+
+<p>This function is not supported by ANSI C.
+As such, it is only available on some platforms
+(Windows, Linux, Solaris, BSD, plus other Unix systems that
+support the <code>dlfcn</code> standard).
+
+<p><h3><code>loadstring (string [, chunkname])</code></h3>
+Loads a string as a Lua chunk (without running it).
+If there are no errors,
+returns the compiled chunk as a function;
+otherwise, returns <B>nil</B> plus the error message.
+The environment of the returned function is the global environment.
+
+<p>The optional parameter <code>chunkname</code>
+is the name to be used in error messages and debug information.
+
+<p>To load and run a given string, use the idiom
+<PRE>
+ assert(loadstring(s))()
+</PRE>
+
+<p><h3><code>next (table [, index])</code></h3>
+Allows a program to traverse all fields of a table.
+Its first argument is a table and its second argument
+is an index in this table.
+<code>next</code> returns the next index of the table and the
+value associated with the index.
+When called with <B>nil</B> as its second argument,
+<code>next</code> returns the first index
+of the table and its associated value.
+When called with the last index,
+or with <B>nil</B> in an empty table,
+<code>next</code> returns <B>nil</B>.
+If the second argument is absent, then it is interpreted as <B>nil</B>.
+
+<p>Lua has no declaration of fields;
+There is no difference between a
+field not present in a table or a field with value <B>nil</B>.
+Therefore, <code>next</code> only considers fields with non-<B>nil</B> values.
+The order in which the indices are enumerated is not specified,
+<em>even for numeric indices</em>.
+(To traverse a table in numeric order,
+use a numerical <b>for</b> or the <code>ipairs</code> function.)
+
+<p>The behavior of <code>next</code> is <em>undefined</em> if,
+during the traversal,
+you assign any value to a non-existent field in the table.
+
+<p><h3><code>pairs (t)</code></h3>
+
+<p>Returns the <code>next</code> function and the table <code>t</code> (plus a <B>nil</B>),
+so that the construction
+<PRE>
+ for k,v in pairs(t) do ... end
+</PRE>
+will iterate over all key-value pairs of table <code>t</code>.
+
+<p><a name="pdf-pcall"><h3><code>pcall (f, arg1, arg2, ...)</code></h3></a>
+
+<p>Calls function <code>f</code> with
+the given arguments in protected mode.
+That means that any error inside <code>f</code> is not propagated;
+instead, <code>pcall</code> catches the error
+and returns a status code.
+Its first result is the status code (a boolean),
+which is <B>true</B> if the call succeeds without errors.
+In such case, <code>pcall</code> also returns all results from the call,
+after this first result.
+In case of any error, <code>pcall</code> returns <B>false</B> plus the error message.
+
+<p><h3><code>print (e1, e2, ...)</code></h3>
+Receives any number of arguments,
+and prints their values in <code>stdout</code>,
+using the <code>tostring</code> function to convert them to strings.
+This function is not intended for formatted output,
+but only as a quick way to show a value,
+typically for debugging.
+For formatted output, use <code>format</code> (see <a href="#format">5.3</a>).
+
+<p><h3><code>rawequal (v1, v2)</code></h3>
+Checks whether <code>v1</code> is equal to <code>v2</code>,
+without invoking any metamethod.
+Returns a boolean.
+
+<p><h3><code>rawget (table, index)</code></h3>
+Gets the real value of <code>table[index]</code>,
+without invoking any metamethod.
+<code>table</code> must be a table;
+<code>index</code> is any value different from <B>nil</B>.
+
+<p><h3><code>rawset (table, index, value)</code></h3>
+Sets the real value of <code>table[index]</code> to <code>value</code>,
+without invoking any metamethod.
+<code>table</code> must be a table,
+<code>index</code> is any value different from <B>nil</B>,
+and <code>value</code> is any Lua value.
+
+<p><h3><code>require (packagename)</code></h3>
+
+<p>Loads the given package.
+The function starts by looking into the table <code>_LOADED</code>
+to determine whether <code>packagename</code> is already loaded.
+If it is, then <code>require</code> returns the value that the package
+returned when it was first loaded.
+Otherwise, it searches a path looking for a file to load.
+
+<p>If the global variable <code>LUA_PATH</code> is a string,
+this string is the path.
+Otherwise, <code>require</code> tries the environment variable <code>LUA_PATH</code>.
+As a last resort, it uses the predefined path <code>"?;?.lua"</code>.
+
+<p>The path is a sequence of <em>templates</em> separated by semicolons.
+For each template, <code>require</code> will change each interrogation
+mark in the template to <code>packagename</code>,
+and then will try to load the resulting file name.
+So, for instance, if the path is
+<PRE>
+ "./?.lua;./?.lc;/usr/local/?/?.lua;/lasttry"
+</PRE>
+a <code>require "mod"</code> will try to load the files
+<code>./mod.lua</code>,
+<code>./mod.lc</code>,
+<code>/usr/local/mod/mod.lua</code>,
+and <code>/lasttry</code>, in that order.
+
+<p>The function stops the search as soon as it can load a file,
+and then it runs the file.
+After that, it associates, in table <code>_LOADED</code>,
+the package name with the value that the package returned,
+and returns that value.
+If the package returns <B>nil</B> (or no value),
+<code>require</code> converts this value to <B>true</B>.
+If the package returns <B>false</B>,
+<code>require</code> also returns <B>false</B>.
+However, as the mark in table <code>_LOADED</code> is <B>false</B>,
+any new attempt to reload the file
+will happen as if the package was not loaded
+(that is, the package will be loaded again).
+
+<p>If there is any error loading or running the file,
+or if it cannot find any file in the path,
+then <code>require</code> signals an error.
+
+<p>While running a file,
+<code>require</code> defines the global variable <code>_REQUIREDNAME</code>
+with the package name.
+The package being loaded always runs within the global environment.
+
+<p><a name="setfenv"><h3><code>setfenv (f, table)</code></h3></a>
+
+<p>Sets the current environment to be used by the given function.
+<code>f</code> can be a Lua function or a number,
+which specifies the function at that stack level:
+Level 1 is the function calling <code>setfenv</code>.
+
+<p>As a special case, when <code>f</code> is 0 <code>setfenv</code> changes
+the global environment of the running thread.
+
+<p>If the original environment has a <code>"__fenv"</code> field,
+<code>setfenv</code> raises an error.
+
+<p><h3><code>setmetatable (table, metatable)</code></h3>
+
+<p>Sets the metatable for the given table.
+(You cannot change the metatable of a userdata from Lua.)
+If <code>metatable</code> is <B>nil</B>, removes the metatable of the given table.
+If the original metatable has a <code>"__metatable"</code> field,
+raises an error.
+
+<p><h3><code>tonumber (e [, base])</code></h3>
+Tries to convert its argument to a number.
+If the argument is already a number or a string convertible
+to a number, then <code>tonumber</code> returns that number;
+otherwise, it returns <B>nil</B>.
+
+<p>An optional argument specifies the base to interpret the numeral.
+The base may be any integer between 2 and 36, inclusive.
+In bases above 10, the letter `<code>A</code>´ (in either upper or lower case)
+represents 10, `<code>B</code>´ represents 11, and so forth,
+with `<code>Z</code>´ representing 35.
+In base 10 (the default), the number may have a decimal part,
+as well as an optional exponent part (see <a href="#coercion">2.2.1</a>).
+In other bases, only unsigned integers are accepted.
+
+<p><h3><code>tostring (e)</code></h3>
+Receives an argument of any type and
+converts it to a string in a reasonable format.
+For complete control of how numbers are converted,
+use <code>format</code> (see <a href="#format">5.3</a>).
+
+<p>If the metatable of <code>e</code> has a <code>"__tostring"</code> field,
+<code>tostring</code> calls the corresponding value
+with <code>e</code> as argument,
+and uses the result of the call as its result.
+
+<p><a name="pdf-type"><h3><code>type (v)</code></h3></a>
+Returns the type of its only argument, coded as a string.
+The possible results of this function are
+<code>"nil"</code> (a string, not the value <B>nil</B>),
+<code>"number"</code>,
+<code>"string"</code>,
+<code>"boolean</code>,
+<code>"table"</code>,
+<code>"function"</code>,
+<code>"thread"</code>,
+and <code>"userdata"</code>.
+
+<p><h3><code>unpack (list)</code></h3>
+Returns all elements from the given list.
+This function is equivalent to
+<PRE>
+ return list[1], list[2], ..., list[n]
+</PRE>
+except that the above code can be written only for a fixed <em>n</em>.
+The number <em>n</em> is the size of the list,
+as defined for the <code>table.getn</code> function.
+
+<p><h3><code>_VERSION</code></h3>
+A global variable (not a function) that
+holds a string containing the current interpreter version.
+The current content of this string is <code>"Lua 5.0"</code>.
+
+<p><h3><code>xpcall (f, err)</code></h3>
+
+<p>This function is similar to <code>pcall</code>,
+except that you can set a new error handler.
+
+<p><code>xpcall</code> calls function <code>f</code> in protected mode,
+using <code>err</code> as the error handler.
+Any error inside <code>f</code> is not propagated;
+instead, <code>xpcall</code> catches the error,
+calls the <code>err</code> function with the original error object,
+and returns a status code.
+Its first result is the status code (a boolean),
+which is true if the call succeeds without errors.
+In such case, <code>xpcall</code> also returns all results from the call,
+after this first result.
+In case of any error,
+<code>xpcall</code> returns false plus the result from <code>err</code>.
+
+<p><a name="5.2"><h2>5.2 - Coroutine Manipulation</h2></a>
+
+<p>The operations related to coroutines comprise a sub-library of
+the basic library and come inside the table <code>coroutine</code>.
+See <a href="#coroutine">2.10</a> for a general description of coroutines.
+
+<p><h3><code>coroutine.create (f)</code></h3>
+
+<p>Creates a new coroutine, with body <code>f</code>.
+<code>f</code> must be a Lua function.
+Returns this new coroutine,
+an object with type <code>"thread"</code>.
+
+<p><h3><code>coroutine.resume (co, val1, ...)</code></h3>
+
+<p>Starts or continues the execution of coroutine <code>co</code>.
+The first time you resume a coroutine,
+it starts running its body.
+The arguments <code>val1</code>, ... go as the arguments to the body function.
+If the coroutine has yielded,
+<code>resume</code> restarts it;
+the arguments <code>val1</code>, ... go as the results from the yield.
+
+<p>If the coroutine runs without any errors,
+<code>resume</code> returns <B>true</B> plus any values passed to <code>yield</code>
+(if the coroutine yields) or any values returned by the body function
+(if the coroutine terminates).
+If there is any error,
+<code>resume</code> returns <B>false</B> plus the error message.
+
+<p><h3><code>coroutine.status (co)</code></h3>
+
+<p>Returns the status of coroutine <code>co</code>, as a string:
+<code>"running"</code>,
+if the coroutine is running (that is, it called <code>status</code>);
+<code>"suspended"</code>, if the coroutine is suspended in a call to <code>yield</code>,
+or if it has not started running yet;
+and <code>"dead"</code> if the coroutine has finished its body function,
+or if it has stopped with an error.
+
+<p><h3><code>coroutine.wrap (f)</code></h3>
+
+<p>Creates a new coroutine, with body <code>f</code>.
+<code>f</code> must be a Lua function.
+Returns a function that resumes the coroutine each time it is called.
+Any arguments passed to the function behave as the
+extra arguments to <code>resume</code>.
+Returns the same values returned by <code>resume</code>,
+except the first boolean.
+In case of error, propagates the error.
+
+<p><h3><code>coroutine.yield (val1, ...)</code></h3>
+
+<p>Suspends the execution of the calling coroutine.
+The coroutine cannot be running neither a C function,
+nor a metamethod, nor an iterator.
+Any arguments to <code>yield</code> go as extra results to <code>resume</code>.
+
+<p><a name="5.3"><h2>5.3 - String Manipulation</h2></a>
+This library provides generic functions for string manipulation,
+such as finding and extracting substrings, and pattern matching.
+When indexing a string in Lua, the first character is at position 1
+(not at 0, as in C).
+Indices are allowed to be negative and are interpreted as indexing backwards,
+from the end of the string.
+Thus, the last character is at position <em>-1</em>, and so on.
+
+<p>The string library provides all its functions inside the table
+<code>string</code>.
+
+<p><h3><code>string.byte (s [, i])</code></h3>
+Returns the internal numerical code of the <code>i</code>-th character of <code>s</code>,
+or <B>nil</B> if the index is out of range.
+If <code>i</code> is absent, then it is assumed to be 1.
+<code>i</code> may be negative.
+
+<p>Note that numerical codes are not necessarily portable across platforms.
+
+<p><h3><code>string.char (i1, i2, ...)</code></h3>
+Receives 0 or more integers.
+Returns a string with length equal to the number of arguments,
+in which each character has the internal numerical code equal
+to its correspondent argument.
+
+<p>Note that numerical codes are not necessarily portable across platforms.
+
+<p><h3><code>string.dump (function)</code></h3>
+
+<p>Returns a binary representation of the given function,
+so that a later <code>loadstring</code> on that string returns
+a copy of the function.
+<code>function</code> must be a Lua function without upvalues.
+
+<p><h3><code>string.find (s, pattern [, init [, plain]])</code></h3>
+Looks for the first <em>match</em> of
+<code>pattern</code> in the string <code>s</code>.
+If it finds one, then <code>find</code> returns the indices of <code>s</code>
+where this occurrence starts and ends;
+otherwise, it returns <B>nil</B>.
+If the pattern specifies captures (see <code>string.gsub</code> below),
+the captured strings are returned as extra results.
+A third, optional numerical argument <code>init</code> specifies
+where to start the search;
+its default value is 1 and may be negative.
+A value of <B>true</B> as a fourth, optional argument <code>plain</code>
+turns off the pattern matching facilities,
+so the function does a plain "find substring" operation,
+with no characters in <code>pattern</code> being considered "magic".
+Note that if <code>plain</code> is given, then <code>init</code> must be given too.
+
+<p><h3><code>string.len (s)</code></h3>
+Receives a string and returns its length.
+The empty string <code>""</code> has length 0.
+Embedded zeros are counted,
+so <code>"a\000b\000c"</code> has length 5.
+
+<p><h3><code>string.lower (s)</code></h3>
+Receives a string and returns a copy of that string with all
+uppercase letters changed to lowercase.
+All other characters are left unchanged.
+The definition of what is an uppercase letter depends on the current locale.
+
+<p><h3><code>string.rep (s, n)</code></h3>
+Returns a string that is the concatenation of <code>n</code> copies of
+the string <code>s</code>.
+
+<p><h3><code>string.sub (s, i [, j])</code></h3>
+Returns the substring of <code>s</code> that
+starts at <code>i</code> and continues until <code>j</code>;
+<code>i</code> and <code>j</code> may be negative.
+If <code>j</code> is absent, then it is assumed to be equal to <em>-1</em>
+(which is the same as the string length).
+In particular,
+the call <code>string.sub(s,1,j)</code> returns a prefix of <code>s</code>
+with length <code>j</code>,
+and <code>string.sub(s, -i)</code> returns a suffix of <code>s</code>
+with length <code>i</code>.
+
+<p><h3><code>string.upper (s)</code></h3>
+Receives a string and returns a copy of that string with all
+lowercase letters changed to uppercase.
+All other characters are left unchanged.
+The definition of what is a lowercase letter depends on the current locale.
+
+<p><a name="format"><h3><code>string.format (formatstring, e1, e2, ...)</code></h3></a>
+
+Returns a formatted version of its variable number of arguments
+following the description given in its first argument (which must be a string).
+The format string follows the same rules as the <code>printf</code> family of
+standard C functions.
+The only differences are that the options/modifiers
+<code>*</code>, <code>l</code>, <code>L</code>, <code>n</code>, <code>p</code>,
+and <code>h</code> are not supported,
+and there is an extra option, <code>q</code>.
+The <code>q</code> option formats a string in a form suitable to be safely read
+back by the Lua interpreter:
+The string is written between double quotes,
+and all double quotes, newlines, and backslashes in the string
+are correctly escaped when written.
+For instance, the call
+<PRE>
+ string.format('%q', 'a string with "quotes" and \n new line')
+</PRE>
+will produce the string:
+<PRE>
+"a string with \"quotes\" and \
+ new line"
+</PRE>
+
+<p>The options <code>c</code>, <code>d</code>, <code>E</code>, <code>e</code>, <code>f</code>,
+<code>g</code>, <code>G</code>, <code>i</code>, <code>o</code>, <code>u</code>, <code>X</code>, and <code>x</code> all
+expect a number as argument,
+whereas <code>q</code> and <code>s</code> expect a string.
+The <code>*</code> modifier can be simulated by building
+the appropriate format string.
+For example, <code>"%*g"</code> can be simulated with
+<code>"%"..width.."g"</code>.
+
+<p>String values to be formatted with
+<code>%s</code> cannot contain embedded zeros.
+
+<p><h3><code>string.gfind (s, pat)</code></h3>
+
+<p>Returns an iterator function that,
+each time it is called,
+returns the next captures from pattern <code>pat</code> over string <code>s</code>.
+
+<p>If <code>pat</code> specifies no captures,
+then the whole match is produced in each call.
+
+<p>As an example, the following loop
+<PRE>
+ s = "hello world from Lua"
+ for w in string.gfind(s, "%a+") do
+ print(w)
+ end
+</PRE>
+will iterate over all the words from string <code>s</code>,
+printing one per line.
+The next example collects all pairs <code>key=value</code> from the
+given string into a table:
+<PRE>
+ t = {}
+ s = "from=world, to=Lua"
+ for k, v in string.gfind(s, "(%w+)=(%w+)") do
+ t[k] = v
+ end
+</PRE>
+
+<p><h3><code>string.gsub (s, pat, repl [, n])</code></h3>
+
+Returns a copy of <code>s</code>
+in which all occurrences of the pattern <code>pat</code> have been
+replaced by a replacement string specified by <code>repl</code>.
+<code>gsub</code> also returns, as a second value,
+the total number of substitutions made.
+
+<p>If <code>repl</code> is a string, then its value is used for replacement.
+Any sequence in <code>repl</code> of the form <code>%</code><em>n</em>,
+with <em>n</em> between 1 and 9,
+stands for the value of the <em>n</em>-th captured substring (see below).
+
+<p>If <code>repl</code> is a function, then this function is called every time a
+match occurs, with all captured substrings passed as arguments,
+in order;
+if the pattern specifies no captures,
+then the whole match is passed as a sole argument.
+If the value returned by this function is a string,
+then it is used as the replacement string;
+otherwise, the replacement string is the empty string.
+
+<p>The optional last parameter <code>n</code> limits
+the maximum number of substitutions to occur.
+For instance, when <code>n</code> is 1 only the first occurrence of
+<code>pat</code> is replaced.
+
+<p>Here are some examples:
+<PRE>
+ x = string.gsub("hello world", "(%w+)", "%1 %1")
+ --> x="hello hello world world"
+
+ x = string.gsub("hello world", "(%w+)", "%1 %1", 1)
+ --> x="hello hello world"
+
+ x = string.gsub("hello world from Lua", "(%w+)%s*(%w+)", "%2 %1")
+ --> x="world hello Lua from"
+
+ x = string.gsub("home = $HOME, user = $USER", "%$(%w+)", os.getenv)
+ --> x="home = /home/roberto, user = roberto"
+
+ x = string.gsub("4+5 = $return 4+5$", "%$(.-)%$", function (s)
+ return loadstring(s)()
+ end)
+ --> x="4+5 = 9"
+
+ local t = {name="lua", version="5.0"}
+ x = string.gsub("$name_$version.tar.gz", "%$(%w+)", function (v)
+ return t[v]
+ end)
+ --> x="lua_5.0.tar.gz"
+</PRE>
+
+<p><a name="pm"><h3>Patterns</h3></a>
+
+<p><p>
+A <em>character class</em> is used to represent a set of characters.
+The following combinations are allowed in describing a character class:
+<ul>
+<li><b><em>x</em></b> (where <em>x</em> is not one of the magic characters
+<code>^$()%.[]*+-?</code>)
+--- represents the character <em>x</em> itself.
+<li><b><code>.</code></b> --- (a dot) represents all characters.
+<li><b><code>%a</code></b> --- represents all letters.
+<li><b><code>%c</code></b> --- represents all control characters.
+<li><b><code>%d</code></b> --- represents all digits.
+<li><b><code>%l</code></b> --- represents all lowercase letters.
+<li><b><code>%p</code></b> --- represents all punctuation characters.
+<li><b><code>%s</code></b> --- represents all space characters.
+<li><b><code>%u</code></b> --- represents all uppercase letters.
+<li><b><code>%w</code></b> --- represents all alphanumeric characters.
+<li><b><code>%x</code></b> --- represents all hexadecimal digits.
+<li><b><code>%z</code></b> --- represents the character with representation 0.
+<li><b><code>%<em>x</em></code></b> (where <em>x</em> is any non-alphanumeric character) ---
+represents the character <em>x</em>.
+This is the standard way to escape the magic characters.
+Any punctuation character (even the non magic)
+can be preceded by a `<code>%</code>´
+when used to represent itself in a pattern.
+
+<p><li><b><code>[<em>set</em>]</code></b> ---
+represents the class which is the union of all
+characters in <em>set</em>.
+A range of characters may be specified by
+separating the end characters of the range with a `<code>-</code>´.
+All classes <code>%</code><em>x</em> described above may also be used as
+components in <em>set</em>.
+All other characters in <em>set</em> represent themselves.
+For example, <code>[%w_]</code> (or <code>[_%w]</code>)
+represents all alphanumeric characters plus the underscore,
+<code>[0-7]</code> represents the octal digits,
+and <code>[0-7%l%-]</code> represents the octal digits plus
+the lowercase letters plus the `<code>-</code>´ character.
+
+<p>The interaction between ranges and classes is not defined.
+Therefore, patterns like <code>[%a-z]</code> or <code>[a-%%]</code>
+have no meaning.
+
+<p><li><b><code>[^<em>set</em>]</code></b> ---
+represents the complement of <em>set</em>,
+where <em>set</em> is interpreted as above.
+</ul>
+For all classes represented by single letters (<code>%a</code>, <code>%c</code>, etc.),
+the corresponding uppercase letter represents the complement of the class.
+For instance, <code>%S</code> represents all non-space characters.
+
+<p>The definitions of letter, space, and other character groups
+depend on the current locale.
+In particular, the class <code>[a-z]</code> may not be equivalent to <code>%l</code>.
+The second form should be preferred for portability.
+
+<p><p>
+A <em>pattern item</em> may be
+<ul>
+<li>
+a single character class,
+which matches any single character in the class;
+<li>
+a single character class followed by `<code>*</code>´,
+which matches 0 or more repetitions of characters in the class.
+These repetition items will always match the longest possible sequence;
+<li>
+a single character class followed by `<code>+</code>´,
+which matches 1 or more repetitions of characters in the class.
+These repetition items will always match the longest possible sequence;
+<li>
+a single character class followed by `<code>-</code>´,
+which also matches 0 or more repetitions of characters in the class.
+Unlike `<code>*</code>´,
+these repetition items will always match the <em>shortest</em> possible sequence;
+<li>
+a single character class followed by `<code>?</code>´,
+which matches 0 or 1 occurrence of a character in the class;
+<li>
+<code>%<em>n</em></code>, for <em>n</em> between 1 and 9;
+such item matches a substring equal to the <em>n</em>-th captured string
+(see below);
+<li>
+<code>%b<em>xy</em></code>, where <em>x</em> and <em>y</em> are two distinct characters;
+such item matches strings that start with <em>x</em>, end with <em>y</em>,
+and where the <em>x</em> and <em>y</em> are <em>balanced</em>.
+This means that, if one reads the string from left to right,
+counting <em>+1</em> for an <em>x</em> and <em>-1</em> for a <em>y</em>,
+the ending <em>y</em> is the first <em>y</em> where the count reaches 0.
+For instance, the item <code>%b()</code> matches expressions with
+balanced parentheses.
+</ul>
+
+<p><p>
+A <em>pattern</em> is a sequence of pattern items.
+A `<code>^</code>´ at the beginning of a pattern anchors the match at the
+beginning of the subject string.
+A `<code>$</code>´ at the end of a pattern anchors the match at the
+end of the subject string.
+At other positions,
+`<code>^</code>´ and `<code>$</code>´ have no special meaning and represent themselves.
+
+<p><p>
+A pattern may contain sub-patterns enclosed in parentheses;
+they describe <em>captures</em>.
+When a match succeeds, the substrings of the subject string
+that match captures are stored (<em>captured</em>) for future use.
+Captures are numbered according to their left parentheses.
+For instance, in the pattern <code>"(a*(.)%w(%s*))"</code>,
+the part of the string matching <code>"a*(.)%w(%s*)"</code> is
+stored as the first capture (and therefore has number 1);
+the character matching <code>.</code> is captured with number 2,
+and the part matching <code>%s*</code> has number 3.
+
+<p>As a special case, the empty capture <code>()</code> captures
+the current string position (a number).
+For instance, if we apply the pattern <code>"()aa()"</code> on the
+string <code>"flaaap"</code>, there will be two captures: 3 and 5.
+
+<p>A pattern cannot contain embedded zeros. Use <code>%z</code> instead.
+
+<p><a name="5.4"><h2>5.4 - Table Manipulation</h2></a>
+This library provides generic functions for table manipulation.
+It provides all its functions inside the table <code>table</code>.
+
+<p>Most functions in the table library assume that the table
+represents an array or a list.
+For those functions, an important concept is the <em>size</em> of the array.
+There are three ways to specify that size:
+<ul>
+<li> the field <code>"n"</code> ---
+When the table has a field <code>"n"</code> with a numerical value,
+that value is assumed as its size.
+<li> <code>setn</code> ---
+You can call the <code>table.setn</code> function to explicitly set
+the size of a table.
+<li> implicit size ---
+Otherwise, the size of the object is one less the first integer index
+with a <B>nil</B> value.
+</ul>
+For more details, see the descriptions of the <code>table.getn</code> and
+<code>table.setn</code> functions.
+
+<p><h3><code>table.concat (table [, sep [, i [, j]]])</code></h3>
+
+Returns <code>table[i]..sep..table[i+1] ... sep..table[j]</code>.
+The default value for <code>sep</code> is the empty string,
+the default for <code>i</code> is 1,
+and the default for <code>j</code> is the size of the table.
+If <code>i</code> is greater than <code>j</code>, returns the empty string.
+
+<p><h3><code>table.foreach (table, f)</code></h3>
+Executes the given <code>f</code> over all elements of <code>table</code>.
+For each element, <code>f</code> is called with the index and
+respective value as arguments.
+If <code>f</code> returns a non-<B>nil</B> value,
+then the loop is broken, and this value is returned
+as the final value of <code>foreach</code>.
+
+<p>See the <code>next</code> function for extra information about table traversals.
+
+<p><h3><code>table.foreachi (table, f)</code></h3>
+Executes the given <code>f</code> over the
+numerical indices of <code>table</code>.
+For each index, <code>f</code> is called with the index and
+respective value as arguments.
+Indices are visited in sequential order,
+from 1 to <code>n</code>,
+where <code>n</code> is the size of the table (see <a href="#getn">5.4</a>).
+If <code>f</code> returns a non-<B>nil</B> value,
+then the loop is broken and this value is returned
+as the result of <code>foreachi</code>.
+
+<p><a name="getn"><h3><code>table.getn (table)</code></h3></a>
+Returns the size of a table, when seen as a list.
+If the table has an <code>n</code> field with a numeric value,
+this value is the size of the table.
+Otherwise, if there was a previous call
+to <code>table.setn</code> over this table,
+the respective value is returned.
+Otherwise, the size is one less the first integer index with
+a <B>nil</B> value.
+
+<p><h3><code>table.sort (table [, comp])</code></h3>
+Sorts table elements in a given order, <em>in-place</em>,
+from <code>table[1]</code> to <code>table[n]</code>,
+where <code>n</code> is the size of the table (see <a href="#getn">5.4</a>).
+If <code>comp</code> is given,
+then it must be a function that receives two table elements,
+and returns true
+when the first is less than the second
+(so that <code>not comp(a[i+1],a[i])</code> will be true after the sort).
+If <code>comp</code> is not given,
+then the standard Lua operator <code><</code> is used instead.
+
+<p>The sort algorithm is <em>not</em> stable,
+that is, elements considered equal by the given order
+may have their relative positions changed by the sort.
+
+<p><h3><code>table.insert (table, [pos,] value)</code></h3>
+
+<p>Inserts element <code>value</code> at position <code>pos</code> in <code>table</code>,
+shifting up other elements to open space, if necessary.
+The default value for <code>pos</code> is <code>n+1</code>,
+where <code>n</code> is the size of the table (see <a href="#getn">5.4</a>),
+so that a call <code>table.insert(t,x)</code> inserts <code>x</code> at the end
+of table <code>t</code>.
+This function also updates the size of the table by
+calling <code>table.setn(table, n+1)</code>.
+
+<p><h3><code>table.remove (table [, pos])</code></h3>
+
+<p>Removes from <code>table</code> the element at position <code>pos</code>,
+shifting down other elements to close the space, if necessary.
+Returns the value of the removed element.
+The default value for <code>pos</code> is <code>n</code>,
+where <code>n</code> is the size of the table (see <a href="#getn">5.4</a>),
+so that a call <code>table.remove(t)</code> removes the last element
+of table <code>t</code>.
+This function also updates the size of the table by
+calling <code>table.setn(table, n-1)</code>.
+
+<p><h3><code>table.setn (table, n)</code></h3>
+
+<p>Updates the size of a table.
+If the table has a field <code>"n"</code> with a numerical value,
+that value is changed to the given <code>n</code>.
+Otherwise, it updates an internal state
+so that subsequent calls to <code>table.getn(table)</code> return <code>n</code>.
+
+<p><a name="mathlib"><a name="5.5"><h2>5.5 - Mathematical Functions</h2></a></a>
+
+<p>This library is an interface to most of the functions of the
+standard C math library.
+(Some have slightly different names.)
+It provides all its functions inside the table <code>math</code>.
+In addition,
+it registers the global <code>__pow</code>
+for the binary exponentiation operator <code>^</code>,
+so that <code>x^y</code> returns <em>x<sup>y</sup></em>.
+The library provides the following functions:
+
+
+
+
+
+
+
+
+
+<PRE>
+ math.abs math.acos math.asin math.atan math.atan2
+ math.ceil math.cos math.deg math.exp math.floor
+ math.log math.log10 math.max math.min math.mod
+ math.pow math.rad math.sin math.sqrt math.tan
+ math.frexp math.ldexp math.random math.randomseed
+</PRE>
+plus a variable <code>math.pi</code>.
+Most of them
+are only interfaces to the corresponding functions in the C library.
+All trigonometric functions work in radians
+(previous versions of Lua used degrees).
+The functions <code>math.deg</code> and <code>math.rad</code> convert
+between radians and degrees.
+
+<p>The function <code>math.max</code> returns the maximum
+value of its numeric arguments.
+Similarly, <code>math.min</code> computes the minimum.
+Both can be used with 1, 2, or more arguments.
+
+<p>The functions <code>math.random</code> and <code>math.randomseed</code>
+are interfaces to the simple random generator functions
+<code>rand</code> and <code>srand</code> that are provided by ANSI C.
+(No guarantees can be given for their statistical properties.)
+When called without arguments,
+<code>math.random</code> returns a pseudo-random real number
+in the range <em>[0,1)</em>.
+When called with a number <em>n</em>,
+<code>math.random</code> returns a pseudo-random integer in the range <em>[1,n]</em>.
+When called with two arguments, <em>l</em> and <em>u</em>,
+<code>math.random</code> returns a pseudo-random integer in the range <em>[l,u]</em>.
+The <code>math.randomseed</code> function sets a "seed"
+for the pseudo-random generator:
+Equal seeds produce equal sequences of numbers.
+
+<p><a name="libio"><a name="5.6"><h2>5.6 - Input and Output Facilities</h2></a></a>
+
+<p>The I/O library provides two different styles for file manipulation.
+The first one uses implicit file descriptors,
+that is, there are operations to set a default input file and a
+default output file,
+and all input/output operations are over those default files.
+The second style uses explicit file descriptors.
+
+<p>When using implicit file descriptors,
+all operations are supplied by table <code>io</code>.
+When using explicit file descriptors,
+the operation <code>io.open</code> returns a file descriptor
+and then all operations are supplied as methods by the file descriptor.
+
+<p>The table <code>io</code> also provides
+three predefined file descriptors with their usual meanings from C:
+<code>io.stdin</code>, <code>io.stdout</code>, and <code>io.stderr</code>.
+
+<p>A file handle is a userdata containing the file stream (<code>FILE*</code>),
+with a distinctive metatable created by the I/O library.
+
+<p>Unless otherwise stated,
+all I/O functions return <B>nil</B> on failure
+(plus an error message as a second result)
+and some value different from <B>nil</B> on success.
+
+<p><h3><code>io.close ([file])</code></h3>
+
+<p>Equivalent to <code>file:close()</code>.
+Without a <code>file</code>, closes the default output file.
+
+<p><h3><code>io.flush ()</code></h3>
+
+<p>Equivalent to <code>file:flush</code> over the default output file.
+
+<p><h3><code>io.input ([file])</code></h3>
+
+<p>When called with a file name, it opens the named file (in text mode),
+and sets its handle as the default input file.
+When called with a file handle,
+it simply sets that file handle as the default input file.
+When called without parameters,
+it returns the current default input file.
+
+<p>In case of errors this function raises the error,
+instead of returning an error code.
+
+<p><h3><code>io.lines ([filename])</code></h3>
+
+<p>Opens the given file name in read mode
+and returns an iterator function that,
+each time it is called,
+returns a new line from the file.
+Therefore, the construction
+<PRE>
+ for line in io.lines(filename) do ... end
+</PRE>
+will iterate over all lines of the file.
+When the iterator function detects the end of file,
+it returns <B>nil</B> (to finish the loop) and automatically closes the file.
+
+<p>The call <code>io.lines()</code> (without a file name) is equivalent
+to <code>io.input():lines()</code>, that is, it iterates over the
+lines of the default input file.
+
+<p><h3><code>io.open (filename [, mode])</code></h3>
+
+<p>This function opens a file,
+in the mode specified in the string <code>mode</code>.
+It returns a new file handle,
+or, in case of errors, <B>nil</B> plus an error message.
+
+<p>The <code>mode</code> string can be any of the following:
+<ul>
+<li><b>"r"</b> read mode (the default);
+<li><b>"w"</b> write mode;
+<li><b>"a"</b> append mode;
+<li><b>"r+"</b> update mode, all previous data is preserved;
+<li><b>"w+"</b> update mode, all previous data is erased;
+<li><b>"a+"</b> append update mode, previous data is preserved,
+ writing is only allowed at the end of file.
+</ul>
+The <code>mode</code> string may also have a <code>b</code> at the end,
+which is needed in some systems to open the file in binary mode.
+This string is exactly what is used in the standard C function <code>fopen</code>.
+
+<p><h3><code>io.output ([file])</code></h3>
+
+<p>Similar to <code>io.input</code>, but operates over the default output file.
+
+<p><h3><code>io.read (format1, ...)</code></h3>
+
+<p>Equivalent to <code>io.input():read</code>.
+
+<p><h3><code>io.tmpfile ()</code></h3>
+
+<p>Returns a handle for a temporary file.
+This file is open in update mode
+and it is automatically removed when the program ends.
+
+<p><h3><code>io.type (obj)</code></h3>
+
+<p>Checks whether <code>obj</code> is a valid file handle.
+Returns the string <code>"file"</code> if <code>obj</code> is an open file handle,
+<code>"closed file"</code> if <code>obj</code> is a closed file handle,
+and <B>nil</B> if <code>obj</code> is not a file handle.
+
+<p><h3><code>io.write (value1, ...)</code></h3>
+
+<p>Equivalent to <code>io.output():write</code>.
+
+<p><h3><code>file:close ()</code></h3>
+
+<p>Closes <code>file</code>.
+
+<p><h3><code>file:flush ()</code></h3>
+
+<p>Saves any written data to <code>file</code>.
+
+<p><h3><code>file:lines ()</code></h3>
+
+<p>Returns an iterator function that,
+each time it is called,
+returns a new line from the file.
+Therefore, the construction
+<PRE>
+ for line in file:lines() do ... end
+</PRE>
+will iterate over all lines of the file.
+(Unlike <code>io.lines</code>, this function does not close the file
+when the loop ends.)
+
+<p><h3><code>file:read (format1, ...)</code></h3>
+
+<p>Reads the file <code>file</code>,
+according to the given formats, which specify what to read.
+For each format,
+the function returns a string (or a number) with the characters read,
+or <B>nil</B> if it cannot read data with the specified format.
+When called without formats,
+it uses a default format that reads the entire next line
+(see below).
+
+<p>The available formats are
+<ul>
+<li><b>"*n"</b> reads a number;
+this is the only format that returns a number instead of a string.
+<li><b>"*a"</b> reads the whole file, starting at the current position.
+On end of file, it returns the empty string.
+<li><b>"*l"</b> reads the next line (skipping the end of line),
+returning <B>nil</B> on end of file.
+This is the default format.
+<li><b><em>number</em></b> reads a string with up to that number of characters,
+returning <B>nil</B> on end of file.
+If number is zero,
+it reads nothing and returns an empty string,
+or <B>nil</B> on end of file.
+</ul>
+
+<p><h3><code>file:seek ([whence] [, offset])</code></h3>
+
+<p>Sets and gets the file position,
+measured from the beginning of the file,
+to the position given by <code>offset</code> plus a base
+specified by the string <code>whence</code>, as follows:
+<ul>
+<li><b>"set"</b> base is position 0 (beginning of the file);
+<li><b>"cur"</b> base is current position;
+<li><b>"end"</b> base is end of file;
+</ul>
+In case of success, function <code>seek</code> returns the final file position,
+measured in bytes from the beginning of the file.
+If this function fails, it returns <B>nil</B>,
+plus a string describing the error.
+
+<p>The default value for <code>whence</code> is <code>"cur"</code>,
+and for <code>offset</code> is 0.
+Therefore, the call <code>file:seek()</code> returns the current
+file position, without changing it;
+the call <code>file:seek("set")</code> sets the position to the
+beginning of the file (and returns 0);
+and the call <code>file:seek("end")</code> sets the position to the
+end of the file, and returns its size.
+
+<p><h3><code>file:write (value1, ...)</code></h3>
+
+<p>Writes the value of each of its arguments to
+the filehandle <code>file</code>.
+The arguments must be strings or numbers.
+To write other values,
+use <code>tostring</code> or <code>string.format</code> before <code>write</code>.
+
+<p><a name="libiosys"><a name="5.7"><h2>5.7 - Operating System Facilities</h2></a></a>
+
+<p>This library is implemented through table <code>os</code>.
+
+<p><h3><code>os.clock ()</code></h3>
+
+<p>Returns an approximation of the amount of CPU time
+used by the program, in seconds.
+
+<p><h3><code>os.date ([format [, time]])</code></h3>
+
+<p>Returns a string or a table containing date and time,
+formatted according to the given string <code>format</code>.
+
+<p>If the <code>time</code> argument is present,
+this is the time to be formatted
+(see the <code>os.time</code> function for a description of this value).
+Otherwise, <code>date</code> formats the current time.
+
+<p>If <code>format</code> starts with `<code>!</code>´,
+then the date is formatted in Coordinated Universal Time.
+After that optional character,
+if <code>format</code> is <code>*t</code>,
+then <code>date</code> returns a table with the following fields:
+<code>year</code> (four digits), <code>month</code> (1--12), <code>day</code> (1--31),
+<code>hour</code> (0--23), <code>min</code> (0--59), <code>sec</code> (0--61),
+<code>wday</code> (weekday, Sunday is 1),
+<code>yday</code> (day of the year),
+and <code>isdst</code> (daylight saving flag, a boolean).
+
+<p>If <code>format</code> is not <code>*t</code>,
+then <code>date</code> returns the date as a string,
+formatted according with the same rules as the C function <code>strftime</code>.
+
+<p>When called without arguments,
+<code>date</code> returns a reasonable date and time representation that depends on
+the host system and on the current locale
+(that is, <code>os.date()</code> is equivalent to <code>os.date("%c")</code>).
+
+<p><h3><code>os.difftime (t2, t1)</code></h3>
+
+<p>Returns the number of seconds from time <code>t1</code> to time <code>t2</code>.
+In Posix, Windows, and some other systems,
+this value is exactly <code>t2</code><em>-</em><code>t1</code>.
+
+<p><h3><code>os.execute (command)</code></h3>
+
+<p>This function is equivalent to the C function <code>system</code>.
+It passes <code>command</code> to be executed by an operating system shell.
+It returns a status code, which is system-dependent.
+
+<p><h3><code>os.exit ([code])</code></h3>
+
+<p>Calls the C function <code>exit</code>,
+with an optional <code>code</code>,
+to terminate the host program.
+The default value for <code>code</code> is the success code.
+
+<p><h3><code>os.getenv (varname)</code></h3>
+
+<p>Returns the value of the process environment variable <code>varname</code>,
+or <B>nil</B> if the variable is not defined.
+
+<p><h3><code>os.remove (filename)</code></h3>
+
+<p>Deletes the file with the given name.
+If this function fails, it returns <B>nil</B>,
+plus a string describing the error.
+
+<p><h3><code>os.rename (oldname, newname)</code></h3>
+
+<p>Renames file named <code>oldname</code> to <code>newname</code>.
+If this function fails, it returns <B>nil</B>,
+plus a string describing the error.
+
+<p><h3><code>os.setlocale (locale [, category])</code></h3>
+
+<p>Sets the current locale of the program.
+<code>locale</code> is a string specifying a locale;
+<code>category</code> is an optional string describing which category to change:
+<code>"all"</code>, <code>"collate"</code>, <code>"ctype"</code>,
+<code>"monetary"</code>, <code>"numeric"</code>, or <code>"time"</code>;
+the default category is <code>"all"</code>.
+The function returns the name of the new locale,
+or <B>nil</B> if the request cannot be honored.
+
+<p><h3><code>os.time ([table])</code></h3>
+
+<p>Returns the current time when called without arguments,
+or a time representing the date and time specified by the given table.
+This table must have fields <code>year</code>, <code>month</code>, and <code>day</code>,
+and may have fields <code>hour</code>, <code>min</code>, <code>sec</code>, and <code>isdst</code>
+(for a description of these fields, see the <code>os.date</code> function).
+
+<p>The returned value is a number, whose meaning depends on your system.
+In Posix, Windows, and some other systems, this number counts the number
+of seconds since some given start time (the "epoch").
+In other systems, the meaning is not specified,
+and the number returned by <code>time</code> can be used only as an argument to
+<code>date</code> and <code>difftime</code>.
+
+<p><h3><code>os.tmpname ()</code></h3>
+
+<p>Returns a string with a file name that can
+be used for a temporary file.
+The file must be explicitly opened before its use
+and removed when no longer needed.
+
+<p>This function is equivalent to the <code>tmpnam</code> C function,
+and many people (and even some compilers!) advise against its use,
+because between the time you call this function
+and the time you open the file,
+it is possible for another process
+to create a file with the same name.
+
+<p><a name="5.8"><h2>5.8 - The Reflexive Debug Interface</h2></a>
+
+<p>The <code>debug</code> library provides
+the functionality of the debug interface to Lua programs.
+You should exert care when using this library.
+The functions provided here should be used exclusively for debugging
+and similar tasks, such as profiling.
+Please resist the temptation to use them as a
+usual programming tool:
+They can be very slow.
+Moreover, <code>setlocal</code> and <code>getlocal</code>
+violate the privacy of local variables
+and therefore can compromise some otherwise secure code.
+
+<p>All functions in this library are provided
+inside a <code>debug</code> table.
+
+<p><h3><code>debug.debug ()</code></h3>
+
+<p>Enters an interactive mode with the user,
+running each string that the user enters.
+Using simple commands and other debug facilities,
+the user can inspect global and local variables,
+change their values, evaluate expressions, and so on.
+A line containing only the word <code>cont</code> finishes this function,
+so that the caller continues its execution.
+
+<p>Note that commands for <code>debug.debug</code> are not lexically nested
+with any function, so they have no direct access to local variables.
+
+<p><h3><code>debug.gethook ()</code></h3>
+
+<p>Returns the current hook settings, as three values:
+the current hook function, the current hook mask,
+and the current hook count (as set by the <code>debug.sethook</code> function).
+
+<p><h3><code>debug.getinfo (function [, what])</code></h3>
+
+<p>This function returns a table with information about a function.
+You can give the function directly,
+or you can give a number as the value of <code>function</code>,
+which means the function running at level <code>function</code> of the call stack:
+Level 0 is the current function (<code>getinfo</code> itself);
+level 1 is the function that called <code>getinfo</code>;
+and so on.
+If <code>function</code> is a number larger than the number of active functions,
+then <code>getinfo</code> returns <B>nil</B>.
+
+<p>The returned table contains all the fields returned by <code>lua_getinfo</code>,
+with the string <code>what</code> describing which fields to fill in.
+The default for <code>what</code> is to get all information available.
+If present,
+the option `<code>f</code>´
+adds a field named <code>func</code> with the function itself.
+
+<p>For instance, the expression <code>debug.getinfo(1,"n").name</code> returns
+the name of the current function, if a reasonable name can be found,
+and <code>debug.getinfo(print)</code> returns a table with all available information
+about the <code>print</code> function.
+
+<p><h3><code>debug.getlocal (level, local)</code></h3>
+
+<p>This function returns the name and the value of the local variable
+with index <code>local</code> of the function at level <code>level</code> of the stack.
+(The first parameter or local variable has index 1, and so on,
+until the last active local variable.)
+The function returns <B>nil</B> if there is no local
+variable with the given index,
+and raises an error when called with a <code>level</code> out of range.
+(You can call <code>debug.getinfo</code> to check whether the level is valid.)
+
+<p><h3><code>debug.getupvalue (func, up)</code></h3>
+
+<p>This function returns the name and the value of the upvalue
+with index <code>up</code> of the function <code>func</code>.
+The function returns <B>nil</B> if there is no upvalue with the given index.
+
+<p><h3><code>debug.setlocal (level, local, value)</code></h3>
+
+<p>This function assigns the value <code>value</code> to the local variable
+with index <code>local</code> of the function at level <code>level</code> of the stack.
+The function returns <B>nil</B> if there is no local
+variable with the given index,
+and raises an error when called with a <code>level</code> out of range.
+(You can call <code>getinfo</code> to check whether the level is valid.)
+
+<p><h3><code>debug.setupvalue (func, up, value)</code></h3>
+
+<p>This function assigns the value <code>value</code> to the upvalue
+with index <code>up</code> of the function <code>func</code>.
+The function returns <B>nil</B> if there is no upvalue
+with the given index.
+
+<p><h3><code>debug.sethook (hook, mask [, count])</code></h3>
+
+
+<p>Sets the given function as a hook.
+The string <code>mask</code> and the number <code>count</code> describe
+when the hook will be called.
+The string mask may have the following characters,
+with the given meaning:
+<ul>
+<li><b><code>"c"</code></b> The hook is called every time Lua calls a function;
+<li><b><code>"r"</code></b> The hook is called every time Lua returns from a function;
+<li><b><code>"l"</code></b> The hook is called every time Lua enters a new line of code.
+</ul>
+With a <code>count</code> different from zero,
+the hook is called after every <code>count</code> instructions.
+
+<p>When called without arguments,
+the <code>debug.sethook</code> function turns off the hook.
+
+<p>When the hook is called, its first parameter is always a string
+describing the event that triggered its call:
+<code>"call"</code>, <code>"return"</code> (or <code>"tail return"</code>),
+<code>"line"</code>, and <code>"count"</code>.
+Moreover, for line events,
+it also gets as its second parameter the new line number.
+Inside a hook,
+you can call <code>getinfo</code> with level 2 to get more information about
+the running function
+(level 0 is the <code>getinfo</code> function,
+and level 1 is the hook function),
+unless the event is <code>"tail return"</code>.
+In this case, Lua is only simulating the return,
+and a call to <code>getinfo</code> will return invalid data.
+
+<p><h3><code>debug.traceback ([message])</code></h3>
+
+<p>Returns a string with a traceback of the call stack.
+An optional <code>message</code> string is appended
+at the beginning of the traceback.
+This function is typically used with <code>xpcall</code> to produce
+better error messages.
+
+<p>
+<a name="lua-sa"><a name="6"><h1>6 - Lua Stand-alone</h1></a></a>
+
+<p>Although Lua has been designed as an extension language,
+to be embedded in a host C program,
+it is also frequently used as a stand-alone language.
+An interpreter for Lua as a stand-alone language,
+called simply <code>lua</code>,
+is provided with the standard distribution.
+The stand-alone interpreter includes
+all standard libraries plus the reflexive debug interface.
+Its usage is:
+<PRE>
+ lua [options] [script [args]]
+</PRE>
+The options are:
+<ul>
+<li><b><code>-</code> </b> executes <code>stdin</code> as a file;
+<li><b><code>-e</code> <em>stat</em></b> executes string <em>stat</em>;
+<li><b><code>-l</code> <em>file</em></b> "requires" <em>file</em>;
+<li><b><code>-i</code></b> enters interactive mode after running <em>script</em>;
+<li><b><code>-v</code></b> prints version information;
+<li><b><code>--</code></b> stop handling options.
+</ul>
+After handling its options, <code>lua</code> runs the given <em>script</em>,
+passing to it the given <em>args</em>.
+When called without arguments,
+<code>lua</code> behaves as <code>lua -v -i</code> when <code>stdin</code> is a terminal,
+and as <code>lua -</code> otherwise.
+
+<p>Before running any argument,
+the interpreter checks for an environment variable <code>LUA_INIT</code>.
+If its format is @<em>filename</em>,
+then lua executes the file.
+Otherwise, lua executes the string itself.
+
+<p>All options are handled in order, except <code>-i</code>.
+For instance, an invocation like
+<PRE>
+ $ lua -e'a=1' -e 'print(a)' script.lua
+</PRE>
+will first set <code>a</code> to 1, then print <code>a</code>,
+and finally run the file <code>script.lua</code>.
+(Here, <code>$</code> is the shell prompt. Your prompt may be different.)
+
+<p>Before starting to run the script,
+<code>lua</code> collects all arguments in the command line
+in a global table called <code>arg</code>.
+The script name is stored in index 0,
+the first argument after the script name goes to index 1,
+and so on.
+The field <code>n</code> gets the number of arguments after the script name.
+Any arguments before the script name
+(that is, the interpreter name plus the options)
+go to negative indices.
+For instance, in the call
+<PRE>
+ $ lua -la.lua b.lua t1 t2
+</PRE>
+the interpreter first runs the file <code>a.lua</code>,
+then creates a table
+<PRE>
+ arg = { [-2] = "lua", [-1] = "-la.lua", [0] = "b.lua",
+ [1] = "t1", [2] = "t2"; n = 2 }
+</PRE>
+and finally runs the file <code>b.lua</code>.
+
+<p>In interactive mode,
+if you write an incomplete statement,
+the interpreter waits for its completion.
+
+<p>If the global variable <code>_PROMPT</code> is defined as a string,
+then its value is used as the prompt.
+Therefore, the prompt can be changed directly on the command line:
+<PRE>
+ $ lua -e"_PROMPT='myprompt> '" -i
+</PRE>
+(the outer pair of quotes is for the shell,
+the inner is for Lua),
+or in any Lua programs by assigning to <code>_PROMPT</code>.
+Note the use of <code>-i</code> to enter interactive mode; otherwise,
+the program would end just after the assignment to <code>_PROMPT</code>.
+
+<p>In Unix systems, Lua scripts can be made into executable programs
+by using <code>chmod +x</code> and the <code>#!</code> form,
+as in
+<PRE>
+#!/usr/local/bin/lua
+</PRE>
+(Of course,
+the location of the Lua interpreter may be different in your machine.
+If <code>lua</code> is in your <code>PATH</code>,
+then
+<PRE>
+#!/usr/bin/env lua
+</PRE>
+is a more portable solution.)
+
+<p>
+<h1>Acknowledgments</h1>
+
+<p>The Lua team is grateful to <a href="http://www.tecgraf.puc-rio.br">Tecgraf</a> for its continued support to Lua.
+We thank everyone at <a href="http://www.tecgraf.puc-rio.br">Tecgraf</a>,
+specially the head of the group, Marcelo Gattass.
+At the risk of omitting several names,
+we also thank the following individuals for supporting,
+contributing to, and spreading the word about Lua:
+Alan Watson.
+André Clinio,
+André Costa,
+Antonio Scuri,
+Asko Kauppi,
+Bret Mogilefsky,
+Cameron Laird,
+Carlos Cassino,
+Carlos Henrique Levy,
+Claudio Terra,
+David Jeske,
+Ed Ferguson,
+Edgar Toernig,
+Erik Hougaard,
+Jim Mathies,
+John Belmonte,
+John Passaniti,
+John Roll,
+Jon Erickson,
+Jon Kleiser,
+Mark Ian Barlow,
+Nick Trout,
+Noemi Rodriguez,
+Norman Ramsey,
+Philippe Lhoste,
+Renata Ratton,
+Renato Borges,
+Renato Cerqueira,
+Reuben Thomas,
+Stephan Herrmann,
+Steve Dekorte,
+Thatcher Ulrich,
+Tomás Gorham,
+Vincent Penquerc'h.
+Thank you!
+
+<p><hr>
+
+<p><h1>Incompatibilities with Previous Versions</h1>
+
+
+<p>Lua 5.0 is a major release.
+There are several incompatibilities with its previous version, Lua 4.0.
+
+<p><h2>Incompatibilities with version 4.0</h2>
+
+<p><h3>Changes in the Language</h3>
+<ul>
+
+<p><li>
+The whole tag-method scheme was replaced by metatables.
+
+<p><li>
+Function calls written between parentheses result in exactly one value.
+
+<p><li>
+A function call as the last expression in a list constructor
+(like <code>{a,b,f()}</code>) has all its return values inserted in the list.
+
+<p><li>
+The precedence of <b>or</b> is smaller than the precedence of <b>and</b>.
+
+<p><li>
+<b>in</b>, <b>false</b>, and <b>true</b> are reserved words.
+
+<p><li>
+The old construction <code>for k,v in t</code>, where <code>t</code> is a table,
+is deprecated (although it is still supported).
+Use <code>for k,v in pairs(t)</code> instead.
+
+<p><li>
+When a literal string of the form <code>[[...]]</code> starts with a newline,
+this newline is ignored.
+
+<p>
+
+<p><li> Upvalues in the form <code>%var</code> are obsolete;
+use external local variables instead.
+
+<p></ul>
+
+<p><h3>Changes in the Libraries</h3>
+<ul>
+
+<p><li>
+Most library functions now are defined inside tables.
+There is a compatibility script (<code>compat.lua</code>) that
+redefine most of them as global names.
+
+<p><li>
+In the math library, angles are expressed in radians.
+With the compatibility script (<code>compat.lua</code>),
+functions still work in degrees.
+
+<p><li>
+The <code>call</code> function is deprecated.
+Use <code>f(unpack(tab))</code> instead of <code>call(f, tab)</code>
+for unprotected calls,
+or the new <code>pcall</code> function for protected calls.
+
+<p><li>
+<code>dofile</code> do not handle errors, but simply propagates them.
+
+<p><li>
+<code>dostring</code> is deprecated. Use <code>loadstring</code> instead.
+
+<p><li>
+The <code>read</code> option <code>*w</code> is obsolete.
+
+<p><li>
+The <code>format</code> option <code>%n$</code> is obsolete.
+
+<p></ul>
+
+<p><h3>Changes in the API</h3>
+<ul>
+
+<p><li>
+<code>lua_open</code> does not have a stack size as its argument
+(stacks are dynamic).
+
+<p><li>
+<code>lua_pushuserdata</code> is deprecated.
+Use <code>lua_newuserdata</code> or <code>lua_pushlightuserdata</code> instead.
+
+<p></ul>
+
+<p>
+
+<a name="BNF"><h1>The Complete Syntax of Lua</h1></a>
+
+
+<p>
+
+<p><pre>
+
+<p> chunk ::= {stat [`<b>;</b>´]}
+
+<p> block ::= chunk
+
+<p> stat ::= varlist1 `<b>=</b>´ explist1 | functioncall | <b>do</b> block <b>end</b> | <b>while</b> exp <b>do</b> block <b>end</b> | <b>repeat</b> block <b>until</b> exp | <b>if</b> exp <b>then</b> block {<b>elseif</b> exp <b>then</b> block} [<b>else</b> block] <b>end</b> | <b>return</b> [explist1] | <b>break</b> | <b>for</b> Name `<b>=</b>´ exp `<b>,</b>´ exp [`<b>,</b>´ exp] <b>do</b> block <b>end</b> | <b>for</b> Name {`<b>,</b>´ Name} <b>in</b> explist1 <b>do</b> block <b>end</b> | <b>function</b> funcname funcbody | <b>local</b> <b>function</b> Name funcbody | <b>local</b> namelist [init]
+
+<p> funcname ::= Name {`<b>.</b>´ Name} [`<b>:</b>´ Name]
+
+<p> varlist1 ::= var {`<b>,</b>´ var}
+
+<p> var ::= Name | prefixexp `<b>[</b>´ exp `<b>]</b>´ | prefixexp `<b>.</b>´ Name
+
+<p> namelist ::= Name {`<b>,</b>´ Name}
+
+<p> init ::= `<b>=</b>´ explist1
+
+<p> explist1 ::= {exp `<b>,</b>´} exp
+
+<p> exp ::= <b>nil</b> | <b>false</b> | <b>true</b> | Number | Literal | function | prefixexp | tableconstructor | exp binop exp | unop exp
+
+<p> prefixexp ::= var | functioncall | `<b>(</b>´ exp `<b>)</b>´
+
+<p> functioncall ::= prefixexp args | prefixexp `<b>:</b>´ Name args
+
+<p> args ::= `<b>(</b>´ [explist1] `<b>)</b>´ | tableconstructor | Literal
+
+<p> function ::= <b>function</b> funcbody
+
+<p> funcbody ::= `<b>(</b>´ [parlist1] `<b>)</b>´ block <b>end</b>
+
+<p> parlist1 ::= Name {`<b>,</b>´ Name} [`<b>,</b>´ `<b>...</b>´] | `<b>...</b>´
+
+<p> tableconstructor ::= `<b>{</b>´ [fieldlist] `<b>}</b>´
+ fieldlist ::= field {fieldsep field} [fieldsep]
+ field ::= `<b>[</b>´ exp `<b>]</b>´ `<b>=</b>´ exp | name `<b>=</b>´ exp | exp
+ fieldsep ::= `<b>,</b>´ | `<b>;</b>´
+
+<p> binop ::= `<b>+</b>´ | `<b>-</b>´ | `<b>*</b>´ | `<b>/</b>´ | `<b>^</b>´ | `<b>..</b>´ | `<b><</b>´ | `<b><=</b>´ | `<b>></b>´ | `<b>>=</b>´ | `<b>==</b>´ | `<b>~=</b>´ | <b>and</b> | <b>or</b>
+
+<p> unop ::= `<b>-</b>´ | <b>not</b>
+
+<p></pre>
+
+<p>
+
+<p>
+
+<HR>
+<SMALL>
+Last update:
+Tue Nov 25 16:08:37 BRST 2003
+</SMALL>
+
+</BODY>
+</HTML>
--- /dev/null
+<HTML>
+<HEAD>
+<TITLE>Lua documentation</TITLE>
+</HEAD>
+
+<BODY BGCOLOR="#FFFFFF">
+
+<HR>
+<H1>
+<A HREF="http://www.lua.org/"><IMG SRC="logo.gif" ALT="Lua" BORDER=0></A>
+Documentation
+</H1>
+
+<UL>
+<LI><A HREF="http://www.lua.org/">Official web site</A>
+<LI><A HREF="contents.html">Reference manual</A>
+<LI><A HREF="lua.html">lua man page</A>
+<LI><A HREF="luac.html">luac man page</A>
+<LI><A HREF="../README">lua/README</A>
+<LI><A HREF="../src/README">lua/src/README</A>
+<LI><A HREF="../src/lib/README">lua/src/lib/README</A>
+<LI><A HREF="../src/lua/README">lua/src/lua/README</A>
+<LI><A HREF="../src/luac/README">lua/src/luac/README</A>
+<LI><A HREF="../etc/README">lua/etc/README</A>
+<LI><A HREF="../test/README">lua/test/README</A>
+</UL>
+
+<HR>
+<SMALL>
+Last update:
+Thu Mar 11 23:08:56 BRT 2004
+</SMALL>
+
+</BODY>
+</HTML>
--- /dev/null
+# makefile for Lua etc
+
+LUA= ..
+
+include $(LUA)/config
+
+LIBLUA=$(LIB)/liblua.a
+ALL= bin2c min trace noparser luab
+
+all:
+ @echo 'choose a target:' $(ALL)
+
+bin2c: bin2c.c
+ $(CC) $(CFLAGS) -o $@ $@.c
+
+min: min.c $(LIBLUA)
+ $(CC) $(CFLAGS) -o $@ $@.c -L$(LIB) -llua
+
+trace: trace.c $(LIBLUA)
+ $(CC) -g $(CFLAGS) -o $@ $@.c -L$(LIB) -llua -llualib $(EXTRA_LIBS)
+
+noparser: noparser.c
+ $(CC) $(CFLAGS) -I$(LUA)/src -o $@.o -c $@.c
+
+luab: noparser $(LIBLUA)
+ cc -o $@ noparser.o $(LUA)/src/lua/lua.o -L$(LIB) -llua -llualib $(EXTRA_LIBS)
+ $(BIN)/luac $(LUA)/test/hello.lua
+ $@ luac.out
+ -$@ -e'a=1'
+
+flat:
+ cd ..; mkdir flat; mv include/*.h src/*.[ch] src/*/*.[ch] flat
+
+$(LIBLUA):
+ cd ../src; $(MAKE)
+
+clean:
+ rm -f $(ALL) a.out core *.o luac.out
+
+luser_tests.h: RCS/ltests.h,v
+ co -q -M ltests.h
+ mv -f ltests.h $@
--- /dev/null
+This directory contains some useful files and code.
+Unlike the code in ../src, everything here is in the public domain.
+
+bin2c.c
+ This program converts files to byte arrays that are automatically run
+ with lua_dobuffer. This allows C programs to include all necessary Lua
+ code, even in precompiled form. Even if the code is included in source
+ form, bin2c is useful because it avoids the hassle of having to quote
+ special characters in C strings.
+ Example of usage: Run bin2c file1 file2 ... > init.h. Then, in your
+ C program, just do #include "init.h" anywhere in the *body* of a
+ function. This will be equivalent to calling
+ lua_dofile(L,"file1"); lua_dofile(L,"file2"); ...
+ Note that the Lua state is called "L". If you use a different name,
+ say "mystate", just #define L mystate before you #include "init.h".
+
+compat.lua
+ A compatibility module for Lua 4.0 functions.
+
+doall.lua
+ Emulate the command line behaviour of Lua 4.0
+
+lua.ico
+ A Lua icon for Windows.
+ Drawn by hand by Markus Gritsch <gritsch@iue.tuwien.ac.at>.
+
+lua.magic
+ Data for teaching file(1) about Lua precompiled chunks.
+
+lua.xpm
+ The same icon as lua.ico, but in XPM format.
+ It was converted with ImageMagick by Andy Tai <andy@exp.com>.
+
+luser_number.h
+ Number type configuration for Lua core.
+
+luser_tests.h
+ Self-test configuration for Lua core.
+
+min.c
+ A minimal Lua interpreter.
+ Good for learning and for starting your own.
+
+noparser.c
+ Linking with noparser.o avoids loading the parsing modules in lualib.a.
+ Do "make luab" to build a sample Lua intepreter that does not parse
+ Lua programs, only loads precompiled programs.
+
+saconfig.c
+ Configuration for Lua interpreter.
+
+trace.c
+ A simple execution tracer.
+ An example of how to use the debug hooks in C.
--- /dev/null
+/*
+* bin2c.c
+* convert files to byte arrays for automatic loading with lua_dobuffer
+* Luiz Henrique de Figueiredo (lhf@tecgraf.puc-rio.br)
+* 02 Apr 2003 20:44:31
+*/
+
+#include <ctype.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+static void dump(FILE* f, int n)
+{
+ printf("static const unsigned char B%d[]={\n",n);
+ for (n=1;;n++)
+ {
+ int c=getc(f);
+ if (c==EOF) break;
+ printf("%3u,",c);
+ if (n==20) { putchar('\n'); n=0; }
+ }
+ printf("\n};\n\n");
+}
+
+static void fdump(const char* fn, int n)
+{
+ FILE* f= fopen(fn,"rb"); /* must open in binary mode */
+ if (f==NULL)
+ {
+ fprintf(stderr,"bin2c: cannot open ");
+ perror(fn);
+ exit(1);
+ }
+ else
+ {
+ printf("/* %s */\n",fn);
+ dump(f,n);
+ fclose(f);
+ }
+}
+
+static void emit(const char* fn, int n)
+{
+ printf(" lua_dobuffer(L,(const char*)B%d,sizeof(B%d),\"%s\");\n",n,n,fn);
+}
+
+int main(int argc, char* argv[])
+{
+ printf("/* code automatically generated by bin2c -- DO NOT EDIT */\n");
+ printf("{\n");
+ if (argc<2)
+ {
+ dump(stdin,0);
+ emit("=stdin",0);
+ }
+ else
+ {
+ int i;
+ printf("/* #include'ing this file in a C program is equivalent to calling\n");
+ for (i=1; i<argc; i++) printf(" lua_dofile(L,\"%s\");\n",argv[i]);
+ printf("*/\n");
+ for (i=1; i<argc; i++) fdump(argv[i],i);
+ for (i=1; i<argc; i++) emit(argv[i],i);
+ }
+ printf("}\n");
+ return 0;
+}
--- /dev/null
+-------------------------------------------------------------------
+-- Real globals
+-- _ALERT
+-- _ERRORMESSAGE
+-- _VERSION
+-- _G
+-- assert
+-- error
+-- metatable
+-- next
+-- print
+-- require
+-- tonumber
+-- tostring
+-- type
+-- unpack
+
+-------------------------------------------------------------------
+-- collectgarbage
+-- gcinfo
+
+-- globals
+
+-- call -> protect(f, err)
+-- loadfile
+-- loadstring
+
+-- rawget
+-- rawset
+
+-- getargs = Main.getargs ??
+
+
+function do_ (f, err)
+ if not f then print(err); return end
+ local a,b = pcall(f)
+ if not a then print(b); return nil
+ else return b or true
+ end
+end
+
+function dostring(s) return do_(loadstring(s)) end
+-- function dofile(s) return do_(loadfile(s)) end
+
+-------------------------------------------------------------------
+-- Table library
+local tab = table
+foreach = tab.foreach
+foreachi = tab.foreachi
+getn = tab.getn
+tinsert = tab.insert
+tremove = tab.remove
+sort = tab.sort
+
+-------------------------------------------------------------------
+-- Debug library
+local dbg = debug
+getinfo = dbg.getinfo
+getlocal = dbg.getlocal
+setcallhook = function () error"`setcallhook' is deprecated" end
+setlinehook = function () error"`setlinehook' is deprecated" end
+setlocal = dbg.setlocal
+
+-------------------------------------------------------------------
+-- math library
+local math = math
+abs = math.abs
+acos = function (x) return math.deg(math.acos(x)) end
+asin = function (x) return math.deg(math.asin(x)) end
+atan = function (x) return math.deg(math.atan(x)) end
+atan2 = function (x,y) return math.deg(math.atan2(x,y)) end
+ceil = math.ceil
+cos = function (x) return math.cos(math.rad(x)) end
+deg = math.deg
+exp = math.exp
+floor = math.floor
+frexp = math.frexp
+ldexp = math.ldexp
+log = math.log
+log10 = math.log10
+max = math.max
+min = math.min
+mod = math.mod
+PI = math.pi
+--??? pow = math.pow
+rad = math.rad
+random = math.random
+randomseed = math.randomseed
+sin = function (x) return math.sin(math.rad(x)) end
+sqrt = math.sqrt
+tan = function (x) return math.tan(math.rad(x)) end
+
+-------------------------------------------------------------------
+-- string library
+local str = string
+strbyte = str.byte
+strchar = str.char
+strfind = str.find
+format = str.format
+gsub = str.gsub
+strlen = str.len
+strlower = str.lower
+strrep = str.rep
+strsub = str.sub
+strupper = str.upper
+
+-------------------------------------------------------------------
+-- os library
+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
+
+-------------------------------------------------------------------
+-- compatibility only
+getglobal = function (n) return _G[n] end
+setglobal = function (n,v) _G[n] = v end
+
+-------------------------------------------------------------------
+
+local io, tab = io, table
+
+-- IO library (files)
+_STDIN = io.stdin
+_STDERR = io.stderr
+_STDOUT = io.stdout
+_INPUT = io.stdin
+_OUTPUT = io.stdout
+seek = io.stdin.seek -- sick ;-)
+tmpfile = io.tmpfile
+closefile = io.close
+openfile = io.open
+
+function flush (f)
+ if f then f:flush()
+ else _OUTPUT:flush()
+ end
+end
+
+function readfrom (name)
+ if name == nil then
+ local f, err, cod = io.close(_INPUT)
+ _INPUT = io.stdin
+ return f, err, cod
+ else
+ local f, err, cod = io.open(name, "r")
+ _INPUT = f or _INPUT
+ return f, err, cod
+ end
+end
+
+function writeto (name)
+ if name == nil then
+ local f, err, cod = io.close(_OUTPUT)
+ _OUTPUT = io.stdout
+ return f, err, cod
+ else
+ local f, err, cod = io.open(name, "w")
+ _OUTPUT = f or _OUTPUT
+ return f, err, cod
+ end
+end
+
+function appendto (name)
+ local f, err, cod = io.open(name, "a")
+ _OUTPUT = f or _OUTPUT
+ return f, err, cod
+end
+
+function read (...)
+ local f = _INPUT
+ if type(arg[1]) == 'userdata' then
+ f = tab.remove(arg, 1)
+ end
+ return f:read(unpack(arg))
+end
+
+function write (...)
+ local f = _OUTPUT
+ if type(arg[1]) == 'userdata' then
+ f = tab.remove(arg, 1)
+ end
+ return f:write(unpack(arg))
+end
+
--- /dev/null
+-- emulate the command line behaviour of Lua 4.0
+-- usage: lua doall.lua f1.lua f2.lua f3.lua ...
+
+for i=1,table.getn(arg) do
+ dofile(arg[i])
+end
--- /dev/null
+
+# Lua precompiled files. Versions 2.3 and 4.1 were never officially released.
+0 string \33Lua precompiled chunk for Lua
+>4 byte 0x23 2.3*
+>4 byte 0x24 2.4
+>4 byte 0x25 2.5
+>4 byte 0x30 3.0
+>4 byte 0x31 3.1
+>4 byte 0x32 3.2
+>4 byte 0x40 4.0
+>4 byte 0x41 4.1*
+>4 byte 0x50 5.0
--- /dev/null
+/* XPM */
+static char *magick[] = {
+/* columns rows colors chars-per-pixel */
+"32 32 6 1",
+" c Gray0",
+". c #000000008080",
+"X c #808080808080",
+"o c #c0c0c0c0c0c0",
+"O c Gray100",
+"+ c None",
+/* pixels */
+"++++++++++++++++++++++++++ooo+++",
+"++++++++++++++++++++++++oX...Xo+",
+"++++++++++++++++++++++++X.....X+",
+"+++++++++++++++++++++++o.......o",
+"+++++++++XX......XX++++o.......o",
+"+++++++X............X++o.......o",
+"+++++o................o+X.....X+",
+"++++X..................XoX...Xo+",
+"+++X..............XXX...X+ooo+++",
+"++o.............XoOOOoX..o++++++",
+"++..............oOOOOOo...++++++",
+"+X.............XOOOOOOOX..X+++++",
+"+..............XOOOOOOOX...+++++",
+"X..............XOOOOOOOX...X++++",
+"X...............oOOOOOo....X++++",
+"................XoOOOoX.....++++",
+"....XO............XXX.......++++",
+"....XO......................++++",
+"....XO.....OX..OX.XOOOo.....++++",
+"....XO.....OX..OX.OoXXOX....++++",
+"....XO.....OX..OX....XOX....++++",
+"X...XO.....OX..OX..OOoOX...X++++",
+"X...XO.....OX..OX.OX..OX...X++++",
+"+...XOXXXX.OoXoOX.OXXXOX...+++++",
+"+X..XOOOOO.XOOXOX.XOOOXo..X+++++",
+"++........................++++++",
+"++o......................o++++++",
+"+++X....................X+++++++",
+"++++X..................X++++++++",
+"+++++o................o+++++++++",
+"+++++++X............X+++++++++++",
+"+++++++++XX......XX+++++++++++++"
+};
--- /dev/null
+/* luser_number.h -- number type configuration for Lua core
+*
+* #define LUA_USER_H to this file and #define one of USE_* below
+*/
+
+#ifdef USE_DOUBLE
+#define LUA_NUMBER double
+#define LUA_NUMBER_SCAN "%lf"
+#define LUA_NUMBER_FMT "%.14g"
+#endif
+
+#ifdef USE_FLOAT
+#define LUA_NUMBER float
+#define LUA_NUMBER_SCAN "%f"
+#define LUA_NUMBER_FMT "%.5g"
+#endif
+
+#ifdef USE_LONG
+#define LUA_NUMBER long
+#define LUA_NUMBER_SCAN "%ld"
+#define LUA_NUMBER_FMT "%ld"
+#define lua_str2number(s,p) strtol((s), (p), 10)
+#endif
+
+#ifdef USE_INT
+#define LUA_NUMBER int
+#define LUA_NUMBER_SCAN "%d"
+#define LUA_NUMBER_FMT "%d"
+#define lua_str2number(s,p) ((int) strtol((s), (p), 10))
+#endif
+
+#ifdef USE_FASTROUND
+#define lua_number2int(i,d) __asm__("fldl %1\nfistpl %0":"=m"(i):"m"(d))
+#endif
--- /dev/null
+/*
+** $Id: ltests.h,v 1.20 2002/12/04 17:29:05 roberto Exp $
+** Internal Header for Debugging of the Lua Implementation
+** See Copyright Notice in lua.h
+*/
+
+#ifndef ltests_h
+#define ltests_h
+
+
+#include <stdlib.h>
+
+
+#define LUA_DEBUG
+
+#define LUA_OPNAMES
+
+#undef NDEBUG
+#include <assert.h>
+#define lua_assert(c) assert(c)
+#define check_exp(c,e) (lua_assert(c), (e))
+#define api_check(L, o) lua_assert(o)
+
+
+/* to avoid warnings, and to make sure value is really unused */
+#define UNUSED(x) (x=0, (void)(x))
+
+
+/* memory allocator control variables */
+extern unsigned long memdebug_numblocks;
+extern unsigned long memdebug_total;
+extern unsigned long memdebug_maxmem;
+extern unsigned long memdebug_memlimit;
+
+
+#define l_realloc(b, os, s) debug_realloc(b, os, s)
+#define l_free(b, os) debug_realloc(b, os, 0)
+
+void *debug_realloc (void *block, size_t oldsize, size_t size);
+
+
+
+/* test for lock/unlock */
+extern int islocked;
+#define LUA_USERSTATE int *
+#define getlock(l) (*(cast(LUA_USERSTATE *, l) - 1))
+#define lua_userstateopen(l) if (l != NULL) getlock(l) = &islocked;
+#define lua_lock(l) lua_assert((*getlock(l))++ == 0)
+#define lua_unlock(l) lua_assert(--(*getlock(l)) == 0)
+
+
+int luaB_opentests (lua_State *L);
+
+#define LUA_EXTRALIBS { "tests", luaB_opentests },
+
+
+/* real main will be defined at `ltests.c' */
+int l_main (int argc, char *argv[]);
+#define main l_main
+
+
+
+/* change some sizes to give some bugs a chance */
+
+#define LUAL_BUFFERSIZE 27
+#define MINSTRTABSIZE 2
+
+#endif
--- /dev/null
+/*
+* min.c -- a minimal Lua interpreter
+* loads stdin only with minimal error handling.
+* no interaction, and no standard library, only a "print" function.
+*/
+
+#include <stdio.h>
+#include "lua.h"
+
+static int print(lua_State *L)
+{
+ int n=lua_gettop(L);
+ int i;
+ for (i=1; i<=n; i++)
+ {
+ if (i>1) printf("\t");
+ if (lua_isstring(L,i))
+ printf("%s",lua_tostring(L,i));
+ else if (lua_isnil(L,i))
+ printf("%s","nil");
+ else if (lua_isboolean(L,i))
+ printf("%s",lua_toboolean(L,i) ? "true" : "false");
+ else
+ printf("%s:%p",lua_typename(L,lua_type(L,i)),lua_topointer(L,i));
+ }
+ printf("\n");
+ return 0;
+}
+
+static const char *getF(lua_State *L, void *ud, size_t *size)
+{
+ FILE *f=(FILE *)ud;
+ static char buff[512];
+ if (feof(f)) return NULL;
+ *size=fread(buff,1,sizeof(buff),f);
+ return (*size>0) ? buff : NULL;
+}
+
+int main(void)
+{
+ lua_State *L=lua_open();
+ lua_register(L,"print",print);
+ if (lua_load(L,getF,stdin,"=stdin") || lua_pcall(L,0,0,0))
+ fprintf(stderr,"%s\n",lua_tostring(L,-1));
+ return 0;
+}
--- /dev/null
+/*
+* The code below can be used to make a Lua core that does not contain the
+* parsing modules (lcode, llex, lparser), which represent 35% of the total core.
+* You'll only be able to load binary files and strings, precompiled with luac.
+* (Of course, you'll have to build luac with the original parsing modules!)
+*
+* To use this module, simply compile it ("make noparser" does that) and
+* list its object file before the Lua libraries. The linker should then not
+* load the parsing modules. To try it, do "make luab".
+*/
+
+#include "llex.h"
+#include "lparser.h"
+#include "lzio.h"
+
+void luaX_init (lua_State *L) {
+ UNUSED(L);
+}
+
+Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff) {
+ UNUSED(z);
+ UNUSED(buff);
+ lua_pushstring(L,"parser not loaded");
+ lua_error(L);
+ return NULL;
+}
--- /dev/null
+/* sa-config.c -- configuration for stand-alone Lua interpreter
+*
+* #define LUA_USERCONFIG to this file
+*
+* Here are the features that can be customized using #define:
+*
+*** Line edit and history:
+* #define USE_READLINE to use the GNU readline library.
+*
+* To use another library for this, use the code below as a start.
+* Make sure you #define lua_readline and lua_saveline accordingly.
+* If you do not #define lua_readline, you'll get a version based on fgets
+* that uses a static buffer of size MAXINPUT.
+*
+*
+*** Static Lua libraries to be loaded at startup:
+* #define lua_userinit(L) to a Lua function that loads libraries; typically
+* #define lua_userinit(L) openstdlibs(L);myinit(L)
+* or
+* #define lua_userinit(L) myinit(L)
+*
+* Another way is to add the prototypes of the init functions here and
+* #define LUA_EXTRALIBS accordingly. For example,
+* #define LUA_EXTRALIBS {"mylib","luaopen_mylib"},
+* Note the ending comma!
+*
+*
+*** Prompts:
+* The stand-alone Lua interpreter uses two prompts: PROMPT and PROMPT2.
+* PROMPT is the primary prompt, shown when the intepreter is ready to receive
+* a new statement. PROMPT2 is the secondary prompt, shown while a statement
+* is being entered but is still incomplete.
+*
+*
+*** Program name:
+* Error messages usually show argv[0] as a program name. In systems that do
+* not give a valid string as argv[0], error messages show PROGNAME instead.
+*
+*
+*/
+
+#ifdef USE_READLINE
+/*
+* This section implements of lua_readline and lua_saveline for lua.c using
+* the GNU readline and history libraries. It should also work with drop-in
+* replacements such as editline and libedit (you may have to include
+* different headers, though).
+*
+*/
+
+#define lua_readline myreadline
+#define lua_saveline mysaveline
+
+#include <ctype.h>
+#include <readline/readline.h>
+#include <readline/history.h>
+
+static int myreadline (lua_State *L, const char *prompt) {
+ char *s=readline(prompt);
+ if (s==NULL)
+ return 0;
+ else {
+ lua_pushstring(L,s);
+ lua_pushliteral(L,"\n");
+ lua_concat(L,2);
+ free(s);
+ return 1;
+ }
+}
+
+static void mysaveline (lua_State *L, const char *s) {
+ const char *p;
+ for (p=s; isspace(*p); p++)
+ ;
+ if (*p!=0) {
+ size_t n=strlen(s)-1;
+ if (s[n]!='\n')
+ add_history(s);
+ else {
+ lua_pushlstring(L,s,n);
+ s=lua_tostring(L,-1);
+ add_history(s);
+ lua_remove(L,-1);
+ }
+ }
+}
+#endif
--- /dev/null
+/*
+* trace.c -- a simple execution tracer for Lua
+*/
+
+#include <stdio.h>
+#include <string.h>
+#include "lua.h"
+#include "lualib.h"
+#include "lauxlib.h"
+
+static FILE* LOG; /* log file */
+static int I=0; /* indentation level */
+
+static void hook(lua_State *L, lua_Debug *ar)
+{
+ const char* s="";
+ switch (ar->event)
+ {
+ case LUA_HOOKTAILRET: ar->event=LUA_HOOKRET;
+ case LUA_HOOKRET: s="return"; break;
+ case LUA_HOOKCALL: s="call"; break;
+ case LUA_HOOKLINE: s="line"; break;
+ default: break;
+ }
+ fprintf(LOG,"[%d]\t%*s%s\t-- %d\n",I,I,"",s,ar->currentline);
+ if (ar->event==LUA_HOOKCALL) ++I; else if (ar->event==LUA_HOOKRET) --I;
+}
+
+static void start_trace(lua_State *L, FILE* logfile)
+{
+ lua_sethook(L,hook,LUA_MASKCALL | LUA_MASKRET | LUA_MASKLINE, 0);
+ LOG=logfile;
+}
+
+static void stop_trace(lua_State *L)
+{
+ lua_sethook(L,NULL,0,0);
+ fclose(LOG);
+}
+
+int main(void)
+{
+ int rc;
+ lua_State *L=lua_open();
+ lua_baselibopen(L);
+ lua_tablibopen(L);
+ lua_iolibopen(L);
+ lua_strlibopen(L);
+ lua_mathlibopen(L);
+ lua_dblibopen(L);
+ start_trace(L,stderr);
+ rc=lua_dofile(L,NULL);
+ stop_trace(L);
+ return rc;
+}
--- /dev/null
+# makefile for Lua distribution (includes)
+
+LUA= ..
+
+include $(LUA)/config
+
+SRCS= lua.h lualib.h lauxlib.h
+
+all:
+
+clean:
+
+co:
+ co -q -f -M $(SRCS)
+
+klean: clean
+ rm -f $(SRCS)
--- /dev/null
+/*
+** $Id: lauxlib.h,v 1.60 2003/04/03 13:35:34 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"
+
+
+#ifndef LUALIB_API
+#define LUALIB_API LUA_API
+#endif
+
+
+
+typedef struct luaL_reg {
+ const char *name;
+ lua_CFunction func;
+} luaL_reg;
+
+
+LUALIB_API void luaL_openlib (lua_State *L, const char *libname,
+ const luaL_reg *l, int nup);
+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 int luaL_typerror (lua_State *L, int narg, const char *tname);
+LUALIB_API int luaL_argerror (lua_State *L, int numarg, const char *extramsg);
+LUALIB_API const char *luaL_checklstring (lua_State *L, int numArg, size_t *l);
+LUALIB_API const char *luaL_optlstring (lua_State *L, int numArg,
+ const char *def, size_t *l);
+LUALIB_API lua_Number luaL_checknumber (lua_State *L, int numArg);
+LUALIB_API lua_Number luaL_optnumber (lua_State *L, int nArg, lua_Number def);
+
+LUALIB_API void luaL_checkstack (lua_State *L, int sz, const char *msg);
+LUALIB_API void luaL_checktype (lua_State *L, int narg, int t);
+LUALIB_API void luaL_checkany (lua_State *L, int narg);
+
+LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname);
+LUALIB_API void luaL_getmetatable (lua_State *L, 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_findstring (const char *st, const char *const lst[]);
+
+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_getn (lua_State *L, int t);
+LUALIB_API void luaL_setn (lua_State *L, int t, int n);
+
+LUALIB_API int luaL_loadfile (lua_State *L, const char *filename);
+LUALIB_API int luaL_loadbuffer (lua_State *L, const char *buff, size_t sz,
+ const char *name);
+
+
+
+/*
+** ===============================================================
+** some useful macros
+** ===============================================================
+*/
+
+#define luaL_argcheck(L, cond,numarg,extramsg) if (!(cond)) \
+ luaL_argerror(L, numarg,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_checkint(L,n) ((int)luaL_checknumber(L, n))
+#define luaL_checklong(L,n) ((long)luaL_checknumber(L, n))
+#define luaL_optint(L,n,d) ((int)luaL_optnumber(L, n,(lua_Number)(d)))
+#define luaL_optlong(L,n,d) ((long)luaL_optnumber(L, n,(lua_Number)(d)))
+
+
+/*
+** {======================================================
+** Generic Buffer manipulation
+** =======================================================
+*/
+
+
+#ifndef LUAL_BUFFERSIZE
+#define LUAL_BUFFERSIZE BUFSIZ
+#endif
+
+
+typedef struct luaL_Buffer {
+ char *p; /* current position in buffer */
+ int lvl; /* number of strings in the stack (level) */
+ lua_State *L;
+ char buffer[LUAL_BUFFERSIZE];
+} luaL_Buffer;
+
+#define luaL_putchar(B,c) \
+ ((void)((B)->p < ((B)->buffer+LUAL_BUFFERSIZE) || luaL_prepbuffer(B)), \
+ (*(B)->p++ = (char)(c)))
+
+#define luaL_addsize(B,n) ((B)->p += (n))
+
+LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B);
+LUALIB_API char *luaL_prepbuffer (luaL_Buffer *B);
+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);
+
+
+/* }====================================================== */
+
+
+
+/*
+** Compatibility macros and functions
+*/
+
+LUALIB_API int lua_dofile (lua_State *L, const char *filename);
+LUALIB_API int lua_dostring (lua_State *L, const char *str);
+LUALIB_API int lua_dobuffer (lua_State *L, const char *buff, size_t sz,
+ const char *n);
+
+
+#define luaL_check_lstr luaL_checklstring
+#define luaL_opt_lstr luaL_optlstring
+#define luaL_check_number luaL_checknumber
+#define luaL_opt_number luaL_optnumber
+#define luaL_arg_check luaL_argcheck
+#define luaL_check_string luaL_checkstring
+#define luaL_opt_string luaL_optstring
+#define luaL_check_int luaL_checkint
+#define luaL_check_long luaL_checklong
+#define luaL_opt_int luaL_optint
+#define luaL_opt_long luaL_optlong
+
+
+#endif
+
+
--- /dev/null
+/*
+** $Id: lua.h,v 1.175b 2003/03/18 12:31:39 roberto Exp $
+** Lua - An Extensible Extension Language
+** Tecgraf: Computer Graphics Technology Group, PUC-Rio, Brazil
+** http://www.lua.org mailto:info@lua.org
+** See Copyright Notice at the end of this file
+*/
+
+
+#ifndef lua_h
+#define lua_h
+
+#include <stdarg.h>
+#include <stddef.h>
+
+
+#define LUA_VERSION "Lua 5.0.2"
+#define LUA_COPYRIGHT "Copyright (C) 1994-2004 Tecgraf, PUC-Rio"
+#define LUA_AUTHORS "R. Ierusalimschy, L. H. de Figueiredo & W. Celes"
+
+
+
+/* option for multiple returns in `lua_pcall' and `lua_call' */
+#define LUA_MULTRET (-1)
+
+
+/*
+** pseudo-indices
+*/
+#define LUA_REGISTRYINDEX (-10000)
+#define LUA_GLOBALSINDEX (-10001)
+#define lua_upvalueindex(i) (LUA_GLOBALSINDEX-(i))
+
+
+/* error codes for `lua_load' and `lua_pcall' */
+#define LUA_ERRRUN 1
+#define LUA_ERRFILE 2
+#define LUA_ERRSYNTAX 3
+#define LUA_ERRMEM 4
+#define LUA_ERRERR 5
+
+
+typedef struct lua_State lua_State;
+
+typedef int (*lua_CFunction) (lua_State *L);
+
+
+/*
+** functions that read/write blocks when loading/dumping Lua chunks
+*/
+typedef const char * (*lua_Chunkreader) (lua_State *L, void *ud, size_t *sz);
+
+typedef int (*lua_Chunkwriter) (lua_State *L, const void* p,
+ size_t sz, void* ud);
+
+
+/*
+** 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
+
+
+/* minimum Lua stack available to a C function */
+#define LUA_MINSTACK 20
+
+
+/*
+** generic extra include file
+*/
+#ifdef LUA_USER_H
+#include LUA_USER_H
+#endif
+
+
+/* type of numbers in Lua */
+#ifndef LUA_NUMBER
+typedef double lua_Number;
+#else
+typedef LUA_NUMBER lua_Number;
+#endif
+
+
+/* mark for all API functions */
+#ifndef LUA_API
+#define LUA_API extern
+#endif
+
+
+/*
+** state manipulation
+*/
+LUA_API lua_State *lua_open (void);
+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);
+
+
+/*
+** basic stack manipulation
+*/
+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_remove (lua_State *L, int idx);
+LUA_API void lua_insert (lua_State *L, int idx);
+LUA_API void lua_replace (lua_State *L, int idx);
+LUA_API int lua_checkstack (lua_State *L, int sz);
+
+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_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 int lua_equal (lua_State *L, int idx1, int idx2);
+LUA_API int lua_rawequal (lua_State *L, int idx1, int idx2);
+LUA_API int lua_lessthan (lua_State *L, int idx1, int idx2);
+
+LUA_API lua_Number lua_tonumber (lua_State *L, int idx);
+LUA_API int lua_toboolean (lua_State *L, int idx);
+LUA_API const char *lua_tostring (lua_State *L, int idx);
+LUA_API size_t lua_strlen (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);
+
+
+/*
+** 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_pushlstring (lua_State *L, const char *s, size_t l);
+LUA_API void 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);
+
+
+/*
+** get functions (Lua -> stack)
+*/
+LUA_API void lua_gettable (lua_State *L, int idx);
+LUA_API void lua_rawget (lua_State *L, int idx);
+LUA_API void lua_rawgeti (lua_State *L, int idx, int n);
+LUA_API void lua_newtable (lua_State *L);
+LUA_API void *lua_newuserdata (lua_State *L, size_t sz);
+LUA_API int lua_getmetatable (lua_State *L, int objindex);
+LUA_API void lua_getfenv (lua_State *L, int idx);
+
+
+/*
+** set functions (stack -> Lua)
+*/
+LUA_API void lua_settable (lua_State *L, int idx);
+LUA_API void lua_rawset (lua_State *L, int idx);
+LUA_API void lua_rawseti (lua_State *L, int idx, int n);
+LUA_API int lua_setmetatable (lua_State *L, int objindex);
+LUA_API int lua_setfenv (lua_State *L, int idx);
+
+
+/*
+** `load' and `call' functions (load and run Lua code)
+*/
+LUA_API void lua_call (lua_State *L, int nargs, int nresults);
+LUA_API int lua_pcall (lua_State *L, int nargs, int nresults, int errfunc);
+LUA_API int lua_cpcall (lua_State *L, lua_CFunction func, void *ud);
+LUA_API int lua_load (lua_State *L, lua_Chunkreader reader, void *dt,
+ const char *chunkname);
+
+LUA_API int lua_dump (lua_State *L, lua_Chunkwriter writer, void *data);
+
+
+/*
+** coroutine functions
+*/
+LUA_API int lua_yield (lua_State *L, int nresults);
+LUA_API int lua_resume (lua_State *L, int narg);
+
+/*
+** garbage-collection functions
+*/
+LUA_API int lua_getgcthreshold (lua_State *L);
+LUA_API int lua_getgccount (lua_State *L);
+LUA_API void lua_setgcthreshold (lua_State *L, int newthreshold);
+
+/*
+** miscellaneous functions
+*/
+
+LUA_API const char *lua_version (void);
+
+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);
+
+
+
+/*
+** ===============================================================
+** some useful macros
+** ===============================================================
+*/
+
+#define lua_boxpointer(L,u) \
+ (*(void **)(lua_newuserdata(L, sizeof(void *))) = (u))
+
+#define lua_unboxpointer(L,i) (*(void **)(lua_touserdata(L, i)))
+
+#define lua_pop(L,n) lua_settop(L, -(n)-1)
+
+#define lua_register(L,n,f) \
+ (lua_pushstring(L, n), \
+ lua_pushcfunction(L, f), \
+ lua_settable(L, LUA_GLOBALSINDEX))
+
+#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_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_pushlstring(L, "" s, (sizeof(s)/sizeof(char))-1)
+
+
+
+/*
+** compatibility macros and functions
+*/
+
+
+LUA_API int lua_pushupvalues (lua_State *L);
+
+#define lua_getregistry(L) lua_pushvalue(L, LUA_REGISTRYINDEX)
+#define lua_setglobal(L,s) \
+ (lua_pushstring(L, s), lua_insert(L, -2), lua_settable(L, LUA_GLOBALSINDEX))
+
+#define lua_getglobal(L,s) \
+ (lua_pushstring(L, s), lua_gettable(L, LUA_GLOBALSINDEX))
+
+
+/* compatibility with ref system */
+
+/* pre-defined references */
+#define LUA_NOREF (-2)
+#define LUA_REFNIL (-1)
+
+#define lua_ref(L,lock) ((lock) ? luaL_ref(L, LUA_REGISTRYINDEX) : \
+ (lua_pushstring(L, "unlocked references are obsolete"), lua_error(L), 0))
+
+#define lua_unref(L,ref) luaL_unref(L, LUA_REGISTRYINDEX, (ref))
+
+#define lua_getref(L,ref) lua_rawgeti(L, LUA_REGISTRYINDEX, ref)
+
+
+
+/*
+** {======================================================================
+** useful definitions for Lua kernel and libraries
+** =======================================================================
+*/
+
+/* formats for Lua numbers */
+#ifndef LUA_NUMBER_SCAN
+#define LUA_NUMBER_SCAN "%lf"
+#endif
+
+#ifndef LUA_NUMBER_FMT
+#define LUA_NUMBER_FMT "%.14g"
+#endif
+
+/* }====================================================================== */
+
+
+/*
+** {======================================================================
+** Debug API
+** =======================================================================
+*/
+
+
+/*
+** Event codes
+*/
+#define LUA_HOOKCALL 0
+#define LUA_HOOKRET 1
+#define LUA_HOOKLINE 2
+#define LUA_HOOKCOUNT 3
+#define LUA_HOOKTAILRET 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 */
+
+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 int 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);
+
+
+#define LUA_IDSIZE 60
+
+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 nups; /* (u) number of upvalues */
+ int linedefined; /* (S) */
+ char short_src[LUA_IDSIZE]; /* (S) */
+ /* private part */
+ int i_ci; /* active function */
+};
+
+/* }====================================================================== */
+
+
+/******************************************************************************
+* Copyright (C) 1994-2004 Tecgraf, PUC-Rio. All rights reserved.
+*
+* Permission is hereby granted, free of charge, to any person obtaining
+* a copy of this software and associated documentation files (the
+* "Software"), to deal in the Software without restriction, including
+* without limitation the rights to use, copy, modify, merge, publish,
+* distribute, sublicense, and/or sell copies of the Software, and to
+* permit persons to whom the Software is furnished to do so, subject to
+* the following conditions:
+*
+* The above copyright notice and this permission notice shall be
+* included in all copies or substantial portions of the Software.
+*
+* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+******************************************************************************/
+
+
+#endif
--- /dev/null
+/*
+** $Id: lualib.h,v 1.28 2003/03/18 12:24:26 roberto Exp $
+** Lua standard libraries
+** See Copyright Notice in lua.h
+*/
+
+
+#ifndef lualib_h
+#define lualib_h
+
+#include "lua.h"
+
+
+#ifndef LUALIB_API
+#define LUALIB_API LUA_API
+#endif
+
+
+#define LUA_COLIBNAME "coroutine"
+LUALIB_API int luaopen_base (lua_State *L);
+
+#define LUA_TABLIBNAME "table"
+LUALIB_API int luaopen_table (lua_State *L);
+
+#define LUA_IOLIBNAME "io"
+#define LUA_OSLIBNAME "os"
+LUALIB_API int luaopen_io (lua_State *L);
+
+#define LUA_STRLIBNAME "string"
+LUALIB_API int luaopen_string (lua_State *L);
+
+#define LUA_MATHLIBNAME "math"
+LUALIB_API int luaopen_math (lua_State *L);
+
+#define LUA_DBLIBNAME "debug"
+LUALIB_API int luaopen_debug (lua_State *L);
+
+
+LUALIB_API int luaopen_loadlib (lua_State *L);
+
+
+/* to help testing the libraries */
+#ifndef lua_assert
+#define lua_assert(c) /* empty */
+#endif
+
+
+/* compatibility code */
+#define lua_baselibopen luaopen_base
+#define lua_tablibopen luaopen_table
+#define lua_iolibopen luaopen_io
+#define lua_strlibopen luaopen_string
+#define lua_mathlibopen luaopen_math
+#define lua_dblibopen luaopen_debug
+
+#endif
--- /dev/null
+# makefile for Lua core library
+
+LUA= ..
+
+include $(LUA)/config
+
+OBJS= \
+ lapi.o \
+ lcode.o \
+ ldebug.o \
+ ldo.o \
+ ldump.o \
+ lfunc.o \
+ lgc.o \
+ llex.o \
+ lmem.o \
+ lobject.o \
+ lopcodes.o \
+ lparser.o \
+ lstate.o \
+ lstring.o \
+ ltable.o \
+ ltests.o \
+ ltm.o \
+ lundump.o \
+ lvm.o \
+ lzio.o
+
+SRCS= \
+ lapi.c \
+ lcode.c \
+ ldebug.c \
+ ldo.c \
+ ldump.c \
+ lfunc.c \
+ lgc.c \
+ llex.c \
+ lmem.c \
+ lobject.c \
+ lopcodes.c \
+ lparser.c \
+ lstate.c \
+ lstring.c \
+ ltable.c \
+ ltests.c \
+ ltm.c \
+ lundump.c \
+ lvm.c \
+ lzio.c \
+ lapi.h \
+ lcode.h \
+ ldebug.h \
+ ldo.h \
+ lfunc.h \
+ lgc.h \
+ llex.h \
+ llimits.h \
+ lmem.h \
+ lobject.h \
+ lopcodes.h \
+ lparser.h \
+ lstate.h \
+ lstring.h \
+ ltable.h \
+ ltm.h \
+ lundump.h \
+ lvm.h \
+ lzio.h
+
+T= $(LIB)/liblua.a
+
+all: $T
+
+$T: $(OBJS)
+ $(AR) $@ $(OBJS)
+ $(RANLIB) $@
+
+clean:
+ rm -f $(OBJS) $T
+
+co:
+ co -q -f -M $(SRCS)
+
+klean: clean
+ rm -f $(SRCS)
--- /dev/null
+This is the Lua core.
+
+The standard Lua library are in lib/.
+A sample interpreter is in lua/.
+A standalone compiler is in luac/.
--- /dev/null
+/*
+** $Id: lapi.c,v 1.235 2003/04/07 14:36:08 roberto Exp $
+** Lua API
+** See Copyright Notice in lua.h
+*/
+
+
+#include <assert.h>
+#include <string.h>
+
+#define lapi_c
+
+#include "lua.h"
+
+#include "lapi.h"
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lgc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+#include "lundump.h"
+#include "lvm.h"
+
+
+const char lua_ident[] =
+ "$Lua: " LUA_VERSION " " LUA_COPYRIGHT " $\n"
+ "$Authors: " LUA_AUTHORS " $\n"
+ "$URL: www.lua.org $\n";
+
+
+
+#ifndef api_check
+#define api_check(L, o) /*{ assert(o); }*/
+#endif
+
+#define api_checknelems(L, n) api_check(L, (n) <= (L->top - L->base))
+
+#define api_incr_top(L) {api_check(L, L->top < L->ci->top); L->top++;}
+
+
+
+
+static TObject *negindex (lua_State *L, int idx) {
+ if (idx > LUA_REGISTRYINDEX) {
+ api_check(L, idx != 0 && -idx <= L->top - L->base);
+ return L->top+idx;
+ }
+ else switch (idx) { /* pseudo-indices */
+ case LUA_REGISTRYINDEX: return registry(L);
+ case LUA_GLOBALSINDEX: return gt(L);
+ default: {
+ TObject *func = (L->base - 1);
+ idx = LUA_GLOBALSINDEX - idx;
+ lua_assert(iscfunction(func));
+ return (idx <= clvalue(func)->c.nupvalues)
+ ? &clvalue(func)->c.upvalue[idx-1]
+ : NULL;
+ }
+ }
+}
+
+
+static TObject *luaA_index (lua_State *L, int idx) {
+ if (idx > 0) {
+ api_check(L, idx <= L->top - L->base);
+ return L->base + idx - 1;
+ }
+ else {
+ TObject *o = negindex(L, idx);
+ api_check(L, o != NULL);
+ return o;
+ }
+}
+
+
+static TObject *luaA_indexAcceptable (lua_State *L, int idx) {
+ if (idx > 0) {
+ TObject *o = L->base+(idx-1);
+ api_check(L, idx <= L->stack_last - L->base);
+ if (o >= L->top) return NULL;
+ else return o;
+ }
+ else
+ return negindex(L, idx);
+}
+
+
+void luaA_pushobject (lua_State *L, const TObject *o) {
+ setobj2s(L->top, o);
+ incr_top(L);
+}
+
+
+LUA_API int lua_checkstack (lua_State *L, int size) {
+ int res;
+ lua_lock(L);
+ if ((L->top - L->base + size) > LUA_MAXCSTACK)
+ res = 0; /* stack overflow */
+ else {
+ luaD_checkstack(L, size);
+ if (L->ci->top < L->top + size)
+ L->ci->top = L->top + size;
+ res = 1;
+ }
+ lua_unlock(L);
+ return res;
+}
+
+
+LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) {
+ int i;
+ lua_lock(to);
+ api_checknelems(from, n);
+ from->top -= n;
+ for (i = 0; i < n; i++) {
+ setobj2s(to->top, from->top + i);
+ api_incr_top(to);
+ }
+ lua_unlock(to);
+}
+
+
+LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) {
+ lua_CFunction old;
+ lua_lock(L);
+ old = G(L)->panic;
+ G(L)->panic = panicf;
+ lua_unlock(L);
+ return old;
+}
+
+
+LUA_API lua_State *lua_newthread (lua_State *L) {
+ lua_State *L1;
+ lua_lock(L);
+ luaC_checkGC(L);
+ L1 = luaE_newthread(L);
+ setthvalue(L->top, L1);
+ api_incr_top(L);
+ lua_unlock(L);
+ lua_userstateopen(L1);
+ return L1;
+}
+
+
+
+/*
+** basic stack manipulation
+*/
+
+
+LUA_API int lua_gettop (lua_State *L) {
+ return (L->top - L->base);
+}
+
+
+LUA_API void lua_settop (lua_State *L, int idx) {
+ lua_lock(L);
+ if (idx >= 0) {
+ api_check(L, idx <= L->stack_last - L->base);
+ while (L->top < L->base + idx)
+ setnilvalue(L->top++);
+ L->top = L->base + idx;
+ }
+ else {
+ api_check(L, -(idx+1) <= (L->top - L->base));
+ L->top += idx+1; /* `subtract' index (index is negative) */
+ }
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_remove (lua_State *L, int idx) {
+ StkId p;
+ lua_lock(L);
+ p = luaA_index(L, idx);
+ while (++p < L->top) setobjs2s(p-1, p);
+ L->top--;
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_insert (lua_State *L, int idx) {
+ StkId p;
+ StkId q;
+ lua_lock(L);
+ p = luaA_index(L, idx);
+ for (q = L->top; q>p; q--) setobjs2s(q, q-1);
+ setobjs2s(p, L->top);
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_replace (lua_State *L, int idx) {
+ lua_lock(L);
+ api_checknelems(L, 1);
+ setobj(luaA_index(L, idx), L->top - 1); /* write barrier */
+ L->top--;
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_pushvalue (lua_State *L, int idx) {
+ lua_lock(L);
+ setobj2s(L->top, luaA_index(L, idx));
+ api_incr_top(L);
+ lua_unlock(L);
+}
+
+
+
+/*
+** access functions (stack -> C)
+*/
+
+
+LUA_API int lua_type (lua_State *L, int idx) {
+ StkId o = luaA_indexAcceptable(L, idx);
+ return (o == NULL) ? LUA_TNONE : ttype(o);
+}
+
+
+LUA_API const char *lua_typename (lua_State *L, int t) {
+ UNUSED(L);
+ return (t == LUA_TNONE) ? "no value" : luaT_typenames[t];
+}
+
+
+LUA_API int lua_iscfunction (lua_State *L, int idx) {
+ StkId o = luaA_indexAcceptable(L, idx);
+ return (o == NULL) ? 0 : iscfunction(o);
+}
+
+
+LUA_API int lua_isnumber (lua_State *L, int idx) {
+ TObject n;
+ const TObject *o = luaA_indexAcceptable(L, idx);
+ return (o != NULL && tonumber(o, &n));
+}
+
+
+LUA_API int lua_isstring (lua_State *L, int idx) {
+ int t = lua_type(L, idx);
+ return (t == LUA_TSTRING || t == LUA_TNUMBER);
+}
+
+
+LUA_API int lua_isuserdata (lua_State *L, int idx) {
+ const TObject *o = luaA_indexAcceptable(L, idx);
+ return (o != NULL && (ttisuserdata(o) || ttislightuserdata(o)));
+}
+
+
+LUA_API int lua_rawequal (lua_State *L, int index1, int index2) {
+ StkId o1 = luaA_indexAcceptable(L, index1);
+ StkId o2 = luaA_indexAcceptable(L, index2);
+ return (o1 == NULL || o2 == NULL) ? 0 /* index out of range */
+ : luaO_rawequalObj(o1, o2);
+}
+
+
+LUA_API int lua_equal (lua_State *L, int index1, int index2) {
+ StkId o1, o2;
+ int i;
+ lua_lock(L); /* may call tag method */
+ o1 = luaA_indexAcceptable(L, index1);
+ o2 = luaA_indexAcceptable(L, index2);
+ i = (o1 == NULL || o2 == NULL) ? 0 /* index out of range */
+ : equalobj(L, o1, o2);
+ lua_unlock(L);
+ return i;
+}
+
+
+LUA_API int lua_lessthan (lua_State *L, int index1, int index2) {
+ StkId o1, o2;
+ int i;
+ lua_lock(L); /* may call tag method */
+ o1 = luaA_indexAcceptable(L, index1);
+ o2 = luaA_indexAcceptable(L, index2);
+ i = (o1 == NULL || o2 == NULL) ? 0 /* index out-of-range */
+ : luaV_lessthan(L, o1, o2);
+ lua_unlock(L);
+ return i;
+}
+
+
+
+LUA_API lua_Number lua_tonumber (lua_State *L, int idx) {
+ TObject n;
+ const TObject *o = luaA_indexAcceptable(L, idx);
+ if (o != NULL && tonumber(o, &n))
+ return nvalue(o);
+ else
+ return 0;
+}
+
+
+LUA_API int lua_toboolean (lua_State *L, int idx) {
+ const TObject *o = luaA_indexAcceptable(L, idx);
+ return (o != NULL) && !l_isfalse(o);
+}
+
+
+LUA_API const char *lua_tostring (lua_State *L, int idx) {
+ StkId o = luaA_indexAcceptable(L, idx);
+ if (o == NULL)
+ return NULL;
+ else if (ttisstring(o))
+ return svalue(o);
+ else {
+ const char *s;
+ lua_lock(L); /* `luaV_tostring' may create a new string */
+ s = (luaV_tostring(L, o) ? svalue(o) : NULL);
+ luaC_checkGC(L);
+ lua_unlock(L);
+ return s;
+ }
+}
+
+
+LUA_API size_t lua_strlen (lua_State *L, int idx) {
+ StkId o = luaA_indexAcceptable(L, idx);
+ if (o == NULL)
+ return 0;
+ else if (ttisstring(o))
+ return tsvalue(o)->tsv.len;
+ else {
+ size_t l;
+ lua_lock(L); /* `luaV_tostring' may create a new string */
+ l = (luaV_tostring(L, o) ? tsvalue(o)->tsv.len : 0);
+ lua_unlock(L);
+ return l;
+ }
+}
+
+
+LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) {
+ StkId o = luaA_indexAcceptable(L, idx);
+ return (o == NULL || !iscfunction(o)) ? NULL : clvalue(o)->c.f;
+}
+
+
+LUA_API void *lua_touserdata (lua_State *L, int idx) {
+ StkId o = luaA_indexAcceptable(L, idx);
+ if (o == NULL) return NULL;
+ switch (ttype(o)) {
+ case LUA_TUSERDATA: return (uvalue(o) + 1);
+ case LUA_TLIGHTUSERDATA: return pvalue(o);
+ default: return NULL;
+ }
+}
+
+
+LUA_API lua_State *lua_tothread (lua_State *L, int idx) {
+ StkId o = luaA_indexAcceptable(L, idx);
+ return (o == NULL || !ttisthread(o)) ? NULL : thvalue(o);
+}
+
+
+LUA_API const void *lua_topointer (lua_State *L, int idx) {
+ StkId o = luaA_indexAcceptable(L, idx);
+ if (o == NULL) return NULL;
+ else {
+ switch (ttype(o)) {
+ case LUA_TTABLE: return hvalue(o);
+ case LUA_TFUNCTION: return clvalue(o);
+ case LUA_TTHREAD: return thvalue(o);
+ case LUA_TUSERDATA:
+ case LUA_TLIGHTUSERDATA:
+ return lua_touserdata(L, idx);
+ default: return NULL;
+ }
+ }
+}
+
+
+
+/*
+** push functions (C -> stack)
+*/
+
+
+LUA_API void lua_pushnil (lua_State *L) {
+ lua_lock(L);
+ setnilvalue(L->top);
+ api_incr_top(L);
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_pushnumber (lua_State *L, lua_Number n) {
+ lua_lock(L);
+ setnvalue(L->top, n);
+ api_incr_top(L);
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_pushlstring (lua_State *L, const char *s, size_t len) {
+ lua_lock(L);
+ luaC_checkGC(L);
+ setsvalue2s(L->top, luaS_newlstr(L, s, len));
+ api_incr_top(L);
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_pushstring (lua_State *L, const char *s) {
+ if (s == NULL)
+ lua_pushnil(L);
+ else
+ lua_pushlstring(L, s, strlen(s));
+}
+
+
+LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt,
+ va_list argp) {
+ const char *ret;
+ lua_lock(L);
+ luaC_checkGC(L);
+ ret = luaO_pushvfstring(L, fmt, argp);
+ lua_unlock(L);
+ return ret;
+}
+
+
+LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) {
+ const char *ret;
+ va_list argp;
+ lua_lock(L);
+ luaC_checkGC(L);
+ va_start(argp, fmt);
+ ret = luaO_pushvfstring(L, fmt, argp);
+ va_end(argp);
+ lua_unlock(L);
+ return ret;
+}
+
+
+LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) {
+ Closure *cl;
+ lua_lock(L);
+ luaC_checkGC(L);
+ api_checknelems(L, n);
+ cl = luaF_newCclosure(L, n);
+ cl->c.f = fn;
+ L->top -= n;
+ while (n--)
+ setobj2n(&cl->c.upvalue[n], L->top+n);
+ setclvalue(L->top, cl);
+ api_incr_top(L);
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_pushboolean (lua_State *L, int b) {
+ lua_lock(L);
+ setbvalue(L->top, (b != 0)); /* ensure that true is 1 */
+ api_incr_top(L);
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_pushlightuserdata (lua_State *L, void *p) {
+ lua_lock(L);
+ setpvalue(L->top, p);
+ api_incr_top(L);
+ lua_unlock(L);
+}
+
+
+
+/*
+** get functions (Lua -> stack)
+*/
+
+
+LUA_API void lua_gettable (lua_State *L, int idx) {
+ StkId t;
+ lua_lock(L);
+ t = luaA_index(L, idx);
+ setobj2s(L->top - 1, luaV_gettable(L, t, L->top - 1, 0));
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_rawget (lua_State *L, int idx) {
+ StkId t;
+ lua_lock(L);
+ t = luaA_index(L, idx);
+ api_check(L, ttistable(t));
+ setobj2s(L->top - 1, luaH_get(hvalue(t), L->top - 1));
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_rawgeti (lua_State *L, int idx, int n) {
+ StkId o;
+ lua_lock(L);
+ o = luaA_index(L, idx);
+ api_check(L, ttistable(o));
+ setobj2s(L->top, luaH_getnum(hvalue(o), n));
+ api_incr_top(L);
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_newtable (lua_State *L) {
+ lua_lock(L);
+ luaC_checkGC(L);
+ sethvalue(L->top, luaH_new(L, 0, 0));
+ api_incr_top(L);
+ lua_unlock(L);
+}
+
+
+LUA_API int lua_getmetatable (lua_State *L, int objindex) {
+ const TObject *obj;
+ Table *mt = NULL;
+ int res;
+ lua_lock(L);
+ obj = luaA_indexAcceptable(L, objindex);
+ if (obj != NULL) {
+ switch (ttype(obj)) {
+ case LUA_TTABLE:
+ mt = hvalue(obj)->metatable;
+ break;
+ case LUA_TUSERDATA:
+ mt = uvalue(obj)->uv.metatable;
+ break;
+ }
+ }
+ if (mt == NULL || mt == hvalue(defaultmeta(L)))
+ res = 0;
+ else {
+ sethvalue(L->top, mt);
+ api_incr_top(L);
+ res = 1;
+ }
+ lua_unlock(L);
+ return res;
+}
+
+
+LUA_API void lua_getfenv (lua_State *L, int idx) {
+ StkId o;
+ lua_lock(L);
+ o = luaA_index(L, idx);
+ setobj2s(L->top, isLfunction(o) ? &clvalue(o)->l.g : gt(L));
+ api_incr_top(L);
+ lua_unlock(L);
+}
+
+
+/*
+** set functions (stack -> Lua)
+*/
+
+
+LUA_API void lua_settable (lua_State *L, int idx) {
+ StkId t;
+ lua_lock(L);
+ api_checknelems(L, 2);
+ t = luaA_index(L, idx);
+ luaV_settable(L, t, L->top - 2, L->top - 1);
+ L->top -= 2; /* pop index and value */
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_rawset (lua_State *L, int idx) {
+ StkId t;
+ lua_lock(L);
+ api_checknelems(L, 2);
+ t = luaA_index(L, idx);
+ api_check(L, ttistable(t));
+ setobj2t(luaH_set(L, hvalue(t), L->top-2), L->top-1); /* write barrier */
+ L->top -= 2;
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_rawseti (lua_State *L, int idx, int n) {
+ StkId o;
+ lua_lock(L);
+ api_checknelems(L, 1);
+ o = luaA_index(L, idx);
+ api_check(L, ttistable(o));
+ setobj2t(luaH_setnum(L, hvalue(o), n), L->top-1); /* write barrier */
+ L->top--;
+ lua_unlock(L);
+}
+
+
+LUA_API int lua_setmetatable (lua_State *L, int objindex) {
+ TObject *obj, *mt;
+ int res = 1;
+ lua_lock(L);
+ api_checknelems(L, 1);
+ obj = luaA_index(L, objindex);
+ mt = (!ttisnil(L->top - 1)) ? L->top - 1 : defaultmeta(L);
+ api_check(L, ttistable(mt));
+ switch (ttype(obj)) {
+ case LUA_TTABLE: {
+ hvalue(obj)->metatable = hvalue(mt); /* write barrier */
+ break;
+ }
+ case LUA_TUSERDATA: {
+ uvalue(obj)->uv.metatable = hvalue(mt); /* write barrier */
+ break;
+ }
+ default: {
+ res = 0; /* cannot set */
+ break;
+ }
+ }
+ L->top--;
+ lua_unlock(L);
+ return res;
+}
+
+
+LUA_API int lua_setfenv (lua_State *L, int idx) {
+ StkId o;
+ int res = 0;
+ lua_lock(L);
+ api_checknelems(L, 1);
+ o = luaA_index(L, idx);
+ L->top--;
+ api_check(L, ttistable(L->top));
+ if (isLfunction(o)) {
+ res = 1;
+ clvalue(o)->l.g = *(L->top);
+ }
+ lua_unlock(L);
+ return res;
+}
+
+
+/*
+** `load' and `call' functions (run Lua code)
+*/
+
+LUA_API void lua_call (lua_State *L, int nargs, int nresults) {
+ StkId func;
+ lua_lock(L);
+ api_checknelems(L, nargs+1);
+ func = L->top - (nargs+1);
+ luaD_call(L, func, nresults);
+ lua_unlock(L);
+}
+
+
+
+/*
+** Execute a protected call.
+*/
+struct CallS { /* data to `f_call' */
+ StkId func;
+ int nresults;
+};
+
+
+static void f_call (lua_State *L, void *ud) {
+ struct CallS *c = cast(struct CallS *, ud);
+ luaD_call(L, c->func, c->nresults);
+}
+
+
+
+LUA_API int lua_pcall (lua_State *L, int nargs, int nresults, int errfunc) {
+ struct CallS c;
+ int status;
+ ptrdiff_t func;
+ lua_lock(L);
+ func = (errfunc == 0) ? 0 : savestack(L, luaA_index(L, errfunc));
+ c.func = L->top - (nargs+1); /* function to be called */
+ c.nresults = nresults;
+ status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func);
+ lua_unlock(L);
+ return status;
+}
+
+
+/*
+** Execute a protected C call.
+*/
+struct CCallS { /* data to `f_Ccall' */
+ lua_CFunction func;
+ void *ud;
+};
+
+
+static void f_Ccall (lua_State *L, void *ud) {
+ struct CCallS *c = cast(struct CCallS *, ud);
+ Closure *cl;
+ cl = luaF_newCclosure(L, 0);
+ cl->c.f = c->func;
+ setclvalue(L->top, cl); /* push function */
+ incr_top(L);
+ setpvalue(L->top, c->ud); /* push only argument */
+ incr_top(L);
+ luaD_call(L, L->top - 2, 0);
+}
+
+
+LUA_API int lua_cpcall (lua_State *L, lua_CFunction func, void *ud) {
+ struct CCallS c;
+ int status;
+ lua_lock(L);
+ c.func = func;
+ c.ud = ud;
+ status = luaD_pcall(L, f_Ccall, &c, savestack(L, L->top), 0);
+ lua_unlock(L);
+ return status;
+}
+
+
+LUA_API int lua_load (lua_State *L, lua_Chunkreader reader, void *data,
+ const char *chunkname) {
+ ZIO z;
+ int status;
+ int c;
+ lua_lock(L);
+ if (!chunkname) chunkname = "?";
+ luaZ_init(&z, reader, data, chunkname);
+ c = luaZ_lookahead(&z);
+ status = luaD_protectedparser(L, &z, (c == LUA_SIGNATURE[0]));
+ lua_unlock(L);
+ return status;
+}
+
+
+LUA_API int lua_dump (lua_State *L, lua_Chunkwriter writer, void *data) {
+ int status;
+ TObject *o;
+ lua_lock(L);
+ api_checknelems(L, 1);
+ o = L->top - 1;
+ if (isLfunction(o) && clvalue(o)->l.nupvalues == 0) {
+ luaU_dump(L, clvalue(o)->l.p, writer, data);
+ status = 1;
+ }
+ else
+ status = 0;
+ lua_unlock(L);
+ return status;
+}
+
+
+/*
+** Garbage-collection functions
+*/
+
+/* GC values are expressed in Kbytes: #bytes/2^10 */
+#define GCscalel(x) ((x)>>10)
+#define GCscale(x) (cast(int, GCscalel(x)))
+#define GCunscale(x) (cast(lu_mem, x)<<10)
+
+LUA_API int lua_getgcthreshold (lua_State *L) {
+ int threshold;
+ lua_lock(L);
+ threshold = GCscale(G(L)->GCthreshold);
+ lua_unlock(L);
+ return threshold;
+}
+
+LUA_API int lua_getgccount (lua_State *L) {
+ int count;
+ lua_lock(L);
+ count = GCscale(G(L)->nblocks);
+ lua_unlock(L);
+ return count;
+}
+
+LUA_API void lua_setgcthreshold (lua_State *L, int newthreshold) {
+ lua_lock(L);
+ if (cast(lu_mem, newthreshold) > GCscalel(MAX_LUMEM))
+ G(L)->GCthreshold = MAX_LUMEM;
+ else
+ G(L)->GCthreshold = GCunscale(newthreshold);
+ luaC_checkGC(L);
+ lua_unlock(L);
+}
+
+
+/*
+** miscellaneous functions
+*/
+
+
+LUA_API const char *lua_version (void) {
+ return LUA_VERSION;
+}
+
+
+LUA_API int lua_error (lua_State *L) {
+ lua_lock(L);
+ api_checknelems(L, 1);
+ luaG_errormsg(L);
+ lua_unlock(L);
+ return 0; /* to avoid warnings */
+}
+
+
+LUA_API int lua_next (lua_State *L, int idx) {
+ StkId t;
+ int more;
+ lua_lock(L);
+ t = luaA_index(L, idx);
+ api_check(L, ttistable(t));
+ more = luaH_next(L, hvalue(t), L->top - 1);
+ if (more) {
+ api_incr_top(L);
+ }
+ else /* no more elements */
+ L->top -= 1; /* remove key */
+ lua_unlock(L);
+ return more;
+}
+
+
+LUA_API void lua_concat (lua_State *L, int n) {
+ lua_lock(L);
+ luaC_checkGC(L);
+ api_checknelems(L, n);
+ if (n >= 2) {
+ luaV_concat(L, n, L->top - L->base - 1);
+ L->top -= (n-1);
+ }
+ else if (n == 0) { /* push empty string */
+ setsvalue2s(L->top, luaS_newlstr(L, NULL, 0));
+ api_incr_top(L);
+ }
+ /* else n == 1; nothing to do */
+ lua_unlock(L);
+}
+
+
+LUA_API void *lua_newuserdata (lua_State *L, size_t size) {
+ Udata *u;
+ lua_lock(L);
+ luaC_checkGC(L);
+ u = luaS_newudata(L, size);
+ setuvalue(L->top, u);
+ api_incr_top(L);
+ lua_unlock(L);
+ return u + 1;
+}
+
+
+LUA_API int lua_pushupvalues (lua_State *L) {
+ Closure *func;
+ int n, i;
+ lua_lock(L);
+ api_check(L, iscfunction(L->base - 1));
+ func = clvalue(L->base - 1);
+ n = func->c.nupvalues;
+ luaD_checkstack(L, n + LUA_MINSTACK);
+ for (i=0; i<n; i++) {
+ setobj2s(L->top, &func->c.upvalue[i]);
+ L->top++;
+ }
+ lua_unlock(L);
+ return n;
+}
+
+
+static const char *aux_upvalue (lua_State *L, int funcindex, int n,
+ TObject **val) {
+ Closure *f;
+ StkId fi = luaA_index(L, funcindex);
+ if (!ttisfunction(fi)) return NULL;
+ f = clvalue(fi);
+ if (f->c.isC) {
+ if (n > f->c.nupvalues) return NULL;
+ *val = &f->c.upvalue[n-1];
+ return "";
+ }
+ else {
+ Proto *p = f->l.p;
+ if (n > p->sizeupvalues) return NULL;
+ *val = f->l.upvals[n-1]->v;
+ return getstr(p->upvalues[n-1]);
+ }
+}
+
+
+LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) {
+ const char *name;
+ TObject *val;
+ lua_lock(L);
+ name = aux_upvalue(L, funcindex, n, &val);
+ if (name) {
+ setobj2s(L->top, val);
+ api_incr_top(L);
+ }
+ lua_unlock(L);
+ return name;
+}
+
+
+LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) {
+ const char *name;
+ TObject *val;
+ lua_lock(L);
+ api_checknelems(L, 1);
+ name = aux_upvalue(L, funcindex, n, &val);
+ if (name) {
+ L->top--;
+ setobj(val, L->top); /* write barrier */
+ }
+ lua_unlock(L);
+ return name;
+}
+
--- /dev/null
+/*
+** $Id: lapi.h,v 1.21 2002/03/04 21:29:41 roberto Exp $
+** Auxiliary functions from Lua API
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lapi_h
+#define lapi_h
+
+
+#include "lobject.h"
+
+
+void luaA_pushobject (lua_State *L, const TObject *o);
+
+#endif
--- /dev/null
+/*
+** $Id: lcode.c,v 1.117 2003/04/03 13:35:34 roberto Exp $
+** Code generator for Lua
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdlib.h>
+
+#define lcode_c
+
+#include "lua.h"
+
+#include "lcode.h"
+#include "ldebug.h"
+#include "ldo.h"
+#include "llex.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lparser.h"
+#include "ltable.h"
+
+
+#define hasjumps(e) ((e)->t != (e)->f)
+
+
+void luaK_nil (FuncState *fs, int from, int n) {
+ Instruction *previous;
+ if (fs->pc > fs->lasttarget && /* no jumps to current position? */
+ GET_OPCODE(*(previous = &fs->f->code[fs->pc-1])) == OP_LOADNIL) {
+ int pfrom = GETARG_A(*previous);
+ int pto = GETARG_B(*previous);
+ if (pfrom <= from && from <= pto+1) { /* can connect both? */
+ if (from+n-1 > pto)
+ SETARG_B(*previous, from+n-1);
+ return;
+ }
+ }
+ luaK_codeABC(fs, OP_LOADNIL, from, from+n-1, 0); /* else no optimization */
+}
+
+
+int luaK_jump (FuncState *fs) {
+ int jpc = fs->jpc; /* save list of jumps to here */
+ int j;
+ fs->jpc = NO_JUMP;
+ j = luaK_codeAsBx(fs, OP_JMP, 0, NO_JUMP);
+ luaK_concat(fs, &j, jpc); /* keep them on hold */
+ return j;
+}
+
+
+static int luaK_condjump (FuncState *fs, OpCode op, int A, int B, int C) {
+ luaK_codeABC(fs, op, A, B, C);
+ return luaK_jump(fs);
+}
+
+
+static void luaK_fixjump (FuncState *fs, int pc, int dest) {
+ Instruction *jmp = &fs->f->code[pc];
+ int offset = dest-(pc+1);
+ lua_assert(dest != NO_JUMP);
+ if (abs(offset) > MAXARG_sBx)
+ luaX_syntaxerror(fs->ls, "control structure too long");
+ SETARG_sBx(*jmp, offset);
+}
+
+
+/*
+** returns current `pc' and marks it as a jump target (to avoid wrong
+** optimizations with consecutive instructions not in the same basic block).
+*/
+int luaK_getlabel (FuncState *fs) {
+ fs->lasttarget = fs->pc;
+ return fs->pc;
+}
+
+
+static int luaK_getjump (FuncState *fs, int pc) {
+ int offset = GETARG_sBx(fs->f->code[pc]);
+ if (offset == NO_JUMP) /* point to itself represents end of list */
+ return NO_JUMP; /* end of list */
+ else
+ return (pc+1)+offset; /* turn offset into absolute position */
+}
+
+
+static Instruction *getjumpcontrol (FuncState *fs, int pc) {
+ Instruction *pi = &fs->f->code[pc];
+ if (pc >= 1 && testOpMode(GET_OPCODE(*(pi-1)), OpModeT))
+ return pi-1;
+ else
+ return pi;
+}
+
+
+/*
+** check whether list has any jump that do not produce a value
+** (or produce an inverted value)
+*/
+static int need_value (FuncState *fs, int list, int cond) {
+ for (; list != NO_JUMP; list = luaK_getjump(fs, list)) {
+ Instruction i = *getjumpcontrol(fs, list);
+ if (GET_OPCODE(i) != OP_TEST || GETARG_C(i) != cond) return 1;
+ }
+ return 0; /* not found */
+}
+
+
+static void patchtestreg (Instruction *i, int reg) {
+ if (reg == NO_REG) reg = GETARG_B(*i);
+ SETARG_A(*i, reg);
+}
+
+
+static void luaK_patchlistaux (FuncState *fs, int list,
+ int ttarget, int treg, int ftarget, int freg, int dtarget) {
+ while (list != NO_JUMP) {
+ int next = luaK_getjump(fs, list);
+ Instruction *i = getjumpcontrol(fs, list);
+ if (GET_OPCODE(*i) != OP_TEST) {
+ lua_assert(dtarget != NO_JUMP);
+ luaK_fixjump(fs, list, dtarget); /* jump to default target */
+ }
+ else {
+ if (GETARG_C(*i)) {
+ lua_assert(ttarget != NO_JUMP);
+ patchtestreg(i, treg);
+ luaK_fixjump(fs, list, ttarget);
+ }
+ else {
+ lua_assert(ftarget != NO_JUMP);
+ patchtestreg(i, freg);
+ luaK_fixjump(fs, list, ftarget);
+ }
+ }
+ list = next;
+ }
+}
+
+
+static void luaK_dischargejpc (FuncState *fs) {
+ luaK_patchlistaux(fs, fs->jpc, fs->pc, NO_REG, fs->pc, NO_REG, fs->pc);
+ fs->jpc = NO_JUMP;
+}
+
+
+void luaK_patchlist (FuncState *fs, int list, int target) {
+ if (target == fs->pc)
+ luaK_patchtohere(fs, list);
+ else {
+ lua_assert(target < fs->pc);
+ luaK_patchlistaux(fs, list, target, NO_REG, target, NO_REG, target);
+ }
+}
+
+
+void luaK_patchtohere (FuncState *fs, int list) {
+ luaK_getlabel(fs);
+ luaK_concat(fs, &fs->jpc, list);
+}
+
+
+void luaK_concat (FuncState *fs, int *l1, int l2) {
+ if (l2 == NO_JUMP) return;
+ else if (*l1 == NO_JUMP)
+ *l1 = l2;
+ else {
+ int list = *l1;
+ int next;
+ while ((next = luaK_getjump(fs, list)) != NO_JUMP) /* find last element */
+ list = next;
+ luaK_fixjump(fs, list, l2);
+ }
+}
+
+
+void luaK_checkstack (FuncState *fs, int n) {
+ int newstack = fs->freereg + n;
+ if (newstack > fs->f->maxstacksize) {
+ if (newstack >= MAXSTACK)
+ luaX_syntaxerror(fs->ls, "function or expression too complex");
+ fs->f->maxstacksize = cast(lu_byte, newstack);
+ }
+}
+
+
+void luaK_reserveregs (FuncState *fs, int n) {
+ luaK_checkstack(fs, n);
+ fs->freereg += n;
+}
+
+
+static void freereg (FuncState *fs, int reg) {
+ if (reg >= fs->nactvar && reg < MAXSTACK) {
+ fs->freereg--;
+ lua_assert(reg == fs->freereg);
+ }
+}
+
+
+static void freeexp (FuncState *fs, expdesc *e) {
+ if (e->k == VNONRELOC)
+ freereg(fs, e->info);
+}
+
+
+static int addk (FuncState *fs, TObject *k, TObject *v) {
+ const TObject *idx = luaH_get(fs->h, k);
+ if (ttisnumber(idx)) {
+ lua_assert(luaO_rawequalObj(&fs->f->k[cast(int, nvalue(idx))], v));
+ return cast(int, nvalue(idx));
+ }
+ else { /* constant not found; create a new entry */
+ Proto *f = fs->f;
+ luaM_growvector(fs->L, f->k, fs->nk, f->sizek, TObject,
+ MAXARG_Bx, "constant table overflow");
+ setobj2n(&f->k[fs->nk], v);
+ setnvalue(luaH_set(fs->L, fs->h, k), cast(lua_Number, fs->nk));
+ return fs->nk++;
+ }
+}
+
+
+int luaK_stringK (FuncState *fs, TString *s) {
+ TObject o;
+ setsvalue(&o, s);
+ return addk(fs, &o, &o);
+}
+
+
+int luaK_numberK (FuncState *fs, lua_Number r) {
+ TObject o;
+ setnvalue(&o, r);
+ return addk(fs, &o, &o);
+}
+
+
+static int nil_constant (FuncState *fs) {
+ TObject k, v;
+ setnilvalue(&v);
+ sethvalue(&k, fs->h); /* cannot use nil as key; instead use table itself */
+ return addk(fs, &k, &v);
+}
+
+
+void luaK_setcallreturns (FuncState *fs, expdesc *e, int nresults) {
+ if (e->k == VCALL) { /* expression is an open function call? */
+ SETARG_C(getcode(fs, e), nresults+1);
+ if (nresults == 1) { /* `regular' expression? */
+ e->k = VNONRELOC;
+ e->info = GETARG_A(getcode(fs, e));
+ }
+ }
+}
+
+
+void luaK_dischargevars (FuncState *fs, expdesc *e) {
+ switch (e->k) {
+ case VLOCAL: {
+ e->k = VNONRELOC;
+ break;
+ }
+ case VUPVAL: {
+ e->info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->info, 0);
+ e->k = VRELOCABLE;
+ break;
+ }
+ case VGLOBAL: {
+ e->info = luaK_codeABx(fs, OP_GETGLOBAL, 0, e->info);
+ e->k = VRELOCABLE;
+ break;
+ }
+ case VINDEXED: {
+ freereg(fs, e->aux);
+ freereg(fs, e->info);
+ e->info = luaK_codeABC(fs, OP_GETTABLE, 0, e->info, e->aux);
+ e->k = VRELOCABLE;
+ break;
+ }
+ case VCALL: {
+ luaK_setcallreturns(fs, e, 1);
+ break;
+ }
+ default: break; /* there is one value available (somewhere) */
+ }
+}
+
+
+static int code_label (FuncState *fs, int A, int b, int jump) {
+ luaK_getlabel(fs); /* those instructions may be jump targets */
+ return luaK_codeABC(fs, OP_LOADBOOL, A, b, jump);
+}
+
+
+static void discharge2reg (FuncState *fs, expdesc *e, int reg) {
+ luaK_dischargevars(fs, e);
+ switch (e->k) {
+ case VNIL: {
+ luaK_nil(fs, reg, 1);
+ break;
+ }
+ case VFALSE: case VTRUE: {
+ luaK_codeABC(fs, OP_LOADBOOL, reg, e->k == VTRUE, 0);
+ break;
+ }
+ case VK: {
+ luaK_codeABx(fs, OP_LOADK, reg, e->info);
+ break;
+ }
+ case VRELOCABLE: {
+ Instruction *pc = &getcode(fs, e);
+ SETARG_A(*pc, reg);
+ break;
+ }
+ case VNONRELOC: {
+ if (reg != e->info)
+ luaK_codeABC(fs, OP_MOVE, reg, e->info, 0);
+ break;
+ }
+ default: {
+ lua_assert(e->k == VVOID || e->k == VJMP);
+ return; /* nothing to do... */
+ }
+ }
+ e->info = reg;
+ e->k = VNONRELOC;
+}
+
+
+static void discharge2anyreg (FuncState *fs, expdesc *e) {
+ if (e->k != VNONRELOC) {
+ luaK_reserveregs(fs, 1);
+ discharge2reg(fs, e, fs->freereg-1);
+ }
+}
+
+
+static void luaK_exp2reg (FuncState *fs, expdesc *e, int reg) {
+ discharge2reg(fs, e, reg);
+ if (e->k == VJMP)
+ luaK_concat(fs, &e->t, e->info); /* put this jump in `t' list */
+ if (hasjumps(e)) {
+ int final; /* position after whole expression */
+ int p_f = NO_JUMP; /* position of an eventual LOAD false */
+ int p_t = NO_JUMP; /* position of an eventual LOAD true */
+ if (need_value(fs, e->t, 1) || need_value(fs, e->f, 0)) {
+ int fj = NO_JUMP; /* first jump (over LOAD ops.) */
+ if (e->k != VJMP)
+ fj = luaK_jump(fs);
+ p_f = code_label(fs, reg, 0, 1);
+ p_t = code_label(fs, reg, 1, 0);
+ luaK_patchtohere(fs, fj);
+ }
+ final = luaK_getlabel(fs);
+ luaK_patchlistaux(fs, e->f, p_f, NO_REG, final, reg, p_f);
+ luaK_patchlistaux(fs, e->t, final, reg, p_t, NO_REG, p_t);
+ }
+ e->f = e->t = NO_JUMP;
+ e->info = reg;
+ e->k = VNONRELOC;
+}
+
+
+void luaK_exp2nextreg (FuncState *fs, expdesc *e) {
+ luaK_dischargevars(fs, e);
+ freeexp(fs, e);
+ luaK_reserveregs(fs, 1);
+ luaK_exp2reg(fs, e, fs->freereg - 1);
+}
+
+
+int luaK_exp2anyreg (FuncState *fs, expdesc *e) {
+ luaK_dischargevars(fs, e);
+ if (e->k == VNONRELOC) {
+ if (!hasjumps(e)) return e->info; /* exp is already in a register */
+ if (e->info >= fs->nactvar) { /* reg. is not a local? */
+ luaK_exp2reg(fs, e, e->info); /* put value on it */
+ return e->info;
+ }
+ }
+ luaK_exp2nextreg(fs, e); /* default */
+ return e->info;
+}
+
+
+void luaK_exp2val (FuncState *fs, expdesc *e) {
+ if (hasjumps(e))
+ luaK_exp2anyreg(fs, e);
+ else
+ luaK_dischargevars(fs, e);
+}
+
+
+int luaK_exp2RK (FuncState *fs, expdesc *e) {
+ luaK_exp2val(fs, e);
+ switch (e->k) {
+ case VNIL: {
+ if (fs->nk + MAXSTACK <= MAXARG_C) { /* constant fit in argC? */
+ e->info = nil_constant(fs);
+ e->k = VK;
+ return e->info + MAXSTACK;
+ }
+ else break;
+ }
+ case VK: {
+ if (e->info + MAXSTACK <= MAXARG_C) /* constant fit in argC? */
+ return e->info + MAXSTACK;
+ else break;
+ }
+ default: break;
+ }
+ /* not a constant in the right range: put it in a register */
+ return luaK_exp2anyreg(fs, e);
+}
+
+
+void luaK_storevar (FuncState *fs, expdesc *var, expdesc *exp) {
+ switch (var->k) {
+ case VLOCAL: {
+ freeexp(fs, exp);
+ luaK_exp2reg(fs, exp, var->info);
+ return;
+ }
+ case VUPVAL: {
+ int e = luaK_exp2anyreg(fs, exp);
+ luaK_codeABC(fs, OP_SETUPVAL, e, var->info, 0);
+ break;
+ }
+ case VGLOBAL: {
+ int e = luaK_exp2anyreg(fs, exp);
+ luaK_codeABx(fs, OP_SETGLOBAL, e, var->info);
+ break;
+ }
+ case VINDEXED: {
+ int e = luaK_exp2RK(fs, exp);
+ luaK_codeABC(fs, OP_SETTABLE, var->info, var->aux, e);
+ break;
+ }
+ default: {
+ lua_assert(0); /* invalid var kind to store */
+ break;
+ }
+ }
+ freeexp(fs, exp);
+}
+
+
+void luaK_self (FuncState *fs, expdesc *e, expdesc *key) {
+ int func;
+ luaK_exp2anyreg(fs, e);
+ freeexp(fs, e);
+ func = fs->freereg;
+ luaK_reserveregs(fs, 2);
+ luaK_codeABC(fs, OP_SELF, func, e->info, luaK_exp2RK(fs, key));
+ freeexp(fs, key);
+ e->info = func;
+ e->k = VNONRELOC;
+}
+
+
+static void invertjump (FuncState *fs, expdesc *e) {
+ Instruction *pc = getjumpcontrol(fs, e->info);
+ lua_assert(testOpMode(GET_OPCODE(*pc), OpModeT) &&
+ GET_OPCODE(*pc) != OP_TEST);
+ SETARG_A(*pc, !(GETARG_A(*pc)));
+}
+
+
+static int jumponcond (FuncState *fs, expdesc *e, int cond) {
+ if (e->k == VRELOCABLE) {
+ Instruction ie = getcode(fs, e);
+ if (GET_OPCODE(ie) == OP_NOT) {
+ fs->pc--; /* remove previous OP_NOT */
+ return luaK_condjump(fs, OP_TEST, NO_REG, GETARG_B(ie), !cond);
+ }
+ /* else go through */
+ }
+ discharge2anyreg(fs, e);
+ freeexp(fs, e);
+ return luaK_condjump(fs, OP_TEST, NO_REG, e->info, cond);
+}
+
+
+void luaK_goiftrue (FuncState *fs, expdesc *e) {
+ int pc; /* pc of last jump */
+ luaK_dischargevars(fs, e);
+ switch (e->k) {
+ case VK: case VTRUE: {
+ pc = NO_JUMP; /* always true; do nothing */
+ break;
+ }
+ case VFALSE: {
+ pc = luaK_jump(fs); /* always jump */
+ break;
+ }
+ case VJMP: {
+ invertjump(fs, e);
+ pc = e->info;
+ break;
+ }
+ default: {
+ pc = jumponcond(fs, e, 0);
+ break;
+ }
+ }
+ luaK_concat(fs, &e->f, pc); /* insert last jump in `f' list */
+}
+
+
+void luaK_goiffalse (FuncState *fs, expdesc *e) {
+ int pc; /* pc of last jump */
+ luaK_dischargevars(fs, e);
+ switch (e->k) {
+ case VNIL: case VFALSE: {
+ pc = NO_JUMP; /* always false; do nothing */
+ break;
+ }
+ case VTRUE: {
+ pc = luaK_jump(fs); /* always jump */
+ break;
+ }
+ case VJMP: {
+ pc = e->info;
+ break;
+ }
+ default: {
+ pc = jumponcond(fs, e, 1);
+ break;
+ }
+ }
+ luaK_concat(fs, &e->t, pc); /* insert last jump in `t' list */
+}
+
+
+static void codenot (FuncState *fs, expdesc *e) {
+ luaK_dischargevars(fs, e);
+ switch (e->k) {
+ case VNIL: case VFALSE: {
+ e->k = VTRUE;
+ break;
+ }
+ case VK: case VTRUE: {
+ e->k = VFALSE;
+ break;
+ }
+ case VJMP: {
+ invertjump(fs, e);
+ break;
+ }
+ case VRELOCABLE:
+ case VNONRELOC: {
+ discharge2anyreg(fs, e);
+ freeexp(fs, e);
+ e->info = luaK_codeABC(fs, OP_NOT, 0, e->info, 0);
+ e->k = VRELOCABLE;
+ break;
+ }
+ default: {
+ lua_assert(0); /* cannot happen */
+ break;
+ }
+ }
+ /* interchange true and false lists */
+ { int temp = e->f; e->f = e->t; e->t = temp; }
+}
+
+
+void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) {
+ t->aux = luaK_exp2RK(fs, k);
+ t->k = VINDEXED;
+}
+
+
+void luaK_prefix (FuncState *fs, UnOpr op, expdesc *e) {
+ if (op == OPR_MINUS) {
+ luaK_exp2val(fs, e);
+ if (e->k == VK && ttisnumber(&fs->f->k[e->info]))
+ e->info = luaK_numberK(fs, -nvalue(&fs->f->k[e->info]));
+ else {
+ luaK_exp2anyreg(fs, e);
+ freeexp(fs, e);
+ e->info = luaK_codeABC(fs, OP_UNM, 0, e->info, 0);
+ e->k = VRELOCABLE;
+ }
+ }
+ else /* op == NOT */
+ codenot(fs, e);
+}
+
+
+void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) {
+ switch (op) {
+ case OPR_AND: {
+ luaK_goiftrue(fs, v);
+ luaK_patchtohere(fs, v->t);
+ v->t = NO_JUMP;
+ break;
+ }
+ case OPR_OR: {
+ luaK_goiffalse(fs, v);
+ luaK_patchtohere(fs, v->f);
+ v->f = NO_JUMP;
+ break;
+ }
+ case OPR_CONCAT: {
+ luaK_exp2nextreg(fs, v); /* operand must be on the `stack' */
+ break;
+ }
+ default: {
+ luaK_exp2RK(fs, v);
+ break;
+ }
+ }
+}
+
+
+static void codebinop (FuncState *fs, expdesc *res, BinOpr op,
+ int o1, int o2) {
+ if (op <= OPR_POW) { /* arithmetic operator? */
+ OpCode opc = cast(OpCode, (op - OPR_ADD) + OP_ADD); /* ORDER OP */
+ res->info = luaK_codeABC(fs, opc, 0, o1, o2);
+ res->k = VRELOCABLE;
+ }
+ else { /* test operator */
+ static const OpCode ops[] = {OP_EQ, OP_EQ, OP_LT, OP_LE, OP_LT, OP_LE};
+ int cond = 1;
+ if (op >= OPR_GT) { /* `>' or `>='? */
+ int temp; /* exchange args and replace by `<' or `<=' */
+ temp = o1; o1 = o2; o2 = temp; /* o1 <==> o2 */
+ }
+ else if (op == OPR_NE) cond = 0;
+ res->info = luaK_condjump(fs, ops[op - OPR_NE], cond, o1, o2);
+ res->k = VJMP;
+ }
+}
+
+
+void luaK_posfix (FuncState *fs, BinOpr op, expdesc *e1, expdesc *e2) {
+ switch (op) {
+ case OPR_AND: {
+ lua_assert(e1->t == NO_JUMP); /* list must be closed */
+ luaK_dischargevars(fs, e2);
+ luaK_concat(fs, &e1->f, e2->f);
+ e1->k = e2->k; e1->info = e2->info; e1->aux = e2->aux; e1->t = e2->t;
+ break;
+ }
+ case OPR_OR: {
+ lua_assert(e1->f == NO_JUMP); /* list must be closed */
+ luaK_dischargevars(fs, e2);
+ luaK_concat(fs, &e1->t, e2->t);
+ e1->k = e2->k; e1->info = e2->info; e1->aux = e2->aux; e1->f = e2->f;
+ break;
+ }
+ case OPR_CONCAT: {
+ luaK_exp2val(fs, e2);
+ if (e2->k == VRELOCABLE && GET_OPCODE(getcode(fs, e2)) == OP_CONCAT) {
+ lua_assert(e1->info == GETARG_B(getcode(fs, e2))-1);
+ freeexp(fs, e1);
+ SETARG_B(getcode(fs, e2), e1->info);
+ e1->k = e2->k; e1->info = e2->info;
+ }
+ else {
+ luaK_exp2nextreg(fs, e2);
+ freeexp(fs, e2);
+ freeexp(fs, e1);
+ e1->info = luaK_codeABC(fs, OP_CONCAT, 0, e1->info, e2->info);
+ e1->k = VRELOCABLE;
+ }
+ break;
+ }
+ default: {
+ int o1 = luaK_exp2RK(fs, e1);
+ int o2 = luaK_exp2RK(fs, e2);
+ freeexp(fs, e2);
+ freeexp(fs, e1);
+ codebinop(fs, e1, op, o1, o2);
+ }
+ }
+}
+
+
+void luaK_fixline (FuncState *fs, int line) {
+ fs->f->lineinfo[fs->pc - 1] = line;
+}
+
+
+int luaK_code (FuncState *fs, Instruction i, int line) {
+ Proto *f = fs->f;
+ luaK_dischargejpc(fs); /* `pc' will change */
+ /* put new instruction in code array */
+ luaM_growvector(fs->L, f->code, fs->pc, f->sizecode, Instruction,
+ MAX_INT, "code size overflow");
+ f->code[fs->pc] = i;
+ /* save corresponding line information */
+ luaM_growvector(fs->L, f->lineinfo, fs->pc, f->sizelineinfo, int,
+ MAX_INT, "code size overflow");
+ f->lineinfo[fs->pc] = line;
+ return fs->pc++;
+}
+
+
+int luaK_codeABC (FuncState *fs, OpCode o, int a, int b, int c) {
+ lua_assert(getOpMode(o) == iABC);
+ return luaK_code(fs, CREATE_ABC(o, a, b, c), fs->ls->lastline);
+}
+
+
+int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) {
+ lua_assert(getOpMode(o) == iABx || getOpMode(o) == iAsBx);
+ return luaK_code(fs, CREATE_ABx(o, a, bc), fs->ls->lastline);
+}
+
--- /dev/null
+/*
+** $Id: lcode.h,v 1.38 2002/12/11 12:34:22 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)
+
+
+/*
+** grep "ORDER OPR" if you change these enums
+*/
+typedef enum BinOpr {
+ OPR_ADD, OPR_SUB, OPR_MULT, OPR_DIV, OPR_POW,
+ OPR_CONCAT,
+ OPR_NE, OPR_EQ,
+ OPR_LT, OPR_LE, OPR_GT, OPR_GE,
+ OPR_AND, OPR_OR,
+ OPR_NOBINOPR
+} BinOpr;
+
+#define binopistest(op) ((op) >= OPR_NE)
+
+typedef enum UnOpr { OPR_MINUS, OPR_NOT, OPR_NOUNOPR } UnOpr;
+
+
+#define getcode(fs,e) ((fs)->f->code[(e)->info])
+
+#define luaK_codeAsBx(fs,o,A,sBx) luaK_codeABx(fs,o,A,(sBx)+MAXARG_sBx)
+
+int luaK_code (FuncState *fs, Instruction i, int line);
+int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned int Bx);
+int luaK_codeABC (FuncState *fs, OpCode o, int A, int B, int C);
+void luaK_fixline (FuncState *fs, int line);
+void luaK_nil (FuncState *fs, int from, int n);
+void luaK_reserveregs (FuncState *fs, int n);
+void luaK_checkstack (FuncState *fs, int n);
+int luaK_stringK (FuncState *fs, TString *s);
+int luaK_numberK (FuncState *fs, lua_Number r);
+void luaK_dischargevars (FuncState *fs, expdesc *e);
+int luaK_exp2anyreg (FuncState *fs, expdesc *e);
+void luaK_exp2nextreg (FuncState *fs, expdesc *e);
+void luaK_exp2val (FuncState *fs, expdesc *e);
+int luaK_exp2RK (FuncState *fs, expdesc *e);
+void luaK_self (FuncState *fs, expdesc *e, expdesc *key);
+void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k);
+void luaK_goiftrue (FuncState *fs, expdesc *e);
+void luaK_goiffalse (FuncState *fs, expdesc *e);
+void luaK_storevar (FuncState *fs, expdesc *var, expdesc *e);
+void luaK_setcallreturns (FuncState *fs, expdesc *var, int nresults);
+int luaK_jump (FuncState *fs);
+void luaK_patchlist (FuncState *fs, int list, int target);
+void luaK_patchtohere (FuncState *fs, int list);
+void luaK_concat (FuncState *fs, int *l1, int l2);
+int luaK_getlabel (FuncState *fs);
+void luaK_prefix (FuncState *fs, UnOpr op, expdesc *v);
+void luaK_infix (FuncState *fs, BinOpr op, expdesc *v);
+void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, expdesc *v2);
+
+
+#endif
--- /dev/null
+/*
+** $Id: ldebug.c,v 1.150 2003/03/19 21:24:04 roberto Exp $
+** Debug Interface
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdlib.h>
+#include <string.h>
+
+#define ldebug_c
+
+#include "lua.h"
+
+#include "lapi.h"
+#include "lcode.h"
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+#include "lvm.h"
+
+
+
+static const char *getfuncname (CallInfo *ci, const char **name);
+
+
+#define isLua(ci) (!((ci)->state & CI_C))
+
+
+static int currentpc (CallInfo *ci) {
+ if (!isLua(ci)) return -1; /* function is not a Lua function? */
+ if (ci->state & CI_HASFRAME) /* function has a frame? */
+ ci->u.l.savedpc = *ci->u.l.pc; /* use `pc' from there */
+ /* function's pc is saved */
+ return pcRel(ci->u.l.savedpc, ci_func(ci)->l.p);
+}
+
+
+static int currentline (CallInfo *ci) {
+ int pc = currentpc(ci);
+ if (pc < 0)
+ return -1; /* only active lua functions have current-line information */
+ else
+ return getline(ci_func(ci)->l.p, pc);
+}
+
+
+void luaG_inithooks (lua_State *L) {
+ CallInfo *ci;
+ for (ci = L->ci; ci != L->base_ci; ci--) /* update all `savedpc's */
+ currentpc(ci);
+ L->hookinit = 1;
+}
+
+
+/*
+** this function can be called asynchronous (e.g. during a signal)
+*/
+LUA_API int lua_sethook (lua_State *L, lua_Hook func, int mask, int count) {
+ if (func == NULL || mask == 0) { /* turn off hooks? */
+ mask = 0;
+ func = NULL;
+ }
+ L->hook = func;
+ L->basehookcount = count;
+ resethookcount(L);
+ L->hookmask = cast(lu_byte, mask);
+ L->hookinit = 0;
+ return 1;
+}
+
+
+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;
+ lua_lock(L);
+ for (ci = L->ci; level > 0 && ci > L->base_ci; ci--) {
+ level--;
+ if (!(ci->state & CI_C)) /* Lua function? */
+ level -= ci->u.l.tailcalls; /* skip lost tail calls */
+ }
+ if (level > 0 || ci == L->base_ci) status = 0; /* there is no such level */
+ else if (level < 0) { /* level is of a lost tail call */
+ status = 1;
+ ar->i_ci = 0;
+ }
+ else {
+ status = 1;
+ ar->i_ci = ci - L->base_ci;
+ }
+ lua_unlock(L);
+ return status;
+}
+
+
+static Proto *getluaproto (CallInfo *ci) {
+ return (isLua(ci) ? ci_func(ci)->l.p : NULL);
+}
+
+
+LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) {
+ const char *name;
+ CallInfo *ci;
+ Proto *fp;
+ lua_lock(L);
+ name = NULL;
+ ci = L->base_ci + ar->i_ci;
+ fp = getluaproto(ci);
+ if (fp) { /* is a Lua function? */
+ name = luaF_getlocalname(fp, n, currentpc(ci));
+ if (name)
+ luaA_pushobject(L, ci->base+(n-1)); /* push value */
+ }
+ lua_unlock(L);
+ return name;
+}
+
+
+LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) {
+ const char *name;
+ CallInfo *ci;
+ Proto *fp;
+ lua_lock(L);
+ name = NULL;
+ ci = L->base_ci + ar->i_ci;
+ fp = getluaproto(ci);
+ L->top--; /* pop new value */
+ if (fp) { /* is a Lua function? */
+ name = luaF_getlocalname(fp, n, currentpc(ci));
+ if (!name || name[0] == '(') /* `(' starts private locals */
+ name = NULL;
+ else
+ setobjs2s(ci->base+(n-1), L->top);
+ }
+ lua_unlock(L);
+ return name;
+}
+
+
+static void funcinfo (lua_Debug *ar, StkId func) {
+ Closure *cl = clvalue(func);
+ if (cl->c.isC) {
+ ar->source = "=[C]";
+ ar->linedefined = -1;
+ ar->what = "C";
+ }
+ else {
+ ar->source = getstr(cl->l.p->source);
+ ar->linedefined = cl->l.p->lineDefined;
+ ar->what = (ar->linedefined == 0) ? "main" : "Lua";
+ }
+ luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);
+}
+
+
+static const char *travglobals (lua_State *L, const TObject *o) {
+ Table *g = hvalue(gt(L));
+ int i = sizenode(g);
+ while (i--) {
+ Node *n = gnode(g, i);
+ if (luaO_rawequalObj(o, gval(n)) && ttisstring(gkey(n)))
+ return getstr(tsvalue(gkey(n)));
+ }
+ return NULL;
+}
+
+
+static void info_tailcall (lua_State *L, lua_Debug *ar) {
+ ar->name = ar->namewhat = "";
+ ar->what = "tail";
+ ar->linedefined = ar->currentline = -1;
+ ar->source = "=(tail call)";
+ luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);
+ ar->nups = 0;
+ setnilvalue(L->top);
+}
+
+
+static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar,
+ StkId f, CallInfo *ci) {
+ int status = 1;
+ for (; *what; what++) {
+ switch (*what) {
+ case 'S': {
+ funcinfo(ar, f);
+ break;
+ }
+ case 'l': {
+ ar->currentline = (ci) ? currentline(ci) : -1;
+ break;
+ }
+ case 'u': {
+ ar->nups = clvalue(f)->c.nupvalues;
+ break;
+ }
+ case 'n': {
+ ar->namewhat = (ci) ? getfuncname(ci, &ar->name) : NULL;
+ if (ar->namewhat == NULL) {
+ /* try to find a global name */
+ if ((ar->name = travglobals(L, f)) != NULL)
+ ar->namewhat = "global";
+ else ar->namewhat = ""; /* not found */
+ }
+ break;
+ }
+ case 'f': {
+ setobj2s(L->top, f);
+ break;
+ }
+ default: status = 0; /* invalid option */
+ }
+ }
+ return status;
+}
+
+
+LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) {
+ int status = 1;
+ lua_lock(L);
+ if (*what == '>') {
+ StkId f = L->top - 1;
+ if (!ttisfunction(f))
+ luaG_runerror(L, "value for `lua_getinfo' is not a function");
+ status = auxgetinfo(L, what + 1, ar, f, NULL);
+ L->top--; /* pop function */
+ }
+ else if (ar->i_ci != 0) { /* no tail call? */
+ CallInfo *ci = L->base_ci + ar->i_ci;
+ lua_assert(ttisfunction(ci->base - 1));
+ status = auxgetinfo(L, what, ar, ci->base - 1, ci);
+ }
+ else
+ info_tailcall(L, ar);
+ if (strchr(what, 'f')) incr_top(L);
+ lua_unlock(L);
+ return status;
+}
+
+
+/*
+** {======================================================
+** Symbolic Execution and code checker
+** =======================================================
+*/
+
+#define check(x) if (!(x)) return 0;
+
+#define checkjump(pt,pc) check(0 <= pc && pc < pt->sizecode)
+
+#define checkreg(pt,reg) check((reg) < (pt)->maxstacksize)
+
+
+
+static int precheck (const Proto *pt) {
+ check(pt->maxstacksize <= MAXSTACK);
+ check(pt->sizelineinfo == pt->sizecode || pt->sizelineinfo == 0);
+ lua_assert(pt->numparams+pt->is_vararg <= pt->maxstacksize);
+ check(GET_OPCODE(pt->code[pt->sizecode-1]) == OP_RETURN);
+ return 1;
+}
+
+
+static int checkopenop (const Proto *pt, int pc) {
+ Instruction i = pt->code[pc+1];
+ switch (GET_OPCODE(i)) {
+ case OP_CALL:
+ case OP_TAILCALL:
+ case OP_RETURN: {
+ check(GETARG_B(i) == 0);
+ return 1;
+ }
+ case OP_SETLISTO: return 1;
+ default: return 0; /* invalid instruction after an open call */
+ }
+}
+
+
+static int checkRK (const Proto *pt, int r) {
+ return (r < pt->maxstacksize || (r >= MAXSTACK && r-MAXSTACK < pt->sizek));
+}
+
+
+static Instruction luaG_symbexec (const Proto *pt, int lastpc, int reg) {
+ int pc;
+ int last; /* stores position of last instruction that changed `reg' */
+ last = pt->sizecode-1; /* points to final return (a `neutral' instruction) */
+ check(precheck(pt));
+ for (pc = 0; pc < lastpc; pc++) {
+ const Instruction i = pt->code[pc];
+ OpCode op = GET_OPCODE(i);
+ int a = GETARG_A(i);
+ int b = 0;
+ int c = 0;
+ checkreg(pt, a);
+ switch (getOpMode(op)) {
+ case iABC: {
+ b = GETARG_B(i);
+ c = GETARG_C(i);
+ if (testOpMode(op, OpModeBreg)) {
+ checkreg(pt, b);
+ }
+ else if (testOpMode(op, OpModeBrk))
+ check(checkRK(pt, b));
+ if (testOpMode(op, OpModeCrk))
+ check(checkRK(pt, c));
+ break;
+ }
+ case iABx: {
+ b = GETARG_Bx(i);
+ if (testOpMode(op, OpModeK)) check(b < pt->sizek);
+ break;
+ }
+ case iAsBx: {
+ b = GETARG_sBx(i);
+ break;
+ }
+ }
+ if (testOpMode(op, OpModesetA)) {
+ if (a == reg) last = pc; /* change register `a' */
+ }
+ if (testOpMode(op, OpModeT)) {
+ check(pc+2 < pt->sizecode); /* check skip */
+ check(GET_OPCODE(pt->code[pc+1]) == OP_JMP);
+ }
+ switch (op) {
+ case OP_LOADBOOL: {
+ check(c == 0 || pc+2 < pt->sizecode); /* check its jump */
+ break;
+ }
+ case OP_LOADNIL: {
+ if (a <= reg && reg <= b)
+ last = pc; /* set registers from `a' to `b' */
+ break;
+ }
+ case OP_GETUPVAL:
+ case OP_SETUPVAL: {
+ check(b < pt->nups);
+ break;
+ }
+ case OP_GETGLOBAL:
+ case OP_SETGLOBAL: {
+ check(ttisstring(&pt->k[b]));
+ break;
+ }
+ case OP_SELF: {
+ checkreg(pt, a+1);
+ if (reg == a+1) last = pc;
+ break;
+ }
+ case OP_CONCAT: {
+ /* `c' is a register, and at least two operands */
+ check(c < MAXSTACK && b < c);
+ break;
+ }
+ case OP_TFORLOOP:
+ checkreg(pt, a+c+5);
+ if (reg >= a) last = pc; /* affect all registers above base */
+ /* go through */
+ case OP_FORLOOP:
+ checkreg(pt, a+2);
+ /* go through */
+ case OP_JMP: {
+ int dest = pc+1+b;
+ check(0 <= dest && dest < pt->sizecode);
+ /* not full check and jump is forward and do not skip `lastpc'? */
+ if (reg != NO_REG && pc < dest && dest <= lastpc)
+ pc += b; /* do the jump */
+ break;
+ }
+ case OP_CALL:
+ case OP_TAILCALL: {
+ if (b != 0) {
+ checkreg(pt, a+b-1);
+ }
+ c--; /* c = num. returns */
+ if (c == LUA_MULTRET) {
+ check(checkopenop(pt, pc));
+ }
+ else if (c != 0)
+ checkreg(pt, a+c-1);
+ if (reg >= a) last = pc; /* affect all registers above base */
+ break;
+ }
+ case OP_RETURN: {
+ b--; /* b = num. returns */
+ if (b > 0) checkreg(pt, a+b-1);
+ break;
+ }
+ case OP_SETLIST: {
+ checkreg(pt, a + (b&(LFIELDS_PER_FLUSH-1)) + 1);
+ break;
+ }
+ case OP_CLOSURE: {
+ int nup;
+ check(b < pt->sizep);
+ nup = pt->p[b]->nups;
+ check(pc + nup < pt->sizecode);
+ for (; nup>0; nup--) {
+ OpCode op1 = GET_OPCODE(pt->code[pc+nup]);
+ check(op1 == OP_GETUPVAL || op1 == OP_MOVE);
+ }
+ break;
+ }
+ default: break;
+ }
+ }
+ return pt->code[last];
+}
+
+#undef check
+#undef checkjump
+#undef checkreg
+
+/* }====================================================== */
+
+
+int luaG_checkcode (const Proto *pt) {
+ return luaG_symbexec(pt, pt->sizecode, NO_REG);
+}
+
+
+static const char *kname (Proto *p, int c) {
+ c = c - MAXSTACK;
+ if (c >= 0 && ttisstring(&p->k[c]))
+ return svalue(&p->k[c]);
+ else
+ return "?";
+}
+
+
+static const char *getobjname (CallInfo *ci, int stackpos, const char **name) {
+ if (isLua(ci)) { /* a Lua function? */
+ Proto *p = ci_func(ci)->l.p;
+ int pc = currentpc(ci);
+ Instruction i;
+ *name = luaF_getlocalname(p, stackpos+1, pc);
+ if (*name) /* is a local? */
+ return "local";
+ i = luaG_symbexec(p, pc, stackpos); /* try symbolic execution */
+ lua_assert(pc != -1);
+ switch (GET_OPCODE(i)) {
+ case OP_GETGLOBAL: {
+ int g = GETARG_Bx(i); /* global index */
+ lua_assert(ttisstring(&p->k[g]));
+ *name = svalue(&p->k[g]);
+ return "global";
+ }
+ case OP_MOVE: {
+ int a = GETARG_A(i);
+ int b = GETARG_B(i); /* move from `b' to `a' */
+ if (b < a)
+ return getobjname(ci, b, name); /* get name for `b' */
+ break;
+ }
+ case OP_GETTABLE: {
+ int k = GETARG_C(i); /* key index */
+ *name = kname(p, k);
+ return "field";
+ }
+ case OP_SELF: {
+ int k = GETARG_C(i); /* key index */
+ *name = kname(p, k);
+ return "method";
+ }
+ default: break;
+ }
+ }
+ return NULL; /* no useful name found */
+}
+
+
+static const char *getfuncname (CallInfo *ci, const char **name) {
+ Instruction i;
+ if ((isLua(ci) && ci->u.l.tailcalls > 0) || !isLua(ci - 1))
+ return NULL; /* calling function is not Lua (or is unknown) */
+ ci--; /* calling function */
+ i = ci_func(ci)->l.p->code[currentpc(ci)];
+ if (GET_OPCODE(i) == OP_CALL || GET_OPCODE(i) == OP_TAILCALL)
+ return getobjname(ci, GETARG_A(i), name);
+ else
+ return NULL; /* no useful name can be found */
+}
+
+
+/* only ANSI way to check whether a pointer points to an array */
+static int isinstack (CallInfo *ci, const TObject *o) {
+ StkId p;
+ for (p = ci->base; p < ci->top; p++)
+ if (o == p) return 1;
+ return 0;
+}
+
+
+void luaG_typeerror (lua_State *L, const TObject *o, const char *op) {
+ const char *name = NULL;
+ const char *t = luaT_typenames[ttype(o)];
+ const char *kind = (isinstack(L->ci, o)) ?
+ getobjname(L->ci, o - L->base, &name) : NULL;
+ if (kind)
+ luaG_runerror(L, "attempt to %s %s `%s' (a %s value)",
+ op, kind, name, t);
+ else
+ luaG_runerror(L, "attempt to %s a %s value", op, t);
+}
+
+
+void luaG_concaterror (lua_State *L, StkId p1, StkId p2) {
+ if (ttisstring(p1)) p1 = p2;
+ lua_assert(!ttisstring(p1));
+ luaG_typeerror(L, p1, "concatenate");
+}
+
+
+void luaG_aritherror (lua_State *L, const TObject *p1, const TObject *p2) {
+ TObject temp;
+ if (luaV_tonumber(p1, &temp) == NULL)
+ p2 = p1; /* first operand is wrong */
+ luaG_typeerror(L, p2, "perform arithmetic on");
+}
+
+
+int luaG_ordererror (lua_State *L, const TObject *p1, const TObject *p2) {
+ const char *t1 = luaT_typenames[ttype(p1)];
+ const char *t2 = luaT_typenames[ttype(p2)];
+ if (t1[2] == t2[2])
+ luaG_runerror(L, "attempt to compare two %s values", t1);
+ else
+ luaG_runerror(L, "attempt to compare %s with %s", t1, t2);
+ return 0;
+}
+
+
+static void addinfo (lua_State *L, const char *msg) {
+ CallInfo *ci = L->ci;
+ if (isLua(ci)) { /* is Lua code? */
+ char buff[LUA_IDSIZE]; /* add file:line information */
+ int line = currentline(ci);
+ luaO_chunkid(buff, getstr(getluaproto(ci)->source), LUA_IDSIZE);
+ luaO_pushfstring(L, "%s:%d: %s", buff, line, msg);
+ }
+}
+
+
+void luaG_errormsg (lua_State *L) {
+ if (L->errfunc != 0) { /* is there an error handling function? */
+ StkId errfunc = restorestack(L, L->errfunc);
+ if (!ttisfunction(errfunc)) luaD_throw(L, LUA_ERRERR);
+ setobjs2s(L->top, L->top - 1); /* move argument */
+ setobjs2s(L->top - 1, errfunc); /* push function */
+ incr_top(L);
+ luaD_call(L, L->top - 2, 1); /* call it */
+ }
+ luaD_throw(L, LUA_ERRRUN);
+}
+
+
+void luaG_runerror (lua_State *L, const char *fmt, ...) {
+ va_list argp;
+ va_start(argp, fmt);
+ addinfo(L, luaO_pushvfstring(L, fmt, argp));
+ va_end(argp);
+ luaG_errormsg(L);
+}
+
--- /dev/null
+/*
+** $Id: ldebug.h,v 1.32 2002/11/18 11:01:55 roberto Exp $
+** Auxiliary functions from Debug Interface module
+** See Copyright Notice in lua.h
+*/
+
+#ifndef ldebug_h
+#define ldebug_h
+
+
+#include "lstate.h"
+
+
+#define pcRel(pc, p) (cast(int, (pc) - (p)->code) - 1)
+
+#define getline(f,pc) (((f)->lineinfo) ? (f)->lineinfo[pc] : 0)
+
+#define resethookcount(L) (L->hookcount = L->basehookcount)
+
+
+void luaG_inithooks (lua_State *L);
+void luaG_typeerror (lua_State *L, const TObject *o, const char *opname);
+void luaG_concaterror (lua_State *L, StkId p1, StkId p2);
+void luaG_aritherror (lua_State *L, const TObject *p1, const TObject *p2);
+int luaG_ordererror (lua_State *L, const TObject *p1, const TObject *p2);
+void luaG_runerror (lua_State *L, const char *fmt, ...);
+void luaG_errormsg (lua_State *L);
+int luaG_checkcode (const Proto *pt);
+
+
+#endif
--- /dev/null
+/*
+** $Id: ldo.c,v 1.217a 2003/04/03 13:35:34 roberto Exp $
+** Stack and Call structure of Lua
+** See Copyright Notice in lua.h
+*/
+
+
+#include <setjmp.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define ldo_c
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lgc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lparser.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+#include "lundump.h"
+#include "lvm.h"
+#include "lzio.h"
+
+
+
+
+/*
+** {======================================================
+** Error-recovery functions (based on long jumps)
+** =======================================================
+*/
+
+
+/* chain list of long jump buffers */
+struct lua_longjmp {
+ struct lua_longjmp *previous;
+ jmp_buf b;
+ volatile int status; /* error code */
+};
+
+
+static void seterrorobj (lua_State *L, int errcode, StkId oldtop) {
+ switch (errcode) {
+ case LUA_ERRMEM: {
+ setsvalue2s(oldtop, luaS_new(L, MEMERRMSG));
+ break;
+ }
+ case LUA_ERRERR: {
+ setsvalue2s(oldtop, luaS_new(L, "error in error handling"));
+ break;
+ }
+ case LUA_ERRSYNTAX:
+ case LUA_ERRRUN: {
+ setobjs2s(oldtop, L->top - 1); /* error message on current top */
+ break;
+ }
+ }
+ L->top = oldtop + 1;
+}
+
+
+void luaD_throw (lua_State *L, int errcode) {
+ if (L->errorJmp) {
+ L->errorJmp->status = errcode;
+ longjmp(L->errorJmp->b, 1);
+ }
+ else {
+ G(L)->panic(L);
+ exit(EXIT_FAILURE);
+ }
+}
+
+
+int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) {
+ struct lua_longjmp lj;
+ lj.status = 0;
+ lj.previous = L->errorJmp; /* chain new error handler */
+ L->errorJmp = &lj;
+ if (setjmp(lj.b) == 0)
+ (*f)(L, ud);
+ L->errorJmp = lj.previous; /* restore old error handler */
+ return lj.status;
+}
+
+
+static void restore_stack_limit (lua_State *L) {
+ L->stack_last = L->stack+L->stacksize-1;
+ if (L->size_ci > LUA_MAXCALLS) { /* there was an overflow? */
+ int inuse = (L->ci - L->base_ci);
+ if (inuse + 1 < LUA_MAXCALLS) /* can `undo' overflow? */
+ luaD_reallocCI(L, LUA_MAXCALLS);
+ }
+}
+
+/* }====================================================== */
+
+
+static void correctstack (lua_State *L, TObject *oldstack) {
+ CallInfo *ci;
+ GCObject *up;
+ L->top = (L->top - oldstack) + L->stack;
+ for (up = L->openupval; up != NULL; up = up->gch.next)
+ gcotouv(up)->v = (gcotouv(up)->v - oldstack) + L->stack;
+ for (ci = L->base_ci; ci <= L->ci; ci++) {
+ ci->top = (ci->top - oldstack) + L->stack;
+ ci->base = (ci->base - oldstack) + L->stack;
+ }
+ L->base = L->ci->base;
+}
+
+
+void luaD_reallocstack (lua_State *L, int newsize) {
+ TObject *oldstack = L->stack;
+ luaM_reallocvector(L, L->stack, L->stacksize, newsize, TObject);
+ L->stacksize = newsize;
+ L->stack_last = L->stack+newsize-1-EXTRA_STACK;
+ correctstack(L, oldstack);
+}
+
+
+void luaD_reallocCI (lua_State *L, int newsize) {
+ CallInfo *oldci = L->base_ci;
+ luaM_reallocvector(L, L->base_ci, L->size_ci, newsize, CallInfo);
+ L->size_ci = cast(unsigned short, newsize);
+ L->ci = (L->ci - oldci) + L->base_ci;
+ L->end_ci = L->base_ci + L->size_ci;
+}
+
+
+void luaD_growstack (lua_State *L, int n) {
+ if (n <= L->stacksize) /* double size is enough? */
+ luaD_reallocstack(L, 2*L->stacksize);
+ else
+ luaD_reallocstack(L, L->stacksize + n + EXTRA_STACK);
+}
+
+
+static void luaD_growCI (lua_State *L) {
+ if (L->size_ci > LUA_MAXCALLS) /* overflow while handling overflow? */
+ luaD_throw(L, LUA_ERRERR);
+ else {
+ luaD_reallocCI(L, 2*L->size_ci);
+ if (L->size_ci > LUA_MAXCALLS)
+ luaG_runerror(L, "stack overflow");
+ }
+}
+
+
+void luaD_callhook (lua_State *L, int event, int line) {
+ lua_Hook hook = L->hook;
+ if (hook && L->allowhook) {
+ ptrdiff_t top = savestack(L, L->top);
+ ptrdiff_t ci_top = savestack(L, L->ci->top);
+ lua_Debug ar;
+ ar.event = event;
+ ar.currentline = line;
+ if (event == LUA_HOOKTAILRET)
+ ar.i_ci = 0; /* tail call; no debug information about it */
+ else
+ ar.i_ci = L->ci - L->base_ci;
+ luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */
+ L->ci->top = L->top + LUA_MINSTACK;
+ L->allowhook = 0; /* cannot call hooks inside a hook */
+ lua_unlock(L);
+ (*hook)(L, &ar);
+ lua_lock(L);
+ lua_assert(!L->allowhook);
+ L->allowhook = 1;
+ L->ci->top = restorestack(L, ci_top);
+ L->top = restorestack(L, top);
+ }
+}
+
+
+static void adjust_varargs (lua_State *L, int nfixargs, StkId base) {
+ int i;
+ Table *htab;
+ TObject nname;
+ int actual = L->top - base; /* actual number of arguments */
+ if (actual < nfixargs) {
+ luaD_checkstack(L, nfixargs - actual);
+ for (; actual < nfixargs; ++actual)
+ setnilvalue(L->top++);
+ }
+ actual -= nfixargs; /* number of extra arguments */
+ htab = luaH_new(L, actual, 1); /* create `arg' table */
+ for (i=0; i<actual; i++) /* put extra arguments into `arg' table */
+ setobj2n(luaH_setnum(L, htab, i+1), L->top - actual + i);
+ /* store counter in field `n' */
+ setsvalue(&nname, luaS_newliteral(L, "n"));
+ setnvalue(luaH_set(L, htab, &nname), cast(lua_Number, actual));
+ L->top -= actual; /* remove extra elements from the stack */
+ sethvalue(L->top, htab);
+ incr_top(L);
+}
+
+
+static StkId tryfuncTM (lua_State *L, StkId func) {
+ const TObject *tm = luaT_gettmbyobj(L, func, TM_CALL);
+ StkId p;
+ ptrdiff_t funcr = savestack(L, func);
+ if (!ttisfunction(tm))
+ luaG_typeerror(L, func, "call");
+ /* Open a hole inside the stack at `func' */
+ for (p = L->top; p > func; p--) setobjs2s(p, p-1);
+ incr_top(L);
+ func = restorestack(L, funcr); /* previous call may change stack */
+ setobj2s(func, tm); /* tag method is the new function to be called */
+ return func;
+}
+
+
+StkId luaD_precall (lua_State *L, StkId func) {
+ LClosure *cl;
+ ptrdiff_t funcr = savestack(L, func);
+ if (!ttisfunction(func)) /* `func' is not a function? */
+ func = tryfuncTM(L, func); /* check the `function' tag method */
+ if (L->ci + 1 == L->end_ci) luaD_growCI(L);
+ else condhardstacktests(luaD_reallocCI(L, L->size_ci));
+ cl = &clvalue(func)->l;
+ if (!cl->isC) { /* Lua function? prepare its call */
+ CallInfo *ci;
+ Proto *p = cl->p;
+ if (p->is_vararg) /* varargs? */
+ adjust_varargs(L, p->numparams, func+1);
+ luaD_checkstack(L, p->maxstacksize);
+ ci = ++L->ci; /* now `enter' new function */
+ L->base = L->ci->base = restorestack(L, funcr) + 1;
+ ci->top = L->base + p->maxstacksize;
+ ci->u.l.savedpc = p->code; /* starting point */
+ ci->u.l.tailcalls = 0;
+ ci->state = CI_SAVEDPC;
+ while (L->top < ci->top)
+ setnilvalue(L->top++);
+ L->top = ci->top;
+ return NULL;
+ }
+ else { /* if is a C function, call it */
+ CallInfo *ci;
+ int n;
+ luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */
+ ci = ++L->ci; /* now `enter' new function */
+ L->base = L->ci->base = restorestack(L, funcr) + 1;
+ ci->top = L->top + LUA_MINSTACK;
+ ci->state = CI_C; /* a C function */
+ if (L->hookmask & LUA_MASKCALL)
+ luaD_callhook(L, LUA_HOOKCALL, -1);
+ lua_unlock(L);
+#ifdef LUA_COMPATUPVALUES
+ lua_pushupvalues(L);
+#endif
+ n = (*clvalue(L->base - 1)->c.f)(L); /* do the actual call */
+ lua_lock(L);
+ return L->top - n;
+ }
+}
+
+
+static StkId callrethooks (lua_State *L, StkId firstResult) {
+ ptrdiff_t fr = savestack(L, firstResult); /* next call may change stack */
+ luaD_callhook(L, LUA_HOOKRET, -1);
+ if (!(L->ci->state & CI_C)) { /* Lua function? */
+ while (L->ci->u.l.tailcalls--) /* call hook for eventual tail calls */
+ luaD_callhook(L, LUA_HOOKTAILRET, -1);
+ }
+ return restorestack(L, fr);
+}
+
+
+void luaD_poscall (lua_State *L, int wanted, StkId firstResult) {
+ StkId res;
+ if (L->hookmask & LUA_MASKRET)
+ firstResult = callrethooks(L, firstResult);
+ res = L->base - 1; /* res == final position of 1st result */
+ L->ci--;
+ L->base = L->ci->base; /* restore base */
+ /* move results to correct place */
+ while (wanted != 0 && firstResult < L->top) {
+ setobjs2s(res++, firstResult++);
+ wanted--;
+ }
+ while (wanted-- > 0)
+ setnilvalue(res++);
+ L->top = res;
+}
+
+
+/*
+** 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) {
+ StkId firstResult;
+ lua_assert(!(L->ci->state & CI_CALLING));
+ if (++L->nCcalls >= LUA_MAXCCALLS) {
+ if (L->nCcalls == LUA_MAXCCALLS)
+ luaG_runerror(L, "C stack overflow");
+ else if (L->nCcalls >= (LUA_MAXCCALLS + (LUA_MAXCCALLS>>3)))
+ luaD_throw(L, LUA_ERRERR); /* error while handing stack error */
+ }
+ firstResult = luaD_precall(L, func);
+ if (firstResult == NULL) /* is a Lua function? */
+ firstResult = luaV_execute(L); /* call it */
+ luaD_poscall(L, nResults, firstResult);
+ L->nCcalls--;
+ luaC_checkGC(L);
+}
+
+
+static void resume (lua_State *L, void *ud) {
+ StkId firstResult;
+ int nargs = *cast(int *, ud);
+ CallInfo *ci = L->ci;
+ if (ci == L->base_ci) { /* no activation record? */
+ lua_assert(nargs < L->top - L->base);
+ luaD_precall(L, L->top - (nargs + 1)); /* start coroutine */
+ }
+ else { /* inside a yield */
+ lua_assert(ci->state & CI_YIELD);
+ if (ci->state & CI_C) { /* `common' yield? */
+ /* finish interrupted execution of `OP_CALL' */
+ int nresults;
+ lua_assert((ci-1)->state & CI_SAVEDPC);
+ lua_assert(GET_OPCODE(*((ci-1)->u.l.savedpc - 1)) == OP_CALL ||
+ GET_OPCODE(*((ci-1)->u.l.savedpc - 1)) == OP_TAILCALL);
+ nresults = GETARG_C(*((ci-1)->u.l.savedpc - 1)) - 1;
+ luaD_poscall(L, nresults, L->top - nargs); /* complete it */
+ if (nresults >= 0) L->top = L->ci->top;
+ }
+ else { /* yielded inside a hook: just continue its execution */
+ ci->state &= ~CI_YIELD;
+ }
+ }
+ firstResult = luaV_execute(L);
+ if (firstResult != NULL) /* return? */
+ luaD_poscall(L, LUA_MULTRET, firstResult); /* finalize this coroutine */
+}
+
+
+static int resume_error (lua_State *L, const char *msg) {
+ L->top = L->ci->base;
+ setsvalue2s(L->top, luaS_new(L, msg));
+ incr_top(L);
+ lua_unlock(L);
+ return LUA_ERRRUN;
+}
+
+
+LUA_API int lua_resume (lua_State *L, int nargs) {
+ int status;
+ lu_byte old_allowhooks;
+ lua_lock(L);
+ if (L->ci == L->base_ci) {
+ if (nargs >= L->top - L->base)
+ return resume_error(L, "cannot resume dead coroutine");
+ }
+ else if (!(L->ci->state & CI_YIELD)) /* not inside a yield? */
+ return resume_error(L, "cannot resume non-suspended coroutine");
+ old_allowhooks = L->allowhook;
+ lua_assert(L->errfunc == 0 && L->nCcalls == 0);
+ status = luaD_rawrunprotected(L, resume, &nargs);
+ if (status != 0) { /* error? */
+ L->ci = L->base_ci; /* go back to initial level */
+ L->base = L->ci->base;
+ L->nCcalls = 0;
+ luaF_close(L, L->base); /* close eventual pending closures */
+ seterrorobj(L, status, L->base);
+ L->allowhook = old_allowhooks;
+ restore_stack_limit(L);
+ }
+ lua_unlock(L);
+ return status;
+}
+
+
+LUA_API int lua_yield (lua_State *L, int nresults) {
+ CallInfo *ci;
+ lua_lock(L);
+ ci = L->ci;
+ if (L->nCcalls > 0)
+ luaG_runerror(L, "attempt to yield across metamethod/C-call boundary");
+ if (ci->state & CI_C) { /* usual yield */
+ if ((ci-1)->state & CI_C)
+ luaG_runerror(L, "cannot yield a C function");
+ if (L->top - nresults > L->base) { /* is there garbage in the stack? */
+ int i;
+ for (i=0; i<nresults; i++) /* move down results */
+ setobjs2s(L->base + i, L->top - nresults + i);
+ L->top = L->base + nresults;
+ }
+ } /* else it's an yield inside a hook: nothing to do */
+ ci->state |= CI_YIELD;
+ lua_unlock(L);
+ return -1;
+}
+
+
+int luaD_pcall (lua_State *L, Pfunc func, void *u,
+ ptrdiff_t old_top, ptrdiff_t ef) {
+ int status;
+ unsigned short oldnCcalls = L->nCcalls;
+ ptrdiff_t old_ci = saveci(L, L->ci);
+ lu_byte old_allowhooks = L->allowhook;
+ ptrdiff_t old_errfunc = L->errfunc;
+ L->errfunc = ef;
+ status = luaD_rawrunprotected(L, func, u);
+ if (status != 0) { /* an error occurred? */
+ StkId oldtop = restorestack(L, old_top);
+ luaF_close(L, oldtop); /* close eventual pending closures */
+ seterrorobj(L, status, oldtop);
+ L->nCcalls = oldnCcalls;
+ L->ci = restoreci(L, old_ci);
+ L->base = L->ci->base;
+ L->allowhook = old_allowhooks;
+ restore_stack_limit(L);
+ }
+ L->errfunc = old_errfunc;
+ return status;
+}
+
+
+
+/*
+** Execute a protected parser.
+*/
+struct SParser { /* data to `f_parser' */
+ ZIO *z;
+ Mbuffer buff; /* buffer to be used by the scanner */
+ int bin;
+};
+
+static void f_parser (lua_State *L, void *ud) {
+ struct SParser *p;
+ Proto *tf;
+ Closure *cl;
+ luaC_checkGC(L);
+ p = cast(struct SParser *, ud);
+ tf = p->bin ? luaU_undump(L, p->z, &p->buff) : luaY_parser(L, p->z, &p->buff);
+ cl = luaF_newLclosure(L, 0, gt(L));
+ cl->l.p = tf;
+ setclvalue(L->top, cl);
+ incr_top(L);
+}
+
+
+int luaD_protectedparser (lua_State *L, ZIO *z, int bin) {
+ struct SParser p;
+ int status;
+ ptrdiff_t oldtopr = savestack(L, L->top); /* save current top */
+ p.z = z; p.bin = bin;
+ luaZ_initbuffer(L, &p.buff);
+ status = luaD_rawrunprotected(L, f_parser, &p);
+ luaZ_freebuffer(L, &p.buff);
+ if (status != 0) { /* error? */
+ StkId oldtop = restorestack(L, oldtopr);
+ seterrorobj(L, status, oldtop);
+ }
+ return status;
+}
+
+
--- /dev/null
+/*
+** $Id: ldo.h,v 1.56 2002/12/04 17:29:32 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 control inclusion of some hard tests on stack reallocation
+*/
+#ifndef HARDSTACKTESTS
+#define condhardstacktests(x) { /* empty */ }
+#else
+#define condhardstacktests(x) x
+#endif
+
+
+#define luaD_checkstack(L,n) \
+ if ((char *)L->stack_last - (char *)L->top <= (n)*(int)sizeof(TObject)) \
+ luaD_growstack(L, n); \
+ else condhardstacktests(luaD_reallocstack(L, L->stacksize));
+
+
+#define incr_top(L) {luaD_checkstack(L,1); L->top++;}
+
+#define savestack(L,p) ((char *)(p) - (char *)L->stack)
+#define restorestack(L,n) ((TObject *)((char *)L->stack + (n)))
+
+#define saveci(L,p) ((char *)(p) - (char *)L->base_ci)
+#define restoreci(L,n) ((CallInfo *)((char *)L->base_ci + (n)))
+
+
+/* type of protected functions, to be ran by `runprotected' */
+typedef void (*Pfunc) (lua_State *L, void *ud);
+
+void luaD_resetprotection (lua_State *L);
+int luaD_protectedparser (lua_State *L, ZIO *z, int bin);
+void luaD_callhook (lua_State *L, int event, int line);
+StkId luaD_precall (lua_State *L, StkId func);
+void luaD_call (lua_State *L, StkId func, int nResults);
+int luaD_pcall (lua_State *L, Pfunc func, void *u,
+ ptrdiff_t oldtop, ptrdiff_t ef);
+void luaD_poscall (lua_State *L, int wanted, StkId firstResult);
+void luaD_reallocCI (lua_State *L, int newsize);
+void luaD_reallocstack (lua_State *L, int newsize);
+void luaD_growstack (lua_State *L, int n);
+
+void luaD_throw (lua_State *L, int errcode);
+int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud);
+
+
+#endif
--- /dev/null
+/*
+** $Id: ldump.c,v 1.4 2003/02/11 23:52:12 lhf Exp $
+** save bytecodes
+** See Copyright Notice in lua.h
+*/
+
+#include <stddef.h>
+
+#define ldump_c
+
+#include "lua.h"
+
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lstate.h"
+#include "lundump.h"
+
+#define DumpVector(b,n,size,D) DumpBlock(b,(n)*(size),D)
+#define DumpLiteral(s,D) DumpBlock("" s,(sizeof(s))-1,D)
+
+typedef struct {
+ lua_State* L;
+ lua_Chunkwriter write;
+ void* data;
+} DumpState;
+
+static void DumpBlock(const void* b, size_t size, DumpState* D)
+{
+ lua_unlock(D->L);
+ (*D->write)(D->L,b,size,D->data);
+ lua_lock(D->L);
+}
+
+static void DumpByte(int y, DumpState* D)
+{
+ char x=(char)y;
+ DumpBlock(&x,sizeof(x),D);
+}
+
+static void DumpInt(int x, DumpState* D)
+{
+ DumpBlock(&x,sizeof(x),D);
+}
+
+static void DumpSize(size_t x, DumpState* D)
+{
+ DumpBlock(&x,sizeof(x),D);
+}
+
+static void DumpNumber(lua_Number x, DumpState* D)
+{
+ DumpBlock(&x,sizeof(x),D);
+}
+
+static void DumpString(TString* s, DumpState* D)
+{
+ if (s==NULL || getstr(s)==NULL)
+ DumpSize(0,D);
+ else
+ {
+ size_t size=s->tsv.len+1; /* include trailing '\0' */
+ DumpSize(size,D);
+ DumpBlock(getstr(s),size,D);
+ }
+}
+
+static void DumpCode(const Proto* f, DumpState* D)
+{
+ DumpInt(f->sizecode,D);
+ DumpVector(f->code,f->sizecode,sizeof(*f->code),D);
+}
+
+static void DumpLocals(const Proto* f, DumpState* D)
+{
+ int i,n=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);
+ }
+}
+
+static void DumpLines(const Proto* f, DumpState* D)
+{
+ DumpInt(f->sizelineinfo,D);
+ DumpVector(f->lineinfo,f->sizelineinfo,sizeof(*f->lineinfo),D);
+}
+
+static void DumpUpvalues(const Proto* f, DumpState* D)
+{
+ int i,n=f->sizeupvalues;
+ DumpInt(n,D);
+ for (i=0; i<n; i++) DumpString(f->upvalues[i],D);
+}
+
+static void DumpFunction(const Proto* f, const TString* p, DumpState* D);
+
+static void DumpConstants(const Proto* f, DumpState* D)
+{
+ int i,n;
+ DumpInt(n=f->sizek,D);
+ for (i=0; i<n; i++)
+ {
+ const TObject* o=&f->k[i];
+ DumpByte(ttype(o),D);
+ switch (ttype(o))
+ {
+ case LUA_TNUMBER:
+ DumpNumber(nvalue(o),D);
+ break;
+ case LUA_TSTRING:
+ DumpString(tsvalue(o),D);
+ break;
+ case LUA_TNIL:
+ break;
+ default:
+ lua_assert(0); /* cannot happen */
+ break;
+ }
+ }
+ DumpInt(n=f->sizep,D);
+ for (i=0; i<n; i++) DumpFunction(f->p[i],f->source,D);
+}
+
+static void DumpFunction(const Proto* f, const TString* p, DumpState* D)
+{
+ DumpString((f->source==p) ? NULL : f->source,D);
+ DumpInt(f->lineDefined,D);
+ DumpByte(f->nups,D);
+ DumpByte(f->numparams,D);
+ DumpByte(f->is_vararg,D);
+ DumpByte(f->maxstacksize,D);
+ DumpLines(f,D);
+ DumpLocals(f,D);
+ DumpUpvalues(f,D);
+ DumpConstants(f,D);
+ DumpCode(f,D);
+}
+
+static void DumpHeader(DumpState* D)
+{
+ DumpLiteral(LUA_SIGNATURE,D);
+ DumpByte(VERSION,D);
+ DumpByte(luaU_endianness(),D);
+ DumpByte(sizeof(int),D);
+ DumpByte(sizeof(size_t),D);
+ DumpByte(sizeof(Instruction),D);
+ DumpByte(SIZE_OP,D);
+ DumpByte(SIZE_A,D);
+ DumpByte(SIZE_B,D);
+ DumpByte(SIZE_C,D);
+ DumpByte(sizeof(lua_Number),D);
+ DumpNumber(TEST_NUMBER,D);
+}
+
+/*
+** dump function as precompiled chunk
+*/
+void luaU_dump (lua_State* L, const Proto* Main, lua_Chunkwriter w, void* data)
+{
+ DumpState D;
+ D.L=L;
+ D.write=w;
+ D.data=data;
+ DumpHeader(&D);
+ DumpFunction(Main,NULL,&D);
+}
+
--- /dev/null
+/*
+** $Id: lfunc.c,v 1.67 2003/03/18 12:50:04 roberto Exp $
+** Auxiliary functions to manipulate prototypes and closures
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdlib.h>
+
+#define lfunc_c
+
+#include "lua.h"
+
+#include "lfunc.h"
+#include "lgc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+
+
+#define sizeCclosure(n) (cast(int, sizeof(CClosure)) + \
+ cast(int, sizeof(TObject)*((n)-1)))
+
+#define sizeLclosure(n) (cast(int, sizeof(LClosure)) + \
+ cast(int, sizeof(TObject *)*((n)-1)))
+
+
+
+Closure *luaF_newCclosure (lua_State *L, int nelems) {
+ Closure *c = cast(Closure *, luaM_malloc(L, sizeCclosure(nelems)));
+ luaC_link(L, valtogco(c), LUA_TFUNCTION);
+ c->c.isC = 1;
+ c->c.nupvalues = cast(lu_byte, nelems);
+ return c;
+}
+
+
+Closure *luaF_newLclosure (lua_State *L, int nelems, TObject *e) {
+ Closure *c = cast(Closure *, luaM_malloc(L, sizeLclosure(nelems)));
+ luaC_link(L, valtogco(c), LUA_TFUNCTION);
+ c->l.isC = 0;
+ c->l.g = *e;
+ c->l.nupvalues = cast(lu_byte, nelems);
+ return c;
+}
+
+
+UpVal *luaF_findupval (lua_State *L, StkId level) {
+ GCObject **pp = &L->openupval;
+ UpVal *p;
+ UpVal *v;
+ while ((p = ngcotouv(*pp)) != NULL && p->v >= level) {
+ if (p->v == level) return p;
+ pp = &p->next;
+ }
+ v = luaM_new(L, UpVal); /* not found: create a new one */
+ v->tt = LUA_TUPVAL;
+ v->marked = 1; /* open upvalues should not be collected */
+ v->v = level; /* current value lives in the stack */
+ v->next = *pp; /* chain it in the proper position */
+ *pp = valtogco(v);
+ return v;
+}
+
+
+void luaF_close (lua_State *L, StkId level) {
+ UpVal *p;
+ while ((p = ngcotouv(L->openupval)) != NULL && p->v >= level) {
+ setobj(&p->value, p->v); /* save current value (write barrier) */
+ p->v = &p->value; /* now current value lives here */
+ L->openupval = p->next; /* remove from `open' list */
+ luaC_link(L, valtogco(p), LUA_TUPVAL);
+ }
+}
+
+
+Proto *luaF_newproto (lua_State *L) {
+ Proto *f = luaM_new(L, Proto);
+ luaC_link(L, valtogco(f), LUA_TPROTO);
+ f->k = NULL;
+ f->sizek = 0;
+ f->p = NULL;
+ f->sizep = 0;
+ f->code = NULL;
+ f->sizecode = 0;
+ f->sizelineinfo = 0;
+ f->sizeupvalues = 0;
+ f->nups = 0;
+ f->upvalues = NULL;
+ f->numparams = 0;
+ f->is_vararg = 0;
+ f->maxstacksize = 0;
+ f->lineinfo = NULL;
+ f->sizelocvars = 0;
+ f->locvars = NULL;
+ f->lineDefined = 0;
+ f->source = NULL;
+ return f;
+}
+
+
+void luaF_freeproto (lua_State *L, Proto *f) {
+ luaM_freearray(L, f->code, f->sizecode, Instruction);
+ luaM_freearray(L, f->p, f->sizep, Proto *);
+ luaM_freearray(L, f->k, f->sizek, TObject);
+ luaM_freearray(L, f->lineinfo, f->sizelineinfo, int);
+ luaM_freearray(L, f->locvars, f->sizelocvars, struct LocVar);
+ luaM_freearray(L, f->upvalues, f->sizeupvalues, TString *);
+ luaM_freelem(L, f);
+}
+
+
+void luaF_freeclosure (lua_State *L, Closure *c) {
+ int size = (c->c.isC) ? sizeCclosure(c->c.nupvalues) :
+ sizeLclosure(c->l.nupvalues);
+ luaM_free(L, c, size);
+}
+
+
+/*
+** 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 */
+}
+
--- /dev/null
+/*
+** $Id: lfunc.h,v 1.21 2003/03/18 12:50:04 roberto Exp $
+** Auxiliary functions to manipulate prototypes and closures
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lfunc_h
+#define lfunc_h
+
+
+#include "lobject.h"
+
+
+Proto *luaF_newproto (lua_State *L);
+Closure *luaF_newCclosure (lua_State *L, int nelems);
+Closure *luaF_newLclosure (lua_State *L, int nelems, TObject *e);
+UpVal *luaF_findupval (lua_State *L, StkId level);
+void luaF_close (lua_State *L, StkId level);
+void luaF_freeproto (lua_State *L, Proto *f);
+void luaF_freeclosure (lua_State *L, Closure *c);
+
+const char *luaF_getlocalname (const Proto *func, int local_number, int pc);
+
+
+#endif
--- /dev/null
+/*
+** $Id: lgc.c,v 1.171a 2003/04/03 13:35:34 roberto Exp $
+** Garbage Collector
+** See Copyright Notice in lua.h
+*/
+
+#include <string.h>
+
+#define lgc_c
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lgc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+
+
+typedef struct GCState {
+ GCObject *tmark; /* list of marked objects to be traversed */
+ GCObject *wk; /* list of traversed key-weak tables (to be cleared) */
+ GCObject *wv; /* list of traversed value-weak tables */
+ GCObject *wkv; /* list of traversed key-value weak tables */
+ global_State *g;
+} GCState;
+
+
+/*
+** some userful bit tricks
+*/
+#define setbit(x,b) ((x) |= (1<<(b)))
+#define resetbit(x,b) ((x) &= cast(lu_byte, ~(1<<(b))))
+#define testbit(x,b) ((x) & (1<<(b)))
+
+#define unmark(x) resetbit((x)->gch.marked, 0)
+#define ismarked(x) ((x)->gch.marked & ((1<<4)|1))
+
+#define stringmark(s) setbit((s)->tsv.marked, 0)
+
+
+#define isfinalized(u) (!testbit((u)->uv.marked, 1))
+#define markfinalized(u) resetbit((u)->uv.marked, 1)
+
+
+#define KEYWEAKBIT 1
+#define VALUEWEAKBIT 2
+#define KEYWEAK (1<<KEYWEAKBIT)
+#define VALUEWEAK (1<<VALUEWEAKBIT)
+
+
+
+#define markobject(st,o) { checkconsistency(o); \
+ if (iscollectable(o) && !ismarked(gcvalue(o))) reallymarkobject(st,gcvalue(o)); }
+
+#define condmarkobject(st,o,c) { checkconsistency(o); \
+ if (iscollectable(o) && !ismarked(gcvalue(o)) && (c)) \
+ reallymarkobject(st,gcvalue(o)); }
+
+#define markvalue(st,t) { if (!ismarked(valtogco(t))) \
+ reallymarkobject(st, valtogco(t)); }
+
+
+
+static void reallymarkobject (GCState *st, GCObject *o) {
+ lua_assert(!ismarked(o));
+ setbit(o->gch.marked, 0); /* mark object */
+ switch (o->gch.tt) {
+ case LUA_TUSERDATA: {
+ markvalue(st, gcotou(o)->uv.metatable);
+ break;
+ }
+ case LUA_TFUNCTION: {
+ gcotocl(o)->c.gclist = st->tmark;
+ st->tmark = o;
+ break;
+ }
+ case LUA_TTABLE: {
+ gcotoh(o)->gclist = st->tmark;
+ st->tmark = o;
+ break;
+ }
+ case LUA_TTHREAD: {
+ gcototh(o)->gclist = st->tmark;
+ st->tmark = o;
+ break;
+ }
+ case LUA_TPROTO: {
+ gcotop(o)->gclist = st->tmark;
+ st->tmark = o;
+ break;
+ }
+ default: lua_assert(o->gch.tt == LUA_TSTRING);
+ }
+}
+
+
+static void marktmu (GCState *st) {
+ GCObject *u;
+ for (u = st->g->tmudata; u; u = u->gch.next) {
+ unmark(u); /* may be marked, if left from previous GC */
+ reallymarkobject(st, u);
+ }
+}
+
+
+/* move `dead' udata that need finalization to list `tmudata' */
+size_t luaC_separateudata (lua_State *L) {
+ size_t deadmem = 0;
+ GCObject **p = &G(L)->rootudata;
+ GCObject *curr;
+ GCObject *collected = NULL; /* to collect udata with gc event */
+ GCObject **lastcollected = &collected;
+ while ((curr = *p) != NULL) {
+ lua_assert(curr->gch.tt == LUA_TUSERDATA);
+ if (ismarked(curr) || isfinalized(gcotou(curr)))
+ p = &curr->gch.next; /* don't bother with them */
+
+ else if (fasttm(L, gcotou(curr)->uv.metatable, TM_GC) == NULL) {
+ markfinalized(gcotou(curr)); /* don't need finalization */
+ p = &curr->gch.next;
+ }
+ else { /* must call its gc method */
+ deadmem += sizeudata(gcotou(curr)->uv.len);
+ *p = curr->gch.next;
+ curr->gch.next = NULL; /* link `curr' at the end of `collected' list */
+ *lastcollected = curr;
+ lastcollected = &curr->gch.next;
+ }
+ }
+ /* insert collected udata with gc event into `tmudata' list */
+ *lastcollected = G(L)->tmudata;
+ G(L)->tmudata = collected;
+ return deadmem;
+}
+
+
+static void removekey (Node *n) {
+ setnilvalue(gval(n)); /* remove corresponding value ... */
+ if (iscollectable(gkey(n)))
+ setttype(gkey(n), LUA_TNONE); /* dead key; remove it */
+}
+
+
+static void traversetable (GCState *st, Table *h) {
+ int i;
+ int weakkey = 0;
+ int weakvalue = 0;
+ const TObject *mode;
+ markvalue(st, h->metatable);
+ lua_assert(h->lsizenode || h->node == st->g->dummynode);
+ mode = gfasttm(st->g, h->metatable, TM_MODE);
+ if (mode && ttisstring(mode)) { /* is there a weak mode? */
+ weakkey = (strchr(svalue(mode), 'k') != NULL);
+ weakvalue = (strchr(svalue(mode), 'v') != NULL);
+ if (weakkey || weakvalue) { /* is really weak? */
+ GCObject **weaklist;
+ h->marked &= ~(KEYWEAK | VALUEWEAK); /* clear bits */
+ h->marked |= cast(lu_byte, (weakkey << KEYWEAKBIT) |
+ (weakvalue << VALUEWEAKBIT));
+ weaklist = (weakkey && weakvalue) ? &st->wkv :
+ (weakkey) ? &st->wk :
+ &st->wv;
+ h->gclist = *weaklist; /* must be cleared after GC, ... */
+ *weaklist = valtogco(h); /* ... so put in the appropriate list */
+ }
+ }
+ if (!weakvalue) {
+ i = h->sizearray;
+ while (i--)
+ markobject(st, &h->array[i]);
+ }
+ i = sizenode(h);
+ while (i--) {
+ Node *n = gnode(h, i);
+ if (!ttisnil(gval(n))) {
+ lua_assert(!ttisnil(gkey(n)));
+ condmarkobject(st, gkey(n), !weakkey);
+ condmarkobject(st, gval(n), !weakvalue);
+ }
+ }
+}
+
+
+static void traverseproto (GCState *st, Proto *f) {
+ int i;
+ stringmark(f->source);
+ for (i=0; i<f->sizek; i++) { /* mark literal strings */
+ if (ttisstring(f->k+i))
+ stringmark(tsvalue(f->k+i));
+ }
+ for (i=0; i<f->sizeupvalues; i++) /* mark upvalue names */
+ stringmark(f->upvalues[i]);
+ for (i=0; i<f->sizep; i++) /* mark nested protos */
+ markvalue(st, f->p[i]);
+ for (i=0; i<f->sizelocvars; i++) /* mark local-variable names */
+ stringmark(f->locvars[i].varname);
+ lua_assert(luaG_checkcode(f));
+}
+
+
+
+static void traverseclosure (GCState *st, Closure *cl) {
+ if (cl->c.isC) {
+ int i;
+ for (i=0; i<cl->c.nupvalues; i++) /* mark its upvalues */
+ markobject(st, &cl->c.upvalue[i]);
+ }
+ else {
+ int i;
+ lua_assert(cl->l.nupvalues == cl->l.p->nups);
+ markvalue(st, hvalue(&cl->l.g));
+ markvalue(st, cl->l.p);
+ for (i=0; i<cl->l.nupvalues; i++) { /* mark its upvalues */
+ UpVal *u = cl->l.upvals[i];
+ if (!u->marked) {
+ markobject(st, &u->value);
+ u->marked = 1;
+ }
+ }
+ }
+}
+
+
+static void checkstacksizes (lua_State *L, StkId max) {
+ int used = L->ci - L->base_ci; /* number of `ci' in use */
+ if (4*used < L->size_ci && 2*BASIC_CI_SIZE < L->size_ci)
+ luaD_reallocCI(L, L->size_ci/2); /* still big enough... */
+ else condhardstacktests(luaD_reallocCI(L, L->size_ci));
+ used = max - L->stack; /* part of stack in use */
+ if (4*used < L->stacksize && 2*(BASIC_STACK_SIZE+EXTRA_STACK) < L->stacksize)
+ luaD_reallocstack(L, L->stacksize/2); /* still big enough... */
+ else condhardstacktests(luaD_reallocstack(L, L->stacksize));
+}
+
+
+static void traversestack (GCState *st, lua_State *L1) {
+ StkId o, lim;
+ CallInfo *ci;
+ markobject(st, gt(L1));
+ lim = L1->top;
+ for (ci = L1->base_ci; ci <= L1->ci; ci++) {
+ lua_assert(ci->top <= L1->stack_last);
+ lua_assert(ci->state & (CI_C | CI_HASFRAME | CI_SAVEDPC));
+ if (lim < ci->top)
+ lim = ci->top;
+ }
+ for (o = L1->stack; o < L1->top; o++)
+ markobject(st, o);
+ for (; o <= lim; o++)
+ setnilvalue(o);
+ checkstacksizes(L1, lim);
+}
+
+
+static void propagatemarks (GCState *st) {
+ while (st->tmark) { /* traverse marked objects */
+ switch (st->tmark->gch.tt) {
+ case LUA_TTABLE: {
+ Table *h = gcotoh(st->tmark);
+ st->tmark = h->gclist;
+ traversetable(st, h);
+ break;
+ }
+ case LUA_TFUNCTION: {
+ Closure *cl = gcotocl(st->tmark);
+ st->tmark = cl->c.gclist;
+ traverseclosure(st, cl);
+ break;
+ }
+ case LUA_TTHREAD: {
+ lua_State *th = gcototh(st->tmark);
+ st->tmark = th->gclist;
+ traversestack(st, th);
+ break;
+ }
+ case LUA_TPROTO: {
+ Proto *p = gcotop(st->tmark);
+ st->tmark = p->gclist;
+ traverseproto(st, p);
+ break;
+ }
+ default: lua_assert(0);
+ }
+ }
+}
+
+
+static int valismarked (const TObject *o) {
+ if (ttisstring(o))
+ stringmark(tsvalue(o)); /* strings are `values', so are never weak */
+ return !iscollectable(o) || testbit(o->value.gc->gch.marked, 0);
+}
+
+
+/*
+** clear collected keys from weaktables
+*/
+static void cleartablekeys (GCObject *l) {
+ while (l) {
+ Table *h = gcotoh(l);
+ int i = sizenode(h);
+ lua_assert(h->marked & KEYWEAK);
+ while (i--) {
+ Node *n = gnode(h, i);
+ if (!valismarked(gkey(n))) /* key was collected? */
+ removekey(n); /* remove entry from table */
+ }
+ l = h->gclist;
+ }
+}
+
+
+/*
+** clear collected values from weaktables
+*/
+static void cleartablevalues (GCObject *l) {
+ while (l) {
+ Table *h = gcotoh(l);
+ int i = h->sizearray;
+ lua_assert(h->marked & VALUEWEAK);
+ while (i--) {
+ TObject *o = &h->array[i];
+ if (!valismarked(o)) /* value was collected? */
+ setnilvalue(o); /* remove value */
+ }
+ i = sizenode(h);
+ while (i--) {
+ Node *n = gnode(h, i);
+ if (!valismarked(gval(n))) /* value was collected? */
+ removekey(n); /* remove entry from table */
+ }
+ l = h->gclist;
+ }
+}
+
+
+static void freeobj (lua_State *L, GCObject *o) {
+ switch (o->gch.tt) {
+ case LUA_TPROTO: luaF_freeproto(L, gcotop(o)); break;
+ case LUA_TFUNCTION: luaF_freeclosure(L, gcotocl(o)); break;
+ case LUA_TUPVAL: luaM_freelem(L, gcotouv(o)); break;
+ case LUA_TTABLE: luaH_free(L, gcotoh(o)); break;
+ case LUA_TTHREAD: {
+ lua_assert(gcototh(o) != L && gcototh(o) != G(L)->mainthread);
+ luaE_freethread(L, gcototh(o));
+ break;
+ }
+ case LUA_TSTRING: {
+ luaM_free(L, o, sizestring(gcotots(o)->tsv.len));
+ break;
+ }
+ case LUA_TUSERDATA: {
+ luaM_free(L, o, sizeudata(gcotou(o)->uv.len));
+ break;
+ }
+ default: lua_assert(0);
+ }
+}
+
+
+static int sweeplist (lua_State *L, GCObject **p, int limit) {
+ GCObject *curr;
+ int count = 0; /* number of collected items */
+ while ((curr = *p) != NULL) {
+ if (curr->gch.marked > limit) {
+ unmark(curr);
+ p = &curr->gch.next;
+ }
+ else {
+ count++;
+ *p = curr->gch.next;
+ freeobj(L, curr);
+ }
+ }
+ return count;
+}
+
+
+static void sweepstrings (lua_State *L, int all) {
+ int i;
+ for (i=0; i<G(L)->strt.size; i++) { /* for each list */
+ G(L)->strt.nuse -= sweeplist(L, &G(L)->strt.hash[i], all);
+ }
+}
+
+
+static void checkSizes (lua_State *L, size_t deadmem) {
+ /* check size of string hash */
+ if (G(L)->strt.nuse < cast(ls_nstr, G(L)->strt.size/4) &&
+ G(L)->strt.size > MINSTRTABSIZE*2)
+ luaS_resize(L, G(L)->strt.size/2); /* table is too big */
+ /* check size of buffer */
+ if (luaZ_sizebuffer(&G(L)->buff) > LUA_MINBUFFER*2) { /* buffer too big? */
+ size_t newsize = luaZ_sizebuffer(&G(L)->buff) / 2;
+ luaZ_resizebuffer(L, &G(L)->buff, newsize);
+ }
+ G(L)->GCthreshold = 2*G(L)->nblocks - deadmem; /* new threshold */
+}
+
+
+static void do1gcTM (lua_State *L, Udata *udata) {
+ const TObject *tm = fasttm(L, udata->uv.metatable, TM_GC);
+ if (tm != NULL) {
+ setobj2s(L->top, tm);
+ setuvalue(L->top+1, udata);
+ L->top += 2;
+ luaD_call(L, L->top - 2, 0);
+ }
+}
+
+
+void luaC_callGCTM (lua_State *L) {
+ lu_byte oldah = L->allowhook;
+ L->allowhook = 0; /* stop debug hooks during GC tag methods */
+ L->top++; /* reserve space to keep udata while runs its gc method */
+ while (G(L)->tmudata != NULL) {
+ GCObject *o = G(L)->tmudata;
+ Udata *udata = gcotou(o);
+ G(L)->tmudata = udata->uv.next; /* remove udata from `tmudata' */
+ udata->uv.next = G(L)->rootudata; /* return it to `root' list */
+ G(L)->rootudata = o;
+ setuvalue(L->top - 1, udata); /* keep a reference to it */
+ unmark(o);
+ markfinalized(udata);
+ do1gcTM(L, udata);
+ }
+ L->top--;
+ L->allowhook = oldah; /* restore hooks */
+}
+
+
+void luaC_sweep (lua_State *L, int all) {
+ if (all) all = 256; /* larger than any mark */
+ sweeplist(L, &G(L)->rootudata, all);
+ sweepstrings(L, all);
+ sweeplist(L, &G(L)->rootgc, all);
+}
+
+
+/* mark root set */
+static void markroot (GCState *st, lua_State *L) {
+ global_State *g = st->g;
+ markobject(st, defaultmeta(L));
+ markobject(st, registry(L));
+ traversestack(st, g->mainthread);
+ if (L != g->mainthread) /* another thread is running? */
+ markvalue(st, L); /* cannot collect it */
+}
+
+
+static size_t mark (lua_State *L) {
+ size_t deadmem;
+ GCState st;
+ GCObject *wkv;
+ st.g = G(L);
+ st.tmark = NULL;
+ st.wkv = st.wk = st.wv = NULL;
+ markroot(&st, L);
+ propagatemarks(&st); /* mark all reachable objects */
+ cleartablevalues(st.wkv);
+ cleartablevalues(st.wv);
+ wkv = st.wkv; /* keys must be cleared after preserving udata */
+ st.wkv = NULL;
+ st.wv = NULL;
+ deadmem = luaC_separateudata(L); /* separate userdata to be preserved */
+ marktmu(&st); /* mark `preserved' userdata */
+ propagatemarks(&st); /* remark, to propagate `preserveness' */
+ cleartablekeys(wkv);
+ /* `propagatemarks' may resuscitate some weak tables; clear them too */
+ cleartablekeys(st.wk);
+ cleartablevalues(st.wv);
+ cleartablekeys(st.wkv);
+ cleartablevalues(st.wkv);
+ return deadmem;
+}
+
+
+void luaC_collectgarbage (lua_State *L) {
+ size_t deadmem = mark(L);
+ luaC_sweep(L, 0);
+ checkSizes(L, deadmem);
+ luaC_callGCTM(L);
+}
+
+
+void luaC_link (lua_State *L, GCObject *o, lu_byte tt) {
+ o->gch.next = G(L)->rootgc;
+ G(L)->rootgc = o;
+ o->gch.marked = 0;
+ o->gch.tt = tt;
+}
+
--- /dev/null
+/*
+** $Id: lgc.h,v 1.19a 2003/02/28 19:45:15 roberto Exp $
+** Garbage Collector
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lgc_h
+#define lgc_h
+
+
+#include "lobject.h"
+
+
+#define luaC_checkGC(L) { lua_assert(!(L->ci->state & CI_CALLING)); \
+ if (G(L)->nblocks >= G(L)->GCthreshold) luaC_collectgarbage(L); }
+
+
+size_t luaC_separateudata (lua_State *L);
+void luaC_callGCTM (lua_State *L);
+void luaC_sweep (lua_State *L, int all);
+void luaC_collectgarbage (lua_State *L);
+void luaC_link (lua_State *L, GCObject *o, lu_byte tt);
+
+
+#endif
--- /dev/null
+# makefile for Lua standard library
+
+LUA= ../..
+
+include $(LUA)/config
+
+EXTRA_DEFS= $(POPEN) $(TMPNAM) $(DEGREES) $(LOADLIB)
+
+OBJS= lauxlib.o lbaselib.o ldblib.o liolib.o lmathlib.o ltablib.o lstrlib.o loadlib.o
+SRCS= lauxlib.c lbaselib.c ldblib.c liolib.c lmathlib.c ltablib.c lstrlib.c loadlib.c
+
+T= $(LIB)/liblualib.a
+
+all: $T
+
+$T: $(OBJS)
+ $(AR) $@ $(OBJS)
+ $(RANLIB) $@
+
+clean:
+ rm -f $(OBJS) $T
+
+co:
+ co -q -f -M $(SRCS)
+
+klean: clean
+ rm -f $(SRCS)
--- /dev/null
+This is the standard Lua library.
+
+The code of the standard library can be read as an example of how to export
+C functions to Lua. The easiest library to read is lmathlib.c.
+
+The library is implemented entirely on top of the official Lua API as declared
+in lua.h, using lauxlib.c, which contains several useful functions for writing
+libraries. We encourage developers to use lauxlib.c in their own libraries.
--- /dev/null
+/*
+** $Id: lauxlib.c,v 1.100 2003/04/07 14:35:00 roberto Exp $
+** Auxiliary functions for building Lua libraries
+** See Copyright Notice in lua.h
+*/
+
+
+#include <ctype.h>
+#include <errno.h>
+#include <stdarg.h>
+#include <stdio.h>
+#include <string.h>
+
+
+/* This file uses only the official API of Lua.
+** Any function declared here could be written as an application function.
+*/
+
+#define lauxlib_c
+
+#include "lua.h"
+
+#include "lauxlib.h"
+
+
+/* number of prereserved references (for internal use) */
+#define RESERVED_REFS 2
+
+/* reserved references */
+#define FREELIST_REF 1 /* free list of references */
+#define ARRAYSIZE_REF 2 /* array sizes */
+
+
+/* convert a stack index to positive */
+#define abs_index(L, i) ((i) > 0 || (i) <= LUA_REGISTRYINDEX ? (i) : \
+ lua_gettop(L) + (i) + 1)
+
+
+/*
+** {======================================================
+** Error-report functions
+** =======================================================
+*/
+
+
+LUALIB_API int luaL_argerror (lua_State *L, int narg, const char *extramsg) {
+ lua_Debug ar;
+ lua_getstack(L, 0, &ar);
+ lua_getinfo(L, "n", &ar);
+ if (strcmp(ar.namewhat, "method") == 0) {
+ narg--; /* do not count `self' */
+ if (narg == 0) /* error is in the self argument itself? */
+ return luaL_error(L, "calling `%s' on bad self (%s)", ar.name, extramsg);
+ }
+ if (ar.name == NULL)
+ ar.name = "?";
+ return luaL_error(L, "bad argument #%d to `%s' (%s)",
+ narg, ar.name, extramsg);
+}
+
+
+LUALIB_API int luaL_typerror (lua_State *L, int narg, const char *tname) {
+ const char *msg = lua_pushfstring(L, "%s expected, got %s",
+ tname, lua_typename(L, lua_type(L,narg)));
+ return luaL_argerror(L, narg, msg);
+}
+
+
+static void tag_error (lua_State *L, int narg, int tag) {
+ luaL_typerror(L, narg, lua_typename(L, tag));
+}
+
+
+LUALIB_API void luaL_where (lua_State *L, int level) {
+ lua_Debug ar;
+ if (lua_getstack(L, level, &ar)) { /* check function at level */
+ lua_getinfo(L, "Snl", &ar); /* get info about it */
+ if (ar.currentline > 0) { /* is there info? */
+ lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline);
+ return;
+ }
+ }
+ lua_pushliteral(L, ""); /* else, no information available... */
+}
+
+
+LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) {
+ va_list argp;
+ va_start(argp, fmt);
+ luaL_where(L, 1);
+ lua_pushvfstring(L, fmt, argp);
+ va_end(argp);
+ lua_concat(L, 2);
+ return lua_error(L);
+}
+
+/* }====================================================== */
+
+
+LUALIB_API int luaL_findstring (const char *name, const char *const list[]) {
+ int i;
+ for (i=0; list[i]; i++)
+ if (strcmp(list[i], name) == 0)
+ return i;
+ return -1; /* name not found */
+}
+
+
+LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) {
+ lua_pushstring(L, tname);
+ lua_rawget(L, LUA_REGISTRYINDEX); /* get registry.name */
+ if (!lua_isnil(L, -1)) /* name already in use? */
+ return 0; /* leave previous value on top, but return 0 */
+ lua_pop(L, 1);
+ lua_newtable(L); /* create metatable */
+ lua_pushstring(L, tname);
+ lua_pushvalue(L, -2);
+ lua_rawset(L, LUA_REGISTRYINDEX); /* registry.name = metatable */
+ lua_pushvalue(L, -1);
+ lua_pushstring(L, tname);
+ lua_rawset(L, LUA_REGISTRYINDEX); /* registry[metatable] = name */
+ return 1;
+}
+
+
+LUALIB_API void luaL_getmetatable (lua_State *L, const char *tname) {
+ lua_pushstring(L, tname);
+ lua_rawget(L, LUA_REGISTRYINDEX);
+}
+
+
+LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) {
+ const char *tn;
+ if (!lua_getmetatable(L, ud)) return NULL; /* no metatable? */
+ lua_rawget(L, LUA_REGISTRYINDEX); /* get registry[metatable] */
+ tn = lua_tostring(L, -1);
+ if (tn && (strcmp(tn, tname) == 0)) {
+ lua_pop(L, 1);
+ return lua_touserdata(L, ud);
+ }
+ else {
+ lua_pop(L, 1);
+ return NULL;
+ }
+}
+
+
+LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *mes) {
+ if (!lua_checkstack(L, space))
+ luaL_error(L, "stack overflow (%s)", mes);
+}
+
+
+LUALIB_API void luaL_checktype (lua_State *L, int narg, int t) {
+ if (lua_type(L, narg) != t)
+ tag_error(L, narg, t);
+}
+
+
+LUALIB_API void luaL_checkany (lua_State *L, int narg) {
+ if (lua_type(L, narg) == LUA_TNONE)
+ luaL_argerror(L, narg, "value expected");
+}
+
+
+LUALIB_API const char *luaL_checklstring (lua_State *L, int narg, size_t *len) {
+ const char *s = lua_tostring(L, narg);
+ if (!s) tag_error(L, narg, LUA_TSTRING);
+ if (len) *len = lua_strlen(L, narg);
+ return s;
+}
+
+
+LUALIB_API const char *luaL_optlstring (lua_State *L, int narg,
+ const char *def, size_t *len) {
+ if (lua_isnoneornil(L, narg)) {
+ if (len)
+ *len = (def ? strlen(def) : 0);
+ return def;
+ }
+ else return luaL_checklstring(L, narg, len);
+}
+
+
+LUALIB_API lua_Number luaL_checknumber (lua_State *L, int narg) {
+ lua_Number d = lua_tonumber(L, narg);
+ if (d == 0 && !lua_isnumber(L, narg)) /* avoid extra test when d is not 0 */
+ tag_error(L, narg, LUA_TNUMBER);
+ return d;
+}
+
+
+LUALIB_API lua_Number luaL_optnumber (lua_State *L, int narg, lua_Number def) {
+ if (lua_isnoneornil(L, narg)) return def;
+ else return luaL_checknumber(L, narg);
+}
+
+
+LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) {
+ if (!lua_getmetatable(L, obj)) /* no metatable? */
+ return 0;
+ lua_pushstring(L, event);
+ lua_rawget(L, -2);
+ if (lua_isnil(L, -1)) {
+ lua_pop(L, 2); /* remove metatable and metafield */
+ return 0;
+ }
+ else {
+ lua_remove(L, -2); /* remove only metatable */
+ return 1;
+ }
+}
+
+
+LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) {
+ obj = abs_index(L, obj);
+ if (!luaL_getmetafield(L, obj, event)) /* no metafield? */
+ return 0;
+ lua_pushvalue(L, obj);
+ lua_call(L, 1, 1);
+ return 1;
+}
+
+
+LUALIB_API void luaL_openlib (lua_State *L, const char *libname,
+ const luaL_reg *l, int nup) {
+ if (libname) {
+ lua_pushstring(L, libname);
+ lua_gettable(L, LUA_GLOBALSINDEX); /* check whether lib already exists */
+ if (lua_isnil(L, -1)) { /* no? */
+ lua_pop(L, 1);
+ lua_newtable(L); /* create it */
+ lua_pushstring(L, libname);
+ lua_pushvalue(L, -2);
+ lua_settable(L, LUA_GLOBALSINDEX); /* register it with given name */
+ }
+ lua_insert(L, -(nup+1)); /* move library table to below upvalues */
+ }
+ for (; l->name; l++) {
+ int i;
+ lua_pushstring(L, l->name);
+ for (i=0; i<nup; i++) /* copy upvalues to the top */
+ lua_pushvalue(L, -(nup+1));
+ lua_pushcclosure(L, l->func, nup);
+ lua_settable(L, -(nup+3));
+ }
+ lua_pop(L, nup); /* remove upvalues */
+}
+
+
+
+/*
+** {======================================================
+** getn-setn: size for arrays
+** =======================================================
+*/
+
+static int checkint (lua_State *L, int topop) {
+ int n = (int)lua_tonumber(L, -1);
+ if (n == 0 && !lua_isnumber(L, -1)) n = -1;
+ lua_pop(L, topop);
+ return n;
+}
+
+
+static void getsizes (lua_State *L) {
+ lua_rawgeti(L, LUA_REGISTRYINDEX, ARRAYSIZE_REF);
+ if (lua_isnil(L, -1)) { /* no `size' table? */
+ lua_pop(L, 1); /* remove nil */
+ lua_newtable(L); /* create it */
+ lua_pushvalue(L, -1); /* `size' will be its own metatable */
+ lua_setmetatable(L, -2);
+ lua_pushliteral(L, "__mode");
+ lua_pushliteral(L, "k");
+ lua_rawset(L, -3); /* metatable(N).__mode = "k" */
+ lua_pushvalue(L, -1);
+ lua_rawseti(L, LUA_REGISTRYINDEX, ARRAYSIZE_REF); /* store in register */
+ }
+}
+
+
+void luaL_setn (lua_State *L, int t, int n) {
+ t = abs_index(L, t);
+ lua_pushliteral(L, "n");
+ lua_rawget(L, t);
+ if (checkint(L, 1) >= 0) { /* is there a numeric field `n'? */
+ lua_pushliteral(L, "n"); /* use it */
+ lua_pushnumber(L, (lua_Number)n);
+ lua_rawset(L, t);
+ }
+ else { /* use `sizes' */
+ getsizes(L);
+ lua_pushvalue(L, t);
+ lua_pushnumber(L, (lua_Number)n);
+ lua_rawset(L, -3); /* sizes[t] = n */
+ lua_pop(L, 1); /* remove `sizes' */
+ }
+}
+
+
+int luaL_getn (lua_State *L, int t) {
+ int n;
+ t = abs_index(L, t);
+ lua_pushliteral(L, "n"); /* try t.n */
+ lua_rawget(L, t);
+ if ((n = checkint(L, 1)) >= 0) return n;
+ getsizes(L); /* else try sizes[t] */
+ lua_pushvalue(L, t);
+ lua_rawget(L, -2);
+ if ((n = checkint(L, 2)) >= 0) return n;
+ for (n = 1; ; n++) { /* else must count elements */
+ lua_rawgeti(L, t, n);
+ if (lua_isnil(L, -1)) break;
+ lua_pop(L, 1);
+ }
+ lua_pop(L, 1);
+ return n - 1;
+}
+
+/* }====================================================== */
+
+
+
+/*
+** {======================================================
+** Generic Buffer manipulation
+** =======================================================
+*/
+
+
+#define bufflen(B) ((B)->p - (B)->buffer)
+#define bufffree(B) ((size_t)(LUAL_BUFFERSIZE - bufflen(B)))
+
+#define LIMIT (LUA_MINSTACK/2)
+
+
+static int emptybuffer (luaL_Buffer *B) {
+ size_t l = bufflen(B);
+ if (l == 0) return 0; /* put nothing on stack */
+ else {
+ lua_pushlstring(B->L, B->buffer, l);
+ B->p = B->buffer;
+ B->lvl++;
+ return 1;
+ }
+}
+
+
+static void adjuststack (luaL_Buffer *B) {
+ if (B->lvl > 1) {
+ lua_State *L = B->L;
+ int toget = 1; /* number of levels to concat */
+ size_t toplen = lua_strlen(L, -1);
+ do {
+ size_t l = lua_strlen(L, -(toget+1));
+ if (B->lvl - toget + 1 >= LIMIT || toplen > l) {
+ toplen += l;
+ toget++;
+ }
+ else break;
+ } while (toget < B->lvl);
+ lua_concat(L, toget);
+ B->lvl = B->lvl - toget + 1;
+ }
+}
+
+
+LUALIB_API char *luaL_prepbuffer (luaL_Buffer *B) {
+ if (emptybuffer(B))
+ adjuststack(B);
+ return B->buffer;
+}
+
+
+LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) {
+ while (l--)
+ luaL_putchar(B, *s++);
+}
+
+
+LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) {
+ luaL_addlstring(B, s, strlen(s));
+}
+
+
+LUALIB_API void luaL_pushresult (luaL_Buffer *B) {
+ emptybuffer(B);
+ lua_concat(B->L, B->lvl);
+ B->lvl = 1;
+}
+
+
+LUALIB_API void luaL_addvalue (luaL_Buffer *B) {
+ lua_State *L = B->L;
+ size_t vl = lua_strlen(L, -1);
+ if (vl <= bufffree(B)) { /* fit into buffer? */
+ memcpy(B->p, lua_tostring(L, -1), vl); /* put it there */
+ B->p += vl;
+ lua_pop(L, 1); /* remove from stack */
+ }
+ else {
+ if (emptybuffer(B))
+ lua_insert(L, -2); /* put buffer before new value */
+ B->lvl++; /* add new value into B stack */
+ adjuststack(B);
+ }
+}
+
+
+LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) {
+ B->L = L;
+ B->p = B->buffer;
+ B->lvl = 0;
+}
+
+/* }====================================================== */
+
+
+LUALIB_API int luaL_ref (lua_State *L, int t) {
+ int ref;
+ t = abs_index(L, t);
+ if (lua_isnil(L, -1)) {
+ lua_pop(L, 1); /* remove from stack */
+ return LUA_REFNIL; /* `nil' has a unique fixed reference */
+ }
+ lua_rawgeti(L, t, FREELIST_REF); /* get first free element */
+ ref = (int)lua_tonumber(L, -1); /* ref = t[FREELIST_REF] */
+ lua_pop(L, 1); /* remove it from stack */
+ if (ref != 0) { /* any free element? */
+ lua_rawgeti(L, t, ref); /* remove it from list */
+ lua_rawseti(L, t, FREELIST_REF); /* (t[FREELIST_REF] = t[ref]) */
+ }
+ else { /* no free elements */
+ ref = luaL_getn(L, t);
+ if (ref < RESERVED_REFS)
+ ref = RESERVED_REFS; /* skip reserved references */
+ ref++; /* create new reference */
+ luaL_setn(L, t, ref);
+ }
+ lua_rawseti(L, t, ref);
+ return ref;
+}
+
+
+LUALIB_API void luaL_unref (lua_State *L, int t, int ref) {
+ if (ref >= 0) {
+ t = abs_index(L, t);
+ lua_rawgeti(L, t, FREELIST_REF);
+ lua_rawseti(L, t, ref); /* t[ref] = t[FREELIST_REF] */
+ lua_pushnumber(L, (lua_Number)ref);
+ lua_rawseti(L, t, FREELIST_REF); /* t[FREELIST_REF] = ref */
+ }
+}
+
+
+
+/*
+** {======================================================
+** Load functions
+** =======================================================
+*/
+
+typedef struct LoadF {
+ FILE *f;
+ char buff[LUAL_BUFFERSIZE];
+} LoadF;
+
+
+static const char *getF (lua_State *L, void *ud, size_t *size) {
+ LoadF *lf = (LoadF *)ud;
+ (void)L;
+ if (feof(lf->f)) return NULL;
+ *size = fread(lf->buff, 1, LUAL_BUFFERSIZE, lf->f);
+ return (*size > 0) ? lf->buff : NULL;
+}
+
+
+static int errfile (lua_State *L, int fnameindex) {
+ const char *filename = lua_tostring(L, fnameindex) + 1;
+ lua_pushfstring(L, "cannot read %s: %s", filename, strerror(errno));
+ lua_remove(L, fnameindex);
+ return LUA_ERRFILE;
+}
+
+
+LUALIB_API int luaL_loadfile (lua_State *L, const char *filename) {
+ LoadF lf;
+ int status, readstatus;
+ int c;
+ int fnameindex = lua_gettop(L) + 1; /* index of filename on the stack */
+ if (filename == NULL) {
+ lua_pushliteral(L, "=stdin");
+ lf.f = stdin;
+ }
+ else {
+ lua_pushfstring(L, "@%s", filename);
+ lf.f = fopen(filename, "r");
+ }
+ if (lf.f == NULL) return errfile(L, fnameindex); /* unable to open file */
+ c = ungetc(getc(lf.f), lf.f);
+ if (!(isspace(c) || isprint(c)) && lf.f != stdin) { /* binary file? */
+ fclose(lf.f);
+ lf.f = fopen(filename, "rb"); /* reopen in binary mode */
+ if (lf.f == NULL) return errfile(L, fnameindex); /* unable to reopen file */
+ }
+ status = lua_load(L, getF, &lf, lua_tostring(L, -1));
+ readstatus = ferror(lf.f);
+ if (lf.f != stdin) fclose(lf.f); /* close file (even in case of errors) */
+ if (readstatus) {
+ lua_settop(L, fnameindex); /* ignore results from `lua_load' */
+ return errfile(L, fnameindex);
+ }
+ lua_remove(L, fnameindex);
+ return status;
+}
+
+
+typedef struct LoadS {
+ const char *s;
+ size_t size;
+} LoadS;
+
+
+static const char *getS (lua_State *L, void *ud, size_t *size) {
+ LoadS *ls = (LoadS *)ud;
+ (void)L;
+ if (ls->size == 0) return NULL;
+ *size = ls->size;
+ ls->size = 0;
+ return ls->s;
+}
+
+
+LUALIB_API int luaL_loadbuffer (lua_State *L, const char *buff, size_t size,
+ const char *name) {
+ LoadS ls;
+ ls.s = buff;
+ ls.size = size;
+ return lua_load(L, getS, &ls, name);
+}
+
+/* }====================================================== */
+
+
+/*
+** {======================================================
+** compatibility code
+** =======================================================
+*/
+
+
+static void callalert (lua_State *L, int status) {
+ if (status != 0) {
+ lua_getglobal(L, "_ALERT");
+ if (lua_isfunction(L, -1)) {
+ lua_insert(L, -2);
+ lua_call(L, 1, 0);
+ }
+ else { /* no _ALERT function; print it on stderr */
+ fprintf(stderr, "%s\n", lua_tostring(L, -2));
+ lua_pop(L, 2); /* remove error message and _ALERT */
+ }
+ }
+}
+
+
+static int aux_do (lua_State *L, int status) {
+ if (status == 0) { /* parse OK? */
+ status = lua_pcall(L, 0, LUA_MULTRET, 0); /* call main */
+ }
+ callalert(L, status);
+ return status;
+}
+
+
+LUALIB_API int lua_dofile (lua_State *L, const char *filename) {
+ return aux_do(L, luaL_loadfile(L, filename));
+}
+
+
+LUALIB_API int lua_dobuffer (lua_State *L, const char *buff, size_t size,
+ const char *name) {
+ return aux_do(L, luaL_loadbuffer(L, buff, size, name));
+}
+
+
+LUALIB_API int lua_dostring (lua_State *L, const char *str) {
+ return lua_dobuffer(L, str, strlen(str), str);
+}
+
+/* }====================================================== */
--- /dev/null
+/*
+** $Id: lbaselib.c,v 1.130b 2003/04/03 13:35:34 roberto Exp $
+** Basic library
+** See Copyright Notice in lua.h
+*/
+
+
+
+#include <ctype.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define lbaselib_c
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+
+
+/*
+** If your system does not support `stdout', you can just remove this function.
+** If you need, you can define your own `print' function, following this
+** model but changing `fputs' to put the strings at a proper place
+** (a console window or a log file, for instance).
+*/
+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;
+ lua_pushvalue(L, -1); /* function to be called */
+ lua_pushvalue(L, i); /* value to print */
+ lua_call(L, 1, 1);
+ s = lua_tostring(L, -1); /* get result */
+ if (s == NULL)
+ return luaL_error(L, "`tostring' must return a string to `print'");
+ if (i>1) fputs("\t", stdout);
+ fputs(s, stdout);
+ lua_pop(L, 1); /* pop result */
+ }
+ fputs("\n", stdout);
+ return 0;
+}
+
+
+static int luaB_tonumber (lua_State *L) {
+ int base = luaL_optint(L, 2, 10);
+ if (base == 10) { /* standard conversion */
+ luaL_checkany(L, 1);
+ if (lua_isnumber(L, 1)) {
+ lua_pushnumber(L, lua_tonumber(L, 1));
+ return 1;
+ }
+ }
+ else {
+ const char *s1 = luaL_checkstring(L, 1);
+ char *s2;
+ unsigned long n;
+ luaL_argcheck(L, 2 <= base && base <= 36, 2, "base out of range");
+ n = strtoul(s1, &s2, base);
+ if (s1 != s2) { /* at least one valid digit? */
+ while (isspace((unsigned char)(*s2))) s2++; /* skip trailing spaces */
+ if (*s2 == '\0') { /* no invalid trailing characters? */
+ lua_pushnumber(L, (lua_Number)n);
+ return 1;
+ }
+ }
+ }
+ lua_pushnil(L); /* else not a number */
+ return 1;
+}
+
+
+static int luaB_error (lua_State *L) {
+ int level = luaL_optint(L, 2, 1);
+ luaL_checkany(L, 1);
+ if (!lua_isstring(L, 1) || level == 0)
+ lua_pushvalue(L, 1); /* propagate error message without changes */
+ else { /* add extra information */
+ luaL_where(L, level);
+ lua_pushvalue(L, 1);
+ lua_concat(L, 2);
+ }
+ return lua_error(L);
+}
+
+
+static int luaB_getmetatable (lua_State *L) {
+ luaL_checkany(L, 1);
+ if (!lua_getmetatable(L, 1)) {
+ lua_pushnil(L);
+ return 1; /* 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"))
+ luaL_error(L, "cannot change a protected metatable");
+ lua_settop(L, 2);
+ lua_setmetatable(L, 1);
+ return 1;
+}
+
+
+static void getfunc (lua_State *L) {
+ if (lua_isfunction(L, 1)) lua_pushvalue(L, 1);
+ else {
+ lua_Debug ar;
+ int level = luaL_optint(L, 1, 1);
+ luaL_argcheck(L, level >= 0, 1, "level must be non-negative");
+ if (lua_getstack(L, level, &ar) == 0)
+ luaL_argerror(L, 1, "invalid level");
+ lua_getinfo(L, "f", &ar);
+ if (lua_isnil(L, -1))
+ luaL_error(L, "no function environment for tail call at level %d",
+ level);
+ }
+}
+
+
+static int aux_getfenv (lua_State *L) {
+ lua_getfenv(L, -1);
+ lua_pushliteral(L, "__fenv");
+ lua_rawget(L, -2);
+ return !lua_isnil(L, -1);
+}
+
+
+static int luaB_getfenv (lua_State *L) {
+ getfunc(L);
+ if (!aux_getfenv(L)) /* __fenv not defined? */
+ lua_pop(L, 1); /* remove it, to return real environment */
+ return 1;
+}
+
+
+static int luaB_setfenv (lua_State *L) {
+ luaL_checktype(L, 2, LUA_TTABLE);
+ getfunc(L);
+ if (aux_getfenv(L)) /* __fenv defined? */
+ luaL_error(L, "`setfenv' cannot change a protected environment");
+ else
+ lua_pop(L, 2); /* remove __fenv and real environment table */
+ lua_pushvalue(L, 2);
+ if (lua_isnumber(L, 1) && lua_tonumber(L, 1) == 0)
+ lua_replace(L, LUA_GLOBALSINDEX);
+ else if (lua_setfenv(L, -2) == 0)
+ luaL_error(L, "`setfenv' cannot change environment of given function");
+ return 0;
+}
+
+
+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_rawget (lua_State *L) {
+ luaL_checktype(L, 1, LUA_TTABLE);
+ luaL_checkany(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_rawset(L, 1);
+ return 1;
+}
+
+
+static int luaB_gcinfo (lua_State *L) {
+ lua_pushnumber(L, (lua_Number)lua_getgccount(L));
+ lua_pushnumber(L, (lua_Number)lua_getgcthreshold(L));
+ return 2;
+}
+
+
+static int luaB_collectgarbage (lua_State *L) {
+ lua_setgcthreshold(L, luaL_optint(L, 1, 0));
+ return 0;
+}
+
+
+static int luaB_type (lua_State *L) {
+ luaL_checkany(L, 1);
+ lua_pushstring(L, lua_typename(L, lua_type(L, 1)));
+ return 1;
+}
+
+
+static int luaB_next (lua_State *L) {
+ luaL_checktype(L, 1, LUA_TTABLE);
+ lua_settop(L, 2); /* create a 2nd argument if there isn't one */
+ if (lua_next(L, 1))
+ return 2;
+ else {
+ lua_pushnil(L);
+ return 1;
+ }
+}
+
+
+static int luaB_pairs (lua_State *L) {
+ luaL_checktype(L, 1, LUA_TTABLE);
+ lua_pushliteral(L, "next");
+ lua_rawget(L, LUA_GLOBALSINDEX); /* return generator, */
+ lua_pushvalue(L, 1); /* state, */
+ lua_pushnil(L); /* and initial value */
+ return 3;
+}
+
+
+static int luaB_ipairs (lua_State *L) {
+ lua_Number i = lua_tonumber(L, 2);
+ luaL_checktype(L, 1, LUA_TTABLE);
+ if (i == 0 && lua_isnone(L, 2)) { /* `for' start? */
+ lua_pushliteral(L, "ipairs");
+ lua_rawget(L, LUA_GLOBALSINDEX); /* return generator, */
+ lua_pushvalue(L, 1); /* state, */
+ lua_pushnumber(L, 0); /* and initial value */
+ return 3;
+ }
+ else { /* `for' step */
+ i++; /* next value */
+ lua_pushnumber(L, i);
+ lua_rawgeti(L, 1, (int)i);
+ return (lua_isnil(L, -1)) ? 0 : 2;
+ }
+}
+
+
+static int load_aux (lua_State *L, int status) {
+ if (status == 0) /* OK? */
+ return 1;
+ else {
+ lua_pushnil(L);
+ lua_insert(L, -2); /* put before error message */
+ return 2; /* return nil plus error message */
+ }
+}
+
+
+static int luaB_loadstring (lua_State *L) {
+ size_t l;
+ const char *s = luaL_checklstring(L, 1, &l);
+ const char *chunkname = luaL_optstring(L, 2, s);
+ return load_aux(L, luaL_loadbuffer(L, s, l, chunkname));
+}
+
+
+static int luaB_loadfile (lua_State *L) {
+ const char *fname = luaL_optstring(L, 1, NULL);
+ return load_aux(L, luaL_loadfile(L, fname));
+}
+
+
+static int luaB_dofile (lua_State *L) {
+ const char *fname = luaL_optstring(L, 1, NULL);
+ int n = lua_gettop(L);
+ int status = luaL_loadfile(L, fname);
+ if (status != 0) lua_error(L);
+ lua_call(L, 0, LUA_MULTRET);
+ return lua_gettop(L) - n;
+}
+
+
+static int luaB_assert (lua_State *L) {
+ luaL_checkany(L, 1);
+ if (!lua_toboolean(L, 1))
+ return luaL_error(L, "%s", luaL_optstring(L, 2, "assertion failed!"));
+ lua_settop(L, 1);
+ return 1;
+}
+
+
+static int luaB_unpack (lua_State *L) {
+ int n, i;
+ luaL_checktype(L, 1, LUA_TTABLE);
+ n = luaL_getn(L, 1);
+ luaL_checkstack(L, n, "table too big to unpack");
+ for (i=1; i<=n; i++) /* push arg[1...n] */
+ lua_rawgeti(L, 1, i);
+ return n;
+}
+
+
+static int luaB_pcall (lua_State *L) {
+ int status;
+ luaL_checkany(L, 1);
+ status = lua_pcall(L, lua_gettop(L) - 1, LUA_MULTRET, 0);
+ lua_pushboolean(L, (status == 0));
+ lua_insert(L, 1);
+ return lua_gettop(L); /* return status + all results */
+}
+
+
+static int luaB_xpcall (lua_State *L) {
+ int status;
+ luaL_checkany(L, 2);
+ lua_settop(L, 2);
+ lua_insert(L, 1); /* put error function under function to be called */
+ status = lua_pcall(L, 0, LUA_MULTRET, 1);
+ lua_pushboolean(L, (status == 0));
+ lua_replace(L, 1);
+ return lua_gettop(L); /* return status + all results */
+}
+
+
+static int luaB_tostring (lua_State *L) {
+ char buff[128];
+ luaL_checkany(L, 1);
+ if (luaL_callmeta(L, 1, "__tostring")) /* is there a metafield? */
+ return 1; /* use its value */
+ switch (lua_type(L, 1)) {
+ case LUA_TNUMBER:
+ lua_pushstring(L, lua_tostring(L, 1));
+ return 1;
+ case LUA_TSTRING:
+ lua_pushvalue(L, 1);
+ return 1;
+ case LUA_TBOOLEAN:
+ lua_pushstring(L, (lua_toboolean(L, 1) ? "true" : "false"));
+ return 1;
+ case LUA_TTABLE:
+ sprintf(buff, "table: %p", lua_topointer(L, 1));
+ break;
+ case LUA_TFUNCTION:
+ sprintf(buff, "function: %p", lua_topointer(L, 1));
+ break;
+ case LUA_TUSERDATA:
+ case LUA_TLIGHTUSERDATA:
+ sprintf(buff, "userdata: %p", lua_touserdata(L, 1));
+ break;
+ case LUA_TTHREAD:
+ sprintf(buff, "thread: %p", (void *)lua_tothread(L, 1));
+ break;
+ case LUA_TNIL:
+ lua_pushliteral(L, "nil");
+ return 1;
+ }
+ lua_pushstring(L, buff);
+ return 1;
+}
+
+
+static int luaB_newproxy (lua_State *L) {
+ lua_settop(L, 1);
+ lua_newuserdata(L, 0); /* create proxy */
+ if (lua_toboolean(L, 1) == 0)
+ return 1; /* no metatable */
+ else if (lua_isboolean(L, 1)) {
+ lua_newtable(L); /* create a new metatable `m' ... */
+ lua_pushvalue(L, -1); /* ... and mark `m' as a valid metatable */
+ lua_pushboolean(L, 1);
+ lua_rawset(L, lua_upvalueindex(1)); /* weaktable[m] = true */
+ }
+ else {
+ int validproxy = 0; /* to check if weaktable[metatable(u)] == true */
+ if (lua_getmetatable(L, 1)) {
+ lua_rawget(L, lua_upvalueindex(1));
+ validproxy = lua_toboolean(L, -1);
+ lua_pop(L, 1); /* remove value */
+ }
+ luaL_argcheck(L, validproxy, 1, "boolean or proxy expected");
+ lua_getmetatable(L, 1); /* metatable is valid; get it */
+ }
+ lua_setmetatable(L, 2);
+ return 1;
+}
+
+
+/*
+** {======================================================
+** `require' function
+** =======================================================
+*/
+
+
+/* name of global that holds table with loaded packages */
+#define REQTAB "_LOADED"
+
+/* name of global that holds the search path for packages */
+#define LUA_PATH "LUA_PATH"
+
+#ifndef LUA_PATH_SEP
+#define LUA_PATH_SEP ';'
+#endif
+
+#ifndef LUA_PATH_MARK
+#define LUA_PATH_MARK '?'
+#endif
+
+#ifndef LUA_PATH_DEFAULT
+#define LUA_PATH_DEFAULT "?;?.lua"
+#endif
+
+
+static const char *getpath (lua_State *L) {
+ const char *path;
+ lua_getglobal(L, LUA_PATH); /* try global variable */
+ path = lua_tostring(L, -1);
+ lua_pop(L, 1);
+ if (path) return path;
+ path = getenv(LUA_PATH); /* else try environment variable */
+ if (path) return path;
+ return LUA_PATH_DEFAULT; /* else use default */
+}
+
+
+static const char *pushnextpath (lua_State *L, const char *path) {
+ const char *l;
+ if (*path == '\0') return NULL; /* no more paths */
+ if (*path == LUA_PATH_SEP) path++; /* skip separator */
+ l = strchr(path, LUA_PATH_SEP); /* find next separator */
+ if (l == NULL) l = path+strlen(path);
+ lua_pushlstring(L, path, l - path); /* directory name */
+ return l;
+}
+
+
+static void pushcomposename (lua_State *L) {
+ const char *path = lua_tostring(L, -1);
+ const char *wild;
+ int n = 1;
+ while ((wild = strchr(path, LUA_PATH_MARK)) != NULL) {
+ /* is there stack space for prefix, name, and eventual last sufix? */
+ luaL_checkstack(L, 3, "too many marks in a path component");
+ lua_pushlstring(L, path, wild - path); /* push prefix */
+ lua_pushvalue(L, 1); /* push package name (in place of MARK) */
+ path = wild + 1; /* continue after MARK */
+ n += 2;
+ }
+ lua_pushstring(L, path); /* push last sufix (`n' already includes this) */
+ lua_concat(L, n);
+}
+
+
+static int luaB_require (lua_State *L) {
+ const char *path;
+ int status = LUA_ERRFILE; /* not found (yet) */
+ luaL_checkstring(L, 1);
+ lua_settop(L, 1);
+ lua_getglobal(L, REQTAB);
+ if (!lua_istable(L, 2)) return luaL_error(L, "`" REQTAB "' is not a table");
+ path = getpath(L);
+ lua_pushvalue(L, 1); /* check package's name in book-keeping table */
+ lua_rawget(L, 2);
+ if (lua_toboolean(L, -1)) /* is it there? */
+ return 1; /* package is already loaded; return its result */
+ else { /* must load it */
+ while (status == LUA_ERRFILE) {
+ lua_settop(L, 3); /* reset stack position */
+ if ((path = pushnextpath(L, path)) == NULL) break;
+ pushcomposename(L);
+ status = luaL_loadfile(L, lua_tostring(L, -1)); /* try to load it */
+ }
+ }
+ switch (status) {
+ case 0: {
+ lua_getglobal(L, "_REQUIREDNAME"); /* save previous name */
+ lua_insert(L, -2); /* put it below function */
+ lua_pushvalue(L, 1);
+ lua_setglobal(L, "_REQUIREDNAME"); /* set new name */
+ lua_call(L, 0, 1); /* run loaded module */
+ lua_insert(L, -2); /* put result below previous name */
+ lua_setglobal(L, "_REQUIREDNAME"); /* reset to previous name */
+ if (lua_isnil(L, -1)) { /* no/nil return? */
+ lua_pushboolean(L, 1);
+ lua_replace(L, -2); /* replace to true */
+ }
+ lua_pushvalue(L, 1);
+ lua_pushvalue(L, -2);
+ lua_rawset(L, 2); /* mark it as loaded */
+ return 1; /* return value */
+ }
+ case LUA_ERRFILE: { /* file not found */
+ return luaL_error(L, "could not load package `%s' from path `%s'",
+ lua_tostring(L, 1), getpath(L));
+ }
+ default: {
+ return luaL_error(L, "error loading package `%s' (%s)",
+ lua_tostring(L, 1), lua_tostring(L, -1));
+ }
+ }
+}
+
+/* }====================================================== */
+
+
+static const luaL_reg base_funcs[] = {
+ {"error", luaB_error},
+ {"getmetatable", luaB_getmetatable},
+ {"setmetatable", luaB_setmetatable},
+ {"getfenv", luaB_getfenv},
+ {"setfenv", luaB_setfenv},
+ {"next", luaB_next},
+ {"ipairs", luaB_ipairs},
+ {"pairs", luaB_pairs},
+ {"print", luaB_print},
+ {"tonumber", luaB_tonumber},
+ {"tostring", luaB_tostring},
+ {"type", luaB_type},
+ {"assert", luaB_assert},
+ {"unpack", luaB_unpack},
+ {"rawequal", luaB_rawequal},
+ {"rawget", luaB_rawget},
+ {"rawset", luaB_rawset},
+ {"pcall", luaB_pcall},
+ {"xpcall", luaB_xpcall},
+ {"collectgarbage", luaB_collectgarbage},
+ {"gcinfo", luaB_gcinfo},
+ {"loadfile", luaB_loadfile},
+ {"dofile", luaB_dofile},
+ {"loadstring", luaB_loadstring},
+ {"require", luaB_require},
+ {NULL, NULL}
+};
+
+
+/*
+** {======================================================
+** Coroutine library
+** =======================================================
+*/
+
+static int auxresume (lua_State *L, lua_State *co, int narg) {
+ int status;
+ if (!lua_checkstack(co, narg))
+ luaL_error(L, "too many arguments to resume");
+ lua_xmove(L, co, narg);
+ status = lua_resume(co, narg);
+ if (status == 0) {
+ int nres = lua_gettop(co);
+ if (!lua_checkstack(L, nres))
+ luaL_error(L, "too many results to resume");
+ 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 = lua_tothread(L, 1);
+ int r;
+ luaL_argcheck(L, co, 1, "coroutine expected");
+ 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_isstring(L, -1)) { /* error object is a string? */
+ luaL_where(L, 1); /* add extra info */
+ lua_insert(L, -2);
+ lua_concat(L, 2);
+ }
+ lua_error(L); /* propagate error */
+ }
+ return r;
+}
+
+
+static int luaB_cocreate (lua_State *L) {
+ lua_State *NL = lua_newthread(L);
+ luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), 1,
+ "Lua function expected");
+ 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 = lua_tothread(L, 1);
+ luaL_argcheck(L, co, 1, "coroutine expected");
+ if (L == co) lua_pushliteral(L, "running");
+ else {
+ lua_Debug ar;
+ if (lua_getstack(co, 0, &ar) == 0 && lua_gettop(co) == 0)
+ lua_pushliteral(L, "dead");
+ else
+ lua_pushliteral(L, "suspended");
+ }
+ return 1;
+}
+
+
+static const luaL_reg co_funcs[] = {
+ {"create", luaB_cocreate},
+ {"wrap", luaB_cowrap},
+ {"resume", luaB_coresume},
+ {"yield", luaB_yield},
+ {"status", luaB_costatus},
+ {NULL, NULL}
+};
+
+/* }====================================================== */
+
+
+
+static void base_open (lua_State *L) {
+ lua_pushliteral(L, "_G");
+ lua_pushvalue(L, LUA_GLOBALSINDEX);
+ luaL_openlib(L, NULL, base_funcs, 0); /* open lib into global table */
+ lua_pushliteral(L, "_VERSION");
+ lua_pushliteral(L, LUA_VERSION);
+ lua_rawset(L, -3); /* set global _VERSION */
+ /* `newproxy' needs a weaktable as upvalue */
+ lua_pushliteral(L, "newproxy");
+ lua_newtable(L); /* new table `w' */
+ lua_pushvalue(L, -1); /* `w' will be its own metatable */
+ lua_setmetatable(L, -2);
+ lua_pushliteral(L, "__mode");
+ lua_pushliteral(L, "k");
+ lua_rawset(L, -3); /* metatable(w).__mode = "k" */
+ lua_pushcclosure(L, luaB_newproxy, 1);
+ lua_rawset(L, -3); /* set global `newproxy' */
+ lua_rawset(L, -1); /* set global _G */
+}
+
+
+LUALIB_API int luaopen_base (lua_State *L) {
+ base_open(L);
+ luaL_openlib(L, LUA_COLIBNAME, co_funcs, 0);
+ lua_newtable(L);
+ lua_setglobal(L, REQTAB);
+ return 0;
+}
+
--- /dev/null
+/*
+** $Id: ldblib.c,v 1.80 2003/04/03 13:35:34 roberto Exp $
+** Interface from Lua to its debug API
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define ldblib_c
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+
+static void settabss (lua_State *L, const char *i, const char *v) {
+ lua_pushstring(L, i);
+ lua_pushstring(L, v);
+ lua_rawset(L, -3);
+}
+
+
+static void settabsi (lua_State *L, const char *i, int v) {
+ lua_pushstring(L, i);
+ lua_pushnumber(L, (lua_Number)v);
+ lua_rawset(L, -3);
+}
+
+
+static int getinfo (lua_State *L) {
+ lua_Debug ar;
+ const char *options = luaL_optstring(L, 2, "flnSu");
+ if (lua_isnumber(L, 1)) {
+ if (!lua_getstack(L, (int)(lua_tonumber(L, 1)), &ar)) {
+ lua_pushnil(L); /* level out of range */
+ return 1;
+ }
+ }
+ else if (lua_isfunction(L, 1)) {
+ lua_pushfstring(L, ">%s", options);
+ options = lua_tostring(L, -1);
+ lua_pushvalue(L, 1);
+ }
+ else
+ return luaL_argerror(L, 1, "function or level expected");
+ if (!lua_getinfo(L, options, &ar))
+ return luaL_argerror(L, 2, "invalid option");
+ lua_newtable(L);
+ for (; *options; options++) {
+ switch (*options) {
+ case 'S':
+ settabss(L, "source", ar.source);
+ settabss(L, "short_src", ar.short_src);
+ settabsi(L, "linedefined", ar.linedefined);
+ settabss(L, "what", ar.what);
+ break;
+ case 'l':
+ settabsi(L, "currentline", ar.currentline);
+ break;
+ case 'u':
+ settabsi(L, "nups", ar.nups);
+ break;
+ case 'n':
+ settabss(L, "name", ar.name);
+ settabss(L, "namewhat", ar.namewhat);
+ break;
+ case 'f':
+ lua_pushliteral(L, "func");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ break;
+ }
+ }
+ return 1; /* return table */
+}
+
+
+static int getlocal (lua_State *L) {
+ lua_Debug ar;
+ const char *name;
+ if (!lua_getstack(L, luaL_checkint(L, 1), &ar)) /* level out of range? */
+ return luaL_argerror(L, 1, "level out of range");
+ name = lua_getlocal(L, &ar, luaL_checkint(L, 2));
+ if (name) {
+ lua_pushstring(L, name);
+ lua_pushvalue(L, -2);
+ return 2;
+ }
+ else {
+ lua_pushnil(L);
+ return 1;
+ }
+}
+
+
+static int setlocal (lua_State *L) {
+ lua_Debug ar;
+ if (!lua_getstack(L, luaL_checkint(L, 1), &ar)) /* level out of range? */
+ return luaL_argerror(L, 1, "level out of range");
+ luaL_checkany(L, 3);
+ lua_pushstring(L, lua_setlocal(L, &ar, luaL_checkint(L, 2)));
+ return 1;
+}
+
+
+static int auxupvalue (lua_State *L, int get) {
+ const char *name;
+ int n = luaL_checkint(L, 2);
+ luaL_checktype(L, 1, LUA_TFUNCTION);
+ if (lua_iscfunction(L, 1)) return 0; /* cannot touch C upvalues from Lua */
+ name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n);
+ if (name == NULL) return 0;
+ lua_pushstring(L, name);
+ lua_insert(L, -(get+1));
+ return get + 1;
+}
+
+
+static int getupvalue (lua_State *L) {
+ return auxupvalue(L, 1);
+}
+
+
+static int setupvalue (lua_State *L) {
+ luaL_checkany(L, 3);
+ return auxupvalue(L, 0);
+}
+
+
+
+static const char KEY_HOOK = 'h';
+
+
+static void hookf (lua_State *L, lua_Debug *ar) {
+ static const char *const hooknames[] =
+ {"call", "return", "line", "count", "tail return"};
+ lua_pushlightuserdata(L, (void *)&KEY_HOOK);
+ lua_rawget(L, LUA_REGISTRYINDEX);
+ if (lua_isfunction(L, -1)) {
+ lua_pushstring(L, hooknames[(int)ar->event]);
+ if (ar->currentline >= 0)
+ lua_pushnumber(L, (lua_Number)ar->currentline);
+ else lua_pushnil(L);
+ lua_assert(lua_getinfo(L, "lS", ar));
+ lua_call(L, 2, 0);
+ }
+ else
+ lua_pop(L, 1); /* pop result from gettable */
+}
+
+
+static int makemask (const char *smask, int count) {
+ int mask = 0;
+ if (strchr(smask, 'c')) mask |= LUA_MASKCALL;
+ if (strchr(smask, 'r')) mask |= LUA_MASKRET;
+ if (strchr(smask, 'l')) mask |= LUA_MASKLINE;
+ if (count > 0) mask |= LUA_MASKCOUNT;
+ return mask;
+}
+
+
+static char *unmakemask (int mask, char *smask) {
+ int i = 0;
+ if (mask & LUA_MASKCALL) smask[i++] = 'c';
+ if (mask & LUA_MASKRET) smask[i++] = 'r';
+ if (mask & LUA_MASKLINE) smask[i++] = 'l';
+ smask[i] = '\0';
+ return smask;
+}
+
+
+static int sethook (lua_State *L) {
+ if (lua_isnoneornil(L, 1)) {
+ lua_settop(L, 1);
+ lua_sethook(L, NULL, 0, 0); /* turn off hooks */
+ }
+ else {
+ const char *smask = luaL_checkstring(L, 2);
+ int count = luaL_optint(L, 3, 0);
+ luaL_checktype(L, 1, LUA_TFUNCTION);
+ lua_sethook(L, hookf, makemask(smask, count), count);
+ }
+ lua_pushlightuserdata(L, (void *)&KEY_HOOK);
+ lua_pushvalue(L, 1);
+ lua_rawset(L, LUA_REGISTRYINDEX); /* set new hook */
+ return 0;
+}
+
+
+static int gethook (lua_State *L) {
+ char buff[5];
+ int mask = lua_gethookmask(L);
+ lua_Hook hook = lua_gethook(L);
+ if (hook != NULL && hook != hookf) /* external hook? */
+ lua_pushliteral(L, "external hook");
+ else {
+ lua_pushlightuserdata(L, (void *)&KEY_HOOK);
+ lua_rawget(L, LUA_REGISTRYINDEX); /* get hook */
+ }
+ lua_pushstring(L, unmakemask(mask, buff));
+ lua_pushnumber(L, (lua_Number)lua_gethookcount(L));
+ return 3;
+}
+
+
+static int debug (lua_State *L) {
+ for (;;) {
+ char buffer[250];
+ fputs("lua_debug> ", stderr);
+ if (fgets(buffer, sizeof(buffer), stdin) == 0 ||
+ strcmp(buffer, "cont\n") == 0)
+ return 0;
+ lua_dostring(L, buffer);
+ lua_settop(L, 0); /* remove eventual returns */
+ }
+}
+
+
+#define LEVELS1 12 /* size of the first part of the stack */
+#define LEVELS2 10 /* size of the second part of the stack */
+
+static int errorfb (lua_State *L) {
+ int level = 1; /* skip level 0 (it's this function) */
+ int firstpart = 1; /* still before eventual `...' */
+ lua_Debug ar;
+ if (lua_gettop(L) == 0)
+ lua_pushliteral(L, "");
+ else if (!lua_isstring(L, 1)) return 1; /* no string message */
+ else lua_pushliteral(L, "\n");
+ lua_pushliteral(L, "stack traceback:");
+ while (lua_getstack(L, level++, &ar)) {
+ if (level > LEVELS1 && firstpart) {
+ /* no more than `LEVELS2' more levels? */
+ if (!lua_getstack(L, level+LEVELS2, &ar))
+ level--; /* keep going */
+ else {
+ lua_pushliteral(L, "\n\t..."); /* too many levels */
+ while (lua_getstack(L, level+LEVELS2, &ar)) /* find last levels */
+ level++;
+ }
+ firstpart = 0;
+ continue;
+ }
+ lua_pushliteral(L, "\n\t");
+ lua_getinfo(L, "Snl", &ar);
+ lua_pushfstring(L, "%s:", ar.short_src);
+ if (ar.currentline > 0)
+ lua_pushfstring(L, "%d:", ar.currentline);
+ switch (*ar.namewhat) {
+ case 'g': /* global */
+ case 'l': /* local */
+ case 'f': /* field */
+ case 'm': /* method */
+ lua_pushfstring(L, " in function `%s'", ar.name);
+ break;
+ default: {
+ if (*ar.what == 'm') /* main? */
+ lua_pushfstring(L, " in main chunk");
+ else if (*ar.what == 'C' || *ar.what == 't')
+ lua_pushliteral(L, " ?"); /* C function or tail call */
+ else
+ lua_pushfstring(L, " in function <%s:%d>",
+ ar.short_src, ar.linedefined);
+ }
+ }
+ lua_concat(L, lua_gettop(L));
+ }
+ lua_concat(L, lua_gettop(L));
+ return 1;
+}
+
+
+static const luaL_reg dblib[] = {
+ {"getlocal", getlocal},
+ {"getinfo", getinfo},
+ {"gethook", gethook},
+ {"getupvalue", getupvalue},
+ {"sethook", sethook},
+ {"setlocal", setlocal},
+ {"setupvalue", setupvalue},
+ {"debug", debug},
+ {"traceback", errorfb},
+ {NULL, NULL}
+};
+
+
+LUALIB_API int luaopen_debug (lua_State *L) {
+ luaL_openlib(L, LUA_DBLIBNAME, dblib, 0);
+ lua_pushliteral(L, "_TRACEBACK");
+ lua_pushcfunction(L, errorfb);
+ lua_settable(L, LUA_GLOBALSINDEX);
+ return 1;
+}
+
--- /dev/null
+/*
+** $Id: liolib.c,v 2.39a 2003/03/19 21:16:12 roberto Exp $
+** Standard I/O (and system) library
+** See Copyright Notice in lua.h
+*/
+
+
+#include <errno.h>
+#include <locale.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+
+#define liolib_c
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+
+/*
+** by default, gcc does not get `tmpname'
+*/
+#ifndef USE_TMPNAME
+#ifdef __GNUC__
+#define USE_TMPNAME 0
+#else
+#define USE_TMPNAME 1
+#endif
+#endif
+
+
+/*
+** by default, posix systems get `popen'
+*/
+#ifndef USE_POPEN
+#ifdef _POSIX_C_SOURCE
+#if _POSIX_C_SOURCE >= 2
+#define USE_POPEN 1
+#endif
+#endif
+#endif
+
+#ifndef USE_POPEN
+#define USE_POPEN 0
+#endif
+
+
+
+
+/*
+** {======================================================
+** FILE Operations
+** =======================================================
+*/
+
+
+#if !USE_POPEN
+#define pclose(f) (-1)
+#endif
+
+
+#define FILEHANDLE "FILE*"
+
+#define IO_INPUT "_input"
+#define IO_OUTPUT "_output"
+
+
+static int pushresult (lua_State *L, int i, const char *filename) {
+ if (i) {
+ lua_pushboolean(L, 1);
+ return 1;
+ }
+ else {
+ lua_pushnil(L);
+ if (filename)
+ lua_pushfstring(L, "%s: %s", filename, strerror(errno));
+ else
+ lua_pushfstring(L, "%s", strerror(errno));
+ lua_pushnumber(L, errno);
+ return 3;
+ }
+}
+
+
+static FILE **topfile (lua_State *L, int findex) {
+ FILE **f = (FILE **)luaL_checkudata(L, findex, FILEHANDLE);
+ if (f == NULL) luaL_argerror(L, findex, "bad file");
+ return f;
+}
+
+
+static int io_type (lua_State *L) {
+ FILE **f = (FILE **)luaL_checkudata(L, 1, FILEHANDLE);
+ if (f == NULL) lua_pushnil(L);
+ else if (*f == NULL)
+ lua_pushliteral(L, "closed file");
+ else
+ lua_pushliteral(L, "file");
+ return 1;
+}
+
+
+static FILE *tofile (lua_State *L, int findex) {
+ FILE **f = topfile(L, findex);
+ if (*f == NULL)
+ luaL_error(L, "attempt to use a closed file");
+ return *f;
+}
+
+
+
+/*
+** When creating file handles, always creates a `closed' file handle
+** before opening the actual file; so, if there is a memory error, the
+** file is not left opened.
+*/
+static FILE **newfile (lua_State *L) {
+ FILE **pf = (FILE **)lua_newuserdata(L, sizeof(FILE *));
+ *pf = NULL; /* file handle is currently `closed' */
+ luaL_getmetatable(L, FILEHANDLE);
+ lua_setmetatable(L, -2);
+ return pf;
+}
+
+
+/*
+** assumes that top of the stack is the `io' library, and next is
+** the `io' metatable
+*/
+static void registerfile (lua_State *L, FILE *f, const char *name,
+ const char *impname) {
+ lua_pushstring(L, name);
+ *newfile(L) = f;
+ if (impname) {
+ lua_pushstring(L, impname);
+ lua_pushvalue(L, -2);
+ lua_settable(L, -6); /* metatable[impname] = file */
+ }
+ lua_settable(L, -3); /* io[name] = file */
+}
+
+
+static int aux_close (lua_State *L) {
+ FILE *f = tofile(L, 1);
+ if (f == stdin || f == stdout || f == stderr)
+ return 0; /* file cannot be closed */
+ else {
+ int ok = (pclose(f) != -1) || (fclose(f) == 0);
+ if (ok)
+ *(FILE **)lua_touserdata(L, 1) = NULL; /* mark file as closed */
+ return ok;
+ }
+}
+
+
+static int io_close (lua_State *L) {
+ if (lua_isnone(L, 1) && lua_type(L, lua_upvalueindex(1)) == LUA_TTABLE) {
+ lua_pushstring(L, IO_OUTPUT);
+ lua_rawget(L, lua_upvalueindex(1));
+ }
+ return pushresult(L, aux_close(L), NULL);
+}
+
+
+static int io_gc (lua_State *L) {
+ FILE **f = topfile(L, 1);
+ if (*f != NULL) /* ignore closed files */
+ aux_close(L);
+ return 0;
+}
+
+
+static int io_tostring (lua_State *L) {
+ char buff[128];
+ FILE **f = topfile(L, 1);
+ if (*f == NULL)
+ strcpy(buff, "closed");
+ else
+ sprintf(buff, "%p", lua_touserdata(L, 1));
+ lua_pushfstring(L, "file (%s)", buff);
+ return 1;
+}
+
+
+static int io_open (lua_State *L) {
+ const char *filename = luaL_checkstring(L, 1);
+ const char *mode = luaL_optstring(L, 2, "r");
+ FILE **pf = newfile(L);
+ *pf = fopen(filename, mode);
+ return (*pf == NULL) ? pushresult(L, 0, filename) : 1;
+}
+
+
+static int io_popen (lua_State *L) {
+#if !USE_POPEN
+ luaL_error(L, "`popen' not supported");
+ return 0;
+#else
+ const char *filename = luaL_checkstring(L, 1);
+ const char *mode = luaL_optstring(L, 2, "r");
+ FILE **pf = newfile(L);
+ *pf = popen(filename, mode);
+ return (*pf == NULL) ? pushresult(L, 0, filename) : 1;
+#endif
+}
+
+
+static int io_tmpfile (lua_State *L) {
+ FILE **pf = newfile(L);
+ *pf = tmpfile();
+ return (*pf == NULL) ? pushresult(L, 0, NULL) : 1;
+}
+
+
+static FILE *getiofile (lua_State *L, const char *name) {
+ lua_pushstring(L, name);
+ lua_rawget(L, lua_upvalueindex(1));
+ return tofile(L, -1);
+}
+
+
+static int g_iofile (lua_State *L, const char *name, const char *mode) {
+ if (!lua_isnoneornil(L, 1)) {
+ const char *filename = lua_tostring(L, 1);
+ lua_pushstring(L, name);
+ if (filename) {
+ FILE **pf = newfile(L);
+ *pf = fopen(filename, mode);
+ if (*pf == NULL) {
+ lua_pushfstring(L, "%s: %s", filename, strerror(errno));
+ luaL_argerror(L, 1, lua_tostring(L, -1));
+ }
+ }
+ else {
+ tofile(L, 1); /* check that it's a valid file handle */
+ lua_pushvalue(L, 1);
+ }
+ lua_rawset(L, lua_upvalueindex(1));
+ }
+ /* return current value */
+ lua_pushstring(L, name);
+ lua_rawget(L, lua_upvalueindex(1));
+ 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);
+
+
+static void aux_lines (lua_State *L, int idx, int close) {
+ lua_pushliteral(L, FILEHANDLE);
+ lua_rawget(L, LUA_REGISTRYINDEX);
+ lua_pushvalue(L, idx);
+ lua_pushboolean(L, close); /* close/not close file when finished */
+ lua_pushcclosure(L, io_readline, 3);
+}
+
+
+static int f_lines (lua_State *L) {
+ tofile(L, 1); /* check that it's a valid file handle */
+ aux_lines(L, 1, 0);
+ return 1;
+}
+
+
+static int io_lines (lua_State *L) {
+ if (lua_isnoneornil(L, 1)) { /* no arguments? */
+ lua_pushstring(L, IO_INPUT);
+ lua_rawget(L, lua_upvalueindex(1)); /* will iterate over default input */
+ return f_lines(L);
+ }
+ else {
+ const char *filename = luaL_checkstring(L, 1);
+ FILE **pf = newfile(L);
+ *pf = fopen(filename, "r");
+ luaL_argcheck(L, *pf, 1, strerror(errno));
+ aux_lines(L, lua_gettop(L), 1);
+ return 1;
+ }
+}
+
+
+/*
+** {======================================================
+** READ
+** =======================================================
+*/
+
+
+static int read_number (lua_State *L, FILE *f) {
+ lua_Number d;
+ if (fscanf(f, LUA_NUMBER_SCAN, &d) == 1) {
+ lua_pushnumber(L, d);
+ return 1;
+ }
+ else return 0; /* read fails */
+}
+
+
+static int test_eof (lua_State *L, FILE *f) {
+ int c = getc(f);
+ ungetc(c, f);
+ lua_pushlstring(L, NULL, 0);
+ return (c != EOF);
+}
+
+
+static int read_line (lua_State *L, FILE *f) {
+ luaL_Buffer b;
+ luaL_buffinit(L, &b);
+ for (;;) {
+ size_t l;
+ char *p = luaL_prepbuffer(&b);
+ if (fgets(p, LUAL_BUFFERSIZE, f) == NULL) { /* eof? */
+ luaL_pushresult(&b); /* close buffer */
+ return (lua_strlen(L, -1) > 0); /* check whether read something */
+ }
+ l = strlen(p);
+ if (p[l-1] != '\n')
+ luaL_addsize(&b, l);
+ else {
+ luaL_addsize(&b, l - 1); /* do not include `eol' */
+ luaL_pushresult(&b); /* close buffer */
+ return 1; /* read at least an `eol' */
+ }
+ }
+}
+
+
+static int read_chars (lua_State *L, FILE *f, size_t n) {
+ size_t rlen; /* how much to read */
+ size_t nr; /* number of chars actually read */
+ luaL_Buffer b;
+ luaL_buffinit(L, &b);
+ rlen = LUAL_BUFFERSIZE; /* try to read that much each time */
+ do {
+ char *p = luaL_prepbuffer(&b);
+ if (rlen > n) rlen = n; /* cannot read more than asked */
+ nr = fread(p, sizeof(char), rlen, f);
+ luaL_addsize(&b, nr);
+ n -= nr; /* still have to read `n' chars */
+ } while (n > 0 && nr == rlen); /* until end of count or eof */
+ luaL_pushresult(&b); /* close buffer */
+ return (n == 0 || lua_strlen(L, -1) > 0);
+}
+
+
+static int g_read (lua_State *L, FILE *f, int first) {
+ int nargs = lua_gettop(L) - 1;
+ int success;
+ int n;
+ if (nargs == 0) { /* no arguments? */
+ success = read_line(L, f);
+ 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)lua_tonumber(L, n);
+ success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l);
+ }
+ else {
+ const char *p = lua_tostring(L, n);
+ luaL_argcheck(L, p && p[0] == '*', n, "invalid option");
+ switch (p[1]) {
+ case 'n': /* number */
+ success = read_number(L, f);
+ break;
+ case 'l': /* line */
+ success = read_line(L, f);
+ break;
+ case 'a': /* file */
+ read_chars(L, f, ~((size_t)0)); /* read MAX_SIZE_T chars */
+ success = 1; /* always success */
+ break;
+ case 'w': /* word */
+ return luaL_error(L, "obsolete option `*w' to `read'");
+ default:
+ return luaL_argerror(L, n, "invalid format");
+ }
+ }
+ }
+ }
+ 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, 1), 2);
+}
+
+
+static int io_readline (lua_State *L) {
+ FILE *f = *(FILE **)lua_touserdata(L, lua_upvalueindex(2));
+ if (f == NULL) /* file is already closed? */
+ luaL_error(L, "file is already closed");
+ if (read_line(L, f)) return 1;
+ else { /* EOF */
+ if (lua_toboolean(L, lua_upvalueindex(3))) { /* generator created file? */
+ lua_settop(L, 0);
+ lua_pushvalue(L, lua_upvalueindex(2));
+ aux_close(L); /* close it */
+ }
+ return 0;
+ }
+}
+
+/* }====================================================== */
+
+
+static int g_write (lua_State *L, FILE *f, int arg) {
+ int nargs = lua_gettop(L) - 1;
+ int status = 1;
+ for (; nargs--; arg++) {
+ if (lua_type(L, arg) == LUA_TNUMBER) {
+ /* optimization: could be done exactly as for strings */
+ status = status &&
+ fprintf(f, LUA_NUMBER_FMT, lua_tonumber(L, arg)) > 0;
+ }
+ else {
+ size_t l;
+ const char *s = luaL_checklstring(L, arg, &l);
+ status = status && (fwrite(s, sizeof(char), l, f) == l);
+ }
+ }
+ return pushresult(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) {
+ return g_write(L, tofile(L, 1), 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, 1);
+ int op = luaL_findstring(luaL_optstring(L, 2, "cur"), modenames);
+ long offset = luaL_optlong(L, 3, 0);
+ luaL_argcheck(L, op != -1, 2, "invalid mode");
+ op = fseek(f, offset, mode[op]);
+ if (op)
+ return pushresult(L, 0, NULL); /* error */
+ else {
+ lua_pushnumber(L, ftell(f));
+ return 1;
+ }
+}
+
+
+static int io_flush (lua_State *L) {
+ return pushresult(L, fflush(getiofile(L, IO_OUTPUT)) == 0, NULL);
+}
+
+
+static int f_flush (lua_State *L) {
+ return pushresult(L, fflush(tofile(L, 1)) == 0, NULL);
+}
+
+
+static const luaL_reg iolib[] = {
+ {"input", io_input},
+ {"output", io_output},
+ {"lines", io_lines},
+ {"close", io_close},
+ {"flush", io_flush},
+ {"open", io_open},
+ {"popen", io_popen},
+ {"read", io_read},
+ {"tmpfile", io_tmpfile},
+ {"type", io_type},
+ {"write", io_write},
+ {NULL, NULL}
+};
+
+
+static const luaL_reg flib[] = {
+ {"flush", f_flush},
+ {"read", f_read},
+ {"lines", f_lines},
+ {"seek", f_seek},
+ {"write", f_write},
+ {"close", io_close},
+ {"__gc", io_gc},
+ {"__tostring", io_tostring},
+ {NULL, NULL}
+};
+
+
+static void createmeta (lua_State *L) {
+ luaL_newmetatable(L, FILEHANDLE); /* create new metatable for file handles */
+ /* file methods */
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -2); /* push metatable */
+ lua_rawset(L, -3); /* metatable.__index = metatable */
+ luaL_openlib(L, NULL, flib, 0);
+}
+
+/* }====================================================== */
+
+
+/*
+** {======================================================
+** Other O.S. Operations
+** =======================================================
+*/
+
+static int io_execute (lua_State *L) {
+ lua_pushnumber(L, system(luaL_checkstring(L, 1)));
+ return 1;
+}
+
+
+static int io_remove (lua_State *L) {
+ const char *filename = luaL_checkstring(L, 1);
+ return pushresult(L, remove(filename) == 0, filename);
+}
+
+
+static int io_rename (lua_State *L) {
+ const char *fromname = luaL_checkstring(L, 1);
+ const char *toname = luaL_checkstring(L, 2);
+ return pushresult(L, rename(fromname, toname) == 0, fromname);
+}
+
+
+static int io_tmpname (lua_State *L) {
+#if !USE_TMPNAME
+ luaL_error(L, "`tmpname' not supported");
+ return 0;
+#else
+ char buff[L_tmpnam];
+ if (tmpnam(buff) != buff)
+ return luaL_error(L, "unable to generate a unique filename in `tmpname'");
+ lua_pushstring(L, buff);
+ return 1;
+#endif
+}
+
+
+static int io_getenv (lua_State *L) {
+ lua_pushstring(L, getenv(luaL_checkstring(L, 1))); /* if NULL push nil */
+ return 1;
+}
+
+
+static int io_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_pushstring(L, key);
+ lua_pushnumber(L, value);
+ lua_rawset(L, -3);
+}
+
+static void setboolfield (lua_State *L, const char *key, int value) {
+ lua_pushstring(L, key);
+ lua_pushboolean(L, value);
+ lua_rawset(L, -3);
+}
+
+static int getboolfield (lua_State *L, const char *key) {
+ int res;
+ lua_pushstring(L, key);
+ lua_gettable(L, -2);
+ res = lua_toboolean(L, -1);
+ lua_pop(L, 1);
+ return res;
+}
+
+
+static int getfield (lua_State *L, const char *key, int d) {
+ int res;
+ lua_pushstring(L, key);
+ lua_gettable(L, -2);
+ if (lua_isnumber(L, -1))
+ res = (int)(lua_tonumber(L, -1));
+ else {
+ if (d == -2)
+ return luaL_error(L, "field `%s' missing in date table", key);
+ res = d;
+ }
+ lua_pop(L, 1);
+ return res;
+}
+
+
+static int io_date (lua_State *L) {
+ const char *s = luaL_optstring(L, 1, "%c");
+ time_t t = (time_t)(luaL_optnumber(L, 2, -1));
+ struct tm *stm;
+ if (t == (time_t)(-1)) /* no time given? */
+ t = time(NULL); /* use current time */
+ if (*s == '!') { /* UTC? */
+ stm = gmtime(&t);
+ s++; /* skip `!' */
+ }
+ else
+ stm = localtime(&t);
+ if (stm == NULL) /* invalid date? */
+ lua_pushnil(L);
+ else if (strcmp(s, "*t") == 0) {
+ lua_newtable(L);
+ 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);
+ }
+ else {
+ char b[256];
+ if (strftime(b, sizeof(b), s, stm))
+ lua_pushstring(L, b);
+ else
+ return luaL_error(L, "`date' format too long");
+ }
+ return 1;
+}
+
+
+static int io_time (lua_State *L) {
+ if (lua_isnoneornil(L, 1)) /* called without args? */
+ lua_pushnumber(L, time(NULL)); /* return current time */
+ else {
+ time_t t;
+ 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);
+ ts.tm_min = getfield(L, "min", 0);
+ ts.tm_hour = getfield(L, "hour", 12);
+ ts.tm_mday = getfield(L, "day", -2);
+ ts.tm_mon = getfield(L, "month", -2) - 1;
+ ts.tm_year = getfield(L, "year", -2) - 1900;
+ ts.tm_isdst = getboolfield(L, "isdst");
+ t = mktime(&ts);
+ if (t == (time_t)(-1))
+ lua_pushnil(L);
+ else
+ lua_pushnumber(L, t);
+ }
+ return 1;
+}
+
+
+static int io_difftime (lua_State *L) {
+ lua_pushnumber(L, difftime((time_t)(luaL_checknumber(L, 1)),
+ (time_t)(luaL_optnumber(L, 2, 0))));
+ return 1;
+}
+
+/* }====================================================== */
+
+
+static int io_setloc (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 = lua_tostring(L, 1);
+ int op = luaL_findstring(luaL_optstring(L, 2, "all"), catnames);
+ luaL_argcheck(L, l || lua_isnoneornil(L, 1), 1, "string expected");
+ luaL_argcheck(L, op != -1, 2, "invalid option");
+ lua_pushstring(L, setlocale(cat[op], l));
+ return 1;
+}
+
+
+static int io_exit (lua_State *L) {
+ exit(luaL_optint(L, 1, EXIT_SUCCESS));
+ return 0; /* to avoid warnings */
+}
+
+static const luaL_reg syslib[] = {
+ {"clock", io_clock},
+ {"date", io_date},
+ {"difftime", io_difftime},
+ {"execute", io_execute},
+ {"exit", io_exit},
+ {"getenv", io_getenv},
+ {"remove", io_remove},
+ {"rename", io_rename},
+ {"setlocale", io_setloc},
+ {"time", io_time},
+ {"tmpname", io_tmpname},
+ {NULL, NULL}
+};
+
+/* }====================================================== */
+
+
+
+LUALIB_API int luaopen_io (lua_State *L) {
+ luaL_openlib(L, LUA_OSLIBNAME, syslib, 0);
+ createmeta(L);
+ lua_pushvalue(L, -1);
+ luaL_openlib(L, LUA_IOLIBNAME, iolib, 1);
+ /* put predefined file handles into `io' table */
+ registerfile(L, stdin, "stdin", IO_INPUT);
+ registerfile(L, stdout, "stdout", IO_OUTPUT);
+ registerfile(L, stderr, "stderr", NULL);
+ return 1;
+}
+
--- /dev/null
+/*
+** $Id: lmathlib.c,v 1.56 2003/03/11 12:30:37 roberto Exp $
+** Standard mathematical library
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdlib.h>
+#include <math.h>
+
+#define lmathlib_c
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+#undef PI
+#define PI (3.14159265358979323846)
+#define RADIANS_PER_DEGREE (PI/180.0)
+
+
+
+/*
+** If you want Lua to operate in degrees (instead of radians),
+** define USE_DEGREES
+*/
+#ifdef USE_DEGREES
+#define FROMRAD(a) ((a)/RADIANS_PER_DEGREE)
+#define TORAD(a) ((a)*RADIANS_PER_DEGREE)
+#else
+#define FROMRAD(a) (a)
+#define TORAD(a) (a)
+#endif
+
+
+static int math_abs (lua_State *L) {
+ lua_pushnumber(L, fabs(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_sin (lua_State *L) {
+ lua_pushnumber(L, sin(TORAD(luaL_checknumber(L, 1))));
+ return 1;
+}
+
+static int math_cos (lua_State *L) {
+ lua_pushnumber(L, cos(TORAD(luaL_checknumber(L, 1))));
+ return 1;
+}
+
+static int math_tan (lua_State *L) {
+ lua_pushnumber(L, tan(TORAD(luaL_checknumber(L, 1))));
+ return 1;
+}
+
+static int math_asin (lua_State *L) {
+ lua_pushnumber(L, FROMRAD(asin(luaL_checknumber(L, 1))));
+ return 1;
+}
+
+static int math_acos (lua_State *L) {
+ lua_pushnumber(L, FROMRAD(acos(luaL_checknumber(L, 1))));
+ return 1;
+}
+
+static int math_atan (lua_State *L) {
+ lua_pushnumber(L, FROMRAD(atan(luaL_checknumber(L, 1))));
+ return 1;
+}
+
+static int math_atan2 (lua_State *L) {
+ lua_pushnumber(L, FROMRAD(atan2(luaL_checknumber(L, 1), luaL_checknumber(L, 2))));
+ return 1;
+}
+
+static int math_ceil (lua_State *L) {
+ lua_pushnumber(L, ceil(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_floor (lua_State *L) {
+ lua_pushnumber(L, floor(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_mod (lua_State *L) {
+ lua_pushnumber(L, fmod(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));
+ return 1;
+}
+
+static int math_sqrt (lua_State *L) {
+ lua_pushnumber(L, sqrt(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_pow (lua_State *L) {
+ lua_pushnumber(L, pow(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));
+ return 1;
+}
+
+static int math_log (lua_State *L) {
+ lua_pushnumber(L, log(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_log10 (lua_State *L) {
+ lua_pushnumber(L, log10(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_exp (lua_State *L) {
+ lua_pushnumber(L, exp(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_deg (lua_State *L) {
+ lua_pushnumber(L, luaL_checknumber(L, 1)/RADIANS_PER_DEGREE);
+ return 1;
+}
+
+static int math_rad (lua_State *L) {
+ lua_pushnumber(L, luaL_checknumber(L, 1)*RADIANS_PER_DEGREE);
+ return 1;
+}
+
+static int math_frexp (lua_State *L) {
+ int e;
+ lua_pushnumber(L, frexp(luaL_checknumber(L, 1), &e));
+ lua_pushnumber(L, e);
+ return 2;
+}
+
+static int math_ldexp (lua_State *L) {
+ lua_pushnumber(L, ldexp(luaL_checknumber(L, 1), luaL_checkint(L, 2)));
+ return 1;
+}
+
+
+
+static int math_min (lua_State *L) {
+ int n = lua_gettop(L); /* number of arguments */
+ lua_Number dmin = luaL_checknumber(L, 1);
+ int i;
+ for (i=2; i<=n; i++) {
+ lua_Number d = luaL_checknumber(L, i);
+ if (d < dmin)
+ dmin = d;
+ }
+ lua_pushnumber(L, dmin);
+ return 1;
+}
+
+
+static int math_max (lua_State *L) {
+ int n = lua_gettop(L); /* number of arguments */
+ lua_Number dmax = luaL_checknumber(L, 1);
+ int i;
+ for (i=2; i<=n; i++) {
+ lua_Number d = luaL_checknumber(L, i);
+ if (d > dmax)
+ dmax = d;
+ }
+ lua_pushnumber(L, dmax);
+ return 1;
+}
+
+
+static int math_random (lua_State *L) {
+ /* the `%' avoids the (rare) case of r==1, and is needed also because on
+ some systems (SunOS!) `rand()' may return a value larger than RAND_MAX */
+ lua_Number r = (lua_Number)(rand()%RAND_MAX) / (lua_Number)RAND_MAX;
+ switch (lua_gettop(L)) { /* check number of arguments */
+ case 0: { /* no arguments */
+ lua_pushnumber(L, r); /* Number between 0 and 1 */
+ break;
+ }
+ case 1: { /* only upper limit */
+ int u = luaL_checkint(L, 1);
+ luaL_argcheck(L, 1<=u, 1, "interval is empty");
+ lua_pushnumber(L, (int)floor(r*u)+1); /* int between 1 and `u' */
+ break;
+ }
+ case 2: { /* lower and upper limits */
+ int l = luaL_checkint(L, 1);
+ int u = luaL_checkint(L, 2);
+ luaL_argcheck(L, l<=u, 2, "interval is empty");
+ lua_pushnumber(L, (int)floor(r*(u-l+1))+l); /* int between `l' and `u' */
+ break;
+ }
+ default: return luaL_error(L, "wrong number of arguments");
+ }
+ return 1;
+}
+
+
+static int math_randomseed (lua_State *L) {
+ srand(luaL_checkint(L, 1));
+ return 0;
+}
+
+
+static const luaL_reg mathlib[] = {
+ {"abs", math_abs},
+ {"sin", math_sin},
+ {"cos", math_cos},
+ {"tan", math_tan},
+ {"asin", math_asin},
+ {"acos", math_acos},
+ {"atan", math_atan},
+ {"atan2", math_atan2},
+ {"ceil", math_ceil},
+ {"floor", math_floor},
+ {"mod", math_mod},
+ {"frexp", math_frexp},
+ {"ldexp", math_ldexp},
+ {"sqrt", math_sqrt},
+ {"min", math_min},
+ {"max", math_max},
+ {"log", math_log},
+ {"log10", math_log10},
+ {"exp", math_exp},
+ {"deg", math_deg},
+ {"pow", math_pow},
+ {"rad", math_rad},
+ {"random", math_random},
+ {"randomseed", math_randomseed},
+ {NULL, NULL}
+};
+
+
+/*
+** Open math library
+*/
+LUALIB_API int luaopen_math (lua_State *L) {
+ luaL_openlib(L, LUA_MATHLIBNAME, mathlib, 0);
+ lua_pushliteral(L, "pi");
+ lua_pushnumber(L, PI);
+ lua_settable(L, -3);
+ lua_pushliteral(L, "__pow");
+ lua_pushcfunction(L, math_pow);
+ lua_settable(L, LUA_GLOBALSINDEX);
+ return 1;
+}
+
--- /dev/null
+/*
+** $Id: loadlib.c,v 1.4 2003/04/07 20:11:53 roberto Exp $
+** Dynamic library loader for Lua
+** See Copyright Notice in lua.h
+*
+* This Lua library exports a single function, called loadlib, which is
+* called from Lua as loadlib(lib,init), where lib is the full name of the
+* library to be loaded (including the complete path) and init is the name
+* of a function to be called after the library is loaded. Typically, this
+* function will register other functions, thus making the complete library
+* available to Lua. The init function is *not* automatically called by
+* loadlib. Instead, loadlib returns the init function as a Lua function
+* that the client can call when it thinks is appropriate. In the case of
+* errors, loadlib returns nil and two strings describing the error.
+* The first string is supplied by the operating system; it should be
+* informative and useful for error messages. The second string is "open",
+* "init", or "absent" to identify the error and is meant to be used for
+* making decisions without having to look into the first string (whose
+* format is system-dependent).
+*
+* This module contains an implementation of loadlib for Unix systems that
+* have dlfcn, an implementation for Windows, and a stub for other systems.
+* See the list at the end of this file for some links to available
+* implementations of dlfcn and interfaces to other native dynamic loaders
+* on top of which loadlib could be implemented.
+*
+*/
+
+#include "lua.h"
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+#undef LOADLIB
+
+
+#ifdef USE_DLOPEN
+#define LOADLIB
+/*
+* This is an implementation of loadlib based on the dlfcn interface.
+* The dlfcn interface is available in Linux, SunOS, Solaris, IRIX, FreeBSD,
+* NetBSD, AIX 4.2, HPUX 11, and probably most other Unix flavors, at least
+* as an emulation layer on top of native functions.
+*/
+
+#include <dlfcn.h>
+
+static int loadlib(lua_State *L)
+{
+ const char *path=luaL_checkstring(L,1);
+ const char *init=luaL_checkstring(L,2);
+ void *lib=dlopen(path,RTLD_NOW);
+ if (lib!=NULL)
+ {
+ lua_CFunction f=(lua_CFunction) dlsym(lib,init);
+ if (f!=NULL)
+ {
+ lua_pushlightuserdata(L,lib);
+ lua_pushcclosure(L,f,1);
+ return 1;
+ }
+ }
+ /* else return appropriate error messages */
+ lua_pushnil(L);
+ lua_pushstring(L,dlerror());
+ lua_pushstring(L,(lib!=NULL) ? "init" : "open");
+ if (lib!=NULL) dlclose(lib);
+ return 3;
+}
+
+#endif
+
+
+
+/*
+** In Windows, default is to use dll; otherwise, default is not to use dll
+*/
+#ifndef USE_DLL
+#ifdef _WIN32
+#define USE_DLL 1
+#else
+#define USE_DLL 0
+#endif
+#endif
+
+
+#if USE_DLL
+#define LOADLIB
+/*
+* This is an implementation of loadlib for Windows using native functions.
+*/
+
+#include <windows.h>
+
+static void pusherror(lua_State *L)
+{
+ int error=GetLastError();
+ char buffer[128];
+ if (FormatMessage(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM,
+ 0, error, 0, buffer, sizeof(buffer), 0))
+ lua_pushstring(L,buffer);
+ else
+ lua_pushfstring(L,"system error %d\n",error);
+}
+
+static int loadlib(lua_State *L)
+{
+ const char *path=luaL_checkstring(L,1);
+ const char *init=luaL_checkstring(L,2);
+ HINSTANCE lib=LoadLibrary(path);
+ if (lib!=NULL)
+ {
+ lua_CFunction f=(lua_CFunction) GetProcAddress(lib,init);
+ if (f!=NULL)
+ {
+ lua_pushlightuserdata(L,lib);
+ lua_pushcclosure(L,f,1);
+ return 1;
+ }
+ }
+ lua_pushnil(L);
+ pusherror(L);
+ lua_pushstring(L,(lib!=NULL) ? "init" : "open");
+ if (lib!=NULL) FreeLibrary(lib);
+ return 3;
+}
+
+#endif
+
+
+
+#ifndef LOADLIB
+/* Fallback for other systems */
+
+/*
+** Those systems support dlopen, so they should have defined USE_DLOPEN.
+** The default (no)implementation gives them a special error message.
+*/
+#ifdef linux
+#define LOADLIB
+#endif
+
+#ifdef sun
+#define LOADLIB
+#endif
+
+#ifdef sgi
+#define LOADLIB
+#endif
+
+#ifdef BSD
+#define LOADLIB
+#endif
+
+#ifdef _WIN32
+#define LOADLIB
+#endif
+
+#ifdef LOADLIB
+#undef LOADLIB
+#define LOADLIB "`loadlib' not installed (check your Lua configuration)"
+#else
+#define LOADLIB "`loadlib' not supported"
+#endif
+
+static int loadlib(lua_State *L)
+{
+ lua_pushnil(L);
+ lua_pushliteral(L,LOADLIB);
+ lua_pushliteral(L,"absent");
+ return 3;
+}
+#endif
+
+LUALIB_API int luaopen_loadlib (lua_State *L)
+{
+ lua_register(L,"loadlib",loadlib);
+ return 0;
+}
+
+/*
+* Here are some links to available implementations of dlfcn and
+* interfaces to other native dynamic loaders on top of which loadlib
+* could be implemented. Please send contributions and corrections to us.
+*
+* AIX
+* Starting with AIX 4.2, dlfcn is included in the base OS.
+* There is also an emulation package available.
+* http://www.faqs.org/faqs/aix-faq/part4/section-21.html
+*
+* HPUX
+* HPUX 11 has dlfcn. For HPUX 10 use shl_*.
+* http://www.geda.seul.org/mailinglist/geda-dev37/msg00094.html
+* http://www.stat.umn.edu/~luke/xls/projects/dlbasics/dlbasics.html
+*
+* Macintosh, Windows
+* http://www.stat.umn.edu/~luke/xls/projects/dlbasics/dlbasics.html
+*
+* Mac OS X/Darwin
+* http://www.opendarwin.org/projects/dlcompat/
+*
+* GLIB has wrapper code for BeOS, OS2, Unix and Windows
+* http://cvs.gnome.org/lxr/source/glib/gmodule/
+*
+*/
--- /dev/null
+/*
+** $Id: lstrlib.c,v 1.98 2003/04/03 13:35:34 roberto Exp $
+** Standard library for string operations and pattern-matching
+** See Copyright Notice in lua.h
+*/
+
+
+#include <ctype.h>
+#include <stddef.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define lstrlib_c
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+/* macro to `unsign' a character */
+#ifndef uchar
+#define uchar(c) ((unsigned char)(c))
+#endif
+
+
+typedef long sint32; /* a signed version for size_t */
+
+
+static int str_len (lua_State *L) {
+ size_t l;
+ luaL_checklstring(L, 1, &l);
+ lua_pushnumber(L, (lua_Number)l);
+ return 1;
+}
+
+
+static sint32 posrelat (sint32 pos, size_t len) {
+ /* relative string position: negative means back from end */
+ return (pos>=0) ? pos : (sint32)len+pos+1;
+}
+
+
+static int str_sub (lua_State *L) {
+ size_t l;
+ const char *s = luaL_checklstring(L, 1, &l);
+ sint32 start = posrelat(luaL_checklong(L, 2), l);
+ sint32 end = posrelat(luaL_optlong(L, 3, -1), l);
+ if (start < 1) start = 1;
+ if (end > (sint32)l) end = (sint32)l;
+ if (start <= end)
+ lua_pushlstring(L, s+start-1, end-start+1);
+ else lua_pushliteral(L, "");
+ return 1;
+}
+
+
+static int str_lower (lua_State *L) {
+ size_t l;
+ size_t i;
+ luaL_Buffer b;
+ const char *s = luaL_checklstring(L, 1, &l);
+ luaL_buffinit(L, &b);
+ for (i=0; i<l; i++)
+ luaL_putchar(&b, tolower(uchar(s[i])));
+ luaL_pushresult(&b);
+ return 1;
+}
+
+
+static int str_upper (lua_State *L) {
+ size_t l;
+ size_t i;
+ luaL_Buffer b;
+ const char *s = luaL_checklstring(L, 1, &l);
+ luaL_buffinit(L, &b);
+ for (i=0; i<l; i++)
+ luaL_putchar(&b, toupper(uchar(s[i])));
+ luaL_pushresult(&b);
+ return 1;
+}
+
+static int str_rep (lua_State *L) {
+ size_t l;
+ luaL_Buffer b;
+ const char *s = luaL_checklstring(L, 1, &l);
+ int n = luaL_checkint(L, 2);
+ luaL_buffinit(L, &b);
+ while (n-- > 0)
+ luaL_addlstring(&b, s, l);
+ luaL_pushresult(&b);
+ return 1;
+}
+
+
+static int str_byte (lua_State *L) {
+ size_t l;
+ const char *s = luaL_checklstring(L, 1, &l);
+ sint32 pos = posrelat(luaL_optlong(L, 2, 1), l);
+ if (pos <= 0 || (size_t)(pos) > l) /* index out of range? */
+ return 0; /* no answer */
+ lua_pushnumber(L, uchar(s[pos-1]));
+ return 1;
+}
+
+
+static int str_char (lua_State *L) {
+ int n = lua_gettop(L); /* number of arguments */
+ int i;
+ luaL_Buffer b;
+ luaL_buffinit(L, &b);
+ for (i=1; i<=n; i++) {
+ int c = luaL_checkint(L, i);
+ luaL_argcheck(L, uchar(c) == c, i, "invalid value");
+ luaL_putchar(&b, uchar(c));
+ }
+ luaL_pushresult(&b);
+ return 1;
+}
+
+
+static int writer (lua_State *L, const void* b, size_t size, void* B) {
+ (void)L;
+ luaL_addlstring((luaL_Buffer*) B, (const char *)b, size);
+ return 1;
+}
+
+
+static int str_dump (lua_State *L) {
+ luaL_Buffer b;
+ luaL_checktype(L, 1, LUA_TFUNCTION);
+ luaL_buffinit(L,&b);
+ if (!lua_dump(L, writer, &b))
+ luaL_error(L, "unable to dump given function");
+ luaL_pushresult(&b);
+ return 1;
+}
+
+
+
+/*
+** {======================================================
+** PATTERN MATCHING
+** =======================================================
+*/
+
+#ifndef MAX_CAPTURES
+#define MAX_CAPTURES 32 /* arbitrary limit */
+#endif
+
+
+#define CAP_UNFINISHED (-1)
+#define CAP_POSITION (-2)
+
+typedef struct MatchState {
+ const char *src_init; /* init of source string */
+ const char *src_end; /* end (`\0') of source string */
+ lua_State *L;
+ int level; /* total number of captures (finished or unfinished) */
+ struct {
+ const char *init;
+ sint32 len;
+ } capture[MAX_CAPTURES];
+} MatchState;
+
+
+#define ESC '%'
+#define SPECIALS "^$*+?.([%-"
+
+
+static int check_capture (MatchState *ms, int l) {
+ l -= '1';
+ if (l < 0 || l >= ms->level || ms->capture[l].len == CAP_UNFINISHED)
+ return luaL_error(ms->L, "invalid capture index");
+ return l;
+}
+
+
+static int capture_to_close (MatchState *ms) {
+ int level = ms->level;
+ for (level--; level>=0; level--)
+ if (ms->capture[level].len == CAP_UNFINISHED) return level;
+ return luaL_error(ms->L, "invalid pattern capture");
+}
+
+
+static const char *luaI_classend (MatchState *ms, const char *p) {
+ switch (*p++) {
+ case ESC: {
+ if (*p == '\0')
+ luaL_error(ms->L, "malformed pattern (ends with `%')");
+ return p+1;
+ }
+ case '[': {
+ if (*p == '^') p++;
+ do { /* look for a `]' */
+ if (*p == '\0')
+ luaL_error(ms->L, "malformed pattern (missing `]')");
+ if (*(p++) == ESC && *p != '\0')
+ p++; /* skip escapes (e.g. `%]') */
+ } while (*p != ']');
+ return p+1;
+ }
+ default: {
+ return p;
+ }
+ }
+}
+
+
+static int match_class (int c, int cl) {
+ int res;
+ switch (tolower(cl)) {
+ case 'a' : res = isalpha(c); break;
+ case 'c' : res = iscntrl(c); break;
+ case 'd' : res = isdigit(c); break;
+ case 'l' : res = islower(c); break;
+ case 'p' : res = ispunct(c); break;
+ case 's' : res = isspace(c); break;
+ case 'u' : res = isupper(c); break;
+ case 'w' : res = isalnum(c); break;
+ case 'x' : res = isxdigit(c); break;
+ case 'z' : res = (c == 0); break;
+ default: return (cl == c);
+ }
+ return (islower(cl) ? res : !res);
+}
+
+
+static int matchbracketclass (int c, const char *p, const char *ec) {
+ int sig = 1;
+ if (*(p+1) == '^') {
+ sig = 0;
+ p++; /* skip the `^' */
+ }
+ while (++p < ec) {
+ if (*p == ESC) {
+ p++;
+ if (match_class(c, *p))
+ return sig;
+ }
+ else if ((*(p+1) == '-') && (p+2 < ec)) {
+ p+=2;
+ if (uchar(*(p-2)) <= c && c <= uchar(*p))
+ return sig;
+ }
+ else if (uchar(*p) == c) return sig;
+ }
+ return !sig;
+}
+
+
+static int luaI_singlematch (int c, const char *p, const char *ep) {
+ switch (*p) {
+ case '.': return 1; /* matches any char */
+ case ESC: return match_class(c, *(p+1));
+ case '[': return matchbracketclass(c, p, ep-1);
+ default: return (uchar(*p) == c);
+ }
+}
+
+
+static const char *match (MatchState *ms, const char *s, const char *p);
+
+
+static const char *matchbalance (MatchState *ms, const char *s,
+ const char *p) {
+ if (*p == 0 || *(p+1) == 0)
+ luaL_error(ms->L, "unbalanced pattern");
+ if (*s != *p) return NULL;
+ else {
+ int b = *p;
+ int e = *(p+1);
+ int cont = 1;
+ while (++s < ms->src_end) {
+ if (*s == e) {
+ if (--cont == 0) return s+1;
+ }
+ else if (*s == b) cont++;
+ }
+ }
+ return NULL; /* string ends out of balance */
+}
+
+
+static const char *max_expand (MatchState *ms, const char *s,
+ const char *p, const char *ep) {
+ sint32 i = 0; /* counts maximum expand for item */
+ while ((s+i)<ms->src_end && luaI_singlematch(uchar(*(s+i)), p, ep))
+ i++;
+ /* keeps trying to match with the maximum repetitions */
+ while (i>=0) {
+ const char *res = match(ms, (s+i), ep+1);
+ if (res) return res;
+ i--; /* else didn't match; reduce 1 repetition to try again */
+ }
+ return NULL;
+}
+
+
+static const char *min_expand (MatchState *ms, const char *s,
+ const char *p, const char *ep) {
+ for (;;) {
+ const char *res = match(ms, s, ep+1);
+ if (res != NULL)
+ return res;
+ else if (s<ms->src_end && luaI_singlematch(uchar(*s), p, ep))
+ s++; /* try with one more repetition */
+ else return NULL;
+ }
+}
+
+
+static const char *start_capture (MatchState *ms, const char *s,
+ const char *p, int what) {
+ const char *res;
+ int level = ms->level;
+ if (level >= MAX_CAPTURES) luaL_error(ms->L, "too many captures");
+ ms->capture[level].init = s;
+ ms->capture[level].len = what;
+ ms->level = level+1;
+ if ((res=match(ms, s, p)) == NULL) /* match failed? */
+ ms->level--; /* undo capture */
+ return res;
+}
+
+
+static const char *end_capture (MatchState *ms, const char *s,
+ const char *p) {
+ int l = capture_to_close(ms);
+ const char *res;
+ ms->capture[l].len = s - ms->capture[l].init; /* close capture */
+ if ((res = match(ms, s, p)) == NULL) /* match failed? */
+ ms->capture[l].len = CAP_UNFINISHED; /* undo capture */
+ return res;
+}
+
+
+static const char *match_capture (MatchState *ms, const char *s, int l) {
+ size_t len;
+ l = check_capture(ms, l);
+ len = ms->capture[l].len;
+ if ((size_t)(ms->src_end-s) >= len &&
+ memcmp(ms->capture[l].init, s, len) == 0)
+ return s+len;
+ else return NULL;
+}
+
+
+static const char *match (MatchState *ms, const char *s, const char *p) {
+ init: /* using goto's to optimize tail recursion */
+ switch (*p) {
+ case '(': { /* start capture */
+ if (*(p+1) == ')') /* position capture? */
+ return start_capture(ms, s, p+2, CAP_POSITION);
+ else
+ return start_capture(ms, s, p+1, CAP_UNFINISHED);
+ }
+ case ')': { /* end capture */
+ return end_capture(ms, s, p+1);
+ }
+ case ESC: {
+ switch (*(p+1)) {
+ case 'b': { /* balanced string? */
+ s = matchbalance(ms, s, p+2);
+ if (s == NULL) return NULL;
+ p+=4; goto init; /* else return match(ms, s, p+4); */
+ }
+ case 'f': { /* frontier? */
+ const char *ep; char previous;
+ p += 2;
+ if (*p != '[')
+ luaL_error(ms->L, "missing `[' after `%%f' in pattern");
+ ep = luaI_classend(ms, p); /* points to what is next */
+ previous = (s == ms->src_init) ? '\0' : *(s-1);
+ if (matchbracketclass(uchar(previous), p, ep-1) ||
+ !matchbracketclass(uchar(*s), p, ep-1)) return NULL;
+ p=ep; goto init; /* else return match(ms, s, ep); */
+ }
+ default: {
+ if (isdigit(uchar(*(p+1)))) { /* capture results (%0-%9)? */
+ s = match_capture(ms, s, *(p+1));
+ if (s == NULL) return NULL;
+ p+=2; goto init; /* else return match(ms, s, p+2) */
+ }
+ goto dflt; /* case default */
+ }
+ }
+ }
+ case '\0': { /* end of pattern */
+ return s; /* match succeeded */
+ }
+ case '$': {
+ if (*(p+1) == '\0') /* is the `$' the last char in pattern? */
+ return (s == ms->src_end) ? s : NULL; /* check end of string */
+ else goto dflt;
+ }
+ default: dflt: { /* it is a pattern item */
+ const char *ep = luaI_classend(ms, p); /* points to what is next */
+ int m = s<ms->src_end && luaI_singlematch(uchar(*s), p, ep);
+ switch (*ep) {
+ case '?': { /* optional */
+ const char *res;
+ if (m && ((res=match(ms, s+1, ep+1)) != NULL))
+ return res;
+ p=ep+1; goto init; /* else return match(ms, s, ep+1); */
+ }
+ case '*': { /* 0 or more repetitions */
+ return max_expand(ms, s, p, ep);
+ }
+ case '+': { /* 1 or more repetitions */
+ return (m ? max_expand(ms, s+1, p, ep) : NULL);
+ }
+ case '-': { /* 0 or more repetitions (minimum) */
+ return min_expand(ms, s, p, ep);
+ }
+ default: {
+ if (!m) return NULL;
+ s++; p=ep; goto init; /* else return match(ms, s+1, ep); */
+ }
+ }
+ }
+ }
+}
+
+
+
+static const char *lmemfind (const char *s1, size_t l1,
+ const char *s2, size_t l2) {
+ if (l2 == 0) return s1; /* empty strings are everywhere */
+ else if (l2 > l1) return NULL; /* avoids a negative `l1' */
+ else {
+ const char *init; /* to search for a `*s2' inside `s1' */
+ l2--; /* 1st char will be checked by `memchr' */
+ l1 = l1-l2; /* `s2' cannot be found after that */
+ while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) {
+ init++; /* 1st char is already checked */
+ if (memcmp(init, s2+1, l2) == 0)
+ return init-1;
+ else { /* correct `l1' and `s1' to try again */
+ l1 -= init-s1;
+ s1 = init;
+ }
+ }
+ return NULL; /* not found */
+ }
+}
+
+
+static void push_onecapture (MatchState *ms, int i) {
+ int l = ms->capture[i].len;
+ if (l == CAP_UNFINISHED) luaL_error(ms->L, "unfinished capture");
+ if (l == CAP_POSITION)
+ lua_pushnumber(ms->L, (lua_Number)(ms->capture[i].init - ms->src_init + 1));
+ else
+ lua_pushlstring(ms->L, ms->capture[i].init, l);
+}
+
+
+static int push_captures (MatchState *ms, const char *s, const char *e) {
+ int i;
+ luaL_checkstack(ms->L, ms->level, "too many captures");
+ if (ms->level == 0 && s) { /* no explicit captures? */
+ lua_pushlstring(ms->L, s, e-s); /* return whole match */
+ return 1;
+ }
+ else { /* return all captures */
+ for (i=0; i<ms->level; i++)
+ push_onecapture(ms, i);
+ return ms->level; /* number of strings pushed */
+ }
+}
+
+
+static int str_find (lua_State *L) {
+ size_t l1, l2;
+ const char *s = luaL_checklstring(L, 1, &l1);
+ const char *p = luaL_checklstring(L, 2, &l2);
+ sint32 init = posrelat(luaL_optlong(L, 3, 1), l1) - 1;
+ if (init < 0) init = 0;
+ else if ((size_t)(init) > l1) init = (sint32)l1;
+ if (lua_toboolean(L, 4) || /* explicit request? */
+ strpbrk(p, SPECIALS) == NULL) { /* or no special characters? */
+ /* do a plain search */
+ const char *s2 = lmemfind(s+init, l1-init, p, l2);
+ if (s2) {
+ lua_pushnumber(L, (lua_Number)(s2-s+1));
+ lua_pushnumber(L, (lua_Number)(s2-s+l2));
+ return 2;
+ }
+ }
+ else {
+ MatchState ms;
+ int anchor = (*p == '^') ? (p++, 1) : 0;
+ const char *s1=s+init;
+ ms.L = L;
+ ms.src_init = s;
+ ms.src_end = s+l1;
+ do {
+ const char *res;
+ ms.level = 0;
+ if ((res=match(&ms, s1, p)) != NULL) {
+ lua_pushnumber(L, (lua_Number)(s1-s+1)); /* start */
+ lua_pushnumber(L, (lua_Number)(res-s)); /* end */
+ return push_captures(&ms, NULL, 0) + 2;
+ }
+ } while (s1++<ms.src_end && !anchor);
+ }
+ lua_pushnil(L); /* not found */
+ return 1;
+}
+
+
+static int gfind_aux (lua_State *L) {
+ MatchState ms;
+ const char *s = lua_tostring(L, lua_upvalueindex(1));
+ size_t ls = lua_strlen(L, lua_upvalueindex(1));
+ const char *p = lua_tostring(L, lua_upvalueindex(2));
+ const char *src;
+ ms.L = L;
+ ms.src_init = s;
+ ms.src_end = s+ls;
+ for (src = s + (size_t)lua_tonumber(L, lua_upvalueindex(3));
+ src <= ms.src_end;
+ src++) {
+ const char *e;
+ ms.level = 0;
+ if ((e = match(&ms, src, p)) != NULL) {
+ int newstart = e-s;
+ if (e == src) newstart++; /* empty match? go at least one position */
+ lua_pushnumber(L, (lua_Number)newstart);
+ lua_replace(L, lua_upvalueindex(3));
+ return push_captures(&ms, src, e);
+ }
+ }
+ return 0; /* not found */
+}
+
+
+static int gfind (lua_State *L) {
+ luaL_checkstring(L, 1);
+ luaL_checkstring(L, 2);
+ lua_settop(L, 2);
+ lua_pushnumber(L, 0);
+ lua_pushcclosure(L, gfind_aux, 3);
+ return 1;
+}
+
+
+static void add_s (MatchState *ms, luaL_Buffer *b,
+ const char *s, const char *e) {
+ lua_State *L = ms->L;
+ if (lua_isstring(L, 3)) {
+ const char *news = lua_tostring(L, 3);
+ size_t l = lua_strlen(L, 3);
+ size_t i;
+ for (i=0; i<l; i++) {
+ if (news[i] != ESC)
+ luaL_putchar(b, news[i]);
+ else {
+ i++; /* skip ESC */
+ if (!isdigit(uchar(news[i])))
+ luaL_putchar(b, news[i]);
+ else {
+ int level = check_capture(ms, news[i]);
+ push_onecapture(ms, level);
+ luaL_addvalue(b); /* add capture to accumulated result */
+ }
+ }
+ }
+ }
+ else { /* is a function */
+ int n;
+ lua_pushvalue(L, 3);
+ n = push_captures(ms, s, e);
+ lua_call(L, n, 1);
+ if (lua_isstring(L, -1))
+ luaL_addvalue(b); /* add return to accumulated result */
+ else
+ lua_pop(L, 1); /* function result is not a string: pop it */
+ }
+}
+
+
+static int str_gsub (lua_State *L) {
+ size_t srcl;
+ const char *src = luaL_checklstring(L, 1, &srcl);
+ const char *p = luaL_checkstring(L, 2);
+ int max_s = luaL_optint(L, 4, srcl+1);
+ int anchor = (*p == '^') ? (p++, 1) : 0;
+ int n = 0;
+ MatchState ms;
+ luaL_Buffer b;
+ luaL_argcheck(L,
+ lua_gettop(L) >= 3 && (lua_isstring(L, 3) || lua_isfunction(L, 3)),
+ 3, "string or function expected");
+ luaL_buffinit(L, &b);
+ ms.L = L;
+ ms.src_init = src;
+ ms.src_end = src+srcl;
+ while (n < max_s) {
+ const char *e;
+ ms.level = 0;
+ e = match(&ms, src, p);
+ if (e) {
+ n++;
+ add_s(&ms, &b, src, e);
+ }
+ if (e && e>src) /* non empty match? */
+ src = e; /* skip it */
+ else if (src < ms.src_end)
+ luaL_putchar(&b, *src++);
+ else break;
+ if (anchor) break;
+ }
+ luaL_addlstring(&b, src, ms.src_end-src);
+ luaL_pushresult(&b);
+ lua_pushnumber(L, (lua_Number)n); /* number of substitutions */
+ return 2;
+}
+
+/* }====================================================== */
+
+
+/* maximum size of each formatted item (> len(format('%99.99f', -1e308))) */
+#define MAX_ITEM 512
+/* maximum size of each format specification (such as '%-099.99d') */
+#define MAX_FORMAT 20
+
+
+static void luaI_addquoted (lua_State *L, luaL_Buffer *b, int arg) {
+ size_t l;
+ const char *s = luaL_checklstring(L, arg, &l);
+ luaL_putchar(b, '"');
+ while (l--) {
+ switch (*s) {
+ case '"': case '\\': case '\n': {
+ luaL_putchar(b, '\\');
+ luaL_putchar(b, *s);
+ break;
+ }
+ case '\0': {
+ luaL_addlstring(b, "\\000", 4);
+ break;
+ }
+ default: {
+ luaL_putchar(b, *s);
+ break;
+ }
+ }
+ s++;
+ }
+ luaL_putchar(b, '"');
+}
+
+
+static const char *scanformat (lua_State *L, const char *strfrmt,
+ char *form, int *hasprecision) {
+ const char *p = strfrmt;
+ while (strchr("-+ #0", *p)) p++; /* skip flags */
+ if (isdigit(uchar(*p))) p++; /* skip width */
+ if (isdigit(uchar(*p))) p++; /* (2 digits at most) */
+ if (*p == '.') {
+ p++;
+ *hasprecision = 1;
+ if (isdigit(uchar(*p))) p++; /* skip precision */
+ if (isdigit(uchar(*p))) p++; /* (2 digits at most) */
+ }
+ if (isdigit(uchar(*p)))
+ luaL_error(L, "invalid format (width or precision too long)");
+ if (p-strfrmt+2 > MAX_FORMAT) /* +2 to include `%' and the specifier */
+ luaL_error(L, "invalid format (too long)");
+ form[0] = '%';
+ strncpy(form+1, strfrmt, p-strfrmt+1);
+ form[p-strfrmt+2] = 0;
+ return p;
+}
+
+
+static int str_format (lua_State *L) {
+ int arg = 1;
+ size_t sfl;
+ const char *strfrmt = luaL_checklstring(L, arg, &sfl);
+ const char *strfrmt_end = strfrmt+sfl;
+ luaL_Buffer b;
+ luaL_buffinit(L, &b);
+ while (strfrmt < strfrmt_end) {
+ if (*strfrmt != '%')
+ luaL_putchar(&b, *strfrmt++);
+ else if (*++strfrmt == '%')
+ luaL_putchar(&b, *strfrmt++); /* %% */
+ else { /* format item */
+ char form[MAX_FORMAT]; /* to store the format (`%...') */
+ char buff[MAX_ITEM]; /* to store the formatted item */
+ int hasprecision = 0;
+ if (isdigit(uchar(*strfrmt)) && *(strfrmt+1) == '$')
+ return luaL_error(L, "obsolete option (d$) to `format'");
+ arg++;
+ strfrmt = scanformat(L, strfrmt, form, &hasprecision);
+ switch (*strfrmt++) {
+ case 'c': case 'd': case 'i': {
+ sprintf(buff, form, luaL_checkint(L, arg));
+ break;
+ }
+ case 'o': case 'u': case 'x': case 'X': {
+ sprintf(buff, form, (unsigned int)(luaL_checknumber(L, arg)));
+ break;
+ }
+ case 'e': case 'E': case 'f':
+ case 'g': case 'G': {
+ sprintf(buff, form, luaL_checknumber(L, arg));
+ break;
+ }
+ case 'q': {
+ luaI_addquoted(L, &b, arg);
+ continue; /* skip the `addsize' at the end */
+ }
+ case 's': {
+ size_t l;
+ const char *s = luaL_checklstring(L, arg, &l);
+ if (!hasprecision && l >= 100) {
+ /* no precision and string is too long to be formatted;
+ keep original string */
+ lua_pushvalue(L, arg);
+ luaL_addvalue(&b);
+ continue; /* skip the `addsize' at the end */
+ }
+ else {
+ sprintf(buff, form, s);
+ break;
+ }
+ }
+ default: { /* also treat cases `pnLlh' */
+ return luaL_error(L, "invalid option to `format'");
+ }
+ }
+ luaL_addlstring(&b, buff, strlen(buff));
+ }
+ }
+ luaL_pushresult(&b);
+ return 1;
+}
+
+
+static const luaL_reg strlib[] = {
+ {"len", str_len},
+ {"sub", str_sub},
+ {"lower", str_lower},
+ {"upper", str_upper},
+ {"char", str_char},
+ {"rep", str_rep},
+ {"byte", str_byte},
+ {"format", str_format},
+ {"dump", str_dump},
+ {"find", str_find},
+ {"gfind", gfind},
+ {"gsub", str_gsub},
+ {NULL, NULL}
+};
+
+
+/*
+** Open string library
+*/
+LUALIB_API int luaopen_string (lua_State *L) {
+ luaL_openlib(L, LUA_STRLIBNAME, strlib, 0);
+ return 1;
+}
+
--- /dev/null
+/*
+** $Id: ltablib.c,v 1.21 2003/04/03 13:35:34 roberto Exp $
+** Library for Table Manipulation
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stddef.h>
+
+#define ltablib_c
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+#define aux_getn(L,n) (luaL_checktype(L, n, LUA_TTABLE), luaL_getn(L, n))
+
+
+static int luaB_foreachi (lua_State *L) {
+ int i;
+ int n = aux_getn(L, 1);
+ luaL_checktype(L, 2, LUA_TFUNCTION);
+ for (i=1; i<=n; i++) {
+ lua_pushvalue(L, 2); /* function */
+ lua_pushnumber(L, (lua_Number)i); /* 1st argument */
+ lua_rawgeti(L, 1, i); /* 2nd argument */
+ lua_call(L, 2, 1);
+ if (!lua_isnil(L, -1))
+ return 1;
+ lua_pop(L, 1); /* remove nil result */
+ }
+ return 0;
+}
+
+
+static int luaB_foreach (lua_State *L) {
+ luaL_checktype(L, 1, LUA_TTABLE);
+ luaL_checktype(L, 2, LUA_TFUNCTION);
+ lua_pushnil(L); /* first key */
+ for (;;) {
+ if (lua_next(L, 1) == 0)
+ return 0;
+ lua_pushvalue(L, 2); /* function */
+ lua_pushvalue(L, -3); /* key */
+ lua_pushvalue(L, -3); /* value */
+ lua_call(L, 2, 1);
+ if (!lua_isnil(L, -1))
+ return 1;
+ lua_pop(L, 2); /* remove value and result */
+ }
+}
+
+
+static int luaB_getn (lua_State *L) {
+ lua_pushnumber(L, (lua_Number)aux_getn(L, 1));
+ return 1;
+}
+
+
+static int luaB_setn (lua_State *L) {
+ luaL_checktype(L, 1, LUA_TTABLE);
+ luaL_setn(L, 1, luaL_checkint(L, 2));
+ return 0;
+}
+
+
+static int luaB_tinsert (lua_State *L) {
+ int v = lua_gettop(L); /* number of arguments */
+ int n = aux_getn(L, 1) + 1;
+ int pos; /* where to insert new element */
+ if (v == 2) /* called with only 2 arguments */
+ pos = n; /* insert new element at the end */
+ else {
+ pos = luaL_checkint(L, 2); /* 2nd argument is the position */
+ if (pos > n) n = pos; /* `grow' array if necessary */
+ v = 3; /* function may be called with more than 3 args */
+ }
+ luaL_setn(L, 1, n); /* new size */
+ while (--n >= pos) { /* move up elements */
+ lua_rawgeti(L, 1, n);
+ lua_rawseti(L, 1, n+1); /* t[n+1] = t[n] */
+ }
+ lua_pushvalue(L, v);
+ lua_rawseti(L, 1, pos); /* t[pos] = v */
+ return 0;
+}
+
+
+static int luaB_tremove (lua_State *L) {
+ int n = aux_getn(L, 1);
+ int pos = luaL_optint(L, 2, n);
+ if (n <= 0) return 0; /* table is `empty' */
+ luaL_setn(L, 1, n-1); /* t.n = n-1 */
+ lua_rawgeti(L, 1, pos); /* result = t[pos] */
+ for ( ;pos<n; pos++) {
+ lua_rawgeti(L, 1, pos+1);
+ lua_rawseti(L, 1, pos); /* t[pos] = t[pos+1] */
+ }
+ lua_pushnil(L);
+ lua_rawseti(L, 1, n); /* t[n] = nil */
+ return 1;
+}
+
+
+static int str_concat (lua_State *L) {
+ luaL_Buffer b;
+ size_t lsep;
+ const char *sep = luaL_optlstring(L, 2, "", &lsep);
+ int i = luaL_optint(L, 3, 1);
+ int n = luaL_optint(L, 4, 0);
+ luaL_checktype(L, 1, LUA_TTABLE);
+ if (n == 0) n = luaL_getn(L, 1);
+ luaL_buffinit(L, &b);
+ for (; i <= n; i++) {
+ lua_rawgeti(L, 1, i);
+ luaL_argcheck(L, lua_isstring(L, -1), 1, "table contains non-strings");
+ luaL_addvalue(&b);
+ if (i != n)
+ luaL_addlstring(&b, sep, lsep);
+ }
+ luaL_pushresult(&b);
+ return 1;
+}
+
+
+
+/*
+** {======================================================
+** Quicksort
+** (based on `Algorithms in MODULA-3', Robert Sedgewick;
+** Addison-Wesley, 1993.)
+*/
+
+
+static void set2 (lua_State *L, int i, int j) {
+ lua_rawseti(L, 1, i);
+ lua_rawseti(L, 1, j);
+}
+
+static int sort_comp (lua_State *L, int a, int b) {
+ if (!lua_isnil(L, 2)) { /* function? */
+ int res;
+ lua_pushvalue(L, 2);
+ 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);
+ res = lua_toboolean(L, -1);
+ lua_pop(L, 1);
+ return res;
+ }
+ else /* a < b? */
+ return lua_lessthan(L, a, b);
+}
+
+static void auxsort (lua_State *L, int l, int u) {
+ while (l < u) { /* for tail recursion */
+ int i, j;
+ /* sort elements a[l], a[(l+u)/2] and a[u] */
+ lua_rawgeti(L, 1, l);
+ lua_rawgeti(L, 1, u);
+ if (sort_comp(L, -1, -2)) /* a[u] < a[l]? */
+ set2(L, l, u); /* swap a[l] - a[u] */
+ else
+ lua_pop(L, 2);
+ if (u-l == 1) break; /* only 2 elements */
+ i = (l+u)/2;
+ lua_rawgeti(L, 1, i);
+ lua_rawgeti(L, 1, l);
+ if (sort_comp(L, -2, -1)) /* a[i]<a[l]? */
+ set2(L, i, l);
+ else {
+ lua_pop(L, 1); /* remove a[l] */
+ lua_rawgeti(L, 1, u);
+ if (sort_comp(L, -1, -2)) /* a[u]<a[i]? */
+ set2(L, i, u);
+ else
+ lua_pop(L, 2);
+ }
+ if (u-l == 2) break; /* only 3 elements */
+ lua_rawgeti(L, 1, i); /* Pivot */
+ lua_pushvalue(L, -1);
+ lua_rawgeti(L, 1, u-1);
+ set2(L, i, u-1);
+ /* a[l] <= P == a[u-1] <= a[u], only need to sort from l+1 to u-2 */
+ i = l; j = u-1;
+ for (;;) { /* invariant: a[l..i] <= P <= a[j..u] */
+ /* repeat ++i until a[i] >= P */
+ while (lua_rawgeti(L, 1, ++i), sort_comp(L, -1, -2)) {
+ if (i>u) luaL_error(L, "invalid order function for sorting");
+ lua_pop(L, 1); /* remove a[i] */
+ }
+ /* repeat --j until a[j] <= P */
+ while (lua_rawgeti(L, 1, --j), sort_comp(L, -3, -1)) {
+ if (j<l) luaL_error(L, "invalid order function for sorting");
+ lua_pop(L, 1); /* remove a[j] */
+ }
+ if (j<i) {
+ lua_pop(L, 3); /* pop pivot, a[i], a[j] */
+ break;
+ }
+ set2(L, i, j);
+ }
+ lua_rawgeti(L, 1, u-1);
+ lua_rawgeti(L, 1, i);
+ set2(L, u-1, i); /* swap pivot (a[u-1]) with a[i] */
+ /* a[l..i-1] <= a[i] == P <= a[i+1..u] */
+ /* adjust so that smaller half is in [j..i] and larger one in [l..u] */
+ if (i-l < u-i) {
+ j=l; i=i-1; l=i+2;
+ }
+ else {
+ j=i+1; i=u; u=j-2;
+ }
+ auxsort(L, j, i); /* call recursively the smaller one */
+ } /* repeat the routine for the larger one */
+}
+
+static int luaB_sort (lua_State *L) {
+ int n = aux_getn(L, 1);
+ luaL_checkstack(L, 40, ""); /* assume array is smaller than 2^40 */
+ if (!lua_isnoneornil(L, 2)) /* is there a 2nd argument? */
+ luaL_checktype(L, 2, LUA_TFUNCTION);
+ lua_settop(L, 2); /* make sure there is two arguments */
+ auxsort(L, 1, n);
+ return 0;
+}
+
+/* }====================================================== */
+
+
+static const luaL_reg tab_funcs[] = {
+ {"concat", str_concat},
+ {"foreach", luaB_foreach},
+ {"foreachi", luaB_foreachi},
+ {"getn", luaB_getn},
+ {"setn", luaB_setn},
+ {"sort", luaB_sort},
+ {"insert", luaB_tinsert},
+ {"remove", luaB_tremove},
+ {NULL, NULL}
+};
+
+
+LUALIB_API int luaopen_table (lua_State *L) {
+ luaL_openlib(L, LUA_TABLIBNAME, tab_funcs, 0);
+ return 1;
+}
+
--- /dev/null
+/*
+** $Id: llex.c,v 1.119 2003/03/24 12:39:34 roberto Exp $
+** Lexical Analyzer
+** See Copyright Notice in lua.h
+*/
+
+
+#include <ctype.h>
+#include <string.h>
+
+#define llex_c
+
+#include "lua.h"
+
+#include "ldo.h"
+#include "llex.h"
+#include "lobject.h"
+#include "lparser.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "lzio.h"
+
+
+
+#define next(LS) (LS->current = zgetc(LS->z))
+
+
+
+/* ORDER RESERVED */
+static const char *const token2string [] = {
+ "and", "break", "do", "else", "elseif",
+ "end", "false", "for", "function", "if",
+ "in", "local", "nil", "not", "or", "repeat",
+ "return", "then", "true", "until", "while", "*name",
+ "..", "...", "==", ">=", "<=", "~=",
+ "*number", "*string", "<eof>"
+};
+
+
+void luaX_init (lua_State *L) {
+ int i;
+ for (i=0; i<NUM_RESERVED; i++) {
+ TString *ts = luaS_new(L, token2string[i]);
+ luaS_fix(ts); /* reserved words are never collected */
+ lua_assert(strlen(token2string[i])+1 <= TOKEN_LEN);
+ ts->tsv.reserved = cast(lu_byte, i+1); /* reserved word */
+ }
+}
+
+
+#define MAXSRC 80
+
+
+void luaX_checklimit (LexState *ls, int val, int limit, const char *msg) {
+ if (val > limit) {
+ msg = luaO_pushfstring(ls->L, "too many %s (limit=%d)", msg, limit);
+ luaX_syntaxerror(ls, msg);
+ }
+}
+
+
+void luaX_errorline (LexState *ls, const char *s, const char *token, int line) {
+ lua_State *L = ls->L;
+ char buff[MAXSRC];
+ luaO_chunkid(buff, getstr(ls->source), MAXSRC);
+ luaO_pushfstring(L, "%s:%d: %s near `%s'", buff, line, s, token);
+ luaD_throw(L, LUA_ERRSYNTAX);
+}
+
+
+static void luaX_error (LexState *ls, const char *s, const char *token) {
+ luaX_errorline(ls, s, token, ls->linenumber);
+}
+
+
+void luaX_syntaxerror (LexState *ls, const char *msg) {
+ const char *lasttoken;
+ switch (ls->t.token) {
+ case TK_NAME:
+ lasttoken = getstr(ls->t.seminfo.ts);
+ break;
+ case TK_STRING:
+ case TK_NUMBER:
+ lasttoken = luaZ_buffer(ls->buff);
+ break;
+ default:
+ lasttoken = luaX_token2str(ls, ls->t.token);
+ break;
+ }
+ luaX_error(ls, msg, lasttoken);
+}
+
+
+const char *luaX_token2str (LexState *ls, int token) {
+ if (token < FIRST_RESERVED) {
+ lua_assert(token == (unsigned char)token);
+ return luaO_pushfstring(ls->L, "%c", token);
+ }
+ else
+ return token2string[token-FIRST_RESERVED];
+}
+
+
+static void luaX_lexerror (LexState *ls, const char *s, int token) {
+ if (token == TK_EOS)
+ luaX_error(ls, s, luaX_token2str(ls, token));
+ else
+ luaX_error(ls, s, luaZ_buffer(ls->buff));
+}
+
+
+static void inclinenumber (LexState *LS) {
+ next(LS); /* skip `\n' */
+ ++LS->linenumber;
+ luaX_checklimit(LS, LS->linenumber, MAX_INT, "lines in a chunk");
+}
+
+
+void luaX_setinput (lua_State *L, LexState *LS, ZIO *z, TString *source) {
+ LS->L = L;
+ LS->lookahead.token = TK_EOS; /* no look-ahead token */
+ LS->z = z;
+ LS->fs = NULL;
+ LS->linenumber = 1;
+ LS->lastline = 1;
+ LS->source = source;
+ next(LS); /* read first char */
+ if (LS->current == '#') {
+ do { /* skip first line */
+ next(LS);
+ } while (LS->current != '\n' && LS->current != EOZ);
+ }
+}
+
+
+
+/*
+** =======================================================
+** LEXICAL ANALYZER
+** =======================================================
+*/
+
+
+/* use buffer to store names, literal strings and numbers */
+
+/* extra space to allocate when growing buffer */
+#define EXTRABUFF 32
+
+/* maximum number of chars that can be read without checking buffer size */
+#define MAXNOCHECK 5
+
+#define checkbuffer(LS, len) \
+ if (((len)+MAXNOCHECK)*sizeof(char) > luaZ_sizebuffer((LS)->buff)) \
+ luaZ_openspace((LS)->L, (LS)->buff, (len)+EXTRABUFF)
+
+#define save(LS, c, l) \
+ (luaZ_buffer((LS)->buff)[l++] = cast(char, c))
+#define save_and_next(LS, l) (save(LS, LS->current, l), next(LS))
+
+
+static size_t readname (LexState *LS) {
+ size_t l = 0;
+ checkbuffer(LS, l);
+ do {
+ checkbuffer(LS, l);
+ save_and_next(LS, l);
+ } while (isalnum(LS->current) || LS->current == '_');
+ save(LS, '\0', l);
+ return l-1;
+}
+
+
+/* LUA_NUMBER */
+static void read_numeral (LexState *LS, int comma, SemInfo *seminfo) {
+ size_t l = 0;
+ checkbuffer(LS, l);
+ if (comma) save(LS, '.', l);
+ while (isdigit(LS->current)) {
+ checkbuffer(LS, l);
+ save_and_next(LS, l);
+ }
+ if (LS->current == '.') {
+ save_and_next(LS, l);
+ if (LS->current == '.') {
+ save_and_next(LS, l);
+ save(LS, '\0', l);
+ luaX_lexerror(LS,
+ "ambiguous syntax (decimal point x string concatenation)",
+ TK_NUMBER);
+ }
+ }
+ while (isdigit(LS->current)) {
+ checkbuffer(LS, l);
+ save_and_next(LS, l);
+ }
+ if (LS->current == 'e' || LS->current == 'E') {
+ save_and_next(LS, l); /* read `E' */
+ if (LS->current == '+' || LS->current == '-')
+ save_and_next(LS, l); /* optional exponent sign */
+ while (isdigit(LS->current)) {
+ checkbuffer(LS, l);
+ save_and_next(LS, l);
+ }
+ }
+ save(LS, '\0', l);
+ if (!luaO_str2d(luaZ_buffer(LS->buff), &seminfo->r))
+ luaX_lexerror(LS, "malformed number", TK_NUMBER);
+}
+
+
+static void read_long_string (LexState *LS, SemInfo *seminfo) {
+ int cont = 0;
+ size_t l = 0;
+ checkbuffer(LS, l);
+ save(LS, '[', l); /* save first `[' */
+ save_and_next(LS, l); /* pass the second `[' */
+ if (LS->current == '\n') /* string starts with a newline? */
+ inclinenumber(LS); /* skip it */
+ for (;;) {
+ checkbuffer(LS, l);
+ switch (LS->current) {
+ case EOZ:
+ save(LS, '\0', l);
+ luaX_lexerror(LS, (seminfo) ? "unfinished long string" :
+ "unfinished long comment", TK_EOS);
+ break; /* to avoid warnings */
+ case '[':
+ save_and_next(LS, l);
+ if (LS->current == '[') {
+ cont++;
+ save_and_next(LS, l);
+ }
+ continue;
+ case ']':
+ save_and_next(LS, l);
+ if (LS->current == ']') {
+ if (cont == 0) goto endloop;
+ cont--;
+ save_and_next(LS, l);
+ }
+ continue;
+ case '\n':
+ save(LS, '\n', l);
+ inclinenumber(LS);
+ if (!seminfo) l = 0; /* reset buffer to avoid wasting space */
+ continue;
+ default:
+ save_and_next(LS, l);
+ }
+ } endloop:
+ save_and_next(LS, l); /* skip the second `]' */
+ save(LS, '\0', l);
+ if (seminfo)
+ seminfo->ts = luaS_newlstr(LS->L, luaZ_buffer(LS->buff) + 2, l - 5);
+}
+
+
+static void read_string (LexState *LS, int del, SemInfo *seminfo) {
+ size_t l = 0;
+ checkbuffer(LS, l);
+ save_and_next(LS, l);
+ while (LS->current != del) {
+ checkbuffer(LS, l);
+ switch (LS->current) {
+ case EOZ:
+ save(LS, '\0', l);
+ luaX_lexerror(LS, "unfinished string", TK_EOS);
+ break; /* to avoid warnings */
+ case '\n':
+ save(LS, '\0', l);
+ luaX_lexerror(LS, "unfinished string", TK_STRING);
+ break; /* to avoid warnings */
+ case '\\':
+ next(LS); /* do not save the `\' */
+ switch (LS->current) {
+ case 'a': save(LS, '\a', l); next(LS); break;
+ case 'b': save(LS, '\b', l); next(LS); break;
+ case 'f': save(LS, '\f', l); next(LS); break;
+ case 'n': save(LS, '\n', l); next(LS); break;
+ case 'r': save(LS, '\r', l); next(LS); break;
+ case 't': save(LS, '\t', l); next(LS); break;
+ case 'v': save(LS, '\v', l); next(LS); break;
+ case '\n': save(LS, '\n', l); inclinenumber(LS); break;
+ case EOZ: break; /* will raise an error next loop */
+ default: {
+ if (!isdigit(LS->current))
+ save_and_next(LS, l); /* handles \\, \", \', and \? */
+ else { /* \xxx */
+ int c = 0;
+ int i = 0;
+ do {
+ c = 10*c + (LS->current-'0');
+ next(LS);
+ } while (++i<3 && isdigit(LS->current));
+ if (c > UCHAR_MAX) {
+ save(LS, '\0', l);
+ luaX_lexerror(LS, "escape sequence too large", TK_STRING);
+ }
+ save(LS, c, l);
+ }
+ }
+ }
+ break;
+ default:
+ save_and_next(LS, l);
+ }
+ }
+ save_and_next(LS, l); /* skip delimiter */
+ save(LS, '\0', l);
+ seminfo->ts = luaS_newlstr(LS->L, luaZ_buffer(LS->buff) + 1, l - 3);
+}
+
+
+int luaX_lex (LexState *LS, SemInfo *seminfo) {
+ for (;;) {
+ switch (LS->current) {
+
+ case '\n': {
+ inclinenumber(LS);
+ continue;
+ }
+ case '-': {
+ next(LS);
+ if (LS->current != '-') return '-';
+ /* else is a comment */
+ next(LS);
+ if (LS->current == '[' && (next(LS), LS->current == '['))
+ read_long_string(LS, NULL); /* long comment */
+ else /* short comment */
+ while (LS->current != '\n' && LS->current != EOZ)
+ next(LS);
+ continue;
+ }
+ case '[': {
+ next(LS);
+ if (LS->current != '[') return '[';
+ else {
+ read_long_string(LS, seminfo);
+ return TK_STRING;
+ }
+ }
+ case '=': {
+ next(LS);
+ if (LS->current != '=') return '=';
+ else { next(LS); return TK_EQ; }
+ }
+ case '<': {
+ next(LS);
+ if (LS->current != '=') return '<';
+ else { next(LS); return TK_LE; }
+ }
+ case '>': {
+ next(LS);
+ if (LS->current != '=') return '>';
+ else { next(LS); return TK_GE; }
+ }
+ case '~': {
+ next(LS);
+ if (LS->current != '=') return '~';
+ else { next(LS); return TK_NE; }
+ }
+ case '"':
+ case '\'': {
+ read_string(LS, LS->current, seminfo);
+ return TK_STRING;
+ }
+ case '.': {
+ next(LS);
+ if (LS->current == '.') {
+ next(LS);
+ if (LS->current == '.') {
+ next(LS);
+ return TK_DOTS; /* ... */
+ }
+ else return TK_CONCAT; /* .. */
+ }
+ else if (!isdigit(LS->current)) return '.';
+ else {
+ read_numeral(LS, 1, seminfo);
+ return TK_NUMBER;
+ }
+ }
+ case EOZ: {
+ return TK_EOS;
+ }
+ default: {
+ if (isspace(LS->current)) {
+ next(LS);
+ continue;
+ }
+ else if (isdigit(LS->current)) {
+ read_numeral(LS, 0, seminfo);
+ return TK_NUMBER;
+ }
+ else if (isalpha(LS->current) || LS->current == '_') {
+ /* identifier or reserved word */
+ size_t l = readname(LS);
+ TString *ts = luaS_newlstr(LS->L, luaZ_buffer(LS->buff), l);
+ if (ts->tsv.reserved > 0) /* reserved word? */
+ return ts->tsv.reserved - 1 + FIRST_RESERVED;
+ seminfo->ts = ts;
+ return TK_NAME;
+ }
+ else {
+ int c = LS->current;
+ if (iscntrl(c))
+ luaX_error(LS, "invalid control char",
+ luaO_pushfstring(LS->L, "char(%d)", c));
+ next(LS);
+ return c; /* single-char tokens (+ - / ...) */
+ }
+ }
+ }
+ }
+}
+
+#undef next
--- /dev/null
+/*
+** $Id: llex.h,v 1.47 2003/02/28 17:19:47 roberto Exp $
+** Lexical Analyzer
+** See Copyright Notice in lua.h
+*/
+
+#ifndef llex_h
+#define llex_h
+
+#include "lobject.h"
+#include "lzio.h"
+
+
+#define FIRST_RESERVED 257
+
+/* maximum length of a reserved word */
+#define TOKEN_LEN (sizeof("function")/sizeof(char))
+
+
+/*
+* 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_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_NAME, TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, TK_NUMBER,
+ TK_STRING, TK_EOS
+};
+
+/* number of reserved words */
+#define NUM_RESERVED (cast(int, TK_WHILE-FIRST_RESERVED+1))
+
+
+typedef union {
+ lua_Number r;
+ TString *ts;
+} SemInfo; /* semantics information */
+
+
+typedef struct Token {
+ int token;
+ SemInfo seminfo;
+} Token;
+
+
+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; /* `FuncState' is private to the parser */
+ struct lua_State *L;
+ ZIO *z; /* input stream */
+ Mbuffer *buff; /* buffer for tokens */
+ TString *source; /* current source name */
+ int nestlevel; /* level of nested non-terminals */
+} LexState;
+
+
+void luaX_init (lua_State *L);
+void luaX_setinput (lua_State *L, LexState *LS, ZIO *z, TString *source);
+int luaX_lex (LexState *LS, SemInfo *seminfo);
+void luaX_checklimit (LexState *ls, int val, int limit, const char *msg);
+void luaX_syntaxerror (LexState *ls, const char *s);
+void luaX_errorline (LexState *ls, const char *s, const char *token, int line);
+const char *luaX_token2str (LexState *ls, int token);
+
+
+#endif
--- /dev/null
+/*
+** $Id: llimits.h,v 1.52 2003/02/20 19:33:23 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"
+
+
+/*
+** try to find number of bits in an integer
+*/
+#ifndef BITS_INT
+/* avoid overflows in comparison */
+#if INT_MAX-20 < 32760
+#define BITS_INT 16
+#else
+#if INT_MAX > 2147483640L
+/* machine has at least 32 bits */
+#define BITS_INT 32
+#else
+#error "you must define BITS_INT with number of bits in an integer"
+#endif
+#endif
+#endif
+
+
+/*
+** the following types define integer types for values that may not
+** fit in a `small int' (16 bits), but may waste space in a
+** `large long' (64 bits). The current definitions should work in
+** any machine, but may not be optimal.
+*/
+
+/* an unsigned integer to hold hash values */
+typedef unsigned int lu_hash;
+/* its signed equivalent */
+typedef int ls_hash;
+
+/* an unsigned integer big enough to count the total memory used by Lua; */
+/* it should be at least as large as size_t */
+typedef unsigned long lu_mem;
+
+#define MAX_LUMEM ULONG_MAX
+
+
+/* an integer big enough to count the number of strings in use */
+typedef long ls_nstr;
+
+/* chars used as small naturals (so that `char' is reserved for characters) */
+typedef unsigned char lu_byte;
+
+
+#define MAX_SIZET ((size_t)(~(size_t)0)-2)
+
+
+#define MAX_INT (INT_MAX-2) /* maximum value of an int (-2 for safety) */
+
+/*
+** conversion of pointer to integer
+** this is for hashing only; there is no problem if the integer
+** cannot hold the whole pointer value
+*/
+#define IntPoint(p) ((lu_hash)(p))
+
+
+
+/* type to ensure maximum alignment */
+#ifndef LUSER_ALIGNMENT_T
+typedef union { double u; void *s; long l; } L_Umaxalign;
+#else
+typedef LUSER_ALIGNMENT_T L_Umaxalign;
+#endif
+
+
+/* result of `usual argument conversion' over lua_Number */
+#ifndef LUA_UACNUMBER
+typedef double l_uacNumber;
+#else
+typedef LUA_UACNUMBER l_uacNumber;
+#endif
+
+
+#ifndef lua_assert
+#define lua_assert(c) /* empty */
+#endif
+
+
+#ifndef check_exp
+#define check_exp(c,e) (e)
+#endif
+
+
+#ifndef UNUSED
+#define UNUSED(x) ((void)(x)) /* to avoid warnings */
+#endif
+
+
+#ifndef cast
+#define cast(t, exp) ((t)(exp))
+#endif
+
+
+
+/*
+** type for virtual-machine instructions
+** must be an unsigned with (at least) 4 bytes (see details in lopcodes.h)
+*/
+typedef unsigned long Instruction;
+
+
+/* maximum depth for calls (unsigned short) */
+#ifndef LUA_MAXCALLS
+#define LUA_MAXCALLS 4096
+#endif
+
+
+/*
+** maximum depth for C calls (unsigned short): Not too big, or may
+** overflow the C stack...
+*/
+
+#ifndef LUA_MAXCCALLS
+#define LUA_MAXCCALLS 200
+#endif
+
+
+/* maximum size for the C stack */
+#ifndef LUA_MAXCSTACK
+#define LUA_MAXCSTACK 2048
+#endif
+
+
+/* maximum stack for a Lua function */
+#define MAXSTACK 250
+
+
+/* maximum number of variables declared in a function */
+#ifndef MAXVARS
+#define MAXVARS 200 /* arbitrary limit (<MAXSTACK) */
+#endif
+
+
+/* maximum number of upvalues per function */
+#ifndef MAXUPVALUES
+#define MAXUPVALUES 32
+#endif
+
+
+/* maximum number of parameters in a function */
+#ifndef MAXPARAMS
+#define MAXPARAMS 100 /* arbitrary limit (<MAXLOCALS) */
+#endif
+
+
+/* minimum size for the string table (must be power of 2) */
+#ifndef MINSTRTABSIZE
+#define MINSTRTABSIZE 32
+#endif
+
+
+/* minimum size for string buffer */
+#ifndef LUA_MINBUFFER
+#define LUA_MINBUFFER 32
+#endif
+
+
+/*
+** maximum number of syntactical nested non-terminals: Not too big,
+** or may overflow the C stack...
+*/
+#ifndef LUA_MAXPARSERLEVEL
+#define LUA_MAXPARSERLEVEL 200
+#endif
+
+
+#endif
--- /dev/null
+/*
+** $Id: lmem.c,v 1.61 2002/12/04 17:38:31 roberto Exp $
+** Interface to Memory Manager
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdlib.h>
+
+#define lmem_c
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+
+
+
+/*
+** definition for realloc function. It must assure that l_realloc(NULL,
+** 0, x) allocates a new block (ANSI C assures that). (`os' is the old
+** block size; some allocators may use that.)
+*/
+#ifndef l_realloc
+#define l_realloc(b,os,s) realloc(b,s)
+#endif
+
+/*
+** definition for free function. (`os' is the old block size; some
+** allocators may use that.)
+*/
+#ifndef l_free
+#define l_free(b,os) free(b)
+#endif
+
+
+#define MINSIZEARRAY 4
+
+
+void *luaM_growaux (lua_State *L, void *block, int *size, int size_elems,
+ int limit, const char *errormsg) {
+ void *newblock;
+ int newsize = (*size)*2;
+ if (newsize < MINSIZEARRAY)
+ newsize = MINSIZEARRAY; /* minimum size */
+ else if (*size >= limit/2) { /* cannot double it? */
+ if (*size < limit - MINSIZEARRAY) /* try something smaller... */
+ newsize = limit; /* still have at least MINSIZEARRAY free places */
+ else luaG_runerror(L, errormsg);
+ }
+ newblock = luaM_realloc(L, block,
+ cast(lu_mem, *size)*cast(lu_mem, size_elems),
+ cast(lu_mem, newsize)*cast(lu_mem, size_elems));
+ *size = newsize; /* update only when everything else is OK */
+ return newblock;
+}
+
+
+/*
+** generic allocation routine.
+*/
+void *luaM_realloc (lua_State *L, void *block, lu_mem oldsize, lu_mem size) {
+ lua_assert((oldsize == 0) == (block == NULL));
+ if (size == 0) {
+ if (block != NULL) {
+ l_free(block, oldsize);
+ block = NULL;
+ }
+ else return NULL; /* avoid `nblocks' computations when oldsize==size==0 */
+ }
+ else if (size >= MAX_SIZET)
+ luaG_runerror(L, "memory allocation error: block too big");
+ else {
+ block = l_realloc(block, oldsize, size);
+ if (block == NULL) {
+ if (L)
+ luaD_throw(L, LUA_ERRMEM);
+ else return NULL; /* error before creating state! */
+ }
+ }
+ if (L) {
+ lua_assert(G(L) != NULL && G(L)->nblocks > 0);
+ G(L)->nblocks -= oldsize;
+ G(L)->nblocks += size;
+ }
+ return block;
+}
+
--- /dev/null
+/*
+** $Id: lmem.h,v 1.26 2002/05/01 20:40:42 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"
+
+#define MEMERRMSG "not enough memory"
+
+
+void *luaM_realloc (lua_State *L, void *oldblock, lu_mem oldsize, lu_mem size);
+
+void *luaM_growaux (lua_State *L, void *block, int *size, int size_elem,
+ int limit, const char *errormsg);
+
+#define luaM_free(L, b, s) luaM_realloc(L, (b), (s), 0)
+#define luaM_freelem(L, b) luaM_realloc(L, (b), sizeof(*(b)), 0)
+#define luaM_freearray(L, b, n, t) luaM_realloc(L, (b), \
+ cast(lu_mem, n)*cast(lu_mem, sizeof(t)), 0)
+
+#define luaM_malloc(L, t) luaM_realloc(L, NULL, 0, (t))
+#define luaM_new(L, t) cast(t *, luaM_malloc(L, sizeof(t)))
+#define luaM_newvector(L, n,t) cast(t *, luaM_malloc(L, \
+ cast(lu_mem, n)*cast(lu_mem, sizeof(t))))
+
+#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_realloc(L, v,cast(lu_mem, oldn)*cast(lu_mem, sizeof(t)), \
+ cast(lu_mem, n)*cast(lu_mem, sizeof(t)))))
+
+
+#endif
+
--- /dev/null
+/*
+** $Id: lobject.c,v 1.97 2003/04/03 13:35:34 roberto Exp $
+** Some generic functions over Lua objects
+** See Copyright Notice in lua.h
+*/
+
+#include <ctype.h>
+#include <stdarg.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define lobject_c
+
+#include "lua.h"
+
+#include "ldo.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "lvm.h"
+
+
+/* function to convert a string to a lua_Number */
+#ifndef lua_str2number
+#define lua_str2number(s,p) strtod((s), (p))
+#endif
+
+
+const TObject luaO_nilobject = {LUA_TNIL, {NULL}};
+
+
+/*
+** converts an integer to a "floating point byte", represented as
+** (mmmmmxxx), where the real value is (xxx) * 2^(mmmmm)
+*/
+int luaO_int2fb (unsigned int x) {
+ int m = 0; /* mantissa */
+ while (x >= (1<<3)) {
+ x = (x+1) >> 1;
+ m++;
+ }
+ return (m << 3) | cast(int, x);
+}
+
+
+int luaO_log2 (unsigned int x) {
+ static const lu_byte log_8[255] = {
+ 0,
+ 1,1,
+ 2,2,2,2,
+ 3,3,3,3,3,3,3,3,
+ 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,
+ 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,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,
+ 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,
+ 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
+ 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7
+ };
+ if (x >= 0x00010000) {
+ if (x >= 0x01000000) return log_8[((x>>24) & 0xff) - 1]+24;
+ else return log_8[((x>>16) & 0xff) - 1]+16;
+ }
+ else {
+ if (x >= 0x00000100) return log_8[((x>>8) & 0xff) - 1]+8;
+ else if (x) return log_8[(x & 0xff) - 1];
+ return -1; /* special `log' for 0 */
+ }
+}
+
+
+int luaO_rawequalObj (const TObject *t1, const TObject *t2) {
+ if (ttype(t1) != ttype(t2)) return 0;
+ else switch (ttype(t1)) {
+ case LUA_TNIL:
+ return 1;
+ case LUA_TNUMBER:
+ return nvalue(t1) == nvalue(t2);
+ case LUA_TBOOLEAN:
+ return bvalue(t1) == bvalue(t2); /* boolean true must be 1 !! */
+ case LUA_TLIGHTUSERDATA:
+ return pvalue(t1) == pvalue(t2);
+ default:
+ lua_assert(iscollectable(t1));
+ return gcvalue(t1) == gcvalue(t2);
+ }
+}
+
+
+int luaO_str2d (const char *s, lua_Number *result) {
+ char *endptr;
+ lua_Number res = lua_str2number(s, &endptr);
+ if (endptr == s) return 0; /* no conversion */
+ while (isspace((unsigned char)(*endptr))) endptr++;
+ if (*endptr != '\0') return 0; /* invalid trailing characters? */
+ *result = res;
+ return 1;
+}
+
+
+
+static void pushstr (lua_State *L, const char *str) {
+ setsvalue2s(L->top, luaS_new(L, str));
+ incr_top(L);
+}
+
+
+/* this function handles only `%d', `%c', %f, and `%s' formats */
+const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) {
+ int n = 1;
+ pushstr(L, "");
+ for (;;) {
+ const char *e = strchr(fmt, '%');
+ if (e == NULL) break;
+ setsvalue2s(L->top, luaS_newlstr(L, fmt, e-fmt));
+ incr_top(L);
+ switch (*(e+1)) {
+ case 's':
+ pushstr(L, va_arg(argp, char *));
+ break;
+ case 'c': {
+ char buff[2];
+ buff[0] = cast(char, va_arg(argp, int));
+ buff[1] = '\0';
+ pushstr(L, buff);
+ break;
+ }
+ case 'd':
+ setnvalue(L->top, cast(lua_Number, va_arg(argp, int)));
+ incr_top(L);
+ break;
+ case 'f':
+ setnvalue(L->top, cast(lua_Number, va_arg(argp, l_uacNumber)));
+ incr_top(L);
+ break;
+ case '%':
+ pushstr(L, "%");
+ break;
+ default: lua_assert(0);
+ }
+ n += 2;
+ fmt = e+2;
+ }
+ pushstr(L, fmt);
+ luaV_concat(L, n+1, L->top - L->base - 1);
+ L->top -= n;
+ 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;
+}
+
+
+void luaO_chunkid (char *out, const char *source, int bufflen) {
+ if (*source == '=') {
+ strncpy(out, source+1, bufflen); /* remove first char */
+ out[bufflen-1] = '\0'; /* ensures null termination */
+ }
+ else { /* out = "source", or "...source" */
+ if (*source == '@') {
+ int l;
+ source++; /* skip the `@' */
+ bufflen -= sizeof(" `...' ");
+ l = strlen(source);
+ strcpy(out, "");
+ if (l>bufflen) {
+ source += (l-bufflen); /* get last part of file name */
+ strcat(out, "...");
+ }
+ strcat(out, source);
+ }
+ else { /* out = [string "string"] */
+ int len = strcspn(source, "\n"); /* stop at first newline */
+ bufflen -= sizeof(" [string \"...\"] ");
+ if (len > bufflen) len = bufflen;
+ strcpy(out, "[string \"");
+ if (source[len] != '\0') { /* must truncate? */
+ strncat(out, source, len);
+ strcat(out, "...");
+ }
+ else
+ strcat(out, source);
+ strcat(out, "\"]");
+ }
+ }
+}
--- /dev/null
+/*
+** $Id: lobject.h,v 1.159 2003/03/18 12:50:04 roberto Exp $
+** Type definitions for Lua objects
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lobject_h
+#define lobject_h
+
+
+#include "llimits.h"
+#include "lua.h"
+
+
+/* tags for values visible from Lua */
+#define NUM_TAGS LUA_TTHREAD
+
+
+/*
+** Extra tags for non-values
+*/
+#define LUA_TPROTO (NUM_TAGS+1)
+#define LUA_TUPVAL (NUM_TAGS+2)
+
+
+/*
+** Union of all collectable objects
+*/
+typedef union 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 header in struct form
+*/
+typedef struct GCheader {
+ CommonHeader;
+} GCheader;
+
+
+
+
+/*
+** Union of all Lua values
+*/
+typedef union {
+ GCObject *gc;
+ void *p;
+ lua_Number n;
+ int b;
+} Value;
+
+
+/*
+** Lua values (or `tagged objects')
+*/
+typedef struct lua_TObject {
+ int tt;
+ Value value;
+} TObject;
+
+
+/* Macros to test type */
+#define ttisnil(o) (ttype(o) == LUA_TNIL)
+#define ttisnumber(o) (ttype(o) == LUA_TNUMBER)
+#define ttisstring(o) (ttype(o) == LUA_TSTRING)
+#define ttistable(o) (ttype(o) == LUA_TTABLE)
+#define ttisfunction(o) (ttype(o) == LUA_TFUNCTION)
+#define ttisboolean(o) (ttype(o) == LUA_TBOOLEAN)
+#define ttisuserdata(o) (ttype(o) == LUA_TUSERDATA)
+#define ttisthread(o) (ttype(o) == LUA_TTHREAD)
+#define ttislightuserdata(o) (ttype(o) == LUA_TLIGHTUSERDATA)
+
+/* Macros to access values */
+#define ttype(o) ((o)->tt)
+#define gcvalue(o) check_exp(iscollectable(o), (o)->value.gc)
+#define pvalue(o) check_exp(ttislightuserdata(o), (o)->value.p)
+#define nvalue(o) check_exp(ttisnumber(o), (o)->value.n)
+#define tsvalue(o) check_exp(ttisstring(o), &(o)->value.gc->ts)
+#define uvalue(o) check_exp(ttisuserdata(o), &(o)->value.gc->u)
+#define clvalue(o) check_exp(ttisfunction(o), &(o)->value.gc->cl)
+#define hvalue(o) check_exp(ttistable(o), &(o)->value.gc->h)
+#define bvalue(o) check_exp(ttisboolean(o), (o)->value.b)
+#define thvalue(o) check_exp(ttisthread(o), &(o)->value.gc->th)
+
+#define l_isfalse(o) (ttisnil(o) || (ttisboolean(o) && bvalue(o) == 0))
+
+/* Macros to set values */
+#define setnvalue(obj,x) \
+ { TObject *i_o=(obj); i_o->tt=LUA_TNUMBER; i_o->value.n=(x); }
+
+#define chgnvalue(obj,x) \
+ check_exp(ttype(obj)==LUA_TNUMBER, (obj)->value.n=(x))
+
+#define setpvalue(obj,x) \
+ { TObject *i_o=(obj); i_o->tt=LUA_TLIGHTUSERDATA; i_o->value.p=(x); }
+
+#define setbvalue(obj,x) \
+ { TObject *i_o=(obj); i_o->tt=LUA_TBOOLEAN; i_o->value.b=(x); }
+
+#define setsvalue(obj,x) \
+ { TObject *i_o=(obj); i_o->tt=LUA_TSTRING; \
+ i_o->value.gc=cast(GCObject *, (x)); \
+ lua_assert(i_o->value.gc->gch.tt == LUA_TSTRING); }
+
+#define setuvalue(obj,x) \
+ { TObject *i_o=(obj); i_o->tt=LUA_TUSERDATA; \
+ i_o->value.gc=cast(GCObject *, (x)); \
+ lua_assert(i_o->value.gc->gch.tt == LUA_TUSERDATA); }
+
+#define setthvalue(obj,x) \
+ { TObject *i_o=(obj); i_o->tt=LUA_TTHREAD; \
+ i_o->value.gc=cast(GCObject *, (x)); \
+ lua_assert(i_o->value.gc->gch.tt == LUA_TTHREAD); }
+
+#define setclvalue(obj,x) \
+ { TObject *i_o=(obj); i_o->tt=LUA_TFUNCTION; \
+ i_o->value.gc=cast(GCObject *, (x)); \
+ lua_assert(i_o->value.gc->gch.tt == LUA_TFUNCTION); }
+
+#define sethvalue(obj,x) \
+ { TObject *i_o=(obj); i_o->tt=LUA_TTABLE; \
+ i_o->value.gc=cast(GCObject *, (x)); \
+ lua_assert(i_o->value.gc->gch.tt == LUA_TTABLE); }
+
+#define setnilvalue(obj) ((obj)->tt=LUA_TNIL)
+
+
+
+/*
+** for internal debug only
+*/
+#define checkconsistency(obj) \
+ lua_assert(!iscollectable(obj) || (ttype(obj) == (obj)->value.gc->gch.tt))
+
+
+#define setobj(obj1,obj2) \
+ { const TObject *o2=(obj2); TObject *o1=(obj1); \
+ checkconsistency(o2); \
+ o1->tt=o2->tt; o1->value = o2->value; }
+
+
+/*
+** different types of sets, according to destination
+*/
+
+/* from stack to (same) stack */
+#define setobjs2s setobj
+/* to stack (not from same stack) */
+#define setobj2s setobj
+#define setsvalue2s setsvalue
+/* from table to same table */
+#define setobjt2t setobj
+/* to table */
+#define setobj2t setobj
+/* to new object */
+#define setobj2n setobj
+#define setsvalue2n setsvalue
+
+#define setttype(obj, tt) (ttype(obj) = (tt))
+
+
+#define iscollectable(o) (ttype(o) >= LUA_TSTRING)
+
+
+
+typedef TObject *StkId; /* index to stack elements */
+
+
+/*
+** String headers for string table
+*/
+typedef union TString {
+ L_Umaxalign dummy; /* ensures maximum alignment for strings */
+ struct {
+ CommonHeader;
+ lu_byte reserved;
+ lu_hash hash;
+ size_t len;
+ } tsv;
+} TString;
+
+
+#define getstr(ts) cast(const char *, (ts) + 1)
+#define svalue(o) getstr(tsvalue(o))
+
+
+
+typedef union Udata {
+ L_Umaxalign dummy; /* ensures maximum alignment for `local' udata */
+ struct {
+ CommonHeader;
+ struct Table *metatable;
+ size_t len;
+ } uv;
+} Udata;
+
+
+
+
+/*
+** Function Prototypes
+*/
+typedef struct Proto {
+ CommonHeader;
+ TObject *k; /* constants used by the function */
+ Instruction *code;
+ struct Proto **p; /* functions defined inside the function */
+ int *lineinfo; /* map from opcodes to source lines */
+ struct LocVar *locvars; /* information about local variables */
+ TString **upvalues; /* upvalue names */
+ TString *source;
+ int sizeupvalues;
+ int sizek; /* size of `k' */
+ int sizecode;
+ int sizelineinfo;
+ int sizep; /* size of `p' */
+ int sizelocvars;
+ int lineDefined;
+ GCObject *gclist;
+ lu_byte nups; /* number of upvalues */
+ lu_byte numparams;
+ lu_byte is_vararg;
+ lu_byte maxstacksize;
+} Proto;
+
+
+typedef struct LocVar {
+ TString *varname;
+ int startpc; /* first point where variable is active */
+ int endpc; /* first point where variable is dead */
+} LocVar;
+
+
+
+/*
+** Upvalues
+*/
+
+typedef struct UpVal {
+ CommonHeader;
+ TObject *v; /* points to stack or to its own value */
+ TObject value; /* the value (when closed) */
+} UpVal;
+
+
+/*
+** Closures
+*/
+
+#define ClosureHeader \
+ CommonHeader; lu_byte isC; lu_byte nupvalues; GCObject *gclist
+
+typedef struct CClosure {
+ ClosureHeader;
+ lua_CFunction f;
+ TObject upvalue[1];
+} CClosure;
+
+
+typedef struct LClosure {
+ ClosureHeader;
+ struct Proto *p;
+ TObject g; /* global table for this closure */
+ UpVal *upvals[1];
+} LClosure;
+
+
+typedef union Closure {
+ CClosure c;
+ LClosure l;
+} Closure;
+
+
+#define iscfunction(o) (ttype(o) == LUA_TFUNCTION && clvalue(o)->c.isC)
+#define isLfunction(o) (ttype(o) == LUA_TFUNCTION && !clvalue(o)->c.isC)
+
+
+/*
+** Tables
+*/
+
+typedef struct Node {
+ TObject i_key;
+ TObject i_val;
+ struct Node *next; /* for chaining */
+} 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 */
+ struct Table *metatable;
+ TObject *array; /* array part */
+ Node *node;
+ Node *firstfree; /* this position is free; all positions after it are full */
+ GCObject *gclist;
+ int sizearray; /* size of `array' array */
+} 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) (1<<(x))
+#define sizenode(t) (twoto((t)->lsizenode))
+
+
+
+extern const TObject luaO_nilobject;
+
+int luaO_log2 (unsigned int x);
+int luaO_int2fb (unsigned int x);
+#define fb2int(x) (((x) & 7) << ((x) >> 3))
+
+int luaO_rawequalObj (const TObject *t1, const TObject *t2);
+int luaO_str2d (const char *s, lua_Number *result);
+
+const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp);
+const char *luaO_pushfstring (lua_State *L, const char *fmt, ...);
+void luaO_chunkid (char *out, const char *source, int len);
+
+
+#endif
--- /dev/null
+/*
+** $Id: lopcodes.c,v 1.22 2002/12/04 17:38:31 roberto Exp $
+** extracted automatically from lopcodes.h by mkprint.lua
+** DO NOT EDIT
+** See Copyright Notice in lua.h
+*/
+
+
+#define lopcodes_c
+
+#include "lua.h"
+
+#include "lobject.h"
+#include "lopcodes.h"
+
+
+#ifdef LUA_OPNAMES
+
+const char *const luaP_opnames[] = {
+ "MOVE",
+ "LOADK",
+ "LOADBOOL",
+ "LOADNIL",
+ "GETUPVAL",
+ "GETGLOBAL",
+ "GETTABLE",
+ "SETGLOBAL",
+ "SETUPVAL",
+ "SETTABLE",
+ "NEWTABLE",
+ "SELF",
+ "ADD",
+ "SUB",
+ "MUL",
+ "DIV",
+ "POW",
+ "UNM",
+ "NOT",
+ "CONCAT",
+ "JMP",
+ "EQ",
+ "LT",
+ "LE",
+ "TEST",
+ "CALL",
+ "TAILCALL",
+ "RETURN",
+ "FORLOOP",
+ "TFORLOOP",
+ "TFORPREP",
+ "SETLIST",
+ "SETLISTO",
+ "CLOSE",
+ "CLOSURE"
+};
+
+#endif
+
+#define opmode(t,b,bk,ck,sa,k,m) (((t)<<OpModeT) | \
+ ((b)<<OpModeBreg) | ((bk)<<OpModeBrk) | ((ck)<<OpModeCrk) | \
+ ((sa)<<OpModesetA) | ((k)<<OpModeK) | (m))
+
+
+const lu_byte luaP_opmodes[NUM_OPCODES] = {
+/* T B Bk Ck sA K mode opcode */
+ opmode(0, 1, 0, 0, 1, 0, iABC) /* OP_MOVE */
+ ,opmode(0, 0, 0, 0, 1, 1, iABx) /* OP_LOADK */
+ ,opmode(0, 0, 0, 0, 1, 0, iABC) /* OP_LOADBOOL */
+ ,opmode(0, 1, 0, 0, 1, 0, iABC) /* OP_LOADNIL */
+ ,opmode(0, 0, 0, 0, 1, 0, iABC) /* OP_GETUPVAL */
+ ,opmode(0, 0, 0, 0, 1, 1, iABx) /* OP_GETGLOBAL */
+ ,opmode(0, 1, 0, 1, 1, 0, iABC) /* OP_GETTABLE */
+ ,opmode(0, 0, 0, 0, 0, 1, iABx) /* OP_SETGLOBAL */
+ ,opmode(0, 0, 0, 0, 0, 0, iABC) /* OP_SETUPVAL */
+ ,opmode(0, 0, 1, 1, 0, 0, iABC) /* OP_SETTABLE */
+ ,opmode(0, 0, 0, 0, 1, 0, iABC) /* OP_NEWTABLE */
+ ,opmode(0, 1, 0, 1, 1, 0, iABC) /* OP_SELF */
+ ,opmode(0, 0, 1, 1, 1, 0, iABC) /* OP_ADD */
+ ,opmode(0, 0, 1, 1, 1, 0, iABC) /* OP_SUB */
+ ,opmode(0, 0, 1, 1, 1, 0, iABC) /* OP_MUL */
+ ,opmode(0, 0, 1, 1, 1, 0, iABC) /* OP_DIV */
+ ,opmode(0, 0, 1, 1, 1, 0, iABC) /* OP_POW */
+ ,opmode(0, 1, 0, 0, 1, 0, iABC) /* OP_UNM */
+ ,opmode(0, 1, 0, 0, 1, 0, iABC) /* OP_NOT */
+ ,opmode(0, 1, 0, 1, 1, 0, iABC) /* OP_CONCAT */
+ ,opmode(0, 0, 0, 0, 0, 0, iAsBx) /* OP_JMP */
+ ,opmode(1, 0, 1, 1, 0, 0, iABC) /* OP_EQ */
+ ,opmode(1, 0, 1, 1, 0, 0, iABC) /* OP_LT */
+ ,opmode(1, 0, 1, 1, 0, 0, iABC) /* OP_LE */
+ ,opmode(1, 1, 0, 0, 1, 0, iABC) /* OP_TEST */
+ ,opmode(0, 0, 0, 0, 0, 0, iABC) /* OP_CALL */
+ ,opmode(0, 0, 0, 0, 0, 0, iABC) /* OP_TAILCALL */
+ ,opmode(0, 0, 0, 0, 0, 0, iABC) /* OP_RETURN */
+ ,opmode(0, 0, 0, 0, 0, 0, iAsBx) /* OP_FORLOOP */
+ ,opmode(1, 0, 0, 0, 0, 0, iABC) /* OP_TFORLOOP */
+ ,opmode(0, 0, 0, 0, 0, 0, iAsBx) /* OP_TFORPREP */
+ ,opmode(0, 0, 0, 0, 0, 0, iABx) /* OP_SETLIST */
+ ,opmode(0, 0, 0, 0, 0, 0, iABx) /* OP_SETLISTO */
+ ,opmode(0, 0, 0, 0, 0, 0, iABC) /* OP_CLOSE */
+ ,opmode(0, 0, 0, 0, 1, 0, iABx) /* OP_CLOSURE */
+};
+
--- /dev/null
+/*
+** $Id: lopcodes.h,v 1.102 2002/08/21 18:56:09 roberto Exp $
+** Opcodes for Lua virtual machine
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lopcodes_h
+#define lopcodes_h
+
+#include "llimits.h"
+
+
+/*===========================================================================
+ We assume that instructions are unsigned 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
+ `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}; /* 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_OP 6
+
+#define POS_C SIZE_OP
+#define POS_B (POS_C + SIZE_C)
+#define POS_Bx POS_C
+#define POS_A (POS_B + SIZE_B)
+
+
+/*
+** limits for opcode arguments.
+** we use (signed) int to manipulate most arguments,
+** so they must fit in BITS_INT-1 bits (-1 for sign)
+*/
+#if SIZE_Bx < BITS_INT-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
+
+
+#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)&MASK1(SIZE_OP,0)))
+#define SET_OPCODE(i,o) ((i) = (((i)&MASK0(SIZE_OP,0)) | cast(Instruction, o)))
+
+#define GETARG_A(i) (cast(int, (i)>>POS_A))
+#define SETARG_A(i,u) ((i) = (((i)&MASK0(SIZE_A,POS_A)) | \
+ ((cast(Instruction, u)<<POS_A)&MASK1(SIZE_A,POS_A))))
+
+#define GETARG_B(i) (cast(int, ((i)>>POS_B) & MASK1(SIZE_B,0)))
+#define SETARG_B(i,b) ((i) = (((i)&MASK0(SIZE_B,POS_B)) | \
+ ((cast(Instruction, b)<<POS_B)&MASK1(SIZE_B,POS_B))))
+
+#define GETARG_C(i) (cast(int, ((i)>>POS_C) & MASK1(SIZE_C,0)))
+#define SETARG_C(i,b) ((i) = (((i)&MASK0(SIZE_C,POS_C)) | \
+ ((cast(Instruction, b)<<POS_C)&MASK1(SIZE_C,POS_C))))
+
+#define GETARG_Bx(i) (cast(int, ((i)>>POS_Bx) & MASK1(SIZE_Bx,0)))
+#define SETARG_Bx(i,b) ((i) = (((i)&MASK0(SIZE_Bx,POS_Bx)) | \
+ ((cast(Instruction, b)<<POS_Bx)&MASK1(SIZE_Bx,POS_Bx))))
+
+#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) \
+ | (cast(Instruction, a)<<POS_A) \
+ | (cast(Instruction, b)<<POS_B) \
+ | (cast(Instruction, c)<<POS_C))
+
+#define CREATE_ABx(o,a,bc) (cast(Instruction, o) \
+ | (cast(Instruction, a)<<POS_A) \
+ | (cast(Instruction, bc)<<POS_Bx))
+
+
+
+
+/*
+** invalid register that fits in 8 bits
+*/
+#define NO_REG MAXARG_A
+
+
+/*
+** R(x) - register
+** Kst(x) - constant (in constant table)
+** RK(x) == if x < MAXSTACK then R(x) else Kst(x-MAXSTACK)
+*/
+
+
+/*
+** grep "ORDER OP" if you change these enums
+*/
+
+typedef enum {
+/*----------------------------------------------------------------------
+name args description
+------------------------------------------------------------------------*/
+OP_MOVE,/* A B R(A) := R(B) */
+OP_LOADK,/* A Bx R(A) := Kst(Bx) */
+OP_LOADBOOL,/* A B C R(A) := (Bool)B; if (C) PC++ */
+OP_LOADNIL,/* A B R(A) := ... := R(B) := nil */
+OP_GETUPVAL,/* A B R(A) := UpValue[B] */
+
+OP_GETGLOBAL,/* A Bx R(A) := Gbl[Kst(Bx)] */
+OP_GETTABLE,/* A B C R(A) := R(B)[RK(C)] */
+
+OP_SETGLOBAL,/* A Bx Gbl[Kst(Bx)] := R(A) */
+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_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_DIV,/* A B C R(A) := RK(B) / RK(C) */
+OP_POW,/* A B C R(A) := RK(B) ^ RK(C) */
+OP_UNM,/* A B R(A) := -R(B) */
+OP_NOT,/* A B R(A) := not R(B) */
+
+OP_CONCAT,/* A B C R(A) := R(B).. ... ..R(C) */
+
+OP_JMP,/* sBx PC += sBx */
+
+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 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 */
+
+OP_TFORLOOP,/* A C R(A+2), ... ,R(A+2+C) := R(A)(R(A+1), R(A+2));
+ if R(A+2) ~= nil then pc++ */
+OP_TFORPREP,/* A sBx if type(R(A)) == table then R(A+1):=R(A), R(A):=next;
+ PC += sBx */
+
+OP_SETLIST,/* A Bx R(A)[Bx-Bx%FPF+i] := R(A+i), 1 <= i <= Bx%FPF+1 */
+OP_SETLISTO,/* A Bx */
+
+OP_CLOSE,/* A close all variables in the stack up to (>=) R(A)*/
+OP_CLOSURE/* A Bx R(A) := closure(KPROTO[Bx], R(A), ... ,R(A+n)) */
+} OpCode;
+
+
+#define NUM_OPCODES (cast(int, OP_CLOSURE+1))
+
+
+
+/*===========================================================================
+ Notes:
+ (1) In OP_CALL, if (B == 0) then B = top. C is the number of returns - 1,
+ and can be 0: OP_CALL then sets `top' to last_result+1, so
+ next open instruction (OP_CALL, OP_RETURN, OP_SETLIST) may use `top'.
+
+ (2) In OP_RETURN, if (B == 0) then return up to `top'
+
+ (3) For comparisons, B specifies what conditions the test should accept.
+
+ (4) All `skips' (pc++) assume that next instruction is a jump
+===========================================================================*/
+
+
+/*
+** masks for instruction properties
+*/
+enum OpModeMask {
+ OpModeBreg = 2, /* B is a register */
+ OpModeBrk, /* B is a register/constant */
+ OpModeCrk, /* C is a register/constant */
+ OpModesetA, /* instruction set register A */
+ OpModeK, /* Bx is a constant */
+ OpModeT /* operator is a test */
+
+};
+
+
+extern const lu_byte luaP_opmodes[NUM_OPCODES];
+
+#define getOpMode(m) (cast(enum OpMode, luaP_opmodes[m] & 3))
+#define testOpMode(m, b) (luaP_opmodes[m] & (1 << (b)))
+
+
+#ifdef LUA_OPNAMES
+extern const char *const luaP_opnames[]; /* opcode names */
+#endif
+
+
+
+/* number of list items to accumulate before a SETLIST instruction */
+/* (must be a power of 2) */
+#define LFIELDS_PER_FLUSH 32
+
+
+#endif
--- /dev/null
+/*
+** $Id: lparser.c,v 1.208a 2003/04/03 13:35:34 roberto Exp $
+** Lua Parser
+** See Copyright Notice in lua.h
+*/
+
+
+#include <string.h>
+
+#define lparser_c
+
+#include "lua.h"
+
+#include "lcode.h"
+#include "ldebug.h"
+#include "lfunc.h"
+#include "llex.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lparser.h"
+#include "lstate.h"
+#include "lstring.h"
+
+
+
+
+#define getlocvar(fs, i) ((fs)->f->locvars[(fs)->actvar[i]])
+
+
+#define enterlevel(ls) if (++(ls)->nestlevel > LUA_MAXPARSERLEVEL) \
+ luaX_syntaxerror(ls, "too many syntax levels");
+#define leavelevel(ls) ((ls)->nestlevel--)
+
+
+/*
+** nodes for block list (list of active blocks)
+*/
+typedef struct BlockCnt {
+ struct BlockCnt *previous; /* chain */
+ int breaklist; /* list of jumps out of this loop */
+ int nactvar; /* # active local variables outside the breakable structure */
+ int upval; /* true if some variable in the block is an upvalue */
+ int isbreakable; /* true if `block' is a loop */
+} BlockCnt;
+
+
+
+/*
+** prototypes for recursive non-terminal functions
+*/
+static void chunk (LexState *ls);
+static void expr (LexState *ls, expdesc *v);
+
+
+
+static void 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 = luaX_lex(ls, &ls->t.seminfo); /* read next token */
+}
+
+
+static void lookahead (LexState *ls) {
+ lua_assert(ls->lookahead.token == TK_EOS);
+ ls->lookahead.token = luaX_lex(ls, &ls->lookahead.seminfo);
+}
+
+
+static void error_expected (LexState *ls, int token) {
+ luaX_syntaxerror(ls,
+ luaO_pushfstring(ls->L, "`%s' expected", luaX_token2str(ls, token)));
+}
+
+
+static int testnext (LexState *ls, int c) {
+ if (ls->t.token == c) {
+ next(ls);
+ return 1;
+ }
+ else return 0;
+}
+
+
+static void check (LexState *ls, int c) {
+ if (!testnext(ls, c))
+ error_expected(ls, c);
+}
+
+
+#define check_condition(ls,c,msg) { if (!(c)) luaX_syntaxerror(ls, msg); }
+
+
+
+static void check_match (LexState *ls, int what, int who, int where) {
+ if (!testnext(ls, what)) {
+ if (where == ls->linenumber)
+ error_expected(ls, what);
+ else {
+ luaX_syntaxerror(ls, luaO_pushfstring(ls->L,
+ "`%s' expected (to close `%s' at line %d)",
+ luaX_token2str(ls, what), luaX_token2str(ls, who), where));
+ }
+ }
+}
+
+
+static TString *str_checkname (LexState *ls) {
+ TString *ts;
+ check_condition(ls, (ls->t.token == TK_NAME), "<name> expected");
+ ts = ls->t.seminfo.ts;
+ next(ls);
+ return ts;
+}
+
+
+static void init_exp (expdesc *e, expkind k, int i) {
+ e->f = e->t = NO_JUMP;
+ e->k = k;
+ e->info = i;
+}
+
+
+static void codestring (LexState *ls, expdesc *e, TString *s) {
+ init_exp(e, VK, luaK_stringK(ls->fs, s));
+}
+
+
+static void checkname(LexState *ls, expdesc *e) {
+ codestring(ls, e, str_checkname(ls));
+}
+
+
+static int luaI_registerlocalvar (LexState *ls, TString *varname) {
+ FuncState *fs = ls->fs;
+ Proto *f = fs->f;
+ luaM_growvector(ls->L, f->locvars, fs->nlocvars, f->sizelocvars,
+ LocVar, MAX_INT, "");
+ f->locvars[fs->nlocvars].varname = varname;
+ return fs->nlocvars++;
+}
+
+
+static void new_localvar (LexState *ls, TString *name, int n) {
+ FuncState *fs = ls->fs;
+ luaX_checklimit(ls, fs->nactvar+n+1, MAXVARS, "local variables");
+ fs->actvar[fs->nactvar+n] = luaI_registerlocalvar(ls, name);
+}
+
+
+static void adjustlocalvars (LexState *ls, int nvars) {
+ FuncState *fs = ls->fs;
+ fs->nactvar += nvars;
+ for (; nvars; nvars--) {
+ getlocvar(fs, fs->nactvar - nvars).startpc = fs->pc;
+ }
+}
+
+
+static void removevars (LexState *ls, int tolevel) {
+ FuncState *fs = ls->fs;
+ while (fs->nactvar > tolevel)
+ getlocvar(fs, --fs->nactvar).endpc = fs->pc;
+}
+
+
+static void new_localvarstr (LexState *ls, const char *name, int n) {
+ new_localvar(ls, luaS_new(ls->L, name), n);
+}
+
+
+static void create_local (LexState *ls, const char *name) {
+ new_localvarstr(ls, name, 0);
+ adjustlocalvars(ls, 1);
+}
+
+
+static int indexupvalue (FuncState *fs, TString *name, expdesc *v) {
+ int i;
+ Proto *f = fs->f;
+ for (i=0; i<f->nups; i++) {
+ if (fs->upvalues[i].k == v->k && fs->upvalues[i].info == v->info) {
+ lua_assert(fs->f->upvalues[i] == name);
+ return i;
+ }
+ }
+ /* new one */
+ luaX_checklimit(fs->ls, f->nups + 1, MAXUPVALUES, "upvalues");
+ luaM_growvector(fs->L, fs->f->upvalues, f->nups, fs->f->sizeupvalues,
+ TString *, MAX_INT, "");
+ fs->f->upvalues[f->nups] = name;
+ fs->upvalues[f->nups] = *v;
+ return f->nups++;
+}
+
+
+static int searchvar (FuncState *fs, TString *n) {
+ int i;
+ for (i=fs->nactvar-1; i >= 0; i--) {
+ if (n == getlocvar(fs, i).varname)
+ return i;
+ }
+ return -1; /* not found */
+}
+
+
+static void markupval (FuncState *fs, int level) {
+ BlockCnt *bl = fs->bl;
+ while (bl && bl->nactvar > level) bl = bl->previous;
+ if (bl) bl->upval = 1;
+}
+
+
+static void singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) {
+ if (fs == NULL) /* no more levels? */
+ init_exp(var, VGLOBAL, NO_REG); /* default is global variable */
+ else {
+ int v = searchvar(fs, n); /* look up at current level */
+ if (v >= 0) {
+ init_exp(var, VLOCAL, v);
+ if (!base)
+ markupval(fs, v); /* local will be used as an upval */
+ }
+ else { /* not found at current level; try upper one */
+ singlevaraux(fs->prev, n, var, 0);
+ if (var->k == VGLOBAL) {
+ if (base)
+ var->info = luaK_stringK(fs, n); /* info points to global name */
+ }
+ else { /* LOCAL or UPVAL */
+ var->info = indexupvalue(fs, n, var);
+ var->k = VUPVAL; /* upvalue in this level */
+ }
+ }
+ }
+}
+
+
+static TString *singlevar (LexState *ls, expdesc *var, int base) {
+ TString *varname = str_checkname(ls);
+ singlevaraux(ls->fs, varname, var, base);
+ return varname;
+}
+
+
+static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) {
+ FuncState *fs = ls->fs;
+ int extra = nvars - nexps;
+ if (e->k == VCALL) {
+ extra++; /* includes call itself */
+ if (extra <= 0) extra = 0;
+ else luaK_reserveregs(fs, extra-1);
+ luaK_setcallreturns(fs, e, extra); /* call provides the difference */
+ }
+ else {
+ if (e->k != VVOID) luaK_exp2nextreg(fs, e); /* close last expression */
+ if (extra > 0) {
+ int reg = fs->freereg;
+ luaK_reserveregs(fs, extra);
+ luaK_nil(fs, reg, extra);
+ }
+ }
+}
+
+
+static void code_params (LexState *ls, int nparams, int dots) {
+ FuncState *fs = ls->fs;
+ adjustlocalvars(ls, nparams);
+ luaX_checklimit(ls, fs->nactvar, MAXPARAMS, "parameters");
+ fs->f->numparams = cast(lu_byte, fs->nactvar);
+ fs->f->is_vararg = cast(lu_byte, dots);
+ if (dots)
+ create_local(ls, "arg");
+ luaK_reserveregs(fs, fs->nactvar); /* reserve register for parameters */
+}
+
+
+static void enterblock (FuncState *fs, BlockCnt *bl, int isbreakable) {
+ bl->breaklist = NO_JUMP;
+ bl->isbreakable = isbreakable;
+ bl->nactvar = fs->nactvar;
+ bl->upval = 0;
+ bl->previous = fs->bl;
+ fs->bl = bl;
+ lua_assert(fs->freereg == fs->nactvar);
+}
+
+
+static void leaveblock (FuncState *fs) {
+ BlockCnt *bl = fs->bl;
+ fs->bl = bl->previous;
+ removevars(fs->ls, bl->nactvar);
+ if (bl->upval)
+ luaK_codeABC(fs, OP_CLOSE, bl->nactvar, 0, 0);
+ lua_assert(bl->nactvar == fs->nactvar);
+ fs->freereg = fs->nactvar; /* free registers */
+ luaK_patchtohere(fs, bl->breaklist);
+}
+
+
+static void pushclosure (LexState *ls, FuncState *func, expdesc *v) {
+ FuncState *fs = ls->fs;
+ Proto *f = fs->f;
+ int i;
+ luaM_growvector(ls->L, f->p, fs->np, f->sizep, Proto *,
+ MAXARG_Bx, "constant table overflow");
+ f->p[fs->np++] = func->f;
+ init_exp(v, VRELOCABLE, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np-1));
+ for (i=0; i<func->f->nups; i++) {
+ OpCode o = (func->upvalues[i].k == VLOCAL) ? OP_MOVE : OP_GETUPVAL;
+ luaK_codeABC(fs, o, 0, func->upvalues[i].info, 0);
+ }
+}
+
+
+static void open_func (LexState *ls, FuncState *fs) {
+ Proto *f = luaF_newproto(ls->L);
+ fs->f = f;
+ fs->prev = ls->fs; /* linked list of funcstates */
+ fs->ls = ls;
+ fs->L = ls->L;
+ ls->fs = fs;
+ fs->pc = 0;
+ fs->lasttarget = 0;
+ fs->jpc = NO_JUMP;
+ fs->freereg = 0;
+ fs->nk = 0;
+ fs->h = luaH_new(ls->L, 0, 0);
+ fs->np = 0;
+ fs->nlocvars = 0;
+ fs->nactvar = 0;
+ fs->bl = NULL;
+ f->source = ls->source;
+ f->maxstacksize = 2; /* registers 0/1 are always valid */
+}
+
+
+static void close_func (LexState *ls) {
+ lua_State *L = ls->L;
+ FuncState *fs = ls->fs;
+ Proto *f = fs->f;
+ removevars(ls, 0);
+ luaK_codeABC(fs, OP_RETURN, 0, 1, 0); /* final return */
+ luaM_reallocvector(L, f->code, f->sizecode, fs->pc, Instruction);
+ f->sizecode = fs->pc;
+ luaM_reallocvector(L, f->lineinfo, f->sizelineinfo, fs->pc, int);
+ f->sizelineinfo = fs->pc;
+ luaM_reallocvector(L, f->k, f->sizek, fs->nk, TObject);
+ f->sizek = fs->nk;
+ luaM_reallocvector(L, f->p, f->sizep, fs->np, Proto *);
+ f->sizep = fs->np;
+ luaM_reallocvector(L, f->locvars, f->sizelocvars, fs->nlocvars, LocVar);
+ f->sizelocvars = fs->nlocvars;
+ luaM_reallocvector(L, f->upvalues, f->sizeupvalues, f->nups, TString *);
+ f->sizeupvalues = f->nups;
+ lua_assert(luaG_checkcode(f));
+ lua_assert(fs->bl == NULL);
+ ls->fs = fs->prev;
+}
+
+
+Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff) {
+ struct LexState lexstate;
+ struct FuncState funcstate;
+ lexstate.buff = buff;
+ lexstate.nestlevel = 0;
+ luaX_setinput(L, &lexstate, z, luaS_new(L, zname(z)));
+ open_func(&lexstate, &funcstate);
+ next(&lexstate); /* read first token */
+ chunk(&lexstate);
+ check_condition(&lexstate, (lexstate.t.token == TK_EOS), "<eof> expected");
+ close_func(&lexstate);
+ lua_assert(funcstate.prev == NULL);
+ lua_assert(funcstate.f->nups == 0);
+ lua_assert(lexstate.nestlevel == 0);
+ return funcstate.f;
+}
+
+
+
+/*============================================================*/
+/* GRAMMAR RULES */
+/*============================================================*/
+
+
+static void luaY_field (LexState *ls, expdesc *v) {
+ /* field -> ['.' | ':'] NAME */
+ FuncState *fs = ls->fs;
+ expdesc key;
+ luaK_exp2anyreg(fs, v);
+ next(ls); /* skip the dot or colon */
+ checkname(ls, &key);
+ luaK_indexed(fs, v, &key);
+}
+
+
+static void luaY_index (LexState *ls, expdesc *v) {
+ /* index -> '[' expr ']' */
+ next(ls); /* skip the '[' */
+ expr(ls, v);
+ luaK_exp2val(ls->fs, v);
+ check(ls, ']');
+}
+
+
+/*
+** {======================================================================
+** Rules for Constructors
+** =======================================================================
+*/
+
+
+struct ConsControl {
+ expdesc v; /* last list item read */
+ expdesc *t; /* table descriptor */
+ int nh; /* total number of `record' elements */
+ int na; /* total number of array elements */
+ int tostore; /* number of array elements pending to be stored */
+};
+
+
+static void recfield (LexState *ls, struct ConsControl *cc) {
+ /* recfield -> (NAME | `['exp1`]') = exp1 */
+ FuncState *fs = ls->fs;
+ int reg = ls->fs->freereg;
+ expdesc key, val;
+ if (ls->t.token == TK_NAME) {
+ luaX_checklimit(ls, cc->nh, MAX_INT, "items in a constructor");
+ cc->nh++;
+ checkname(ls, &key);
+ }
+ else /* ls->t.token == '[' */
+ luaY_index(ls, &key);
+ check(ls, '=');
+ luaK_exp2RK(fs, &key);
+ expr(ls, &val);
+ luaK_codeABC(fs, OP_SETTABLE, cc->t->info, luaK_exp2RK(fs, &key),
+ luaK_exp2RK(fs, &val));
+ fs->freereg = reg; /* free registers */
+}
+
+
+static void closelistfield (FuncState *fs, struct ConsControl *cc) {
+ if (cc->v.k == VVOID) return; /* there is no list item */
+ luaK_exp2nextreg(fs, &cc->v);
+ cc->v.k = VVOID;
+ if (cc->tostore == LFIELDS_PER_FLUSH) {
+ luaK_codeABx(fs, OP_SETLIST, cc->t->info, cc->na-1); /* flush */
+ cc->tostore = 0; /* no more items pending */
+ fs->freereg = cc->t->info + 1; /* free registers */
+ }
+}
+
+
+static void lastlistfield (FuncState *fs, struct ConsControl *cc) {
+ if (cc->tostore == 0) return;
+ if (cc->v.k == VCALL) {
+ luaK_setcallreturns(fs, &cc->v, LUA_MULTRET);
+ luaK_codeABx(fs, OP_SETLISTO, cc->t->info, cc->na-1);
+ }
+ else {
+ if (cc->v.k != VVOID)
+ luaK_exp2nextreg(fs, &cc->v);
+ luaK_codeABx(fs, OP_SETLIST, cc->t->info, cc->na-1);
+ }
+ fs->freereg = cc->t->info + 1; /* free registers */
+}
+
+
+static void listfield (LexState *ls, struct ConsControl *cc) {
+ expr(ls, &cc->v);
+ luaX_checklimit(ls, cc->na, MAXARG_Bx, "items in a constructor");
+ cc->na++;
+ cc->tostore++;
+}
+
+
+static void constructor (LexState *ls, expdesc *t) {
+ /* constructor -> ?? */
+ FuncState *fs = ls->fs;
+ int line = ls->linenumber;
+ int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0);
+ struct ConsControl cc;
+ cc.na = cc.nh = cc.tostore = 0;
+ cc.t = t;
+ init_exp(t, VRELOCABLE, pc);
+ init_exp(&cc.v, VVOID, 0); /* no value (yet) */
+ luaK_exp2nextreg(ls->fs, t); /* fix it at stack top (for gc) */
+ check(ls, '{');
+ do {
+ lua_assert(cc.v.k == VVOID || cc.tostore > 0);
+ testnext(ls, ';'); /* compatibility only */
+ if (ls->t.token == '}') break;
+ closelistfield(fs, &cc);
+ switch(ls->t.token) {
+ case TK_NAME: { /* may be listfields or recfields */
+ lookahead(ls);
+ if (ls->lookahead.token != '=') /* expression? */
+ listfield(ls, &cc);
+ else
+ recfield(ls, &cc);
+ break;
+ }
+ case '[': { /* constructor_item -> recfield */
+ recfield(ls, &cc);
+ break;
+ }
+ default: { /* constructor_part -> listfield */
+ listfield(ls, &cc);
+ break;
+ }
+ }
+ } while (testnext(ls, ',') || testnext(ls, ';'));
+ check_match(ls, '}', '{', line);
+ lastlistfield(fs, &cc);
+ SETARG_B(fs->f->code[pc], luaO_int2fb(cc.na)); /* set initial array size */
+ SETARG_C(fs->f->code[pc], luaO_log2(cc.nh)+1); /* set initial table size */
+}
+
+/* }====================================================================== */
+
+
+
+static void parlist (LexState *ls) {
+ /* parlist -> [ param { `,' param } ] */
+ int nparams = 0;
+ int dots = 0;
+ if (ls->t.token != ')') { /* is `parlist' not empty? */
+ do {
+ switch (ls->t.token) {
+ case TK_DOTS: dots = 1; next(ls); break;
+ case TK_NAME: new_localvar(ls, str_checkname(ls), nparams++); break;
+ default: luaX_syntaxerror(ls, "<name> or `...' expected");
+ }
+ } while (!dots && testnext(ls, ','));
+ }
+ code_params(ls, nparams, dots);
+}
+
+
+static void body (LexState *ls, expdesc *e, int needself, int line) {
+ /* body -> `(' parlist `)' chunk END */
+ FuncState new_fs;
+ open_func(ls, &new_fs);
+ new_fs.f->lineDefined = line;
+ check(ls, '(');
+ if (needself)
+ create_local(ls, "self");
+ parlist(ls);
+ check(ls, ')');
+ chunk(ls);
+ check_match(ls, TK_END, TK_FUNCTION, line);
+ close_func(ls);
+ pushclosure(ls, &new_fs, e);
+}
+
+
+static int explist1 (LexState *ls, expdesc *v) {
+ /* explist1 -> expr { `,' expr } */
+ int n = 1; /* at least one expression */
+ expr(ls, v);
+ while (testnext(ls, ',')) {
+ luaK_exp2nextreg(ls->fs, v);
+ expr(ls, v);
+ n++;
+ }
+ return n;
+}
+
+
+static void funcargs (LexState *ls, expdesc *f) {
+ FuncState *fs = ls->fs;
+ expdesc args;
+ int base, nparams;
+ int line = ls->linenumber;
+ switch (ls->t.token) {
+ case '(': { /* funcargs -> `(' [ explist1 ] `)' */
+ if (line != ls->lastline)
+ luaX_syntaxerror(ls,"ambiguous syntax (function call x new statement)");
+ next(ls);
+ if (ls->t.token == ')') /* arg list is empty? */
+ args.k = VVOID;
+ else {
+ explist1(ls, &args);
+ luaK_setcallreturns(fs, &args, LUA_MULTRET);
+ }
+ check_match(ls, ')', '(', line);
+ break;
+ }
+ case '{': { /* funcargs -> constructor */
+ constructor(ls, &args);
+ break;
+ }
+ case TK_STRING: { /* funcargs -> STRING */
+ codestring(ls, &args, ls->t.seminfo.ts);
+ next(ls); /* must use `seminfo' before `next' */
+ break;
+ }
+ default: {
+ luaX_syntaxerror(ls, "function arguments expected");
+ return;
+ }
+ }
+ lua_assert(f->k == VNONRELOC);
+ base = f->info; /* base register for call */
+ if (args.k == VCALL)
+ nparams = LUA_MULTRET; /* open call */
+ else {
+ if (args.k != VVOID)
+ luaK_exp2nextreg(fs, &args); /* close last argument */
+ nparams = fs->freereg - (base+1);
+ }
+ init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2));
+ luaK_fixline(fs, line);
+ fs->freereg = base+1; /* call remove function and arguments and leaves
+ (unless changed) one result */
+}
+
+
+
+
+/*
+** {======================================================================
+** Expression parsing
+** =======================================================================
+*/
+
+
+static void prefixexp (LexState *ls, expdesc *v) {
+ /* prefixexp -> NAME | '(' expr ')' */
+ switch (ls->t.token) {
+ case '(': {
+ int line = ls->linenumber;
+ next(ls);
+ expr(ls, v);
+ check_match(ls, ')', '(', line);
+ luaK_dischargevars(ls->fs, v);
+ return;
+ }
+ case TK_NAME: {
+ singlevar(ls, v, 1);
+ return;
+ }
+#ifdef LUA_COMPATUPSYNTAX
+ case '%': { /* for compatibility only */
+ TString *varname;
+ int line = ls->linenumber;
+ next(ls); /* skip `%' */
+ varname = singlevar(ls, v, 1);
+ if (v->k != VUPVAL)
+ luaX_errorline(ls, "global upvalues are obsolete",
+ getstr(varname), line);
+ return;
+ }
+#endif
+ default: {
+ luaX_syntaxerror(ls, "unexpected symbol");
+ return;
+ }
+ }
+}
+
+
+static void primaryexp (LexState *ls, expdesc *v) {
+ /* primaryexp ->
+ prefixexp { `.' NAME | `[' exp `]' | `:' NAME funcargs | funcargs } */
+ FuncState *fs = ls->fs;
+ prefixexp(ls, v);
+ for (;;) {
+ switch (ls->t.token) {
+ case '.': { /* field */
+ luaY_field(ls, v);
+ break;
+ }
+ case '[': { /* `[' exp1 `]' */
+ expdesc key;
+ luaK_exp2anyreg(fs, v);
+ luaY_index(ls, &key);
+ luaK_indexed(fs, v, &key);
+ break;
+ }
+ case ':': { /* `:' NAME funcargs */
+ expdesc key;
+ next(ls);
+ checkname(ls, &key);
+ luaK_self(fs, v, &key);
+ funcargs(ls, v);
+ break;
+ }
+ case '(': case TK_STRING: case '{': { /* funcargs */
+ luaK_exp2nextreg(fs, v);
+ funcargs(ls, v);
+ break;
+ }
+ default: return;
+ }
+ }
+}
+
+
+static void simpleexp (LexState *ls, expdesc *v) {
+ /* simpleexp -> NUMBER | STRING | NIL | constructor | FUNCTION body
+ | primaryexp */
+ switch (ls->t.token) {
+ case TK_NUMBER: {
+ init_exp(v, VK, luaK_numberK(ls->fs, ls->t.seminfo.r));
+ next(ls); /* must use `seminfo' before `next' */
+ break;
+ }
+ case TK_STRING: {
+ codestring(ls, v, ls->t.seminfo.ts);
+ next(ls); /* must use `seminfo' before `next' */
+ break;
+ }
+ case TK_NIL: {
+ init_exp(v, VNIL, 0);
+ next(ls);
+ break;
+ }
+ case TK_TRUE: {
+ init_exp(v, VTRUE, 0);
+ next(ls);
+ break;
+ }
+ case TK_FALSE: {
+ init_exp(v, VFALSE, 0);
+ next(ls);
+ break;
+ }
+ case '{': { /* constructor */
+ constructor(ls, v);
+ break;
+ }
+ case TK_FUNCTION: {
+ next(ls);
+ body(ls, v, 0, ls->linenumber);
+ break;
+ }
+ default: {
+ primaryexp(ls, v);
+ break;
+ }
+ }
+}
+
+
+static UnOpr getunopr (int op) {
+ switch (op) {
+ case TK_NOT: return OPR_NOT;
+ case '-': return OPR_MINUS;
+ default: return OPR_NOUNOPR;
+ }
+}
+
+
+static BinOpr getbinopr (int op) {
+ switch (op) {
+ case '+': return OPR_ADD;
+ case '-': return OPR_SUB;
+ case '*': return OPR_MULT;
+ case '/': return OPR_DIV;
+ case '^': return OPR_POW;
+ case TK_CONCAT: return OPR_CONCAT;
+ case TK_NE: return OPR_NE;
+ case TK_EQ: return OPR_EQ;
+ case '<': return OPR_LT;
+ case TK_LE: return OPR_LE;
+ case '>': return OPR_GT;
+ case TK_GE: return OPR_GE;
+ case TK_AND: return OPR_AND;
+ case TK_OR: return OPR_OR;
+ default: return OPR_NOBINOPR;
+ }
+}
+
+
+static const struct {
+ lu_byte left; /* left priority for each binary operator */
+ lu_byte right; /* right priority */
+} priority[] = { /* ORDER OPR */
+ {6, 6}, {6, 6}, {7, 7}, {7, 7}, /* arithmetic */
+ {10, 9}, {5, 4}, /* power and concat (right associative) */
+ {3, 3}, {3, 3}, /* equality */
+ {3, 3}, {3, 3}, {3, 3}, {3, 3}, /* order */
+ {2, 2}, {1, 1} /* logical (and/or) */
+};
+
+#define UNARY_PRIORITY 8 /* priority for unary operators */
+
+
+/*
+** subexpr -> (simplexep | unop subexpr) { binop subexpr }
+** where `binop' is any binary operator with a priority higher than `limit'
+*/
+static BinOpr subexpr (LexState *ls, expdesc *v, int limit) {
+ BinOpr op;
+ UnOpr uop;
+ enterlevel(ls);
+ uop = getunopr(ls->t.token);
+ if (uop != OPR_NOUNOPR) {
+ next(ls);
+ subexpr(ls, v, UNARY_PRIORITY);
+ luaK_prefix(ls->fs, uop, v);
+ }
+ else simpleexp(ls, v);
+ /* expand while operators have priorities higher than `limit' */
+ op = getbinopr(ls->t.token);
+ while (op != OPR_NOBINOPR && cast(int, priority[op].left) > limit) {
+ expdesc v2;
+ BinOpr nextop;
+ next(ls);
+ luaK_infix(ls->fs, op, v);
+ /* read sub-expression with higher priority */
+ nextop = subexpr(ls, &v2, cast(int, priority[op].right));
+ luaK_posfix(ls->fs, op, v, &v2);
+ op = nextop;
+ }
+ leavelevel(ls);
+ return op; /* return first untreated operator */
+}
+
+
+static void expr (LexState *ls, expdesc *v) {
+ subexpr(ls, v, -1);
+}
+
+/* }==================================================================== */
+
+
+
+/*
+** {======================================================================
+** Rules for Statements
+** =======================================================================
+*/
+
+
+static int block_follow (int token) {
+ switch (token) {
+ case TK_ELSE: case TK_ELSEIF: case TK_END:
+ case TK_UNTIL: case TK_EOS:
+ return 1;
+ default: return 0;
+ }
+}
+
+
+static void block (LexState *ls) {
+ /* block -> chunk */
+ FuncState *fs = ls->fs;
+ BlockCnt bl;
+ enterblock(fs, &bl, 0);
+ chunk(ls);
+ lua_assert(bl.breaklist == NO_JUMP);
+ leaveblock(fs);
+}
+
+
+/*
+** structure to chain all variables in the left-hand side of an
+** assignment
+*/
+struct LHS_assign {
+ struct LHS_assign *prev;
+ expdesc v; /* variable (global, local, upvalue, or indexed) */
+};
+
+
+/*
+** check whether, in an assignment to a local variable, the local variable
+** is needed in a previous assignment (to a table). If so, save original
+** local value in a safe place and use this safe copy in the previous
+** assignment.
+*/
+static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) {
+ FuncState *fs = ls->fs;
+ int extra = fs->freereg; /* eventual position to save local variable */
+ int conflict = 0;
+ for (; lh; lh = lh->prev) {
+ if (lh->v.k == VINDEXED) {
+ if (lh->v.info == v->info) { /* conflict? */
+ conflict = 1;
+ lh->v.info = extra; /* previous assignment will use safe copy */
+ }
+ if (lh->v.aux == v->info) { /* conflict? */
+ conflict = 1;
+ lh->v.aux = extra; /* previous assignment will use safe copy */
+ }
+ }
+ }
+ if (conflict) {
+ luaK_codeABC(fs, OP_MOVE, fs->freereg, v->info, 0); /* make copy */
+ luaK_reserveregs(fs, 1);
+ }
+}
+
+
+static void assignment (LexState *ls, struct LHS_assign *lh, int nvars) {
+ expdesc e;
+ check_condition(ls, VLOCAL <= lh->v.k && lh->v.k <= VINDEXED,
+ "syntax error");
+ if (testnext(ls, ',')) { /* assignment -> `,' primaryexp assignment */
+ struct LHS_assign nv;
+ nv.prev = lh;
+ primaryexp(ls, &nv.v);
+ if (nv.v.k == VLOCAL)
+ check_conflict(ls, lh, &nv.v);
+ assignment(ls, &nv, nvars+1);
+ }
+ else { /* assignment -> `=' explist1 */
+ int nexps;
+ check(ls, '=');
+ nexps = explist1(ls, &e);
+ if (nexps != nvars) {
+ adjust_assign(ls, nvars, nexps, &e);
+ if (nexps > nvars)
+ ls->fs->freereg -= nexps - nvars; /* remove extra values */
+ }
+ else {
+ luaK_setcallreturns(ls->fs, &e, 1); /* close last expression */
+ luaK_storevar(ls->fs, &lh->v, &e);
+ return; /* avoid default */
+ }
+ }
+ init_exp(&e, VNONRELOC, ls->fs->freereg-1); /* default assignment */
+ luaK_storevar(ls->fs, &lh->v, &e);
+}
+
+
+static void cond (LexState *ls, expdesc *v) {
+ /* cond -> exp */
+ expr(ls, v); /* read condition */
+ if (v->k == VNIL) v->k = VFALSE; /* `falses' are all equal here */
+ luaK_goiftrue(ls->fs, v);
+ luaK_patchtohere(ls->fs, v->t);
+}
+
+
+/*
+** The while statement optimizes its code by coding the condition
+** after its body (and thus avoiding one jump in the loop).
+*/
+
+/*
+** maximum size of expressions for optimizing `while' code
+*/
+#ifndef MAXEXPWHILE
+#define MAXEXPWHILE 100
+#endif
+
+/*
+** the call `luaK_goiffalse' may grow the size of an expression by
+** at most this:
+*/
+#define EXTRAEXP 5
+
+static void whilestat (LexState *ls, int line) {
+ /* whilestat -> WHILE cond DO block END */
+ Instruction codeexp[MAXEXPWHILE + EXTRAEXP];
+ int lineexp;
+ int i;
+ int sizeexp;
+ FuncState *fs = ls->fs;
+ int whileinit, blockinit, expinit;
+ expdesc v;
+ BlockCnt bl;
+ next(ls); /* skip WHILE */
+ whileinit = luaK_jump(fs); /* jump to condition (which will be moved) */
+ expinit = luaK_getlabel(fs);
+ expr(ls, &v); /* parse condition */
+ if (v.k == VK) v.k = VTRUE; /* `trues' are all equal here */
+ lineexp = ls->linenumber;
+ luaK_goiffalse(fs, &v);
+ luaK_concat(fs, &v.f, fs->jpc);
+ fs->jpc = NO_JUMP;
+ sizeexp = fs->pc - expinit; /* size of expression code */
+ if (sizeexp > MAXEXPWHILE)
+ luaX_syntaxerror(ls, "`while' condition too complex");
+ for (i = 0; i < sizeexp; i++) /* save `exp' code */
+ codeexp[i] = fs->f->code[expinit + i];
+ fs->pc = expinit; /* remove `exp' code */
+ enterblock(fs, &bl, 1);
+ check(ls, TK_DO);
+ blockinit = luaK_getlabel(fs);
+ block(ls);
+ luaK_patchtohere(fs, whileinit); /* initial jump jumps to here */
+ /* move `exp' back to code */
+ if (v.t != NO_JUMP) v.t += fs->pc - expinit;
+ if (v.f != NO_JUMP) v.f += fs->pc - expinit;
+ for (i=0; i<sizeexp; i++)
+ luaK_code(fs, codeexp[i], lineexp);
+ check_match(ls, TK_END, TK_WHILE, line);
+ leaveblock(fs);
+ luaK_patchlist(fs, v.t, blockinit); /* true conditions go back to loop */
+ luaK_patchtohere(fs, v.f); /* false conditions finish the loop */
+}
+
+
+static void repeatstat (LexState *ls, int line) {
+ /* repeatstat -> REPEAT block UNTIL cond */
+ FuncState *fs = ls->fs;
+ int repeat_init = luaK_getlabel(fs);
+ expdesc v;
+ BlockCnt bl;
+ enterblock(fs, &bl, 1);
+ next(ls);
+ block(ls);
+ check_match(ls, TK_UNTIL, TK_REPEAT, line);
+ cond(ls, &v);
+ luaK_patchlist(fs, v.f, repeat_init);
+ leaveblock(fs);
+}
+
+
+static int exp1 (LexState *ls) {
+ expdesc e;
+ int k;
+ expr(ls, &e);
+ k = e.k;
+ luaK_exp2nextreg(ls->fs, &e);
+ return k;
+}
+
+
+static void forbody (LexState *ls, int base, int line, int nvars, int isnum) {
+ BlockCnt bl;
+ FuncState *fs = ls->fs;
+ int prep, endfor;
+ adjustlocalvars(ls, nvars); /* scope for all variables */
+ check(ls, TK_DO);
+ enterblock(fs, &bl, 1); /* loop block */
+ prep = luaK_getlabel(fs);
+ block(ls);
+ luaK_patchtohere(fs, prep-1);
+ endfor = (isnum) ? luaK_codeAsBx(fs, OP_FORLOOP, base, NO_JUMP) :
+ luaK_codeABC(fs, OP_TFORLOOP, base, 0, nvars - 3);
+ luaK_fixline(fs, line); /* pretend that `OP_FOR' starts the loop */
+ luaK_patchlist(fs, (isnum) ? endfor : luaK_jump(fs), prep);
+ leaveblock(fs);
+}
+
+
+static void fornum (LexState *ls, TString *varname, int line) {
+ /* fornum -> NAME = exp1,exp1[,exp1] DO body */
+ FuncState *fs = ls->fs;
+ int base = fs->freereg;
+ new_localvar(ls, varname, 0);
+ new_localvarstr(ls, "(for limit)", 1);
+ new_localvarstr(ls, "(for step)", 2);
+ check(ls, '=');
+ exp1(ls); /* initial value */
+ check(ls, ',');
+ exp1(ls); /* limit */
+ if (testnext(ls, ','))
+ exp1(ls); /* optional step */
+ else { /* default step = 1 */
+ luaK_codeABx(fs, OP_LOADK, fs->freereg, luaK_numberK(fs, 1));
+ luaK_reserveregs(fs, 1);
+ }
+ luaK_codeABC(fs, OP_SUB, fs->freereg - 3, fs->freereg - 3, fs->freereg - 1);
+ luaK_jump(fs);
+ forbody(ls, base, line, 3, 1);
+}
+
+
+static void forlist (LexState *ls, TString *indexname) {
+ /* forlist -> NAME {,NAME} IN explist1 DO body */
+ FuncState *fs = ls->fs;
+ expdesc e;
+ int nvars = 0;
+ int line;
+ int base = fs->freereg;
+ new_localvarstr(ls, "(for generator)", nvars++);
+ new_localvarstr(ls, "(for state)", nvars++);
+ new_localvar(ls, indexname, nvars++);
+ while (testnext(ls, ','))
+ new_localvar(ls, str_checkname(ls), nvars++);
+ check(ls, TK_IN);
+ line = ls->linenumber;
+ adjust_assign(ls, nvars, explist1(ls, &e), &e);
+ luaK_checkstack(fs, 3); /* extra space to call generator */
+ luaK_codeAsBx(fs, OP_TFORPREP, base, NO_JUMP);
+ forbody(ls, base, line, nvars, 0);
+}
+
+
+static void forstat (LexState *ls, int line) {
+ /* forstat -> fornum | forlist */
+ FuncState *fs = ls->fs;
+ TString *varname;
+ BlockCnt bl;
+ enterblock(fs, &bl, 0); /* block to control variable scope */
+ next(ls); /* skip `for' */
+ varname = str_checkname(ls); /* first variable name */
+ switch (ls->t.token) {
+ case '=': fornum(ls, varname, line); break;
+ case ',': case TK_IN: forlist(ls, varname); break;
+ default: luaX_syntaxerror(ls, "`=' or `in' expected");
+ }
+ check_match(ls, TK_END, TK_FOR, line);
+ leaveblock(fs);
+}
+
+
+static void test_then_block (LexState *ls, expdesc *v) {
+ /* test_then_block -> [IF | ELSEIF] cond THEN block */
+ next(ls); /* skip IF or ELSEIF */
+ cond(ls, v);
+ check(ls, TK_THEN);
+ block(ls); /* `then' part */
+}
+
+
+static void ifstat (LexState *ls, int line) {
+ /* ifstat -> IF cond THEN block {ELSEIF cond THEN block} [ELSE block] END */
+ FuncState *fs = ls->fs;
+ expdesc v;
+ int escapelist = NO_JUMP;
+ test_then_block(ls, &v); /* IF cond THEN block */
+ while (ls->t.token == TK_ELSEIF) {
+ luaK_concat(fs, &escapelist, luaK_jump(fs));
+ luaK_patchtohere(fs, v.f);
+ test_then_block(ls, &v); /* ELSEIF cond THEN block */
+ }
+ if (ls->t.token == TK_ELSE) {
+ luaK_concat(fs, &escapelist, luaK_jump(fs));
+ luaK_patchtohere(fs, v.f);
+ next(ls); /* skip ELSE (after patch, for correct line info) */
+ block(ls); /* `else' part */
+ }
+ else
+ luaK_concat(fs, &escapelist, v.f);
+ luaK_patchtohere(fs, escapelist);
+ check_match(ls, TK_END, TK_IF, line);
+}
+
+
+static void localfunc (LexState *ls) {
+ expdesc v, b;
+ FuncState *fs = ls->fs;
+ new_localvar(ls, str_checkname(ls), 0);
+ init_exp(&v, VLOCAL, fs->freereg);
+ luaK_reserveregs(fs, 1);
+ adjustlocalvars(ls, 1);
+ body(ls, &b, 0, ls->linenumber);
+ luaK_storevar(fs, &v, &b);
+ /* debug information will only see the variable after this point! */
+ getlocvar(fs, fs->nactvar - 1).startpc = fs->pc;
+}
+
+
+static void localstat (LexState *ls) {
+ /* stat -> LOCAL NAME {`,' NAME} [`=' explist1] */
+ int nvars = 0;
+ int nexps;
+ expdesc e;
+ do {
+ new_localvar(ls, str_checkname(ls), nvars++);
+ } while (testnext(ls, ','));
+ if (testnext(ls, '='))
+ nexps = explist1(ls, &e);
+ else {
+ e.k = VVOID;
+ nexps = 0;
+ }
+ adjust_assign(ls, nvars, nexps, &e);
+ adjustlocalvars(ls, nvars);
+}
+
+
+static int funcname (LexState *ls, expdesc *v) {
+ /* funcname -> NAME {field} [`:' NAME] */
+ int needself = 0;
+ singlevar(ls, v, 1);
+ while (ls->t.token == '.')
+ luaY_field(ls, v);
+ if (ls->t.token == ':') {
+ needself = 1;
+ luaY_field(ls, v);
+ }
+ return needself;
+}
+
+
+static void funcstat (LexState *ls, int line) {
+ /* funcstat -> FUNCTION funcname body */
+ int needself;
+ expdesc v, b;
+ next(ls); /* skip FUNCTION */
+ needself = funcname(ls, &v);
+ body(ls, &b, needself, line);
+ luaK_storevar(ls->fs, &v, &b);
+ luaK_fixline(ls->fs, line); /* definition `happens' in the first line */
+}
+
+
+static void exprstat (LexState *ls) {
+ /* stat -> func | assignment */
+ FuncState *fs = ls->fs;
+ struct LHS_assign v;
+ primaryexp(ls, &v.v);
+ if (v.v.k == VCALL) { /* stat -> func */
+ luaK_setcallreturns(fs, &v.v, 0); /* call statement uses no results */
+ }
+ else { /* stat -> assignment */
+ v.prev = NULL;
+ assignment(ls, &v, 1);
+ }
+}
+
+
+static void retstat (LexState *ls) {
+ /* stat -> RETURN explist */
+ FuncState *fs = ls->fs;
+ expdesc e;
+ int first, nret; /* registers with returned values */
+ next(ls); /* skip RETURN */
+ if (block_follow(ls->t.token) || ls->t.token == ';')
+ first = nret = 0; /* return no values */
+ else {
+ nret = explist1(ls, &e); /* optional return values */
+ if (e.k == VCALL) {
+ luaK_setcallreturns(fs, &e, LUA_MULTRET);
+ if (nret == 1) { /* tail call? */
+ SET_OPCODE(getcode(fs,&e), OP_TAILCALL);
+ lua_assert(GETARG_A(getcode(fs,&e)) == fs->nactvar);
+ }
+ first = fs->nactvar;
+ nret = LUA_MULTRET; /* return all values */
+ }
+ else {
+ if (nret == 1) /* only one single value? */
+ first = luaK_exp2anyreg(fs, &e);
+ else {
+ luaK_exp2nextreg(fs, &e); /* values must go to the `stack' */
+ first = fs->nactvar; /* return all `active' values */
+ lua_assert(nret == fs->freereg - first);
+ }
+ }
+ }
+ luaK_codeABC(fs, OP_RETURN, first, nret+1, 0);
+}
+
+
+static void breakstat (LexState *ls) {
+ /* stat -> BREAK [NAME] */
+ FuncState *fs = ls->fs;
+ BlockCnt *bl = fs->bl;
+ int upval = 0;
+ next(ls); /* skip BREAK */
+ while (bl && !bl->isbreakable) {
+ upval |= bl->upval;
+ bl = bl->previous;
+ }
+ if (!bl)
+ luaX_syntaxerror(ls, "no loop to break");
+ if (upval)
+ luaK_codeABC(fs, OP_CLOSE, bl->nactvar, 0, 0);
+ luaK_concat(fs, &bl->breaklist, luaK_jump(fs));
+}
+
+
+static int statement (LexState *ls) {
+ int line = ls->linenumber; /* may be needed for error messages */
+ switch (ls->t.token) {
+ case TK_IF: { /* stat -> ifstat */
+ ifstat(ls, line);
+ return 0;
+ }
+ case TK_WHILE: { /* stat -> whilestat */
+ whilestat(ls, line);
+ return 0;
+ }
+ case TK_DO: { /* stat -> DO block END */
+ next(ls); /* skip DO */
+ block(ls);
+ check_match(ls, TK_END, TK_DO, line);
+ return 0;
+ }
+ case TK_FOR: { /* stat -> forstat */
+ forstat(ls, line);
+ return 0;
+ }
+ case TK_REPEAT: { /* stat -> repeatstat */
+ repeatstat(ls, line);
+ return 0;
+ }
+ case TK_FUNCTION: {
+ funcstat(ls, line); /* stat -> funcstat */
+ return 0;
+ }
+ case TK_LOCAL: { /* stat -> localstat */
+ next(ls); /* skip LOCAL */
+ if (testnext(ls, TK_FUNCTION)) /* local function? */
+ localfunc(ls);
+ else
+ localstat(ls);
+ return 0;
+ }
+ case TK_RETURN: { /* stat -> retstat */
+ retstat(ls);
+ return 1; /* must be last statement */
+ }
+ case TK_BREAK: { /* stat -> breakstat */
+ breakstat(ls);
+ return 1; /* must be last statement */
+ }
+ default: {
+ exprstat(ls);
+ return 0; /* to avoid warnings */
+ }
+ }
+}
+
+
+static void chunk (LexState *ls) {
+ /* chunk -> { stat [`;'] } */
+ int islast = 0;
+ enterlevel(ls);
+ while (!islast && !block_follow(ls->t.token)) {
+ islast = statement(ls);
+ testnext(ls, ';');
+ lua_assert(ls->fs->freereg >= ls->fs->nactvar);
+ ls->fs->freereg = ls->fs->nactvar; /* free registers */
+ }
+ leavelevel(ls);
+}
+
+/* }====================================================================== */
--- /dev/null
+/*
+** $Id: lparser.h,v 1.47 2003/02/11 10:46:24 roberto Exp $
+** Lua Parser
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lparser_h
+#define lparser_h
+
+#include "llimits.h"
+#include "lobject.h"
+#include "ltable.h"
+#include "lzio.h"
+
+
+/*
+** Expression descriptor
+*/
+
+typedef enum {
+ VVOID, /* no value */
+ VNIL,
+ VTRUE,
+ VFALSE,
+ VK, /* info = index of constant in `k' */
+ VLOCAL, /* info = local register */
+ VUPVAL, /* info = index of upvalue in `upvalues' */
+ VGLOBAL, /* info = index of table; aux = index of global name in `k' */
+ VINDEXED, /* info = table register; aux = index register (or `k') */
+ VJMP, /* info = instruction pc */
+ VRELOCABLE, /* info = instruction pc */
+ VNONRELOC, /* info = result register */
+ VCALL /* info = result register */
+} expkind;
+
+typedef struct expdesc {
+ expkind k;
+ int info, aux;
+ int t; /* patch list of `exit when true' */
+ int f; /* patch list of `exit when false' */
+} expdesc;
+
+
+struct BlockCnt; /* defined in lparser.c */
+
+
+/* state needed to generate code for a given function */
+typedef struct FuncState {
+ Proto *f; /* current function header */
+ Table *h; /* table to find (and reuse) elements in `k' */
+ struct FuncState *prev; /* enclosing function */
+ struct LexState *ls; /* lexical state */
+ struct lua_State *L; /* copy of the Lua state */
+ struct BlockCnt *bl; /* chain of current blocks */
+ int pc; /* next position to code (equivalent to `ncode') */
+ int lasttarget; /* `pc' of last `jump target' */
+ int jpc; /* list of pending jumps to `pc' */
+ int freereg; /* first free register */
+ int nk; /* number of elements in `k' */
+ int np; /* number of elements in `p' */
+ int nlocvars; /* number of elements in `locvars' */
+ int nactvar; /* number of active local variables */
+ expdesc upvalues[MAXUPVALUES]; /* upvalues */
+ int actvar[MAXVARS]; /* declared-variable stack */
+} FuncState;
+
+
+Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff);
+
+
+#endif
--- /dev/null
+/*
+** $Id: lstate.c,v 1.123 2003/04/03 13:35:34 roberto Exp $
+** Global State
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdlib.h>
+
+#define lstate_c
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lgc.h"
+#include "llex.h"
+#include "lmem.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+
+
+/*
+** macro to allow the inclusion of user information in Lua state
+*/
+#ifndef LUA_USERSTATE
+#define EXTRASPACE 0
+#else
+union UEXTRASPACE {L_Umaxalign a; LUA_USERSTATE b;};
+#define EXTRASPACE (sizeof(union UEXTRASPACE))
+#endif
+
+
+
+/*
+** you can change this function through the official API:
+** call `lua_setpanicf'
+*/
+static int default_panic (lua_State *L) {
+ UNUSED(L);
+ return 0;
+}
+
+
+static lua_State *mallocstate (lua_State *L) {
+ lu_byte *block = (lu_byte *)luaM_malloc(L, sizeof(lua_State) + EXTRASPACE);
+ if (block == NULL) return NULL;
+ else {
+ block += EXTRASPACE;
+ return cast(lua_State *, block);
+ }
+}
+
+
+static void freestate (lua_State *L, lua_State *L1) {
+ luaM_free(L, cast(lu_byte *, L1) - EXTRASPACE,
+ sizeof(lua_State) + EXTRASPACE);
+}
+
+
+static void stack_init (lua_State *L1, lua_State *L) {
+ L1->stack = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, TObject);
+ L1->stacksize = BASIC_STACK_SIZE + EXTRA_STACK;
+ L1->top = L1->stack;
+ L1->stack_last = L1->stack+(L1->stacksize - EXTRA_STACK)-1;
+ L1->base_ci = luaM_newvector(L, BASIC_CI_SIZE, CallInfo);
+ L1->ci = L1->base_ci;
+ L1->ci->state = CI_C; /* not a Lua function */
+ setnilvalue(L1->top++); /* `function' entry for this `ci' */
+ L1->base = L1->ci->base = L1->top;
+ L1->ci->top = L1->top + LUA_MINSTACK;
+ L1->size_ci = BASIC_CI_SIZE;
+ L1->end_ci = L1->base_ci + L1->size_ci;
+}
+
+
+static void freestack (lua_State *L, lua_State *L1) {
+ luaM_freearray(L, L1->base_ci, L1->size_ci, CallInfo);
+ luaM_freearray(L, L1->stack, L1->stacksize, TObject);
+}
+
+
+/*
+** open parts that may cause memory-allocation errors
+*/
+static void f_luaopen (lua_State *L, void *ud) {
+ /* create a new global state */
+ global_State *g = luaM_new(NULL, global_State);
+ UNUSED(ud);
+ if (g == NULL) luaD_throw(L, LUA_ERRMEM);
+ L->l_G = g;
+ g->mainthread = L;
+ g->GCthreshold = 0; /* mark it as unfinished state */
+ g->strt.size = 0;
+ g->strt.nuse = 0;
+ g->strt.hash = NULL;
+ setnilvalue(defaultmeta(L));
+ setnilvalue(registry(L));
+ luaZ_initbuffer(L, &g->buff);
+ g->panic = default_panic;
+ g->rootgc = NULL;
+ g->rootudata = NULL;
+ g->tmudata = NULL;
+ setnilvalue(gkey(g->dummynode));
+ setnilvalue(gval(g->dummynode));
+ g->dummynode->next = NULL;
+ g->nblocks = sizeof(lua_State) + sizeof(global_State);
+ stack_init(L, L); /* init stack */
+ /* create default meta table with a dummy table, and then close the loop */
+ defaultmeta(L)->tt = LUA_TTABLE;
+ sethvalue(defaultmeta(L), luaH_new(L, 0, 0));
+ hvalue(defaultmeta(L))->metatable = hvalue(defaultmeta(L));
+ sethvalue(gt(L), luaH_new(L, 0, 4)); /* table of globals */
+ sethvalue(registry(L), luaH_new(L, 4, 4)); /* registry */
+ luaS_resize(L, MINSTRTABSIZE); /* initial size of string table */
+ luaT_init(L);
+ luaX_init(L);
+ luaS_fix(luaS_newliteral(L, MEMERRMSG));
+ g->GCthreshold = 4*G(L)->nblocks;
+}
+
+
+static void preinit_state (lua_State *L) {
+ L->stack = NULL;
+ L->stacksize = 0;
+ L->errorJmp = NULL;
+ L->hook = NULL;
+ L->hookmask = L->hookinit = 0;
+ L->basehookcount = 0;
+ L->allowhook = 1;
+ resethookcount(L);
+ L->openupval = NULL;
+ L->size_ci = 0;
+ L->nCcalls = 0;
+ L->base_ci = L->ci = NULL;
+ L->errfunc = 0;
+ setnilvalue(gt(L));
+}
+
+
+static void close_state (lua_State *L) {
+ luaF_close(L, L->stack); /* close all upvalues for this thread */
+ if (G(L)) { /* close global state */
+ luaC_sweep(L, 1); /* collect all elements */
+ lua_assert(G(L)->rootgc == NULL);
+ lua_assert(G(L)->rootudata == NULL);
+ luaS_freeall(L);
+ luaZ_freebuffer(L, &G(L)->buff);
+ }
+ freestack(L, L);
+ if (G(L)) {
+ lua_assert(G(L)->nblocks == sizeof(lua_State) + sizeof(global_State));
+ luaM_freelem(NULL, G(L));
+ }
+ freestate(NULL, L);
+}
+
+
+lua_State *luaE_newthread (lua_State *L) {
+ lua_State *L1 = mallocstate(L);
+ luaC_link(L, valtogco(L1), LUA_TTHREAD);
+ preinit_state(L1);
+ L1->l_G = L->l_G;
+ stack_init(L1, L); /* init stack */
+ setobj2n(gt(L1), gt(L)); /* share table of globals */
+ return L1;
+}
+
+
+void luaE_freethread (lua_State *L, lua_State *L1) {
+ luaF_close(L1, L1->stack); /* close all upvalues for this thread */
+ lua_assert(L1->openupval == NULL);
+ freestack(L, L1);
+ freestate(L, L1);
+}
+
+
+LUA_API lua_State *lua_open (void) {
+ lua_State *L = mallocstate(NULL);
+ if (L) { /* allocation OK? */
+ L->tt = LUA_TTHREAD;
+ L->marked = 0;
+ L->next = L->gclist = NULL;
+ preinit_state(L);
+ L->l_G = NULL;
+ if (luaD_rawrunprotected(L, f_luaopen, NULL) != 0) {
+ /* memory allocation error: free partial state */
+ close_state(L);
+ L = NULL;
+ }
+ }
+ lua_userstateopen(L);
+ return L;
+}
+
+
+static void callallgcTM (lua_State *L, void *ud) {
+ UNUSED(ud);
+ luaC_callGCTM(L); /* call GC metamethods for all udata */
+}
+
+
+LUA_API void lua_close (lua_State *L) {
+ lua_lock(L);
+ L = G(L)->mainthread; /* only the main thread can be closed */
+ luaF_close(L, L->stack); /* close all upvalues for this thread */
+ luaC_separateudata(L); /* separate udata that have GC metamethods */
+ L->errfunc = 0; /* no error function during GC metamethods */
+ do { /* repeat until no more errors */
+ L->ci = L->base_ci;
+ L->base = L->top = L->ci->base;
+ L->nCcalls = 0;
+ } while (luaD_rawrunprotected(L, callallgcTM, NULL) != 0);
+ lua_assert(G(L)->tmudata == NULL);
+ close_state(L);
+}
+
--- /dev/null
+/*
+** $Id: lstate.h,v 1.109 2003/02/27 11:52:30 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"
+
+
+/*
+** macros for thread synchronization inside Lua core machine:
+** all accesses to the global state and to global objects are synchronized.
+** Because threads can read the stack of other threads
+** (when running garbage collection),
+** a thread must also synchronize any write-access to its own stack.
+** Unsynchronized accesses are allowed only when reading its own stack,
+** or when reading immutable fields from global objects
+** (such as string values and udata values).
+*/
+#ifndef lua_lock
+#define lua_lock(L) ((void) 0)
+#endif
+
+#ifndef lua_unlock
+#define lua_unlock(L) ((void) 0)
+#endif
+
+
+#ifndef lua_userstateopen
+#define lua_userstateopen(l)
+#endif
+
+
+
+struct lua_longjmp; /* defined in ldo.c */
+
+
+/* default meta table (both for tables and udata) */
+#define defaultmeta(L) (&G(L)->_defaultmeta)
+
+/* table of globals */
+#define gt(L) (&L->_gt)
+
+/* registry */
+#define registry(L) (&G(L)->_registry)
+
+
+/* extra stack space to handle TM calls and some other extras */
+#define EXTRA_STACK 5
+
+
+#define BASIC_CI_SIZE 8
+
+#define BASIC_STACK_SIZE (2*LUA_MINSTACK)
+
+
+
+typedef struct stringtable {
+ GCObject **hash;
+ ls_nstr nuse; /* number of elements */
+ int size;
+} stringtable;
+
+
+/*
+** informations about a call
+*/
+typedef struct CallInfo {
+ StkId base; /* base for called function */
+ StkId top; /* top for this function */
+ int state; /* bit fields; see below */
+ union {
+ struct { /* for Lua functions */
+ const Instruction *savedpc;
+ const Instruction **pc; /* points to `pc' variable in `luaV_execute' */
+ int tailcalls; /* number of tail calls lost under this entry */
+ } l;
+ struct { /* for C functions */
+ int dummy; /* just to avoid an empty struct */
+ } c;
+ } u;
+} CallInfo;
+
+
+/*
+** bit fields for `CallInfo.state'
+*/
+#define CI_C (1<<0) /* 1 if function is a C function */
+/* 1 if (Lua) function has an active `luaV_execute' running it */
+#define CI_HASFRAME (1<<1)
+/* 1 if Lua function is calling another Lua function (and therefore its
+ `pc' is being used by the other, and therefore CI_SAVEDPC is 1 too) */
+#define CI_CALLING (1<<2)
+#define CI_SAVEDPC (1<<3) /* 1 if `savedpc' is updated */
+#define CI_YIELD (1<<4) /* 1 if thread is suspended */
+
+
+#define ci_func(ci) (clvalue((ci)->base - 1))
+
+
+/*
+** `global state', shared by all threads of this state
+*/
+typedef struct global_State {
+ stringtable strt; /* hash table for strings */
+ GCObject *rootgc; /* list of (almost) all collectable objects */
+ GCObject *rootudata; /* (separated) list of all userdata */
+ GCObject *tmudata; /* list of userdata to be GC */
+ Mbuffer buff; /* temporary buffer for string concatentation */
+ lu_mem GCthreshold;
+ lu_mem nblocks; /* number of `bytes' currently allocated */
+ lua_CFunction panic; /* to be called in unprotected errors */
+ TObject _registry;
+ TObject _defaultmeta;
+ struct lua_State *mainthread;
+ Node dummynode[1]; /* common node array for all empty tables */
+ TString *tmname[TM_N]; /* array with tag-method names */
+} global_State;
+
+
+/*
+** `per thread' state
+*/
+struct lua_State {
+ CommonHeader;
+ StkId top; /* first free slot in the stack */
+ StkId base; /* base of current function */
+ global_State *l_G;
+ CallInfo *ci; /* call info for current function */
+ StkId stack_last; /* last free slot in the stack */
+ StkId stack; /* stack base */
+ int stacksize;
+ CallInfo *end_ci; /* points after end of ci array*/
+ CallInfo *base_ci; /* array of CallInfo's */
+ unsigned short size_ci; /* size of array `base_ci' */
+ unsigned short nCcalls; /* number of nested C calls */
+ lu_byte hookmask;
+ lu_byte allowhook;
+ lu_byte hookinit;
+ int basehookcount;
+ int hookcount;
+ lua_Hook hook;
+ TObject _gt; /* table of globals */
+ GCObject *openupval; /* list of open upvalues in this stack */
+ GCObject *gclist;
+ struct lua_longjmp *errorJmp; /* current error recover point */
+ ptrdiff_t errfunc; /* current error handling function (stack index) */
+};
+
+
+#define G(L) (L->l_G)
+
+
+/*
+** Union of all collectable objects
+*/
+union GCObject {
+ GCheader gch;
+ union TString ts;
+ union Udata u;
+ union Closure cl;
+ struct Table h;
+ struct Proto p;
+ struct UpVal uv;
+ struct lua_State th; /* thread */
+};
+
+
+/* macros to convert a GCObject into a specific value */
+#define gcotots(o) check_exp((o)->gch.tt == LUA_TSTRING, &((o)->ts))
+#define gcotou(o) check_exp((o)->gch.tt == LUA_TUSERDATA, &((o)->u))
+#define gcotocl(o) check_exp((o)->gch.tt == LUA_TFUNCTION, &((o)->cl))
+#define gcotoh(o) check_exp((o)->gch.tt == LUA_TTABLE, &((o)->h))
+#define gcotop(o) check_exp((o)->gch.tt == LUA_TPROTO, &((o)->p))
+#define gcotouv(o) check_exp((o)->gch.tt == LUA_TUPVAL, &((o)->uv))
+#define ngcotouv(o) \
+ check_exp((o) == NULL || (o)->gch.tt == LUA_TUPVAL, &((o)->uv))
+#define gcototh(o) check_exp((o)->gch.tt == LUA_TTHREAD, &((o)->th))
+
+/* macro to convert any value into a GCObject */
+#define valtogco(v) (cast(GCObject *, (v)))
+
+
+lua_State *luaE_newthread (lua_State *L);
+void luaE_freethread (lua_State *L, lua_State *L1);
+
+#endif
+
--- /dev/null
+/*
+** $Id: lstring.c,v 1.78 2002/12/04 17:38:31 roberto Exp $
+** String table (keeps all strings handled by Lua)
+** See Copyright Notice in lua.h
+*/
+
+
+#include <string.h>
+
+#define lstring_c
+
+#include "lua.h"
+
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+#include "lstring.h"
+
+
+
+void luaS_freeall (lua_State *L) {
+ lua_assert(G(L)->strt.nuse==0);
+ luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size, TString *);
+}
+
+
+void luaS_resize (lua_State *L, int newsize) {
+ GCObject **newhash = luaM_newvector(L, newsize, GCObject *);
+ stringtable *tb = &G(L)->strt;
+ int i;
+ for (i=0; i<newsize; i++) newhash[i] = NULL;
+ /* rehash */
+ for (i=0; i<tb->size; i++) {
+ GCObject *p = tb->hash[i];
+ while (p) { /* for each node in the list */
+ GCObject *next = p->gch.next; /* save next */
+ lu_hash h = gcotots(p)->tsv.hash;
+ int h1 = lmod(h, newsize); /* new position */
+ lua_assert(cast(int, h%newsize) == lmod(h, newsize));
+ p->gch.next = newhash[h1]; /* chain it */
+ newhash[h1] = p;
+ p = next;
+ }
+ }
+ luaM_freearray(L, tb->hash, tb->size, TString *);
+ tb->size = newsize;
+ tb->hash = newhash;
+}
+
+
+static TString *newlstr (lua_State *L, const char *str, size_t l, lu_hash h) {
+ TString *ts = cast(TString *, luaM_malloc(L, sizestring(l)));
+ stringtable *tb;
+ ts->tsv.len = l;
+ ts->tsv.hash = h;
+ ts->tsv.marked = 0;
+ ts->tsv.tt = LUA_TSTRING;
+ ts->tsv.reserved = 0;
+ memcpy(ts+1, str, l*sizeof(char));
+ ((char *)(ts+1))[l] = '\0'; /* ending 0 */
+ tb = &G(L)->strt;
+ h = lmod(h, tb->size);
+ ts->tsv.next = tb->hash[h]; /* chain new entry */
+ tb->hash[h] = valtogco(ts);
+ tb->nuse++;
+ if (tb->nuse > cast(ls_nstr, tb->size) && tb->size <= MAX_INT/2)
+ luaS_resize(L, tb->size*2); /* too crowded */
+ return ts;
+}
+
+
+TString *luaS_newlstr (lua_State *L, const char *str, size_t l) {
+ GCObject *o;
+ lu_hash h = (lu_hash)l; /* seed */
+ size_t step = (l>>5)+1; /* if string is too long, don't hash all its chars */
+ size_t l1;
+ for (l1=l; l1>=step; l1-=step) /* compute hash */
+ h = h ^ ((h<<5)+(h>>2)+(unsigned char)(str[l1-1]));
+ for (o = G(L)->strt.hash[lmod(h, G(L)->strt.size)];
+ o != NULL;
+ o = o->gch.next) {
+ TString *ts = gcotots(o);
+ if (ts->tsv.len == l && (memcmp(str, getstr(ts), l) == 0))
+ return ts;
+ }
+ return newlstr(L, str, l, h); /* not found */
+}
+
+
+Udata *luaS_newudata (lua_State *L, size_t s) {
+ Udata *u;
+ u = cast(Udata *, luaM_malloc(L, sizeudata(s)));
+ u->uv.marked = (1<<1); /* is not finalized */
+ u->uv.tt = LUA_TUSERDATA;
+ u->uv.len = s;
+ u->uv.metatable = hvalue(defaultmeta(L));
+ /* chain it on udata list */
+ u->uv.next = G(L)->rootudata;
+ G(L)->rootudata = valtogco(u);
+ return u;
+}
+
--- /dev/null
+/*
+** $Id: lstring.h,v 1.37 2002/08/16 14:45:55 roberto Exp $
+** String table (keep all strings handled by Lua)
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lstring_h
+#define lstring_h
+
+
+#include "lobject.h"
+#include "lstate.h"
+
+
+
+#define sizestring(l) (cast(lu_mem, sizeof(union TString))+ \
+ (cast(lu_mem, l)+1)*sizeof(char))
+
+#define sizeudata(l) (cast(lu_mem, sizeof(union Udata))+(l))
+
+#define luaS_new(L, s) (luaS_newlstr(L, s, strlen(s)))
+#define luaS_newliteral(L, s) (luaS_newlstr(L, "" s, \
+ (sizeof(s)/sizeof(char))-1))
+
+#define luaS_fix(s) ((s)->tsv.marked |= (1<<4))
+
+void luaS_resize (lua_State *L, int newsize);
+Udata *luaS_newudata (lua_State *L, size_t s);
+void luaS_freeall (lua_State *L);
+TString *luaS_newlstr (lua_State *L, const char *str, size_t l);
+
+
+#endif
--- /dev/null
+/*
+** $Id: ltable.c,v 1.132 2003/04/03 13:35:34 roberto Exp $
+** Lua tables (hash)
+** See Copyright Notice in lua.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 at
+** least half the slots between 0 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.
+** In other words, there are collisions only when two elements have the
+** same main position (i.e. the same hash values for that table size).
+** Because of that, the load factor of these tables can be 100% without
+** performance penalties.
+*/
+
+#include <string.h>
+
+#define ltable_c
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lgc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+#include "ltable.h"
+
+
+/*
+** max size of array part is 2^MAXBITS
+*/
+#if BITS_INT > 26
+#define MAXBITS 24
+#else
+#define MAXBITS (BITS_INT-2)
+#endif
+
+/* check whether `x' < 2^MAXBITS */
+#define toobig(x) ((((x)-1) >> MAXBITS) != 0)
+
+
+/* function to convert a lua_Number to int (with any rounding method) */
+#ifndef lua_number2int
+#define lua_number2int(i,n) ((i)=(int)(n))
+#endif
+
+
+#define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t))))
+
+#define hashstr(t,str) hashpow2(t, (str)->tsv.hash)
+#define hashboolean(t,p) hashpow2(t, p)
+
+
+/*
+** 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, IntPoint(p))
+
+
+/*
+** number of ints inside a lua_Number
+*/
+#define numints cast(int, sizeof(lua_Number)/sizeof(int))
+
+
+/*
+** hash for lua_Numbers
+*/
+static Node *hashnum (const Table *t, lua_Number n) {
+ unsigned int a[numints];
+ int i;
+ n += 1; /* normalize number (avoid -0) */
+ lua_assert(sizeof(a) <= sizeof(n));
+ memcpy(a, &n, sizeof(a));
+ for (i = 1; i < numints; i++) a[0] += a[i];
+ return hashmod(t, cast(lu_hash, a[0]));
+}
+
+
+
+/*
+** returns the `main' position of an element in a table (that is, the index
+** of its hash value)
+*/
+Node *luaH_mainposition (const Table *t, const TObject *key) {
+ switch (ttype(key)) {
+ case LUA_TNUMBER:
+ return hashnum(t, nvalue(key));
+ case LUA_TSTRING:
+ return hashstr(t, tsvalue(key));
+ case LUA_TBOOLEAN:
+ return hashboolean(t, bvalue(key));
+ case LUA_TLIGHTUSERDATA:
+ return hashpointer(t, pvalue(key));
+ default:
+ 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, -1 otherwise.
+*/
+static int arrayindex (const TObject *key) {
+ if (ttisnumber(key)) {
+ int k;
+ lua_number2int(k, (nvalue(key)));
+ if (cast(lua_Number, k) == nvalue(key) && k >= 1 && !toobig(k))
+ return k;
+ }
+ return -1; /* `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 and end of a traversal are signalled by -1.
+*/
+static int luaH_index (lua_State *L, Table *t, StkId key) {
+ int i;
+ if (ttisnil(key)) return -1; /* first iteration */
+ i = arrayindex(key);
+ if (0 <= i && i <= t->sizearray) { /* is `key' inside array part? */
+ return i-1; /* yes; that's the index (corrected to C) */
+ }
+ else {
+ const TObject *v = luaH_get(t, key);
+ if (v == &luaO_nilobject)
+ luaG_runerror(L, "invalid key for `next'");
+ i = cast(int, (cast(const lu_byte *, v) -
+ cast(const lu_byte *, gval(gnode(t, 0)))) / sizeof(Node));
+ return i + t->sizearray; /* hash elements are numbered after array ones */
+ }
+}
+
+
+int luaH_next (lua_State *L, Table *t, StkId key) {
+ int i = luaH_index(L, t, key); /* find original element */
+ for (i++; i < t->sizearray; i++) { /* try first array part */
+ if (!ttisnil(&t->array[i])) { /* a non-nil value? */
+ setnvalue(key, cast(lua_Number, i+1));
+ setobj2s(key+1, &t->array[i]);
+ return 1;
+ }
+ }
+ for (i -= t->sizearray; i < sizenode(t); i++) { /* then hash part */
+ if (!ttisnil(gval(gnode(t, i)))) { /* a non-nil value? */
+ setobj2s(key, gkey(gnode(t, i)));
+ setobj2s(key+1, gval(gnode(t, i)));
+ return 1;
+ }
+ }
+ return 0; /* no more elements */
+}
+
+
+/*
+** {=============================================================
+** Rehash
+** ==============================================================
+*/
+
+
+static void computesizes (int nums[], int ntotal, int *narray, int *nhash) {
+ int i;
+ int a = nums[0]; /* number of elements smaller than 2^i */
+ int na = a; /* number of elements to go to array part */
+ int n = (na == 0) ? -1 : 0; /* (log of) optimal size for array part */
+ for (i = 1; a < *narray && *narray >= twoto(i-1); i++) {
+ if (nums[i] > 0) {
+ a += nums[i];
+ if (a >= twoto(i-1)) { /* more than half elements in use? */
+ n = i;
+ na = a;
+ }
+ }
+ }
+ lua_assert(na <= *narray && *narray <= ntotal);
+ *nhash = ntotal - na;
+ *narray = (n == -1) ? 0 : twoto(n);
+ lua_assert(na <= *narray && na >= *narray/2);
+}
+
+
+static void numuse (const Table *t, int *narray, int *nhash) {
+ int nums[MAXBITS+1];
+ int i, lg;
+ int totaluse = 0;
+ /* count elements in array part */
+ for (i=0, lg=0; lg<=MAXBITS; lg++) { /* for each slice [2^(lg-1) to 2^lg) */
+ int ttlg = twoto(lg); /* 2^lg */
+ if (ttlg > t->sizearray) {
+ ttlg = t->sizearray;
+ if (i >= ttlg) break;
+ }
+ nums[lg] = 0;
+ for (; i<ttlg; i++) {
+ if (!ttisnil(&t->array[i])) {
+ nums[lg]++;
+ totaluse++;
+ }
+ }
+ }
+ for (; lg<=MAXBITS; lg++) nums[lg] = 0; /* reset other counts */
+ *narray = totaluse; /* all previous uses were in array part */
+ /* count elements in hash part */
+ i = sizenode(t);
+ while (i--) {
+ Node *n = &t->node[i];
+ if (!ttisnil(gval(n))) {
+ int k = arrayindex(gkey(n));
+ if (k >= 0) { /* is `key' an appropriate array index? */
+ nums[luaO_log2(k-1)+1]++; /* count as such */
+ (*narray)++;
+ }
+ totaluse++;
+ }
+ }
+ computesizes(nums, totaluse, narray, nhash);
+}
+
+
+static void setarrayvector (lua_State *L, Table *t, int size) {
+ int i;
+ luaM_reallocvector(L, t->array, t->sizearray, size, TObject);
+ for (i=t->sizearray; i<size; i++)
+ setnilvalue(&t->array[i]);
+ t->sizearray = size;
+}
+
+
+static void setnodevector (lua_State *L, Table *t, int lsize) {
+ int i;
+ int size = twoto(lsize);
+ if (lsize > MAXBITS)
+ luaG_runerror(L, "table overflow");
+ if (lsize == 0) { /* no elements to hash part? */
+ t->node = G(L)->dummynode; /* use common `dummynode' */
+ lua_assert(ttisnil(gkey(t->node))); /* assert invariants: */
+ lua_assert(ttisnil(gval(t->node)));
+ lua_assert(t->node->next == NULL); /* (`dummynode' must be empty) */
+ }
+ else {
+ t->node = luaM_newvector(L, size, Node);
+ for (i=0; i<size; i++) {
+ t->node[i].next = NULL;
+ setnilvalue(gkey(gnode(t, i)));
+ setnilvalue(gval(gnode(t, i)));
+ }
+ }
+ t->lsizenode = cast(lu_byte, lsize);
+ t->firstfree = gnode(t, size-1); /* first free position to be used */
+}
+
+
+static void resize (lua_State *L, Table *t, int nasize, int nhsize) {
+ int i;
+ int oldasize = t->sizearray;
+ int oldhsize = t->lsizenode;
+ Node *nold;
+ Node temp[1];
+ if (oldhsize)
+ nold = t->node; /* save old hash ... */
+ else { /* old hash is `dummynode' */
+ lua_assert(t->node == G(L)->dummynode);
+ temp[0] = t->node[0]; /* copy it to `temp' */
+ nold = temp;
+ setnilvalue(gkey(G(L)->dummynode)); /* restate invariant */
+ setnilvalue(gval(G(L)->dummynode));
+ lua_assert(G(L)->dummynode->next == NULL);
+ }
+ if (nasize > oldasize) /* array part must grow? */
+ setarrayvector(L, t, nasize);
+ /* create new hash part with appropriate size */
+ setnodevector(L, t, nhsize);
+ /* re-insert elements */
+ 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]))
+ setobjt2t(luaH_setnum(L, t, i+1), &t->array[i]);
+ }
+ /* shrink array */
+ luaM_reallocvector(L, t->array, oldasize, nasize, TObject);
+ }
+ /* re-insert elements in hash part */
+ for (i = twoto(oldhsize) - 1; i >= 0; i--) {
+ Node *old = nold+i;
+ if (!ttisnil(gval(old)))
+ setobjt2t(luaH_set(L, t, gkey(old)), gval(old));
+ }
+ if (oldhsize)
+ luaM_freearray(L, nold, twoto(oldhsize), Node); /* free old array */
+}
+
+
+static void rehash (lua_State *L, Table *t) {
+ int nasize, nhsize;
+ numuse(t, &nasize, &nhsize); /* compute new sizes for array and hash parts */
+ resize(L, t, nasize, luaO_log2(nhsize)+1);
+}
+
+
+
+/*
+** }=============================================================
+*/
+
+
+Table *luaH_new (lua_State *L, int narray, int lnhash) {
+ Table *t = luaM_new(L, Table);
+ luaC_link(L, valtogco(t), LUA_TTABLE);
+ t->metatable = hvalue(defaultmeta(L));
+ t->flags = cast(lu_byte, ~0);
+ /* temporary values (kept only if some malloc fails) */
+ t->array = NULL;
+ t->sizearray = 0;
+ t->lsizenode = 0;
+ t->node = NULL;
+ setarrayvector(L, t, narray);
+ setnodevector(L, t, lnhash);
+ return t;
+}
+
+
+void luaH_free (lua_State *L, Table *t) {
+ if (t->lsizenode)
+ luaM_freearray(L, t->node, sizenode(t), Node);
+ luaM_freearray(L, t->array, t->sizearray, TObject);
+ luaM_freelem(L, t);
+}
+
+
+#if 0
+/*
+** try to remove an element from a hash table; cannot move any element
+** (because gc can call `remove' during a table traversal)
+*/
+void luaH_remove (Table *t, Node *e) {
+ Node *mp = luaH_mainposition(t, gkey(e));
+ if (e != mp) { /* element not in its main position? */
+ while (mp->next != e) mp = mp->next; /* find previous */
+ mp->next = e->next; /* remove `e' from its list */
+ }
+ else {
+ if (e->next != NULL) ??
+ }
+ lua_assert(ttisnil(gval(node)));
+ setnilvalue(gkey(e)); /* clear node `e' */
+ e->next = NULL;
+}
+#endif
+
+
+/*
+** inserts a new key into a hash table; first, check whether key's main
+** position is free. If not, check whether colliding node is in its main
+** position or not: if it is not, move colliding node to an empty place and
+** put new key in its main position; otherwise (colliding node is in its main
+** position), new key goes to an empty position.
+*/
+static TObject *newkey (lua_State *L, Table *t, const TObject *key) {
+ TObject *val;
+ Node *mp = luaH_mainposition(t, key);
+ if (!ttisnil(gval(mp))) { /* main position is not free? */
+ Node *othern = luaH_mainposition(t, gkey(mp)); /* `mp' of colliding node */
+ Node *n = t->firstfree; /* get a free place */
+ if (othern != mp) { /* is colliding node out of its main position? */
+ /* yes; move colliding node into free position */
+ while (othern->next != mp) othern = othern->next; /* find previous */
+ othern->next = n; /* redo the chain with `n' in place of `mp' */
+ *n = *mp; /* copy colliding node into free pos. (mp->next also goes) */
+ mp->next = NULL; /* now `mp' is free */
+ setnilvalue(gval(mp));
+ }
+ else { /* colliding node is in its own main position */
+ /* new node will go into free position */
+ n->next = mp->next; /* chain new position */
+ mp->next = n;
+ mp = n;
+ }
+ }
+ setobj2t(gkey(mp), key); /* write barrier */
+ lua_assert(ttisnil(gval(mp)));
+ for (;;) { /* correct `firstfree' */
+ if (ttisnil(gkey(t->firstfree)))
+ return gval(mp); /* OK; table still has a free place */
+ else if (t->firstfree == t->node) break; /* cannot decrement from here */
+ else (t->firstfree)--;
+ }
+ /* no more free places; must create one */
+ setbvalue(gval(mp), 0); /* avoid new key being removed */
+ rehash(L, t); /* grow table */
+ val = cast(TObject *, luaH_get(t, key)); /* get new position */
+ lua_assert(ttisboolean(val));
+ setnilvalue(val);
+ return val;
+}
+
+
+/*
+** generic search function
+*/
+static const TObject *luaH_getany (Table *t, const TObject *key) {
+ if (ttisnil(key)) return &luaO_nilobject;
+ else {
+ Node *n = luaH_mainposition(t, key);
+ do { /* check whether `key' is somewhere in the chain */
+ if (luaO_rawequalObj(gkey(n), key)) return gval(n); /* that's it */
+ else n = n->next;
+ } while (n);
+ return &luaO_nilobject;
+ }
+}
+
+
+/*
+** search function for integers
+*/
+const TObject *luaH_getnum (Table *t, int key) {
+ if (1 <= key && key <= t->sizearray)
+ return &t->array[key-1];
+ else {
+ lua_Number nk = cast(lua_Number, key);
+ Node *n = hashnum(t, nk);
+ do { /* check whether `key' is somewhere in the chain */
+ if (ttisnumber(gkey(n)) && nvalue(gkey(n)) == nk)
+ return gval(n); /* that's it */
+ else n = n->next;
+ } while (n);
+ return &luaO_nilobject;
+ }
+}
+
+
+/*
+** search function for strings
+*/
+const TObject *luaH_getstr (Table *t, TString *key) {
+ Node *n = hashstr(t, key);
+ do { /* check whether `key' is somewhere in the chain */
+ if (ttisstring(gkey(n)) && tsvalue(gkey(n)) == key)
+ return gval(n); /* that's it */
+ else n = n->next;
+ } while (n);
+ return &luaO_nilobject;
+}
+
+
+/*
+** main search function
+*/
+const TObject *luaH_get (Table *t, const TObject *key) {
+ switch (ttype(key)) {
+ case LUA_TSTRING: return luaH_getstr(t, tsvalue(key));
+ case LUA_TNUMBER: {
+ int k;
+ lua_number2int(k, (nvalue(key)));
+ if (cast(lua_Number, k) == nvalue(key)) /* is an integer index? */
+ return luaH_getnum(t, k); /* use specialized version */
+ /* else go through */
+ }
+ default: return luaH_getany(t, key);
+ }
+}
+
+
+TObject *luaH_set (lua_State *L, Table *t, const TObject *key) {
+ const TObject *p = luaH_get(t, key);
+ t->flags = 0;
+ if (p != &luaO_nilobject)
+ return cast(TObject *, p);
+ else {
+ if (ttisnil(key)) luaG_runerror(L, "table index is nil");
+ else if (ttisnumber(key) && nvalue(key) != nvalue(key))
+ luaG_runerror(L, "table index is NaN");
+ return newkey(L, t, key);
+ }
+}
+
+
+TObject *luaH_setnum (lua_State *L, Table *t, int key) {
+ const TObject *p = luaH_getnum(t, key);
+ if (p != &luaO_nilobject)
+ return cast(TObject *, p);
+ else {
+ TObject k;
+ setnvalue(&k, cast(lua_Number, key));
+ return newkey(L, t, &k);
+ }
+}
+
--- /dev/null
+/*
+** $Id: ltable.h,v 1.44 2003/03/18 12:50:04 roberto Exp $
+** Lua tables (hash)
+** See Copyright Notice in lua.h
+*/
+
+#ifndef ltable_h
+#define ltable_h
+
+#include "lobject.h"
+
+
+#define gnode(t,i) (&(t)->node[i])
+#define gkey(n) (&(n)->i_key)
+#define gval(n) (&(n)->i_val)
+
+
+const TObject *luaH_getnum (Table *t, int key);
+TObject *luaH_setnum (lua_State *L, Table *t, int key);
+const TObject *luaH_getstr (Table *t, TString *key);
+const TObject *luaH_get (Table *t, const TObject *key);
+TObject *luaH_set (lua_State *L, Table *t, const TObject *key);
+Table *luaH_new (lua_State *L, int narray, int lnhash);
+void luaH_free (lua_State *L, Table *t);
+int luaH_next (lua_State *L, Table *t, StkId key);
+
+/* exported only for debugging */
+Node *luaH_mainposition (const Table *t, const TObject *key);
+
+
+#endif
--- /dev/null
+/*
+** $Id: ltests.c,v 1.158 2003/04/07 14:35:00 roberto Exp $
+** Internal Module for Debugging of the Lua Implementation
+** See Copyright Notice in lua.h
+*/
+
+
+#include <ctype.h>
+#include <limits.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define ltests_c
+
+#include "lua.h"
+
+#include "lapi.h"
+#include "lauxlib.h"
+#include "lcode.h"
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lmem.h"
+#include "lopcodes.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "lualib.h"
+
+
+
+/*
+** The whole module only makes sense with LUA_DEBUG on
+*/
+#ifdef LUA_DEBUG
+
+
+#define lua_pushintegral(L,i) lua_pushnumber(L, cast(lua_Number, (i)))
+
+
+static lua_State *lua_state = NULL;
+
+int islocked = 0;
+
+
+#define func_at(L,k) (L->ci->base+(k) - 1)
+
+
+static void setnameval (lua_State *L, const char *name, int val) {
+ lua_pushstring(L, name);
+ lua_pushintegral(L, val);
+ lua_settable(L, -3);
+}
+
+
+/*
+** {======================================================================
+** Controlled version for realloc.
+** =======================================================================
+*/
+
+#define MARK 0x55 /* 01010101 (a nice pattern) */
+
+#ifndef EXTERNMEMCHECK
+/* full memory check */
+#define HEADER (sizeof(L_Umaxalign)) /* ensures maximum alignment for HEADER */
+#define MARKSIZE 16 /* size of marks after each block */
+#define blockhead(b) (cast(char *, b) - HEADER)
+#define setsize(newblock, size) (*cast(size_t *, newblock) = size)
+#define checkblocksize(b, size) (size == (*cast(size_t *, blockhead(b))))
+#define fillmem(mem,size) memset(mem, -MARK, size)
+#else
+/* external memory check: don't do it twice */
+#define HEADER 0
+#define MARKSIZE 0
+#define blockhead(b) (b)
+#define setsize(newblock, size) /* empty */
+#define checkblocksize(b,size) (1)
+#define fillmem(mem,size) /* empty */
+#endif
+
+unsigned long memdebug_numblocks = 0;
+unsigned long memdebug_total = 0;
+unsigned long memdebug_maxmem = 0;
+unsigned long memdebug_memlimit = ULONG_MAX;
+
+
+static void *checkblock (void *block, size_t size) {
+ void *b = blockhead(block);
+ int i;
+ for (i=0;i<MARKSIZE;i++)
+ lua_assert(*(cast(char *, b)+HEADER+size+i) == MARK+i); /* corrupted block? */
+ return b;
+}
+
+
+static void freeblock (void *block, size_t size) {
+ if (block) {
+ lua_assert(checkblocksize(block, size));
+ block = checkblock(block, size);
+ fillmem(block, size+HEADER+MARKSIZE); /* erase block */
+ free(block); /* free original block */
+ memdebug_numblocks--;
+ memdebug_total -= size;
+ }
+}
+
+
+void *debug_realloc (void *block, size_t oldsize, size_t size) {
+ lua_assert(oldsize == 0 || checkblocksize(block, oldsize));
+ /* ISO does not specify what realloc(NULL, 0) does */
+ lua_assert(block != NULL || size > 0);
+ if (size == 0) {
+ freeblock(block, oldsize);
+ return NULL;
+ }
+ else if (size > oldsize && memdebug_total+size-oldsize > memdebug_memlimit)
+ return NULL; /* to test memory allocation errors */
+ else {
+ void *newblock;
+ int i;
+ size_t realsize = HEADER+size+MARKSIZE;
+ size_t commonsize = (oldsize < size) ? oldsize : size;
+ if (realsize < size) return NULL; /* overflow! */
+ newblock = malloc(realsize); /* alloc a new block */
+ if (newblock == NULL) return NULL;
+ if (block) {
+ memcpy(cast(char *, newblock)+HEADER, block, commonsize);
+ freeblock(block, oldsize); /* erase (and check) old copy */
+ }
+ /* initialize new part of the block with something `weird' */
+ fillmem(cast(char *, newblock)+HEADER+commonsize, size-commonsize);
+ memdebug_total += size;
+ if (memdebug_total > memdebug_maxmem)
+ memdebug_maxmem = memdebug_total;
+ memdebug_numblocks++;
+ setsize(newblock, size);
+ for (i=0;i<MARKSIZE;i++)
+ *(cast(char *, newblock)+HEADER+size+i) = cast(char, MARK+i);
+ return cast(char *, newblock)+HEADER;
+ }
+}
+
+
+/* }====================================================================== */
+
+
+
+/*
+** {======================================================
+** Disassembler
+** =======================================================
+*/
+
+
+static char *buildop (Proto *p, int pc, char *buff) {
+ Instruction i = p->code[pc];
+ OpCode o = GET_OPCODE(i);
+ const char *name = luaP_opnames[o];
+ int line = getline(p, pc);
+ sprintf(buff, "(%4d) %4d - ", line, pc);
+ switch (getOpMode(o)) {
+ case iABC:
+ sprintf(buff+strlen(buff), "%-12s%4d %4d %4d", name,
+ GETARG_A(i), GETARG_B(i), GETARG_C(i));
+ break;
+ case iABx:
+ sprintf(buff+strlen(buff), "%-12s%4d %4d", name, GETARG_A(i), GETARG_Bx(i));
+ break;
+ case iAsBx:
+ sprintf(buff+strlen(buff), "%-12s%4d %4d", name, GETARG_A(i), GETARG_sBx(i));
+ break;
+ }
+ return buff;
+}
+
+
+#if 0
+void luaI_printcode (Proto *pt, int size) {
+ int pc;
+ for (pc=0; pc<size; pc++) {
+ char buff[100];
+ printf("%s\n", buildop(pt, pc, buff));
+ }
+ printf("-------\n");
+}
+#endif
+
+
+static int listcode (lua_State *L) {
+ int pc;
+ Proto *p;
+ luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1),
+ 1, "Lua function expected");
+ p = clvalue(func_at(L, 1))->l.p;
+ lua_newtable(L);
+ setnameval(L, "maxstack", p->maxstacksize);
+ setnameval(L, "numparams", p->numparams);
+ for (pc=0; pc<p->sizecode; pc++) {
+ char buff[100];
+ lua_pushintegral(L, pc+1);
+ lua_pushstring(L, buildop(p, pc, buff));
+ lua_settable(L, -3);
+ }
+ return 1;
+}
+
+
+static int listk (lua_State *L) {
+ Proto *p;
+ int i;
+ luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1),
+ 1, "Lua function expected");
+ p = clvalue(func_at(L, 1))->l.p;
+ lua_newtable(L);
+ for (i=0; i<p->sizek; i++) {
+ lua_pushintegral(L, i+1);
+ luaA_pushobject(L, p->k+i);
+ lua_settable(L, -3);
+ }
+ return 1;
+}
+
+
+static int listlocals (lua_State *L) {
+ Proto *p;
+ int pc = luaL_checkint(L, 2) - 1;
+ int i = 0;
+ const char *name;
+ luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1),
+ 1, "Lua function expected");
+ p = clvalue(func_at(L, 1))->l.p;
+ while ((name = luaF_getlocalname(p, ++i, pc)) != NULL)
+ lua_pushstring(L, name);
+ return i-1;
+}
+
+/* }====================================================== */
+
+
+
+
+static int get_limits (lua_State *L) {
+ lua_newtable(L);
+ setnameval(L, "BITS_INT", BITS_INT);
+ setnameval(L, "LFPF", LFIELDS_PER_FLUSH);
+ setnameval(L, "MAXVARS", MAXVARS);
+ setnameval(L, "MAXPARAMS", MAXPARAMS);
+ setnameval(L, "MAXSTACK", MAXSTACK);
+ setnameval(L, "MAXUPVALUES", MAXUPVALUES);
+ return 1;
+}
+
+
+static int mem_query (lua_State *L) {
+ if (lua_isnone(L, 1)) {
+ lua_pushintegral(L, memdebug_total);
+ lua_pushintegral(L, memdebug_numblocks);
+ lua_pushintegral(L, memdebug_maxmem);
+ return 3;
+ }
+ else {
+ memdebug_memlimit = luaL_checkint(L, 1);
+ return 0;
+ }
+}
+
+
+static int hash_query (lua_State *L) {
+ if (lua_isnone(L, 2)) {
+ luaL_argcheck(L, lua_type(L, 1) == LUA_TSTRING, 1, "string expected");
+ lua_pushintegral(L, tsvalue(func_at(L, 1))->tsv.hash);
+ }
+ else {
+ TObject *o = func_at(L, 1);
+ Table *t;
+ luaL_checktype(L, 2, LUA_TTABLE);
+ t = hvalue(func_at(L, 2));
+ lua_pushintegral(L, luaH_mainposition(t, o) - t->node);
+ }
+ return 1;
+}
+
+
+static int stacklevel (lua_State *L) {
+ unsigned long a = 0;
+ lua_pushintegral(L, (int)(L->top - L->stack));
+ lua_pushintegral(L, (int)(L->stack_last - L->stack));
+ lua_pushintegral(L, (int)(L->ci - L->base_ci));
+ lua_pushintegral(L, (int)(L->end_ci - L->base_ci));
+ lua_pushintegral(L, (unsigned long)&a);
+ return 5;
+}
+
+
+static int table_query (lua_State *L) {
+ const Table *t;
+ int i = luaL_optint(L, 2, -1);
+ luaL_checktype(L, 1, LUA_TTABLE);
+ t = hvalue(func_at(L, 1));
+ if (i == -1) {
+ lua_pushintegral(L, t->sizearray);
+ lua_pushintegral(L, sizenode(t));
+ lua_pushintegral(L, t->firstfree - t->node);
+ }
+ else if (i < t->sizearray) {
+ lua_pushintegral(L, i);
+ luaA_pushobject(L, &t->array[i]);
+ lua_pushnil(L);
+ }
+ else if ((i -= t->sizearray) < sizenode(t)) {
+ if (!ttisnil(gval(gnode(t, i))) ||
+ ttisnil(gkey(gnode(t, i))) ||
+ ttisnumber(gkey(gnode(t, i)))) {
+ luaA_pushobject(L, gkey(gnode(t, i)));
+ }
+ else
+ lua_pushstring(L, "<undef>");
+ luaA_pushobject(L, gval(gnode(t, i)));
+ if (t->node[i].next)
+ lua_pushintegral(L, t->node[i].next - t->node);
+ else
+ lua_pushnil(L);
+ }
+ return 3;
+}
+
+
+static int string_query (lua_State *L) {
+ stringtable *tb = &G(L)->strt;
+ int s = luaL_optint(L, 2, 0) - 1;
+ if (s==-1) {
+ lua_pushintegral(L ,tb->nuse);
+ lua_pushintegral(L ,tb->size);
+ return 2;
+ }
+ else if (s < tb->size) {
+ GCObject *ts;
+ int n = 0;
+ for (ts = tb->hash[s]; ts; ts = ts->gch.next) {
+ setsvalue2s(L->top, gcotots(ts));
+ incr_top(L);
+ n++;
+ }
+ return n;
+ }
+ return 0;
+}
+
+
+static int tref (lua_State *L) {
+ int level = lua_gettop(L);
+ int lock = luaL_optint(L, 2, 1);
+ luaL_checkany(L, 1);
+ lua_pushvalue(L, 1);
+ lua_pushintegral(L, lua_ref(L, lock));
+ assert(lua_gettop(L) == level+1); /* +1 for result */
+ return 1;
+}
+
+static int getref (lua_State *L) {
+ int level = lua_gettop(L);
+ lua_getref(L, luaL_checkint(L, 1));
+ assert(lua_gettop(L) == level+1);
+ return 1;
+}
+
+static int unref (lua_State *L) {
+ int level = lua_gettop(L);
+ lua_unref(L, luaL_checkint(L, 1));
+ assert(lua_gettop(L) == level);
+ return 0;
+}
+
+static int metatable (lua_State *L) {
+ luaL_checkany(L, 1);
+ if (lua_isnone(L, 2)) {
+ if (lua_getmetatable(L, 1) == 0)
+ lua_pushnil(L);
+ }
+ else {
+ lua_settop(L, 2);
+ luaL_checktype(L, 2, LUA_TTABLE);
+ lua_setmetatable(L, 1);
+ }
+ return 1;
+}
+
+
+static int upvalue (lua_State *L) {
+ int n = luaL_checkint(L, 2);
+ luaL_checktype(L, 1, LUA_TFUNCTION);
+ if (lua_isnone(L, 3)) {
+ const char *name = lua_getupvalue(L, 1, n);
+ if (name == NULL) return 0;
+ lua_pushstring(L, name);
+ return 2;
+ }
+ else {
+ const char *name = lua_setupvalue(L, 1, n);
+ lua_pushstring(L, name);
+ return 1;
+ }
+}
+
+
+static int newuserdata (lua_State *L) {
+ size_t size = luaL_checkint(L, 1);
+ char *p = cast(char *, lua_newuserdata(L, size));
+ while (size--) *p++ = '\0';
+ return 1;
+}
+
+
+static int pushuserdata (lua_State *L) {
+ lua_pushlightuserdata(L, cast(void *, luaL_checkint(L, 1)));
+ return 1;
+}
+
+
+static int udataval (lua_State *L) {
+ lua_pushintegral(L, cast(int, lua_touserdata(L, 1)));
+ return 1;
+}
+
+
+static int doonnewstack (lua_State *L) {
+ lua_State *L1 = lua_newthread(L);
+ size_t l;
+ const char *s = luaL_checklstring(L, 1, &l);
+ int status = luaL_loadbuffer(L1, s, l, s);
+ if (status == 0)
+ status = lua_pcall(L1, 0, 0, 0);
+ lua_pushintegral(L, status);
+ return 1;
+}
+
+
+static int s2d (lua_State *L) {
+ lua_pushnumber(L, *cast(const double *, luaL_checkstring(L, 1)));
+ return 1;
+}
+
+static int d2s (lua_State *L) {
+ double d = luaL_checknumber(L, 1);
+ lua_pushlstring(L, cast(char *, &d), sizeof(d));
+ return 1;
+}
+
+
+static int newstate (lua_State *L) {
+ lua_State *L1 = lua_open();
+ if (L1) {
+ lua_userstateopen(L1); /* init lock */
+ lua_pushintegral(L, (unsigned long)L1);
+ }
+ else
+ lua_pushnil(L);
+ return 1;
+}
+
+
+static int loadlib (lua_State *L) {
+ static const luaL_reg libs[] = {
+ {"mathlibopen", luaopen_math},
+ {"strlibopen", luaopen_string},
+ {"iolibopen", luaopen_io},
+ {"tablibopen", luaopen_table},
+ {"dblibopen", luaopen_debug},
+ {"baselibopen", luaopen_base},
+ {NULL, NULL}
+ };
+ lua_State *L1 = cast(lua_State *,
+ cast(unsigned long, luaL_checknumber(L, 1)));
+ lua_pushvalue(L1, LUA_GLOBALSINDEX);
+ luaL_openlib(L1, NULL, libs, 0);
+ return 0;
+}
+
+static int closestate (lua_State *L) {
+ lua_State *L1 = cast(lua_State *, cast(unsigned long, luaL_checknumber(L, 1)));
+ lua_close(L1);
+ lua_unlock(L); /* close cannot unlock that */
+ return 0;
+}
+
+static int doremote (lua_State *L) {
+ lua_State *L1 = cast(lua_State *,cast(unsigned long,luaL_checknumber(L, 1)));
+ size_t lcode;
+ const char *code = luaL_checklstring(L, 2, &lcode);
+ int status;
+ lua_settop(L1, 0);
+ status = luaL_loadbuffer(L1, code, lcode, code);
+ if (status == 0)
+ status = lua_pcall(L1, 0, LUA_MULTRET, 0);
+ if (status != 0) {
+ lua_pushnil(L);
+ lua_pushintegral(L, status);
+ lua_pushstring(L, lua_tostring(L1, -1));
+ return 3;
+ }
+ else {
+ int i = 0;
+ while (!lua_isnone(L1, ++i))
+ lua_pushstring(L, lua_tostring(L1, i));
+ lua_pop(L1, i-1);
+ return i-1;
+ }
+}
+
+
+static int log2_aux (lua_State *L) {
+ lua_pushintegral(L, luaO_log2(luaL_checkint(L, 1)));
+ return 1;
+}
+
+static int int2fb_aux (lua_State *L) {
+ int b = luaO_int2fb(luaL_checkint(L, 1));
+ lua_pushintegral(L, b);
+ lua_pushintegral(L, fb2int(b));
+ return 2;
+}
+
+
+static int test_do (lua_State *L) {
+ const char *p = luaL_checkstring(L, 1);
+ if (*p == '@')
+ lua_dofile(L, p+1);
+ else
+ lua_dostring(L, p);
+ return lua_gettop(L);
+}
+
+
+
+/*
+** {======================================================
+** function to test the API with C. It interprets a kind of assembler
+** language with calls to the API, so the test can be driven by Lua code
+** =======================================================
+*/
+
+static const char *const delimits = " \t\n,;";
+
+static void skip (const char **pc) {
+ while (**pc != '\0' && strchr(delimits, **pc)) (*pc)++;
+}
+
+static int getnum_aux (lua_State *L, const char **pc) {
+ int res = 0;
+ int sig = 1;
+ skip(pc);
+ if (**pc == '.') {
+ res = cast(int, lua_tonumber(L, -1));
+ lua_pop(L, 1);
+ (*pc)++;
+ return res;
+ }
+ else if (**pc == '-') {
+ sig = -1;
+ (*pc)++;
+ }
+ while (isdigit(cast(int, **pc))) res = res*10 + (*(*pc)++) - '0';
+ return sig*res;
+}
+
+static const char *getname_aux (char *buff, const char **pc) {
+ int i = 0;
+ skip(pc);
+ while (**pc != '\0' && !strchr(delimits, **pc))
+ buff[i++] = *(*pc)++;
+ buff[i] = '\0';
+ return buff;
+}
+
+
+#define EQ(s1) (strcmp(s1, inst) == 0)
+
+#define getnum (getnum_aux(L, &pc))
+#define getname (getname_aux(buff, &pc))
+
+
+static int testC (lua_State *L) {
+ char buff[30];
+ const char *pc = luaL_checkstring(L, 1);
+ for (;;) {
+ const char *inst = getname;
+ if EQ("") return 0;
+ else if EQ("isnumber") {
+ lua_pushintegral(L, lua_isnumber(L, getnum));
+ }
+ else if EQ("isstring") {
+ lua_pushintegral(L, lua_isstring(L, getnum));
+ }
+ else if EQ("istable") {
+ lua_pushintegral(L, lua_istable(L, getnum));
+ }
+ else if EQ("iscfunction") {
+ lua_pushintegral(L, lua_iscfunction(L, getnum));
+ }
+ else if EQ("isfunction") {
+ lua_pushintegral(L, lua_isfunction(L, getnum));
+ }
+ else if EQ("isuserdata") {
+ lua_pushintegral(L, lua_isuserdata(L, getnum));
+ }
+ else if EQ("isudataval") {
+ lua_pushintegral(L, lua_islightuserdata(L, getnum));
+ }
+ else if EQ("isnil") {
+ lua_pushintegral(L, lua_isnil(L, getnum));
+ }
+ else if EQ("isnull") {
+ lua_pushintegral(L, lua_isnone(L, getnum));
+ }
+ else if EQ("tonumber") {
+ lua_pushnumber(L, lua_tonumber(L, getnum));
+ }
+ else if EQ("tostring") {
+ const char *s = lua_tostring(L, getnum);
+ lua_pushstring(L, s);
+ }
+ else if EQ("strlen") {
+ lua_pushintegral(L, lua_strlen(L, getnum));
+ }
+ else if EQ("tocfunction") {
+ lua_pushcfunction(L, lua_tocfunction(L, getnum));
+ }
+ else if EQ("return") {
+ return getnum;
+ }
+ else if EQ("gettop") {
+ lua_pushintegral(L, lua_gettop(L));
+ }
+ else if EQ("settop") {
+ lua_settop(L, getnum);
+ }
+ else if EQ("pop") {
+ lua_pop(L, getnum);
+ }
+ else if EQ("pushnum") {
+ lua_pushintegral(L, getnum);
+ }
+ else if EQ("pushnil") {
+ lua_pushnil(L);
+ }
+ else if EQ("pushbool") {
+ lua_pushboolean(L, getnum);
+ }
+ else if EQ("tobool") {
+ lua_pushintegral(L, lua_toboolean(L, getnum));
+ }
+ else if EQ("pushvalue") {
+ lua_pushvalue(L, getnum);
+ }
+ else if EQ("pushcclosure") {
+ lua_pushcclosure(L, testC, getnum);
+ }
+ else if EQ("pushupvalues") {
+ lua_pushupvalues(L);
+ }
+ else if EQ("remove") {
+ lua_remove(L, getnum);
+ }
+ else if EQ("insert") {
+ lua_insert(L, getnum);
+ }
+ else if EQ("replace") {
+ lua_replace(L, getnum);
+ }
+ else if EQ("gettable") {
+ lua_gettable(L, getnum);
+ }
+ else if EQ("settable") {
+ lua_settable(L, getnum);
+ }
+ else if EQ("next") {
+ lua_next(L, -2);
+ }
+ else if EQ("concat") {
+ lua_concat(L, getnum);
+ }
+ else if EQ("lessthan") {
+ int a = getnum;
+ lua_pushboolean(L, lua_lessthan(L, a, getnum));
+ }
+ else if EQ("equal") {
+ int a = getnum;
+ lua_pushboolean(L, lua_equal(L, a, getnum));
+ }
+ else if EQ("rawcall") {
+ int narg = getnum;
+ int nres = getnum;
+ lua_call(L, narg, nres);
+ }
+ else if EQ("call") {
+ int narg = getnum;
+ int nres = getnum;
+ lua_pcall(L, narg, nres, 0);
+ }
+ else if EQ("loadstring") {
+ size_t sl;
+ const char *s = luaL_checklstring(L, getnum, &sl);
+ luaL_loadbuffer(L, s, sl, s);
+ }
+ else if EQ("loadfile") {
+ luaL_loadfile(L, luaL_checkstring(L, getnum));
+ }
+ else if EQ("setmetatable") {
+ lua_setmetatable(L, getnum);
+ }
+ else if EQ("getmetatable") {
+ if (lua_getmetatable(L, getnum) == 0)
+ lua_pushnil(L);
+ }
+ else if EQ("type") {
+ lua_pushstring(L, lua_typename(L, lua_type(L, getnum)));
+ }
+ else if EQ("getn") {
+ int i = getnum;
+ lua_pushintegral(L, luaL_getn(L, i));
+ }
+ else if EQ("setn") {
+ int i = getnum;
+ int n = cast(int, lua_tonumber(L, -1));
+ luaL_setn(L, i, n);
+ lua_pop(L, 1);
+ }
+ else luaL_error(L, "unknown instruction %s", buff);
+ }
+ return 0;
+}
+
+/* }====================================================== */
+
+
+/*
+** {======================================================
+** tests for yield inside hooks
+** =======================================================
+*/
+
+static void yieldf (lua_State *L, lua_Debug *ar) {
+ lua_yield(L, 0);
+}
+
+static int setyhook (lua_State *L) {
+ if (lua_isnoneornil(L, 1))
+ lua_sethook(L, NULL, 0, 0); /* turn off hooks */
+ else {
+ const char *smask = luaL_checkstring(L, 1);
+ int count = luaL_optint(L, 2, 0);
+ int mask = 0;
+ if (strchr(smask, 'l')) mask |= LUA_MASKLINE;
+ if (count > 0) mask |= LUA_MASKCOUNT;
+ lua_sethook(L, yieldf, mask, count);
+ }
+ return 0;
+}
+
+
+static int coresume (lua_State *L) {
+ int status;
+ lua_State *co = lua_tothread(L, 1);
+ luaL_argcheck(L, co, 1, "coroutine expected");
+ status = lua_resume(co, 0);
+ if (status != 0) {
+ lua_pushboolean(L, 0);
+ lua_insert(L, -2);
+ return 2; /* return false + error message */
+ }
+ else {
+ lua_pushboolean(L, 1);
+ return 1;
+ }
+}
+
+/* }====================================================== */
+
+
+
+static const struct luaL_reg tests_funcs[] = {
+ {"hash", hash_query},
+ {"limits", get_limits},
+ {"listcode", listcode},
+ {"listk", listk},
+ {"listlocals", listlocals},
+ {"loadlib", loadlib},
+ {"stacklevel", stacklevel},
+ {"querystr", string_query},
+ {"querytab", table_query},
+ {"doit", test_do},
+ {"testC", testC},
+ {"ref", tref},
+ {"getref", getref},
+ {"unref", unref},
+ {"d2s", d2s},
+ {"s2d", s2d},
+ {"metatable", metatable},
+ {"upvalue", upvalue},
+ {"newuserdata", newuserdata},
+ {"pushuserdata", pushuserdata},
+ {"udataval", udataval},
+ {"doonnewstack", doonnewstack},
+ {"newstate", newstate},
+ {"closestate", closestate},
+ {"doremote", doremote},
+ {"log2", log2_aux},
+ {"int2fb", int2fb_aux},
+ {"totalmem", mem_query},
+ {"resume", coresume},
+ {"setyhook", setyhook},
+ {NULL, NULL}
+};
+
+
+static void fim (void) {
+ if (!islocked)
+ lua_close(lua_state);
+ lua_assert(memdebug_numblocks == 0);
+ lua_assert(memdebug_total == 0);
+}
+
+
+static int l_panic (lua_State *L) {
+ UNUSED(L);
+ fprintf(stderr, "unable to recover; exiting\n");
+ return 0;
+}
+
+
+int luaB_opentests (lua_State *L) {
+ lua_atpanic(L, l_panic);
+ lua_userstateopen(L); /* init lock */
+ lua_state = L; /* keep first state to be opened */
+ luaL_openlib(L, "T", tests_funcs, 0);
+ atexit(fim);
+ return 0;
+}
+
+
+#undef main
+int main (int argc, char *argv[]) {
+ char *limit = getenv("MEMLIMIT");
+ if (limit)
+ memdebug_memlimit = strtoul(limit, NULL, 10);
+ l_main(argc, argv);
+ return 0;
+}
+
+#endif
--- /dev/null
+/*
+** $Id: ltm.c,v 1.106 2003/04/03 13:35:34 roberto Exp $
+** Tag methods
+** See Copyright Notice in lua.h
+*/
+
+
+#include <string.h>
+
+#define ltm_c
+
+#include "lua.h"
+
+#include "lobject.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+
+
+
+const char *const luaT_typenames[] = {
+ "nil", "boolean", "userdata", "number",
+ "string", "table", "function", "userdata", "thread"
+};
+
+
+void luaT_init (lua_State *L) {
+ static const char *const luaT_eventname[] = { /* ORDER TM */
+ "__index", "__newindex",
+ "__gc", "__mode", "__eq",
+ "__add", "__sub", "__mul", "__div",
+ "__pow", "__unm", "__lt", "__le",
+ "__concat", "__call"
+ };
+ int i;
+ for (i=0; i<TM_N; i++) {
+ G(L)->tmname[i] = luaS_new(L, luaT_eventname[i]);
+ luaS_fix(G(L)->tmname[i]); /* never collect these names */
+ }
+}
+
+
+/*
+** function to be used with macro "fasttm": optimized for absence of
+** tag methods
+*/
+const TObject *luaT_gettm (Table *events, TMS event, TString *ename) {
+ const TObject *tm = luaH_getstr(events, ename);
+ lua_assert(event <= TM_EQ);
+ if (ttisnil(tm)) { /* no tag method? */
+ events->flags |= cast(lu_byte, 1u<<event); /* cache this fact */
+ return NULL;
+ }
+ else return tm;
+}
+
+
+const TObject *luaT_gettmbyobj (lua_State *L, const TObject *o, TMS event) {
+ TString *ename = G(L)->tmname[event];
+ switch (ttype(o)) {
+ case LUA_TTABLE:
+ return luaH_getstr(hvalue(o)->metatable, ename);
+ case LUA_TUSERDATA:
+ return luaH_getstr(uvalue(o)->uv.metatable, ename);
+ default:
+ return &luaO_nilobject;
+ }
+}
+
--- /dev/null
+/*
+** $Id: ltm.h,v 1.41 2002/11/14 11:51:50 roberto Exp $
+** Tag methods
+** See Copyright Notice in lua.h
+*/
+
+#ifndef ltm_h
+#define ltm_h
+
+
+#include "lobject.h"
+
+
+/*
+* WARNING: if you change the order of this enumeration,
+* grep "ORDER TM"
+*/
+typedef enum {
+ TM_INDEX,
+ TM_NEWINDEX,
+ TM_GC,
+ TM_MODE,
+ TM_EQ, /* last tag method with `fast' access */
+ TM_ADD,
+ TM_SUB,
+ TM_MUL,
+ TM_DIV,
+ TM_POW,
+ TM_UNM,
+ TM_LT,
+ TM_LE,
+ TM_CONCAT,
+ TM_CALL,
+ TM_N /* number of elements in the enum */
+} TMS;
+
+
+
+#define gfasttm(g,et,e) \
+ (((et)->flags & (1u<<(e))) ? NULL : luaT_gettm(et, e, (g)->tmname[e]))
+
+#define fasttm(l,et,e) gfasttm(G(l), et, e)
+
+
+const TObject *luaT_gettm (Table *events, TMS event, TString *ename);
+const TObject *luaT_gettmbyobj (lua_State *L, const TObject *o, TMS event);
+void luaT_init (lua_State *L);
+
+extern const char *const luaT_typenames[];
+
+#endif
--- /dev/null
+# makefile for Lua interpreter
+
+LUA= ../..
+
+include $(LUA)/config
+
+EXTRA_DEFS= $(USERCONF)
+OBJS= lua.o
+SRCS= lua.c
+
+T= $(BIN)/lua
+
+all: $T
+
+$T: $(OBJS) $(LIB)/liblua.a $(LIB)/liblualib.a
+ $(CC) -o $@ $(MYLDFLAGS) $(OBJS) -L$(LIB) -llua -llualib $(EXTRA_LIBS) $(DLLIB)
+
+$(LIB)/liblua.a:
+ cd ..; $(MAKE)
+
+$(LIB)/liblualib.a:
+ cd ../lib; $(MAKE)
+
+clean:
+ rm -f $(OBJS) $T
+
+co:
+ co -q -f -M $(SRCS)
+
+klean: clean
+ rm -f $(SRCS)
--- /dev/null
+This is lua, a sample Lua interpreter.
+It can be used as a batch interpreter and also interactively.
+There are man pages for it in both nroff and html in ../../doc.
+
+Usage: ./lua [options] [script [args]]. Available options are:
+ - execute stdin as a file
+ -e stat execute string `stat'
+ -i enter interactive mode after executing `script'
+ -l name load and run library `name'
+ -v show version information
+ -- stop handling options
+
+This interpreter is suitable for using Lua as a standalone language; it loads
+all standard libraries. For a minimal interpreter, see ../../etc/min.c.
+
+If your application simply exports new functions to Lua (which is common),
+then you can use this interpreter (almost) unmodified, as follows:
+
+* First, define a function
+ void myinit (lua_State *L)
+ in your own code. In this function, you should do whatever initializations
+ are needed by your application, typically exporting your functions to Lua.
+ (Of course, you can use any name instead of "myinit".)
+
+* Then, #define lua_userinit(L) to be "openstdlibs(L)+myinit(L)".
+ Here, openstdlibs is a function in lua.c that opens all standard libraries.
+ If you don't need them, just don't call openstdlibs and open any standard
+ libraries that you do need in myinit.
+
+* Finally, remember to link your C code when building lua.
+
+For other customizations, see ../../etc/config.c.
--- /dev/null
+/*
+** $Id: lua.c,v 1.122 2003/04/03 13:34:42 roberto Exp $
+** Lua stand-alone interpreter
+** See Copyright Notice in lua.h
+*/
+
+
+#include <signal.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define lua_c
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+/*
+** generic extra include file
+*/
+#ifdef LUA_USERCONFIG
+#include LUA_USERCONFIG
+#endif
+
+
+/*
+** definition of `isatty'
+*/
+#ifdef _POSIX_C_SOURCE
+#include <unistd.h>
+#define stdin_is_tty() isatty(0)
+#else
+#define stdin_is_tty() 1 /* assume stdin is a tty */
+#endif
+
+
+
+#ifndef PROMPT
+#define PROMPT "> "
+#endif
+
+
+#ifndef PROMPT2
+#define PROMPT2 ">> "
+#endif
+
+#ifndef PROGNAME
+#define PROGNAME "lua"
+#endif
+
+#ifndef lua_userinit
+#define lua_userinit(L) openstdlibs(L)
+#endif
+
+
+#ifndef LUA_EXTRALIBS
+#define LUA_EXTRALIBS /* empty */
+#endif
+
+
+static lua_State *L = NULL;
+
+static const char *progname = PROGNAME;
+
+
+
+static const luaL_reg lualibs[] = {
+ {"base", luaopen_base},
+ {"table", luaopen_table},
+ {"io", luaopen_io},
+ {"string", luaopen_string},
+ {"math", luaopen_math},
+ {"debug", luaopen_debug},
+ {"loadlib", luaopen_loadlib},
+ /* add your libraries here */
+ LUA_EXTRALIBS
+ {NULL, NULL}
+};
+
+
+
+static void lstop (lua_State *l, lua_Debug *ar) {
+ (void)ar; /* unused arg. */
+ lua_sethook(l, NULL, 0, 0);
+ luaL_error(l, "interrupted!");
+}
+
+
+static void laction (int i) {
+ signal(i, SIG_DFL); /* if another SIGINT happens before lstop,
+ terminate process (default action) */
+ lua_sethook(L, lstop, LUA_MASKCALL | LUA_MASKRET | LUA_MASKCOUNT, 1);
+}
+
+
+static void print_usage (void) {
+ fprintf(stderr,
+ "usage: %s [options] [script [args]].\n"
+ "Available options are:\n"
+ " - execute stdin as a file\n"
+ " -e stat execute string `stat'\n"
+ " -i enter interactive mode after executing `script'\n"
+ " -l name load and run library `name'\n"
+ " -v show version information\n"
+ " -- stop handling options\n" ,
+ progname);
+}
+
+
+static void l_message (const char *pname, const char *msg) {
+ if (pname) fprintf(stderr, "%s: ", pname);
+ fprintf(stderr, "%s\n", msg);
+}
+
+
+static int report (int status) {
+ const char *msg;
+ if (status) {
+ msg = lua_tostring(L, -1);
+ if (msg == NULL) msg = "(error with no message)";
+ l_message(progname, msg);
+ lua_pop(L, 1);
+ }
+ return status;
+}
+
+
+static int lcall (int narg, int clear) {
+ int status;
+ int base = lua_gettop(L) - narg; /* function index */
+ lua_pushliteral(L, "_TRACEBACK");
+ lua_rawget(L, LUA_GLOBALSINDEX); /* get traceback function */
+ lua_insert(L, base); /* put it under chunk and args */
+ signal(SIGINT, laction);
+ status = lua_pcall(L, narg, (clear ? 0 : LUA_MULTRET), base);
+ signal(SIGINT, SIG_DFL);
+ lua_remove(L, base); /* remove traceback function */
+ return status;
+}
+
+
+static void print_version (void) {
+ l_message(NULL, LUA_VERSION " " LUA_COPYRIGHT);
+}
+
+
+static void getargs (char *argv[], int n) {
+ int i;
+ lua_newtable(L);
+ for (i=0; argv[i]; i++) {
+ lua_pushnumber(L, i - n);
+ lua_pushstring(L, argv[i]);
+ lua_rawset(L, -3);
+ }
+ /* arg.n = maximum index in table `arg' */
+ lua_pushliteral(L, "n");
+ lua_pushnumber(L, i-n-1);
+ lua_rawset(L, -3);
+}
+
+
+static int docall (int status) {
+ if (status == 0) status = lcall(0, 1);
+ return report(status);
+}
+
+
+static int file_input (const char *name) {
+ return docall(luaL_loadfile(L, name));
+}
+
+
+static int dostring (const char *s, const char *name) {
+ return docall(luaL_loadbuffer(L, s, strlen(s), name));
+}
+
+
+static int load_file (const char *name) {
+ lua_pushliteral(L, "require");
+ lua_rawget(L, LUA_GLOBALSINDEX);
+ if (!lua_isfunction(L, -1)) { /* no `require' defined? */
+ lua_pop(L, 1);
+ return file_input(name);
+ }
+ else {
+ lua_pushstring(L, name);
+ return report(lcall(1, 1));
+ }
+}
+
+
+/*
+** this macro can be used by some `history' system to save lines
+** read in manual input
+*/
+#ifndef lua_saveline
+#define lua_saveline(L,line) /* empty */
+#endif
+
+
+/*
+** this macro defines a function to show the prompt and reads the
+** next line for manual input
+*/
+#ifndef lua_readline
+#define lua_readline(L,prompt) readline(L,prompt)
+
+/* maximum length of an input line */
+#ifndef MAXINPUT
+#define MAXINPUT 512
+#endif
+
+
+static int readline (lua_State *l, const char *prompt) {
+ static char buffer[MAXINPUT];
+ if (prompt) {
+ fputs(prompt, stdout);
+ fflush(stdout);
+ }
+ if (fgets(buffer, sizeof(buffer), stdin) == NULL)
+ return 0; /* read fails */
+ else {
+ lua_pushstring(l, buffer);
+ return 1;
+ }
+}
+
+#endif
+
+
+static const char *get_prompt (int firstline) {
+ const char *p = NULL;
+ lua_pushstring(L, firstline ? "_PROMPT" : "_PROMPT2");
+ lua_rawget(L, LUA_GLOBALSINDEX);
+ p = lua_tostring(L, -1);
+ if (p == NULL) p = (firstline ? PROMPT : PROMPT2);
+ lua_pop(L, 1); /* remove global */
+ return p;
+}
+
+
+static int incomplete (int status) {
+ if (status == LUA_ERRSYNTAX &&
+ strstr(lua_tostring(L, -1), "near `<eof>'") != NULL) {
+ lua_pop(L, 1);
+ return 1;
+ }
+ else
+ return 0;
+}
+
+
+static int load_string (void) {
+ int status;
+ lua_settop(L, 0);
+ if (lua_readline(L, get_prompt(1)) == 0) /* no input? */
+ return -1;
+ if (lua_tostring(L, -1)[0] == '=') { /* line starts with `=' ? */
+ lua_pushfstring(L, "return %s", lua_tostring(L, -1)+1);/* `=' -> `return' */
+ lua_remove(L, -2); /* remove original line */
+ }
+ for (;;) { /* repeat until gets a complete line */
+ status = luaL_loadbuffer(L, lua_tostring(L, 1), lua_strlen(L, 1), "=stdin");
+ if (!incomplete(status)) break; /* cannot try to add lines? */
+ if (lua_readline(L, get_prompt(0)) == 0) /* no more input? */
+ return -1;
+ lua_concat(L, lua_gettop(L)); /* join lines */
+ }
+ lua_saveline(L, lua_tostring(L, 1));
+ lua_remove(L, 1); /* remove line */
+ return status;
+}
+
+
+static void manual_input (void) {
+ int status;
+ const char *oldprogname = progname;
+ progname = NULL;
+ while ((status = load_string()) != -1) {
+ if (status == 0) status = lcall(0, 0);
+ report(status);
+ if (status == 0 && lua_gettop(L) > 0) { /* any result to print? */
+ lua_getglobal(L, "print");
+ lua_insert(L, 1);
+ if (lua_pcall(L, lua_gettop(L)-1, 0, 0) != 0)
+ l_message(progname, lua_pushfstring(L, "error calling `print' (%s)",
+ lua_tostring(L, -1)));
+ }
+ }
+ lua_settop(L, 0); /* clear stack */
+ fputs("\n", stdout);
+ progname = oldprogname;
+}
+
+
+static int handle_argv (char *argv[], int *interactive) {
+ if (argv[1] == NULL) { /* no more arguments? */
+ if (stdin_is_tty()) {
+ print_version();
+ manual_input();
+ }
+ else
+ file_input(NULL); /* executes stdin as a file */
+ }
+ else { /* other arguments; loop over them */
+ int i;
+ for (i = 1; argv[i] != NULL; i++) {
+ if (argv[i][0] != '-') break; /* not an option? */
+ switch (argv[i][1]) { /* option */
+ case '-': { /* `--' */
+ if (argv[i][2] != '\0') {
+ print_usage();
+ return 1;
+ }
+ i++; /* skip this argument */
+ goto endloop; /* stop handling arguments */
+ }
+ case '\0': {
+ file_input(NULL); /* executes stdin as a file */
+ break;
+ }
+ case 'i': {
+ *interactive = 1;
+ break;
+ }
+ case 'v': {
+ print_version();
+ break;
+ }
+ case 'e': {
+ const char *chunk = argv[i] + 2;
+ if (*chunk == '\0') chunk = argv[++i];
+ if (chunk == NULL) {
+ print_usage();
+ return 1;
+ }
+ if (dostring(chunk, "=<command line>") != 0)
+ return 1;
+ break;
+ }
+ case 'l': {
+ const char *filename = argv[i] + 2;
+ if (*filename == '\0') filename = argv[++i];
+ if (filename == NULL) {
+ print_usage();
+ return 1;
+ }
+ if (load_file(filename))
+ return 1; /* stop if file fails */
+ break;
+ }
+ case 'c': {
+ l_message(progname, "option `-c' is deprecated");
+ break;
+ }
+ case 's': {
+ l_message(progname, "option `-s' is deprecated");
+ break;
+ }
+ default: {
+ print_usage();
+ return 1;
+ }
+ }
+ } endloop:
+ if (argv[i] != NULL) {
+ const char *filename = argv[i];
+ getargs(argv, i); /* collect arguments */
+ lua_setglobal(L, "arg");
+ return file_input(filename); /* stop scanning arguments */
+ }
+ }
+ return 0;
+}
+
+
+static void openstdlibs (lua_State *l) {
+ const luaL_reg *lib = lualibs;
+ for (; lib->func; lib++) {
+ lib->func(l); /* open library */
+ lua_settop(l, 0); /* discard any results */
+ }
+}
+
+
+static int handle_luainit (void) {
+ const char *init = getenv("LUA_INIT");
+ if (init == NULL) return 0; /* status OK */
+ else if (init[0] == '@')
+ return file_input(init+1);
+ else
+ return dostring(init, "=LUA_INIT");
+}
+
+
+struct Smain {
+ int argc;
+ char **argv;
+ int status;
+};
+
+
+static int pmain (lua_State *l) {
+ struct Smain *s = (struct Smain *)lua_touserdata(l, 1);
+ int status;
+ int interactive = 0;
+ if (s->argv[0] && s->argv[0][0]) progname = s->argv[0];
+ L = l;
+ lua_userinit(l); /* open libraries */
+ status = handle_luainit();
+ if (status == 0) {
+ status = handle_argv(s->argv, &interactive);
+ if (status == 0 && interactive) manual_input();
+ }
+ s->status = status;
+ return 0;
+}
+
+
+int main (int argc, char *argv[]) {
+ int status;
+ struct Smain s;
+ lua_State *l = lua_open(); /* create state */
+ if (l == NULL) {
+ l_message(argv[0], "cannot create state: not enough memory");
+ return EXIT_FAILURE;
+ }
+ s.argc = argc;
+ s.argv = argv;
+ status = lua_cpcall(l, &pmain, &s);
+ report(status);
+ lua_close(l);
+ return (status || s.status) ? EXIT_FAILURE : EXIT_SUCCESS;
+}
+
--- /dev/null
+# makefile for Lua compiler
+
+LUA= ../..
+
+include $(LUA)/config
+
+INCS= -I$(INC) -I.. $(EXTRA_INCS)
+OBJS= luac.o print.o lopcodes.o
+SRCS= luac.c print.c
+
+T= $(BIN)/luac
+
+all: $T
+
+$T: $(OBJS) $(LIB)/liblua.a $(LIB)/liblualib.a
+ $(CC) -o $@ $(MYLDFLAGS) $(OBJS) -L$(LIB) -llua -llualib $(EXTRA_LIBS) $(DLLIB)
+
+# print.c needs opcode names from lopcodes.c
+lopcodes.o: ../lopcodes.c ../lopcodes.h
+ $(CC) -o $@ -c $(CFLAGS) -DLUA_OPNAMES ../lopcodes.c
+
+$(LIB)/liblua.a:
+ cd ..; $(MAKE)
+
+$(LIB)/liblualib.a:
+ cd ../lib; $(MAKE)
+
+clean:
+ rm -f $(OBJS) $T
+
+co:
+ co -q -f -M $(SRCS)
+
+klean: clean
+ rm -f $(SRCS)
--- /dev/null
+This is luac, the Lua compiler.
+There are man pages for it in both nroff and html in ../../doc.
+
+luac translates Lua programs into binary files that can be loaded latter.
+The main advantages of pre-compiling chunks are: faster loading, protecting
+source code from user changes, and off-line syntax error detection.
+luac can also be used to learn about the Lua virtual machine.
+
+Usage: /l/luac/luac [options] [filenames]. Available options are:
+ - process stdin
+ -l list
+ -o name output to file `name' (default is "luac.out")
+ -p parse only
+ -s strip debug information
+ -v show version information
+ -- stop handling options
+
+luac is also an example of how to use the internals of Lua (politely).
--- /dev/null
+/*
+** $Id: luac.c,v 1.44a 2003/04/07 20:34:20 lhf Exp $
+** Lua compiler (saves bytecodes to files; also list bytecodes)
+** See Copyright Notice in lua.h
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "lua.h"
+#include "lauxlib.h"
+
+#include "lfunc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lstring.h"
+#include "lundump.h"
+
+#ifndef LUA_DEBUG
+#define luaB_opentests(L)
+#endif
+
+#ifndef PROGNAME
+#define PROGNAME "luac" /* program name */
+#endif
+
+#define OUTPUT "luac.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; /* 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* name, const char* what, const char* mode)
+{
+ fprintf(stderr,"%s: cannot %s %sput file ",progname,what,mode);
+ perror(name);
+ exit(EXIT_FAILURE);
+}
+
+static void usage(const char* message, const char* arg)
+{
+ if (message!=NULL)
+ {
+ fprintf(stderr,"%s: ",progname); fprintf(stderr,message,arg); fprintf(stderr,"\n");
+ }
+ fprintf(stderr,
+ "usage: %s [options] [filenames]. Available options are:\n"
+ " - process stdin\n"
+ " -l list\n"
+ " -o name output to file `name' (default is \"" OUTPUT "\")\n"
+ " -p parse only\n"
+ " -s strip debug information\n"
+ " -v show version information\n"
+ " -- stop handling options\n",
+ progname);
+ exit(EXIT_FAILURE);
+}
+
+#define IS(s) (strcmp(argv[i],s)==0)
+
+static int doargs(int argc, char* argv[])
+{
+ int i;
+ 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;
+ break;
+ }
+ else if (IS("-")) /* end of options; use stdin */
+ return i;
+ else if (IS("-l")) /* list */
+ listing=1;
+ else if (IS("-o")) /* output file */
+ {
+ output=argv[++i];
+ if (output==NULL || *output==0) usage("`-o' needs argument",NULL);
+ }
+ else if (IS("-p")) /* parse only */
+ dumping=0;
+ else if (IS("-s")) /* strip debug information */
+ stripping=1;
+ else if (IS("-v")) /* show version */
+ {
+ printf("%s %s\n",LUA_VERSION,LUA_COPYRIGHT);
+ if (argc==2) exit(EXIT_SUCCESS);
+ }
+ else /* unknown option */
+ usage("unrecognized option `%s'",argv[i]);
+ }
+ if (i==argc && (listing || !dumping))
+ {
+ dumping=0;
+ argv[--i]=Output;
+ }
+ return i;
+}
+
+static Proto* toproto(lua_State* L, int i)
+{
+ const Closure* c=(const Closure*)lua_topointer(L,i);
+ return c->l.p;
+}
+
+static Proto* combine(lua_State* L, int n)
+{
+ if (n==1)
+ return toproto(L,-1);
+ else
+ {
+ int i,pc=0;
+ Proto* f=luaF_newproto(L);
+ f->source=luaS_newliteral(L,"=(" PROGNAME ")");
+ f->maxstacksize=1;
+ f->p=luaM_newvector(L,n,Proto*);
+ f->sizep=n;
+ f->sizecode=2*n+1;
+ f->code=luaM_newvector(L,f->sizecode,Instruction);
+ for (i=0; i<n; i++)
+ {
+ f->p[i]=toproto(L,i-n);
+ f->code[pc++]=CREATE_ABx(OP_CLOSURE,0,i);
+ f->code[pc++]=CREATE_ABC(OP_CALL,0,1,1);
+ }
+ f->code[pc++]=CREATE_ABC(OP_RETURN,0,1,0);
+ return f;
+ }
+}
+
+static void strip(lua_State* L, Proto* f)
+{
+ int i,n=f->sizep;
+ luaM_freearray(L, f->lineinfo, f->sizelineinfo, int);
+ luaM_freearray(L, f->locvars, f->sizelocvars, struct LocVar);
+ luaM_freearray(L, f->upvalues, f->sizeupvalues, TString *);
+ f->lineinfo=NULL; f->sizelineinfo=0;
+ f->locvars=NULL; f->sizelocvars=0;
+ f->upvalues=NULL; f->sizeupvalues=0;
+ f->source=luaS_newliteral(L,"=(none)");
+ for (i=0; i<n; i++) strip(L,f->p[i]);
+}
+
+static int writer(lua_State* L, const void* p, size_t size, void* u)
+{
+ UNUSED(L);
+ return fwrite(p,size,1,(FILE*)u)==1;
+}
+
+int main(int argc, char* argv[])
+{
+ lua_State* L;
+ Proto* f;
+ int i=doargs(argc,argv);
+ argc-=i; argv+=i;
+ if (argc<=0) usage("no input files given",NULL);
+ L=lua_open();
+ luaB_opentests(L);
+ for (i=0; i<argc; i++)
+ {
+ const char* filename=IS("-") ? NULL : argv[i];
+ if (luaL_loadfile(L,filename)!=0) fatal(lua_tostring(L,-1));
+ }
+ f=combine(L,argc);
+ if (listing) luaU_print(f);
+ if (dumping)
+ {
+ FILE* D=fopen(output,"wb");
+ if (D==NULL) cannot(output,"open","out");
+ if (stripping) strip(L,f);
+ lua_lock(L);
+ luaU_dump(L,f,writer,D);
+ lua_unlock(L);
+ if (ferror(D)) cannot(output,"write","out");
+ fclose(D);
+ }
+ lua_close(L);
+ return 0;
+}
--- /dev/null
+/*
+** $Id: print.c,v 1.44 2003/04/07 20:34:20 lhf Exp $
+** print bytecodes
+** See Copyright Notice in lua.h
+*/
+
+#include <stdio.h>
+
+#if 0
+#define DEBUG_PRINT
+#endif
+
+#ifndef LUA_OPNAMES
+#define LUA_OPNAMES
+#endif
+
+#include "ldebug.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lundump.h"
+
+#define Sizeof(x) ((int)sizeof(x))
+#define VOID(p) ((const void*)(p))
+
+static void PrintString(const Proto* f, int n)
+{
+ const char* s=svalue(&f->k[n]);
+ putchar('"');
+ for (; *s; s++)
+ {
+ switch (*s)
+ {
+ 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: putchar(*s); break;
+ }
+ }
+ putchar('"');
+}
+
+static void PrintConstant(const Proto* f, int i)
+{
+ const TObject* o=&f->k[i];
+ switch (ttype(o))
+ {
+ case LUA_TNUMBER:
+ printf(LUA_NUMBER_FMT,nvalue(o));
+ break;
+ case LUA_TSTRING:
+ PrintString(f,i);
+ break;
+ case LUA_TNIL:
+ printf("nil");
+ break;
+ default: /* cannot happen */
+ printf("? type=%d",ttype(o));
+ break;
+ }
+}
+
+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 bc=GETARG_Bx(i);
+ int sbc=GETARG_sBx(i);
+ int line=getline(f,pc);
+#if 0
+ printf("%0*lX",Sizeof(i)*2,i);
+#endif
+ 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 %d %d",a,b,c); break;
+ case iABx: printf("%d %d",a,bc); break;
+ case iAsBx: printf("%d %d",a,sbc); break;
+ }
+ switch (o)
+ {
+ case OP_LOADK:
+ printf("\t; "); PrintConstant(f,bc);
+ break;
+ case OP_GETUPVAL:
+ case OP_SETUPVAL:
+ printf("\t; %s", (f->sizeupvalues>0) ? getstr(f->upvalues[b]) : "-");
+ break;
+ case OP_GETGLOBAL:
+ case OP_SETGLOBAL:
+ printf("\t; %s",svalue(&f->k[bc]));
+ break;
+ case OP_GETTABLE:
+ case OP_SELF:
+ if (c>=MAXSTACK) { printf("\t; "); PrintConstant(f,c-MAXSTACK); }
+ break;
+ case OP_SETTABLE:
+ case OP_ADD:
+ case OP_SUB:
+ case OP_MUL:
+ case OP_DIV:
+ case OP_POW:
+ case OP_EQ:
+ case OP_LT:
+ case OP_LE:
+ if (b>=MAXSTACK || c>=MAXSTACK)
+ {
+ printf("\t; ");
+ if (b>=MAXSTACK) PrintConstant(f,b-MAXSTACK); else printf("-");
+ printf(" ");
+ if (c>=MAXSTACK) PrintConstant(f,c-MAXSTACK);
+ }
+ break;
+ case OP_JMP:
+ case OP_FORLOOP:
+ case OP_TFORPREP:
+ printf("\t; to %d",sbc+pc+2);
+ break;
+ case OP_CLOSURE:
+ printf("\t; %p",VOID(f->p[bc]));
+ break;
+ default:
+ break;
+ }
+ printf("\n");
+ }
+}
+
+static const char* Source(const Proto* f)
+{
+ const char* s=getstr(f->source);
+ if (*s=='@' || *s=='=')
+ return s+1;
+ else if (*s==LUA_SIGNATURE[0])
+ return "(bstring)";
+ else
+ return "(string)";
+}
+
+#define IsMain(f) (f->lineDefined==0)
+
+#define SS(x) (x==1)?"":"s"
+#define S(x) x,SS(x)
+
+static void PrintHeader(const Proto* f)
+{
+ printf("\n%s <%s:%d> (%d instruction%s, %d bytes at %p)\n",
+ IsMain(f)?"main":"function",Source(f),f->lineDefined,
+ S(f->sizecode),f->sizecode*Sizeof(Instruction),VOID(f));
+ printf("%d%s param%s, %d stack%s, %d upvalue%s, ",
+ f->numparams,f->is_vararg?"+":"",SS(f->numparams),S(f->maxstacksize),
+ S(f->nups));
+ printf("%d local%s, %d constant%s, %d function%s\n",
+ S(f->sizelocvars),S(f->sizek),S(f->sizep));
+}
+
+#ifdef DEBUG_PRINT
+static void PrintConstants(const Proto* f)
+{
+ int i,n=f->sizek;
+ printf("constants (%d) for %p:\n",n,VOID(f));
+ for (i=0; i<n; i++)
+ {
+ printf("\t%d\t",i);
+ PrintConstant(f,i);
+ printf("\n");
+ }
+}
+
+static void PrintLocals(const Proto* f)
+{
+ int i,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,f->locvars[i].endpc);
+ }
+}
+
+static void PrintUpvalues(const Proto* f)
+{
+ int i,n=f->sizeupvalues;
+ printf("upvalues (%d) for %p:\n",n,VOID(f));
+ if (f->upvalues==NULL) return;
+ for (i=0; i<n; i++)
+ {
+ printf("\t%d\t%s\n",i,getstr(f->upvalues[i]));
+ }
+}
+#endif
+
+void luaU_print(const Proto* f)
+{
+ int i,n=f->sizep;
+ PrintHeader(f);
+ PrintCode(f);
+#ifdef DEBUG_PRINT
+ PrintConstants(f);
+ PrintLocals(f);
+ PrintUpvalues(f);
+#endif
+ for (i=0; i<n; i++) luaU_print(f->p[i]);
+}
--- /dev/null
+/*
+** $Id: lundump.c,v 1.49 2003/04/07 20:34:20 lhf Exp $
+** load pre-compiled Lua chunks
+** See Copyright Notice in lua.h
+*/
+
+#define lundump_c
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "lfunc.h"
+#include "lmem.h"
+#include "lopcodes.h"
+#include "lstring.h"
+#include "lundump.h"
+#include "lzio.h"
+
+#define LoadByte (lu_byte) ezgetc
+
+typedef struct {
+ lua_State* L;
+ ZIO* Z;
+ Mbuffer* b;
+ int swap;
+ const char* name;
+} LoadState;
+
+static void unexpectedEOZ (LoadState* S)
+{
+ luaG_runerror(S->L,"unexpected end of file in %s",S->name);
+}
+
+static int ezgetc (LoadState* S)
+{
+ int c=zgetc(S->Z);
+ if (c==EOZ) unexpectedEOZ(S);
+ return c;
+}
+
+static void ezread (LoadState* S, void* b, int n)
+{
+ int r=luaZ_read(S->Z,b,n);
+ if (r!=0) unexpectedEOZ(S);
+}
+
+static void LoadBlock (LoadState* S, void* b, size_t size)
+{
+ if (S->swap)
+ {
+ char* p=(char*) b+size-1;
+ int n=size;
+ while (n--) *p--=(char)ezgetc(S);
+ }
+ else
+ ezread(S,b,size);
+}
+
+static void LoadVector (LoadState* S, void* b, int m, size_t size)
+{
+ if (S->swap)
+ {
+ char* q=(char*) b;
+ while (m--)
+ {
+ char* p=q+size-1;
+ int n=size;
+ while (n--) *p--=(char)ezgetc(S);
+ q+=size;
+ }
+ }
+ else
+ ezread(S,b,m*size);
+}
+
+static int LoadInt (LoadState* S)
+{
+ int x;
+ LoadBlock(S,&x,sizeof(x));
+ if (x<0) luaG_runerror(S->L,"bad integer in %s",S->name);
+ return x;
+}
+
+static size_t LoadSize (LoadState* S)
+{
+ size_t x;
+ LoadBlock(S,&x,sizeof(x));
+ return x;
+}
+
+static lua_Number LoadNumber (LoadState* S)
+{
+ lua_Number x;
+ LoadBlock(S,&x,sizeof(x));
+ return x;
+}
+
+static TString* LoadString (LoadState* S)
+{
+ size_t size=LoadSize(S);
+ if (size==0)
+ return NULL;
+ else
+ {
+ char* s=luaZ_openspace(S->L,S->b,size);
+ ezread(S,s,size);
+ return luaS_newlstr(S->L,s,size-1); /* remove trailing '\0' */
+ }
+}
+
+static void LoadCode (LoadState* S, Proto* f)
+{
+ int size=LoadInt(S);
+ f->code=luaM_newvector(S->L,size,Instruction);
+ f->sizecode=size;
+ LoadVector(S,f->code,size,sizeof(*f->code));
+}
+
+static void LoadLocals (LoadState* S, Proto* f)
+{
+ int i,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=LoadString(S);
+ f->locvars[i].startpc=LoadInt(S);
+ f->locvars[i].endpc=LoadInt(S);
+ }
+}
+
+static void LoadLines (LoadState* S, Proto* f)
+{
+ int size=LoadInt(S);
+ f->lineinfo=luaM_newvector(S->L,size,int);
+ f->sizelineinfo=size;
+ LoadVector(S,f->lineinfo,size,sizeof(*f->lineinfo));
+}
+
+static void LoadUpvalues (LoadState* S, Proto* f)
+{
+ int i,n;
+ n=LoadInt(S);
+ if (n!=0 && n!=f->nups)
+ luaG_runerror(S->L,"bad nupvalues in %s: read %d; expected %d",
+ S->name,n,f->nups);
+ f->upvalues=luaM_newvector(S->L,n,TString*);
+ f->sizeupvalues=n;
+ for (i=0; i<n; i++) f->upvalues[i]=LoadString(S);
+}
+
+static Proto* LoadFunction (LoadState* S, TString* p);
+
+static void LoadConstants (LoadState* S, Proto* f)
+{
+ int i,n;
+ n=LoadInt(S);
+ f->k=luaM_newvector(S->L,n,TObject);
+ f->sizek=n;
+ for (i=0; i<n; i++)
+ {
+ TObject* o=&f->k[i];
+ int t=LoadByte(S);
+ switch (t)
+ {
+ case LUA_TNUMBER:
+ setnvalue(o,LoadNumber(S));
+ break;
+ case LUA_TSTRING:
+ setsvalue2n(o,LoadString(S));
+ break;
+ case LUA_TNIL:
+ setnilvalue(o);
+ break;
+ default:
+ luaG_runerror(S->L,"bad constant type (%d) in %s",t,S->name);
+ break;
+ }
+ }
+ n=LoadInt(S);
+ f->p=luaM_newvector(S->L,n,Proto*);
+ f->sizep=n;
+ for (i=0; i<n; i++) f->p[i]=LoadFunction(S,f->source);
+}
+
+static Proto* LoadFunction (LoadState* S, TString* p)
+{
+ Proto* f=luaF_newproto(S->L);
+ f->source=LoadString(S); if (f->source==NULL) f->source=p;
+ f->lineDefined=LoadInt(S);
+ f->nups=LoadByte(S);
+ f->numparams=LoadByte(S);
+ f->is_vararg=LoadByte(S);
+ f->maxstacksize=LoadByte(S);
+ LoadLines(S,f);
+ LoadLocals(S,f);
+ LoadUpvalues(S,f);
+ LoadConstants(S,f);
+ LoadCode(S,f);
+#ifndef TRUST_BINARIES
+ if (!luaG_checkcode(f)) luaG_runerror(S->L,"bad code in %s",S->name);
+#endif
+ return f;
+}
+
+static void LoadSignature (LoadState* S)
+{
+ const char* s=LUA_SIGNATURE;
+ while (*s!=0 && ezgetc(S)==*s)
+ ++s;
+ if (*s!=0) luaG_runerror(S->L,"bad signature in %s",S->name);
+}
+
+static void TestSize (LoadState* S, int s, const char* what)
+{
+ int r=LoadByte(S);
+ if (r!=s)
+ luaG_runerror(S->L,"virtual machine mismatch in %s: "
+ "size of %s is %d but read %d",S->name,what,s,r);
+}
+
+#define TESTSIZE(s,w) TestSize(S,s,w)
+#define V(v) v/16,v%16
+
+static void LoadHeader (LoadState* S)
+{
+ int version;
+ lua_Number x,tx=TEST_NUMBER;
+ LoadSignature(S);
+ version=LoadByte(S);
+ if (version>VERSION)
+ luaG_runerror(S->L,"%s too new: "
+ "read version %d.%d; expected at most %d.%d",
+ S->name,V(version),V(VERSION));
+ if (version<VERSION0) /* check last major change */
+ luaG_runerror(S->L,"%s too old: "
+ "read version %d.%d; expected at least %d.%d",
+ S->name,V(version),V(VERSION0));
+ S->swap=(luaU_endianness()!=LoadByte(S)); /* need to swap bytes? */
+ TESTSIZE(sizeof(int),"int");
+ TESTSIZE(sizeof(size_t), "size_t");
+ TESTSIZE(sizeof(Instruction), "Instruction");
+ TESTSIZE(SIZE_OP, "OP");
+ TESTSIZE(SIZE_A, "A");
+ TESTSIZE(SIZE_B, "B");
+ TESTSIZE(SIZE_C, "C");
+ TESTSIZE(sizeof(lua_Number), "number");
+ x=LoadNumber(S);
+ if ((long)x!=(long)tx) /* disregard errors in last bits of fraction */
+ luaG_runerror(S->L,"unknown number format in %s",S->name);
+}
+
+static Proto* LoadChunk (LoadState* S)
+{
+ LoadHeader(S);
+ return LoadFunction(S,NULL);
+}
+
+/*
+** load precompiled chunk
+*/
+Proto* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff)
+{
+ LoadState S;
+ const char* s=zname(Z);
+ if (*s=='@' || *s=='=')
+ S.name=s+1;
+ else if (*s==LUA_SIGNATURE[0])
+ S.name="binary string";
+ else
+ S.name=s;
+ S.L=L;
+ S.Z=Z;
+ S.b=buff;
+ return LoadChunk(&S);
+}
+
+/*
+** find byte order
+*/
+int luaU_endianness (void)
+{
+ int x=1;
+ return *(char*)&x;
+}
--- /dev/null
+/*
+** $Id: lundump.h,v 1.30 2003/04/07 20:34:20 lhf Exp $
+** load pre-compiled Lua chunks
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lundump_h
+#define lundump_h
+
+#include "lobject.h"
+#include "lzio.h"
+
+/* load one chunk; from lundump.c */
+Proto* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff);
+
+/* find byte order; from lundump.c */
+int luaU_endianness (void);
+
+/* dump one chunk; from ldump.c */
+void luaU_dump (lua_State* L, const Proto* Main, lua_Chunkwriter w, void* data);
+
+/* print one chunk; from print.c */
+void luaU_print (const Proto* Main);
+
+/* definitions for headers of binary files */
+#define LUA_SIGNATURE "\033Lua" /* binary files start with "<esc>Lua" */
+#define VERSION 0x50 /* last format change was in 5.0 */
+#define VERSION0 0x50 /* last major change was in 5.0 */
+
+/* a multiple of PI for testing native format */
+/* multiplying by 1E7 gives non-trivial integer values */
+#define TEST_NUMBER ((lua_Number)3.14159265358979323846E7)
+
+#endif
--- /dev/null
+/*
+** $Id: lvm.c,v 1.284b 2003/04/03 13:35:34 roberto Exp $
+** Lua virtual machine
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdarg.h>
+#include <stdlib.h>
+#include <string.h>
+
+/* needed only when `lua_number2str' uses `sprintf' */
+#include <stdio.h>
+
+#define lvm_c
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lgc.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+#include "lvm.h"
+
+
+
+/* function to convert a lua_Number to a string */
+#ifndef lua_number2str
+#define lua_number2str(s,n) sprintf((s), LUA_NUMBER_FMT, (n))
+#endif
+
+
+/* limit for table tag-method chains (to avoid loops) */
+#define MAXTAGLOOP 100
+
+
+const TObject *luaV_tonumber (const TObject *obj, TObject *n) {
+ lua_Number num;
+ if (ttisnumber(obj)) return obj;
+ if (ttisstring(obj) && luaO_str2d(svalue(obj), &num)) {
+ setnvalue(n, num);
+ return n;
+ }
+ else
+ return NULL;
+}
+
+
+int luaV_tostring (lua_State *L, StkId obj) {
+ if (!ttisnumber(obj))
+ return 0;
+ else {
+ char s[32]; /* 16 digits, sign, point and \0 (+ some extra...) */
+ lua_number2str(s, nvalue(obj));
+ setsvalue2s(obj, luaS_new(L, s));
+ return 1;
+ }
+}
+
+
+static void traceexec (lua_State *L) {
+ lu_byte mask = L->hookmask;
+ if (mask & LUA_MASKCOUNT) { /* instruction-hook set? */
+ if (L->hookcount == 0) {
+ resethookcount(L);
+ luaD_callhook(L, LUA_HOOKCOUNT, -1);
+ return;
+ }
+ }
+ if (mask & LUA_MASKLINE) {
+ CallInfo *ci = L->ci;
+ Proto *p = ci_func(ci)->l.p;
+ int newline = getline(p, pcRel(*ci->u.l.pc, p));
+ if (!L->hookinit) {
+ luaG_inithooks(L);
+ return;
+ }
+ lua_assert(ci->state & CI_HASFRAME);
+ if (pcRel(*ci->u.l.pc, p) == 0) /* tracing may be starting now? */
+ ci->u.l.savedpc = *ci->u.l.pc; /* initialize `savedpc' */
+ /* calls linehook when enters a new line or jumps back (loop) */
+ if (*ci->u.l.pc <= ci->u.l.savedpc ||
+ newline != getline(p, pcRel(ci->u.l.savedpc, p))) {
+ luaD_callhook(L, LUA_HOOKLINE, newline);
+ ci = L->ci; /* previous call may reallocate `ci' */
+ }
+ ci->u.l.savedpc = *ci->u.l.pc;
+ }
+}
+
+
+static void callTMres (lua_State *L, const TObject *f,
+ const TObject *p1, const TObject *p2) {
+ setobj2s(L->top, f); /* push function */
+ setobj2s(L->top+1, p1); /* 1st argument */
+ setobj2s(L->top+2, p2); /* 2nd argument */
+ luaD_checkstack(L, 3); /* cannot check before (could invalidate p1, p2) */
+ L->top += 3;
+ luaD_call(L, L->top - 3, 1);
+ L->top--; /* result will be in L->top */
+}
+
+
+
+static void callTM (lua_State *L, const TObject *f,
+ const TObject *p1, const TObject *p2, const TObject *p3) {
+ setobj2s(L->top, f); /* push function */
+ setobj2s(L->top+1, p1); /* 1st argument */
+ setobj2s(L->top+2, p2); /* 2nd argument */
+ setobj2s(L->top+3, p3); /* 3th argument */
+ luaD_checkstack(L, 4); /* cannot check before (could invalidate p1...p3) */
+ L->top += 4;
+ luaD_call(L, L->top - 4, 0);
+}
+
+
+static const TObject *luaV_index (lua_State *L, const TObject *t,
+ TObject *key, int loop) {
+ const TObject *tm = fasttm(L, hvalue(t)->metatable, TM_INDEX);
+ if (tm == NULL) return &luaO_nilobject; /* no TM */
+ if (ttisfunction(tm)) {
+ callTMres(L, tm, t, key);
+ return L->top;
+ }
+ else return luaV_gettable(L, tm, key, loop);
+}
+
+static const TObject *luaV_getnotable (lua_State *L, const TObject *t,
+ TObject *key, int loop) {
+ const TObject *tm = luaT_gettmbyobj(L, t, TM_INDEX);
+ if (ttisnil(tm))
+ luaG_typeerror(L, t, "index");
+ if (ttisfunction(tm)) {
+ callTMres(L, tm, t, key);
+ return L->top;
+ }
+ else return luaV_gettable(L, tm, key, loop);
+}
+
+
+/*
+** Function to index a table.
+** Receives the table at `t' and the key at `key'.
+** leaves the result at `res'.
+*/
+const TObject *luaV_gettable (lua_State *L, const TObject *t, TObject *key,
+ int loop) {
+ if (loop > MAXTAGLOOP)
+ luaG_runerror(L, "loop in gettable");
+ if (ttistable(t)) { /* `t' is a table? */
+ Table *h = hvalue(t);
+ const TObject *v = luaH_get(h, key); /* do a primitive get */
+ if (!ttisnil(v)) return v;
+ else return luaV_index(L, t, key, loop+1);
+ }
+ else return luaV_getnotable(L, t, key, loop+1);
+}
+
+
+/*
+** Receives table at `t', key at `key' and value at `val'.
+*/
+void luaV_settable (lua_State *L, const TObject *t, TObject *key, StkId val) {
+ const TObject *tm;
+ int loop = 0;
+ do {
+ if (ttistable(t)) { /* `t' is a table? */
+ Table *h = hvalue(t);
+ TObject *oldval = luaH_set(L, h, key); /* do a primitive set */
+ if (!ttisnil(oldval) || /* result is no nil? */
+ (tm = fasttm(L, h->metatable, TM_NEWINDEX)) == NULL) { /* or no TM? */
+ setobj2t(oldval, val); /* write barrier */
+ return;
+ }
+ /* else will try the tag method */
+ }
+ else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_NEWINDEX)))
+ luaG_typeerror(L, t, "index");
+ if (ttisfunction(tm)) {
+ callTM(L, tm, t, key, val);
+ return;
+ }
+ t = tm; /* else repeat with `tm' */
+ } while (++loop <= MAXTAGLOOP);
+ luaG_runerror(L, "loop in settable");
+}
+
+
+static int call_binTM (lua_State *L, const TObject *p1, const TObject *p2,
+ StkId res, TMS event) {
+ ptrdiff_t result = savestack(L, res);
+ const TObject *tm = luaT_gettmbyobj(L, p1, event); /* try first operand */
+ if (ttisnil(tm))
+ tm = luaT_gettmbyobj(L, p2, event); /* try second operand */
+ if (!ttisfunction(tm)) return 0;
+ callTMres(L, tm, p1, p2);
+ res = restorestack(L, result); /* previous call may change stack */
+ setobjs2s(res, L->top);
+ return 1;
+}
+
+
+static const TObject *get_compTM (lua_State *L, Table *mt1, Table *mt2,
+ TMS event) {
+ const TObject *tm1 = fasttm(L, mt1, event);
+ const TObject *tm2;
+ if (tm1 == NULL) return NULL; /* no metamethod */
+ if (mt1 == mt2) return tm1; /* same metatables => same metamethods */
+ tm2 = fasttm(L, mt2, event);
+ if (tm2 == NULL) return NULL; /* no metamethod */
+ if (luaO_rawequalObj(tm1, tm2)) /* same metamethods? */
+ return tm1;
+ return NULL;
+}
+
+
+static int call_orderTM (lua_State *L, const TObject *p1, const TObject *p2,
+ TMS event) {
+ const TObject *tm1 = luaT_gettmbyobj(L, p1, event);
+ const TObject *tm2;
+ if (ttisnil(tm1)) return -1; /* no metamethod? */
+ tm2 = luaT_gettmbyobj(L, p2, event);
+ if (!luaO_rawequalObj(tm1, tm2)) /* different metamethods? */
+ return -1;
+ callTMres(L, tm1, p1, p2);
+ return !l_isfalse(L->top);
+}
+
+
+static int luaV_strcmp (const TString *ls, const TString *rs) {
+ const char *l = getstr(ls);
+ size_t ll = ls->tsv.len;
+ const char *r = getstr(rs);
+ size_t lr = rs->tsv.len;
+ for (;;) {
+ int temp = strcoll(l, r);
+ if (temp != 0) return temp;
+ else { /* strings are equal up to a `\0' */
+ size_t len = strlen(l); /* index of first `\0' in both strings */
+ if (len == lr) /* r is finished? */
+ return (len == ll) ? 0 : 1;
+ else if (len == ll) /* l is finished? */
+ return -1; /* l is smaller than r (because r is not finished) */
+ /* both strings longer than `len'; go on comparing (after the `\0') */
+ len++;
+ l += len; ll -= len; r += len; lr -= len;
+ }
+ }
+}
+
+
+int luaV_lessthan (lua_State *L, const TObject *l, const TObject *r) {
+ int res;
+ if (ttype(l) != ttype(r))
+ return luaG_ordererror(L, l, r);
+ else if (ttisnumber(l))
+ return nvalue(l) < nvalue(r);
+ else if (ttisstring(l))
+ return luaV_strcmp(tsvalue(l), tsvalue(r)) < 0;
+ else if ((res = call_orderTM(L, l, r, TM_LT)) != -1)
+ return res;
+ return luaG_ordererror(L, l, r);
+}
+
+
+static int luaV_lessequal (lua_State *L, const TObject *l, const TObject *r) {
+ int res;
+ if (ttype(l) != ttype(r))
+ return luaG_ordererror(L, l, r);
+ else if (ttisnumber(l))
+ return nvalue(l) <= nvalue(r);
+ else if (ttisstring(l))
+ return luaV_strcmp(tsvalue(l), tsvalue(r)) <= 0;
+ else if ((res = call_orderTM(L, l, r, TM_LE)) != -1) /* first try `le' */
+ return res;
+ else if ((res = call_orderTM(L, r, l, TM_LT)) != -1) /* else try `lt' */
+ return !res;
+ return luaG_ordererror(L, l, r);
+}
+
+
+int luaV_equalval (lua_State *L, const TObject *t1, const TObject *t2) {
+ const TObject *tm;
+ lua_assert(ttype(t1) == ttype(t2));
+ switch (ttype(t1)) {
+ case LUA_TNIL: return 1;
+ case LUA_TNUMBER: return nvalue(t1) == nvalue(t2);
+ case LUA_TBOOLEAN: return bvalue(t1) == bvalue(t2); /* true must be 1 !! */
+ case LUA_TLIGHTUSERDATA: return pvalue(t1) == pvalue(t2);
+ case LUA_TUSERDATA: {
+ if (uvalue(t1) == uvalue(t2)) return 1;
+ tm = get_compTM(L, uvalue(t1)->uv.metatable, uvalue(t2)->uv.metatable,
+ TM_EQ);
+ break; /* will try TM */
+ }
+ case LUA_TTABLE: {
+ if (hvalue(t1) == hvalue(t2)) return 1;
+ tm = get_compTM(L, hvalue(t1)->metatable, hvalue(t2)->metatable, TM_EQ);
+ break; /* will try TM */
+ }
+ default: return gcvalue(t1) == gcvalue(t2);
+ }
+ if (tm == NULL) return 0; /* no TM? */
+ callTMres(L, tm, t1, t2); /* call TM */
+ return !l_isfalse(L->top);
+}
+
+
+void luaV_concat (lua_State *L, int total, int last) {
+ do {
+ StkId top = L->base + last + 1;
+ int n = 2; /* number of elements handled in this pass (at least 2) */
+ if (!tostring(L, top-2) || !tostring(L, top-1)) {
+ if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))
+ luaG_concaterror(L, top-2, top-1);
+ } else if (tsvalue(top-1)->tsv.len > 0) { /* if len=0, do nothing */
+ /* at least two string values; get as many as possible */
+ lu_mem tl = cast(lu_mem, tsvalue(top-1)->tsv.len) +
+ cast(lu_mem, tsvalue(top-2)->tsv.len);
+ char *buffer;
+ int i;
+ while (n < total && tostring(L, top-n-1)) { /* collect total length */
+ tl += tsvalue(top-n-1)->tsv.len;
+ n++;
+ }
+ if (tl > MAX_SIZET) luaG_runerror(L, "string size overflow");
+ buffer = luaZ_openspace(L, &G(L)->buff, tl);
+ tl = 0;
+ for (i=n; i>0; i--) { /* concat all strings */
+ size_t l = tsvalue(top-i)->tsv.len;
+ memcpy(buffer+tl, svalue(top-i), l);
+ tl += l;
+ }
+ setsvalue2s(top-n, luaS_newlstr(L, buffer, tl));
+ }
+ total -= n-1; /* got `n' strings to create 1 new */
+ last -= n-1;
+ } while (total > 1); /* repeat until only 1 result left */
+}
+
+
+static void Arith (lua_State *L, StkId ra,
+ const TObject *rb, const TObject *rc, TMS op) {
+ TObject tempb, tempc;
+ const TObject *b, *c;
+ if ((b = luaV_tonumber(rb, &tempb)) != NULL &&
+ (c = luaV_tonumber(rc, &tempc)) != NULL) {
+ switch (op) {
+ case TM_ADD: setnvalue(ra, nvalue(b) + nvalue(c)); break;
+ case TM_SUB: setnvalue(ra, nvalue(b) - nvalue(c)); break;
+ case TM_MUL: setnvalue(ra, nvalue(b) * nvalue(c)); break;
+ case TM_DIV: setnvalue(ra, nvalue(b) / nvalue(c)); break;
+ case TM_POW: {
+ const TObject *f = luaH_getstr(hvalue(gt(L)), G(L)->tmname[TM_POW]);
+ ptrdiff_t res = savestack(L, ra);
+ if (!ttisfunction(f))
+ luaG_runerror(L, "`__pow' (`^' operator) is not a function");
+ callTMres(L, f, b, c);
+ ra = restorestack(L, res); /* previous call may change stack */
+ setobjs2s(ra, L->top);
+ break;
+ }
+ default: lua_assert(0); break;
+ }
+ }
+ else if (!call_binTM(L, rb, rc, ra, op))
+ luaG_aritherror(L, rb, rc);
+}
+
+
+
+/*
+** some macros for common tasks in `luaV_execute'
+*/
+
+#define runtime_check(L, c) { if (!(c)) return 0; }
+
+#define RA(i) (base+GETARG_A(i))
+/* to be used after possible stack reallocation */
+#define XRA(i) (L->base+GETARG_A(i))
+#define RB(i) (base+GETARG_B(i))
+#define RKB(i) ((GETARG_B(i) < MAXSTACK) ? RB(i) : k+GETARG_B(i)-MAXSTACK)
+#define RC(i) (base+GETARG_C(i))
+#define RKC(i) ((GETARG_C(i) < MAXSTACK) ? RC(i) : k+GETARG_C(i)-MAXSTACK)
+#define KBx(i) (k+GETARG_Bx(i))
+
+
+#define dojump(pc, i) ((pc) += (i))
+
+
+StkId luaV_execute (lua_State *L) {
+ LClosure *cl;
+ TObject *k;
+ const Instruction *pc;
+ callentry: /* entry point when calling new functions */
+ if (L->hookmask & LUA_MASKCALL) {
+ L->ci->u.l.pc = &pc;
+ luaD_callhook(L, LUA_HOOKCALL, -1);
+ }
+ retentry: /* entry point when returning to old functions */
+ L->ci->u.l.pc = &pc;
+ lua_assert(L->ci->state == CI_SAVEDPC ||
+ L->ci->state == (CI_SAVEDPC | CI_CALLING));
+ L->ci->state = CI_HASFRAME; /* activate frame */
+ pc = L->ci->u.l.savedpc;
+ cl = &clvalue(L->base - 1)->l;
+ k = cl->p->k;
+ /* main loop of interpreter */
+ for (;;) {
+ const Instruction i = *pc++;
+ StkId base, ra;
+ if ((L->hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) &&
+ (--L->hookcount == 0 || L->hookmask & LUA_MASKLINE)) {
+ traceexec(L);
+ if (L->ci->state & CI_YIELD) { /* did hook yield? */
+ L->ci->u.l.savedpc = pc - 1;
+ L->ci->state = CI_YIELD | CI_SAVEDPC;
+ return NULL;
+ }
+ }
+ /* warning!! several calls may realloc the stack and invalidate `ra' */
+ base = L->base;
+ ra = RA(i);
+ lua_assert(L->ci->state & CI_HASFRAME);
+ lua_assert(base == L->ci->base);
+ lua_assert(L->top <= L->stack + L->stacksize && L->top >= base);
+ lua_assert(L->top == L->ci->top ||
+ GET_OPCODE(i) == OP_CALL || GET_OPCODE(i) == OP_TAILCALL ||
+ GET_OPCODE(i) == OP_RETURN || GET_OPCODE(i) == OP_SETLISTO);
+ switch (GET_OPCODE(i)) {
+ case OP_MOVE: {
+ setobjs2s(ra, RB(i));
+ break;
+ }
+ case OP_LOADK: {
+ setobj2s(ra, KBx(i));
+ break;
+ }
+ case OP_LOADBOOL: {
+ setbvalue(ra, GETARG_B(i));
+ if (GETARG_C(i)) pc++; /* skip next instruction (if C) */
+ break;
+ }
+ case OP_LOADNIL: {
+ TObject *rb = RB(i);
+ do {
+ setnilvalue(rb--);
+ } while (rb >= ra);
+ break;
+ }
+ case OP_GETUPVAL: {
+ int b = GETARG_B(i);
+ setobj2s(ra, cl->upvals[b]->v);
+ break;
+ }
+ case OP_GETGLOBAL: {
+ TObject *rb = KBx(i);
+ const TObject *v;
+ lua_assert(ttisstring(rb) && ttistable(&cl->g));
+ v = luaH_getstr(hvalue(&cl->g), tsvalue(rb));
+ if (!ttisnil(v)) { setobj2s(ra, v); }
+ else
+ setobj2s(XRA(i), luaV_index(L, &cl->g, rb, 0));
+ break;
+ }
+ case OP_GETTABLE: {
+ StkId rb = RB(i);
+ TObject *rc = RKC(i);
+ if (ttistable(rb)) {
+ const TObject *v = luaH_get(hvalue(rb), rc);
+ if (!ttisnil(v)) { setobj2s(ra, v); }
+ else
+ setobj2s(XRA(i), luaV_index(L, rb, rc, 0));
+ }
+ else
+ setobj2s(XRA(i), luaV_getnotable(L, rb, rc, 0));
+ break;
+ }
+ case OP_SETGLOBAL: {
+ lua_assert(ttisstring(KBx(i)) && ttistable(&cl->g));
+ luaV_settable(L, &cl->g, KBx(i), ra);
+ break;
+ }
+ case OP_SETUPVAL: {
+ int b = GETARG_B(i);
+ setobj(cl->upvals[b]->v, ra); /* write barrier */
+ break;
+ }
+ case OP_SETTABLE: {
+ luaV_settable(L, ra, RKB(i), RKC(i));
+ break;
+ }
+ case OP_NEWTABLE: {
+ int b = GETARG_B(i);
+ b = fb2int(b);
+ sethvalue(ra, luaH_new(L, b, GETARG_C(i)));
+ luaC_checkGC(L);
+ break;
+ }
+ case OP_SELF: {
+ StkId rb = RB(i);
+ TObject *rc = RKC(i);
+ runtime_check(L, ttisstring(rc));
+ setobjs2s(ra+1, rb);
+ if (ttistable(rb)) {
+ const TObject *v = luaH_getstr(hvalue(rb), tsvalue(rc));
+ if (!ttisnil(v)) { setobj2s(ra, v); }
+ else
+ setobj2s(XRA(i), luaV_index(L, rb, rc, 0));
+ }
+ else
+ setobj2s(XRA(i), luaV_getnotable(L, rb, rc, 0));
+ break;
+ }
+ case OP_ADD: {
+ TObject *rb = RKB(i);
+ TObject *rc = RKC(i);
+ if (ttisnumber(rb) && ttisnumber(rc)) {
+ setnvalue(ra, nvalue(rb) + nvalue(rc));
+ }
+ else
+ Arith(L, ra, rb, rc, TM_ADD);
+ break;
+ }
+ case OP_SUB: {
+ TObject *rb = RKB(i);
+ TObject *rc = RKC(i);
+ if (ttisnumber(rb) && ttisnumber(rc)) {
+ setnvalue(ra, nvalue(rb) - nvalue(rc));
+ }
+ else
+ Arith(L, ra, rb, rc, TM_SUB);
+ break;
+ }
+ case OP_MUL: {
+ TObject *rb = RKB(i);
+ TObject *rc = RKC(i);
+ if (ttisnumber(rb) && ttisnumber(rc)) {
+ setnvalue(ra, nvalue(rb) * nvalue(rc));
+ }
+ else
+ Arith(L, ra, rb, rc, TM_MUL);
+ break;
+ }
+ case OP_DIV: {
+ TObject *rb = RKB(i);
+ TObject *rc = RKC(i);
+ if (ttisnumber(rb) && ttisnumber(rc)) {
+ setnvalue(ra, nvalue(rb) / nvalue(rc));
+ }
+ else
+ Arith(L, ra, rb, rc, TM_DIV);
+ break;
+ }
+ case OP_POW: {
+ Arith(L, ra, RKB(i), RKC(i), TM_POW);
+ break;
+ }
+ case OP_UNM: {
+ const TObject *rb = RB(i);
+ TObject temp;
+ if (tonumber(rb, &temp)) {
+ setnvalue(ra, -nvalue(rb));
+ }
+ else {
+ setnilvalue(&temp);
+ if (!call_binTM(L, RB(i), &temp, ra, TM_UNM))
+ luaG_aritherror(L, RB(i), &temp);
+ }
+ break;
+ }
+ case OP_NOT: {
+ int res = l_isfalse(RB(i)); /* next assignment may change this value */
+ setbvalue(ra, res);
+ break;
+ }
+ case OP_CONCAT: {
+ int b = GETARG_B(i);
+ int c = GETARG_C(i);
+ luaV_concat(L, c-b+1, c); /* may change `base' (and `ra') */
+ base = L->base;
+ setobjs2s(RA(i), base+b);
+ luaC_checkGC(L);
+ break;
+ }
+ case OP_JMP: {
+ dojump(pc, GETARG_sBx(i));
+ break;
+ }
+ case OP_EQ: {
+ if (equalobj(L, RKB(i), RKC(i)) != GETARG_A(i)) pc++;
+ else dojump(pc, GETARG_sBx(*pc) + 1);
+ break;
+ }
+ case OP_LT: {
+ if (luaV_lessthan(L, RKB(i), RKC(i)) != GETARG_A(i)) pc++;
+ else dojump(pc, GETARG_sBx(*pc) + 1);
+ break;
+ }
+ case OP_LE: {
+ if (luaV_lessequal(L, RKB(i), RKC(i)) != GETARG_A(i)) pc++;
+ else dojump(pc, GETARG_sBx(*pc) + 1);
+ break;
+ }
+ case OP_TEST: {
+ TObject *rb = RB(i);
+ if (l_isfalse(rb) == GETARG_C(i)) pc++;
+ else {
+ setobjs2s(ra, rb);
+ dojump(pc, GETARG_sBx(*pc) + 1);
+ }
+ break;
+ }
+ case OP_CALL:
+ case OP_TAILCALL: {
+ StkId firstResult;
+ int b = GETARG_B(i);
+ int nresults;
+ if (b != 0) L->top = ra+b; /* else previous instruction set top */
+ nresults = GETARG_C(i) - 1;
+ firstResult = luaD_precall(L, ra);
+ if (firstResult) {
+ if (firstResult > L->top) { /* yield? */
+ lua_assert(L->ci->state == (CI_C | CI_YIELD));
+ (L->ci - 1)->u.l.savedpc = pc;
+ (L->ci - 1)->state = CI_SAVEDPC;
+ return NULL;
+ }
+ /* it was a C function (`precall' called it); adjust results */
+ luaD_poscall(L, nresults, firstResult);
+ if (nresults >= 0) L->top = L->ci->top;
+ }
+ else { /* it is a Lua function */
+ if (GET_OPCODE(i) == OP_CALL) { /* regular call? */
+ (L->ci-1)->u.l.savedpc = pc; /* save `pc' to return later */
+ (L->ci-1)->state = (CI_SAVEDPC | CI_CALLING);
+ }
+ else { /* tail call: put new frame in place of previous one */
+ int aux;
+ base = (L->ci - 1)->base; /* `luaD_precall' may change the stack */
+ ra = RA(i);
+ if (L->openupval) luaF_close(L, base);
+ for (aux = 0; ra+aux < L->top; aux++) /* move frame down */
+ setobjs2s(base+aux-1, ra+aux);
+ (L->ci - 1)->top = L->top = base+aux; /* correct top */
+ lua_assert(L->ci->state & CI_SAVEDPC);
+ (L->ci - 1)->u.l.savedpc = L->ci->u.l.savedpc;
+ (L->ci - 1)->u.l.tailcalls++; /* one more call lost */
+ (L->ci - 1)->state = CI_SAVEDPC;
+ L->ci--; /* remove new frame */
+ L->base = L->ci->base;
+ }
+ goto callentry;
+ }
+ break;
+ }
+ case OP_RETURN: {
+ CallInfo *ci = L->ci - 1; /* previous function frame */
+ int b = GETARG_B(i);
+ if (b != 0) L->top = ra+b-1;
+ lua_assert(L->ci->state & CI_HASFRAME);
+ if (L->openupval) luaF_close(L, base);
+ L->ci->state = CI_SAVEDPC; /* deactivate current function */
+ L->ci->u.l.savedpc = pc;
+ /* previous function was running `here'? */
+ if (!(ci->state & CI_CALLING)) {
+ lua_assert((ci->state & CI_C) || ci->u.l.pc != &pc);
+ return ra; /* no: return */
+ }
+ else { /* yes: continue its execution */
+ int nresults;
+ lua_assert(ttisfunction(ci->base - 1) && (ci->state & CI_SAVEDPC));
+ lua_assert(GET_OPCODE(*(ci->u.l.savedpc - 1)) == OP_CALL);
+ nresults = GETARG_C(*(ci->u.l.savedpc - 1)) - 1;
+ luaD_poscall(L, nresults, ra);
+ if (nresults >= 0) L->top = L->ci->top;
+ goto retentry;
+ }
+ }
+ case OP_FORLOOP: {
+ lua_Number step, idx, limit;
+ const TObject *plimit = ra+1;
+ const TObject *pstep = ra+2;
+ if (!ttisnumber(ra))
+ luaG_runerror(L, "`for' initial value must be a number");
+ if (!tonumber(plimit, ra+1))
+ luaG_runerror(L, "`for' limit must be a number");
+ if (!tonumber(pstep, ra+2))
+ luaG_runerror(L, "`for' step must be a number");
+ step = nvalue(pstep);
+ idx = nvalue(ra) + step; /* increment index */
+ limit = nvalue(plimit);
+ if (step > 0 ? idx <= limit : idx >= limit) {
+ dojump(pc, GETARG_sBx(i)); /* jump back */
+ chgnvalue(ra, idx); /* update index */
+ }
+ break;
+ }
+ case OP_TFORLOOP: {
+ int nvar = GETARG_C(i) + 1;
+ StkId cb = ra + nvar + 2; /* call base */
+ setobjs2s(cb, ra);
+ setobjs2s(cb+1, ra+1);
+ setobjs2s(cb+2, ra+2);
+ L->top = cb+3; /* func. + 2 args (state and index) */
+ luaD_call(L, cb, nvar);
+ L->top = L->ci->top;
+ ra = XRA(i) + 2; /* final position of first result */
+ cb = ra + nvar;
+ do { /* move results to proper positions */
+ nvar--;
+ setobjs2s(ra+nvar, cb+nvar);
+ } while (nvar > 0);
+ if (ttisnil(ra)) /* break loop? */
+ pc++; /* skip jump (break loop) */
+ else
+ dojump(pc, GETARG_sBx(*pc) + 1); /* jump back */
+ break;
+ }
+ case OP_TFORPREP: { /* for compatibility only */
+ if (ttistable(ra)) {
+ setobjs2s(ra+1, ra);
+ setobj2s(ra, luaH_getstr(hvalue(gt(L)), luaS_new(L, "next")));
+ }
+ dojump(pc, GETARG_sBx(i));
+ break;
+ }
+ case OP_SETLIST:
+ case OP_SETLISTO: {
+ int bc;
+ int n;
+ Table *h;
+ runtime_check(L, ttistable(ra));
+ h = hvalue(ra);
+ bc = GETARG_Bx(i);
+ if (GET_OPCODE(i) == OP_SETLIST)
+ n = (bc&(LFIELDS_PER_FLUSH-1)) + 1;
+ else {
+ n = L->top - ra - 1;
+ L->top = L->ci->top;
+ }
+ bc &= ~(LFIELDS_PER_FLUSH-1); /* bc = bc - bc%FPF */
+ for (; n > 0; n--)
+ setobj2t(luaH_setnum(L, h, bc+n), ra+n); /* write barrier */
+ break;
+ }
+ case OP_CLOSE: {
+ luaF_close(L, ra);
+ break;
+ }
+ case OP_CLOSURE: {
+ Proto *p;
+ Closure *ncl;
+ int nup, j;
+ p = cl->p->p[GETARG_Bx(i)];
+ nup = p->nups;
+ ncl = luaF_newLclosure(L, nup, &cl->g);
+ ncl->l.p = p;
+ for (j=0; j<nup; j++, pc++) {
+ if (GET_OPCODE(*pc) == OP_GETUPVAL)
+ ncl->l.upvals[j] = cl->upvals[GETARG_B(*pc)];
+ else {
+ lua_assert(GET_OPCODE(*pc) == OP_MOVE);
+ ncl->l.upvals[j] = luaF_findupval(L, base + GETARG_B(*pc));
+ }
+ }
+ setclvalue(ra, ncl);
+ luaC_checkGC(L);
+ break;
+ }
+ }
+ }
+}
+
+
--- /dev/null
+/*
+** $Id: lvm.h,v 1.47 2002/11/14 16:16:21 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"
+
+
+#define tostring(L,o) ((ttype(o) == LUA_TSTRING) || (luaV_tostring(L, o)))
+
+#define tonumber(o,n) (ttype(o) == LUA_TNUMBER || \
+ (((o) = luaV_tonumber(o,n)) != NULL))
+
+#define equalobj(L,o1,o2) \
+ (ttype(o1) == ttype(o2) && luaV_equalval(L, o1, o2))
+
+
+int luaV_lessthan (lua_State *L, const TObject *l, const TObject *r);
+int luaV_equalval (lua_State *L, const TObject *t1, const TObject *t2);
+const TObject *luaV_tonumber (const TObject *obj, TObject *n);
+int luaV_tostring (lua_State *L, StkId obj);
+const TObject *luaV_gettable (lua_State *L, const TObject *t, TObject *key,
+ int loop);
+void luaV_settable (lua_State *L, const TObject *t, TObject *key, StkId val);
+StkId luaV_execute (lua_State *L);
+void luaV_concat (lua_State *L, int total, int last);
+
+#endif
--- /dev/null
+/*
+** $Id: lzio.c,v 1.24 2003/03/20 16:00:56 roberto Exp $
+** a generic input stream interface
+** See Copyright Notice in lua.h
+*/
+
+
+#include <string.h>
+
+#define lzio_c
+
+#include "lua.h"
+
+#include "llimits.h"
+#include "lmem.h"
+#include "lzio.h"
+
+
+int luaZ_fill (ZIO *z) {
+ size_t size;
+ const char *buff = z->reader(NULL, z->data, &size);
+ if (buff == NULL || size == 0) return EOZ;
+ z->n = size - 1;
+ z->p = buff;
+ return char2int(*(z->p++));
+}
+
+
+int luaZ_lookahead (ZIO *z) {
+ if (z->n == 0) {
+ int c = luaZ_fill(z);
+ if (c == EOZ) return c;
+ z->n++;
+ z->p--;
+ }
+ return char2int(*z->p);
+}
+
+
+void luaZ_init (ZIO *z, lua_Chunkreader reader, void *data, const char *name) {
+ z->reader = reader;
+ z->data = data;
+ z->name = name;
+ 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) {
+ if (luaZ_fill(z) == EOZ)
+ return n; /* return number of missing bytes */
+ else {
+ ++z->n; /* filbuf removed first byte; put back it */
+ --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;
+}
+
+/* ------------------------------------------------------------------------ */
+char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n) {
+ if (n > buff->buffsize) {
+ if (n < LUA_MINBUFFER) n = LUA_MINBUFFER;
+ luaM_reallocvector(L, buff->buffer, buff->buffsize, n, char);
+ buff->buffsize = n;
+ }
+ return buff->buffer;
+}
+
+
--- /dev/null
+/*
+** $Id: lzio.h,v 1.15 2003/03/20 16:00:56 roberto Exp $
+** Buffered streams
+** See Copyright Notice in lua.h
+*/
+
+
+#ifndef lzio_h
+#define lzio_h
+
+#include "lua.h"
+
+
+#define EOZ (-1) /* end of stream */
+
+typedef struct Zio ZIO;
+
+
+#define char2int(c) cast(int, cast(unsigned char, (c)))
+
+#define zgetc(z) (((z)->n--)>0 ? char2int(*(z)->p++) : luaZ_fill(z))
+
+#define zname(z) ((z)->name)
+
+void luaZ_init (ZIO *z, lua_Chunkreader reader, void *data, const char *name);
+size_t luaZ_read (ZIO* z, void* b, size_t n); /* read next n bytes */
+int luaZ_lookahead (ZIO *z);
+
+
+
+typedef struct Mbuffer {
+ char *buffer;
+ size_t buffsize;
+} Mbuffer;
+
+
+char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n);
+
+#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0)
+
+#define luaZ_sizebuffer(buff) ((buff)->buffsize)
+#define luaZ_buffer(buff) ((buff)->buffer)
+
+#define luaZ_resizebuffer(L, buff, size) \
+ (luaM_reallocvector(L, (buff)->buffer, (buff)->buffsize, size, char), \
+ (buff)->buffsize = size)
+
+#define luaZ_freebuffer(L, buff) luaZ_resizebuffer(L, buff, 0)
+
+
+/* --------- Private Part ------------------ */
+
+struct Zio {
+ size_t n; /* bytes still unread */
+ const char *p; /* current position in buffer */
+ lua_Chunkreader reader;
+ void* data; /* additional data */
+ const char *name;
+};
+
+
+int luaZ_fill (ZIO *z);
+
+#endif
--- /dev/null
+These are simple tests for Lua. Some of them contain useful code.
+They are meant to be run to make sure Lua is built correctly and also
+to be read, to see how Lua programs look.
+
+Here is a one-line summary of each program:
+
+ bisect.lua bisection method for solving non-linear equations
+ cf.lua temperature conversion table (celsius to farenheit)
+ echo.lua echo command line arguments
+ env.lua environment variables as automatic global variables
+ factorial.lua factorial without recursion
+ fib.lua fibonacci function with cache
+ fibfor.lua fibonacci numbers with coroutines and generators
+ globals.lua report global variable usage
+ hello.lua the first program in every language
+ life.lua Conway's Game of Life
+ luac.lua bare-bones luac
+ printf.lua an implementation of printf
+ readonly.lua make global variables readonly
+ sieve.lua the sieve of of Eratosthenes programmed with coroutines
+ sort.lua two implementations of a sort function
+ table.lua make table, grouping all data for the same item
+ trace-calls.lua trace calls
+ trace-globals.lua trace assigments to global variables
+ undefined.lua catch "undefined" global variables
+ xd.lua hex dump
+
--- /dev/null
+-- bisection method for solving non-linear equations
+
+delta=1e-6 -- tolerance
+
+function bisect(f,a,b,fa,fb)
+ local c=(a+b)/2
+ io.write(n," c=",c," a=",a," b=",b,"\n")
+ if c==a or c==b or math.abs(a-b)<delta then return c,b-a end
+ n=n+1
+ local fc=f(c)
+ if fa*fc<0 then return bisect(f,a,c,fa,fc) else return bisect(f,c,b,fc,fb) end
+end
+
+-- find root of f in the inverval [a,b]. needs f(a)*f(b)<0
+function solve(f,a,b)
+ n=0
+ local z,e=bisect(f,a,b,f(a),f(b))
+ io.write(string.format("after %d steps, root is %.17g with error %.1e, f=%.1e\n",n,z,e,f(z)))
+end
+
+-- our function
+function f(x)
+ return x*x*x-x-1
+end
+
+-- find zero in [1,2]
+solve(f,1,2)
--- /dev/null
+-- temperature conversion table (celsius to farenheit)
+
+for c0=-20,50-1,10 do
+ io.write("C ")
+ for c=c0,c0+10-1 do
+ io.write(string.format("%3.0f ",c))
+ end
+ io.write("\n")
+
+ io.write("F ")
+ for c=c0,c0+10-1 do
+ f=(9/5)*c+32
+ io.write(string.format("%3.0f ",f))
+ end
+ io.write("\n\n")
+end
--- /dev/null
+-- echo command line arguments
+
+for i=0,table.getn(arg) do
+ print(i,arg[i])
+end
--- /dev/null
+-- read environment variables as if they were global variables
+
+local f=function (t,i) return os.getenv(i) end
+setmetatable(getfenv(),{__index=f})
+
+-- an example
+print(a,USER,PATH)
--- /dev/null
+-- function closures are powerful
+
+-- traditional fixed-point operator from functional programming
+Y = function (g)
+ local a = function (f) return f(f) end
+ return a(function (f)
+ return g(function (x)
+ local c=f(f)
+ return c(x)
+ end)
+ end)
+end
+
+
+-- factorial without recursion
+F = function (f)
+ return function (n)
+ if n == 0 then return 1
+ else return n*f(n-1) end
+ end
+ end
+
+factorial = Y(F) -- factorial is the fixed point of F
+
+-- now test it
+function test(x)
+ io.write(x,"! = ",factorial(x),"\n")
+end
+
+for n=0,16 do
+ test(n)
+end
--- /dev/null
+-- fibonacci function with cache
+
+-- very inefficient fibonacci function
+function fib(n)
+ N=N+1
+ if n<2 then
+ return n
+ else
+ return fib(n-1)+fib(n-2)
+ end
+end
+
+-- a general-purpose value cache
+function cache(f)
+ local c={}
+ return function (x)
+ local y=c[x]
+ if not y then
+ y=f(x)
+ c[x]=y
+ end
+ return y
+ end
+end
+
+-- run and time it
+function test(s,f)
+ N=0
+ local c=os.clock()
+ local v=f(n)
+ local t=os.clock()-c
+ print(s,n,v,t,N)
+end
+
+n=arg[1] or 24 -- for other values, do lua fib.lua XX
+n=tonumber(n)
+print("","n","value","time","evals")
+test("plain",fib)
+fib=cache(fib)
+test("cached",fib)
--- /dev/null
+-- example of for with generator functions
+
+function generatefib (n)
+ return coroutine.wrap(function ()
+ local a,b = 1, 1
+ while a <= n do
+ coroutine.yield(a)
+ a, b = b, a+b
+ end
+ end, n)
+end
+
+for i in generatefib(1000) do print(i) end
--- /dev/null
+-- reads luac listings and reports global variable usage
+-- lines where a global is written to are marked with "*"
+-- typical usage: luac -p -l file.lua | lua globals.lua | sort | lua table.lua
+
+while 1 do
+ local s=io.read()
+ if s==nil then break end
+ local ok,_,l,op,g=string.find(s,"%[%-?(%d*)%]%s*([GS])ETGLOBAL.-;%s+(.*)$")
+ if ok then
+ if op=="S" then op="*" else op="" end
+ io.write(g,"\t",l,op,"\n")
+ end
+end
--- /dev/null
+-- the first program in every language
+
+io.write("Hello world, from ",_VERSION,"!\n")
--- /dev/null
+-- life.lua
+-- original by Dave Bollinger <DBollinger@compuserve.com> posted to lua-l
+-- modified to use ANSI terminal escape sequences
+-- modified to use for instead of while
+
+local write=io.write
+
+ALIVE="¥" DEAD="þ"
+ALIVE="O" DEAD="-"
+
+function delay() -- NOTE: SYSTEM-DEPENDENT, adjust as necessary
+ for i=1,10000 do end
+ -- local i=os.clock()+1 while(os.clock()<i) do end
+end
+
+function ARRAY2D(w,h)
+ local t = {w=w,h=h}
+ for y=1,h do
+ t[y] = {}
+ for x=1,w do
+ t[y][x]=0
+ end
+ end
+ return t
+end
+
+_CELLS = {}
+
+-- give birth to a "shape" within the cell array
+function _CELLS:spawn(shape,left,top)
+ for y=0,shape.h-1 do
+ for x=0,shape.w-1 do
+ self[top+y][left+x] = shape[y*shape.w+x+1]
+ end
+ end
+end
+
+-- run the CA and produce the next generation
+function _CELLS:evolve(next)
+ local ym1,y,yp1,yi=self.h-1,self.h,1,self.h
+ while yi > 0 do
+ local xm1,x,xp1,xi=self.w-1,self.w,1,self.w
+ while xi > 0 do
+ local sum = self[ym1][xm1] + self[ym1][x] + self[ym1][xp1] +
+ self[y][xm1] + self[y][xp1] +
+ self[yp1][xm1] + self[yp1][x] + self[yp1][xp1]
+ next[y][x] = ((sum==2) and self[y][x]) or ((sum==3) and 1) or 0
+ xm1,x,xp1,xi = x,xp1,xp1+1,xi-1
+ end
+ ym1,y,yp1,yi = y,yp1,yp1+1,yi-1
+ end
+end
+
+-- output the array to screen
+function _CELLS:draw()
+ local out="" -- accumulate to reduce flicker
+ for y=1,self.h do
+ for x=1,self.w do
+ out=out..(((self[y][x]>0) and ALIVE) or DEAD)
+ end
+ out=out.."\n"
+ end
+ write(out)
+end
+
+-- constructor
+function CELLS(w,h)
+ local c = ARRAY2D(w,h)
+ c.spawn = _CELLS.spawn
+ c.evolve = _CELLS.evolve
+ c.draw = _CELLS.draw
+ return c
+end
+
+--
+-- shapes suitable for use with spawn() above
+--
+HEART = { 1,0,1,1,0,1,1,1,1; w=3,h=3 }
+GLIDER = { 0,0,1,1,0,1,0,1,1; w=3,h=3 }
+EXPLODE = { 0,1,0,1,1,1,1,0,1,0,1,0; w=3,h=4 }
+FISH = { 0,1,1,1,1,1,0,0,0,1,0,0,0,0,1,1,0,0,1,0; w=5,h=4 }
+BUTTERFLY = { 1,0,0,0,1,0,1,1,1,0,1,0,0,0,1,1,0,1,0,1,1,0,0,0,1; w=5,h=5 }
+
+-- the main routine
+function LIFE(w,h)
+ -- create two arrays
+ local thisgen = CELLS(w,h)
+ local nextgen = CELLS(w,h)
+
+ -- create some life
+ -- about 1000 generations of fun, then a glider steady-state
+ thisgen:spawn(GLIDER,5,4)
+ thisgen:spawn(EXPLODE,25,10)
+ thisgen:spawn(FISH,4,12)
+
+ -- run until break
+ local gen=1
+ write("\027[2J") -- ANSI clear screen
+ while 1 do
+ thisgen:evolve(nextgen)
+ thisgen,nextgen = nextgen,thisgen
+ write("\027[H") -- ANSI home cursor
+ thisgen:draw()
+ write("Life - generation ",gen,"\n")
+ gen=gen+1
+ if gen>2000 then break end
+ --delay() -- no delay
+ end
+end
+
+LIFE(40,20)
--- /dev/null
+../bin/lua
\ No newline at end of file
--- /dev/null
+../bin/luac
\ No newline at end of file
--- /dev/null
+-- bare-bones luac in Lua
+-- usage: lua luac.lua file.lua
+
+assert(arg[1]~=nil and arg[2]==nil,"usage: lua luac.lua file.lua")
+f=assert(io.open("luac.out","wb"))
+f:write(string.dump(assert(loadfile(arg[1]))))
+io.close(f)
--- /dev/null
+-- an implementation of printf
+
+function printf(...)
+ io.write(string.format(unpack(arg)))
+end
+
+printf("Hello %s from %s on %s\n",os.getenv"USER" or "there",_VERSION,os.date())
--- /dev/null
+-- make global variables readonly
+
+local f=function (t,i) error("cannot redefine global variable `"..i.."'",2) end
+local g={}
+local G=getfenv()
+setmetatable(g,{__index=G,__newindex=f})
+setfenv(1,g)
+
+-- an example
+rawset(g,"x",3)
+x=2
+y=1 -- cannot redefine `y'
--- /dev/null
+-- the sieve of of Eratosthenes programmed with coroutines
+-- typical usage: lua -e N=1000 sieve.lua | column
+
+-- generate all the numbers from 2 to n
+function gen (n)
+ return coroutine.wrap(function ()
+ for i=2,n do coroutine.yield(i) end
+ end)
+end
+
+-- filter the numbers generated by `g', removing multiples of `p'
+function filter (p, g)
+ return coroutine.wrap(function ()
+ while 1 do
+ local n = g()
+ if n == nil then return end
+ if math.mod(n, p) ~= 0 then coroutine.yield(n) end
+ end
+ end)
+end
+
+N=N or 1000 -- from command line
+x = gen(N) -- generate primes up to N
+while 1 do
+ local n = x() -- pick a number until done
+ if n == nil then break end
+ print(n) -- must be a prime number
+ x = filter(n, x) -- now remove its multiples
+end
--- /dev/null
+-- two implementations of a sort function
+-- this is an example only. Lua has now a built-in function "sort"
+
+-- extracted from Programming Pearls, page 110
+function qsort(x,l,u,f)
+ if l<u then
+ local m=math.random(u-(l-1))+l-1 -- choose a random pivot in range l..u
+ x[l],x[m]=x[m],x[l] -- swap pivot to first position
+ local t=x[l] -- pivot value
+ m=l
+ local i=l+1
+ while i<=u do
+ -- invariant: x[l+1..m] < t <= x[m+1..i-1]
+ if f(x[i],t) then
+ m=m+1
+ x[m],x[i]=x[i],x[m] -- swap x[i] and x[m]
+ end
+ i=i+1
+ end
+ x[l],x[m]=x[m],x[l] -- swap pivot to a valid place
+ -- x[l+1..m-1] < x[m] <= x[m+1..u]
+ qsort(x,l,m-1,f)
+ qsort(x,m+1,u,f)
+ end
+end
+
+function selectionsort(x,n,f)
+ local i=1
+ while i<=n do
+ local m,j=i,i+1
+ while j<=n do
+ if f(x[j],x[m]) then m=j end
+ j=j+1
+ end
+ x[i],x[m]=x[m],x[i] -- swap x[i] and x[m]
+ i=i+1
+ end
+end
+
+function show(m,x)
+ io.write(m,"\n\t")
+ local i=1
+ while x[i] do
+ io.write(x[i])
+ i=i+1
+ if x[i] then io.write(",") end
+ end
+ io.write("\n")
+end
+
+function testsorts(x)
+ local n=1
+ while x[n] do n=n+1 end; n=n-1 -- count elements
+ show("original",x)
+ qsort(x,1,n,function (x,y) return x<y end)
+ show("after quicksort",x)
+ selectionsort(x,n,function (x,y) return x>y end)
+ show("after reverse selection sort",x)
+ qsort(x,1,n,function (x,y) return x<y end)
+ show("after quicksort again",x)
+end
+
+-- array to be sorted
+x={"Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"}
+
+testsorts(x)
--- /dev/null
+-- make table, grouping all data for the same item
+-- input is 2 columns (item, data)
+
+local A
+while 1 do
+ local l=io.read()
+ if l==nil then break end
+ local _,_,a,b=string.find(l,'"?([_%w]+)"?%s*(.*)$')
+ if a~=A then A=a io.write("\n",a,":") end
+ io.write(" ",b)
+end
+io.write("\n")
--- /dev/null
+-- trace calls
+-- example: lua -ltrace-calls.lua bisect.lua
+
+local level=0
+
+function hook(event)
+ local t=debug.getinfo(3)
+ io.write(level," >>> ",string.rep(" ",level))
+ if t~=nil and t.currentline>=0 then io.write(t.short_src,":",t.currentline," ") end
+ t=debug.getinfo(2)
+ if event=="call" then
+ level=level+1
+ else
+ level=level-1 if level<0 then level=0 end
+ end
+ if t.what=="main" then
+ if event=="call" then
+ io.write("begin ",t.short_src)
+ else
+ io.write("end ",t.short_src)
+ end
+ elseif t.what=="Lua" then
+-- table.foreach(t,print)
+ io.write(event," ",t.name or "(Lua)"," <",t.linedefined,":",t.short_src,">")
+ else
+ io.write(event," ",t.name or "(C)"," [",t.what,"] ")
+ end
+ io.write("\n")
+end
+
+debug.sethook(hook,"cr")
+level=0
--- /dev/null
+-- trace assigments to global variables
+
+do
+ -- a tostring that quotes strings. note the use of the original tostring.
+ local _tostring=tostring
+ local tostring=function(a)
+ if type(a)=="string" then
+ return string.format("%q",a)
+ else
+ return _tostring(a)
+ end
+ end
+
+ local log=function (name,old,new)
+ local t=debug.getinfo(3,"Sl")
+ local line=t.currentline
+ io.write(t.short_src)
+ if line>=0 then io.write(":",line) end
+ io.write(": ",name," is now ",tostring(new)," (was ",tostring(old),")","\n")
+ end
+
+ local g={}
+ local set=function (t,name,value)
+ log(name,g[name],value)
+ g[name]=value
+ end
+ setmetatable(getfenv(),{__index=g,__newindex=set})
+end
+
+-- an example
+
+a=1
+b=2
+a=10
+b=20
+b=nil
+b=200
+print(a,b,c)
--- /dev/null
+-- catch "undefined" global variables
+
+local f=function (t,i) error("undefined global variable `"..i.."'",2) end
+setmetatable(getfenv(),{__index=f})
+
+-- an example
+a=1
+c=3
+print(a,b,c) -- `b' is undefined
--- /dev/null
+-- hex dump
+-- usage: lua xd.lua < file
+
+local offset=0
+
+while 1 do
+ local s=io.read(16)
+ if s==nil then return end
+ io.write(string.format("%08X ",offset))
+ string.gsub(s,"(.)",function (c) io.write(string.format("%02X ",string.byte(c))) end)
+ io.write(string.rep(" ",3*(16-string.len(s))))
+ io.write(" ",string.gsub(s,"%c","."),"\n")
+ offset=offset+16
+end
--- /dev/null
+#include "packet-lua.h"
+
+LUA_CLASS_DEFINE(Column,COLUMN,if (! *p) luaL_error(L,"null column"));
+LUA_CLASS_DEFINE(Columns,COLUMNS,NOP);
+LUA_CLASS_DEFINE(Pinfo,PINFO,if (! *p) luaL_error(L,"null pinfo"));
+
+/* Column class */
+struct col_names_t {
+ const gchar* name;
+ int id;
+};
+
+static const struct col_names_t colnames[] = {
+ {"number",COL_NUMBER},
+ {"abs_time",COL_ABS_TIME},
+ {"cls_time",COL_CLS_TIME},
+ {"rel_time",COL_REL_TIME},
+ {"date",COL_ABS_DATE_TIME},
+ {"delta_time",COL_DELTA_TIME},
+ {"src",COL_DEF_SRC},
+ {"src_res",COL_RES_SRC},
+ {"src_unres",COL_UNRES_SRC},
+ {"dl_src",COL_DEF_DL_SRC},
+ {"dl_src_res",COL_RES_DL_SRC},
+ {"dl_src_unres",COL_UNRES_DL_SRC},
+ {"net_src",COL_DEF_NET_SRC},
+ {"net_src_res",COL_RES_NET_SRC},
+ {"net_src_unres",COL_UNRES_NET_SRC},
+ {"dst",COL_DEF_DST},
+ {"dst_res",COL_RES_DST},
+ {"dst_unres",COL_UNRES_DST},
+ {"dl_dst",COL_DEF_DL_DST},
+ {"dl_dst_res",COL_RES_DL_DST},
+ {"dl_dst_unres",COL_UNRES_DL_DST},
+ {"net_dst",COL_DEF_NET_DST},
+ {"net_dst_res",COL_RES_NET_DST},
+ {"net_dst_unres",COL_UNRES_NET_DST},
+ {"src_port",COL_DEF_SRC_PORT},
+ {"src_port_res",COL_RES_SRC_PORT},
+ {"src_port_unres",COL_UNRES_SRC_PORT},
+ {"dst_port",COL_DEF_DST_PORT},
+ {"dst_port_res",COL_RES_DST_PORT},
+ {"dst_port_unres",COL_UNRES_DST_PORT},
+ {"protocol",COL_PROTOCOL},
+ {"info",COL_INFO},
+ {"packet_len",COL_PACKET_LENGTH},
+ {"cumulative_bytes",COL_CUMULATIVE_BYTES},
+ {"oxid",COL_OXID},
+ {"rxid",COL_RXID},
+ {"direction",COL_IF_DIR},
+ {"circuit_id",COL_CIRCUIT_ID},
+ {"src_idx",COL_SRCIDX},
+ {"dst_idx",COL_DSTIDX},
+ {"vsan",COL_VSAN},
+ {"tx_rate",COL_TX_RATE},
+ {"rssi",COL_RSSI},
+ {"hpux_subsys",COL_HPUX_SUBSYS},
+ {"hpux_devid",COL_HPUX_DEVID},
+ {"dce_call",COL_DCE_CALL},
+ {NULL,0}
+};
+
+static gint col_name_to_id(const gchar* name) {
+ const struct col_names_t* cn;
+ for(cn = colnames; cn->name; cn++) {
+ if (g_str_equal(cn->name,name)) {
+ return cn->id;
+ }
+ }
+
+ return 0;
+}
+
+static const gchar* col_id_to_name(gint id) {
+ const struct col_names_t* cn;
+ for(cn = colnames; cn->name; cn++) {
+ if ( cn->id == id ) {
+ return cn->name;
+ }
+ }
+ return NULL;
+}
+
+
+static int Column_tostring(lua_State *L) {
+ Column c = checkColumn(L,1);
+ const gchar* name;
+
+ if (!c) return 0;
+
+ name = col_id_to_name(c->col);
+
+ lua_pushstring(L,name ? name : "Unknown Column");
+ return 1;
+}
+
+static int Column_clear(lua_State *L) {
+ Column c = checkColumn(L,1);
+
+ if (!c) return 0;
+
+ if (check_col(c->cinfo, c->col))
+ col_clear(c->cinfo, c->col);
+
+ return 0;
+}
+
+static int Column_set(lua_State *L) {
+ Column c = checkColumn(L,1);
+ const gchar* s = luaL_checkstring(L,2);
+
+ if (!c) return 0;
+
+ if (check_col(c->cinfo, c->col))
+ col_set_str(c->cinfo, c->col, s);
+
+ return 0;
+}
+
+static int Column_append(lua_State *L) {
+ Column c = checkColumn(L,1);
+ const gchar* s = luaL_checkstring(L,2);
+
+ if (!(c && s)) return 0;
+
+ if (check_col(c->cinfo, c->col))
+ col_append_str(c->cinfo, c->col, s);
+
+ return 0;
+}
+static int Column_preppend(lua_State *L) {
+ Column c = checkColumn(L,1);
+ const gchar* s = luaL_checkstring(L,2);
+
+ if (!(c && s)) return 0;
+
+ if (check_col(c->cinfo, c->col))
+ col_prepend_fstr(c->cinfo, c->col, "%s",s);
+
+ return 0;
+}
+
+static int Column_gc(lua_State *L) {
+ Column c = checkColumn(L,1);
+ if (!c) return 0;
+ g_free(c);
+ return 0;
+}
+
+static const luaL_reg Column_methods[] = {
+ {"clear", Column_clear },
+ {"set", Column_set },
+ {"append", Column_append },
+ {"preppend", Column_preppend },
+ {0,0}
+};
+
+
+static const luaL_reg Column_meta[] = {
+ {"__gc", Column_gc },
+ {"__tostring", Column_tostring },
+ {0,0}
+};
+
+
+int Column_register(lua_State *L) {
+ luaL_openlib(L, COLUMN, Column_methods, 0);
+ luaL_newmetatable(L, COLUMN);
+ luaL_openlib(L, 0, Column_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+}
+
+
+
+
+
+
+
+
+static int Columns_tostring(lua_State *L) {
+ lua_pushstring(L,"Columns");
+ return 1;
+}
+
+static int Columns_newindex(lua_State *L) {
+ Columns cols = checkColumns(L,1);
+ const struct col_names_t* cn;
+ const char* colname;
+ const char* text;
+
+ if (!cols) return 0;
+
+ colname = luaL_checkstring(L,2);
+ text = luaL_checkstring(L,3);
+
+
+ for(cn = colnames; cn->name; cn++) {
+ if( g_str_equal(cn->name,colname) ) {
+ if (check_col(cols, cn->id))
+ col_set_str(cols, cn->id, text);
+ return 1;
+ }
+ }
+
+ return 0;
+}
+
+static int Columns_index(lua_State *L) {
+ Columns cols = checkColumns(L,1);
+ const struct col_names_t* cn;
+ const char* colname;
+
+ if (!cols) return 0;
+
+ colname = luaL_checkstring(L,2);
+
+ if (!colname) return 0;
+
+ for(cn = colnames; cn->name; cn++) {
+ if( g_str_equal(cn->name,colname) ) {
+ Column c = g_malloc(sizeof(struct _eth_col_info));
+ c->cinfo = cols;
+ c->col = col_name_to_id(colname);
+
+ pushColumn(L,c);
+ return 0;
+ }
+ }
+
+ return 0;
+}
+
+
+static const luaL_reg Columns_meta[] = {
+ {"__tostring", Columns_tostring },
+ {"__newindex", Columns_index },
+ {"__index", Columns_newindex },
+ {0,0}
+};
+
+
+int Columns_register(lua_State *L) {
+ luaL_newmetatable(L, COLUMN);
+ luaL_openlib(L, NULL, Columns_meta, 0);
+
+ return 1;
+}
+
+
+/* Pinfo class */
+static int Pinfo_tostring(lua_State *L) { lua_pushstring(L,"a Pinfo"); return 1; }
+
+#define PINFO_GET_NUMBER(name,val) static int name(lua_State *L) { \
+ Pinfo pinfo = checkPinfo(L,1); \
+ if (!pinfo) return 0;\
+ lua_pushnumber(L,(lua_Number)(val));\
+ return 1;\
+}
+
+#define PINFO_GET_STRING(name,val) static int name(lua_State *L) { \
+ Pinfo pinfo = checkPinfo(L,1); \
+ if (!pinfo) return 0; \
+ if (val) lua_pushstring(L,(const char*)(val)); else lua_pushnil(L); \
+ return 1; \
+}
+
+PINFO_GET_NUMBER(Pinfo_number,pinfo->fd->num);
+PINFO_GET_NUMBER(Pinfo_len,pinfo->fd->pkt_len);
+PINFO_GET_NUMBER(Pinfo_caplen,pinfo->fd->cap_len);
+PINFO_GET_NUMBER(Pinfo_abs_ts,(((double)pinfo->fd->abs_ts.secs) + (((double)pinfo->fd->abs_ts.nsecs) / 1000000000.0) ));
+PINFO_GET_NUMBER(Pinfo_rel_ts,(((double)pinfo->fd->rel_ts.secs) + (((double)pinfo->fd->rel_ts.nsecs) / 1000000000.0) ));
+PINFO_GET_NUMBER(Pinfo_delta_ts,(((double)pinfo->fd->del_ts.secs) + (((double)pinfo->fd->del_ts.nsecs) / 1000000000.0) ));
+PINFO_GET_NUMBER(Pinfo_visited,pinfo->fd->flags.visited);
+PINFO_GET_NUMBER(Pinfo_ipproto,pinfo->ipproto);
+PINFO_GET_NUMBER(Pinfo_circuit_id,pinfo->circuit_id);
+PINFO_GET_NUMBER(Pinfo_ptype,pinfo->ptype);
+PINFO_GET_NUMBER(Pinfo_match_port,pinfo->match_port);
+
+
+PINFO_GET_STRING(Pinfo_src,address_to_str(&(pinfo->src)));
+PINFO_GET_STRING(Pinfo_dst,address_to_str(&(pinfo->dst)));
+PINFO_GET_STRING(Pinfo_net_src,address_to_str(&(pinfo->net_src)));
+PINFO_GET_STRING(Pinfo_net_dst,address_to_str(&(pinfo->net_dst)));
+PINFO_GET_STRING(Pinfo_dl_src,address_to_str(&(pinfo->dl_src)));
+PINFO_GET_STRING(Pinfo_dl_dst,address_to_str(&(pinfo->dl_dst)));
+PINFO_GET_STRING(Pinfo_match_string,pinfo->match_string);
+PINFO_GET_STRING(Pinfo_curr_proto,pinfo->current_proto);
+
+static int Pinfo_columns(lua_State *L) {
+ Pinfo pinfo = checkPinfo(L,1);
+ if (!pinfo) return 0;
+ pushColumns(L,pinfo->cinfo);
+ return 1;
+}
+
+static const luaL_reg Pinfo_methods[] = {
+ {"number", Pinfo_number },
+ {"len", Pinfo_len },
+ {"caplen", Pinfo_caplen },
+ {"abs_ts",Pinfo_abs_ts },
+ {"rel_ts",Pinfo_rel_ts },
+ {"delta_ts",Pinfo_delta_ts },
+ {"visited",Pinfo_visited },
+ {"src_address", Pinfo_src },
+ {"dst_address", Pinfo_dst },
+ {"dl_src", Pinfo_dl_src },
+ {"dl_dst", Pinfo_dl_dst },
+ {"net_src", Pinfo_net_src },
+ {"net_dst", Pinfo_net_dst },
+ {"ipproto", Pinfo_ipproto },
+ {"circuit_id", Pinfo_circuit_id },
+ {"ptype", Pinfo_ptype },
+ {"match_port", Pinfo_match_port },
+ {"match_string", Pinfo_match_string },
+ {"curr_proto", Pinfo_curr_proto },
+ {"col", Pinfo_columns },
+ {0,0}
+};
+
+static const luaL_reg Pinfo_meta[] = {
+ {"__tostring", Pinfo_tostring},
+ {0, 0}
+};
+
+int Pinfo_register(lua_State* L) {
+ luaL_openlib(L, PINFO, Pinfo_methods, 0);
+ luaL_newmetatable(L, PINFO);
+ luaL_openlib(L, 0, Pinfo_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+};
+
--- /dev/null
+#include "packet-lua.h"
+
+LUA_CLASS_DEFINE(Proto,PROTO,if (! *p) luaL_error(L,"null Proto"));
+LUA_CLASS_DEFINE(ProtoField,PROTO_FIELD,if (! *p) luaL_error(L,"null ProtoField"));
+LUA_CLASS_DEFINE(ProtoFieldArray,PROTO_FIELD_ARRAY,if (! *p) luaL_error(L,"null ProtoFieldArray"));
+LUA_CLASS_DEFINE(Ett,ETT,NOP);
+LUA_CLASS_DEFINE(EttArray,ETT_ARRAY,if (! *p) luaL_error(L,"null EttArray"));
+LUA_CLASS_DEFINE(ValueString,VALUE_STRING,NOP);
+
+/*
+ * ProtoField class
+ */
+
+static const eth_ft_types_t ftenums[] = {
+{"FT_BOOLEAN",FT_BOOLEAN},
+{"FT_UINT8",FT_UINT8},
+{"FT_UINT16",FT_UINT16},
+{"FT_UINT24",FT_UINT24},
+{"FT_UINT32",FT_UINT32},
+{"FT_UINT64",FT_UINT64},
+{"FT_INT8",FT_INT8},
+{"FT_INT16",FT_INT16},
+{"FT_INT24",FT_INT24},
+{"FT_INT32",FT_INT32},
+{"FT_INT64",FT_INT64},
+{"FT_FLOAT",FT_FLOAT},
+{"FT_DOUBLE",FT_DOUBLE},
+{"FT_STRING",FT_STRING},
+{"FT_STRINGZ",FT_STRINGZ},
+{"FT_ETHER",FT_ETHER},
+{"FT_BYTES",FT_BYTES},
+{"FT_UINT_BYTES",FT_UINT_BYTES},
+{"FT_IPv4",FT_IPv4},
+{"FT_IPv6",FT_IPv6},
+{"FT_IPXNET",FT_IPXNET},
+{"FT_FRAMENUM",FT_FRAMENUM},
+{"FT_GUID",FT_GUID},
+{"FT_OID",FT_OID},
+{NULL,FT_NONE}
+};
+
+static enum ftenum get_ftenum(const gchar* type) {
+ const eth_ft_types_t* ts;
+ for (ts = ftenums; ts->str; ts++) {
+ if ( g_str_equal(ts->str,type) ) {
+ return ts->id;
+ }
+ }
+
+ return FT_NONE;
+}
+
+static const gchar* ftenum_to_string(enum ftenum ft) {
+ const eth_ft_types_t* ts;
+ for (ts = ftenums; ts->str; ts++) {
+ if ( ts->id == ft ) {
+ return ts->str;
+ }
+ }
+
+ return NULL;
+}
+
+struct base_display_string_t {
+ const gchar* str;
+ base_display_e base;
+};
+
+static const struct base_display_string_t base_displays[] = {
+ { "BASE_NONE", BASE_NONE},
+ {"BASE_DEC", BASE_DEC},
+ {"BASE_HEX", BASE_HEX},
+ {"BASE_OCT", BASE_OCT},
+ {"BASE_DEC_HEX", BASE_DEC_HEX},
+ {"BASE_HEX_DEC", BASE_HEX_DEC},
+ {NULL,0}
+};
+
+static const gchar* base_to_string(base_display_e base) {
+ const struct base_display_string_t* b;
+ for (b=base_displays;b->str;b++) {
+ if ( base == b->base)
+ return b->str;
+ }
+ return NULL;
+}
+
+static base_display_e string_to_base(const gchar* str) {
+ const struct base_display_string_t* b;
+ for (b=base_displays;b->str;b++) {
+ if ( g_str_equal(str,b->str))
+ return b->base;
+ }
+ return BASE_NONE;
+}
+
+
+
+static int ProtoField_new(lua_State* L) {
+ ProtoField f = g_malloc(sizeof(eth_field_t));
+ GArray* vs;
+
+ f->hfid = -2;
+ f->name = g_strdup(luaL_checkstring(L,1));
+ f->abbr = g_strdup(luaL_checkstring(L,2));
+ f->type = get_ftenum(luaL_checkstring(L,3));
+
+ if (f->type == FT_NONE) {
+ luaL_argerror(L, 3, "invalid FT_type");
+ return 0;
+ }
+
+ if (! lua_isnil(L,4) ) {
+ vs = checkValueString(L,4);
+
+ if (vs) {
+ f->vs = (value_string*)vs->data;
+ }
+ } else {
+ f->vs = NULL;
+ }
+
+ /* XXX: need BASE_ERROR */
+ f->base = string_to_base(luaL_optstring(L, 5, "BASE_NONE"));
+ f->mask = luaL_optint(L, 6, 0x0);
+ f->blob = g_strdup(luaL_optstring(L,7,""));
+
+ pushProtoField(L,f);
+
+ return 1;
+}
+
+
+
+
+static int ProtoField_integer(lua_State* L, enum ftenum type) {
+ ProtoField f = g_malloc(sizeof(eth_field_t));
+ const gchar* abbr = luaL_checkstring(L,1);
+ const gchar* name = luaL_optstring(L,2,abbr);
+ const gchar* base = luaL_optstring(L, 3, "BASE_DEC");
+ GArray* vs = (lua_gettop(L) >= 4) ? checkValueString(L,4) : NULL;
+ int mask = luaL_optint(L, 5, 0x0);
+ const gchar* blob = luaL_optstring(L,6,"");
+
+ f->hfid = -2;
+ f->name = g_strdup(name);
+ f->abbr = g_strdup(abbr);
+ f->type = type;
+ f->vs = (value_string*)vs->data;
+ f->base = string_to_base(base);
+ f->mask = mask;
+ f->blob = g_strdup(blob);
+
+ pushProtoField(L,f);
+
+ return 1;
+}
+
+#define PROTOFIELD_INTEGER(lower,FT) static int ProtoField_##lower(lua_State* L) { return ProtoField_integer(L,FT); }
+PROTOFIELD_INTEGER(uint8,FT_UINT8);
+PROTOFIELD_INTEGER(uint16,FT_UINT16);
+PROTOFIELD_INTEGER(uint24,FT_UINT24);
+PROTOFIELD_INTEGER(uint32,FT_UINT32);
+PROTOFIELD_INTEGER(uint64,FT_UINT64);
+PROTOFIELD_INTEGER(int8,FT_INT8);
+PROTOFIELD_INTEGER(int16,FT_INT8);
+PROTOFIELD_INTEGER(int24,FT_INT8);
+PROTOFIELD_INTEGER(int32,FT_INT8);
+PROTOFIELD_INTEGER(int64,FT_INT8);
+PROTOFIELD_INTEGER(framenum,FT_FRAMENUM);
+
+static int ProtoField_other(lua_State* L,enum ftenum type) {
+ ProtoField f = g_malloc(sizeof(eth_field_t));
+ const gchar* abbr = luaL_checkstring(L,1);
+ const gchar* name = luaL_optstring(L,2,abbr);
+ const gchar* blob = luaL_optstring(L,3,"");
+
+ f->hfid = -2;
+ f->name = g_strdup(name);
+ f->abbr = g_strdup(abbr);
+ f->type = type;
+ f->vs = NULL;
+ f->base = ( type == FT_FLOAT || type == FT_DOUBLE) ? BASE_DEC : BASE_NONE;
+ f->mask = 0;
+ f->blob = g_strdup(blob);
+
+ pushProtoField(L,f);
+
+ return 1;
+}
+
+#define PROTOFIELD_OTHER(lower,FT) static int ProtoField_##lower(lua_State* L) { return ProtoField_other(L,FT); }
+PROTOFIELD_OTHER(ipv4,FT_IPv4);
+PROTOFIELD_OTHER(ipv6,FT_IPv6);
+PROTOFIELD_OTHER(ipx,FT_IPXNET);
+PROTOFIELD_OTHER(ether,FT_ETHER);
+PROTOFIELD_OTHER(bool,FT_BOOLEAN);
+PROTOFIELD_OTHER(float,FT_FLOAT);
+PROTOFIELD_OTHER(double,FT_DOUBLE);
+PROTOFIELD_OTHER(string,FT_STRING);
+PROTOFIELD_OTHER(stringz,FT_STRINGZ);
+PROTOFIELD_OTHER(bytes,FT_BYTES);
+PROTOFIELD_OTHER(ubytes,FT_UINT_BYTES);
+PROTOFIELD_OTHER(guid,FT_GUID);
+PROTOFIELD_OTHER(oid,FT_OID);
+
+
+static int ProtoField_tostring(lua_State* L) {
+ ProtoField f = checkProtoField(L,1);
+ gchar* s = g_strdup_printf("ProtoField(%i): %s %s %s %s %p %.8x %s",f->hfid,f->name,f->abbr,ftenum_to_string(f->type),base_to_string(f->base),f->vs,f->mask,f->blob);
+
+ lua_pushstring(L,s);
+ g_free(s);
+
+ return 1;
+}
+
+
+static const luaL_reg ProtoField_methods[] = {
+ {"new", ProtoField_new},
+ {"uint8",ProtoField_uint8},
+ {"uint16",ProtoField_uint16},
+ {"uint24",ProtoField_uint24},
+ {"uint32",ProtoField_uint32},
+ {"uint64",ProtoField_uint64},
+ {"int8",ProtoField_int8},
+ {"int16",ProtoField_int16},
+ {"int24",ProtoField_int24},
+ {"int32",ProtoField_int32},
+ {"int64",ProtoField_int64},
+ {"framenum",ProtoField_framenum},
+ {"ipv4",ProtoField_ipv4},
+ {"ipv6",ProtoField_ipv6},
+ {"ipx",ProtoField_ipx},
+ {"ether",ProtoField_ether},
+ {"bool",ProtoField_bool},
+ {"float",ProtoField_float},
+ {"double",ProtoField_double},
+ {"string",ProtoField_string},
+ {"stringz",ProtoField_stringz},
+ {"bytes",ProtoField_bytes},
+ {"ubytes",ProtoField_ubytes},
+ {"guid",ProtoField_guid},
+ {"oid",ProtoField_oid},
+ {0,0}
+};
+
+static const luaL_reg ProtoField_meta[] = {
+ {"__tostring", ProtoField_tostring},
+ {0, 0}
+};
+
+int ProtoField_register(lua_State* L) {
+ const eth_ft_types_t* ts;
+ const struct base_display_string_t* b;
+
+ luaL_openlib(L, PROTO_FIELD, ProtoField_methods, 0);
+ luaL_newmetatable(L, PROTO_FIELD);
+ luaL_openlib(L, 0, ProtoField_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ /* add a global FT_* variable for each FT_ type */
+ for (ts = ftenums; ts->str; ts++) {
+ lua_pushstring(L, ts->str);
+ lua_pushstring(L, ts->str);
+ lua_settable(L, LUA_GLOBALSINDEX);
+ }
+
+ /* add a global BASE_* variable for each BASE_ */
+ for (b=base_displays;b->str;b++) {
+ lua_pushstring(L, b->str);
+ lua_pushstring(L, b->str);
+ lua_settable(L, LUA_GLOBALSINDEX);
+ }
+
+ return 1;
+}
+
+
+/*
+ * ProtoFieldArray class
+ */
+
+
+static int ProtoFieldArray_new(lua_State* L) {
+ ProtoFieldArray fa;
+ guint i;
+ guint num_args = lua_gettop(L);
+
+ fa = g_array_new(TRUE,TRUE,sizeof(hf_register_info));
+
+ for ( i = 1; i <= num_args; i++) {
+ ProtoField f = checkProtoField(L,i);
+ hf_register_info hfri = { &(f->hfid), {f->name,f->abbr,f->type,f->base,VALS(f->vs),f->mask,f->blob,HFILL}};
+
+ if (f->hfid != -2) {
+ luaL_argerror(L, i, "field has already been added to an array");
+ return 0;
+ }
+
+ f->hfid = -1;
+
+ g_array_append_val(fa,hfri);
+ }
+
+ pushProtoFieldArray(L,fa);
+ return 1;
+}
+
+
+static int ProtoFieldArray_add(lua_State* L) {
+ ProtoFieldArray fa = checkProtoFieldArray(L,1);
+ guint i;
+ guint num_args = lua_gettop(L);
+
+ for ( i = 2; i <= num_args; i++) {
+ ProtoField f = checkProtoField(L,i);
+ hf_register_info hfri = { &(f->hfid), {f->name,f->abbr,f->type,f->base,VALS(f->vs),f->mask,f->blob,HFILL}};
+
+ if (f->hfid != -2) {
+ luaL_argerror(L, i, "field has already been added to an array");
+ return 0;
+ }
+
+ f->hfid = -1;
+
+ g_array_append_val(fa,hfri);
+ }
+
+ return 0;
+}
+
+static int ProtoFieldArray_tostring(lua_State* L) {
+ GString* s = g_string_new("ProtoFieldArray:\n");
+ hf_register_info* f;
+ ProtoFieldArray fa = checkProtoFieldArray(L,1);
+ unsigned i;
+
+ for(i = 0; i< fa->len; i++) {
+ f = &(((hf_register_info*)(fa->data))[i]);
+ g_string_sprintfa(s,"%i %s %s %s %u %p %.8x %s\n",*(f->p_id),f->hfinfo.name,f->hfinfo.abbrev,ftenum_to_string(f->hfinfo.type),f->hfinfo.display,f->hfinfo.strings,f->hfinfo.bitmask,f->hfinfo.blurb);
+ };
+
+ lua_pushstring(L,s->str);
+ g_string_free(s,TRUE);
+
+ return 1;
+}
+
+static int ProtoFieldArray_gc(lua_State* L) {
+ ProtoFieldArray vs = checkValueString(L,1);
+
+ g_array_free(vs,TRUE);
+
+ return 0;
+}
+
+
+static const luaL_reg ProtoFieldArray_methods[] = {
+ {"new", ProtoFieldArray_new},
+ {"add", ProtoFieldArray_add},
+ {0,0}
+};
+
+static const luaL_reg ProtoFieldArray_meta[] = {
+ {"__gc", ProtoFieldArray_gc},
+ {"__tostring", ProtoFieldArray_tostring},
+ {0, 0}
+};
+
+int ProtoFieldArray_register(lua_State* L) {
+ luaL_openlib(L, PROTO_FIELD_ARRAY, ProtoFieldArray_methods, 0);
+ luaL_newmetatable(L, PROTO_FIELD_ARRAY);
+ luaL_openlib(L, 0, ProtoFieldArray_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+}
+
+
+
+
+/*
+ * Ett class
+ */
+
+
+static int Ett_new(lua_State* L) {
+ Ett e = g_malloc(sizeof(int));
+ *e = -2;
+ pushEtt(L,e);
+
+ return 1;
+}
+
+static int Ett_tostring(lua_State* L) {
+ Ett e = checkEtt(L,1);
+ gchar* s = g_strdup_printf("Ett: %i",*e);
+
+ lua_pushstring(L,s);
+ g_free(s);
+
+ return 1;
+}
+
+
+static const luaL_reg Ett_methods[] = {
+ {"new", Ett_new},
+ {0,0}
+};
+
+static const luaL_reg Ett_meta[] = {
+ {"__tostring", Ett_tostring},
+ {0, 0}
+};
+
+int Ett_register(lua_State* L) {
+ luaL_openlib(L, ETT, Ett_methods, 0);
+ luaL_newmetatable(L, ETT);
+ luaL_openlib(L, 0, Ett_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+}
+
+
+
+
+
+/*
+ * EttArray class
+ */
+
+static int EttArray_new(lua_State* L) {
+ EttArray ea = g_array_new(TRUE,TRUE,sizeof(gint*));
+ guint i;
+ guint num_args = lua_gettop(L);
+
+ for (i = 1; i <= num_args; i++) {
+ Ett e = checkEtt(L,i);
+
+ if(*e != -2) {
+ luaL_argerror(L, i, "SubTree has already been added to an array");
+ return 0;
+ }
+
+ *e = -1;
+
+ g_array_append_val(ea,e);
+ }
+
+ pushEttArray(L,ea);
+ return 1;
+}
+
+
+static int EttArray_add(lua_State* L) {
+ EttArray ea = checkEttArray(L,1);
+ guint i;
+ guint num_args = lua_gettop(L);
+
+ for (i = 2; i <= num_args; i++) {
+ Ett e = checkEtt(L,i);
+ if(*e != -2) {
+ luaL_argerror(L, i, "SubTree has already been added to an array");
+ return 0;
+ }
+
+ *e = -1;
+
+ g_array_append_val(ea,e);
+ }
+
+ return 0;
+}
+
+static int EttArray_tostring(lua_State* L) {
+ GString* s = g_string_new("EttArray:\n");
+ EttArray ea = checkEttArray(L,1);
+ unsigned i;
+
+ for(i = 0; i< ea->len; i++) {
+ gint ett = *(((gint**)(ea->data))[i]);
+ g_string_sprintfa(s,"%i\n",ett);
+ };
+
+ lua_pushstring(L,s->str);
+ g_string_free(s,TRUE);
+
+ return 1;
+}
+
+static int EttArray_register_to_ethereal(lua_State* L) {
+ EttArray ea = checkEttArray(L,1);
+
+ if (!ea->len) {
+ luaL_argerror(L,1,"empty array");
+ return 0;
+ }
+
+ /* is last ett -1? */
+ if ( *(((gint *const *)ea->data)[ea->len -1]) != -1) {
+ luaL_argerror(L,1,"array has been registered already");
+ return 0;
+ }
+
+ proto_register_subtree_array((gint *const *)ea->data, ea->len);
+ return 0;
+}
+
+static int EttArray_gc(lua_State* L) {
+ EttArray ea = checkEttArray(L,1);
+
+ g_array_free(ea,FALSE);
+
+ return 0;
+}
+
+
+static const luaL_reg EttArray_methods[] = {
+ {"new", EttArray_new},
+ {"add", EttArray_add},
+ {"register", EttArray_register_to_ethereal},
+ {0,0}
+};
+
+static const luaL_reg EttArray_meta[] = {
+ {"__gc", EttArray_gc},
+ {"__tostring", EttArray_tostring},
+ {0, 0}
+};
+
+int EttArray_register(lua_State* L) {
+ luaL_openlib(L, ETT_ARRAY, EttArray_methods, 0);
+ luaL_newmetatable(L, ETT_ARRAY);
+ luaL_openlib(L, 0, EttArray_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+}
+
+
+
+
+/*
+ * Proto class
+ */
+
+
+static int Proto_new(lua_State* L) {
+ Proto proto;
+ const gchar* name = luaL_checkstring(L,1);
+ const gchar* filter = luaL_checkstring(L,2);
+ const gchar* desc = luaL_checkstring(L,3);
+
+ if (! (name && filter && desc) ) return 0;
+
+ proto = g_malloc(sizeof(eth_proto_t));
+
+ proto->hfid = -1;
+ proto->name = g_strdup(name);
+ proto->filter = g_strdup(filter);
+ proto->desc = g_strdup(desc);
+ proto->hfarray = NULL;
+ proto->prefs_module = NULL;
+ proto->prefs = NULL;
+ proto->handle = NULL;
+ proto->is_postdissector = FALSE;
+
+ if (proto->name && proto->filter && proto->desc) {
+ if ( proto_get_id_by_filter_name(proto->filter) > 0 ) {
+ g_free(proto);
+ luaL_argerror(L,2,"Protocol exists already");
+ return 0;
+ } else {
+ proto->hfid = proto_register_protocol(proto->desc,proto->name,proto->filter);
+ proto->handle = create_dissector_handle(dissect_lua,proto->hfid);
+ pushProto(L,proto);
+ return 1;
+ }
+ } else {
+ if (! proto->name )
+ luaL_argerror(L,1,"missing name");
+
+ if (! proto->filter )
+ luaL_argerror(L,2,"missing filter");
+
+ if (! proto->desc )
+ luaL_argerror(L,3,"missing desc");
+
+ g_free(proto);
+
+ return 0;
+ }
+
+}
+
+static int Proto_register_field_array(lua_State* L) {
+ Proto proto = checkProto(L,1);
+ ProtoFieldArray fa = checkProtoFieldArray(L,2);
+
+ if (!proto) {
+ luaL_argerror(L,1,"not a good proto");
+ return 0;
+ }
+
+ if (! fa) {
+ luaL_argerror(L,2,"not a good field_array");
+ return 0;
+ }
+
+ if( ! fa->len ) {
+ luaL_argerror(L,2,"empty field_array");
+ return 0;
+ }
+
+ if (proto->hfarray) {
+ luaL_argerror(L,1,"field_array already registered for this protocol");
+ }
+
+ proto->hfarray = (hf_register_info*)(fa->data);
+ proto_register_field_array(proto->hfid,proto->hfarray,fa->len);
+
+ return 0;
+}
+
+static int Proto_add_uint_pref(lua_State* L) {
+ Proto proto = checkProto(L,1);
+ gchar* abbr = g_strdup(luaL_checkstring(L,2));
+ guint def = (guint)luaL_optint(L,3,0);
+ guint base = (guint)luaL_optint(L,4,10);
+ gchar* name = g_strdup(luaL_optstring (L, 5, ""));
+ gchar* desc = g_strdup(luaL_optstring (L, 6, ""));
+
+ eth_pref_t* pref = g_malloc(sizeof(eth_pref_t));
+ pref->name = abbr;
+ pref->type = PREF_UINT;
+ pref->value.u = def;
+ pref->next = NULL;
+
+ if (! proto->prefs_module)
+ proto->prefs_module = prefs_register_protocol(proto->hfid, NULL);
+
+ if (! proto->prefs) {
+ proto->prefs = pref;
+ } else {
+ eth_pref_t* p;
+ for (p = proto->prefs; p->next; p = p->next) ;
+ p->next = pref;
+ }
+
+ prefs_register_uint_preference(proto->prefs_module, abbr,name,
+ desc, base, &(pref->value.u));
+
+ return 0;
+}
+
+static int Proto_add_bool_pref(lua_State* L) {
+ Proto proto = checkProto(L,1);
+ gchar* abbr = g_strdup(luaL_checkstring(L,2));
+ gboolean def = (gboolean)luaL_optint(L,3,FALSE);
+ gchar* name = g_strdup(luaL_optstring (L, 4, ""));
+ gchar* desc = g_strdup(luaL_optstring (L, 5, ""));
+
+ eth_pref_t* pref = g_malloc(sizeof(eth_pref_t));
+ pref->name = abbr;
+ pref->type = PREF_BOOL;
+ pref->value.b = def;
+ pref->next = NULL;
+
+ if (! proto->prefs_module)
+ proto->prefs_module = prefs_register_protocol(proto->hfid, NULL);
+
+ if (! proto->prefs) {
+ proto->prefs = pref;
+ } else {
+ eth_pref_t* p;
+ for (p = proto->prefs; p->next; p = p->next) ;
+ p->next = pref;
+ }
+
+ prefs_register_bool_preference(proto->prefs_module, abbr,name,
+ desc, &(pref->value.b));
+
+ return 0;
+}
+
+static int Proto_add_string_pref(lua_State* L) {
+ Proto proto = checkProto(L,1);
+ gchar* abbr = g_strdup(luaL_checkstring(L,2));
+ gchar* def = g_strdup(luaL_optstring (L, 3, ""));
+ gchar* name = g_strdup(luaL_optstring (L, 4, ""));
+ gchar* desc = g_strdup(luaL_optstring (L, 5, ""));
+
+ eth_pref_t* pref = g_malloc(sizeof(eth_pref_t));
+ pref->name = abbr;
+ pref->type = PREF_STRING;
+ pref->value.s = def;
+ pref->next = NULL;
+
+ if (! proto->prefs_module)
+ proto->prefs_module = prefs_register_protocol(proto->hfid, NULL);
+
+ if (! proto->prefs) {
+ proto->prefs = pref;
+ } else {
+ eth_pref_t* p;
+ for (p = proto->prefs; p->next; p = p->next) ;
+ p->next = pref;
+ }
+
+ prefs_register_string_preference(proto->prefs_module, abbr,name,
+ desc, &(pref->value.s));
+
+
+ return 0;
+}
+
+
+static int Proto_get_pref(lua_State* L) {
+ Proto proto = checkProto(L,1);
+ const gchar* abbr = luaL_checkstring(L,2);
+
+ if (!proto) {
+ luaL_argerror(L,1,"not a good proto");
+ return 0;
+ }
+
+ if (!abbr) {
+ luaL_argerror(L,2,"not a good abbrev");
+ return 0;
+ }
+
+ if (proto->prefs) {
+ eth_pref_t* p;
+ for (p = proto->prefs; p; p = p->next) {
+ if (g_str_equal(p->name,abbr)) {
+ switch(p->type) {
+ case PREF_BOOL:
+ lua_pushboolean(L, p->value.b);
+ break;
+ case PREF_UINT:
+ lua_pushnumber(L, (lua_Number)(p->value.u));
+ break;
+ case PREF_STRING:
+ lua_pushstring(L, p->value.s);
+ break;
+ }
+ return 1;
+ }
+ }
+
+ luaL_argerror(L,2,"no such preference for this protocol");
+ return 0;
+
+ } else {
+ luaL_error(L,"no preferences set for this protocol");
+ return 0;
+ }
+}
+
+
+static int Proto_tostring(lua_State* L) {
+ Proto proto = checkProto(L,1);
+ gchar* s;
+
+ if (!proto) return 0;
+
+ s = g_strdup_printf("Proto: %s",proto->name);
+ lua_pushstring(L,s);
+ g_free(s);
+
+ return 1;
+}
+
+static int Proto_register_postdissector(lua_State* L) {
+ Proto proto = checkProto(L,1);
+ if (!proto) return 0;
+
+ if(!proto->is_postdissector) {
+ register_postdissector(proto->handle);
+ } else {
+ luaL_argerror(L,1,"this protocol is already registered as postdissector");
+ }
+
+ return 0;
+}
+
+
+static int Proto_get_dissector(lua_State* L) {
+ Proto proto = checkProto(L,1);
+ if (!proto) return 0;
+
+ if (proto->handle) {
+ pushDissector(L,proto->handle);
+ return 1;
+ } else {
+ luaL_error(L,"The protocol hasn't been registered yet");
+ return 0;
+ }
+}
+
+static const luaL_reg Proto_methods[] = {
+ {"new", Proto_new},
+ {"register_field_array", Proto_register_field_array},
+ {"add_uint_pref", Proto_add_uint_pref},
+ {"add_bool_pref", Proto_add_bool_pref},
+ {"add_string_pref", Proto_add_string_pref},
+ {"get_pref", Proto_get_pref},
+ {"register_as_postdissector", Proto_register_postdissector},
+ {"get_dissector", Proto_get_dissector},
+ {0,0}
+};
+
+static const luaL_reg Proto_meta[] = {
+ {"__tostring", Proto_tostring},
+ {0, 0}
+};
+
+int Proto_register(lua_State* L) {
+ luaL_openlib(L, PROTO, Proto_methods, 0);
+ luaL_newmetatable(L, PROTO);
+ luaL_openlib(L, 0, Proto_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+}
+
+LUA_CLASS_DEFINE(Dissector,DISSECTOR,NOP);
+LUA_CLASS_DEFINE(DissectorTable,DISSECTOR_TABLE,NOP);
+
+
+/*
+ * Dissector class
+ */
+
+static int Dissector_get (lua_State *L) {
+ const gchar* name = luaL_checkstring(L,1);
+ Dissector d;
+
+ if (!name) {
+ return 0;
+ }
+
+ if ((d = find_dissector(name))) {
+ pushDissector(L, d);
+ return 1;
+ } else {
+ luaL_argerror(L,1,"No such dissector");
+ return 0;
+ }
+
+}
+
+static int Dissector_call(lua_State* L) {
+ Dissector d = checkDissector(L,1);
+ Tvb tvb = checkTvb(L,2);
+ Pinfo pinfo = checkPinfo(L,3);
+ Tree tree = checkTree(L,4);
+
+ if (! ( d && tvb && pinfo) ) return 0;
+
+ call_dissector(d, tvb, pinfo, tree);
+ return 0;
+}
+
+
+static int Dissector_tostring(lua_State* L) {
+ Dissector d = checkDissector(L,1);
+ if (!d) return 0;
+ lua_pushstring(L,dissector_handle_get_short_name(d));
+ return 1;
+}
+
+
+static const luaL_reg Dissector_methods[] = {
+ {"get", Dissector_get },
+ {"call", Dissector_call },
+ {0,0}
+};
+
+static const luaL_reg Dissector_meta[] = {
+ {"__tostring", Dissector_tostring},
+ {0, 0}
+};
+
+int Dissector_register(lua_State* L) {
+ luaL_openlib(L, DISSECTOR, Dissector_methods, 0);
+ luaL_newmetatable(L, DISSECTOR);
+ luaL_openlib(L, 0, Dissector_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+};
+
+
+
+
+
+
+/*
+ * DissectorTable class
+ */
+static int DissectorTable_new (lua_State *L) {
+ gchar* name = (void*)luaL_checkstring(L,1);
+ gchar* ui_name = (void*)luaL_optstring(L,2,name);
+ const gchar* ftstr = luaL_optstring(L,3,"FT_UINT32");
+ enum ftenum type;
+ base_display_e base = luaL_optint(L,4,BASE_DEC);
+
+ if(!(name && ui_name && ftstr)) return 0;
+
+ name = g_strdup(name);
+ ui_name = g_strdup(ui_name);
+ type = get_ftenum(ftstr);
+
+ switch(type) {
+ case FT_STRING:
+ base = BASE_NONE;
+ case FT_UINT32:
+ {
+ DissectorTable dt = g_malloc(sizeof(struct _eth_distbl_t));
+
+ dt->table = register_dissector_table(name, ui_name, type, base);
+ dt->name = name;
+ pushDissectorTable(L, dt);
+ }
+ return 1;
+ default:
+ luaL_argerror(L,3,"Invalid ft_type");
+ return 0;
+ }
+
+}
+
+static int DissectorTable_get (lua_State *L) {
+ const gchar* name = luaL_checkstring(L,1);
+ dissector_table_t table;
+
+ if(!name) return 0;
+
+ table = find_dissector_table(name);
+
+ if (table) {
+ DissectorTable dt = g_malloc(sizeof(struct _eth_distbl_t));
+ dt->table = table;
+ dt->name = g_strdup(name);
+
+ pushDissectorTable(L, dt);
+
+ return 1;
+ } else {
+ luaL_error(L,"No such dissector_table");
+ return 0;
+ }
+
+}
+
+
+static int DissectorTable_add (lua_State *L) {
+ DissectorTable dt = checkDissectorTable(L,1);
+ Proto p = checkProto(L,3);
+ ftenum_t type;
+
+ if (!(dt && p)) return 0;
+
+ type = get_dissector_table_selector_type(dt->name);
+
+ if (type == FT_STRING) {
+ gchar* pattern = g_strdup(luaL_checkstring(L,2));
+ dissector_add_string(dt->name, pattern,p->handle);
+ } else if ( type == FT_UINT32 ) {
+ int port = luaL_checkint(L, 2);
+ dissector_add(dt->name, port, p->handle);
+ }
+
+ return 0;
+}
+
+
+static int DissectorTable_try (lua_State *L) {
+ DissectorTable dt = checkDissectorTable(L,1);
+ Tvb tvb = checkTvb(L,3);
+ Pinfo pinfo = checkPinfo(L,4);
+ Tree tree = checkTree(L,5);
+ ftenum_t type;
+
+ if (! (dt && tvb && pinfo && tree) ) return 0;
+
+ type = get_dissector_table_selector_type(dt->name);
+
+ if (type == FT_STRING) {
+ const gchar* pattern = luaL_checkstring(L,2);
+
+ if (!pattern) return 0;
+
+ if (dissector_try_string(dt->table,pattern,tvb,pinfo,tree))
+ return 0;
+ } else if ( type == FT_UINT32 ) {
+ int port = luaL_checkint(L, 2);
+ if (dissector_try_port(dt->table,port,tvb,pinfo,tree))
+ return 0;
+ } else {
+ luaL_error(L,"No such type of dissector_table");
+ }
+
+ call_dissector(lua_data_handle,tvb,pinfo,tree);
+ return 0;
+}
+
+static int DissectorTable_get_dissector (lua_State *L) {
+ DissectorTable dt = checkDissectorTable(L,1);
+ ftenum_t type;
+ dissector_handle_t handle = lua_data_handle;
+
+ if (!dt) return 0;
+
+ type = get_dissector_table_selector_type(dt->name);
+
+ if (type == FT_STRING) {
+ const gchar* pattern = luaL_checkstring(L,2);
+ handle = dissector_get_string_handle(dt->table,pattern);
+ } else if ( type == FT_UINT32 ) {
+ int port = luaL_checkint(L, 2);
+ handle = dissector_get_port_handle(dt->table,port);
+ }
+
+ pushDissector(L,handle);
+
+ return 1;
+
+}
+
+
+static int DissectorTable_tostring(lua_State* L) {
+ DissectorTable dt = checkDissectorTable(L,1);
+ GString* s;
+ ftenum_t type;
+
+ if (!dt) return 0;
+
+ type = get_dissector_table_selector_type(dt->name);
+ s = g_string_new("DissectorTable ");
+
+ switch(type) {
+ case FT_STRING:
+ {
+ g_string_sprintfa(s,"%s String:\n",dt->name);
+ break;
+ }
+ case FT_UINT32:
+ {
+ int base = get_dissector_table_base(dt->name);
+ g_string_sprintfa(s,"%s Integer(%i):\n",dt->name,base);
+ break;
+ }
+ default:
+ luaL_error(L,"Strange table type");
+ }
+
+ lua_pushstring(L,s->str);
+ g_string_free(s,TRUE);
+ return 1;
+}
+
+static const luaL_reg DissectorTable_methods[] = {
+ {"new", DissectorTable_new},
+ {"get", DissectorTable_get},
+ {"add", DissectorTable_add },
+ {"try", DissectorTable_try },
+ {"get_dissector", DissectorTable_get_dissector },
+ {0,0}
+};
+
+static const luaL_reg DissectorTable_meta[] = {
+ {"__tostring", DissectorTable_tostring},
+ {0, 0}
+};
+
+int DissectorTable_register(lua_State* L) {
+ luaL_openlib(L, DISSECTOR_TABLE, DissectorTable_methods, 0);
+ luaL_newmetatable(L, DISSECTOR_TABLE);
+ luaL_openlib(L, 0, DissectorTable_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+};
+
+
+/*
+ * ValueString class
+ */
+
+static int ValueString_new(lua_State* L) {
+ ValueString vs = g_array_new(TRUE,TRUE,sizeof(value_string));
+ pushValueString(L,vs);
+ return 1;
+}
+
+
+static int ValueString_add(lua_State* L) {
+ ValueString vs = checkValueString(L,1);
+ value_string v = {0,NULL};
+
+ v.value = luaL_checkint(L,2);
+ v.strptr = g_strdup(luaL_checkstring(L,3));
+
+ g_array_append_val(vs,v);
+
+ return 0;
+}
+
+static int ValueString_match(lua_State* L) {
+ ValueString vs = checkValueString(L,1);
+ guint32 val = (guint32)luaL_checkint(L,2);
+ const gchar* def = luaL_optstring(L,8,"Unknown");
+
+ lua_pushstring(L,val_to_str(val, (value_string*)(vs->data), def));
+
+ return 1;
+}
+
+static int ValueString_gc(lua_State* L) {
+ ValueString vs = checkValueString(L,1);
+
+ g_array_free(vs,TRUE);
+
+ return 0;
+}
+
+static int ValueString_tostring(lua_State* L) {
+ ValueString vs = checkValueString(L,1);
+ value_string* c = (value_string*)vs->data;
+ GString* s = g_string_new("ValueString:\n");
+
+ for(;c->strptr;c++) {
+ g_string_sprintfa(s,"\t%u\t%s\n",c->value,c->strptr);
+ }
+
+ lua_pushstring(L,s->str);
+
+ g_string_free(s,TRUE);
+
+ return 1;
+}
+
+static const luaL_reg ValueString_methods[] = {
+ {"new", ValueString_new},
+ {"add", ValueString_add},
+ {"match", ValueString_match},
+ {0,0}
+};
+
+
+static const luaL_reg ValueString_meta[] = {
+ {"__gc", ValueString_gc},
+ {"__tostring", ValueString_tostring},
+ {0, 0}
+};
+
+
+extern int ValueString_register(lua_State* L) {
+ luaL_openlib(L, VALUE_STRING, ValueString_methods, 0);
+ luaL_newmetatable(L, VALUE_STRING);
+ luaL_openlib(L, 0, ValueString_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+}
+
+
+
+
+
+
+
--- /dev/null
+#include "packet-lua.h"
+
+LUA_CLASS_DEFINE(Tap,TAP,NOP);
+LUA_CLASS_DEFINE(Interesting,INTERESTING,NOP);
+
+static int Interesting_get (lua_State *L) {
+ const gchar* name = luaL_checkstring(L,1);
+ Interesting i;
+
+ if (!name) return 0;
+
+ i = proto_registrar_get_byname(name);
+
+ if (!i) {
+ luaL_error(L,"Could not find field `%s'",name);
+ return 0;
+ }
+
+ pushInteresting(L,i);
+ return 1;
+}
+
+static int Interesting_fetch (lua_State* L) {
+ Interesting in = checkInteresting(L,1);
+ int items_found = 0;
+
+ for (;in;in = in->same_name_next) {
+ GPtrArray* found = proto_find_finfo(lua_tree, in->id);
+ guint i;
+
+ for (i=0; i<found->len; i++) {
+ field_info* fi = g_ptr_array_index(found,i);
+ switch(fi->hfinfo->type) {
+ case FT_UINT8:
+ case FT_UINT16:
+ case FT_UINT24:
+ case FT_UINT32:
+ case FT_FRAMENUM:
+ case FT_INT8:
+ case FT_INT16:
+ case FT_INT24:
+ case FT_INT32:
+ lua_pushnumber(L,(lua_Number)fvalue_get_integer(&(fi->value)));
+ items_found++;
+ break;
+ case FT_FLOAT:
+ case FT_DOUBLE:
+ lua_pushnumber(L,(lua_Number)fvalue_get_floating(&(fi->value)));
+ items_found++;
+ break;
+ case FT_UINT64:
+ case FT_INT64:
+ /* XXX: get them as strings for now */
+ case FT_STRING:
+ case FT_STRINGZ:
+ case FT_ETHER:
+ case FT_BYTES:
+ case FT_UINT_BYTES:
+ case FT_IPv4:
+ case FT_IPv6:
+ case FT_IPXNET:
+ case FT_GUID:
+ case FT_OID:
+ lua_pushstring(L,fvalue_to_string_repr(&fi->value,FTREPR_DISPLAY,NULL));
+ items_found++;
+ break;
+ default:
+ luaL_error(L,"FT_ not yet supported");
+ return items_found;
+ }
+ }
+ }
+
+ return items_found;
+
+}
+
+static int Interesting_tostring (lua_State* L) {
+ Interesting in = checkInteresting(L,1);
+
+ lua_pushfstring(L,"Interesting: %s",in->abbrev);
+ return 1;
+}
+
+static const luaL_reg Interesting_methods[] = {
+ {"get", Interesting_get},
+ {"fetch", Interesting_fetch },
+ {0,0}
+};
+
+static const luaL_reg Interesting_meta[] = {
+ {"__tostring", Interesting_tostring},
+ {0, 0}
+};
+
+int Interesting_register(lua_State* L) {
+ luaL_openlib(L, INTERESTING, Interesting_methods, 0);
+ luaL_newmetatable(L, INTERESTING);
+ luaL_openlib(L, 0, Interesting_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+};
+
+
+static int Tap_new(lua_State* L) {
+ const gchar* name = luaL_checkstring(L,1);
+ Tap tap;
+
+ if (!name) return 0;
+
+ if( find_tap_id(name) ) {
+ luaL_error(L,"a tap with this name exists already");
+ return 0;
+ }
+
+ tap = g_malloc(sizeof(struct _eth_tap));
+
+ tap->name = g_strdup(name);
+ tap->interesting_fields = g_ptr_array_new();
+ tap->filter = NULL;
+
+ pushTap(L,tap);
+ return 1;
+}
+
+static int Tap_add(lua_State* L) {
+ Tap tap = checkTap(L,1);
+ Interesting in = checkInteresting(L,2);
+
+ if (!(tap && in)) return 0;
+
+ g_ptr_array_add(tap->interesting_fields,in);
+
+ return 0;
+}
+
+static int Tap_tostring(lua_State* L) {
+ Tap tap = checkTap(L,1);
+ gchar* str;
+
+ if (!tap) return 0;
+
+ str = g_strdup_printf("Tap->%s filter: %s",tap->name, tap->filter ? tap->filter : "NONE");
+ lua_pushstring(L,str);
+ g_free(str);
+
+ return 1;
+}
+
+static int Tap_set_filter(lua_State* L) {
+ Tap tap = checkTap(L,1);
+ const gchar* filter = luaL_checkstring(L,2);
+
+ if (!(tap && filter)) return 0;
+
+ if (tap->filter) {
+ luaL_error(L,"tap has filter already");
+ return 0;
+ }
+
+ tap->filter = g_strdup(filter);
+
+ return 0;
+}
+
+static int Tap_register_to_ethereal(lua_State*L) {
+ Tap tap = checkTap(L,1);
+ GString* filter_s;
+ GString* error;
+ GPtrArray* ins;
+ guint i;
+
+ if (!tap) return 0;
+
+ filter_s = g_string_new("");
+
+ if (tap->filter)
+ g_string_sprintfa(filter_s,"( %s ) && frame ",tap->filter);
+
+ g_free(tap->filter);
+
+ ins = tap->interesting_fields;
+
+ for (i=0; i < ins->len; i++) {
+ Interesting in = g_ptr_array_index(ins,i);
+ g_string_sprintfa(filter_s," ||%s",in->abbrev);
+ }
+
+ tap->filter = filter_s->str;
+ g_string_free(filter_s,FALSE);
+
+ error = register_tap_listener("frame", tap, tap->filter, lua_tap_reset, lua_tap_packet, lua_tap_draw);
+
+ if (error) {
+ luaL_error(L,"tap registration error: %s",error);
+ g_string_free(error,TRUE);
+ }
+
+ return 0;
+}
+
+static const luaL_reg Tap_methods[] = {
+ {"new", Tap_new},
+ {"add", Tap_add},
+ {"set_filter", Tap_set_filter},
+ {"register", Tap_register_to_ethereal},
+ {0,0}
+};
+
+static const luaL_reg Tap_meta[] = {
+ {"__tostring", Tap_tostring},
+ {0, 0}
+};
+
+int Tap_register(lua_State* L) {
+ luaL_openlib(L, TAP, Tap_methods, 0);
+ luaL_newmetatable(L, TAP);
+ luaL_openlib(L, 0, Tap_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+};
+
--- /dev/null
+#include "packet-lua.h"
+
+LUA_CLASS_DEFINE(Tree,TREE,NOP);
+LUA_CLASS_DEFINE(Item,ITEM,NOP);
+
+/* Tree class */
+
+static int Tree_add_item_any(lua_State *L, gboolean little_endian) {
+ /*
+ called with:
+ tree,field,tvb,offset,len,datum
+ tree,field,tvb,offset,len
+ tree,tvb,offset,len,text
+ tree,tvb,text
+ */
+ Tree tree = checkTree(L,1);
+ ProtoField field;
+ Item item;
+ Tvb tvb;
+ int offset;
+ int len;
+
+ if (!tree) {
+ pushItem(L,NULL);
+ return 1;
+ }
+
+ if (( luaL_checkudata (L, 2, TVB) )) {
+ tvb = checkTvb(L,2);
+ const char* str;
+
+ if (lua_isnumber(L,3)) {
+ offset = luaL_checkint(L,3);
+ len = luaL_checkint(L,4);
+ str = lua_tostring(L,5);
+ } else if (lua_isstring(L,3)) {
+ offset = 0;
+ len = 0;
+ str = lua_tostring(L,3);
+ } else {
+ luaL_error(L,"First arg must be either TVB or ProtoField");
+ return 0;
+ }
+
+ item = proto_tree_add_text(tree,tvb,offset,len,"%s",str);
+
+ } else if (( luaL_checkudata (L, 2, PROTO_FIELD) )) {
+ field = checkProtoField(L,2);
+ tvb = checkTvb(L,3);
+ offset = luaL_checkint(L,4);
+ len = luaL_checkint(L,5);
+
+ if ( lua_gettop(L) == 6 ) {
+ switch(field->type) {
+ case FT_UINT8:
+ case FT_UINT16:
+ case FT_UINT24:
+ case FT_UINT32:
+ case FT_FRAMENUM:
+ item = proto_tree_add_uint(tree,field->hfid,tvb,offset,len,(guint32)luaL_checknumber(L,6));
+ break;
+ case FT_INT8:
+ case FT_INT16:
+ case FT_INT24:
+ case FT_INT32:
+ item = proto_tree_add_int(tree,field->hfid,tvb,offset,len,(gint32)luaL_checknumber(L,6));
+ break;
+ case FT_FLOAT:
+ item = proto_tree_add_float(tree,field->hfid,tvb,offset,len,(float)luaL_checknumber(L,6));
+ break;
+ case FT_DOUBLE:
+ item = proto_tree_add_double(tree,field->hfid,tvb,offset,len,(double)luaL_checknumber(L,6));
+ break;
+ case FT_STRING:
+ case FT_STRINGZ:
+ item = proto_tree_add_string(tree,field->hfid,tvb,offset,len,luaL_checkstring(L,6));
+ break;
+ case FT_UINT64:
+ case FT_INT64:
+ case FT_ETHER:
+ case FT_BYTES:
+ case FT_UINT_BYTES:
+ case FT_IPv4:
+ case FT_IPv6:
+ case FT_IPXNET:
+ case FT_GUID:
+ case FT_OID:
+ default:
+ luaL_error(L,"FT_ not yet supported");
+ return 0;
+ }
+ } else {
+ item = proto_tree_add_item(tree,field->hfid,tvb,offset,len,little_endian);
+ }
+ } else {
+ luaL_error(L,"First arg must be either TVB or ProtoField");
+ return 0;
+ }
+
+ pushItem(L,item);
+ return 1;
+}
+
+static int Tree_add_item(lua_State *L) { return Tree_add_item_any(L,FALSE); }
+static int Tree_add_item_le(lua_State *L) { return Tree_add_item_any(L,TRUE); }
+
+static int Tree_tostring(lua_State *L) {
+ Tree tree = checkTree(L,1);
+ lua_pushstring(L,ep_strdup_printf("Tree %p",tree));
+ return 1;
+}
+
+
+static int Tree_get_parent(lua_State *L) {
+ Tree tree = checkTree(L,1);
+ proto_item* item = NULL;
+
+ if (tree) {
+ item = proto_tree_get_parent(tree);
+ }
+
+ pushItem(L,item);
+
+ return 1;
+}
+
+static const luaL_reg Tree_methods[] = {
+ {"add_item", Tree_add_item},
+ {"add_item_le", Tree_add_item_le},
+ {"get_parent", Tree_get_parent},
+ {0, 0}
+};
+
+static const luaL_reg Tree_meta[] = {
+ {"__tostring", Tree_tostring},
+ {0, 0}
+};
+
+int Tree_register(lua_State* L) {
+ luaL_openlib(L, TREE, Tree_methods, 0);
+ luaL_newmetatable(L, TREE);
+ luaL_openlib(L, 0, Tree_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+}
+
+/* Item class */
+static int Item_tostring(lua_State *L) {
+ Item item = checkItem(L,1);
+ lua_pushstring(L,ep_strdup_printf("Item %p",item));
+ return 1;
+}
+
+static int Item_add_subtree(lua_State *L) {
+ Item item = checkItem(L,1);
+ Ett ett;
+ Tree tree = NULL;
+
+ if (item) {
+ ett = checkEtt(L,2);
+
+ if (ett && *ett >= 0) {
+ tree = proto_item_add_subtree(item,*ett);
+ } else {
+ luaL_argerror(L,2,"bad ett");
+ }
+ }
+
+ pushTree(L,tree);
+ return 1;
+}
+
+static int Item_set_text(lua_State *L) {
+ Item item = checkItem(L,1);
+
+ if (!item) {
+ const gchar* s = luaL_checkstring(L,2);
+ proto_item_set_text(item,"%s",s);
+ }
+
+ return 0;
+}
+
+static int Item_append_text(lua_State *L) {
+ Item item = checkItem(L,1);
+ const gchar* s;
+
+ if (item) {
+ s = luaL_checkstring(L,2);
+ proto_item_append_text(item,"%s",s);
+ }
+ return 0;
+}
+
+static int Item_set_len(lua_State *L) {
+ Item item = checkItem(L,1);
+ int len;
+
+ if (item) {
+ len = luaL_checkint(L,2);
+ proto_item_set_len(item,len);
+ }
+
+ return 0;
+}
+
+struct _expert_severity {
+ const gchar* str;
+ int val;
+};
+
+static const struct _expert_severity severities[] = {
+ {"PI_CHAT",PI_CHAT},
+ {"PI_NOTE",PI_NOTE},
+ {"PI_WARN",PI_WARN},
+ {"PI_ERROR",PI_ERROR},
+ {"PI_CHECKSUM",PI_CHECKSUM},
+ {"PI_SEQUENCE",PI_SEQUENCE},
+ {"PI_RESPONSE_CODE",PI_RESPONSE_CODE},
+ {"PI_UNDECODED",PI_UNDECODED},
+ {"PI_REASSEMBLE",PI_REASSEMBLE},
+ {"PI_MALFORMED",PI_MALFORMED},
+ {"PI_DEBUG",PI_DEBUG},
+ {NULL,0}
+};
+
+static int str_to_expert(const gchar* str) {
+ const struct _expert_severity* s;
+
+ if (!str) return 0;
+
+ for(s = severities; s->str; s++) {
+ if (g_str_equal(str,s->str)) {
+ return s->val;
+ }
+ }
+ return 0;
+}
+
+#if 0
+static const gchar* expert_to_str(int val) {
+ const struct _expert_severity* s;
+ for(s = severities; s->str; s++) {
+ if (s->val == val) {
+ return s->str;
+ }
+ }
+ return NULL;
+}
+#endif
+
+static int Item_set_expert_flags(lua_State *L) {
+ Item item = checkItem(L,1);
+ int group;
+ int severity;
+
+ if (item) {
+ group = str_to_expert(luaL_checkstring(L,2));
+ severity = str_to_expert(luaL_checkstring(L,3));
+
+ if (group && severity) {
+ proto_item_set_expert_flags(item,group,severity);
+ }
+ }
+
+ return 0;
+}
+
+
+static int Item_set_generated(lua_State *L) {
+ Item item = checkItem(L,1);
+ if (item) {
+ PROTO_ITEM_SET_GENERATED(item);
+ }
+ return 0;
+}
+
+
+static int Item_set_hidden(lua_State *L) {
+ Item item = checkItem(L,1);
+ if (item) {
+ PROTO_ITEM_SET_HIDDEN(item);
+ }
+ return 0;
+}
+
+static const luaL_reg Item_methods[] = {
+ {"add_subtree", Item_add_subtree},
+ {"set_text", Item_set_text},
+ {"append_text", Item_append_text},
+ {"set_len", Item_set_len},
+ {"set_expert_flags", Item_set_expert_flags},
+ {"set_generated", Item_set_generated},
+ {"set_hidden", Item_set_hidden},
+ {0, 0}
+};
+
+static const luaL_reg Item_meta[] = {
+ {"__tostring", Item_tostring},
+ {0, 0}
+};
+
+
+
+int Item_register(lua_State *L) {
+ const struct _expert_severity* s;
+
+ luaL_openlib(L, ITEM, Item_methods, 0);
+ luaL_newmetatable(L, ITEM);
+ luaL_openlib(L, 0, Item_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ for(s = severities; s->str; s++) {
+ lua_pushstring(L, s->str);
+ lua_pushstring(L, s->str);
+ lua_settable(L, LUA_GLOBALSINDEX);
+ }
+
+ return 1;
+}
--- /dev/null
+#include "packet-lua.h"
+
+LUA_CLASS_DEFINE(Tvb,TVB,if (! *p) luaL_error(L,"null tvb"));
+LUA_CLASS_DEFINE(ByteArray,BYTE_ARRAY,if (! *p) luaL_argerror(L,index,"null bytearray"));
+
+static int ByteArray_new(lua_State* L) {
+ GByteArray* ba = g_byte_array_new();
+
+ if (lua_gettop(L) == 1) {
+ const gchar* s = luaL_checkstring(L,1);
+
+ if (!s) {
+ luaL_argerror(L,1,"not a string");
+ return 0;
+ }
+
+ /* XXX: slow! */
+ int nibble[2];
+ int i = 0;
+ gchar c;
+
+ for (; (c = *s); s++) {
+ switch(c) {
+ case '0': case '1': case '2': case '3': case '4': case '5' : case '6' : case '7': case '8' : case '9' :
+ nibble[(i++)%2] = c - '0';
+ break;
+ case 'a': case 'b': case 'c': case 'd': case 'e': case 'f' :
+ nibble[(i++)%2] = c - 'a' + 0xa;
+ break;
+ case 'A': case 'B': case 'C': case 'D': case 'E': case 'F' :
+ nibble[(i++)%2] = c - 'A' + 0xa;
+ break;
+ default:
+ break;
+ }
+
+ if ( i == 2 ) {
+ guint8 b = (guint8)(nibble[0] * 16 + nibble[1]);
+ g_byte_array_append(ba,&b,1);
+ i = 0;
+ }
+ }
+ }
+
+ pushByteArray(L,ba);
+
+ return 1;
+}
+
+static int ByteArray_gc(lua_State* L) {
+ ByteArray ba = checkByteArray(L,1);
+
+ if (!ba) return 0;
+
+ g_byte_array_free(ba,TRUE);
+ return 0;
+}
+
+static int ByteArray_append(lua_State* L) {
+ ByteArray ba = checkByteArray(L,1);
+
+ if (luaL_checkudata (L, 2, BYTE_ARRAY)) {
+ ByteArray ba2 = checkByteArray(L,2);
+ g_byte_array_append(ba,ba2->data,ba2->len);
+ } else if (( lua_gettop(L) == 2 )) {
+ int i = luaL_checkint(L,2);
+ guint8 d;
+
+ if (i < 0 || i > 255) {
+ luaL_error(L,"Byte out of range");
+ return 0;
+ }
+
+ d = (guint8)i;
+ g_byte_array_append(ba,&d,1);
+ } else {
+ luaL_error(L,"ByteArray:append takes two arguments");
+ }
+ return 0;
+}
+
+static int ByteArray_preppend(lua_State* L) {
+ ByteArray ba = checkByteArray(L,1);
+
+ if (!ba) return 0;
+
+ if (luaL_checkudata (L, 2, BYTE_ARRAY)) {
+ ByteArray ba2 = checkByteArray(L,2);
+ g_byte_array_prepend(ba,ba2->data,ba2->len);
+ } else if (( lua_gettop(L) == 2 )) {
+ int i = luaL_checkint(L,2);
+ guint8 d;
+
+ if (i < 0 || i > 255) luaL_error(L,"Byte out of range");
+
+ d = (guint8)i;
+ g_byte_array_prepend(ba,&d,1);
+ } else {
+ luaL_error(L,"ByteArray:preppend takes two arguments");
+ }
+ return 0;
+}
+
+static int ByteArray_set_size(lua_State* L) {
+ ByteArray ba = checkByteArray(L,1);
+ int siz = luaL_checkint(L,2);
+
+ if (!ba) return 0;
+
+ g_byte_array_set_size(ba,siz);
+ return 0;
+}
+
+static int ByteArray_set_index(lua_State* L) {
+ ByteArray ba = checkByteArray(L,1);
+ int idx = luaL_checkint(L,2);
+ int v = luaL_checkint(L,3);
+
+ if (!ba) return 0;
+
+ if (idx < 0 || (guint)idx >= ba->len) {
+ luaL_argerror(L,2,"index out of range");
+ return 0;
+ }
+
+ if (v < 0 || v > 255) {
+ luaL_argerror(L,3,"Byte out of range");
+ return 0;
+ }
+
+ ba->data[idx] = (guint8)v;
+
+ return 0;
+}
+
+
+static int ByteArray_get_index(lua_State* L) {
+ ByteArray ba = checkByteArray(L,1);
+ int idx = luaL_checkint(L,2);
+
+ if (!ba) return 0;
+
+ if (idx < 0 || (guint)idx >= ba->len) {
+ luaL_argerror(L,2,"index out of range");
+ return 0;
+ }
+
+ lua_pushnumber(L,(lua_Number)ba->data[idx]);
+
+ return 1;
+}
+
+static int ByteArray_len(lua_State* L) {
+ ByteArray ba = checkByteArray(L,1);
+
+ if (!ba) return 0;
+
+ lua_pushnumber(L,(lua_Number)ba->len);
+
+ return 1;
+}
+
+static int ByteArray_subset(lua_State* L) {
+ ByteArray ba = checkByteArray(L,1);
+ int offset = luaL_checkint(L,2);
+ int len = luaL_checkint(L,3);
+ ByteArray ret;
+ guint i;
+
+ if (!ba) return 0;
+
+ if ((offset + len) > (int)ba->len) {
+ luaL_error(L,"out of bounds");
+ return 0;
+ }
+
+ ret = g_byte_array_sized_new(len);
+
+ for ( i=0 ; i < ba->len ; i++) {
+ (ret->data)[i] = (ba->data)[offset+i];
+ }
+
+ pushByteArray(L,ba);
+ return 1;
+}
+
+static int ByteArray_tostring(lua_State* L) {
+ static const gchar* byte_to_str[] = {
+ "00","01","02","03","04","05","06","07","08","09","0A","0B","0C","0D","0E","0F",
+ "10","11","12","13","14","15","16","17","18","19","1A","1B","1C","1D","1E","1F",
+ "20","21","22","23","24","25","26","27","28","29","2A","2B","2C","2D","2E","2F",
+ "30","31","32","33","34","35","36","37","38","39","3A","3B","3C","3D","3E","3F",
+ "40","41","42","43","44","45","46","47","48","49","4A","4B","4C","4D","4E","4F",
+ "50","51","52","53","54","55","56","57","58","59","5A","5B","5C","5D","5E","5F",
+ "60","61","62","63","64","65","66","67","68","69","6A","6B","6C","6D","6E","6F",
+ "70","71","72","73","74","75","76","77","78","79","7A","7B","7C","7D","7E","7F",
+ "80","81","82","83","84","85","86","87","88","89","8A","8B","8C","8D","8E","8F",
+ "90","91","92","93","94","95","96","97","98","99","9A","9B","9C","9D","9E","9F",
+ "A0","A1","A2","A3","A4","A5","A6","A7","A8","A9","AA","AB","AC","AD","AE","AF",
+ "B0","B1","B2","B3","B4","B5","B6","B7","B8","B9","BA","BB","BC","BD","BE","BF",
+ "C0","C1","C2","C3","C4","C5","C6","C7","C8","C9","CA","CB","CC","CD","CE","CF",
+ "D0","D1","D2","D3","D4","D5","D6","D7","D8","D9","DA","DB","DC","DD","DE","DF",
+ "E0","E1","E2","E3","E4","E5","E6","E7","E8","E9","EA","EB","EC","ED","EE","EF",
+ "F0","F1","F2","F3","F4","F5","F6","F7","F8","F9","FA","FB","FC","FD","FE","FF"
+ };
+ ByteArray ba = checkByteArray(L,1);
+ int i;
+ GString* s;
+
+ if (!ba) return 0;
+
+ s = g_string_new("ByteArray");
+
+ g_string_sprintfa(s,"(%u): ",ba->len);
+
+ for (i = 0; i < (int)ba->len; i++) {
+ g_string_append(s,byte_to_str[(ba->data)[i]]);
+ }
+
+ lua_pushstring(L,s->str);
+ g_string_free(s,TRUE);
+
+ return 1;
+}
+
+static const luaL_reg ByteArray_methods[] = {
+ {"new", ByteArray_new},
+ {"get_index", ByteArray_get_index},
+ {"len", ByteArray_len},
+ {"preppend", ByteArray_preppend},
+ {"append", ByteArray_append},
+ {"subset", ByteArray_subset},
+ {"set", ByteArray_set_index},
+ {"set_size", ByteArray_set_size},
+ {0,0}
+};
+
+static const luaL_reg ByteArray_meta[] = {
+ {"__gc", ByteArray_gc},
+ {"__tostring", ByteArray_tostring},
+ {"__concat", ByteArray_append},
+ {0, 0}
+};
+
+int ByteArray_register(lua_State* L) {
+ luaL_openlib(L, BYTE_ARRAY, ByteArray_methods, 0);
+ luaL_newmetatable(L, BYTE_ARRAY);
+ luaL_openlib(L, 0, ByteArray_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+};
+
+
+/*
+ * Tvb class
+ */
+
+
+static int Tvb_new (lua_State *L) {
+ ByteArray ba;
+
+ if (!lua_pinfo) {
+ /* XXX: for now tvb should only be used in the frame that created */
+ luaL_error(L,"Tvb can only be used in dissectors");
+ return 0;
+ }
+
+ if (( luaL_checkudata(L,1,BYTE_ARRAY) )) {
+ ba = toByteArray(L,1);
+ const gchar* name = luaL_optstring(L,2,"Unnamed") ;
+ /* XXX: what if the BA gets garbage collected? */
+ Tvb tvb = tvb_new_real_data(ba->data, ba->len,ba->len);
+ add_new_data_source(lua_pinfo, tvb, name);
+ pushTvb(L,tvb);
+ return 1;
+ } else {
+ int len = luaL_optint(L, 3, -1);
+ pushTvb(L, tvb_new_subset( checkTvb(L,1),luaL_optint(L, 2, 0),len, len) );
+ return 1;
+ }
+}
+
+
+
+#define TVBGET_FN(type) Tvb_get_ ## type
+
+#define DEFINE_TVBGET(type,len) static int TVBGET_FN(type) (lua_State *L) { \
+ tvbuff_t* tvb = checkTvb(L,1); \
+ int offset = luaL_checkint(L,2); \
+ if (!tvb) return 0; \
+ if (!lua_pinfo) { luaL_error(L,"Tvb can only be used in dissectors"); return 0; } \
+ if (tvb_offset_exists(tvb, offset+len)) { \
+ lua_pushnumber(L, (lua_Number) tvb_get_ ## type(tvb,offset)); \
+ return 1; \
+ } else { \
+ luaL_error(L,"Out Of Bounds"); \
+ return 0; \
+ } \
+}
+
+
+DEFINE_TVBGET(guint8,1);
+DEFINE_TVBGET(ntohs,2);
+DEFINE_TVBGET(ntoh24,3);
+DEFINE_TVBGET(ntohl,4);
+DEFINE_TVBGET(ntohieee_float,4);
+DEFINE_TVBGET(ntohieee_double,8);
+
+DEFINE_TVBGET(letohs,1);
+DEFINE_TVBGET(letoh24,2);
+DEFINE_TVBGET(letohl,3);
+DEFINE_TVBGET(letohieee_float,4);
+DEFINE_TVBGET(letohieee_double,8);
+
+static int Tvb_get_bytearray(lua_State* L) {
+ Tvb tvb = checkTvb(L,1);
+ int offset = 0;
+ int o_len;
+ int len;
+ ByteArray ba;
+
+ if (!tvb) return 0;
+
+ o_len = tvb_length(tvb);
+ len = o_len;
+
+ if (!lua_pinfo) {
+ luaL_error(L,"Tvb can only be used in dissectors");
+ return 0;
+ }
+
+
+ switch( lua_gettop(L) ) {
+ case 3:
+ offset = luaL_checkint(L,2);
+ len = luaL_checkint(L,3);
+ break;
+ case 2:
+ offset = luaL_checkint(L,2);
+ len -= offset;
+ break;
+ case 1:
+ break;
+ default:
+ luaL_error(L,"too many arguments");
+ return 0;
+ }
+
+ if (len < 1 || offset+len > o_len) {
+ luaL_error(L,"off bounds");
+ return 0;
+
+ }
+
+ ba = g_byte_array_new();
+ g_byte_array_append(ba,ep_tvb_memdup(tvb,offset,len),len);
+
+ pushByteArray(L,ba);
+
+ return 1;
+}
+
+static int Tvb_get_stringz(lua_State* L) {
+ Tvb tvb = checkTvb(L,1);
+
+ if (!tvb) return 0;
+
+ if (!lua_pinfo) {
+ luaL_error(L,"Tvb can only be used in dissectors");
+ return 0;
+ }
+
+ lua_pushstring(L,(gchar*)tvb_get_ephemeral_stringz(tvb,luaL_checkint(L,2),NULL));
+ return 1;
+}
+
+static int Tvb_get_string(lua_State* L) {
+ Tvb tvb = checkTvb(L,1);
+
+ if (!tvb) return 0;
+
+ if (!lua_pinfo) {
+ luaL_error(L,"Tvb can only be used in dissectors");
+ return 0;
+ }
+
+ lua_pushstring(L,(gchar*)tvb_get_ephemeral_string(tvb,luaL_checkint(L,2),luaL_checkint(L,3)));
+ return 1;
+}
+
+static int Tvb_tostring(lua_State* L) {
+ Tvb tvb = checkTvb(L,1);
+ int len;
+
+ if (!tvb) return 0;
+
+ len = tvb_length(tvb);
+ gchar* str = g_strdup_printf("TVB(%i) : %s",len,tvb_bytes_to_str(tvb,0,len));
+ lua_pushstring(L,str);
+ return 1;
+}
+
+
+
+static int Tvb_len(lua_State* L) {
+ Tvb tvb = checkTvb(L,1);
+
+ if (!tvb) return 0;
+
+ if (!lua_pinfo) {
+ luaL_error(L,"Tvb can only be used in dissectors");
+ return 0;
+ }
+
+ lua_pushnumber(L,tvb_length(tvb));
+ return 1;
+}
+
+
+static const luaL_reg Tvb_methods[] = {
+ {"new", Tvb_new},
+ {"get_char", TVBGET_FN(guint8)},
+ {"get_ntohs", TVBGET_FN(ntohs)},
+ {"get_ntoh24", TVBGET_FN(ntoh24)},
+ {"get_ntohl", TVBGET_FN(ntohl)},
+ {"get_ntohfloat", TVBGET_FN(ntohieee_float)},
+ {"get_ntohdouble", TVBGET_FN(ntohieee_double)},
+ {"get_letohs", TVBGET_FN(letohs)},
+ {"get_letoh24", TVBGET_FN(letoh24)},
+ {"get_letohl", TVBGET_FN(letohl)},
+ {"get_letohl", TVBGET_FN(letohl)},
+ {"get_letohfloat", TVBGET_FN(letohieee_float)},
+ {"get_letohdouble", TVBGET_FN(letohieee_double)},
+ {"get_stringz", Tvb_get_stringz },
+ {"get_string", Tvb_get_string },
+ {"get_bytearray",Tvb_get_bytearray},
+ {"len", Tvb_len},
+ {0,0}
+};
+
+static const luaL_reg Tvb_meta[] = {
+ {"__tostring", Tvb_tostring},
+ {0, 0}
+};
+
+int Tvb_register(lua_State* L) {
+ luaL_openlib(L, TVB, Tvb_methods, 0);
+ luaL_newmetatable(L, TVB);
+ luaL_openlib(L, 0, Tvb_meta, 0);
+ lua_pushliteral(L, "__index");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pushliteral(L, "__metatable");
+ lua_pushvalue(L, -3);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+
+ return 1;
+};
+
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#include <glib.h>
-#include <errno.h>
-#include <lua.h>
-#include <lualib.h>
-#include <lauxlib.h>
-#include <epan/packet.h>
-#include <epan/strutil.h>
-#include <epan/prefs.h>
-#include <epan/proto.h>
-#include <epan/epan_dissect.h>
-#include <epan/tap.h>
-#include <epan/filesystem.h>
-#include <epan/report_err.h>
-#include <epan/emem.h>
-
-#define VALUE_STRING "ValueString"
-typedef GArray* ValueString;
-
-#define PROTO_FIELD "ProtoField"
-typedef struct _eth_field_t* ProtoField;
-
-#define PROTO_FIELD_ARRAY "ProtoFieldArr"
-typedef GArray* ProtoFieldArray;
-
-#define ETT "SubTreeType"
-typedef int* Ett;
-
-#define ETT_ARRAY "SubTreeTypeArr"
-typedef GArray* EttArray;
-
-#define PROTO "Proto"
-typedef struct _eth_proto_t* Proto;
-
-#define DISSECTOR_TABLE "DissectorTable"
-typedef struct _eth_distbl_t {
- dissector_table_t table;
- gchar* name;
-}* DissectorTable;
-
-#define DISSECTOR "Dissector"
-typedef dissector_handle_t Dissector;
-
-#define BYTE_ARRAY "ByteArray"
-typedef GByteArray* ByteArray;
-
-#define TVB "Tvb"
-typedef tvbuff_t* Tvb;
-
-#define COLUMN "Column"
-typedef struct _eth_col_info {
- column_info* cinfo;
- gint col;
-}* Column;
-
-#define PINFO "Pinfo"
-typedef packet_info* Pinfo;
-
-#define TREE "Tree"
-typedef proto_tree* Tree;
-
-#define ITEM "Item"
-typedef proto_item* Item;
-
-#define ADDRESS "Address"
-typedef address* Address;
-
-#define INTERESTING "Interesting"
-typedef header_field_info* Interesting;
-
-#define TAP "Tap"
-typedef struct _eth_tap {
- const gchar* name;
- GPtrArray* interesting_fields;
- gchar* filter;
- gboolean registered;
-}* Tap;
-
-static lua_State* L = NULL;
-static dissector_handle_t data_handle = NULL;
-static packet_info* g_pinfo = NULL;
-static proto_tree* g_tree = NULL;
-
-
-typedef struct _eth_field_t {
- int hfid;
- char* name;
- char* abbr;
- char* blob;
- enum ftenum type;
- base_display_e base;
- value_string* vs;
- guint32 mask;
-} eth_field_t;
-
-typedef enum {PREF_BOOL,PREF_UINT,PREF_STRING} pref_type_t;
-
-typedef struct _eth_pref_t {
- gchar* name;
- pref_type_t type;
- union {
- gboolean b;
- guint32 u;
- gint32 i;
- const gchar* s;
- } value;
- struct _eth_pref_t* next;
-} eth_pref_t;
-
-typedef struct _eth_proto_t {
- int hfid;
- char* name;
- char* filter;
- char* desc;
- hf_register_info* hfarray;
- gboolean hf_registered;
- module_t *prefs_module;
- eth_pref_t* prefs;
- dissector_handle_t handle;
-} eth_proto_t;
-
-typedef struct {const gchar* str; enum ftenum id; } eth_ft_types_t;
-
-#define NOP
-
-#define LUA_CLASS_OPS(C,CN,check_code) \
-static C to##C(lua_State* L, int index) { \
- C* v = (C*)lua_touserdata (L, index); \
- if (!v) luaL_typerror(L,index,CN); \
- return *v; \
-} \
-static C check##C(lua_State* L, int index) { \
- C* p; \
- luaL_checktype(L,index,LUA_TUSERDATA); \
- p = (C*)luaL_checkudata(L, index, CN); \
- check_code; \
- return *p; \
-} \
-static C* push##C(lua_State* L, C v) { \
- C* p = lua_newuserdata(L,sizeof(C)); *p = v; \
- luaL_getmetatable(L, CN); lua_setmetatable(L, -2); \
- return p; \
-}
-
-static int No_gc(lua_State *L _U_) { return 0; }
-
-/*
- * ValueString class
- */
-LUA_CLASS_OPS(ValueString,VALUE_STRING,if ( !p ) luaL_error(L,"NULL ValueString"););
-
-static int ValueString_new(lua_State* L) {
- ValueString vs = g_array_new(TRUE,TRUE,sizeof(value_string));
- pushValueString(L,vs);
- return 1;
-}
-
-
-static int ValueString_add(lua_State* L) {
- ValueString vs = checkValueString(L,1);
- value_string v = {0,NULL};
-
- v.value = luaL_checkint(L,2);
- v.strptr = g_strdup(luaL_checkstring(L,3));
-
- g_array_append_val(vs,v);
-
- return 0;
-}
-
-static int ValueString_match(lua_State* L) {
- ValueString vs = checkValueString(L,1);
- guint32 val = (guint32)luaL_checkint(L,2);
- const gchar* def = luaL_optstring(L,8,"Unknown");
-
- lua_pushstring(L,val_to_str(val, (value_string*)(vs->data), def));
-
- return 1;
-}
-
-static int ValueString_gc(lua_State* L) {
- ValueString vs = checkValueString(L,1);
-
- g_array_free(vs,TRUE);
-
- return 0;
-}
-
-static int ValueString_tostring(lua_State* L) {
- ValueString vs = checkValueString(L,1);
- value_string* c = (value_string*)vs->data;
- GString* s = g_string_new("ValueString:\n");
-
- for(;c->strptr;c++) {
- g_string_sprintfa(s,"\t%u\t%s\n",c->value,c->strptr);
- }
-
- lua_pushstring(L,s->str);
-
- g_string_free(s,TRUE);
-
- return 1;
-}
-
-static const luaL_reg ValueString_methods[] = {
- {"new", ValueString_new},
- {"add", ValueString_add},
- {"match", ValueString_match},
- {0,0}
-};
-
-
-static const luaL_reg ValueString_meta[] = {
- {"__gc", ValueString_gc},
- {"__tostring", ValueString_tostring},
- {0, 0}
-};
-
-
-static int ValueString_register(lua_State* L) {
- luaL_openlib(L, VALUE_STRING, ValueString_methods, 0);
- luaL_newmetatable(L, VALUE_STRING);
- luaL_openlib(L, 0, ValueString_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- return 1;
-}
-
-
-
-
-/*
- * ProtoField class
- */
-
-static const eth_ft_types_t ftenums[] = {
- {"FT_BOOLEAN",FT_BOOLEAN},
- {"FT_UINT8",FT_UINT8},
- {"FT_UINT16",FT_UINT16},
- {"FT_UINT24",FT_UINT24},
- {"FT_UINT32",FT_UINT32},
- {"FT_UINT64",FT_UINT64},
- {"FT_INT8",FT_INT8},
- {"FT_INT16",FT_INT16},
- {"FT_INT24",FT_INT24},
- {"FT_INT32",FT_INT32},
- {"FT_INT64",FT_INT64},
- {"FT_FLOAT",FT_FLOAT},
- {"FT_DOUBLE",FT_DOUBLE},
- {"FT_STRING",FT_STRING},
- {"FT_STRINGZ",FT_STRINGZ},
- {"FT_ETHER",FT_ETHER},
- {"FT_BYTES",FT_BYTES},
- {"FT_UINT_BYTES",FT_UINT_BYTES},
- {"FT_IPv4",FT_IPv4},
- {"FT_IPv6",FT_IPv6},
- {"FT_IPXNET",FT_IPXNET},
- {"FT_FRAMENUM",FT_FRAMENUM},
- {"FT_GUID",FT_GUID},
- {"FT_OID",FT_OID},
- {NULL,FT_NONE}
-};
-
-static enum ftenum get_ftenum(const gchar* type) {
- const eth_ft_types_t* ts;
- for (ts = ftenums; ts->str; ts++) {
- if ( g_str_equal(ts->str,type) ) {
- return ts->id;
- }
- }
-
- return FT_NONE;
-}
-
-static const gchar* ftenum_to_string(enum ftenum ft) {
- const eth_ft_types_t* ts;
- for (ts = ftenums; ts->str; ts++) {
- if ( ts->id == ft ) {
- return ts->str;
- }
- }
-
- return NULL;
-}
-
-struct base_display_string_t {
- const gchar* str;
- base_display_e base;
-};
-
-static const struct base_display_string_t base_displays[] = {
- { "BASE_NONE", BASE_NONE},
- {"BASE_DEC", BASE_DEC},
- {"BASE_HEX", BASE_HEX},
- {"BASE_OCT", BASE_OCT},
- {"BASE_DEC_HEX", BASE_DEC_HEX},
- {"BASE_HEX_DEC", BASE_HEX_DEC},
- {NULL,0}
-};
-
-static const gchar* base_to_string(base_display_e base) {
- const struct base_display_string_t* b;
- for (b=base_displays;b->str;b++) {
- if ( base == b->base)
- return b->str;
- }
- return NULL;
-}
-
-static base_display_e string_to_base(const gchar* str) {
- const struct base_display_string_t* b;
- for (b=base_displays;b->str;b++) {
- if ( g_str_equal(str,b->str))
- return b->base;
- }
- return BASE_NONE;
-}
-
-
-LUA_CLASS_OPS(ProtoField,PROTO_FIELD,if (! *p) luaL_error(L,"null ProtoField"));
-
-static int ProtoField_new(lua_State* L) {
- ProtoField f = g_malloc(sizeof(eth_field_t));
- GArray* vs;
-
- f->hfid = -2;
- f->name = g_strdup(luaL_checkstring(L,1));
- f->abbr = g_strdup(luaL_checkstring(L,2));
- f->type = get_ftenum(luaL_checkstring(L,3));
-
- if (f->type == FT_NONE) {
- luaL_argerror(L, 3, "invalid FT_type");
- return 0;
- }
-
- if (! lua_isnil(L,4) ) {
- vs = checkValueString(L,4);
-
- if (vs) {
- f->vs = (value_string*)vs->data;
- }
- } else {
- f->vs = NULL;
- }
-
- /* XXX: need BASE_ERROR */
- f->base = string_to_base(luaL_optstring(L, 5, "BASE_NONE"));
- f->mask = luaL_optint(L, 6, 0x0);
- f->blob = g_strdup(luaL_optstring(L,7,""));
-
- pushProtoField(L,f);
-
- return 1;
-}
-
-static int ProtoField_tostring(lua_State* L) {
- ProtoField f = checkProtoField(L,1);
- gchar* s = g_strdup_printf("ProtoField(%i): %s %s %s %s %p %.8x %s",f->hfid,f->name,f->abbr,ftenum_to_string(f->type),base_to_string(f->base),f->vs,f->mask,f->blob);
-
- lua_pushstring(L,s);
- g_free(s);
-
- return 1;
-}
-
-
-
-static const luaL_reg ProtoField_methods[] = {
- {"new", ProtoField_new},
- {0,0}
-};
-
-static const luaL_reg ProtoField_meta[] = {
- {"__gc", No_gc},
- {"__tostring", ProtoField_tostring},
- {0, 0}
-};
-
-static int ProtoField_register(lua_State* L) {
- const eth_ft_types_t* ts;
- const struct base_display_string_t* b;
-
- luaL_openlib(L, PROTO_FIELD, ProtoField_methods, 0);
- luaL_newmetatable(L, PROTO_FIELD);
- luaL_openlib(L, 0, ProtoField_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- /* add a global FT_* variable for each FT_ type */
- for (ts = ftenums; ts->str; ts++) {
- lua_pushstring(L, ts->str);
- lua_pushstring(L, ts->str);
- lua_settable(L, LUA_GLOBALSINDEX);
- }
-
- /* add a global BASE_* variable for each BASE_ */
- for (b=base_displays;b->str;b++) {
- lua_pushstring(L, b->str);
- lua_pushstring(L, b->str);
- lua_settable(L, LUA_GLOBALSINDEX);
- }
-
- return 1;
-}
-
-
-
-
-/*
- * ProtoFieldArray class
- */
-
-LUA_CLASS_OPS(ProtoFieldArray,PROTO_FIELD_ARRAY,if (! *p) luaL_error(L,"null ProtoFieldArray"));
-
-static int ProtoFieldArray_new(lua_State* L) {
- ProtoFieldArray fa;
- guint i;
- guint num_args = lua_gettop(L);
-
- fa = g_array_new(TRUE,TRUE,sizeof(hf_register_info));
-
- for ( i = 1; i <= num_args; i++) {
- ProtoField f = checkProtoField(L,i);
- hf_register_info hfri = { &(f->hfid), {f->name,f->abbr,f->type,f->base,VALS(f->vs),f->mask,f->blob,HFILL}};
-
- if (f->hfid != -2) {
- luaL_argerror(L, i, "field has already been added to an array");
- return 0;
- }
-
- f->hfid = -1;
-
- g_array_append_val(fa,hfri);
- }
-
- pushProtoFieldArray(L,fa);
- return 1;
-}
-
-
-static int ProtoFieldArray_add(lua_State* L) {
- ProtoFieldArray fa = checkProtoFieldArray(L,1);
- guint i;
- guint num_args = lua_gettop(L);
-
- for ( i = 2; i <= num_args; i++) {
- ProtoField f = checkProtoField(L,i);
- hf_register_info hfri = { &(f->hfid), {f->name,f->abbr,f->type,f->base,VALS(f->vs),f->mask,f->blob,HFILL}};
-
- if (f->hfid != -2) {
- luaL_argerror(L, i, "field has already been added to an array");
- return 0;
- }
-
- f->hfid = -1;
-
- g_array_append_val(fa,hfri);
- }
-
- return 0;
-}
-
-static int ProtoFieldArray_tostring(lua_State* L) {
- GString* s = g_string_new("ProtoFieldArray:\n");
- hf_register_info* f;
- ProtoFieldArray fa = checkProtoFieldArray(L,1);
- unsigned i;
-
- for(i = 0; i< fa->len; i++) {
- f = &(((hf_register_info*)(fa->data))[i]);
- g_string_sprintfa(s,"%i %s %s %s %u %p %.8x %s\n",*(f->p_id),f->hfinfo.name,f->hfinfo.abbrev,ftenum_to_string(f->hfinfo.type),f->hfinfo.display,f->hfinfo.strings,f->hfinfo.bitmask,f->hfinfo.blurb);
- };
-
- lua_pushstring(L,s->str);
- g_string_free(s,TRUE);
-
- return 1;
-}
-
-static int ProtoFieldArray_gc(lua_State* L) {
- ProtoFieldArray vs = checkValueString(L,1);
-
- g_array_free(vs,TRUE);
-
- return 0;
-}
-
-
-static const luaL_reg ProtoFieldArray_methods[] = {
- {"new", ProtoFieldArray_new},
- {"add", ProtoFieldArray_add},
- {0,0}
-};
-
-static const luaL_reg ProtoFieldArray_meta[] = {
- {"__gc", ProtoFieldArray_gc},
- {"__tostring", ProtoFieldArray_tostring},
- {0, 0}
-};
-
-static int ProtoFieldArray_register(lua_State* L) {
- luaL_openlib(L, PROTO_FIELD_ARRAY, ProtoFieldArray_methods, 0);
- luaL_newmetatable(L, PROTO_FIELD_ARRAY);
- luaL_openlib(L, 0, ProtoFieldArray_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- return 1;
-}
-
-
-
-
-/*
- * Ett class
- */
-
-LUA_CLASS_OPS(Ett,ETT,NOP);
-
-static int Ett_new(lua_State* L) {
- Ett e = g_malloc(sizeof(int));
- *e = -2;
- pushEtt(L,e);
-
- return 1;
-}
-
-static int Ett_tostring(lua_State* L) {
- Ett e = checkEtt(L,1);
- gchar* s = g_strdup_printf("Ett: %i",*e);
-
- lua_pushstring(L,s);
- g_free(s);
-
- return 1;
-}
-
-
-static const luaL_reg Ett_methods[] = {
- {"new", Ett_new},
- {0,0}
-};
-
-static const luaL_reg Ett_meta[] = {
- {"__gc", No_gc},
- {"__tostring", Ett_tostring},
- {0, 0}
-};
-
-static int Ett_register(lua_State* L) {
- luaL_openlib(L, ETT, Ett_methods, 0);
- luaL_newmetatable(L, ETT);
- luaL_openlib(L, 0, Ett_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- return 1;
-}
-
-
-
-
-
-/*
- * EttArray class
- */
-LUA_CLASS_OPS(EttArray,ETT_ARRAY,if (! *p) luaL_error(L,"null EttArray"));
-
-static int EttArray_new(lua_State* L) {
- EttArray ea = g_array_new(TRUE,TRUE,sizeof(gint*));
- guint i;
- guint num_args = lua_gettop(L);
-
- for (i = 1; i <= num_args; i++) {
- Ett e = checkEtt(L,i);
-
- if(*e != -2) {
- luaL_argerror(L, i, "SubTree has already been added to an array");
- return 0;
- }
-
- *e = -1;
-
- g_array_append_val(ea,e);
- }
-
- pushEttArray(L,ea);
- return 1;
-}
-
-
-static int EttArray_add(lua_State* L) {
- EttArray ea = checkEttArray(L,1);
- guint i;
- guint num_args = lua_gettop(L);
-
- for (i = 2; i <= num_args; i++) {
- Ett e = checkEtt(L,i);
- if(*e != -2) {
- luaL_argerror(L, i, "SubTree has already been added to an array");
- return 0;
- }
-
- *e = -1;
-
- g_array_append_val(ea,e);
- }
-
- return 0;
-}
-
-static int EttArray_tostring(lua_State* L) {
- GString* s = g_string_new("EttArray:\n");
- EttArray ea = checkEttArray(L,1);
- unsigned i;
-
- for(i = 0; i< ea->len; i++) {
- gint ett = *(((gint**)(ea->data))[i]);
- g_string_sprintfa(s,"%i\n",ett);
- };
-
- lua_pushstring(L,s->str);
- g_string_free(s,TRUE);
-
- return 1;
-}
-
-static int EttArray_register_to_ethereal(lua_State* L) {
- EttArray ea = checkEttArray(L,1);
-
- if (!ea->len) {
- luaL_argerror(L,1,"empty array");
- return 0;
- }
-
- /* is last ett -1? */
- if ( *(((gint *const *)ea->data)[ea->len -1]) != -1) {
- luaL_argerror(L,1,"array has been registered already");
- return 0;
- }
-
- proto_register_subtree_array((gint *const *)ea->data, ea->len);
- return 0;
-}
-
-static int EttArray_gc(lua_State* L) {
- EttArray ea = checkEttArray(L,1);
-
- g_array_free(ea,FALSE);
-
- return 0;
-}
-
-
-static const luaL_reg EttArray_methods[] = {
- {"new", EttArray_new},
- {"add", EttArray_add},
- {"register", EttArray_register_to_ethereal},
- {0,0}
-};
-
-static const luaL_reg EttArray_meta[] = {
- {"__gc", EttArray_gc},
- {"__tostring", EttArray_tostring},
- {0, 0}
-};
-
-static int EttArray_register(lua_State* L) {
- luaL_openlib(L, ETT_ARRAY, EttArray_methods, 0);
- luaL_newmetatable(L, ETT_ARRAY);
- luaL_openlib(L, 0, EttArray_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- return 1;
-}
-
-
-/*
- * Proto class
- */
-LUA_CLASS_OPS(Proto,PROTO,if (! *p) luaL_error(L,"null Proto"));
-
-static void dissect_lua(tvbuff_t* tvb, packet_info* pinfo, proto_tree* tree);
-
-static int Proto_new(lua_State* L) {
- Proto proto = g_malloc(sizeof(eth_proto_t));
-
- proto->hfid = -1;
- proto->name = g_strdup(luaL_checkstring(L,1));
- proto->filter = g_strdup(luaL_checkstring(L,2));
- proto->desc = g_strdup(luaL_checkstring(L,3));
- proto->hfarray = NULL;
- proto->prefs_module = NULL;
- proto->prefs = NULL;
- proto->handle = NULL;
-
- if (proto->name && proto->filter && proto->desc) {
- if ( proto_get_id_by_filter_name(proto->filter) > 0 ) {
- g_free(proto);
- luaL_argerror(L,2,"Protocol exists already");
- return 0;
- } else {
- proto->hfid = proto_register_protocol(proto->desc,proto->name,proto->filter);
- proto->handle = create_dissector_handle(dissect_lua,proto->hfid);
- pushProto(L,proto);
- return 1;
- }
- } else {
- if (! proto->name )
- luaL_argerror(L,1,"missing name");
-
- if (! proto->filter )
- luaL_argerror(L,2,"missing filter");
-
- if (! proto->desc )
- luaL_argerror(L,3,"missing desc");
-
- g_free(proto);
-
- return 0;
- }
-
-}
-
-static int Proto_register_field_array(lua_State* L) {
- Proto proto = checkProto(L,1);
- ProtoFieldArray fa = checkProtoFieldArray(L,2);
-
- if (!proto) {
- luaL_argerror(L,1,"not a good proto");
- return 0;
- }
-
- if (! fa) {
- luaL_argerror(L,2,"not a good field_array");
- return 0;
- }
-
- if( ! fa->len ) {
- luaL_argerror(L,2,"empty field_array");
- return 0;
- }
-
- if (proto->hfarray) {
- luaL_argerror(L,1,"field_array already registered for this protocol");
- }
-
- proto->hfarray = (hf_register_info*)(fa->data);
- proto_register_field_array(proto->hfid,proto->hfarray,fa->len);
-
- return 0;
-}
-
-static int Proto_add_uint_pref(lua_State* L) {
- Proto proto = checkProto(L,1);
- gchar* abbr = g_strdup(luaL_checkstring(L,2));
- guint def = (guint)luaL_optint(L,3,0);
- guint base = (guint)luaL_optint(L,4,10);
- gchar* name = g_strdup(luaL_optstring (L, 5, ""));
- gchar* desc = g_strdup(luaL_optstring (L, 6, ""));
-
- eth_pref_t* pref = g_malloc(sizeof(eth_pref_t));
- pref->name = abbr;
- pref->type = PREF_UINT;
- pref->value.u = def;
- pref->next = NULL;
-
- if (! proto->prefs_module)
- proto->prefs_module = prefs_register_protocol(proto->hfid, NULL);
-
- if (! proto->prefs) {
- proto->prefs = pref;
- } else {
- eth_pref_t* p;
- for (p = proto->prefs; p->next; p = p->next) ;
- p->next = pref;
- }
-
- prefs_register_uint_preference(proto->prefs_module, abbr,name,
- desc, base, &(pref->value.u));
-
- return 0;
-}
-
-static int Proto_add_bool_pref(lua_State* L) {
- Proto proto = checkProto(L,1);
- gchar* abbr = g_strdup(luaL_checkstring(L,2));
- gboolean def = (gboolean)luaL_optint(L,3,FALSE);
- gchar* name = g_strdup(luaL_optstring (L, 4, ""));
- gchar* desc = g_strdup(luaL_optstring (L, 5, ""));
-
- eth_pref_t* pref = g_malloc(sizeof(eth_pref_t));
- pref->name = abbr;
- pref->type = PREF_BOOL;
- pref->value.b = def;
- pref->next = NULL;
-
- if (! proto->prefs_module)
- proto->prefs_module = prefs_register_protocol(proto->hfid, NULL);
-
- if (! proto->prefs) {
- proto->prefs = pref;
- } else {
- eth_pref_t* p;
- for (p = proto->prefs; p->next; p = p->next) ;
- p->next = pref;
- }
-
- prefs_register_bool_preference(proto->prefs_module, abbr,name,
- desc, &(pref->value.b));
-
- return 0;
-}
-
-static int Proto_add_string_pref(lua_State* L) {
- Proto proto = checkProto(L,1);
- gchar* abbr = g_strdup(luaL_checkstring(L,2));
- gchar* def = g_strdup(luaL_optstring (L, 3, ""));
- gchar* name = g_strdup(luaL_optstring (L, 4, ""));
- gchar* desc = g_strdup(luaL_optstring (L, 5, ""));
-
- eth_pref_t* pref = g_malloc(sizeof(eth_pref_t));
- pref->name = abbr;
- pref->type = PREF_STRING;
- pref->value.s = def;
- pref->next = NULL;
-
- if (! proto->prefs_module)
- proto->prefs_module = prefs_register_protocol(proto->hfid, NULL);
-
- if (! proto->prefs) {
- proto->prefs = pref;
- } else {
- eth_pref_t* p;
- for (p = proto->prefs; p->next; p = p->next) ;
- p->next = pref;
- }
-
- prefs_register_string_preference(proto->prefs_module, abbr,name,
- desc, &(pref->value.s));
-
-
- return 0;
-}
-
-
-static int Proto_get_pref(lua_State* L) {
- Proto proto = checkProto(L,1);
- const gchar* abbr = luaL_checkstring(L,2);
-
- if (!proto) {
- luaL_argerror(L,1,"not a good proto");
- return 0;
- }
-
- if (!abbr) {
- luaL_argerror(L,2,"not a good abbrev");
- return 0;
- }
-
- if (proto->prefs) {
- eth_pref_t* p;
- for (p = proto->prefs; p; p = p->next) {
- if (g_str_equal(p->name,abbr)) {
- switch(p->type) {
- case PREF_BOOL:
- lua_pushboolean(L, p->value.b);
- break;
- case PREF_UINT:
- lua_pushnumber(L, (lua_Number)(p->value.u));
- break;
- case PREF_STRING:
- lua_pushstring(L, p->value.s);
- break;
- }
- return 1;
- }
- }
-
- luaL_argerror(L,2,"no such preference for this protocol");
- return 0;
-
- } else {
- luaL_error(L,"no preferences set for this protocol");
- return 0;
- }
-}
-
-
-static int Proto_tostring(lua_State* L) {
- Proto proto = checkProto(L,1);
- gchar* s = g_strdup_printf("Proto: %s",proto->name);
- lua_pushstring(L,s);
- g_free(s);
-
- return 1;
-}
-
-static const luaL_reg Proto_methods[] = {
- {"new", Proto_new},
- {"register_field_array", Proto_register_field_array},
- {"add_uint_pref", Proto_add_uint_pref},
- {"add_bool_pref", Proto_add_bool_pref},
- {"add_string_pref", Proto_add_string_pref},
- {"get_pref", Proto_get_pref},
- {0,0}
-};
-
-static const luaL_reg Proto_meta[] = {
- {"__gc", No_gc},
- {"__tostring", Proto_tostring},
- {0, 0}
-};
-
-static int Proto_register(lua_State* L) {
- luaL_openlib(L, PROTO, Proto_methods, 0);
- luaL_newmetatable(L, PROTO);
- luaL_openlib(L, 0, Proto_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- return 1;
-}
-
-
-LUA_CLASS_OPS(ByteArray,BYTE_ARRAY,if (! *p) luaL_argerror(L,index,"null bytearray"));
-
-static int ByteArray_new(lua_State* L) {
- GByteArray* ba = g_byte_array_new();
-
- if (lua_gettop(L) == 1) {
- const gchar* s = luaL_checkstring(L,1);
-
- if (!s) {
- luaL_argerror(L,1,"not a string");
- return 0;
- }
-
- /* XXX: slow! */
- int nibble[2];
- int i = 0;
- gchar c;
-
- for (; (c = *s); s++) {
- switch(c) {
- case '0': case '1': case '2': case '3': case '4': case '5' : case '6' : case '7': case '8' : case '9' :
- nibble[(i++)%2] = c - '0';
- break;
- case 'a': case 'b': case 'c': case 'd': case 'e': case 'f' :
- nibble[(i++)%2] = c - 'a' + 0xa;
- break;
- case 'A': case 'B': case 'C': case 'D': case 'E': case 'F' :
- nibble[(i++)%2] = c - 'A' + 0xa;
- break;
- default:
- break;
- }
-
- if ( i == 2 ) {
- guint8 b = (guint8)(nibble[0] * 16 + nibble[1]);
- g_byte_array_append(ba,&b,1);
- i = 0;
- }
- }
- }
-
- pushByteArray(L,ba);
-
- return 1;
-}
-
-static int ByteArray_gc(lua_State* L) {
- ByteArray ba = checkByteArray(L,1);
-
- if (!ba) return 0;
-
- g_byte_array_free(ba,TRUE);
- return 0;
-}
-
-static int ByteArray_append(lua_State* L) {
- ByteArray ba = checkByteArray(L,1);
-
- if (luaL_checkudata (L, 2, BYTE_ARRAY)) {
- ByteArray ba2 = checkByteArray(L,2);
- g_byte_array_append(ba,ba2->data,ba2->len);
- } else if (( lua_gettop(L) == 2 )) {
- int i = luaL_checkint(L,2);
- guint8 d;
-
- if (i < 0 || i > 255) {
- luaL_error(L,"Byte out of range");
- return 0;
- }
-
- d = (guint8)i;
- g_byte_array_append(ba,&d,1);
- } else {
- luaL_error(L,"ByteArray:append takes two arguments");
- }
- return 0;
-}
-
-static int ByteArray_preppend(lua_State* L) {
- ByteArray ba = checkByteArray(L,1);
-
- if (!ba) return 0;
-
- if (luaL_checkudata (L, 2, BYTE_ARRAY)) {
- ByteArray ba2 = checkByteArray(L,2);
- g_byte_array_prepend(ba,ba2->data,ba2->len);
- } else if (( lua_gettop(L) == 2 )) {
- int i = luaL_checkint(L,2);
- guint8 d;
-
- if (i < 0 || i > 255) luaL_error(L,"Byte out of range");
-
- d = (guint8)i;
- g_byte_array_prepend(ba,&d,1);
- } else {
- luaL_error(L,"ByteArray:preppend takes two arguments");
- }
- return 0;
-}
-
-static int ByteArray_set_size(lua_State* L) {
- ByteArray ba = checkByteArray(L,1);
- int siz = luaL_checkint(L,2);
-
- if (!ba) return 0;
-
- g_byte_array_set_size(ba,siz);
- return 0;
-}
-
-static int ByteArray_set_index(lua_State* L) {
- ByteArray ba = checkByteArray(L,1);
- int idx = luaL_checkint(L,2);
- int v = luaL_checkint(L,3);
-
- if (!ba) return 0;
-
- if (idx < 0 || (guint)idx >= ba->len) {
- luaL_argerror(L,2,"index out of range");
- return 0;
- }
-
- if (v < 0 || v > 255) {
- luaL_argerror(L,3,"Byte out of range");
- return 0;
- }
-
- ba->data[idx] = (guint8)v;
-
- return 0;
-}
-
-
-static int ByteArray_get_index(lua_State* L) {
- ByteArray ba = checkByteArray(L,1);
- int idx = luaL_checkint(L,2);
-
- if (!ba) return 0;
-
- if (idx < 0 || (guint)idx >= ba->len) {
- luaL_argerror(L,2,"index out of range");
- return 0;
- }
-
- lua_pushnumber(L,(lua_Number)ba->data[idx]);
-
- return 1;
-}
-
-static int ByteArray_len(lua_State* L) {
- ByteArray ba = checkByteArray(L,1);
-
- if (!ba) return 0;
-
- lua_pushnumber(L,(lua_Number)ba->len);
-
- return 1;
-}
-
-static int ByteArray_subset(lua_State* L) {
- ByteArray ba = checkByteArray(L,1);
- int offset = luaL_checkint(L,2);
- int len = luaL_checkint(L,3);
- ByteArray ret;
- guint i;
-
- if (!ba) return 0;
-
- if ((offset + len) > (int)ba->len) {
- luaL_error(L,"out of bounds");
- return 0;
- }
-
- ret = g_byte_array_sized_new(len);
-
- for ( i=0 ; i < ba->len ; i++) {
- (ret->data)[i] = (ba->data)[offset+i];
- }
-
- pushByteArray(L,ba);
- return 1;
-}
-
-static int ByteArray_tostring(lua_State* L) {
- static const gchar* byte_to_str[] = {
- "00","01","02","03","04","05","06","07","08","09","0A","0B","0C","0D","0E","0F",
- "10","11","12","13","14","15","16","17","18","19","1A","1B","1C","1D","1E","1F",
- "20","21","22","23","24","25","26","27","28","29","2A","2B","2C","2D","2E","2F",
- "30","31","32","33","34","35","36","37","38","39","3A","3B","3C","3D","3E","3F",
- "40","41","42","43","44","45","46","47","48","49","4A","4B","4C","4D","4E","4F",
- "50","51","52","53","54","55","56","57","58","59","5A","5B","5C","5D","5E","5F",
- "60","61","62","63","64","65","66","67","68","69","6A","6B","6C","6D","6E","6F",
- "70","71","72","73","74","75","76","77","78","79","7A","7B","7C","7D","7E","7F",
- "80","81","82","83","84","85","86","87","88","89","8A","8B","8C","8D","8E","8F",
- "90","91","92","93","94","95","96","97","98","99","9A","9B","9C","9D","9E","9F",
- "A0","A1","A2","A3","A4","A5","A6","A7","A8","A9","AA","AB","AC","AD","AE","AF",
- "B0","B1","B2","B3","B4","B5","B6","B7","B8","B9","BA","BB","BC","BD","BE","BF",
- "C0","C1","C2","C3","C4","C5","C6","C7","C8","C9","CA","CB","CC","CD","CE","CF",
- "D0","D1","D2","D3","D4","D5","D6","D7","D8","D9","DA","DB","DC","DD","DE","DF",
- "E0","E1","E2","E3","E4","E5","E6","E7","E8","E9","EA","EB","EC","ED","EE","EF",
- "F0","F1","F2","F3","F4","F5","F6","F7","F8","F9","FA","FB","FC","FD","FE","FF"
- };
- ByteArray ba = checkByteArray(L,1);
- int i;
- GString* s;
-
- if (!ba) return 0;
-
- s = g_string_new("ByteArray");
-
- g_string_sprintfa(s,"(%u): ",ba->len);
-
- for (i = 0; i < (int)ba->len; i++) {
- g_string_append(s,byte_to_str[(ba->data)[i]]);
- }
-
- lua_pushstring(L,s->str);
- g_string_free(s,TRUE);
-
- return 1;
-}
-
-static const luaL_reg ByteArray_methods[] = {
- {"new", ByteArray_new},
- {"get_index", ByteArray_get_index},
- {"len", ByteArray_len},
- {"preppend", ByteArray_preppend},
- {"append", ByteArray_append},
- {"subset", ByteArray_subset},
- {"set", ByteArray_set_index},
- {"set_size", ByteArray_set_size},
- {0,0}
-};
-
-static const luaL_reg ByteArray_meta[] = {
- {"__gc", ByteArray_gc},
- {"__tostring", ByteArray_tostring},
- {"__concat", ByteArray_append},
- {0, 0}
-};
-
-static int ByteArray_register(lua_State* L) {
- luaL_openlib(L, BYTE_ARRAY, ByteArray_methods, 0);
- luaL_newmetatable(L, BYTE_ARRAY);
- luaL_openlib(L, 0, ByteArray_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- return 1;
-};
-
-
-/*
- * Tvb class
- */
-
-LUA_CLASS_OPS(Tvb,TVB,if (! *p) luaL_error(L,"null tvb"));
-
-static int Tvb_new (lua_State *L) {
- ByteArray ba;
-
- if (!g_pinfo) {
- /* XXX: for now tvb should only be used in the frame that created */
- luaL_error(L,"Tvb can only be used in dissectors");
- return 0;
- }
-
- if (( luaL_checkudata(L,1,BYTE_ARRAY) )) {
- ba = toByteArray(L,1);
- const gchar* name = luaL_optstring(L,2,"Unnamed") ;
- /* XXX: what if the BA gets garbage collected? */
- Tvb tvb = tvb_new_real_data(ba->data, ba->len,ba->len);
- add_new_data_source(g_pinfo, tvb, name);
- pushTvb(L,tvb);
- return 1;
- } else {
- int len = luaL_optint(L, 3, -1);
- pushTvb(L, tvb_new_subset( checkTvb(L,1),luaL_optint(L, 2, 0),len, len) );
- return 1;
- }
-}
-
-
-
-#define TVBGET_FN(type) Tvb_get_ ## type
-
-#define DEFINE_TVBGET(type,len) static int TVBGET_FN(type) (lua_State *L) { \
- tvbuff_t* tvb = checkTvb(L,1); \
- int offset = luaL_checkint(L,2); \
- if (!tvb) return 0; \
- if (!g_pinfo) { luaL_error(L,"Tvb can only be used in dissectors"); return 0; } \
- if (tvb_offset_exists(tvb, offset+len)) { \
- lua_pushnumber(L, (lua_Number) tvb_get_ ## type(tvb,offset)); \
- return 1; \
- } else { \
- luaL_error(L,"Out Of Bounds"); \
- return 0; \
- } \
-}
-
-
-DEFINE_TVBGET(guint8,1);
-DEFINE_TVBGET(ntohs,2);
-DEFINE_TVBGET(ntoh24,3);
-DEFINE_TVBGET(ntohl,4);
-DEFINE_TVBGET(ntohieee_float,4);
-DEFINE_TVBGET(ntohieee_double,8);
-
-DEFINE_TVBGET(letohs,1);
-DEFINE_TVBGET(letoh24,2);
-DEFINE_TVBGET(letohl,3);
-DEFINE_TVBGET(letohieee_float,4);
-DEFINE_TVBGET(letohieee_double,8);
-
-static int Tvb_get_bytearray(lua_State* L) {
- Tvb tvb = checkTvb(L,1);
- int offset = 0;
- int o_len;
- int len;
- ByteArray ba;
-
- if (!tvb) return 0;
-
- o_len = tvb_length(tvb);
- len = o_len;
-
- if (!g_pinfo) {
- luaL_error(L,"Tvb can only be used in dissectors");
- return 0;
- }
-
-
- switch( lua_gettop(L) ) {
- case 3:
- offset = luaL_checkint(L,2);
- len = luaL_checkint(L,3);
- break;
- case 2:
- offset = luaL_checkint(L,2);
- len -= offset;
- break;
- case 1:
- break;
- default:
- luaL_error(L,"too many arguments");
- return 0;
- }
-
- if (len < 1 || offset+len > o_len) {
- luaL_error(L,"off bounds");
- return 0;
-
- }
-
- ba = g_byte_array_new();
- g_byte_array_append(ba,ep_tvb_memdup(tvb,offset,len),len);
-
- pushByteArray(L,ba);
-
- return 1;
-}
-
-static int Tvb_get_stringz(lua_State* L) {
- Tvb tvb = checkTvb(L,1);
-
- if (!tvb) return 0;
-
- if (!g_pinfo) {
- luaL_error(L,"Tvb can only be used in dissectors");
- return 0;
- }
-
- lua_pushstring(L,(gchar*)tvb_get_ephemeral_stringz(tvb,luaL_checkint(L,2),NULL));
- return 1;
-}
-
-static int Tvb_get_string(lua_State* L) {
- Tvb tvb = checkTvb(L,1);
-
- if (!tvb) return 0;
-
- if (!g_pinfo) {
- luaL_error(L,"Tvb can only be used in dissectors");
- return 0;
- }
-
- lua_pushstring(L,(gchar*)tvb_get_ephemeral_string(tvb,luaL_checkint(L,2),luaL_checkint(L,3)));
- return 1;
-}
-
-static int Tvb_tostring(lua_State* L) {
- Tvb tvb = checkTvb(L,1);
- int len;
-
- if (!tvb) return 0;
-
- len = tvb_length(tvb);
- gchar* str = g_strdup_printf("TVB(%i) : %s",len,tvb_bytes_to_str(tvb,0,len));
- lua_pushstring(L,str);
- return 1;
-}
-
-
-
-static int Tvb_len(lua_State* L) {
- Tvb tvb = checkTvb(L,1);
-
- if (!tvb) return 0;
-
- if (!g_pinfo) {
- luaL_error(L,"Tvb can only be used in dissectors");
- return 0;
- }
-
- lua_pushnumber(L,tvb_length(tvb));
- return 1;
-}
-
-
-static const luaL_reg Tvb_methods[] = {
- {"new", Tvb_new},
- {"get_char", TVBGET_FN(guint8)},
- {"get_ntohs", TVBGET_FN(ntohs)},
- {"get_ntoh24", TVBGET_FN(ntoh24)},
- {"get_ntohl", TVBGET_FN(ntohl)},
- {"get_ntohfloat", TVBGET_FN(ntohieee_float)},
- {"get_ntohdouble", TVBGET_FN(ntohieee_double)},
- {"get_letohs", TVBGET_FN(letohs)},
- {"get_letoh24", TVBGET_FN(letoh24)},
- {"get_letohl", TVBGET_FN(letohl)},
- {"get_letohl", TVBGET_FN(letohl)},
- {"get_letohfloat", TVBGET_FN(letohieee_float)},
- {"get_letohdouble", TVBGET_FN(letohieee_double)},
- {"get_stringz", Tvb_get_stringz },
- {"get_string", Tvb_get_string },
- {"get_bytearray",Tvb_get_bytearray},
- {"len", Tvb_len},
- {0,0}
-};
-
-static const luaL_reg Tvb_meta[] = {
- {"__gc", No_gc},
- {"__tostring", Tvb_tostring},
- {0, 0}
-};
-
-static int Tvb_register(lua_State* L) {
- luaL_openlib(L, TVB, Tvb_methods, 0);
- luaL_newmetatable(L, TVB);
- luaL_openlib(L, 0, Tvb_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- return 1;
-};
-
-/* Address class */
-
-/* Column class */
-struct col_names_t {
- const gchar* name;
- int id;
-};
-
-static const struct col_names_t colnames[] = {
- {"COL_NUMBER",COL_NUMBER},
- {"COL_CLS_TIME",COL_CLS_TIME},
- {"COL_REL_TIME",COL_REL_TIME},
- {"COL_ABS_TIME",COL_ABS_TIME},
- {"COL_ABS_DATE_TIME",COL_ABS_DATE_TIME},
- {"COL_DELTA_TIME",COL_DELTA_TIME},
- {"COL_DEF_SRC",COL_DEF_SRC},
- {"COL_RES_SRC",COL_RES_SRC},
- {"COL_UNRES_SRC",COL_UNRES_SRC},
- {"COL_DEF_DL_SRC",COL_DEF_DL_SRC},
- {"COL_RES_DL_SRC",COL_RES_DL_SRC},
- {"COL_UNRES_DL_SRC",COL_UNRES_DL_SRC},
- {"COL_DEF_NET_SRC",COL_DEF_NET_SRC},
- {"COL_RES_NET_SRC",COL_RES_NET_SRC},
- {"COL_UNRES_NET_SRC",COL_UNRES_NET_SRC},
- {"COL_DEF_DST",COL_DEF_DST},
- {"COL_RES_DST",COL_RES_DST},
- {"COL_UNRES_DST",COL_UNRES_DST},
- {"COL_DEF_DL_DST",COL_DEF_DL_DST},
- {"COL_RES_DL_DST",COL_RES_DL_DST},
- {"COL_UNRES_DL_DST",COL_UNRES_DL_DST},
- {"COL_DEF_NET_DST",COL_DEF_NET_DST},
- {"COL_RES_NET_DST",COL_RES_NET_DST},
- {"COL_UNRES_NET_DST",COL_UNRES_NET_DST},
- {"COL_DEF_SRC_PORT",COL_DEF_SRC_PORT},
- {"COL_RES_SRC_PORT",COL_RES_SRC_PORT},
- {"COL_UNRES_SRC_PORT",COL_UNRES_SRC_PORT},
- {"COL_DEF_DST_PORT",COL_DEF_DST_PORT},
- {"COL_RES_DST_PORT",COL_RES_DST_PORT},
- {"COL_UNRES_DST_PORT",COL_UNRES_DST_PORT},
- {"COL_PROTOCOL",COL_PROTOCOL},
- {"COL_INFO",COL_INFO},
- {"COL_PACKET_LENGTH",COL_PACKET_LENGTH},
- {"COL_CUMULATIVE_BYTES",COL_CUMULATIVE_BYTES},
- {"COL_OXID",COL_OXID},
- {"COL_RXID",COL_RXID},
- {"COL_IF_DIR",COL_IF_DIR},
- {"COL_CIRCUIT_ID",COL_CIRCUIT_ID},
- {"COL_SRCIDX",COL_SRCIDX},
- {"COL_DSTIDX",COL_DSTIDX},
- {"COL_VSAN",COL_VSAN},
- {"COL_TX_RATE",COL_TX_RATE},
- {"COL_RSSI",COL_RSSI},
- {"COL_HPUX_SUBSYS",COL_HPUX_SUBSYS},
- {"COL_HPUX_DEVID",COL_HPUX_DEVID},
- {"COL_DCE_CALL",COL_DCE_CALL},
- {NULL,0}
-};
-
-#if 0
-static gint col_name_to_id(const gchar* name) {
- const struct col_names_t* cn;
- for(cn = colnames; cn->name; cn++) {
- if (g_str_equal(cn->name,name)) {
- return cn->id;
- }
- }
-
- return 0;
-}
-#endif
-
-static const gchar* col_id_to_name(gint id) {
- const struct col_names_t* cn;
- for(cn = colnames; cn->name; cn++) {
- if ( cn->id == id ) {
- return cn->name;
- }
- }
- return NULL;
-}
-
-LUA_CLASS_OPS(Column,COLUMN,if (! *p) luaL_error(L,"null column"));
-
-static int Column_tostring(lua_State *L) {
- Column c = checkColumn(L,1);
- const gchar* name;
-
- if (!c) return 0;
-
- name = col_id_to_name(c->col);
-
- lua_pushstring(L,name ? name : "Unknown Column");
- return 1;
-}
-
-static int Column_clear(lua_State *L) {
- Column c = checkColumn(L,1);
-
- if (!c) return 0;
-
- if (check_col(c->cinfo, c->col))
- col_clear(c->cinfo, c->col);
-
- return 0;
-}
-
-static int Column_set(lua_State *L) {
- Column c = checkColumn(L,1);
- const gchar* s = luaL_checkstring(L,2);
-
- if (!c) return 0;
-
- if (check_col(c->cinfo, c->col))
- col_set_str(c->cinfo, c->col, s);
-
- return 0;
-}
-
-static int Column_append(lua_State *L) {
- Column c = checkColumn(L,1);
- const gchar* s = luaL_checkstring(L,2);
-
- if (!(c && s)) return 0;
-
- if (check_col(c->cinfo, c->col))
- col_append_str(c->cinfo, c->col, s);
-
- return 0;
-}
-static int Column_preppend(lua_State *L) {
- Column c = checkColumn(L,1);
- const gchar* s = luaL_checkstring(L,2);
-
- if (!(c && s)) return 0;
-
- if (check_col(c->cinfo, c->col))
- col_prepend_fstr(c->cinfo, c->col, "%s",s);
-
- return 0;
-}
-
-static int Column_gc(lua_State *L) {
- Column c = checkColumn(L,1);
- if (!c) return 0;
- g_free(c);
- return 0;
-}
-
-static const luaL_reg Column_methods[] = {
- {"clear", Column_clear },
- {"set", Column_set },
- {"append", Column_append },
- {"preppend", Column_preppend },
- {0,0}
-};
-
-
-static const luaL_reg Column_meta[] = {
- {"__gc", Column_gc },
- {"__tostring", Column_tostring },
- {0,0}
-};
-
-
-static int Column_register(lua_State *L) {
- const struct col_names_t* cn;
-
- luaL_openlib(L, COLUMN, Column_methods, 0);
- luaL_newmetatable(L, COLUMN);
- luaL_openlib(L, 0, Column_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- for(cn = colnames; cn->name; cn++) {
- lua_pushstring(L, cn->name);
- lua_pushnumber(L,(lua_Number)cn->id);
- lua_settable(L, LUA_GLOBALSINDEX);
- }
-
- return 1;
-}
-
-/* Pinfo class */
-LUA_CLASS_OPS(Pinfo,PINFO,if (! *p) luaL_error(L,"null pinfo"));
-static int Pinfo_tostring(lua_State *L) { lua_pushstring(L,"a Pinfo"); return 1; }
-
-#define PINFO_GET_NUMBER(name,val) static int name(lua_State *L) { \
- Pinfo pinfo = checkPinfo(L,1); \
- if (!pinfo) return 0;\
- lua_pushnumber(L,(lua_Number)(val));\
- return 1;\
-}
-
-#define PINFO_GET_STRING(name,val) static int name(lua_State *L) { \
- Pinfo pinfo = checkPinfo(L,1); \
- if (!pinfo) return 0; \
- if (val) lua_pushstring(L,(const char*)(val)); else lua_pushnil(L); \
- return 1; \
-}
-
-PINFO_GET_NUMBER(Pinfo_number,pinfo->fd->num);
-PINFO_GET_NUMBER(Pinfo_len,pinfo->fd->pkt_len);
-PINFO_GET_NUMBER(Pinfo_caplen,pinfo->fd->cap_len);
-PINFO_GET_NUMBER(Pinfo_abs_ts,(((double)pinfo->fd->abs_ts.secs) + (((double)pinfo->fd->abs_ts.nsecs) / 1000000000.0) ));
-PINFO_GET_NUMBER(Pinfo_rel_ts,(((double)pinfo->fd->rel_ts.secs) + (((double)pinfo->fd->rel_ts.nsecs) / 1000000000.0) ));
-PINFO_GET_NUMBER(Pinfo_delta_ts,(((double)pinfo->fd->del_ts.secs) + (((double)pinfo->fd->del_ts.nsecs) / 1000000000.0) ));
-PINFO_GET_NUMBER(Pinfo_visited,pinfo->fd->flags.visited);
-PINFO_GET_NUMBER(Pinfo_ipproto,pinfo->ipproto);
-PINFO_GET_NUMBER(Pinfo_circuit_id,pinfo->circuit_id);
-PINFO_GET_NUMBER(Pinfo_ptype,pinfo->ptype);
-PINFO_GET_NUMBER(Pinfo_match_port,pinfo->match_port);
-
-
-PINFO_GET_STRING(Pinfo_src,address_to_str(&(pinfo->src)));
-PINFO_GET_STRING(Pinfo_dst,address_to_str(&(pinfo->dst)));
-PINFO_GET_STRING(Pinfo_net_src,address_to_str(&(pinfo->net_src)));
-PINFO_GET_STRING(Pinfo_net_dst,address_to_str(&(pinfo->net_dst)));
-PINFO_GET_STRING(Pinfo_dl_src,address_to_str(&(pinfo->dl_src)));
-PINFO_GET_STRING(Pinfo_dl_dst,address_to_str(&(pinfo->dl_dst)));
-PINFO_GET_STRING(Pinfo_match_string,pinfo->match_string);
-PINFO_GET_STRING(Pinfo_curr_proto,pinfo->current_proto);
-
-static int Pinfo_column(lua_State *L) {
- Pinfo pinfo = checkPinfo(L,1);
- Column c;
-
- if (!pinfo) return 0;
-
- c = g_malloc(sizeof(*c));
-
- c->cinfo = pinfo->cinfo;
- c->col = luaL_checkint(L,2);
-
- pushColumn(L,c);
- return 1;
-}
-
-static const luaL_reg Pinfo_methods[] = {
- {"number", Pinfo_number },
- {"len", Pinfo_len },
- {"caplen", Pinfo_caplen },
- {"abs_ts",Pinfo_abs_ts },
- {"rel_ts",Pinfo_rel_ts },
- {"delta_ts",Pinfo_delta_ts },
- {"visited",Pinfo_visited },
- {"src_address", Pinfo_src },
- {"dst_address", Pinfo_dst },
- {"dl_src", Pinfo_dl_src },
- {"dl_dst", Pinfo_dl_dst },
- {"net_src", Pinfo_net_src },
- {"net_dst", Pinfo_net_dst },
- {"ipproto", Pinfo_ipproto },
- {"circuit_id", Pinfo_circuit_id },
- {"ptype", Pinfo_ptype },
- {"match_port", Pinfo_match_port },
- {"match_string", Pinfo_match_string },
- {"curr_proto", Pinfo_curr_proto },
- {"col", Pinfo_column },
- {0,0}
-};
-
-static const luaL_reg Pinfo_meta[] = {
- {"__gc", No_gc},
- {"__tostring", Pinfo_tostring},
- {0, 0}
-};
-
-static int Pinfo_register(lua_State* L) {
- luaL_openlib(L, PINFO, Pinfo_methods, 0);
- luaL_newmetatable(L, PINFO);
- luaL_openlib(L, 0, Pinfo_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- return 1;
-};
-
-/* Tree class */
-LUA_CLASS_OPS(Tree,TREE,NOP);
-LUA_CLASS_OPS(Item,ITEM,NOP);
-
-static int Tree_add_item_any(lua_State *L, gboolean little_endian) {
- /*
- called with:
- tree,field,tvb,offset,len,datum
- tree,field,tvb,offset,len
- tree,tvb,offset,len,text
- tree,tvb,text
- */
- Tree tree = checkTree(L,1);
- ProtoField field;
- Item item;
- Tvb tvb;
- int offset;
- int len;
-
- if (!tree) {
- pushItem(L,NULL);
- return 1;
- }
-
- if (( luaL_checkudata (L, 2, TVB) )) {
- tvb = checkTvb(L,2);
- const char* str;
-
- if (lua_isnumber(L,3)) {
- offset = luaL_checkint(L,3);
- len = luaL_checkint(L,4);
- str = lua_tostring(L,5);
- } else if (lua_isstring(L,3)) {
- offset = 0;
- len = 0;
- str = lua_tostring(L,3);
- } else {
- luaL_error(L,"First arg must be either TVB or ProtoField");
- return 0;
- }
-
- item = proto_tree_add_text(tree,tvb,offset,len,"%s",str);
-
- } else if (( luaL_checkudata (L, 2, PROTO_FIELD) )) {
- field = checkProtoField(L,2);
- tvb = checkTvb(L,3);
- offset = luaL_checkint(L,4);
- len = luaL_checkint(L,5);
-
- if ( lua_gettop(L) == 6 ) {
- switch(field->type) {
- case FT_UINT8:
- case FT_UINT16:
- case FT_UINT24:
- case FT_UINT32:
- case FT_FRAMENUM:
- item = proto_tree_add_uint(tree,field->hfid,tvb,offset,len,(guint32)luaL_checknumber(L,6));
- break;
- case FT_INT8:
- case FT_INT16:
- case FT_INT24:
- case FT_INT32:
- item = proto_tree_add_int(tree,field->hfid,tvb,offset,len,(gint32)luaL_checknumber(L,6));
- break;
- case FT_FLOAT:
- item = proto_tree_add_float(tree,field->hfid,tvb,offset,len,(float)luaL_checknumber(L,6));
- break;
- case FT_DOUBLE:
- item = proto_tree_add_double(tree,field->hfid,tvb,offset,len,(double)luaL_checknumber(L,6));
- break;
- case FT_STRING:
- case FT_STRINGZ:
- item = proto_tree_add_string(tree,field->hfid,tvb,offset,len,luaL_checkstring(L,6));
- break;
- case FT_UINT64:
- case FT_INT64:
- case FT_ETHER:
- case FT_BYTES:
- case FT_UINT_BYTES:
- case FT_IPv4:
- case FT_IPv6:
- case FT_IPXNET:
- case FT_GUID:
- case FT_OID:
- default:
- luaL_error(L,"FT_ not yet supported");
- return 0;
- }
- } else {
- item = proto_tree_add_item(tree,field->hfid,tvb,offset,len,little_endian);
- }
- } else {
- luaL_error(L,"First arg must be either TVB or ProtoField");
- return 0;
- }
-
- pushItem(L,item);
- return 1;
-}
-
-static int Tree_add_item(lua_State *L) { return Tree_add_item_any(L,FALSE); }
-static int Tree_add_item_le(lua_State *L) { return Tree_add_item_any(L,TRUE); }
-
-static int Tree_tostring(lua_State *L) {
- Tree tree = checkTree(L,1);
- lua_pushstring(L,ep_strdup_printf("Tree %p",tree));
- return 1;
-}
-
-
-static int Tree_get_parent(lua_State *L) {
- Tree tree = checkTree(L,1);
- proto_item* item = NULL;
-
- if (tree) {
- item = proto_tree_get_parent(tree);
- }
-
- pushItem(L,item);
-
- return 1;
-}
-
-static const luaL_reg Tree_methods[] = {
- {"add_item", Tree_add_item},
- {"add_item_le", Tree_add_item_le},
- {"get_parent", Tree_get_parent},
- {0, 0}
-};
-
-static const luaL_reg Tree_meta[] = {
- {"__gc", No_gc},
- {"__tostring", Tree_tostring},
- {0, 0}
-};
-
-static int Tree_register(lua_State* L) {
- luaL_openlib(L, TREE, Tree_methods, 0);
- luaL_newmetatable(L, TREE);
- luaL_openlib(L, 0, Tree_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- return 1;
-}
-
-/* Item class */
-static int Item_tostring(lua_State *L) {
- Item item = checkItem(L,1);
- lua_pushstring(L,ep_strdup_printf("Item %p",item));
- return 1;
-}
-
-static int Item_add_subtree(lua_State *L) {
- Item item = checkItem(L,1);
- Ett ett;
- Tree tree = NULL;
-
- if (item) {
- ett = checkEtt(L,2);
-
- if (ett && *ett >= 0) {
- tree = proto_item_add_subtree(item,*ett);
- } else {
- luaL_argerror(L,2,"bad ett");
- }
- }
-
- pushTree(L,tree);
- return 1;
-}
-
-static int Item_set_text(lua_State *L) {
- Item item = checkItem(L,1);
-
- if (!item) {
- const gchar* s = luaL_checkstring(L,2);
- proto_item_set_text(item,"%s",s);
- }
-
- return 0;
-}
-
-static int Item_append_text(lua_State *L) {
- Item item = checkItem(L,1);
- const gchar* s;
-
- if (item) {
- s = luaL_checkstring(L,2);
- proto_item_append_text(item,"%s",s);
- }
- return 0;
-}
-
-static int Item_set_len(lua_State *L) {
- Item item = checkItem(L,1);
- int len;
-
- if (item) {
- len = luaL_checkint(L,2);
- proto_item_set_len(item,len);
- }
-
- return 0;
-}
-
-struct _expert_severity {
- const gchar* str;
- int val;
-};
-
-static const struct _expert_severity severities[] = {
- {"PI_CHAT",PI_CHAT},
- {"PI_NOTE",PI_NOTE},
- {"PI_WARN",PI_WARN},
- {"PI_ERROR",PI_ERROR},
- {"PI_CHECKSUM",PI_CHECKSUM},
- {"PI_SEQUENCE",PI_SEQUENCE},
- {"PI_RESPONSE_CODE",PI_RESPONSE_CODE},
- {"PI_UNDECODED",PI_UNDECODED},
- {"PI_REASSEMBLE",PI_REASSEMBLE},
- {"PI_MALFORMED",PI_MALFORMED},
- {"PI_DEBUG",PI_DEBUG},
- {NULL,0}
-};
-
-static int str_to_expert(const gchar* str) {
- const struct _expert_severity* s;
-
- if (!str) return 0;
-
- for(s = severities; s->str; s++) {
- if (g_str_equal(str,s->str)) {
- return s->val;
- }
- }
- return 0;
-}
-
-#if 0
-static const gchar* expert_to_str(int val) {
- const struct _expert_severity* s;
- for(s = severities; s->str; s++) {
- if (s->val == val) {
- return s->str;
- }
- }
- return NULL;
-}
-#endif
-
-static int Item_set_expert_flags(lua_State *L) {
- Item item = checkItem(L,1);
- int group;
- int severity;
-
- if (item) {
- group = str_to_expert(luaL_checkstring(L,2));
- severity = str_to_expert(luaL_checkstring(L,3));
-
- if (group && severity) {
- proto_item_set_expert_flags(item,group,severity);
- }
- }
-
- return 0;
-}
-
-
-static int Item_set_generated(lua_State *L) {
- Item item = checkItem(L,1);
- if (item) {
- PROTO_ITEM_SET_GENERATED(item);
- }
- return 0;
-}
-
-
-static int Item_set_hidden(lua_State *L) {
- Item item = checkItem(L,1);
- if (item) {
- PROTO_ITEM_SET_HIDDEN(item);
- }
- return 0;
-}
-
-static const luaL_reg Item_methods[] = {
- {"add_subtree", Item_add_subtree},
- {"set_text", Item_set_text},
- {"append_text", Item_append_text},
- {"set_len", Item_set_len},
- {"set_expert_flags", Item_set_expert_flags},
- {"set_generated", Item_set_generated},
- {"set_hidden", Item_set_hidden},
- {0, 0}
-};
-
-static const luaL_reg Item_meta[] = {
- {"__gc", No_gc},
- {"__tostring", Item_tostring},
- {0, 0}
-};
-
-
-
-static int Item_register(lua_State *L) {
- const struct _expert_severity* s;
-
- luaL_openlib(L, ITEM, Item_methods, 0);
- luaL_newmetatable(L, ITEM);
- luaL_openlib(L, 0, Item_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- for(s = severities; s->str; s++) {
- lua_pushstring(L, s->str);
- lua_pushstring(L, s->str);
- lua_settable(L, LUA_GLOBALSINDEX);
- }
-
- return 1;
-}
-
-
-/*
- * Dissector class
- */
-LUA_CLASS_OPS(Dissector,DISSECTOR,NOP);
-
-static int Dissector_get (lua_State *L) {
- const gchar* name = luaL_checkstring(L,1);
- Dissector d;
-
- if (!name) {
- return 0;
- }
-
- if ((d = find_dissector(name))) {
- pushDissector(L, d);
- return 1;
- } else {
- luaL_argerror(L,1,"No such dissector");
- return 0;
- }
-
-}
-
-static int Dissector_call(lua_State* L) {
- Dissector d = checkDissector(L,1);
- Tvb tvb = checkTvb(L,2);
- Pinfo pinfo = checkPinfo(L,3);
- Tree tree = checkTree(L,4);
-
- if (!d) return 0;
- if (!tvb) return 0;
- if (!pinfo) return 0;
-
- call_dissector(d, tvb, pinfo, tree);
- return 0;
-}
-
-
-static int Dissector_tostring(lua_State* L) {
- Dissector d = checkDissector(L,1);
- if (!d) return 0;
- lua_pushstring(L,dissector_handle_get_short_name(d));
- return 1;
-}
-
-
-static const luaL_reg Dissector_methods[] = {
- {"get", Dissector_get },
- {"call", Dissector_call },
- {0,0}
-};
-
-static const luaL_reg Dissector_meta[] = {
- {"__gc", No_gc},
- {"__tostring", Dissector_tostring},
- {0, 0}
-};
-
-static int Dissector_register(lua_State* L) {
- luaL_openlib(L, DISSECTOR, Dissector_methods, 0);
- luaL_newmetatable(L, DISSECTOR);
- luaL_openlib(L, 0, Dissector_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- return 1;
-};
-
-
-
-
-
-
-/*
- * DissectorTable class
- */
-LUA_CLASS_OPS(DissectorTable,DISSECTOR_TABLE,NOP);
-
-static int DissectorTable_new (lua_State *L) {
- gchar* name = (void*)luaL_checkstring(L,1);
- gchar* ui_name = (void*)luaL_optstring(L,2,name);
- const gchar* ftstr = luaL_optstring(L,3,"FT_UINT32");
- enum ftenum type;
- base_display_e base = luaL_optint(L,3,BASE_DEC);
-
- if(!(name && ui_name && ftstr)) return 0;
-
- name = g_strdup(name);
- ui_name = g_strdup(ui_name);
- type = get_ftenum(ftstr);
-
- switch(type) {
- case FT_STRING:
- base = BASE_NONE;
- case FT_UINT32:
- {
- DissectorTable dt = g_malloc(sizeof(struct _eth_distbl_t));
-
- dt->table = register_dissector_table(name, ui_name, type, base);
- dt->name = name;
- pushDissectorTable(L, dt);
- }
- return 1;
- default:
- luaL_argerror(L,3,"Invalid ft_type");
- return 0;
- }
-
-}
-
-static int DissectorTable_get (lua_State *L) {
- const gchar* name = luaL_checkstring(L,1);
- dissector_table_t table;
-
- if(!name) return 0;
-
- table = find_dissector_table(name);
-
- if (table) {
- DissectorTable dt = g_malloc(sizeof(struct _eth_distbl_t));
- dt->table = table;
- dt->name = g_strdup(name);
-
- pushDissectorTable(L, dt);
-
- return 1;
- } else {
- luaL_error(L,"No such dissector_table");
- return 0;
- }
-
-}
-
-
-static int DissectorTable_add (lua_State *L) {
- DissectorTable dt = checkDissectorTable(L,1);
- Proto p = checkProto(L,3);
- ftenum_t type;
-
- if (!(dt && p)) return 0;
-
- type = get_dissector_table_selector_type(dt->name);
-
- if (type == FT_STRING) {
- gchar* pattern = g_strdup(luaL_checkstring(L,2));
- dissector_add_string(dt->name, pattern,p->handle);
- } else if ( type == FT_UINT32 ) {
- int port = luaL_checkint(L, 2);
- dissector_add(dt->name, port, p->handle);
- }
-
- return 0;
-}
-
-
-static int DissectorTable_try (lua_State *L) {
- DissectorTable dt = checkDissectorTable(L,1);
- Tvb tvb = checkTvb(L,3);
- Pinfo pinfo = checkPinfo(L,4);
- Tree tree = checkTree(L,5);
- ftenum_t type;
-
- if (! (dt && tvb && pinfo && tree) ) return 0;
-
- type = get_dissector_table_selector_type(dt->name);
-
- if (type == FT_STRING) {
- const gchar* pattern = luaL_checkstring(L,2);
-
- if (!pattern) return 0;
-
- if (dissector_try_string(dt->table,pattern,tvb,pinfo,tree))
- return 0;
- } else if ( type == FT_UINT32 ) {
- int port = luaL_checkint(L, 2);
- if (dissector_try_port(dt->table,port,tvb,pinfo,tree))
- return 0;
- } else {
- luaL_error(L,"No such type of dissector_table");
- }
-
- call_dissector(data_handle,tvb,pinfo,tree);
- return 0;
-}
-
-static int DissectorTable_get_dissector (lua_State *L) {
- DissectorTable dt = checkDissectorTable(L,1);
- ftenum_t type;
- dissector_handle_t handle = data_handle;
-
- if (!dt) return 0;
-
- type = get_dissector_table_selector_type(dt->name);
-
- if (type == FT_STRING) {
- const gchar* pattern = luaL_checkstring(L,2);
- handle = dissector_get_string_handle(dt->table,pattern);
- } else if ( type == FT_UINT32 ) {
- int port = luaL_checkint(L, 2);
- handle = dissector_get_port_handle(dt->table,port);
- }
-
- pushDissector(L,handle);
-
- return 1;
-
-}
-
-
-static int DissectorTable_tostring(lua_State* L) {
- DissectorTable dt = checkDissectorTable(L,1);
- GString* s;
- ftenum_t type;
-
- if (!dt) return 0;
-
- type = get_dissector_table_selector_type(dt->name);
- s = g_string_new("DissectorTable ");
-
- switch(type) {
- case FT_STRING:
- {
- g_string_sprintfa(s,"%s String:\n",dt->name);
- break;
- }
- case FT_UINT32:
- {
- int base = get_dissector_table_base(dt->name);
- g_string_sprintfa(s,"%s Integer(%i):\n",dt->name,base);
- break;
- }
- default:
- luaL_error(L,"Strange table type");
- }
-
- lua_pushstring(L,s->str);
- g_string_free(s,TRUE);
- return 1;
-}
-
-static const luaL_reg DissectorTable_methods[] = {
- {"new", DissectorTable_new},
- {"get", DissectorTable_get},
- {"add", DissectorTable_add },
- {"try", DissectorTable_try },
- {"get_dissector", DissectorTable_get_dissector },
- {0,0}
-};
-
-static const luaL_reg DissectorTable_meta[] = {
- {"__gc", No_gc},
- {"__tostring", DissectorTable_tostring},
- {0, 0}
-};
-
-static int DissectorTable_register(lua_State* L) {
- luaL_openlib(L, DISSECTOR_TABLE, DissectorTable_methods, 0);
- luaL_newmetatable(L, DISSECTOR_TABLE);
- luaL_openlib(L, 0, DissectorTable_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- return 1;
-};
-
-
-
-
-LUA_CLASS_OPS(Interesting,INTERESTING,NOP);
-
-static int Interesting_get (lua_State *L) {
- const gchar* name = luaL_checkstring(L,1);
- Interesting i;
-
- if (!name) return 0;
-
- i = proto_registrar_get_byname(name);
-
- if (!i) {
- luaL_error(L,"Could not find field `%s'",name);
- return 0;
- }
-
- pushInteresting(L,i);
- return 1;
-}
-
-static int Interesting_fetch (lua_State* L) {
- Interesting in = checkInteresting(L,1);
- int items_found = 0;
-
- for (;in;in = in->same_name_next) {
- GPtrArray* found = proto_find_finfo(g_tree, in->id);
- guint i;
-
- for (i=0; i<found->len; i++) {
- field_info* fi = g_ptr_array_index(found,i);
- switch(fi->hfinfo->type) {
- case FT_UINT8:
- case FT_UINT16:
- case FT_UINT24:
- case FT_UINT32:
- case FT_FRAMENUM:
- case FT_INT8:
- case FT_INT16:
- case FT_INT24:
- case FT_INT32:
- lua_pushnumber(L,(lua_Number)fvalue_get_integer(&(fi->value)));
- items_found++;
- break;
- case FT_FLOAT:
- case FT_DOUBLE:
- lua_pushnumber(L,(lua_Number)fvalue_get_floating(&(fi->value)));
- items_found++;
- break;
- case FT_UINT64:
- case FT_INT64:
- /* XXX: get them as strings for now */
- case FT_STRING:
- case FT_STRINGZ:
- case FT_ETHER:
- case FT_BYTES:
- case FT_UINT_BYTES:
- case FT_IPv4:
- case FT_IPv6:
- case FT_IPXNET:
- case FT_GUID:
- case FT_OID:
- lua_pushstring(L,fvalue_to_string_repr(&fi->value,FTREPR_DISPLAY,NULL));
- items_found++;
- break;
- default:
- luaL_error(L,"FT_ not yet supported");
- return items_found;
- }
- }
- }
-
- return items_found;
-
-}
-
-static int Interesting_tostring (lua_State* L) {
- Interesting in = checkInteresting(L,1);
-
- lua_pushfstring(L,"Interesting: %s",in->abbrev);
- return 1;
-}
-
-static const luaL_reg Interesting_methods[] = {
- {"get", Interesting_get},
- {"fetch", Interesting_fetch },
- {0,0}
-};
-
-static const luaL_reg Interesting_meta[] = {
- {"__gc", No_gc},
- {"__tostring", Interesting_tostring},
- {0, 0}
-};
-
-static int Interesting_register(lua_State* L) {
- luaL_openlib(L, INTERESTING, Interesting_methods, 0);
- luaL_newmetatable(L, INTERESTING);
- luaL_openlib(L, 0, Interesting_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- return 1;
-};
-
-LUA_CLASS_OPS(Tap,TAP,NOP);
-
-static int Tap_new(lua_State* L) {
- const gchar* name = luaL_checkstring(L,1);
- Tap tap;
-
- if (!tap) return 0;
-
- tap = g_malloc(sizeof(struct _eth_tap));
-
- tap->name = g_strdup(name);
- tap->interesting_fields = g_ptr_array_new();
- tap->filter = NULL;
-
- pushTap(L,tap);
- return 1;
-}
-
-static int Tap_add(lua_State* L) {
- Tap tap = checkTap(L,1);
- Interesting in = checkInteresting(L,2);
-
- if (!(tap && in)) return 0;
-
- g_ptr_array_add(tap->interesting_fields,in);
-
- return 0;
-}
-
-static int Tap_tostring(lua_State* L) {
- Tap tap = checkTap(L,1);
- gchar* str;
-
- if (!tap) return 0;
-
- str = g_strdup_printf("Tap->%s filter: %s",tap->name, tap->filter ? tap->filter : "NONE");
- lua_pushstring(L,str);
- g_free(str);
-
- return 1;
-}
+#include "packet-lua.h"
+static lua_State* L = NULL;
-static int Tap_set_filter(lua_State* L) {
- Tap tap = checkTap(L,1);
- const gchar* filter = luaL_checkstring(L,2);
-
- if (!(tap && filter)) return 0;
-
- if (tap->filter) {
- luaL_error(L,"tap has filter already");
- return 0;
- }
- tap->filter = g_strdup(filter);
-
- return 0;
-}
+/* ethereal uses lua */
-static int lua_tap_packet(void *tapdata, packet_info *pinfo, epan_dissect_t *edt, const void *data _U_) {
+extern int lua_tap_packet(void *tapdata, packet_info *pinfo, epan_dissect_t *edt, const void *data _U_) {
Tap tap = tapdata;
lua_pushstring(L, "_ethereal_pinfo");
pushPinfo(L, pinfo);
lua_settable(L, LUA_GLOBALSINDEX);
- g_tree = edt->tree;
+ lua_tree = edt->tree;
lua_dostring(L,ep_strdup_printf("taps.%s(_ethereal_pinfo);",tap->name));
+
+ return 1;
}
-static void lua_tap_reset(void *tapdata) {
+void lua_tap_reset(void *tapdata) {
Tap tap = tapdata;
lua_dostring(L,ep_strdup_printf("tap_resets.%s();",tap->name));
}
-static void lua_tap_draw(void *tapdata) {
+void lua_tap_draw(void *tapdata) {
Tap tap = tapdata;
lua_dostring(L,ep_strdup_printf("tap_draws.%s();",tap->name));
}
-static int Tap_register_to_ethereal(lua_State*L) {
- Tap tap = checkTap(L,1);
- GString* filter_s;
- GString* error;
- GPtrArray* ins;
- guint i;
-
- if (!tap) return 0;
-
- if (tap->registered) {
- luaL_error(L,"tap already registered");
- return 0;
- }
-
- tap->registered = TRUE;
-
- filter_s = g_string_new("");
- g_string_sprintfa(filter_s,"( %s ) && frame ",tap->filter);
- g_free(tap->filter);
-
- ins = tap->interesting_fields;
-
- for (i=0; i < ins->len; i++) {
- Interesting in = g_ptr_array_index(ins,i);
- g_string_sprintfa(filter_s," ||%s",in->abbrev);
- }
-
- tap->filter = filter_s->str;
- g_string_free(filter_s,FALSE);
-
- error = register_tap_listener(tap->name, tap, tap->filter, lua_tap_reset, lua_tap_packet, lua_tap_draw);
-
- if (error) {
- luaL_error(L,"tap registration error: %s",error);
- g_string_free(error,TRUE);
- }
-
- return 0;
-}
-
-static const luaL_reg Tap_methods[] = {
- {"new", Tap_new},
- {"add", Tap_add},
- {"set_filter", Tap_set_filter},
- {"register", Tap_register_to_ethereal},
- {0,0}
-};
-
-static const luaL_reg Tap_meta[] = {
- {"__gc", No_gc},
- {"__tostring", Tap_tostring},
- {0, 0}
-};
-
-static int Tap_register(lua_State* L) {
- luaL_openlib(L, TAP, Tap_methods, 0);
- luaL_newmetatable(L, TAP);
- luaL_openlib(L, 0, Tap_meta, 0);
- lua_pushliteral(L, "__index");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pushliteral(L, "__metatable");
- lua_pushvalue(L, -3);
- lua_rawset(L, -3);
- lua_pop(L, 1);
-
- return 1;
-};
-
-/* ethereal uses lua */
-
-static void dissect_lua(tvbuff_t* tvb, packet_info* pinfo, proto_tree* tree) {
+void dissect_lua(tvbuff_t* tvb, packet_info* pinfo, proto_tree* tree) {
lua_pushstring(L, "_ethereal_tvb");
pushTvb(L, tvb);
lua_settable(L, LUA_GLOBALSINDEX);
pushTree(L, tree);
lua_settable(L, LUA_GLOBALSINDEX);
- g_pinfo = pinfo;
+ lua_pinfo = pinfo;
lua_dostring(L,ep_strdup_printf("dissectors.%s(_ethereal_tvb,_ethereal_pinfo,_ethereal_tree);",pinfo->current_proto));
- g_pinfo = NULL;
+ lua_pinfo = NULL;
}
static void init_lua(void) {
}
void proto_reg_handoff_lua(void) {
- data_handle = find_dissector("data");
+ lua_data_handle = find_dissector("data");
if (L)
lua_dostring(L, "for k in handoff_routines do handoff_routines[k]() end ;");
toDissectorTable(L,1);
toInteresting(L,1);
toTap(L,1);
+ toColumns(L,1);
}
void proto_register_lua(void)
Dissector_register(L);
DissectorTable_register(L);
Interesting_register(L);
+ Columns_register(L);
Tap_register(L);
lua_pushstring(L, "handoff_routines");
lua_newtable (L);
fclose(file);
+ lua_data_handle = NULL;
+ lua_pinfo = NULL;
+ lua_tree = NULL;
+
}
--- /dev/null
+
+#ifndef _PACKET_LUA_H
+#define _PACKET_LUA_H
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include <glib.h>
+#include <errno.h>
+#include <lua.h>
+#include <lualib.h>
+#include <lauxlib.h>
+#include <epan/packet.h>
+#include <epan/strutil.h>
+#include <epan/prefs.h>
+#include <epan/proto.h>
+#include <epan/epan_dissect.h>
+#include <epan/tap.h>
+#include <epan/filesystem.h>
+#include <epan/report_err.h>
+#include <epan/emem.h>
+
+typedef struct _eth_field_t {
+ int hfid;
+ char* name;
+ char* abbr;
+ char* blob;
+ enum ftenum type;
+ base_display_e base;
+ value_string* vs;
+ guint32 mask;
+} eth_field_t;
+
+typedef enum {PREF_BOOL,PREF_UINT,PREF_STRING} pref_type_t;
+
+typedef struct _eth_pref_t {
+ gchar* name;
+ pref_type_t type;
+ union {
+ gboolean b;
+ guint32 u;
+ gint32 i;
+ const gchar* s;
+ } value;
+ struct _eth_pref_t* next;
+} eth_pref_t;
+
+typedef struct _eth_proto_t {
+ int hfid;
+ char* name;
+ char* filter;
+ char* desc;
+ hf_register_info* hfarray;
+ gboolean hf_registered;
+ module_t *prefs_module;
+ eth_pref_t* prefs;
+ dissector_handle_t handle;
+ gboolean is_postdissector;
+} eth_proto_t;
+
+typedef struct {const gchar* str; enum ftenum id; } eth_ft_types_t;
+
+
+#define VALUE_STRING "ValueString"
+typedef GArray* ValueString;
+
+#define PROTO_FIELD "ProtoField"
+typedef struct _eth_field_t* ProtoField;
+
+#define PROTO_FIELD_ARRAY "ProtoFieldArr"
+typedef GArray* ProtoFieldArray;
+
+#define ETT "SubTreeType"
+typedef int* Ett;
+
+#define ETT_ARRAY "SubTreeTypeArr"
+typedef GArray* EttArray;
+
+#define PROTO "Proto"
+typedef struct _eth_proto_t* Proto;
+
+#define DISSECTOR_TABLE "DissectorTable"
+typedef struct _eth_distbl_t {
+ dissector_table_t table;
+ gchar* name;
+}* DissectorTable;
+
+#define DISSECTOR "Dissector"
+typedef dissector_handle_t Dissector;
+
+#define BYTE_ARRAY "ByteArray"
+typedef GByteArray* ByteArray;
+
+#define TVB "Tvb"
+typedef tvbuff_t* Tvb;
+
+#define COLUMN "Column"
+typedef struct _eth_col_info {
+ column_info* cinfo;
+ gint col;
+}* Column;
+
+#define COLUMNS "Columns"
+typedef column_info* Columns;
+
+#define PINFO "Pinfo"
+typedef packet_info* Pinfo;
+
+#define TREE "Tree"
+typedef proto_tree* Tree;
+
+#define ITEM "Item"
+typedef proto_item* Item;
+
+#define ADDRESS "Address"
+typedef address* Address;
+
+#define INTERESTING "Interesting"
+typedef header_field_info* Interesting;
+
+#define TAP "Tap"
+typedef struct _eth_tap {
+ const gchar* name;
+ GPtrArray* interesting_fields;
+ gchar* filter;
+ gboolean registered;
+}* Tap;
+
+#define NOP
+
+#define LUA_CLASS_DEFINE(C,CN,check_code) \
+C to##C(lua_State* L, int index) { \
+ C* v = (C*)lua_touserdata (L, index); \
+ if (!v) luaL_typerror(L,index,CN); \
+ return *v; \
+} \
+C check##C(lua_State* L, int index) { \
+ C* p; \
+ luaL_checktype(L,index,LUA_TUSERDATA); \
+ p = (C*)luaL_checkudata(L, index, CN); \
+ check_code; \
+ return *p; \
+} \
+C* push##C(lua_State* L, C v) { \
+ C* p = lua_newuserdata(L,sizeof(C)); *p = v; \
+ luaL_getmetatable(L, CN); lua_setmetatable(L, -2); \
+ return p; \
+}
+
+extern packet_info* lua_pinfo;
+extern proto_tree* lua_tree;
+extern dissector_handle_t lua_data_handle;
+
+#define LUA_CLASS_DECLARE(C,CN) \
+extern C to##C(lua_State* L, int index); \
+extern C check##C(lua_State* L, int index); \
+extern C* push##C(lua_State* L, C v); \
+extern int C##_register(lua_State* L);
+
+LUA_CLASS_DECLARE(Tap,TAP);
+LUA_CLASS_DECLARE(Interesting,INTERESTING);
+LUA_CLASS_DECLARE(ValueString,VALUE_STRING);
+LUA_CLASS_DECLARE(ProtoField,PROTO_FIELD);
+LUA_CLASS_DECLARE(ProtoFieldArray,PROTO_FIELD_ARRAY);
+LUA_CLASS_DECLARE(Ett,ETT);
+LUA_CLASS_DECLARE(EttArray,ETT_ARRAY);
+LUA_CLASS_DECLARE(Proto,PROTO);
+LUA_CLASS_DECLARE(ByteArray,BYTE_ARRAY);
+LUA_CLASS_DECLARE(Tvb,TVB);
+LUA_CLASS_DECLARE(Column,COLUMN);
+LUA_CLASS_DECLARE(Columns,COLUMNS);
+LUA_CLASS_DECLARE(Pinfo,PINFO);
+LUA_CLASS_DECLARE(Tree,TREE);
+LUA_CLASS_DECLARE(Item,ITEM);
+LUA_CLASS_DECLARE(Dissector,DISSECTOR);
+LUA_CLASS_DECLARE(DissectorTable,DISSECTOR_TABLE);
+
+extern void dissect_lua(tvbuff_t* tvb, packet_info* pinfo, proto_tree* tree);
+extern int lua_tap_packet(void *tapdata, packet_info *pinfo, epan_dissect_t *edt, const void *data _U_);
+extern void lua_tap_reset(void *tapdata);
+extern void lua_tap_draw(void *tapdata);
+
+#endif
G_MODULE_EXPORT const gchar version[] = VERSION;
G_MODULE_EXPORT void plugin_register(void) {
-
- if (! initialized ) {
- proto_register_lua();
- initialized = 1;
- }
+
}
G_MODULE_EXPORT void plugin_reg_handoff(void)
{
+ if (! initialized ) {
+ proto_register_lua();
+ initialized = 1;
+ }
+
proto_reg_handoff_lua();
+
}
#endif
git.samba.org / obnox / wireshark / wip.git / commitdiff
