|
bugs
|
a6755e2f1a
BUG: `strfind' does not handle \0 in plain search.
|
26 gadi atpakaļ |
|
lapi.c
|
e5743adb21
macros `key', `val', and `node' don't need the state
|
26 gadi atpakaļ |
|
lapi.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lauxlib.c
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lauxlib.h
|
7d1499ba88
new macro luaL_openl
|
26 gadi atpakaļ |
|
lbuffer.c
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lbuiltin.c
|
790690a223
new way to keep function arguments (with StkId instead of copy)
|
26 gadi atpakaļ |
|
lbuiltin.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
ldblib.c
|
7d1499ba88
new macro luaL_openl
|
26 gadi atpakaļ |
|
ldo.c
|
d29ce75737
new signature for function luaD_call (old luaD_calln)
|
26 gadi atpakaļ |
|
ldo.h
|
d29ce75737
new signature for function luaD_call (old luaD_calln)
|
26 gadi atpakaļ |
|
lfunc.c
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lfunc.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lgc.c
|
d015f1fc02
table sizes don't need to be primes; power of 2 gives the same performance.
|
26 gadi atpakaļ |
|
lgc.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
linit.c
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
liolib.c
|
7d1499ba88
new macro luaL_openl
|
26 gadi atpakaļ |
|
llex.c
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
llex.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lmathlib.c
|
7d1499ba88
new macro luaL_openl
|
26 gadi atpakaļ |
|
lmem.c
|
c5fa0895e9
table sizes don't need to be primes; power of 2 gives the same performance.
|
26 gadi atpakaļ |
|
lmem.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lobject.c
|
d015f1fc02
table sizes don't need to be primes; power of 2 gives the same performance.
|
26 gadi atpakaļ |
|
lobject.h
|
d015f1fc02
table sizes don't need to be primes; power of 2 gives the same performance.
|
26 gadi atpakaļ |
|
lopcodes.h
|
33b8a01032
new way to code CALLs + passing multiple arguments between function calls
|
26 gadi atpakaļ |
|
lparser.c
|
33b8a01032
new way to code CALLs + passing multiple arguments between function calls
|
26 gadi atpakaļ |
|
lparser.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lref.c
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lref.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lstate.c
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lstate.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lstring.c
|
d015f1fc02
table sizes don't need to be primes; power of 2 gives the same performance.
|
26 gadi atpakaļ |
|
lstring.h
|
d015f1fc02
table sizes don't need to be primes; power of 2 gives the same performance.
|
26 gadi atpakaļ |
|
lstrlib.c
|
7d1499ba88
new macro luaL_openl
|
26 gadi atpakaļ |
|
ltable.c
|
d015f1fc02
table sizes don't need to be primes; power of 2 gives the same performance.
|
26 gadi atpakaļ |
|
ltable.h
|
e5743adb21
macros `key', `val', and `node' don't need the state
|
26 gadi atpakaļ |
|
ltm.c
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
ltm.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lua.c
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lua.h
|
878ef96127
comment
|
26 gadi atpakaļ |
|
luadebug.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lualib.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lundump.c
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lundump.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lvm.c
|
33b8a01032
new way to code CALLs + passing multiple arguments between function calls
|
26 gadi atpakaļ |
|
lvm.h
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 gadi atpakaļ |
|
lzio.c
|
a7fa7bafc8
new warnings with option "-W" (gcc)
|
26 gadi atpakaļ |
|
lzio.h
|
c787dccd9b
"const" !!!
|
26 gadi atpakaļ |
|
makefile
|
4343420d4d
simplified version of `gc' tag method (only for userdata now).
|
26 gadi atpakaļ |
|
manual.tex
|
4343420d4d
simplified version of `gc' tag method (only for userdata now).
|
26 gadi atpakaļ |
Roberto Ierusalimschy
c5fa0895e9
table sizes don't need to be primes; power of 2 gives the same performance.