From 72096fadf2ede159183050b72757d6b8d1daa050 Mon Sep 17 00:00:00 2001
From: dg <dg@51575b47-30f0-44d4-a5cc-537603b46e54>
Date: Thu, 18 Mar 2010 13:18:17 +0000
Subject: [PATCH] Included LuaJIT 1.1, it only works for x86 (NOT i64) it is
off by default it can be turned on when premaking: premake4 --lua=jitx86
gmake
git-svn-id: http://svn.net-core.org/repos/t-engine4@438 51575b47-30f0-44d4-a5cc-537603b46e54
---
game/engine/pre-init.lua | 10 +
game/thirdparty/jit/dis_x86.lua | 622 +++++++
game/thirdparty/jit/dump.lua | 265 +++
game/thirdparty/jit/dumphints.lua | 239 +++
game/thirdparty/jit/opt.lua | 508 ++++++
game/thirdparty/jit/opt_inline.lua | 397 +++++
game/thirdparty/jit/trace.lua | 111 ++
premake4.lua | 41 +-
src/dynasm/dasm_proto.h | 68 +
src/dynasm/dasm_x86.h | 455 ++++++
src/dynasm/dasm_x86.lua | 1581 ++++++++++++++++++
src/dynasm/dynasm.lua | 1070 ++++++++++++
src/luajit/Makefile | 252 +++
src/luajit/lapi.c | 1082 ++++++++++++
src/luajit/lapi.h | 16 +
src/luajit/lauxlib.c | 633 +++++++
src/luajit/lauxlib.h | 174 ++
src/luajit/lbaselib.c | 679 ++++++++
src/luajit/lcoco.c | 561 +++++++
src/luajit/lcoco.h | 72 +
src/luajit/lcode.c | 839 ++++++++++
src/luajit/lcode.h | 76 +
src/luajit/ldblib.c | 397 +++++
src/luajit/ldebug.c | 640 ++++++++
src/luajit/ldebug.h | 33 +
src/luajit/ldo.c | 519 ++++++
src/luajit/ldo.h | 59 +
src/luajit/ldump.c | 164 ++
src/luajit/lfunc.c | 182 +++
src/luajit/lfunc.h | 34 +
src/luajit/lgc.c | 711 ++++++++
src/luajit/lgc.h | 110 ++
src/luajit/linit.c | 39 +
src/luajit/liolib.c | 553 +++++++
src/luajit/ljit.h | 167 ++
src/luajit/ljit_backend.c | 342 ++++
src/luajit/ljit_core.c | 387 +++++
src/luajit/ljit_dasm.c | 38 +
src/luajit/ljit_dasm.h | 19 +
src/luajit/ljit_hints.h | 137 ++
src/luajit/ljit_mem.c | 405 +++++
src/luajit/ljit_x86.dasc | 2457 ++++++++++++++++++++++++++++
src/luajit/ljit_x86.dash | 297 ++++
src/luajit/ljit_x86.h | 2303 ++++++++++++++++++++++++++
src/luajit/ljit_x86_inline.dash | 627 +++++++
src/luajit/ljitlib.c | 637 ++++++++
src/luajit/llex.c | 461 ++++++
src/luajit/llex.h | 81 +
src/luajit/llimits.h | 128 ++
src/luajit/lmathlib.c | 263 +++
src/luajit/lmem.c | 86 +
src/luajit/lmem.h | 49 +
src/luajit/loadlib.c | 686 ++++++++
src/luajit/lobject.c | 214 +++
src/luajit/lobject.h | 386 +++++
src/luajit/lopcodes.c | 102 ++
src/luajit/lopcodes.h | 268 +++
src/luajit/loslib.c | 244 +++
src/luajit/lparser.c | 1339 +++++++++++++++
src/luajit/lparser.h | 82 +
src/luajit/lstate.c | 218 +++
src/luajit/lstate.h | 179 ++
src/luajit/lstring.c | 111 ++
src/luajit/lstring.h | 31 +
src/luajit/lstrlib.c | 869 ++++++++++
src/luajit/ltable.c | 588 +++++++
src/luajit/ltable.h | 41 +
src/luajit/ltablib.c | 287 ++++
src/luajit/ltm.c | 75 +
src/luajit/ltm.h | 54 +
src/luajit/lua.h | 385 +++++
src/luajit/luaconf.h | 786 +++++++++
src/luajit/luajit | Bin 0 -> 267353 bytes
src/luajit/luajit.h | 68 +
src/luajit/lualib.h | 56 +
src/luajit/lundump.c | 227 +++
src/luajit/lundump.h | 36 +
src/luajit/lvm.c | 763 +++++++++
src/luajit/lvm.h | 40 +
src/luajit/lzio.c | 82 +
src/luajit/lzio.h | 67 +
src/luajit/print.c | 227 +++
82 files changed, 30578 insertions(+), 9 deletions(-)
create mode 100644 game/thirdparty/jit/dis_x86.lua
create mode 100644 game/thirdparty/jit/dump.lua
create mode 100644 game/thirdparty/jit/dumphints.lua
create mode 100644 game/thirdparty/jit/opt.lua
create mode 100644 game/thirdparty/jit/opt_inline.lua
create mode 100644 game/thirdparty/jit/trace.lua
create mode 100644 src/dynasm/dasm_proto.h
create mode 100644 src/dynasm/dasm_x86.h
create mode 100644 src/dynasm/dasm_x86.lua
create mode 100644 src/dynasm/dynasm.lua
create mode 100644 src/luajit/Makefile
create mode 100644 src/luajit/lapi.c
create mode 100644 src/luajit/lapi.h
create mode 100644 src/luajit/lauxlib.c
create mode 100644 src/luajit/lauxlib.h
create mode 100644 src/luajit/lbaselib.c
create mode 100644 src/luajit/lcoco.c
create mode 100644 src/luajit/lcoco.h
create mode 100644 src/luajit/lcode.c
create mode 100644 src/luajit/lcode.h
create mode 100644 src/luajit/ldblib.c
create mode 100644 src/luajit/ldebug.c
create mode 100644 src/luajit/ldebug.h
create mode 100644 src/luajit/ldo.c
create mode 100644 src/luajit/ldo.h
create mode 100644 src/luajit/ldump.c
create mode 100644 src/luajit/lfunc.c
create mode 100644 src/luajit/lfunc.h
create mode 100644 src/luajit/lgc.c
create mode 100644 src/luajit/lgc.h
create mode 100644 src/luajit/linit.c
create mode 100644 src/luajit/liolib.c
create mode 100644 src/luajit/ljit.h
create mode 100644 src/luajit/ljit_backend.c
create mode 100644 src/luajit/ljit_core.c
create mode 100644 src/luajit/ljit_dasm.c
create mode 100644 src/luajit/ljit_dasm.h
create mode 100644 src/luajit/ljit_hints.h
create mode 100644 src/luajit/ljit_mem.c
create mode 100644 src/luajit/ljit_x86.dasc
create mode 100644 src/luajit/ljit_x86.dash
create mode 100644 src/luajit/ljit_x86.h
create mode 100644 src/luajit/ljit_x86_inline.dash
create mode 100644 src/luajit/ljitlib.c
create mode 100644 src/luajit/llex.c
create mode 100644 src/luajit/llex.h
create mode 100644 src/luajit/llimits.h
create mode 100644 src/luajit/lmathlib.c
create mode 100644 src/luajit/lmem.c
create mode 100644 src/luajit/lmem.h
create mode 100644 src/luajit/loadlib.c
create mode 100644 src/luajit/lobject.c
create mode 100644 src/luajit/lobject.h
create mode 100644 src/luajit/lopcodes.c
create mode 100644 src/luajit/lopcodes.h
create mode 100644 src/luajit/loslib.c
create mode 100644 src/luajit/lparser.c
create mode 100644 src/luajit/lparser.h
create mode 100644 src/luajit/lstate.c
create mode 100644 src/luajit/lstate.h
create mode 100644 src/luajit/lstring.c
create mode 100644 src/luajit/lstring.h
create mode 100644 src/luajit/lstrlib.c
create mode 100644 src/luajit/ltable.c
create mode 100644 src/luajit/ltable.h
create mode 100644 src/luajit/ltablib.c
create mode 100644 src/luajit/ltm.c
create mode 100644 src/luajit/ltm.h
create mode 100644 src/luajit/lua.h
create mode 100644 src/luajit/luaconf.h
create mode 100755 src/luajit/luajit
create mode 100644 src/luajit/luajit.h
create mode 100644 src/luajit/lualib.h
create mode 100644 src/luajit/lundump.c
create mode 100644 src/luajit/lundump.h
create mode 100644 src/luajit/lvm.c
create mode 100644 src/luajit/lvm.h
create mode 100644 src/luajit/lzio.c
create mode 100644 src/luajit/lzio.h
create mode 100644 src/luajit/print.c
diff --git a/game/engine/pre-init.lua b/game/engine/pre-init.lua
index e29c5fd793..8f610180c4 100644
--- a/game/engine/pre-init.lua
+++ b/game/engine/pre-init.lua
@@ -1,3 +1,13 @@
+-- Turn on LuaJIT if available
+pcall(require, "jit")
+if jit then
+ jit.on()
+ require("jit.opt").start(2)
+ print("LuaVM:", jit.version, jit.arch)
+else
+ print("LuaVM:", _VERSION)
+end
+
-- Requiring "socketed" instead of "socket" makes sockets work
-- Thsi is due to the way luasocket is embeded statically in TE4
require "socketed"
diff --git a/game/thirdparty/jit/dis_x86.lua b/game/thirdparty/jit/dis_x86.lua
new file mode 100644
index 0000000000..6b6d5885cd
--- /dev/null
+++ b/game/thirdparty/jit/dis_x86.lua
@@ -0,0 +1,622 @@
+----------------------------------------------------------------------------
+-- LuaJIT x86 disassembler module.
+--
+-- Copyright (C) 2005-2008 Mike Pall. All rights reserved.
+-- Released under the MIT/X license. See luajit.h for full copyright notice.
+----------------------------------------------------------------------------
+-- This is a helper module used by the LuaJIT machine code dumper module.
+--
+-- Sending small code snippets to an external disassembler and mixing the
+-- output with our own stuff was too fragile. So I had to bite the bullet
+-- and write yet another x86 disassembler. Oh well ...
+--
+-- The output format is very similar to what ndisasm generates. But it has
+-- been developed independently by looking at the opcode tables from the
+-- Intel and AMD manuals. The supported instruction set is quite extensive
+-- and reflects what a current generation P4 or K8 implements in 32 bit
+-- mode. Yes, this includes MMX, SSE, SSE2, SSE3, SSSE3 and even privileged
+-- instructions.
+--
+-- Notes:
+-- * The (useless) a16 prefix, 3DNow and pre-586 opcodes are unsupported.
+-- * No attempt at optimization has been made -- it's fast enough for my needs.
+-- * The public API may change when more architectures are added.
+--
+-- TODO:
+-- * More testing with arbitrary x86 code (not just LuaJIT generated code).
+-- * The output for a few MMX/SSE opcodes could be improved.
+-- * Adding x64 support would be straightforward.
+-- * Better input API (iterator) and output API (structured access to instr).
+------------------------------------------------------------------------------
+
+local type = type
+local sub, byte, format = string.sub, string.byte, string.format
+local match, gmatch, gsub = string.match, string.gmatch, string.gsub
+
+-- Map for 1st opcode byte. Ugly? Well ... read on.
+local map_opc1 = {
+--0x
+[0]="addBmr","addVmr","addBrm","addVrm","addBai","addVai","push es","pop es",
+"orBmr","orVmr","orBrm","orVrm","orBai","orVai","push cs","opc2*",
+--1x
+"adcBmr","adcVmr","adcBrm","adcVrm","adcBai","adcVai","push ss","pop ss",
+"sbbBmr","sbbVmr","sbbBrm","sbbVrm","sbbBai","sbbVai","push ds","pop ds",
+--2x
+"andBmr","andVmr","andBrm","andVrm","andBai","andVai","es:seg","daa",
+"subBmr","subVmr","subBrm","subVrm","subBai","subVai","cs:seg","das",
+--3x
+"xorBmr","xorVmr","xorBrm","xorVrm","xorBai","xorVai","ss:seg","aaa",
+"cmpBmr","cmpVmr","cmpBrm","cmpVrm","cmpBai","cmpVai","ds:seg","aas",
+--4x
+"incVR","incVR","incVR","incVR","incVR","incVR","incVR","incVR",
+"decVR","decVR","decVR","decVR","decVR","decVR","decVR","decVR",
+--5x
+"pushVR","pushVR","pushVR","pushVR","pushVR","pushVR","pushVR","pushVR",
+"popVR","popVR","popVR","popVR","popVR","popVR","popVR","popVR",
+--6x
+"pusha/pushaw","popa/popaw","boundVrm","arplWmr",
+"fs:seg","gs:seg","o16:","a16",
+"pushVi","imulVrmi","pushBs","imulVrms",
+"insb","insd/insw","outsb","outsd/outsw",
+--7x
+"joBj","jnoBj","jbBj","jnbBj","jzBj","jnzBj","jbeBj","jaBj",
+"jsBj","jnsBj","jpeBj","jpoBj","jlBj","jgeBj","jleBj","jgBj",
+--8x
+"arith!Bmi","arith!Vmi","arith!Bmi","arith!Vms",
+"testBmr","testVmr","xchgBrm","xchgVrm",
+"movBmr","movVmr","movBrm","movVrm",
+"movVmg","leaVrm","movWgm","popVm",
+--9x
+"nop|pause|xchgWaR|repne nop","xchgVaR","xchgVaR","xchgVaR",
+"xchgVaR","xchgVaR","xchgVaR","xchgVaR",
+"cwde/cbw","cdq/cwd","call farViw","wait",
+"pushf/pushfw","popf/popfw","sahf","lahf",
+--Ax
+"movBao","movVao","movBoa","movVoa",
+"movsb","movsd/movsb","cmpsb","cmpsd/cmpsw",
+"testBai","testVai","stosb","stosd/stosw",
+"lodsb","lodsd/lodsw","scasb","scasd/scasw",
+--Bx
+"movBRi","movBRi","movBRi","movBRi","movBRi","movBRi","movBRi","movBRi",
+"movVRi","movVRi","movVRi","movVRi","movVRi","movVRi","movVRi","movVRi",
+--Cx
+"shift!Bmu","shift!Vmu","retBw","ret","lesVrm","ldsVrm","movBmi","movVmi",
+"enterBwu","leave","retfBw","retf","int3","intBu","into","iret/iretw",
+--Dx
+"shift!Bm1","shift!Vm1","shift!Bmc","shift!Vmc","aamBu","aadBu","salc","xlatb",
+"fp*0","fp*1","fp*2","fp*3","fp*4","fp*5","fp*6","fp*7",
+--Ex
+"loopneBj","loopeBj","loopBj","jecxz/jcxzBj","inBau","inVau","outBua","outVua",
+"callDj","jmpDj","jmp farViw","jmpBj","inBad","inVad","outBda","outVda",
+--Fx
+"lock:","int1","repne:rep","rep:","hlt","cmc","testb!Bm","testv!Vm",
+"clc","stc","cli","sti","cld","std","inc!Bm","inc!Vm",
+}
+assert(#map_opc1 == 255)
+
+-- Map for 2nd opcode byte (0f xx). True CISC hell. Hey, I told you.
+-- Prefix dependent MMX/SSE opcodes: (none)|rep|o16|repne
+local map_opc2 = {
+--0x
+[0]="sldt!Dmp","sgdt!Dmp","larVrm","lslVrm",nil,"syscall","clts","sysret",
+"invd","wbinvd",nil,"ud1",nil,"prefetch!Bm","femms","3dnowMrmu",
+--1x
+"movupsXrm|movssXrm|movupdXrm|movsdXrm",
+"movupsXmr|movssXmr|movupdXmr|movsdXmr",
+"movhlpsXrm|movsldupXrm|movlpdXrm|movddupXrm", -- TODO: movlpsXrMm (mem case).
+"movlpsXmr||movlpdXmr",
+"unpcklpsXrm||unpcklpdXrm",
+"unpckhpsXrm||unpckhpdXrm",
+"movlhpsXrm|movshdupXrm|movhpdXrm", -- TODO: movhpsXrMm (mem case).
+"movhpsXmr||movhpdXmr",
+"prefetcht!Bm","hintnopBm","hintnopBm","hintnopBm",
+"hintnopBm","hintnopBm","hintnopBm","hintnopBm",
+--2x
+"movDmx","movDmy","movDxm","movDym","movDmz",nil,"movDzm",nil,
+"movapsXrm||movapdXrm",
+"movapsXmr||movapdXmr",
+"cvtpi2psXrMm|cvtsi2ssXrDm|cvtpi2pdXrMm|cvtsi2sdXrDm",
+"movntpsXmr||movntpdXmr",
+"cvttps2piMrXm|cvttss2siDrXm|cvttpd2piMrXm|cvttsd2siDrXm",
+"cvtps2piMrXm|cvtss2siDrXm|cvtpd2piMrXm|cvtsd2siDrXm",
+"ucomissXrm||ucomisdXrm",
+"comissXrm||comisdXrm",
+--3x
+"wrmsr","rdtsc","rdmsr","rdpmc","sysenter","sysexit",nil,nil,
+"ssse3*38",nil,"ssse3*3a",nil,nil,nil,nil,nil,
+--4x
+"cmovoVrm","cmovnoVrm","cmovbVrm","cmovnbVrm",
+"cmovzVrm","cmovnzVrm","cmovbeVrm","cmovaVrm",
+"cmovsVrm","cmovnsVrm","cmovpeVrm","cmovpoVrm",
+"cmovlVrm","cmovgeVrm","cmovleVrm","cmovgVrm",
+--5x
+"movmskpsDrXm||movmskpdDrXm","sqrtpsXrm|sqrtssXrm|sqrtpdXrm|sqrtsdXrm",
+"rsqrtpsXrm|rsqrtssXrm","rcppsXrm|rcpssXrm",
+"andpsXrm||andpdXrm","andnpsXrm||andnpdXrm",
+"orpsXrm||orpdXrm","xorpsXrm||xorpdXrm",
+"addpsXrm|addssXrm|addpdXrm|addsdXrm","mulpsXrm|mulssXrm|mulpdXrm|mulsdXrm",
+"cvtps2pdXrm|cvtss2sdXrm|cvtpd2psXrm|cvtsd2ssXrm",
+"cvtdq2psXrm|cvttps2dqXrm|cvtps2dqXrm",
+"subpsXrm|subssXrm|subpdXrm|subsdXrm","minpsXrm|minssXrm|minpdXrm|minsdXrm",
+"divpsXrm|divssXrm|divpdXrm|divsdXrm","maxpsXrm|maxssXrm|maxpdXrm|maxsdXrm",
+--6x
+"punpcklbwMrm||punpcklbqXrm","punpcklwdPrm","punpckldqPrm","packsswbPrm",
+"pcmpgtbPrm","pcmpgtwPrm","pcmpgtdPrm","packuswbPrm",
+"punpckhbwPrm","punpckhwdPrm","punpckhdqPrm","packssdwPrm",
+"||punpcklqdqXrm","||punpckhqdqXrm",
+"movdPrDm","movqMrm|movdquXrm|movdqaXrm",
+--7x
+"pshufwPrmu","pshiftw!Pmu","pshiftd!Pmu","pshiftq!Mmu||pshiftdq!Xmu",
+"pcmpeqbPrm","pcmpeqwPrm","pcmpeqdPrm","emms|",
+nil,nil,nil,nil,
+"||haddpdXrm|haddpsXrm","||hsubpdXrm|hsubpsXrm",
+"movdDmMr|movqXrm|movdDmXr","movqMmr|movdquXmr|movdqaXmr",
+--8x
+"joVj","jnoVj","jbVj","jnbVj","jzVj","jnzVj","jbeVj","jaVj",
+"jsVj","jnsVj","jpeVj","jpoVj","jlVj","jgeVj","jleVj","jgVj",
+--9x
+"setoBm","setnoBm","setbBm","setnbBm","setzBm","setnzBm","setbeBm","setaBm",
+"setsBm","setnsBm","setpeBm","setpoBm","setlBm","setgeBm","setleBm","setgBm",
+--Ax
+"push fs","pop fs","cpuid","btVmr","shldVmru","shldVmrc",nil,nil,
+"push gs","pop gs","rsm","btsVmr","shrdVmru","shrdVmrc","fxsave!Dmp","imulVrm",
+--Bx
+"cmpxchgBmr","cmpxchgVmr","lssVrm","btrVmr",
+"lfsVrm","lgsVrm","movzxVrBm","movzxDrWm",
+nil,"ud2","bt!Vmu","btcVmr",
+"bsfVrm","bsrVrm","movsxVrBm","movsxDrWm",
+--Cx
+"xaddBmr","xaddVmr",
+"cmppsXrmu|cmpssXrmu|cmppdXrmu|cmpsdXrmu","movntiDmr|",
+"pinsrwPrWmu","pextrwDrPmu",
+"shufpsXrmu||shufpdXrmu","cmpxchg!Dmp",
+"bswapDR","bswapDR","bswapDR","bswapDR","bswapDR","bswapDR","bswapDR","bswapDR",
+--Dx
+"||addsubpdXrm|addsubpsXrm","psrlwPrm","psrldPrm","psrlqPrm",
+"paddqPrm","pmullwPrm",
+"|movq2dqXrMm|movqXmr|movdq2qMrXm","pmovmskbDrPm",
+"psubusbPrm","psubuswPrm","pminubPrm","pandPrm",
+"paddusbPrm","padduswPrm","pmaxubPrm","pandnPrm",
+--Ex
+"pavgbPrm","psrawPrm","psradPrm","pavgwPrm",
+"pmulhuwPrm","pmulhwPrm",
+"|cvtdq2pdXrm|cvttpd2dqXrm|cvtpd2dqXrm","movntqMmr||movntdqXmr",
+"psubsbPrm","psubswPrm","pminswPrm","porPrm",
+"paddsbPrm","paddswPrm","pmaxswPrm","pxorPrm",
+--Fx
+"|||lddquXrm","psllwPrm","pslldPrm","psllqPrm",
+"pmuludqPrm","pmaddwdPrm","psadbwPrm","maskmovqMrm||maskmovdquXrm",
+"psubbPrm","psubwPrm","psubdPrm","psubqPrm",
+"paddbPrm","paddwPrm","padddPrm","ud",
+}
+assert(map_opc2[255] == "ud")
+
+-- Map for SSSE3 opcodes.
+local map_ssse3 = {
+["38"] = { -- [66] 0f 38 xx
+--0x
+[0]="pshufbPrm","phaddwPrm","phadddPrm","phaddswPrm",
+"pmaddubswPrm","phsubwPrm","phsubdPrm","phsubswPrm",
+"psignbPrm","psignwPrm","psigndPrm","pmulhrswPrm",
+nil,nil,nil,nil,
+--1x
+nil,nil,nil,nil,nil,nil,nil,nil,
+nil,nil,nil,nil,"pabsbPrm","pabswPrm","pabsdPrm",nil,
+},
+["3a"] = { -- [66] 0f 3a xx
+[0x0f] = "palignrPrmu",
+},
+}
+
+-- Map for FP opcodes. And you thought stack machines are simple?
+local map_opcfp = {
+-- D8-DF 00-BF: opcodes with a memory operand.
+-- D8
+[0]="faddFm","fmulFm","fcomFm","fcompFm","fsubFm","fsubrFm","fdivFm","fdivrFm",
+"fldFm",nil,"fstFm","fstpFm","fldenvDmp","fldcwWm","fnstenvDmp","fnstcwWm",
+-- DA
+"fiaddDm","fimulDm","ficomDm","ficompDm",
+"fisubDm","fisubrDm","fidivDm","fidivrDm",
+-- DB
+"fildDm","fisttpDm","fistDm","fistpDm",nil,"fld twordFmp",nil,"fstp twordFmp",
+-- DC
+"faddGm","fmulGm","fcomGm","fcompGm","fsubGm","fsubrGm","fdivGm","fdivrGm",
+-- DD
+"fldGm","fisttpQm","fstGm","fstpGm","frstorDmp",nil,"fnsaveDmp","fnstswWm",
+-- DE
+"fiaddWm","fimulWm","ficomWm","ficompWm",
+"fisubWm","fisubrWm","fidivWm","fidivrWm",
+-- DF
+"fildWm","fisttpWm","fistWm","fistpWm",
+"fbld twordFmp","fildQm","fbstp twordFmp","fistpQm",
+-- xx C0-FF: opcodes with a pseudo-register operand.
+-- D8
+"faddFf","fmulFf","fcomFf","fcompFf","fsubFf","fsubrFf","fdivFf","fdivrFf",
+-- D9
+"fldFf","fxchFf",{"fnop"},nil,
+{"fchs","fabs",nil,nil,"ftst","fxam"},
+{"fld1","fldl2t","fldl2e","fldpi","fldlg2","fldln2","fldz"},
+{"f2xm1","fyl2x","fptan","fpatan","fxtract","fprem1","fdecstp","fincstp"},
+{"fprem","fyl2xp1","fsqrt","fsincos","frndint","fscale","fsin","fcos"},
+-- DA
+"fcmovbFf","fcmoveFf","fcmovbeFf","fcmovuFf",nil,{nil,"fucompp"},nil,nil,
+-- DB
+"fcmovnbFf","fcmovneFf","fcmovnbeFf","fcmovnuFf",
+{nil,nil,"fnclex","fninit"},"fucomiFf","fcomiFf",nil,
+-- DC
+"fadd toFf","fmul toFf",nil,nil,
+"fsub toFf","fsubr toFf","fdivr toFf","fdiv toFf",
+-- DD
+"ffreeFf",nil,"fstFf","fstpFf","fucomFf","fucompFf",nil,nil,
+-- DE
+"faddpFf","fmulpFf",nil,{nil,"fcompp"},
+"fsubrpFf","fsubpFf","fdivrpFf","fdivpFf",
+-- DF
+nil,nil,nil,nil,{"fnstsw ax"},"fucomipFf","fcomipFf",nil,
+}
+assert(map_opcfp[126] == "fcomipFf")
+
+-- Map for opcode groups. The subkey is sp from the ModRM byte.
+local map_opcgroup = {
+ arith = { "add", "or", "adc", "sbb", "and", "sub", "xor", "cmp" },
+ shift = { "rol", "ror", "rcl", "rcr", "shl", "shr", "sal", "sar" },
+ testb = { "testBmi", "testBmi", "not", "neg", "mul", "imul", "div", "idiv" },
+ testv = { "testVmi", "testVmi", "not", "neg", "mul", "imul", "div", "idiv" },
+ inc = { "inc", "dec", "callDmp", "call farDmp",
+ "jmpDmp", "jmp farDmp", "push" },
+ sldt = { "sldt", "str", "lldt", "ltr", "verr", "verw" },
+ sgdt = { "sgdt", "sidt", "lgdt", "lidt", "smsw", nil, "lmsw", "invlpg" },
+ bt = { nil, nil, nil, nil, "bt", "bts", "btr", "btc" },
+ cmpxchg = { nil, "cmpxchg8b" },
+ pshiftw = { nil, nil, "psrlw", nil, "psraw", nil, "psllw" },
+ pshiftd = { nil, nil, "psrld", nil, "psrad", nil, "pslld" },
+ pshiftq = { nil, nil, "psrlq", nil, nil, nil, "psllq" },
+ pshiftdq = { nil, nil, "psrlq", "psrldq", nil, nil, "psllq", "pslldq" },
+ fxsave = { "fxsave", "fxrstor", "ldmxcsr", "stmxcsr",
+ nil, "lfenceDp", "mfenceDp", "sfenceDp" }, -- TODO: clflush.
+ prefetch = { "prefetch", "prefetchw" },
+ prefetcht = { "prefetchnta", "prefetcht0", "prefetcht1", "prefetcht2" },
+}
+
+------------------------------------------------------------------------------
+
+-- Maps for register names.
+local map_aregs = { "eax", "ecx", "edx", "ebx", "esp", "ebp", "esi", "edi" }
+local map_regs = {
+ B = { "al", "cl", "dl", "bl", "ah", "ch", "dh", "bh" },
+ W = { "ax", "cx", "dx", "bx", "sp", "bp", "si", "di" },
+ D = map_aregs,
+ M = { "mm0", "mm1", "mm2", "mm3", "mm4", "mm5", "mm6", "mm7" },
+ X = { "xmm0", "xmm1", "xmm2", "xmm3", "xmm4", "xmm5", "xmm6", "xmm7" },
+}
+local map_segregs = { "es", "cs", "ss", "ds", "fs", "gs", "segr6", "segr7" }
+
+-- Maps for size names.
+local map_sz2n = {
+ B = 1, W = 2, D = 4, Q = 8, M = 8, X = 16,
+}
+local map_sz2prefix = {
+ B = "byte", W = "word", D = "dword",
+ Q = "qword", -- No associated reg in 32 bit mode.
+ F = "dword", G = "qword", -- No need for sizes/register names for these two.
+ M = "qword", X = "xword",
+}
+
+------------------------------------------------------------------------------
+
+-- Output a nicely formatted line with an opcode and operands.
+local function putop(ctx, text, operands)
+ local code, pos, hex = ctx.code, ctx.pos, ""
+ for i=ctx.start,pos-1 do
+ hex = hex..format("%02X", byte(code, i, i))
+ end
+ if #hex > 16 then hex = sub(hex, 1, 16).."." end
+ if operands then text = text.." "..operands end
+ if ctx.o16 then text = "o16 "..text; ctx.o16 = false end
+ if ctx.rep then text = ctx.rep.." "..text; ctx.rep = false end
+ if ctx.seg then
+ local text2, n = gsub(text, "%[", "["..ctx.seg..":")
+ if n == 0 then text = ctx.seg.." "..text else text = text2 end
+ ctx.seg = false
+ end
+ if ctx.lock then text = "lock "..text; ctx.lock = false end
+ local imm = ctx.imm
+ if imm then
+ local sym = ctx.symtab[imm]
+ if sym then text = text.."\t->"..sym end
+ end
+ ctx.out(format("%08x %-18s%s\n", ctx.addr+ctx.start, hex, text))
+ ctx.mrm = false
+ ctx.start = pos
+ ctx.imm = nil
+end
+
+-- Fallback for incomplete opcodes at the end.
+local function incomplete(ctx)
+ ctx.pos = ctx.stop+1
+ ctx.o16 = false; ctx.seg = false; ctx.lock = false; ctx.rep = false
+ return putop(ctx, "(incomplete)")
+end
+
+-- Fallback for unknown opcodes.
+local function unknown(ctx)
+ ctx.o16 = false; ctx.seg = false; ctx.lock = false; ctx.rep = false
+ return putop(ctx, "(unknown)")
+end
+
+-- Return an immediate of the specified size.
+local function getimm(ctx, pos, n)
+ if pos+n-1 > ctx.stop then return incomplete(ctx) end
+ local code = ctx.code
+ if n == 1 then
+ local b1 = byte(code, pos, pos)
+ return b1
+ elseif n == 2 then
+ local b1, b2 = byte(code, pos, pos+1)
+ return b1+b2*256
+ else
+ local b1, b2, b3, b4 = byte(code, pos, pos+3)
+ local imm = b1+b2*256+b3*65536+b4*16777216
+ ctx.imm = imm
+ return imm
+ end
+end
+
+-- Process pattern string and generate the operands.
+local function putpat(ctx, name, pat)
+ local operands, regs, sz, mode, sp, rm, sc, rx, disp, sdisp
+ local code, pos, stop = ctx.code, ctx.pos, ctx.stop
+
+ -- Chars used: 1DFGMPQRVWXacdfgijmoprsuwxyz
+ for p in gmatch(pat, ".") do
+ local x = nil
+ if p == "V" then
+ sz = ctx.o16 and "W" or "D"; ctx.o16 = false
+ regs = map_regs[sz]
+ elseif match(p, "[BWDQFGMX]") then
+ sz = p
+ regs = map_regs[sz]
+ elseif p == "P" then
+ sz = ctx.o16 and "X" or "M"; ctx.o16 = false
+ regs = map_regs[sz]
+ elseif p == "s" then
+ local imm = getimm(ctx, pos, 1); if not imm then return end
+ x = imm <= 127 and format("byte +0x%02x", imm)
+ or format("byte -0x%02x", 256-imm)
+ pos = pos+1
+ elseif p == "u" then
+ local imm = getimm(ctx, pos, 1); if not imm then return end
+ x = format("0x%02x", imm)
+ pos = pos+1
+ elseif p == "w" then
+ local imm = getimm(ctx, pos, 2); if not imm then return end
+ x = format("0x%x", imm)
+ pos = pos+2
+ elseif p == "o" then -- [offset]
+ local imm = getimm(ctx, pos, 4); if not imm then return end
+ x = format("[0x%08x]", imm)
+ pos = pos+4
+ elseif p == "i" then
+ local n = map_sz2n[sz]
+ local imm = getimm(ctx, pos, n); if not imm then return end
+ x = format(imm > 65535 and "0x%08x" or "0x%x", imm)
+ pos = pos+n
+ elseif p == "j" then
+ local n = map_sz2n[sz]
+ local imm = getimm(ctx, pos, n); if not imm then return end
+ if sz == "B" and imm > 127 then imm = imm-256
+ elseif imm > 2147483647 then imm = imm-4294967296 end
+ pos = pos+n
+ imm = imm + pos + ctx.addr
+ ctx.imm = imm
+ x = sz == "W" and format("word 0x%04x", imm%65536)
+ or format("0x%08x", imm)
+ elseif p == "R" then x = regs[byte(code, pos-1, pos-1)%8+1]
+ elseif p == "a" then x = regs[1]
+ elseif p == "c" then x = "cl"
+ elseif p == "d" then x = "dx"
+ elseif p == "1" then x = "1"
+ else
+ if not mode then
+ mode = ctx.mrm
+ if not mode then
+ if pos > stop then return incomplete(ctx) end
+ mode = byte(code, pos, pos)
+ pos = pos+1
+ end
+ rm = mode%8; mode = (mode-rm)/8
+ sp = mode%8; mode = (mode-sp)/8
+ sdisp = ""
+ if mode < 3 then
+ if rm == 4 then
+ if pos > stop then return incomplete(ctx) end
+ sc = byte(code, pos, pos)
+ pos = pos+1
+ rm = sc%8; sc = (sc-rm)/8
+ rx = sc%8; sc = (sc-rx)/8
+ if rx == 4 then rx = nil end
+ end
+ if mode > 0 or rm == 5 then
+ local dsz = mode
+ if dsz ~= 1 then dsz = 4 end
+ disp = getimm(ctx, pos, dsz); if not disp then return end
+ sdisp = (dsz == 4 or disp <= 127) and
+ format(disp > 65535 and "+0x%08x" or "+0x%x", disp) or
+ format("-0x%x", 256-disp)
+ pos = pos+dsz
+ end
+ end
+ end
+ if p == "m" then
+ if mode == 3 then x = regs[rm+1]
+ else
+ local srm, srx = map_aregs[rm+1], ""
+ if rx then
+ srm = srm.."+"
+ srx = map_aregs[rx+1]
+ if sc > 0 then srx = srx.."*"..(2^sc) end
+ end
+ if mode == 0 and rm == 5 then
+ srm = ""
+ sdisp = format("%s0x%08x", rx and "+" or "", disp)
+ end
+ x = format("[%s%s%s]", srm, srx, sdisp)
+ end
+ if mode < 3 and
+ (not match(pat, "[aRrgp]") or
+ name == "movzx" or name == "movsx") then -- Yuck.
+ x = map_sz2prefix[sz].." "..x
+ end
+ elseif p == "r" then x = regs[sp+1]
+ elseif p == "g" then x = map_segregs[sp+1]
+ elseif p == "p" then -- Suppress prefix.
+ elseif p == "f" then x = "st"..rm
+ elseif p == "x" then x = "CR"..sp
+ elseif p == "y" then x = "DR"..sp
+ elseif p == "z" then x = "TR"..sp
+ else
+ error("bad pattern `"..pat.."'")
+ end
+ end
+ if x then operands = operands and operands..","..x or x end
+ end
+ ctx.pos = pos
+ return putop(ctx, name, operands)
+end
+
+-- Forward declaration.
+local map_act
+
+-- Get a pattern from an opcode map and dispatch to handler.
+local function opcdispatch(ctx, opcmap)
+ local pos = ctx.pos
+ local opat = opcmap[byte(ctx.code, pos, pos)]
+ if not opat then return unknown(ctx) end
+ if match(opat, "%|") then -- MMX/SSE variants depending on prefix.
+ local p
+ if ctx.rep then p = ctx.rep=="rep" and "%|([^%|]*)" or "%|.-%|.-%|([^%|]*)"
+ elseif ctx.o16 then p = "%|.-%|([^%|]*)"
+ else p = "^[^%|]*" end
+ opat = match(opat, p)
+ if not opat or opat == "" then return unknown(ctx) end
+ ctx.rep = false; ctx.o16 = false
+ end
+ local name, pat, act = match(opat, "^([a-z0-9 ]*)((.?).*)")
+ ctx.pos = pos + 1
+ return map_act[act](ctx, name, pat)
+end
+
+-- Map for action codes. The key is the first char after the name.
+map_act = {
+ -- Simple opcodes without operands.
+ [""] = function(ctx, name, pat)
+ return putop(ctx, name)
+ end,
+
+ -- Operand size chars fall right through.
+ B = putpat, W = putpat, D = putpat, V = putpat,
+ F = putpat, G = putpat,
+ M = putpat, X = putpat, P = putpat,
+
+ -- Collect prefixes.
+ [":"] = function(ctx, name, pat)
+ ctx[pat == ":" and name or sub(pat, 2)] = name
+ end,
+
+ -- Select alternate opcode name when prefixed with o16.
+ ["/"] = function(ctx, name, pat)
+ local wname, rpat = match(pat, "^/([a-z0-9 ]+)(.*)")
+ if ctx.o16 then name = wname; ctx.o16 = false end
+ return putpat(ctx, name, rpat)
+ end,
+
+ -- Chain to special handler specified by name.
+ ["*"] = function(ctx, name, pat)
+ return map_act[name](ctx, name, sub(pat, 2))
+ end,
+
+ -- Use named subtable for opcode group.
+ ["!"] = function(ctx, name, pat)
+
+ local pos = ctx.pos
+ if pos > ctx.stop then return incomplete(ctx) end
+ local mrm = byte(ctx.code, pos, pos)
+ ctx.pos = pos+1
+ ctx.mrm = mrm
+
+ local opat = map_opcgroup[name][((mrm-(mrm%8))/8)%8+1]
+ if not opat then return unknown(ctx) end
+ local name, pat2 = match(opat, "^([a-z0-9 ]*)(.*)")
+ return putpat(ctx, name, pat2 ~= "" and pat2 or sub(pat, 2))
+ end,
+
+ -- Two-byte opcode dispatch.
+ opc2 = function(ctx, name, pat)
+ return opcdispatch(ctx, map_opc2)
+ end,
+
+ -- SSSE3 dispatch.
+ ssse3 = function(ctx, name, pat)
+ return opcdispatch(ctx, map_ssse3[pat])
+ end,
+
+ -- Floating point opcode dispatch.
+ fp = function(ctx, name, pat)
+
+ local pos = ctx.pos
+ if pos > ctx.stop then return incomplete(ctx) end
+ local mrm = byte(ctx.code, pos, pos)
+ ctx.pos = pos+1
+ ctx.mrm = mrm
+
+ local rm = mrm%8
+ local idx = pat*8 + ((mrm-rm)/8)%8
+ if mrm >= 192 then idx = idx + 64 end
+ local opat = map_opcfp[idx]
+ if type(opat) == "table" then opat = opat[rm+1] end
+ if not opat then return unknown(ctx) end
+ local name, pat2 = match(opat, "^([a-z0-9 ]*)(.*)")
+ return putpat(ctx, name, pat2)
+ end,
+}
+
+------------------------------------------------------------------------------
+
+-- Disassemble a block of code.
+local function disass_block(ctx, ofs, len)
+ if not ofs then ofs = 0 end
+ local stop = len and ofs+len or #ctx.code
+ ofs = ofs + 1
+ ctx.start = ofs
+ ctx.pos = ofs
+ ctx.stop = stop
+ ctx.imm = nil
+ ctx.mrm = false
+ ctx.o16 = false; ctx.seg = false; ctx.lock = false; ctx.rep = false
+ while ctx.pos <= stop do opcdispatch(ctx, map_opc1) end
+ if ctx.pos ~= ctx.start then incomplete(ctx) end
+end
+
+-- Extended API: create a disassembler context. Then call ctx:disass(ofs, len).
+local function create_(code, addr, out)
+ local ctx = {}
+ ctx.code = code
+ ctx.addr = (addr or 0) - 1
+ ctx.out = out or io.write
+ ctx.symtab = {}
+ ctx.disass = disass_block
+ return ctx
+end
+
+-- Simple API: disassemble code (a string) at address and output via out.
+local function disass_(code, addr, out)
+ create_(code, addr, out):disass()
+end
+
+
+-- Public module functions.
+module(...)
+
+create = create_
+disass = disass_
+
diff --git a/game/thirdparty/jit/dump.lua b/game/thirdparty/jit/dump.lua
new file mode 100644
index 0000000000..c562a1a9c3
--- /dev/null
+++ b/game/thirdparty/jit/dump.lua
@@ -0,0 +1,265 @@
+----------------------------------------------------------------------------
+-- LuaJIT machine code dumper module.
+--
+-- Copyright (C) 2005-2008 Mike Pall. All rights reserved.
+-- Released under the MIT/X license. See luajit.h for full copyright notice.
+----------------------------------------------------------------------------
+-- Activate this module to dump the machine code for all functions
+-- immediately after they have been compiled. The disassembler
+-- output is mixed with the bytecode listing.
+--
+-- Try: luajit -j dump -e 'print "foo"'
+-- luajit -j dump=foo.dump foo.lua
+-- luajit -j off -j dump -e 'jit.compile(assert(loadfile"foo.lua")))'
+--
+-- Default output is to stderr. To redirect output to a file,
+-- pass a filename as an argument or set the environment variable
+-- "LUAJIT_DUMPFILE".
+-- Note: The file is overwritten each time you run luajit.
+--
+-- TODO: Find a way to be more selective on what to dump.
+------------------------------------------------------------------------------
+
+-- Priority for compiler pipeline. Must run after backend (negative)
+-- and should be even because we only catch successful compiles.
+local PRIORITY = -98
+
+-- Cache some library functions and objects.
+local jit = require("jit")
+assert(jit.version_num == 10105, "LuaJIT core/library version mismatch")
+local jutil = require("jit.util")
+local type, format, gsub = type, string.format, string.gsub
+local bytecode, const = jutil.bytecode, jutil.const
+local getinfo = debug.getinfo
+local stdout, stderr = io.stdout, io.stderr
+
+-- Load the right disassembler.
+local dis = require("jit.dis_"..jit.arch)
+local discreate, disass_ = dis.create, dis.disass
+
+-- Turn compilation off for the whole module. LuaJIT would do that anyway.
+jit.off(true, true)
+
+-- Separator line.
+local sepline = "-------------------------------"
+
+-- Map JSUB indices to names.
+-- CHECK: must match the order in ljit_x86.h. Regenerate with:
+-- grep '^ *JSUB_[^_].*,' ljit_x86.h | sed -e 's/^ *JSUB_/ "/' -e 's/,.*/",/'
+local jsubnames = {
+ "STACKPTR",
+ "GATE_LJ",
+ "GATE_JL",
+ "GATE_JC",
+ "GROW_STACK",
+ "GROW_CI",
+ "GATE_JC_PATCH",
+ "GATE_JC_DEBUG",
+ "DEOPTIMIZE_CALLER",
+ "DEOPTIMIZE",
+ "DEOPTIMIZE_OPEN",
+ "HOOKINS",
+ "GCSTEP",
+ "STRING_SUB3",
+ "STRING_SUB2",
+ "HOOKCALL",
+ "HOOKRET",
+ "METACALL",
+ "METATAILCALL",
+ "BARRIERF",
+ "GETGLOBAL",
+ "GETTABLE_KSTR",
+ "GETTABLE_STR",
+ "BARRIERBACK",
+ "SETGLOBAL",
+ "SETTABLE_KSTR",
+ "SETTABLE_STR",
+ "GETTABLE_KNUM",
+ "GETTABLE_NUM",
+ "SETTABLE_KNUM",
+ "SETTABLE_NUM",
+ "LOG2_TWORD",
+ "CONCAT_STR2",
+}
+
+-- Generate map from JSUB addresses to JSUB names.
+local jsubmap = {}
+do
+ local jsubmcode = jutil.jsubmcode
+ for pc=0,100000 do
+ local addr = jsubmcode(pc)
+ if not addr then break end
+ jsubmap[addr] = jsubnames[pc+1] or "JSUB#"..pc
+ end
+end
+
+-- Pretty-print a constant.
+local function conststr(func, idx)
+ local k = const(func, idx)
+ if k == nil then return "nil"
+ elseif k == true then return "true"
+ elseif k == false then return "false"
+ elseif type(k) == "string" then
+ if #k > 10 then return format('"%.10s"~', k)
+ else return '"'..k..'"' end
+ else return k.."" end
+end
+
+-- Pretty-print a bytecode instruction (one or two lines).
+local function bytecodeout(out, func, pc)
+ local op, a, b, c = bytecode(func, pc)
+ if not op then
+ return true
+ elseif op == "JMP" then
+ out:write(format("\n--%04d-- JMP => %04d", pc, pc+1+b))
+ elseif op == "FORLOOP" or op == "FORPREP" then
+ out:write(format("\n--%04d-- %-9s %3d => %04d", pc, op, a, pc+1+b))
+ else
+ out:write(format("\n--%04d-- %-9s %3d %4s %4s",
+ pc, op, a, b or "", c or ""))
+ if b and b < 0 then out:write(" ; ", conststr(func, b)) end
+ if c and c < 0 then out:write(" ; ", conststr(func, c)) end
+ end
+end
+
+-- Dump machine code and mix it with the bytecode listing.
+local function dumpfunc(func, out, deopt)
+ if not out then out = stderr end
+ local info = getinfo(func, "S")
+
+ -- Don't bother checking for the right blocks to dump.
+ -- Dump the main block (if not deopt) and always all deopt blocks.
+ for block=deopt and 2 or 1,1000000 do
+ local addr, code, mfmiter = jutil.mcode(func, block)
+ if not addr then
+ if code then return code end -- Not compiled: return status.
+ break -- No more blocks to dump.
+ end
+
+ -- Print header.
+ out:write(sepline, " ", info.source, ":", info.linedefined)
+ if block ~= 1 then out:write(" DEOPT block ", block) end
+
+ -- Create disassembler context.
+ local ctx = discreate(code, addr, function(s) out:write(s) end)
+ ctx.symtab = jsubmap
+
+ -- Dump an mcode block.
+ local pc, ofs = 1, 0
+ local len, isdeopt = mfmiter()
+ if isdeopt then pc = len; len = 0
+ elseif block ~= 1 then break end -- Stop before next main block.
+ for t, m in mfmiter do
+ if t == "COMBINE" then
+ bytecodeout(out, func, pc)
+ else
+ if len ~= 0 then
+ out:write("\n")
+ if len > 0 then
+ ctx:disass(ofs, len)
+ ofs = ofs + len
+ else
+ out:write(format("%08x ** deoptimized\n", addr+ofs))
+ ofs = ofs - len
+ end
+ len = 0
+ end
+ if type(t) == "number" then
+ if m then
+ if isdeopt then
+ pc = t - 1
+ else
+ bytecodeout(out, func, pc)
+ len = -t
+ end
+ else
+ len = t
+ if bytecodeout(out, func, pc) then break end
+ end
+ end
+ end
+ pc = pc + 1
+ end
+ if len and len ~= 0 then
+ out:write(sepline, " tail code\n")
+ ctx:disass(ofs, len)
+ end
+ end
+
+ -- Print footer.
+ out:write(sepline, "\n")
+ out:flush()
+end
+
+-- Dump the internal JIT subroutines.
+local function dumpjsub_(out)
+ if not out then out = stderr end
+ local addr, code = jutil.jsubmcode()
+
+ -- Create disassembler context.
+ local ctx = discreate(code, addr, function(s) out:write(s) end)
+ ctx.symtab = jsubmap
+
+ -- Collect addresses and sort them.
+ local t = {}
+ for addr in pairs(jsubmap) do t[#t+1] = addr end
+ t[#t+1] = addr + #code
+ table.sort(t)
+
+ -- Go through the addresses in ascending order.
+ local ofs = addr
+ for i=2,#t do
+ local next = t[i]
+ out:write("\n->", jsubmap[ofs], ":\n") -- Output label for JSUB.
+ ctx:disass(ofs-addr, next-ofs) -- Disassemble corresponding code block.
+ ofs = next
+ end
+ out:flush()
+end
+
+
+-- Active flag and output file handle.
+local active, out
+
+-- Dump handler for compiler pipeline.
+local function h_dump(st)
+ local ok, err = pcall(dumpfunc, st.func, out, st.deopt)
+ if not ok then
+ stderr:write("\nERROR: jit.dump disabled: ", err, "\n")
+ jit.attach(h_dump) -- Better turn ourselves off after a failure.
+ if out and out ~= stdout then out:close() end
+ out = nil
+ active = nil
+ end
+end
+
+-- Detach dump handler from compiler pipeline.
+local function dumpoff()
+ if active then
+ active = false
+ jit.attach(h_dump)
+ if out and out ~= stdout then out:close() end
+ out = nil
+ end
+end
+
+-- Open the output file and attach dump handler to compiler pipeline.
+local function dumpon(filename)
+ if active then dumpoff() end
+ local outfile = filename or os.getenv("LUAJIT_DUMPFILE")
+ out = outfile and (outfile == "-" and stdout or assert(io.open(outfile, "w")))
+ jit.attach(h_dump, PRIORITY)
+ active = true
+end
+
+
+-- Public module functions.
+module(...)
+
+disass = disass_
+dump = dumpfunc
+dumpjsub = dumpjsub_
+on = dumpon
+off = dumpoff
+start = dumpon -- For -j command line option.
+
diff --git a/game/thirdparty/jit/dumphints.lua b/game/thirdparty/jit/dumphints.lua
new file mode 100644
index 0000000000..178f939c52
--- /dev/null
+++ b/game/thirdparty/jit/dumphints.lua
@@ -0,0 +1,239 @@
+----------------------------------------------------------------------------
+-- LuaJIT hints dumper module.
+--
+-- Copyright (C) 2005-2008 Mike Pall. All rights reserved.
+-- Released under the MIT/X license. See luajit.h for full copyright notice.
+----------------------------------------------------------------------------
+-- Activate this module to dump the bytecode and the hints from
+-- the optimizer for all functions to be compiled.
+--
+-- Try: luajit -O -j dumphints -e 'return 1'
+--
+-- Default output is to stderr. To redirect output to a file,
+-- pass a filename as an argument or set the environment variable
+-- "LUAJIT_DUMPHINTSFILE".
+-- Note: The file is overwritten each time you run luajit.
+--
+-- TODO: Find a way to be more selective on what to dump.
+------------------------------------------------------------------------------
+
+-- Priority for compiler pipeline. Should run before backend (positive)
+-- and should be even because we only catch successful compiles.
+local PRIORITY = 10
+
+-- Cache some library functions and objects.
+local jit = require("jit")
+assert(jit.version_num == 10105, "LuaJIT core/library version mismatch")
+local jutil = require("jit.util")
+local type, pairs, format = type, pairs, string.format
+local bytecode, const = jutil.bytecode, jutil.const
+local hints, fhints = jutil.hints, jutil.fhints
+local stdout, stderr = io.stdout, io.stderr
+
+-- Turn compilation off for the whole module. LuaJIT would do that anyway.
+jit.off(true, true)
+
+-- Separator line.
+local sepline = "-------------------------------"
+
+
+-- Pretty-print a constant.
+local function conststr(func, idx)
+ local k = const(func, idx)
+ if k == nil then return "nil"
+ elseif k == true then return "true"
+ elseif k == false then return "false"
+ elseif type(k) == "string" then
+ if #k > 10 then return format('"%.10s"~', k)
+ else return '"'..k..'"' end
+ else return k.."" end
+end
+
+-- Pretty-print a bytecode instruction.
+local function bytecodeline(func, pc, flag)
+ local op, a, b, c = bytecode(func, pc)
+ if not op then return end
+ if op == "JMP" then
+ return format("\n%04d %s JMP => %04d", pc, flag, pc+1+b)
+ end
+ if op == "FORLOOP" or op == "FORPREP" then
+ return format("\n%04d %s %-9s %3d => %04d", pc, flag, op, a, pc+1+b)
+ end
+ local s = format("\n%04d %s %-9s %3d %4s %4s",
+ pc, flag, op, a, b or "", c or "")
+ if b and b < 0 then s = s.." ; "..conststr(func, b) end
+ if c and c < 0 then s = s.." ; "..conststr(func, c) end
+ return s
+end
+
+-- Precompute inverse hints table.
+local invhints = {}
+for k,v in pairs(hints) do invhints[v] = k end
+
+-- The inverse resolver for inline functions is loaded on demand.
+local getname
+
+-- Helper functions to pretty-print hints.
+local function typehint(h, v, st, pc)
+ if st[pc+hints.INLINE] then return "" end
+ local tp = type(v)
+ if tp == "function" then
+ tp = debug.getinfo(v, "S").what
+ elseif tp == "number" and v % 1 == 0 then
+ tp = "integer"
+ elseif v == false then
+ tp = "mixed"
+ end
+ return " #"..h.."("..tp..")"
+end
+
+local hintprint = {
+ COMBINE = function(h, v, st, pc)
+ if v == false then return "" end -- Dead instructions are already marked.
+ end,
+ TYPE = typehint,
+ TYPEKEY = typehint,
+ INLINE = function(h, v, st, pc)
+ if not getname then getname = require("jit.opt_inline").getname end
+ return " #INLINE("..getname(st[pc+hints.TYPE], v)..")"
+ end,
+}
+
+-- Generate range string from table: pc[-pc] [,...]
+local function rangestring(t)
+ local s = ""
+ for i,range in ipairs(t) do
+ if i ~= 1 then s = s.."," end
+ local pc = range % 65536
+ range = (range - pc) / 65536
+ s = s..pc
+ if range ~= 0 then s = s..(-(pc+range)) end
+ end
+ return s
+end
+
+-- Dump instructions and hints for a (to be compiled) function.
+local function dumphints(st, out)
+ if not out then out = stderr end
+ local func = st.func
+ local COMBINE = hints.COMBINE
+
+ -- Need to recompute branch targets (not part of hints).
+ local target = {}
+ for pc=1,1e6 do
+ local op, a, b, c = bytecode(func, pc)
+ if not op then break end
+ if op == "JMP" or op == "FORLOOP" then
+ local t = pc+1+b
+ if st[pc+COMBINE] ~= false then target[t] = true end
+ elseif op == "LOADBOOL" and c ~= 0 then
+ target[pc+2] = true
+ end
+ end
+
+ -- Map hints to bytecode instructions.
+ local hintstr = {}
+ for k,v in pairs(st) do
+ -- CHECK: must match hint shift in ljit_hints.h:JIT_H2NUM().
+ if type(k) == "number" and k >= 65536 then
+ local pc = k % 65536
+ if pc > 0 then
+ k = k - pc
+ local h = invhints[k] or (k/65536)
+ local hp = hintprint[h]
+ local s = hp and hp(h, v, st, pc) or (" #"..h)
+ local hs = hintstr[pc]
+ hintstr[pc] = hs and (hs..s) or s
+ end
+ end
+ end
+
+ -- Write header.
+ local info = debug.getinfo(func, "S")
+ out:write(sepline, " ", info.source, ":", info.linedefined)
+
+ -- Write function hints.
+ for k,v in pairs(fhints) do
+ if st[v] then out:write("\n#", k) end
+ end
+
+ -- Write instruction hints and bytecode.
+ local function dumprange(firstpc, lastpc)
+ for pc=firstpc,lastpc do
+ local prefix = " "
+ if st[pc+COMBINE] == false then prefix = "**"
+ elseif target[pc] then prefix = "=>" end
+ local line = bytecodeline(func, pc, prefix)
+ if not line then break end
+ local h = hintstr[pc]
+ if h then
+ out:write(format("%-40s %s", line, h))
+ else
+ out:write(line)
+ end
+ end
+ end
+
+ -- Handle deoptimization range table.
+ local t = st.deopt
+ if t then
+ out:write(" DEOPT=", rangestring(t))
+ for i,range in ipairs(t) do
+ if i ~= 1 then out:write("\n----") end
+ local pc = range % 65536
+ range = (range - pc) / 65536
+ dumprange(pc, pc+range)
+ end
+ else
+ dumprange(1, 1000000)
+ end
+
+ -- Write footer.
+ out:write("\n", sepline, "\n")
+ out:flush()
+end
+
+
+-- Active flag and output file handle.
+local active, out
+
+-- Dump hints handler for compiler pipeline.
+local function h_dumphints(st)
+ local ok, err = pcall(dumphints, st, out)
+ if not ok then
+ stderr:write("\nERROR: jit.dumphints disabled: ", err, "\n")
+ jit.attach(h_dumphints) -- Better turn ourselves off after a failure.
+ if out and out ~= stdout then out:close() end
+ out = nil
+ active = nil
+ end
+end
+
+-- Detach dump handler from compiler pipeline.
+local function dumphintsoff()
+ if active then
+ active = false
+ jit.attach(h_dumphints)
+ if out and out ~= stdout then out:close() end
+ out = nil
+ end
+end
+
+-- Open the output file and attach dump handler to compiler pipeline.
+local function dumphintson(filename)
+ if active then dumphintsoff() end
+ local outfile = filename or os.getenv("LUAJIT_DUMPHINTSFILE")
+ out = outfile and (outfile == "-" and stdout or assert(io.open(outfile, "w")))
+ jit.attach(h_dumphints, PRIORITY)
+ active = true
+end
+
+
+-- Public module functions.
+module(...)
+
+dump = dumphints
+on = dumphintson
+off = dumphintsoff
+start = dumphintson -- For -j command line option.
+
diff --git a/game/thirdparty/jit/opt.lua b/game/thirdparty/jit/opt.lua
new file mode 100644
index 0000000000..7eb5030af1
--- /dev/null
+++ b/game/thirdparty/jit/opt.lua
@@ -0,0 +1,508 @@
+----------------------------------------------------------------------------
+-- LuaJIT optimizer.
+--
+-- Copyright (C) 2005-2008 Mike Pall. All rights reserved.
+-- Released under the MIT/X license. See luajit.h for full copyright notice.
+----------------------------------------------------------------------------
+-- This module contains a simple optimizer that generates some hints for
+-- the compiler backend.
+--
+-- Compare: luajit -j dump -e 'return 1'
+-- with: luajit -O -j dumphints -j dump -e 'return 1'
+--
+-- This module uses a very simplistic (but fast) abstract interpretation
+-- algorithm. It mostly ignores control flow and/or basic block boundaries.
+-- Thus the results of the analysis are really only predictions (e.g. about
+-- monomorphic use of operators). The backend _must_ check all contracts
+-- (e.g. verify the object type) and use a (polymorphic) fallback or
+-- deoptimization in case a contract is broken.
+--
+-- Although simplistic, the generated hints are pretty accurate. Note that
+-- some hints are really definitive and don't need to be checked (like
+-- COMBINE or FOR_STEP_K).
+--
+-- TODO: Try MFP with an extended lattice. But it's unclear whether the
+-- added complexity really pays off with the current backend.
+------------------------------------------------------------------------------
+
+-- Priority for compiler pipeline. Right in the middle before the backend.
+local PRIORITY = 50
+
+-- Default optimizer level, i.e. what you get with -O.
+-- Caveat: this may change in the future when more optimizations are added.
+local OPTLEVEL = 2
+
+-- Heuristic limits for what the compiler should reasonably handle.
+-- Functions outside these limits are unlikely to be run more than once.
+-- Maybe a bit on the generous side. Check ljit.h for backend limits, too.
+-- TODO: make it depend on the bytecode distribution, too.
+local LIMITS = {
+ bytecodes = 4000,
+ stackslots = 150,
+ params = 20,
+ consts = 200,
+ subs = 30,
+}
+
+-- Cache some library functions and objects.
+local jit = require("jit")
+assert(jit.version_num == 10105, "LuaJIT core/library version mismatch")
+local jutil = require("jit.util")
+local type, rawget, next, pcall = type, rawget, next, pcall
+local bytecode, const = jutil.bytecode, jutil.const
+local hints, fhints = jutil.hints, jutil.fhints
+local getmetatable = getmetatable
+
+-- Turn compilation off for the whole module. LuaJIT would do that anyway.
+jit.off(true, true)
+
+-- Default optimizer level after loading. But -O runs setlevel(), too.
+local optlevel = -1
+
+
+-- Use iterative path marking to mark live instructions and branch targets.
+local function marklive(func)
+ local live, work, workn, pc = {}, {}, 0, 1
+ repeat
+ repeat
+ local op, a, b, c, test = bytecode(func, pc)
+ live[pc] = true
+ pc = pc + 1
+ if op == "JMP" then
+ pc = pc + b
+ live[-pc] = true
+ elseif op == "FORLOOP" then
+ local mpc = -pc
+ live[mpc - b] = true
+ live[mpc] = true
+ elseif op == "RETURN" then
+ break
+ elseif test then
+ local fpc = pc + 1
+ -- No need for fallthrough target mark live[-fpc] in our analysis.
+ if not live[fpc] then -- Add fallthrough path to work list.
+ workn = workn + 1
+ work[workn] = fpc
+ end
+ elseif op == "CLOSURE" then
+ pc = pc + jutil.closurenup(func, b) -- Do not mark pseudo-ins live.
+ elseif op == "LOADBOOL" and c ~= 0 then
+ pc = pc + 1
+ live[-pc] = true
+ elseif op == "SETLIST" and c == 0 then
+ pc = pc + 1 -- Do not mark pseudo-ins live.
+ end
+ until live[pc]
+ if workn == 0 then return live end -- Return if work list is empty.
+ pc = work[workn] -- Else fetch next path to mark from work list.
+ workn = workn - 1
+ until false
+end
+
+
+-- Empty objects.
+local function empty() end
+
+-- Dummy function to set call hints. Replaced when jit.opt_inline is loaded.
+local function callhint(st, slot, pc, base, narg, nres)
+ st[pc+hints.TYPE] = slot[base]
+ for i=base,base+nres-1 do slot[i] = nil end
+end
+
+-- Set TYPE hint, but only for numbers, strings or tables.
+local function typehint(st, pc, o)
+ local tp = type(o)
+ if tp == "number" or tp == "string" or tp == "table" then
+ st[pc+hints.TYPE] = o
+ end
+end
+
+-- Set TYPE and TYPEKEY hints for table operations.
+local function tablehint(st, slot, pc, t, kslot)
+ local tp = type(t)
+ if tp == "table" or tp == "userdata" then st[pc+hints.TYPE] = t end
+ if kslot >= 0 then -- Don't need this hint for constants.
+ local key = slot[kslot]
+ local tp = type(key)
+ if tp == "number" or tp == "string" then st[pc+hints.TYPEKEY] = key end
+ end
+end
+
+-- Try to lookup a value. Guess the value or at least the value type.
+local function trylookup(st, t, k)
+ if k == nil then return nil end
+ if type(t) == "table" then
+ local v = rawget(t, k)
+ if v ~= nil then return v end
+ end
+ local mt = getmetatable(t)
+ if type(mt) == "table" then
+ -- One __index level is enough for our purposes.
+ local it = rawget(mt, "__index")
+ if type(it) == "table" then
+ local v = rawget(it, k)
+ if v ~= nil then return v end
+ end
+ end
+ local v = st.tableval[t] -- Resort to a generic guess.
+ if v == nil and type(t) == "table" then v = next(t) end -- Getting desperate.
+ return v
+end
+
+-- Check whether the previous instruction sets a const.
+local function prevconst(st, slot, pc, reg)
+ if st.live[-pc] == nil then -- Current instruction must not be a target.
+ local op, ka, kb = bytecode(st.func, pc-1)
+ if ka == reg and (op == "LOADK" or op == "LOADBOOL" or
+ (op == "LOADNIL" and kb == reg)) then
+ return true, slot[reg]
+ end
+ end
+end
+
+-- Common handler for arithmetic and comparison opcodes.
+local function arithop(st, slot, pc, a, b, c, op)
+ local sb, sc = slot[b], slot[c]
+ if sb == nil then sb = sc elseif sc == nil then sc = sb end
+ local tb, tc = type(sb), type(sc)
+ if tb == tc then
+ if tb == "number" then -- Improve the guess for numbers.
+ if op == "DIV" or sb % 1 ~= 0 or sc % 1 ~= 0 then
+ sb = 0.5 -- Probably a non-integral number.
+ else
+ sb = 1 -- Optimistic guess.
+ end
+ end
+ if sb ~= nil then st[pc+hints.TYPE] = sb end
+ else
+ st[pc+hints.TYPE] = false -- Marker for mixed types.
+ end
+ if op ~= "LT" and op ~= "LE" then
+ slot[a] = sb -- Assume coercion to 1st type if different.
+ end
+end
+
+-- Common handler for TEST and TESTSET.
+local function testop(st, slot, pc, a, b, c)
+ -- Optimize the 'expr and k1 or k2' idiom.
+ local ok, k = prevconst(st, slot, pc, b)
+ if k and a == b then
+ st[pc+hints.COMBINE] = false -- Kill the TEST/TESTSET.
+ if c == 0 then st.live[pc+1] = nil end -- Kill the JMP.
+ end
+ slot[a] = slot[b]
+end
+
+-- Dispatch table for opcode handlers.
+local handler = {
+ MOVE = function(st, slot, pc, a, b, c)
+ slot[a] = slot[b]
+ end,
+
+ LOADK = function(st, slot, pc, a, b, c)
+ slot[a] = const(st.func, b)
+ end,
+
+ LOADBOOL = function(st, slot, pc, a, b, c)
+ slot[a] = (b == 1)
+ end,
+
+ LOADNIL = function(st, slot, pc, a, b, c)
+ for i=a,b do slot[i] = nil end
+ end,
+
+ GETUPVAL = function(st, slot, pc, a, b, c)
+ slot[a] = jutil.upvalue(st.func, b)
+ end,
+
+ GETGLOBAL = function(st, slot, pc, a, b, c)
+ slot[a] = trylookup(st, st.stats.env, const(st.func, b))
+ end,
+
+ GETTABLE = function(st, slot, pc, a, b, c)
+ local t = slot[b]
+ tablehint(st, slot, pc, t, c)
+ slot[a] = trylookup(st, t, slot[c])
+ end,
+
+ SETGLOBAL = empty,
+
+ SETUPVAL = empty, -- TODO: shortcut -- but this is rare?
+
+ SETTABLE = function(st, slot, pc, a, b, c)
+ local t = slot[a]
+ tablehint(st, slot, pc, t, b)
+ if type(t) == "table" or type(t) == "userdata" then -- Must validate setkey.
+ local val = slot[c]
+ if val ~= nil then st.tableval[t] = val end
+ end
+ end,
+
+ NEWTABLE = function(st, slot, pc, a, b, c)
+ slot[a] = {} -- Need unique tables for indexing st.tableval.
+ end,
+
+ SELF = function(st, slot, pc, a, b, c)
+ local t = slot[b]
+ tablehint(st, slot, pc, t, c)
+ slot[a+1] = t
+ slot[a] = trylookup(st, t, slot[c])
+ end,
+
+ ADD = arithop, SUB = arithop, MUL = arithop, DIV = arithop,
+ MOD = arithop, POW = arithop, LT = arithop, LE = arithop,
+
+ UNM = function(st, slot, pc, a, b, c)
+ return arithop(st, slot, pc, a, b, b, "UNM")
+ end,
+
+ NOT = function(st, slot, pc, a, b, c)
+ slot[a] = true
+ end,
+
+ LEN = function(st, slot, pc, a, b, c)
+ typehint(st, pc, slot[b])
+ slot[a] = 1
+ end,
+
+ CONCAT = function(st, slot, pc, a, b, c)
+ local mixed
+ local sb = slot[b]
+ for i=b+1,c do
+ local si = slot[i]
+ if sb == nil then
+ sb = si
+ elseif si ~= nil and type(sb) ~= type(si) then
+ mixed = true
+ break
+ end
+ end
+ if sb == nil then
+ sb = ""
+ else
+ st[pc+hints.TYPE] = not mixed and sb or false
+ if type(sb) == "number" then sb = "" end
+ end
+ slot[a] = sb -- Assume coercion to 1st type (if different) or string.
+ end,
+
+ JMP = function(st, slot, pc, a, b, c)
+ if b >= 0 then -- Kill JMPs across dead code.
+ local tpc = pc + b
+ while not st.live[tpc] do tpc = tpc - 1 end
+ if tpc == pc then st[pc+hints.COMBINE] = false end
+ end
+ end,
+
+ EQ = function(st, slot, pc, a, b, c)
+ if b >= 0 and c >= 0 then typehint(st, pc, slot[b] or slot[c]) end
+ end,
+
+ TEST = function(st, slot, pc, a, b, c)
+ return testop(st, slot, pc, a, a, c)
+ end,
+
+ TESTSET = testop,
+
+ CALL = function(st, slot, pc, a, b, c)
+ callhint(st, slot, pc, a, b-1, c-1)
+ end,
+
+ TAILCALL = function(st, slot, pc, a, b, c)
+ callhint(st, slot, pc, a, b-1, -1)
+ end,
+
+ RETURN = function(st, slot, pc, a, b, c)
+ if b == 2 and prevconst(st, slot, pc, a) then
+ st[pc-1+hints.COMBINE] = true -- Set COMBINE hint for prev. instruction.
+ end
+ end,
+
+ FORLOOP = empty,
+
+ FORPREP = function(st, slot, pc, a, b, c)
+ local ok, step = prevconst(st, slot, pc, a+2)
+ if type(step) == "number" then
+ st[pc+hints.FOR_STEP_K] = step
+ end
+ local nstart, nstep = slot[a], slot[a+2]
+ local tnstart, tnstep = type(nstart), type(nstep)
+ local ntype = ((tnstart == "number" and nstart % 1 ~= 0) or
+ (tnstep == "number" and nstep % 1 ~= 0)) and 0.5 or 1
+ slot[a+3] = ntype
+ if tnstart == "number" and tnstep == "number" and
+ type(slot[a+1]) == "number" then
+ st[pc+hints.TYPE] = ntype
+ end
+ end,
+
+ -- TFORLOOP is at the end of the loop. Setting slots would be pointless.
+ -- Inlining is handled by the corresponding iterator constructor (CALL).
+ TFORLOOP = function(st, slot, pc, a, b, c)
+ st[pc+hints.TYPE] = slot[a]
+ end,
+
+ SETLIST = function(st, slot, pc, a, b, c)
+ -- TODO: if only (numeric) const: shortcut (+ nobarrier).
+ local t = slot[a]
+ -- Very imprecise. But better than nothing.
+ if type(t) == "table" then st.tableval[t] = slot[a+1] end
+ end,
+
+ CLOSE = empty,
+
+ CLOSURE = function(st, slot, pc, a, b, c)
+ slot[a] = empty
+ if st.noclose then
+ local nup = jutil.closurenup(st.func, b)
+ for i=pc+1,pc+nup do
+ local op = bytecode(st.func, i)
+ if op == "MOVE" then
+ st.noclose = false
+ return
+ end
+ end
+ end
+ end,
+
+ VARARG = function(st, slot, pc, a, b, c)
+ local params = st.stats.params
+ for i=1,b do slot[a+i-1] = st[params+i] end
+ end,
+}
+
+-- Generate some hints for the compiler backend.
+local function optimize(st)
+ -- Deoptimization is simple: just don't generate any hints. :-)
+ if st.deopt then return end
+
+ local func = st.func
+ local stats = jutil.stats(func)
+ if not stats then return jutil.status.COMPILER_ERROR end -- Eh?
+
+ -- Check limits.
+ if stats.bytecodes > LIMITS.bytecodes or
+ stats.stackslots > LIMITS.stackslots or
+ stats.params > LIMITS.params or
+ stats.consts > LIMITS.consts or
+ stats.subs > LIMITS.subs then
+ return jutil.status.TOOLARGE
+ end
+
+ -- Mark live instructions (live[pc]) and branch targets (live[-pc]).
+ local live = marklive(func)
+
+ -- Handlers need access to some temporary state fields.
+ st.noclose = true
+ st.stats = stats
+ st.live = live
+ st.tableval = { [stats.env] = empty } -- Guess: unknown globals are functions.
+
+ -- Initialize slots with argument hints and constants.
+ local slot = {}
+ for i=1,stats.params do slot[i-1] = st[i] end
+ for i=-1,-256,-1 do -- No need to copy non-RK-able consts.
+ local k, ok = const(func, i)
+ if not ok then break end
+ slot[i] = k
+ end
+
+ -- Step through all live instructions, update slots and add hints.
+ for pc=1,stats.bytecodes do
+ if live[pc] then
+ local op, a, b, c, test = bytecode(func, pc)
+ handler[op](st, slot, pc, a, b, c, op)
+ else
+ st[pc+hints.COMBINE] = false -- Dead instruction hint.
+ end
+ end
+
+ -- Update function hints.
+ if st.noclose then st[fhints.NOCLOSE] = true end
+
+ -- Clear temporary state fields.
+ st.noclose = nil
+ st.stats = nil
+ st.live = nil
+ st.tableval = nil
+end
+
+
+-- Active flags.
+local active, active_opt_inline
+
+-- Handler for compiler pipeline.
+local function h_opt(st)
+ if optlevel <= 0 then return end
+ local ok, err = pcall(optimize, st)
+ if not ok then
+ io.stderr:write("\nERROR: jit.opt disabled: ", err, "\n")
+ jit.attach(h_opt) -- Better turn ourselves off after a failure.
+ active = nil
+ else
+ if err then return err end
+ end
+end
+
+-- Load add-on module.
+local function loadaddon(opt)
+ local name, val = string.match(opt, "^(.-)=(.*)$") -- Strip value.
+ if not name then name = opt end
+ name = "jit.opt_"..name
+ local ok, mod = pcall(require, name)
+ if not ok then
+ -- Return error if not installed, but propagate other errors.
+ if string.sub(mod, 1, 7) ~= "module " then error(mod, 0) end
+ return "optimizer add-on module "..name.." not found"
+ end
+ mod.start(val)
+end
+
+-- Attach optimizer and set optimizer level or load add-on module.
+local function setlevel_(opt)
+ -- Easier to always attach the optimizer (even for -O0).
+ if not active then
+ jit.attach(h_opt, PRIORITY)
+ active = true
+ end
+
+ -- Parse -O<level> or -O<name[=value]>.
+ if opt == nil or opt == "" then
+ optlevel = OPTLEVEL
+ else
+ local level = tonumber(opt) -- Numeric level?
+ if level then
+ if level < 0 or level % 1 ~= 0 then
+ error("bad optimizer level", 0)
+ end
+ optlevel = level
+ else
+ if optlevel == -1 then optlevel = OPTLEVEL end
+ local err = loadaddon(opt)
+ if err then error(err, 0) end
+ end
+ end
+
+ -- Load add-on module for inlining functions for -O2 and above.
+ if not active_opt_inline and optlevel >= 2 then
+ loadaddon("inline") -- Be silent if not installed.
+ active_opt_inline = true -- Try this only once.
+ end
+end
+
+
+-- Public module functions.
+module(...)
+
+-- Callback to allow attaching a call hinter. Used by jit.opt_inline.
+function attach_callhint(f)
+ callhint = f
+end
+
+function getlevel()
+ return optlevel
+end
+
+setlevel = setlevel_
+start = setlevel_ -- For -O command line option.
+
diff --git a/game/thirdparty/jit/opt_inline.lua b/game/thirdparty/jit/opt_inline.lua
new file mode 100644
index 0000000000..990bffd604
--- /dev/null
+++ b/game/thirdparty/jit/opt_inline.lua
@@ -0,0 +1,397 @@
+----------------------------------------------------------------------------
+-- LuaJIT optimizer add-on module for function inlining.
+--
+-- Copyright (C) 2005-2008 Mike Pall. All rights reserved.
+-- Released under the MIT/X license. See luajit.h for full copyright notice.
+----------------------------------------------------------------------------
+-- This is a simple framework for C function signature maps.
+-- It helps with type propagation and C function inlining.
+--
+-- This module is automatically loaded with -O2 and above.
+-- By default most standard library functions are added.
+--
+-- TODO: generalize it, e.g. for back propagation (i.e. arg types).
+-- TODO: extend it for Lua functions (but need to analyze them before use).
+------------------------------------------------------------------------------
+
+-- Cache some library functions and objects.
+local jit = require("jit")
+assert(jit.version_num == 10105, "LuaJIT core/library version mismatch")
+local jutil = require("jit.util")
+local type, rawget, next = type, rawget, next
+local hints, fhints = jutil.hints, jutil.fhints
+local sub, match, gsub = string.sub, string.match, string.gsub
+
+-- Turn compilation off for the whole module. LuaJIT would do that anyway.
+jit.off(true, true)
+
+-- Prototypical objects used for type hints.
+local TABLE = {}
+local CFUNC = collectgarbage -- Pretty sure this is never inlined.
+
+
+-- Map from C closures to signatures. Cannot use a weak table.
+-- Closures must be kept alive because inlining checks against their addrs.
+local map_sign = {}
+
+-- For jit.dumphints: get printable name for TYPE hint: "#INLINE(foo.bar)".
+local function getname_(f, idx)
+ local sign = map_sign[f]
+ if sign then
+ local libname, name = sign.libname, sign.name
+ if libname then
+ return libname.."."..name
+ else
+ return name
+ end
+ elseif idx == 0 then
+ return "recursive"
+ else
+ return "?"
+ end
+end
+
+-- Name, base table and running index for convenience functions.
+-- CHECK: the library index and the order below must match with ljit_hints.h
+local flibname, flib, fidx
+
+local function fadd(name, results, args, handler)
+ local f = rawget(flib, name)
+ if f then
+ map_sign[f] = {
+ libname = flibname, name = name, idx = fidx,
+ results = results, args = args, handler = handler,
+ }
+ end
+ if fidx then fidx = fidx + 1 end
+end
+
+local function faddf(name, f, results, args, handler)
+ map_sign[f] = {
+ libname = flibname, name = name, idx = fidx,
+ results = results, args = args, handler = handler,
+ }
+ if fidx then fidx = fidx + 1 end
+end
+
+
+-- Signature handler: copy first argument to first result.
+local function copyfirst(st, slot, pc, base, narg, nres)
+ slot[base] = slot[base+1]
+end
+
+-- Helper for iterators: check if the function is an iterator constructor.
+--
+-- 'for ivars in func(args) do body end'
+--
+-- ...load func+args...
+-- CALL func <-- pc
+-- JMP fwd ---+
+-- back: | <--+
+-- ...body... | |
+-- fwd: <--+ |
+-- TFORLOOP ivars | <-- tforpc
+-- JMP back ---+
+--
+local function itercheck(st, slot, pc, base, idx)
+ if idx then
+ local bytecode, func = jutil.bytecode, st.func
+ local op, _, fwd = bytecode(func, pc+1)
+ if op == "JMP" then
+ local tforpc = pc+2+fwd
+ local op, tfbase, _, tfnres = bytecode(func, tforpc)
+ if op == "TFORLOOP" and tfbase == base and tfnres <= 2 then
+ local op, _, back = bytecode(func, tforpc+1)
+ if op == "JMP" and fwd+back == -2 then
+ -- Must set inlining hint for TFORLOOP instruction here.
+ st[tforpc+hints.INLINE] = idx -- Serves as iterator index, too.
+ return -- Inline it.
+ end
+ end
+ end
+ end
+ slot[base] = CFUNC -- Better make it different from pairs.
+ return true -- Better not inline it, if not used in a for statement.
+end
+
+-- Helper for pairs/next: guess result types for standard table iterator.
+local function guessnext(st, slot, base, dest)
+ local t, k, v = slot[base+1]
+ if type(t) == "table" then
+ k, v = next(t)
+ if v == nil then v = st.tableval[t] end
+ end
+ slot[dest] = k or "" -- Strings are a good guess for the key type.
+ slot[dest+1] = v -- But better not guess any fixed value type.
+end
+
+
+-- Signatures for base library functions.
+-- Note: Only add functions where result type hints or inlining makes sense.
+flibname, flib, fidx = nil, _G, 65536*1
+fadd("pairs", "..0", "T",
+ function(st, slot, pc, base, narg, nres, idx)
+ -- Table in slot[base+1] is kept (2nd result = 1st arg).
+ -- Fill result slots for the iterator here (TFORLOOP is at the end).
+ guessnext(st, slot, base, base+3)
+ return itercheck(st, slot, pc, base, idx)
+ end)
+
+fadd("ipairs", "..I", "T",
+ function(st, slot, pc, base, narg, nres, idx)
+ -- Table in slot[base+1] is kept (2nd result = 1st arg).
+ -- Fill result slots for the iterator here (TFORLOOP is at the end).
+ local t = slot[base+1]
+ slot[base+3] = 1 -- Integer key.
+ local v
+ if type(t) == "table" then
+ v = rawget(t, 1)
+ if v == nil then v = st.tableval[t] end
+ end
+ slot[base+4] = v
+ return itercheck(st, slot, pc, base, idx)
+ end)
+
+fidx = nil -- Pure result type signatures follow:
+fadd("next", "..", "T.?",
+ function(st, slot, pc, base, narg, nres)
+ guessnext(st, slot, base, base)
+ end)
+fadd("type", "S", ".")
+fadd("getmetatable", "T", ".")
+fadd("setmetatable", ".", "TT?", copyfirst)
+fadd("rawequal", "B", "..")
+fadd("rawget", ".", "T.",
+ function(st, slot, pc, base, narg, nres)
+ local t = slot[base+1]
+ slot[base] = type(t) == "table" and rawget(t, slot[base+2]) or ""
+ end)
+fadd("rawset", ".", "T..", copyfirst)
+fadd("assert", "*", "..*",
+ function(st, slot, pc, base, narg, nres)
+ for i=1,nres do slot[base+i-1] = i <= narg and slot[base+i] or nil end
+ end)
+fadd("tonumber", "I", ".I?")
+fadd("tostring", "S", ".")
+fadd("require", "T", "S")
+
+-- Signatures for coroutine library functions.
+flibname, flib, fidx = "coroutine", coroutine, 65536*2
+if flib then
+ fadd("yield", "*", ".*")
+ fadd("resume", "*", "R.*",
+ function(st, slot, pc, base, narg, nres)
+ slot[base] = true
+ for i=1,nres-1 do slot[base+i] = nil end -- No guess.
+ end)
+
+ fidx = nil -- Pure result type signatures follow:
+ fadd("wrap", "C", "F")
+end
+
+-- Signatures for string library functions.
+flibname, flib, fidx = "string", string, 65536*3
+if flib then
+ fadd("len", "I", "S")
+ fadd("sub", "S", "SII?")
+ fadd("char", "S", "I*")
+
+ fidx = nil -- Pure result type signatures follow:
+ fadd("byte", "I", "S",
+ function(st, slot, pc, base, narg, nres)
+ for i=0,nres-1 do slot[base+i] = 1 end -- Set all result hints.
+ end)
+ fadd("rep", "S", "SI")
+ fadd("reverse", "S", "S")
+ fadd("upper", "S", "S")
+ fadd("lower", "S", "S")
+
+ fadd("format", "S", "S.*")
+ fadd("find", "*", "SSI?.?",
+ function(st, slot, pc, base, narg, nres)
+ slot[base] = 1
+ slot[base+1] = 1
+ for i=2,nres-1 do slot[base+i] = "" end -- Hints for matches.
+ end)
+ fadd("match", "*", "SSI?",
+ function(st, slot, pc, base, narg, nres)
+ for i=0,nres-1 do slot[base+i] = "" end -- Hints for matches.
+ end)
+ fadd("gsub", "SI", "SSGI?")
+ fadd("gmatch", "C00", "SS",
+ function(st, slot, pc, base, narg, nres)
+ -- Fill result slots for gmatch_iter here (TFORLOOP is at the end).
+ for i=base+3,st.stats.stackslots-1 do slot[i] = "" end
+ end)
+ -- The gmatch iterator itself is never inlined. No point in adding it.
+end
+
+-- Signatures for table library functions.
+flibname, flib, fidx = "table", table, 65536*4
+if flib then
+ fadd("insert", "", "TI?.")
+ fadd("remove", ".", "T",
+ function(st, slot, pc, base, narg, nres)
+ if nres >= 1 then
+ local t = slot[base+1]
+ slot[base] = type(t) == "table" and rawget(t, 1) or ""
+ end
+ end)
+ fadd("getn", "I", "T")
+
+ fidx = nil -- Pure result type signatures follow:
+ fadd("concat", "S", "TS?I?I?")
+end
+
+-- Signatures for math library functions.
+flibname, flib, fidx = "math", math, 65536*5
+if flib then
+ -- 1 arg, 1 result.
+ fadd("log", "N", "N")
+ fadd("log10", "N", "N")
+ fadd("exp", "N", "N")
+ fadd("sinh", "N", "N")
+ fadd("cosh", "N", "N")
+ fadd("tanh", "N", "N")
+ fadd("asin", "N", "N")
+ fadd("acos", "N", "N")
+ fadd("atan", "N", "N")
+ fadd("sin", "N", "N")
+ fadd("cos", "N", "N")
+ fadd("tan", "N", "N")
+ fadd("ceil", "I", "N")
+ fadd("floor", "I", "N")
+ fadd("abs", ".", "N", copyfirst)
+ fadd("sqrt", "N", "N")
+ -- 2 args, 1 result.
+ -- math.fmod is aliased to math.mod for compatibility.
+ fadd("fmod", ".", "NN",
+ function(st, slot, pc, base, narg, nres)
+ slot[base] = slot[base+2] or 1 -- Copy integer or number hint.
+ end)
+ fadd("atan2", "N", "NN")
+
+ fidx = nil -- Pure result type signatures follow:
+ -- 1-n args, 1 result.
+ fadd("min", ".", "NN*", copyfirst) -- Really depends on all args.
+ fadd("max", ".", "NN*", copyfirst) -- Really depends on all args.
+ -- 1 arg, 1 result.
+ fadd("deg", "N", "N")
+ fadd("rad", "N", "N")
+ -- 1 arg, 2 results.
+ fadd("modf", "IN", "N")
+ fadd("frexp", "NI", "N")
+ -- 2 args, 1 result.
+ fadd("pow", "N", "NN")
+ fadd("ldexp", ".", "NI", copyfirst)
+ -- 1 arg, 0 results.
+ fadd("randomseed", "", "I")
+ -- 0-2 args, 1 result.
+ fadd("random", "N", "I?I?",
+ function(st, slot, pc, base, narg, nres)
+ if narg > 0 then slot[base] = 1 end
+ end)
+end
+
+-- Signatures for I/O library functions.
+-- Not inlined anytime soon. Used for result types only.
+flibname, flib, fidx = "io", io, nil
+if flib then
+ fadd("lines", "C00S", "S?")
+ fadd("read", "S", "") -- Simplified (a lot).
+ -- Adding io methods doesn't work, because we don't deal with userdata (yet).
+end
+
+
+-- Type names to argument type shorthands.
+-- TODO: make the matches more exact? Need to differentiate nil/unknown.
+local map_argtype = {
+ ["nil"] = "0", boolean = "b", number = "n", string = "s",
+ table = "t", ["function"] = "f", userdata = "u", thread = "r",
+}
+
+-- Complex argument match patterns to regexp fragments.
+local map_argmatch = {
+ B = "[b0]", S = "[s0]", T = "[t0]", F = "[f0]", U = "[u0]", R = "[r0]",
+ N = "[n0]", I = "[n0]", -- Number/int args are the same for now.
+ G = "[stf0]", -- For string.gsub.
+}
+
+-- Result type shorthands to sample types.
+local map_restype = {
+ -- ["0"] = nil,
+ B = true, S = "", T = {},
+ N = 0.5, I = 1,
+ L = function() end, C = collectgarbage, -- Pretty sure this is never inlined.
+}
+
+-- Create argument match regexp and cache it.
+local function getargmatch(sign)
+ local argmatch = "^"..gsub(sign.args, ".", map_argmatch).."0*$"
+ sign.argmatch = argmatch
+ return argmatch
+end
+
+-- Set INLINE hints and result types for known C functions.
+local function inlinehint(sign, st, slot, pc, base, narg, nres)
+ local idx = sign.idx
+ if idx then
+ if narg ~= -1 then
+ local argpat = ""
+ for i=1,narg do argpat = argpat..map_argtype[type(slot[base+i])] end
+ if not match(argpat, sign.argmatch or getargmatch(sign)) then
+ idx = nil
+ end
+ end
+ end
+
+ local results = sign.results
+ if results ~= "*" and nres ~= -1 then
+ if nres > #results then idx = nil end
+ for i=1,#results do
+ local c = sub(results, i, i)
+ if c ~= "." then slot[base+i-1] = map_restype[c] end
+ end
+ end
+
+ local handler = sign.handler
+ if handler and handler(st, slot, pc, base, narg, nres, idx) then idx = nil end
+
+ if idx then st[pc+hints.INLINE] = idx end
+end
+
+-- Set call hints and result types during forward propagation.
+local function fwdcallhint(st, slot, pc, base, narg, nres)
+ local f = slot[base]
+ st[pc+hints.TYPE] = f
+ if type(f) == "function" then
+ local sign = map_sign[f]
+ if sign then
+ inlinehint(sign, st, slot, pc, base, narg, nres)
+ return
+ end
+ if f == st.func and not st.stats.isvararg and
+ (narg == -1 or narg == st.stats.params) then
+ st[pc+hints.INLINE] = 0 -- Recursive call.
+ end
+ end
+ -- Clear result types for unknown functions.
+ for i=base,base+nres-1 do slot[i] = nil end
+end
+
+
+-- Attach call hinter to optimizer.
+local function start_()
+ local jopt = require "jit.opt"
+ jopt.attach_callhint(fwdcallhint)
+ -- Note that just loading the optimizer does not start it, yet.
+end
+
+
+-- Public module functions.
+module(...)
+
+-- TODO: Public API to add signatures. Alas, the API is still in flux.
+getname = getname_
+start = start_
+
diff --git a/game/thirdparty/jit/trace.lua b/game/thirdparty/jit/trace.lua
new file mode 100644
index 0000000000..b485707fc5
--- /dev/null
+++ b/game/thirdparty/jit/trace.lua
@@ -0,0 +1,111 @@
+----------------------------------------------------------------------------
+-- LuaJIT compiler tracing module.
+--
+-- Copyright (C) 2005-2008 Mike Pall. All rights reserved.
+-- Released under the MIT/X license. See luajit.h for full copyright notice.
+----------------------------------------------------------------------------
+-- Activate this module to trace the progress of the JIT compiler.
+--
+-- Try: luajit -j trace -e 'print "foo"'
+-- luajit -j trace=foo.trace foo.lua
+--
+-- Default output is to stderr. To redirect output to a file,
+-- pass a filename as an argument or set the environment variable
+-- "LUAJIT_TRACEFILE".
+-- Note: the file is overwritten each time you run luajit.
+------------------------------------------------------------------------------
+
+-- Priority for compiler pipeline. Must run after backend (negative)
+-- and should be odd to catch compiler errors, too.
+local PRIORITY = -99
+
+-- Cache some library functions and objects.
+local jit = require("jit")
+assert(jit.version_num == 10105, "LuaJIT core/library version mismatch")
+local jutil = require("jit.util")
+local type, tostring, sub, format = type, tostring, string.sub, string.format
+local getinfo, justats = debug.getinfo, jutil.stats
+local stdout, stderr = io.stdout, io.stderr
+
+-- Turn compilation off for the whole module. LuaJIT would do that anyway.
+jit.off(true, true)
+
+-- Active flag and output file handle.
+local active, out
+
+-- Generate range string from table: pc[-pc] [,...]
+local function rangestring(t)
+ local s = ""
+ for i,range in ipairs(t) do
+ if i ~= 1 then s = s.."," end
+ local pc = range % 65536
+ range = (range - pc) / 65536
+ s = s..pc
+ if range ~= 0 then s = s..(-(pc+range)) end
+ end
+ return s
+end
+
+-- Trace handler for compiler pipeline.
+local function h_trace(st, status)
+ local o = out or stderr
+ local func = st.func
+ if type(func) ~= "function" then return end
+ local info = getinfo(func, "S")
+ local src, line = info.source, info.linedefined or 0
+ if src then
+ if sub(src, 1, 1) == "@" or sub(src, 1, 2) == "=(" then
+ src = sub(src, 2)
+ else
+ src = "**"..string.gsub(sub(src, 1, 40), "%c", " ").."**"
+ end
+ else
+ src = "?"
+ end
+ local aux = st.deopt and " DEOPT="..rangestring(st.deopt) or ""
+ if status == nil then
+ local stats = justats(func)
+ if not stats then return end
+ o:write(format("[LuaJIT: OK %4d %6d %s:%d%s]\n",
+ stats.bytecodes, stats.mcodesize or -1, src, line, aux))
+ return
+ else
+ local stname = jit.util.status[status] or status
+ local pc, err = st.dasm_pc, st.dasm_err
+ if type(pc) == "number" and type(err) == "number" then
+ local op = jutil.bytecode(func, pc) or "END"
+ o:write(format("[LuaJIT: %s %s@%d %08x %s:%d%s]\n",
+ stname, op, pc, err, src, line, aux))
+ else
+ o:write(format("[LuaJIT: %s %s:%d%s]\n", stname, src, line, aux))
+ end
+ end
+end
+
+-- Detach trace handler from compiler pipeline.
+local function traceoff()
+ if active then
+ active = false
+ jit.attach(h_trace)
+ if out and out ~= stdout then out:close() end
+ out = nil
+ end
+end
+
+-- Open the output file and attach trace handler to compiler pipeline.
+local function traceon(filename)
+ if active then traceoff() end
+ local outfile = filename or os.getenv("LUAJIT_TRACEFILE")
+ out = outfile and (outfile == "-" and stdout or assert(io.open(outfile, "w")))
+ jit.attach(h_trace, PRIORITY)
+ active = true
+end
+
+
+-- Public module functions.
+module(...)
+
+on = traceon
+off = traceoff
+start = traceon -- For -j command line option.
+
diff --git a/premake4.lua b/premake4.lua
index c269221027..6515d934ff 100644
--- a/premake4.lua
+++ b/premake4.lua
@@ -1,9 +1,22 @@
+newoption {
+ trigger = "lua",
+ value = "VM_Type",
+ description = "Virtual Machine to use for Lua, either the default one or a JIT",
+ allowed = {
+ { "default", "Default Lua Virtual Machine" },
+ { "jitx86", "LuaJIT x86" }
+ }
+}
+
+_OPTIONS.lua = _OPTIONS.lua or "default"
+
solution "TEngine"
configurations { "Debug", "Release" }
objdir "obj"
includedirs {
"src",
+ "src/dynasm",
"src/lua",
"src/luasocket",
"src/fov",
@@ -24,8 +37,8 @@ configuration "Debug"
configuration "Release"
defines { "NDEBUG=1" }
- flags { "Optimize" }
- buildoptions { "-O2" }
+ flags { "Optimize", "NoFramePointer" }
+ buildoptions { "-O3" }
targetdir "bin/Release"
project "TEngine"
@@ -33,7 +46,7 @@ project "TEngine"
language "C"
targetname "t-engine"
files { "src/*.c", }
- links { "physfs", "lua", "fov", "luasocket", "luaprofiler", "lualanes" }
+ links { "physfs", "lua".._OPTIONS.lua, "fov", "luasocket", "luaprofiler", "lualanes" }
defines { "_DEFAULT_VIDEOMODE_FLAGS_='SDL_HWSURFACE|SDL_DOUBLEBUF'" }
defines { [[TENGINE_HOME_PATH='".t-engine"']] }
@@ -85,12 +98,22 @@ project "physfs"
files { "src/physfs/platform/macosx.c", "src/physfs/platform/posix.c", }
includedirs { "/Library/Frameworks/SDL.framework/Headers" }
-project "lua"
- kind "StaticLib"
- language "C"
- targetname "lua"
-
- files { "src/lua/*.c", }
+if _OPTIONS.lua == "default" then
+ project "luadefault"
+ kind "StaticLib"
+ language "C"
+ targetname "lua"
+
+ files { "src/lua/*.c", }
+elseif _OPTIONS.lua == "jitx86" then
+ project "luajitx86"
+ kind "StaticLib"
+ language "C"
+ targetname "lua"
+
+ files { "src/luajit/*.c", }
+ defines { "LUA_USE_POSIX" }
+end
project "luasocket"
kind "StaticLib"
diff --git a/src/dynasm/dasm_proto.h b/src/dynasm/dasm_proto.h
new file mode 100644
index 0000000000..c194cba84b
--- /dev/null
+++ b/src/dynasm/dasm_proto.h
@@ -0,0 +1,68 @@
+/*
+** DynASM encoding engine prototypes.
+** Copyright (C) 2005-2008 Mike Pall. All rights reserved.
+** Released under the MIT/X license. See dynasm.lua for full copyright notice.
+*/
+
+#ifndef _DASM_PROTO_H
+#define _DASM_PROTO_H
+
+#include <stddef.h>
+#include <stdarg.h>
+
+#define DASM_VERSION 10104 /* 1.1.4 */
+
+#ifndef Dst_DECL
+#define Dst_DECL dasm_State *Dst
+#endif
+
+#ifndef Dst_GET
+#define Dst_GET (Dst)
+#endif
+
+#ifndef DASM_FDEF
+#define DASM_FDEF extern
+#endif
+
+
+/* Internal DynASM encoder state. */
+typedef struct dasm_State dasm_State;
+
+/* Action list type. */
+typedef const unsigned char *dasm_ActList;
+
+
+/* Initialize and free DynASM state. */
+DASM_FDEF void dasm_init(Dst_DECL, int maxsection);
+DASM_FDEF void dasm_free(Dst_DECL);
+
+/* Setup global array. Must be called before dasm_setup(). */
+DASM_FDEF void dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl);
+
+/* Grow PC label array. Can be called after dasm_setup(), too. */
+DASM_FDEF void dasm_growpc(Dst_DECL, unsigned int maxpc);
+
+/* Setup encoder. */
+DASM_FDEF void dasm_setup(Dst_DECL, dasm_ActList actionlist);
+
+/* Feed encoder with actions. Calls are generated by pre-processor. */
+DASM_FDEF void dasm_put(Dst_DECL, int start, ...);
+
+/* Link sections and return the resulting size. */
+DASM_FDEF int dasm_link(Dst_DECL, size_t *szp);
+
+/* Encode sections into buffer. */
+DASM_FDEF int dasm_encode(Dst_DECL, void *buffer);
+
+/* Get PC label offset. */
+DASM_FDEF int dasm_getpclabel(Dst_DECL, unsigned int pc);
+
+#ifdef DASM_CHECKS
+/* Optional sanity checker to call between isolated encoding steps. */
+DASM_FDEF int dasm_checkstep(Dst_DECL, int secmatch);
+#else
+#define dasm_checkstep(a, b) 0
+#endif
+
+
+#endif /* _DASM_PROTO_H */
diff --git a/src/dynasm/dasm_x86.h b/src/dynasm/dasm_x86.h
new file mode 100644
index 0000000000..2d4fb26a06
--- /dev/null
+++ b/src/dynasm/dasm_x86.h
@@ -0,0 +1,455 @@
+/*
+** DynASM x86 encoding engine.
+** Copyright (C) 2005-2008 Mike Pall. All rights reserved.
+** Released under the MIT/X license. See dynasm.lua for full copyright notice.
+*/
+
+#include <stddef.h>
+#include <stdarg.h>
+#include <string.h>
+#include <stdlib.h>
+
+#define DASM_ARCH "x86"
+
+/* Action definitions. DASM_STOP must be 255. */
+enum {
+ DASM_DISP = 235,
+ DASM_IMM_S, DASM_IMM_B, DASM_IMM_W, DASM_IMM_D, DASM_IMM_WB, DASM_IMM_DB,
+ DASM_SPACE, DASM_SETLABEL, DASM_REL_A, DASM_REL_LG, DASM_REL_PC, DASM_IMM_LG,
+ DASM_IMM_PC, DASM_LABEL_LG, DASM_LABEL_PC, DASM_ALIGN, DASM_ESC, DASM_MARK,
+ DASM_SECTION, DASM_STOP
+};
+
+/* Maximum number of section buffer positions for a single dasm_put() call. */
+#define DASM_MAXSECPOS 25
+
+/* DynASM encoder status codes. Action list offset or number are or'ed in. */
+#define DASM_S_OK 0x00000000
+#define DASM_S_NOMEM 0x01000000
+#define DASM_S_PHASE 0x02000000
+#define DASM_S_MATCH_SEC 0x03000000
+#define DASM_S_RANGE_I 0x11000000
+#define DASM_S_RANGE_SEC 0x12000000
+#define DASM_S_RANGE_LG 0x13000000
+#define DASM_S_RANGE_PC 0x14000000
+#define DASM_S_UNDEF_L 0x21000000
+#define DASM_S_UNDEF_PC 0x22000000
+
+/* Macros to convert positions (8 bit section + 24 bit index). */
+#define DASM_POS2IDX(pos) ((pos)&0x00ffffff)
+#define DASM_POS2BIAS(pos) ((pos)&0xff000000)
+#define DASM_SEC2POS(sec) ((sec)<<24)
+#define DASM_POS2SEC(pos) ((pos)>>24)
+#define DASM_POS2PTR(D, pos) (D->sections[DASM_POS2SEC(pos)].rbuf + (pos))
+
+/* Per-section structure. */
+typedef struct dasm_Section {
+ int *rbuf; /* Biased buffer pointer (negative section bias). */
+ int *buf; /* True buffer pointer. */
+ size_t bsize; /* Buffer size in bytes. */
+ int pos; /* Biased buffer position. */
+ int epos; /* End of biased buffer position - max single put. */
+ int ofs; /* Byte offset into section. */
+} dasm_Section;
+
+/* Core structure holding the DynASM encoding state. */
+struct dasm_State {
+ size_t psize; /* Allocated size of this structure. */
+ dasm_ActList actionlist; /* Current actionlist pointer. */
+ int *lglabels; /* Local/global chain/pos ptrs. */
+ size_t lgsize;
+ int *pclabels; /* PC label chains/pos ptrs. */
+ size_t pcsize;
+ void **globals; /* Array of globals (bias -10). */
+ dasm_Section *section; /* Pointer to active section. */
+ size_t codesize; /* Total size of all code sections. */
+ int maxsection; /* 0 <= sectionidx < maxsection. */
+ int status; /* Status code. */
+ dasm_Section sections[1]; /* All sections. Alloc-extended. */
+};
+
+/* The size of the core structure depends on the max. number of sections. */
+#define DASM_PSZ(ms) (sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))
+
+
+/* Initialize DynASM state. */
+void dasm_init(Dst_DECL, int maxsection)
+{
+ dasm_State *D;
+ size_t psz = 0;
+ int i;
+ Dst_REF = NULL;
+ DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));
+ D = Dst_REF;
+ D->psize = psz;
+ D->lglabels = NULL;
+ D->lgsize = 0;
+ D->pclabels = NULL;
+ D->pcsize = 0;
+ D->globals = NULL;
+ D->maxsection = maxsection;
+ for (i = 0; i < maxsection; i++) {
+ D->sections[i].buf = NULL; /* Need this for pass3. */
+ D->sections[i].rbuf = D->sections[i].buf - DASM_SEC2POS(i);
+ D->sections[i].bsize = 0;
+ D->sections[i].epos = 0; /* Wrong, but is recalculated after resize. */
+ }
+}
+
+/* Free DynASM state. */
+void dasm_free(Dst_DECL)
+{
+ dasm_State *D = Dst_REF;
+ int i;
+ for (i = 0; i < D->maxsection; i++)
+ if (D->sections[i].buf)
+ DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);
+ if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);
+ if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);
+ DASM_M_FREE(Dst, D, D->psize);
+}
+
+/* Setup global label array. Must be called before dasm_setup(). */
+void dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)
+{
+ dasm_State *D = Dst_REF;
+ D->globals = gl - 10; /* Negative bias to compensate for locals. */
+ DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));
+}
+
+/* Grow PC label array. Can be called after dasm_setup(), too. */
+void dasm_growpc(Dst_DECL, unsigned int maxpc)
+{
+ dasm_State *D = Dst_REF;
+ size_t osz = D->pcsize;
+ DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));
+ memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);
+}
+
+/* Setup encoder. */
+void dasm_setup(Dst_DECL, dasm_ActList actionlist)
+{
+ dasm_State *D = Dst_REF;
+ int i;
+ D->actionlist = actionlist;
+ D->status = DASM_S_OK;
+ D->section = &D->sections[0];
+ memset((void *)D->lglabels, 0, D->lgsize);
+ if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);
+ for (i = 0; i < D->maxsection; i++) {
+ D->sections[i].pos = DASM_SEC2POS(i);
+ D->sections[i].ofs = 0;
+ }
+}
+
+
+#ifdef DASM_CHECKS
+#define CK(x, st) \
+ do { if (!(x)) { \
+ D->status = DASM_S_##st|(p-D->actionlist-1); return; } } while (0)
+#define CKPL(kind, st) \
+ do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \
+ D->status = DASM_S_RANGE_##st|(p-D->actionlist-1); return; } } while (0)
+#else
+#define CK(x, st) ((void)0)
+#define CKPL(kind, st) ((void)0)
+#endif
+
+/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */
+void dasm_put(Dst_DECL, int start, ...)
+{
+ va_list ap;
+ dasm_State *D = Dst_REF;
+ dasm_ActList p = D->actionlist + start;
+ dasm_Section *sec = D->section;
+ int pos = sec->pos, ofs = sec->ofs, mrm = 4;
+ int *b;
+
+ if (pos >= sec->epos) {
+ DASM_M_GROW(Dst, int, sec->buf, sec->bsize,
+ sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));
+ sec->rbuf = sec->buf - DASM_POS2BIAS(pos);
+ sec->epos = sec->bsize/sizeof(int) - DASM_MAXSECPOS + DASM_POS2BIAS(pos);
+ }
+
+ b = sec->rbuf;
+ b[pos++] = start;
+
+ va_start(ap, start);
+ while (1) {
+ int action = *p++;
+ if (action < DASM_DISP) {
+ ofs++;
+ } else if (action <= DASM_REL_A) {
+ int n = va_arg(ap, int);
+ b[pos++] = n;
+ switch (action) {
+ case DASM_DISP:
+ if (n == 0) { if ((mrm&7) == 4) mrm = p[-2]; if ((mrm&7) != 5) break; }
+ case DASM_IMM_DB: if (((n+128)&-256) == 0) goto ob;
+ case DASM_REL_A: /* Assumes ptrdiff_t is int. !x64 */
+ case DASM_IMM_D: ofs += 4; break;
+ case DASM_IMM_S: CK(((n+128)&-256) == 0, RANGE_I); goto ob;
+ case DASM_IMM_B: CK((n&-256) == 0, RANGE_I); ob: ofs++; break;
+ case DASM_IMM_WB: if (((n+128)&-256) == 0) goto ob;
+ case DASM_IMM_W: CK((n&-65536) == 0, RANGE_I); ofs += 2; break;
+ case DASM_SPACE: p++; ofs += n; break;
+ case DASM_SETLABEL: b[pos-2] = -0x40000000; break; /* Neg. label ofs. */
+ }
+ mrm = 4;
+ } else {
+ int *pl, n;
+ switch (action) {
+ case DASM_REL_LG:
+ case DASM_IMM_LG:
+ n = *p++; pl = D->lglabels + n;
+ if (n <= 246) { CKPL(lg, LG); goto putrel; } /* Bkwd rel or global. */
+ pl -= 246; n = *pl;
+ if (n < 0) n = 0; /* Start new chain for fwd rel if label exists. */
+ goto linkrel;
+ case DASM_REL_PC:
+ case DASM_IMM_PC: pl = D->pclabels + va_arg(ap, int); CKPL(pc, PC);
+ putrel:
+ n = *pl;
+ if (n < 0) { /* Label exists. Get label pos and store it. */
+ b[pos] = -n;
+ } else {
+ linkrel:
+ b[pos] = n; /* Else link to rel chain, anchored at label. */
+ *pl = pos;
+ }
+ pos++;
+ ofs += 4; /* Maximum offset needed. */
+ if (action == DASM_REL_LG || action == DASM_REL_PC)
+ b[pos++] = ofs; /* Store pass1 offset estimate. */
+ break;
+ case DASM_LABEL_LG: pl = D->lglabels + *p++; CKPL(lg, LG); goto putlabel;
+ case DASM_LABEL_PC: pl = D->pclabels + va_arg(ap, int); CKPL(pc, PC);
+ putlabel:
+ n = *pl; /* n > 0: Collapse rel chain and replace with label pos. */
+ while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos; }
+ *pl = -pos; /* Label exists now. */
+ b[pos++] = ofs; /* Store pass1 offset estimate. */
+ break;
+ case DASM_ALIGN:
+ ofs += *p++; /* Maximum alignment needed (arg is 2**n-1). */
+ b[pos++] = ofs; /* Store pass1 offset estimate. */
+ break;
+ case DASM_ESC: p++; ofs++; break;
+ case DASM_MARK: mrm = p[-2]; break;
+ case DASM_SECTION:
+ n = *p; CK(n < D->maxsection, RANGE_SEC); D->section = &D->sections[n];
+ case DASM_STOP: goto stop;
+ }
+ }
+ }
+stop:
+ va_end(ap);
+ sec->pos = pos;
+ sec->ofs = ofs;
+}
+#undef CK
+
+/* Pass 2: Link sections, shrink branches/aligns, fix label offsets. */
+int dasm_link(Dst_DECL, size_t *szp)
+{
+ dasm_State *D = Dst_REF;
+ int secnum;
+ int ofs = 0;
+
+#ifdef DASM_CHECKS
+ *szp = 0;
+ if (D->status != DASM_S_OK) return D->status;
+ {
+ int pc;
+ for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)
+ if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;
+ }
+#endif
+
+ { /* Handle globals not defined in this translation unit. */
+ int idx;
+ for (idx = 10; idx*sizeof(int) < D->lgsize; idx++) {
+ int n = D->lglabels[idx];
+ /* Undefined label: Collapse rel chain and replace with marker (< 0). */
+ while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }
+ }
+ }
+
+ /* Combine all code sections. No support for data sections (yet). */
+ for (secnum = 0; secnum < D->maxsection; secnum++) {
+ dasm_Section *sec = D->sections + secnum;
+ int *b = sec->rbuf;
+ int pos = DASM_SEC2POS(secnum);
+ int lastpos = sec->pos;
+
+ while (pos != lastpos) {
+ dasm_ActList p = D->actionlist + b[pos++];
+ while (1) {
+ int op, action = *p++;
+ switch (action) {
+ case DASM_REL_LG: p++; op = p[-3]; goto rel_pc;
+ case DASM_REL_PC: op = p[-2]; rel_pc: {
+ int shrink = op == 0xe9 ? 3 : ((op&0xf0) == 0x80 ? 4 : 0);
+ if (shrink) { /* Shrinkable branch opcode? */
+ int lofs, lpos = b[pos];
+ if (lpos < 0) goto noshrink; /* Ext global? */
+ lofs = *DASM_POS2PTR(D, lpos);
+ if (lpos > pos) { /* Fwd label: add cumulative section offsets. */
+ int i;
+ for (i = secnum; i < DASM_POS2SEC(lpos); i++)
+ lofs += D->sections[i].ofs;
+ } else {
+ lofs -= ofs; /* Bkwd label: unfix offset. */
+ }
+ lofs -= b[pos+1]; /* Short branch ok? */
+ if (lofs >= -128-shrink && lofs <= 127) ofs -= shrink; /* Yes. */
+ else { noshrink: shrink = 0; } /* No, cannot shrink op. */
+ }
+ b[pos+1] = shrink;
+ pos += 2;
+ break;
+ }
+ case DASM_SPACE: case DASM_IMM_LG: p++;
+ case DASM_DISP: case DASM_IMM_S: case DASM_IMM_B: case DASM_IMM_W:
+ case DASM_IMM_D: case DASM_IMM_WB: case DASM_IMM_DB:
+ case DASM_SETLABEL: case DASM_REL_A: case DASM_IMM_PC: pos++; break;
+ case DASM_LABEL_LG: p++;
+ case DASM_LABEL_PC: b[pos++] += ofs; break; /* Fix label offset. */
+ case DASM_ALIGN: ofs -= (b[pos++]+ofs)&*p++; break; /* Adjust ofs. */
+ case DASM_ESC: p++;
+ case DASM_MARK: break;
+ case DASM_SECTION: case DASM_STOP: goto stop;
+ }
+ }
+ stop: (void)0;
+ }
+ ofs += sec->ofs; /* Next section starts right after current section. */
+ }
+
+ D->codesize = ofs; /* Total size of all code sections */
+ *szp = ofs;
+ return DASM_S_OK;
+}
+
+#define dasmb(x) *cp++ = (unsigned char)(x)
+#ifndef DASM_ALIGNED_WRITES
+#define dasmw(x) \
+ do { *((unsigned short *)cp) = (unsigned short)(x); cp+=2; } while (0)
+#define dasmd(x) \
+ do { *((unsigned int *)cp) = (unsigned int)(x); cp+=4; } while (0)
+#else
+#define dasmw(x) do { dasmb(x); dasmb((x)>>8); } while (0)
+#define dasmd(x) do { dasmw(x); dasmw((x)>>16); } while (0)
+#endif
+
+/* Pass 3: Encode sections. */
+int dasm_encode(Dst_DECL, void *buffer)
+{
+ dasm_State *D = Dst_REF;
+ unsigned char *base = (unsigned char *)buffer;
+ unsigned char *cp = base;
+ int secnum;
+
+ /* Encode all code sections. No support for data sections (yet). */
+ for (secnum = 0; secnum < D->maxsection; secnum++) {
+ dasm_Section *sec = D->sections + secnum;
+ int *b = sec->buf;
+ int *endb = sec->rbuf + sec->pos;
+
+ while (b != endb) {
+ dasm_ActList p = D->actionlist + *b++;
+ unsigned char *mark = NULL;
+ while (1) {
+ int action = *p++;
+ int n = (action >= DASM_DISP && action <= DASM_ALIGN) ? *b++ : 0;
+ switch (action) {
+ case DASM_DISP: if (!mark) mark = cp; {
+ unsigned char *mm = mark;
+ if (*p != DASM_IMM_DB && *p != DASM_IMM_WB) mark = NULL;
+ if (n == 0) { int mrm = mm[-1]&7; if (mrm == 4) mrm = mm[0]&7;
+ if (mrm != 5) { mm[-1] -= 0x80; break; } }
+ if (((n+128) & -256) != 0) goto wd; else mm[-1] -= 0x40;
+ }
+ case DASM_IMM_S: case DASM_IMM_B: wb: dasmb(n); break;
+ case DASM_IMM_DB: if (((n+128)&-256) == 0) {
+ db: if (!mark) mark = cp; mark[-2] += 2; mark = NULL; goto wb;
+ } else mark = NULL;
+ case DASM_IMM_D: wd: dasmd(n); break;
+ case DASM_IMM_WB: if (((n+128)&-256) == 0) goto db; else mark = NULL;
+ case DASM_IMM_W: dasmw(n); break;
+ case DASM_REL_LG: p++; if (n >= 0) goto rel_pc;
+ b++; n = (int)D->globals[-n];
+ case DASM_REL_A: rel_a: n -= (int)(cp+4); goto wd; /* !x64 */
+ case DASM_REL_PC: rel_pc: {
+ int shrink = *b++;
+ int *pb = DASM_POS2PTR(D, n); if (*pb < 0) { n = pb[1]; goto rel_a; }
+ n = *pb - ((cp-base) + 4-shrink);
+ if (shrink == 0) goto wd;
+ if (shrink == 4) { cp--; cp[-1] = *cp-0x10; } else cp[-1] = 0xeb;
+ goto wb;
+ }
+ case DASM_IMM_LG: p++; if (n < 0) { n = (int)D->globals[-n]; goto wd; }
+ case DASM_IMM_PC: {
+ int *pb = DASM_POS2PTR(D, n);
+ n = *pb < 0 ? pb[1] : (*pb + (ptrdiff_t)base);
+ goto wd;
+ }
+ case DASM_LABEL_LG: {
+ int idx = *p++;
+ if (idx >= 10)
+ D->globals[idx] = (void *)(base + (*p == DASM_SETLABEL ? *b : n));
+ break;
+ }
+ case DASM_LABEL_PC: case DASM_SETLABEL: break;
+ case DASM_SPACE: { int fill = *p++; while (n--) *cp++ = fill; break; }
+ case DASM_ALIGN:
+ n = *p++;
+ while (((cp-base) & n)) *cp++ = 0x90; /* nop */
+ break;
+ case DASM_MARK: mark = cp; break;
+ case DASM_ESC: action = *p++;
+ default: *cp++ = action; break;
+ case DASM_SECTION: case DASM_STOP: goto stop;
+ }
+ }
+ stop: (void)0;
+ }
+ }
+
+ if (base + D->codesize != cp) /* Check for phase errors. */
+ return DASM_S_PHASE;
+ return DASM_S_OK;
+}
+
+/* Get PC label offset. */
+int dasm_getpclabel(Dst_DECL, unsigned int pc)
+{
+ dasm_State *D = Dst_REF;
+ if (pc*sizeof(int) < D->pcsize) {
+ int pos = D->pclabels[pc];
+ if (pos < 0) return *DASM_POS2PTR(D, -pos);
+ if (pos > 0) return -1; /* Undefined. */
+ }
+ return -2; /* Unused or out of range. */
+}
+
+#ifdef DASM_CHECKS
+/* Optional sanity checker to call between isolated encoding steps. */
+int dasm_checkstep(Dst_DECL, int secmatch)
+{
+ dasm_State *D = Dst_REF;
+ if (D->status == DASM_S_OK) {
+ int i;
+ for (i = 1; i <= 9; i++) {
+ if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_L|i; break; }
+ D->lglabels[i] = 0;
+ }
+ }
+ if (D->status == DASM_S_OK && secmatch >= 0 &&
+ D->section != &D->sections[secmatch])
+ D->status = DASM_S_MATCH_SEC|(D->section-D->sections);
+ return D->status;
+}
+#endif
+
diff --git a/src/dynasm/dasm_x86.lua b/src/dynasm/dasm_x86.lua
new file mode 100644
index 0000000000..026c3b0532
--- /dev/null
+++ b/src/dynasm/dasm_x86.lua
@@ -0,0 +1,1581 @@
+------------------------------------------------------------------------------
+-- DynASM x86 module.
+--
+-- Copyright (C) 2005-2008 Mike Pall. All rights reserved.
+-- See dynasm.lua for full copyright notice.
+------------------------------------------------------------------------------
+
+-- Module information:
+local _info = {
+ arch = "x86",
+ description = "DynASM x86 (i386) module",
+ version = "1.1.4",
+ vernum = 10104,
+ release = "2008-01-29",
+ author = "Mike Pall",
+ license = "MIT",
+}
+
+-- Exported glue functions for the arch-specific module.
+local _M = { _info = _info }
+
+-- Cache library functions.
+local type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs
+local assert, unpack = assert, unpack
+local _s = string
+local sub, format, byte, char = _s.sub, _s.format, _s.byte, _s.char
+local find, match, gmatch, gsub = _s.find, _s.match, _s.gmatch, _s.gsub
+local concat, sort = table.concat, table.sort
+local char, unpack = string.char, unpack
+
+-- Inherited tables and callbacks.
+local g_opt, g_arch
+local wline, werror, wfatal, wwarn
+
+-- Action name list.
+-- CHECK: Keep this in sync with the C code!
+local action_names = {
+ -- int arg, 1 buffer pos:
+ "DISP", "IMM_S", "IMM_B", "IMM_W", "IMM_D", "IMM_WB", "IMM_DB",
+ -- action arg (1 byte), int arg, 1 buffer pos (num):
+ "SPACE",
+ -- ptrdiff_t arg, 1 buffer pos (address): !x64
+ "SETLABEL", "REL_A",
+ -- action arg (1 byte) or int arg, 2 buffer pos (link, offset):
+ "REL_LG", "REL_PC",
+ -- action arg (1 byte) or int arg, 1 buffer pos (link):
+ "IMM_LG", "IMM_PC",
+ -- action arg (1 byte) or int arg, 1 buffer pos (offset):
+ "LABEL_LG", "LABEL_PC",
+ -- action arg (1 byte), 1 buffer pos (offset):
+ "ALIGN",
+ -- action arg (1 byte), no buffer pos.
+ "ESC",
+ -- no action arg, no buffer pos.
+ "MARK",
+ -- action arg (1 byte), no buffer pos, terminal action:
+ "SECTION",
+ -- no args, no buffer pos, terminal action:
+ "STOP"
+}
+
+-- Maximum number of section buffer positions for dasm_put().
+-- CHECK: Keep this in sync with the C code!
+local maxsecpos = 25 -- Keep this low, to avoid excessively long C lines.
+
+-- Action name -> action number (dynamically generated below).
+local map_action = {}
+-- First action number. Everything below does not need to be escaped.
+local actfirst = 256-#action_names
+
+-- Action list buffer and string (only used to remove dupes).
+local actlist = {}
+local actstr = ""
+
+-- Argument list for next dasm_put(). Start with offset 0 into action list.
+local actargs = { 0 }
+
+-- Current number of section buffer positions for dasm_put().
+local secpos = 1
+
+------------------------------------------------------------------------------
+
+-- Compute action numbers for action names.
+for n,name in ipairs(action_names) do
+ local num = actfirst + n - 1
+ map_action[name] = num
+end
+
+-- Dump action names and numbers.
+local function dumpactions(out)
+ out:write("DynASM encoding engine action codes:\n")
+ for n,name in ipairs(action_names) do
+ local num = map_action[name]
+ out:write(format(" %-10s %02X %d\n", name, num, num))
+ end
+ out:write("\n")
+end
+
+-- Write action list buffer as a huge static C array.
+local function writeactions(out, name)
+ local nn = #actlist
+ local last = actlist[nn] or 255
+ actlist[nn] = nil -- Remove last byte.
+ if nn == 0 then nn = 1 end
+ out:write("static const unsigned char ", name, "[", nn, "] = {\n")
+ local s = " "
+ for n,b in ipairs(actlist) do
+ s = s..b..","
+ if #s >= 75 then
+ assert(out:write(s, "\n"))
+ s = " "
+ end
+ end
+ out:write(s, last, "\n};\n\n") -- Add last byte back.
+end
+
+------------------------------------------------------------------------------
+
+-- Add byte to action list.
+local function wputxb(n)
+ assert(n >= 0 and n <= 255 and n % 1 == 0, "byte out of range")
+ actlist[#actlist+1] = n
+end
+
+-- Add action to list with optional arg. Advance buffer pos, too.
+local function waction(action, a, num)
+ wputxb(assert(map_action[action], "bad action name `"..action.."'"))
+ if a then actargs[#actargs+1] = a end
+ if a or num then secpos = secpos + (num or 1) end
+end
+
+-- Add call to embedded DynASM C code.
+local function wcall(func, args)
+ wline(format("dasm_%s(Dst, %s);", func, concat(args, ", ")), true)
+end
+
+-- Delete duplicate action list chunks. A tad slow, but so what.
+local function dedupechunk(offset)
+ local al, as = actlist, actstr
+ local chunk = char(unpack(al, offset+1, #al))
+ local orig = find(as, chunk, 1, true)
+ if orig then
+ actargs[1] = orig-1 -- Replace with original offset.
+ for i=offset+1,#al do al[i] = nil end -- Kill dupe.
+ else
+ actstr = as..chunk
+ end
+end
+
+-- Flush action list (intervening C code or buffer pos overflow).
+local function wflush(term)
+ local offset = actargs[1]
+ if #actlist == offset then return end -- Nothing to flush.
+ if not term then waction("STOP") end -- Terminate action list.
+ dedupechunk(offset)
+ wcall("put", actargs) -- Add call to dasm_put().
+ actargs = { #actlist } -- Actionlist offset is 1st arg to next dasm_put().
+ secpos = 1 -- The actionlist offset occupies a buffer position, too.
+end
+
+-- Put escaped byte.
+local function wputb(n)
+ if n >= actfirst then waction("ESC") end -- Need to escape byte.
+ wputxb(n)
+end
+
+------------------------------------------------------------------------------
+
+-- Global label name -> global label number. With auto assignment on 1st use.
+local next_global = 10
+local map_global = setmetatable({}, { __index = function(t, name)
+ if not match(name, "^[%a_][%w_]*$") then werror("bad global label") end
+ local n = next_global
+ if n > 246 then werror("too many global labels") end
+ next_global = n + 1
+ t[name] = n
+ return n
+end})
+
+-- Dump global labels.
+local function dumpglobals(out, lvl)
+ local t = {}
+ for name, n in pairs(map_global) do t[n] = name end
+ out:write("Global labels:\n")
+ for i=10,next_global-1 do
+ out:write(format(" %s\n", t[i]))
+ end
+ out:write("\n")
+end
+
+-- Write global label enum.
+local function writeglobals(out, prefix)
+ local t = {}
+ for name, n in pairs(map_global) do t[n] = name end
+ out:write("enum {\n")
+ for i=10,next_global-1 do
+ out:write(" ", prefix, t[i], ",\n")
+ end
+ out:write(" ", prefix, "_MAX\n};\n")
+end
+
+------------------------------------------------------------------------------
+
+-- Arch-specific maps.
+local map_archdef = {} -- Ext. register name -> int. name.
+local map_reg_rev = {} -- Int. register name -> ext. name.
+local map_reg_num = {} -- Int. register name -> register number.
+local map_reg_opsize = {} -- Int. register name -> operand size.
+local map_reg_valid_base = {} -- Int. register name -> valid base register?
+local map_reg_valid_index = {} -- Int. register name -> valid index register?
+local reg_list = {} -- Canonical list of int. register names.
+
+local map_type = {} -- Type name -> { ctype, reg }
+local ctypenum = 0 -- Type number (for _PTx macros).
+
+local addrsize = "d" -- Size for address operands. !x64
+
+-- Helper function to fill register maps.
+local function mkrmap(sz, names)
+ for n,name in ipairs(names) do
+ local iname = format("@%s%x", sz, n-1)
+ reg_list[#reg_list+1] = iname
+ map_archdef[name] = iname
+ map_reg_rev[iname] = name
+ map_reg_num[iname] = n-1
+ map_reg_opsize[iname] = sz
+ if sz == addrsize then
+ map_reg_valid_base[iname] = true
+ map_reg_valid_index[iname] = true
+ end
+ end
+ reg_list[#reg_list+1] = ""
+end
+
+-- Integer registers (dword, word and byte sized).
+mkrmap("d", {"eax", "ecx", "edx", "ebx", "esp", "ebp", "esi", "edi"})
+map_reg_valid_index[map_archdef.esp] = nil
+mkrmap("w", {"ax", "cx", "dx", "bx", "sp", "bp", "si", "di"})
+mkrmap("b", {"al", "cl", "dl", "bl", "ah", "ch", "dh", "bh"})
+
+-- FP registers (internally tword sized, but use "f" as operand size).
+mkrmap("f", {"st0", "st1", "st2", "st3", "st4", "st5", "st6", "st7"})
+
+-- SSE registers (oword sized, but qword and dword accessible).
+mkrmap("o", {"xmm0", "xmm1", "xmm2", "xmm3", "xmm4", "xmm5", "xmm6", "xmm7"})
+
+-- Operand size prefixes to codes.
+local map_opsize = {
+ byte = "b", word = "w", dword = "d", qword = "q", oword = "o", tword = "t",
+ aword = addrsize,
+}
+
+-- Operand size code to number.
+local map_opsizenum = {
+ b = 1, w = 2, d = 4, q = 8, o = 16, t = 10,
+}
+
+-- Operand size code to name.
+local map_opsizename = {
+ b = "byte", w = "word", d = "dword", q = "qword", o = "oword", t = "tword",
+ f = "fpword",
+}
+
+-- Valid index register scale factors.
+local map_xsc = {
+ ["1"] = 0, ["2"] = 1, ["4"] = 2, ["8"] = 3,
+}
+
+-- Condition codes.
+local map_cc = {
+ o = 0, no = 1, b = 2, nb = 3, e = 4, ne = 5, be = 6, nbe = 7,
+ s = 8, ns = 9, p = 10, np = 11, l = 12, nl = 13, le = 14, nle = 15,
+ c = 2, nae = 2, nc = 3, ae = 3, z = 4, nz = 5, na = 6, a = 7,
+ nge = 12, ge = 13, ng = 14, g = 15,
+}
+
+
+-- Reverse defines for registers.
+function _M.revdef(s)
+ return gsub(s, "@%w+", map_reg_rev)
+end
+
+-- Dump register names and numbers
+local function dumpregs(out)
+ out:write("Register names, sizes and internal numbers:\n")
+ for _,reg in ipairs(reg_list) do
+ if reg == "" then
+ out:write("\n")
+ else
+ local name = map_reg_rev[reg]
+ local num = map_reg_num[reg]
+ local opsize = map_opsizename[map_reg_opsize[reg]]
+ out:write(format(" %-5s %-8s %d\n", name, opsize, num))
+ end
+ end
+end
+
+------------------------------------------------------------------------------
+
+-- Put action for label arg (IMM_LG, IMM_PC, REL_LG, REL_PC).
+local function wputlabel(aprefix, imm, num)
+ if type(imm) == "number" then
+ waction(aprefix.."LG", nil, num);
+ wputxb(imm)
+ else
+ waction(aprefix.."PC", imm, num)
+ end
+end
+
+-- Put signed byte or arg.
+local function wputsbarg(n)
+ if type(n) == "number" then
+ if n < -128 or n > 127 then
+ werror("signed immediate byte out of range")
+ end
+ if n < 0 then n = n + 256 end
+ wputb(n)
+ else waction("IMM_S", n) end
+end
+
+-- Put unsigned byte or arg.
+local function wputbarg(n)
+ if type(n) == "number" then
+ if n < 0 or n > 255 then
+ werror("unsigned immediate byte out of range")
+ end
+ wputb(n)
+ else waction("IMM_B", n) end
+end
+
+-- Put unsigned word or arg.
+local function wputwarg(n)
+ if type(n) == "number" then
+ if n < 0 or n > 65535 then
+ werror("unsigned immediate word out of range")
+ end
+ local r = n%256; n = (n-r)/256; wputb(r); wputb(n);
+ else waction("IMM_W", n) end
+end
+
+-- Put signed or unsigned dword or arg.
+local function wputdarg(n)
+ local tn = type(n)
+ if tn == "number" then
+ if n < 0 then n = n + 4294967296 end
+ local r = n%256; n = (n-r)/256; wputb(r);
+ r = n%256; n = (n-r)/256; wputb(r);
+ r = n%256; n = (n-r)/256; wputb(r); wputb(n);
+ elseif tn == "table" then
+ wputlabel("IMM_", n[1], 1)
+ else
+ waction("IMM_D", n)
+ end
+end
+
+-- Put operand-size dependent number or arg (defaults to dword).
+local function wputszarg(sz, n)
+ if not sz or sz == "d" then wputdarg(n)
+ elseif sz == "w" then wputwarg(n)
+ elseif sz == "b" then wputbarg(n)
+ elseif sz == "s" then wputsbarg(n)
+ else werror("bad operand size") end
+end
+
+-- Put multi-byte opcode with operand-size dependent modifications.
+local function wputop(sz, op)
+ local r
+ if sz == "w" then wputb(102) end
+ if op >= 16777216 then r = op % 16777216 wputb((op-r) / 16777216) op = r end
+ if op >= 65536 then r = op % 65536 wputb((op-r) / 65536) op = r end
+ if op >= 256 then r = op % 256 wputb((op-r) / 256) op = r end
+ if sz == "b" then op = op - 1 end
+ wputb(op)
+end
+
+-- Put ModRM or SIB formatted byte.
+local function wputmodrm(m, s, rm)
+ assert(m < 4 and s < 8 and rm < 8, "bad modrm operands")
+ wputb(64*m + 8*s + rm)
+end
+
+-- Put ModRM/SIB plus optional displacement.
+local function wputmrmsib(t, s, imark)
+ -- Register mode.
+ if sub(t.mode, 1, 1) == "r" then
+ wputmodrm(3, s, t.reg)
+ return
+ end
+
+ local disp = t.disp
+ local tdisp = type(disp)
+ -- No base register?
+ if not t.reg then
+ if t.xreg then
+ -- Indexed mode with index register only.
+ wputmodrm(0, s, 4) -- [xreg*xsc+disp] -> (0, s, esp) (xsc, xreg, ebp)
+ wputmodrm(t.xsc, t.xreg, 5)
+ else
+ -- Pure displacement.
+ wputmodrm(0, s, 5) -- [disp] -> (0, s, ebp)
+ end
+ wputdarg(disp)
+ return
+ end
+
+ local m
+ if tdisp == "number" then -- Check displacement size at assembly time.
+ if disp == 0 and t.reg ~= 5 then m = 0 -- [ebp] -> [ebp+0] (in SIB, too)
+ elseif disp >= -128 and disp <= 127 then m = 1
+ else m = 2 end
+ elseif tdisp == "table" then
+ m = 2
+ end
+
+ -- Index register present or esp as base register: need SIB encoding.
+ if t.xreg or t.reg == 4 then
+ wputmodrm(m or 2, s, 4) -- ModRM.
+ if (m == nil or imark) and tdisp ~= "table" then waction("MARK") end
+ wputmodrm(t.xsc or 0, t.xreg or 4, t.reg) -- SIB.
+ else
+ wputmodrm(m or 2, s, t.reg) -- ModRM.
+ if imark and (m == 1 or m == 2) then waction("MARK") end
+ end
+
+ -- Put displacement.
+ if m == 1 then wputsbarg(disp)
+ elseif m == 2 then wputdarg(disp)
+ elseif not m then waction("DISP", disp) end
+end
+
+------------------------------------------------------------------------------
+
+-- Return human-readable operand mode string.
+local function opmodestr(op, args)
+ local m = {}
+ for i=1,#args do
+ local a = args[i]
+ m[#m+1] = sub(a.mode, 1, 1)..(a.opsize or "?")
+ end
+ return op.." "..concat(m, ",")
+end
+
+-- Convert number to valid integer or nil.
+local function toint(expr)
+ local n = tonumber(expr)
+ if n then
+ if n % 1 ~= 0 or n < -2147483648 or n > 4294967295 then
+ werror("bad integer number `"..expr.."'")
+ end
+ return n
+ end
+end
+
+-- Parse immediate expression.
+local function immexpr(expr)
+ -- &expr (pointer)
+ if sub(expr, 1, 1) == "&" then
+ return "iPJ", format("(ptrdiff_t)(%s)", sub(expr,2))
+ end
+
+ local prefix = sub(expr, 1, 2)
+ -- =>expr (pc label reference)
+ if prefix == "=>" then
+ return "iJ", sub(expr, 3)
+ end
+ -- ->name (global label reference)
+ if prefix == "->" then
+ return "iJ", map_global[sub(expr, 3)]
+ end
+
+ -- [<>][1-9] (local label reference)
+ local dir, lnum = match(expr, "^([<>])([1-9])$")
+ if dir then -- Fwd: 247-255, Bkwd: 1-9.
+ return "iJ", lnum + (dir == ">" and 246 or 0)
+ end
+
+ -- expr (interpreted as immediate)
+ return "iI", expr
+end
+
+-- Parse displacement expression: +-num, +-expr, +-opsize*num
+local function dispexpr(expr)
+ local disp = expr == "" and 0 or toint(expr)
+ if disp then return disp end
+ local c, dispt = match(expr, "^([+-])%s*(.+)$")
+ if c == "+" then
+ expr = dispt
+ elseif not c then
+ werror("bad displacement expression `"..expr.."'")
+ end
+ local opsize, tailops = match(dispt, "^(%w+)%s*%*%s*(.+)$")
+ local ops, imm = map_opsize[opsize], toint(tailops)
+ if ops and imm then
+ if c == "-" then imm = -imm end
+ return imm*map_opsizenum[ops]
+ end
+ local mode, iexpr = immexpr(dispt)
+ if mode == "iJ" then
+ if c == "-" then werror("cannot invert label reference") end
+ return { iexpr }
+ end
+ return expr -- Need to return original signed expression.
+end
+
+-- Parse register or type expression.
+local function rtexpr(expr)
+ if not expr then return end
+ local tname, ovreg = match(expr, "^([%w_]+):(@[%w_]+)$")
+ local tp = map_type[tname or expr]
+ if tp then
+ local reg = ovreg or tp.reg
+ local rnum = map_reg_num[reg]
+ if not rnum then
+ werror("type `"..(tname or expr).."' needs a register override")
+ end
+ if not map_reg_valid_base[reg] then
+ werror("bad base register override `"..(map_reg_rev[reg] or reg).."'")
+ end
+ return reg, rnum, tp
+ end
+ return expr, map_reg_num[expr]
+end
+
+-- Parse operand and return { mode, opsize, reg, xreg, xsc, disp, imm }.
+local function parseoperand(param)
+ local t = {}
+
+ local expr = param
+ local opsize, tailops = match(param, "^(%w+)%s*(.+)$")
+ if opsize then
+ t.opsize = map_opsize[opsize]
+ if t.opsize then expr = tailops end
+ end
+
+ local br = match(expr, "^%[%s*(.-)%s*%]$")
+ repeat
+ if br then
+ t.mode = "xm"
+
+ -- [disp]
+ t.disp = toint(br)
+ if t.disp then
+ t.mode = "xmO"
+ break
+ end
+
+ -- [reg...]
+ local tp
+ local reg, tailr = match(br, "^([@%w_:]+)%s*(.*)$")
+ reg, t.reg, tp = rtexpr(reg)
+ if not t.reg then
+ -- [expr]
+ t.mode = "xmO"
+ t.disp = dispexpr("+"..br)
+ break
+ end
+
+ -- [xreg*xsc] or [xreg*xsc+-disp] or [xreg*xsc+-expr]
+ local xsc, tailsc = match(tailr, "^%*%s*([1248])%s*(.*)$")
+ if xsc then
+ if not map_reg_valid_index[reg] then
+ werror("bad index register `"..map_reg_rev[reg].."'")
+ end
+ t.xsc = map_xsc[xsc]
+ t.xreg = t.reg
+ t.reg = nil
+ t.disp = dispexpr(tailsc)
+ break
+ end
+ if not map_reg_valid_base[reg] then
+ werror("bad base register `"..map_reg_rev[reg].."'")
+ end
+
+ -- [reg] or [reg+-disp]
+ t.disp = toint(tailr) or (tailr == "" and 0)
+ if t.disp then break end
+
+ -- [reg+xreg...]
+ local xreg, tailx = match(tailr, "^+%s*([@%w_:]+)%s*(.*)$")
+ xreg, t.xreg, tp = rtexpr(xreg)
+ if not t.xreg then
+ -- [reg+-expr]
+ t.disp = dispexpr(tailr)
+ break
+ end
+ if not map_reg_valid_index[xreg] then
+ werror("bad index register `"..map_reg_rev[xreg].."'")
+ end
+
+ -- [reg+xreg*xsc...]
+ local xsc, tailsc = match(tailx, "^%*%s*([1248])%s*(.*)$")
+ if xsc then
+ t.xsc = map_xsc[xsc]
+ tailx = tailsc
+ end
+
+ -- [...] or [...+-disp] or [...+-expr]
+ t.disp = dispexpr(tailx)
+ else
+ -- imm or opsize*imm
+ local imm = toint(expr)
+ if not imm and sub(expr, 1, 1) == "*" and t.opsize then
+ imm = toint(sub(expr, 2))
+ if imm then
+ imm = imm * map_opsizenum[t.opsize]
+ t.opsize = nil
+ end
+ end
+ if imm then
+ if t.opsize then werror("bad operand size override") end
+ local m = "i"
+ if imm == 1 then m = m.."1" end
+ if imm >= 4294967168 and imm <= 4294967295 then imm = imm-4294967296 end
+ if imm >= -128 and imm <= 127 then m = m.."S" end
+ t.imm = imm
+ t.mode = m
+ break
+ end
+
+ local tp
+ local reg, tailr = match(expr, "^([@%w_:]+)%s*(.*)$")
+ reg, t.reg, tp = rtexpr(reg)
+ if t.reg then
+ -- reg
+ if tailr == "" then
+ if t.opsize then werror("bad operand size override") end
+ t.opsize = map_reg_opsize[reg]
+ if t.opsize == "f" then
+ t.mode = t.reg == 0 and "fF" or "f"
+ else
+ if reg == "@w4" then wwarn("bad idea, try again with `esp'") end
+ t.mode = t.reg == 0 and "rmR" or (reg == "@b1" and "rmC" or "rm")
+ end
+ break
+ end
+
+ -- type[idx], type[idx].field, type->field -> [reg+offset_expr]
+ if not tp then werror("bad operand `"..param.."'") end
+ t.mode = "xm"
+ t.disp = format(tp.ctypefmt, tailr)
+ else
+ t.mode, t.imm = immexpr(expr)
+ if sub(t.mode, -1) == "J" then
+ if t.opsize and t.opsize ~= addrsize then
+ werror("bad operand size override")
+ end
+ t.opsize = addrsize
+ end
+ end
+ end
+ until true
+ return t
+end
+
+------------------------------------------------------------------------------
+-- x86 Template String Description
+-- ===============================
+--
+-- Each template string is a list of [match:]pattern pairs,
+-- separated by "|". The first match wins. No match means a
+-- bad or unsupported combination of operand modes or sizes.
+--
+-- The match part and the ":" is omitted if the operation has
+-- no operands. Otherwise the first N characters are matched
+-- against the mode strings of each of the N operands.
+--
+-- The mode string for each operand type is (see parseoperand()):
+-- Integer register: "rm", +"R" for eax, ax, al, +"C" for cl
+-- FP register: "f", +"F" for st0
+-- Index operand: "xm", +"O" for [disp] (pure offset)
+-- Immediate: "i", +"S" for signed 8 bit, +"1" for 1,
+-- +"I" for arg, +"P" for pointer
+-- Any: +"J" for valid jump targets
+--
+-- So a match character "m" (mixed) matches both an integer register
+-- and an index operand (to be encoded with the ModRM/SIB scheme).
+-- But "r" matches only a register and "x" only an index operand
+-- (e.g. for FP memory access operations).
+--
+-- The operand size match string starts right after the mode match
+-- characters and ends before the ":". "dwb" is assumed, if empty.
+-- The effective data size of the operation is matched against this list.
+--
+-- If only the regular "b", "w", "d", "q", "t" operand sizes are
+-- present, then all operands must be the same size. Unspecified sizes
+-- are ignored, but at least one operand must have a size or the pattern
+-- won't match (use the "byte", "word", "dword", "qword", "tword"
+-- operand size overrides. E.g.: mov dword [eax], 1).
+--
+-- If the list has a "1" or "2" prefix, the operand size is taken
+-- from the respective operand and any other operand sizes are ignored.
+-- If the list contains only ".", all operand sizes are ignored.
+-- If the list has a "/" prefix, the concatenated (mixed) operand sizes
+-- are compared to the match.
+--
+-- E.g. "rrdw" matches for either two dword registers or two word
+-- registers. "Fx2dq" matches an st0 operand plus an index operand
+-- pointing to a dword (float) or qword (double).
+--
+-- Every character after the ":" is part of the pattern string:
+-- Hex chars are accumulated to form the opcode (left to right).
+-- "n" disables the standard opcode mods
+-- (otherwise: -1 for "b", o16 prefix for "w")
+-- "r"/"R" adds the reg. number from the 1st/2nd operand to the opcode.
+-- "m"/"M" generates ModRM/SIB from the 1st/2nd operand.
+-- The spare 3 bits are either filled with the last hex digit or
+-- the result from a previous "r"/"R". The opcode is restored.
+--
+-- All of the following characters force a flush of the opcode:
+-- "o"/"O" stores a pure 32 bit disp (offset) from the 1st/2nd operand.
+-- "S" stores a signed 8 bit immediate from the last operand.
+-- "U" stores an unsigned 8 bit immediate from the last operand.
+-- "W" stores an unsigned 16 bit immediate from the last operand.
+-- "i" stores an operand sized immediate from the last operand.
+-- "I" dito, but generates an action code to optionally modify
+-- the opcode (+2) for a signed 8 bit immediate.
+-- "J" generates one of the REL action codes from the last operand.
+--
+------------------------------------------------------------------------------
+
+-- Template strings for x86 instructions. Ordered by first opcode byte.
+-- Unimplemented opcodes (deliberate omissions) are marked with *.
+local map_op = {
+ -- 00-05: add...
+ -- 06: *push es
+ -- 07: *pop es
+ -- 08-0D: or...
+ -- 0E: *push cs
+ -- 0F: two byte opcode prefix
+ -- 10-15: adc...
+ -- 16: *push ss
+ -- 17: *pop ss
+ -- 18-1D: sbb...
+ -- 1E: *push ds
+ -- 1F: *pop ds
+ -- 20-25: and...
+ es_0 = "26",
+ -- 27: *daa
+ -- 28-2D: sub...
+ cs_0 = "2E",
+ -- 2F: *das
+ -- 30-35: xor...
+ ss_0 = "36",
+ -- 37: *aaa
+ -- 38-3D: cmp...
+ ds_0 = "3E",
+ -- 3F: *aas
+ inc_1 = "rdw:40r|m:FF0m",
+ dec_1 = "rdw:48r|m:FF1m",
+ push_1 = "rdw:50r|mdw:FF6m|S.:6AS|ib:n6Ai|i.:68i",
+ pop_1 = "rdw:58r|mdw:8F0m",
+ -- 60: *pusha, *pushad, *pushaw
+ -- 61: *popa, *popad, *popaw
+ -- 62: *bound rdw,x
+ -- 63: *arpl mw,rw
+ fs_0 = "64",
+ gs_0 = "65",
+ o16_0 = "66",
+ a16_0 = "67",
+ -- 68: push idw
+ -- 69: imul rdw,mdw,idw
+ -- 6A: push ib
+ -- 6B: imul rdw,mdw,S
+ -- 6C: *insb
+ -- 6D: *insd, *insw
+ -- 6E: *outsb
+ -- 6F: *outsd, *outsw
+ -- 70-7F: jcc lb
+ -- 80: add... mb,i
+ -- 81: add... mdw,i
+ -- 82: *undefined
+ -- 83: add... mdw,S
+ test_2 = "mr:85Rm|rm:85rM|Ri:A9i|mi:F70mi",
+ -- 86: xchg rb,mb
+ -- 87: xchg rdw,mdw
+ -- 88: mov mb,r
+ -- 89: mov mdw,r
+ -- 8A: mov r,mb
+ -- 8B: mov r,mdw
+ -- 8C: *mov mdw,seg
+ lea_2 = "rxd:8DrM",
+ -- 8E: *mov seg,mdw
+ -- 8F: pop mdw
+ nop_0 = "90",
+ xchg_2 = "Rrdw:90R|rRdw:90r|rm:87rM|mr:87Rm",
+ cbw_0 = "6698",
+ cwde_0 = "98",
+ cwd_0 = "6699",
+ cdq_0 = "99",
+ -- 9A: *call iw:idw
+ wait_0 = "9B",
+ fwait_0 = "9B",
+ pushf_0 = "9C",
+ pushfw_0 = "669C",
+ pushfd_0 = "9C",
+ popf_0 = "9D",
+ popfw_0 = "669D",
+ popfd_0 = "9D",
+ sahf_0 = "9E",
+ lahf_0 = "9F",
+ mov_2 = "OR:A3o|RO:A1O|mr:89Rm|rm:8BrM|rib:nB0ri|ridw:B8ri|mi:C70mi",
+ movsb_0 = "A4",
+ movsw_0 = "66A5",
+ movsd_0 = "A5",
+ cmpsb_0 = "A6",
+ cmpsw_0 = "66A7",
+ cmpsd_0 = "A7",
+ -- A8: test Rb,i
+ -- A9: test Rdw,i
+ stosb_0 = "AA",
+ stosw_0 = "66AB",
+ stosd_0 = "AB",
+ lodsb_0 = "AC",
+ lodsw_0 = "66AD",
+ lodsd_0 = "AD",
+ scasb_0 = "AE",
+ scasw_0 = "66AF",
+ scasd_0 = "AF",
+ -- B0-B7: mov rb,i
+ -- B8-BF: mov rdw,i
+ -- C0: rol... mb,i
+ -- C1: rol... mdw,i
+ ret_1 = "i.:nC2W",
+ ret_0 = "C3",
+ -- C4: *les rdw,mq
+ -- C5: *lds rdw,mq
+ -- C6: mov mb,i
+ -- C7: mov mdw,i
+ -- C8: *enter iw,ib
+ leave_0 = "C9",
+ -- CA: *retf iw
+ -- CB: *retf
+ int3_0 = "CC",
+ int_1 = "i.:nCDU",
+ into_0 = "CE",
+ -- CF: *iret
+ -- D0: rol... mb,1
+ -- D1: rol... mdw,1
+ -- D2: rol... mb,cl
+ -- D3: rol... mb,cl
+ -- D4: *aam ib
+ -- D5: *aad ib
+ -- D6: *salc
+ -- D7: *xlat
+ -- D8-DF: floating point ops
+ -- E0: *loopne
+ -- E1: *loope
+ -- E2: *loop
+ -- E3: *jcxz, *jecxz
+ -- E4: *in Rb,ib
+ -- E5: *in Rdw,ib
+ -- E6: *out ib,Rb
+ -- E7: *out ib,Rdw
+ call_1 = "md:FF2m|J.:E8J",
+ jmp_1 = "md:FF4m|J.:E9J", -- short: EB
+ -- EA: *jmp iw:idw
+ -- EB: jmp ib
+ -- EC: *in Rb,dx
+ -- ED: *in Rdw,dx
+ -- EE: *out dx,Rb
+ -- EF: *out dx,Rdw
+ -- F0: *lock
+ int1_0 = "F1",
+ repne_0 = "F2",
+ repnz_0 = "F2",
+ rep_0 = "F3",
+ repe_0 = "F3",
+ repz_0 = "F3",
+ -- F4: *hlt
+ cmc_0 = "F5",
+ -- F6: test... mb,i; div... mb
+ -- F7: test... mdw,i; div... mdw
+ clc_0 = "F8",
+ stc_0 = "F9",
+ -- FA: *cli
+ cld_0 = "FC",
+ std_0 = "FD",
+ -- FE: inc... mb
+ -- FF: inc... mdw
+
+ -- misc ops
+ not_1 = "m:F72m",
+ neg_1 = "m:F73m",
+ mul_1 = "m:F74m",
+ imul_1 = "m:F75m",
+ div_1 = "m:F76m",
+ idiv_1 = "m:F77m",
+
+ imul_2 = "rmdw:0FAFrM|rIdw:69rmI|rSdw:6BrmS|ridw:69rmi",
+ imul_3 = "rmIdw:69rMI|rmSdw:6BrMS|rmidw:69rMi",
+
+ movzx_2 = "rm/db:0FB6rM|rm/wb:0FB6rM|rm/dw:0FB7rM",
+ movsx_2 = "rm/db:0FBErM|rm/wb:0FBErM|rm/dw:0FBFrM",
+
+ bswap_1 = "rd:0FC8r",
+ bsf_2 = "rmdw:0FBCrM",
+ bsr_2 = "rmdw:0FBDrM",
+ bt_2 = "mrdw:0FA3Rm|midw:0FBA4mU",
+ btc_2 = "mrdw:0FBBRm|midw:0FBA7mU",
+ btr_2 = "mrdw:0FB3Rm|midw:0FBA6mU",
+ bts_2 = "mrdw:0FABRm|midw:0FBA5mU",
+
+ rdtsc_0 = "0F31", -- P1+
+ cpuid_0 = "0FA2", -- P1+
+
+ -- floating point ops
+ fst_1 = "ff:DDD0r|xd:D92m|xq:DD2m",
+ fstp_1 = "ff:DDD8r|xd:D93m|xq:DD3m|xt:DB7m",
+ fld_1 = "ff:D9C0r|xd:D90m|xq:DD0m|xt:DB5m",
+
+ fpop_0 = "DDD8", -- Alias for fstp st0.
+
+ fist_1 = "xw:nDF2m|xd:DB2m",
+ fistp_1 = "xw:nDF3m|xd:DB3m|xq:DF7m",
+ fisttp_1 = "xw:nDF1m|xd:DB1m|xq:DD1m", -- SSE3
+ fild_1 = "xw:nDF0m|xd:DB0m|xq:DF5m",
+
+ fxch_0 = "D9C9",
+ fxch_1 = "ff:D9C8r",
+ fxch_2 = "fFf:D9C8r|Fff:D9C8R",
+
+ fucom_1 = "ff:DDE0r",
+ fucom_2 = "Fff:DDE0R",
+ fucomp_1 = "ff:DDE8r",
+ fucomp_2 = "Fff:DDE8R",
+ fucomi_1 = "ff:DBE8r", -- P6+
+ fucomi_2 = "Fff:DBE8R", -- P6+
+ fucomip_1 = "ff:DFE8r", -- P6+
+ fucomip_2 = "Fff:DFE8R", -- P6+
+ fcomi_1 = "ff:DBF0r", -- P6+
+ fcomi_2 = "Fff:DBF0R", -- P6+
+ fcomip_1 = "ff:DFF0r", -- P6+
+ fcomip_2 = "Fff:DFF0R", -- P6+
+ fucompp_0 = "DAE9",
+ fcompp_0 = "DED9",
+
+ fldcw_1 = "xw:nD95m",
+ fstcw_1 = "xw:n9BD97m",
+ fnstcw_1 = "xw:nD97m",
+ fstsw_1 = "Rw:n9BDFE0|xw:n9BDD7m",
+ fnstsw_1 = "Rw:nDFE0|xw:nDD7m",
+ fclex_0 = "9BDBE2",
+ fnclex_0 = "DBE2",
+
+ fnop_0 = "D9D0",
+ -- D9D1-D9DF: unassigned
+
+ fchs_0 = "D9E0",
+ fabs_0 = "D9E1",
+ -- D9E2: unassigned
+ -- D9E3: unassigned
+ ftst_0 = "D9E4",
+ fxam_0 = "D9E5",
+ -- D9E6: unassigned
+ -- D9E7: unassigned
+ fld1_0 = "D9E8",
+ fldl2t_0 = "D9E9",
+ fldl2e_0 = "D9EA",
+ fldpi_0 = "D9EB",
+ fldlg2_0 = "D9EC",
+ fldln2_0 = "D9ED",
+ fldz_0 = "D9EE",
+ -- D9EF: unassigned
+
+ f2xm1_0 = "D9F0",
+ fyl2x_0 = "D9F1",
+ fptan_0 = "D9F2",
+ fpatan_0 = "D9F3",
+ fxtract_0 = "D9F4",
+ fprem1_0 = "D9F5",
+ fdecstp_0 = "D9F6",
+ fincstp_0 = "D9F7",
+ fprem_0 = "D9F8",
+ fyl2xp1_0 = "D9F9",
+ fsqrt_0 = "D9FA",
+ fsincos_0 = "D9FB",
+ frndint_0 = "D9FC",
+ fscale_0 = "D9FD",
+ fsin_0 = "D9FE",
+ fcos_0 = "D9FF",
+
+ -- SSE, SSE2, SSE3, SSSE3 ops
+ addsubpd_2 = "rmo:660FD0rM",
+ addsubps_2 = "rmo:F20FD0rM",
+ andnpd_2 = "rmo:660F55rM",
+ andnps_2 = "rmo:0F55rM",
+ andpd_2 = "rmo:660F54rM",
+ andps_2 = "rmo:0F54rM",
+ clflush_1 = "x.:0FAE7m",
+ cmppd_3 = "rmio:660FC2rMU",
+ cmpps_3 = "rmio:0FC2rMU",
+ cmpsd_3 = "rmio:F20FC2rMU",
+ cmpss_3 = "rmio:F30FC2rMU",
+ comisd_2 = "rmo:660F2FrM",
+ comiss_2 = "rmo:0F2FrM",
+ cvtdq2pd_2 = "rro:F30FE6rM|rx/oq:",
+ cvtdq2ps_2 = "rmo:0F5BrM",
+ cvtpd2dq_2 = "rmo:F20FE6rM",
+ cvtpd2ps_2 = "rmo:660F5ArM",
+ cvtpi2pd_2 = "rx/oq:660F2ArM",
+ cvtpi2ps_2 = "rx/oq:0F2ArM",
+ cvtps2dq_2 = "rmo:660F5BrM",
+ cvtps2pd_2 = "rro:0F5ArM|rx/oq:",
+ cvtsd2si_2 = "rr/do:F20F2DrM|rx/dq:",
+ cvtsd2ss_2 = "rro:F20F5ArM|rx/oq:",
+ cvtsi2sd_2 = "rm/od:F20F2ArM",
+ cvtsi2ss_2 = "rm/od:F30F2ArM",
+ cvtss2sd_2 = "rro:F30F5ArM|rx/od:",
+ cvtss2si_2 = "rr/do:F20F2CrM|rx/dd:",
+ cvttpd2dq_2 = "rmo:660FE6rM",
+ cvttps2dq_2 = "rmo:F30F5BrM",
+ cvttsd2si_2 = "rr/do:F20F2CrM|rx/dq:",
+ cvttss2si_2 = "rr/do:F30F2CrM|rx/dd:",
+ haddpd_2 = "rmo:660F7CrM",
+ haddps_2 = "rmo:F20F7CrM",
+ hsubpd_2 = "rmo:660F7DrM",
+ hsubps_2 = "rmo:F20F7DrM",
+ lddqu_2 = "rxo:F20FF0rM",
+ ldmxcsr_1 = "xd:0FAE2m",
+ lfence_0 = "0FAEE8",
+ maskmovdqu_2 = "rro:660FF7rM",
+ mfence_0 = "0FAEF0",
+ movapd_2 = "rmo:660F28rM|mro:660F29Rm",
+ movaps_2 = "rmo:0F28rM|mro:0F29Rm",
+ movd_2 = "rm/od:660F6ErM|mr/do:660F7ERm",
+ movddup_2 = "rmo:F20F12rM",
+ movdqa_2 = "rmo:660F6FrM|mro:660F7FRm",
+ movdqu_2 = "rmo:F30F6FrM|mro:F30F7FRm",
+ movhlps_2 = "rro:0F12rM",
+ movhpd_2 = "rx/oq:660F16rM|xr/qo:660F17Rm",
+ movhps_2 = "rx/oq:0F16rM|xr/qo:0F17Rm",
+ movlhps_2 = "rro:0F16rM",
+ movlpd_2 = "rx/oq:660F12rM|xr/qo:660F13Rm",
+ movlps_2 = "rx/oq:0F12rM|xr/qo:0F13Rm",
+ movmskpd_2 = "rr/do:660F50rM",
+ movmskps_2 = "rr/do:0F50rM",
+ movntdq_2 = "xro:660FE7Rm",
+ movnti_2 = "xrd:0FC3Rm",
+ movntpd_2 = "xro:660F2BRm",
+ movntps_2 = "xro:0F2BRm",
+ movq_2 = "rro:F30F7ErM|rx/oq:|xr/qo:660FD6Rm",
+ movsd_2 = "rro:F20F10rM|rx/oq:|xr/qo:F20F11Rm",
+ movshdup_2 = "rmo:F30F16rM",
+ movsldup_2 = "rmo:F30F12rM",
+ movss_2 = "rro:F30F10rM|rx/od:|xr/do:F30F11Rm",
+ movupd_2 = "rmo:660F10rM|mro:660F11Rm",
+ movups_2 = "rmo:0F10rM|mro:0F11Rm",
+ orpd_2 = "rmo:660F56rM",
+ orps_2 = "rmo:0F56rM",
+ pabsb_2 = "rmo:660F381CrM",
+ pabsd_2 = "rmo:660F381ErM",
+ pabsw_2 = "rmo:660F381DrM",
+ packssdw_2 = "rmo:660F6BrM",
+ packsswb_2 = "rmo:660F63rM",
+ packuswb_2 = "rmo:660F67rM",
+ paddb_2 = "rmo:660FFCrM",
+ paddd_2 = "rmo:660FFErM",
+ paddq_2 = "rmo:660FD4rM",
+ paddsb_2 = "rmo:660FECrM",
+ paddsw_2 = "rmo:660FEDrM",
+ paddusb_2 = "rmo:660FDCrM",
+ paddusw_2 = "rmo:660FDDrM",
+ paddw_2 = "rmo:660FFDrM",
+ palignr_3 = "rmio:660F3A0FrMU",
+ pand_2 = "rmo:660FDBrM",
+ pandn_2 = "rmo:660FDFrM",
+ pause_0 = "F390",
+ pavgb_2 = "rmo:660FE0rM",
+ pavgw_2 = "rmo:660FE3rM",
+ pcmpeqb_2 = "rmo:660F74rM",
+ pcmpeqd_2 = "rmo:660F76rM",
+ pcmpeqw_2 = "rmo:660F75rM",
+ pcmpgtb_2 = "rmo:660F64rM",
+ pcmpgtd_2 = "rmo:660F66rM",
+ pcmpgtw_2 = "rmo:660F65rM",
+ pextrw_3 = "rri/do:660FC5rMU",
+ phaddd_2 = "rmo:660F3802rM",
+ phaddsw_2 = "rmo:660F3803rM",
+ phaddw_2 = "rmo:660F3801rM",
+ phsubd_2 = "rmo:660F3806rM",
+ phsubsw_2 = "rmo:660F3807rM",
+ phsubw_2 = "rmo:660F3805rM",
+ pinsrw_3 = "rri/od:660FC4rMU|rmi/ow:",
+ pmaddubsw_2 = "rmo:660F3804rM",
+ pmaddwd_2 = "rmo:660FF5rM",
+ pmaxsw_2 = "rmo:660FEErM",
+ pmaxub_2 = "rmo:660FDErM",
+ pminsw_2 = "rmo:660FEArM",
+ pminub_2 = "rmo:660FDArM",
+ pmovmskb_2 = "rr/do:660FD7rM",
+ pmulhrsw_2 = "rmo:660F380BrM",
+ pmulhuw_2 = "rmo:660FE4rM",
+ pmulhw_2 = "rmo:660FE5rM",
+ pmullw_2 = "rmo:660FD5rM",
+ pmuludq_2 = "rmo:660FF4rM",
+ por_2 = "rmo:660FEBrM",
+ prefetchnta_1 = "xb:n0F180m",
+ prefetcht0_1 = "xb:n0F181m",
+ prefetcht1_1 = "xb:n0F182m",
+ prefetcht2_1 = "xb:n0F183m",
+ psadbw_2 = "rmo:660FF6rM",
+ pshufb_2 = "rmo:660F3800rM",
+ pshufd_3 = "rmio:660F70rMU",
+ pshufhw_3 = "rmio:F30F70rMU",
+ pshuflw_3 = "rmio:F20F70rMU",
+ psignb_2 = "rmo:660F3808rM",
+ psignd_2 = "rmo:660F380ArM",
+ psignw_2 = "rmo:660F3809rM",
+ pslld_2 = "rmo:660FF2rM|rio:660F726mU",
+ pslldq_2 = "rio:660F737mU",
+ psllq_2 = "rmo:660FF3rM|rio:660F736mU",
+ psllw_2 = "rmo:660FF1rM|rio:660F716mU",
+ psrad_2 = "rmo:660FE2rM|rio:660F724mU",
+ psraw_2 = "rmo:660FE1rM|rio:660F714mU",
+ psrld_2 = "rmo:660FD2rM|rio:660F722mU",
+ psrldq_2 = "rio:660F733mU",
+ psrlq_2 = "rmo:660FD3rM|rio:660F732mU",
+ psrlw_2 = "rmo:660FD1rM|rio:660F712mU",
+ psubb_2 = "rmo:660FF8rM",
+ psubd_2 = "rmo:660FFArM",
+ psubq_2 = "rmo:660FFBrM",
+ psubsb_2 = "rmo:660FE8rM",
+ psubsw_2 = "rmo:660FE9rM",
+ psubusb_2 = "rmo:660FD8rM",
+ psubusw_2 = "rmo:660FD9rM",
+ psubw_2 = "rmo:660FF9rM",
+ punpckhbw_2 = "rmo:660F68rM",
+ punpckhdq_2 = "rmo:660F6ArM",
+ punpckhqdq_2 = "rmo:660F6DrM",
+ punpckhwd_2 = "rmo:660F69rM",
+ punpcklbw_2 = "rmo:660F60rM",
+ punpckldq_2 = "rmo:660F62rM",
+ punpcklqdq_2 = "rmo:660F6CrM",
+ punpcklwd_2 = "rmo:660F61rM",
+ pxor_2 = "rmo:660FEFrM",
+ rcpps_2 = "rmo:0F53rM",
+ rcpss_2 = "rmo:F30F53rM",
+ rsqrtps_2 = "rmo:0F52rM",
+ rsqrtss_2 = "rmo:F30F52rM",
+ sfence_0 = "0FAEF8",
+ shufpd_3 = "rmio:660FC6rMU",
+ shufps_3 = "rmio:0FC6rMU",
+ stmxcsr_1 = "xd:0FAE3m",
+ ucomisd_2 = "rmo:660F2ErM",
+ ucomiss_2 = "rmo:0F2ErM",
+ unpckhpd_2 = "rmo:660F15rM",
+ unpckhps_2 = "rmo:0F15rM",
+ unpcklpd_2 = "rmo:660F14rM",
+ unpcklps_2 = "rmo:0F14rM",
+ xorpd_2 = "rmo:660F57rM",
+ xorps_2 = "rmo:0F57rM",
+}
+
+------------------------------------------------------------------------------
+
+-- Arithmetic ops.
+for name,n in pairs{ add = 0, ["or"] = 1, adc = 2, sbb = 3,
+ ["and"] = 4, sub = 5, xor = 6, cmp = 7 } do
+ local n8 = n * 8
+ map_op[name.."_2"] = format(
+ "mr:%02XRm|rm:%02XrM|mI1dw:81%XmI|mS1dw:83%XmS|Ri1dwb:%02Xi|mi1dwb:81%Xmi",
+ 1+n8, 3+n8, n, n, 5+n8, n)
+end
+
+-- Shift ops.
+for name,n in pairs{ rol = 0, ror = 1, rcl = 2, rcr = 3,
+ shl = 4, shr = 5, sar = 7, sal = 4 } do
+ map_op[name.."_2"] = format("m1:D1%Xm|mC1dwb:D3%Xm|mi:C1%XmU", n, n, n)
+end
+
+-- Conditional ops.
+for cc,n in pairs(map_cc) do
+ map_op["j"..cc.."_1"] = format("J.:0F8%XJ", n) -- short: 7%X
+ map_op["set"..cc.."_1"] = format("mb:n0F9%X2m", n)
+ map_op["cmov"..cc.."_2"] = format("rmdw:0F4%XrM", n) -- P6+
+end
+
+-- FP arithmetic ops.
+for name,n in pairs{ add = 0, mul = 1, com = 2, comp = 3,
+ sub = 4, subr = 5, div = 6, divr = 7 } do
+ local nc = 192 + n * 8
+ local nr = nc + (n < 4 and 0 or (n % 2 == 0 and 8 or -8))
+ local fn = "f"..name
+ map_op[fn.."_1"] = format("ff:D8%02Xr|xd:D8%Xm|xq:DC%Xm", nc, n, n)
+ if n == 2 or n == 3 then
+ map_op[fn.."_2"] = format("Fff:D8%02XR|Fx2d:D8%XM|Fx2q:DC%XM", nc, n, n)
+ else
+ map_op[fn.."_2"] = format("Fff:D8%02XR|fFf:DC%02Xr|Fx2d:D8%XM|Fx2q:DC%XM", nc, nr, n, n)
+ map_op[fn.."p_1"] = format("ff:DE%02Xr", nr)
+ map_op[fn.."p_2"] = format("fFf:DE%02Xr", nr)
+ end
+ map_op["fi"..name.."_1"] = format("xd:DA%Xm|xw:nDE%Xm", n, n)
+end
+
+-- FP conditional moves.
+for cc,n in pairs{ b=0, e=1, be=2, u=3, nb=4, ne=5, nbe=6, nu=7 } do
+ local n4 = n % 4
+ local nc = 56000 + n4 * 8 + (n-n4) * 64
+ map_op["fcmov"..cc.."_1"] = format("ff:%04Xr", nc) -- P6+
+ map_op["fcmov"..cc.."_2"] = format("Fff:%04XR", nc) -- P6+
+end
+
+-- SSE FP arithmetic ops.
+for name,n in pairs{ sqrt = 1, add = 8, mul = 9,
+ sub = 12, min = 13, div = 14, max = 15 } do
+ map_op[name.."ps_2"] = format("rmo:0F5%XrM", n)
+ map_op[name.."ss_2"] = format("rro:F30F5%XrM|rx/od:", n)
+ map_op[name.."pd_2"] = format("rmo:660F5%XrM", n)
+ map_op[name.."sd_2"] = format("rro:F20F5%XrM|rx/oq:", n)
+end
+
+------------------------------------------------------------------------------
+
+-- Process pattern string.
+local function dopattern(pat, args, sz, op)
+ local digit, addin
+ local opcode = 0
+ local szov = sz
+
+ -- Limit number of section buffer positions used by a single dasm_put().
+ -- A single opcode needs a maximum of 2 positions. !x64
+ if secpos+2 > maxsecpos then wflush() end
+
+ -- Process each character.
+ for c in gmatch(pat, ".") do
+ if match(c, "%x") then -- Hex digit.
+ digit = byte(c) - 48
+ if digit > 48 then digit = digit - 39
+ elseif digit > 16 then digit = digit - 7 end
+ opcode = opcode*16 + digit
+ addin = nil
+ elseif c == "n" then -- Disable operand size mods for opcode.
+ szov = nil
+ elseif c == "r" then -- Merge 1st operand regno. into opcode.
+ addin = args[1].reg; opcode = opcode + addin
+ elseif c == "R" then -- Merge 2nd operand regno. into opcode.
+ addin = args[2].reg; opcode = opcode + addin
+ elseif c == "m" or c == "M" then -- Encode ModRM/SIB.
+ if addin then
+ opcode = opcode - addin -- Undo regno opcode merge.
+ else
+ addin = opcode % 16 -- Undo last digit.
+ opcode = (opcode - addin) / 16
+ end
+ wputop(szov, opcode); opcode = nil
+ local imark = (sub(pat, -1) == "I") -- Force a mark (ugly).
+ -- Put ModRM/SIB with regno/last digit as spare.
+ wputmrmsib(args[c == "m" and 1 or 2], addin, imark)
+ else
+ if opcode then wputop(szov, opcode); opcode = nil end -- Flush opcode.
+ if c == "o" or c == "O" then -- Offset (pure 32 bit displacement).
+ wputdarg(args[c == "o" and 1 or 2].disp)
+ else
+ -- Anything else is an immediate operand.
+ local a = args[#args]
+ local mode, imm = a.mode, a.imm
+ if mode == "iJ" and not match("iIJ", c) then
+ werror("bad operand size for label")
+ end
+ if c == "S" then
+ wputsbarg(imm)
+ elseif c == "U" then
+ wputbarg(imm)
+ elseif c == "W" then
+ wputwarg(imm)
+ elseif c == "i" or c == "I" then
+ if mode == "iJ" then
+ wputlabel("IMM_", imm, 1)
+ elseif mode == "iI" and c == "I" then
+ waction(sz == "w" and "IMM_WB" or "IMM_DB", imm)
+ else
+ wputszarg(sz, imm)
+ end
+ elseif c == "J" then
+ if mode == "iPJ" then
+ waction("REL_A", imm) -- !x64 (secpos)
+ else
+ wputlabel("REL_", imm, 2)
+ end
+ else
+ werror("bad char `"..c.."' in pattern `"..pat.."' for `"..op.."'")
+ end
+ end
+ end
+ end
+ if opcode then wputop(szov, opcode) end
+end
+
+------------------------------------------------------------------------------
+
+-- Mapping of operand modes to short names. Suppress output with '#'.
+local map_modename = {
+ r = "reg", R = "eax", C = "cl", x = "mem", m = "mrm", i = "imm",
+ f = "stx", F = "st0", J = "lbl", ["1"] = "1",
+ I = "#", S = "#", O = "#",
+}
+
+-- Return a table/string showing all possible operand modes.
+local function templatehelp(template, nparams)
+ if nparams == 0 then return "" end
+ local t = {}
+ for tm in gmatch(template, "[^%|]+") do
+ local s = map_modename[sub(tm, 1, 1)]
+ s = s..gsub(sub(tm, 2, nparams), ".", function(c)
+ return ", "..map_modename[c]
+ end)
+ if not match(s, "#") then t[#t+1] = s end
+ end
+ return t
+end
+
+-- Match operand modes against mode match part of template.
+local function matchtm(tm, args)
+ for i=1,#args do
+ if not match(args[i].mode, sub(tm, i, i)) then return end
+ end
+ return true
+end
+
+-- Handle opcodes defined with template strings.
+map_op[".template__"] = function(params, template, nparams)
+ if not params then return templatehelp(template, nparams) end
+ local args = {}
+
+ -- Zero-operand opcodes have no match part.
+ if #params == 0 then
+ dopattern(template, args, "d", params.op)
+ return
+ end
+
+ -- Determine common operand size (coerce undefined size) or flag as mixed.
+ local sz, szmix
+ for i,p in ipairs(params) do
+ args[i] = parseoperand(p)
+ local nsz = args[i].opsize
+ if nsz then
+ if sz and sz ~= nsz then szmix = true else sz = nsz end
+ end
+ end
+
+ -- Try all match:pattern pairs (separated by '|').
+ local gotmatch, lastpat
+ for tm in gmatch(template, "[^%|]+") do
+ -- Split off size match (starts after mode match) and pattern string.
+ local szm, pat = match(tm, "^(.-):(.*)$", #args+1)
+ if pat == "" then pat = lastpat else lastpat = pat end
+ if matchtm(tm, args) then
+ local prefix = sub(szm, 1, 1)
+ if prefix == "/" then -- Match both operand sizes.
+ if args[1].opsize == sub(szm, 2, 2) and
+ args[2].opsize == sub(szm, 3, 3) then
+ dopattern(pat, args, sz, params.op) -- Process pattern string.
+ return
+ end
+ else -- Match common operand size.
+ local szp = sz
+ if szm == "" then szm = "dwb" end -- Default size match.
+ if prefix == "1" then szp = args[1].opsize; szmix = nil
+ elseif prefix == "2" then szp = args[2].opsize; szmix = nil end
+ if not szmix and (prefix == "." or match(szm, szp or "#")) then
+ dopattern(pat, args, szp, params.op) -- Process pattern string.
+ return
+ end
+ end
+ gotmatch = true
+ end
+ end
+
+ local msg = "bad operand mode"
+ if gotmatch then
+ if szmix then
+ msg = "mixed operand size"
+ else
+ msg = sz and "bad operand size" or "missing operand size"
+ end
+ end
+
+ werror(msg.." in `"..opmodestr(params.op, args).."'")
+end
+
+------------------------------------------------------------------------------
+
+-- Pseudo-opcodes for data storage.
+local function op_data(params)
+ if not params then return "imm..." end
+ local sz = sub(params.op, 2, 2)
+ if sz == "a" then sz = addrsize end
+ for _,p in ipairs(params) do
+ local a = parseoperand(p)
+ if sub(a.mode, 1, 1) ~= "i" or (a.opsize and a.opsize ~= sz) then
+ werror("bad mode or size in `"..p.."'")
+ end
+ if a.mode == "iJ" then
+ wputlabel("IMM_", a.imm, 1)
+ else
+ wputszarg(sz, a.imm)
+ end
+ end
+end
+
+map_op[".byte_*"] = op_data
+map_op[".sbyte_*"] = op_data
+map_op[".word_*"] = op_data
+map_op[".dword_*"] = op_data
+map_op[".aword_*"] = op_data
+
+------------------------------------------------------------------------------
+
+-- Pseudo-opcode to mark the position where the action list is to be emitted.
+map_op[".actionlist_1"] = function(params)
+ if not params then return "cvar" end
+ local name = params[1] -- No syntax check. You get to keep the pieces.
+ wline(function(out) writeactions(out, name) end)
+end
+
+-- Pseudo-opcode to mark the position where the global enum is to be emitted.
+map_op[".globals_1"] = function(params)
+ if not params then return "prefix" end
+ local prefix = params[1] -- No syntax check. You get to keep the pieces.
+ wline(function(out) writeglobals(out, prefix) end)
+end
+
+------------------------------------------------------------------------------
+
+-- Label pseudo-opcode (converted from trailing colon form).
+map_op[".label_2"] = function(params)
+ if not params then return "[1-9] | ->global | =>pcexpr [, addr]" end
+ local a = parseoperand(params[1])
+ local mode, imm = a.mode, a.imm
+ if type(imm) == "number" and (mode == "iJ" or (imm >= 1 and imm <= 9)) then
+ -- Local label (1: ... 9:) or global label (->global:).
+ waction("LABEL_LG", nil, 1)
+ wputxb(imm)
+ elseif mode == "iJ" then
+ -- PC label (=>pcexpr:).
+ waction("LABEL_PC", imm)
+ else
+ werror("bad label definition")
+ end
+ -- SETLABEL must immediately follow LABEL_LG/LABEL_PC.
+ local addr = params[2]
+ if addr then
+ local a = parseoperand(params[2])
+ if a.mode == "iPJ" then
+ waction("SETLABEL", a.imm) -- !x64 (secpos)
+ else
+ werror("bad label assignment")
+ end
+ end
+end
+map_op[".label_1"] = map_op[".label_2"]
+
+------------------------------------------------------------------------------
+
+-- Alignment pseudo-opcode.
+map_op[".align_1"] = function(params)
+ if not params then return "numpow2" end
+ local align = tonumber(params[1]) or map_opsizenum[map_opsize[params[1]]]
+ if align then
+ local x = align
+ -- Must be a power of 2 in the range (2 ... 256).
+ for i=1,8 do
+ x = x / 2
+ if x == 1 then
+ waction("ALIGN", nil, 1)
+ wputxb(align-1) -- Action byte is 2**n-1.
+ return
+ end
+ end
+ end
+ werror("bad alignment")
+end
+
+-- Spacing pseudo-opcode.
+map_op[".space_2"] = function(params)
+ if not params then return "num [, filler]" end
+ waction("SPACE", params[1])
+ local fill = params[2]
+ if fill then
+ fill = tonumber(fill)
+ if not fill or fill < 0 or fill > 255 then werror("bad filler") end
+ end
+ wputxb(fill or 0)
+end
+map_op[".space_1"] = map_op[".space_2"]
+
+------------------------------------------------------------------------------
+
+-- Pseudo-opcode for (primitive) type definitions (map to C types).
+map_op[".type_3"] = function(params, nparams)
+ if not params then
+ return nparams == 2 and "name, ctype" or "name, ctype, reg"
+ end
+ local name, ctype, reg = params[1], params[2], params[3]
+ if not match(name, "^[%a_][%w_]*$") then
+ werror("bad type name `"..name.."'")
+ end
+ local tp = map_type[name]
+ if tp then
+ werror("duplicate type `"..name.."'")
+ end
+ if reg and not map_reg_valid_base[reg] then
+ werror("bad base register `"..(map_reg_rev[reg] or reg).."'")
+ end
+ -- Add #type to defines. A bit unclean to put it in map_archdef.
+ map_archdef["#"..name] = "sizeof("..ctype..")"
+ -- Add new type and emit shortcut define.
+ local num = ctypenum + 1
+ map_type[name] = {
+ ctype = ctype,
+ ctypefmt = format("Dt%X(%%s)", num),
+ reg = reg,
+ }
+ wline(format("#define Dt%X(_V) (int)&(((%s *)0)_V)", num, ctype))
+ ctypenum = num
+end
+map_op[".type_2"] = map_op[".type_3"]
+
+-- Dump type definitions.
+local function dumptypes(out, lvl)
+ local t = {}
+ for name in pairs(map_type) do t[#t+1] = name end
+ sort(t)
+ out:write("Type definitions:\n")
+ for _,name in ipairs(t) do
+ local tp = map_type[name]
+ local reg = tp.reg and map_reg_rev[tp.reg] or ""
+ out:write(format(" %-20s %-20s %s\n", name, tp.ctype, reg))
+ end
+ out:write("\n")
+end
+
+------------------------------------------------------------------------------
+
+-- Set the current section.
+function _M.section(num)
+ waction("SECTION")
+ wputxb(num)
+ wflush(true) -- SECTION is a terminal action.
+end
+
+------------------------------------------------------------------------------
+
+-- Dump architecture description.
+function _M.dumparch(out)
+ out:write(format("DynASM %s version %s, released %s\n\n",
+ _info.arch, _info.version, _info.release))
+ dumpregs(out)
+ dumpactions(out)
+end
+
+-- Dump all user defined elements.
+function _M.dumpdef(out, lvl)
+ dumptypes(out, lvl)
+ dumpglobals(out, lvl)
+end
+
+------------------------------------------------------------------------------
+
+-- Pass callbacks from/to the DynASM core.
+function _M.passcb(wl, we, wf, ww)
+ wline, werror, wfatal, wwarn = wl, we, wf, ww
+ return wflush
+end
+
+-- Setup the arch-specific module.
+function _M.setup(arch, opt)
+ g_arch, g_opt = arch, opt
+end
+
+-- Merge the core maps and the arch-specific maps.
+function _M.mergemaps(map_coreop, map_def)
+ setmetatable(map_op, { __index = map_coreop })
+ setmetatable(map_def, { __index = map_archdef })
+ return map_op, map_def
+end
+
+return _M
+
+------------------------------------------------------------------------------
+
diff --git a/src/dynasm/dynasm.lua b/src/dynasm/dynasm.lua
new file mode 100644
index 0000000000..264a4bb4de
--- /dev/null
+++ b/src/dynasm/dynasm.lua
@@ -0,0 +1,1070 @@
+------------------------------------------------------------------------------
+-- DynASM. A dynamic assembler for code generation engines.
+-- Originally designed and implemented for LuaJIT.
+--
+-- Copyright (C) 2005-2008 Mike Pall. All rights reserved.
+-- See below for full copyright notice.
+------------------------------------------------------------------------------
+
+-- Application information.
+local _info = {
+ name = "DynASM",
+ description = "A dynamic assembler for code generation engines",
+ version = "1.1.4",
+ vernum = 10104,
+ release = "2008-01-29",
+ author = "Mike Pall",
+ url = "http://luajit.org/dynasm.html",
+ license = "MIT",
+ copyright = [[
+Copyright (C) 2005-2008 Mike Pall. 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.
+
+[ MIT license: http://www.opensource.org/licenses/mit-license.php ]
+]],
+}
+
+-- Cache library functions.
+local type, pairs, ipairs = type, pairs, ipairs
+local pcall, error, assert = pcall, error, assert
+local _s = string
+local sub, match, gmatch, gsub = _s.sub, _s.match, _s.gmatch, _s.gsub
+local format, rep, upper = _s.format, _s.rep, _s.upper
+local _t = table
+local insert, remove, concat, sort = _t.insert, _t.remove, _t.concat, _t.sort
+local exit = os.exit
+local io = io
+local stdin, stdout, stderr = io.stdin, io.stdout, io.stderr
+
+------------------------------------------------------------------------------
+
+-- Program options.
+local g_opt = {}
+
+-- Global state for current file.
+local g_fname, g_curline, g_indent, g_lineno, g_synclineno, g_arch
+local g_errcount = 0
+
+-- Write buffer for output file.
+local g_wbuffer, g_capbuffer
+
+------------------------------------------------------------------------------
+
+-- Write an output line (or callback function) to the buffer.
+local function wline(line, needindent)
+ local buf = g_capbuffer or g_wbuffer
+ buf[#buf+1] = needindent and g_indent..line or line
+ g_synclineno = g_synclineno + 1
+end
+
+-- Write assembler line as a comment, if requestd.
+local function wcomment(aline)
+ if g_opt.comment then
+ wline(g_opt.comment..aline..g_opt.endcomment, true)
+ end
+end
+
+-- Resync CPP line numbers.
+local function wsync()
+ if g_synclineno ~= g_lineno and g_opt.cpp then
+ wline("# "..g_lineno..' "'..g_fname..'"')
+ g_synclineno = g_lineno
+ end
+end
+
+-- Dummy action flush function. Replaced with arch-specific function later.
+local function wflush(term)
+end
+
+-- Dump all buffered output lines.
+local function wdumplines(out, buf)
+ for _,line in ipairs(buf) do
+ if type(line) == "string" then
+ assert(out:write(line, "\n"))
+ else
+ -- Special callback to dynamically insert lines after end of processing.
+ line(out)
+ end
+ end
+end
+
+------------------------------------------------------------------------------
+
+-- Emit an error. Processing continues with next statement.
+local function werror(msg)
+ error(format("%s:%s: error: %s:\n%s", g_fname, g_lineno, msg, g_curline), 0)
+end
+
+-- Emit a fatal error. Processing stops.
+local function wfatal(msg)
+ g_errcount = "fatal"
+ werror(msg)
+end
+
+-- Print a warning. Processing continues.
+local function wwarn(msg)
+ stderr:write(format("%s:%s: warning: %s:\n%s\n",
+ g_fname, g_lineno, msg, g_curline))
+end
+
+-- Print caught error message. But suppress excessive errors.
+local function wprinterr(...)
+ if type(g_errcount) == "number" then
+ -- Regular error.
+ g_errcount = g_errcount + 1
+ if g_errcount < 21 then -- Seems to be a reasonable limit.
+ stderr:write(...)
+ elseif g_errcount == 21 then
+ stderr:write(g_fname,
+ ":*: warning: too many errors (suppressed further messages).\n")
+ end
+ else
+ -- Fatal error.
+ stderr:write(...)
+ return true -- Stop processing.
+ end
+end
+
+------------------------------------------------------------------------------
+
+-- Map holding all option handlers.
+local opt_map = {}
+local opt_current
+
+-- Print error and exit with error status.
+local function opterror(...)
+ stderr:write("dynasm.lua: ERROR: ", ...)
+ stderr:write("\n")
+ exit(1)
+end
+
+-- Get option parameter.
+local function optparam(args)
+ local argn = args.argn
+ local p = args[argn]
+ if not p then
+ opterror("missing parameter for option `", opt_current, "'.")
+ end
+ args.argn = argn + 1
+ return p
+end
+
+------------------------------------------------------------------------------
+
+-- Core pseudo-opcodes.
+local map_coreop = {}
+-- Dummy opcode map. Replaced by arch-specific map.
+local map_op = {}
+
+-- Forward declarations.
+local dostmt
+local readfile
+
+------------------------------------------------------------------------------
+
+-- Map for defines (initially empty, chains to arch-specific map).
+local map_def = {}
+
+-- Pseudo-opcode to define a substitution.
+map_coreop[".define_2"] = function(params, nparams)
+ if not params then return nparams == 1 and "name" or "name, subst" end
+ local name, def = params[1], params[2] or "1"
+ if not match(name, "^[%a_][%w_]*$") then werror("bad or duplicate define") end
+ map_def[name] = def
+end
+map_coreop[".define_1"] = map_coreop[".define_2"]
+
+-- Define a substitution on the command line.
+function opt_map.D(args)
+ local namesubst = optparam(args)
+ local name, subst = match(namesubst, "^([%a_][%w_]*)=(.*)$")
+ if name then
+ map_def[name] = subst
+ elseif match(namesubst, "^[%a_][%w_]*$") then
+ map_def[namesubst] = "1"
+ else
+ opterror("bad define")
+ end
+end
+
+-- Undefine a substitution on the command line.
+function opt_map.U(args)
+ local name = optparam(args)
+ if match(name, "^[%a_][%w_]*$") then
+ map_def[name] = nil
+ else
+ opterror("bad define")
+ end
+end
+
+-- Helper for definesubst.
+local gotsubst
+
+local function definesubst_one(word)
+ local subst = map_def[word]
+ if subst then gotsubst = word; return subst else return word end
+end
+
+-- Iteratively substitute defines.
+local function definesubst(stmt)
+ -- Limit number of iterations.
+ for i=1,100 do
+ gotsubst = false
+ stmt = gsub(stmt, "#?[%w_]+", definesubst_one)
+ if not gotsubst then break end
+ end
+ if gotsubst then wfatal("recursive define involving `"..gotsubst.."'") end
+ return stmt
+end
+
+-- Dump all defines.
+local function dumpdefines(out, lvl)
+ local t = {}
+ for name in pairs(map_def) do
+ t[#t+1] = name
+ end
+ sort(t)
+ out:write("Defines:\n")
+ for _,name in ipairs(t) do
+ local subst = map_def[name]
+ if g_arch then subst = g_arch.revdef(subst) end
+ out:write(format(" %-20s %s\n", name, subst))
+ end
+ out:write("\n")
+end
+
+------------------------------------------------------------------------------
+
+-- Support variables for conditional assembly.
+local condlevel = 0
+local condstack = {}
+
+-- Evaluate condition with a Lua expression. Substitutions already performed.
+local function cond_eval(cond)
+ local func, err = loadstring("return "..cond)
+ if func then
+ setfenv(func, {}) -- No globals. All unknown identifiers evaluate to nil.
+ local ok, res = pcall(func)
+ if ok then
+ if res == 0 then return false end -- Oh well.
+ return not not res
+ end
+ err = res
+ end
+ wfatal("bad condition: "..err)
+end
+
+-- Skip statements until next conditional pseudo-opcode at the same level.
+local function stmtskip()
+ local dostmt_save = dostmt
+ local lvl = 0
+ dostmt = function(stmt)
+ local op = match(stmt, "^%s*(%S+)")
+ if op == ".if" then
+ lvl = lvl + 1
+ elseif lvl ~= 0 then
+ if op == ".endif" then lvl = lvl - 1 end
+ elseif op == ".elif" or op == ".else" or op == ".endif" then
+ dostmt = dostmt_save
+ dostmt(stmt)
+ end
+ end
+end
+
+-- Pseudo-opcodes for conditional assembly.
+map_coreop[".if_1"] = function(params)
+ if not params then return "condition" end
+ local lvl = condlevel + 1
+ local res = cond_eval(params[1])
+ condlevel = lvl
+ condstack[lvl] = res
+ if not res then stmtskip() end
+end
+
+map_coreop[".elif_1"] = function(params)
+ if not params then return "condition" end
+ if condlevel == 0 then wfatal(".elif without .if") end
+ local lvl = condlevel
+ local res = condstack[lvl]
+ if res then
+ if res == "else" then wfatal(".elif after .else") end
+ else
+ res = cond_eval(params[1])
+ if res then
+ condstack[lvl] = res
+ return
+ end
+ end
+ stmtskip()
+end
+
+map_coreop[".else_0"] = function(params)
+ if condlevel == 0 then wfatal(".else without .if") end
+ local lvl = condlevel
+ local res = condstack[lvl]
+ condstack[lvl] = "else"
+ if res then
+ if res == "else" then wfatal(".else after .else") end
+ stmtskip()
+ end
+end
+
+map_coreop[".endif_0"] = function(params)
+ local lvl = condlevel
+ if lvl == 0 then wfatal(".endif without .if") end
+ condlevel = lvl - 1
+end
+
+-- Check for unfinished conditionals.
+local function checkconds()
+ if g_errcount ~= "fatal" and condlevel ~= 0 then
+ wprinterr(g_fname, ":*: error: unbalanced conditional\n")
+ end
+end
+
+------------------------------------------------------------------------------
+
+-- Search for a file in the given path and open it for reading.
+local function pathopen(path, name)
+ local dirsep = match(package.path, "\\") and "\\" or "/"
+ for _,p in ipairs(path) do
+ local fullname = p == "" and name or p..dirsep..name
+ local fin = io.open(fullname, "r")
+ if fin then
+ g_fname = fullname
+ return fin
+ end
+ end
+end
+
+-- Include a file.
+map_coreop[".include_1"] = function(params)
+ if not params then return "filename" end
+ local name = params[1]
+ -- Save state. Ugly, I know. but upvalues are fast.
+ local gf, gl, gcl, gi = g_fname, g_lineno, g_curline, g_indent
+ -- Read the included file.
+ local fatal = readfile(pathopen(g_opt.include, name) or
+ wfatal("include file `"..name.."' not found"))
+ -- Restore state.
+ g_synclineno = -1
+ g_fname, g_lineno, g_curline, g_indent = gf, gl, gcl, gi
+ if fatal then wfatal("in include file") end
+end
+
+-- Make .include initially available, too.
+map_op[".include_1"] = map_coreop[".include_1"]
+
+------------------------------------------------------------------------------
+
+-- Support variables for macros.
+local mac_capture, mac_lineno, mac_name
+local mac_active = {}
+local mac_list = {}
+
+-- Pseudo-opcode to define a macro.
+map_coreop[".macro_*"] = function(mparams)
+ if not mparams then return "name [, params...]" end
+ -- Split off and validate macro name.
+ local name = remove(mparams, 1)
+ if not name then werror("missing macro name") end
+ if not (match(name, "^[%a_][%w_%.]*$") or match(name, "^%.[%w_%.]+$")) then
+ wfatal("bad macro name `"..name.."'")
+ end
+ -- Validate macro parameter names.
+ local mdup = {}
+ for _,mp in ipairs(mparams) do
+ if not match(mp, "^[%a_][%w_]*$") then
+ wfatal("bad macro parameter name `"..mp.."'")
+ end
+ if mdup[mp] then wfatal("duplicate macro parameter name `"..mp.."'") end
+ mdup[mp] = true
+ end
+ -- Check for duplicate or recursive macro definitions.
+ local opname = name.."_"..#mparams
+ if map_op[opname] or map_op[name.."_*"] then
+ wfatal("duplicate macro `"..name.."' ("..#mparams.." parameters)")
+ end
+ if mac_capture then wfatal("recursive macro definition") end
+
+ -- Enable statement capture.
+ local lines = {}
+ mac_lineno = g_lineno
+ mac_name = name
+ mac_capture = function(stmt) -- Statement capture function.
+ -- Stop macro definition with .endmacro pseudo-opcode.
+ if not match(stmt, "^%s*.endmacro%s*$") then
+ lines[#lines+1] = stmt
+ return
+ end
+ mac_capture = nil
+ mac_lineno = nil
+ mac_name = nil
+ mac_list[#mac_list+1] = opname
+ -- Add macro-op definition.
+ map_op[opname] = function(params)
+ if not params then return mparams, lines end
+ -- Protect against recursive macro invocation.
+ if mac_active[opname] then wfatal("recursive macro invocation") end
+ mac_active[opname] = true
+ -- Setup substitution map.
+ local subst = {}
+ for i,mp in ipairs(mparams) do subst[mp] = params[i] end
+ local mcom
+ if g_opt.maccomment and g_opt.comment then
+ mcom = " MACRO "..name.." ("..#mparams..")"
+ wcomment("{"..mcom)
+ end
+ -- Loop through all captured statements
+ for _,stmt in ipairs(lines) do
+ -- Substitute macro parameters.
+ local st = gsub(stmt, "[%w_]+", subst)
+ st = definesubst(st)
+ st = gsub(st, "%s*%.%.%s*", "") -- Token paste a..b.
+ if mcom and sub(st, 1, 1) ~= "|" then wcomment(st) end
+ -- Emit statement. Use a protected call for better diagnostics.
+ local ok, err = pcall(dostmt, st)
+ if not ok then
+ -- Add the captured statement to the error.
+ wprinterr(err, "\n", g_indent, "| ", stmt,
+ "\t[MACRO ", name, " (", #mparams, ")]\n")
+ end
+ end
+ if mcom then wcomment("}"..mcom) end
+ mac_active[opname] = nil
+ end
+ end
+end
+
+-- An .endmacro pseudo-opcode outside of a macro definition is an error.
+map_coreop[".endmacro_0"] = function(params)
+ wfatal(".endmacro without .macro")
+end
+
+-- Dump all macros and their contents (with -PP only).
+local function dumpmacros(out, lvl)
+ sort(mac_list)
+ out:write("Macros:\n")
+ for _,opname in ipairs(mac_list) do
+ local name = sub(opname, 1, -3)
+ local params, lines = map_op[opname]()
+ out:write(format(" %-20s %s\n", name, concat(params, ", ")))
+ if lvl > 1 then
+ for _,line in ipairs(lines) do
+ out:write(" |", line, "\n")
+ end
+ out:write("\n")
+ end
+ end
+ out:write("\n")
+end
+
+-- Check for unfinished macro definitions.
+local function checkmacros()
+ if mac_capture then
+ wprinterr(g_fname, ":", mac_lineno,
+ ": error: unfinished .macro `", mac_name ,"'\n")
+ end
+end
+
+------------------------------------------------------------------------------
+
+-- Support variables for captures.
+local cap_lineno, cap_name
+local cap_buffers = {}
+local cap_used = {}
+
+-- Start a capture.
+map_coreop[".capture_1"] = function(params)
+ if not params then return "name" end
+ wflush()
+ local name = params[1]
+ if not match(name, "^[%a_][%w_]*$") then
+ wfatal("bad capture name `"..name.."'")
+ end
+ if cap_name then
+ wfatal("already capturing to `"..cap_name.."' since line "..cap_lineno)
+ end
+ cap_name = name
+ cap_lineno = g_lineno
+ -- Create or continue a capture buffer and start the output line capture.
+ local buf = cap_buffers[name]
+ if not buf then buf = {}; cap_buffers[name] = buf end
+ g_capbuffer = buf
+ g_synclineno = 0
+end
+
+-- Stop a capture.
+map_coreop[".endcapture_0"] = function(params)
+ wflush()
+ if not cap_name then wfatal(".endcapture without a valid .capture") end
+ cap_name = nil
+ cap_lineno = nil
+ g_capbuffer = nil
+ g_synclineno = 0
+end
+
+-- Dump a capture buffer.
+map_coreop[".dumpcapture_1"] = function(params)
+ if not params then return "name" end
+ wflush()
+ local name = params[1]
+ if not match(name, "^[%a_][%w_]*$") then
+ wfatal("bad capture name `"..name.."'")
+ end
+ cap_used[name] = true
+ wline(function(out)
+ local buf = cap_buffers[name]
+ if buf then wdumplines(out, buf) end
+ end)
+ g_synclineno = 0
+end
+
+-- Dump all captures and their buffers (with -PP only).
+local function dumpcaptures(out, lvl)
+ out:write("Captures:\n")
+ for name,buf in pairs(cap_buffers) do
+ out:write(format(" %-20s %4s)\n", name, "("..#buf))
+ if lvl > 1 then
+ local bar = rep("=", 76)
+ out:write(" ", bar, "\n")
+ for _,line in ipairs(buf) do
+ out:write(" ", line, "\n")
+ end
+ out:write(" ", bar, "\n\n")
+ end
+ end
+ out:write("\n")
+end
+
+-- Check for unfinished or unused captures.
+local function checkcaptures()
+ if cap_name then
+ wprinterr(g_fname, ":", cap_lineno,
+ ": error: unfinished .capture `", cap_name,"'\n")
+ return
+ end
+ for name in pairs(cap_buffers) do
+ if not cap_used[name] then
+ wprinterr(g_fname, ":*: error: missing .dumpcapture ", name ,"\n")
+ end
+ end
+end
+
+------------------------------------------------------------------------------
+
+-- Sections names.
+local map_sections = {}
+
+-- Pseudo-opcode to define code sections.
+-- TODO: Data sections, BSS sections. Needs extra C code and API.
+map_coreop[".section_*"] = function(params)
+ if not params then return "name..." end
+ if #map_sections > 0 then werror("duplicate section definition") end
+ wflush()
+ for sn,name in ipairs(params) do
+ local opname = "."..name.."_0"
+ if not match(name, "^[%a][%w_]*$") or
+ map_op[opname] or map_op["."..name.."_*"] then
+ werror("bad section name `"..name.."'")
+ end
+ map_sections[#map_sections+1] = name
+ wline(format("#define DASM_SECTION_%s\t%d", upper(name), sn-1))
+ map_op[opname] = function(params) g_arch.section(sn-1) end
+ end
+ wline(format("#define DASM_MAXSECTION\t\t%d", #map_sections))
+end
+
+-- Dump all sections.
+local function dumpsections(out, lvl)
+ out:write("Sections:\n")
+ for _,name in ipairs(map_sections) do
+ out:write(format(" %s\n", name))
+ end
+ out:write("\n")
+end
+
+------------------------------------------------------------------------------
+
+-- Load architecture-specific module.
+local function loadarch(arch)
+ if not match(arch, "^[%w_]+$") then return "bad arch name" end
+ local ok, m_arch = pcall(require, "dasm_"..arch)
+ if not ok then return "cannot load module: "..m_arch end
+ g_arch = m_arch
+ wflush = m_arch.passcb(wline, werror, wfatal, wwarn)
+ m_arch.setup(arch, g_opt)
+ map_op, map_def = m_arch.mergemaps(map_coreop, map_def)
+end
+
+-- Dump architecture description.
+function opt_map.dumparch(args)
+ local name = optparam(args)
+ if not g_arch then
+ local err = loadarch(name)
+ if err then opterror(err) end
+ end
+
+ local t = {}
+ for name in pairs(map_coreop) do t[#t+1] = name end
+ for name in pairs(map_op) do t[#t+1] = name end
+ sort(t)
+
+ local out = stdout
+ local _arch = g_arch._info
+ out:write(format("%s version %s, released %s, %s\n",
+ _info.name, _info.version, _info.release, _info.url))
+ g_arch.dumparch(out)
+
+ local pseudo = true
+ out:write("Pseudo-Opcodes:\n")
+ for _,sname in ipairs(t) do
+ local name, nparam = match(sname, "^(.+)_([0-9%*])$")
+ if name then
+ if pseudo and sub(name, 1, 1) ~= "." then
+ out:write("\nOpcodes:\n")
+ pseudo = false
+ end
+ local f = map_op[sname]
+ local s
+ if nparam ~= "*" then nparam = nparam + 0 end
+ if nparam == 0 then
+ s = ""
+ elseif type(f) == "string" then
+ s = map_op[".template__"](nil, f, nparam)
+ else
+ s = f(nil, nparam)
+ end
+ if type(s) == "table" then
+ for _,s2 in ipairs(s) do
+ out:write(format(" %-12s %s\n", name, s2))
+ end
+ else
+ out:write(format(" %-12s %s\n", name, s))
+ end
+ end
+ end
+ out:write("\n")
+ exit(0)
+end
+
+-- Pseudo-opcode to set the architecture.
+-- Only initially available (map_op is replaced when called).
+map_op[".arch_1"] = function(params)
+ if not params then return "name" end
+ local err = loadarch(params[1])
+ if err then wfatal(err) end
+end
+
+-- Dummy .arch pseudo-opcode to improve the error report.
+map_coreop[".arch_1"] = function(params)
+ if not params then return "name" end
+ wfatal("duplicate .arch statement")
+end
+
+------------------------------------------------------------------------------
+
+-- Dummy pseudo-opcode. Don't confuse '.nop' with 'nop'.
+map_coreop[".nop_*"] = function(params)
+ if not params then return "[ignored...]" end
+end
+
+-- Pseudo-opcodes to raise errors.
+map_coreop[".error_1"] = function(params)
+ if not params then return "message" end
+ werror(params[1])
+end
+
+map_coreop[".fatal_1"] = function(params)
+ if not params then return "message" end
+ wfatal(params[1])
+end
+
+-- Dump all user defined elements.
+local function dumpdef(out)
+ local lvl = g_opt.dumpdef
+ if lvl == 0 then return end
+ dumpsections(out, lvl)
+ dumpdefines(out, lvl)
+ if g_arch then g_arch.dumpdef(out, lvl) end
+ dumpmacros(out, lvl)
+ dumpcaptures(out, lvl)
+end
+
+------------------------------------------------------------------------------
+
+-- Helper for splitstmt.
+local splitlvl
+
+local function splitstmt_one(c)
+ if c == "(" then
+ splitlvl = ")"..splitlvl
+ elseif c == "[" then
+ splitlvl = "]"..splitlvl
+ elseif c == ")" or c == "]" then
+ if sub(splitlvl, 1, 1) ~= c then werror("unbalanced () or []") end
+ splitlvl = sub(splitlvl, 2)
+ elseif splitlvl == "" then
+ return " \0 "
+ end
+ return c
+end
+
+-- Split statement into (pseudo-)opcode and params.
+local function splitstmt(stmt)
+ -- Convert label with trailing-colon into .label statement.
+ local label = match(stmt, "^%s*(.+):%s*$")
+ if label then return ".label", {label} end
+
+ -- Split at commas and equal signs, but obey parentheses and brackets.
+ splitlvl = ""
+ stmt = gsub(stmt, "[,%(%)%[%]]", splitstmt_one)
+ if splitlvl ~= "" then werror("unbalanced () or []") end
+
+ -- Split off opcode.
+ local op, other = match(stmt, "^%s*([^%s%z]+)%s*(.*)$")
+ if not op then werror("bad statement syntax") end
+
+ -- Split parameters.
+ local params = {}
+ for p in gmatch(other, "%s*(%Z+)%z?") do
+ params[#params+1] = gsub(p, "%s+$", "")
+ end
+ if #params > 16 then werror("too many parameters") end
+
+ params.op = op
+ return op, params
+end
+
+-- Process a single statement.
+dostmt = function(stmt)
+ -- Ignore empty statements.
+ if match(stmt, "^%s*$") then return end
+
+ -- Capture macro defs before substitution.
+ if mac_capture then return mac_capture(stmt) end
+ stmt = definesubst(stmt)
+
+ -- Emit C code without parsing the line.
+ if sub(stmt, 1, 1) == "|" then
+ local tail = sub(stmt, 2)
+ wflush()
+ if sub(tail, 1, 2) == "//" then wcomment(tail) else wline(tail, true) end
+ return
+ end
+
+ -- Split into (pseudo-)opcode and params.
+ local op, params = splitstmt(stmt)
+
+ -- Get opcode handler (matching # of parameters or generic handler).
+ local f = map_op[op.."_"..#params] or map_op[op.."_*"]
+ if not f then
+ if not g_arch then wfatal("first statement must be .arch") end
+ -- Improve error report.
+ for i=0,16 do
+ if map_op[op.."_"..i] then
+ werror("wrong number of parameters for `"..op.."'")
+ end
+ end
+ werror("unknown statement `"..op.."'")
+ end
+
+ -- Call opcode handler or special handler for template strings.
+ if type(f) == "string" then
+ map_op[".template__"](params, f)
+ else
+ f(params)
+ end
+end
+
+-- Process a single line.
+local function doline(line)
+ if g_opt.flushline then wflush() end
+
+ -- Assembler line?
+ local indent, aline = match(line, "^(%s*)%|(.*)$")
+ if not aline then
+ -- No, plain C code line, need to flush first.
+ wflush()
+ wsync()
+ wline(line, false)
+ return
+ end
+
+ g_indent = indent -- Remember current line indentation.
+
+ -- Emit C code (even from macros). Avoids echo and line parsing.
+ if sub(aline, 1, 1) == "|" then
+ if not mac_capture then
+ wsync()
+ elseif g_opt.comment then
+ wsync()
+ wcomment(aline)
+ end
+ dostmt(aline)
+ return
+ end
+
+ -- Echo assembler line as a comment.
+ if g_opt.comment then
+ wsync()
+ wcomment(aline)
+ end
+
+ -- Strip assembler comments.
+ aline = gsub(aline, "//.*$", "")
+
+ -- Split line into statements at semicolons.
+ if match(aline, ";") then
+ for stmt in gmatch(aline, "[^;]+") do dostmt(stmt) end
+ else
+ dostmt(aline)
+ end
+end
+
+------------------------------------------------------------------------------
+
+-- Write DynASM header.
+local function dasmhead(out)
+ out:write(format([[
+/*
+** This file has been pre-processed with DynASM.
+** %s
+** DynASM version %s, DynASM %s version %s
+** DO NOT EDIT! The original file is in "%s".
+*/
+
+#if DASM_VERSION != %d
+#error "Version mismatch between DynASM and included encoding engine"
+#endif
+
+]], _info.url,
+ _info.version, g_arch._info.arch, g_arch._info.version,
+ g_fname, _info.vernum))
+end
+
+-- Read input file.
+readfile = function(fin)
+ g_indent = ""
+ g_lineno = 0
+ g_synclineno = -1
+
+ -- Process all lines.
+ for line in fin:lines() do
+ g_lineno = g_lineno + 1
+ g_curline = line
+ local ok, err = pcall(doline, line)
+ if not ok and wprinterr(err, "\n") then return true end
+ end
+ wflush()
+
+ -- Close input file.
+ assert(fin == stdin or fin:close())
+end
+
+-- Write output file.
+local function writefile(outfile)
+ local fout
+
+ -- Open output file.
+ if outfile == nil or outfile == "-" then
+ fout = stdout
+ else
+ fout = assert(io.open(outfile, "w"))
+ end
+
+ -- Write all buffered lines
+ wdumplines(fout, g_wbuffer)
+
+ -- Close output file.
+ assert(fout == stdout or fout:close())
+
+ -- Optionally dump definitions.
+ dumpdef(fout == stdout and stderr or stdout)
+end
+
+-- Translate an input file to an output file.
+local function translate(infile, outfile)
+ g_wbuffer = {}
+ g_indent = ""
+ g_lineno = 0
+ g_synclineno = -1
+
+ -- Put header.
+ wline(dasmhead)
+
+ -- Read input file.
+ local fin
+ if infile == "-" then
+ g_fname = "(stdin)"
+ fin = stdin
+ else
+ g_fname = infile
+ fin = assert(io.open(infile, "r"))
+ end
+ readfile(fin)
+
+ -- Check for errors.
+ if not g_arch then
+ wprinterr(g_fname, ":*: error: missing .arch directive\n")
+ end
+ checkconds()
+ checkmacros()
+ checkcaptures()
+
+ if g_errcount ~= 0 then
+ stderr:write(g_fname, ":*: info: ", g_errcount, " error",
+ (type(g_errcount) == "number" and g_errcount > 1) and "s" or "",
+ " in input file -- no output file generated.\n")
+ dumpdef(stderr)
+ exit(1)
+ end
+
+ -- Write output file.
+ writefile(outfile)
+end
+
+------------------------------------------------------------------------------
+
+-- Print help text.
+function opt_map.help()
+ stdout:write("DynASM -- ", _info.description, ".\n")
+ stdout:write("DynASM ", _info.version, " ", _info.release, " ", _info.url, "\n")
+ stdout:write[[
+
+Usage: dynasm [OPTION]... INFILE.dasc|-
+
+ -h, --help Display this help text.
+ -V, --version Display version and copyright information.
+
+ -o, --outfile FILE Output file name (default is stdout).
+ -I, --include DIR Add directory to the include search path.
+
+ -c, --ccomment Use /* */ comments for assembler lines.
+ -C, --cppcomment Use // comments for assembler lines (default).
+ -N, --nocomment Suppress assembler lines in output.
+ -M, --maccomment Show macro expansions as comments (default off).
+
+ -L, --nolineno Suppress CPP line number information in output.
+ -F, --flushline Flush action list for every line.
+
+ -D NAME[=SUBST] Define a substitution.
+ -U NAME Undefine a substitution.
+
+ -P, --dumpdef Dump defines, macros, etc. Repeat for more output.
+ -A, --dumparch ARCH Load architecture ARCH and dump description.
+]]
+ exit(0)
+end
+
+-- Print version information.
+function opt_map.version()
+ stdout:write(format("%s version %s, released %s\n%s\n\n%s",
+ _info.name, _info.version, _info.release, _info.url, _info.copyright))
+ exit(0)
+end
+
+-- Misc. options.
+function opt_map.outfile(args) g_opt.outfile = optparam(args) end
+function opt_map.include(args) insert(g_opt.include, 1, optparam(args)) end
+function opt_map.ccomment() g_opt.comment = "/*|"; g_opt.endcomment = " */" end
+function opt_map.cppcomment() g_opt.comment = "//|"; g_opt.endcomment = "" end
+function opt_map.nocomment() g_opt.comment = false end
+function opt_map.maccomment() g_opt.maccomment = true end
+function opt_map.nolineno() g_opt.cpp = false end
+function opt_map.flushline() g_opt.flushline = true end
+function opt_map.dumpdef() g_opt.dumpdef = g_opt.dumpdef + 1 end
+
+------------------------------------------------------------------------------
+
+-- Short aliases for long options.
+local opt_alias = {
+ h = "help", ["?"] = "help", V = "version",
+ o = "outfile", I = "include",
+ c = "ccomment", C = "cppcomment", N = "nocomment", M = "maccomment",
+ L = "nolineno", F = "flushline",
+ P = "dumpdef", A = "dumparch",
+}
+
+-- Parse single option.
+local function parseopt(opt, args)
+ opt_current = #opt == 1 and "-"..opt or "--"..opt
+ local f = opt_map[opt] or opt_map[opt_alias[opt]]
+ if not f then
+ opterror("unrecognized option `", opt_current, "'. Try `--help'.\n")
+ end
+ f(args)
+end
+
+-- Parse arguments.
+local function parseargs(args)
+ -- Default options.
+ g_opt.comment = "//|"
+ g_opt.endcomment = ""
+ g_opt.cpp = true
+ g_opt.dumpdef = 0
+ g_opt.include = { "" }
+
+ -- Process all option arguments.
+ args.argn = 1
+ repeat
+ local a = args[args.argn]
+ if not a then break end
+ local lopt, opt = match(a, "^%-(%-?)(.+)")
+ if not opt then break end
+ args.argn = args.argn + 1
+ if lopt == "" then
+ -- Loop through short options.
+ for o in gmatch(opt, ".") do parseopt(o, args) end
+ else
+ -- Long option.
+ parseopt(opt, args)
+ end
+ until false
+
+ -- Check for proper number of arguments.
+ local nargs = #args - args.argn + 1
+ if nargs ~= 1 then
+ if nargs == 0 then
+ if g_opt.dumpdef > 0 then return dumpdef(stdout) end
+ end
+ opt_map.help()
+ end
+
+ -- Translate a single input file to a single output file
+ -- TODO: Handle multiple files?
+ translate(args[args.argn], g_opt.outfile)
+end
+
+------------------------------------------------------------------------------
+
+-- Add the directory dynasm.lua resides in to the Lua module search path.
+local arg = arg
+if arg and arg[0] then
+ local prefix = match(arg[0], "^(.*/)")
+ if prefix then package.path = prefix.."?.lua;"..package.path end
+end
+
+-- Start DynASM.
+parseargs{...}
+
+------------------------------------------------------------------------------
+
diff --git a/src/luajit/Makefile b/src/luajit/Makefile
new file mode 100644
index 0000000000..51b60687f2
--- /dev/null
+++ b/src/luajit/Makefile
@@ -0,0 +1,252 @@
+# makefile for building Lua
+# see ../INSTALL for installation instructions
+# see ../Makefile and luaconf.h for further customization
+
+# == CHANGE THE SETTINGS BELOW TO SUIT YOUR ENVIRONMENT =======================
+
+# Your platform. See PLATS for possible values.
+PLAT= none
+
+CC= gcc
+CFLAGS= -O3 -fomit-frame-pointer -Wall $(MYCFLAGS) $(COCOCFLAGS) $(JITCFLAGS)
+AR= ar rcu
+RANLIB= ranlib
+RM= rm -f
+LIBS= -lm $(MYLIBS)
+
+MYCFLAGS=
+MYLDFLAGS=
+MYLIBS=
+
+# ++ Coco =========
+# Default: autodetect gccasm/setjmp/ucontext/fibers context switch method.
+COCOCFLAGS=
+# Force use of setjmp (instead of gccasm).
+#COCOCFLAGS= -DCOCO_USE_SETJMP
+# Force use of ucontext (instead of gccasm or setjmp).
+#COCOCFLAGS= -DCOCO_USE_UCONTEXT
+# Uncomment this if you want to compile LuaJIT without Coco.
+# This effectively disables yielding from JIT compiled functions.
+#COCOCFLAGS= -DCOCO_DISABLE
+# -- Coco =========
+
+# == END OF USER SETTINGS. NO NEED TO CHANGE ANYTHING BELOW THIS LINE =========
+
+PLATS= linux bsd macosx solaris mingw cygwin posix generic linux_rl bsd_rl macosx_rl
+
+# ++ Coco =========
+COCO_O= lcoco.o
+# -- Coco =========
+
+# ++ LuaJIT =========
+DASMDIR= ../dynasm
+DASMFLAGS=
+DASMDISTFLAGS= -LN
+
+# This assumes you already have a copy of (plain) Lua 5.1 installed
+# You can use luajit, too (built with the pre-processed headers from the dist)
+DASM= lua $(DASMDIR)/dynasm.lua
+
+JITCFLAGS= -I$(DASMDIR)
+JIT_O= ljit_core.o ljit_mem.o ljit_dasm.o ljit_backend.o
+JITLIB_O= ljitlib.o
+
+ALL_DH = ljit_x86.h
+# -- LuaJIT =========
+
+LUA_A= liblua.a
+CORE_O= 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 ltm.o \
+ lundump.o lvm.o lzio.o $(COCO_O) $(JIT_O)
+LIB_O= lauxlib.o lbaselib.o ldblib.o liolib.o lmathlib.o loslib.o ltablib.o \
+ lstrlib.o loadlib.o $(JITLIB_O) linit.o
+
+# Standalone has been renamed to avoid conflicts during installation
+LUA_T= luajit
+LUA_O= lua.o
+
+LUAC_T= luac
+LUAC_O= luac.o print.o
+
+ALL_O= $(CORE_O) $(LIB_O) $(LUA_O) $(LUAC_O)
+# Do not build luac by default
+#ALL_T= $(LUA_A) $(LUA_T) $(LUAC_T)
+ALL_T= $(LUA_A) $(LUA_T)
+ALL_A= $(LUA_A)
+
+default: $(PLAT)
+
+all: $(ALL_T)
+
+o: $(ALL_O)
+
+a: $(ALL_A)
+
+$(LUA_A): $(CORE_O) $(LIB_O)
+ $(AR) $@ $?
+ $(RANLIB) $@
+
+$(LUA_T): $(LUA_O) $(LUA_A)
+ $(CC) -o $@ $(MYLDFLAGS) $(LUA_O) $(LUA_A) $(LIBS)
+
+$(LUAC_T): $(LUAC_O) $(LUA_A)
+ $(CC) -o $@ $(MYLDFLAGS) $(LUAC_O) $(LUA_A) $(LIBS)
+
+# ++ LuaJIT =========
+ljit_x86.h: ljit_x86.dasc ljit_x86_inline.dash ljit_x86.dash
+ $(DASM) $(DASMFLAGS) -o $@ ljit_x86.dasc
+
+distclean: clean
+ $(DASM) $(DASMDISTFLAGS) -o ljit_x86.h ljit_x86.dasc
+
+cleaner: clean
+ $(RM) $(ALL_DH)
+# -- LuaJIT =========
+
+clean:
+ $(RM) $(ALL_T) $(ALL_O)
+
+depend:
+ @$(CC) $(CFLAGS) -MM l*.c print.c
+
+echo:
+ @echo "PLAT = $(PLAT)"
+ @echo "CC = $(CC)"
+ @echo "CFLAGS = $(CFLAGS)"
+ @echo "AR = $(AR)"
+ @echo "RANLIB = $(RANLIB)"
+ @echo "RM = $(RM)"
+ @echo "MYCFLAGS = $(MYCFLAGS)"
+ @echo "MYLDFLAGS = $(MYLDFLAGS)"
+ @echo "MYLIBS = $(MYLIBS)"
+
+# convenience targets for popular platforms
+
+none:
+ @echo "Please choose a platform:"
+ @echo " $(PLATS)"
+
+bsd:
+ $(MAKE) all MYCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN" MYLIBS="-Wl,-E"
+
+bsd_rl:
+ $(MAKE) all MYCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN -DLUA_USE_READLINE" MYLIBS="-Wl,-E -lreadline"
+
+generic:
+ $(MAKE) all MYCFLAGS=
+
+linux:
+ $(MAKE) all MYCFLAGS=-DLUA_USE_LINUX MYLIBS="-Wl,-E -ldl"
+
+linux_rl:
+ $(MAKE) all MYCFLAGS="-DLUA_USE_LINUX -DLUA_USE_READLINE" MYLIBS="-Wl,-E -ldl -lreadline -lhistory -lncurses"
+
+# Mac OS X on Intel Macs only!
+macosx:
+ $(MAKE) all MYCFLAGS=-DLUA_USE_LINUX
+# use this on Mac OS X 10.3
+# $(MAKE) all MYCFLAGS=-DLUA_USE_MACOSX
+
+macosx_rl:
+ $(MAKE) all MYCFLAGS="-DLUA_USE_LINUX -DLUA_USE_READLINE" MYLIBS="-lreadline"
+
+mingw:
+ $(MAKE) "LUA_A=lua51.dll" "LUA_T=luajit.exe" \
+ "AR=$(CC) -shared -o" "RANLIB=strip --strip-unneeded" \
+ "MYCFLAGS=-DLUA_BUILD_AS_DLL -maccumulate-outgoing-args" \
+ "MYLIBS=" "MYLDFLAGS=-s" luajit.exe
+
+cygwin:
+ $(MAKE) "CC=gcc -mno-cygwin" mingw
+
+posix:
+ $(MAKE) all MYCFLAGS=-DLUA_USE_POSIX
+
+# Solaris x86 only!
+solaris:
+ $(MAKE) all MYCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN" MYLIBS="-ldl"
+
+# list targets that do not create files (but not all makes understand .PHONY)
+.PHONY: all $(PLATS) default o a clean depend echo none cleaner distclean
+
+# DO NOT DELETE
+
+lapi.o: lapi.c lua.h luaconf.h lapi.h lobject.h llimits.h ldebug.h \
+ lstate.h ltm.h lzio.h lmem.h lcoco.h ldo.h lfunc.h lgc.h lstring.h \
+ ltable.h lundump.h lvm.h
+lauxlib.o: lauxlib.c lua.h luaconf.h lauxlib.h
+lbaselib.o: lbaselib.c lua.h luaconf.h lauxlib.h lualib.h lcoco.h
+lcoco.o: lcoco.c lua.h luaconf.h lobject.h llimits.h lstate.h ltm.h \
+ lzio.h lmem.h lcoco.h ldo.h lvm.h lgc.h
+lcode.o: lcode.c lua.h luaconf.h lcode.h llex.h lobject.h llimits.h \
+ lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h lcoco.h \
+ ldo.h lgc.h ltable.h
+ldblib.o: ldblib.c lua.h luaconf.h lauxlib.h lualib.h
+ldebug.o: ldebug.c lua.h luaconf.h lapi.h lobject.h llimits.h lcode.h \
+ llex.h lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h \
+ lcoco.h ldo.h lfunc.h lstring.h lgc.h ltable.h lvm.h ljit.h
+ldo.o: ldo.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \
+ lzio.h lmem.h lcoco.h ldo.h lfunc.h lgc.h lopcodes.h lparser.h \
+ lstring.h ltable.h lundump.h lvm.h ljit.h
+ldump.o: ldump.c lua.h luaconf.h lobject.h llimits.h lstate.h ltm.h \
+ lzio.h lmem.h lcoco.h lundump.h
+lfunc.o: lfunc.c lua.h luaconf.h lfunc.h lobject.h llimits.h lgc.h lmem.h \
+ lstate.h ltm.h lzio.h lcoco.h ljit.h
+lgc.o: lgc.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \
+ lzio.h lmem.h lcoco.h ldo.h lfunc.h lgc.h lstring.h ltable.h
+linit.o: linit.c lua.h luaconf.h lualib.h lauxlib.h
+liolib.o: liolib.c lua.h luaconf.h lauxlib.h lualib.h
+ljit_backend.o: ljit_backend.c lua.h luaconf.h lobject.h llimits.h \
+ lstate.h ltm.h lzio.h lmem.h lcoco.h ldo.h lfunc.h lgc.h lstring.h \
+ ltable.h lvm.h lopcodes.h ldebug.h ljit.h ljit_hints.h ljit_dasm.h \
+ ../dynasm/dasm_proto.h ljit_x86.h
+ljit_core.o: ljit_core.c lua.h luaconf.h lobject.h llimits.h lstate.h \
+ ltm.h lzio.h lmem.h lcoco.h ldo.h lstring.h lgc.h ltable.h ldebug.h \
+ lopcodes.h ljit.h ljit_hints.h luajit.h
+ljit_dasm.o: ljit_dasm.c lua.h luaconf.h ljit.h lobject.h llimits.h \
+ ljit_dasm.h ../dynasm/dasm_proto.h lmem.h ../dynasm/dasm_x86.h
+ljit_mem.o: ljit_mem.c lua.h luaconf.h lmem.h llimits.h ldo.h lobject.h \
+ lstate.h ltm.h lzio.h lcoco.h ljit.h ljit_dasm.h ../dynasm/dasm_proto.h
+ljitlib.o: ljitlib.c lua.h luaconf.h lauxlib.h luajit.h lualib.h \
+ lobject.h llimits.h lstate.h ltm.h lzio.h lmem.h lcoco.h lstring.h \
+ lgc.h ltable.h lfunc.h lopcodes.h ljit.h ljit_hints.h
+llex.o: llex.c lua.h luaconf.h ldo.h lobject.h llimits.h lstate.h ltm.h \
+ lzio.h lmem.h lcoco.h llex.h lparser.h lstring.h lgc.h ltable.h
+lmathlib.o: lmathlib.c lua.h luaconf.h lauxlib.h lualib.h
+lmem.o: lmem.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \
+ ltm.h lzio.h lmem.h lcoco.h ldo.h
+loadlib.o: loadlib.c lua.h luaconf.h lauxlib.h lualib.h luajit.h
+lobject.o: lobject.c lua.h luaconf.h ldo.h lobject.h llimits.h lstate.h \
+ ltm.h lzio.h lmem.h lcoco.h lstring.h lgc.h lvm.h
+lopcodes.o: lopcodes.c lopcodes.h llimits.h lua.h luaconf.h
+loslib.o: loslib.c lua.h luaconf.h lauxlib.h lualib.h
+lparser.o: lparser.c lua.h luaconf.h lcode.h llex.h lobject.h llimits.h \
+ lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h lcoco.h \
+ ldo.h lfunc.h lstring.h lgc.h ltable.h
+lstate.o: lstate.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \
+ ltm.h lzio.h lmem.h lcoco.h ldo.h lfunc.h lgc.h llex.h lstring.h \
+ ltable.h ljit.h
+lstring.o: lstring.c lua.h luaconf.h lmem.h llimits.h lobject.h lstate.h \
+ ltm.h lzio.h lcoco.h lstring.h lgc.h
+lstrlib.o: lstrlib.c lua.h luaconf.h lauxlib.h lualib.h
+ltable.o: ltable.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \
+ ltm.h lzio.h lmem.h lcoco.h ldo.h lgc.h ltable.h
+ltablib.o: ltablib.c lua.h luaconf.h lauxlib.h lualib.h
+ltm.o: ltm.c lua.h luaconf.h lobject.h llimits.h lstate.h ltm.h lzio.h \
+ lmem.h lcoco.h lstring.h lgc.h ltable.h
+lua.o: lua.c lua.h luaconf.h lauxlib.h lualib.h luajit.h
+luac.o: luac.c lua.h luaconf.h lauxlib.h ldo.h lobject.h llimits.h \
+ lstate.h ltm.h lzio.h lmem.h lcoco.h lfunc.h lopcodes.h lstring.h lgc.h \
+ lundump.h
+lundump.o: lundump.c lua.h luaconf.h ldebug.h lstate.h lobject.h \
+ llimits.h ltm.h lzio.h lmem.h lcoco.h ldo.h lfunc.h lstring.h lgc.h \
+ lundump.h
+lvm.o: lvm.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \
+ lzio.h lmem.h lcoco.h ldo.h lfunc.h lgc.h lopcodes.h lstring.h ltable.h \
+ lvm.h
+lzio.o: lzio.c lua.h luaconf.h llimits.h lmem.h lstate.h lobject.h ltm.h \
+ lzio.h lcoco.h
+print.o: print.c ldebug.h lstate.h lua.h luaconf.h lobject.h llimits.h \
+ ltm.h lzio.h lmem.h lcoco.h lopcodes.h lundump.h
+
+# (end of Makefile)
diff --git a/src/luajit/lapi.c b/src/luajit/lapi.c
new file mode 100644
index 0000000000..e8347a28c4
--- /dev/null
+++ b/src/luajit/lapi.c
@@ -0,0 +1,1082 @@
+/*
+** $Id: lapi.c,v 2.55.1.5 2008/07/04 18:41:18 roberto Exp $
+** Lua API
+** See Copyright Notice in lua.h
+*/
+
+
+#include <assert.h>
+#include <math.h>
+#include <stdarg.h>
+#include <string.h>
+
+#define lapi_c
+#define LUA_CORE
+
+#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_RELEASE " " LUA_COPYRIGHT " $\n"
+ "$Authors: " LUA_AUTHORS " $\n"
+ "$URL: www.lua.org $\n";
+
+
+
+#define api_checknelems(L, n) api_check(L, (n) <= (L->top - L->base))
+
+#define api_checkvalidindex(L, i) api_check(L, (i) != luaO_nilobject)
+
+#define api_incr_top(L) {api_check(L, L->top < L->ci->top); L->top++;}
+
+
+
+static TValue *index2adr (lua_State *L, int idx) {
+ if (idx > 0) {
+ TValue *o = L->base + (idx - 1);
+ api_check(L, idx <= L->ci->top - L->base);
+ if (o >= L->top) return cast(TValue *, luaO_nilobject);
+ else return o;
+ }
+ else 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_ENVIRONINDEX: {
+ Closure *func = curr_func(L);
+ sethvalue(L, &L->env, func->c.env);
+ return &L->env;
+ }
+ case LUA_GLOBALSINDEX: return gt(L);
+ default: {
+ Closure *func = curr_func(L);
+ idx = LUA_GLOBALSINDEX - idx;
+ return (idx <= func->c.nupvalues)
+ ? &func->c.upvalue[idx-1]
+ : cast(TValue *, luaO_nilobject);
+ }
+ }
+}
+
+
+static Table *getcurrenv (lua_State *L) {
+ if (L->ci == L->base_ci) /* no enclosing function? */
+ return hvalue(gt(L)); /* use global table as environment */
+ else {
+ Closure *func = curr_func(L);
+ return func->c.env;
+ }
+}
+
+
+void luaA_pushobject (lua_State *L, const TValue *o) {
+ setobj2s(L, L->top, o);
+ api_incr_top(L);
+}
+
+
+LUA_API int lua_checkstack (lua_State *L, int size) {
+ int res = 1;
+ lua_lock(L);
+ if (size > LUAI_MAXCSTACK || (L->top - L->base + size) > LUAI_MAXCSTACK)
+ res = 0; /* stack overflow */
+ else if (size > 0) {
+ luaD_checkstack(L, size);
+ if (L->ci->top < L->top + size)
+ L->ci->top = L->top + size;
+ }
+ lua_unlock(L);
+ return res;
+}
+
+
+LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) {
+ StkId f, t;
+ if (from == to) return;
+ lua_lock(to);
+ api_checknelems(from, n);
+ api_check(from, G(from) == G(to));
+ api_check(from, to->ci->top - to->top >= n);
+ f = from->top;
+ t = to->top = to->top + n;
+ while (--n >= 0) setobj2s(to, --t, --f);
+ from->top = f;
+ 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, L->top, L1);
+ api_incr_top(L);
+ lua_unlock(L);
+ luai_userstatethread(L, L1);
+ return L1;
+}
+
+
+
+/*
+** basic stack manipulation
+*/
+
+
+LUA_API int lua_gettop (lua_State *L) {
+ return cast_int(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 = index2adr(L, idx);
+ api_checkvalidindex(L, p);
+ while (++p < L->top) setobjs2s(L, 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 = index2adr(L, idx);
+ api_checkvalidindex(L, p);
+ for (q = L->top; q>p; q--) setobjs2s(L, q, q-1);
+ setobjs2s(L, p, L->top);
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_replace (lua_State *L, int idx) {
+ StkId o;
+ lua_lock(L);
+ /* explicit test for incompatible code */
+ if (idx == LUA_ENVIRONINDEX && L->ci == L->base_ci)
+ luaG_runerror(L, "no calling environment");
+ api_checknelems(L, 1);
+ o = index2adr(L, idx);
+ api_checkvalidindex(L, o);
+ if (idx == LUA_ENVIRONINDEX) {
+ Closure *func = curr_func(L);
+ api_check(L, ttistable(L->top - 1));
+ func->c.env = hvalue(L->top - 1);
+ luaC_barrier(L, func, L->top - 1);
+ }
+ else {
+ setobj(L, o, L->top - 1);
+ if (idx < LUA_GLOBALSINDEX) /* function upvalue? */
+ luaC_barrier(L, curr_func(L), L->top - 1);
+ }
+ L->top--;
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_pushvalue (lua_State *L, int idx) {
+ lua_lock(L);
+ setobj2s(L, L->top, index2adr(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 = index2adr(L, idx);
+ return (o == luaO_nilobject) ? 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 = index2adr(L, idx);
+ return iscfunction(o);
+}
+
+
+LUA_API int lua_isnumber (lua_State *L, int idx) {
+ TValue n;
+ const TValue *o = index2adr(L, idx);
+ return 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 TValue *o = index2adr(L, idx);
+ return (ttisuserdata(o) || ttislightuserdata(o));
+}
+
+
+LUA_API int lua_rawequal (lua_State *L, int index1, int index2) {
+ StkId o1 = index2adr(L, index1);
+ StkId o2 = index2adr(L, index2);
+ return (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0
+ : 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 = index2adr(L, index1);
+ o2 = index2adr(L, index2);
+ i = (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0 : 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 = index2adr(L, index1);
+ o2 = index2adr(L, index2);
+ i = (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0
+ : luaV_lessthan(L, o1, o2);
+ lua_unlock(L);
+ return i;
+}
+
+
+
+LUA_API lua_Number lua_tonumber (lua_State *L, int idx) {
+ TValue n;
+ const TValue *o = index2adr(L, idx);
+ if (tonumber(o, &n))
+ return nvalue(o);
+ else
+ return 0;
+}
+
+
+LUA_API lua_Integer lua_tointeger (lua_State *L, int idx) {
+ TValue n;
+ const TValue *o = index2adr(L, idx);
+ if (tonumber(o, &n)) {
+ lua_Integer res;
+ lua_Number num = nvalue(o);
+ lua_number2integer(res, num);
+ return res;
+ }
+ else
+ return 0;
+}
+
+
+LUA_API int lua_toboolean (lua_State *L, int idx) {
+ const TValue *o = index2adr(L, idx);
+ return !l_isfalse(o);
+}
+
+
+LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) {
+ StkId o = index2adr(L, idx);
+ if (!ttisstring(o)) {
+ lua_lock(L); /* `luaV_tostring' may create a new string */
+ if (!luaV_tostring(L, o)) { /* conversion failed? */
+ if (len != NULL) *len = 0;
+ lua_unlock(L);
+ return NULL;
+ }
+ luaC_checkGC(L);
+ o = index2adr(L, idx); /* previous call may reallocate the stack */
+ lua_unlock(L);
+ }
+ if (len != NULL) *len = tsvalue(o)->len;
+ return svalue(o);
+}
+
+
+LUA_API size_t lua_objlen (lua_State *L, int idx) {
+ StkId o = index2adr(L, idx);
+ switch (ttype(o)) {
+ case LUA_TSTRING: return tsvalue(o)->len;
+ case LUA_TUSERDATA: return uvalue(o)->len;
+ case LUA_TTABLE: return luaH_getn(hvalue(o));
+ case LUA_TNUMBER: {
+ size_t l;
+ lua_lock(L); /* `luaV_tostring' may create a new string */
+ l = (luaV_tostring(L, o) ? tsvalue(o)->len : 0);
+ lua_unlock(L);
+ return l;
+ }
+ default: return 0;
+ }
+}
+
+
+LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) {
+ StkId o = index2adr(L, idx);
+ return (!iscfunction(o)) ? NULL : clvalue(o)->c.f;
+}
+
+
+LUA_API void *lua_touserdata (lua_State *L, int idx) {
+ StkId o = index2adr(L, idx);
+ switch (ttype(o)) {
+ case LUA_TUSERDATA: return (rawuvalue(o) + 1);
+ case LUA_TLIGHTUSERDATA: return pvalue(o);
+ default: return NULL;
+ }
+}
+
+
+LUA_API lua_State *lua_tothread (lua_State *L, int idx) {
+ StkId o = index2adr(L, idx);
+ return (!ttisthread(o)) ? NULL : thvalue(o);
+}
+
+
+LUA_API const void *lua_topointer (lua_State *L, int idx) {
+ StkId o = index2adr(L, idx);
+ 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_pushinteger (lua_State *L, lua_Integer n) {
+ lua_lock(L);
+ setnvalue(L->top, cast_num(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, 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, getcurrenv(L));
+ cl->c.f = fn;
+ L->top -= n;
+ while (n--)
+ setobj2n(L, &cl->c.upvalue[n], L->top+n);
+ setclvalue(L, L->top, cl);
+ lua_assert(iswhite(obj2gco(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);
+}
+
+
+LUA_API int lua_pushthread (lua_State *L) {
+ lua_lock(L);
+ setthvalue(L, L->top, L);
+ api_incr_top(L);
+ lua_unlock(L);
+ return (G(L)->mainthread == L);
+}
+
+
+
+/*
+** get functions (Lua -> stack)
+*/
+
+
+LUA_API void lua_gettable (lua_State *L, int idx) {
+ StkId t;
+ lua_lock(L);
+ t = index2adr(L, idx);
+ api_checkvalidindex(L, t);
+ luaV_gettable(L, t, L->top - 1, L->top - 1);
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_getfield (lua_State *L, int idx, const char *k) {
+ StkId t;
+ TValue key;
+ lua_lock(L);
+ t = index2adr(L, idx);
+ api_checkvalidindex(L, t);
+ setsvalue(L, &key, luaS_new(L, k));
+ luaV_gettable(L, t, &key, L->top);
+ api_incr_top(L);
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_rawget (lua_State *L, int idx) {
+ StkId t;
+ lua_lock(L);
+ t = index2adr(L, idx);
+ api_check(L, ttistable(t));
+ setobj2s(L, 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 = index2adr(L, idx);
+ api_check(L, ttistable(o));
+ setobj2s(L, L->top, luaH_getnum(hvalue(o), n));
+ api_incr_top(L);
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_createtable (lua_State *L, int narray, int nrec) {
+ lua_lock(L);
+ luaC_checkGC(L);
+ sethvalue(L, L->top, luaH_new(L, narray, nrec));
+ api_incr_top(L);
+ lua_unlock(L);
+}
+
+
+LUA_API int lua_getmetatable (lua_State *L, int objindex) {
+ const TValue *obj;
+ Table *mt = NULL;
+ int res;
+ lua_lock(L);
+ obj = index2adr(L, objindex);
+ switch (ttype(obj)) {
+ case LUA_TTABLE:
+ mt = hvalue(obj)->metatable;
+ break;
+ case LUA_TUSERDATA:
+ mt = uvalue(obj)->metatable;
+ break;
+ default:
+ mt = G(L)->mt[ttype(obj)];
+ break;
+ }
+ if (mt == NULL)
+ res = 0;
+ else {
+ sethvalue(L, 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 = index2adr(L, idx);
+ api_checkvalidindex(L, o);
+ switch (ttype(o)) {
+ case LUA_TFUNCTION:
+ sethvalue(L, L->top, clvalue(o)->c.env);
+ break;
+ case LUA_TUSERDATA:
+ sethvalue(L, L->top, uvalue(o)->env);
+ break;
+ case LUA_TTHREAD:
+ setobj2s(L, L->top, gt(thvalue(o)));
+ break;
+ default:
+ setnilvalue(L->top);
+ break;
+ }
+ 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 = index2adr(L, idx);
+ api_checkvalidindex(L, t);
+ luaV_settable(L, t, L->top - 2, L->top - 1);
+ L->top -= 2; /* pop index and value */
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_setfield (lua_State *L, int idx, const char *k) {
+ StkId t;
+ TValue key;
+ lua_lock(L);
+ api_checknelems(L, 1);
+ t = index2adr(L, idx);
+ api_checkvalidindex(L, t);
+ setsvalue(L, &key, luaS_new(L, k));
+ luaV_settable(L, t, &key, L->top - 1);
+ L->top--; /* pop value */
+ lua_unlock(L);
+}
+
+
+LUA_API void lua_rawset (lua_State *L, int idx) {
+ StkId t;
+ lua_lock(L);
+ api_checknelems(L, 2);
+ t = index2adr(L, idx);
+ api_check(L, ttistable(t));
+ setobj2t(L, luaH_set(L, hvalue(t), L->top-2), L->top-1);
+ luaC_barriert(L, hvalue(t), L->top-1);
+ 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 = index2adr(L, idx);
+ api_check(L, ttistable(o));
+ setobj2t(L, luaH_setnum(L, hvalue(o), n), L->top-1);
+ luaC_barriert(L, hvalue(o), L->top-1);
+ L->top--;
+ lua_unlock(L);
+}
+
+
+LUA_API int lua_setmetatable (lua_State *L, int objindex) {
+ TValue *obj;
+ Table *mt;
+ lua_lock(L);
+ api_checknelems(L, 1);
+ obj = index2adr(L, objindex);
+ api_checkvalidindex(L, obj);
+ if (ttisnil(L->top - 1))
+ mt = NULL;
+ else {
+ api_check(L, ttistable(L->top - 1));
+ mt = hvalue(L->top - 1);
+ }
+ switch (ttype(obj)) {
+ case LUA_TTABLE: {
+ hvalue(obj)->metatable = mt;
+ if (mt)
+ luaC_objbarriert(L, hvalue(obj), mt);
+ break;
+ }
+ case LUA_TUSERDATA: {
+ uvalue(obj)->metatable = mt;
+ if (mt)
+ luaC_objbarrier(L, rawuvalue(obj), mt);
+ break;
+ }
+ default: {
+ G(L)->mt[ttype(obj)] = mt;
+ break;
+ }
+ }
+ L->top--;
+ lua_unlock(L);
+ return 1;
+}
+
+
+LUA_API int lua_setfenv (lua_State *L, int idx) {
+ StkId o;
+ int res = 1;
+ lua_lock(L);
+ api_checknelems(L, 1);
+ o = index2adr(L, idx);
+ api_checkvalidindex(L, o);
+ api_check(L, ttistable(L->top - 1));
+ switch (ttype(o)) {
+ case LUA_TFUNCTION:
+ clvalue(o)->c.env = hvalue(L->top - 1);
+ break;
+ case LUA_TUSERDATA:
+ uvalue(o)->env = hvalue(L->top - 1);
+ break;
+ case LUA_TTHREAD:
+ sethvalue(L, gt(thvalue(o)), hvalue(L->top - 1));
+ break;
+ default:
+ res = 0;
+ break;
+ }
+ if (res) luaC_objbarrier(L, gcvalue(o), hvalue(L->top - 1));
+ L->top--;
+ lua_unlock(L);
+ return res;
+}
+
+
+/*
+** `load' and `call' functions (run Lua code)
+*/
+
+
+#define adjustresults(L,nres) \
+ { if (nres == LUA_MULTRET && L->top >= L->ci->top) L->ci->top = L->top; }
+
+
+#define checkresults(L,na,nr) \
+ api_check(L, (nr) == LUA_MULTRET || (L->ci->top - L->top >= (nr) - (na)))
+
+
+LUA_API void lua_call (lua_State *L, int nargs, int nresults) {
+ StkId func;
+ lua_lock(L);
+ api_checknelems(L, nargs+1);
+ checkresults(L, nargs, nresults);
+ func = L->top - (nargs+1);
+ luaD_call(L, func, nresults);
+ adjustresults(L, nresults);
+ lua_unlock(L);
+}
+
+
+
+/*
+** Execute a protected call.
+*/
+struct CallS { /* data to `f_call' */
+ StkId func;
+ int nresults;
+};
+
+
+static void f_call (lua_State *L, void *ud) {
+ struct CallS *c = cast(struct CallS *, ud);
+ luaD_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);
+ api_checknelems(L, nargs+1);
+ checkresults(L, nargs, nresults);
+ if (errfunc == 0)
+ func = 0;
+ else {
+ StkId o = index2adr(L, errfunc);
+ api_checkvalidindex(L, o);
+ func = savestack(L, o);
+ }
+ 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);
+ adjustresults(L, nresults);
+ 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, getcurrenv(L));
+ cl->c.f = c->func;
+ setclvalue(L, L->top, cl); /* push function */
+ api_incr_top(L);
+ setpvalue(L->top, c->ud); /* push only argument */
+ api_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_Reader reader, void *data,
+ const char *chunkname) {
+ ZIO z;
+ int status;
+ lua_lock(L);
+ if (!chunkname) chunkname = "?";
+ luaZ_init(L, &z, reader, data);
+ status = luaD_protectedparser(L, &z, chunkname);
+ lua_unlock(L);
+ return status;
+}
+
+
+LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data) {
+ int status;
+ TValue *o;
+ lua_lock(L);
+ api_checknelems(L, 1);
+ o = L->top - 1;
+ if (isLfunction(o))
+ status = luaU_dump(L, clvalue(o)->l.p, writer, data, 0);
+ else
+ status = 1;
+ lua_unlock(L);
+ return status;
+}
+
+
+LUA_API int lua_status (lua_State *L) {
+ return L->status;
+}
+
+
+/*
+** Garbage-collection function
+*/
+
+LUA_API int lua_gc (lua_State *L, int what, int data) {
+ int res = 0;
+ global_State *g;
+ lua_lock(L);
+ g = G(L);
+ switch (what) {
+ case LUA_GCSTOP: {
+ g->GCthreshold = MAX_LUMEM;
+ break;
+ }
+ case LUA_GCRESTART: {
+ g->GCthreshold = g->totalbytes;
+ break;
+ }
+ case LUA_GCCOLLECT: {
+ luaC_fullgc(L);
+ break;
+ }
+ case LUA_GCCOUNT: {
+ /* GC values are expressed in Kbytes: #bytes/2^10 */
+ res = cast_int(g->totalbytes >> 10);
+ break;
+ }
+ case LUA_GCCOUNTB: {
+ res = cast_int(g->totalbytes & 0x3ff);
+ break;
+ }
+ case LUA_GCSTEP: {
+ lu_mem a = (cast(lu_mem, data) << 10);
+ if (a <= g->totalbytes)
+ g->GCthreshold = g->totalbytes - a;
+ else
+ g->GCthreshold = 0;
+ while (g->GCthreshold <= g->totalbytes) {
+ luaC_step(L);
+ if (g->gcstate == GCSpause) { /* end of cycle? */
+ res = 1; /* signal it */
+ break;
+ }
+ }
+ break;
+ }
+ case LUA_GCSETPAUSE: {
+ res = g->gcpause;
+ g->gcpause = data;
+ break;
+ }
+ case LUA_GCSETSTEPMUL: {
+ res = g->gcstepmul;
+ g->gcstepmul = data;
+ break;
+ }
+ default: res = -1; /* invalid option */
+ }
+ lua_unlock(L);
+ return res;
+}
+
+
+
+/*
+** miscellaneous functions
+*/
+
+
+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 = index2adr(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);
+ api_checknelems(L, n);
+ if (n >= 2) {
+ luaC_checkGC(L);
+ luaV_concat(L, n, cast_int(L->top - L->base) - 1);
+ L->top -= (n-1);
+ }
+ else if (n == 0) { /* push empty string */
+ setsvalue2s(L, L->top, luaS_newlstr(L, "", 0));
+ api_incr_top(L);
+ }
+ /* else n == 1; nothing to do */
+ lua_unlock(L);
+}
+
+
+LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) {
+ lua_Alloc f;
+ lua_lock(L);
+ if (ud) *ud = G(L)->ud;
+ f = G(L)->frealloc;
+ lua_unlock(L);
+ return f;
+}
+
+
+LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) {
+ lua_lock(L);
+ G(L)->ud = ud;
+ G(L)->frealloc = f;
+ lua_unlock(L);
+}
+
+
+LUA_API void *lua_newuserdata (lua_State *L, size_t size) {
+ Udata *u;
+ lua_lock(L);
+ luaC_checkGC(L);
+ u = luaS_newudata(L, size, getcurrenv(L));
+ setuvalue(L, L->top, u);
+ api_incr_top(L);
+ lua_unlock(L);
+ return u + 1;
+}
+
+
+
+
+static const char *aux_upvalue (StkId fi, int n, TValue **val) {
+ Closure *f;
+ if (!ttisfunction(fi)) return NULL;
+ f = clvalue(fi);
+ if (f->c.isC) {
+ if (!(1 <= n && n <= f->c.nupvalues)) return NULL;
+ *val = &f->c.upvalue[n-1];
+ return "";
+ }
+ else {
+ Proto *p = f->l.p;
+ if (!(1 <= n && 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;
+ TValue *val;
+ lua_lock(L);
+ name = aux_upvalue(index2adr(L, funcindex), n, &val);
+ if (name) {
+ setobj2s(L, 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;
+ TValue *val;
+ StkId fi;
+ lua_lock(L);
+ fi = index2adr(L, funcindex);
+ api_checknelems(L, 1);
+ name = aux_upvalue(fi, n, &val);
+ if (name) {
+ L->top--;
+ setobj(L, val, L->top);
+ luaC_barrier(L, clvalue(fi), L->top);
+ }
+ lua_unlock(L);
+ return name;
+}
+
diff --git a/src/luajit/lapi.h b/src/luajit/lapi.h
new file mode 100644
index 0000000000..2c3fab244e
--- /dev/null
+++ b/src/luajit/lapi.h
@@ -0,0 +1,16 @@
+/*
+** $Id: lapi.h,v 2.2.1.1 2007/12/27 13:02:25 roberto Exp $
+** Auxiliary functions from Lua API
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lapi_h
+#define lapi_h
+
+
+#include "lobject.h"
+
+
+LUAI_FUNC void luaA_pushobject (lua_State *L, const TValue *o);
+
+#endif
diff --git a/src/luajit/lauxlib.c b/src/luajit/lauxlib.c
new file mode 100644
index 0000000000..1787092a9c
--- /dev/null
+++ b/src/luajit/lauxlib.c
@@ -0,0 +1,633 @@
+/*
+** $Id: lauxlib.c,v 1.159.1.3 2008/01/21 13:20:51 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 <stdlib.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
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+
+#include "physfs.h"
+
+
+#define FREELIST_REF 0 /* free list of references */
+
+
+/* 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;
+ if (!lua_getstack(L, 0, &ar)) /* no stack frame? */
+ return luaL_error(L, "bad argument #%d (%s)", narg, extramsg);
+ 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 " LUA_QS " on bad self (%s)",
+ ar.name, extramsg);
+ }
+ if (ar.name == NULL)
+ ar.name = "?";
+ return luaL_error(L, "bad argument #%d to " LUA_QS " (%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, luaL_typename(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, "Sl", &ar); /* get info about it */
+ if (ar.currentline > 0) { /* is there info? */
+ lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline);
+ return;
+ }
+ }
+ lua_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_checkoption (lua_State *L, int narg, const char *def,
+ const char *const lst[]) {
+ const char *name = (def) ? luaL_optstring(L, narg, def) :
+ luaL_checkstring(L, narg);
+ int i;
+ for (i=0; lst[i]; i++)
+ if (strcmp(lst[i], name) == 0)
+ return i;
+ return luaL_argerror(L, narg,
+ lua_pushfstring(L, "invalid option " LUA_QS, name));
+}
+
+
+LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) {
+ lua_getfield(L, LUA_REGISTRYINDEX, tname); /* 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_pushvalue(L, -1);
+ lua_setfield(L, LUA_REGISTRYINDEX, tname); /* registry.name = metatable */
+ return 1;
+}
+
+
+LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) {
+ void *p = lua_touserdata(L, ud);
+ if (p != NULL) { /* value is a userdata? */
+ if (lua_getmetatable(L, ud)) { /* does it have a metatable? */
+ lua_getfield(L, LUA_REGISTRYINDEX, tname); /* get correct metatable */
+ if (lua_rawequal(L, -1, -2)) { /* does it have the correct mt? */
+ lua_pop(L, 2); /* remove both metatables */
+ return p;
+ }
+ }
+ }
+ luaL_typerror(L, ud, tname); /* else error */
+ return NULL; /* to avoid warnings */
+}
+
+
+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_tolstring(L, narg, len);
+ if (!s) tag_error(L, narg, LUA_TSTRING);
+ 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) {
+ return luaL_opt(L, luaL_checknumber, narg, def);
+}
+
+
+LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int narg) {
+ lua_Integer d = lua_tointeger(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_Integer luaL_optinteger (lua_State *L, int narg,
+ lua_Integer def) {
+ return luaL_opt(L, luaL_checkinteger, narg, def);
+}
+
+
+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_register) (lua_State *L, const char *libname,
+ const luaL_Reg *l) {
+ luaI_openlib(L, libname, l, 0);
+}
+
+
+static int libsize (const luaL_Reg *l) {
+ int size = 0;
+ for (; l->name; l++) size++;
+ return size;
+}
+
+
+LUALIB_API void luaI_openlib (lua_State *L, const char *libname,
+ const luaL_Reg *l, int nup) {
+ if (libname) {
+ int size = libsize(l);
+ /* check whether lib already exists */
+ luaL_findtable(L, LUA_REGISTRYINDEX, "_LOADED", 1);
+ lua_getfield(L, -1, libname); /* get _LOADED[libname] */
+ if (!lua_istable(L, -1)) { /* not found? */
+ lua_pop(L, 1); /* remove previous result */
+ /* try global variable (and create one if it does not exist) */
+ if (luaL_findtable(L, LUA_GLOBALSINDEX, libname, size) != NULL)
+ luaL_error(L, "name conflict for module " LUA_QS, libname);
+ lua_pushvalue(L, -1);
+ lua_setfield(L, -3, libname); /* _LOADED[libname] = new table */
+ }
+ lua_remove(L, -2); /* remove _LOADED table */
+ lua_insert(L, -(nup+1)); /* move library table to below upvalues */
+ }
+ for (; l->name; l++) {
+ int i;
+ for (i=0; i<nup; i++) /* copy upvalues to the top */
+ lua_pushvalue(L, -nup);
+ lua_pushcclosure(L, l->func, nup);
+ lua_setfield(L, -(nup+2), l->name);
+ }
+ lua_pop(L, nup); /* remove upvalues */
+}
+
+
+
+/*
+** {======================================================
+** getn-setn: size for arrays
+** =======================================================
+*/
+
+#if defined(LUA_COMPAT_GETN)
+
+static int checkint (lua_State *L, int topop) {
+ int n = (lua_type(L, -1) == LUA_TNUMBER) ? lua_tointeger(L, -1) : -1;
+ lua_pop(L, topop);
+ return n;
+}
+
+
+static void getsizes (lua_State *L) {
+ lua_getfield(L, LUA_REGISTRYINDEX, "LUA_SIZES");
+ 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, "kv");
+ lua_setfield(L, -2, "__mode"); /* metatable(N).__mode = "kv" */
+ lua_pushvalue(L, -1);
+ lua_setfield(L, LUA_REGISTRYINDEX, "LUA_SIZES"); /* store in register */
+ }
+}
+
+
+LUALIB_API 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_pushinteger(L, n);
+ lua_rawset(L, t);
+ }
+ else { /* use `sizes' */
+ getsizes(L);
+ lua_pushvalue(L, t);
+ lua_pushinteger(L, n);
+ lua_rawset(L, -3); /* sizes[t] = n */
+ lua_pop(L, 1); /* remove `sizes' */
+ }
+}
+
+
+LUALIB_API 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;
+ return (int)lua_objlen(L, t);
+}
+
+#endif
+
+/* }====================================================== */
+
+
+
+LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, const char *p,
+ const char *r) {
+ const char *wild;
+ size_t l = strlen(p);
+ luaL_Buffer b;
+ luaL_buffinit(L, &b);
+ while ((wild = strstr(s, p)) != NULL) {
+ luaL_addlstring(&b, s, wild - s); /* push prefix */
+ luaL_addstring(&b, r); /* push replacement in place of pattern */
+ s = wild + l; /* continue after `p' */
+ }
+ luaL_addstring(&b, s); /* push last suffix */
+ luaL_pushresult(&b);
+ return lua_tostring(L, -1);
+}
+
+
+LUALIB_API const char *luaL_findtable (lua_State *L, int idx,
+ const char *fname, int szhint) {
+ const char *e;
+ lua_pushvalue(L, idx);
+ do {
+ e = strchr(fname, '.');
+ if (e == NULL) e = fname + strlen(fname);
+ lua_pushlstring(L, fname, e - fname);
+ lua_rawget(L, -2);
+ if (lua_isnil(L, -1)) { /* no such field? */
+ lua_pop(L, 1); /* remove this nil */
+ lua_createtable(L, 0, (*e == '.' ? 1 : szhint)); /* new table for field */
+ lua_pushlstring(L, fname, e - fname);
+ lua_pushvalue(L, -2);
+ lua_settable(L, -4); /* set new table into field */
+ }
+ else if (!lua_istable(L, -1)) { /* field has a non-table value? */
+ lua_pop(L, 2); /* remove table and value */
+ return fname; /* return problematic part of the name */
+ }
+ lua_remove(L, -2); /* remove previous table */
+ fname = e + 1;
+ } while (*e == '.');
+ return NULL;
+}
+
+
+
+/*
+** {======================================================
+** 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_addchar(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;
+ const char *s = lua_tolstring(L, -1, &vl);
+ if (vl <= bufffree(B)) { /* fit into buffer? */
+ memcpy(B->p, s, 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_tointeger(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 = (int)lua_objlen(L, t);
+ ref++; /* create new reference */
+ }
+ lua_rawseti(L, t, ref);
+ return ref;
+}
+
+
+LUALIB_API void luaL_unref (lua_State *L, int t, int ref) {
+ if (ref >= 0) {
+ t = abs_index(L, t);
+ lua_rawgeti(L, t, FREELIST_REF);
+ lua_rawseti(L, t, ref); /* t[ref] = t[FREELIST_REF] */
+ lua_pushinteger(L, ref);
+ lua_rawseti(L, t, FREELIST_REF); /* t[FREELIST_REF] = ref */
+ }
+}
+
+
+
+/*
+** {======================================================
+** Load functions
+** =======================================================
+*/
+
+typedef struct LoadF {
+ int extraline;
+ PHYSFS_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 (lf->extraline) {
+ lf->extraline = 0;
+ *size = 1;
+ return "\n";
+ }
+ if (PHYSFS_eof(lf->f)) return NULL;
+ *size = (size_t)PHYSFS_read(lf->f, lf->buff, 1, 1);
+ return (*size > 0) ? lf->buff : NULL;
+}
+
+
+static int errfile (lua_State *L, const char *what, int fnameindex) {
+ const char *serr = strerror(errno);
+ const char *filename = lua_tostring(L, fnameindex) + 1;
+ lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr);
+ lua_remove(L, fnameindex);
+ return LUA_ERRFILE;
+}
+
+
+LUALIB_API int luaL_loadfile (lua_State *L, const char *filename) {
+ LoadF lf;
+ int status, readstatus = 0;
+ int c;
+ int fnameindex = lua_gettop(L) + 1; /* index of filename on the stack */
+ lf.extraline = 0;
+ lua_pushfstring(L, "@%s", filename);
+ lf.f = PHYSFS_openRead(filename);
+ if (lf.f == NULL) return errfile(L, "open", fnameindex);
+ status = lua_load(L, getF, &lf, lua_tostring(L, -1));
+ if (filename) PHYSFS_close(lf.f); /* close file (even in case of errors) */
+ if (readstatus) {
+ lua_settop(L, fnameindex); /* ignore results from `lua_load' */
+ return errfile(L, "read", fnameindex);
+ }
+ lua_remove(L, fnameindex);
+ return status;
+}
+
+
+typedef struct LoadS {
+ const char *s;
+ size_t size;
+} LoadS;
+
+
+static const char *getS (lua_State *L, void *ud, size_t *size) {
+ LoadS *ls = (LoadS *)ud;
+ (void)L;
+ 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);
+}
+
+
+LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s) {
+ return luaL_loadbuffer(L, s, strlen(s), s);
+}
+
+
+
+/* }====================================================== */
+
+
+static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) {
+ (void)ud;
+ (void)osize;
+ if (nsize == 0) {
+ free(ptr);
+ return NULL;
+ }
+ else
+ return realloc(ptr, nsize);
+}
+
+
+static int panic (lua_State *L) {
+ (void)L; /* to avoid warnings */
+ fprintf(stderr, "PANIC: unprotected error in call to Lua API (%s)\n",
+ lua_tostring(L, -1));
+ return 0;
+}
+
+
+LUALIB_API lua_State *luaL_newstate (void) {
+ lua_State *L = lua_newstate(l_alloc, NULL);
+ if (L) lua_atpanic(L, &panic);
+ return L;
+}
+
diff --git a/src/luajit/lauxlib.h b/src/luajit/lauxlib.h
new file mode 100644
index 0000000000..34258235db
--- /dev/null
+++ b/src/luajit/lauxlib.h
@@ -0,0 +1,174 @@
+/*
+** $Id: lauxlib.h,v 1.88.1.1 2007/12/27 13:02:25 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"
+
+
+#if defined(LUA_COMPAT_GETN)
+LUALIB_API int (luaL_getn) (lua_State *L, int t);
+LUALIB_API void (luaL_setn) (lua_State *L, int t, int n);
+#else
+#define luaL_getn(L,i) ((int)lua_objlen(L, i))
+#define luaL_setn(L,i,j) ((void)0) /* no op! */
+#endif
+
+#if defined(LUA_COMPAT_OPENLIB)
+#define luaI_openlib luaL_openlib
+#endif
+
+
+/* extra error code for `luaL_load' */
+#define LUA_ERRFILE (LUA_ERRERR+1)
+
+
+typedef struct luaL_Reg {
+ const char *name;
+ lua_CFunction func;
+} luaL_Reg;
+
+
+
+LUALIB_API void (luaI_openlib) (lua_State *L, const char *libname,
+ const luaL_Reg *l, int nup);
+LUALIB_API void (luaL_register) (lua_State *L, const char *libname,
+ const luaL_Reg *l);
+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 lua_Integer (luaL_checkinteger) (lua_State *L, int numArg);
+LUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int nArg,
+ lua_Integer def);
+
+LUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg);
+LUALIB_API void (luaL_checktype) (lua_State *L, int 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_checkudata) (lua_State *L, int ud, const char *tname);
+
+LUALIB_API void (luaL_where) (lua_State *L, int lvl);
+LUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...);
+
+LUALIB_API int (luaL_checkoption) (lua_State *L, int narg, const char *def,
+ 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_loadfile) (lua_State *L, const char *filename);
+LUALIB_API int (luaL_loadbuffer) (lua_State *L, const char *buff, size_t sz,
+ const char *name);
+LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s);
+
+LUALIB_API lua_State *(luaL_newstate) (void);
+
+
+LUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, const char *p,
+ const char *r);
+
+LUALIB_API const char *(luaL_findtable) (lua_State *L, int idx,
+ const char *fname, int szhint);
+
+
+
+
+/*
+** ===============================================================
+** some useful macros
+** ===============================================================
+*/
+
+#define luaL_argcheck(L, cond,numarg,extramsg) \
+ ((void)((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_checkinteger(L, (n)))
+#define luaL_optint(L,n,d) ((int)luaL_optinteger(L, (n), (d)))
+#define luaL_checklong(L,n) ((long)luaL_checkinteger(L, (n)))
+#define luaL_optlong(L,n,d) ((long)luaL_optinteger(L, (n), (d)))
+
+#define luaL_typename(L,i) lua_typename(L, lua_type(L,(i)))
+
+#define luaL_dofile(L, fn) \
+ (luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0))
+
+#define luaL_dostring(L, s) \
+ (luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0))
+
+#define luaL_getmetatable(L,n) (lua_getfield(L, LUA_REGISTRYINDEX, (n)))
+
+#define luaL_opt(L,f,n,d) (lua_isnoneornil(L,(n)) ? (d) : f(L,(n)))
+
+/*
+** {======================================================
+** Generic Buffer manipulation
+** =======================================================
+*/
+
+
+
+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_addchar(B,c) \
+ ((void)((B)->p < ((B)->buffer+LUAL_BUFFERSIZE) || luaL_prepbuffer(B)), \
+ (*(B)->p++ = (char)(c)))
+
+/* compatibility only */
+#define luaL_putchar(B,c) luaL_addchar(B,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 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))
+
+
+#define luaL_reg luaL_Reg
+
+#endif
+
+
diff --git a/src/luajit/lbaselib.c b/src/luajit/lbaselib.c
new file mode 100644
index 0000000000..2366a021ab
--- /dev/null
+++ b/src/luajit/lbaselib.c
@@ -0,0 +1,679 @@
+/*
+** $Id: lbaselib.c,v 1.191.1.6 2008/02/14 16:46:22 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
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+#ifndef COCO_DISABLE
+#include "lcoco.h"
+#endif
+
+
+
+
+/*
+** 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, LUA_QL("tostring") " must return a string to "
+ LUA_QL("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);
+ lua_settop(L, 1);
+ if (lua_isstring(L, 1) && level > 0) { /* 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, int opt) {
+ if (lua_isfunction(L, 1)) lua_pushvalue(L, 1);
+ else {
+ lua_Debug ar;
+ int level = opt ? luaL_optint(L, 1, 1) : luaL_checkint(L, 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 luaB_getfenv (lua_State *L) {
+ getfunc(L, 1);
+ if (lua_iscfunction(L, -1)) /* is a C function? */
+ lua_pushvalue(L, LUA_GLOBALSINDEX); /* return the thread's global env. */
+ else
+ lua_getfenv(L, -1);
+ return 1;
+}
+
+
+static int luaB_setfenv (lua_State *L) {
+ luaL_checktype(L, 2, LUA_TTABLE);
+ getfunc(L, 0);
+ lua_pushvalue(L, 2);
+ if (lua_isnumber(L, 1) && lua_tonumber(L, 1) == 0) {
+ /* change environment of current thread */
+ lua_pushthread(L);
+ lua_insert(L, -2);
+ lua_setfenv(L, -2);
+ return 0;
+ }
+ else if (lua_iscfunction(L, -2) || lua_setfenv(L, -2) == 0)
+ luaL_error(L,
+ LUA_QL("setfenv") " cannot change environment of given object");
+ return 1;
+}
+
+
+static int luaB_rawequal (lua_State *L) {
+ luaL_checkany(L, 1);
+ luaL_checkany(L, 2);
+ lua_pushboolean(L, lua_rawequal(L, 1, 2));
+ return 1;
+}
+
+
+static int luaB_rawget (lua_State *L) {
+ luaL_checktype(L, 1, LUA_TTABLE);
+ luaL_checkany(L, 2);
+ lua_settop(L, 2);
+ lua_rawget(L, 1);
+ return 1;
+}
+
+static int luaB_rawset (lua_State *L) {
+ luaL_checktype(L, 1, LUA_TTABLE);
+ luaL_checkany(L, 2);
+ luaL_checkany(L, 3);
+ lua_settop(L, 3);
+ lua_rawset(L, 1);
+ return 1;
+}
+
+
+static int luaB_gcinfo (lua_State *L) {
+ lua_pushinteger(L, lua_getgccount(L));
+ return 1;
+}
+
+
+static int luaB_collectgarbage (lua_State *L) {
+ static const char *const opts[] = {"stop", "restart", "collect",
+ "count", "step", "setpause", "setstepmul", NULL};
+ static const int optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT,
+ LUA_GCCOUNT, LUA_GCSTEP, LUA_GCSETPAUSE, LUA_GCSETSTEPMUL};
+ int o = luaL_checkoption(L, 1, "collect", opts);
+ int ex = luaL_optint(L, 2, 0);
+ int res = lua_gc(L, optsnum[o], ex);
+ switch (optsnum[o]) {
+ case LUA_GCCOUNT: {
+ int b = lua_gc(L, LUA_GCCOUNTB, 0);
+ lua_pushnumber(L, res + ((lua_Number)b/1024));
+ return 1;
+ }
+ case LUA_GCSTEP: {
+ lua_pushboolean(L, res);
+ return 1;
+ }
+ default: {
+ lua_pushnumber(L, res);
+ return 1;
+ }
+ }
+}
+
+
+static int luaB_type (lua_State *L) {
+ luaL_checkany(L, 1);
+ lua_pushstring(L, luaL_typename(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_pushvalue(L, lua_upvalueindex(1)); /* return generator, */
+ lua_pushvalue(L, 1); /* state, */
+ lua_pushnil(L); /* and initial value */
+ return 3;
+}
+
+
+static int ipairsaux (lua_State *L) {
+ int i = luaL_checkint(L, 2);
+ luaL_checktype(L, 1, LUA_TTABLE);
+ i++; /* next value */
+ lua_pushinteger(L, i);
+ lua_rawgeti(L, 1, i);
+ return (lua_isnil(L, -1)) ? 0 : 2;
+}
+
+
+static int luaB_ipairs (lua_State *L) {
+ luaL_checktype(L, 1, LUA_TTABLE);
+ lua_pushvalue(L, lua_upvalueindex(1)); /* return generator, */
+ lua_pushvalue(L, 1); /* state, */
+ lua_pushinteger(L, 0); /* and initial value */
+ return 3;
+}
+
+
+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));
+}
+
+
+/*
+** Reader for generic `load' function: `lua_load' uses the
+** stack for internal stuff, so the reader cannot change the
+** stack top. Instead, it keeps its resulting string in a
+** reserved slot inside the stack.
+*/
+static const char *generic_reader (lua_State *L, void *ud, size_t *size) {
+ (void)ud; /* to avoid warnings */
+ luaL_checkstack(L, 2, "too many nested functions");
+ lua_pushvalue(L, 1); /* get function */
+ lua_call(L, 0, 1); /* call it */
+ if (lua_isnil(L, -1)) {
+ *size = 0;
+ return NULL;
+ }
+ else if (lua_isstring(L, -1)) {
+ lua_replace(L, 3); /* save string in a reserved stack slot */
+ return lua_tolstring(L, 3, size);
+ }
+ else luaL_error(L, "reader function must return a string");
+ return NULL; /* to avoid warnings */
+}
+
+
+static int luaB_load (lua_State *L) {
+ int status;
+ const char *cname = luaL_optstring(L, 2, "=(load)");
+ luaL_checktype(L, 1, LUA_TFUNCTION);
+ lua_settop(L, 3); /* function, eventual name, plus one reserved slot */
+ status = lua_load(L, generic_reader, NULL, cname);
+ return load_aux(L, status);
+}
+
+
+static int luaB_dofile (lua_State *L) {
+ const char *fname = luaL_optstring(L, 1, NULL);
+ int n = lua_gettop(L);
+ if (luaL_loadfile(L, fname) != 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!"));
+ return lua_gettop(L);
+}
+
+
+static int luaB_unpack (lua_State *L) {
+ int i, e, n;
+ luaL_checktype(L, 1, LUA_TTABLE);
+ i = luaL_optint(L, 2, 1);
+ e = luaL_opt(L, luaL_checkint, 3, luaL_getn(L, 1));
+ if (i > e) return 0; /* empty range */
+ n = e - i + 1; /* number of elements */
+ if (n <= 0 || !lua_checkstack(L, n)) /* n <= 0 means arith. overflow */
+ return luaL_error(L, "too many results to unpack");
+ lua_rawgeti(L, 1, i); /* push arg[i] (avoiding overflow problems) */
+ while (i++ < e) /* push arg[i + 1...e] */
+ lua_rawgeti(L, 1, i);
+ return n;
+}
+
+
+static int luaB_select (lua_State *L) {
+ int n = lua_gettop(L);
+ if (lua_type(L, 1) == LUA_TSTRING && *lua_tostring(L, 1) == '#') {
+ lua_pushinteger(L, n-1);
+ return 1;
+ }
+ else {
+ int i = luaL_checkint(L, 1);
+ if (i < 0) i = n + i;
+ else if (i > n) i = n;
+ luaL_argcheck(L, 1 <= i, 1, "index out of range");
+ return n - i;
+ }
+}
+
+
+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) {
+ 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));
+ break;
+ case LUA_TSTRING:
+ lua_pushvalue(L, 1);
+ break;
+ case LUA_TBOOLEAN:
+ lua_pushstring(L, (lua_toboolean(L, 1) ? "true" : "false"));
+ break;
+ case LUA_TNIL:
+ lua_pushliteral(L, "nil");
+ break;
+ default:
+ lua_pushfstring(L, "%s: %p", luaL_typename(L, 1), lua_topointer(L, 1));
+ break;
+ }
+ 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;
+}
+
+
+static const luaL_Reg base_funcs[] = {
+ {"assert", luaB_assert},
+ {"collectgarbage", luaB_collectgarbage},
+ {"dofile", luaB_dofile},
+ {"error", luaB_error},
+ {"gcinfo", luaB_gcinfo},
+ {"getfenv", luaB_getfenv},
+ {"getmetatable", luaB_getmetatable},
+ {"loadfile", luaB_loadfile},
+ {"load", luaB_load},
+ {"loadstring", luaB_loadstring},
+ {"next", luaB_next},
+ {"pcall", luaB_pcall},
+ {"print", luaB_print},
+ {"rawequal", luaB_rawequal},
+ {"rawget", luaB_rawget},
+ {"rawset", luaB_rawset},
+ {"select", luaB_select},
+ {"setfenv", luaB_setfenv},
+ {"setmetatable", luaB_setmetatable},
+ {"tonumber", luaB_tonumber},
+ {"tostring", luaB_tostring},
+ {"type", luaB_type},
+ {"unpack", luaB_unpack},
+ {"xpcall", luaB_xpcall},
+ {NULL, NULL}
+};
+
+
+/*
+** {======================================================
+** Coroutine library
+** =======================================================
+*/
+
+#define CO_RUN 0 /* running */
+#define CO_SUS 1 /* suspended */
+#define CO_NOR 2 /* 'normal' (it resumed another coroutine) */
+#define CO_DEAD 3
+
+static const char *const statnames[] =
+ {"running", "suspended", "normal", "dead"};
+
+static int costatus (lua_State *L, lua_State *co) {
+ if (L == co) return CO_RUN;
+ switch (lua_status(co)) {
+ case LUA_YIELD:
+ return CO_SUS;
+ case 0: {
+ lua_Debug ar;
+ if (lua_getstack(co, 0, &ar) > 0) /* does it have frames? */
+ return CO_NOR; /* it is running */
+ else if (lua_gettop(co) == 0)
+ return CO_DEAD;
+ else
+ return CO_SUS; /* initial state */
+ }
+ default: /* some error occured */
+ return CO_DEAD;
+ }
+}
+
+
+static int luaB_costatus (lua_State *L) {
+ lua_State *co = lua_tothread(L, 1);
+ luaL_argcheck(L, co, 1, "coroutine expected");
+ lua_pushstring(L, statnames[costatus(L, co)]);
+ return 1;
+}
+
+
+static int auxresume (lua_State *L, lua_State *co, int narg) {
+ int status = costatus(L, co);
+ if (!lua_checkstack(co, narg))
+ luaL_error(L, "too many arguments to resume");
+ if (status != CO_SUS) {
+ lua_pushfstring(L, "cannot resume %s coroutine", statnames[status]);
+ return -1; /* error flag */
+ }
+ lua_xmove(L, co, narg);
+ status = lua_resume(co, narg);
+ if (status == 0 || status == LUA_YIELD) {
+ int nres = lua_gettop(co);
+ if (!lua_checkstack(L, nres + 1))
+ 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;
+}
+
+
+#ifndef COCO_DISABLE
+static int luaB_cstacksize (lua_State *L)
+{
+ lua_pushinteger(L, luaCOCO_cstacksize(luaL_optint(L, 1, -1)));
+ return 1;
+}
+#endif
+
+
+static int luaB_cocreate (lua_State *L) {
+#ifdef COCO_DISABLE
+ lua_State *NL = lua_newthread(L);
+ luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), 1,
+ "Lua function expected");
+#else
+ int cstacksize = luaL_optint(L, 2, 0);
+ lua_State *NL = lua_newcthread(L, cstacksize);
+ luaL_argcheck(L, lua_isfunction(L, 1) &&
+ (cstacksize >= 0 ? 1 : !lua_iscfunction(L, 1)),
+ 1, "Lua function expected");
+#endif
+ 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_corunning (lua_State *L) {
+ if (lua_pushthread(L))
+ lua_pushnil(L); /* main thread is not a coroutine */
+ return 1;
+}
+
+
+static const luaL_Reg co_funcs[] = {
+ {"create", luaB_cocreate},
+ {"resume", luaB_coresume},
+ {"running", luaB_corunning},
+ {"status", luaB_costatus},
+ {"wrap", luaB_cowrap},
+ {"yield", luaB_yield},
+#ifndef COCO_DISABLE
+ {"cstacksize", luaB_cstacksize},
+#endif
+ {NULL, NULL}
+};
+
+/* }====================================================== */
+
+
+static void auxopen (lua_State *L, const char *name,
+ lua_CFunction f, lua_CFunction u) {
+ lua_pushcfunction(L, u);
+ lua_pushcclosure(L, f, 1);
+ lua_setfield(L, -2, name);
+}
+
+
+static void base_open (lua_State *L) {
+ /* set global _G */
+ lua_pushvalue(L, LUA_GLOBALSINDEX);
+ lua_setglobal(L, "_G");
+ /* open lib into global table */
+ luaL_register(L, "_G", base_funcs);
+ lua_pushliteral(L, LUA_VERSION);
+ lua_setglobal(L, "_VERSION"); /* set global _VERSION */
+ /* `ipairs' and `pairs' need auxliliary functions as upvalues */
+ auxopen(L, "ipairs", luaB_ipairs, ipairsaux);
+ auxopen(L, "pairs", luaB_pairs, luaB_next);
+ /* `newproxy' needs a weaktable as upvalue */
+ lua_createtable(L, 0, 1); /* new table `w' */
+ lua_pushvalue(L, -1); /* `w' will be its own metatable */
+ lua_setmetatable(L, -2);
+ lua_pushliteral(L, "kv");
+ lua_setfield(L, -2, "__mode"); /* metatable(w).__mode = "kv" */
+ lua_pushcclosure(L, luaB_newproxy, 1);
+ lua_setglobal(L, "newproxy"); /* set global `newproxy' */
+}
+
+
+LUALIB_API int luaopen_base (lua_State *L) {
+ base_open(L);
+ luaL_register(L, LUA_COLIBNAME, co_funcs);
+#ifndef COCO_DISABLE
+ lua_pushboolean(L, 1);
+ lua_setfield(L, -2, "coco");
+#endif
+ return 2;
+}
+
diff --git a/src/luajit/lcoco.c b/src/luajit/lcoco.c
new file mode 100644
index 0000000000..f4fb3d7964
--- /dev/null
+++ b/src/luajit/lcoco.c
@@ -0,0 +1,561 @@
+/*
+** Copyright (C) 2004-2008 Mike Pall. 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.
+**
+** [ MIT license: http://www.opensource.org/licenses/mit-license.php ]
+*/
+
+/* Coco -- True C coroutines for Lua. http://luajit.org/coco.html */
+#ifndef COCO_DISABLE
+
+#define lcoco_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lobject.h"
+#include "lstate.h"
+#include "ldo.h"
+#include "lvm.h"
+#include "lgc.h"
+
+
+/*
+** Define this if you want to run Coco with valgrind. You will get random
+** errors about accessing memory from newly allocated C stacks if you don't.
+** You need at least valgrind 3.0 for this to work.
+**
+** This macro evaluates to a no-op if not run with valgrind. I.e. you can
+** use the same binary for regular runs, too (without a performance loss).
+*/
+#ifdef USE_VALGRIND
+#include <valgrind/valgrind.h>
+#define STACK_REG(coco, p, sz) (coco)->vgid = VALGRIND_STACK_REGISTER(p, p+sz);
+#define STACK_DEREG(coco) VALGRIND_STACK_DEREGISTER((coco)->vgid);
+#define STACK_VGID unsigned int vgid;
+#else
+#define STACK_REG(coco, p, sz)
+#define STACK_DEREG(id)
+#define STACK_VGID
+#endif
+
+/* ------------------------------------------------------------------------ */
+
+/* Use Windows Fibers. */
+#if defined(COCO_USE_FIBERS)
+
+#define _WIN32_WINNT 0x0400
+#include <windows.h>
+
+#define COCO_MAIN_DECL CALLBACK
+
+typedef LPFIBER_START_ROUTINE coco_MainFunc;
+
+#define COCO_NEW(OL, NL, cstacksize, mainfunc) \
+ if ((L2COCO(NL)->fib = CreateFiber(cstacksize, mainfunc, NL)) == NULL) \
+ luaD_throw(OL, LUA_ERRMEM);
+
+#define COCO_FREE(L) \
+ DeleteFiber(L2COCO(L)->fib); \
+ L2COCO(L)->fib = NULL;
+
+/* See: http://blogs.msdn.com/oldnewthing/archive/2004/12/31/344799.aspx */
+#define COCO_JUMPIN(coco) \
+ { void *cur = GetCurrentFiber(); \
+ coco->back = (cur == NULL || cur == (void *)0x1e00) ? \
+ ConvertThreadToFiber(NULL) : cur; } \
+ SwitchToFiber(coco->fib);
+
+#define COCO_JUMPOUT(coco) \
+ SwitchToFiber(coco->back);
+
+/* CreateFiber() defaults to STACKSIZE from the Windows module .def file. */
+#define COCO_DEFAULT_CSTACKSIZE 0
+
+/* ------------------------------------------------------------------------ */
+
+#else /* !COCO_USE_FIBERS */
+
+#ifndef COCO_USE_UCONTEXT
+
+/* Try inline asm first. */
+#if __GNUC__ >= 3 && !defined(COCO_USE_SETJMP)
+
+#if defined(__i386) || defined(__i386__)
+
+#ifdef __PIC__
+typedef void *coco_ctx[4]; /* eip, esp, ebp, ebx */
+static inline void coco_switch(coco_ctx from, coco_ctx to)
+{
+ __asm__ __volatile__ (
+ "call 1f\n" "1:\tpopl %%eax\n\t" "addl $(2f-1b),%%eax\n\t"
+ "movl %%eax, (%0)\n\t" "movl %%esp, 4(%0)\n\t"
+ "movl %%ebp, 8(%0)\n\t" "movl %%ebx, 12(%0)\n\t"
+ "movl 12(%1), %%ebx\n\t" "movl 8(%1), %%ebp\n\t"
+ "movl 4(%1), %%esp\n\t" "jmp *(%1)\n" "2:\n"
+ : "+S" (from), "+D" (to) : : "eax", "ecx", "edx", "memory", "cc");
+}
+#else
+typedef void *coco_ctx[3]; /* eip, esp, ebp */
+static inline void coco_switch(coco_ctx from, coco_ctx to)
+{
+ __asm__ __volatile__ (
+ "movl $1f, (%0)\n\t" "movl %%esp, 4(%0)\n\t" "movl %%ebp, 8(%0)\n\t"
+ "movl 8(%1), %%ebp\n\t" "movl 4(%1), %%esp\n\t" "jmp *(%1)\n" "1:\n"
+ : "+S" (from), "+D" (to) : : "eax", "ebx", "ecx", "edx", "memory", "cc");
+}
+#endif
+
+#define COCO_CTX coco_ctx
+#define COCO_SWITCH(from, to) coco_switch(from, to);
+#define COCO_MAKECTX(coco, buf, func, stack, a0) \
+ buf[0] = (void *)(func); \
+ buf[1] = (void *)(stack); \
+ buf[2] = (void *)0; \
+ stack[0] = 0xdeadc0c0; /* Dummy return address. */ \
+ coco->arg0 = (size_t)(a0);
+#define COCO_STATE_HEAD size_t arg0;
+
+#elif defined(__x86_64__)
+
+void coco_wrap_main(void);
+__asm__ (
+"\t.text\n"
+#ifdef __MACH__
+"\t.private_extern _coco_wrap_main\n"
+"_coco_wrap_main:\n"
+#else
+".local coco_wrap_main\n"
+"\t.type coco_wrap_main, @function\n"
+"coco_wrap_main:\n"
+#endif
+"\tmovq %r12, %rax\n"
+"\tmovq %r13, %rdi\n"
+"\tjmpq *%rax\n"
+);
+
+typedef void *coco_ctx[8]; /* rip, rsp, rbp, rbx, r12, r13, r14, r15 */
+static inline void coco_switch(coco_ctx from, coco_ctx to)
+{
+ __asm__ __volatile__ (
+ "leaq 1f(%%rip), %%rax\n\t"
+ "movq %%rax, (%0)\n\t" "movq %%rsp, 8(%0)\n\t" "movq %%rbp, 16(%0)\n\t"
+ "movq %%rbx, 24(%0)\n\t" "movq %%r12, 32(%0)\n\t" "movq %%r13, 40(%0)\n\t"
+ "movq %%r14, 48(%0)\n\t" "movq %%r15, 56(%0)\n\t"
+ "movq 56(%1), %%r15\n\t" "movq 48(%1), %%r14\n\t" "movq 40(%1), %%r13\n\t"
+ "movq 32(%1), %%r12\n\t" "movq 24(%1), %%rbx\n\t" "movq 16(%1), %%rbp\n\t"
+ "movq 8(%1), %%rsp\n\t" "jmpq *(%1)\n" "1:\n"
+ : "+S" (from), "+D" (to) :
+ : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "memory", "cc");
+}
+
+#define COCO_CTX coco_ctx
+#define COCO_SWITCH(from, to) coco_switch(from, to);
+#define COCO_MAKECTX(coco, buf, func, stack, a0) \
+ buf[0] = (void *)(coco_wrap_main); \
+ buf[1] = (void *)(stack); \
+ buf[2] = (void *)0; \
+ buf[3] = (void *)0; \
+ buf[4] = (void *)(func); \
+ buf[5] = (void *)(a0); \
+ buf[6] = (void *)0; \
+ buf[7] = (void *)0; \
+ stack[0] = 0xdeadc0c0deadc0c0; /* Dummy return address. */ \
+
+#elif __mips && _MIPS_SIM == _MIPS_SIM_ABI32 && !defined(__mips_eabi)
+
+/* No way to avoid the function prologue with inline assembler. So use this: */
+static const unsigned int coco_switch[] = {
+#ifdef __mips_soft_float
+#define COCO_STACKSAVE -10
+ 0x27bdffd8, /* addiu sp, sp, -(10*4) */
+#else
+#define COCO_STACKSAVE -22
+ 0x27bdffa8, /* addiu sp, sp, -(10*4+6*8) */
+ /* sdc1 {$f20-$f30}, offset(sp) */
+ 0xf7be0050, 0xf7bc0048, 0xf7ba0040, 0xf7b80038, 0xf7b60030, 0xf7b40028,
+#endif
+ /* sw {gp,s0-s8}, offset(sp) */
+ 0xafbe0024, 0xafb70020, 0xafb6001c, 0xafb50018, 0xafb40014, 0xafb30010,
+ 0xafb2000c, 0xafb10008, 0xafb00004, 0xafbc0000,
+ /* sw sp, 4(a0); sw ra, 0(a0); lw ra, 0(a1); lw sp, 4(a1); move t9, ra */
+ 0xac9d0004, 0xac9f0000, 0x8cbf0000, 0x8cbd0004, 0x03e0c821,
+ /* lw caller-saved-reg, offset(sp) */
+ 0x8fbe0024, 0x8fb70020, 0x8fb6001c, 0x8fb50018, 0x8fb40014, 0x8fb30010,
+ 0x8fb2000c, 0x8fb10008, 0x8fb00004, 0x8fbc0000,
+#ifdef __mips_soft_float
+ 0x03e00008, 0x27bd0028 /* jr ra; addiu sp, sp, 10*4 */
+#else
+ /* ldc1 {$f20-$f30}, offset(sp) */
+ 0xd7be0050, 0xd7bc0048, 0xd7ba0040, 0xd7b80038, 0xd7b60030, 0xd7b40028,
+ 0x03e00008, 0x27bd0058 /* jr ra; addiu sp, sp, 10*4+6*8 */
+#endif
+};
+
+typedef void *coco_ctx[2]; /* ra, sp */
+#define COCO_CTX coco_ctx
+#define COCO_SWITCH(from, to) \
+ ((void (*)(coco_ctx, coco_ctx))coco_switch)(from, to);
+#define COCO_MAKECTX(coco, buf, func, stack, a0) \
+ buf[0] = (void *)(func); \
+ buf[1] = (void *)&stack[COCO_STACKSAVE]; \
+ stack[4] = (size_t)(a0); /* Assumes o32 ABI. */
+#define COCO_STACKADJUST 8
+#define COCO_MAIN_PARAM int _a, int _b, int _c, int _d, lua_State *L
+
+#endif /* arch check */
+
+#endif /* !(__GNUC__ >= 3 && !defined(COCO_USE_SETJMP)) */
+
+/* Try _setjmp/_longjmp with a patched jump buffer. */
+#ifndef COCO_MAKECTX
+#include <setjmp.h>
+
+/* Check for supported CPU+OS combinations. */
+#if defined(__i386) || defined(__i386__)
+
+#define COCO_STATE_HEAD size_t arg0;
+#define COCO_SETJMP_X86(coco, stack, a0) \
+ stack[COCO_STACKADJUST-1] = 0xdeadc0c0; /* Dummy return address. */ \
+ coco->arg0 = (size_t)(a0);
+
+#if __GLIBC__ == 2 && defined(JB_SP) /* x86-linux-glibc2 */
+#define COCO_PATCHCTX(coco, buf, func, stack, a0) \
+ buf->__jmpbuf[JB_PC] = (int)(func); \
+ buf->__jmpbuf[JB_SP] = (int)(stack); \
+ buf->__jmpbuf[JB_BP] = 0; \
+ COCO_SETJMP_X86(coco, stack, a0)
+#elif defined(__linux__) && defined(_I386_JMP_BUF_H) /* x86-linux-libc5 */
+#define COCO_PATCHCTX(coco, buf, func, stack, a0) \
+ buf->__pc = (func); \
+ buf->__sp = (stack); \
+ buf->__bp = NULL; \
+ COCO_SETJMP_X86(coco, stack, a0)
+#elif defined(__FreeBSD__) /* x86-FreeBSD */
+#define COCO_PATCHCTX(coco, buf, func, stack, a0) \
+ buf->_jb[0] = (long)(func); \
+ buf->_jb[2] = (long)(stack); \
+ buf->_jb[3] = 0; /* ebp */ \
+ COCO_SETJMP_X86(coco, stack, a0)
+#define COCO_STACKADJUST 2
+#elif defined(__NetBSD__) || defined(__OpenBSD__) /* x86-NetBSD, x86-OpenBSD */
+#define COCO_PATCHCTX(coco, buf, func, stack, a0) \
+ buf[0] = (long)(func); \
+ buf[2] = (long)(stack); \
+ buf[3] = 0; /* ebp */ \
+ COCO_SETJMP_X86(coco, stack, a0)
+#define COCO_STACKADJUST 2
+#elif defined(__solaris__) && _JBLEN == 10 /* x86-solaris */
+#define COCO_PATCHCTX(coco, buf, func, stack, a0) \
+ buf[5] = (int)(func); \
+ buf[4] = (int)(stack); \
+ buf[3] = 0; \
+ COCO_SETJMP_X86(coco, stack, a0)
+#elif defined(__MACH__) && defined(_BSD_I386_SETJMP_H) /* x86-macosx */
+#define COCO_PATCHCTX(coco, buf, func, stack, a0) \
+ buf[12] = (int)(func); \
+ buf[9] = (int)(stack); \
+ buf[8] = 0; /* ebp */ \
+ COCO_SETJMP_X86(coco, stack, a0)
+#endif
+
+#elif defined(__x86_64__) || defined(__x86_64)
+
+#define COCO_STATE_HEAD size_t arg0;
+
+#define COCO_MAIN_PARAM \
+ int _a, int _b, int _c, int _d, int _e, int _f, lua_State *L
+
+#if defined(__solaris__) && _JBLEN == 8 /* x64-solaris */
+#define COCO_PATCHCTX(coco, buf, func, stack, a0) \
+ buf[7] = (long)(func); \
+ buf[6] = (long)(stack); \
+ buf[5] = 0; \
+ stack[0] = 0xdeadc0c0; /* Dummy return address. */ \
+ coco->arg0 = (size_t)(a0);
+#endif
+
+#elif defined(PPC) || defined(__ppc__) || defined(__PPC__) || \
+ defined(__powerpc__) || defined(__POWERPC__) || defined(_ARCH_PPC)
+
+#define COCO_STACKADJUST 16
+#define COCO_MAIN_PARAM \
+ int _a, int _b, int _c, int _d, int _e, int _f, int _g, int _h, lua_State *L
+
+#if defined(__MACH__) && defined(_BSD_PPC_SETJMP_H_) /* ppc32-macosx */
+#define COCO_PATCHCTX(coco, buf, func, stack, a0) \
+ buf[21] = (int)(func); \
+ buf[0] = (int)(stack); \
+ stack[6+8] = (size_t)(a0);
+#endif
+
+#elif (defined(MIPS) || defined(MIPSEL) || defined(__mips)) && \
+ _MIPS_SIM == _MIPS_SIM_ABI32 && !defined(__mips_eabi)
+
+/* Stack layout for o32 ABI. */
+#define COCO_STACKADJUST 8
+#define COCO_MAIN_PARAM int _a, int _b, int _c, int _d, lua_State *L
+
+#if __GLIBC__ == 2 || defined(__UCLIBC__) /* mips32-linux-glibc2 */
+#define COCO_PATCHCTX(coco, buf, func, stack, a0) \
+ buf->__jmpbuf->__pc = (func); /* = t9 in _longjmp. Reqd. for -mabicalls. */ \
+ buf->__jmpbuf->__sp = (stack); \
+ buf->__jmpbuf->__fp = (void *)0; \
+ stack[4] = (size_t)(a0);
+#endif
+
+#elif defined(__arm__) || defined(__ARM__)
+
+#if __GLIBC__ == 2 || defined(__UCLIBC__) /* arm-linux-glibc2 */
+#ifndef __JMP_BUF_SP
+#define __JMP_BUF_SP ((sizeof(__jmp_buf)/sizeof(int))-2)
+#endif
+#define COCO_PATCHCTX(coco, buf, func, stack, a0) \
+ buf->__jmpbuf[__JMP_BUF_SP+1] = (int)(func); /* pc */ \
+ buf->__jmpbuf[__JMP_BUF_SP] = (int)(stack); /* sp */ \
+ buf->__jmpbuf[__JMP_BUF_SP-1] = 0; /* fp */ \
+ stack[0] = (size_t)(a0);
+#define COCO_STACKADJUST 2
+#define COCO_MAIN_PARAM int _a, int _b, int _c, int _d, lua_State *L
+#endif
+
+#endif /* arch check */
+
+#ifdef COCO_PATCHCTX
+#define COCO_CTX jmp_buf
+#define COCO_MAKECTX(coco, buf, func, stack, a0) \
+ _setjmp(buf); COCO_PATCHCTX(coco, buf, func, stack, a0)
+#define COCO_SWITCH(from, to) if (!_setjmp(from)) _longjmp(to, 1);
+#endif
+
+#endif /* !defined(COCO_MAKECTX) */
+
+#endif /* !defined(COCO_USE_UCONTEXT) */
+
+/* ------------------------------------------------------------------------ */
+
+/* Use inline asm or _setjmp/_longjmp if available. */
+#ifdef COCO_MAKECTX
+
+#ifndef COCO_STACKADJUST
+#define COCO_STACKADJUST 1
+#endif
+
+#define COCO_FILL(coco, NL, mainfunc) \
+{ /* Include the return address to get proper stack alignment. */ \
+ size_t *stackptr = &((size_t *)coco)[-COCO_STACKADJUST]; \
+ COCO_MAKECTX(coco, coco->ctx, mainfunc, stackptr, NL) \
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Else fallback to ucontext. Slower, because it saves/restores signals. */
+#else /* !defined(COCO_MAKECTX) */
+
+#include <ucontext.h>
+
+#define COCO_CTX ucontext_t
+
+/* Ugly workaround for makecontext() deficiencies on 64 bit CPUs. */
+/* Note that WIN64 (which is LLP64) never comes here. See above. */
+#if defined(__LP64__) || defined(_LP64) || INT_MAX != LONG_MAX
+/* 64 bit CPU: split the pointer into two 32 bit ints. */
+#define COCO_MAIN_PARAM unsigned int lo, unsigned int hi
+#define COCO_MAIN_GETL \
+ lua_State *L = (lua_State *)((((unsigned long)hi)<<32)+(unsigned long)lo);
+#define COCO_MAKECTX(coco, NL, mainfunc) \
+ makecontext(&coco->ctx, mainfunc, 2, \
+ (int)(ptrdiff_t)NL, (int)((ptrdiff_t)NL>>32));
+#else
+/* 32 bit CPU: a pointer fits into an int. */
+#define COCO_MAKECTX(coco, NL, mainfunc) \
+ makecontext(&coco->ctx, mainfunc, 1, (int)NL);
+#endif
+
+#define COCO_FILL(coco, NL, mainfunc) \
+ getcontext(&coco->ctx); \
+ coco->ctx.uc_link = NULL; /* We never exit from coco_main. */ \
+ coco->ctx.uc_stack.ss_sp = coco->allocptr; \
+ coco->ctx.uc_stack.ss_size = (char *)coco - (char *)(coco->allocptr); \
+ COCO_MAKECTX(coco, NL, mainfunc)
+
+#define COCO_SWITCH(from, to) swapcontext(&(from), &(to));
+
+#endif /* !defined(COCO_MAKECTX) */
+
+
+/* Common code for inline asm/setjmp/ucontext to allocate/free the stack. */
+
+struct coco_State {
+#ifdef COCO_STATE_HEAD
+ COCO_STATE_HEAD
+#endif
+ COCO_CTX ctx; /* Own context. */
+ COCO_CTX back; /* Context to switch back to. */
+ void *allocptr; /* Pointer to allocated memory. */
+ int allocsize; /* Size of allocated memory. */
+ int nargs; /* Number of arguments to pass. */
+ STACK_VGID /* Optional valgrind stack id. See above. */
+};
+
+typedef void (*coco_MainFunc)(void);
+
+/* Put the Coco state at the end and align it downwards. */
+#define ALIGNED_END(p, s, t) \
+ ((t *)(((char *)0) + ((((char *)(p)-(char *)0)+(s)-sizeof(t)) & -16)))
+
+/* TODO: use mmap. */
+#define COCO_NEW(OL, NL, cstacksize, mainfunc) \
+{ \
+ void *ptr = luaM_malloc(OL, cstacksize); \
+ coco_State *coco = ALIGNED_END(ptr, cstacksize, coco_State); \
+ STACK_REG(coco, ptr, cstacksize) \
+ coco->allocptr = ptr; \
+ coco->allocsize = cstacksize; \
+ COCO_FILL(coco, NL, mainfunc) \
+ L2COCO(NL) = coco; \
+}
+
+#define COCO_FREE(L) \
+ STACK_DEREG(L2COCO(L)) \
+ luaM_freemem(L, L2COCO(L)->allocptr, L2COCO(L)->allocsize); \
+ L2COCO(L) = NULL;
+
+#define COCO_JUMPIN(coco) COCO_SWITCH(coco->back, coco->ctx)
+#define COCO_JUMPOUT(coco) COCO_SWITCH(coco->ctx, coco->back)
+
+#endif /* !COCO_USE_FIBERS */
+
+/* ------------------------------------------------------------------------ */
+
+#ifndef COCO_MIN_CSTACKSIZE
+#define COCO_MIN_CSTACKSIZE (32768+4096)
+#endif
+
+/* Don't use multiples of 64K to avoid D-cache aliasing conflicts. */
+#ifndef COCO_DEFAULT_CSTACKSIZE
+#define COCO_DEFAULT_CSTACKSIZE (65536-4096)
+#endif
+
+static int defaultcstacksize = COCO_DEFAULT_CSTACKSIZE;
+
+/* Start the Lua or C function. */
+static void coco_start(lua_State *L, void *ud)
+{
+ if (luaD_precall(L, (StkId)ud, LUA_MULTRET) == PCRLUA)
+ luaV_execute(L, L->ci - L->base_ci);
+}
+
+#ifndef COCO_MAIN_PARAM
+#define COCO_MAIN_PARAM lua_State *L
+#endif
+
+#ifndef COCO_MAIN_DECL
+#define COCO_MAIN_DECL
+#endif
+
+/* Toplevel function for the new coroutine stack. Never exits. */
+static void COCO_MAIN_DECL coco_main(COCO_MAIN_PARAM)
+{
+#ifdef COCO_MAIN_GETL
+ COCO_MAIN_GETL
+#endif
+ coco_State *coco = L2COCO(L);
+ for (;;) {
+ L->status = luaD_rawrunprotected(L, coco_start, L->top - (coco->nargs+1));
+ if (L->status != 0) luaD_seterrorobj(L, L->status, L->top);
+ COCO_JUMPOUT(coco)
+ }
+}
+
+/* Add a C stack to a coroutine. */
+lua_State *lua_newcthread(lua_State *OL, int cstacksize)
+{
+ lua_State *NL = lua_newthread(OL);
+
+ if (cstacksize < 0)
+ return NL;
+ if (cstacksize == 0)
+ cstacksize = defaultcstacksize;
+ else if (cstacksize < COCO_MIN_CSTACKSIZE)
+ cstacksize = COCO_MIN_CSTACKSIZE;
+ cstacksize &= -16;
+
+ COCO_NEW(OL, NL, cstacksize, ((coco_MainFunc)(coco_main)))
+
+ return NL;
+}
+
+/* Free the C stack of a coroutine. Called from lstate.c. */
+void luaCOCO_free(lua_State *L)
+{
+ COCO_FREE(L)
+}
+
+/* Resume a coroutine with a C stack. Called from ldo.c. */
+int luaCOCO_resume(lua_State *L, int nargs)
+{
+ coco_State *coco = L2COCO(L);
+ coco->nargs = nargs;
+ COCO_JUMPIN(coco)
+#ifndef COCO_DISABLE_EARLY_FREE
+ if (L->status != LUA_YIELD) {
+ COCO_FREE(L)
+ }
+#endif
+ return L->status;
+}
+
+/* Yield from a coroutine with a C stack. Called from ldo.c. */
+int luaCOCO_yield(lua_State *L)
+{
+ coco_State *coco = L2COCO(L);
+ L->status = LUA_YIELD;
+ COCO_JUMPOUT(coco)
+ L->status = 0;
+ {
+ StkId base = L->top - coco->nargs;
+ StkId rbase = L->base;
+ if (rbase < base) { /* Need to move args down? */
+ while (base < L->top)
+ setobjs2s(L, rbase++, base++);
+ L->top = rbase;
+ }
+ }
+ L->base = L->ci->base; /* Restore invariant. */
+ return coco->nargs;
+}
+
+/* Get/set the default C stack size. */
+int luaCOCO_cstacksize(int cstacksize)
+{
+ int oldsz = defaultcstacksize;
+ if (cstacksize >= 0) {
+ if (cstacksize == 0)
+ cstacksize = COCO_DEFAULT_CSTACKSIZE;
+ else if (cstacksize < COCO_MIN_CSTACKSIZE)
+ cstacksize = COCO_MIN_CSTACKSIZE;
+ defaultcstacksize = cstacksize;
+ }
+ return oldsz;
+}
+
+#endif
diff --git a/src/luajit/lcoco.h b/src/luajit/lcoco.h
new file mode 100644
index 0000000000..50e1e82178
--- /dev/null
+++ b/src/luajit/lcoco.h
@@ -0,0 +1,72 @@
+/*
+** Lua/Coco glue.
+** Copyright (C) 2004-2008 Mike Pall. See copyright notice in lcoco.c
+*/
+
+#ifndef lcoco_h
+#define lcoco_h
+
+#define LUACOCO_VERSION "Coco 1.1.5"
+#define LUACOCO_VERSION_NUM 10105
+
+/* Exported C API to add a C stack to a coroutine. */
+LUA_API lua_State *lua_newcthread(lua_State *L, int cstacksize);
+
+/* Internal support routines. */
+LUAI_FUNC void luaCOCO_free(lua_State *L);
+LUAI_FUNC int luaCOCO_resume(lua_State *L, int nargs);
+LUAI_FUNC int luaCOCO_yield(lua_State *L);
+LUAI_FUNC int luaCOCO_cstacksize(int cstacksize);
+
+/* Forward declaration. */
+typedef struct coco_State coco_State;
+
+/* These are redefined below. */
+#undef LUAI_EXTRASPACE
+#undef luai_userstateopen
+/* luai_userstateclose unused */
+#undef luai_userstatethread
+#undef luai_userstatefree
+#undef luai_userstateresume
+#undef luai_userstateyield
+
+/* Use Windows Fibers (Win98+). */
+#if defined(_WIN32)
+
+/* Fibers allocate their own stack. The whole Coco state is in front of L. */
+struct coco_State {
+ void *fib; /* Own fiber (if any). */
+ void *back; /* Fiber to switch back to. */
+ int nargs; /* Number of arguments to pass. */
+ int dummy_align;
+};
+
+#define L2COCO(L) (&((coco_State *)(L))[-1])
+#define LHASCOCO(L) (L2COCO(L)->fib)
+#define LUAI_EXTRASPACE sizeof(coco_State)
+#define luai_userstateopen(L) L2COCO(L)->fib = NULL
+#define luai_userstatethread(L,L1) L2COCO(L1)->fib = NULL
+#define COCO_USE_FIBERS
+
+#else /* !defined(_WIN32) */
+
+/* The Coco state depends on the context switch method used. See lcoco.c. */
+/* It's stored at the end of the stack. Only need a pointer in front of L. */
+#define L2COCO(L) (((coco_State **)(L))[-1])
+#define LHASCOCO(L) (L2COCO(L))
+/* This wastes some space on 32 bit systems, but gets better alignment. */
+#define LUAI_EXTRASPACE sizeof(LUAI_USER_ALIGNMENT_T)
+#define luai_userstateopen(L) L2COCO(L) = NULL
+#define luai_userstatethread(L,L1) L2COCO(L1) = NULL
+
+#endif /* !defined(_WIN32) */
+
+#define luai_userstatefree(L) if (LHASCOCO(L)) luaCOCO_free(L)
+#define luai_userstateresume(L, nargs) \
+ if (LHASCOCO(L)) return luaCOCO_resume(L, nargs)
+#define luai_userstateyield(L, nresults) \
+ do { if (LHASCOCO(L)) { \
+ L->base = L->top - (nresults); /* Protect stack slots below. */ \
+ return luaCOCO_yield(L); } } while (0)
+
+#endif
diff --git a/src/luajit/lcode.c b/src/luajit/lcode.c
new file mode 100644
index 0000000000..cff626b7fa
--- /dev/null
+++ b/src/luajit/lcode.c
@@ -0,0 +1,839 @@
+/*
+** $Id: lcode.c,v 2.25.1.3 2007/12/28 15:32:23 roberto Exp $
+** Code generator for Lua
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdlib.h>
+
+#define lcode_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lcode.h"
+#include "ldebug.h"
+#include "ldo.h"
+#include "lgc.h"
+#include "llex.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lparser.h"
+#include "ltable.h"
+
+
+#define hasjumps(e) ((e)->t != (e)->f)
+
+
+static int isnumeral(expdesc *e) {
+ return (e->k == VKNUM && e->t == NO_JUMP && e->f == NO_JUMP);
+}
+
+
+void luaK_nil (FuncState *fs, int from, int n) {
+ Instruction *previous;
+ if (fs->pc > fs->lasttarget) { /* no jumps to current position? */
+ if (fs->pc == 0) { /* function start? */
+ if (from >= fs->nactvar)
+ return; /* positions are already clean */
+ }
+ else {
+ previous = &fs->f->code[fs->pc-1];
+ if (GET_OPCODE(*previous) == 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;
+}
+
+
+void luaK_ret (FuncState *fs, int first, int nret) {
+ luaK_codeABC(fs, OP_RETURN, first, nret+1, 0);
+}
+
+
+static int condjump (FuncState *fs, OpCode op, int A, int B, int C) {
+ luaK_codeABC(fs, op, A, B, C);
+ return luaK_jump(fs);
+}
+
+
+static void fixjump (FuncState *fs, int pc, int dest) {
+ Instruction *jmp = &fs->f->code[pc];
+ int offset = dest-(pc+1);
+ lua_assert(dest != NO_JUMP);
+ if (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 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 && testTMode(GET_OPCODE(*(pi-1))))
+ 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) {
+ for (; list != NO_JUMP; list = getjump(fs, list)) {
+ Instruction i = *getjumpcontrol(fs, list);
+ if (GET_OPCODE(i) != OP_TESTSET) return 1;
+ }
+ return 0; /* not found */
+}
+
+
+static int patchtestreg (FuncState *fs, int node, int reg) {
+ Instruction *i = getjumpcontrol(fs, node);
+ if (GET_OPCODE(*i) != OP_TESTSET)
+ return 0; /* cannot patch other instructions */
+ if (reg != NO_REG && reg != GETARG_B(*i))
+ SETARG_A(*i, reg);
+ else /* no register to put value or register already has the value */
+ *i = CREATE_ABC(OP_TEST, GETARG_B(*i), 0, GETARG_C(*i));
+
+ return 1;
+}
+
+
+static void removevalues (FuncState *fs, int list) {
+ for (; list != NO_JUMP; list = getjump(fs, list))
+ patchtestreg(fs, list, NO_REG);
+}
+
+
+static void patchlistaux (FuncState *fs, int list, int vtarget, int reg,
+ int dtarget) {
+ while (list != NO_JUMP) {
+ int next = getjump(fs, list);
+ if (patchtestreg(fs, list, reg))
+ fixjump(fs, list, vtarget);
+ else
+ fixjump(fs, list, dtarget); /* jump to default target */
+ list = next;
+ }
+}
+
+
+static void dischargejpc (FuncState *fs) {
+ patchlistaux(fs, fs->jpc, 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);
+ patchlistaux(fs, list, 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 = getjump(fs, list)) != NO_JUMP) /* find last element */
+ list = next;
+ 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_byte(newstack);
+ }
+}
+
+
+void luaK_reserveregs (FuncState *fs, int n) {
+ luaK_checkstack(fs, n);
+ fs->freereg += n;
+}
+
+
+static void freereg (FuncState *fs, int reg) {
+ if (!ISK(reg) && reg >= fs->nactvar) {
+ fs->freereg--;
+ lua_assert(reg == fs->freereg);
+ }
+}
+
+
+static void freeexp (FuncState *fs, expdesc *e) {
+ if (e->k == VNONRELOC)
+ freereg(fs, e->u.s.info);
+}
+
+
+static int addk (FuncState *fs, TValue *k, TValue *v) {
+ lua_State *L = fs->L;
+ TValue *idx = luaH_set(L, fs->h, k);
+ Proto *f = fs->f;
+ int oldsize = f->sizek;
+ 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 */
+ setnvalue(idx, cast_num(fs->nk));
+ luaM_growvector(L, f->k, fs->nk, f->sizek, TValue,
+ MAXARG_Bx, "constant table overflow");
+ while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]);
+ setobj(L, &f->k[fs->nk], v);
+ luaC_barrier(L, f, v);
+ return fs->nk++;
+ }
+}
+
+
+int luaK_stringK (FuncState *fs, TString *s) {
+ TValue o;
+ setsvalue(fs->L, &o, s);
+ return addk(fs, &o, &o);
+}
+
+
+int luaK_numberK (FuncState *fs, lua_Number r) {
+ TValue o;
+ setnvalue(&o, r);
+ return addk(fs, &o, &o);
+}
+
+
+static int boolK (FuncState *fs, int b) {
+ TValue o;
+ setbvalue(&o, b);
+ return addk(fs, &o, &o);
+}
+
+
+static int nilK (FuncState *fs) {
+ TValue k, v;
+ setnilvalue(&v);
+ /* cannot use nil as key; instead use table itself to represent nil */
+ sethvalue(fs->L, &k, fs->h);
+ return addk(fs, &k, &v);
+}
+
+
+void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) {
+ if (e->k == VCALL) { /* expression is an open function call? */
+ SETARG_C(getcode(fs, e), nresults+1);
+ }
+ else if (e->k == VVARARG) {
+ SETARG_B(getcode(fs, e), nresults+1);
+ SETARG_A(getcode(fs, e), fs->freereg);
+ luaK_reserveregs(fs, 1);
+ }
+}
+
+
+void luaK_setoneret (FuncState *fs, expdesc *e) {
+ if (e->k == VCALL) { /* expression is an open function call? */
+ e->k = VNONRELOC;
+ e->u.s.info = GETARG_A(getcode(fs, e));
+ }
+ else if (e->k == VVARARG) {
+ SETARG_B(getcode(fs, e), 2);
+ e->k = VRELOCABLE; /* can relocate its simple result */
+ }
+}
+
+
+void luaK_dischargevars (FuncState *fs, expdesc *e) {
+ switch (e->k) {
+ case VLOCAL: {
+ e->k = VNONRELOC;
+ break;
+ }
+ case VUPVAL: {
+ e->u.s.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.s.info, 0);
+ e->k = VRELOCABLE;
+ break;
+ }
+ case VGLOBAL: {
+ e->u.s.info = luaK_codeABx(fs, OP_GETGLOBAL, 0, e->u.s.info);
+ e->k = VRELOCABLE;
+ break;
+ }
+ case VINDEXED: {
+ freereg(fs, e->u.s.aux);
+ freereg(fs, e->u.s.info);
+ e->u.s.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.s.info, e->u.s.aux);
+ e->k = VRELOCABLE;
+ break;
+ }
+ case VVARARG:
+ case VCALL: {
+ luaK_setoneret(fs, e);
+ 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->u.s.info);
+ break;
+ }
+ case VKNUM: {
+ luaK_codeABx(fs, OP_LOADK, reg, luaK_numberK(fs, e->u.nval));
+ break;
+ }
+ case VRELOCABLE: {
+ Instruction *pc = &getcode(fs, e);
+ SETARG_A(*pc, reg);
+ break;
+ }
+ case VNONRELOC: {
+ if (reg != e->u.s.info)
+ luaK_codeABC(fs, OP_MOVE, reg, e->u.s.info, 0);
+ break;
+ }
+ default: {
+ lua_assert(e->k == VVOID || e->k == VJMP);
+ return; /* nothing to do... */
+ }
+ }
+ e->u.s.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 exp2reg (FuncState *fs, expdesc *e, int reg) {
+ discharge2reg(fs, e, reg);
+ if (e->k == VJMP)
+ luaK_concat(fs, &e->t, e->u.s.info); /* put this jump in `t' list */
+ if (hasjumps(e)) {
+ int final; /* position after whole expression */
+ int p_f = NO_JUMP; /* position of an eventual LOAD false */
+ int p_t = NO_JUMP; /* position of an eventual LOAD true */
+ if (need_value(fs, e->t) || need_value(fs, e->f)) {
+ int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs);
+ p_f = code_label(fs, reg, 0, 1);
+ p_t = code_label(fs, reg, 1, 0);
+ luaK_patchtohere(fs, fj);
+ }
+ final = luaK_getlabel(fs);
+ patchlistaux(fs, e->f, final, reg, p_f);
+ patchlistaux(fs, e->t, final, reg, p_t);
+ }
+ e->f = e->t = NO_JUMP;
+ e->u.s.info = reg;
+ e->k = VNONRELOC;
+}
+
+
+void luaK_exp2nextreg (FuncState *fs, expdesc *e) {
+ luaK_dischargevars(fs, e);
+ freeexp(fs, e);
+ luaK_reserveregs(fs, 1);
+ exp2reg(fs, e, fs->freereg - 1);
+}
+
+
+int luaK_exp2anyreg (FuncState *fs, expdesc *e) {
+ luaK_dischargevars(fs, e);
+ if (e->k == VNONRELOC) {
+ if (!hasjumps(e)) return e->u.s.info; /* exp is already in a register */
+ if (e->u.s.info >= fs->nactvar) { /* reg. is not a local? */
+ exp2reg(fs, e, e->u.s.info); /* put value on it */
+ return e->u.s.info;
+ }
+ }
+ luaK_exp2nextreg(fs, e); /* default */
+ return e->u.s.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 VKNUM:
+ case VTRUE:
+ case VFALSE:
+ case VNIL: {
+ if (fs->nk <= MAXINDEXRK) { /* constant fit in RK operand? */
+ e->u.s.info = (e->k == VNIL) ? nilK(fs) :
+ (e->k == VKNUM) ? luaK_numberK(fs, e->u.nval) :
+ boolK(fs, (e->k == VTRUE));
+ e->k = VK;
+ return RKASK(e->u.s.info);
+ }
+ else break;
+ }
+ case VK: {
+ if (e->u.s.info <= MAXINDEXRK) /* constant fit in argC? */
+ return RKASK(e->u.s.info);
+ 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 *ex) {
+ switch (var->k) {
+ case VLOCAL: {
+ freeexp(fs, ex);
+ exp2reg(fs, ex, var->u.s.info);
+ return;
+ }
+ case VUPVAL: {
+ int e = luaK_exp2anyreg(fs, ex);
+ luaK_codeABC(fs, OP_SETUPVAL, e, var->u.s.info, 0);
+ break;
+ }
+ case VGLOBAL: {
+ int e = luaK_exp2anyreg(fs, ex);
+ luaK_codeABx(fs, OP_SETGLOBAL, e, var->u.s.info);
+ break;
+ }
+ case VINDEXED: {
+ int e = luaK_exp2RK(fs, ex);
+ luaK_codeABC(fs, OP_SETTABLE, var->u.s.info, var->u.s.aux, e);
+ break;
+ }
+ default: {
+ lua_assert(0); /* invalid var kind to store */
+ break;
+ }
+ }
+ freeexp(fs, ex);
+}
+
+
+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->u.s.info, luaK_exp2RK(fs, key));
+ freeexp(fs, key);
+ e->u.s.info = func;
+ e->k = VNONRELOC;
+}
+
+
+static void invertjump (FuncState *fs, expdesc *e) {
+ Instruction *pc = getjumpcontrol(fs, e->u.s.info);
+ lua_assert(testTMode(GET_OPCODE(*pc)) && GET_OPCODE(*pc) != OP_TESTSET &&
+ 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 condjump(fs, OP_TEST, GETARG_B(ie), 0, !cond);
+ }
+ /* else go through */
+ }
+ discharge2anyreg(fs, e);
+ freeexp(fs, e);
+ return condjump(fs, OP_TESTSET, NO_REG, e->u.s.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 VKNUM: 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->u.s.info;
+ break;
+ }
+ default: {
+ pc = jumponcond(fs, e, 0);
+ break;
+ }
+ }
+ luaK_concat(fs, &e->f, pc); /* insert last jump in `f' list */
+ luaK_patchtohere(fs, e->t);
+ e->t = NO_JUMP;
+}
+
+
+static 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->u.s.info;
+ break;
+ }
+ default: {
+ pc = jumponcond(fs, e, 1);
+ break;
+ }
+ }
+ luaK_concat(fs, &e->t, pc); /* insert last jump in `t' list */
+ luaK_patchtohere(fs, e->f);
+ e->f = NO_JUMP;
+}
+
+
+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 VKNUM: case VTRUE: {
+ e->k = VFALSE;
+ break;
+ }
+ case VJMP: {
+ invertjump(fs, e);
+ break;
+ }
+ case VRELOCABLE:
+ case VNONRELOC: {
+ discharge2anyreg(fs, e);
+ freeexp(fs, e);
+ e->u.s.info = luaK_codeABC(fs, OP_NOT, 0, e->u.s.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; }
+ removevalues(fs, e->f);
+ removevalues(fs, e->t);
+}
+
+
+void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) {
+ t->u.s.aux = luaK_exp2RK(fs, k);
+ t->k = VINDEXED;
+}
+
+
+static int constfolding (OpCode op, expdesc *e1, expdesc *e2) {
+ lua_Number v1, v2, r;
+ if (!isnumeral(e1) || !isnumeral(e2)) return 0;
+ v1 = e1->u.nval;
+ v2 = e2->u.nval;
+ switch (op) {
+ case OP_ADD: r = luai_numadd(v1, v2); break;
+ case OP_SUB: r = luai_numsub(v1, v2); break;
+ case OP_MUL: r = luai_nummul(v1, v2); break;
+ case OP_DIV:
+ if (v2 == 0) return 0; /* do not attempt to divide by 0 */
+ r = luai_numdiv(v1, v2); break;
+ case OP_MOD:
+ if (v2 == 0) return 0; /* do not attempt to divide by 0 */
+ r = luai_nummod(v1, v2); break;
+ case OP_POW: r = luai_numpow(v1, v2); break;
+ case OP_UNM: r = luai_numunm(v1); break;
+ case OP_LEN: return 0; /* no constant folding for 'len' */
+ default: lua_assert(0); r = 0; break;
+ }
+ if (luai_numisnan(r)) return 0; /* do not attempt to produce NaN */
+ e1->u.nval = r;
+ return 1;
+}
+
+
+static void codearith (FuncState *fs, OpCode op, expdesc *e1, expdesc *e2) {
+ if (constfolding(op, e1, e2))
+ return;
+ else {
+ int o2 = (op != OP_UNM && op != OP_LEN) ? luaK_exp2RK(fs, e2) : 0;
+ int o1 = luaK_exp2RK(fs, e1);
+ if (o1 > o2) {
+ freeexp(fs, e1);
+ freeexp(fs, e2);
+ }
+ else {
+ freeexp(fs, e2);
+ freeexp(fs, e1);
+ }
+ e1->u.s.info = luaK_codeABC(fs, op, 0, o1, o2);
+ e1->k = VRELOCABLE;
+ }
+}
+
+
+static void codecomp (FuncState *fs, OpCode op, int cond, expdesc *e1,
+ expdesc *e2) {
+ int o1 = luaK_exp2RK(fs, e1);
+ int o2 = luaK_exp2RK(fs, e2);
+ freeexp(fs, e2);
+ freeexp(fs, e1);
+ if (cond == 0 && op != OP_EQ) {
+ int temp; /* exchange args to replace by `<' or `<=' */
+ temp = o1; o1 = o2; o2 = temp; /* o1 <==> o2 */
+ cond = 1;
+ }
+ e1->u.s.info = condjump(fs, op, cond, o1, o2);
+ e1->k = VJMP;
+}
+
+
+void luaK_prefix (FuncState *fs, UnOpr op, expdesc *e) {
+ expdesc e2;
+ e2.t = e2.f = NO_JUMP; e2.k = VKNUM; e2.u.nval = 0;
+ switch (op) {
+ case OPR_MINUS: {
+ if (!isnumeral(e))
+ luaK_exp2anyreg(fs, e); /* cannot operate on non-numeric constants */
+ codearith(fs, OP_UNM, e, &e2);
+ break;
+ }
+ case OPR_NOT: codenot(fs, e); break;
+ case OPR_LEN: {
+ luaK_exp2anyreg(fs, e); /* cannot operate on constants */
+ codearith(fs, OP_LEN, e, &e2);
+ break;
+ }
+ default: lua_assert(0);
+ }
+}
+
+
+void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) {
+ switch (op) {
+ case OPR_AND: {
+ luaK_goiftrue(fs, v);
+ break;
+ }
+ case OPR_OR: {
+ luaK_goiffalse(fs, v);
+ break;
+ }
+ case OPR_CONCAT: {
+ luaK_exp2nextreg(fs, v); /* operand must be on the `stack' */
+ break;
+ }
+ case OPR_ADD: case OPR_SUB: case OPR_MUL: case OPR_DIV:
+ case OPR_MOD: case OPR_POW: {
+ if (!isnumeral(v)) luaK_exp2RK(fs, v);
+ break;
+ }
+ default: {
+ luaK_exp2RK(fs, v);
+ break;
+ }
+ }
+}
+
+
+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, &e2->f, e1->f);
+ *e1 = *e2;
+ break;
+ }
+ case OPR_OR: {
+ lua_assert(e1->f == NO_JUMP); /* list must be closed */
+ luaK_dischargevars(fs, e2);
+ luaK_concat(fs, &e2->t, e1->t);
+ *e1 = *e2;
+ break;
+ }
+ case OPR_CONCAT: {
+ luaK_exp2val(fs, e2);
+ if (e2->k == VRELOCABLE && GET_OPCODE(getcode(fs, e2)) == OP_CONCAT) {
+ lua_assert(e1->u.s.info == GETARG_B(getcode(fs, e2))-1);
+ freeexp(fs, e1);
+ SETARG_B(getcode(fs, e2), e1->u.s.info);
+ e1->k = VRELOCABLE; e1->u.s.info = e2->u.s.info;
+ }
+ else {
+ luaK_exp2nextreg(fs, e2); /* operand must be on the 'stack' */
+ codearith(fs, OP_CONCAT, e1, e2);
+ }
+ break;
+ }
+ case OPR_ADD: codearith(fs, OP_ADD, e1, e2); break;
+ case OPR_SUB: codearith(fs, OP_SUB, e1, e2); break;
+ case OPR_MUL: codearith(fs, OP_MUL, e1, e2); break;
+ case OPR_DIV: codearith(fs, OP_DIV, e1, e2); break;
+ case OPR_MOD: codearith(fs, OP_MOD, e1, e2); break;
+ case OPR_POW: codearith(fs, OP_POW, e1, e2); break;
+ case OPR_EQ: codecomp(fs, OP_EQ, 1, e1, e2); break;
+ case OPR_NE: codecomp(fs, OP_EQ, 0, e1, e2); break;
+ case OPR_LT: codecomp(fs, OP_LT, 1, e1, e2); break;
+ case OPR_LE: codecomp(fs, OP_LE, 1, e1, e2); break;
+ case OPR_GT: codecomp(fs, OP_LT, 0, e1, e2); break;
+ case OPR_GE: codecomp(fs, OP_LE, 0, e1, e2); break;
+ default: lua_assert(0);
+ }
+}
+
+
+void luaK_fixline (FuncState *fs, int line) {
+ fs->f->lineinfo[fs->pc - 1] = line;
+}
+
+
+static int luaK_code (FuncState *fs, Instruction i, int line) {
+ Proto *f = fs->f;
+ 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);
+ lua_assert(getBMode(o) != OpArgN || b == 0);
+ lua_assert(getCMode(o) != OpArgN || c == 0);
+ 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);
+ lua_assert(getCMode(o) == OpArgN);
+ return luaK_code(fs, CREATE_ABx(o, a, bc), fs->ls->lastline);
+}
+
+
+void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) {
+ int c = (nelems - 1)/LFIELDS_PER_FLUSH + 1;
+ int b = (tostore == LUA_MULTRET) ? 0 : tostore;
+ lua_assert(tostore != 0);
+ if (c <= MAXARG_C)
+ luaK_codeABC(fs, OP_SETLIST, base, b, c);
+ else {
+ luaK_codeABC(fs, OP_SETLIST, base, b, 0);
+ luaK_code(fs, cast(Instruction, c), fs->ls->lastline);
+ }
+ fs->freereg = base + 1; /* free registers with list values */
+}
+
diff --git a/src/luajit/lcode.h b/src/luajit/lcode.h
new file mode 100644
index 0000000000..b941c60721
--- /dev/null
+++ b/src/luajit/lcode.h
@@ -0,0 +1,76 @@
+/*
+** $Id: lcode.h,v 1.48.1.1 2007/12/27 13:02:25 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_MUL, OPR_DIV, OPR_MOD, OPR_POW,
+ OPR_CONCAT,
+ OPR_NE, OPR_EQ,
+ OPR_LT, OPR_LE, OPR_GT, OPR_GE,
+ OPR_AND, OPR_OR,
+ OPR_NOBINOPR
+} BinOpr;
+
+
+typedef enum UnOpr { OPR_MINUS, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr;
+
+
+#define getcode(fs,e) ((fs)->f->code[(e)->u.s.info])
+
+#define luaK_codeAsBx(fs,o,A,sBx) luaK_codeABx(fs,o,A,(sBx)+MAXARG_sBx)
+
+#define luaK_setmultret(fs,e) luaK_setreturns(fs, e, LUA_MULTRET)
+
+LUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned int Bx);
+LUAI_FUNC int luaK_codeABC (FuncState *fs, OpCode o, int A, int B, int C);
+LUAI_FUNC void luaK_fixline (FuncState *fs, int line);
+LUAI_FUNC void luaK_nil (FuncState *fs, int from, int n);
+LUAI_FUNC void luaK_reserveregs (FuncState *fs, int n);
+LUAI_FUNC void luaK_checkstack (FuncState *fs, int n);
+LUAI_FUNC int luaK_stringK (FuncState *fs, TString *s);
+LUAI_FUNC int luaK_numberK (FuncState *fs, lua_Number r);
+LUAI_FUNC void luaK_dischargevars (FuncState *fs, expdesc *e);
+LUAI_FUNC int luaK_exp2anyreg (FuncState *fs, expdesc *e);
+LUAI_FUNC void luaK_exp2nextreg (FuncState *fs, expdesc *e);
+LUAI_FUNC void luaK_exp2val (FuncState *fs, expdesc *e);
+LUAI_FUNC int luaK_exp2RK (FuncState *fs, expdesc *e);
+LUAI_FUNC void luaK_self (FuncState *fs, expdesc *e, expdesc *key);
+LUAI_FUNC void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k);
+LUAI_FUNC void luaK_goiftrue (FuncState *fs, expdesc *e);
+LUAI_FUNC void luaK_storevar (FuncState *fs, expdesc *var, expdesc *e);
+LUAI_FUNC void luaK_setreturns (FuncState *fs, expdesc *e, int nresults);
+LUAI_FUNC void luaK_setoneret (FuncState *fs, expdesc *e);
+LUAI_FUNC int luaK_jump (FuncState *fs);
+LUAI_FUNC void luaK_ret (FuncState *fs, int first, int nret);
+LUAI_FUNC void luaK_patchlist (FuncState *fs, int list, int target);
+LUAI_FUNC void luaK_patchtohere (FuncState *fs, int list);
+LUAI_FUNC void luaK_concat (FuncState *fs, int *l1, int l2);
+LUAI_FUNC int luaK_getlabel (FuncState *fs);
+LUAI_FUNC void luaK_prefix (FuncState *fs, UnOpr op, expdesc *v);
+LUAI_FUNC void luaK_infix (FuncState *fs, BinOpr op, expdesc *v);
+LUAI_FUNC void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, expdesc *v2);
+LUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore);
+
+
+#endif
diff --git a/src/luajit/ldblib.c b/src/luajit/ldblib.c
new file mode 100644
index 0000000000..67de1222a9
--- /dev/null
+++ b/src/luajit/ldblib.c
@@ -0,0 +1,397 @@
+/*
+** $Id: ldblib.c,v 1.104.1.3 2008/01/21 13:11:21 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
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+
+static int db_getregistry (lua_State *L) {
+ lua_pushvalue(L, LUA_REGISTRYINDEX);
+ return 1;
+}
+
+
+static int db_getmetatable (lua_State *L) {
+ luaL_checkany(L, 1);
+ if (!lua_getmetatable(L, 1)) {
+ lua_pushnil(L); /* no metatable */
+ }
+ return 1;
+}
+
+
+static int db_setmetatable (lua_State *L) {
+ int t = lua_type(L, 2);
+ luaL_argcheck(L, t == LUA_TNIL || t == LUA_TTABLE, 2,
+ "nil or table expected");
+ lua_settop(L, 2);
+ lua_pushboolean(L, lua_setmetatable(L, 1));
+ return 1;
+}
+
+
+static int db_getfenv (lua_State *L) {
+ lua_getfenv(L, 1);
+ return 1;
+}
+
+
+static int db_setfenv (lua_State *L) {
+ luaL_checktype(L, 2, LUA_TTABLE);
+ lua_settop(L, 2);
+ if (lua_setfenv(L, 1) == 0)
+ luaL_error(L, LUA_QL("setfenv")
+ " cannot change environment of given object");
+ return 1;
+}
+
+
+static void settabss (lua_State *L, const char *i, const char *v) {
+ lua_pushstring(L, v);
+ lua_setfield(L, -2, i);
+}
+
+
+static void settabsi (lua_State *L, const char *i, int v) {
+ lua_pushinteger(L, v);
+ lua_setfield(L, -2, i);
+}
+
+
+static lua_State *getthread (lua_State *L, int *arg) {
+ if (lua_isthread(L, 1)) {
+ *arg = 1;
+ return lua_tothread(L, 1);
+ }
+ else {
+ *arg = 0;
+ return L;
+ }
+}
+
+
+static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) {
+ if (L == L1) {
+ lua_pushvalue(L, -2);
+ lua_remove(L, -3);
+ }
+ else
+ lua_xmove(L1, L, 1);
+ lua_setfield(L, -2, fname);
+}
+
+
+static int db_getinfo (lua_State *L) {
+ lua_Debug ar;
+ int arg;
+ lua_State *L1 = getthread(L, &arg);
+ const char *options = luaL_optstring(L, arg+2, "flnSu");
+ if (lua_isnumber(L, arg+1)) {
+ if (!lua_getstack(L1, (int)lua_tointeger(L, arg+1), &ar)) {
+ lua_pushnil(L); /* level out of range */
+ return 1;
+ }
+ }
+ else if (lua_isfunction(L, arg+1)) {
+ lua_pushfstring(L, ">%s", options);
+ options = lua_tostring(L, -1);
+ lua_pushvalue(L, arg+1);
+ lua_xmove(L, L1, 1);
+ }
+ else
+ return luaL_argerror(L, arg+1, "function or level expected");
+ if (!lua_getinfo(L1, options, &ar))
+ return luaL_argerror(L, arg+2, "invalid option");
+ lua_createtable(L, 0, 2);
+ if (strchr(options, 'S')) {
+ settabss(L, "source", ar.source);
+ settabss(L, "short_src", ar.short_src);
+ settabsi(L, "linedefined", ar.linedefined);
+ settabsi(L, "lastlinedefined", ar.lastlinedefined);
+ settabss(L, "what", ar.what);
+ }
+ if (strchr(options, 'l'))
+ settabsi(L, "currentline", ar.currentline);
+ if (strchr(options, 'u'))
+ settabsi(L, "nups", ar.nups);
+ if (strchr(options, 'n')) {
+ settabss(L, "name", ar.name);
+ settabss(L, "namewhat", ar.namewhat);
+ }
+ if (strchr(options, 'L'))
+ treatstackoption(L, L1, "activelines");
+ if (strchr(options, 'f'))
+ treatstackoption(L, L1, "func");
+ return 1; /* return table */
+}
+
+
+static int db_getlocal (lua_State *L) {
+ int arg;
+ lua_State *L1 = getthread(L, &arg);
+ lua_Debug ar;
+ const char *name;
+ if (!lua_getstack(L1, luaL_checkint(L, arg+1), &ar)) /* out of range? */
+ return luaL_argerror(L, arg+1, "level out of range");
+ name = lua_getlocal(L1, &ar, luaL_checkint(L, arg+2));
+ if (name) {
+ lua_xmove(L1, L, 1);
+ lua_pushstring(L, name);
+ lua_pushvalue(L, -2);
+ return 2;
+ }
+ else {
+ lua_pushnil(L);
+ return 1;
+ }
+}
+
+
+static int db_setlocal (lua_State *L) {
+ int arg;
+ lua_State *L1 = getthread(L, &arg);
+ lua_Debug ar;
+ if (!lua_getstack(L1, luaL_checkint(L, arg+1), &ar)) /* out of range? */
+ return luaL_argerror(L, arg+1, "level out of range");
+ luaL_checkany(L, arg+3);
+ lua_settop(L, arg+3);
+ lua_xmove(L, L1, 1);
+ lua_pushstring(L, lua_setlocal(L1, &ar, luaL_checkint(L, arg+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 db_getupvalue (lua_State *L) {
+ return auxupvalue(L, 1);
+}
+
+
+static int db_setupvalue (lua_State *L) {
+ luaL_checkany(L, 3);
+ return auxupvalue(L, 0);
+}
+
+
+
+static 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);
+ lua_pushlightuserdata(L, L);
+ lua_rawget(L, -2);
+ if (lua_isfunction(L, -1)) {
+ lua_pushstring(L, hooknames[(int)ar->event]);
+ if (ar->currentline >= 0)
+ lua_pushinteger(L, ar->currentline);
+ else lua_pushnil(L);
+ lua_assert(lua_getinfo(L, "lS", ar));
+ lua_call(L, 2, 0);
+ }
+}
+
+
+static int makemask (const char *smask, int count) {
+ int mask = 0;
+ if (strchr(smask, 'c')) mask |= LUA_MASKCALL;
+ if (strchr(smask, 'r')) mask |= LUA_MASKRET;
+ if (strchr(smask, 'l')) mask |= LUA_MASKLINE;
+ if (count > 0) mask |= LUA_MASKCOUNT;
+ return mask;
+}
+
+
+static char *unmakemask (int mask, char *smask) {
+ int i = 0;
+ if (mask & LUA_MASKCALL) smask[i++] = 'c';
+ if (mask & LUA_MASKRET) smask[i++] = 'r';
+ if (mask & LUA_MASKLINE) smask[i++] = 'l';
+ smask[i] = '\0';
+ return smask;
+}
+
+
+static void gethooktable (lua_State *L) {
+ lua_pushlightuserdata(L, (void *)&KEY_HOOK);
+ lua_rawget(L, LUA_REGISTRYINDEX);
+ if (!lua_istable(L, -1)) {
+ lua_pop(L, 1);
+ lua_createtable(L, 0, 1);
+ lua_pushlightuserdata(L, (void *)&KEY_HOOK);
+ lua_pushvalue(L, -2);
+ lua_rawset(L, LUA_REGISTRYINDEX);
+ }
+}
+
+
+static int db_sethook (lua_State *L) {
+ int arg, mask, count;
+ lua_Hook func;
+ lua_State *L1 = getthread(L, &arg);
+ if (lua_isnoneornil(L, arg+1)) {
+ lua_settop(L, arg+1);
+ func = NULL; mask = 0; count = 0; /* turn off hooks */
+ }
+ else {
+ const char *smask = luaL_checkstring(L, arg+2);
+ luaL_checktype(L, arg+1, LUA_TFUNCTION);
+ count = luaL_optint(L, arg+3, 0);
+ func = hookf; mask = makemask(smask, count);
+ }
+ gethooktable(L);
+ lua_pushlightuserdata(L, L1);
+ lua_pushvalue(L, arg+1);
+ lua_rawset(L, -3); /* set new hook */
+ lua_pop(L, 1); /* remove hook table */
+ lua_sethook(L1, func, mask, count); /* set hooks */
+ return 0;
+}
+
+
+static int db_gethook (lua_State *L) {
+ int arg;
+ lua_State *L1 = getthread(L, &arg);
+ char buff[5];
+ int mask = lua_gethookmask(L1);
+ lua_Hook hook = lua_gethook(L1);
+ if (hook != NULL && hook != hookf) /* external hook? */
+ lua_pushliteral(L, "external hook");
+ else {
+ gethooktable(L);
+ lua_pushlightuserdata(L, L1);
+ lua_rawget(L, -2); /* get hook */
+ lua_remove(L, -2); /* remove hook table */
+ }
+ lua_pushstring(L, unmakemask(mask, buff));
+ lua_pushinteger(L, lua_gethookcount(L1));
+ return 3;
+}
+
+
+static int db_debug (lua_State *L) {
+ for (;;) {
+ char buffer[250];
+ fputs("lua_debug> ", stderr);
+ if (fgets(buffer, sizeof(buffer), stdin) == 0 ||
+ strcmp(buffer, "cont\n") == 0)
+ return 0;
+ if (luaL_loadbuffer(L, buffer, strlen(buffer), "=(debug command)") ||
+ lua_pcall(L, 0, 0, 0)) {
+ fputs(lua_tostring(L, -1), stderr);
+ fputs("\n", stderr);
+ }
+ 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 db_errorfb (lua_State *L) {
+ int level;
+ int firstpart = 1; /* still before eventual `...' */
+ int arg;
+ lua_State *L1 = getthread(L, &arg);
+ lua_Debug ar;
+ if (lua_isnumber(L, arg+2)) {
+ level = (int)lua_tointeger(L, arg+2);
+ lua_pop(L, 1);
+ }
+ else
+ level = (L == L1) ? 1 : 0; /* level 0 may be this own function */
+ if (lua_gettop(L) == arg)
+ lua_pushliteral(L, "");
+ else if (!lua_isstring(L, arg+1)) return 1; /* message is not a string */
+ else lua_pushliteral(L, "\n");
+ lua_pushliteral(L, "stack traceback:");
+ while (lua_getstack(L1, level++, &ar)) {
+ if (level > LEVELS1 && firstpart) {
+ /* no more than `LEVELS2' more levels? */
+ if (!lua_getstack(L1, level+LEVELS2, &ar))
+ level--; /* keep going */
+ else {
+ lua_pushliteral(L, "\n\t..."); /* too many levels */
+ while (lua_getstack(L1, level+LEVELS2, &ar)) /* find last levels */
+ level++;
+ }
+ firstpart = 0;
+ continue;
+ }
+ lua_pushliteral(L, "\n\t");
+ lua_getinfo(L1, "Snl", &ar);
+ lua_pushfstring(L, "%s:", ar.short_src);
+ if (ar.currentline > 0)
+ lua_pushfstring(L, "%d:", ar.currentline);
+ if (*ar.namewhat != '\0') /* is there a name? */
+ lua_pushfstring(L, " in function " LUA_QS, ar.name);
+ else {
+ 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) - arg);
+ }
+ lua_concat(L, lua_gettop(L) - arg);
+ return 1;
+}
+
+
+static const luaL_Reg dblib[] = {
+ {"debug", db_debug},
+ {"getfenv", db_getfenv},
+ {"gethook", db_gethook},
+ {"getinfo", db_getinfo},
+ {"getlocal", db_getlocal},
+ {"getregistry", db_getregistry},
+ {"getmetatable", db_getmetatable},
+ {"getupvalue", db_getupvalue},
+ {"setfenv", db_setfenv},
+ {"sethook", db_sethook},
+ {"setlocal", db_setlocal},
+ {"setmetatable", db_setmetatable},
+ {"setupvalue", db_setupvalue},
+ {"traceback", db_errorfb},
+ {NULL, NULL}
+};
+
+
+LUALIB_API int luaopen_debug (lua_State *L) {
+ luaL_register(L, LUA_DBLIBNAME, dblib);
+ return 1;
+}
+
diff --git a/src/luajit/ldebug.c b/src/luajit/ldebug.c
new file mode 100644
index 0000000000..89891fdcf1
--- /dev/null
+++ b/src/luajit/ldebug.c
@@ -0,0 +1,640 @@
+/*
+** $Id: ldebug.c,v 2.29.1.6 2008/05/08 16:56:26 roberto Exp $
+** Debug Interface
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdarg.h>
+#include <stddef.h>
+#include <string.h>
+
+
+#define ldebug_c
+#define LUA_CORE
+
+#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"
+#include "ljit.h"
+
+
+
+static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name);
+
+
+static int currentpc (lua_State *L, CallInfo *ci) {
+ if (isLua(ci)) /* must be a Lua function to get current PC */
+ return luaJIT_findpc(ci_func(ci)->l.p,
+ ci==L->ci ? L->savedpc : ci->savedpc);
+ else
+ return -1;
+}
+
+
+static int currentline (lua_State *L, CallInfo *ci) {
+ int pc = currentpc(L, ci);
+ if (pc < 0)
+ return -1; /* only active lua functions have current-line information */
+ else
+ return getline(ci_func(ci)->l.p, pc);
+}
+
+
+/*
+** 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_byte(mask);
+ 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 (f_isLua(ci)) /* Lua function? */
+ level -= ci->tailcalls; /* skip lost tail calls */
+ }
+ if (level == 0 && ci > L->base_ci) { /* level found? */
+ status = 1;
+ ar->i_ci = cast_int(ci - L->base_ci);
+ }
+ else if (level < 0) { /* level is of a lost tail call? */
+ status = 1;
+ ar->i_ci = 0;
+ }
+ else status = 0; /* no such level */
+ lua_unlock(L);
+ return status;
+}
+
+
+static Proto *getluaproto (CallInfo *ci) {
+ return (isLua(ci) ? ci_func(ci)->l.p : NULL);
+}
+
+
+static const char *findlocal (lua_State *L, CallInfo *ci, int n) {
+ const char *name;
+ Proto *fp = getluaproto(ci);
+ if (fp && (name = luaF_getlocalname(fp, n, currentpc(L, ci))) != NULL)
+ return name; /* is a local variable in a Lua function */
+ else {
+ StkId limit = (ci == L->ci) ? L->top : (ci+1)->func;
+ if (limit - ci->base >= n && n > 0) /* is 'n' inside 'ci' stack? */
+ return "(*temporary)";
+ else
+ return NULL;
+ }
+}
+
+
+LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) {
+ CallInfo *ci = L->base_ci + ar->i_ci;
+ const char *name = findlocal(L, ci, n);
+ lua_lock(L);
+ if (name)
+ luaA_pushobject(L, ci->base + (n - 1));
+ lua_unlock(L);
+ return name;
+}
+
+
+LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) {
+ CallInfo *ci = L->base_ci + ar->i_ci;
+ const char *name = findlocal(L, ci, n);
+ lua_lock(L);
+ if (name)
+ setobjs2s(L, ci->base + (n - 1), L->top - 1);
+ L->top--; /* pop value */
+ lua_unlock(L);
+ return name;
+}
+
+
+static void funcinfo (lua_Debug *ar, Closure *cl) {
+ if (cl->c.isC) {
+ ar->source = "=[C]";
+ ar->linedefined = -1;
+ ar->lastlinedefined = -1;
+ ar->what = "C";
+ }
+ else {
+ ar->source = getstr(cl->l.p->source);
+ ar->linedefined = cl->l.p->linedefined;
+ ar->lastlinedefined = cl->l.p->lastlinedefined;
+ ar->what = (ar->linedefined == 0) ? "main" : "Lua";
+ }
+ luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);
+}
+
+
+static void info_tailcall (lua_Debug *ar) {
+ ar->name = ar->namewhat = "";
+ ar->what = "tail";
+ ar->lastlinedefined = ar->linedefined = ar->currentline = -1;
+ ar->source = "=(tail call)";
+ luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);
+ ar->nups = 0;
+}
+
+
+static void collectvalidlines (lua_State *L, Closure *f) {
+ if (f == NULL || f->c.isC) {
+ setnilvalue(L->top);
+ }
+ else {
+ Table *t = luaH_new(L, 0, 0);
+ int *lineinfo = f->l.p->lineinfo;
+ int i;
+ for (i=0; i<f->l.p->sizelineinfo; i++)
+ setbvalue(luaH_setnum(L, t, lineinfo[i]), 1);
+ sethvalue(L, L->top, t);
+ }
+ incr_top(L);
+}
+
+
+static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar,
+ Closure *f, CallInfo *ci) {
+ int status = 1;
+ if (f == NULL) {
+ info_tailcall(ar);
+ return status;
+ }
+ for (; *what; what++) {
+ switch (*what) {
+ case 'S': {
+ funcinfo(ar, f);
+ break;
+ }
+ case 'l': {
+ ar->currentline = (ci) ? currentline(L, ci) : -1;
+ break;
+ }
+ case 'u': {
+ ar->nups = f->c.nupvalues;
+ break;
+ }
+ case 'n': {
+ ar->namewhat = (ci) ? getfuncname(L, ci, &ar->name) : NULL;
+ if (ar->namewhat == NULL) {
+ ar->namewhat = ""; /* not found */
+ ar->name = NULL;
+ }
+ break;
+ }
+ case 'L':
+ case 'f': /* handled by lua_getinfo */
+ break;
+ default: status = 0; /* invalid option */
+ }
+ }
+ return status;
+}
+
+
+LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) {
+ int status;
+ Closure *f = NULL;
+ CallInfo *ci = NULL;
+ lua_lock(L);
+ if (*what == '>') {
+ StkId func = L->top - 1;
+ luai_apicheck(L, ttisfunction(func));
+ what++; /* skip the '>' */
+ f = clvalue(func);
+ L->top--; /* pop function */
+ }
+ else if (ar->i_ci != 0) { /* no tail call? */
+ ci = L->base_ci + ar->i_ci;
+ lua_assert(ttisfunction(ci->func));
+ f = clvalue(ci->func);
+ }
+ status = auxgetinfo(L, what, ar, f, ci);
+ if (strchr(what, 'f')) {
+ if (f == NULL) setnilvalue(L->top);
+ else setclvalue(L, L->top, f);
+ incr_top(L);
+ }
+ if (strchr(what, 'L'))
+ collectvalidlines(L, f);
+ 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->numparams+(pt->is_vararg & VARARG_HASARG) <= pt->maxstacksize);
+ check(!(pt->is_vararg & VARARG_NEEDSARG) ||
+ (pt->is_vararg & VARARG_HASARG));
+ check(pt->sizeupvalues <= pt->nups);
+ check(pt->sizelineinfo == pt->sizecode || pt->sizelineinfo == 0);
+ check(pt->sizecode > 0 && GET_OPCODE(pt->code[pt->sizecode-1]) == OP_RETURN);
+ return 1;
+}
+
+
+#define checkopenop(pt,pc) luaG_checkopenop((pt)->code[(pc)+1])
+
+int luaG_checkopenop (Instruction i) {
+ switch (GET_OPCODE(i)) {
+ case OP_CALL:
+ case OP_TAILCALL:
+ case OP_RETURN:
+ case OP_SETLIST: {
+ check(GETARG_B(i) == 0);
+ return 1;
+ }
+ default: return 0; /* invalid instruction after an open call */
+ }
+}
+
+
+static int checkArgMode (const Proto *pt, int r, enum OpArgMask mode) {
+ switch (mode) {
+ case OpArgN: check(r == 0); break;
+ case OpArgU: break;
+ case OpArgR: checkreg(pt, r); break;
+ case OpArgK:
+ check(ISK(r) ? INDEXK(r) < pt->sizek : r < pt->maxstacksize);
+ break;
+ }
+ return 1;
+}
+
+
+static Instruction 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++) {
+ Instruction i = pt->code[pc];
+ OpCode op = GET_OPCODE(i);
+ int a = GETARG_A(i);
+ int b = 0;
+ int c = 0;
+ check(op < NUM_OPCODES);
+ checkreg(pt, a);
+ switch (getOpMode(op)) {
+ case iABC: {
+ b = GETARG_B(i);
+ c = GETARG_C(i);
+ check(checkArgMode(pt, b, getBMode(op)));
+ check(checkArgMode(pt, c, getCMode(op)));
+ break;
+ }
+ case iABx: {
+ b = GETARG_Bx(i);
+ if (getBMode(op) == OpArgK) check(b < pt->sizek);
+ break;
+ }
+ case iAsBx: {
+ b = GETARG_sBx(i);
+ if (getBMode(op) == OpArgR) {
+ int dest = pc+1+b;
+ check(0 <= dest && dest < pt->sizecode);
+ if (dest > 0) {
+ int j;
+ /* check that it does not jump to a setlist count; this
+ is tricky, because the count from a previous setlist may
+ have the same value of an invalid setlist; so, we must
+ go all the way back to the first of them (if any) */
+ for (j = 0; j < dest; j++) {
+ Instruction d = pt->code[dest-1-j];
+ if (!(GET_OPCODE(d) == OP_SETLIST && GETARG_C(d) == 0)) break;
+ }
+ /* if 'j' is even, previous value is not a setlist (even if
+ it looks like one) */
+ check((j&1) == 0);
+ }
+ }
+ break;
+ }
+ }
+ if (testAMode(op)) {
+ if (a == reg) last = pc; /* change register `a' */
+ }
+ if (testTMode(op)) {
+ check(pc+2 < pt->sizecode); /* check skip */
+ check(GET_OPCODE(pt->code[pc+1]) == OP_JMP);
+ }
+ switch (op) {
+ case OP_LOADBOOL: {
+ if (c == 1) { /* does it jump? */
+ check(pc+2 < pt->sizecode); /* check its jump */
+ check(GET_OPCODE(pt->code[pc+1]) != OP_SETLIST ||
+ GETARG_C(pt->code[pc+1]) != 0);
+ }
+ 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: {
+ check(b < c); /* at least two operands */
+ break;
+ }
+ case OP_TFORLOOP: {
+ check(c >= 1); /* at least one result (control variable) */
+ checkreg(pt, a+2+c); /* space for results */
+ if (reg >= a+2) last = pc; /* affect all regs above its base */
+ break;
+ }
+ case OP_FORLOOP:
+ case OP_FORPREP:
+ checkreg(pt, a+3);
+ /* go through */
+ case OP_JMP: {
+ int dest = pc+1+b;
+ /* 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: {
+ if (b > 0) checkreg(pt, a + b);
+ if (c == 0) {
+ pc++;
+ check(pc < pt->sizecode - 1);
+ }
+ break;
+ }
+ case OP_CLOSURE: {
+ int nup, j;
+ check(b < pt->sizep);
+ nup = pt->p[b]->nups;
+ check(pc + nup < pt->sizecode);
+ for (j = 1; j <= nup; j++) {
+ OpCode op1 = GET_OPCODE(pt->code[pc + j]);
+ check(op1 == OP_GETUPVAL || op1 == OP_MOVE);
+ }
+ if (reg != NO_REG) /* tracing? */
+ pc += nup; /* do not 'execute' these pseudo-instructions */
+ break;
+ }
+ case OP_VARARG: {
+ check((pt->is_vararg & VARARG_ISVARARG) &&
+ !(pt->is_vararg & VARARG_NEEDSARG));
+ b--;
+ if (b == LUA_MULTRET) check(checkopenop(pt, pc));
+ checkreg(pt, a+b-1);
+ break;
+ }
+ default: break;
+ }
+ }
+ return pt->code[last];
+}
+
+#undef check
+#undef checkjump
+#undef checkreg
+
+/* }====================================================== */
+
+
+int luaG_checkcode (const Proto *pt) {
+ return (symbexec(pt, pt->sizecode, NO_REG) != 0);
+}
+
+
+static const char *kname (Proto *p, int c) {
+ if (ISK(c) && ttisstring(&p->k[INDEXK(c)]))
+ return svalue(&p->k[INDEXK(c)]);
+ else
+ return "?";
+}
+
+
+static const char *getobjname (lua_State *L, CallInfo *ci, int stackpos,
+ const char **name) {
+ if (isLua(ci)) { /* a Lua function? */
+ Proto *p = ci_func(ci)->l.p;
+ int pc = currentpc(L, ci);
+ Instruction i;
+ *name = luaF_getlocalname(p, stackpos+1, pc);
+ if (*name) /* is a local? */
+ return "local";
+ i = 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(L, 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_GETUPVAL: {
+ int u = GETARG_B(i); /* upvalue index */
+ *name = p->upvalues ? getstr(p->upvalues[u]) : "?";
+ return "upvalue";
+ }
+ 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 (lua_State *L, CallInfo *ci, const char **name) {
+ Instruction i;
+ if ((isLua(ci) && ci->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(L, ci)];
+ if (GET_OPCODE(i) == OP_CALL || GET_OPCODE(i) == OP_TAILCALL ||
+ GET_OPCODE(i) == OP_TFORLOOP)
+ return getobjname(L, 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 TValue *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 TValue *o, const char *op) {
+ const char *name = NULL;
+ const char *t = luaT_typenames[ttype(o)];
+ const char *kind = (isinstack(L->ci, o)) ?
+ getobjname(L, L->ci, cast_int(o - L->base), &name) :
+ NULL;
+ if (kind)
+ luaG_runerror(L, "attempt to %s %s " LUA_QS " (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) || ttisnumber(p1)) p1 = p2;
+ lua_assert(!ttisstring(p1) && !ttisnumber(p1));
+ luaG_typeerror(L, p1, "concatenate");
+}
+
+
+void luaG_aritherror (lua_State *L, const TValue *p1, const TValue *p2) {
+ TValue 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 TValue *p1, const TValue *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(L, 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, L->top, L->top - 1); /* move argument */
+ setobjs2s(L, 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);
+}
+
diff --git a/src/luajit/ldebug.h b/src/luajit/ldebug.h
new file mode 100644
index 0000000000..ba28a97248
--- /dev/null
+++ b/src/luajit/ldebug.h
@@ -0,0 +1,33 @@
+/*
+** $Id: ldebug.h,v 2.3.1.1 2007/12/27 13:02:25 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)
+
+
+LUAI_FUNC void luaG_typeerror (lua_State *L, const TValue *o,
+ const char *opname);
+LUAI_FUNC void luaG_concaterror (lua_State *L, StkId p1, StkId p2);
+LUAI_FUNC void luaG_aritherror (lua_State *L, const TValue *p1,
+ const TValue *p2);
+LUAI_FUNC int luaG_ordererror (lua_State *L, const TValue *p1,
+ const TValue *p2);
+LUAI_FUNC void luaG_runerror (lua_State *L, const char *fmt, ...);
+LUAI_FUNC void luaG_errormsg (lua_State *L);
+LUAI_FUNC int luaG_checkcode (const Proto *pt);
+LUAI_FUNC int luaG_checkopenop (Instruction i);
+
+#endif
diff --git a/src/luajit/ldo.c b/src/luajit/ldo.c
new file mode 100644
index 0000000000..1d9393d0cc
--- /dev/null
+++ b/src/luajit/ldo.c
@@ -0,0 +1,519 @@
+/*
+** $Id: ldo.c,v 2.38.1.3 2008/01/18 22:31:22 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
+#define LUA_CORE
+
+#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"
+#include "ljit.h"
+
+
+
+
+/*
+** {======================================================
+** Error-recovery functions
+** =======================================================
+*/
+
+
+/* chain list of long jump buffers */
+struct lua_longjmp {
+ struct lua_longjmp *previous;
+ luai_jmpbuf b;
+ volatile int status; /* error code */
+};
+
+
+void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) {
+ switch (errcode) {
+ case LUA_ERRMEM: {
+ setsvalue2s(L, oldtop, luaS_newliteral(L, MEMERRMSG));
+ break;
+ }
+ case LUA_ERRERR: {
+ setsvalue2s(L, oldtop, luaS_newliteral(L, "error in error handling"));
+ break;
+ }
+ case LUA_ERRSYNTAX:
+ case LUA_ERRRUN: {
+ setobjs2s(L, oldtop, L->top - 1); /* error message on current top */
+ break;
+ }
+ }
+ L->top = oldtop + 1;
+}
+
+
+static void restore_stack_limit (lua_State *L) {
+ lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK - 1);
+ if (L->size_ci > LUAI_MAXCALLS) { /* there was an overflow? */
+ int inuse = cast_int(L->ci - L->base_ci);
+ if (inuse + 1 < LUAI_MAXCALLS) /* can `undo' overflow? */
+ luaD_reallocCI(L, LUAI_MAXCALLS);
+ }
+}
+
+
+static void resetstack (lua_State *L, int status) {
+ L->ci = L->base_ci;
+ L->base = L->ci->base;
+ luaF_close(L, L->base); /* close eventual pending closures */
+ luaD_seterrorobj(L, status, L->base);
+ L->nCcalls = 0;
+ L->allowhook = 1;
+ restore_stack_limit(L);
+ L->errfunc = 0;
+ L->errorJmp = NULL;
+}
+
+
+void luaD_throw (lua_State *L, int errcode) {
+ if (L->errorJmp) {
+ L->errorJmp->status = errcode;
+ LUAI_THROW(L, L->errorJmp);
+ }
+ else {
+ L->status = cast_byte(errcode);
+ if (G(L)->panic) {
+ resetstack(L, errcode);
+ lua_unlock(L);
+ 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;
+ LUAI_TRY(L, &lj,
+ (*f)(L, ud);
+ );
+ L->errorJmp = lj.previous; /* restore old error handler */
+ return lj.status;
+}
+
+/* }====================================================== */
+
+
+static void correctstack (lua_State *L, TValue *oldstack) {
+ CallInfo *ci;
+ GCObject *up;
+ L->top = (L->top - oldstack) + L->stack;
+ for (up = L->openupval; up != NULL; up = up->gch.next)
+ gco2uv(up)->v = (gco2uv(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;
+ ci->func = (ci->func - oldstack) + L->stack;
+ }
+ L->base = (L->base - oldstack) + L->stack;
+}
+
+
+void luaD_reallocstack (lua_State *L, int newsize) {
+ TValue *oldstack = L->stack;
+ int realsize = newsize + 1 + EXTRA_STACK;
+ lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK - 1);
+ luaM_reallocvector(L, L->stack, L->stacksize, realsize, TValue);
+ L->stacksize = realsize;
+ L->stack_last = L->stack+newsize;
+ 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 = newsize;
+ L->ci = (L->ci - oldci) + L->base_ci;
+ L->end_ci = L->base_ci + L->size_ci - 1;
+}
+
+
+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);
+}
+
+
+CallInfo *luaD_growCI (lua_State *L) {
+ if (L->size_ci > LUAI_MAXCALLS) /* overflow while handling overflow? */
+ luaD_throw(L, LUA_ERRERR);
+ else {
+ luaD_reallocCI(L, 2*L->size_ci);
+ if (L->size_ci > LUAI_MAXCALLS)
+ luaG_runerror(L, "stack overflow");
+ }
+ return ++L->ci;
+}
+
+
+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 = cast_int(L->ci - L->base_ci);
+ luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */
+ L->ci->top = L->top + LUA_MINSTACK;
+ lua_assert(L->ci->top <= L->stack_last);
+ 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 StkId adjust_varargs (lua_State *L, Proto *p, int actual) {
+ int i;
+ int nfixargs = p->numparams;
+ Table *htab = NULL;
+ StkId base, fixed;
+ for (; actual < nfixargs; ++actual)
+ setnilvalue(L->top++);
+#if defined(LUA_COMPAT_VARARG)
+ if (p->is_vararg & VARARG_NEEDSARG) { /* compat. with old-style vararg? */
+ int nvar = actual - nfixargs; /* number of extra arguments */
+ lua_assert(p->is_vararg & VARARG_HASARG);
+ luaC_checkGC(L);
+ htab = luaH_new(L, nvar, 1); /* create `arg' table */
+ for (i=0; i<nvar; i++) /* put extra arguments into `arg' table */
+ setobj2n(L, luaH_setnum(L, htab, i+1), L->top - nvar + i);
+ /* store counter in field `n' */
+ setnvalue(luaH_setstr(L, htab, luaS_newliteral(L, "n")), cast_num(nvar));
+ }
+#endif
+ /* move fixed parameters to final position */
+ fixed = L->top - actual; /* first fixed argument */
+ base = L->top; /* final position of first argument */
+ for (i=0; i<nfixargs; i++) {
+ setobjs2s(L, L->top++, fixed+i);
+ setnilvalue(fixed+i);
+ }
+ /* add `arg' parameter */
+ if (htab) {
+ sethvalue(L, L->top++, htab);
+ lua_assert(iswhite(obj2gco(htab)));
+ }
+ return base;
+}
+
+
+StkId luaD_tryfuncTM (lua_State *L, StkId func) {
+ const TValue *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(L, p, p-1);
+ incr_top(L);
+ func = restorestack(L, funcr); /* previous call may change stack */
+ setobj2s(L, func, tm); /* tag method is the new function to be called */
+ return func;
+}
+
+
+
+#define inc_ci(L) \
+ ((L->ci == L->end_ci) ? luaD_growCI(L) : \
+ (condhardstacktests(luaD_reallocCI(L, L->size_ci)), ++L->ci))
+
+
+int luaD_precall (lua_State *L, StkId func, int nresults) {
+ LClosure *cl;
+ ptrdiff_t funcr;
+ if (!ttisfunction(func)) /* `func' is not a function? */
+ func = luaD_tryfuncTM(L, func); /* check the `function' tag method */
+ funcr = savestack(L, func);
+ cl = &clvalue(func)->l;
+ L->ci->savedpc = L->savedpc;
+ if (!cl->isC) { /* Lua function? prepare its call */
+ CallInfo *ci;
+ StkId st, base;
+ Proto *p = cl->p;
+ if (p->jit_status <= JIT_S_NONE) { /* JIT compiler enabled? */
+ if (p->jit_status == JIT_S_OK)
+ return G(L)->jit_gateLJ(L, func, nresults); /* Run compiled code. */
+ else
+ return luaJIT_run(L, func, nresults); /* Compile and run code. */
+ }
+ luaD_checkstack(L, p->maxstacksize);
+ func = restorestack(L, funcr);
+ if (!p->is_vararg) { /* no varargs? */
+ base = func + 1;
+ if (L->top > base + p->numparams)
+ L->top = base + p->numparams;
+ }
+ else { /* vararg function */
+ int nargs = cast_int(L->top - func) - 1;
+ base = adjust_varargs(L, p, nargs);
+ func = restorestack(L, funcr); /* previous call may change the stack */
+ }
+ ci = inc_ci(L); /* now `enter' new function */
+ ci->func = func;
+ L->base = ci->base = base;
+ ci->top = L->base + p->maxstacksize;
+ lua_assert(ci->top <= L->stack_last);
+ L->savedpc = p->code; /* starting point */
+ ci->tailcalls = 0;
+ ci->nresults = nresults;
+ for (st = L->top; st < ci->top; st++)
+ setnilvalue(st);
+ L->top = ci->top;
+ if (L->hookmask & LUA_MASKCALL) {
+ L->savedpc++; /* hooks assume 'pc' is already incremented */
+ luaD_callhook(L, LUA_HOOKCALL, -1);
+ L->savedpc--; /* correct 'pc' */
+ }
+ return PCRLUA;
+ }
+ else { /* if is a C function, call it */
+ CallInfo *ci;
+ int n;
+ luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */
+ ci = inc_ci(L); /* now `enter' new function */
+ ci->func = restorestack(L, funcr);
+ L->base = ci->base = ci->func + 1;
+ ci->top = L->top + LUA_MINSTACK;
+ lua_assert(ci->top <= L->stack_last);
+ ci->nresults = nresults;
+ if (L->hookmask & LUA_MASKCALL)
+ luaD_callhook(L, LUA_HOOKCALL, -1);
+ lua_unlock(L);
+ n = (*curr_func(L)->c.f)(L); /* do the actual call */
+ lua_lock(L);
+ if (n < 0) /* yielding? */
+ return PCRYIELD;
+ else {
+ luaD_poscall(L, L->top - n);
+ return PCRC;
+ }
+ }
+}
+
+
+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 (f_isLua(L->ci)) { /* Lua function? */
+ while ((L->hookmask & LUA_MASKRET) && L->ci->tailcalls--) /* tail calls */
+ luaD_callhook(L, LUA_HOOKTAILRET, -1);
+ }
+ return restorestack(L, fr);
+}
+
+
+int luaD_poscall (lua_State *L, StkId firstResult) {
+ StkId res;
+ int wanted, i;
+ CallInfo *ci;
+ if (L->hookmask & LUA_MASKRET)
+ firstResult = callrethooks(L, firstResult);
+ ci = L->ci--;
+ res = ci->func; /* res == final position of 1st result */
+ wanted = ci->nresults;
+ L->base = (ci - 1)->base; /* restore base */
+ L->savedpc = (ci - 1)->savedpc; /* restore savedpc */
+ /* move results to correct place */
+ for (i = wanted; i != 0 && firstResult < L->top; i--)
+ setobjs2s(L, res++, firstResult++);
+ while (i-- > 0)
+ setnilvalue(res++);
+ L->top = res;
+ return (wanted - LUA_MULTRET); /* 0 iff wanted == LUA_MULTRET */
+}
+
+
+/*
+** Call a function (C or Lua). The function to be called is at *func.
+** The arguments are on the stack, right after the function.
+** When returns, all the results are on the stack, starting at the original
+** function position.
+*/
+void luaD_call (lua_State *L, StkId func, int nResults) {
+ if (++L->nCcalls >= LUAI_MAXCCALLS) {
+ if (L->nCcalls == LUAI_MAXCCALLS)
+ luaG_runerror(L, "C stack overflow");
+ else if (L->nCcalls >= (LUAI_MAXCCALLS + (LUAI_MAXCCALLS>>3)))
+ luaD_throw(L, LUA_ERRERR); /* error while handing stack error */
+ }
+ if (luaD_precall(L, func, nResults) == PCRLUA) /* is a Lua function? */
+ luaV_execute(L, 1); /* call it */
+ L->nCcalls--;
+ luaC_checkGC(L);
+}
+
+
+static void resume (lua_State *L, void *ud) {
+ StkId firstArg = cast(StkId, ud);
+ CallInfo *ci = L->ci;
+ if (L->status == 0) { /* start coroutine? */
+ lua_assert(ci == L->base_ci && firstArg > L->base);
+ if (luaD_precall(L, firstArg - 1, LUA_MULTRET) != PCRLUA)
+ return;
+ }
+ else { /* resuming from previous yield */
+ lua_assert(L->status == LUA_YIELD);
+ L->status = 0;
+ if (!f_isLua(ci)) { /* `common' yield? */
+ /* finish interrupted execution of `OP_CALL' */
+ lua_assert(GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_CALL ||
+ GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_TAILCALL);
+ if (luaD_poscall(L, firstArg)) /* complete it... */
+ L->top = L->ci->top; /* and correct top if not multiple results */
+ }
+ else /* yielded inside a hook: just continue its execution */
+ L->base = L->ci->base;
+ }
+ luaV_execute(L, cast_int(L->ci - L->base_ci));
+}
+
+
+static int resume_error (lua_State *L, const char *msg) {
+ L->top = L->ci->base;
+ setsvalue2s(L, 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;
+ lua_lock(L);
+ if (L->status != LUA_YIELD && (L->status != 0 || L->ci != L->base_ci))
+ return resume_error(L, "cannot resume non-suspended coroutine");
+ luai_userstateresume(L, nargs);
+ lua_assert(L->errfunc == 0 && L->nCcalls == 0);
+ status = luaD_rawrunprotected(L, resume, L->top - nargs);
+ if (status != 0) { /* error? */
+ L->status = cast_byte(status); /* mark thread as `dead' */
+ luaD_seterrorobj(L, status, L->top);
+ L->ci->top = L->top;
+ }
+ else
+ status = L->status;
+ lua_unlock(L);
+ return status;
+}
+
+
+LUA_API int lua_yield (lua_State *L, int nresults) {
+ luai_userstateyield(L, nresults);
+ lua_lock(L);
+ if (L->nCcalls > 0)
+ luaG_runerror(L, "attempt to yield across metamethod/C-call boundary");
+ L->base = L->top - nresults; /* protect stack slots below */
+ L->status = LUA_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 */
+ luaD_seterrorobj(L, status, oldtop);
+ L->nCcalls = oldnCcalls;
+ L->ci = restoreci(L, old_ci);
+ L->base = L->ci->base;
+ L->savedpc = L->ci->savedpc;
+ 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 */
+ const char *name;
+};
+
+static void f_parser (lua_State *L, void *ud) {
+ int i;
+ Proto *tf;
+ Closure *cl;
+ struct SParser *p = cast(struct SParser *, ud);
+ int c = luaZ_lookahead(p->z);
+ luaC_checkGC(L);
+ tf = ((c == LUA_SIGNATURE[0]) ? luaU_undump : luaY_parser)(L, p->z,
+ &p->buff, p->name);
+ cl = luaF_newLclosure(L, tf->nups, hvalue(gt(L)));
+ cl->l.p = tf;
+ for (i = 0; i < tf->nups; i++) /* initialize eventual upvalues */
+ cl->l.upvals[i] = luaF_newupval(L);
+ setclvalue(L, L->top, cl);
+ incr_top(L);
+}
+
+
+int luaD_protectedparser (lua_State *L, ZIO *z, const char *name) {
+ struct SParser p;
+ int status;
+ p.z = z; p.name = name;
+ luaZ_initbuffer(L, &p.buff);
+ status = luaD_pcall(L, f_parser, &p, savestack(L, L->top), L->errfunc);
+ luaZ_freebuffer(L, &p.buff);
+ return status;
+}
+
+
diff --git a/src/luajit/ldo.h b/src/luajit/ldo.h
new file mode 100644
index 0000000000..63760f9cd1
--- /dev/null
+++ b/src/luajit/ldo.h
@@ -0,0 +1,59 @@
+/*
+** $Id: ldo.h,v 2.7.1.1 2007/12/27 13:02:25 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"
+
+
+#define luaD_checkstack(L,n) \
+ if ((char *)L->stack_last - (char *)L->top <= (n)*(int)sizeof(TValue)) \
+ luaD_growstack(L, n); \
+ else condhardstacktests(luaD_reallocstack(L, L->stacksize - EXTRA_STACK - 1));
+
+
+#define incr_top(L) {luaD_checkstack(L,1); L->top++;}
+
+#define savestack(L,p) ((char *)(p) - (char *)L->stack)
+#define restorestack(L,n) ((TValue *)((char *)L->stack + (n)))
+
+#define saveci(L,p) ((char *)(p) - (char *)L->base_ci)
+#define restoreci(L,n) ((CallInfo *)((char *)L->base_ci + (n)))
+
+
+/* results from luaD_precall */
+#define PCRLUA 0 /* initiated a call to a Lua function */
+#define PCRC 1 /* did a call to a C function */
+#define PCRYIELD 2 /* C function yielded */
+
+
+/* type of protected functions, to be ran by `runprotected' */
+typedef void (*Pfunc) (lua_State *L, void *ud);
+
+LUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name);
+LUAI_FUNC void luaD_callhook (lua_State *L, int event, int line);
+LUAI_FUNC StkId luaD_tryfuncTM (lua_State *L, StkId func);
+LUAI_FUNC int luaD_precall (lua_State *L, StkId func, int nresults);
+LUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults);
+LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u,
+ ptrdiff_t oldtop, ptrdiff_t ef);
+LUAI_FUNC int luaD_poscall (lua_State *L, StkId firstResult);
+LUAI_FUNC void luaD_reallocCI (lua_State *L, int newsize);
+LUAI_FUNC CallInfo *luaD_growCI (lua_State *L);
+LUAI_FUNC void luaD_reallocstack (lua_State *L, int newsize);
+LUAI_FUNC void luaD_growstack (lua_State *L, int n);
+
+LUAI_FUNC void luaD_throw (lua_State *L, int errcode);
+LUAI_FUNC int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud);
+
+LUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop);
+
+#endif
+
diff --git a/src/luajit/ldump.c b/src/luajit/ldump.c
new file mode 100644
index 0000000000..c9d3d4870f
--- /dev/null
+++ b/src/luajit/ldump.c
@@ -0,0 +1,164 @@
+/*
+** $Id: ldump.c,v 2.8.1.1 2007/12/27 13:02:25 roberto Exp $
+** save precompiled Lua chunks
+** See Copyright Notice in lua.h
+*/
+
+#include <stddef.h>
+
+#define ldump_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lobject.h"
+#include "lstate.h"
+#include "lundump.h"
+
+typedef struct {
+ lua_State* L;
+ lua_Writer writer;
+ void* data;
+ int strip;
+ int status;
+} DumpState;
+
+#define DumpMem(b,n,size,D) DumpBlock(b,(n)*(size),D)
+#define DumpVar(x,D) DumpMem(&x,1,sizeof(x),D)
+
+static void DumpBlock(const void* b, size_t size, DumpState* D)
+{
+ if (D->status==0)
+ {
+ lua_unlock(D->L);
+ D->status=(*D->writer)(D->L,b,size,D->data);
+ lua_lock(D->L);
+ }
+}
+
+static void DumpChar(int y, DumpState* D)
+{
+ char x=(char)y;
+ DumpVar(x,D);
+}
+
+static void DumpInt(int x, DumpState* D)
+{
+ DumpVar(x,D);
+}
+
+static void DumpNumber(lua_Number x, DumpState* D)
+{
+ DumpVar(x,D);
+}
+
+static void DumpVector(const void* b, int n, size_t size, DumpState* D)
+{
+ DumpInt(n,D);
+ DumpMem(b,n,size,D);
+}
+
+static void DumpString(const TString* s, DumpState* D)
+{
+ if (s==NULL || getstr(s)==NULL)
+ {
+ size_t size=0;
+ DumpVar(size,D);
+ }
+ else
+ {
+ size_t size=s->tsv.len+1; /* include trailing '\0' */
+ DumpVar(size,D);
+ DumpBlock(getstr(s),size,D);
+ }
+}
+
+#define DumpCode(f,D) DumpVector(f->code,f->sizecode,sizeof(Instruction),D)
+
+static void DumpFunction(const Proto* f, const TString* p, DumpState* D);
+
+static void DumpConstants(const Proto* f, DumpState* D)
+{
+ int i,n=f->sizek;
+ DumpInt(n,D);
+ for (i=0; i<n; i++)
+ {
+ const TValue* o=&f->k[i];
+ DumpChar(ttype(o),D);
+ switch (ttype(o))
+ {
+ case LUA_TNIL:
+ break;
+ case LUA_TBOOLEAN:
+ DumpChar(bvalue(o),D);
+ break;
+ case LUA_TNUMBER:
+ DumpNumber(nvalue(o),D);
+ break;
+ case LUA_TSTRING:
+ DumpString(rawtsvalue(o),D);
+ break;
+ default:
+ lua_assert(0); /* cannot happen */
+ break;
+ }
+ }
+ n=f->sizep;
+ DumpInt(n,D);
+ for (i=0; i<n; i++) DumpFunction(f->p[i],f->source,D);
+}
+
+static void DumpDebug(const Proto* f, DumpState* D)
+{
+ int i,n;
+ n= (D->strip) ? 0 : f->sizelineinfo;
+ DumpVector(f->lineinfo,n,sizeof(int),D);
+ n= (D->strip) ? 0 : f->sizelocvars;
+ DumpInt(n,D);
+ for (i=0; i<n; i++)
+ {
+ DumpString(f->locvars[i].varname,D);
+ DumpInt(f->locvars[i].startpc,D);
+ DumpInt(f->locvars[i].endpc,D);
+ }
+ n= (D->strip) ? 0 : f->sizeupvalues;
+ DumpInt(n,D);
+ for (i=0; i<n; i++) DumpString(f->upvalues[i],D);
+}
+
+static void DumpFunction(const Proto* f, const TString* p, DumpState* D)
+{
+ DumpString((f->source==p || D->strip) ? NULL : f->source,D);
+ DumpInt(f->linedefined,D);
+ DumpInt(f->lastlinedefined,D);
+ DumpChar(f->nups,D);
+ DumpChar(f->numparams,D);
+ DumpChar(f->is_vararg,D);
+ DumpChar(f->maxstacksize,D);
+ DumpCode(f,D);
+ DumpConstants(f,D);
+ DumpDebug(f,D);
+}
+
+static void DumpHeader(DumpState* D)
+{
+ char h[LUAC_HEADERSIZE];
+ luaU_header(h);
+ DumpBlock(h,LUAC_HEADERSIZE,D);
+}
+
+/*
+** dump Lua function as precompiled chunk
+*/
+int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip)
+{
+ DumpState D;
+ D.L=L;
+ D.writer=w;
+ D.data=data;
+ D.strip=strip;
+ D.status=0;
+ DumpHeader(&D);
+ DumpFunction(f,NULL,&D);
+ return D.status;
+}
diff --git a/src/luajit/lfunc.c b/src/luajit/lfunc.c
new file mode 100644
index 0000000000..334e305bab
--- /dev/null
+++ b/src/luajit/lfunc.c
@@ -0,0 +1,182 @@
+/*
+** $Id: lfunc.c,v 2.12.1.2 2007/12/28 14:58:43 roberto Exp $
+** Auxiliary functions to manipulate prototypes and closures
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stddef.h>
+
+#define lfunc_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lfunc.h"
+#include "lgc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+#include "ljit.h"
+
+
+
+Closure *luaF_newCclosure (lua_State *L, int nelems, Table *e) {
+ Closure *c = cast(Closure *, luaM_malloc(L, sizeCclosure(nelems)));
+ luaC_link(L, obj2gco(c), LUA_TFUNCTION);
+ c->c.isC = 1;
+ c->c.env = e;
+ c->c.nupvalues = cast_byte(nelems);
+ c->c.jit_gate = G(L)->jit_gateJC;
+ return c;
+}
+
+
+Closure *luaF_newLclosure (lua_State *L, int nelems, Table *e) {
+ Closure *c = cast(Closure *, luaM_malloc(L, sizeLclosure(nelems)));
+ luaC_link(L, obj2gco(c), LUA_TFUNCTION);
+ c->l.isC = 0;
+ c->l.env = e;
+ c->l.jit_gate = G(L)->jit_gateJL;
+ c->l.nupvalues = cast_byte(nelems);
+ while (nelems--) c->l.upvals[nelems] = NULL;
+ return c;
+}
+
+
+UpVal *luaF_newupval (lua_State *L) {
+ UpVal *uv = luaM_new(L, UpVal);
+ luaC_link(L, obj2gco(uv), LUA_TUPVAL);
+ uv->v = &uv->u.value;
+ setnilvalue(uv->v);
+ return uv;
+}
+
+
+UpVal *luaF_findupval (lua_State *L, StkId level) {
+ global_State *g = G(L);
+ GCObject **pp = &L->openupval;
+ UpVal *p;
+ UpVal *uv;
+ while (*pp != NULL && (p = ngcotouv(*pp))->v >= level) {
+ lua_assert(p->v != &p->u.value);
+ if (p->v == level) { /* found a corresponding upvalue? */
+ if (isdead(g, obj2gco(p))) /* is it dead? */
+ changewhite(obj2gco(p)); /* ressurect it */
+ return p;
+ }
+ pp = &p->next;
+ }
+ uv = luaM_new(L, UpVal); /* not found: create a new one */
+ uv->tt = LUA_TUPVAL;
+ uv->marked = luaC_white(g);
+ uv->v = level; /* current value lives in the stack */
+ uv->next = *pp; /* chain it in the proper position */
+ *pp = obj2gco(uv);
+ uv->u.l.prev = &g->uvhead; /* double link it in `uvhead' list */
+ uv->u.l.next = g->uvhead.u.l.next;
+ uv->u.l.next->u.l.prev = uv;
+ g->uvhead.u.l.next = uv;
+ lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
+ return uv;
+}
+
+
+static void unlinkupval (UpVal *uv) {
+ lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
+ uv->u.l.next->u.l.prev = uv->u.l.prev; /* remove from `uvhead' list */
+ uv->u.l.prev->u.l.next = uv->u.l.next;
+}
+
+
+void luaF_freeupval (lua_State *L, UpVal *uv) {
+ if (uv->v != &uv->u.value) /* is it open? */
+ unlinkupval(uv); /* remove from open list */
+ luaM_free(L, uv); /* free upvalue */
+}
+
+
+void luaF_close (lua_State *L, StkId level) {
+ UpVal *uv;
+ global_State *g = G(L);
+ while (L->openupval != NULL && (uv = ngcotouv(L->openupval))->v >= level) {
+ GCObject *o = obj2gco(uv);
+ lua_assert(!isblack(o) && uv->v != &uv->u.value);
+ L->openupval = uv->next; /* remove from `open' list */
+ if (isdead(g, o))
+ luaF_freeupval(L, uv); /* free upvalue */
+ else {
+ unlinkupval(uv);
+ setobj(L, &uv->u.value, uv->v);
+ uv->v = &uv->u.value; /* now current value lives here */
+ luaC_linkupval(L, uv); /* link upvalue into `gcroot' list */
+ }
+ }
+}
+
+
+Proto *luaF_newproto (lua_State *L) {
+ Proto *f = luaM_new(L, Proto);
+ luaC_link(L, obj2gco(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->lastlinedefined = 0;
+ f->source = NULL;
+ /* LuaJIT extensions */
+ f->jit_mcode = NULL;
+ f->jit_szmcode = 0;
+ f->jit_status = JIT_S_NONE;
+ return f;
+}
+
+
+void luaF_freeproto (lua_State *L, Proto *f) {
+ luaJIT_freeproto(L, f);
+ luaM_freearray(L, f->code, f->sizecode, Instruction);
+ luaM_freearray(L, f->p, f->sizep, Proto *);
+ luaM_freearray(L, f->k, f->sizek, TValue);
+ 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_free(L, f);
+}
+
+
+void luaF_freeclosure (lua_State *L, Closure *c) {
+ int size = (c->c.isC) ? sizeCclosure(c->c.nupvalues) :
+ sizeLclosure(c->l.nupvalues);
+ luaM_freemem(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 */
+}
+
diff --git a/src/luajit/lfunc.h b/src/luajit/lfunc.h
new file mode 100644
index 0000000000..a68cf5151c
--- /dev/null
+++ b/src/luajit/lfunc.h
@@ -0,0 +1,34 @@
+/*
+** $Id: lfunc.h,v 2.4.1.1 2007/12/27 13:02:25 roberto Exp $
+** Auxiliary functions to manipulate prototypes and closures
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lfunc_h
+#define lfunc_h
+
+
+#include "lobject.h"
+
+
+#define sizeCclosure(n) (cast(int, sizeof(CClosure)) + \
+ cast(int, sizeof(TValue)*((n)-1)))
+
+#define sizeLclosure(n) (cast(int, sizeof(LClosure)) + \
+ cast(int, sizeof(TValue *)*((n)-1)))
+
+
+LUAI_FUNC Proto *luaF_newproto (lua_State *L);
+LUAI_FUNC Closure *luaF_newCclosure (lua_State *L, int nelems, Table *e);
+LUAI_FUNC Closure *luaF_newLclosure (lua_State *L, int nelems, Table *e);
+LUAI_FUNC UpVal *luaF_newupval (lua_State *L);
+LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level);
+LUAI_FUNC void luaF_close (lua_State *L, StkId level);
+LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f);
+LUAI_FUNC void luaF_freeclosure (lua_State *L, Closure *c);
+LUAI_FUNC void luaF_freeupval (lua_State *L, UpVal *uv);
+LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number,
+ int pc);
+
+
+#endif
diff --git a/src/luajit/lgc.c b/src/luajit/lgc.c
new file mode 100644
index 0000000000..d9e0b78294
--- /dev/null
+++ b/src/luajit/lgc.c
@@ -0,0 +1,711 @@
+/*
+** $Id: lgc.c,v 2.38.1.1 2007/12/27 13:02:25 roberto Exp $
+** Garbage Collector
+** See Copyright Notice in lua.h
+*/
+
+#include <string.h>
+
+#define lgc_c
+#define LUA_CORE
+
+#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"
+
+
+#define GCSTEPSIZE 1024u
+#define GCSWEEPMAX 40
+#define GCSWEEPCOST 10
+#define GCFINALIZECOST 100
+
+
+#define maskmarks cast_byte(~(bitmask(BLACKBIT)|WHITEBITS))
+
+#define makewhite(g,x) \
+ ((x)->gch.marked = cast_byte(((x)->gch.marked & maskmarks) | luaC_white(g)))
+
+#define white2gray(x) reset2bits((x)->gch.marked, WHITE0BIT, WHITE1BIT)
+#define black2gray(x) resetbit((x)->gch.marked, BLACKBIT)
+
+#define stringmark(s) reset2bits((s)->tsv.marked, WHITE0BIT, WHITE1BIT)
+
+
+#define isfinalized(u) testbit((u)->marked, FINALIZEDBIT)
+#define markfinalized(u) l_setbit((u)->marked, FINALIZEDBIT)
+
+
+#define KEYWEAK bitmask(KEYWEAKBIT)
+#define VALUEWEAK bitmask(VALUEWEAKBIT)
+
+
+
+#define markvalue(g,o) { checkconsistency(o); \
+ if (iscollectable(o) && iswhite(gcvalue(o))) reallymarkobject(g,gcvalue(o)); }
+
+#define markobject(g,t) { if (iswhite(obj2gco(t))) \
+ reallymarkobject(g, obj2gco(t)); }
+
+
+#define setthreshold(g) (g->GCthreshold = (g->estimate/100) * g->gcpause)
+
+
+static void removeentry (Node *n) {
+ lua_assert(ttisnil(gval(n)));
+ if (iscollectable(gkey(n)))
+ setttype(gkey(n), LUA_TDEADKEY); /* dead key; remove it */
+}
+
+
+static void reallymarkobject (global_State *g, GCObject *o) {
+ lua_assert(iswhite(o) && !isdead(g, o));
+ white2gray(o);
+ switch (o->gch.tt) {
+ case LUA_TSTRING: {
+ return;
+ }
+ case LUA_TUSERDATA: {
+ Table *mt = gco2u(o)->metatable;
+ gray2black(o); /* udata are never gray */
+ if (mt) markobject(g, mt);
+ markobject(g, gco2u(o)->env);
+ return;
+ }
+ case LUA_TUPVAL: {
+ UpVal *uv = gco2uv(o);
+ markvalue(g, uv->v);
+ if (uv->v == &uv->u.value) /* closed? */
+ gray2black(o); /* open upvalues are never black */
+ return;
+ }
+ case LUA_TFUNCTION: {
+ gco2cl(o)->c.gclist = g->gray;
+ g->gray = o;
+ break;
+ }
+ case LUA_TTABLE: {
+ gco2h(o)->gclist = g->gray;
+ g->gray = o;
+ break;
+ }
+ case LUA_TTHREAD: {
+ gco2th(o)->gclist = g->gray;
+ g->gray = o;
+ break;
+ }
+ case LUA_TPROTO: {
+ gco2p(o)->gclist = g->gray;
+ g->gray = o;
+ break;
+ }
+ default: lua_assert(0);
+ }
+}
+
+
+static void marktmu (global_State *g) {
+ GCObject *u = g->tmudata;
+ if (u) {
+ do {
+ u = u->gch.next;
+ makewhite(g, u); /* may be marked, if left from previous GC */
+ reallymarkobject(g, u);
+ } while (u != g->tmudata);
+ }
+}
+
+
+/* move `dead' udata that need finalization to list `tmudata' */
+size_t luaC_separateudata (lua_State *L, int all) {
+ global_State *g = G(L);
+ size_t deadmem = 0;
+ GCObject **p = &g->mainthread->next;
+ GCObject *curr;
+ while ((curr = *p) != NULL) {
+ if (!(iswhite(curr) || all) || isfinalized(gco2u(curr)))
+ p = &curr->gch.next; /* don't bother with them */
+ else if (fasttm(L, gco2u(curr)->metatable, TM_GC) == NULL) {
+ markfinalized(gco2u(curr)); /* don't need finalization */
+ p = &curr->gch.next;
+ }
+ else { /* must call its gc method */
+ deadmem += sizeudata(gco2u(curr));
+ markfinalized(gco2u(curr));
+ *p = curr->gch.next;
+ /* link `curr' at the end of `tmudata' list */
+ if (g->tmudata == NULL) /* list is empty? */
+ g->tmudata = curr->gch.next = curr; /* creates a circular list */
+ else {
+ curr->gch.next = g->tmudata->gch.next;
+ g->tmudata->gch.next = curr;
+ g->tmudata = curr;
+ }
+ }
+ }
+ return deadmem;
+}
+
+
+static int traversetable (global_State *g, Table *h) {
+ int i;
+ int weakkey = 0;
+ int weakvalue = 0;
+ const TValue *mode;
+ if (h->metatable)
+ markobject(g, h->metatable);
+ mode = gfasttm(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? */
+ h->marked &= ~(KEYWEAK | VALUEWEAK); /* clear bits */
+ h->marked |= cast_byte((weakkey << KEYWEAKBIT) |
+ (weakvalue << VALUEWEAKBIT));
+ h->gclist = g->weak; /* must be cleared after GC, ... */
+ g->weak = obj2gco(h); /* ... so put in the appropriate list */
+ }
+ }
+ if (weakkey && weakvalue) return 1;
+ if (!weakvalue) {
+ i = h->sizearray;
+ while (i--)
+ markvalue(g, &h->array[i]);
+ }
+ i = sizenode(h);
+ while (i--) {
+ Node *n = gnode(h, i);
+ lua_assert(ttype(gkey(n)) != LUA_TDEADKEY || ttisnil(gval(n)));
+ if (ttisnil(gval(n)))
+ removeentry(n); /* remove empty entries */
+ else {
+ lua_assert(!ttisnil(gkey(n)));
+ if (!weakkey) markvalue(g, gkey(n));
+ if (!weakvalue) markvalue(g, gval(n));
+ }
+ }
+ return weakkey || weakvalue;
+}
+
+
+/*
+** All marks are conditional because a GC may happen while the
+** prototype is still being created
+*/
+static void traverseproto (global_State *g, Proto *f) {
+ int i;
+ if (f->source) stringmark(f->source);
+ for (i=0; i<f->sizek; i++) /* mark literals */
+ markvalue(g, &f->k[i]);
+ for (i=0; i<f->sizeupvalues; i++) { /* mark upvalue names */
+ if (f->upvalues[i])
+ stringmark(f->upvalues[i]);
+ }
+ for (i=0; i<f->sizep; i++) { /* mark nested protos */
+ if (f->p[i])
+ markobject(g, f->p[i]);
+ }
+ for (i=0; i<f->sizelocvars; i++) { /* mark local-variable names */
+ if (f->locvars[i].varname)
+ stringmark(f->locvars[i].varname);
+ }
+}
+
+
+
+static void traverseclosure (global_State *g, Closure *cl) {
+ markobject(g, cl->c.env);
+ if (cl->c.isC) {
+ int i;
+ for (i=0; i<cl->c.nupvalues; i++) /* mark its upvalues */
+ markvalue(g, &cl->c.upvalue[i]);
+ }
+ else {
+ int i;
+ lua_assert(cl->l.nupvalues == cl->l.p->nups);
+ markobject(g, cl->l.p);
+ for (i=0; i<cl->l.nupvalues; i++) /* mark its upvalues */
+ markobject(g, cl->l.upvals[i]);
+ }
+}
+
+
+static void checkstacksizes (lua_State *L, StkId max) {
+ int ci_used = cast_int(L->ci - L->base_ci); /* number of `ci' in use */
+ int s_used = cast_int(max - L->stack); /* part of stack in use */
+ if (L->size_ci > LUAI_MAXCALLS) /* handling overflow? */
+ return; /* do not touch the stacks */
+ if (4*ci_used < L->size_ci && 2*BASIC_CI_SIZE < L->size_ci)
+ luaD_reallocCI(L, L->size_ci/2); /* still big enough... */
+ condhardstacktests(luaD_reallocCI(L, ci_used + 1));
+ if (4*s_used < L->stacksize &&
+ 2*(BASIC_STACK_SIZE+EXTRA_STACK) < L->stacksize)
+ luaD_reallocstack(L, L->stacksize/2); /* still big enough... */
+ condhardstacktests(luaD_reallocstack(L, s_used));
+}
+
+
+static void traversestack (global_State *g, lua_State *l) {
+ StkId o, lim;
+ CallInfo *ci;
+ markvalue(g, gt(l));
+ lim = l->top;
+ for (ci = l->base_ci; ci <= l->ci; ci++) {
+ lua_assert(ci->top <= l->stack_last);
+ if (lim < ci->top) lim = ci->top;
+ }
+ for (o = l->stack; o < l->top; o++)
+ markvalue(g, o);
+ for (; o <= lim; o++)
+ setnilvalue(o);
+ checkstacksizes(l, lim);
+}
+
+
+/*
+** traverse one gray object, turning it to black.
+** Returns `quantity' traversed.
+*/
+static l_mem propagatemark (global_State *g) {
+ GCObject *o = g->gray;
+ lua_assert(isgray(o));
+ gray2black(o);
+ switch (o->gch.tt) {
+ case LUA_TTABLE: {
+ Table *h = gco2h(o);
+ g->gray = h->gclist;
+ if (traversetable(g, h)) /* table is weak? */
+ black2gray(o); /* keep it gray */
+ return sizeof(Table) + sizeof(TValue) * h->sizearray +
+ sizeof(Node) * sizenode(h);
+ }
+ case LUA_TFUNCTION: {
+ Closure *cl = gco2cl(o);
+ g->gray = cl->c.gclist;
+ traverseclosure(g, cl);
+ return (cl->c.isC) ? sizeCclosure(cl->c.nupvalues) :
+ sizeLclosure(cl->l.nupvalues);
+ }
+ case LUA_TTHREAD: {
+ lua_State *th = gco2th(o);
+ g->gray = th->gclist;
+ th->gclist = g->grayagain;
+ g->grayagain = o;
+ black2gray(o);
+ traversestack(g, th);
+ return sizeof(lua_State) + sizeof(TValue) * th->stacksize +
+ sizeof(CallInfo) * th->size_ci;
+ }
+ case LUA_TPROTO: {
+ Proto *p = gco2p(o);
+ g->gray = p->gclist;
+ traverseproto(g, p);
+ return sizeof(Proto) + sizeof(Instruction) * p->sizecode +
+ sizeof(Proto *) * p->sizep +
+ sizeof(TValue) * p->sizek +
+ sizeof(int) * p->sizelineinfo +
+ sizeof(LocVar) * p->sizelocvars +
+ sizeof(TString *) * p->sizeupvalues;
+ }
+ default: lua_assert(0); return 0;
+ }
+}
+
+
+static size_t propagateall (global_State *g) {
+ size_t m = 0;
+ while (g->gray) m += propagatemark(g);
+ return m;
+}
+
+
+/*
+** The next function tells whether a key or value can be cleared from
+** a weak table. Non-collectable objects are never removed from weak
+** tables. Strings behave as `values', so are never removed too. for
+** other objects: if really collected, cannot keep them; for userdata
+** being finalized, keep them in keys, but not in values
+*/
+static int iscleared (const TValue *o, int iskey) {
+ if (!iscollectable(o)) return 0;
+ if (ttisstring(o)) {
+ stringmark(rawtsvalue(o)); /* strings are `values', so are never weak */
+ return 0;
+ }
+ return iswhite(gcvalue(o)) ||
+ (ttisuserdata(o) && (!iskey && isfinalized(uvalue(o))));
+}
+
+
+/*
+** clear collected entries from weaktables
+*/
+static void cleartable (GCObject *l) {
+ while (l) {
+ Table *h = gco2h(l);
+ int i = h->sizearray;
+ lua_assert(testbit(h->marked, VALUEWEAKBIT) ||
+ testbit(h->marked, KEYWEAKBIT));
+ if (testbit(h->marked, VALUEWEAKBIT)) {
+ while (i--) {
+ TValue *o = &h->array[i];
+ if (iscleared(o, 0)) /* value was collected? */
+ setnilvalue(o); /* remove value */
+ }
+ }
+ i = sizenode(h);
+ while (i--) {
+ Node *n = gnode(h, i);
+ if (!ttisnil(gval(n)) && /* non-empty entry? */
+ (iscleared(key2tval(n), 1) || iscleared(gval(n), 0))) {
+ setnilvalue(gval(n)); /* remove value ... */
+ removeentry(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, gco2p(o)); break;
+ case LUA_TFUNCTION: luaF_freeclosure(L, gco2cl(o)); break;
+ case LUA_TUPVAL: luaF_freeupval(L, gco2uv(o)); break;
+ case LUA_TTABLE: luaH_free(L, gco2h(o)); break;
+ case LUA_TTHREAD: {
+ lua_assert(gco2th(o) != L && gco2th(o) != G(L)->mainthread);
+ luaE_freethread(L, gco2th(o));
+ break;
+ }
+ case LUA_TSTRING: {
+ G(L)->strt.nuse--;
+ luaM_freemem(L, o, sizestring(gco2ts(o)));
+ break;
+ }
+ case LUA_TUSERDATA: {
+ luaM_freemem(L, o, sizeudata(gco2u(o)));
+ break;
+ }
+ default: lua_assert(0);
+ }
+}
+
+
+
+#define sweepwholelist(L,p) sweeplist(L,p,MAX_LUMEM)
+
+
+static GCObject **sweeplist (lua_State *L, GCObject **p, lu_mem count) {
+ GCObject *curr;
+ global_State *g = G(L);
+ int deadmask = otherwhite(g);
+ while ((curr = *p) != NULL && count-- > 0) {
+ if (curr->gch.tt == LUA_TTHREAD) /* sweep open upvalues of each thread */
+ sweepwholelist(L, &gco2th(curr)->openupval);
+ if ((curr->gch.marked ^ WHITEBITS) & deadmask) { /* not dead? */
+ lua_assert(!isdead(g, curr) || testbit(curr->gch.marked, FIXEDBIT));
+ makewhite(g, curr); /* make it white (for next cycle) */
+ p = &curr->gch.next;
+ }
+ else { /* must erase `curr' */
+ lua_assert(isdead(g, curr) || deadmask == bitmask(SFIXEDBIT));
+ *p = curr->gch.next;
+ if (curr == g->rootgc) /* is the first element of the list? */
+ g->rootgc = curr->gch.next; /* adjust first */
+ freeobj(L, curr);
+ }
+ }
+ return p;
+}
+
+
+static void checkSizes (lua_State *L) {
+ global_State *g = G(L);
+ /* check size of string hash */
+ if (g->strt.nuse < cast(lu_int32, g->strt.size/4) &&
+ g->strt.size > MINSTRTABSIZE*2)
+ luaS_resize(L, g->strt.size/2); /* table is too big */
+ /* check size of buffer */
+ if (luaZ_sizebuffer(&g->buff) > LUA_MINBUFFER*2) { /* buffer too big? */
+ size_t newsize = luaZ_sizebuffer(&g->buff) / 2;
+ luaZ_resizebuffer(L, &g->buff, newsize);
+ }
+}
+
+
+static void GCTM (lua_State *L) {
+ global_State *g = G(L);
+ GCObject *o = g->tmudata->gch.next; /* get first element */
+ Udata *udata = rawgco2u(o);
+ const TValue *tm;
+ /* remove udata from `tmudata' */
+ if (o == g->tmudata) /* last element? */
+ g->tmudata = NULL;
+ else
+ g->tmudata->gch.next = udata->uv.next;
+ udata->uv.next = g->mainthread->next; /* return it to `root' list */
+ g->mainthread->next = o;
+ makewhite(g, o);
+ tm = fasttm(L, udata->uv.metatable, TM_GC);
+ if (tm != NULL) {
+ lu_byte oldah = L->allowhook;
+ lu_mem oldt = g->GCthreshold;
+ L->allowhook = 0; /* stop debug hooks during GC tag method */
+ g->GCthreshold = 2*g->totalbytes; /* avoid GC steps */
+ setobj2s(L, L->top, tm);
+ setuvalue(L, L->top+1, udata);
+ L->top += 2;
+ luaD_call(L, L->top - 2, 0);
+ L->allowhook = oldah; /* restore hooks */
+ g->GCthreshold = oldt; /* restore threshold */
+ }
+}
+
+
+/*
+** Call all GC tag methods
+*/
+void luaC_callGCTM (lua_State *L) {
+ while (G(L)->tmudata)
+ GCTM(L);
+}
+
+
+void luaC_freeall (lua_State *L) {
+ global_State *g = G(L);
+ int i;
+ g->currentwhite = WHITEBITS | bitmask(SFIXEDBIT); /* mask to collect all elements */
+ sweepwholelist(L, &g->rootgc);
+ for (i = 0; i < g->strt.size; i++) /* free all string lists */
+ sweepwholelist(L, &g->strt.hash[i]);
+}
+
+
+static void markmt (global_State *g) {
+ int i;
+ for (i=0; i<NUM_TAGS; i++)
+ if (g->mt[i]) markobject(g, g->mt[i]);
+}
+
+
+/* mark root set */
+static void markroot (lua_State *L) {
+ global_State *g = G(L);
+ g->gray = NULL;
+ g->grayagain = NULL;
+ g->weak = NULL;
+ markobject(g, g->mainthread);
+ /* make global table be traversed before main stack */
+ markvalue(g, gt(g->mainthread));
+ markvalue(g, registry(L));
+ markmt(g);
+ g->gcstate = GCSpropagate;
+}
+
+
+static void remarkupvals (global_State *g) {
+ UpVal *uv;
+ for (uv = g->uvhead.u.l.next; uv != &g->uvhead; uv = uv->u.l.next) {
+ lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
+ if (isgray(obj2gco(uv)))
+ markvalue(g, uv->v);
+ }
+}
+
+
+static void atomic (lua_State *L) {
+ global_State *g = G(L);
+ size_t udsize; /* total size of userdata to be finalized */
+ /* remark occasional upvalues of (maybe) dead threads */
+ remarkupvals(g);
+ /* traverse objects cautch by write barrier and by 'remarkupvals' */
+ propagateall(g);
+ /* remark weak tables */
+ g->gray = g->weak;
+ g->weak = NULL;
+ lua_assert(!iswhite(obj2gco(g->mainthread)));
+ markobject(g, L); /* mark running thread */
+ markmt(g); /* mark basic metatables (again) */
+ propagateall(g);
+ /* remark gray again */
+ g->gray = g->grayagain;
+ g->grayagain = NULL;
+ propagateall(g);
+ udsize = luaC_separateudata(L, 0); /* separate userdata to be finalized */
+ marktmu(g); /* mark `preserved' userdata */
+ udsize += propagateall(g); /* remark, to propagate `preserveness' */
+ cleartable(g->weak); /* remove collected objects from weak tables */
+ /* flip current white */
+ g->currentwhite = cast_byte(otherwhite(g));
+ g->sweepstrgc = 0;
+ g->sweepgc = &g->rootgc;
+ g->gcstate = GCSsweepstring;
+ g->estimate = g->totalbytes - udsize; /* first estimate */
+}
+
+
+static l_mem singlestep (lua_State *L) {
+ global_State *g = G(L);
+ /*lua_checkmemory(L);*/
+ switch (g->gcstate) {
+ case GCSpause: {
+ markroot(L); /* start a new collection */
+ return 0;
+ }
+ case GCSpropagate: {
+ if (g->gray)
+ return propagatemark(g);
+ else { /* no more `gray' objects */
+ atomic(L); /* finish mark phase */
+ return 0;
+ }
+ }
+ case GCSsweepstring: {
+ lu_mem old = g->totalbytes;
+ sweepwholelist(L, &g->strt.hash[g->sweepstrgc++]);
+ if (g->sweepstrgc >= g->strt.size) /* nothing more to sweep? */
+ g->gcstate = GCSsweep; /* end sweep-string phase */
+ lua_assert(old >= g->totalbytes);
+ g->estimate -= old - g->totalbytes;
+ return GCSWEEPCOST;
+ }
+ case GCSsweep: {
+ lu_mem old = g->totalbytes;
+ g->sweepgc = sweeplist(L, g->sweepgc, GCSWEEPMAX);
+ if (*g->sweepgc == NULL) { /* nothing more to sweep? */
+ checkSizes(L);
+ g->gcstate = GCSfinalize; /* end sweep phase */
+ }
+ lua_assert(old >= g->totalbytes);
+ g->estimate -= old - g->totalbytes;
+ return GCSWEEPMAX*GCSWEEPCOST;
+ }
+ case GCSfinalize: {
+ if (g->tmudata) {
+ GCTM(L);
+ if (g->estimate > GCFINALIZECOST)
+ g->estimate -= GCFINALIZECOST;
+ return GCFINALIZECOST;
+ }
+ else {
+ g->gcstate = GCSpause; /* end collection */
+ g->gcdept = 0;
+ return 0;
+ }
+ }
+ default: lua_assert(0); return 0;
+ }
+}
+
+
+void luaC_step (lua_State *L) {
+ global_State *g = G(L);
+ l_mem lim = (GCSTEPSIZE/100) * g->gcstepmul;
+ if (lim == 0)
+ lim = (MAX_LUMEM-1)/2; /* no limit */
+ g->gcdept += g->totalbytes - g->GCthreshold;
+ do {
+ lim -= singlestep(L);
+ if (g->gcstate == GCSpause)
+ break;
+ } while (lim > 0);
+ if (g->gcstate != GCSpause) {
+ if (g->gcdept < GCSTEPSIZE)
+ g->GCthreshold = g->totalbytes + GCSTEPSIZE; /* - lim/g->gcstepmul;*/
+ else {
+ g->gcdept -= GCSTEPSIZE;
+ g->GCthreshold = g->totalbytes;
+ }
+ }
+ else {
+ lua_assert(g->totalbytes >= g->estimate);
+ setthreshold(g);
+ }
+}
+
+
+void luaC_fullgc (lua_State *L) {
+ global_State *g = G(L);
+ if (g->gcstate <= GCSpropagate) {
+ /* reset sweep marks to sweep all elements (returning them to white) */
+ g->sweepstrgc = 0;
+ g->sweepgc = &g->rootgc;
+ /* reset other collector lists */
+ g->gray = NULL;
+ g->grayagain = NULL;
+ g->weak = NULL;
+ g->gcstate = GCSsweepstring;
+ }
+ lua_assert(g->gcstate != GCSpause && g->gcstate != GCSpropagate);
+ /* finish any pending sweep phase */
+ while (g->gcstate != GCSfinalize) {
+ lua_assert(g->gcstate == GCSsweepstring || g->gcstate == GCSsweep);
+ singlestep(L);
+ }
+ markroot(L);
+ while (g->gcstate != GCSpause) {
+ singlestep(L);
+ }
+ setthreshold(g);
+}
+
+
+void luaC_barrierf (lua_State *L, GCObject *o, GCObject *v) {
+ global_State *g = G(L);
+ lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o));
+ lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause);
+ lua_assert(ttype(&o->gch) != LUA_TTABLE);
+ /* must keep invariant? */
+ if (g->gcstate == GCSpropagate)
+ reallymarkobject(g, v); /* restore invariant */
+ else /* don't mind */
+ makewhite(g, o); /* mark as white just to avoid other barriers */
+}
+
+
+void luaC_barrierback (lua_State *L, Table *t) {
+ global_State *g = G(L);
+ GCObject *o = obj2gco(t);
+ lua_assert(isblack(o) && !isdead(g, o));
+ lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause);
+ black2gray(o); /* make table gray (again) */
+ t->gclist = g->grayagain;
+ g->grayagain = o;
+}
+
+
+void luaC_link (lua_State *L, GCObject *o, lu_byte tt) {
+ global_State *g = G(L);
+ o->gch.next = g->rootgc;
+ g->rootgc = o;
+ o->gch.marked = luaC_white(g);
+ o->gch.tt = tt;
+}
+
+
+void luaC_linkupval (lua_State *L, UpVal *uv) {
+ global_State *g = G(L);
+ GCObject *o = obj2gco(uv);
+ o->gch.next = g->rootgc; /* link upvalue into `rootgc' list */
+ g->rootgc = o;
+ if (isgray(o)) {
+ if (g->gcstate == GCSpropagate) {
+ gray2black(o); /* closed upvalues need barrier */
+ luaC_barrier(L, uv, uv->v);
+ }
+ else { /* sweep phase: sweep it (turning it into white) */
+ makewhite(g, o);
+ lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause);
+ }
+ }
+}
+
diff --git a/src/luajit/lgc.h b/src/luajit/lgc.h
new file mode 100644
index 0000000000..5a8dc605b3
--- /dev/null
+++ b/src/luajit/lgc.h
@@ -0,0 +1,110 @@
+/*
+** $Id: lgc.h,v 2.15.1.1 2007/12/27 13:02:25 roberto Exp $
+** Garbage Collector
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lgc_h
+#define lgc_h
+
+
+#include "lobject.h"
+
+
+/*
+** Possible states of the Garbage Collector
+*/
+#define GCSpause 0
+#define GCSpropagate 1
+#define GCSsweepstring 2
+#define GCSsweep 3
+#define GCSfinalize 4
+
+
+/*
+** some userful bit tricks
+*/
+#define resetbits(x,m) ((x) &= cast(lu_byte, ~(m)))
+#define setbits(x,m) ((x) |= (m))
+#define testbits(x,m) ((x) & (m))
+#define bitmask(b) (1<<(b))
+#define bit2mask(b1,b2) (bitmask(b1) | bitmask(b2))
+#define l_setbit(x,b) setbits(x, bitmask(b))
+#define resetbit(x,b) resetbits(x, bitmask(b))
+#define testbit(x,b) testbits(x, bitmask(b))
+#define set2bits(x,b1,b2) setbits(x, (bit2mask(b1, b2)))
+#define reset2bits(x,b1,b2) resetbits(x, (bit2mask(b1, b2)))
+#define test2bits(x,b1,b2) testbits(x, (bit2mask(b1, b2)))
+
+
+
+/*
+** Layout for bit use in `marked' field:
+** bit 0 - object is white (type 0)
+** bit 1 - object is white (type 1)
+** bit 2 - object is black
+** bit 3 - for userdata: has been finalized
+** bit 3 - for tables: has weak keys
+** bit 4 - for tables: has weak values
+** bit 5 - object is fixed (should not be collected)
+** bit 6 - object is "super" fixed (only the main thread)
+*/
+
+
+#define WHITE0BIT 0
+#define WHITE1BIT 1
+#define BLACKBIT 2
+#define FINALIZEDBIT 3
+#define KEYWEAKBIT 3
+#define VALUEWEAKBIT 4
+#define FIXEDBIT 5
+#define SFIXEDBIT 6
+#define WHITEBITS bit2mask(WHITE0BIT, WHITE1BIT)
+
+
+#define iswhite(x) test2bits((x)->gch.marked, WHITE0BIT, WHITE1BIT)
+#define isblack(x) testbit((x)->gch.marked, BLACKBIT)
+#define isgray(x) (!isblack(x) && !iswhite(x))
+
+#define otherwhite(g) (g->currentwhite ^ WHITEBITS)
+#define isdead(g,v) ((v)->gch.marked & otherwhite(g) & WHITEBITS)
+
+#define changewhite(x) ((x)->gch.marked ^= WHITEBITS)
+#define gray2black(x) l_setbit((x)->gch.marked, BLACKBIT)
+
+#define valiswhite(x) (iscollectable(x) && iswhite(gcvalue(x)))
+
+#define luaC_white(g) cast(lu_byte, (g)->currentwhite & WHITEBITS)
+
+
+#define luaC_checkGC(L) { \
+ condhardstacktests(luaD_reallocstack(L, L->stacksize - EXTRA_STACK - 1)); \
+ if (G(L)->totalbytes >= G(L)->GCthreshold) \
+ luaC_step(L); }
+
+
+#define luaC_barrier(L,p,v) { if (valiswhite(v) && isblack(obj2gco(p))) \
+ luaC_barrierf(L,obj2gco(p),gcvalue(v)); }
+
+#define luaC_barriert(L,t,v) { if (valiswhite(v) && isblack(obj2gco(t))) \
+ luaC_barrierback(L,t); }
+
+#define luaC_objbarrier(L,p,o) \
+ { if (iswhite(obj2gco(o)) && isblack(obj2gco(p))) \
+ luaC_barrierf(L,obj2gco(p),obj2gco(o)); }
+
+#define luaC_objbarriert(L,t,o) \
+ { if (iswhite(obj2gco(o)) && isblack(obj2gco(t))) luaC_barrierback(L,t); }
+
+LUAI_FUNC size_t luaC_separateudata (lua_State *L, int all);
+LUAI_FUNC void luaC_callGCTM (lua_State *L);
+LUAI_FUNC void luaC_freeall (lua_State *L);
+LUAI_FUNC void luaC_step (lua_State *L);
+LUAI_FUNC void luaC_fullgc (lua_State *L);
+LUAI_FUNC void luaC_link (lua_State *L, GCObject *o, lu_byte tt);
+LUAI_FUNC void luaC_linkupval (lua_State *L, UpVal *uv);
+LUAI_FUNC void luaC_barrierf (lua_State *L, GCObject *o, GCObject *v);
+LUAI_FUNC void luaC_barrierback (lua_State *L, Table *t);
+
+
+#endif
diff --git a/src/luajit/linit.c b/src/luajit/linit.c
new file mode 100644
index 0000000000..db24ccd78c
--- /dev/null
+++ b/src/luajit/linit.c
@@ -0,0 +1,39 @@
+/*
+** $Id: linit.c,v 1.14.1.1 2007/12/27 13:02:25 roberto Exp $
+** Initialization of libraries for lua.c
+** See Copyright Notice in lua.h
+*/
+
+
+#define linit_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lualib.h"
+#include "lauxlib.h"
+
+
+static const luaL_Reg lualibs[] = {
+ {"", luaopen_base},
+ {LUA_LOADLIBNAME, luaopen_package},
+ {LUA_TABLIBNAME, luaopen_table},
+ {LUA_IOLIBNAME, luaopen_io},
+ {LUA_OSLIBNAME, luaopen_os},
+ {LUA_STRLIBNAME, luaopen_string},
+ {LUA_MATHLIBNAME, luaopen_math},
+ {LUA_DBLIBNAME, luaopen_debug},
+ {LUA_JITLIBNAME, luaopen_jit},
+ {NULL, NULL}
+};
+
+
+LUALIB_API void luaL_openlibs (lua_State *L) {
+ const luaL_Reg *lib = lualibs;
+ for (; lib->func; lib++) {
+ lua_pushcfunction(L, lib->func);
+ lua_pushstring(L, lib->name);
+ lua_call(L, 1, 0);
+ }
+}
+
diff --git a/src/luajit/liolib.c b/src/luajit/liolib.c
new file mode 100644
index 0000000000..e79ed1cb2e
--- /dev/null
+++ b/src/luajit/liolib.c
@@ -0,0 +1,553 @@
+/*
+** $Id: liolib.c,v 2.73.1.3 2008/01/18 17:47:43 roberto Exp $
+** Standard I/O (and system) library
+** See Copyright Notice in lua.h
+*/
+
+
+#include <errno.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define liolib_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+
+#define IO_INPUT 1
+#define IO_OUTPUT 2
+
+
+static const char *const fnames[] = {"input", "output"};
+
+
+static int pushresult (lua_State *L, int i, const char *filename) {
+ int en = errno; /* calls to Lua API may change this value */
+ if (i) {
+ lua_pushboolean(L, 1);
+ return 1;
+ }
+ else {
+ lua_pushnil(L);
+ if (filename)
+ lua_pushfstring(L, "%s: %s", filename, strerror(en));
+ else
+ lua_pushfstring(L, "%s", strerror(en));
+ lua_pushinteger(L, en);
+ return 3;
+ }
+}
+
+
+static void fileerror (lua_State *L, int arg, const char *filename) {
+ lua_pushfstring(L, "%s: %s", filename, strerror(errno));
+ luaL_argerror(L, arg, lua_tostring(L, -1));
+}
+
+
+#define tofilep(L) ((FILE **)luaL_checkudata(L, 1, LUA_FILEHANDLE))
+
+
+static int io_type (lua_State *L) {
+ void *ud;
+ luaL_checkany(L, 1);
+ ud = lua_touserdata(L, 1);
+ lua_getfield(L, LUA_REGISTRYINDEX, LUA_FILEHANDLE);
+ if (ud == NULL || !lua_getmetatable(L, 1) || !lua_rawequal(L, -2, -1))
+ lua_pushnil(L); /* not a file */
+ else if (*((FILE **)ud) == NULL)
+ lua_pushliteral(L, "closed file");
+ else
+ lua_pushliteral(L, "file");
+ return 1;
+}
+
+
+static FILE *tofile (lua_State *L) {
+ FILE **f = tofilep(L);
+ 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, LUA_FILEHANDLE);
+ lua_setmetatable(L, -2);
+ return pf;
+}
+
+
+/*
+** function to (not) close the standard files stdin, stdout, and stderr
+*/
+static int io_noclose (lua_State *L) {
+ lua_pushnil(L);
+ lua_pushliteral(L, "cannot close standard file");
+ return 2;
+}
+
+
+/*
+** function to close 'popen' files
+*/
+static int io_pclose (lua_State *L) {
+ FILE **p = tofilep(L);
+ int ok = lua_pclose(L, *p);
+ *p = NULL;
+ return pushresult(L, ok, NULL);
+}
+
+
+/*
+** function to close regular files
+*/
+static int io_fclose (lua_State *L) {
+ FILE **p = tofilep(L);
+ int ok = (fclose(*p) == 0);
+ *p = NULL;
+ return pushresult(L, ok, NULL);
+}
+
+
+static int aux_close (lua_State *L) {
+ lua_getfenv(L, 1);
+ lua_getfield(L, -1, "__close");
+ return (lua_tocfunction(L, -1))(L);
+}
+
+
+static int io_close (lua_State *L) {
+ if (lua_isnone(L, 1))
+ lua_rawgeti(L, LUA_ENVIRONINDEX, IO_OUTPUT);
+ tofile(L); /* make sure argument is a file */
+ return aux_close(L);
+}
+
+
+static int io_gc (lua_State *L) {
+ FILE *f = *tofilep(L);
+ /* ignore closed files */
+ if (f != NULL)
+ aux_close(L);
+ return 0;
+}
+
+
+static int io_tostring (lua_State *L) {
+ FILE *f = *tofilep(L);
+ if (f == NULL)
+ lua_pushliteral(L, "file (closed)");
+ else
+ lua_pushfstring(L, "file (%p)", f);
+ 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;
+}
+
+
+/*
+** this function has a separated environment, which defines the
+** correct __close for 'popen' files
+*/
+static int io_popen (lua_State *L) {
+ const char *filename = luaL_checkstring(L, 1);
+ const char *mode = luaL_optstring(L, 2, "r");
+ FILE **pf = newfile(L);
+ *pf = lua_popen(L, filename, mode);
+ return (*pf == NULL) ? pushresult(L, 0, filename) : 1;
+}
+
+
+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, int findex) {
+ FILE *f;
+ lua_rawgeti(L, LUA_ENVIRONINDEX, findex);
+ f = *(FILE **)lua_touserdata(L, -1);
+ if (f == NULL)
+ luaL_error(L, "standard %s file is closed", fnames[findex - 1]);
+ return f;
+}
+
+
+static int g_iofile (lua_State *L, int f, const char *mode) {
+ if (!lua_isnoneornil(L, 1)) {
+ const char *filename = lua_tostring(L, 1);
+ if (filename) {
+ FILE **pf = newfile(L);
+ *pf = fopen(filename, mode);
+ if (*pf == NULL)
+ fileerror(L, 1, filename);
+ }
+ else {
+ tofile(L); /* check that it's a valid file handle */
+ lua_pushvalue(L, 1);
+ }
+ lua_rawseti(L, LUA_ENVIRONINDEX, f);
+ }
+ /* return current value */
+ lua_rawgeti(L, LUA_ENVIRONINDEX, f);
+ return 1;
+}
+
+
+static int io_input (lua_State *L) {
+ return g_iofile(L, IO_INPUT, "r");
+}
+
+
+static int io_output (lua_State *L) {
+ return g_iofile(L, IO_OUTPUT, "w");
+}
+
+
+static int io_readline (lua_State *L);
+
+
+static void aux_lines (lua_State *L, int idx, int toclose) {
+ lua_pushvalue(L, idx);
+ lua_pushboolean(L, toclose); /* close/not close file when finished */
+ lua_pushcclosure(L, io_readline, 2);
+}
+
+
+static int f_lines (lua_State *L) {
+ tofile(L); /* 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? */
+ /* will iterate over default input */
+ lua_rawgeti(L, LUA_ENVIRONINDEX, IO_INPUT);
+ return f_lines(L);
+ }
+ else {
+ const char *filename = luaL_checkstring(L, 1);
+ FILE **pf = newfile(L);
+ *pf = fopen(filename, "r");
+ if (*pf == NULL)
+ fileerror(L, 1, filename);
+ 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_objlen(L, -1) > 0); /* check whether read something */
+ }
+ l = strlen(p);
+ if (l == 0 || 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_objlen(L, -1) > 0);
+}
+
+
+static int g_read (lua_State *L, FILE *f, int first) {
+ int nargs = lua_gettop(L) - 1;
+ int success;
+ int n;
+ clearerr(f);
+ if (nargs == 0) { /* no arguments? */
+ success = read_line(L, f);
+ 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_tointeger(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;
+ default:
+ return luaL_argerror(L, n, "invalid format");
+ }
+ }
+ }
+ }
+ if (ferror(f))
+ return pushresult(L, 0, NULL);
+ if (!success) {
+ lua_pop(L, 1); /* remove last result */
+ lua_pushnil(L); /* push nil instead */
+ }
+ return n - first;
+}
+
+
+static int io_read (lua_State *L) {
+ return g_read(L, getiofile(L, IO_INPUT), 1);
+}
+
+
+static int f_read (lua_State *L) {
+ return g_read(L, tofile(L), 2);
+}
+
+
+static int io_readline (lua_State *L) {
+ FILE *f = *(FILE **)lua_touserdata(L, lua_upvalueindex(1));
+ int sucess;
+ if (f == NULL) /* file is already closed? */
+ luaL_error(L, "file is already closed");
+ sucess = read_line(L, f);
+ if (ferror(f))
+ return luaL_error(L, "%s", strerror(errno));
+ if (sucess) return 1;
+ else { /* EOF */
+ if (lua_toboolean(L, lua_upvalueindex(2))) { /* generator created file? */
+ lua_settop(L, 0);
+ lua_pushvalue(L, lua_upvalueindex(1));
+ aux_close(L); /* close it */
+ }
+ return 0;
+ }
+}
+
+/* }====================================================== */
+
+
+static int g_write (lua_State *L, FILE *f, int arg) {
+ int nargs = lua_gettop(L) - 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), 2);
+}
+
+
+static int f_seek (lua_State *L) {
+ static const int mode[] = {SEEK_SET, SEEK_CUR, SEEK_END};
+ static const char *const modenames[] = {"set", "cur", "end", NULL};
+ FILE *f = tofile(L);
+ int op = luaL_checkoption(L, 2, "cur", modenames);
+ long offset = luaL_optlong(L, 3, 0);
+ op = fseek(f, offset, mode[op]);
+ if (op)
+ return pushresult(L, 0, NULL); /* error */
+ else {
+ lua_pushinteger(L, ftell(f));
+ return 1;
+ }
+}
+
+
+static int f_setvbuf (lua_State *L) {
+ static const int mode[] = {_IONBF, _IOFBF, _IOLBF};
+ static const char *const modenames[] = {"no", "full", "line", NULL};
+ FILE *f = tofile(L);
+ int op = luaL_checkoption(L, 2, NULL, modenames);
+ lua_Integer sz = luaL_optinteger(L, 3, LUAL_BUFFERSIZE);
+ int res = setvbuf(f, NULL, mode[op], sz);
+ return pushresult(L, res == 0, NULL);
+}
+
+
+
+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)) == 0, NULL);
+}
+
+
+static const luaL_Reg iolib[] = {
+ {"close", io_close},
+ {"flush", io_flush},
+ {"input", io_input},
+ {"lines", io_lines},
+ {"open", io_open},
+ {"output", io_output},
+ {"popen", io_popen},
+ {"read", io_read},
+ {"tmpfile", io_tmpfile},
+ {"type", io_type},
+ {"write", io_write},
+ {NULL, NULL}
+};
+
+
+static const luaL_Reg flib[] = {
+ {"close", io_close},
+ {"flush", f_flush},
+ {"lines", f_lines},
+ {"read", f_read},
+ {"seek", f_seek},
+ {"setvbuf", f_setvbuf},
+ {"write", f_write},
+ {"__gc", io_gc},
+ {"__tostring", io_tostring},
+ {NULL, NULL}
+};
+
+
+static void createmeta (lua_State *L) {
+ luaL_newmetatable(L, LUA_FILEHANDLE); /* create metatable for file handles */
+ lua_pushvalue(L, -1); /* push metatable */
+ lua_setfield(L, -2, "__index"); /* metatable.__index = metatable */
+ luaL_register(L, NULL, flib); /* file methods */
+}
+
+
+static void createstdfile (lua_State *L, FILE *f, int k, const char *fname) {
+ *newfile(L) = f;
+ if (k > 0) {
+ lua_pushvalue(L, -1);
+ lua_rawseti(L, LUA_ENVIRONINDEX, k);
+ }
+ lua_pushvalue(L, -2); /* copy environment */
+ lua_setfenv(L, -2); /* set it */
+ lua_setfield(L, -3, fname);
+}
+
+
+static void newfenv (lua_State *L, lua_CFunction cls) {
+ lua_createtable(L, 0, 1);
+ lua_pushcfunction(L, cls);
+ lua_setfield(L, -2, "__close");
+}
+
+
+LUALIB_API int luaopen_io (lua_State *L) {
+ createmeta(L);
+ /* create (private) environment (with fields IO_INPUT, IO_OUTPUT, __close) */
+ newfenv(L, io_fclose);
+ lua_replace(L, LUA_ENVIRONINDEX);
+ /* open library */
+ luaL_register(L, LUA_IOLIBNAME, iolib);
+ /* create (and set) default files */
+ newfenv(L, io_noclose); /* close function for default files */
+ createstdfile(L, stdin, IO_INPUT, "stdin");
+ createstdfile(L, stdout, IO_OUTPUT, "stdout");
+ createstdfile(L, stderr, 0, "stderr");
+ lua_pop(L, 1); /* pop environment for default files */
+ lua_getfield(L, -1, "popen");
+ newfenv(L, io_pclose); /* create environment for 'popen' */
+ lua_setfenv(L, -2); /* set fenv for 'popen' */
+ lua_pop(L, 1); /* pop 'popen' */
+ return 1;
+}
+
diff --git a/src/luajit/ljit.h b/src/luajit/ljit.h
new file mode 100644
index 0000000000..c82db35b0d
--- /dev/null
+++ b/src/luajit/ljit.h
@@ -0,0 +1,167 @@
+/*
+** Interface to JIT engine.
+** Copyright (C) 2005-2008 Mike Pall. See Copyright Notice in luajit.h
+*/
+
+#ifndef ljit_h
+#define ljit_h
+
+#include "lobject.h"
+
+
+/* Define this to enable assertions when debugging LuaJIT. */
+#ifdef LUAJIT_ASSERT
+#include <assert.h>
+#define jit_assert(x) assert(x)
+#define DASM_CHECKS
+#else
+/* A better idea is to define lua_assert() in luaconf.h. */
+#define jit_assert(x) lua_assert(x)
+#endif
+
+/* Define this to set the C stack size for the compiler thread. */
+/* The compiler runs on the callers C stack otherwise. */
+#undef LUAJIT_COMPILER_CSTACK
+
+/* Hardcoded limits for the backend to avoid useless work. */
+/* Note: mind you, these are very generous limits. Check jit.opt, too. */
+#define LUAJIT_LIM_BYTECODE 3000 /* Max. # of bytecodes. */
+#define LUAJIT_LIM_MCODE 128000 /* Max. mcode size of a function. */
+
+/* Global JIT engine flags. */
+#define JIT_F_ON 0x0001 /* JIT engine is on. */
+#define JIT_F_COMPILING 0x0002 /* Currently compiling. */
+#define JIT_F_INIT_FAILED 0x0004 /* Initialization failed. */
+
+#define JIT_F_CPU_CMOV 0x0010 /* CPU has conditional move support. */
+#define JIT_F_CPU_SSE2 0x0020 /* CPU has SSE2 support. */
+
+#define JIT_F_DEBUG_CALL 0x0100 /* Compile with call hooks. */
+#define JIT_F_DEBUG_INS 0x0200 /* Compile with instruction hooks. */
+#define JIT_F_DEBUG 0x0f00 /* Union of all debug flags. */
+
+/* Temporary backend flags. */
+#define JIT_TF_USED_DEOPT 0x0001 /* Used .deopt segment. */
+
+/* JIT engine status codes for prototypes (grep "ORDER JIT_S"). */
+enum {
+ JIT_S_OK, /* OK, code has been compiled. */
+ JIT_S_NONE, /* Nothing compiled yet (default). */
+
+ JIT_S_OFF, /* Compilation for this prototype disabled. */
+ JIT_S_ENGINE_OFF, /* JIT engine is turned off. */
+ JIT_S_DELAYED, /* Compilation delayed (recursive invocation). */
+
+ JIT_S_TOOLARGE, /* Bytecode or machine code is too large. */
+ JIT_S_COMPILER_ERROR, /* Error from compiler frontend. */
+ JIT_S_DASM_ERROR, /* Error from DynASM engine. */
+
+ JIT_S_MAX
+};
+
+/* Machine code trailer and mcode fragment map. */
+typedef struct jit_MCTrailer {
+ char *mcode; /* Pointer to next machine code block. */
+ size_t sz; /* Size of next machine code block. */
+} jit_MCTrailer;
+
+typedef unsigned short jit_Mfm;
+
+/* Deliberately return a void * because the trailer is not fully aligned. */
+#define JIT_MCTRAILER(mcode, sz) \
+ ((void *)(((char *)(mcode))+(sz)-sizeof(jit_MCTrailer)))
+#define JIT_MCMFM(mcode, sz) \
+ ((jit_Mfm *)(((char *)(mcode))+(sz)-sizeof(jit_MCTrailer)-sizeof(jit_Mfm)))
+
+#define JIT_MFM_MAX 0x7ff0 /* Max. mcode fragment length. */
+#define JIT_MFM_MASK 0x7fff /* Tag mask. */
+#define JIT_MFM_MARK 0x8000 /* Deoptimized (main mfm), seek (deopt mfm). */
+#define JIT_MFM_COMBINE 0xfffd /* Combined with prev. instruction(s). */
+#define JIT_MFM_DEAD 0xfffe /* Dead instruction. */
+#define JIT_MFM_STOP 0xffff /* End of map. */
+
+#define jit_mfm_ismain(mfm) (!(*(mfm) & JIT_MFM_MARK))
+#define jit_mfm_isdeoptpc(mfm, pc) ((mfm)[-(pc)] & JIT_MFM_MARK)
+
+/* Deoptimization hints at end of mfm. */
+#define JIT_MFM_DEOPT_PAIRS 0xfffc /* CALL+TFORLOOP inlined (i)pairs. */
+
+/* Preallocation for the hash part of the compiler state table. */
+#define COMSTATE_PREALLOC 128
+
+/* Forward declaration for DynASM state. */
+struct dasm_State;
+
+/* Frontend wrapper. */
+typedef int (*jit_FrontWrap)(lua_State *L, Table *st);
+
+/* Global JIT state. */
+typedef struct jit_State {
+ /* Permanent backend environment: */
+ struct dasm_State *D; /* DynASM state. Keep this as the first field. */
+ void *mcodeheap; /* Private heap to allocate executable memory from. */
+ void **jsub; /* Addresses of JIT subroutines. */
+ void *jsubmcode; /* Base address of JSUB mcode. */
+ size_t szjsubmcode; /* Size of JSUB mcode. */
+ int numjsub; /* Number of JSUBs. */
+
+ /* Temporary backend environment (valid only while running): */
+ lua_State *L; /* Compiler thread. */
+ Table *comstate; /* Compiler state table. */
+ Proto *pt; /* Currently compiled prototype. */
+ const Instruction *nextins; /* Pointer to next instruction. */
+ jit_Mfm *mfm; /* Position in temporary mcode fragment map. */
+ int nextpc; /* Next PC. */
+ int combine; /* Number of following instructions to combine. */
+ unsigned int tflags; /* Temporary flags. */
+ int dasmstatus; /* DynASM status code. */
+
+ /* JIT engine fields: */
+ jit_FrontWrap frontwrap; /* Compiler frontend wrapper. */
+ unsigned int flags; /* Global JIT engine flags. */
+} jit_State;
+
+
+/* --- ljit_core.c */
+
+/* Initialize and free JIT engine state. */
+LUAI_FUNC void luaJIT_initstate(lua_State *L);
+LUAI_FUNC void luaJIT_freestate(lua_State *L);
+
+/* Compile and run a function. */
+LUAI_FUNC int luaJIT_run(lua_State *L, StkId func, int nresults);
+/* Deoptimize the current instruction. Return new mcode addr to continue. */
+LUAI_FUNC void *luaJIT_deoptimize(lua_State *L);
+
+/* Find relative PC (0 based) for a bytecode pointer or a JIT mcode address. */
+LUAI_FUNC int luaJIT_findpc(Proto *pt, const Instruction *savedpc);
+/* Find mcode address for PC (1 based). */
+LUAI_FUNC void *luaJIT_findmcode(Proto *pt, int pc);
+
+
+/* --- ljit_backend.c */
+
+/* Arch string. */
+LUAI_DATA const char luaJIT_arch[];
+/* Initialize and free compiler backend. */
+LUAI_FUNC int luaJIT_initbackend(lua_State *L);
+LUAI_FUNC void luaJIT_freebackend(lua_State *L);
+/* Compiler backend. */
+LUAI_FUNC int luaJIT_backend(lua_State *L);
+/* Notify backend that the debug mode may have changed. */
+LUAI_FUNC void luaJIT_debugnotify(jit_State *J);
+
+
+/* ---- ljit_mem.c */
+
+/* Free the mcode heap. */
+LUAI_FUNC void luaJIT_freemcodeheap(jit_State *J);
+/* Free mcode. */
+LUAI_FUNC void luaJIT_freemcode(jit_State *J, void *mcode, size_t sz);
+/* Free JIT structures in function prototype. */
+LUAI_FUNC void luaJIT_freeproto(lua_State *L, Proto *pt);
+/* Link generated code. */
+LUAI_FUNC int luaJIT_link(jit_State *J, void **mcodep, size_t *szp);
+
+
+#endif
diff --git a/src/luajit/ljit_backend.c b/src/luajit/ljit_backend.c
new file mode 100644
index 0000000000..8521b613e9
--- /dev/null
+++ b/src/luajit/ljit_backend.c
@@ -0,0 +1,342 @@
+/*
+** LuaJIT wrapper for architecture-specific compiler backend.
+** Copyright (C) 2005-2008 Mike Pall. See Copyright Notice in luajit.h
+*/
+
+#include <math.h>
+#include <string.h>
+
+#define ljit_backend_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lobject.h"
+#include "lstate.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lgc.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+#include "lvm.h"
+#include "lopcodes.h"
+#include "ldebug.h"
+#include "lzio.h"
+
+#include "ljit.h"
+#include "ljit_hints.h"
+#include "ljit_dasm.h"
+
+/* ------------------------------------------------------------------------ */
+
+/* Get target of combined JMP op. */
+static int jit_jmp_target(jit_State *J)
+{
+ J->combine++;
+ jit_assert(GET_OPCODE(*J->nextins)==OP_JMP);
+ return J->nextpc + 1 + GETARG_sBx(*J->nextins);
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Include pre-processed architecture-specific backend. */
+#if defined(__i386) || defined(__i386__) || defined(_M_IX86)
+#ifndef LUA_NUMBER_DOUBLE
+#error "No support for other number types on x86 (yet)"
+#endif
+#include "ljit_x86.h"
+#else
+#error "No support for this architecture (yet)"
+#endif
+
+/* ------------------------------------------------------------------------ */
+
+/* Compile instruction range. */
+static void jit_compile_irange(jit_State *J, int firstpc, int lastpc)
+{
+ J->combine = 0;
+ J->nextpc = firstpc;
+ J->nextins = J->pt->code + (firstpc-1);
+ while (J->nextpc <= lastpc) {
+ Instruction ins = *J->nextins++;
+ OpCode op = GET_OPCODE(ins);
+ int ra = GETARG_A(ins);
+ int rb = GETARG_B(ins);
+ int rc = GETARG_C(ins);
+ int rbx = GETARG_Bx(ins);
+ const TValue *combinehint;
+
+ jit_ins_start(J);
+ J->nextpc++;
+
+ combinehint = hint_get(J, COMBINE);
+ if (ttisboolean(combinehint)) {
+ if (bvalue(combinehint)) { /* COMBINE = true: combine with next ins. */
+ if (!(J->flags & JIT_F_DEBUG)) /* But not when debugging. */
+ J->combine = 1;
+ } else { /* COMBINE = false: dead instruction. */
+ *J->mfm++ = JIT_MFM_DEAD;
+ continue;
+ }
+ } /* Other COMBINE hint value types are not defined (yet). */
+
+ if (J->flags & JIT_F_DEBUG_INS)
+ jit_ins_debug(J, luaG_checkopenop(ins));
+
+ switch (op) {
+ case OP_MOVE: jit_op_move(J, ra, rb); break;
+ case OP_LOADK: jit_op_loadk(J, ra, rbx); break;
+ case OP_LOADBOOL: jit_op_loadbool(J, ra, rb, rc); break;
+ case OP_LOADNIL: jit_op_loadnil(J, ra, rb); break;
+
+ case OP_GETUPVAL: jit_op_getupval(J, ra, rb); break;
+ case OP_SETUPVAL: jit_op_setupval(J, ra, rb); break;
+
+ case OP_GETGLOBAL: jit_op_getglobal(J, ra, rbx); break;
+ case OP_SETGLOBAL: jit_op_setglobal(J, ra, rbx); break;
+
+ case OP_NEWTABLE: jit_op_newtable(J, ra, rb, rc); break;
+ case OP_GETTABLE: jit_op_gettable(J, ra, rb, rc); break;
+ case OP_SETTABLE: jit_op_settable(J, ra, rb, rc); break;
+ case OP_SELF: jit_op_self(J, ra, rb, rc); break;
+ case OP_SETLIST: jit_op_setlist(J, ra, rb, rc); break;
+
+ case OP_ADD: jit_op_arith(J, ra, rb, rc, TM_ADD); break;
+ case OP_SUB: jit_op_arith(J, ra, rb, rc, TM_SUB); break;
+ case OP_MUL: jit_op_arith(J, ra, rb, rc, TM_MUL); break;
+ case OP_DIV: jit_op_arith(J, ra, rb, rc, TM_DIV); break;
+ case OP_MOD: jit_op_arith(J, ra, rb, rc, TM_MOD); break;
+ case OP_POW: jit_op_arith(J, ra, rb, rc, TM_POW); break;
+ case OP_UNM: jit_op_arith(J, ra, rb, rb, TM_UNM); break; /* rc unused. */
+
+ case OP_LEN: jit_op_len(J, ra, rb); break;
+ case OP_NOT: jit_op_not(J, ra, rb); break;
+
+ case OP_CONCAT: jit_op_concat(J, ra, rb, rc); break;
+
+ case OP_EQ: jit_op_eq(J, ra, rb, rc); break;
+ case OP_LT: jit_op_arith(J, ra, rb, rc, TM_LT); break;
+ case OP_LE: jit_op_arith(J, ra, rb, rc, TM_LE); break;
+
+ case OP_TEST: jit_op_test(J, rc, ra, ra); break;
+ case OP_TESTSET: jit_op_test(J, rc, ra, rb); break;
+
+ case OP_JMP: jit_op_jmp(J, J->nextpc + rbx-MAXARG_sBx); break;
+
+ case OP_CALL: jit_op_call(J, ra, rb-1, rc-1); break;
+ case OP_TAILCALL: jit_op_tailcall(J, ra, rb-1); break;
+ case OP_RETURN: jit_op_return(J, ra, rb-1); break;
+
+ case OP_FORLOOP: jit_op_forloop(J, ra, J->nextpc + rbx-MAXARG_sBx); break;
+ case OP_FORPREP: jit_op_forprep(J, ra, J->nextpc + rbx-MAXARG_sBx); break;
+
+ case OP_TFORLOOP: jit_op_tforloop(J, ra, rc); break;
+
+ case OP_CLOSE: jit_op_close(J, ra); break;
+ case OP_CLOSURE: jit_op_closure(J, ra, rbx); break;
+
+ case OP_VARARG: jit_op_vararg(J, ra, rb-1); break;
+
+ default: jit_assert(0); break;
+ }
+
+ /* Convention: all opcodes start and end with the .code section. */
+ if (dasm_checkstep(Dst, DASM_SECTION_CODE)) { J->nextpc--; return; }
+
+ *J->mfm++ = 0; /* Placeholder mfm entry. Replaced later. */
+ if (J->combine > 0) { /* Combine next J->combine ins with prev ins. */
+ J->nextpc += J->combine;
+ J->nextins += J->combine;
+ do { *J->mfm++ = JIT_MFM_COMBINE; } while (--J->combine);
+ }
+ }
+}
+
+/* Merge temporary mfm (forward) with PC labels to inverse mfm in mcode. */
+static void jit_mfm_merge(jit_State *J, jit_Mfm *from, jit_Mfm *to, int maxpc)
+{
+ int pc = 1, ofs = 0;
+ for (;;) {
+ int m = *from++;
+ if (m & JIT_MFM_MARK) {
+ switch (m) {
+ default: pc = m ^ JIT_MFM_MARK; break;
+ case JIT_MFM_COMBINE: case JIT_MFM_DEAD: break;
+ case JIT_MFM_STOP: return;
+ }
+ } else {
+ int idx, nofs;
+ for (idx = 0; from[idx] == JIT_MFM_COMBINE; idx++) ;
+ idx += pc;
+ if (idx == J->nextpc) idx = maxpc + 1;
+ nofs = dasm_getpclabel(Dst, idx);
+ m = nofs - ofs;
+ ofs = nofs;
+ jit_assert(nofs >= 0 && m >= 0 && m < JIT_MFM_MAX);
+ }
+ pc++;
+ *to-- = m;
+ }
+}
+
+/* Compile function prototype. */
+static int jit_compile_proto(jit_State *J, Table *deopt)
+{
+ jit_Mfm *tempmfm;
+ void *mcode;
+ size_t sz;
+ int firstpc = 0, maxpc = J->pt->sizecode;
+ int deoptidx = 1;
+ int status;
+ /* (Ab)use the global string concatenation buffer for the temporary mfm. */
+ /* Caveat: the GC must not be run while the backend is active. */
+ tempmfm = (jit_Mfm *)luaZ_openspace(J->L, &G(J->L)->buff,
+ (1+maxpc+1+1+1)*sizeof(jit_Mfm));
+nextdeopt:
+ J->mfm = tempmfm;
+ J->tflags = 0;
+ /* Setup DynASM. */
+ dasm_growpc(Dst, 1+maxpc+2); /* See jit_ins_last(). */
+ dasm_setup(Dst, jit_actionlist);
+ if (deopt) { /* Partial deoptimization. */
+ /* TODO: check deopt chain length? problem: pairs TFOR_CTL migration. */
+ int pc, lastpc;
+ lua_Number n;
+ const TValue *obj = luaH_getnum(deopt, deoptidx++);
+ if (ttisnil(obj) && deoptidx != 2) return JIT_S_OK;
+ if (!ttisnumber(obj)) return JIT_S_COMPILER_ERROR;
+ n = nvalue(obj);
+ lua_number2int(pc, n);
+ firstpc = JIT_IH_IDX(pc);
+ lastpc = firstpc + JIT_IH_LIB(pc);
+ if (firstpc < 1 || firstpc > maxpc || lastpc > maxpc ||
+ J->pt->jit_szmcode == 0)
+ return JIT_S_COMPILER_ERROR;
+ *J->mfm++ = JIT_MFM_MARK+firstpc; /* Seek to firstpc. */
+ jit_compile_irange(J, firstpc, lastpc);
+ jit_assert(J->nextpc == lastpc+1); /* Problem with combined ins? */
+ if (J->nextpc <= maxpc) jit_ins_chainto(J, J->nextpc);
+ *J->mfm++ = JIT_MFM_MARK+maxpc+1; /* Seek to .deopt/.tail. */
+ for (pc = 1; pc <= maxpc; pc++)
+ if (dasm_getpclabel(Dst, pc) == -1) { /* Undefind label referenced? */
+ jit_ins_setpc(J, pc, luaJIT_findmcode(J->pt, pc)); /* => Old mcode. */
+ }
+ } else { /* Full compile. */
+ *J->mfm++ = 0; /* Placeholder mfm entry for prologue. */
+ jit_prologue(J);
+ jit_compile_irange(J, 1, maxpc);
+ }
+ *J->mfm++ = 0; /* Placeholder mfm entry for .deopt/.tail. */
+ *J->mfm = JIT_MFM_STOP;
+ jit_ins_last(J, maxpc, (char *)J->mfm - (char *)tempmfm);
+
+ status = luaJIT_link(J, &mcode, &sz);
+ if (status != JIT_S_OK)
+ return status;
+
+ jit_mfm_merge(J, tempmfm, JIT_MCMFM(mcode, sz), maxpc);
+
+ if (deopt) {
+ jit_MCTrailer tr;
+ /* Patch first instruction to jump to the deoptimized code. */
+ jit_patch_jmp(J, luaJIT_findmcode(J->pt, firstpc), mcode);
+ /* Mark instruction as deoptimized in main mfm. */
+ JIT_MCMFM(J->pt->jit_mcode, J->pt->jit_szmcode)[-firstpc] |= JIT_MFM_MARK;
+ /* Chain deopt mcode block between main mfm and existing mfms. */
+ memcpy(JIT_MCTRAILER(mcode, sz),
+ JIT_MCTRAILER(J->pt->jit_mcode, J->pt->jit_szmcode),
+ sizeof(jit_MCTrailer));
+ tr.mcode = (char *)mcode;
+ tr.sz = sz;
+ memcpy(JIT_MCTRAILER(J->pt->jit_mcode, J->pt->jit_szmcode), (void *)&tr,
+ sizeof(jit_MCTrailer));
+ goto nextdeopt;
+ }
+
+ if (J->pt->jit_szmcode != 0) { /* Full recompile? */
+ jit_MCTrailer tr;
+ /* Patch old mcode entry so other closures get the new callgate. */
+ jit_patch_jmp(J, J->pt->jit_mcode, J->jsub[JSUB_GATE_JL]);
+ /* Chain old main mfm after new main mfm. */
+ tr.mcode = (char *)J->pt->jit_mcode;
+ tr.sz = J->pt->jit_szmcode;
+ memcpy(JIT_MCTRAILER(mcode, sz), (void *)&tr, sizeof(jit_MCTrailer));
+ }
+ /* Set new main mcode block. */
+ J->pt->jit_mcode = mcode;
+ J->pt->jit_szmcode = sz;
+ return JIT_S_OK;
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Compiler backend. */
+int luaJIT_backend(lua_State *L)
+{
+ jit_State *J = G(L)->jit_state;
+ const TValue *cl;
+ int status = JIT_S_COMPILER_ERROR;
+ lua_lock(L);
+ /* Remember compiler state table. */
+ jit_assert(L->top > L->base && ttistable(L->top-1));
+ J->comstate = hvalue(L->top-1);
+ /* Fetch prototoype. Better check this in case some handler screwed up. */
+ cl = luaH_getstr(J->comstate, luaS_newliteral(L, "func"));
+ if (isLfunction(cl)) {
+ J->pt = clvalue(cl)->l.p;
+ if (J->pt->sizecode > LUAJIT_LIM_BYTECODE) { /* Hard backend limit. */
+ status = JIT_S_TOOLARGE;
+ } else {
+ const TValue *obj = luaH_getstr(J->comstate,
+ luaS_newliteral(J->L, "deopt"));
+ status = jit_compile_proto(J, ttistable(obj) ? hvalue(obj) : (Table *)0);
+ }
+ }
+ lua_unlock(L);
+ J->comstate = NULL; /* Just in case. */
+ J->pt = NULL;
+ if (status == JIT_S_OK) {
+ return 0;
+ } else {
+ if (status == JIT_S_DASM_ERROR) {
+ lua_pushinteger(L, J->nextpc);
+ lua_setfield(L, 1, "dasm_pc");
+ lua_pushinteger(L, J->dasmstatus);
+ lua_setfield(L, 1, "dasm_err");
+ }
+ lua_pushinteger(L, status);
+ return 1;
+ }
+}
+
+/* Initialize compiler backend. */
+int luaJIT_initbackend(lua_State *L)
+{
+ jit_State *J = G(L)->jit_state;
+ J->L = L;
+ J->pt = NULL; /* Not in use. */
+ J->D = NULL;
+ J->mcodeheap = NULL;
+ J->jsubmcode = NULL;
+ J->szjsubmcode = 0;
+ J->numjsub = JSUB__MAX;
+ J->jsub = luaM_newvector(J->L, JSUB__MAX, void *);
+ memset((void *)J->jsub, 0, JSUB__MAX*sizeof(void *)); /* Just in case. */
+ dasm_init(Dst, DASM_MAXSECTION);
+ dasm_setupglobal(Dst, J->jsub, JSUB__MAX);
+ return jit_compile_jsub(J);
+}
+
+/* Free compiler backend. */
+void luaJIT_freebackend(lua_State *L)
+{
+ jit_State *J = G(L)->jit_state;
+ J->L = L;
+ if (J->jsub) luaM_freearray(L, J->jsub, JSUB__MAX, void *);
+ luaJIT_freemcodeheap(J); /* Frees JSUB mcode, too. */
+ dasm_free(Dst);
+}
+
+/* ------------------------------------------------------------------------ */
+
diff --git a/src/luajit/ljit_core.c b/src/luajit/ljit_core.c
new file mode 100644
index 0000000000..d4615dad88
--- /dev/null
+++ b/src/luajit/ljit_core.c
@@ -0,0 +1,387 @@
+/*
+** Interface to JIT engine.
+** Copyright (C) 2005-2008 Mike Pall. See Copyright Notice in luajit.h
+*/
+
+#define ljit_core_c
+#define LUA_CORE
+
+#include <string.h>
+
+#include "lua.h"
+
+#include "lobject.h"
+#include "lstate.h"
+#include "ldo.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ldebug.h"
+#include "lopcodes.h"
+
+#include "ljit.h"
+#include "ljit_hints.h"
+#include "luajit.h"
+
+const char luajit_ident[] =
+ "$LuaJIT: " LUAJIT_VERSION " " LUAJIT_COPYRIGHT " " LUAJIT_URL " $\n";
+
+/* ------------------------------------------------------------------------ */
+
+/* Initialize JIT engine state. */
+void luaJIT_initstate(lua_State *L)
+{
+ jit_State *J = luaM_new(L, jit_State);
+ G(L)->jit_state = J;
+ /* Clear JIT engine fields. */
+ J->frontwrap = NULL; /* Filled in by ljitlib before enabling the engine. */
+ J->flags = 0; /* Disable the JIT engine by default. */
+ /* Try to initialize the backend. */
+ if (luaJIT_initbackend(L) != JIT_S_OK)
+ J->flags = JIT_F_INIT_FAILED;
+ J->L = NULL; /* No compiler thread allocated, yet. */
+}
+
+/* Free JIT engine state. */
+void luaJIT_freestate(lua_State *L)
+{
+ jit_State *J = G(L)->jit_state;
+ if (J == NULL) return;
+ luaJIT_freebackend(L);
+ luaM_free(L, J);
+ G(L)->jit_state = NULL;
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Find relative PC (0 based) for a bytecode pointer or a JIT mcode address. */
+int luaJIT_findpc(Proto *pt, const Instruction *savedpc)
+{
+ ptrdiff_t pcdiff = savedpc - pt->code;
+ if (pcdiff >= 0 && pcdiff <= pt->sizecode) { /* Bytecode pointer? */
+ return (int)pcdiff-1;
+ } else { /* Else translate JIT mcode address to PC. */
+ char *addr = (char *)savedpc;
+ jit_MCTrailer tr;
+ tr.mcode = (char *)pt->jit_mcode;
+ tr.sz = pt->jit_szmcode;
+ /* Follow trailer chain until addr is part of an mcode block. */
+ while (!((size_t)(addr - tr.mcode) < tr.sz)) {
+ memcpy((void *)&tr, JIT_MCTRAILER(tr.mcode, tr.sz),
+ sizeof(jit_MCTrailer));
+ if (tr.mcode == NULL) return -1; /* Not in chain. */
+ }
+ {
+ jit_Mfm *mfm = JIT_MCMFM(tr.mcode, tr.sz);
+ int ofs = (int)(addr - tr.mcode);
+ int isdeopt = !jit_mfm_ismain(mfm);
+ int pc = 0; /* Prologue fragment is at start of main mfm. */
+ while (pc <= pt->sizecode) {
+ int m = *mfm--;
+ switch (m) {
+ default:
+ if (m & JIT_MFM_MARK) {
+ m ^= JIT_MFM_MARK;
+ if (isdeopt) { pc = m; continue; } /* Seek. */
+ }
+ ofs -= m;
+ if (ofs <= 0) return pc-1; /* Found! */
+ case JIT_MFM_COMBINE:
+ case JIT_MFM_DEAD:
+ pc++;
+ break;
+ case JIT_MFM_STOP:
+ jit_assert(0); /* Premature STOP found. */
+ return -1;
+ }
+ }
+ jit_assert(0); /* Address is in .tail. */
+ return -1;
+ }
+ }
+}
+
+/* Lookup mcode address for PC (1 based) in mfm. */
+static void *jit_mfmlookup(jit_Mfm *mfm, char *addr, int mpc)
+{
+ int isdeopt = !jit_mfm_ismain(mfm);
+ int pc = 0; /* Prologue fragment is at start of main mfm. */
+ while (pc != mpc) {
+ int m = *mfm--;
+ switch (m) {
+ default:
+ if (m & JIT_MFM_MARK) {
+ m ^= JIT_MFM_MARK;
+ if (isdeopt) { pc = m; continue; } /* Seek. */
+ }
+ addr += m;
+ case JIT_MFM_COMBINE:
+ case JIT_MFM_DEAD:
+ pc++;
+ break;
+ case JIT_MFM_STOP:
+ return NULL;
+ }
+ }
+ return (void *)addr;
+}
+
+/* Find mcode address for PC (1 based). */
+void *luaJIT_findmcode(Proto *pt, int pc)
+{
+ void *addr = NULL;
+ jit_Mfm *mfm;
+ jit_MCTrailer tr;
+ tr.mcode = (char *)pt->jit_mcode;
+ tr.sz = pt->jit_szmcode;
+ mfm = JIT_MCMFM(tr.mcode, tr.sz);
+ jit_assert(pc >= 1 && pc <= pt->sizecode);
+ while (mfm[-pc] == JIT_MFM_COMBINE) pc--;
+ while (mfm[-pc] == JIT_MFM_DEAD) pc++;
+ jit_assert(pc >= 1 && mfm[-pc] < (JIT_MFM_MARK|JIT_MFM_MAX)); /* Valid? */
+ if (jit_mfm_isdeoptpc(mfm, pc)) { /* Deoptimized instruction. */
+ do { /* Search through deopt mfm chain. */
+ memcpy((void *)&tr, JIT_MCTRAILER(tr.mcode, tr.sz),
+ sizeof(jit_MCTrailer));
+ if (tr.mcode == NULL) break; /* Deopt ins missing in chain. */
+ mfm = JIT_MCMFM(tr.mcode, tr.sz);
+ if (jit_mfm_ismain(mfm)) break; /* Old main mfm stops search, too. */
+ addr = jit_mfmlookup(mfm, tr.mcode, pc);
+ } while (addr == NULL);
+ } else { /* Not deoptimized. Lookup in main mfm. */
+ addr = jit_mfmlookup(mfm, tr.mcode, pc);
+ }
+ jit_assert(addr != NULL); /* Corrupt mfm chain. */
+ return addr;
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Compile a prototype. */
+/* Note: func pointer may be invalidated because of stack reallocation. */
+static int jit_compile(lua_State *L, StkId func, Table *st, int force)
+{
+ jit_State *J = G(L)->jit_state;
+ Closure *cl = clvalue(func);
+ Proto *pt = cl->l.p;
+ int status;
+
+ /* Check if JIT engine is enabled and prevent recursive invocation. */
+ if ((J->flags & JIT_F_INIT_FAILED) ||
+ (!force && !(J->flags & JIT_F_ON)) ||
+ !J->frontwrap) {
+ status = JIT_S_ENGINE_OFF;
+ } else if (J->flags & JIT_F_COMPILING) {
+ status = JIT_S_DELAYED;
+ } else if (pt->jit_szmcode != 0 && force < 2) { /* Prevent recompile. */
+ /* TODO: Allow recompiles? Use case? Extra flag for jit.compile()? */
+ status = JIT_S_OK;
+ } else {
+ setclvalue(L, luaH_setstr(L, st, luaS_newliteral(L, "func")), cl);
+ /* Call frontend wrapper. */
+ J->flags |= JIT_F_COMPILING;
+ lua_unlock(L);
+ status = J->frontwrap(L, st);
+ lua_lock(L);
+ J->flags &= ~JIT_F_COMPILING;
+ }
+
+ /* Better sanity check what the frontend returns. */
+ if ((status == JIT_S_OK && pt->jit_szmcode == 0) || status == JIT_S_NONE)
+ status = JIT_S_COMPILER_ERROR;
+
+ /* Update closure callgate and prototype status. */
+ cl->l.jit_gate = (status == JIT_S_OK) ? (lua_CFunction)pt->jit_mcode :
+ G(L)->jit_gateJL;
+ pt->jit_status = status;
+ return status;
+}
+
+/* Create the state table and copy the arguments. */
+static Table *jit_createstate(lua_State *L, StkId arg, int nargs)
+{
+ Table *st;
+ int i;
+ luaC_checkGC(L);
+ st = luaH_new(L, nargs, COMSTATE_PREALLOC);
+ for (i = 0; i < nargs; i++)
+ setobj2t(L, luaH_setnum(L, st, i+1), arg+i);
+ return st;
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Compile and run a function. To be used by luaD_precall() only. */
+int luaJIT_run(lua_State *L, StkId func, int nresults)
+{
+ ptrdiff_t funcr = savestack(L, func);
+ Table *st = jit_createstate(L, func+1, L->top-(func+1));
+ int status = jit_compile(L, func, st, 0); /* Compile function. */
+ func = restorestack(L, funcr);
+
+ /* Run the compiled function on success. Fallback to bytecode on failure. */
+ if (status == JIT_S_OK)
+ return G(L)->jit_gateLJ(L, func, nresults);
+ else
+ return luaD_precall(L, func, nresults);
+ /* Note: We are called from luaD_precall and we call it again. */
+ /* So jit_compile makes sure pt->jit_status != JIT_S_NONE. */
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* No more than two ranges for a single deoptimization right now. */
+#define DEOPTRANGE_ALLOC 2
+
+/* Find PC range of combined instructions and return a range hint. */
+static int combinedrange(jit_Mfm *mfm, int pc)
+{
+ int lastpc = pc;
+ while (mfm[-pc] == JIT_MFM_COMBINE) pc--; /* 1st comb. ins. */
+ while (mfm[-(lastpc+1)] == JIT_MFM_COMBINE) lastpc++; /* Last comb. ins. */
+ return JIT_IH_MKIDX(lastpc-pc, pc); /* (#ins-1, pc) in hint format. */
+}
+
+/* Process deoptimization hints for the given PC range. */
+static int deopthints(Proto *pt, jit_Mfm *dh, TValue *dhint, int pcrange)
+{
+ int m;
+ setnvalue(dhint++, (lua_Number)pcrange);
+ while ((m = *dh--) != JIT_MFM_STOP) {
+ if ((unsigned int)(m - JIT_IH_IDX(pcrange)) <=
+ (unsigned int)JIT_IH_LIB(pcrange)) {
+ switch (*dh--) {
+ case JIT_MFM_DEOPT_PAIRS: /* CALL [i]pairs(): deopt TFORLOOP+JMP. */
+ if (GET_OPCODE(pt->code[m+1-1]) == OP_JMP) {
+ int tfpc = m+2 + GETARG_sBx(pt->code[m+1-1]);
+ if ((unsigned)tfpc < (unsigned)pt->sizecode &&
+ GET_OPCODE(pt->code[tfpc-1]) == OP_TFORLOOP) {
+ setnvalue(dhint++, (lua_Number)JIT_IH_MKIDX(1, tfpc));
+ break;
+ }
+ }
+ return 1; /* Bad hint. */
+ default:
+ return 1; /* Cannot tolerate unknown deoptimization hints. */
+ }
+ }
+ }
+ return 0; /* Ok. */
+}
+
+/* Deoptimize the current instruction. Return new mcode addr to continue. */
+void *luaJIT_deoptimize(lua_State *L)
+{
+ StkId func = L->ci->func;
+ Proto *pt = clvalue(func)->l.p;
+ int pc = luaJIT_findpc(pt, L->savedpc)+1; /* Get prev. PC (1 based). */
+ jit_Mfm *mfm = JIT_MCMFM(pt->jit_mcode, pt->jit_szmcode);
+ int pcrange = combinedrange(mfm, pc);
+ if (!jit_mfm_isdeoptpc(mfm, JIT_IH_IDX(pcrange))) { /* Not deopt. yet? */
+ Table *st = jit_createstate(L, NULL, 0); /* Don't know original args. */
+ Table *deopt = luaH_new(L, DEOPTRANGE_ALLOC, 0);
+ sethvalue(L, luaH_setstr(L, st, luaS_newliteral(L, "deopt")), deopt);
+ if (deopthints(pt, mfm-(pt->sizecode+2), deopt->array, pcrange) ||
+ jit_compile(L, func, st, 2) != JIT_S_OK)
+ luaG_runerror(L, "deoptimization failed");
+ }
+ return luaJIT_findmcode(pt, pc);
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* API function: Compile a Lua function. Pass arguments as hints. */
+LUA_API int luaJIT_compile(lua_State *L, int nargs)
+{
+ StkId func;
+ Table *st;
+ int status;
+ lua_lock(L);
+ api_check(L, (nargs+1) <= (L->top - L->base));
+ func = L->top - (nargs+1);
+ st = jit_createstate(L, func+1, nargs);
+ status = isLfunction(func) ? jit_compile(L, func, st, 1) : -1;
+ lua_unlock(L);
+ return status;
+}
+
+/* Recursively set the mode for all subroutines. */
+static void rec_setmode(Proto *pt, int on)
+{
+ int i;
+ for (i = 0; i < pt->sizep; i++) {
+ Proto *pti = pt->p[i];
+ pti->jit_status = on ? (pti->jit_szmcode?JIT_S_OK:JIT_S_NONE) : JIT_S_OFF;
+ rec_setmode(pti, on); /* Recurse into proto. */
+ }
+}
+
+/* API function: Set the JIT mode for the whole engine or a function+subs. */
+LUA_API int luaJIT_setmode(lua_State *L, int idx, int mode)
+{
+ jit_State *J = G(L)->jit_state;
+ int mm = mode & LUAJIT_MODE_MASK;
+ if (J->flags & JIT_F_INIT_FAILED) return -1; /* Init failed. */
+ switch (mm) {
+ case LUAJIT_MODE_ENGINE: /* Set mode for JIT engine. */
+ if (mode & LUAJIT_MODE_ON)
+ J->flags |= JIT_F_ON;
+ else
+ J->flags &= ~JIT_F_ON;
+ break;
+ case LUAJIT_MODE_DEBUG: { /* Set debug mode. */
+ int dbg;
+ switch (idx) {
+ case 0: dbg = 0; break;
+ case 1: dbg = JIT_F_DEBUG_CALL; break;
+ case 2: default: dbg = JIT_F_DEBUG_CALL | JIT_F_DEBUG_INS; break;
+ }
+ J->flags = (J->flags & ~JIT_F_DEBUG) | dbg;
+ luaJIT_debugnotify(J);
+ break;
+ }
+ case LUAJIT_MODE_FUNC: /* Set mode for function. */
+ case LUAJIT_MODE_ALLFUNC: /* Set mode for function + subfuncs. */
+ case LUAJIT_MODE_ALLSUBFUNC: { /* Set mode for subfunctions. */
+ StkId func;
+ lua_lock(L);
+ func = idx == 0 ? (L->ci-1)->func :
+ (idx > 0 ? L->base + (idx-1) : L->top + idx);
+ if (isLfunction(func)) {
+ Closure *cl = clvalue(func);
+ Proto *pt = cl->l.p;
+ if (mm != LUAJIT_MODE_ALLSUBFUNC) {
+ if (mode & LUAJIT_MODE_ON) {
+ if (pt->jit_szmcode) { /* Already compiled? */
+ cl->l.jit_gate = (lua_CFunction)pt->jit_mcode; /* Reenable. */
+ pt->jit_status = JIT_S_OK;
+ } else {
+ pt->jit_status = JIT_S_NONE; /* (Re-)enable proto compilation */
+ }
+ } else {
+ cl->l.jit_gate = G(L)->jit_gateJL; /* Default callgate. */
+ pt->jit_status = JIT_S_OFF; /* Disable proto compilation. */
+ /* Note: compiled code must be retained for suspended threads. */
+ }
+ }
+ if (mm != LUAJIT_MODE_FUNC)
+ rec_setmode(pt, mode & LUAJIT_MODE_ON);
+ lua_unlock(L);
+ } else {
+ lua_unlock(L);
+ return 0; /* Failed. */
+ }
+ break;
+ }
+ default:
+ return 0; /* Failed. */
+ }
+ return 1; /* OK. */
+}
+
+/* Enforce (dynamic) linker error for version mismatches. See lua.c. */
+LUA_API void LUAJIT_VERSION_SYM(void)
+{
+}
+
+/* ------------------------------------------------------------------------ */
+
diff --git a/src/luajit/ljit_dasm.c b/src/luajit/ljit_dasm.c
new file mode 100644
index 0000000000..1475e82c8c
--- /dev/null
+++ b/src/luajit/ljit_dasm.c
@@ -0,0 +1,38 @@
+/*
+** Wrapper for architecture-specific DynASM encoder.
+** Copyright (C) 2005-2008 Mike Pall. See Copyright Notice in luajit.h
+*/
+
+#define ljit_dasm_c
+#define LUA_CORE
+
+
+#include "lua.h"
+
+#include "ljit.h"
+#include "ljit_dasm.h"
+#include "lmem.h"
+
+
+/* Glue macros for DynASM memory allocation. */
+#define DASM_M_GROW(J, t, p, sz, need) \
+ do { \
+ size_t _sz = (sz), _need = (need); \
+ if (_sz < _need) { \
+ if (_sz < 16) _sz = 16; \
+ while (_sz < _need) _sz += _sz; \
+ (p) = (t *)luaM_realloc_(J->L, (p), (sz), _sz); \
+ (sz) = _sz; \
+ } \
+ } while(0)
+
+#define DASM_M_FREE(J, p, sz) luaM_freemem(J->L, p, sz)
+
+/* Embed architecture-specific DynASM encoder. */
+#if defined(__i386) || defined(__i386__) || defined(_M_IX86)
+#include "dasm_x86.h"
+#else
+#error "No support for this architecture (yet)"
+#endif
+
+
diff --git a/src/luajit/ljit_dasm.h b/src/luajit/ljit_dasm.h
new file mode 100644
index 0000000000..276c86dbf4
--- /dev/null
+++ b/src/luajit/ljit_dasm.h
@@ -0,0 +1,19 @@
+/*
+** Interface to DynASM engine.
+** Copyright (C) 2005-2008 Mike Pall. See Copyright Notice in luajit.h
+*/
+
+#ifndef ljit_dasm_h
+#define ljit_dasm_h
+
+#include "ljit.h"
+
+/* DynASM glue definitions. */
+#define Dst J
+#define Dst_DECL jit_State *J
+#define Dst_REF (J->D)
+#define DASM_FDEF LUAI_FUNC
+
+#include "dasm_proto.h"
+
+#endif
diff --git a/src/luajit/ljit_hints.h b/src/luajit/ljit_hints.h
new file mode 100644
index 0000000000..b9621f6fff
--- /dev/null
+++ b/src/luajit/ljit_hints.h
@@ -0,0 +1,137 @@
+/*
+** Hints for the JIT compiler backend.
+** Copyright (C) 2005-2008 Mike Pall. See Copyright Notice in luajit.h
+*/
+
+#ifdef STRING_HINTS
+#define HH(x, name) #name
+#define HH_START(x) static const char *const hints_##x [] = {
+#define HH_END(x) NULL }
+#else
+#define HH(x, name) JIT_##x##_##name
+#define HH_START(x) enum { JIT_##x##_NONE,
+#define HH_END(x) JIT_##x##_MAX }
+
+/* Macros to access hints. */
+#define JIT_H2NUM(x) ((x) << 16)
+
+#define fhint_get(J, hh) \
+ (luaH_getnum(J->comstate, JIT_H2NUM(JIT_FH_##hh)))
+#define fhint_isset(J, hh) (!ttisnil(fhint_get(J, hh)))
+
+#define hint_getpc(J, hh, pc) \
+ (luaH_getnum(J->comstate, (pc)+JIT_H2NUM(JIT_H_##hh)))
+#define hint_get(J, hh) hint_getpc(J, hh, J->nextpc-1)
+#define hint_issetpc(J, hh, pc) (!ttisnil(hint_getpc(J, hh, pc)))
+#define hint_isset(J, hh) hint_issetpc(J, hh, J->nextpc-1)
+
+#endif
+
+/* Hints for functions. */
+HH_START(FH)
+ HH(FH, NOCLOSE), /* No luaF_close() needed. */
+HH_END(FH);
+
+/* Hints for individual bytecode instruction. */
+HH_START(H)
+ HH(H, COMBINE), /* Combine/dead instruction: true/false. */
+ HH(H, FOR_STEP_K), /* FORPREP/FORLOOP step is const: step. */
+ HH(H, TYPE), /* Type hint: typed object. */
+ HH(H, TYPEKEY), /* Type hint for keys: typed object. */
+ HH(H, INLINE), /* Inline function call: internal index. */
+HH_END(H);
+
+#undef HH
+#undef HH_START
+#undef HH_END
+
+
+/* Avoid multiple inclusion for the following. */
+#ifndef ljit_hints_h
+#define ljit_hints_h
+
+/* Index numbers for inlining C functions. */
+/* CHECK: the index numbers must match with jit.opt_lib. */
+
+#define JIT_IH_LIB(x) ((x) >> 16)
+#define JIT_IH_IDX(x) ((x) & 0xffff)
+#define JIT_IH_MKIDX(l, f) (((l) << 16) | (f))
+
+/* Library index numbers. */
+enum {
+ JIT_IHLIB_INTERNAL,
+ JIT_IHLIB_BASE,
+ JIT_IHLIB_COROUTINE,
+ JIT_IHLIB_STRING,
+ JIT_IHLIB_TABLE,
+ JIT_IHLIB_MATH,
+ JIT_IHLIB__LAST
+};
+
+/* Internal functions. */
+enum {
+ JIT_IH_INTERNAL_RECURSIVE, /* Recursive call. */
+ JIT_IH_INTERNAL__LAST
+};
+
+/* Base library functions. */
+enum {
+ JIT_IH_BASE_PAIRS,
+ JIT_IH_BASE_IPAIRS,
+ JIT_IH_BASE__LAST
+};
+
+/* Coroutine library functions. */
+enum {
+ JIT_IH_COROUTINE_YIELD,
+ JIT_IH_COROUTINE_RESUME,
+ JIT_IH_COROUTINE__LAST
+};
+
+/* String library functions. */
+enum {
+ JIT_IH_STRING_LEN,
+ JIT_IH_STRING_SUB,
+ JIT_IH_STRING_CHAR,
+ JIT_IH_STRING__LAST
+};
+
+/* Table library functions. */
+enum {
+ JIT_IH_TABLE_INSERT,
+ JIT_IH_TABLE_REMOVE,
+ JIT_IH_TABLE_GETN,
+ JIT_IH_TABLE__LAST
+};
+
+/* Math library functions. */
+/* CHECK: order must match with function table for jit_inline_math(). */
+enum {
+ /* 1 arg, 1 result. */
+ /* Partially inlined. Call C function from libm: */
+ JIT_IH_MATH_LOG,
+ JIT_IH_MATH_LOG10,
+ JIT_IH_MATH_EXP,
+ JIT_IH_MATH_SINH,
+ JIT_IH_MATH_COSH,
+ JIT_IH_MATH_TANH,
+ JIT_IH_MATH_ASIN,
+ JIT_IH_MATH_ACOS,
+ JIT_IH_MATH_ATAN,
+ /* Fully inlined: */
+ JIT_IH_MATH_SIN,
+ JIT_IH_MATH_COS,
+ JIT_IH_MATH_TAN,
+ JIT_IH_MATH_CEIL,
+ JIT_IH_MATH_FLOOR,
+ JIT_IH_MATH_ABS,
+ JIT_IH_MATH_SQRT,
+ /* 2 args, 1 result. */
+ JIT_IH_MATH_FMOD,
+ JIT_IH_MATH_ATAN2,
+ JIT_IH_MATH__LAST
+};
+
+#define JIT_IH_MATH__21 JIT_IH_MATH_FMOD
+
+#endif
diff --git a/src/luajit/ljit_mem.c b/src/luajit/ljit_mem.c
new file mode 100644
index 0000000000..d349fb6eb9
--- /dev/null
+++ b/src/luajit/ljit_mem.c
@@ -0,0 +1,405 @@
+/*
+** Memory management for machine code.
+** Copyright (C) 2005-2008 Mike Pall. See Copyright Notice in luajit.h
+*/
+
+#define ljit_mem_c
+#define LUA_CORE
+
+#include <string.h>
+
+#include "lua.h"
+
+#include "lmem.h"
+#include "ldo.h"
+#include "ljit.h"
+#include "ljit_dasm.h"
+
+
+/*
+** Define this if you want to run LuaJIT with valgrind. You will get random
+** errors if you don't. And these errors are usually not caught by valgrind!
+**
+** This macro evaluates to a no-op if not run with valgrind. I.e. you can
+** use the same binary for regular runs, too (without a performance loss).
+*/
+#ifdef USE_VALGRIND
+#include <valgrind/valgrind.h>
+#define MCH_INVALIDATE(ptr, addr) VALGRIND_DISCARD_TRANSLATIONS(ptr, addr)
+#else
+#define MCH_INVALIDATE(ptr, addr) ((void)0)
+#endif
+
+
+/* ------------------------------------------------------------------------ */
+
+#if defined(_WIN32) && !defined(LUAJIT_MCH_USE_MALLOC)
+
+/* Use a private heap with executable memory for Windows. */
+#include <windows.h>
+
+/* No need for serialization. There's already a lock per Lua universe. */
+#ifdef HEAP_CREATE_ENABLE_EXECUTE
+#define MCH_HCFLAGS (HEAP_NO_SERIALIZE|HEAP_CREATE_ENABLE_EXECUTE)
+#else
+#define MCH_HCFLAGS (HEAP_NO_SERIALIZE|0x00040000)
+#endif
+
+/* Free the whole mcode heap. */
+void luaJIT_freemcodeheap(jit_State *J)
+{
+ if (J->mcodeheap) HeapDestroy((HANDLE)J->mcodeheap);
+}
+
+/* Allocate a code block from the mcode heap. */
+static void *mcode_alloc(jit_State *J, size_t sz)
+{
+ void *ptr;
+ if (J->mcodeheap == NULL) {
+ J->mcodeheap = (void *)HeapCreate(MCH_HCFLAGS, 0, 0);
+ if (J->mcodeheap == NULL) luaD_throw(J->L, LUA_ERRMEM);
+ }
+ ptr = HeapAlloc(J->mcodeheap, 0, (sz));
+ if (ptr == NULL) luaD_throw(J->L, LUA_ERRMEM);
+ return ptr;
+}
+
+#define mcode_free(L, J, p, sz) HeapFree(J->mcodeheap, 0, (p))
+
+/* ------------------------------------------------------------------------ */
+
+#elif defined(LUA_USE_POSIX) && !defined(LUAJIT_MCH_USE_MALLOC)
+
+/*
+** Allocate EXECUTABLE memory with mmap() on POSIX systems.
+**
+** There is no standard way to reuse malloc(). So this is a very small,
+** but also very naive memory allocator. This should be ok, because:
+**
+** 1. Most apps only allocate mcode while running and free all on exit.
+**
+** 2. Some apps regularly load/unload a bunch of modules ("stages").
+** Allocs/frees come in groups, so coalescing should work fine.
+**
+** If your app differs, then please elaborate and/or supply code.
+** And no -- including a full blown malloc is NOT an option.
+**
+** Caveat: the mmap()'ed heaps are not freed until exit.
+** This shouldn't be too difficult to add, but I didn't bother.
+*/
+
+#include <sys/types.h>
+#include <sys/mman.h>
+
+/* TODO: move this to luaconf.h */
+#define LUAJIT_MCH_CHUNKSIZE (1<<17) /* 128K */
+
+#if defined(MAP_ANONYMOUS)
+#define MCH_MMFLAGS (MAP_PRIVATE|MAP_ANONYMOUS)
+#elif defined(MAP_ANON)
+#define MCH_MMFLAGS (MAP_PRIVATE|MAP_ANON)
+#else
+/* I'm too lazy to add /dev/zero support for ancient systems. */
+#error "Your OS has no (easy) support for anonymous mmap(). Please upgrade."
+#endif
+
+/* Chunk header. Used for the free chunk list / heap headers. */
+typedef struct MCodeHead {
+ struct MCodeHead *next; /* Next free chunk / 1st head: first free. */
+ struct MCodeHead *prev; /* Prev free chunk / 1st head: next head. */
+ size_t size; /* Size of free chunk / Size of heap. */
+ size_t dummy; /* May or may not overlap with trailer. */
+} MCodeHead;
+
+/* Allocation granularity. Assumes sizeof(void *) >= sizeof(size_t). */
+#define MCH_GRANULARITY (4*sizeof(void *))
+#define MCH_ROUNDSIZE(x) (((x) + MCH_GRANULARITY-1) & -MCH_GRANULARITY)
+#define MCH_ROUNDHEAP(x) (((x) + 4095) & -4096)
+#define MCH_HEADERSIZE MCH_ROUNDSIZE(sizeof(MCodeHead))
+
+/* Trailer flags. */
+#define MCH_USED 1 /* Next chunk is in use. */
+#define MCH_LAST 2 /* Next chunk is the last one. */
+#define MCH_FIRST 4 /* Next chunk is the first one. */
+/* Note: the last chunk of each heap doesn't have a trailer. */
+
+/* Trailer macros. */
+#define MCH_PREVTRAILER(mh) ((size_t *)(mh) - 1)
+#define MCH_TRAILER(mh, sz) ((size_t *)((char *)(mh) + (sz)) - 1)
+#define MCH_TRFLAGS(tr) ((tr) & (MCH_USED|MCH_LAST))
+#define MCH_TRSIZE(tr) ((tr) & ~(MCH_USED|MCH_LAST))
+
+/* Debugging memory allocators is ... oh well. */
+#ifdef MCH_DEBUG
+#include <stdio.h>
+#define MCH_DBGF stderr
+#define MCH_DBG(x) fprintf x
+#else
+#define MCH_DBG(x) ((void)0)
+#endif
+
+/* Free the whole list of mcode heaps. */
+void luaJIT_freemcodeheap(jit_State *J)
+{
+ MCodeHead *mh = (MCodeHead *)J->mcodeheap;
+ while (mh) {
+ MCodeHead *prev = mh->prev; /* Heaps are in the prev chain. */
+#ifdef MCH_DEBUG
+ munmap((void *)mh, mh->size+4096);
+#else
+ munmap((void *)mh, mh->size);
+#endif
+ mh = prev;
+ }
+ J->mcodeheap = NULL;
+}
+
+/* Allocate a new heap of at least the given size. */
+static void mcode_newheap(jit_State *J, size_t sz)
+{
+ MCodeHead *mh, *mhn, *fh;
+ void *ptr;
+
+ /* Ensure minimum size or round up. */
+ if (sz + MCH_HEADERSIZE <= LUAJIT_MCH_CHUNKSIZE)
+ sz = LUAJIT_MCH_CHUNKSIZE;
+ else
+ sz = MCH_ROUNDHEAP(sz + MCH_HEADERSIZE);
+
+#ifdef MCH_DEBUG
+ /* Allocate a new heap plus a guard page. */
+ ptr = mmap(NULL, sz+4096, PROT_READ|PROT_WRITE|PROT_EXEC, MCH_MMFLAGS, -1, 0);
+ if (ptr == MAP_FAILED) luaD_throw(J->L, LUA_ERRMEM);
+ mprotect((char *)ptr+sz, 4096, PROT_NONE);
+#else
+ /* Allocate a new heap. */
+ ptr = mmap(NULL, sz, PROT_READ|PROT_WRITE|PROT_EXEC, MCH_MMFLAGS, -1, 0);
+ if (ptr == MAP_FAILED) luaD_throw(J->L, LUA_ERRMEM);
+#endif
+
+ /* Initialize free chunk. */
+ fh = (MCodeHead *)((char *)ptr + MCH_HEADERSIZE);
+ fh->size = sz - MCH_HEADERSIZE;
+ *MCH_PREVTRAILER(fh) = MCH_LAST | MCH_FIRST; /* Zero size, no coalesce. */
+
+ /* Initialize new heap and make it the first heap. */
+ mh = (MCodeHead *)J->mcodeheap;
+ J->mcodeheap = ptr;
+ mhn = (MCodeHead *)ptr;
+ mhn->prev = mh; /* Heaps are in the prev. chain. */
+ mhn->size = sz;
+ mhn->next = fh; /* Start of free list is always in the first heap. */
+ fh->prev = mhn;
+ if (mh) {
+ fh->next = mh->next; /* Old start of free list. */
+ mh->next = NULL; /* Just in case. */
+ } else {
+ fh->next = NULL; /* No other free chunks yet. */
+ }
+ MCH_DBG((MCH_DBGF, "HEAP %p %5x\n", mhn, sz));
+}
+
+/* Allocate a code block. */
+static void *mcode_alloc(jit_State *J, size_t sz)
+{
+ sz = MCH_ROUNDSIZE(sz + sizeof(size_t));
+ for ( ; ; ) {
+ MCodeHead *mh = (MCodeHead *)J->mcodeheap;
+ if (mh) { /* Got at least one heap so search free list. */
+#ifdef MCH_DEBUG
+ int slen = 0;
+ for (mh = mh->next; mh ; mh = mh->next, slen++)
+#else
+ for (mh = mh->next; mh ; mh = mh->next)
+#endif
+ if (mh->size >= sz) { /* Very naive first fit. */
+ size_t *trailer = MCH_TRAILER(mh, sz);
+ size_t *ptrailer = MCH_PREVTRAILER(mh);
+ if (mh->size == sz) { /* Exact match: just unchain chunk. */
+ mh->prev->next = mh->next;
+ if (mh->next)
+ mh->next->prev = mh->prev;
+ *ptrailer |= MCH_USED;
+ MCH_DBG((MCH_DBGF, "NEW %p %5x FIT #%d%s\n",
+ mh, sz, slen, (*ptrailer & MCH_LAST) ? " LAST" : ""));
+ } else { /* Chunk is larger: rechain remainder chunk. */
+ MCodeHead *fh = (MCodeHead *)((char *)mh + sz);
+ size_t tr;
+ fh->size = mh->size - sz;
+ (fh->prev = mh->prev)->next = fh;
+ if ((fh->next = mh->next) != NULL)
+ fh->next->prev = fh;
+ tr = *ptrailer;
+ if (tr & MCH_LAST) {
+ *ptrailer = (tr & ~MCH_LAST) | MCH_USED;
+ *trailer = sz | MCH_LAST;
+ MCH_DBG((MCH_DBGF, "NEW %p %5x REST %p %5x #%d LAST\n",
+ mh, sz, fh, fh->size, slen));
+ } else {
+ size_t *ftrailer = MCH_TRAILER(fh, fh->size);
+ *ftrailer = MCH_TRFLAGS(*ftrailer) | fh->size;
+ *ptrailer = tr | MCH_USED;
+ *trailer = sz;
+ MCH_DBG((MCH_DBGF, "NEW %p %5x REST %p %5x #%d\n",
+ mh, sz, fh, fh->size, slen));
+ }
+ }
+ return (void *)mh;
+ }
+ }
+ /* No luck. Allocate a new heap. Next loop iteration will succeed. */
+ mcode_newheap(J, sz);
+ }
+}
+
+/* Free a code block. */
+static void mcode_free_(jit_State *J, void *ptr, size_t sz)
+{
+ MCodeHead *mh = (MCodeHead *)ptr;
+ size_t *trailer = MCH_TRAILER(mh, sz);
+ size_t *ptrailer = MCH_PREVTRAILER(mh);
+ size_t tr = *ptrailer;
+
+#ifdef MCH_DEBUG
+ if (!(tr & MCH_USED)) MCH_DBG((MCH_DBGF, "**unused %p %5x\n", ptr, sz));
+#endif
+
+ if (!(tr & MCH_FIRST)) {
+ MCodeHead *ph = (MCodeHead *)((char *)mh - MCH_TRSIZE(tr));
+ size_t *pptrailer = MCH_PREVTRAILER(ph);
+ if (!(*pptrailer & MCH_USED)) { /* Prev free? */
+ if (!(tr & MCH_LAST) && !(*trailer & MCH_USED)) { /* Next free? */
+ /* Coalesce with previous and next chunk. */
+ MCodeHead *nh = (MCodeHead *)((char *)mh + sz);
+ MCH_DBG((MCH_DBGF, "free %p %5x PN %p %5x %p %5x%s\n",
+ mh, sz, ph, ph->size, nh, nh->size,
+ (*trailer & MCH_LAST) ? " last" : ""));
+ if ((nh->prev->next = nh->next) != NULL)
+ nh->next->prev = nh->prev;
+ ph->size += sz + nh->size;
+ if (*trailer & MCH_LAST) {
+ *pptrailer |= MCH_LAST;
+ } else {
+ trailer = MCH_TRAILER(nh, nh->size);
+ *trailer = MCH_TRFLAGS(*trailer) | ph->size;
+ }
+ return;
+ }
+ MCH_DBG((MCH_DBGF, "free %p %5x P- %p %5x%s\n",
+ mh, sz, ph, ph->size,
+ (tr & MCH_LAST) ? " last" : ""));
+ ph->size += sz;
+ if (tr & MCH_LAST)
+ *pptrailer |= MCH_LAST;
+ else
+ *trailer = MCH_TRFLAGS(*trailer) | ph->size;
+ return;
+ }
+ }
+
+ if (!(tr & MCH_LAST) && !(*trailer & MCH_USED)) { /* Next free? */
+ /* Coalesce with next chunk. */
+ MCodeHead *nh = (MCodeHead *)((char *)mh + sz);
+ MCH_DBG((MCH_DBGF, "free %p %5x -N %p %5x%s\n",
+ mh, sz, nh, nh->size, (*trailer & MCH_LAST) ? " last" : ""));
+ (mh->prev = nh->prev)->next = mh;
+ if ((mh->next = nh->next))
+ mh->next->prev = mh;
+ mh->size = nh->size + sz;
+ if (*trailer & MCH_LAST) {
+ *ptrailer = (tr & ~MCH_USED) | MCH_LAST;
+ } else {
+ trailer = MCH_TRAILER(mh, mh->size);
+ *trailer = MCH_TRFLAGS(*trailer) | mh->size;
+ *ptrailer = tr & ~MCH_USED;
+ }
+ } else {
+ /* No coalesce possible, just add to free list. */
+ MCodeHead *fh = (MCodeHead *)J->mcodeheap;
+ MCH_DBG((MCH_DBGF, "free %p %5x --%s\n",
+ mh, sz, (tr & MCH_LAST) ? " last" : ""));
+ if ((mh->next = fh->next))
+ mh->next->prev = mh;
+ fh->next = mh;
+ mh->prev = fh;
+ mh->size = sz;
+ *ptrailer = tr & ~MCH_USED;
+ }
+}
+
+#define mcode_free(L, J, p, sz) \
+ mcode_free_(J, (p), MCH_ROUNDSIZE((sz) + sizeof(size_t)))
+
+/* ------------------------------------------------------------------------ */
+
+#else
+
+/*
+** Fallback to Lua's alloc, i.e. probably malloc().
+**
+** Note: the returned memory is usually not marked executable!
+** Running the code will crash if the CPU/OS checks for this.
+** E.g. on x86 CPUs that support the NX (No eXecute) bit.
+*/
+
+/* There's no heap to free, but the JSUB mcode is. */
+void luaJIT_freemcodeheap(jit_State *J)
+{
+ if (J->jsubmcode) luaM_freemem(J->L, J->jsubmcode, J->szjsubmcode);
+}
+
+#define mcode_alloc(J, sz) luaM_realloc_(J->L, NULL, 0, (sz))
+#define mcode_free(L, J, p, sz) luaM_freemem(L, p, sz)
+
+#endif
+
+/* ------------------------------------------------------------------------ */
+
+/* Free mcode. */
+void luaJIT_freemcode(jit_State *J, void *mcode, size_t sz)
+{
+ mcode_free(J->L, J, mcode, sz);
+}
+
+/* Free JIT structures in function prototype. */
+void luaJIT_freeproto(lua_State *L, Proto *pt)
+{
+ char *mcode = (char *)pt->jit_mcode;
+ size_t sz = pt->jit_szmcode;
+ pt->jit_mcode = NULL;
+ pt->jit_szmcode = 0;
+ while (sz != 0) { /* Free whole chain of mcode blocks for this proto. */
+ jit_MCTrailer next;
+ memcpy((void *)&next, JIT_MCTRAILER(mcode, sz), sizeof(jit_MCTrailer));
+ MCH_INVALIDATE(mcode, sz);
+ mcode_free(L, G(L)->jit_state, mcode, sz);
+ mcode = next.mcode;
+ sz = next.sz;
+ }
+}
+
+/* Link generated code. Return mcode address, size and status. */
+int luaJIT_link(jit_State *J, void **mcodep, size_t *szp)
+{
+ size_t sz;
+ void *mcode;
+
+ /* Pass 2: link sections. */
+ if ((J->dasmstatus = dasm_link(Dst, &sz))) return JIT_S_DASM_ERROR;
+
+ /* Check for hardcoded limit on mcode size. */
+ if (sz > LUAJIT_LIM_MCODE) return JIT_S_TOOLARGE;
+
+ /* TODO: mark mcode readonly when we're done. */
+ mcode = mcode_alloc(J, sz);
+
+ /* Pass 3: encode sections. */
+ if ((J->dasmstatus = dasm_encode(Dst, mcode)) != 0) {
+ mcode_free(J->L, J, mcode, sz);
+ return JIT_S_DASM_ERROR;
+ }
+ *mcodep = mcode;
+ *szp = sz;
+ return JIT_S_OK;
+}
+
diff --git a/src/luajit/ljit_x86.dasc b/src/luajit/ljit_x86.dasc
new file mode 100644
index 0000000000..c587e533bc
--- /dev/null
+++ b/src/luajit/ljit_x86.dasc
@@ -0,0 +1,2457 @@
+/*
+** Bytecode to machine code translation for x86 CPUs.
+** Copyright (C) 2005-2008 Mike Pall. See Copyright Notice in luajit.h
+*/
+
+|// Include common definitions and macros.
+|.include ljit_x86.dash
+|
+|// Place actionlist and globals here at the top of the file.
+|.actionlist jit_actionlist
+|.globals JSUB_
+
+/* ------------------------------------------------------------------------ */
+
+/* Arch string. */
+const char luaJIT_arch[] = "x86";
+
+/* Forward declarations for C functions called from jsubs. */
+static void jit_hookins(lua_State *L, const Instruction *newpc);
+static void jit_gettable_fb(lua_State *L, Table *t, StkId dest);
+static void jit_settable_fb(lua_State *L, Table *t, StkId val);
+
+/* ------------------------------------------------------------------------ */
+
+/* Detect CPU features and set JIT flags. */
+static int jit_cpudetect(jit_State *J)
+{
+ void *mcode;
+ size_t sz;
+ int status;
+ /* Some of the jsubs need the flags. So compile this separately. */
+ unsigned int feature;
+ dasm_setup(Dst, jit_actionlist);
+ | // Check for CPUID support first.
+ | pushfd
+ | pop edx
+ | mov ecx, edx
+ | xor edx, 0x00200000 // Toggle ID bit in flags.
+ | push edx
+ | popfd
+ | pushfd
+ | pop edx
+ | xor eax, eax // Zero means no features supported.
+ | cmp ecx, edx
+ | jz >1 // No ID toggle means no CPUID support.
+ |
+ | inc eax // CPUID function 1.
+ | push ebx // Callee-save ebx modified by CPUID.
+ | cpuid
+ | pop ebx
+ | mov eax, edx // Return feature support bits.
+ |1:
+ | ret
+ (void)dasm_checkstep(Dst, DASM_SECTION_CODE);
+ status = luaJIT_link(J, &mcode, &sz);
+ if (status != JIT_S_OK)
+ return status;
+ /* Check feature bits. See the Intel/AMD manuals for the bit definitions. */
+ feature = ((unsigned int (*)(void))mcode)();
+ if (feature & (1<<15)) J->flags |= JIT_F_CPU_CMOV;
+ if (feature & (1<<26)) J->flags |= JIT_F_CPU_SSE2;
+ luaJIT_freemcode(J, mcode, sz); /* We don't need this code anymore. */
+ return JIT_S_OK;
+}
+
+/* Check some assumptions. Should compile to nop. */
+static int jit_consistency_check(jit_State *J)
+{
+ do {
+ /* Force a compiler error for inconsistent structure sizes. */
+ /* Check LUA_TVALUE_ALIGN in luaconf.h, too. */
+ ||int check_TVALUE_SIZE_in_ljit_x86_dash[1+TVALUE_SIZE-sizeof(TValue)];
+ ||int check_TVALUE_SIZE_in_ljit_x86_dash_[1+sizeof(TValue)-TVALUE_SIZE];
+ ((void)check_TVALUE_SIZE_in_ljit_x86_dash[0]);
+ ((void)check_TVALUE_SIZE_in_ljit_x86_dash_[0]);
+ if (LUA_TNIL != 0 || LUA_TBOOLEAN != 1 || PCRLUA != 0) break;
+ if ((int)&(((Node *)0)->i_val) != (int)&(((StkId)0)->value)) break;
+ return JIT_S_OK;
+ } while (0);
+ J->dasmstatus = 999999999; /* Recognizable error. */
+ return JIT_S_COMPILER_ERROR;
+}
+
+/* Compile JIT subroutines (once). */
+static int jit_compile_jsub(jit_State *J)
+{
+ int status = jit_consistency_check(J);
+ if (status != JIT_S_OK) return status;
+ status = jit_cpudetect(J);
+ if (status != JIT_S_OK) return status;
+ dasm_setup(Dst, jit_actionlist);
+ |// Macros to reorder and combine JIT subroutine definitions.
+ |.macro .jsub, name
+ |.capture JSUB // Add the entry point.
+ ||//-----------------------------------------------------------------------
+ ||//->name:
+ | .align 16
+ |->name:
+ |.endmacro
+ |.macro .endjsub; .endcapture; .endmacro
+ |.macro .dumpjsub; .dumpcapture JSUB; .endmacro
+ |
+ |.code
+ |//-----------------------------------------------------------------------
+ | .align 16
+ | // Must be the first JSUB defined or used.
+ |->STACKPTR: // Get stack pointer (for jit.util.*).
+ | lea eax, [esp+aword*1] // But adjust for the return address.
+ | ret
+ |
+ |//-----------------------------------------------------------------------
+ | .align 16
+ |->GATE_LJ: // Lua -> JIT gate. (L, func, nresults)
+ | push ebp
+ | mov ebp, esp
+ | sub esp, LJFRAME_OFFSET
+ | mov SAVER1, BASE
+ | mov BASE, CARG2 // func
+ | mov CARG2, L // Arg used as savereg. Avoids aword*8 stack frame.
+ | mov L, CARG1 // L
+ | mov SAVER2, TOP
+ | mov TOP, L->top
+ | mov LCL, BASE->value
+ | mov CI, L->ci
+ | // Prevent stackless yields. No limit check -- this is not a real C call.
+ | inc word L->nCcalls // short
+ |
+ | call aword LCL->jit_gate // Call the compiled code.
+ |
+ | mov CI, L->ci
+ | mov L->top, TOP // Only correct for LUA_MULTRET.
+ | mov edx, CI->savedpc
+ | mov eax, CARG3 // nresults
+ | mov L->savedpc, edx // L->savedpc = CI->savedpc
+ | mov edx, CI->base
+ | test eax, eax
+ | mov L->base, edx // L->base = CI->base
+ | js >2 // Skip for nresults == LUA_MULTRET.
+ |
+ | TValuemul eax
+ | add BASE, eax
+ | xor ecx, ecx
+ | mov L->top, BASE // L->top = &func[nresults]
+ |1: // No initial check. May use EXTRA_STACK (once).
+ | mov TOP->tt, ecx // Clear unset stack slots.
+ | add TOP, #TOP
+ | cmp TOP, BASE
+ | jb <1
+ |
+ |2:
+ | dec word L->nCcalls // short
+ | mov eax, PCRC
+ | mov TOP, SAVER2
+ | mov BASE, SAVER1
+ | mov L, CARG2
+ | mov esp, ebp
+ | pop ebp
+ | ret
+ |
+ |//-----------------------------------------------------------------------
+ | .align 16
+ |->GATE_JL: // JIT -> Lua callgate.
+ | mov PROTO:edx, LCL->p
+ | cmp dword PROTO:edx->jit_status, JIT_S_OK
+ | jne >1 // Already compiled?
+ |
+ | // Yes, copy callgate to closure (so GATE_JL is not called again).
+ | mov edx, PROTO:edx->jit_mcode
+ | mov LCL->jit_gate, edx
+ | jmp edx // Chain to compiled code.
+ |
+ |1: // Let luaD_precall do the hard work: compile & run or fallback.
+ | sub esp, FRAME_OFFSET
+ | mov eax, CI->savedpc
+ | mov L->ci, CI // May not be in sync for tailcalls.
+ | mov L->top, TOP
+ | mov ARG3, -1 // LUA_MULTRET
+ | mov L->savedpc, eax // luaD_precall expects it there.
+ | mov ARG2, BASE
+ | sub BASE, L->stack // Preserve old BASE (= func).
+ | mov ARG1, L
+ | call &luaD_precall // luaD_precall(L, func, nresults)
+ | test eax,eax // Assumes: PCRLUA == 0
+ | jnz >2 // PCRC? PCRYIELD cannot happen.
+ |
+ | // Returned PCRLUA: need to call the bytecode interpreter.
+ | call &luaV_execute, L, 1
+ | // Indirect yield (L->status == LUA_YIELD) cannot happen.
+ |
+ |2: // Returned PCRC: compile & run done. Frame is already unwound.
+ | add esp, FRAME_OFFSET
+ | add BASE, L->stack // Restore stack-relative pointers BASE and TOP.
+ | mov TOP, L->top
+ | ret
+ |
+ |//-----------------------------------------------------------------------
+ | .align 16
+ |->GATE_JC: // JIT -> C callgate.
+ | lea eax, TOP[LUA_MINSTACK]
+ | sub esp, FRAME_OFFSET
+ | cmp eax, L->stack_last
+ | jae ->GROW_STACK // Stack overflow?
+ | cmp CI, L->end_ci
+ | lea CI, CI[1]
+ | je ->GROW_CI // CI overflow?
+ | mov L->ci, CI
+ | mov CI->func, BASE
+ | mov CI->top, eax
+ | mov CCLOSURE:edx, BASE->value
+ | add BASE, #BASE
+ | mov L->top, TOP
+ | mov L->base, BASE
+ | mov CI->base, BASE
+ | // ci->nresults is not set because we don't use luaD_poscall().
+ |
+ |->GATE_JC_PATCH: // Patch mark for jmp to GATE_JC_DEBUG.
+ |
+ | call aword CCLOSURE:edx->f, L // Call the C function.
+ |
+ |2: // Label used below!
+ | add esp, FRAME_OFFSET
+ | mov CI, L->ci
+ | TValuemul eax // eax = nresults*sizeof(TValue)
+ | mov TOP, CI->func
+ | jz >4 // Skip loop if nresults == 0.
+ | // Yield (-1) cannot happen.
+ | mov BASE, L->top
+ | mov edx, BASE
+ | sub BASE, eax // BASE = &L->top[-nresults]
+ |3: // Relocate [L->top-nresults, L->top) -> [ci->func, ci->func+nresults)
+ | mov eax, [BASE]
+ | add BASE, aword*1
+ | mov [TOP], eax
+ | add TOP, aword*1
+ | cmp BASE, edx
+ | jb <3
+ |
+ |4:
+ | mov BASE, CI->func
+ | sub CI, #CI
+ | mov L->ci, CI
+ | ret
+ |
+ |//-----------------------------------------------------------------------
+ | nop; nop; nop; nop; nop; nop // Save area. See DEBUGPATCH_SIZE.
+ | .align 16
+ |->GATE_JC_DEBUG: // JIT -> C callgate for debugging.
+ | test byte L->hookmask, LUA_MASKCALL // Need to call hook?
+ | jnz >7
+ |6:
+ | call aword CCLOSURE:edx->f, L // Call the C function.
+ |
+ | test byte L->hookmask, LUA_MASKRET // Need to call hook?
+ | jz <2
+ |
+ | // Return hook. TODO: LUA_HOOKTAILRET is not called since tailcalls == 0.
+ | mov BASE, eax // BASE (ebx) is callee-save.
+ | call &luaD_callhook, L, LUA_HOOKRET, -1
+ | mov eax, BASE
+ | jmp <2
+ |
+ |7: // Call hook.
+ | mov BASE, CCLOSURE:edx // BASE (ebx) is callee-save.
+ | call &luaD_callhook, L, LUA_HOOKCALL, -1
+ | mov CCLOSURE:edx, BASE
+ | jmp <6
+ |
+ |//-----------------------------------------------------------------------
+ | .align 16
+ |->GROW_STACK: // Grow stack. Jump from/to prologue.
+ | sub eax, TOP
+ | TValuediv eax // eax = (eax-TOP)/sizeof(TValue).
+ | mov L->top, TOP
+ | sub BASE, L->stack
+ | mov ARG3, CI
+ | call &luaD_growstack, L, eax
+ | mov CI, ARG3 // CI may not be in sync with L->ci.
+ | add BASE, L->stack // Restore stack-relative pointers.
+ | mov TOP, L->top
+ | mov LCL, BASE->value
+ | add esp, FRAME_OFFSET // Undo esp adjust of prologue/GATE_JC.
+ | jmp aword LCL->jit_gate // Retry prologue.
+ |
+ |//-----------------------------------------------------------------------
+ | .align 16
+ |->GROW_CI: // Grow CI. Jump from/to prologue.
+ | mov L->top, TOP // May throw LUA_ERRMEM, so save TOP.
+ | call &luaD_growCI, L
+ | lea CI, CINFO:eax[-1] // Undo ci++ (L->ci reset in prologue).
+ | mov LCL, BASE->value
+ | mov L->ci, CI
+ | add esp, FRAME_OFFSET // Undo esp adjust of prologue/GATE_JC.
+ | jmp aword LCL->jit_gate // Retry prologue.
+ |
+ |//-----------------------------------------------------------------------
+ |.dumpjsub // Dump all captured .jsub's.
+ |
+ |// Uncritical jsubs follow. No need to align them.
+ |//-----------------------------------------------------------------------
+ |->DEOPTIMIZE_CALLER: // Deoptimize calling instruction.
+ | pop edx
+ | jmp ->DEOPTIMIZE
+ |
+ |->DEOPTIMIZE_OPEN: // Deoptimize open instruction.
+ | mov L->top, TOP // Save TOP.
+ |
+ |->DEOPTIMIZE: // Deoptimize instruction.
+ | mov L->savedpc, edx // &J->nextins expected in edx.
+ | call &luaJIT_deoptimize, L
+ | mov BASE, L->base
+ | mov TOP, L->top // Restore TOP for open ins.
+ | jmp eax // Continue with new mcode addr.
+ |
+ | .align 16
+ |//-----------------------------------------------------------------------
+
+ (void)dasm_checkstep(Dst, DASM_SECTION_CODE);
+ status = luaJIT_link(J, &J->jsubmcode, &J->szjsubmcode);
+ if (status != JIT_S_OK)
+ return status;
+
+ /* Copy the callgates from the globals to the global state. */
+ G(J->L)->jit_gateLJ = (luaJIT_GateLJ)J->jsub[JSUB_GATE_LJ];
+ G(J->L)->jit_gateJL = (lua_CFunction)J->jsub[JSUB_GATE_JL];
+ G(J->L)->jit_gateJC = (lua_CFunction)J->jsub[JSUB_GATE_JC];
+ return JIT_S_OK;
+}
+
+/* Match with number of nops above. Avoid confusing the instruction decoder. */
+#define DEBUGPATCH_SIZE 6
+
+/* Notify backend that the debug mode may have changed. */
+void luaJIT_debugnotify(jit_State *J)
+{
+ unsigned char *patch = (unsigned char *)J->jsub[JSUB_GATE_JC_PATCH];
+ unsigned char *target = (unsigned char *)J->jsub[JSUB_GATE_JC_DEBUG];
+ /* Yep, this is self-modifying code -- don't tell anyone. */
+ if (patch[0] == 0xe9) { /* Debug patch is active. */
+ if (!(J->flags & JIT_F_DEBUG_CALL)) /* Deactivate it. */
+ memcpy(patch, target-DEBUGPATCH_SIZE, DEBUGPATCH_SIZE);
+ } else { /* Debug patch is inactive. */
+ if (J->flags & JIT_F_DEBUG_CALL) { /* Activate it. */
+ int rel = target-(patch+5);
+ memcpy(target-DEBUGPATCH_SIZE, patch, DEBUGPATCH_SIZE);
+ patch[0] = 0xe9; /* jmp */
+ memcpy(patch+1, &rel, 4); /* Relative address. */
+ memset(patch+5, 0x90, DEBUGPATCH_SIZE-5); /* nop */
+ }
+ }
+}
+
+/* Patch a jmp into existing mcode. */
+static void jit_patch_jmp(jit_State *J, void *mcode, void *to)
+{
+ unsigned char *patch = (unsigned char *)mcode;
+ int rel = ((unsigned char *)to)-(patch+5);
+ patch[0] = 0xe9; /* jmp */
+ memcpy((void *)(patch+1), &rel, 4); /* Relative addr. */
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Call line/count hook. */
+static void jit_hookins(lua_State *L, const Instruction *newpc)
+{
+ Proto *pt = ci_func(L->ci)->l.p;
+ int pc = luaJIT_findpc(pt, newpc); /* Sloooow with mcode addrs. */
+ const Instruction *savedpc = L->savedpc;
+ L->savedpc = pt->code + pc + 1;
+ if (L->hookmask > LUA_MASKLINE && L->hookcount == 0) {
+ resethookcount(L);
+ luaD_callhook(L, LUA_HOOKCOUNT, -1);
+ }
+ if (L->hookmask & LUA_MASKLINE) {
+ int newline = getline(pt, pc);
+ if (pc != 0) {
+ int oldpc = luaJIT_findpc(pt, savedpc);
+ if (!(pc <= oldpc || newline != getline(pt, oldpc))) return;
+ }
+ luaD_callhook(L, LUA_HOOKLINE, newline);
+ }
+}
+
+/* Insert hook check for each instruction in full debug mode. */
+static void jit_ins_debug(jit_State *J, int openop)
+{
+ if (openop) {
+ | mov L->top, TOP
+ }
+ |// TODO: Passing bytecode addrs would speed this up (but use more space).
+ | call ->HOOKINS
+
+ |.jsub HOOKINS
+ | test byte L->hookmask, LUA_MASKLINE|LUA_MASKCOUNT
+ | jz >2
+ | dec dword L->hookcount
+ | jz >1
+ | test byte L->hookmask, LUA_MASKLINE
+ | jz >2
+ |1:
+ | mov eax, [esp] // Current machine code address.
+ | sub esp, FRAME_OFFSET
+ | call &jit_hookins, L, eax
+ | add esp, FRAME_OFFSET
+ | mov BASE, L->base // Restore stack-relative pointers.
+ | mov TOP, L->top
+ |2:
+ | ret
+ |.endjsub
+}
+
+/* Called before every instruction. */
+static void jit_ins_start(jit_State *J)
+{
+ |// Always emit PC labels, even for dead code (but not for combined JMP).
+ |=>J->nextpc:
+}
+
+/* Chain to another instruction. */
+static void jit_ins_chainto(jit_State *J, int pc)
+{
+ | jmp =>pc
+}
+
+/* Set PC label. */
+static void jit_ins_setpc(jit_State *J, int pc, void *target)
+{
+ |.label =>pc, &target
+}
+
+/* Called after the last instruction has been encoded. */
+static void jit_ins_last(jit_State *J, int lastpc, int sizemfm)
+{
+ if (J->tflags & JIT_TF_USED_DEOPT) { /* Deopt section has been used? */
+ |.deopt
+ | jmp ->DEOPTIMIZE // Yes, need to add final jmp.
+ |.code
+ }
+ |=>lastpc+1: // Extra label at the end of .code.
+ |.tail
+ |=>lastpc+2: // And at the end of .deopt/.tail.
+ | .align word // Keep next section word aligned.
+ | .word 0xffff // Terminate mfm with JIT_MFM_STOP.
+ |.mfmap
+ | // <-- Deoptimization hints are inserted here.
+ | .space sizemfm // To be filled in with inverse mfm.
+ | .aword 0, 0 // Next mcode block pointer and size.
+ | // The previous two awords are only word, but not aword aligned.
+ | // Copying them is easier than aligning them and adjusting mfm handling.
+ |.code
+}
+
+/* Add a deoptimize target for the current instruction. */
+static void jit_deopt_target(jit_State *J, int nargs)
+{
+ |.define L_DEOPTLABEL, 9 // Local deopt label.
+ |.define L_DEOPTIMIZE, <9 // Local deopt target. Use after call.
+ |.define L_DEOPTIMIZEF, >9 // Local deopt target. Use before call.
+ if (nargs != -1) {
+ |// Alas, x86 doesn't have conditional calls. So branch to the .deopt
+ |// section to load J->nextins and jump to JSUB_DEOPTIMIZE.
+ |// Only a single jump is added at the end (if needed) and any
+ |// intervening code sequences are shadowed (lea trick).
+ |.deopt // Occupies 6 bytes in .deopt section.
+ | .byte 0x8d // Shadow mov with lea edi, [edx+ofs].
+ |L_DEOPTLABEL:
+ | mov edx, &J->nextins // Current instruction + 1.
+ |.code
+ J->tflags |= JIT_TF_USED_DEOPT;
+ } else {
+ |.tail // Occupies 10 bytes in .tail section.
+ |L_DEOPTLABEL:
+ | mov edx, &J->nextins
+ | jmp ->DEOPTIMIZE_OPEN // Open ins need to save TOP, too.
+ | // And TOP (edi) would be overwritten by the lea trick.
+ | // So checking for open ops later on wouldn't suffice. Sigh.
+ |.code
+ }
+}
+
+/* luaC_checkGC() inlined. Destroys caller-saves + TOP (edi). Uses label 7:. */
+/* Use this only at the _end_ of an instruction. */
+static void jit_checkGC(jit_State *J)
+{
+ | mov GL:ecx, L->l_G
+ | mov eax, GL:ecx->totalbytes // size_t
+ | mov TOP, >7
+ | cmp eax, GL:ecx->GCthreshold // size_t
+ | jae ->GCSTEP
+ |7:
+
+ |.jsub GCSTEP
+ | call &luaC_step, L
+ | mov BASE, L->base
+ | jmp TOP
+ |.endjsub
+}
+
+/* ------------------------------------------------------------------------ */
+
+|// JIT->JIT calling conventions:
+|//
+|// Register/Type | Call Setup | Prologue | Epilogue | Call Finish
+|// ===========================================================================
+|// eax | LCL | = BASE->value| | * | *
+|// ecx | CI | = L->ci | L->ci = ++CI | * | *
+|// edx | * | * | * | * | *
+|// ---------------------------------------------------------------------------
+|// esi | L | | | |
+|// ebx | BASE | += f | ++ | -- | -= f
+|// edi | TOP | += f+1+nargs | = BASE+maxst | = f+nresults | = BASE+maxst
+|// ---------------------------------------------------------------------------
+|// L->base | | = BASE | | = BASE
+|// L->top | | = TOP | | = TOP
+|// L->ci | | ++, -> = ... | -- |
+|// L->ci->savedpc| = &code[pc] | [ L-> = ] | |
+|// ---------------------------------------------------------------------------
+|// args + vars | | setnil | |
+|// results | | | move | setnil
+|// ---------------------------------------------------------------------------
+
+
+|// Include support for function inlining.
+|.include ljit_x86_inline.dash
+
+
+#ifdef LUA_COMPAT_VARARG
+static void jit_vararg_table(lua_State *L)
+{
+ Table *tab;
+ StkId base, func;
+ int i, num, numparams;
+ luaC_checkGC(L);
+ base = L->base;
+ func = L->ci->func;
+ numparams = clvalue(func)->l.p->numparams;
+ num = base - func - numparams - 1;
+ tab = luaH_new(L, num, 1);
+ for (i = 0; i < num; i++)
+ setobj2n(L, luaH_setnum(L, tab, i+1), base - num + i);
+ setnvalue(luaH_setstr(L, tab, luaS_newliteral(L, "n")), (lua_Number)num);
+ sethvalue(L, base + numparams, tab);
+}
+#endif
+
+/* Encode JIT function prologue. */
+static void jit_prologue(jit_State *J)
+{
+ Proto *pt = J->pt;
+ int numparams = pt->numparams;
+ int stacksize = pt->maxstacksize;
+
+ |// Note: the order of the following instructions has been carefully tuned.
+ | lea eax, TOP[stacksize]
+ | sub esp, FRAME_OFFSET
+ | cmp eax, L->stack_last
+ | jae ->GROW_STACK // Stack overflow?
+ | // This is a slight overallocation (BASE[1+stacksize] would be enough).
+ | // We duplicate luaD_precall() behaviour so we can use luaD_growstack().
+ | cmp CI, L->end_ci
+ | lea CI, CI[1]
+ | je ->GROW_CI // CI overflow?
+ | xor eax, eax // Assumes: LUA_TNIL == 0
+ | mov CI->func, BASE
+ | add BASE, #BASE
+ | mov L->ci, CI
+
+ if (numparams > 0) {
+ | lea edx, BASE[numparams]
+ | cmp TOP, edx // L->top >< L->base+numparams ?
+ }
+
+ if (!pt->is_vararg) { /* Fixarg function. */
+ /* Must cap L->top at L->base+numparams because 1st LOADNIL is omitted. */
+ if (numparams == 0) {
+ | mov TOP, BASE
+ } else if (J->flags & JIT_F_CPU_CMOV) {
+ | cmova TOP, edx
+ } else {
+ | jna >1
+ | mov TOP, edx
+ |1:
+ }
+ | lea edx, BASE[stacksize] // New ci->top.
+ | mov CI->tailcalls, eax // 0
+ | mov CI->top, edx
+ | mov L->top, edx
+ | mov L->base, BASE
+ | mov CI->base, BASE
+ } else { /* Vararg function. */
+ int i;
+ if (numparams > 0) {
+ |// If some fixargs are missing we need to clear them and
+ |// bump TOP to get a consistent frame layout for OP_VARARG.
+ | jb >5
+ |4:
+ |.tail
+ |5: // This is uncommon. So move it to .tail and use a loop.
+ | mov TOP->tt, eax
+ | add TOP, #TOP
+ | cmp TOP, edx
+ | jb <5
+ | jmp <4
+ |.code
+ }
+ | mov L->base, TOP // New base is after last arg.
+ | mov CI->base, TOP
+ | mov CI->tailcalls, eax // 0
+ for (i = 0; i < numparams; i++) { /* Move/clear fixargs. */
+ |// Inline this. Vararg funcs usually have very few fixargs.
+ | copyslot TOP[i], BASE[i], ecx, edx
+ | mov BASE[i].tt, eax // Clear old fixarg slot (help the GC).
+ }
+ if (numparams > 0) {
+ | mov CI, L->ci // Reload CI = ecx (used by move).
+ }
+ | mov BASE, TOP
+ | lea edx, BASE[stacksize] // New ci->top.
+ | lea TOP, BASE[numparams] // Start of vars to clear.
+ | mov CI->top, edx
+ | mov L->top, edx
+ stacksize -= numparams; /* Fixargs are already cleared. */
+ }
+
+ /* Clear undefined args and all vars. Still assumes eax = LUA_TNIL = 0. */
+ /* Note: cannot clear only args because L->top has grown. */
+ if (stacksize <= EXTRA_STACK) { /* Loopless clear. May use EXTRA_STACK. */
+ int i;
+ for (i = 0; i < stacksize; i++) {
+ | mov TOP[i].tt, eax
+ }
+ } else { /* Standard loop. */
+ |2: // Unrolled for 2 stack slots. No initial check. May use EXTRA_STACK.
+ | mov TOP[0].tt, eax
+ | mov TOP[1].tt, eax
+ | add TOP, 2*#TOP
+ | cmp TOP, edx
+ | jb <2
+ |// Note: TOP is undefined now. TOP is only valid across calls/open ins.
+ }
+
+#ifdef LUA_COMPAT_VARARG
+ if (pt->is_vararg & VARARG_NEEDSARG) {
+ | call &jit_vararg_table, L
+ }
+#endif
+
+ /* Call hook check. */
+ if (J->flags & JIT_F_DEBUG_CALL) {
+ | test byte L->hookmask, LUA_MASKCALL
+ | jz >9
+ | call ->HOOKCALL
+ |9:
+
+ |.jsub HOOKCALL
+ | mov CI, L->ci
+ | mov TOP, CI->func
+ | mov LCL, TOP->value
+ | mov PROTO:edi, LCL->p // clvalue(L->ci->func)->l.p
+ | mov eax, PROTO:edi->code
+ | add eax, 4 // Hooks expect incremented PC.
+ | mov L->savedpc, eax
+ | sub esp, FRAME_OFFSET
+ | call &luaD_callhook, L, LUA_HOOKCALL, -1
+ | add esp, FRAME_OFFSET
+ | mov eax, PROTO:edi->code // PROTO:edi is callee-save.
+ | mov L->savedpc, eax // jit_hookins needs previous PC.
+ | mov BASE, L->base
+ | ret
+ |.endjsub
+ }
+}
+
+/* Check if we can combine 'return const'. */
+static int jit_return_k(jit_State *J)
+{
+ if (!J->combine) return 0; /* COMBINE hint set? */
+ /* May need to close open upvalues. */
+ if (!fhint_isset(J, NOCLOSE)) {
+ | call &luaF_close, L, BASE
+ }
+ if (!J->pt->is_vararg) { /* Fixarg function. */
+ | sub aword L->ci, #CI
+ | mov TOP, BASE
+ | sub BASE, #BASE
+ | add esp, FRAME_OFFSET
+ } else { /* Vararg function. */
+ | mov CI, L->ci
+ | mov BASE, CI->func
+ | sub CI, #CI
+ | mov L->ci, CI
+ | lea TOP, BASE[1]
+ | add esp, FRAME_OFFSET
+ }
+ jit_assert(J->combine == 1); /* Required to skip next RETURN instruction. */
+ return 1;
+}
+
+static void jit_op_return(jit_State *J, int rbase, int nresults)
+{
+ /* Return hook check. */
+ if (J->flags & JIT_F_DEBUG_CALL) {
+ if (nresults < 0 && !(J->flags & JIT_F_DEBUG_INS)) {
+ | mov L->top, TOP
+ }
+ |// TODO: LUA_HOOKTAILRET (+ ci->tailcalls counting) or changed debug API.
+ | test byte L->hookmask, LUA_MASKRET
+ | jz >7
+ | call ->HOOKRET
+ |7:
+ if (J->flags & JIT_F_DEBUG_INS) {
+ | mov eax, FRAME_RETADDR
+ | mov L->savedpc, eax
+ }
+
+ |.jsub HOOKRET
+ | mov eax, [esp] // Current machine code address.
+ | mov L->savedpc, eax
+ | sub esp, FRAME_OFFSET
+ | call &luaD_callhook, L, LUA_HOOKRET, -1
+ | add esp, FRAME_OFFSET
+ | mov BASE, L->base // Restore stack-relative pointers.
+ | mov TOP, L->top
+ | ret
+ |.endjsub
+ }
+
+ /* May need to close open upvalues. */
+ if (!fhint_isset(J, NOCLOSE)) {
+ | call &luaF_close, L, BASE
+ }
+
+ /* Previous op was open: 'return f()' or 'return ...' */
+ if (nresults < 0) {
+ |// Relocate [BASE+rbase, TOP) -> [ci->func, *).
+ | mov CI, L->ci
+ | addidx BASE, rbase
+ | mov edx, CI->func
+ | cmp BASE, TOP
+ | jnb >2
+ |1:
+ | mov eax, [BASE]
+ | add BASE, aword*1
+ | mov [edx], eax
+ | add edx, aword*1
+ | cmp BASE, TOP
+ | jb <1
+ |2:
+ | add esp, FRAME_OFFSET
+ | mov BASE, CI->func
+ | sub CI, #CI
+ | mov TOP, edx // Relocated TOP.
+ | mov L->ci, CI
+ | ret
+ return;
+ }
+
+ if (!J->pt->is_vararg) { /* Fixarg function, nresults >= 0. */
+ int i;
+ | sub aword L->ci, #CI
+ |// Relocate [BASE+rbase,BASE+rbase+nresults) -> [BASE-1, *).
+ |// TODO: loop for large nresults?
+ | sub BASE, #BASE
+ for (i = 0; i < nresults; i++) {
+ | copyslot BASE[i], BASE[rbase+i+1]
+ }
+ | add esp, FRAME_OFFSET
+ | lea TOP, BASE[nresults]
+ | ret
+ } else { /* Vararg function, nresults >= 0. */
+ int i;
+ |// Relocate [BASE+rbase,BASE+rbase+nresults) -> [ci->func, *).
+ | mov CI, L->ci
+ | mov TOP, CI->func
+ | sub CI, #CI
+ | mov L->ci, CI // CI = ecx is used by copyslot.
+ for (i = 0; i < nresults; i++) {
+ | copyslot TOP[i], BASE[rbase+i]
+ }
+ | add esp, FRAME_OFFSET
+ | mov BASE, TOP
+ | addidx TOP, nresults
+ | ret
+ }
+}
+
+static void jit_op_call(jit_State *J, int func, int nargs, int nresults)
+{
+ int cltype = jit_inline_call(J, func, nargs, nresults);
+ if (cltype < 0) return; /* Inlined? */
+
+ |// Note: the order of the following instructions has been carefully tuned.
+ | addidx BASE, func
+ | mov CI, L->ci
+ | isfunction 0 // BASE[0] is L->base[func].
+ if (nargs >= 0) { /* Previous op was not open and did not set TOP. */
+ | lea TOP, BASE[1+nargs]
+ }
+ | mov LCL, BASE->value
+ | mov edx, &J->nextins
+ | mov CI->savedpc, edx
+ if (cltype == LUA_TFUNCTION) {
+ if (nargs == -1) {
+ | jne ->DEOPTIMIZE_OPEN // TYPE hint was wrong (open op)?
+ } else {
+ | jne ->DEOPTIMIZE // TYPE hint was wrong?
+ }
+ } else {
+ | je >1 // Skip __call handling for functions.
+ | call ->METACALL
+ |1:
+
+ |.jsub METACALL // CALL to __call metamethod.
+ | sub esp, FRAME_OFFSET
+ | mov L->savedpc, edx // May throw errors. Save PC and TOP.
+ | mov L->top, TOP
+ | call &luaD_tryfuncTM, L, BASE // Resolve __call metamethod.
+ | add esp, FRAME_OFFSET
+ | mov BASE, eax // Restore stack-relative pointers.
+ | mov TOP, L->top
+ | mov LCL, BASE->value
+ | mov CI, L->ci
+ | ret
+ |.endjsub
+ }
+ | call aword LCL->jit_gate // Call JIT func or GATE_JL/GATE_JC.
+ | subidx BASE, func
+ | mov L->base, BASE
+
+ /* Clear undefined results TOP <= o < func+nresults. */
+ if (nresults > 0) {
+ | xor eax, eax
+ if (nresults <= EXTRA_STACK) { /* Loopless clear. May use EXTRA_STACK. */
+ int i;
+ for (i = 0; i < nresults; i++) {
+ | mov TOP[i].tt, eax
+ }
+ } else { /* Standard loop. TODO: move to .tail? */
+ | lea edx, BASE[func+nresults]
+ |1: // Unrolled for 2 stack slots. No initial check. May use EXTRA_STACK.
+ | mov TOP[0].tt, eax // LUA_TNIL
+ | mov TOP[1].tt, eax // LUA_TNIL
+ | add TOP, 2*#TOP
+ | cmp TOP, edx
+ | jb <1
+ }
+ }
+
+ if (nresults >= 0) { /* Not an open ins. Restore L->top. */
+ | lea TOP, BASE[J->pt->maxstacksize] // Faster than getting L->ci->top.
+ | mov L->top, TOP
+ } /* Otherwise keep TOP for next instruction. */
+}
+
+static void jit_op_tailcall(jit_State *J, int func, int nargs)
+{
+ int cltype;
+
+ if (!fhint_isset(J, NOCLOSE)) { /* May need to close open upvalues. */
+ | call &luaF_close, L, BASE
+ }
+
+ cltype = jit_inline_call(J, func, nargs, -2);
+ if (cltype < 0) goto finish; /* Inlined? */
+
+ if (cltype == LUA_TFUNCTION) {
+ jit_deopt_target(J, nargs);
+ | isfunction func
+ | jne L_DEOPTIMIZE // TYPE hint was wrong?
+ } else {
+ | isfunction func; jne >5 // Handle generic callables first.
+ |.tail
+ |5: // Fallback for generic callables.
+ | addidx BASE, func
+ if (nargs >= 0) {
+ | lea TOP, BASE[1+nargs]
+ }
+ | mov edx, &J->nextins
+ | jmp ->METATAILCALL
+ |.code
+
+ |.jsub METATAILCALL // TAILCALL to __call metamethod.
+ | mov L->savedpc, edx
+ | mov L->top, TOP
+ | call &luaD_tryfuncTM, L, BASE // Resolve __call metamethod.
+ |
+ |// Relocate [eax, L->top) -> [L->ci->func, *).
+ | mov CI, L->ci
+ | mov edx, L->top
+ | mov TOP, CI->func
+ |1:
+ | mov BASE, [eax]
+ | add eax, aword*1
+ | mov [TOP], BASE
+ | add TOP, aword*1
+ | cmp eax, edx
+ | jb <1
+ |
+ | mov BASE, CI->func
+ | mov LCL, BASE->value
+ | sub CI, #CI
+ | add esp, FRAME_OFFSET
+ | jmp aword LCL->jit_gate // Chain to callgate.
+ |.endjsub
+ }
+
+ if (nargs >= 0) { /* Previous op was not open and did not set TOP. */
+ int i;
+ /* Relocate [BASE+func, BASE+func+nargs] -> [ci->func, ci->func+nargs]. */
+ /* TODO: loop for large nargs? */
+ if (!J->pt->is_vararg) { /* Fixarg function. */
+ | mov LCL, BASE[func].value
+ for (i = 0; i < nargs; i++) {
+ | copyslot BASE[i], BASE[func+1+i], ecx, edx
+ }
+ | lea TOP, BASE[nargs]
+ | sub BASE, #BASE
+ | mov CI, L->ci
+ | mov BASE->value, LCL // Sufficient to copy func->value.
+ } else { /* Vararg function. */
+ | mov CI, L->ci
+ | lea TOP, BASE[func]
+ | mov BASE, CI->func
+ | mov LCL, TOP->value
+ | mov BASE->value, LCL // Sufficient to copy func->value.
+ for (i = 0; i < nargs; i++) {
+ | copyslot BASE[i+1], TOP[i+1], eax, edx
+ }
+ | lea TOP, BASE[1+nargs]
+ | mov LCL, BASE->value // Need to reload LCL = eax.
+ }
+ } else { /* Previous op was open and set TOP. */
+ |// Relocate [BASE+func, TOP) -> [ci->func, *).
+ | mov CI, L->ci
+ | addidx BASE, func
+ | mov edx, CI->func
+ |1:
+ | mov eax, [BASE]
+ | add BASE, aword*1
+ | mov [edx], eax
+ | add edx, aword*1
+ | cmp BASE, TOP
+ | jb <1
+ | mov BASE, CI->func
+ | mov TOP, edx // Relocated TOP.
+ | mov LCL, BASE->value
+ }
+ | sub CI, #CI
+ | add esp, FRAME_OFFSET
+ | jmp aword LCL->jit_gate // Chain to JIT function.
+
+finish:
+ J->combine++; /* Combine with following return instruction. */
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_move(jit_State *J, int dest, int src)
+{
+ | copyslot BASE[dest], BASE[src]
+}
+
+static void jit_op_loadk(jit_State *J, int dest, int kidx)
+{
+ const TValue *kk = &J->pt->k[kidx];
+ int rk = jit_return_k(J);
+ if (rk) dest = 0;
+ | copyconst BASE[dest], kk
+ if (rk) {
+ | ret
+ }
+}
+
+static void jit_op_loadnil(jit_State *J, int first, int last)
+{
+ int idx, num = last - first + 1;
+ int rk = jit_return_k(J);
+ | xor eax, eax // Assumes: LUA_TNIL == 0
+ if (rk) {
+ | settt BASE[0], eax
+ | ret
+ } else if (num <= 8) {
+ for (idx = first; idx <= last; idx++) {
+ | settt BASE[idx], eax // 3/6 bytes
+ }
+ } else {
+ | lea ecx, BASE[first].tt // 15-21 bytes
+ | lea edx, BASE[last].tt
+ |1:
+ | mov [ecx], eax
+ | cmp ecx, edx
+ | lea ecx, [ecx+#BASE] // Preserves CC.
+ | jbe <1
+ }
+}
+
+static void jit_op_loadbool(jit_State *J, int dest, int b, int dojump)
+{
+ int rk = jit_return_k(J);
+ if (rk) dest = 0;
+ | setbvalue BASE[dest], b
+ if (rk) {
+ | ret
+ } else if (dojump) {
+ const TValue *h = hint_getpc(J, COMBINE, J->nextpc);
+ if (!(ttisboolean(h) && bvalue(h) == 0)) { /* Avoid jmp around dead ins. */
+ | jmp =>J->nextpc+1
+ }
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_getupval(jit_State *J, int dest, int uvidx)
+{
+ | getLCL
+ | mov UPVAL:ecx, LCL->upvals[uvidx]
+ | mov TOP, UPVAL:ecx->v
+ | copyslot BASE[dest], TOP[0]
+}
+
+static void jit_op_setupval(jit_State *J, int src, int uvidx)
+{
+ | getLCL
+ | mov UPVAL:ecx, LCL->upvals[uvidx]
+ | mov TOP, UPVAL:ecx->v
+ | // This is really copyslot TOP[0], BASE[src] with compare mixed in.
+ | mov eax, BASE[src].tt
+ | mov GCOBJECT:edx, BASE[src].value
+ | mov TOP->tt, eax
+ | cmp eax, LUA_TSTRING // iscollectable(val)?
+ | mov eax, BASE[src].value.na[1]
+ | mov TOP->value, GCOBJECT:edx
+ | mov TOP->value.na[1], eax
+ | jae >5
+ |4:
+ |.tail
+ |5:
+ | test byte GCOBJECT:edx->gch.marked, WHITEBITS // && iswhite(val)
+ | jz <4
+ | test byte UPVAL:ecx->marked, bitmask(BLACKBIT) // && isblack(uv)
+ | jz <4
+ | call ->BARRIERF // Yes, need barrier.
+ | jmp <4
+ |.code
+
+ |.jsub BARRIERF // luaC_barrierf() with regparms.
+ | mov ARG4, GCOBJECT:edx
+ | mov ARG3, UPVAL:ecx
+ | mov ARG2, L
+ | jmp &luaC_barrierf // Chain to C code.
+ |.endjsub
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Optimized table lookup routines. Enter via jsub, fallback to C. */
+
+/* Fallback for GETTABLE_*. Temporary key is in L->env. */
+static void jit_gettable_fb(lua_State *L, Table *t, StkId dest)
+{
+ Table *mt = t->metatable;
+ const TValue *tm = luaH_getstr(mt, G(L)->tmname[TM_INDEX]);
+ if (ttisnil(tm)) { /* No __index method? */
+ mt->flags |= 1<<TM_INDEX; /* Cache this fact. */
+ setnilvalue(dest);
+ } else if (ttisfunction(tm)) { /* __index function? */
+ ptrdiff_t destr = savestack(L, dest);
+ setobj2s(L, L->top, tm);
+ sethvalue(L, L->top+1, t);
+ setobj2s(L, L->top+2, &L->env);
+ luaD_checkstack(L, 3);
+ L->top += 3;
+ luaD_call(L, L->top - 3, 1);
+ dest = restorestack(L, destr);
+ L->top--;
+ setobjs2s(L, dest, L->top);
+ } else { /* Let luaV_gettable() continue with the __index object. */
+ luaV_gettable(L, tm, &L->env, dest);
+ }
+
+ |//-----------------------------------------------------------------------
+ |.jsub GETGLOBAL // Lookup global variable.
+ |// Call with: TSTRING:edx (key), BASE (dest)
+ | mov CI, L->ci
+ | mov TOP, CI->func
+ | mov LCL, TOP->value
+ | mov TABLE:edi, LCL->env
+ | jmp >9
+ |.endjsub
+ |
+ |//-----------------------------------------------------------------------
+ |.jsub GETTABLE_KSTR // Lookup constant string in table.
+ |// Call with: TOP (tab), TSTRING:edx (key), BASE (dest)
+ | cmp dword TOP->tt, LUA_TTABLE
+ | mov TABLE:edi, TOP->value
+ | jne ->DEOPTIMIZE_CALLER // Not a table? Deoptimize.
+ |
+ |// Common entry: TABLE:edi (tab), TSTRING:edx (key), BASE (dest)
+ |// Restores BASE, destroys eax, ecx, edx, edi (TOP).
+ |9:
+ | movzx ecx, byte TABLE:edi->lsizenode // hashstr(t, key).
+ | mov eax, 1
+ | shl eax, cl
+ | dec eax
+ | and eax, TSTRING:edx->tsv.hash
+ | Nodemul NODE:eax
+ | add NODE:eax, TABLE:edi->node
+ |
+ |1: // Start of inner loop. Check node key.
+ | cmp dword NODE:eax->i_key.nk.tt, LUA_TSTRING
+ | jne >2
+ | cmp aword NODE:eax->i_key.nk.value, TSTRING:edx
+ | jne >2
+ | // Note: swapping the two checks is faster, but valgrind complains.
+ |// Assumes: (int)&(((Node *)0)->i_val) == (int)&(((StkId)0)->value)
+ |
+ |// Ok, key found. Copy node value to destination (stack) slot.
+ | mov ecx, NODE:eax->i_val.tt
+ | test ecx, ecx; je >3 // Node has nil value?
+ ||if (J->flags & JIT_F_CPU_SSE2) {
+ | movq xmm0, qword NODE:eax->i_val.value
+ | movq qword BASE->value, xmm0
+ ||} else {
+ | mov edx, NODE:eax->i_val.value
+ | mov edi, NODE:eax->i_val.value.na[1]
+ | mov BASE->value, edx
+ | mov BASE->value.na[1], edi
+ ||}
+ | mov BASE->tt, ecx
+ | mov BASE, L->base
+ | ret
+ |2:
+ | mov NODE:eax, NODE:eax->i_key.nk.next // Get next key in chain.
+ | test NODE:eax, NODE:eax
+ | jnz <1 // Loop if non-NULL.
+ |
+ | xor ecx, ecx
+ |3:
+ | mov TABLE:eax, TABLE:edi->metatable
+ | test TABLE:eax, TABLE:eax
+ | jz >4 // No metatable?
+ | test byte TABLE:eax->flags, 1<<TM_INDEX
+ | jz >5 // Or 'no __index' flag set?
+ |4:
+ | settt BASE[0], ecx // Yes, set to nil.
+ | mov BASE, L->base
+ | ret
+ |
+ |5: // Otherwise chain to C code which eventually calls luaV_gettable.
+ | setsvalue L->env, TSTRING:edx // Use L->env as temp key.
+ | mov ecx, [esp]
+ | sub esp, FRAME_OFFSET
+ | mov L->savedpc, ecx
+ | call &jit_gettable_fb, L, TABLE:edi, BASE
+ | add esp, FRAME_OFFSET
+ | mov BASE, L->base
+ | ret
+ |.endjsub
+ |
+ |//-----------------------------------------------------------------------
+ |.jsub GETTABLE_STR // Lookup string in table.
+ |// Call with: TOP (tab), TVALUE:ecx (key), BASE (dest)
+ | mov eax, TOP->tt; shl eax, 4; or eax, TVALUE:ecx->tt
+ | cmp eax, LUA_TTABLE_STR
+ | mov TABLE:edi, TOP->value
+ | mov TSTRING:edx, TVALUE:ecx->value
+ | je <9 // Types ok? Continue above.
+ | jmp ->DEOPTIMIZE_CALLER // Otherwise deoptimize.
+ |.endjsub
+}
+
+/* Fallback for SETTABLE_*STR. Temporary (string) key is in L->env. */
+static void jit_settable_fb(lua_State *L, Table *t, StkId val)
+{
+ Table *mt = t->metatable;
+ const TValue *tm = luaH_getstr(mt, G(L)->tmname[TM_NEWINDEX]);
+ if (ttisnil(tm)) { /* No __newindex method? */
+ mt->flags |= 1<<TM_NEWINDEX; /* Cache this fact. */
+ t->flags = 0; /* But need to clear the cache for the table itself. */
+ setobj2t(L, luaH_setstr(L, t, rawtsvalue(&L->env)), val);
+ luaC_barriert(L, t, val);
+ } else if (ttisfunction(tm)) { /* __newindex function? */
+ setobj2s(L, L->top, tm);
+ sethvalue(L, L->top+1, t);
+ setobj2s(L, L->top+2, &L->env);
+ setobj2s(L, L->top+3, val);
+ luaD_checkstack(L, 4);
+ L->top += 4;
+ luaD_call(L, L->top - 4, 0);
+ } else { /* Let luaV_settable() continue with the __newindex object. */
+ luaV_settable(L, tm, &L->env, val);
+ }
+
+ |//-----------------------------------------------------------------------
+ |.jsub BARRIERBACK // luaC_barrierback() with regparms.
+ |// Call with: TABLE:edi (table). Destroys ecx, edx.
+ | mov GL:ecx, L->l_G
+ | and byte TABLE:edi->marked, (~bitmask(BLACKBIT))&0xff
+ | mov edx, GL:ecx->grayagain
+ | mov GL:ecx->grayagain, TABLE:edi
+ | mov TABLE:edi->gclist, edx
+ | ret
+ |.endjsub
+ |
+ |//-----------------------------------------------------------------------
+ |.jsub SETGLOBAL // Set global variable.
+ |// Call with: TSTRING:edx (key), BASE (val)
+ | mov CI, L->ci
+ | mov TOP, CI->func
+ | mov LCL, TOP->value
+ | mov TABLE:edi, LCL->env
+ | jmp >9
+ |.endjsub
+ |
+ |//-----------------------------------------------------------------------
+ |.jsub SETTABLE_KSTR // Set constant string entry in table.
+ |// Call with: TOP (tab), TSTRING:edx (key), BASE (val)
+ | cmp dword TOP->tt, LUA_TTABLE
+ | mov TABLE:edi, TOP->value
+ | jne ->DEOPTIMIZE_CALLER // Not a table? Deoptimize.
+ |
+ |// Common entry: TABLE:edi (tab), TSTRING:edx (key), BASE (val)
+ |// Restores BASE, destroys eax, ecx, edx, edi (TOP).
+ |9:
+ | movzx ecx, byte TABLE:edi->lsizenode // hashstr(t, key).
+ | mov eax, 1
+ | shl eax, cl
+ | dec eax
+ | and eax, TSTRING:edx->tsv.hash
+ | Nodemul NODE:eax
+ | add NODE:eax, TABLE:edi->node
+ |
+ |1: // Start of inner loop. Check node key.
+ | cmp dword NODE:eax->i_key.nk.tt, LUA_TSTRING
+ | jne >4
+ | cmp aword NODE:eax->i_key.nk.value, TSTRING:edx
+ | jne >4
+ | // Note: swapping the two checks is faster, but valgrind complains.
+ |
+ |// Ok, key found. Copy new value to node value.
+ | cmp dword NODE:eax->i_val.tt, LUA_TNIL // Previous value is nil?
+ | je >6
+ | // Assumes: (int)&(((Node *)0)->i_val) == (int)&(((StkId)0)->value)
+ |2:
+ | mov byte TABLE:edi->flags, 0 // Clear metamethod cache.
+ |3: // Target for SETTABLE_NUM below.
+ | test byte TABLE:edi->marked, bitmask(BLACKBIT) // isblack(table)
+ | jnz >8 // Unlikely, but set barrier back.
+ |7: // Caveat: recycled label.
+ | copyslot TVALUE:eax[0], BASE[0], ecx, edx, TOP
+ | mov BASE, L->base
+ | ret
+ |
+ |8: // Avoid valiswhite() check -- black2gray(table) is ok.
+ | call ->BARRIERBACK
+ | jmp <7
+ |
+ |4:
+ | mov NODE:eax, NODE:eax->i_key.nk.next // Get next key in chain.
+ | test NODE:eax, NODE:eax
+ | jnz <1 // Loop if non-NULL.
+ |
+ |// Key not found. Add a new one, but check metatable first.
+ | mov TABLE:ecx, TABLE:edi->metatable
+ | test TABLE:ecx, TABLE:ecx
+ | jz >5 // No metatable?
+ | test byte TABLE:ecx->flags, 1<<TM_NEWINDEX
+ | jz >7 // Or 'no __newindex' flag set?
+ |
+ |5: // Add new key.
+ | // No need for setting L->savedpc since only LUA_ERRMEM may be thrown.
+ | lea TVALUE:eax, L->env
+ | setsvalue TVALUE:eax[0], TSTRING:edx
+ | sub esp, FRAME_OFFSET
+ | call &luaH_newkey, L, TABLE:edi, TVALUE:eax
+ | add esp, FRAME_OFFSET
+ | jmp <2 // Copy to the returned value. See Node/TValue assumption above.
+ |
+ |6: // Key found, but previous value is nil.
+ | mov TABLE:ecx, TABLE:edi->metatable
+ | test TABLE:ecx, TABLE:ecx
+ | jz <2 // No metatable?
+ | test byte TABLE:ecx->flags, 1<<TM_NEWINDEX
+ | jnz <2 // Or 'no __newindex' flag set?
+ |
+ |7: // Otherwise chain to C code which eventually calls luaV_settable.
+ | setsvalue L->env, TSTRING:edx // Use L->env as temp key.
+ | mov ecx, [esp]
+ | sub esp, FRAME_OFFSET
+ | mov L->savedpc, ecx
+ | call &jit_settable_fb, L, TABLE:edi, BASE
+ | add esp, FRAME_OFFSET
+ | mov BASE, L->base
+ | ret
+ |.endjsub
+ |
+ |//-----------------------------------------------------------------------
+ |.jsub SETTABLE_STR // Set string entry in table.
+ |// Call with: TOP (tab), TVALUE:ecx (key), BASE (val)
+ | mov eax, TOP->tt; shl eax, 4; or eax, TVALUE:ecx->tt
+ | cmp eax, LUA_TTABLE_STR
+ | mov TABLE:edi, TOP->value
+ | mov TSTRING:edx, TVALUE:ecx->value
+ | je <9 // Types ok? Continue above.
+ | jmp ->DEOPTIMIZE_CALLER // Otherwise deoptimize.
+ |.endjsub
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_newtable(jit_State *J, int dest, int lnarray, int lnhash)
+{
+ | call &luaH_new, L, luaO_fb2int(lnarray), luaO_fb2int(lnhash)
+ | sethvalue BASE[dest], eax
+ jit_checkGC(J);
+}
+
+static void jit_op_getglobal(jit_State *J, int dest, int kidx)
+{
+ const TValue *kk = &J->pt->k[kidx];
+ jit_assert(ttisstring(kk));
+ | mov TSTRING:edx, &&kk->value.gc->ts
+ | addidx BASE, dest
+ | call ->GETGLOBAL
+}
+
+static void jit_op_setglobal(jit_State *J, int rval, int kidx)
+{
+ const TValue *kk = &J->pt->k[kidx];
+ jit_assert(ttisstring(kk));
+ | mov TSTRING:edx, &&kk->value.gc->ts
+ | addidx BASE, rval
+ | call ->SETGLOBAL
+}
+
+enum { TKEY_KSTR = -2, TKEY_STR = -1, TKEY_ANY = 0 };
+
+/* Optimize key lookup depending on consts or hints type. */
+static int jit_keylookup(jit_State *J, int tab, int rkey)
+{
+ const TValue *tabt = hint_get(J, TYPE);
+ const TValue *key;
+ if (!ttistable(tabt)) return TKEY_ANY; /* Not a table? Use fallback. */
+ key = ISK(rkey) ? &J->pt->k[INDEXK(rkey)] : hint_get(J, TYPEKEY);
+ if (ttisstring(key)) { /* String key? */
+ if (ISK(rkey)) {
+ | lea TOP, BASE[tab]
+ | mov TSTRING:edx, &&key->value.gc->ts
+ return TKEY_KSTR; /* Const string key. */
+ } else {
+ | lea TOP, BASE[tab]
+ | lea TVALUE:ecx, BASE[rkey]
+ return TKEY_STR; /* Var string key. */
+ }
+ } else if (ttisnumber(key)) { /* Number key? */
+ lua_Number n = nvalue(key);
+ int k;
+ lua_number2int(k, n);
+ if (!(k >= 1 && k < (1 << 26) && (lua_Number)k == n))
+ return TKEY_ANY; /* Not a proper array key? Use fallback. */
+ if (ISK(rkey)) {
+ | istable tab
+ | mov TABLE:edi, BASE[tab].value
+ | jne >9 // TYPE hint was wrong?
+ | mov ecx, k // Needed for hash fallback.
+ | mov TVALUE:eax, TABLE:edi->array
+ | cmp ecx, TABLE:edi->sizearray; ja >5 // Not in array part?
+ return k; /* Const array key (>= 1). */
+ } else {
+ | mov eax, BASE[tab].tt; shl eax, 4; or eax, BASE[rkey].tt
+ | cmp eax, LUA_TTABLE_NUM; jne >9 // TYPE/TYPEKEY hint was wrong?
+ if (J->flags & JIT_F_CPU_SSE2) {
+ | movsd xmm0, qword BASE[rkey]
+ | cvttsd2si eax, xmm0
+ | cvtsi2sd xmm1, eax
+ | dec eax
+ | ucomisd xmm1, xmm0
+ | mov TABLE:edi, BASE[tab].value
+ | jne >9; jp >9 // Not an integer? Deoptimize.
+ } else {
+ |// Annoying x87 stuff: check whether a number is an integer.
+ |// The latency of fist/fild is the real problem here.
+ | fld qword BASE[rkey].value
+ | fist dword TMP1
+ | fild dword TMP1
+ | fcomparepp // eax may be modified.
+ | jne >9; jp >9 // Not an integer? Deoptimize.
+ | mov eax, TMP1
+ | mov TABLE:edi, BASE[tab].value
+ | dec eax
+ }
+ | cmp eax, TABLE:edi->sizearray; jae >5 // Not in array part?
+ | TValuemul eax
+ | add eax, TABLE:edi->array
+ return 1; /* Variable array key. */
+ }
+ }
+ return TKEY_ANY; /* Use fallback. */
+}
+
+static void jit_op_gettable(jit_State *J, int dest, int tab, int rkey)
+{
+ int k = jit_keylookup(J, tab, rkey);
+ switch (k) {
+ case TKEY_KSTR: /* Const string key. */
+ | addidx BASE, dest
+ | call ->GETTABLE_KSTR
+ break;
+ case TKEY_STR: /* Variable string key. */
+ | addidx BASE, dest
+ | call ->GETTABLE_STR
+ break;
+ case TKEY_ANY: /* Generic gettable fallback. */
+ if (ISK(rkey)) {
+ | mov ecx, &&J->pt->k[INDEXK(rkey)]
+ } else {
+ | lea ecx, BASE[rkey]
+ }
+ | lea edx, BASE[tab]
+ | addidx BASE, dest
+ | mov L->savedpc, &J->nextins
+ | call &luaV_gettable, L, edx, ecx, BASE
+ | mov BASE, L->base
+ break;
+ default: /* Array key. */
+ |// This is really copyslot BASE[dest], TVALUE:eax[k-1] mixed with compare.
+ |1:
+ | mov edx, TVALUE:eax[k-1].tt
+ | test edx, edx; je >6 // Array has nil value?
+ if (J->flags & JIT_F_CPU_SSE2) {
+ | movq xmm0, qword TVALUE:eax[k-1].value
+ | movq qword BASE[dest].value, xmm0
+ } else {
+ | mov ecx, TVALUE:eax[k-1].value
+ | mov eax, TVALUE:eax[k-1].value.na[1]
+ | mov BASE[dest].value, ecx
+ | mov BASE[dest].value.na[1], eax
+ }
+ |2:
+ | mov BASE[dest].tt, edx
+ |.tail
+ |5: // Fallback to hash part. TABLE:edi is callee-saved.
+ if (ISK(rkey)) {
+ | call ->GETTABLE_KNUM
+ } else {
+ | call ->GETTABLE_NUM
+ }
+ | jmp <1 // Slot is at TVALUE:eax[k-1].
+ |
+ |6: // Shortcut for tables without an __index metamethod.
+ | mov TABLE:ecx, TABLE:edi->metatable
+ | test TABLE:ecx, TABLE:ecx
+ | jz <2 // No metatable?
+ | test byte TABLE:ecx->flags, 1<<TM_INDEX
+ | jnz <2 // Or 'no __index' flag set?
+ |
+ |9: // Otherwise deoptimize.
+ | mov edx, &J->nextins
+ | jmp ->DEOPTIMIZE
+ |.code
+ break;
+ }
+
+ |.jsub GETTABLE_KNUM // Gettable fallback for const numeric keys.
+ | mov TMP2, ecx // Save k.
+ | sub esp, FRAME_OFFSET
+ | call &luaH_getnum, TABLE:edi, ecx
+ | add esp, FRAME_OFFSET
+ | mov ecx, TMP2 // Restore k.
+ | TValuemul ecx
+ | sub TVALUE:eax, ecx // Compensate for TVALUE:eax[k-1].
+ | add TVALUE:eax, #TVALUE
+ | ret
+ |.endjsub
+ |
+ |.jsub GETTABLE_NUM // Gettable fallback for variable numeric keys.
+ | inc eax
+ | mov ARG2, TABLE:edi // Really ARG1 and ARG2.
+ | mov ARG3, eax
+ | jmp &luaH_getnum // Chain to C code.
+ |.endjsub
+}
+
+static void jit_op_settable(jit_State *J, int tab, int rkey, int rval)
+{
+ const TValue *val = ISK(rval) ? &J->pt->k[INDEXK(rval)] : NULL;
+ int k = jit_keylookup(J, tab, rkey);
+ switch (k) {
+ case TKEY_KSTR: /* Const string key. */
+ case TKEY_STR: /* Variable string key. */
+ if (ISK(rval)) {
+ | mov BASE, &val
+ } else {
+ | addidx BASE, rval
+ }
+ if (k == TKEY_KSTR) {
+ | call ->SETTABLE_KSTR
+ } else {
+ | call ->SETTABLE_STR
+ }
+ break;
+ case TKEY_ANY: /* Generic settable fallback. */
+ if (ISK(rkey)) {
+ | mov ecx, &&J->pt->k[INDEXK(rkey)]
+ } else {
+ | lea ecx, BASE[rkey]
+ }
+ if (ISK(rval)) {
+ | mov edx, &val
+ } else {
+ | lea edx, BASE[rval]
+ }
+ | addidx BASE, tab
+ | mov L->savedpc, &J->nextins
+ | call &luaV_settable, L, BASE, ecx, edx
+ | mov BASE, L->base
+ break;
+ default: /* Array key. */
+ |1:
+ | tvisnil TVALUE:eax[k-1]; je >6 // Previous value is nil?
+ |2:
+ |.tail
+ |5: // Fallback to hash part. TABLE:edi is callee-saved.
+ if (ISK(rkey)) {
+ | call ->SETTABLE_KNUM
+ } else {
+ | call ->SETTABLE_NUM
+ }
+ | jmp <1 // Slot is at TVALUE:eax[k-1].
+ |
+ |6: // Shortcut for tables without a __newindex metamethod.
+ | mov TABLE:ecx, TABLE:edi->metatable
+ | test TABLE:ecx, TABLE:ecx
+ | jz <2 // No metatable?
+ | test byte TABLE:ecx->flags, 1<<TM_NEWINDEX
+ | jnz <2 // Or 'no __newindex' flag set?
+ |
+ |9: // Otherwise deoptimize.
+ | mov edx, &J->nextins
+ | jmp ->DEOPTIMIZE
+ |.code
+ if (!ISK(rval) || iscollectable(val)) {
+ | test byte TABLE:edi->marked, bitmask(BLACKBIT) // isblack(table)
+ | jnz >7 // Unlikely, but set barrier back.
+ |3:
+ |.tail
+ |7: // Avoid valiswhite() check -- black2gray(table) is ok.
+ | call ->BARRIERBACK
+ | jmp <3
+ |.code
+ }
+ if (ISK(rval)) {
+ | copyconst TVALUE:eax[k-1], val
+ } else {
+ | copyslot TVALUE:eax[k-1], BASE[rval], ecx, edx, TOP
+ }
+ break;
+ }
+
+ |.jsub SETTABLE_KNUM // Settable fallback for const numeric keys.
+ | mov TMP2, ecx // Save k.
+ | sub esp, FRAME_OFFSET
+ | call &luaH_setnum, L, TABLE:edi, ecx
+ | add esp, FRAME_OFFSET
+ | mov ecx, TMP2 // Restore k.
+ | TValuemul ecx
+ | sub TVALUE:eax, ecx // Compensate for TVALUE:eax[k-1].
+ | add TVALUE:eax, #TVALUE
+ | ret
+ |.endjsub
+ |
+ |.jsub SETTABLE_NUM // Settable fallback for variable numeric keys.
+ | inc eax
+ | mov ARG2, L // Really ARG1, ARG2 and ARG3.
+ | mov ARG3, TABLE:edi
+ | mov ARG4, eax
+ | jmp &luaH_setnum // Chain to C code.
+ |.endjsub
+}
+
+static void jit_op_self(jit_State *J, int dest, int tab, int rkey)
+{
+ | copyslot BASE[dest+1], BASE[tab]
+ jit_op_gettable(J, dest, tab, rkey);
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_setlist(jit_State *J, int ra, int num, int batch)
+{
+ if (batch == 0) { batch = (int)(*J->nextins); J->combine++; }
+ batch = (batch-1)*LFIELDS_PER_FLUSH;
+ if (num == 0) { /* Previous op was open and set TOP: {f()} or {...}. */
+ | mov L->env.value, TOP // Need to save TOP (edi).
+ | lea eax, BASE[ra+1]
+ | sub eax, TOP
+ | neg eax
+ | TValuediv eax // num = (TOP-ra-1)/sizeof(TValue).
+ | mov TABLE:edi, BASE[ra].value
+ | jz >4 // Nothing to set?
+ if (batch > 0) {
+ | add eax, batch
+ }
+ | cmp dword TABLE:edi->sizearray, eax
+ | jae >1 // Skip resize if not needed.
+ | // A resize is likely, so inline it.
+ | call &luaH_resizearray, L, TABLE:edi, eax
+ |1:
+ | test byte TABLE:edi->marked, bitmask(BLACKBIT) // isblack(table)
+ | mov edx, TABLE:edi->array
+ | jnz >6 // Unlikely, but set barrier back.
+ | mov TOP, L->env.value
+ |
+ |.tail
+ |6: // Avoid lots of valiswhite() checks -- black2gray(table) is ok.
+ | call ->BARRIERBACK
+ | jmp <1 // Need to reload edx.
+ |.code
+ } else { /* Set fixed number of args. */
+ | mov TABLE:edi, BASE[ra].value // edi is callee-save.
+ | cmp dword TABLE:edi->sizearray, batch+num
+ | jb >5 // Need to resize array?
+ |1:
+ | test byte TABLE:edi->marked, bitmask(BLACKBIT) // isblack(table)
+ | mov edx, TABLE:edi->array
+ | jnz >6 // Unlikely, but set barrier back.
+ | lea TOP, BASE[ra+1+num] // Careful: TOP is edi.
+ |
+ |.tail
+ |5: // A resize is unlikely (impossible?). NEWTABLE should've done it.
+ | call &luaH_resizearray, L, TABLE:edi, batch+num
+ | jmp <1
+ |6: // Avoid lots of valiswhite() checks -- black2gray(table) is ok.
+ | call ->BARRIERBACK
+ | jmp <1 // Need to reload edx.
+ |.code
+ }
+ if (batch > 0) {
+ | add edx, batch*#TVALUE // edx = &t->array[(batch+1)-1]
+ }
+ | lea ecx, BASE[ra+1]
+ |3: // Copy stack slots to array.
+ | mov eax, [ecx]
+ | add ecx, aword*1
+ | mov [edx], eax
+ | add edx, aword*1
+ | cmp ecx, TOP
+ | jb <3
+ |
+ |4:
+ if (num == 0) { /* Previous op was open. Restore L->top. */
+ | lea TOP, BASE[J->pt->maxstacksize] // Faster than getting L->ci->top.
+ | mov L->top, TOP
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_arith(jit_State *J, int dest, int rkb, int rkc, int ev)
+{
+ const TValue *kkb = ISK(rkb) ? &J->pt->k[INDEXK(rkb)] : NULL;
+ const TValue *kkc = ISK(rkc) ? &J->pt->k[INDEXK(rkc)] : NULL;
+ const Value *kval;
+ int idx, rev;
+ int target = (ev == TM_LT || ev == TM_LE) ? jit_jmp_target(J) : 0;
+ int hastail = 0;
+
+ /* The bytecode compiler already folds constants except for: k/0, k%0, */
+ /* NaN results, k1<k2, k1<=k2. No point in optimizing these cases. */
+ if (ISK(rkb&rkc)) goto fallback;
+
+ /* Avoid optimization when non-numeric constants are present. */
+ if (kkb ? !ttisnumber(kkb) : (kkc && !ttisnumber(kkc))) goto fallback;
+
+ /* The TYPE hint selects numeric inlining and/or fallback encoding. */
+ switch (ttype(hint_get(J, TYPE))) {
+ case LUA_TNIL: hastail = 1; break; /* No hint: numeric + fallback. */
+ case LUA_TNUMBER: break; /* Numbers: numeric + deoptimization. */
+ default: goto fallback; /* Mixed/other types: fallback only. */
+ }
+
+ /* The checks above ensure: at most one of the operands is a constant. */
+ /* Reverse operation and swap operands so the 2nd operand is a variable. */
+ if (kkc) { kval = &kkc->value; idx = rkb; rev = 1; }
+ else { kval = kkb ? &kkb->value : NULL; idx = rkc; rev = 0; }
+
+ /* Special handling for some operators. */
+ switch (ev) {
+ case TM_MOD:
+ /* Check for modulo with positive numbers, so we can use fprem. */
+ if (kval) {
+ if (kval->na[1] < 0) { hastail = 0; goto fallback; } /* x%-k, -k%x */
+ | isnumber idx
+ | mov eax, BASE[idx].value.na[1]
+ | jne L_DEOPTIMIZEF
+ | test eax, eax; js L_DEOPTIMIZEF
+ |// This will trigger deoptimization in some benchmarks (pidigits).
+ |// But it's still a win.
+ if (kkb) {
+ | fld qword BASE[rkc].value
+ | fld qword [kval]
+ } else {
+ | fld qword [kval]
+ | fld qword BASE[rkb].value
+ }
+ } else {
+ | isnumber2 rkb, rkc
+ | mov eax, BASE[rkb].value.na[1]
+ | jne L_DEOPTIMIZEF
+ | or eax, BASE[rkc].value.na[1]; js L_DEOPTIMIZEF
+ | fld qword BASE[rkc].value
+ | fld qword BASE[rkb].value
+ }
+ |1: ; fprem; fnstsw ax; sahf; jp <1
+ | fstp st1
+ goto fpstore;
+ case TM_POW:
+ if (hastail || !kval) break; /* Avoid this if not optimizing. */
+ if (rev) { /* x^k for k > 0, k integer. */
+ lua_Number n = kval->n;
+ int k;
+ lua_number2int(k, n);
+ /* All positive integers would work. But need to limit code explosion. */
+ if (k > 0 && k <= 65536 && (lua_Number)k == n) {
+ | isnumber idx; jne L_DEOPTIMIZEF
+ | fld qword BASE[idx]
+ for (; (k & 1) == 0; k >>= 1) { /* Handle leading zeroes (2^k). */
+ | fmul st0
+ }
+ if ((k >>= 1) != 0) { /* Handle trailing bits. */
+ | fld st0
+ | fmul st0
+ for (; k != 1; k >>= 1) {
+ if (k & 1) {
+ | fmul st1, st0
+ }
+ | fmul st0
+ }
+ | fmulp st1
+ }
+ goto fpstore;
+ }
+ } else if (kval->n > (lua_Number)0) { /* k^x for k > 0. */
+ int log2kval[3]; /* Enough storage for a tword (80 bits). */
+ log2kval[2] = 0; /* Avoid leaking garbage. */
+ /* Double precision log2(k) doesn't cut it (3^x != 3 for x = 1). */
+ ((void (*)(int *, double))J->jsub[JSUB_LOG2_TWORD])(log2kval, kval->n);
+ | mov ARG1, log2kval[0] // Abuse stack for tword const.
+ | mov ARG2, log2kval[1]
+ | mov ARG3, log2kval[2] // TODO: store2load fwd stall.
+ | isnumber idx; jne L_DEOPTIMIZEF
+ | fld tword [esp]
+ | fmul qword BASE[idx].value // log2(k)*x
+ | fld st0; frndint; fsub st1, st0; fxch // Split into fract/int part.
+ | f2xm1; fld1; faddp st1; fscale // (2^fract-1 +1) << int.
+ | fstp st1
+
+ |.jsub LOG2_TWORD // Calculate log2(k) with max. precision.
+ |// Called with (int *ptr, double k).
+ | fld1; fld FPARG2 // Offset ok due to retaddr.
+ | fyl2x
+ | mov eax, ARG2 // Really ARG1.
+ | fstp tword [eax]
+ | ret
+ |.endjsub
+ goto fpstore;
+ }
+ break;
+ }
+
+ /* Check number type and load 1st operand. */
+ if (kval) {
+ | isnumber idx; jne L_DEOPTIMIZEF
+ | loadnvaluek kval
+ } else {
+ if (rkb == rkc) {
+ | isnumber rkb
+ } else {
+ | isnumber2 rkb, rkc
+ }
+ | jne L_DEOPTIMIZEF
+ | fld qword BASE[rkb].value
+ }
+
+ /* Encode arithmetic operation with 2nd operand. */
+ switch ((ev<<1)+rev) {
+ case TM_ADD<<1: case (TM_ADD<<1)+1:
+ if (rkb == rkc) {
+ | fadd st0
+ } else {
+ | fadd qword BASE[idx].value
+ }
+ break;
+ case TM_SUB<<1:
+ | fsub qword BASE[idx].value
+ break;
+ case (TM_SUB<<1)+1:
+ | fsubr qword BASE[idx].value
+ break;
+ case TM_MUL<<1: case (TM_MUL<<1)+1:
+ if (rkb == rkc) {
+ | fmul st0
+ } else {
+ | fmul qword BASE[idx].value
+ }
+ break;
+ case TM_DIV<<1:
+ | fdiv qword BASE[idx].value
+ break;
+ case (TM_DIV<<1)+1:
+ | fdivr qword BASE[idx].value
+ break;
+ case TM_POW<<1:
+ | sub esp, S2LFRAME_OFFSET
+ | fstp FPARG1
+ | fld qword BASE[idx].value
+ | fstp FPARG2
+ | call &pow
+ | add esp, S2LFRAME_OFFSET
+ break;
+ case (TM_POW<<1)+1:
+ | sub esp, S2LFRAME_OFFSET
+ | fstp FPARG2
+ | fld qword BASE[idx].value
+ | fstp FPARG1
+ | call &pow
+ | add esp, S2LFRAME_OFFSET
+ break;
+ case TM_UNM<<1: case (TM_UNM<<1)+1:
+ | fchs // No 2nd operand.
+ break;
+ default: /* TM_LT or TM_LE. */
+ | fld qword BASE[idx].value
+ | fcomparepp
+ | jp =>dest?(J->nextpc+1):target // Unordered means false.
+ jit_assert(dest == 0 || dest == 1); /* Really cond. */
+ switch (((rev^dest)<<1)+(dest^(ev == TM_LT))) {
+ case 0:
+ | jb =>target
+ break;
+ case 1:
+ | jbe =>target
+ break;
+ case 2:
+ | ja =>target
+ break;
+ case 3:
+ | jae =>target
+ break;
+ }
+ goto skipstore;
+ }
+fpstore:
+ /* Store result and set result type (if necessary). */
+ | fstp qword BASE[dest].value
+ if (dest != rkb && dest != rkc) {
+ | settt BASE[dest], LUA_TNUMBER
+ }
+
+skipstore:
+ if (!hastail) {
+ jit_deopt_target(J, 0);
+ return;
+ }
+
+ |4:
+ |.tail
+ |L_DEOPTLABEL: // Recycle as fallback label.
+
+fallback:
+ /* Generic fallback for arithmetic ops. */
+ if (kkb) {
+ | mov ecx, &kkb
+ } else {
+ | lea ecx, BASE[rkb]
+ }
+ if (kkc) {
+ | mov edx, &kkc
+ } else {
+ | lea edx, BASE[rkc]
+ }
+ if (target) { /* TM_LT or TM_LE. */
+ | mov L->savedpc, &(J->nextins+1)
+ | call &ev==TM_LT?luaV_lessthan:luaV_lessequal, L, ecx, edx
+ | test eax, eax
+ | mov BASE, L->base
+ if (dest) { /* cond */
+ | jnz =>target
+ } else {
+ | jz =>target
+ }
+ } else {
+ | addidx BASE, dest
+ | mov L->savedpc, &J->nextins
+ | call &luaV_arith, L, BASE, ecx, edx, ev
+ | mov BASE, L->base
+ }
+
+ if (hastail) {
+ | jmp <4
+ |.code
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_fallback_len(lua_State *L, StkId ra, const TValue *rb)
+{
+ switch (ttype(rb)) {
+ case LUA_TTABLE:
+ setnvalue(ra, cast_num(luaH_getn(hvalue(rb))));
+ break;
+ case LUA_TSTRING:
+ setnvalue(ra, cast_num(tsvalue(rb)->len));
+ break;
+ default: {
+ const TValue *tm = luaT_gettmbyobj(L, rb, TM_LEN);
+ if (ttisfunction(tm)) {
+ ptrdiff_t rasave = savestack(L, ra);
+ setobj2s(L, L->top, tm);
+ setobj2s(L, L->top+1, rb);
+ luaD_checkstack(L, 2);
+ L->top += 2;
+ luaD_call(L, L->top - 2, 1);
+ ra = restorestack(L, rasave);
+ L->top--;
+ setobjs2s(L, ra, L->top);
+ } else {
+ luaG_typeerror(L, rb, "get length of");
+ }
+ break;
+ }
+ }
+}
+
+static void jit_op_len(jit_State *J, int dest, int rb)
+{
+ switch (ttype(hint_get(J, TYPE))) {
+ case LUA_TTABLE:
+ jit_deopt_target(J, 0);
+ | istable rb
+ | mov TABLE:ecx, BASE[rb].value
+ | jne L_DEOPTIMIZE // TYPE hint was wrong?
+ | call &luaH_getn, TABLE:ecx
+ | mov TMP1, eax
+ | fild dword TMP1
+ | fstp qword BASE[dest].value
+ | settt BASE[dest], LUA_TNUMBER
+ break;
+ case LUA_TSTRING:
+ jit_deopt_target(J, 0);
+ | isstring rb
+ | mov TSTRING:ecx, BASE[rb].value
+ | jne L_DEOPTIMIZE // TYPE hint was wrong?
+ | fild aword TSTRING:ecx->tsv.len // size_t
+ | fstp qword BASE[dest].value
+ | settt BASE[dest], LUA_TNUMBER
+ break;
+ default:
+ | lea TVALUE:ecx, BASE[rb]
+ | addidx BASE, dest
+ | mov L->savedpc, &J->nextins
+ | call &jit_fallback_len, L, BASE, TVALUE:ecx
+ | mov BASE, L->base
+ break;
+ }
+}
+
+static void jit_op_not(jit_State *J, int dest, int rb)
+{
+ /* l_isfalse() without a branch -- truly devious. */
+ /* ((value & tt) | (tt>>1)) is only zero for nil/false. */
+ /* Assumes: LUA_TNIL == 0, LUA_TBOOLEAN == 1, bvalue() == 0/1 */
+ | mov eax, BASE[rb].tt
+ | mov ecx, BASE[rb].value
+ | mov edx, 1
+ | and ecx, eax
+ | shr eax, 1
+ | or ecx, eax
+ | xor eax, eax
+ | cmp ecx, edx
+ | adc eax, eax
+ | mov BASE[dest].tt, edx
+ | mov BASE[dest].value, eax
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_concat(jit_State *J, int dest, int first, int last)
+{
+ int num = last-first+1;
+ if (num == 2 && ttisstring(hint_get(J, TYPE))) { /* Optimize common case. */
+ | addidx BASE, first
+ | call ->CONCAT_STR2
+ | setsvalue BASE[dest], eax
+ } else { /* Generic fallback. */
+ | mov L->savedpc, &J->nextins
+ | call &luaV_concat, L, num, last
+ | mov BASE, L->base
+ if (dest != first) {
+ | copyslot BASE[dest], BASE[first]
+ }
+ }
+ jit_checkGC(J); /* Always do this, even for the optimized variant. */
+
+ |.jsub CONCAT_STR2 // Concatenate two strings.
+ |// Call with: BASE (first). Destroys all regs. L and BASE restored.
+ | mov ARG2, L // Save L (esi).
+ | mov eax, BASE[0].tt; shl eax, 4; or eax, BASE[1].tt
+ | sub eax, LUA_TSTR_STR // eax = 0 on success.
+ | jne ->DEOPTIMIZE_CALLER // Wrong types? Deoptimize.
+ |
+ |1:
+ | mov GL:edi, L->l_G
+ | mov TSTRING:esi, BASE[0].value // Caveat: L (esi) is gone now!
+ | mov TSTRING:edx, BASE[1].value
+ | mov ecx, TSTRING:esi->tsv.len // size_t
+ | test ecx, ecx
+ | jz >2 // 1st string is empty?
+ | or eax, TSTRING:edx->tsv.len // eax is known to be zero.
+ | jz >4 // 2nd string is empty?
+ | add eax, ecx
+ | jc >9 // Length overflow?
+ | cmp eax, GL:edi->buff.buffsize // size_t
+ | ja >5 // Temp buffer overflow?
+ | mov edi, GL:edi->buff.buffer
+ | add esi, #TSTRING
+ | rep; movsb // Copy first string.
+ | mov ecx, TSTRING:edx->tsv.len
+ | lea esi, TSTRING:edx[1]
+ | rep; movsb // Copy second string.
+ |
+ | sub edi, eax // start = end - total.
+ | mov L, ARG2 // Restore L (esi). Reuse as 1st arg.
+ | mov ARG3, edi
+ | mov ARG4, eax
+ | mov BASE, L->base // Restore BASE.
+ | jmp &luaS_newlstr
+ |
+ |2: // 1st string is empty.
+ | mov eax, TSTRING:edx // Return 2nd string.
+ |3:
+ | mov L, ARG2 // Restore L (esi) and BASE.
+ | mov BASE, L->base
+ | ret
+ |
+ |4: // 2nd string is empty.
+ | mov eax, TSTRING:esi // Return 1st string.
+ | jmp <3
+ |
+ |5: // Resize temp buffer.
+ | // No need for setting L->savedpc since only LUA_ERRMEM may be thrown.
+ | mov L, ARG2 // Restore L.
+ | lea ecx, GL:edi->buff
+ | sub esp, FRAME_OFFSET
+ | call &luaZ_openspace, L, ecx, eax
+ | add esp, FRAME_OFFSET
+ | xor eax, eax // BASE (first) and L saved. eax = 0.
+ | jmp <1 // Just restart.
+ |
+ |9: // Length overflow errors are rare (> 2 GB string required).
+ | mov L, ARG2 // Need L for deoptimization.
+ | jmp ->DEOPTIMIZE_CALLER
+ |.endjsub
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_eq(jit_State *J, int cond, int rkb, int rkc)
+{
+ int target = jit_jmp_target(J);
+ int condtarget = cond ? (J->nextpc+1) : target;
+ jit_assert(cond == 0 || cond == 1);
+
+ /* Comparison of two constants. Evaluate at compile time. */
+ if (ISK(rkb&rkc)) {
+ if ((rkb == rkc) == cond) { /* Constants are already unique. */
+ | jmp =>target
+ }
+ return;
+ }
+
+ if (ISK(rkb|rkc)) { /* Compare a variable and a constant. */
+ const TValue *kk;
+ if (ISK(rkb)) { int t = rkc; rkc = rkb; rkb = t; } /* rkc holds const. */
+ kk = &J->pt->k[INDEXK(rkc)];
+ switch (ttype(kk)) {
+ case LUA_TNIL:
+ | isnil rkb
+ break;
+ case LUA_TBOOLEAN:
+ if (bvalue(kk)) {
+ | mov eax, BASE[rkb].tt
+ | mov ecx, BASE[rkb].value
+ | dec eax
+ | dec ecx
+ | or eax, ecx
+ } else {
+ | mov eax, BASE[rkb].tt
+ | dec eax
+ | or eax, BASE[rkb].value
+ }
+ break;
+ case LUA_TNUMBER:
+ |// Note: bitwise comparison is not faster (and needs to handle -0 == 0).
+ | isnumber rkb
+ | jne =>condtarget
+ | fld qword BASE[rkb].value
+ | fld qword [&kk->value]
+ | fcomparepp
+ | jp =>condtarget // Unordered means not equal.
+ break;
+ case LUA_TSTRING:
+ | isstring rkb
+ | jne =>condtarget
+ | cmp aword BASE[rkb].value, &rawtsvalue(kk)
+ break;
+ default: jit_assert(0); break;
+ }
+ } else { /* Compare two variables. */
+ | mov eax, BASE[rkb].tt
+ | cmp eax, BASE[rkc].tt
+ | jne =>condtarget
+ switch (ttype(hint_get(J, TYPE))) {
+ case LUA_TNUMBER:
+ jit_deopt_target(J, 0);
+ |// Note: bitwise comparison is not an option (-0 == 0, NaN ~= NaN).
+ | cmp eax, LUA_TNUMBER; jne L_DEOPTIMIZE
+ | fld qword BASE[rkb].value
+ | fld qword BASE[rkc].value
+ | fcomparepp
+ | jp =>condtarget // Unordered means not equal.
+ break;
+ case LUA_TSTRING:
+ jit_deopt_target(J, 0);
+ | cmp eax, LUA_TSTRING; jne L_DEOPTIMIZE
+ | mov ecx, BASE[rkb].value
+ | cmp ecx, BASE[rkc].value
+ break;
+ default:
+ |// Generic equality comparison fallback.
+ | lea edx, BASE[rkc]
+ | lea ecx, BASE[rkb]
+ | mov L->savedpc, &J->nextins
+ | call &luaV_equalval, L, ecx, edx
+ | dec eax
+ | mov BASE, L->base
+ break;
+ }
+ }
+ if (cond) {
+ | je =>target
+ } else {
+ | jne =>target
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_test(jit_State *J, int cond, int dest, int src)
+{
+ int target = jit_jmp_target(J);
+
+ /* l_isfalse() without a branch. But this time preserve tt/value. */
+ /* (((value & tt) * 2 + tt) >> 1) is only zero for nil/false. */
+ /* Assumes: 3*tt < 2^32, LUA_TNIL == 0, LUA_TBOOLEAN == 1, bvalue() == 0/1 */
+ | mov eax, BASE[src].tt
+ | mov ecx, BASE[src].value
+ | mov edx, eax
+ | and edx, ecx
+ | lea edx, [eax+edx*2]
+ | shr edx, 1
+
+ /* Check if we can omit the stack copy. */
+ if (dest == src) { /* Yes, invert branch condition. */
+ if (cond) {
+ | jnz =>target
+ } else {
+ | jz =>target
+ }
+ } else { /* No, jump around copy code. */
+ if (cond) {
+ | jz >1
+ } else {
+ | jnz >1
+ }
+ | mov edx, BASE[src].value.na[1]
+ | mov BASE[dest].tt, eax
+ | mov BASE[dest].value, ecx
+ | mov BASE[dest].value.na[1], edx
+ | jmp =>target
+ |1:
+ }
+}
+
+static void jit_op_jmp(jit_State *J, int target)
+{
+ | jmp =>target
+}
+
+/* ------------------------------------------------------------------------ */
+
+enum { FOR_IDX, FOR_LIM, FOR_STP, FOR_EXT };
+
+static const char *const jit_for_coerce_error[] = {
+ LUA_QL("for") " initial value must be a number",
+ LUA_QL("for") " limit must be a number",
+ LUA_QL("for") " step must be a number",
+};
+
+/* Try to coerce for slots with strings to numbers in place or complain. */
+static void jit_for_coerce(lua_State *L, TValue *o)
+{
+ int i;
+ for (i = FOR_IDX; i <= FOR_STP; i++, o++) {
+ lua_Number num;
+ if (ttisnumber(o)) continue;
+ if (ttisstring(o) && luaO_str2d(svalue(o), &num)) {
+ setnvalue(o, num);
+ } else {
+ luaG_runerror(L, jit_for_coerce_error[i]);
+ }
+ }
+}
+
+static void jit_op_forprep(jit_State *J, int ra, int target)
+{
+ const TValue *step = hint_get(J, FOR_STEP_K);
+ if (ttisnumber(step)) {
+ | isnumber2 ra+FOR_IDX, ra+FOR_LIM; jne L_DEOPTIMIZEF
+ |4:
+ | fld qword BASE[ra+FOR_LIM].value // [lim]
+ | fld qword BASE[ra+FOR_IDX].value // [idx lim]
+ | fst qword BASE[ra+FOR_EXT].value // extidx = idx
+ | fcomparepp // idx >< lim ?
+ | settt BASE[ra+FOR_EXT], LUA_TNUMBER
+ if (nvalue(step) < (lua_Number)0) {
+ | jb =>target+1 // step < 0 && idx < lim: skip loop.
+ } else {
+ | ja =>target+1 // step >= 0 && idx > lim: skip loop.
+ }
+ } else {
+ |4:
+ | isnumber3 ra+FOR_IDX, ra+FOR_LIM, ra+FOR_STP
+ | mov eax, BASE[ra+FOR_STP].value.na[1] // Sign bit is in hi dword.
+ | jne L_DEOPTIMIZEF
+ | fld qword BASE[ra+FOR_LIM].value // [lim] (FP stack notation)
+ | fld qword BASE[ra+FOR_IDX].value // [idx lim]
+ | test eax, eax // step >< 0 ?
+ | fst qword BASE[ra+FOR_EXT].value // extidx = idx
+ | js >1
+ | fxch // if (step > 0) [lim idx]
+ |1:
+ | fcomparepp // step > 0 ? lim < idx : idx < lim
+ | settt BASE[ra+FOR_EXT], LUA_TNUMBER
+ | jb =>target+1 // Skip loop.
+ }
+ if (ttisnumber(hint_get(J, TYPE))) {
+ jit_deopt_target(J, 0);
+ } else {
+ |.tail
+ |L_DEOPTLABEL: // Recycle as fallback label.
+ | // Fallback for strings as loop vars. No need to make this fast.
+ | lea eax, BASE[ra]
+ | mov L->savedpc, &J->nextins
+ | call &jit_for_coerce, L, eax // Coerce strings or throw error.
+ | jmp <4 // Easier than reloading eax.
+ |.code
+ }
+}
+
+static void jit_op_forloop(jit_State *J, int ra, int target)
+{
+ const TValue *step = hint_getpc(J, FOR_STEP_K, target-1);
+ if (ttisnumber(step)) {
+ | fld qword BASE[ra+FOR_LIM].value // [lim] (FP stack notation)
+ | fld qword BASE[ra+FOR_IDX].value // [idx lim]
+ | fadd qword BASE[ra+FOR_STP].value // [nidx lim]
+ | fst qword BASE[ra+FOR_EXT].value // extidx = nidx
+ | fst qword BASE[ra+FOR_IDX].value // idx = nidx
+ | settt BASE[ra+FOR_EXT], LUA_TNUMBER
+ | fcomparepp // nidx >< lim ?
+ if (nvalue(step) < (lua_Number)0) {
+ | jae =>target // step < 0 && nidx >= lim: loop again.
+ } else {
+ | jbe =>target // step >= 0 && nidx <= lim: loop again.
+ }
+ } else {
+ | mov eax, BASE[ra+FOR_STP].value.na[1] // Sign bit is in hi dword.
+ | fld qword BASE[ra+FOR_LIM].value // [lim] (FP stack notation)
+ | fld qword BASE[ra+FOR_IDX].value // [idx lim]
+ | fld qword BASE[ra+FOR_STP].value // [stp idx lim]
+ | faddp st1 // [nidx lim]
+ | fst qword BASE[ra+FOR_IDX].value // idx = nidx
+ | fst qword BASE[ra+FOR_EXT].value // extidx = nidx
+ | settt BASE[ra+FOR_EXT], LUA_TNUMBER
+ | test eax, eax // step >< 0 ?
+ | js >1
+ | fxch // if (step > 0) [lim nidx]
+ |1:
+ | fcomparepp // step > 0 ? lim >= nidx : nidx >= lim
+ | jae =>target // Loop again.
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_tforloop(jit_State *J, int ra, int nresults)
+{
+ int target = jit_jmp_target(J);
+ int i;
+ if (jit_inline_tforloop(J, ra, nresults, target)) return; /* Inlined? */
+ for (i = 2; i >= 0; i--) {
+ | copyslot BASE[ra+i+3], BASE[ra+i] // Copy ctlvar/state/callable.
+ }
+ jit_op_call(J, ra+3, 2, nresults);
+ | isnil ra+3; je >1
+ | copyslot BASE[ra+2], BASE[ra+3] // Save control variable.
+ | jmp =>target
+ |1:
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_close(jit_State *J, int ra)
+{
+ if (ra) {
+ | lea eax, BASE[ra]
+ | mov ARG2, eax
+ } else {
+ | mov ARG2, BASE
+ }
+ | call &luaF_close, L // , StkId level (ARG2)
+}
+
+static void jit_op_closure(jit_State *J, int dest, int ptidx)
+{
+ Proto *npt = J->pt->p[ptidx];
+ int nup = npt->nups;
+ | getLCL edi // LCL:edi is callee-saved.
+ | mov edx, LCL:edi->env
+ | call &luaF_newLclosure, L, nup, edx
+ | mov LCL->p, &npt // Store new proto in returned closure.
+ | mov aword BASE[dest].value, LCL // setclvalue()
+ | settt BASE[dest], LUA_TFUNCTION
+ /* Process pseudo-instructions for upvalues. */
+ if (nup > 0) {
+ const Instruction *uvcode = J->nextins;
+ int i, uvuv;
+ /* Check which of the two types we need. */
+ for (i = 0, uvuv = 0; i < nup; i++)
+ if (GET_OPCODE(uvcode[i]) == OP_GETUPVAL) uvuv++;
+ /* Copy upvalues from parent first. */
+ if (uvuv) {
+ /* LCL:eax->upvals (new closure) <-- LCL:edi->upvals (own closure). */
+ for (i = 0; i < nup; i++)
+ if (GET_OPCODE(uvcode[i]) == OP_GETUPVAL) {
+ | mov UPVAL:edx, LCL:edi->upvals[GETARG_B(uvcode[i])]
+ | mov LCL->upvals[i], UPVAL:edx
+ }
+ }
+ /* Next find or create upvalues for our own stack slots. */
+ if (nup > uvuv) {
+ | mov LCL:edi, LCL // Move new closure to callee-save register. */
+ /* LCL:edi->upvals (new closure) <-- upvalue for stack slot. */
+ for (i = 0; i < nup; i++)
+ if (GET_OPCODE(uvcode[i]) == OP_MOVE) {
+ int rb = GETARG_B(uvcode[i]);
+ if (rb) {
+ | lea eax, BASE[rb]
+ | mov ARG2, eax
+ } else {
+ | mov ARG2, BASE
+ }
+ | call &luaF_findupval, L // , StkId level (ARG2)
+ | mov LCL:edi->upvals[i], UPVAL:eax
+ }
+ }
+ J->combine += nup; /* Skip pseudo-instructions. */
+ }
+ jit_checkGC(J);
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_vararg(jit_State *J, int dest, int num)
+{
+ if (num < 0) { /* Copy all varargs. */
+ |// Copy [ci->func+1+pt->numparams, BASE) -> [BASE+dest, *).
+ |1:
+ | mov CI, L->ci
+ | mov edx, CI->func
+ | add edx, (1+J->pt->numparams)*#TVALUE // Start of varargs.
+ |
+ | // luaD_checkstack(L, nvararg) with nvararg = L->base - vastart.
+ | // This is a slight overallocation (BASE[dest+nvararg] would be enough).
+ | // We duplicate OP_VARARG behaviour so we can use luaD_growstack().
+ | lea eax, [BASE+BASE+J->pt->maxstacksize*#TVALUE] // L->base + L->top
+ | sub eax, edx // L->top + (L->base - vastart)
+ | cmp eax, L->stack_last
+ | jae >5 // Need to grow stack?
+ |
+ | lea TOP, BASE[dest]
+ | cmp edx, BASE
+ | jnb >3
+ |2: // Copy loop.
+ | mov eax, [edx]
+ | add edx, aword*1
+ | mov [TOP], eax
+ | add TOP, aword*1
+ | cmp edx, BASE
+ | jb <2
+ |3:
+ |// This is an open ins. Must keep TOP for next instruction.
+ |
+ |.tail
+ |5: // Grow stack for varargs.
+ | sub eax, L->top
+ | TValuediv eax
+ | call &luaD_growstack, L, eax
+ | mov BASE, L->base
+ | jmp <1 // Just restart op to avoid saving/restoring regs.
+ |.code
+ } else if (num > 0) { /* Copy limited number of varargs. */
+ |// Copy [ci->func+1+pt->numparams, BASE) -> [BASE+dest, BASE+dest+num).
+ | mov CI, L->ci
+ | mov edx, CI->func
+ | add edx, (1+J->pt->numparams)*#TVALUE
+ | lea TOP, BASE[dest]
+ | lea ecx, BASE[dest+num]
+ | cmp edx, BASE // No varargs present: only fill.
+ | jnb >2
+ |
+ |1: // Copy loop.
+ | mov eax, [edx]
+ | add edx, aword*1
+ | mov [TOP], eax
+ | add TOP, aword*1
+ | cmp TOP, ecx // Stop if all dest slots got a vararg.
+ | jnb >4
+ | cmp edx, BASE // Continue if more varargs present.
+ | jb <1
+ |
+ |2: // Fill remaining slots with nils.
+ | xor eax, eax // Assumes: LUA_TNIL == 0
+ |3: // Fill loop.
+ | settt TOP[0], eax
+ | add TOP, #TVALUE
+ | cmp TOP, ecx
+ | jb <3
+ |4:
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
diff --git a/src/luajit/ljit_x86.dash b/src/luajit/ljit_x86.dash
new file mode 100644
index 0000000000..aa48227e84
--- /dev/null
+++ b/src/luajit/ljit_x86.dash
@@ -0,0 +1,297 @@
+|//
+|// Common DynASM definitions and macros for x86 CPUs.
+|// Copyright (C) 2005-2008 Mike Pall. See Copyright Notice in luajit.h
+|//
+|
+|// Standard DynASM declarations.
+|.arch x86
+|.section code, deopt, tail, mfmap
+|
+|// Type definitions with (almost) global validity.
+|.type L, lua_State, esi // L.
+|.type BASE, TValue, ebx // L->base.
+|.type TOP, TValue, edi // L->top (calls/open ops).
+|.type CI, CallInfo, ecx // L->ci (calls, locally).
+|.type LCL, LClosure, eax // func->value (calls).
+|
+|// Type definitions with local validity.
+|.type GL, global_State
+|.type TVALUE, TValue
+|.type VALUE, Value
+|.type CINFO, CallInfo
+|.type GCOBJECT, GCObject
+|.type TSTRING, TString
+|.type TABLE, Table
+|.type CCLOSURE, CClosure
+|.type PROTO, Proto
+|.type UPVAL, UpVal
+|.type NODE, Node
+|
+|// Definitions copied to DynASM domain to avoid unnecessary constant args.
+|// CHECK: must match with the definitions in lua.h!
+|.define LUA_TNIL, 0
+|.define LUA_TBOOLEAN, 1
+|.define LUA_TLIGHTUSERDATA, 2
+|.define LUA_TNUMBER, 3
+|.define LUA_TSTRING, 4
+|.define LUA_TTABLE, 5
+|.define LUA_TFUNCTION, 6
+|.define LUA_TUSERDATA, 7
+|.define LUA_TTHREAD, 8
+|
+|.define LUA_TNUM_NUM, 0x33
+|.define LUA_TNUM_NUM_NUM, 0x333
+|.define LUA_TSTR_STR, 0x44
+|.define LUA_TSTR_NUM, 0x43
+|.define LUA_TSTR_NUM_NUM, 0x433
+|.define LUA_TTABLE_NUM, 0x53
+|.define LUA_TTABLE_STR, 0x54
+|
+|// Macros to test, set and copy stack slots.
+|.macro istt, idx, tp; cmp dword BASE[idx].tt, tp; .endmacro
+|.macro isnil, idx; istt idx, LUA_TNIL; .endmacro
+|.macro isnumber, idx; istt idx, LUA_TNUMBER; .endmacro
+|.macro isstring, idx; istt idx, LUA_TSTRING; .endmacro
+|.macro istable, idx; istt idx, LUA_TTABLE; .endmacro
+|.macro isfunction, idx; istt idx, LUA_TFUNCTION; .endmacro
+|
+|.macro isnumber2, idx1, idx2, reg
+| mov reg, BASE[idx1].tt; shl reg, 4; or reg, BASE[idx2].tt
+| cmp reg, LUA_TNUM_NUM
+|.endmacro
+|.macro isnumber2, idx1, idx2; isnumber2, idx1, idx2, eax; .endmacro
+|
+|.macro isnumber3, idx1, idx2, idx3, reg
+| mov reg, BASE[idx1].tt; shl reg, 4; or reg, BASE[idx2].tt
+| shl reg, 4; or reg, BASE[idx3].tt; cmp reg, LUA_TNUM_NUM_NUM
+|.endmacro
+|.macro isnumber3, idx1, idx2, idx3; isnumber3, idx1, idx2, idx3, eax; .endmacro
+|
+|.macro tvisnil, tv; cmp dword tv.tt, LUA_TNIL; .endmacro
+|
+|.macro settt, tv, tp; mov dword tv.tt, tp; .endmacro
+|.macro setnilvalue, tv; settt tv, LUA_TNIL; .endmacro
+|
+|.macro setbvalue, tv, val // May use edx.
+||if (val) { /* true */
+| mov edx, LUA_TBOOLEAN
+| mov dword tv.value, edx // Assumes: LUA_TBOOLEAN == 1
+| settt tv, edx
+||} else { /* false */
+| mov dword tv.value, 0
+| settt tv, LUA_TBOOLEAN
+||}
+|.endmacro
+|
+|.macro loadnvaluek, vptr
+||if ((vptr)->n == (lua_Number)0) {
+| fldz
+||} else if ((vptr)->n == (lua_Number)1) {
+| fld1
+||} else {
+| fld qword [vptr]
+||}
+|.endmacro
+|
+|.macro setnvaluek, tv, vptr // Pass a Value *! With permanent addr.
+| // SSE2 does not pay off here (I tried).
+| loadnvaluek vptr
+| fstp qword tv.value
+| settt tv, LUA_TNUMBER
+|.endmacro
+|
+|.macro setnvalue, tv, vptr // Pass a Value *! Temporary ok.
+| mov dword tv.value, (vptr)->na[0]
+| mov dword tv.value.na[1], (vptr)->na[1]
+| settt tv, LUA_TNUMBER
+|.endmacro
+|
+|.macro setsvalue, tv, vptr
+| mov aword tv.value, vptr
+| settt tv, LUA_TSTRING
+|.endmacro
+|
+|.macro sethvalue, tv, vptr
+| mov aword tv.value, vptr
+| settt tv, LUA_TTABLE
+|.endmacro
+|
+|.macro copyslotSSE, D, S, R1 // May use xmm0.
+| mov R1, S.tt; movq xmm0, qword S.value
+| mov D.tt, R1; movq qword D.value, xmm0
+|.endmacro
+|
+|.macro copyslot, D, S, R1, R2, R3
+||if (J->flags & JIT_F_CPU_SSE2) {
+| copyslotSSE D, S, R1
+||} else {
+| mov R1, S.value; mov R2, S.value.na[1]; mov R3, S.tt
+| mov D.value, R1; mov D.value.na[1], R2; mov D.tt, R3
+||}
+|.endmacro
+|
+|.macro copyslot, D, S, R1, R2
+||if (J->flags & JIT_F_CPU_SSE2) {
+| copyslotSSE D, S, R1
+||} else {
+| mov R1, S.value; mov R2, S.value.na[1]; mov D.value, R1
+| mov R1, S.tt; mov D.value.na[1], R2; mov D.tt, R1
+||}
+|.endmacro
+|
+|.macro copyslot, D, S
+| copyslot D, S, ecx, edx, eax
+|.endmacro
+|
+|.macro copyconst, tv, tvk // May use edx.
+||switch (ttype(tvk)) {
+||case LUA_TNIL:
+| setnilvalue tv
+|| break;
+||case LUA_TBOOLEAN:
+| setbvalue tv, bvalue(tvk) // May use edx.
+|| break;
+||case LUA_TNUMBER: {
+| setnvaluek tv, &(tvk)->value
+|| break;
+||}
+||case LUA_TSTRING:
+| setsvalue tv, &gcvalue(tvk)
+|| break;
+||default: lua_assert(0); break;
+||}
+|.endmacro
+|
+|// Macros to get Lua structures.
+|.macro getLCL, reg // May use CI and TOP (edi).
+||if (!J->pt->is_vararg) {
+| mov LCL:reg, BASE[-1].value
+||} else {
+| mov CI, L->ci
+| mov TOP, CI->func
+| mov LCL:reg, TOP->value
+||}
+|.endmacro
+|.macro getLCL; getLCL eax; .endmacro
+|
+|// Macros to handle variants.
+|.macro addidx, type, idx
+||if (idx) {
+| add type, idx*#type
+||}
+|.endmacro
+|
+|.macro subidx, type, idx
+||if (idx) {
+| sub type, idx*#type
+||}
+|.endmacro
+|
+|// Annoying x87 stuff: support for two compare variants.
+|.macro fcomparepp // Compare and pop st0 >< st1.
+||if (J->flags & JIT_F_CPU_CMOV) {
+| fucomip st1
+| fpop
+||} else {
+| fucompp
+| fnstsw ax // eax modified!
+| sahf
+| // Sometimes test ah, imm8 would be faster.
+| // But all following compares need to be changed then.
+| // Don't bother since this is only compatibility stuff for old CPUs.
+||}
+|.endmacro
+|
+|// If you change LUA_TVALUE_ALIGN, be sure to change the Makefile, too:
+|// DASMFLAGS= -D TVALUE_SIZE=...
+|// Then rerun make. Or change the default below:
+|.if not TVALUE_SIZE; .define TVALUE_SIZE, 16; .endif
+|
+|.if TVALUE_SIZE == 16
+| .macro TValuemul, reg; sal reg, 4; .endmacro // *16
+| .macro TValuediv, reg; sar reg, 4; .endmacro // /16
+| .macro Nodemul, reg; sal reg, 5; .endmacro // *32
+|.elif TVALUE_SIZE == 12
+| .macro TValuemul, reg; sal reg, 2; lea reg, [reg+reg*2]; .endmacro // *12
+| .macro TValuediv, reg; sal reg, 2; imul reg, 0xaaaaaaab; .endmacro // /12
+| .macro Nodemul, reg; imul reg, 28; .endmacro // *28
+|.else
+| .fatal Unsupported TValue size `TVALUE_SIZE'.
+|.endif
+|
+|//
+|// x86 C calling conventions and stack frame layout during a JIT call:
+|//
+|// ebp+aword*4 CARG2 nresults
+|// ebp+aword*3 CARG2 func (also used as SAVER3 for L)
+|// ebp+aword*2 CARG1 L
+|// ------------------------------- call to GATE_LJ
+|// ebp+aword*1 retaddr
+|// ebp+aword*0 frameptr ebp
+|// ebp-aword*1 SAVER1 TOP edi
+|// ebp-aword*2 SAVER2 BASE ebx
+|// -------------------------------
+|// GATE_LJ retaddr
+|// esp+aword*2 ARG3
+|// esp+aword*1 ARG2
+|// esp+aword*0 ARG1 <-- esp for first JIT frame
+|// -------------------------------
+|// 1st JIT frame retaddr
+|// esp+aword*2 ARG3
+|// esp+aword*1 ARG2
+|// esp+aword*0 ARG1 <-- esp for second JIT frame
+|// -------------------------------
+|// 2nd JIT frame retaddr
+|//
+|// We could omit the fixed frame pointer (ebp) and have one more register
+|// available. But there is no pressing need (could use it for CI).
+|// And it's easier for debugging (gdb is still confused -- why?).
+|//
+|// The stack is aligned to 4 awords (16 bytes). Calls to C functions
+|// with up to 3 arguments do not need any stack pointer adjustment.
+|//
+|
+|.define CARG3, [ebp+aword*4]
+|.define CARG2, [ebp+aword*3]
+|.define CARG1, [ebp+aword*2]
+|.define SAVER1, [ebp-aword*1]
+|.define SAVER2, [ebp-aword*2]
+|.define ARG7, aword [esp+aword*6] // Requires large frame.
+|.define ARG6, aword [esp+aword*5] // Requires large frame.
+|.define ARG5, aword [esp+aword*4] // Requires large frame.
+|.define ARG4, aword [esp+aword*3] // Requires large frame.
+|.define ARG3, aword [esp+aword*2]
+|.define ARG2, aword [esp+aword*1]
+|.define ARG1, aword [esp]
+|.define FRAME_RETADDR, aword [esp+aword*3]
+|.define TMP3, [esp+aword*2]
+|.define TMP2, [esp+aword*1]
+|.define TMP1, [esp]
+|.define FPARG2, qword [esp+qword*1] // Requires large frame.
+|.define FPARG1, qword [esp]
+|.define LJFRAME_OFFSET, aword*2 // 16 byte aligned with retaddr + ebp.
+|.define FRAME_OFFSET, aword*3 // 16 byte aligned with retaddr.
+|.define LFRAME_OFFSET, aword*7 // 16 byte aligned with retaddr.
+|.define S2LFRAME_OFFSET, aword*4 // Delta to large frame.
+|
+|.macro call, target, a1
+| mov ARG1, a1; call target; .endmacro
+|.macro call, target, a1, a2
+| mov ARG1, a1; mov ARG2, a2; call target; .endmacro
+|.macro call, target, a1, a2, a3
+| mov ARG1, a1; mov ARG2, a2; mov ARG3, a3; call target; .endmacro
+|.macro call, target, a1, a2, a3, a4
+| push a4; push a3; push a2; push a1
+| call target; add esp, S2LFRAME_OFFSET; .endmacro
+|.macro call, target, a1, a2, a3, a4, a5
+| mov ARG1, a5; push a4; push a3; push a2; push a1
+| call target; add esp, S2LFRAME_OFFSET; .endmacro
+|
+|// The following macros require a large frame.
+|.macro call_LFRAME, target, a1, a2, a3, a4
+| mov ARG1, a1; mov ARG2, a2; mov ARG3, a3; mov ARG4, a4
+| call target; .endmacro
+|.macro call_LFRAME, target, a1, a2, a3, a4, a5
+| mov ARG1, a1; mov ARG2, a2; mov ARG3, a3; mov ARG4, a4; mov ARG5, a5
+| call target; .endmacro
+|
diff --git a/src/luajit/ljit_x86.h b/src/luajit/ljit_x86.h
new file mode 100644
index 0000000000..329b3f0a33
--- /dev/null
+++ b/src/luajit/ljit_x86.h
@@ -0,0 +1,2303 @@
+/*
+** This file has been pre-processed with DynASM.
+** http://luajit.org/dynasm.html
+** DynASM version 1.1.4, DynASM x86 version 1.1.4
+** DO NOT EDIT! The original file is in "ljit_x86.dasc".
+*/
+
+#if DASM_VERSION != 10104
+#error "Version mismatch between DynASM and included encoding engine"
+#endif
+
+/*
+** Bytecode to machine code translation for x86 CPUs.
+** Copyright (C) 2005-2008 Mike Pall. See Copyright Notice in luajit.h
+*/
+
+#define DASM_SECTION_CODE 0
+#define DASM_SECTION_DEOPT 1
+#define DASM_SECTION_TAIL 2
+#define DASM_SECTION_MFMAP 3
+#define DASM_MAXSECTION 4
+#define Dt1(_V) (int)&(((lua_State *)0)_V)
+#define Dt2(_V) (int)&(((TValue *)0)_V)
+#define Dt3(_V) (int)&(((TValue *)0)_V)
+#define Dt4(_V) (int)&(((CallInfo *)0)_V)
+#define Dt5(_V) (int)&(((LClosure *)0)_V)
+#define Dt6(_V) (int)&(((global_State *)0)_V)
+#define Dt7(_V) (int)&(((TValue *)0)_V)
+#define Dt8(_V) (int)&(((Value *)0)_V)
+#define Dt9(_V) (int)&(((CallInfo *)0)_V)
+#define DtA(_V) (int)&(((GCObject *)0)_V)
+#define DtB(_V) (int)&(((TString *)0)_V)
+#define DtC(_V) (int)&(((Table *)0)_V)
+#define DtD(_V) (int)&(((CClosure *)0)_V)
+#define DtE(_V) (int)&(((Proto *)0)_V)
+#define DtF(_V) (int)&(((UpVal *)0)_V)
+#define Dt10(_V) (int)&(((Node *)0)_V)
+static const unsigned char jit_actionlist[5059] = {
+ 156,90,137,209,129,252,242,0,0,32,0,82,157,156,90,49,192,57,209,15,132,245,
+ 247,64,83,15,162,91,137,208,249,1,195,255,254,0,251,15,249,10,141,68,36,4,
+ 195,251,15,249,11,85,137,229,131,252,236,8,137,93,252,252,139,93,12,137,117,
+ 12,139,117,8,137,125,252,248,139,190,235,139,131,235,139,142,235,102,252,
+ 255,134,235,252,255,144,235,139,142,235,137,190,235,139,145,235,139,69,16,
+ 137,150,235,139,145,235,133,192,137,150,235,15,136,245,248,193,224,4,1,195,
+ 49,201,137,158,235,249,1,137,143,235,129,199,241,57,223,15,130,245,1,249,
+ 2,255,102,252,255,142,235,184,239,139,125,252,248,139,93,252,252,139,117,
+ 12,137,252,236,93,195,251,15,249,12,139,144,235,129,186,235,241,15,133,245,
+ 247,139,146,235,137,144,235,252,255,226,249,1,131,252,236,12,139,129,235,
+ 137,142,235,137,190,235,199,68,36,8,252,255,252,255,252,255,252,255,137,134,
+ 235,137,92,36,4,43,158,235,137,52,36,232,244,133,192,15,133,245,248,137,52,
+ 36,199,68,36,4,1,0,0,0,232,244,249,2,131,196,12,3,158,235,255,139,190,235,
+ 195,251,15,249,13,141,135,235,131,252,236,12,59,134,235,15,131,245,14,59,
+ 142,235,141,137,235,15,132,245,15,137,142,235,137,153,235,137,129,235,139,
+ 147,235,129,195,241,137,190,235,137,158,235,137,153,235,249,16,137,52,36,
+ 252,255,146,235,249,2,131,196,12,139,142,235,255,193,224,4,139,185,235,15,
+ 132,245,250,139,158,235,137,218,41,195,249,3,139,3,131,195,4,137,7,131,199,
+ 4,57,211,15,130,245,3,249,4,139,153,235,129,233,241,137,142,235,195,144,144,
+ 144,144,144,144,251,15,249,17,252,246,134,235,237,15,133,245,253,249,6,137,
+ 52,36,252,255,146,235,252,246,134,235,237,15,132,245,2,255,137,195,137,52,
+ 36,199,68,36,4,239,199,68,36,8,252,255,252,255,252,255,252,255,232,244,137,
+ 216,233,245,2,249,7,137,211,137,52,36,199,68,36,4,239,199,68,36,8,252,255,
+ 252,255,252,255,252,255,232,244,137,218,233,245,6,251,15,249,14,41,252,248,
+ 193,252,248,4,137,190,235,43,158,235,137,76,36,8,137,52,36,137,68,36,4,232,
+ 244,139,76,36,8,3,158,235,139,190,235,139,131,235,131,196,12,252,255,160,
+ 235,251,15,249,15,137,190,235,137,52,36,232,244,141,136,235,255,139,131,235,
+ 137,142,235,131,196,12,252,255,160,235,255,249,18,90,233,245,19,249,20,137,
+ 190,235,249,19,137,150,235,137,52,36,232,244,139,158,235,139,190,235,252,
+ 255,224,251,15,255,137,190,235,255,232,245,21,255,251,15,249,21,252,246,134,
+ 235,237,15,132,245,248,252,255,142,235,15,132,245,247,252,246,134,235,237,
+ 15,132,245,248,249,1,139,4,36,131,252,236,12,137,52,36,137,68,36,4,232,244,
+ 131,196,12,139,158,235,139,190,235,249,2,195,255,250,255,233,246,255,250,
+ 243,255,254,1,233,245,19,254,0,250,254,2,250,251,1,252,255,252,255,254,3,
+ 242,0,0,0,0,0,0,0,0,0,254,0,141,249,9,186,239,254,0,249,9,186,239,233,245,
+ 20,254,0,139,142,235,139,129,235,191,247,253,59,129,235,15,131,245,22,249,
+ 7,255,251,15,249,22,137,52,36,232,244,139,158,235,252,255,231,255,131,187,
+ 235,5,15,133,245,9,49,192,137,131,235,137,131,235,254,3,238,238,254,0,131,
+ 190,235,0,15,132,245,9,199,134,235,239,129,195,241,255,141,187,235,255,137,
+ 158,235,137,190,235,137,52,36,232,244,139,158,235,139,190,235,255,199,135,
+ 235,0,0,0,0,255,139,139,235,252,243,15,126,131,235,137,139,235,102,15,214,
+ 131,235,255,139,139,235,139,147,235,139,131,235,137,139,235,137,147,235,137,
+ 131,235,255,57,223,15,130,245,9,255,131,187,235,8,15,133,245,9,139,131,235,
+ 131,184,235,0,15,132,245,9,199,134,235,239,137,190,235,137,52,36,137,92,36,
+ 4,199,68,36,8,239,232,244,139,158,235,255,137,199,255,131,187,235,4,15,133,
+ 245,9,139,139,235,219,129,235,199,131,235,3,0,0,0,221,155,235,255,141,187,
+ 235,232,245,23,137,131,235,199,131,235,4,0,0,0,255,141,187,235,232,245,24,
+ 137,131,235,199,131,235,4,0,0,0,255,131,187,235,3,15,133,245,9,141,134,235,
+ 221,131,235,219,24,129,56,252,255,0,0,0,15,135,245,9,137,52,36,137,68,36,
+ 4,199,68,36,8,1,0,0,0,232,244,137,131,235,199,131,235,4,0,0,0,255,251,15,
+ 249,23,139,135,235,193,224,4,11,135,235,193,224,4,11,135,235,45,51,4,0,0,
+ 15,133,245,18,221,135,235,221,135,235,219,92,36,8,219,92,36,4,139,143,235,
+ 139,185,235,139,84,36,8,57,215,15,130,245,250,249,1,11,68,36,4,15,142,245,
+ 252,249,2,41,194,15,140,245,253,141,140,253,1,235,66,249,3,137,116,36,4,137,
+ 76,36,8,137,84,36,12,139,190,235,139,135,235,255,59,135,235,15,131,245,254,
+ 233,244,249,4,15,140,245,251,141,84,58,1,233,245,1,249,5,137,252,250,233,
+ 245,1,249,6,15,132,245,251,1,252,248,64,15,143,245,2,249,5,184,1,0,0,0,233,
+ 245,2,249,7,49,210,233,245,3,255,251,15,249,24,139,135,235,193,224,4,11,135,
+ 235,131,232,67,15,133,245,18,221,135,235,219,92,36,4,139,143,235,139,185,
+ 235,137,252,250,233,245,1,249,8,131,252,236,12,137,52,36,232,244,131,196,
+ 12,139,158,235,233,244,255,131,187,235,5,15,133,245,9,255,141,131,235,137,
+ 52,36,137,68,36,4,232,244,255,141,131,235,141,139,235,137,52,36,137,68,36,
+ 4,137,76,36,8,232,244,255,139,131,235,137,4,36,232,244,137,4,36,219,4,36,
+ 221,155,235,199,131,235,3,0,0,0,255,131,187,235,3,15,133,245,9,221,131,235,
+ 255,139,131,235,193,224,4,11,131,235,131,252,248,51,15,133,245,9,255,217,
+ 252,254,255,217,252,255,255,217,252,242,221,216,255,217,60,36,217,45,239,
+ 217,252,252,217,44,36,255,217,225,255,217,252,250,255,221,131,235,221,131,
+ 235,249,1,217,252,248,223,224,158,15,138,245,1,221,217,255,221,131,235,221,
+ 131,235,217,252,243,255,221,28,36,232,244,255,131,187,235,6,15,133,245,9,
+ 129,187,235,239,15,133,245,9,255,141,131,235,57,199,15,133,245,9,255,141,
+ 187,235,137,190,235,255,131,196,12,129,252,235,241,129,174,235,241,195,255,
+ 141,187,235,137,52,36,137,124,36,4,232,244,133,192,15,133,246,255,139,131,
+ 235,64,139,147,235,137,131,235,137,20,36,137,68,36,4,232,244,139,136,235,
+ 133,201,15,132,245,255,219,131,235,199,131,235,3,0,0,0,221,155,235,139,144,
+ 235,139,128,235,137,139,235,137,147,235,137,131,235,233,246,249,9,255,141,
+ 135,235,131,252,236,12,59,134,235,15,131,245,14,59,142,235,141,137,235,15,
+ 132,245,15,49,192,137,153,235,129,195,241,137,142,235,255,141,147,235,57,
+ 215,255,137,223,255,15,71,252,250,255,15,134,245,247,137,215,249,1,255,141,
+ 147,235,137,129,235,137,145,235,137,150,235,137,158,235,137,153,235,255,15,
+ 130,245,251,249,4,254,2,249,5,137,135,235,129,199,241,57,215,15,130,245,5,
+ 233,245,4,254,0,137,190,235,137,185,235,137,129,235,255,139,139,235,252,243,
+ 15,126,131,235,137,143,235,102,15,214,135,235,255,139,139,235,139,147,235,
+ 137,143,235,139,139,235,137,151,235,137,143,235,255,137,252,251,141,147,235,
+ 141,187,235,137,145,235,137,150,235,255,137,135,235,255,249,2,137,135,235,
+ 137,135,235,129,199,241,57,215,15,130,245,2,255,137,52,36,232,244,255,252,
+ 246,134,235,237,15,132,245,255,232,245,25,249,9,255,251,15,249,25,139,142,
+ 235,139,185,235,139,135,235,139,184,235,139,135,235,131,192,4,137,134,235,
+ 131,252,236,12,137,52,36,199,68,36,4,239,199,68,36,8,252,255,252,255,252,
+ 255,252,255,232,244,131,196,12,139,135,235,137,134,235,139,158,235,195,255,
+ 137,52,36,137,92,36,4,232,244,255,129,174,235,241,137,223,129,252,235,241,
+ 131,196,12,255,139,142,235,139,153,235,129,233,241,137,142,235,141,187,235,
+ 131,196,12,255,252,246,134,235,237,15,132,245,253,232,245,26,249,7,255,139,
+ 68,36,12,137,134,235,255,251,15,249,26,139,4,36,137,134,235,131,252,236,12,
+ 137,52,36,199,68,36,4,239,199,68,36,8,252,255,252,255,252,255,252,255,232,
+ 244,131,196,12,139,158,235,139,190,235,195,255,139,145,235,57,252,251,15,
+ 131,245,248,249,1,139,3,131,195,4,137,2,131,194,4,57,252,251,15,130,245,1,
+ 249,2,131,196,12,139,153,235,129,233,241,137,215,137,142,235,195,255,129,
+ 174,235,241,129,252,235,241,255,131,196,12,141,187,235,195,255,139,142,235,
+ 139,185,235,129,233,241,137,142,235,255,139,139,235,139,147,235,139,131,235,
+ 137,143,235,137,151,235,137,135,235,255,131,196,12,137,252,251,255,129,199,
+ 241,255,139,142,235,131,187,235,6,255,139,131,235,186,239,137,145,235,255,
+ 15,133,245,20,255,15,133,245,19,255,15,132,245,247,232,245,27,249,1,255,251,
+ 15,249,27,131,252,236,12,137,150,235,137,190,235,137,52,36,137,92,36,4,232,
+ 244,131,196,12,137,195,139,190,235,139,131,235,139,142,235,195,255,252,255,
+ 144,235,255,137,158,235,255,49,192,255,141,147,235,249,1,137,135,235,137,
+ 135,235,129,199,241,57,215,15,130,245,1,255,131,187,235,6,15,133,245,9,255,
+ 131,187,235,6,15,133,245,251,254,2,249,5,255,186,239,233,245,28,254,0,251,
+ 15,249,28,137,150,235,137,190,235,137,52,36,137,92,36,4,232,244,139,142,235,
+ 139,150,235,139,185,235,249,1,139,24,131,192,4,137,31,131,199,4,57,208,15,
+ 130,245,1,139,153,235,139,131,235,129,233,241,131,196,12,252,255,160,235,
+ 255,139,131,235,255,139,139,235,139,147,235,137,139,235,139,139,235,137,147,
+ 235,137,139,235,255,141,187,235,129,252,235,241,139,142,235,137,131,235,255,
+ 139,142,235,141,187,235,139,153,235,139,135,235,137,131,235,255,139,135,235,
+ 252,243,15,126,135,235,137,131,235,102,15,214,131,235,255,139,135,235,139,
+ 151,235,137,131,235,139,135,235,137,147,235,137,131,235,255,141,187,235,139,
+ 131,235,255,139,145,235,249,1,139,3,131,195,4,137,2,131,194,4,57,252,251,
+ 15,130,245,1,139,153,235,137,215,139,131,235,255,199,131,235,0,0,0,0,255,
+ 186,1,0,0,0,137,147,235,137,147,235,255,199,131,235,0,0,0,0,199,131,235,1,
+ 0,0,0,255,217,252,238,255,217,232,255,221,5,239,255,199,131,235,239,199,131,
+ 235,4,0,0,0,255,137,131,235,195,255,141,139,235,141,147,235,249,1,137,1,57,
+ 209,141,137,235,15,134,245,1,255,139,142,235,139,185,235,139,135,235,255,
+ 139,136,235,139,185,235,255,139,143,235,252,243,15,126,135,235,137,139,235,
+ 102,15,214,131,235,255,139,143,235,139,151,235,139,135,235,137,139,235,137,
+ 147,235,137,131,235,255,139,136,235,139,185,235,139,131,235,139,147,235,137,
+ 135,235,131,252,248,4,139,131,235,137,151,235,137,135,235,15,131,245,251,
+ 249,4,254,2,249,5,252,246,130,235,237,15,132,245,4,252,246,129,235,237,15,
+ 132,245,4,232,245,29,233,245,4,254,0,251,15,249,29,137,84,36,12,137,76,36,
+ 8,137,116,36,4,233,244,255,251,15,249,30,139,142,235,139,185,235,139,135,
+ 235,139,184,235,233,245,255,255,251,15,249,31,131,191,235,5,139,191,235,15,
+ 133,245,18,249,9,15,182,143,235,184,1,0,0,0,211,224,72,35,130,235,193,224,
+ 5,3,135,235,249,1,131,184,235,4,15,133,245,248,57,144,235,15,133,245,248,
+ 139,136,235,133,201,15,132,245,249,255,252,243,15,126,128,235,102,15,214,
+ 131,235,255,139,144,235,139,184,235,137,147,235,137,187,235,255,137,139,235,
+ 139,158,235,195,249,2,139,128,235,133,192,15,133,245,1,49,201,249,3,139,135,
+ 235,133,192,15,132,245,250,252,246,128,235,237,15,132,245,251,249,4,137,139,
+ 235,139,158,235,195,249,5,137,150,235,199,134,235,4,0,0,0,139,12,36,131,252,
+ 236,12,137,142,235,137,52,36,137,124,36,4,137,92,36,8,232,244,131,196,12,
+ 139,158,235,255,251,15,249,32,139,135,235,193,224,4,11,129,235,131,252,248,
+ 84,139,191,235,139,145,235,15,132,245,9,233,245,18,255,251,15,249,33,139,
+ 142,235,128,167,235,237,139,145,235,137,185,235,137,151,235,195,255,251,15,
+ 249,34,139,142,235,139,185,235,139,135,235,139,184,235,233,245,255,255,251,
+ 15,249,35,131,191,235,5,139,191,235,15,133,245,18,249,9,15,182,143,235,184,
+ 1,0,0,0,211,224,72,35,130,235,193,224,5,3,135,235,249,1,131,184,235,4,15,
+ 133,245,250,57,144,235,15,133,245,250,131,184,235,0,15,132,245,252,249,2,
+ 198,135,235,0,249,3,255,252,246,135,235,237,15,133,245,254,249,7,255,139,
+ 139,235,252,243,15,126,131,235,137,136,235,102,15,214,128,235,255,139,139,
+ 235,139,147,235,139,187,235,137,136,235,137,144,235,137,184,235,255,139,158,
+ 235,195,249,8,232,245,33,233,245,7,249,4,139,128,235,133,192,15,133,245,1,
+ 139,143,235,133,201,15,132,245,251,252,246,129,235,237,15,132,245,253,249,
+ 5,141,134,235,137,144,235,199,128,235,4,0,0,0,131,252,236,12,137,52,36,137,
+ 124,36,4,137,68,36,8,232,244,131,196,12,233,245,2,249,6,255,139,143,235,133,
+ 201,15,132,245,2,252,246,129,235,237,15,133,245,2,249,7,137,150,235,199,134,
+ 235,4,0,0,0,139,12,36,131,252,236,12,137,142,235,137,52,36,137,124,36,4,137,
+ 92,36,8,232,244,131,196,12,139,158,235,195,255,251,15,249,36,139,135,235,
+ 193,224,4,11,129,235,131,252,248,84,139,191,235,139,145,235,15,132,245,9,
+ 233,245,18,255,137,52,36,199,68,36,4,239,199,68,36,8,239,232,244,137,131,
+ 235,199,131,235,5,0,0,0,255,186,239,255,232,245,30,255,232,245,34,255,141,
+ 187,235,186,239,255,141,187,235,141,139,235,255,131,187,235,5,139,187,235,
+ 15,133,245,255,185,239,139,135,235,59,143,235,15,135,245,251,255,139,131,
+ 235,193,224,4,11,131,235,131,252,248,83,15,133,245,255,255,252,242,15,16,
+ 131,235,252,242,15,44,192,252,242,15,42,200,72,102,15,46,200,139,187,235,
+ 15,133,245,255,15,138,245,255,255,221,131,235,219,20,36,219,4,36,255,223,
+ 233,221,216,255,218,233,223,224,158,255,15,133,245,255,15,138,245,255,139,
+ 4,36,139,187,235,72,255,59,135,235,15,131,245,251,193,224,4,3,135,235,255,
+ 232,245,31,255,232,245,32,255,185,239,255,141,147,235,255,199,134,235,239,
+ 83,81,82,86,232,244,131,196,16,139,158,235,255,249,1,139,144,235,133,210,
+ 15,132,245,252,255,139,136,235,139,128,235,137,139,235,137,131,235,255,249,
+ 2,137,147,235,254,2,232,245,37,255,232,245,38,255,233,245,1,249,6,139,143,
+ 235,133,201,15,132,245,2,252,246,129,235,237,15,133,245,2,249,9,186,239,233,
+ 245,19,254,0,251,15,249,37,137,76,36,4,131,252,236,12,137,60,36,137,76,36,
+ 4,232,244,131,196,12,139,76,36,4,193,225,4,41,200,129,192,241,195,255,251,
+ 15,249,38,64,137,124,36,4,137,68,36,8,233,244,255,187,239,255,232,245,35,
+ 255,232,245,36,255,199,134,235,239,82,81,83,86,232,244,131,196,16,139,158,
+ 235,255,249,1,131,184,235,0,15,132,245,252,249,2,254,2,232,245,39,255,232,
+ 245,40,255,252,246,135,235,237,15,133,245,253,249,3,254,2,249,7,232,245,33,
+ 233,245,3,254,0,199,128,235,0,0,0,0,255,186,1,0,0,0,137,144,235,137,144,235,
+ 255,199,128,235,0,0,0,0,199,128,235,1,0,0,0,255,221,152,235,199,128,235,3,
+ 0,0,0,255,199,128,235,239,199,128,235,4,0,0,0,255,251,15,249,39,137,76,36,
+ 4,131,252,236,12,137,52,36,137,124,36,4,137,76,36,8,232,244,131,196,12,139,
+ 76,36,4,193,225,4,41,200,129,192,241,195,255,251,15,249,40,64,137,116,36,
+ 4,137,124,36,8,137,68,36,12,233,244,255,137,190,235,141,131,235,41,252,248,
+ 252,247,216,193,252,248,4,139,187,235,15,132,245,250,255,129,192,241,255,
+ 57,135,235,15,131,245,247,137,52,36,137,124,36,4,137,68,36,8,232,244,249,
+ 1,252,246,135,235,237,139,151,235,15,133,245,252,139,190,235,254,2,249,6,
+ 232,245,33,233,245,1,254,0,139,187,235,129,191,235,241,15,130,245,251,249,
+ 1,252,246,135,235,237,139,151,235,15,133,245,252,141,187,235,254,2,249,5,
+ 137,52,36,137,124,36,4,199,68,36,8,239,232,244,233,245,1,249,6,232,245,33,
+ 233,245,1,254,0,129,194,241,255,141,139,235,249,3,139,1,131,193,4,137,2,131,
+ 194,4,57,252,249,15,130,245,3,249,4,255,131,187,235,3,139,131,235,15,133,
+ 245,255,133,192,15,136,245,255,255,221,131,235,221,5,239,255,221,5,239,221,
+ 131,235,255,139,131,235,193,224,4,11,131,235,131,252,248,51,139,131,235,15,
+ 133,245,255,11,131,235,15,136,245,255,221,131,235,221,131,235,255,131,187,
+ 235,3,15,133,245,255,221,131,235,255,216,200,255,217,192,216,200,255,220,
+ 201,255,222,201,255,199,4,36,239,199,68,36,4,239,199,68,36,8,239,131,187,
+ 235,3,15,133,245,255,219,44,36,220,139,235,217,192,217,252,252,220,233,217,
+ 201,217,252,240,217,232,222,193,217,252,253,221,217,255,251,15,249,41,217,
+ 232,221,68,36,8,217,252,241,139,68,36,4,219,56,195,255,131,187,235,3,15,133,
+ 245,255,255,131,187,235,3,255,139,131,235,193,224,4,11,131,235,131,252,248,
+ 51,255,216,192,255,220,131,235,255,220,163,235,255,220,171,235,255,220,139,
+ 235,255,220,179,235,255,220,187,235,255,131,252,236,16,221,28,36,221,131,
+ 235,221,92,36,8,232,244,131,196,16,255,131,252,236,16,221,92,36,8,221,131,
+ 235,221,28,36,232,244,131,196,16,255,217,224,255,15,138,246,255,15,130,246,
+ 255,15,134,246,255,15,135,246,255,15,131,246,255,199,134,235,239,137,52,36,
+ 137,76,36,4,137,84,36,8,232,244,133,192,139,158,235,255,15,132,246,255,199,
+ 134,235,239,199,4,36,239,82,81,83,86,232,244,131,196,16,139,158,235,255,131,
+ 187,235,5,139,139,235,15,133,245,9,137,12,36,232,244,137,4,36,219,4,36,221,
+ 155,235,199,131,235,3,0,0,0,255,131,187,235,4,139,139,235,15,133,245,9,219,
+ 129,235,221,155,235,199,131,235,3,0,0,0,255,199,134,235,239,137,52,36,137,
+ 92,36,4,137,76,36,8,232,244,139,158,235,255,139,131,235,139,139,235,186,1,
+ 0,0,0,33,193,209,232,9,193,49,192,57,209,17,192,137,147,235,137,131,235,255,
+ 232,245,42,137,131,235,199,131,235,4,0,0,0,255,199,134,235,239,137,52,36,
+ 199,68,36,4,239,199,68,36,8,239,232,244,139,158,235,255,251,15,249,42,137,
+ 116,36,4,139,131,235,193,224,4,11,131,235,131,232,68,15,133,245,18,249,1,
+ 139,190,235,139,179,235,139,147,235,139,142,235,133,201,15,132,245,248,11,
+ 130,235,15,132,245,250,1,200,15,130,245,255,59,135,235,15,135,245,251,139,
+ 191,235,129,198,241,255,252,243,164,139,138,235,141,178,235,252,243,164,41,
+ 199,139,116,36,4,137,124,36,8,137,68,36,12,139,158,235,233,244,249,2,137,
+ 208,249,3,139,116,36,4,139,158,235,195,249,4,137,252,240,233,245,3,249,5,
+ 139,116,36,4,141,143,235,131,252,236,12,137,52,36,137,76,36,4,137,68,36,8,
+ 232,244,131,196,12,49,192,233,245,1,249,9,139,116,36,4,233,245,18,255,131,
+ 187,235,0,255,139,131,235,139,139,235,72,73,9,200,255,139,131,235,72,11,131,
+ 235,255,131,187,235,3,15,133,246,221,131,235,221,5,239,255,131,187,235,4,
+ 15,133,246,129,187,235,239,255,139,131,235,59,131,235,15,133,246,255,131,
+ 252,248,3,15,133,245,9,221,131,235,221,131,235,255,131,252,248,4,15,133,245,
+ 9,139,139,235,59,139,235,255,141,147,235,141,139,235,199,134,235,239,137,
+ 52,36,137,76,36,4,137,84,36,8,232,244,72,139,158,235,255,139,131,235,139,
+ 139,235,137,194,33,202,141,20,80,209,234,255,15,132,245,247,255,15,133,245,
+ 247,255,139,147,235,137,131,235,137,139,235,137,147,235,233,246,249,1,255,
+ 139,131,235,193,224,4,11,131,235,131,252,248,51,15,133,245,255,249,4,221,
+ 131,235,221,131,235,221,147,235,255,249,4,139,131,235,193,224,4,11,131,235,
+ 193,224,4,11,131,235,61,51,3,0,0,139,131,235,15,133,245,255,221,131,235,221,
+ 131,235,133,192,221,147,235,15,136,245,247,217,201,249,1,255,199,131,235,
+ 3,0,0,0,15,130,246,255,249,9,141,131,235,199,134,235,239,137,52,36,137,68,
+ 36,4,232,244,233,245,4,254,0,221,131,235,221,131,235,220,131,235,221,147,
+ 235,221,147,235,199,131,235,3,0,0,0,255,139,131,235,221,131,235,221,131,235,
+ 221,131,235,222,193,221,147,235,221,147,235,199,131,235,3,0,0,0,133,192,15,
+ 136,245,247,217,201,249,1,255,131,187,235,0,15,132,245,247,255,141,131,235,
+ 137,68,36,4,255,137,92,36,4,255,139,187,235,255,139,142,235,139,185,235,139,
+ 191,235,255,139,151,235,137,52,36,199,68,36,4,239,137,84,36,8,232,244,199,
+ 128,235,239,137,131,235,199,131,235,6,0,0,0,255,139,151,235,137,144,235,255,
+ 137,52,36,232,244,137,135,235,255,249,1,139,142,235,139,145,235,129,194,241,
+ 141,132,253,27,235,41,208,59,134,235,15,131,245,251,141,187,235,57,218,15,
+ 131,245,249,249,2,139,2,131,194,4,137,7,131,199,4,57,218,15,130,245,2,249,
+ 3,254,2,249,5,43,134,235,193,252,248,4,137,52,36,137,68,36,4,232,244,139,
+ 158,235,233,245,1,254,0,139,142,235,139,145,235,129,194,241,141,187,235,141,
+ 139,235,57,218,15,131,245,248,249,1,139,2,131,194,4,137,7,131,199,4,57,207,
+ 15,131,245,250,57,218,15,130,245,1,249,2,49,192,249,3,137,135,235,129,199,
+ 241,57,207,15,130,245,3,249,4,255
+};
+
+enum {
+ JSUB_STACKPTR,
+ JSUB_GATE_LJ,
+ JSUB_GATE_JL,
+ JSUB_GATE_JC,
+ JSUB_GROW_STACK,
+ JSUB_GROW_CI,
+ JSUB_GATE_JC_PATCH,
+ JSUB_GATE_JC_DEBUG,
+ JSUB_DEOPTIMIZE_CALLER,
+ JSUB_DEOPTIMIZE,
+ JSUB_DEOPTIMIZE_OPEN,
+ JSUB_HOOKINS,
+ JSUB_GCSTEP,
+ JSUB_STRING_SUB3,
+ JSUB_STRING_SUB2,
+ JSUB_HOOKCALL,
+ JSUB_HOOKRET,
+ JSUB_METACALL,
+ JSUB_METATAILCALL,
+ JSUB_BARRIERF,
+ JSUB_GETGLOBAL,
+ JSUB_GETTABLE_KSTR,
+ JSUB_GETTABLE_STR,
+ JSUB_BARRIERBACK,
+ JSUB_SETGLOBAL,
+ JSUB_SETTABLE_KSTR,
+ JSUB_SETTABLE_STR,
+ JSUB_GETTABLE_KNUM,
+ JSUB_GETTABLE_NUM,
+ JSUB_SETTABLE_KNUM,
+ JSUB_SETTABLE_NUM,
+ JSUB_LOG2_TWORD,
+ JSUB_CONCAT_STR2,
+ JSUB__MAX
+};
+
+/* ------------------------------------------------------------------------ */
+
+/* Arch string. */
+const char luaJIT_arch[] = "x86";
+
+/* Forward declarations for C functions called from jsubs. */
+static void jit_hookins(lua_State *L, const Instruction *newpc);
+static void jit_gettable_fb(lua_State *L, Table *t, StkId dest);
+static void jit_settable_fb(lua_State *L, Table *t, StkId val);
+
+/* ------------------------------------------------------------------------ */
+
+/* Detect CPU features and set JIT flags. */
+static int jit_cpudetect(jit_State *J)
+{
+ void *mcode;
+ size_t sz;
+ int status;
+ /* Some of the jsubs need the flags. So compile this separately. */
+ unsigned int feature;
+ dasm_setup(Dst, jit_actionlist);
+ dasm_put(Dst, 0);
+ (void)dasm_checkstep(Dst, DASM_SECTION_CODE);
+ status = luaJIT_link(J, &mcode, &sz);
+ if (status != JIT_S_OK)
+ return status;
+ /* Check feature bits. See the Intel/AMD manuals for the bit definitions. */
+ feature = ((unsigned int (*)(void))mcode)();
+ if (feature & (1<<15)) J->flags |= JIT_F_CPU_CMOV;
+ if (feature & (1<<26)) J->flags |= JIT_F_CPU_SSE2;
+ luaJIT_freemcode(J, mcode, sz); /* We don't need this code anymore. */
+ return JIT_S_OK;
+}
+
+/* Check some assumptions. Should compile to nop. */
+static int jit_consistency_check(jit_State *J)
+{
+ do {
+ /* Force a compiler error for inconsistent structure sizes. */
+ /* Check LUA_TVALUE_ALIGN in luaconf.h, too. */
+ int check_TVALUE_SIZE_in_ljit_x86_dash[1+16-sizeof(TValue)];
+ int check_TVALUE_SIZE_in_ljit_x86_dash_[1+sizeof(TValue)-16];
+ ((void)check_TVALUE_SIZE_in_ljit_x86_dash[0]);
+ ((void)check_TVALUE_SIZE_in_ljit_x86_dash_[0]);
+ if (LUA_TNIL != 0 || LUA_TBOOLEAN != 1 || PCRLUA != 0) break;
+ if ((int)&(((Node *)0)->i_val) != (int)&(((StkId)0)->value)) break;
+ return JIT_S_OK;
+ } while (0);
+ J->dasmstatus = 999999999; /* Recognizable error. */
+ return JIT_S_COMPILER_ERROR;
+}
+
+/* Compile JIT subroutines (once). */
+static int jit_compile_jsub(jit_State *J)
+{
+ int status = jit_consistency_check(J);
+ if (status != JIT_S_OK) return status;
+ status = jit_cpudetect(J);
+ if (status != JIT_S_OK) return status;
+ dasm_setup(Dst, jit_actionlist);
+ dasm_put(Dst, 34);
+ dasm_put(Dst, 36, Dt1(->top), Dt2(->value), Dt1(->ci), Dt1(->nCcalls), Dt5(->jit_gate), Dt1(->ci), Dt1(->top), Dt4(->savedpc), Dt1(->savedpc), Dt4(->base), Dt1(->base), Dt1(->top), Dt3(->tt), sizeof(TValue));
+ dasm_put(Dst, 145, Dt1(->nCcalls), PCRC, Dt5(->p), DtE(->jit_status), JIT_S_OK, DtE(->jit_mcode), Dt5(->jit_gate), Dt4(->savedpc), Dt1(->ci), Dt1(->top), Dt1(->savedpc), Dt1(->stack), (ptrdiff_t)(luaD_precall), (ptrdiff_t)(luaV_execute), Dt1(->stack));
+ dasm_put(Dst, 262, Dt1(->top), Dt3([LUA_MINSTACK]), Dt1(->stack_last), Dt1(->end_ci), Dt4([1]), Dt1(->ci), Dt4(->func), Dt4(->top), Dt2(->value), sizeof(TValue), Dt1(->top), Dt1(->base), Dt4(->base), DtD(->f), Dt1(->ci));
+ dasm_put(Dst, 336, Dt4(->func), Dt1(->top), Dt4(->func), sizeof(CallInfo), Dt1(->ci), Dt1(->hookmask), LUA_MASKCALL, DtD(->f), Dt1(->hookmask), LUA_MASKRET);
+ dasm_put(Dst, 421, LUA_HOOKRET, (ptrdiff_t)(luaD_callhook), LUA_HOOKCALL, (ptrdiff_t)(luaD_callhook), Dt1(->top), Dt1(->stack), (ptrdiff_t)(luaD_growstack), Dt1(->stack), Dt1(->top), Dt2(->value), Dt5(->jit_gate), Dt1(->top), (ptrdiff_t)(luaD_growCI), Dt9([-1]));
+ dasm_put(Dst, 547, Dt2(->value), Dt1(->ci), Dt5(->jit_gate));
+ dasm_put(Dst, 602, Dt1(->hookmask), LUA_MASKLINE|LUA_MASKCOUNT, Dt1(->hookcount), Dt1(->hookmask), LUA_MASKLINE, (ptrdiff_t)(jit_hookins), Dt1(->base), Dt1(->top));
+ dasm_put(Dst, 737, (ptrdiff_t)(luaC_step), Dt1(->base));
+ dasm_put(Dst, 1026, Dt3([0].tt), Dt3([1].tt), Dt3([2].tt), Dt3([1].value), Dt3([2].value), Dt3([0].value), DtB(->tsv.len), sizeof(TString)-1, Dt1(->l_G), Dt6(->totalbytes));
+ dasm_put(Dst, 1129, Dt6(->GCthreshold), (ptrdiff_t)(luaS_newlstr));
+ dasm_put(Dst, 1191, Dt3([0].tt), Dt3([1].tt), Dt3([1].value), Dt3([0].value), DtB(->tsv.len), (ptrdiff_t)(luaC_step), Dt1(->base), (ptrdiff_t)(luaS_newlstr));
+ dasm_put(Dst, 1755, Dt1(->ci), Dt4(->func), Dt3(->value), Dt5(->p), DtE(->code), Dt1(->savedpc), LUA_HOOKCALL, (ptrdiff_t)(luaD_callhook), DtE(->code), Dt1(->savedpc), Dt1(->base));
+ dasm_put(Dst, 1886, Dt1(->savedpc), LUA_HOOKRET, (ptrdiff_t)(luaD_callhook), Dt1(->base), Dt1(->top));
+ dasm_put(Dst, 2077, Dt1(->savedpc), Dt1(->top), (ptrdiff_t)(luaD_tryfuncTM), Dt1(->top), Dt2(->value), Dt1(->ci));
+ dasm_put(Dst, 2178, Dt1(->savedpc), Dt1(->top), (ptrdiff_t)(luaD_tryfuncTM), Dt1(->ci), Dt1(->top), Dt4(->func), Dt4(->func), Dt2(->value), sizeof(CallInfo), Dt5(->jit_gate));
+ dasm_put(Dst, 2570, (ptrdiff_t)(luaC_barrierf));
+ dasm_put(Dst, 2589, Dt1(->ci), Dt4(->func), Dt3(->value), Dt5(->env));
+ dasm_put(Dst, 2609, Dt3(->tt), Dt3(->value), DtC(->lsizenode), DtB(->tsv.hash), DtC(->node), Dt10(->i_key.nk.tt), Dt10(->i_key.nk.value), Dt10(->i_val.tt));
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 2674, Dt10(->i_val.value), Dt2(->value));
+ } else {
+ dasm_put(Dst, 2686, Dt10(->i_val.value), Dt10(->i_val.value.na[1]), Dt2(->value), Dt2(->value.na[1]));
+ }
+ dasm_put(Dst, 2699, Dt2(->tt), Dt1(->base), Dt10(->i_key.nk.next), DtC(->metatable), DtC(->flags), 1<<TM_INDEX, Dt2([0].tt), Dt1(->base), Dt1(->env.value), Dt1(->env.tt), Dt1(->savedpc), (ptrdiff_t)(jit_gettable_fb), Dt1(->base));
+ dasm_put(Dst, 32);
+ dasm_put(Dst, 2790, Dt3(->tt), Dt7(->tt), Dt3(->value), Dt7(->value));
+ dasm_put(Dst, 2821, Dt1(->l_G), DtC(->marked), (~bitmask(BLACKBIT))&0xff, Dt6(->grayagain), Dt6(->grayagain), DtC(->gclist));
+ dasm_put(Dst, 2843, Dt1(->ci), Dt4(->func), Dt3(->value), Dt5(->env));
+ dasm_put(Dst, 2863, Dt3(->tt), Dt3(->value), DtC(->lsizenode), DtB(->tsv.hash), DtC(->node), Dt10(->i_key.nk.tt), Dt10(->i_key.nk.value), Dt10(->i_val.tt), DtC(->flags));
+ dasm_put(Dst, 2935, DtC(->marked), bitmask(BLACKBIT));
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 2947, Dt2([0].tt), Dt2([0].value), Dt7([0].tt), Dt7([0].value));
+ } else {
+ dasm_put(Dst, 2965, Dt2([0].value), Dt2([0].value.na[1]), Dt2([0].tt), Dt7([0].value), Dt7([0].value.na[1]), Dt7([0].tt));
+ }
+ dasm_put(Dst, 2984, Dt1(->base), Dt10(->i_key.nk.next), DtC(->metatable), DtC(->flags), 1<<TM_NEWINDEX, Dt1(->env), Dt7([0].value), Dt7([0].tt), (ptrdiff_t)(luaH_newkey));
+ dasm_put(Dst, 3066, DtC(->metatable), DtC(->flags), 1<<TM_NEWINDEX, Dt1(->env.value), Dt1(->env.tt), Dt1(->savedpc), (ptrdiff_t)(jit_settable_fb), Dt1(->base));
+ dasm_put(Dst, 3127, Dt3(->tt), Dt7(->tt), Dt3(->value), Dt7(->value));
+ dasm_put(Dst, 3438, (ptrdiff_t)(luaH_getnum), sizeof(TValue));
+ dasm_put(Dst, 3476, (ptrdiff_t)(luaH_getnum));
+ dasm_put(Dst, 3623, (ptrdiff_t)(luaH_setnum), sizeof(TValue));
+ dasm_put(Dst, 3665, (ptrdiff_t)(luaH_setnum));
+ dasm_put(Dst, 3992);
+ dasm_put(Dst, 4325, Dt2([0].tt), Dt2([1].tt), Dt1(->l_G), Dt2([0].value), Dt2([1].value), DtB(->tsv.len), DtB(->tsv.len), Dt6(->buff.buffsize), Dt6(->buff.buffer), sizeof(TString));
+ dasm_put(Dst, 4396, DtB(->tsv.len), DtB([1]), Dt1(->base), (ptrdiff_t)(luaS_newlstr), Dt1(->base), Dt6(->buff), (ptrdiff_t)(luaZ_openspace));
+ dasm_put(Dst, 561, Dt1(->top), Dt1(->savedpc), (ptrdiff_t)(luaJIT_deoptimize), Dt1(->base), Dt1(->top));
+
+ (void)dasm_checkstep(Dst, DASM_SECTION_CODE);
+ status = luaJIT_link(J, &J->jsubmcode, &J->szjsubmcode);
+ if (status != JIT_S_OK)
+ return status;
+
+ /* Copy the callgates from the globals to the global state. */
+ G(J->L)->jit_gateLJ = (luaJIT_GateLJ)J->jsub[JSUB_GATE_LJ];
+ G(J->L)->jit_gateJL = (lua_CFunction)J->jsub[JSUB_GATE_JL];
+ G(J->L)->jit_gateJC = (lua_CFunction)J->jsub[JSUB_GATE_JC];
+ return JIT_S_OK;
+}
+
+/* Match with number of nops above. Avoid confusing the instruction decoder. */
+#define DEBUGPATCH_SIZE 6
+
+/* Notify backend that the debug mode may have changed. */
+void luaJIT_debugnotify(jit_State *J)
+{
+ unsigned char *patch = (unsigned char *)J->jsub[JSUB_GATE_JC_PATCH];
+ unsigned char *target = (unsigned char *)J->jsub[JSUB_GATE_JC_DEBUG];
+ /* Yep, this is self-modifying code -- don't tell anyone. */
+ if (patch[0] == 0xe9) { /* Debug patch is active. */
+ if (!(J->flags & JIT_F_DEBUG_CALL)) /* Deactivate it. */
+ memcpy(patch, target-DEBUGPATCH_SIZE, DEBUGPATCH_SIZE);
+ } else { /* Debug patch is inactive. */
+ if (J->flags & JIT_F_DEBUG_CALL) { /* Activate it. */
+ int rel = target-(patch+5);
+ memcpy(target-DEBUGPATCH_SIZE, patch, DEBUGPATCH_SIZE);
+ patch[0] = 0xe9; /* jmp */
+ memcpy(patch+1, &rel, 4); /* Relative address. */
+ memset(patch+5, 0x90, DEBUGPATCH_SIZE-5); /* nop */
+ }
+ }
+}
+
+/* Patch a jmp into existing mcode. */
+static void jit_patch_jmp(jit_State *J, void *mcode, void *to)
+{
+ unsigned char *patch = (unsigned char *)mcode;
+ int rel = ((unsigned char *)to)-(patch+5);
+ patch[0] = 0xe9; /* jmp */
+ memcpy((void *)(patch+1), &rel, 4); /* Relative addr. */
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Call line/count hook. */
+static void jit_hookins(lua_State *L, const Instruction *newpc)
+{
+ Proto *pt = ci_func(L->ci)->l.p;
+ int pc = luaJIT_findpc(pt, newpc); /* Sloooow with mcode addrs. */
+ const Instruction *savedpc = L->savedpc;
+ L->savedpc = pt->code + pc + 1;
+ if (L->hookmask > LUA_MASKLINE && L->hookcount == 0) {
+ resethookcount(L);
+ luaD_callhook(L, LUA_HOOKCOUNT, -1);
+ }
+ if (L->hookmask & LUA_MASKLINE) {
+ int newline = getline(pt, pc);
+ if (pc != 0) {
+ int oldpc = luaJIT_findpc(pt, savedpc);
+ if (!(pc <= oldpc || newline != getline(pt, oldpc))) return;
+ }
+ luaD_callhook(L, LUA_HOOKLINE, newline);
+ }
+}
+
+/* Insert hook check for each instruction in full debug mode. */
+static void jit_ins_debug(jit_State *J, int openop)
+{
+ if (openop) {
+ dasm_put(Dst, 594, Dt1(->top));
+ }
+ dasm_put(Dst, 598);
+
+}
+
+/* Called before every instruction. */
+static void jit_ins_start(jit_State *J)
+{
+ dasm_put(Dst, 663, J->nextpc);
+}
+
+/* Chain to another instruction. */
+static void jit_ins_chainto(jit_State *J, int pc)
+{
+ dasm_put(Dst, 665, pc);
+}
+
+/* Set PC label. */
+static void jit_ins_setpc(jit_State *J, int pc, void *target)
+{
+ dasm_put(Dst, 668, pc, (ptrdiff_t)(target));
+}
+
+/* Called after the last instruction has been encoded. */
+static void jit_ins_last(jit_State *J, int lastpc, int sizemfm)
+{
+ if (J->tflags & JIT_TF_USED_DEOPT) { /* Deopt section has been used? */
+ dasm_put(Dst, 671);
+ dasm_put(Dst, 673);
+ }
+ dasm_put(Dst, 678, lastpc+1);
+ dasm_put(Dst, 681, lastpc+2);
+ dasm_put(Dst, 690, sizemfm);
+}
+
+/* Add a deoptimize target for the current instruction. */
+static void jit_deopt_target(jit_State *J, int nargs)
+{
+ if (nargs != -1) {
+ dasm_put(Dst, 671);
+ dasm_put(Dst, 702, (ptrdiff_t)(J->nextins));
+ J->tflags |= JIT_TF_USED_DEOPT;
+ } else {
+ dasm_put(Dst, 679);
+ dasm_put(Dst, 709, (ptrdiff_t)(J->nextins));
+ }
+}
+
+/* luaC_checkGC() inlined. Destroys caller-saves + TOP (edi). Uses label 7:. */
+/* Use this only at the _end_ of an instruction. */
+static void jit_checkGC(jit_State *J)
+{
+ dasm_put(Dst, 718, Dt1(->l_G), Dt6(->totalbytes), Dt6(->GCthreshold));
+
+}
+
+/* ------------------------------------------------------------------------ */
+
+
+
+/*
+** Function inlining support for x86 CPUs.
+** Copyright (C) 2005-2008 Mike Pall. See Copyright Notice in luajit.h
+*/
+
+/* ------------------------------------------------------------------------ */
+
+/* Private structure holding function inlining info. */
+typedef struct jit_InlineInfo {
+ int func; /* Function slot. 1st arg slot = func+1. */
+ int res; /* 1st result slot. Overlaps func/ci->func. */
+ int nargs; /* Number of args. */
+ int nresults; /* Number of results. */
+ int xnargs; /* Expected number of args. */
+ int xnresults; /* Returned number of results. */
+ int hidx; /* Library/function index numbers. */
+} jit_InlineInfo;
+
+/* ------------------------------------------------------------------------ */
+
+enum { TFOR_FUNC, TFOR_TAB, TFOR_CTL, TFOR_KEY, TFOR_VAL };
+
+static void jit_inline_base(jit_State *J, jit_InlineInfo *ii)
+{
+ int func = ii->func;
+ switch (JIT_IH_IDX(ii->hidx)) {
+ case JIT_IH_BASE_PAIRS:
+ case JIT_IH_BASE_IPAIRS:
+ dasm_put(Dst, 753, Dt2([func+TFOR_TAB].tt), Dt2([func+TFOR_CTL].tt), Dt2([func+TFOR_CTL].value));
+ dasm_put(Dst, 771, JIT_MFM_DEOPT_PAIRS, J->nextpc-1);
+ break;
+ default:
+ jit_assert(0);
+ break;
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+#ifndef COCO_DISABLE
+
+/* Helper function for inlined coroutine.resume(). */
+static StkId jit_coroutine_resume(lua_State *L, StkId base, int nresults)
+{
+ lua_State *co = thvalue(base-1);
+ /* Check for proper usage. Merge of lua_resume() and auxresume() checks. */
+ if (co->status != LUA_YIELD) {
+ if (co->status > LUA_YIELD) {
+errdead:
+ setsvalue(L, base-1, luaS_newliteral(L, "cannot resume dead coroutine"));
+ goto err;
+ } else if (co->ci != co->base_ci) {
+ setsvalue(L, base-1,
+ luaS_newliteral(L, "cannot resume non-suspended coroutine"));
+ goto err;
+ } else if (co->base == co->top) {
+ goto errdead;
+ }
+ }
+ {
+ unsigned int ndelta = (char *)L->top - (char *)base;
+ int nargs = ndelta/sizeof(TValue); /* Compute nargs. */
+ int status;
+ if ((char *)co->stack_last-(char *)co->top <= ndelta) {
+ co->ci->top = (StkId)(((char *)co->top) + ndelta); /* Ok before grow. */
+ luaD_growstack(co, nargs); /* Grow thread stack. */
+ }
+ /* Copy args. */
+ co->top = (StkId)(((char *)co->top) + ndelta);
+ { StkId t = co->top, f = L->top; while (f > base) setobj2s(co, --t, --f); }
+ L->top = base;
+ status = luaCOCO_resume(co, nargs); /* Resume Coco thread. */
+ if (status == 0 || status == LUA_YIELD) { /* Ok. */
+ StkId f;
+ if (nresults == 0) return NULL;
+ if (nresults == -1) {
+ luaD_checkstack(L, co->top - co->base); /* Grow own stack. */
+ }
+ base = L->top - 2;
+ setbvalue(base++, 1); /* true */
+ /* Copy results. Fill unused result slots with nil. */
+ f = co->base;
+ while (--nresults != 0 && f < co->top) setobj2s(L, base++, f++);
+ while (nresults-- > 0) setnilvalue(base++);
+ co->top = co->base;
+ return base;
+ } else { /* Error. */
+ base = L->top;
+ setobj2s(L, base-1, co->top-1); /* Copy error object. */
+err:
+ setbvalue(base-2, 0); /* false */
+ nresults -= 2;
+ while (--nresults >= 0) setnilvalue(base+nresults); /* Fill results. */
+ return base;
+ }
+ }
+}
+
+static void jit_inline_coroutine(jit_State *J, jit_InlineInfo *ii)
+{
+ int arg = ii->func+1;
+ int res = ii->res;
+ int i;
+ switch (JIT_IH_IDX(ii->hidx)) {
+ case JIT_IH_COROUTINE_YIELD:
+ dasm_put(Dst, 775, ((int)&LHASCOCO((lua_State *)0)), Dt1(->savedpc), (ptrdiff_t)(J->nextins), arg*sizeof(TValue));
+ if (ii->nargs >= 0) { /* Previous op was not open and did not set TOP. */
+ dasm_put(Dst, 791, Dt2([ii->nargs]));
+ }
+ dasm_put(Dst, 795, Dt1(->base), Dt1(->top), (ptrdiff_t)(luaCOCO_yield), Dt1(->base), Dt1(->top));
+ jit_assert(ii->nresults >= 0 && ii->nresults <= EXTRA_STACK);
+ for (i = 0; i < ii->nresults; i++) {
+ dasm_put(Dst, 813, Dt3([i].tt));
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 821, Dt2([arg+i].tt), Dt2([arg+i].value), Dt2([res+i].tt), Dt2([res+i].value));
+ } else {
+ dasm_put(Dst, 839, Dt2([arg+i].value), Dt2([arg+i].value.na[1]), Dt2([arg+i].tt), Dt2([res+i].value), Dt2([res+i].value.na[1]), Dt2([res+i].tt));
+ }
+ }
+ ii->nargs = -1; /* Force restore of L->top. */
+ break;
+ case JIT_IH_COROUTINE_RESUME:
+ jit_assert(ii->nargs != 0 && ii->res == ii->func);
+ dasm_put(Dst, 787, (arg+1)*sizeof(TValue));
+ if (ii->nargs >= 0) { /* Previous op was not open and did not set TOP. */
+ dasm_put(Dst, 791, Dt2([ii->nargs-1]));
+ } else {
+ dasm_put(Dst, 858);
+ }
+ dasm_put(Dst, 865, Dt2([-1].tt), Dt2([-1].value), ((int)&LHASCOCO((lua_State *)0)), Dt1(->savedpc), (ptrdiff_t)(J->nextins), Dt1(->top), ii->nresults, (ptrdiff_t)(jit_coroutine_resume), Dt1(->base));
+ if (ii->nresults == -1) {
+ dasm_put(Dst, 909);
+ }
+ ii->nargs = -1; /* Force restore of L->top. */
+ break;
+ default:
+ jit_assert(0);
+ break;
+ }
+}
+
+#endif /* COCO_DISABLE */
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_inline_string(jit_State *J, jit_InlineInfo *ii)
+{
+ int arg = ii->func+1;
+ int res = ii->res;
+ switch (JIT_IH_IDX(ii->hidx)) {
+ case JIT_IH_STRING_LEN:
+ dasm_put(Dst, 912, Dt2([arg].tt), Dt2([arg].value), DtB(->tsv.len), Dt2([res].tt), Dt2([res].value));
+ break;
+ case JIT_IH_STRING_SUB:
+ /* TODO: inline numeric constants with help from the optimizer. */
+ /* But this would save only another 15-20% in a trivial loop. */
+ jit_assert(ii->nargs >= 2); /* Open op caveat is ok, too. */
+ if (ii->nargs > 2) {
+ dasm_put(Dst, 937, Dt2([arg]), Dt2([res].value), Dt2([res].tt));
+ } else {
+ dasm_put(Dst, 954, Dt2([arg]), Dt2([res].value), Dt2([res].tt));
+ }
+ break;
+ case JIT_IH_STRING_CHAR:
+ dasm_put(Dst, 971, Dt2([arg].tt), Dt1(->env), Dt2([arg].value), (ptrdiff_t)(luaS_newlstr), Dt2([res].value), Dt2([res].tt));
+ break;
+ default:
+ jit_assert(0);
+ break;
+ }
+
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Helper functions for inlined calls to table.*. */
+static void jit_table_insert(lua_State *L, TValue *arg)
+{
+ setobj2t(L, luaH_setnum(L, hvalue(arg), luaH_getn(hvalue(arg))+1), arg+1);
+ luaC_barriert(L, hvalue(arg), arg+1);
+}
+
+static TValue *jit_table_remove(lua_State *L, TValue *arg, TValue *res)
+{
+ int n = luaH_getn(hvalue(arg));
+ if (n == 0) {
+ setnilvalue(res); /* For the nresults == 1 case. Harmless otherwise. */
+ return res; /* For the nresults == -1 case. */
+ } else {
+ TValue *val = luaH_setnum(L, hvalue(arg), n);
+ setobj2s(L, res, val);
+ setnilvalue(val);
+ return res+1; /* For the nresults == -1 case. */
+ }
+}
+
+static void jit_inline_table(jit_State *J, jit_InlineInfo *ii)
+{
+ int arg = ii->func+1;
+ int res = ii->res;
+ dasm_put(Dst, 1250, Dt2([arg].tt));
+ switch (JIT_IH_IDX(ii->hidx)) {
+ case JIT_IH_TABLE_INSERT:
+ jit_assert(ii->nargs == 2);
+ dasm_put(Dst, 1259, Dt2([arg]), (ptrdiff_t)(jit_table_insert));
+ break;
+ case JIT_IH_TABLE_REMOVE:
+ jit_assert(ii->nargs == 1);
+ dasm_put(Dst, 1272, Dt2([arg]), Dt2([res]), (ptrdiff_t)(jit_table_remove));
+ if (ii->nresults == -1) {
+ ii->xnresults = -1;
+ dasm_put(Dst, 909);
+ }
+ break;
+ case JIT_IH_TABLE_GETN:
+ dasm_put(Dst, 1292, Dt2([arg].value), (ptrdiff_t)(luaH_getn), Dt2([res].value), Dt2([res].tt));
+ break;
+ default:
+ jit_assert(0);
+ break;
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* This typedef must match the libm function signature. */
+/* Serves as a check against wrong lua_Number or wrong calling conventions. */
+typedef lua_Number (*mathfunc_11)(lua_Number);
+
+/* Partially inlined math functions. */
+/* CHECK: must match with jit_hints.h and jit.opt_lib. */
+static const mathfunc_11 jit_mathfuncs_11[JIT_IH_MATH_SIN] = {
+ log, log10, exp, sinh, cosh, tanh, asin, acos, atan
+};
+
+/* FPU control words for ceil and floor (exceptions masked, full precision). */
+static const unsigned short jit_fpucw[2] = { 0x0b7f, 0x077f };
+
+static void jit_inline_math(jit_State *J, jit_InlineInfo *ii)
+{
+ int arg = ii->func+1;
+ int res = ii->res;
+ int idx = JIT_IH_IDX(ii->hidx);
+
+ if (idx < JIT_IH_MATH__21) {
+ dasm_put(Dst, 1317, Dt2([arg].tt), Dt2([arg].value));
+ } else {
+ jit_assert(idx < JIT_IH_MATH__LAST);
+ dasm_put(Dst, 1329, Dt2([arg].tt), Dt2([arg+1].tt));
+ }
+ switch (idx) {
+ /* We ignore sin/cos/tan range overflows (2^63 rad) just like -ffast-math. */
+ case JIT_IH_MATH_SIN:
+ dasm_put(Dst, 1347);
+ break;
+ case JIT_IH_MATH_COS:
+ dasm_put(Dst, 1351);
+ break;
+ case JIT_IH_MATH_TAN:
+ dasm_put(Dst, 1355);
+ break;
+ case JIT_IH_MATH_CEIL:
+ case JIT_IH_MATH_FLOOR:
+ dasm_put(Dst, 1361, (ptrdiff_t)&jit_fpucw[idx-JIT_IH_MATH_CEIL]);
+ break;
+ case JIT_IH_MATH_ABS:
+ dasm_put(Dst, 1374);
+ break;
+ case JIT_IH_MATH_SQRT:
+ dasm_put(Dst, 1377);
+ break;
+ case JIT_IH_MATH_FMOD:
+ dasm_put(Dst, 1381, Dt2([arg+1].value), Dt2([arg].value));
+ break;
+ case JIT_IH_MATH_ATAN2:
+ dasm_put(Dst, 1402, Dt2([arg].value), Dt2([arg+1].value));
+ break;
+ default:
+ dasm_put(Dst, 1412, (ptrdiff_t)(jit_mathfuncs_11[idx]));
+ break;
+ }
+ dasm_put(Dst, 926, Dt2([res].tt), Dt2([res].value));
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Try to inline a CALL or TAILCALL instruction. */
+static int jit_inline_call(jit_State *J, int func, int nargs, int nresults)
+{
+ const TValue *callable = hint_get(J, TYPE); /* TYPE hint = callable. */
+ int cltype = ttype(callable);
+ const TValue *oidx;
+ jit_InlineInfo ii;
+ int idx;
+
+ if (cltype != LUA_TFUNCTION) goto fail;
+ if (J->flags & JIT_F_DEBUG) goto fail; /* DWIM. */
+
+ oidx = hint_get(J, INLINE); /* INLINE hint = library/function index. */
+ if (!ttisnumber(oidx)) goto fail;
+
+ ii.hidx = (int)nvalue(oidx);
+ idx = JIT_IH_IDX(ii.hidx);
+
+ if (nresults == -2) { /* Tailcall. */
+ /* Tailcalls from vararg functions don't work with BASE[-1]. */
+ if (J->pt->is_vararg) goto fail; /* So forget about this rare case. */
+ ii.res = -1; /* Careful: 2nd result overlaps 1st stack slot. */
+ ii.nresults = -1;
+ } else {
+ ii.res = func;
+ ii.nresults = nresults;
+ }
+ ii.func = func;
+ ii.nargs = nargs;
+ ii.xnargs = ii.xnresults = 1; /* Default: 1 arg, 1 result. */
+
+ /* Check for the currently supported cases. */
+ switch (JIT_IH_LIB(ii.hidx)) {
+ case JIT_IHLIB_BASE:
+ switch (idx) {
+ case JIT_IH_BASE_PAIRS:
+ case JIT_IH_BASE_IPAIRS:
+ if (nresults == -2) goto fail; /* Not useful for tailcalls. */
+ ii.xnresults = 3;
+ goto check;
+ }
+ break;
+#ifndef COCO_DISABLE
+ case JIT_IHLIB_COROUTINE:
+ switch (idx) {
+ case JIT_IH_COROUTINE_YIELD:
+ /* Only support common cases: no tailcalls, low number of results. */
+ if (nresults < 0 || nresults > EXTRA_STACK) goto fail;
+ ii.xnargs = ii.xnresults = -1;
+ goto ok; /* Anything else is ok. */
+ case JIT_IH_COROUTINE_RESUME:
+ /* Only support common cases: no tailcalls, not with 0 args (error). */
+ if (nresults == -2 || nargs == 0) goto fail;
+ ii.xnargs = ii.xnresults = -1;
+ goto ok; /* Anything else is ok. */
+ }
+ break;
+#endif
+ case JIT_IHLIB_STRING:
+ switch (idx) {
+ case JIT_IH_STRING_LEN:
+ goto check;
+ case JIT_IH_STRING_SUB:
+ if (nargs < 2) goto fail; /* No support for open calls, too. */
+ goto ok; /* 2 or more args are ok. */
+ case JIT_IH_STRING_CHAR:
+ goto check; /* Only single arg supported. */
+ }
+ break;
+ case JIT_IHLIB_TABLE:
+ switch (idx) {
+ case JIT_IH_TABLE_INSERT:
+ ii.xnargs = 2;
+ goto check; /* Only push (append) supported. */
+ case JIT_IH_TABLE_REMOVE:
+ goto check; /* Only pop supported. */
+ case JIT_IH_TABLE_GETN:
+ goto check;
+ }
+ break;
+ case JIT_IHLIB_MATH:
+ if (idx >= JIT_IH_MATH__LAST) goto fail;
+ if (idx >= JIT_IH_MATH__21) ii.xnargs = 2;
+ goto check;
+ }
+fail:
+ return cltype; /* Call could not be inlined. Return type of callable. */
+
+check:
+ if (nargs != ii.xnargs && nargs != -1) goto fail;
+ /* The optimizer already checks the number of results (avoid setnil). */
+
+ok: /* Whew, all checks done. Go for it! */
+
+ /* Start with the common leadin for inlined calls. */
+ jit_deopt_target(J, nargs);
+ dasm_put(Dst, 1418, Dt2([func].tt), Dt2([func].value), (ptrdiff_t)(clvalue(callable)));
+ if (nargs == -1 && ii.xnargs >= 0) {
+ dasm_put(Dst, 1435, Dt2([func+1+ii.xnargs]));
+ }
+
+ /* Now inline the function itself. */
+ switch (JIT_IH_LIB(ii.hidx)) {
+ case JIT_IHLIB_BASE: jit_inline_base(J, &ii); break;
+#ifndef COCO_DISABLE
+ case JIT_IHLIB_COROUTINE: jit_inline_coroutine(J, &ii); break;
+#endif
+ case JIT_IHLIB_STRING: jit_inline_string(J, &ii); break;
+ case JIT_IHLIB_TABLE: jit_inline_table(J, &ii); break;
+ case JIT_IHLIB_MATH: jit_inline_math(J, &ii); break;
+ default: jit_assert(0); break;
+ }
+
+ /* And add the common leadout for inlined calls. */
+ if (ii.nresults == -1) {
+ if (ii.xnresults >= 0) {
+ dasm_put(Dst, 791, Dt2([ii.res+ii.xnresults]));
+ }
+ } else if (ii.nargs == -1) { /* Restore L->top only if needed. */
+ dasm_put(Dst, 1445, Dt2([J->pt->maxstacksize]), Dt1(->top));
+ }
+
+ if (nresults == -2) { /* Results are in place. Add return for tailcalls. */
+ dasm_put(Dst, 1452, sizeof(TValue), Dt1(->ci), sizeof(CallInfo));
+ }
+
+ return -1; /* Success, call has been inlined. */
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Helper function for inlined iterator code. Paraphrased from luaH_next. */
+/* TODO: GCC has trouble optimizing this. */
+static int jit_table_next(lua_State *L, TValue *ra)
+{
+ Table *t = hvalue(&ra[TFOR_TAB]);
+ int i = ra[TFOR_CTL].value.b; /* Hidden control variable. */
+ for (; i < t->sizearray; i++) { /* First the array part. */
+ if (!ttisnil(&t->array[i])) {
+ setnvalue(&ra[TFOR_KEY], cast_num(i+1));
+ setobj2s(L, &ra[TFOR_VAL], &t->array[i]);
+ ra[TFOR_CTL].value.b = i+1;
+ return 1;
+ }
+ }
+ for (i -= t->sizearray; i < sizenode(t); i++) { /* Then the hash part. */
+ if (!ttisnil(gval(gnode(t, i)))) {
+ setobj2s(L, &ra[TFOR_KEY], key2tval(gnode(t, i)));
+ setobj2s(L, &ra[TFOR_VAL], gval(gnode(t, i)));
+ ra[TFOR_CTL].value.b = i+1+t->sizearray;
+ return 1;
+ }
+ }
+ return 0; /* End of iteration. */
+}
+
+/* Try to inline a TFORLOOP instruction. */
+static int jit_inline_tforloop(jit_State *J, int ra, int nresults, int target)
+{
+ const TValue *oidx = hint_get(J, INLINE); /* INLINE hint = lib/func idx. */
+ int idx;
+
+ if (!ttisnumber(oidx)) return 0; /* No hint: don't inline anything. */
+ idx = (int)nvalue(oidx);
+ if (J->flags & JIT_F_DEBUG) return 0; /* DWIM. */
+
+ switch (idx) {
+ case JIT_IH_MKIDX(JIT_IHLIB_BASE, JIT_IH_BASE_PAIRS):
+ dasm_put(Dst, 1465, Dt2([ra]), (ptrdiff_t)(jit_table_next), target);
+ return 1; /* Success, iterator has been inlined. */
+ case JIT_IH_MKIDX(JIT_IHLIB_BASE, JIT_IH_BASE_IPAIRS):
+ dasm_put(Dst, 1483, Dt2([ra+TFOR_CTL].value), Dt2([ra+TFOR_TAB].value), Dt2([ra+TFOR_CTL].value), (ptrdiff_t)(luaH_getnum), Dt7(->tt), Dt2([ra+TFOR_CTL].value), Dt2([ra+TFOR_KEY].tt), Dt2([ra+TFOR_KEY].value), Dt7(->value), Dt7(->value.na[1]), Dt2([ra+TFOR_VAL].tt), Dt2([ra+TFOR_VAL].value), Dt2([ra+TFOR_VAL].value.na[1]), target);
+ return 1; /* Success, iterator has been inlined. */
+ }
+
+ return 0; /* No support for inlining any other iterators. */
+}
+
+/* ------------------------------------------------------------------------ */
+
+
+
+#ifdef LUA_COMPAT_VARARG
+static void jit_vararg_table(lua_State *L)
+{
+ Table *tab;
+ StkId base, func;
+ int i, num, numparams;
+ luaC_checkGC(L);
+ base = L->base;
+ func = L->ci->func;
+ numparams = clvalue(func)->l.p->numparams;
+ num = base - func - numparams - 1;
+ tab = luaH_new(L, num, 1);
+ for (i = 0; i < num; i++)
+ setobj2n(L, luaH_setnum(L, tab, i+1), base - num + i);
+ setnvalue(luaH_setstr(L, tab, luaS_newliteral(L, "n")), (lua_Number)num);
+ sethvalue(L, base + numparams, tab);
+}
+#endif
+
+/* Encode JIT function prologue. */
+static void jit_prologue(jit_State *J)
+{
+ Proto *pt = J->pt;
+ int numparams = pt->numparams;
+ int stacksize = pt->maxstacksize;
+
+ dasm_put(Dst, 1544, Dt3([stacksize]), Dt1(->stack_last), Dt1(->end_ci), Dt4([1]), Dt4(->func), sizeof(TValue), Dt1(->ci));
+
+ if (numparams > 0) {
+ dasm_put(Dst, 1580, Dt2([numparams]));
+ }
+
+ if (!pt->is_vararg) { /* Fixarg function. */
+ /* Must cap L->top at L->base+numparams because 1st LOADNIL is omitted. */
+ if (numparams == 0) {
+ dasm_put(Dst, 1586);
+ } else if (J->flags & JIT_F_CPU_CMOV) {
+ dasm_put(Dst, 1589);
+ } else {
+ dasm_put(Dst, 1594);
+ }
+ dasm_put(Dst, 1603, Dt2([stacksize]), Dt4(->tailcalls), Dt4(->top), Dt1(->top), Dt1(->base), Dt4(->base));
+ } else { /* Vararg function. */
+ int i;
+ if (numparams > 0) {
+ dasm_put(Dst, 1622);
+ dasm_put(Dst, 1630, Dt3(->tt), sizeof(TValue));
+ }
+ dasm_put(Dst, 1649, Dt1(->base), Dt4(->base), Dt4(->tailcalls));
+ for (i = 0; i < numparams; i++) { /* Move/clear fixargs. */
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 1659, Dt2([i].tt), Dt2([i].value), Dt3([i].tt), Dt3([i].value));
+ } else {
+ dasm_put(Dst, 1677, Dt2([i].value), Dt2([i].value.na[1]), Dt3([i].value), Dt2([i].tt), Dt3([i].value.na[1]), Dt3([i].tt));
+ }
+ dasm_put(Dst, 854, Dt2([i].tt));
+ }
+ if (numparams > 0) {
+ dasm_put(Dst, 332, Dt1(->ci));
+ }
+ dasm_put(Dst, 1696, Dt2([stacksize]), Dt2([numparams]), Dt4(->top), Dt1(->top));
+ stacksize -= numparams; /* Fixargs are already cleared. */
+ }
+
+ /* Clear undefined args and all vars. Still assumes eax = LUA_TNIL = 0. */
+ /* Note: cannot clear only args because L->top has grown. */
+ if (stacksize <= EXTRA_STACK) { /* Loopless clear. May use EXTRA_STACK. */
+ int i;
+ for (i = 0; i < stacksize; i++) {
+ dasm_put(Dst, 1712, Dt3([i].tt));
+ }
+ } else { /* Standard loop. */
+ dasm_put(Dst, 1716, Dt3([0].tt), Dt3([1].tt), 2*sizeof(TValue));
+ }
+
+#ifdef LUA_COMPAT_VARARG
+ if (pt->is_vararg & VARARG_NEEDSARG) {
+ dasm_put(Dst, 1734, (ptrdiff_t)(jit_vararg_table));
+ }
+#endif
+
+ /* Call hook check. */
+ if (J->flags & JIT_F_DEBUG_CALL) {
+ dasm_put(Dst, 1740, Dt1(->hookmask), LUA_MASKCALL);
+
+ }
+}
+
+/* Check if we can combine 'return const'. */
+static int jit_return_k(jit_State *J)
+{
+ if (!J->combine) return 0; /* COMBINE hint set? */
+ /* May need to close open upvalues. */
+ if (!fhint_isset(J, NOCLOSE)) {
+ dasm_put(Dst, 1820, (ptrdiff_t)(luaF_close));
+ }
+ if (!J->pt->is_vararg) { /* Fixarg function. */
+ dasm_put(Dst, 1830, Dt1(->ci), sizeof(CallInfo), sizeof(TValue));
+ } else { /* Vararg function. */
+ dasm_put(Dst, 1844, Dt1(->ci), Dt4(->func), sizeof(CallInfo), Dt1(->ci), Dt2([1]));
+ }
+ jit_assert(J->combine == 1); /* Required to skip next RETURN instruction. */
+ return 1;
+}
+
+static void jit_op_return(jit_State *J, int rbase, int nresults)
+{
+ /* Return hook check. */
+ if (J->flags & JIT_F_DEBUG_CALL) {
+ if (nresults < 0 && !(J->flags & JIT_F_DEBUG_INS)) {
+ dasm_put(Dst, 594, Dt1(->top));
+ }
+ dasm_put(Dst, 1863, Dt1(->hookmask), LUA_MASKRET);
+ if (J->flags & JIT_F_DEBUG_INS) {
+ dasm_put(Dst, 1878, Dt1(->savedpc));
+ }
+
+ }
+
+ /* May need to close open upvalues. */
+ if (!fhint_isset(J, NOCLOSE)) {
+ dasm_put(Dst, 1820, (ptrdiff_t)(luaF_close));
+ }
+
+ /* Previous op was open: 'return f()' or 'return ...' */
+ if (nresults < 0) {
+ dasm_put(Dst, 332, Dt1(->ci));
+ if (rbase) {
+ dasm_put(Dst, 787, rbase*sizeof(TValue));
+ }
+ dasm_put(Dst, 1933, Dt4(->func), Dt4(->func), sizeof(CallInfo), Dt1(->ci));
+ return;
+ }
+
+ if (!J->pt->is_vararg) { /* Fixarg function, nresults >= 0. */
+ int i;
+ dasm_put(Dst, 1980, Dt1(->ci), sizeof(CallInfo), sizeof(TValue));
+ for (i = 0; i < nresults; i++) {
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 821, Dt2([rbase+i+1].tt), Dt2([rbase+i+1].value), Dt2([i].tt), Dt2([i].value));
+ } else {
+ dasm_put(Dst, 839, Dt2([rbase+i+1].value), Dt2([rbase+i+1].value.na[1]), Dt2([rbase+i+1].tt), Dt2([i].value), Dt2([i].value.na[1]), Dt2([i].tt));
+ }
+ }
+ dasm_put(Dst, 1989, Dt2([nresults]));
+ } else { /* Vararg function, nresults >= 0. */
+ int i;
+ dasm_put(Dst, 1997, Dt1(->ci), Dt4(->func), sizeof(CallInfo), Dt1(->ci));
+ for (i = 0; i < nresults; i++) {
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 1659, Dt2([rbase+i].tt), Dt2([rbase+i].value), Dt3([i].tt), Dt3([i].value));
+ } else {
+ dasm_put(Dst, 2010, Dt2([rbase+i].value), Dt2([rbase+i].value.na[1]), Dt2([rbase+i].tt), Dt3([i].value), Dt3([i].value.na[1]), Dt3([i].tt));
+ }
+ }
+ dasm_put(Dst, 2029);
+ if (nresults) {
+ dasm_put(Dst, 2036, nresults*sizeof(TValue));
+ }
+ dasm_put(Dst, 32);
+ }
+}
+
+static void jit_op_call(jit_State *J, int func, int nargs, int nresults)
+{
+ int cltype = jit_inline_call(J, func, nargs, nresults);
+ if (cltype < 0) return; /* Inlined? */
+
+ if (func) {
+ dasm_put(Dst, 787, func*sizeof(TValue));
+ }
+ dasm_put(Dst, 2040, Dt1(->ci), Dt2([0].tt));
+ if (nargs >= 0) { /* Previous op was not open and did not set TOP. */
+ dasm_put(Dst, 791, Dt2([1+nargs]));
+ }
+ dasm_put(Dst, 2048, Dt2(->value), (ptrdiff_t)(J->nextins), Dt4(->savedpc));
+ if (cltype == LUA_TFUNCTION) {
+ if (nargs == -1) {
+ dasm_put(Dst, 2057);
+ } else {
+ dasm_put(Dst, 2062);
+ }
+ } else {
+ dasm_put(Dst, 2067);
+
+ }
+ dasm_put(Dst, 2116, Dt5(->jit_gate));
+ if (func) {
+ dasm_put(Dst, 1984, func*sizeof(TValue));
+ }
+ dasm_put(Dst, 2121, Dt1(->base));
+
+ /* Clear undefined results TOP <= o < func+nresults. */
+ if (nresults > 0) {
+ dasm_put(Dst, 2125);
+ if (nresults <= EXTRA_STACK) { /* Loopless clear. May use EXTRA_STACK. */
+ int i;
+ for (i = 0; i < nresults; i++) {
+ dasm_put(Dst, 1712, Dt3([i].tt));
+ }
+ } else { /* Standard loop. TODO: move to .tail? */
+ dasm_put(Dst, 2128, Dt2([func+nresults]), Dt3([0].tt), Dt3([1].tt), 2*sizeof(TValue));
+ }
+ }
+
+ if (nresults >= 0) { /* Not an open ins. Restore L->top. */
+ dasm_put(Dst, 1445, Dt2([J->pt->maxstacksize]), Dt1(->top));
+ } /* Otherwise keep TOP for next instruction. */
+}
+
+static void jit_op_tailcall(jit_State *J, int func, int nargs)
+{
+ int cltype;
+
+ if (!fhint_isset(J, NOCLOSE)) { /* May need to close open upvalues. */
+ dasm_put(Dst, 1820, (ptrdiff_t)(luaF_close));
+ }
+
+ cltype = jit_inline_call(J, func, nargs, -2);
+ if (cltype < 0) goto finish; /* Inlined? */
+
+ if (cltype == LUA_TFUNCTION) {
+ jit_deopt_target(J, nargs);
+ dasm_put(Dst, 2149, Dt2([func].tt));
+ } else {
+ dasm_put(Dst, 2158, Dt2([func].tt));
+ dasm_put(Dst, 2168);
+ if (func) {
+ dasm_put(Dst, 787, func*sizeof(TValue));
+ }
+ if (nargs >= 0) {
+ dasm_put(Dst, 791, Dt2([1+nargs]));
+ }
+ dasm_put(Dst, 2171, (ptrdiff_t)(J->nextins));
+
+ }
+
+ if (nargs >= 0) { /* Previous op was not open and did not set TOP. */
+ int i;
+ /* Relocate [BASE+func, BASE+func+nargs] -> [ci->func, ci->func+nargs]. */
+ /* TODO: loop for large nargs? */
+ if (!J->pt->is_vararg) { /* Fixarg function. */
+ dasm_put(Dst, 2241, Dt2([func].value));
+ for (i = 0; i < nargs; i++) {
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 821, Dt2([func+1+i].tt), Dt2([func+1+i].value), Dt2([i].tt), Dt2([i].value));
+ } else {
+ dasm_put(Dst, 2245, Dt2([func+1+i].value), Dt2([func+1+i].value.na[1]), Dt2([i].value), Dt2([func+1+i].tt), Dt2([i].value.na[1]), Dt2([i].tt));
+ }
+ }
+ dasm_put(Dst, 2264, Dt2([nargs]), sizeof(TValue), Dt1(->ci), Dt2(->value));
+ } else { /* Vararg function. */
+ dasm_put(Dst, 2278, Dt1(->ci), Dt2([func]), Dt4(->func), Dt3(->value), Dt2(->value));
+ for (i = 0; i < nargs; i++) {
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 2294, Dt3([i+1].tt), Dt3([i+1].value), Dt2([i+1].tt), Dt2([i+1].value));
+ } else {
+ dasm_put(Dst, 2312, Dt3([i+1].value), Dt3([i+1].value.na[1]), Dt2([i+1].value), Dt3([i+1].tt), Dt2([i+1].value.na[1]), Dt2([i+1].tt));
+ }
+ }
+ dasm_put(Dst, 2331, Dt2([1+nargs]), Dt2(->value));
+ }
+ } else { /* Previous op was open and set TOP. */
+ dasm_put(Dst, 332, Dt1(->ci));
+ if (func) {
+ dasm_put(Dst, 787, func*sizeof(TValue));
+ }
+ dasm_put(Dst, 2338, Dt4(->func), Dt4(->func), Dt2(->value));
+ }
+ dasm_put(Dst, 2230, sizeof(CallInfo), Dt5(->jit_gate));
+
+finish:
+ J->combine++; /* Combine with following return instruction. */
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_move(jit_State *J, int dest, int src)
+{
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 821, Dt2([src].tt), Dt2([src].value), Dt2([dest].tt), Dt2([dest].value));
+ } else {
+ dasm_put(Dst, 839, Dt2([src].value), Dt2([src].value.na[1]), Dt2([src].tt), Dt2([dest].value), Dt2([dest].value.na[1]), Dt2([dest].tt));
+ }
+}
+
+static void jit_op_loadk(jit_State *J, int dest, int kidx)
+{
+ const TValue *kk = &J->pt->k[kidx];
+ int rk = jit_return_k(J);
+ if (rk) dest = 0;
+ switch (ttype(kk)) {
+ case 0:
+ dasm_put(Dst, 2369, Dt2([dest].tt));
+ break;
+ case 1:
+ if (bvalue(kk)) { /* true */
+ dasm_put(Dst, 2377, Dt2([dest].value), Dt2([dest].tt));
+ } else { /* false */
+ dasm_put(Dst, 2389, Dt2([dest].value), Dt2([dest].tt));
+ }
+ break;
+ case 3: {
+ if ((&(kk)->value)->n == (lua_Number)0) {
+ dasm_put(Dst, 2404);
+ } else if ((&(kk)->value)->n == (lua_Number)1) {
+ dasm_put(Dst, 2408);
+ } else {
+ dasm_put(Dst, 2411, &(kk)->value);
+ }
+ dasm_put(Dst, 1306, Dt2([dest].value), Dt2([dest].tt));
+ break;
+ }
+ case 4:
+ dasm_put(Dst, 2415, Dt2([dest].value), (ptrdiff_t)(gcvalue(kk)), Dt2([dest].tt));
+ break;
+ default: lua_assert(0); break;
+ }
+ if (rk) {
+ dasm_put(Dst, 32);
+ }
+}
+
+static void jit_op_loadnil(jit_State *J, int first, int last)
+{
+ int idx, num = last - first + 1;
+ int rk = jit_return_k(J);
+ dasm_put(Dst, 2125);
+ if (rk) {
+ dasm_put(Dst, 2427, Dt2([0].tt));
+ } else if (num <= 8) {
+ for (idx = first; idx <= last; idx++) {
+ dasm_put(Dst, 854, Dt2([idx].tt));
+ }
+ } else {
+ dasm_put(Dst, 2432, Dt2([first].tt), Dt2([last].tt), sizeof(TValue));
+ }
+}
+
+static void jit_op_loadbool(jit_State *J, int dest, int b, int dojump)
+{
+ int rk = jit_return_k(J);
+ if (rk) dest = 0;
+ if (b) { /* true */
+ dasm_put(Dst, 2377, Dt2([dest].value), Dt2([dest].tt));
+ } else { /* false */
+ dasm_put(Dst, 2389, Dt2([dest].value), Dt2([dest].tt));
+ }
+ if (rk) {
+ dasm_put(Dst, 32);
+ } else if (dojump) {
+ const TValue *h = hint_getpc(J, COMBINE, J->nextpc);
+ if (!(ttisboolean(h) && bvalue(h) == 0)) { /* Avoid jmp around dead ins. */
+ dasm_put(Dst, 665, J->nextpc+1);
+ }
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_getupval(jit_State *J, int dest, int uvidx)
+{
+ if (!J->pt->is_vararg) {
+ dasm_put(Dst, 2241, Dt2([-1].value));
+ } else {
+ dasm_put(Dst, 2452, Dt1(->ci), Dt4(->func), Dt3(->value));
+ }
+ dasm_put(Dst, 2462, Dt5(->upvals[uvidx]), DtF(->v));
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 2469, Dt3([0].tt), Dt3([0].value), Dt2([dest].tt), Dt2([dest].value));
+ } else {
+ dasm_put(Dst, 2487, Dt3([0].value), Dt3([0].value.na[1]), Dt3([0].tt), Dt2([dest].value), Dt2([dest].value.na[1]), Dt2([dest].tt));
+ }
+}
+
+static void jit_op_setupval(jit_State *J, int src, int uvidx)
+{
+ if (!J->pt->is_vararg) {
+ dasm_put(Dst, 2241, Dt2([-1].value));
+ } else {
+ dasm_put(Dst, 2452, Dt1(->ci), Dt4(->func), Dt3(->value));
+ }
+ dasm_put(Dst, 2506, Dt5(->upvals[uvidx]), DtF(->v), Dt2([src].tt), Dt2([src].value), Dt3(->tt), Dt2([src].value.na[1]), Dt3(->value), Dt3(->value.na[1]));
+ dasm_put(Dst, 2542, DtA(->gch.marked), WHITEBITS, DtF(->marked), bitmask(BLACKBIT));
+
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Optimized table lookup routines. Enter via jsub, fallback to C. */
+
+/* Fallback for GETTABLE_*. Temporary key is in L->env. */
+static void jit_gettable_fb(lua_State *L, Table *t, StkId dest)
+{
+ Table *mt = t->metatable;
+ const TValue *tm = luaH_getstr(mt, G(L)->tmname[TM_INDEX]);
+ if (ttisnil(tm)) { /* No __index method? */
+ mt->flags |= 1<<TM_INDEX; /* Cache this fact. */
+ setnilvalue(dest);
+ } else if (ttisfunction(tm)) { /* __index function? */
+ ptrdiff_t destr = savestack(L, dest);
+ setobj2s(L, L->top, tm);
+ sethvalue(L, L->top+1, t);
+ setobj2s(L, L->top+2, &L->env);
+ luaD_checkstack(L, 3);
+ L->top += 3;
+ luaD_call(L, L->top - 3, 1);
+ dest = restorestack(L, destr);
+ L->top--;
+ setobjs2s(L, dest, L->top);
+ } else { /* Let luaV_gettable() continue with the __index object. */
+ luaV_gettable(L, tm, &L->env, dest);
+ }
+
+}
+
+/* Fallback for SETTABLE_*STR. Temporary (string) key is in L->env. */
+static void jit_settable_fb(lua_State *L, Table *t, StkId val)
+{
+ Table *mt = t->metatable;
+ const TValue *tm = luaH_getstr(mt, G(L)->tmname[TM_NEWINDEX]);
+ if (ttisnil(tm)) { /* No __newindex method? */
+ mt->flags |= 1<<TM_NEWINDEX; /* Cache this fact. */
+ t->flags = 0; /* But need to clear the cache for the table itself. */
+ setobj2t(L, luaH_setstr(L, t, rawtsvalue(&L->env)), val);
+ luaC_barriert(L, t, val);
+ } else if (ttisfunction(tm)) { /* __newindex function? */
+ setobj2s(L, L->top, tm);
+ sethvalue(L, L->top+1, t);
+ setobj2s(L, L->top+2, &L->env);
+ setobj2s(L, L->top+3, val);
+ luaD_checkstack(L, 4);
+ L->top += 4;
+ luaD_call(L, L->top - 4, 0);
+ } else { /* Let luaV_settable() continue with the __newindex object. */
+ luaV_settable(L, tm, &L->env, val);
+ }
+
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_newtable(jit_State *J, int dest, int lnarray, int lnhash)
+{
+ dasm_put(Dst, 3158, luaO_fb2int(lnarray), luaO_fb2int(lnhash), (ptrdiff_t)(luaH_new), Dt2([dest].value), Dt2([dest].tt));
+ jit_checkGC(J);
+}
+
+static void jit_op_getglobal(jit_State *J, int dest, int kidx)
+{
+ const TValue *kk = &J->pt->k[kidx];
+ jit_assert(ttisstring(kk));
+ dasm_put(Dst, 3184, (ptrdiff_t)(&kk->value.gc->ts));
+ if (dest) {
+ dasm_put(Dst, 787, dest*sizeof(TValue));
+ }
+ dasm_put(Dst, 3187);
+}
+
+static void jit_op_setglobal(jit_State *J, int rval, int kidx)
+{
+ const TValue *kk = &J->pt->k[kidx];
+ jit_assert(ttisstring(kk));
+ dasm_put(Dst, 3184, (ptrdiff_t)(&kk->value.gc->ts));
+ if (rval) {
+ dasm_put(Dst, 787, rval*sizeof(TValue));
+ }
+ dasm_put(Dst, 3191);
+}
+
+enum { TKEY_KSTR = -2, TKEY_STR = -1, TKEY_ANY = 0 };
+
+/* Optimize key lookup depending on consts or hints type. */
+static int jit_keylookup(jit_State *J, int tab, int rkey)
+{
+ const TValue *tabt = hint_get(J, TYPE);
+ const TValue *key;
+ if (!ttistable(tabt)) return TKEY_ANY; /* Not a table? Use fallback. */
+ key = ISK(rkey) ? &J->pt->k[INDEXK(rkey)] : hint_get(J, TYPEKEY);
+ if (ttisstring(key)) { /* String key? */
+ if (ISK(rkey)) {
+ dasm_put(Dst, 3195, Dt2([tab]), (ptrdiff_t)(&key->value.gc->ts));
+ return TKEY_KSTR; /* Const string key. */
+ } else {
+ dasm_put(Dst, 3201, Dt2([tab]), Dt2([rkey]));
+ return TKEY_STR; /* Var string key. */
+ }
+ } else if (ttisnumber(key)) { /* Number key? */
+ lua_Number n = nvalue(key);
+ int k;
+ lua_number2int(k, n);
+ if (!(k >= 1 && k < (1 << 26) && (lua_Number)k == n))
+ return TKEY_ANY; /* Not a proper array key? Use fallback. */
+ if (ISK(rkey)) {
+ dasm_put(Dst, 3208, Dt2([tab].tt), Dt2([tab].value), k, DtC(->array), DtC(->sizearray));
+ return k; /* Const array key (>= 1). */
+ } else {
+ dasm_put(Dst, 3232, Dt2([tab].tt), Dt2([rkey].tt));
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 3250, Dt2([rkey]), Dt2([tab].value));
+ } else {
+ dasm_put(Dst, 3283, Dt2([rkey].value));
+ if (J->flags & JIT_F_CPU_CMOV) {
+ dasm_put(Dst, 3293);
+ } else {
+ dasm_put(Dst, 3298);
+ }
+ dasm_put(Dst, 3304, Dt2([tab].value));
+ }
+ dasm_put(Dst, 3320, DtC(->sizearray), DtC(->array));
+ return 1; /* Variable array key. */
+ }
+ }
+ return TKEY_ANY; /* Use fallback. */
+}
+
+static void jit_op_gettable(jit_State *J, int dest, int tab, int rkey)
+{
+ int k = jit_keylookup(J, tab, rkey);
+ switch (k) {
+ case TKEY_KSTR: /* Const string key. */
+ if (dest) {
+ dasm_put(Dst, 787, dest*sizeof(TValue));
+ }
+ dasm_put(Dst, 3334);
+ break;
+ case TKEY_STR: /* Variable string key. */
+ if (dest) {
+ dasm_put(Dst, 787, dest*sizeof(TValue));
+ }
+ dasm_put(Dst, 3338);
+ break;
+ case TKEY_ANY: /* Generic gettable fallback. */
+ if (ISK(rkey)) {
+ dasm_put(Dst, 3342, (ptrdiff_t)(&J->pt->k[INDEXK(rkey)]));
+ } else {
+ dasm_put(Dst, 3204, Dt2([rkey]));
+ }
+ dasm_put(Dst, 3345, Dt2([tab]));
+ if (dest) {
+ dasm_put(Dst, 787, dest*sizeof(TValue));
+ }
+ dasm_put(Dst, 3349, Dt1(->savedpc), (ptrdiff_t)(J->nextins), (ptrdiff_t)(luaV_gettable), Dt1(->base));
+ break;
+ default: /* Array key. */
+ dasm_put(Dst, 3366, Dt7([k-1].tt));
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 2674, Dt7([k-1].value), Dt2([dest].value));
+ } else {
+ dasm_put(Dst, 3378, Dt7([k-1].value), Dt7([k-1].value.na[1]), Dt2([dest].value), Dt2([dest].value.na[1]));
+ }
+ dasm_put(Dst, 3391, Dt2([dest].tt));
+ dasm_put(Dst, 2168);
+ if (ISK(rkey)) {
+ dasm_put(Dst, 3398);
+ } else {
+ dasm_put(Dst, 3402);
+ }
+ dasm_put(Dst, 3406, DtC(->metatable), DtC(->flags), 1<<TM_INDEX, (ptrdiff_t)(J->nextins));
+ break;
+ }
+
+}
+
+static void jit_op_settable(jit_State *J, int tab, int rkey, int rval)
+{
+ const TValue *val = ISK(rval) ? &J->pt->k[INDEXK(rval)] : NULL;
+ int k = jit_keylookup(J, tab, rkey);
+ switch (k) {
+ case TKEY_KSTR: /* Const string key. */
+ case TKEY_STR: /* Variable string key. */
+ if (ISK(rval)) {
+ dasm_put(Dst, 3492, (ptrdiff_t)(val));
+ } else {
+ if (rval) {
+ dasm_put(Dst, 787, rval*sizeof(TValue));
+ }
+ }
+ if (k == TKEY_KSTR) {
+ dasm_put(Dst, 3495);
+ } else {
+ dasm_put(Dst, 3499);
+ }
+ break;
+ case TKEY_ANY: /* Generic settable fallback. */
+ if (ISK(rkey)) {
+ dasm_put(Dst, 3342, (ptrdiff_t)(&J->pt->k[INDEXK(rkey)]));
+ } else {
+ dasm_put(Dst, 3204, Dt2([rkey]));
+ }
+ if (ISK(rval)) {
+ dasm_put(Dst, 3184, (ptrdiff_t)(val));
+ } else {
+ dasm_put(Dst, 3345, Dt2([rval]));
+ }
+ if (tab) {
+ dasm_put(Dst, 787, tab*sizeof(TValue));
+ }
+ dasm_put(Dst, 3503, Dt1(->savedpc), (ptrdiff_t)(J->nextins), (ptrdiff_t)(luaV_settable), Dt1(->base));
+ break;
+ default: /* Array key. */
+ dasm_put(Dst, 3520, Dt7([k-1].tt));
+ dasm_put(Dst, 2168);
+ if (ISK(rkey)) {
+ dasm_put(Dst, 3534);
+ } else {
+ dasm_put(Dst, 3538);
+ }
+ dasm_put(Dst, 3406, DtC(->metatable), DtC(->flags), 1<<TM_NEWINDEX, (ptrdiff_t)(J->nextins));
+ if (!ISK(rval) || iscollectable(val)) {
+ dasm_put(Dst, 3542, DtC(->marked), bitmask(BLACKBIT));
+ dasm_put(Dst, 3555);
+ }
+ if (ISK(rval)) {
+ switch (ttype(val)) {
+ case 0:
+ dasm_put(Dst, 3565, Dt7([k-1].tt));
+ break;
+ case 1:
+ if (bvalue(val)) { /* true */
+ dasm_put(Dst, 3573, Dt7([k-1].value), Dt7([k-1].tt));
+ } else { /* false */
+ dasm_put(Dst, 3585, Dt7([k-1].value), Dt7([k-1].tt));
+ }
+ break;
+ case 3: {
+ if ((&(val)->value)->n == (lua_Number)0) {
+ dasm_put(Dst, 2404);
+ } else if ((&(val)->value)->n == (lua_Number)1) {
+ dasm_put(Dst, 2408);
+ } else {
+ dasm_put(Dst, 2411, &(val)->value);
+ }
+ dasm_put(Dst, 3600, Dt7([k-1].value), Dt7([k-1].tt));
+ break;
+ }
+ case 4:
+ dasm_put(Dst, 3611, Dt7([k-1].value), (ptrdiff_t)(gcvalue(val)), Dt7([k-1].tt));
+ break;
+ default: lua_assert(0); break;
+ }
+ } else {
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 2947, Dt2([rval].tt), Dt2([rval].value), Dt7([k-1].tt), Dt7([k-1].value));
+ } else {
+ dasm_put(Dst, 2965, Dt2([rval].value), Dt2([rval].value.na[1]), Dt2([rval].tt), Dt7([k-1].value), Dt7([k-1].value.na[1]), Dt7([k-1].tt));
+ }
+ }
+ break;
+ }
+
+}
+
+static void jit_op_self(jit_State *J, int dest, int tab, int rkey)
+{
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 821, Dt2([tab].tt), Dt2([tab].value), Dt2([dest+1].tt), Dt2([dest+1].value));
+ } else {
+ dasm_put(Dst, 839, Dt2([tab].value), Dt2([tab].value.na[1]), Dt2([tab].tt), Dt2([dest+1].value), Dt2([dest+1].value.na[1]), Dt2([dest+1].tt));
+ }
+ jit_op_gettable(J, dest, tab, rkey);
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_setlist(jit_State *J, int ra, int num, int batch)
+{
+ if (batch == 0) { batch = (int)(*J->nextins); J->combine++; }
+ batch = (batch-1)*LFIELDS_PER_FLUSH;
+ if (num == 0) { /* Previous op was open and set TOP: {f()} or {...}. */
+ dasm_put(Dst, 3685, Dt1(->env.value), Dt2([ra+1]), Dt2([ra].value));
+ if (batch > 0) {
+ dasm_put(Dst, 3709, batch);
+ }
+ dasm_put(Dst, 3713, DtC(->sizearray), (ptrdiff_t)(luaH_resizearray), DtC(->marked), bitmask(BLACKBIT), DtC(->array), Dt1(->env.value));
+ dasm_put(Dst, 3752);
+ } else { /* Set fixed number of args. */
+ dasm_put(Dst, 3762, Dt2([ra].value), DtC(->sizearray), batch+num, DtC(->marked), bitmask(BLACKBIT), DtC(->array), Dt2([ra+1+num]));
+ dasm_put(Dst, 3792, batch+num, (ptrdiff_t)(luaH_resizearray));
+ }
+ if (batch > 0) {
+ dasm_put(Dst, 3821, batch*sizeof(TValue));
+ }
+ dasm_put(Dst, 3825, Dt2([ra+1]));
+ if (num == 0) { /* Previous op was open. Restore L->top. */
+ dasm_put(Dst, 1445, Dt2([J->pt->maxstacksize]), Dt1(->top));
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_arith(jit_State *J, int dest, int rkb, int rkc, int ev)
+{
+ const TValue *kkb = ISK(rkb) ? &J->pt->k[INDEXK(rkb)] : NULL;
+ const TValue *kkc = ISK(rkc) ? &J->pt->k[INDEXK(rkc)] : NULL;
+ const Value *kval;
+ int idx, rev;
+ int target = (ev == TM_LT || ev == TM_LE) ? jit_jmp_target(J) : 0;
+ int hastail = 0;
+
+ /* The bytecode compiler already folds constants except for: k/0, k%0, */
+ /* NaN results, k1<k2, k1<=k2. No point in optimizing these cases. */
+ if (ISK(rkb&rkc)) goto fallback;
+
+ /* Avoid optimization when non-numeric constants are present. */
+ if (kkb ? !ttisnumber(kkb) : (kkc && !ttisnumber(kkc))) goto fallback;
+
+ /* The TYPE hint selects numeric inlining and/or fallback encoding. */
+ switch (ttype(hint_get(J, TYPE))) {
+ case LUA_TNIL: hastail = 1; break; /* No hint: numeric + fallback. */
+ case LUA_TNUMBER: break; /* Numbers: numeric + deoptimization. */
+ default: goto fallback; /* Mixed/other types: fallback only. */
+ }
+
+ /* The checks above ensure: at most one of the operands is a constant. */
+ /* Reverse operation and swap operands so the 2nd operand is a variable. */
+ if (kkc) { kval = &kkc->value; idx = rkb; rev = 1; }
+ else { kval = kkb ? &kkb->value : NULL; idx = rkc; rev = 0; }
+
+ /* Special handling for some operators. */
+ switch (ev) {
+ case TM_MOD:
+ /* Check for modulo with positive numbers, so we can use fprem. */
+ if (kval) {
+ if (kval->na[1] < 0) { hastail = 0; goto fallback; } /* x%-k, -k%x */
+ dasm_put(Dst, 3850, Dt2([idx].tt), Dt2([idx].value.na[1]));
+ if (kkb) {
+ dasm_put(Dst, 3868, Dt2([rkc].value), kval);
+ } else {
+ dasm_put(Dst, 3875, kval, Dt2([rkb].value));
+ }
+ } else {
+ dasm_put(Dst, 3882, Dt2([rkb].tt), Dt2([rkc].tt), Dt2([rkb].value.na[1]), Dt2([rkc].value.na[1]), Dt2([rkc].value), Dt2([rkb].value));
+ }
+ dasm_put(Dst, 1387);
+ goto fpstore;
+ case TM_POW:
+ if (hastail || !kval) break; /* Avoid this if not optimizing. */
+ if (rev) { /* x^k for k > 0, k integer. */
+ lua_Number n = kval->n;
+ int k;
+ lua_number2int(k, n);
+ /* All positive integers would work. But need to limit code explosion. */
+ if (k > 0 && k <= 65536 && (lua_Number)k == n) {
+ dasm_put(Dst, 3916, Dt2([idx].tt), Dt2([idx]));
+ for (; (k & 1) == 0; k >>= 1) { /* Handle leading zeroes (2^k). */
+ dasm_put(Dst, 3928);
+ }
+ if ((k >>= 1) != 0) { /* Handle trailing bits. */
+ dasm_put(Dst, 3931);
+ for (; k != 1; k >>= 1) {
+ if (k & 1) {
+ dasm_put(Dst, 3936);
+ }
+ dasm_put(Dst, 3928);
+ }
+ dasm_put(Dst, 3939);
+ }
+ goto fpstore;
+ }
+ } else if (kval->n > (lua_Number)0) { /* k^x for k > 0. */
+ int log2kval[3]; /* Enough storage for a tword (80 bits). */
+ log2kval[2] = 0; /* Avoid leaking garbage. */
+ /* Double precision log2(k) doesn't cut it (3^x != 3 for x = 1). */
+ ((void (*)(int *, double))J->jsub[JSUB_LOG2_TWORD])(log2kval, kval->n);
+ dasm_put(Dst, 3942, log2kval[0], log2kval[1], log2kval[2], Dt2([idx].tt), Dt2([idx].value));
+
+ goto fpstore;
+ }
+ break;
+ }
+
+ /* Check number type and load 1st operand. */
+ if (kval) {
+ dasm_put(Dst, 4013, Dt2([idx].tt));
+ if ((kval)->n == (lua_Number)0) {
+ dasm_put(Dst, 2404);
+ } else if ((kval)->n == (lua_Number)1) {
+ dasm_put(Dst, 2408);
+ } else {
+ dasm_put(Dst, 2411, kval);
+ }
+ } else {
+ if (rkb == rkc) {
+ dasm_put(Dst, 4022, Dt2([rkb].tt));
+ } else {
+ dasm_put(Dst, 4027, Dt2([rkb].tt), Dt2([rkc].tt));
+ }
+ dasm_put(Dst, 3920, Dt2([rkb].value));
+ }
+
+ /* Encode arithmetic operation with 2nd operand. */
+ switch ((ev<<1)+rev) {
+ case TM_ADD<<1: case (TM_ADD<<1)+1:
+ if (rkb == rkc) {
+ dasm_put(Dst, 4041);
+ } else {
+ dasm_put(Dst, 4044, Dt2([idx].value));
+ }
+ break;
+ case TM_SUB<<1:
+ dasm_put(Dst, 4048, Dt2([idx].value));
+ break;
+ case (TM_SUB<<1)+1:
+ dasm_put(Dst, 4052, Dt2([idx].value));
+ break;
+ case TM_MUL<<1: case (TM_MUL<<1)+1:
+ if (rkb == rkc) {
+ dasm_put(Dst, 3928);
+ } else {
+ dasm_put(Dst, 4056, Dt2([idx].value));
+ }
+ break;
+ case TM_DIV<<1:
+ dasm_put(Dst, 4060, Dt2([idx].value));
+ break;
+ case (TM_DIV<<1)+1:
+ dasm_put(Dst, 4064, Dt2([idx].value));
+ break;
+ case TM_POW<<1:
+ dasm_put(Dst, 4068, Dt2([idx].value), (ptrdiff_t)(pow));
+ break;
+ case (TM_POW<<1)+1:
+ dasm_put(Dst, 4088, Dt2([idx].value), (ptrdiff_t)(pow));
+ break;
+ case TM_UNM<<1: case (TM_UNM<<1)+1:
+ dasm_put(Dst, 4108);
+ break;
+ default: /* TM_LT or TM_LE. */
+ dasm_put(Dst, 1325, Dt2([idx].value));
+ if (J->flags & JIT_F_CPU_CMOV) {
+ dasm_put(Dst, 3293);
+ } else {
+ dasm_put(Dst, 3298);
+ }
+ dasm_put(Dst, 4111, dest?(J->nextpc+1):target);
+ jit_assert(dest == 0 || dest == 1); /* Really cond. */
+ switch (((rev^dest)<<1)+(dest^(ev == TM_LT))) {
+ case 0:
+ dasm_put(Dst, 4115, target);
+ break;
+ case 1:
+ dasm_put(Dst, 4119, target);
+ break;
+ case 2:
+ dasm_put(Dst, 4123, target);
+ break;
+ case 3:
+ dasm_put(Dst, 4127, target);
+ break;
+ }
+ goto skipstore;
+ }
+fpstore:
+ /* Store result and set result type (if necessary). */
+ dasm_put(Dst, 933, Dt2([dest].value));
+ if (dest != rkb && dest != rkc) {
+ dasm_put(Dst, 1309, Dt2([dest].tt));
+ }
+
+skipstore:
+ if (!hastail) {
+ jit_deopt_target(J, 0);
+ return;
+ }
+
+ dasm_put(Dst, 1626);
+ dasm_put(Dst, 1541);
+
+fallback:
+ /* Generic fallback for arithmetic ops. */
+ if (kkb) {
+ dasm_put(Dst, 3342, (ptrdiff_t)(kkb));
+ } else {
+ dasm_put(Dst, 3204, Dt2([rkb]));
+ }
+ if (kkc) {
+ dasm_put(Dst, 3184, (ptrdiff_t)(kkc));
+ } else {
+ dasm_put(Dst, 3345, Dt2([rkc]));
+ }
+ if (target) { /* TM_LT or TM_LE. */
+ dasm_put(Dst, 4131, Dt1(->savedpc), (ptrdiff_t)((J->nextins+1)), (ptrdiff_t)(ev==TM_LT?luaV_lessthan:luaV_lessequal), Dt1(->base));
+ if (dest) { /* cond */
+ dasm_put(Dst, 1479, target);
+ } else {
+ dasm_put(Dst, 4154, target);
+ }
+ } else {
+ if (dest) {
+ dasm_put(Dst, 787, dest*sizeof(TValue));
+ }
+ dasm_put(Dst, 4158, Dt1(->savedpc), (ptrdiff_t)(J->nextins), ev, (ptrdiff_t)(luaV_arith), Dt1(->base));
+ }
+
+ if (hastail) {
+ dasm_put(Dst, 1644);
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_fallback_len(lua_State *L, StkId ra, const TValue *rb)
+{
+ switch (ttype(rb)) {
+ case LUA_TTABLE:
+ setnvalue(ra, cast_num(luaH_getn(hvalue(rb))));
+ break;
+ case LUA_TSTRING:
+ setnvalue(ra, cast_num(tsvalue(rb)->len));
+ break;
+ default: {
+ const TValue *tm = luaT_gettmbyobj(L, rb, TM_LEN);
+ if (ttisfunction(tm)) {
+ ptrdiff_t rasave = savestack(L, ra);
+ setobj2s(L, L->top, tm);
+ setobj2s(L, L->top+1, rb);
+ luaD_checkstack(L, 2);
+ L->top += 2;
+ luaD_call(L, L->top - 2, 1);
+ ra = restorestack(L, rasave);
+ L->top--;
+ setobjs2s(L, ra, L->top);
+ } else {
+ luaG_typeerror(L, rb, "get length of");
+ }
+ break;
+ }
+ }
+}
+
+static void jit_op_len(jit_State *J, int dest, int rb)
+{
+ switch (ttype(hint_get(J, TYPE))) {
+ case LUA_TTABLE:
+ jit_deopt_target(J, 0);
+ dasm_put(Dst, 4179, Dt2([rb].tt), Dt2([rb].value), (ptrdiff_t)(luaH_getn), Dt2([dest].value), Dt2([dest].tt));
+ break;
+ case LUA_TSTRING:
+ jit_deopt_target(J, 0);
+ dasm_put(Dst, 4212, Dt2([rb].tt), Dt2([rb].value), DtB(->tsv.len), Dt2([dest].value), Dt2([dest].tt));
+ break;
+ default:
+ dasm_put(Dst, 3204, Dt2([rb]));
+ if (dest) {
+ dasm_put(Dst, 787, dest*sizeof(TValue));
+ }
+ dasm_put(Dst, 4237, Dt1(->savedpc), (ptrdiff_t)(J->nextins), (ptrdiff_t)(jit_fallback_len), Dt1(->base));
+ break;
+ }
+}
+
+static void jit_op_not(jit_State *J, int dest, int rb)
+{
+ /* l_isfalse() without a branch -- truly devious. */
+ /* ((value & tt) | (tt>>1)) is only zero for nil/false. */
+ /* Assumes: LUA_TNIL == 0, LUA_TBOOLEAN == 1, bvalue() == 0/1 */
+ dasm_put(Dst, 4258, Dt2([rb].tt), Dt2([rb].value), Dt2([dest].tt), Dt2([dest].value));
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_concat(jit_State *J, int dest, int first, int last)
+{
+ int num = last-first+1;
+ if (num == 2 && ttisstring(hint_get(J, TYPE))) { /* Optimize common case. */
+ if (first) {
+ dasm_put(Dst, 787, first*sizeof(TValue));
+ }
+ dasm_put(Dst, 4288, Dt2([dest].value), Dt2([dest].tt));
+ } else { /* Generic fallback. */
+ dasm_put(Dst, 4302, Dt1(->savedpc), (ptrdiff_t)(J->nextins), num, last, (ptrdiff_t)(luaV_concat), Dt1(->base));
+ if (dest != first) {
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 821, Dt2([first].tt), Dt2([first].value), Dt2([dest].tt), Dt2([dest].value));
+ } else {
+ dasm_put(Dst, 839, Dt2([first].value), Dt2([first].value.na[1]), Dt2([first].tt), Dt2([dest].value), Dt2([dest].value.na[1]), Dt2([dest].tt));
+ }
+ }
+ }
+ jit_checkGC(J); /* Always do this, even for the optimized variant. */
+
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_eq(jit_State *J, int cond, int rkb, int rkc)
+{
+ int target = jit_jmp_target(J);
+ int condtarget = cond ? (J->nextpc+1) : target;
+ jit_assert(cond == 0 || cond == 1);
+
+ /* Comparison of two constants. Evaluate at compile time. */
+ if (ISK(rkb&rkc)) {
+ if ((rkb == rkc) == cond) { /* Constants are already unique. */
+ dasm_put(Dst, 665, target);
+ }
+ return;
+ }
+
+ if (ISK(rkb|rkc)) { /* Compare a variable and a constant. */
+ const TValue *kk;
+ if (ISK(rkb)) { int t = rkc; rkc = rkb; rkb = t; } /* rkc holds const. */
+ kk = &J->pt->k[INDEXK(rkc)];
+ switch (ttype(kk)) {
+ case LUA_TNIL:
+ dasm_put(Dst, 4493, Dt2([rkb].tt));
+ break;
+ case LUA_TBOOLEAN:
+ if (bvalue(kk)) {
+ dasm_put(Dst, 4498, Dt2([rkb].tt), Dt2([rkb].value));
+ } else {
+ dasm_put(Dst, 4509, Dt2([rkb].tt), Dt2([rkb].value));
+ }
+ break;
+ case LUA_TNUMBER:
+ dasm_put(Dst, 4517, Dt2([rkb].tt), condtarget, Dt2([rkb].value), &kk->value);
+ if (J->flags & JIT_F_CPU_CMOV) {
+ dasm_put(Dst, 3293);
+ } else {
+ dasm_put(Dst, 3298);
+ }
+ dasm_put(Dst, 4111, condtarget);
+ break;
+ case LUA_TSTRING:
+ dasm_put(Dst, 4531, Dt2([rkb].tt), condtarget, Dt2([rkb].value), (ptrdiff_t)(rawtsvalue(kk)));
+ break;
+ default: jit_assert(0); break;
+ }
+ } else { /* Compare two variables. */
+ dasm_put(Dst, 4543, Dt2([rkb].tt), Dt2([rkc].tt), condtarget);
+ switch (ttype(hint_get(J, TYPE))) {
+ case LUA_TNUMBER:
+ jit_deopt_target(J, 0);
+ dasm_put(Dst, 4553, Dt2([rkb].value), Dt2([rkc].value));
+ if (J->flags & JIT_F_CPU_CMOV) {
+ dasm_put(Dst, 3293);
+ } else {
+ dasm_put(Dst, 3298);
+ }
+ dasm_put(Dst, 4111, condtarget);
+ break;
+ case LUA_TSTRING:
+ jit_deopt_target(J, 0);
+ dasm_put(Dst, 4568, Dt2([rkb].value), Dt2([rkc].value));
+ break;
+ default:
+ dasm_put(Dst, 4583, Dt2([rkc]), Dt2([rkb]), Dt1(->savedpc), (ptrdiff_t)(J->nextins), (ptrdiff_t)(luaV_equalval), Dt1(->base));
+ break;
+ }
+ }
+ if (cond) {
+ dasm_put(Dst, 4154, target);
+ } else {
+ dasm_put(Dst, 1479, target);
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_test(jit_State *J, int cond, int dest, int src)
+{
+ int target = jit_jmp_target(J);
+
+ /* l_isfalse() without a branch. But this time preserve tt/value. */
+ /* (((value & tt) * 2 + tt) >> 1) is only zero for nil/false. */
+ /* Assumes: 3*tt < 2^32, LUA_TNIL == 0, LUA_TBOOLEAN == 1, bvalue() == 0/1 */
+ dasm_put(Dst, 4611, Dt2([src].tt), Dt2([src].value));
+
+ /* Check if we can omit the stack copy. */
+ if (dest == src) { /* Yes, invert branch condition. */
+ if (cond) {
+ dasm_put(Dst, 1479, target);
+ } else {
+ dasm_put(Dst, 4154, target);
+ }
+ } else { /* No, jump around copy code. */
+ if (cond) {
+ dasm_put(Dst, 4627);
+ } else {
+ dasm_put(Dst, 4632);
+ }
+ dasm_put(Dst, 4637, Dt2([src].value.na[1]), Dt2([dest].tt), Dt2([dest].value), Dt2([dest].value.na[1]), target);
+ }
+}
+
+static void jit_op_jmp(jit_State *J, int target)
+{
+ dasm_put(Dst, 665, target);
+}
+
+/* ------------------------------------------------------------------------ */
+
+enum { FOR_IDX, FOR_LIM, FOR_STP, FOR_EXT };
+
+static const char *const jit_for_coerce_error[] = {
+ LUA_QL("for") " initial value must be a number",
+ LUA_QL("for") " limit must be a number",
+ LUA_QL("for") " step must be a number",
+};
+
+/* Try to coerce for slots with strings to numbers in place or complain. */
+static void jit_for_coerce(lua_State *L, TValue *o)
+{
+ int i;
+ for (i = FOR_IDX; i <= FOR_STP; i++, o++) {
+ lua_Number num;
+ if (ttisnumber(o)) continue;
+ if (ttisstring(o) && luaO_str2d(svalue(o), &num)) {
+ setnvalue(o, num);
+ } else {
+ luaG_runerror(L, jit_for_coerce_error[i]);
+ }
+ }
+}
+
+static void jit_op_forprep(jit_State *J, int ra, int target)
+{
+ const TValue *step = hint_get(J, FOR_STEP_K);
+ if (ttisnumber(step)) {
+ dasm_put(Dst, 4654, Dt2([ra+FOR_IDX].tt), Dt2([ra+FOR_LIM].tt), Dt2([ra+FOR_LIM].value), Dt2([ra+FOR_IDX].value), Dt2([ra+FOR_EXT].value));
+ if (J->flags & JIT_F_CPU_CMOV) {
+ dasm_put(Dst, 3293);
+ } else {
+ dasm_put(Dst, 3298);
+ }
+ dasm_put(Dst, 1309, Dt2([ra+FOR_EXT].tt));
+ if (nvalue(step) < (lua_Number)0) {
+ dasm_put(Dst, 4115, target+1);
+ } else {
+ dasm_put(Dst, 4123, target+1);
+ }
+ } else {
+ dasm_put(Dst, 4683, Dt2([ra+FOR_IDX].tt), Dt2([ra+FOR_LIM].tt), Dt2([ra+FOR_STP].tt), Dt2([ra+FOR_STP].value.na[1]), Dt2([ra+FOR_LIM].value), Dt2([ra+FOR_IDX].value), Dt2([ra+FOR_EXT].value));
+ if (J->flags & JIT_F_CPU_CMOV) {
+ dasm_put(Dst, 3293);
+ } else {
+ dasm_put(Dst, 3298);
+ }
+ dasm_put(Dst, 4732, Dt2([ra+FOR_EXT].tt), target+1);
+ }
+ if (ttisnumber(hint_get(J, TYPE))) {
+ jit_deopt_target(J, 0);
+ } else {
+ dasm_put(Dst, 679);
+ dasm_put(Dst, 4743, Dt2([ra]), Dt1(->savedpc), (ptrdiff_t)(J->nextins), (ptrdiff_t)(jit_for_coerce));
+ }
+}
+
+static void jit_op_forloop(jit_State *J, int ra, int target)
+{
+ const TValue *step = hint_getpc(J, FOR_STEP_K, target-1);
+ if (ttisnumber(step)) {
+ dasm_put(Dst, 4766, Dt2([ra+FOR_LIM].value), Dt2([ra+FOR_IDX].value), Dt2([ra+FOR_STP].value), Dt2([ra+FOR_EXT].value), Dt2([ra+FOR_IDX].value), Dt2([ra+FOR_EXT].tt));
+ if (J->flags & JIT_F_CPU_CMOV) {
+ dasm_put(Dst, 3293);
+ } else {
+ dasm_put(Dst, 3298);
+ }
+ if (nvalue(step) < (lua_Number)0) {
+ dasm_put(Dst, 4127, target);
+ } else {
+ dasm_put(Dst, 4119, target);
+ }
+ } else {
+ dasm_put(Dst, 4789, Dt2([ra+FOR_STP].value.na[1]), Dt2([ra+FOR_LIM].value), Dt2([ra+FOR_IDX].value), Dt2([ra+FOR_STP].value), Dt2([ra+FOR_IDX].value), Dt2([ra+FOR_EXT].value), Dt2([ra+FOR_EXT].tt));
+ if (J->flags & JIT_F_CPU_CMOV) {
+ dasm_put(Dst, 3293);
+ } else {
+ dasm_put(Dst, 3298);
+ }
+ dasm_put(Dst, 4127, target);
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_tforloop(jit_State *J, int ra, int nresults)
+{
+ int target = jit_jmp_target(J);
+ int i;
+ if (jit_inline_tforloop(J, ra, nresults, target)) return; /* Inlined? */
+ for (i = 2; i >= 0; i--) {
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 821, Dt2([ra+i].tt), Dt2([ra+i].value), Dt2([ra+i+3].tt), Dt2([ra+i+3].value));
+ } else {
+ dasm_put(Dst, 839, Dt2([ra+i].value), Dt2([ra+i].value.na[1]), Dt2([ra+i].tt), Dt2([ra+i+3].value), Dt2([ra+i+3].value.na[1]), Dt2([ra+i+3].tt));
+ }
+ }
+ jit_op_call(J, ra+3, 2, nresults);
+ dasm_put(Dst, 4827, Dt2([ra+3].tt));
+ if (J->flags & JIT_F_CPU_SSE2) {
+ dasm_put(Dst, 821, Dt2([ra+3].tt), Dt2([ra+3].value), Dt2([ra+2].tt), Dt2([ra+2].value));
+ } else {
+ dasm_put(Dst, 839, Dt2([ra+3].value), Dt2([ra+3].value.na[1]), Dt2([ra+3].tt), Dt2([ra+2].value), Dt2([ra+2].value.na[1]), Dt2([ra+2].tt));
+ }
+ dasm_put(Dst, 4649, target);
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_close(jit_State *J, int ra)
+{
+ if (ra) {
+ dasm_put(Dst, 4836, Dt2([ra]));
+ } else {
+ dasm_put(Dst, 4844);
+ }
+ dasm_put(Dst, 1734, (ptrdiff_t)(luaF_close));
+}
+
+static void jit_op_closure(jit_State *J, int dest, int ptidx)
+{
+ Proto *npt = J->pt->p[ptidx];
+ int nup = npt->nups;
+ if (!J->pt->is_vararg) {
+ dasm_put(Dst, 4849, Dt2([-1].value));
+ } else {
+ dasm_put(Dst, 4853, Dt1(->ci), Dt4(->func), Dt3(->value));
+ }
+ dasm_put(Dst, 4863, Dt5(->env), nup, (ptrdiff_t)(luaF_newLclosure), Dt5(->p), (ptrdiff_t)(npt), Dt2([dest].value), Dt2([dest].tt));
+ /* Process pseudo-instructions for upvalues. */
+ if (nup > 0) {
+ const Instruction *uvcode = J->nextins;
+ int i, uvuv;
+ /* Check which of the two types we need. */
+ for (i = 0, uvuv = 0; i < nup; i++)
+ if (GET_OPCODE(uvcode[i]) == OP_GETUPVAL) uvuv++;
+ /* Copy upvalues from parent first. */
+ if (uvuv) {
+ /* LCL:eax->upvals (new closure) <-- LCL:edi->upvals (own closure). */
+ for (i = 0; i < nup; i++)
+ if (GET_OPCODE(uvcode[i]) == OP_GETUPVAL) {
+ dasm_put(Dst, 4895, Dt5(->upvals[GETARG_B(uvcode[i])]), Dt5(->upvals[i]));
+ }
+ }
+ /* Next find or create upvalues for our own stack slots. */
+ if (nup > uvuv) {
+ dasm_put(Dst, 909);
+ /* LCL:edi->upvals (new closure) <-- upvalue for stack slot. */
+ for (i = 0; i < nup; i++)
+ if (GET_OPCODE(uvcode[i]) == OP_MOVE) {
+ int rb = GETARG_B(uvcode[i]);
+ if (rb) {
+ dasm_put(Dst, 4836, Dt2([rb]));
+ } else {
+ dasm_put(Dst, 4844);
+ }
+ dasm_put(Dst, 4902, (ptrdiff_t)(luaF_findupval), Dt5(->upvals[i]));
+ }
+ }
+ J->combine += nup; /* Skip pseudo-instructions. */
+ }
+ jit_checkGC(J);
+}
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_op_vararg(jit_State *J, int dest, int num)
+{
+ if (num < 0) { /* Copy all varargs. */
+ dasm_put(Dst, 4911, Dt1(->ci), Dt4(->func), (1+J->pt->numparams)*sizeof(TValue), J->pt->maxstacksize*sizeof(TValue), Dt1(->stack_last), Dt2([dest]));
+ dasm_put(Dst, 4967, Dt1(->top), (ptrdiff_t)(luaD_growstack), Dt1(->base));
+ } else if (num > 0) { /* Copy limited number of varargs. */
+ dasm_put(Dst, 4993, Dt1(->ci), Dt4(->func), (1+J->pt->numparams)*sizeof(TValue), Dt2([dest]), Dt2([dest+num]), Dt3([0].tt), sizeof(TValue));
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
diff --git a/src/luajit/ljit_x86_inline.dash b/src/luajit/ljit_x86_inline.dash
new file mode 100644
index 0000000000..46e507ba54
--- /dev/null
+++ b/src/luajit/ljit_x86_inline.dash
@@ -0,0 +1,627 @@
+/*
+** Function inlining support for x86 CPUs.
+** Copyright (C) 2005-2008 Mike Pall. See Copyright Notice in luajit.h
+*/
+
+/* ------------------------------------------------------------------------ */
+
+/* Private structure holding function inlining info. */
+typedef struct jit_InlineInfo {
+ int func; /* Function slot. 1st arg slot = func+1. */
+ int res; /* 1st result slot. Overlaps func/ci->func. */
+ int nargs; /* Number of args. */
+ int nresults; /* Number of results. */
+ int xnargs; /* Expected number of args. */
+ int xnresults; /* Returned number of results. */
+ int hidx; /* Library/function index numbers. */
+} jit_InlineInfo;
+
+/* ------------------------------------------------------------------------ */
+
+enum { TFOR_FUNC, TFOR_TAB, TFOR_CTL, TFOR_KEY, TFOR_VAL };
+
+static void jit_inline_base(jit_State *J, jit_InlineInfo *ii)
+{
+ int func = ii->func;
+ switch (JIT_IH_IDX(ii->hidx)) {
+ case JIT_IH_BASE_PAIRS:
+ case JIT_IH_BASE_IPAIRS:
+ |// Easy for regular calls: res == func. Not inlined for tailcalls.
+ |// Guaranteed to be inlined only if used in conjunction with TFORLOOP.
+ |// So we omit setting the iterator function and fake the control var.
+ | istable func+TFOR_TAB; jne L_DEOPTIMIZE // Caveat: deopt TFORLOOP, too!
+ | xor eax, eax // Assumes: LUA_TNIL == 0.
+ | mov BASE[func+TFOR_CTL].tt, eax // Fake nil type.
+ | mov BASE[func+TFOR_CTL].value, eax // Hidden control var = 0.
+ |// mov BASE[func+TFOR_FUNC].tt, eax // Kill function (not needed).
+ |.mfmap
+ | .word JIT_MFM_DEOPT_PAIRS, J->nextpc-1 // Deoptimize TFORLOOP, too.
+ |.code
+ break;
+ default:
+ jit_assert(0);
+ break;
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+#ifndef COCO_DISABLE
+
+/* Helper function for inlined coroutine.resume(). */
+static StkId jit_coroutine_resume(lua_State *L, StkId base, int nresults)
+{
+ lua_State *co = thvalue(base-1);
+ /* Check for proper usage. Merge of lua_resume() and auxresume() checks. */
+ if (co->status != LUA_YIELD) {
+ if (co->status > LUA_YIELD) {
+errdead:
+ setsvalue(L, base-1, luaS_newliteral(L, "cannot resume dead coroutine"));
+ goto err;
+ } else if (co->ci != co->base_ci) {
+ setsvalue(L, base-1,
+ luaS_newliteral(L, "cannot resume non-suspended coroutine"));
+ goto err;
+ } else if (co->base == co->top) {
+ goto errdead;
+ }
+ }
+ {
+ unsigned int ndelta = (char *)L->top - (char *)base;
+ int nargs = ndelta/sizeof(TValue); /* Compute nargs. */
+ int status;
+ if ((char *)co->stack_last-(char *)co->top <= ndelta) {
+ co->ci->top = (StkId)(((char *)co->top) + ndelta); /* Ok before grow. */
+ luaD_growstack(co, nargs); /* Grow thread stack. */
+ }
+ /* Copy args. */
+ co->top = (StkId)(((char *)co->top) + ndelta);
+ { StkId t = co->top, f = L->top; while (f > base) setobj2s(co, --t, --f); }
+ L->top = base;
+ status = luaCOCO_resume(co, nargs); /* Resume Coco thread. */
+ if (status == 0 || status == LUA_YIELD) { /* Ok. */
+ StkId f;
+ if (nresults == 0) return NULL;
+ if (nresults == -1) {
+ luaD_checkstack(L, co->top - co->base); /* Grow own stack. */
+ }
+ base = L->top - 2;
+ setbvalue(base++, 1); /* true */
+ /* Copy results. Fill unused result slots with nil. */
+ f = co->base;
+ while (--nresults != 0 && f < co->top) setobj2s(L, base++, f++);
+ while (nresults-- > 0) setnilvalue(base++);
+ co->top = co->base;
+ return base;
+ } else { /* Error. */
+ base = L->top;
+ setobj2s(L, base-1, co->top-1); /* Copy error object. */
+err:
+ setbvalue(base-2, 0); /* false */
+ nresults -= 2;
+ while (--nresults >= 0) setnilvalue(base+nresults); /* Fill results. */
+ return base;
+ }
+ }
+}
+
+static void jit_inline_coroutine(jit_State *J, jit_InlineInfo *ii)
+{
+ int arg = ii->func+1;
+ int res = ii->res;
+ int i;
+ switch (JIT_IH_IDX(ii->hidx)) {
+ case JIT_IH_COROUTINE_YIELD:
+ | cmp aword [L+((int)&LHASCOCO((lua_State *)0))], 0 // Got a C stack?
+ | je L_DEOPTIMIZE
+ | mov L->savedpc, &J->nextins // Debugger-friendly.
+ | add BASE, arg*#TVALUE
+ if (ii->nargs >= 0) { /* Previous op was not open and did not set TOP. */
+ | lea TOP, BASE[ii->nargs]
+ }
+ | mov L->base, BASE
+ | mov L->top, TOP
+ | call &luaCOCO_yield, L
+ | mov BASE, L->base
+ | mov TOP, L->top
+ jit_assert(ii->nresults >= 0 && ii->nresults <= EXTRA_STACK);
+ for (i = 0; i < ii->nresults; i++) {
+ | setnilvalue TOP[i] // Clear undefined result.
+ | copyslot BASE[res+i], BASE[arg+i] // Move result down.
+ }
+ ii->nargs = -1; /* Force restore of L->top. */
+ break;
+ case JIT_IH_COROUTINE_RESUME:
+ jit_assert(ii->nargs != 0 && ii->res == ii->func);
+ | add BASE, (arg+1)*#TVALUE
+ if (ii->nargs >= 0) { /* Previous op was not open and did not set TOP. */
+ | lea TOP, BASE[ii->nargs-1]
+ } else {
+ | cmp TOP, BASE; jb L_DEOPTIMIZE // No thread arg? Deoptimize.
+ }
+ | istt -1, LUA_TTHREAD; jne L_DEOPTIMIZE // Wrong type? Deoptimize.
+ | mov L:eax, BASE[-1].value
+ | cmp aword [L:eax+((int)&LHASCOCO((lua_State *)0))], 0
+ | je L_DEOPTIMIZE // No C stack? Deoptimize.
+ | mov L->savedpc, &J->nextins // Debugger-friendly.
+ | mov L->top, TOP
+ | call &jit_coroutine_resume, L, BASE, ii->nresults
+ | mov BASE, L->base
+ if (ii->nresults == -1) {
+ | mov TOP, eax
+ }
+ ii->nargs = -1; /* Force restore of L->top. */
+ break;
+ default:
+ jit_assert(0);
+ break;
+ }
+}
+
+#endif /* COCO_DISABLE */
+
+/* ------------------------------------------------------------------------ */
+
+static void jit_inline_string(jit_State *J, jit_InlineInfo *ii)
+{
+ int arg = ii->func+1;
+ int res = ii->res;
+ switch (JIT_IH_IDX(ii->hidx)) {
+ case JIT_IH_STRING_LEN:
+ | isstring arg; jne L_DEOPTIMIZE
+ | mov TSTRING:ecx, BASE[arg].value
+ | fild aword TSTRING:ecx->tsv.len // size_t
+ | settt BASE[res], LUA_TNUMBER
+ | fstp qword BASE[res].value
+ break;
+ case JIT_IH_STRING_SUB:
+ /* TODO: inline numeric constants with help from the optimizer. */
+ /* But this would save only another 15-20% in a trivial loop. */
+ jit_assert(ii->nargs >= 2); /* Open op caveat is ok, too. */
+ if (ii->nargs > 2) {
+ | lea TOP, BASE[arg]
+ | call ->STRING_SUB3
+ | setsvalue BASE[res], eax
+ } else {
+ | lea TOP, BASE[arg]
+ | call ->STRING_SUB2
+ | setsvalue BASE[res], eax
+ }
+ break;
+ case JIT_IH_STRING_CHAR:
+ | isnumber arg; jne L_DEOPTIMIZE
+ | lea eax, L->env // Abuse L->env to hold temp string.
+ | fld qword BASE[arg].value
+ | fistp dword [eax] // LSB is at start (little-endian).
+ | cmp dword [eax], 255; ja L_DEOPTIMIZE
+ | call &luaS_newlstr, L, eax, 1
+ | setsvalue BASE[res], eax
+ break;
+ default:
+ jit_assert(0);
+ break;
+ }
+
+ |//-----------------------------------------------------------------------
+ |.jsub STRING_SUB3 // string.sub(str, start, end)
+ | mov eax, TOP[0].tt; shl eax, 4; or eax, TOP[1].tt; shl eax, 4
+ | or eax, TOP[2].tt; sub eax, LUA_TSTR_NUM_NUM
+ | jne ->DEOPTIMIZE_CALLER // Wrong types? Deoptimize.
+ | // eax must be zero here!
+ | fld qword TOP[1].value
+ | fld qword TOP[2].value
+ | fistp aword TMP3 // size_t
+ | fistp aword TMP2 // size_t
+ | mov TSTRING:ecx, TOP[0].value
+ | mov TOP, aword TSTRING:ecx->tsv.len // size_t
+ | mov edx, TMP3
+ | cmp TOP, edx
+ | jb >4
+ |1:
+ | or eax, TMP2 // eax is known to be zero.
+ | jle >6 // start <= 0?
+ |2:
+ | sub edx, eax // newlen = end-start
+ | jl >7 // start > end?
+ | lea ecx, [TSTRING:ecx+eax+#TSTRING-1] // svalue()-1+start
+ | inc edx
+ |3:
+ | mov ARG2, L // First arg for tailcall is ARG2.
+ | mov ARG3, ecx // Pointer to start.
+ | mov ARG4, edx // Length.
+ | mov GL:edi, L->l_G
+ | mov eax, GL:edi->totalbytes // size_t
+ | cmp eax, GL:edi->GCthreshold // size_t
+ | jae >8 // G->totalbytes >= G->GCthreshold?
+ | jmp &luaS_newlstr // Tailcall to C function.
+ |
+ |4: // Negative end or overflow.
+ | jl >5
+ | lea edx, [edx+TOP+1] // end = end+(len+1)
+ | jmp <1
+ |5: // Overflow
+ | mov edx, TOP // end = len
+ | jmp <1
+ |
+ |6: // Negative start or underflow.
+ | je >5
+ | add eax, TOP // start = start+(len+1)
+ | inc eax
+ | jg <2 // start > 0?
+ |5: // Underflow.
+ | mov eax, 1 // start = 1
+ | jmp <2
+ |
+ |7: // Range underflow.
+ | xor edx, edx // Zero length.
+ | jmp <3 // Any pointer in ecx is ok.
+ |.endjsub
+ |
+ |//-----------------------------------------------------------------------
+ |.jsub STRING_SUB2 // string.sub(str, start)
+ | mov eax, TOP[0].tt; shl eax, 4; or eax, TOP[1].tt; sub eax, LUA_TSTR_NUM
+ | jne ->DEOPTIMIZE_CALLER // Wrong types? Deoptimize.
+ | // eax must be zero here!
+ | fld qword TOP[1].value
+ | fistp aword TMP2 // size_t
+ | mov TSTRING:ecx, TOP[0].value
+ | mov TOP, aword TSTRING:ecx->tsv.len // size_t
+ | mov edx, TOP
+ | jmp <1 // See STRING_SUB3.
+ |
+ |8: // GC threshold reached.
+ | sub esp, FRAME_OFFSET
+ | call &luaC_step, L
+ | add esp, FRAME_OFFSET
+ | mov BASE, L->base
+ | jmp &luaS_newlstr // Tailcall to C function.
+ |.endjsub
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Helper functions for inlined calls to table.*. */
+static void jit_table_insert(lua_State *L, TValue *arg)
+{
+ setobj2t(L, luaH_setnum(L, hvalue(arg), luaH_getn(hvalue(arg))+1), arg+1);
+ luaC_barriert(L, hvalue(arg), arg+1);
+}
+
+static TValue *jit_table_remove(lua_State *L, TValue *arg, TValue *res)
+{
+ int n = luaH_getn(hvalue(arg));
+ if (n == 0) {
+ setnilvalue(res); /* For the nresults == 1 case. Harmless otherwise. */
+ return res; /* For the nresults == -1 case. */
+ } else {
+ TValue *val = luaH_setnum(L, hvalue(arg), n);
+ setobj2s(L, res, val);
+ setnilvalue(val);
+ return res+1; /* For the nresults == -1 case. */
+ }
+}
+
+static void jit_inline_table(jit_State *J, jit_InlineInfo *ii)
+{
+ int arg = ii->func+1;
+ int res = ii->res;
+ | istable arg; jne L_DEOPTIMIZE
+ switch (JIT_IH_IDX(ii->hidx)) {
+ case JIT_IH_TABLE_INSERT:
+ jit_assert(ii->nargs == 2);
+ | lea TVALUE:eax, BASE[arg]
+ | call &jit_table_insert, L, TVALUE:eax
+ break;
+ case JIT_IH_TABLE_REMOVE:
+ jit_assert(ii->nargs == 1);
+ | lea TVALUE:eax, BASE[arg]
+ | lea TVALUE:ecx, BASE[res]
+ | call &jit_table_remove, L, TVALUE:eax, TVALUE:ecx
+ if (ii->nresults == -1) {
+ ii->xnresults = -1;
+ | mov TOP, TVALUE:eax
+ }
+ break;
+ case JIT_IH_TABLE_GETN:
+ | mov TABLE:eax, BASE[arg].value
+ | call &luaH_getn, TABLE:eax
+ | mov TMP1, eax
+ | fild dword TMP1
+ | fstp qword BASE[res].value
+ | settt BASE[res], LUA_TNUMBER
+ break;
+ default:
+ jit_assert(0);
+ break;
+ }
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* This typedef must match the libm function signature. */
+/* Serves as a check against wrong lua_Number or wrong calling conventions. */
+typedef lua_Number (*mathfunc_11)(lua_Number);
+
+/* Partially inlined math functions. */
+/* CHECK: must match with jit_hints.h and jit.opt_lib. */
+static const mathfunc_11 jit_mathfuncs_11[JIT_IH_MATH_SIN] = {
+ log, log10, exp, sinh, cosh, tanh, asin, acos, atan
+};
+
+/* FPU control words for ceil and floor (exceptions masked, full precision). */
+static const unsigned short jit_fpucw[2] = { 0x0b7f, 0x077f };
+
+static void jit_inline_math(jit_State *J, jit_InlineInfo *ii)
+{
+ int arg = ii->func+1;
+ int res = ii->res;
+ int idx = JIT_IH_IDX(ii->hidx);
+
+ if (idx < JIT_IH_MATH__21) {
+ | isnumber arg; jne L_DEOPTIMIZE
+ | fld qword BASE[arg].value
+ } else {
+ jit_assert(idx < JIT_IH_MATH__LAST);
+ | isnumber2 arg, arg+1; jne L_DEOPTIMIZE
+ }
+ switch (idx) {
+ /* We ignore sin/cos/tan range overflows (2^63 rad) just like -ffast-math. */
+ case JIT_IH_MATH_SIN:
+ | fsin
+ break;
+ case JIT_IH_MATH_COS:
+ | fcos
+ break;
+ case JIT_IH_MATH_TAN:
+ | fptan; fpop
+ break;
+ case JIT_IH_MATH_CEIL:
+ case JIT_IH_MATH_FLOOR:
+ | fnstcw word TMP1
+ | fldcw word [(ptrdiff_t)&jit_fpucw[idx-JIT_IH_MATH_CEIL]]
+ | frndint
+ | fldcw word TMP1
+ break;
+ case JIT_IH_MATH_ABS:
+ | fabs
+ break;
+ case JIT_IH_MATH_SQRT:
+ | fsqrt
+ break;
+ case JIT_IH_MATH_FMOD:
+ | fld qword BASE[arg+1].value
+ | fld qword BASE[arg].value
+ |1: ; fprem; fnstsw ax; sahf; jp <1
+ | fstp st1
+ break;
+ case JIT_IH_MATH_ATAN2:
+ |// Inlining is easier than calling atan2().
+ | fld qword BASE[arg].value
+ | fld qword BASE[arg+1].value
+ | fpatan
+ break;
+ default:
+ |// Partially inlined. Just call the libm function (__cdecl!).
+ | fstp FPARG1
+ | call &jit_mathfuncs_11[idx]
+ break;
+ }
+ | settt BASE[res], LUA_TNUMBER
+ | fstp qword BASE[res].value
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Try to inline a CALL or TAILCALL instruction. */
+static int jit_inline_call(jit_State *J, int func, int nargs, int nresults)
+{
+ const TValue *callable = hint_get(J, TYPE); /* TYPE hint = callable. */
+ int cltype = ttype(callable);
+ const TValue *oidx;
+ jit_InlineInfo ii;
+ int idx;
+
+ if (cltype != LUA_TFUNCTION) goto fail;
+ if (J->flags & JIT_F_DEBUG) goto fail; /* DWIM. */
+
+ oidx = hint_get(J, INLINE); /* INLINE hint = library/function index. */
+ if (!ttisnumber(oidx)) goto fail;
+
+ ii.hidx = (int)nvalue(oidx);
+ idx = JIT_IH_IDX(ii.hidx);
+
+ if (nresults == -2) { /* Tailcall. */
+ /* Tailcalls from vararg functions don't work with BASE[-1]. */
+ if (J->pt->is_vararg) goto fail; /* So forget about this rare case. */
+ ii.res = -1; /* Careful: 2nd result overlaps 1st stack slot. */
+ ii.nresults = -1;
+ } else {
+ ii.res = func;
+ ii.nresults = nresults;
+ }
+ ii.func = func;
+ ii.nargs = nargs;
+ ii.xnargs = ii.xnresults = 1; /* Default: 1 arg, 1 result. */
+
+ /* Check for the currently supported cases. */
+ switch (JIT_IH_LIB(ii.hidx)) {
+ case JIT_IHLIB_BASE:
+ switch (idx) {
+ case JIT_IH_BASE_PAIRS:
+ case JIT_IH_BASE_IPAIRS:
+ if (nresults == -2) goto fail; /* Not useful for tailcalls. */
+ ii.xnresults = 3;
+ goto check;
+ }
+ break;
+#ifndef COCO_DISABLE
+ case JIT_IHLIB_COROUTINE:
+ switch (idx) {
+ case JIT_IH_COROUTINE_YIELD:
+ /* Only support common cases: no tailcalls, low number of results. */
+ if (nresults < 0 || nresults > EXTRA_STACK) goto fail;
+ ii.xnargs = ii.xnresults = -1;
+ goto ok; /* Anything else is ok. */
+ case JIT_IH_COROUTINE_RESUME:
+ /* Only support common cases: no tailcalls, not with 0 args (error). */
+ if (nresults == -2 || nargs == 0) goto fail;
+ ii.xnargs = ii.xnresults = -1;
+ goto ok; /* Anything else is ok. */
+ }
+ break;
+#endif
+ case JIT_IHLIB_STRING:
+ switch (idx) {
+ case JIT_IH_STRING_LEN:
+ goto check;
+ case JIT_IH_STRING_SUB:
+ if (nargs < 2) goto fail; /* No support for open calls, too. */
+ goto ok; /* 2 or more args are ok. */
+ case JIT_IH_STRING_CHAR:
+ goto check; /* Only single arg supported. */
+ }
+ break;
+ case JIT_IHLIB_TABLE:
+ switch (idx) {
+ case JIT_IH_TABLE_INSERT:
+ ii.xnargs = 2;
+ goto check; /* Only push (append) supported. */
+ case JIT_IH_TABLE_REMOVE:
+ goto check; /* Only pop supported. */
+ case JIT_IH_TABLE_GETN:
+ goto check;
+ }
+ break;
+ case JIT_IHLIB_MATH:
+ if (idx >= JIT_IH_MATH__LAST) goto fail;
+ if (idx >= JIT_IH_MATH__21) ii.xnargs = 2;
+ goto check;
+ }
+fail:
+ return cltype; /* Call could not be inlined. Return type of callable. */
+
+check:
+ if (nargs != ii.xnargs && nargs != -1) goto fail;
+ /* The optimizer already checks the number of results (avoid setnil). */
+
+ok: /* Whew, all checks done. Go for it! */
+
+ /* Start with the common leadin for inlined calls. */
+ jit_deopt_target(J, nargs);
+ |// Caveat: Must save TOP for open ops if jsub uses DEOPTIMIZE_CALLER.
+ | isfunction func
+ | jne L_DEOPTIMIZE // Not a function? Deoptimize.
+ | cmp aword BASE[func].value, &clvalue(callable)
+ | jne L_DEOPTIMIZE // Wrong closure? Deoptimize.
+ if (nargs == -1 && ii.xnargs >= 0) {
+ | lea eax, BASE[func+1+ii.xnargs]
+ | cmp TOP, eax
+ | jne L_DEOPTIMIZE // Wrong #args? Deoptimize.
+ }
+
+ /* Now inline the function itself. */
+ switch (JIT_IH_LIB(ii.hidx)) {
+ case JIT_IHLIB_BASE: jit_inline_base(J, &ii); break;
+#ifndef COCO_DISABLE
+ case JIT_IHLIB_COROUTINE: jit_inline_coroutine(J, &ii); break;
+#endif
+ case JIT_IHLIB_STRING: jit_inline_string(J, &ii); break;
+ case JIT_IHLIB_TABLE: jit_inline_table(J, &ii); break;
+ case JIT_IHLIB_MATH: jit_inline_math(J, &ii); break;
+ default: jit_assert(0); break;
+ }
+
+ /* And add the common leadout for inlined calls. */
+ if (ii.nresults == -1) {
+ if (ii.xnresults >= 0) {
+ | lea TOP, BASE[ii.res+ii.xnresults]
+ }
+ } else if (ii.nargs == -1) { /* Restore L->top only if needed. */
+ | lea TOP, BASE[J->pt->maxstacksize]
+ | mov L->top, TOP
+ }
+
+ if (nresults == -2) { /* Results are in place. Add return for tailcalls. */
+ | add esp, FRAME_OFFSET
+ | sub BASE, #BASE
+ | sub aword L->ci, #CI
+ | ret
+ }
+
+ return -1; /* Success, call has been inlined. */
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Helper function for inlined iterator code. Paraphrased from luaH_next. */
+/* TODO: GCC has trouble optimizing this. */
+static int jit_table_next(lua_State *L, TValue *ra)
+{
+ Table *t = hvalue(&ra[TFOR_TAB]);
+ int i = ra[TFOR_CTL].value.b; /* Hidden control variable. */
+ for (; i < t->sizearray; i++) { /* First the array part. */
+ if (!ttisnil(&t->array[i])) {
+ setnvalue(&ra[TFOR_KEY], cast_num(i+1));
+ setobj2s(L, &ra[TFOR_VAL], &t->array[i]);
+ ra[TFOR_CTL].value.b = i+1;
+ return 1;
+ }
+ }
+ for (i -= t->sizearray; i < sizenode(t); i++) { /* Then the hash part. */
+ if (!ttisnil(gval(gnode(t, i)))) {
+ setobj2s(L, &ra[TFOR_KEY], key2tval(gnode(t, i)));
+ setobj2s(L, &ra[TFOR_VAL], gval(gnode(t, i)));
+ ra[TFOR_CTL].value.b = i+1+t->sizearray;
+ return 1;
+ }
+ }
+ return 0; /* End of iteration. */
+}
+
+/* Try to inline a TFORLOOP instruction. */
+static int jit_inline_tforloop(jit_State *J, int ra, int nresults, int target)
+{
+ const TValue *oidx = hint_get(J, INLINE); /* INLINE hint = lib/func idx. */
+ int idx;
+
+ if (!ttisnumber(oidx)) return 0; /* No hint: don't inline anything. */
+ idx = (int)nvalue(oidx);
+ if (J->flags & JIT_F_DEBUG) return 0; /* DWIM. */
+
+ switch (idx) {
+ case JIT_IH_MKIDX(JIT_IHLIB_BASE, JIT_IH_BASE_PAIRS):
+ |// The type checks can be omitted -- see the iterator constructor.
+ | lea TOP, BASE[ra]
+ | call &jit_table_next, L, TOP
+ | test eax, eax
+ | jnz =>target
+ return 1; /* Success, iterator has been inlined. */
+ case JIT_IH_MKIDX(JIT_IHLIB_BASE, JIT_IH_BASE_IPAIRS):
+ |// The type checks can be omitted -- see the iterator constructor.
+ | mov eax, BASE[ra+TFOR_CTL].value // Hidden control variable.
+ | inc eax
+ | mov TABLE:edx, BASE[ra+TFOR_TAB].value // Table object.
+ | mov BASE[ra+TFOR_CTL].value, eax
+ | call &luaH_getnum, TABLE:edx, eax
+ | // This is really copyslot BASE[ra+TFOR_VAL], TVALUE:eax[0] plus compare.
+ | mov ecx, TVALUE:eax->tt
+ | test ecx, ecx // Assumes: LUA_TNIL == 0.
+ | jz >9 // nil value stops iteration.
+ | fild dword BASE[ra+TFOR_CTL].value // Set numeric key.
+ | settt BASE[ra+TFOR_KEY], LUA_TNUMBER
+ | fstp qword BASE[ra+TFOR_KEY].value
+ | mov edx, TVALUE:eax->value
+ | mov eax, TVALUE:eax->value.na[1] // Overwrites eax.
+ | mov BASE[ra+TFOR_VAL].tt, ecx // Copy value from table slot.
+ | mov BASE[ra+TFOR_VAL].value, edx
+ | mov BASE[ra+TFOR_VAL].value.na[1], eax
+ | jmp =>target
+ |9:
+ return 1; /* Success, iterator has been inlined. */
+ }
+
+ return 0; /* No support for inlining any other iterators. */
+}
+
+/* ------------------------------------------------------------------------ */
+
diff --git a/src/luajit/ljitlib.c b/src/luajit/ljitlib.c
new file mode 100644
index 0000000000..1da7661b29
--- /dev/null
+++ b/src/luajit/ljitlib.c
@@ -0,0 +1,637 @@
+/*
+** Lua library for the JIT engine.
+** Copyright (C) 2005-2008 Mike Pall. See Copyright Notice in luajit.h
+*/
+
+#include <stdio.h>
+#include <string.h>
+
+#define ljitlib_c
+#define LUA_LIB
+
+#include "lua.h"
+#include "lauxlib.h"
+#include "luajit.h"
+#include "lualib.h"
+
+/* This file is not a pure C API user. Some internals are required. */
+#include "lobject.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "lfunc.h"
+#include "lgc.h"
+#include "lopcodes.h"
+
+#include "ljit.h"
+#include "ljit_hints.h"
+
+#define STRING_HINTS
+#include "ljit_hints.h"
+
+/* ------------------------------------------------------------------------ */
+
+/* Static pointer addresses used as registry keys. */
+/* The values do not matter, but must be different to prevent joining. */
+static const int regkey_frontend = 0x6c6a6c01;
+static const int regkey_comthread = 0x6c6a6c02;
+
+/* Check that the first argument is a Lua function and return its closure. */
+static Closure *check_LCL(lua_State *L)
+{
+ StkId o = L->base;
+ switch (lua_type(L, 1)) {
+ case LUA_TBOOLEAN:
+ o = (L->ci-1)->func;
+ case LUA_TFUNCTION:
+ if (isLfunction(o))
+ return clvalue(o);
+ break;
+ }
+ luaL_argerror(L, 1, "Lua function expected");
+ return NULL;
+}
+
+/* Create a new closure from a prototype. */
+/* Note: upvalues are assumed to be after first two slots. */
+static void push_LCL(lua_State *L, Proto *pt, Table *env)
+{
+ Closure *cl;
+ int i, nup = pt->nups;
+ /* Adjust the number of stack slots to the number of upvalues. */
+ luaL_checkstack(L, nup, "too many upvalues");
+ lua_settop(L, 2+nup);
+ /* Create a closure from the subroutine prototype. */
+ cl = luaF_newLclosure(L, nup, env);
+ cl->l.p = pt;
+ /* Allocate new upvalues and close them. */
+ for (i = 0; i < nup; i++)
+ cl->l.upvals[i] = luaF_findupval(L, L->base + (2+i));
+ luaF_close(L, L->base + 2);
+ lua_settop(L, 2); /* Remove upvalues. */
+ setclvalue(L, L->top++, cl); /* Return closure on top of stack. */
+ luaC_checkGC(L);
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Set JIT mode for the engine or a closure and/or its subroutines. */
+static int setmode(lua_State *L, int mode)
+{
+ int idx = 0;
+ switch (lua_type(L, 1)) {
+ case LUA_TNONE: /* jit.on/off() */
+ case LUA_TNIL: /* jit.on/off(nil) */
+ luaJIT_setmode(L, 0, mode | LUAJIT_MODE_ENGINE);
+ break;
+ case LUA_TFUNCTION: /* jit.on/off(func, nil|true|false) */
+ idx = 1;
+ case LUA_TBOOLEAN: /* jit.on/off(true, nil|true|false) (parent frame) */
+ if (lua_isboolean(L, 2))
+ mode |= lua_toboolean(L, 2)?LUAJIT_MODE_ALLFUNC:LUAJIT_MODE_ALLSUBFUNC;
+ else
+ mode |= LUAJIT_MODE_FUNC;
+ if (luaJIT_setmode(L, idx, mode) == 1) /* Ok? */
+ break;
+ default:
+ luaL_argerror(L, 1, "Lua function expected");
+ break;
+ }
+ return 0;
+}
+
+/* Set JIT mode to on: (re-)enable compilation. */
+static int j_on(lua_State *L)
+{
+ return setmode(L, LUAJIT_MODE_ON);
+}
+
+/* Set JIT mode to off: disable compilation. */
+static int j_off(lua_State *L)
+{
+ return setmode(L, LUAJIT_MODE_OFF);
+}
+
+/* Set JIT debug level. Defaults to maximum level for use with -j. */
+static int j_debug(lua_State *L)
+{
+ luaJIT_setmode(L, luaL_optinteger(L, 1, 100), LUAJIT_MODE_DEBUG);
+ return 0;
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Report the compilation status. */
+static int compstatus(lua_State *L, int status)
+{
+ if (status == -1)
+ return luaL_argerror(L, 1, "Lua function expected");
+ else if (status == JIT_S_OK)
+ return 0;
+ else {
+ lua_pushinteger(L, status);
+ return 1;
+ }
+}
+
+/* Compile a function. Pass typical args to help the optimizer. */
+static int j_compile(lua_State *L)
+{
+ int nargs = lua_gettop(L) - 1;
+ return compstatus(L, nargs >= 0 ? luaJIT_compile(L, nargs) : -1);
+}
+
+/* Recursively compile all subroutine prototypes. */
+static int rec_compile(lua_State *L, Proto *pt, Table *env, int stoponerror)
+{
+ int rstatus = JIT_S_OK;
+ int i;
+ for (i = 0; i < pt->sizep; i++) {
+ Proto *pti = pt->p[i];
+ int status;
+ push_LCL(L, pti, env); /* Assumes stack is at 2 (no upvalues). */
+ status = luaJIT_compile(L, 0);
+ lua_settop(L, 2); /* Clear stack */
+ if (status != JIT_S_OK) {
+ rstatus = status;
+ if (stoponerror) break;
+ }
+ status = rec_compile(L, pti, env, stoponerror);
+ if (status != JIT_S_OK) {
+ rstatus = status;
+ if (stoponerror) break;
+ }
+ }
+ return rstatus;
+}
+
+/* Compile all subroutines of a function. */
+/* Note: the function itself is _not_ compiled (use jit.compile()). */
+static int j_compilesub(lua_State *L)
+{
+ Closure *cl = check_LCL(L);
+ int stoponerror = lua_toboolean(L, 2); /* Stop on first error? */
+ lua_settop(L, 2);
+ return compstatus(L, rec_compile(L, cl->l.p, cl->l.env, stoponerror));
+}
+
+/* jit.* functions. */
+static const luaL_Reg jitlib[] = {
+ { "on", j_on },
+ { "off", j_off },
+ { "debug", j_debug },
+ { "compile", j_compile },
+ { "compilesub", j_compilesub },
+ /* j_attach is added below. */
+ { NULL, NULL }
+};
+
+/* ------------------------------------------------------------------------ */
+
+/* Get the compiler pipeline table from an upvalue (j_attach, j_frontend). */
+#define COMPIPE lua_upvalueindex(1)
+
+/* Attach/detach handler to/from compiler pipeline. */
+static int j_attach(lua_State *L)
+{
+ int pipesz;
+ luaL_checktype(L, 1, LUA_TFUNCTION);
+ pipesz = lua_objlen(L, COMPIPE);
+ if (lua_isnoneornil(L, 2)) { /* Detach if no priority given. */
+ int i;
+ for (i = 1; i <= pipesz; i += 2) {
+ lua_rawgeti(L, COMPIPE, i);
+ if (lua_rawequal(L, 1, -1)) { /* Found: delete from pipeline. */
+ for (; i+2 <= pipesz; i++) { /* Shift down. */
+ lua_rawgeti(L, COMPIPE, i+2);
+ lua_rawseti(L, COMPIPE, i);
+ }
+ /* Clear last two elements. */
+ lua_pushnil(L); lua_rawseti(L, COMPIPE, i);
+ lua_pushnil(L); lua_rawseti(L, COMPIPE, i+1);
+ return 0;
+ }
+ lua_pop(L, 1);
+ }
+ return 0; /* Not found: ignore detach request. */
+ } else { /* Attach if priority given. */
+ int prio = luaL_checkint(L, 2);
+ int pos, i;
+ for (pos = 2; pos <= pipesz; pos += 2) {
+ lua_rawgeti(L, COMPIPE, pos);
+ if (prio > (int)lua_tointeger(L, -1)) break; /* Insertion point found. */
+ lua_pop(L, 1);
+ }
+ for (i = pipesz+2; i > pos; i--) { /* Shift up. */
+ lua_rawgeti(L, COMPIPE, i-2);
+ lua_rawseti(L, COMPIPE, i);
+ }
+ /* Set handler and priority. */
+ lua_pushvalue(L, 1); lua_rawseti(L, COMPIPE, i-1);
+ lua_pushvalue(L, 2); lua_rawseti(L, COMPIPE, i);
+ return 0;
+ }
+}
+
+/* Compiler frontend. Runs in the compiler thread. */
+/* First and only arg is the compiler state table. */
+static int j_frontend(lua_State *L)
+{
+ int status = JIT_S_OK;
+ int pos;
+ /* Loop through all handlers in the compiler pipeline. */
+ for (pos = 1; ; pos += 2) {
+ if (status != JIT_S_OK) { /* Pending failure? */
+ int prio;
+ lua_rawgeti(L, COMPIPE, pos+1); /* Must check for odd/even priority. */
+ if (lua_isnil(L, -1)) break; /* End of pipeline. */
+ prio = (int)lua_tointeger(L, -1);
+ lua_pop(L, 1);
+ if ((prio & 1) == 0) continue; /* Skip handlers with even priority. */
+ }
+ /* Call handler with compiler state table and optional failure status. */
+ lua_rawgeti(L, COMPIPE, pos);
+ if (lua_isnil(L, -1)) break; /* End of pipeline. */
+ lua_pushvalue(L, 1);
+ if (status != JIT_S_OK)
+ lua_pushinteger(L, status);
+ lua_call(L, status ? 2 : 1, 1);
+ if (!lua_isnil(L, -1)) /* Remember failure status. */
+ status = (int)lua_tointeger(L, -1);
+ lua_pop(L, 1);
+ }
+ lua_pushinteger(L, status);
+ return 1;
+}
+
+/* Compiler frontend wrapper. */
+static int frontwrap(lua_State *L, Table *st)
+{
+ jit_State *J = G(L)->jit_state;
+ lua_State *JL;
+ int status;
+
+ /* Allocate compiler thread on demand. */
+ if (J->L == NULL) {
+ if (!lua_checkstack(L, 3)) return JIT_S_COMPILER_ERROR;
+ sethvalue(L, L->top++, st); /* Prevent GC of state table. */
+ lua_pushlightuserdata(L, (void *)®key_comthread);
+ /* Cannot use C stack, since it's deallocated early in Coco. */
+ /* But we don't need one -- the compiler thread never yields, anyway. */
+ J->L = lua_newthread(L);
+ lua_rawset(L, LUA_REGISTRYINDEX);
+ L->top--; /* Remove state table from this stack. */
+ }
+ JL = J->L;
+
+ /* Initialize compiler thread stack with frontend and state table. */
+ lua_settop(JL, 0);
+ lua_pushlightuserdata(JL, (void *)®key_frontend);
+ lua_rawget(JL, LUA_REGISTRYINDEX);
+ sethvalue(JL, JL->top, st);
+ JL->top++;
+
+ /* Start the frontend by resuming the compiler thread. */
+ if (lua_resume(JL, 1) != 0) { /* Failed? */
+ /* Note: LUA_YIELD is treated like any other error. */
+ J->L = NULL; /* Get a new thread next time. */
+ fprintf(stderr, "[LuaJIT frontend failed: %s]\n",
+ lua_isstring(JL, -1) ? lua_tostring(JL, -1) : "(unknown error)");
+ return JIT_S_COMPILER_ERROR;
+ }
+
+ /* Get status from terminated thread. */
+ status = (int)lua_tointeger(JL, -1);
+ lua_settop(JL, 0); /* Help the GC. */
+ return status;
+}
+
+/* Create the compiler pipeline and register it. */
+static void makepipeline(lua_State *L)
+{
+ lua_createtable(L, 20, 0); /* 10 handlers+priorities should be enough. */
+ lua_pushcfunction(L, luaJIT_backend);
+ lua_rawseti(L, -2, 1);
+ lua_pushinteger(L, 0); /* Fill in the backend at prio 0. */
+ lua_rawseti(L, -2, 2);
+
+ /* Store the compiler frontend in the registry. */
+ lua_pushlightuserdata(L, (void *)®key_frontend);
+ lua_pushvalue(L, -2); /* Pipeline table as upvalue. */
+ lua_pushcclosure(L, j_frontend, 1);
+ lua_rawset(L, LUA_REGISTRYINDEX);
+
+ /* Register the frontend wrapper. */
+ G(L)->jit_state->frontwrap = frontwrap;
+
+ /* Add jit.attach with the pipeline table as upvalue. */
+ lua_pushcclosure(L, j_attach, 1);
+ lua_setfield(L, -2, "attach"); /* "jit" table must be below. */
+}
+
+/* ------------------------------------------------------------------------ */
+
+/* Calculate total mcode size without mfm and only for active mcode blocks. */
+static size_t mcodesize(Proto *pt)
+{
+ jit_MCTrailer tr;
+ size_t sz = 0;
+ tr.mcode = (char *)pt->jit_mcode;
+ tr.sz = pt->jit_szmcode;
+ do {
+ jit_Mfm *mfm = JIT_MCMFM(tr.mcode, tr.sz);
+ if (sz != 0 && jit_mfm_ismain(mfm)) break; /* Stop at old main mfm. */
+ while (*mfm != JIT_MFM_STOP) mfm--; /* Search for end of mcode. */
+ sz += (char *)mfm-(char *)tr.mcode; /* Add size of mcode without mfm. */
+ memcpy((void *)&tr, JIT_MCTRAILER(tr.mcode, tr.sz), sizeof(jit_MCTrailer));
+ } while (tr.mcode != NULL);
+ return sz;
+}
+
+#define setintfield(name, i) \
+ do { lua_pushinteger(L, i); lua_setfield(L, -2, name); } while (0)
+
+/* local stats = jit.util.stats(func) */
+static int ju_stats(lua_State *L)
+{
+ if (!(L->top > L->base))
+ luaL_argerror(L, 1, "Lua function expected");
+ if (isLfunction(L->base)) {
+ Proto *pt = clvalue(L->base)->l.p;
+ lua_createtable(L, 0, 11);
+ setintfield("status", pt->jit_status);
+ setintfield("stackslots", pt->maxstacksize);
+ setintfield("params", pt->numparams);
+ setintfield("bytecodes", pt->sizecode);
+ setintfield("consts", pt->sizek);
+ setintfield("upvalues", pt->nups);
+ setintfield("subs", pt->sizep);
+ lua_pushboolean(L, pt->is_vararg);
+ lua_setfield(L, -2, "isvararg");
+ lua_getfenv(L, 1);
+ lua_setfield(L, -2, "env");
+ if (pt->jit_szmcode != 0) {
+ setintfield("mcodesize", (int)mcodesize(pt));
+ lua_pushnumber(L, (lua_Number)(size_t)pt->jit_mcode);
+ lua_setfield(L, -2, "mcodeaddr");
+ }
+ return 1;
+ } else {
+ return 0; /* Don't throw an error like the other util functions. */
+ }
+}
+
+/* local op, a, b, c, test = jit.util.bytecode(func, pc) */
+static int ju_bytecode(lua_State *L)
+{
+ Proto *pt = check_LCL(L)->l.p;
+ int pc = luaL_checkint(L, 2);
+ if (pc >= 1 && pc <= pt->sizecode) {
+ Instruction ins = pt->code[pc-1];
+ OpCode op = GET_OPCODE(ins);
+ if (pc > 1 && (((int)OP_SETLIST) << POS_OP) ==
+ (pt->code[pc-2] & (MASK1(SIZE_OP,POS_OP) | MASK1(SIZE_C,POS_C)))) {
+ lua_pushstring(L, luaP_opnames[OP_SETLIST]);
+ lua_pushnumber(L, (lua_Number)ins); /* Fake extended op. */
+ return 1;
+ }
+ if (op >= NUM_OPCODES) return 0; /* Just in case. */
+ lua_pushstring(L, luaP_opnames[op]);
+ lua_pushinteger(L, GETARG_A(ins));
+ switch (getOpMode(op)) {
+ case iABC: {
+ int b = GETARG_B(ins), c = GETARG_C(ins);
+ switch (getBMode(op)) {
+ case OpArgN: lua_pushnil(L); break;
+ case OpArgK: if (ISK(b)) b = -1-INDEXK(b);
+ case OpArgR: case OpArgU: lua_pushinteger(L, b); break;
+ }
+ switch (getCMode(op)) {
+ case OpArgN: lua_pushnil(L); break;
+ case OpArgK: if (ISK(c)) c = -1-INDEXK(c);
+ case OpArgR: case OpArgU: lua_pushinteger(L, c); break;
+ }
+ lua_pushboolean(L, testTMode(op));
+ return 5;
+ }
+ case iABx: {
+ int bx = GETARG_Bx(ins);
+ lua_pushinteger(L, getBMode(op) == OpArgK ? -1-bx : bx);
+ return 3;
+ }
+ case iAsBx:
+ lua_pushinteger(L, GETARG_sBx(ins));
+ return 3;
+ }
+ }
+ return 0;
+}
+
+/* local const, ok = jit.util.const(func, idx) */
+static int ju_const(lua_State *L)
+{
+ Proto *pt = check_LCL(L)->l.p;
+ int idx = luaL_checkint(L, 2);
+ if (idx < 0) idx = -idx; /* Handle both positive and negative indices. */
+ if (idx >= 1 && idx <= pt->sizek) {
+ setobj2s(L, L->top-1, &pt->k[idx-1]);
+ lua_pushboolean(L, 1);
+ return 2;
+ }
+ lua_pushnil(L);
+ lua_pushboolean(L, 0);
+ return 2;
+}
+
+/* local upvalue, ok = jit.util.upvalue(func, idx) */
+static int ju_upvalue(lua_State *L)
+{
+ Closure *cl = check_LCL(L);
+ Proto *pt = cl->l.p;
+ int idx = luaL_checkint(L, 2);
+ if (idx >= 0 && idx < pt->nups) {
+ setobj2s(L, L->top-1, cl->l.upvals[idx]->v);
+ lua_pushboolean(L, 1);
+ return 2;
+ }
+ lua_pushnil(L);
+ lua_pushboolean(L, 0);
+ return 2;
+}
+
+/* local nup = jit.util.closurenup(func, idx) */
+static int ju_closurenup(lua_State *L)
+{
+ Closure *cl = check_LCL(L);
+ Proto *pt = cl->l.p;
+ int idx = luaL_checkint(L, 2);
+ if (idx >= 0 && idx < pt->sizep) {
+ lua_pushinteger(L, pt->p[idx]->nups);
+ return 1;
+ }
+ return 0;
+}
+
+/* for tag, mark in mfmiter do ... end. */
+static int ju_mfmiter(lua_State *L)
+{
+ jit_Mfm *mfm = (jit_Mfm *)lua_touserdata(L, lua_upvalueindex(1));
+ int m = *mfm--;
+ switch (m) {
+ case JIT_MFM_STOP: return 0;
+ case JIT_MFM_COMBINE: lua_pushliteral(L, "COMBINE"); lua_pushnil(L); break;
+ case JIT_MFM_DEAD: lua_pushliteral(L, "DEAD"); lua_pushnil(L); break;
+ default:
+ lua_pushinteger(L, m & JIT_MFM_MASK);
+ lua_pushboolean(L, m & JIT_MFM_MARK);
+ break;
+ }
+ lua_pushlightuserdata(L, (void *)mfm);
+ lua_replace(L, lua_upvalueindex(1));
+ return 2;
+}
+
+/* local addr, mcode, mfmiter = jit.util.mcode(func, block) */
+static int ju_mcode(lua_State *L)
+{
+ Proto *pt = check_LCL(L)->l.p;
+ if (pt->jit_szmcode == 0) { /* Not compiled (yet): return nil, status. */
+ lua_pushnil(L);
+ lua_pushinteger(L, pt->jit_status);
+ return 2;
+ } else {
+ jit_Mfm *mfm;
+ jit_MCTrailer tr;
+ int block = luaL_checkint(L, 2);
+ tr.mcode = (char *)pt->jit_mcode;
+ tr.sz = pt->jit_szmcode;
+ while (--block > 0) {
+ void *trp = JIT_MCTRAILER(tr.mcode, tr.sz);
+ memcpy((void *)&tr, trp, sizeof(jit_MCTrailer));
+ if (tr.sz == 0) return 0;
+ }
+ mfm = JIT_MCMFM(tr.mcode, tr.sz);
+ while (*mfm != JIT_MFM_STOP) mfm--; /* Search for end of mcode. */
+ lua_pushnumber(L, (lua_Number)(size_t)tr.mcode);
+ lua_pushlstring(L, (const char *)tr.mcode, (char *)mfm-(char *)tr.mcode);
+ lua_pushlightuserdata(L, (void *)JIT_MCMFM(tr.mcode, tr.sz));
+ lua_pushvalue(L, 1); /* Must hold onto function to avoid GC. */
+ lua_pushcclosure(L, ju_mfmiter, 2);
+ return 3;
+ }
+}
+
+/* local addr [, mcode] = jit.util.jsubmcode([idx]) */
+static int ju_jsubmcode(lua_State *L)
+{
+ jit_State *J = G(L)->jit_state;
+ if (lua_isnoneornil(L, 1)) {
+ lua_pushnumber(L, (lua_Number)(size_t)J->jsubmcode);
+ lua_pushlstring(L, (const char *)J->jsubmcode, J->szjsubmcode);
+ return 2;
+ } else {
+ int idx = luaL_checkint(L, 1);
+ if (idx >= 0 && idx < J->numjsub) {
+ lua_pushnumber(L, (lua_Number)(size_t)J->jsub[idx]);
+ return 1;
+ }
+ return 0;
+ }
+}
+
+/* FOR INTERNAL DEBUGGING USE ONLY: local addr = jit.util.stackptr() */
+static int ju_stackptr(lua_State *L)
+{
+ jit_State *J = G(L)->jit_state;
+ size_t addr = cast(size_t (*)(void), J->jsub[0])(); /* JSUB_STACKPTR == 0! */
+ lua_pushnumber(L, (lua_Number)addr);
+ return 1;
+}
+
+/* jit.util.* functions. */
+static const luaL_Reg jitutillib[] = {
+ {"stats", ju_stats },
+ {"bytecode", ju_bytecode },
+ {"const", ju_const },
+ {"upvalue", ju_upvalue },
+ {"closurenup", ju_closurenup },
+ {"mcode", ju_mcode },
+ {"jsubmcode", ju_jsubmcode },
+ {"stackptr", ju_stackptr },
+ { NULL, NULL }
+};
+
+/* Make hint name to hint number map. */
+static void makehints(lua_State *L, const char *const *t, int tmax,
+ const char *name)
+{
+ int i;
+ lua_createtable(L, 0, tmax);
+ for (i = 1; i < tmax; i++) {
+ lua_pushinteger(L, JIT_H2NUM(i));
+ lua_setfield(L, -2, t[i-1]);
+ }
+ lua_setfield(L, -2, name);
+}
+
+/* CHECK: must match with ljit.h (grep "ORDER JIT_S"). */
+static const char *const status_list[] = {
+ "OK",
+ "NONE",
+ "OFF",
+ "ENGINE_OFF",
+ "DELAYED",
+ "TOOLARGE",
+ "COMPILER_ERROR",
+ "DASM_ERROR"
+};
+
+/* Make bidirectional status name to status number map. */
+static void makestatus(lua_State *L, const char *name)
+{
+ int i;
+ lua_createtable(L, JIT_S_MAX-1, JIT_S_MAX+1); /* Codes are not 1-based. */
+ for (i = 0; i < JIT_S_MAX; i++) {
+ lua_pushstring(L, status_list[i]);
+ lua_pushinteger(L, i);
+ lua_pushvalue(L, -2);
+ lua_rawseti(L, -4, i);
+ lua_rawset(L, -3);
+ }
+ lua_setfield(L, -2, name);
+}
+
+/* ------------------------------------------------------------------------ */
+
+/*
+** Open JIT library
+*/
+LUALIB_API int luaopen_jit(lua_State *L)
+{
+ /* Add the core JIT library. */
+ luaL_register(L, LUA_JITLIBNAME, jitlib);
+ lua_pushliteral(L, LUAJIT_VERSION);
+ lua_setfield(L, -2, "version");
+ setintfield("version_num", LUAJIT_VERSION_NUM);
+ lua_pushstring(L, luaJIT_arch);
+ lua_setfield(L, -2, "arch");
+ makepipeline(L);
+
+ /* Add the utility JIT library. */
+ luaL_register(L, LUA_JITLIBNAME ".util", jitutillib);
+ makestatus(L, "status");
+ makehints(L, hints_H, JIT_H_MAX, "hints");
+ makehints(L, hints_FH, JIT_FH_MAX, "fhints");
+ lua_pop(L, 1);
+
+ /* Everything ok, so turn the JIT engine on. Vroooom! */
+ if (luaJIT_setmode(L, 0, LUAJIT_MODE_ENGINE|LUAJIT_MODE_ON) <= 0) {
+ /* Ouch. Someone screwed up DynASM or the JSUBs. Probably me. */
+ /* But if you get 999999999, look at jit_consistency_check(). */
+ return luaL_error(L, "JIT engine init failed (%d)",
+ G(L)->jit_state->dasmstatus);
+ }
+
+ return 1;
+}
+
diff --git a/src/luajit/llex.c b/src/luajit/llex.c
new file mode 100644
index 0000000000..6dc319358c
--- /dev/null
+++ b/src/luajit/llex.c
@@ -0,0 +1,461 @@
+/*
+** $Id: llex.c,v 2.20.1.1 2007/12/27 13:02:25 roberto Exp $
+** Lexical Analyzer
+** See Copyright Notice in lua.h
+*/
+
+
+#include <ctype.h>
+#include <locale.h>
+#include <string.h>
+
+#define llex_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "ldo.h"
+#include "llex.h"
+#include "lobject.h"
+#include "lparser.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "lzio.h"
+
+
+
+#define next(ls) (ls->current = zgetc(ls->z))
+
+
+
+
+#define currIsNewline(ls) (ls->current == '\n' || ls->current == '\r')
+
+
+/* ORDER RESERVED */
+const char *const luaX_tokens [] = {
+ "and", "break", "do", "else", "elseif",
+ "end", "false", "for", "function", "if",
+ "in", "local", "nil", "not", "or", "repeat",
+ "return", "then", "true", "until", "while",
+ "..", "...", "==", ">=", "<=", "~=",
+ "<number>", "<name>", "<string>", "<eof>",
+ NULL
+};
+
+
+#define save_and_next(ls) (save(ls, ls->current), next(ls))
+
+
+static void save (LexState *ls, int c) {
+ Mbuffer *b = ls->buff;
+ if (b->n + 1 > b->buffsize) {
+ size_t newsize;
+ if (b->buffsize >= MAX_SIZET/2)
+ luaX_lexerror(ls, "lexical element too long", 0);
+ newsize = b->buffsize * 2;
+ luaZ_resizebuffer(ls->L, b, newsize);
+ }
+ b->buffer[b->n++] = cast(char, c);
+}
+
+
+void luaX_init (lua_State *L) {
+ int i;
+ for (i=0; i<NUM_RESERVED; i++) {
+ TString *ts = luaS_new(L, luaX_tokens[i]);
+ luaS_fix(ts); /* reserved words are never collected */
+ lua_assert(strlen(luaX_tokens[i])+1 <= TOKEN_LEN);
+ ts->tsv.reserved = cast_byte(i+1); /* reserved word */
+ }
+}
+
+
+#define MAXSRC 80
+
+
+const char *luaX_token2str (LexState *ls, int token) {
+ if (token < FIRST_RESERVED) {
+ lua_assert(token == cast(unsigned char, token));
+ return (iscntrl(token)) ? luaO_pushfstring(ls->L, "char(%d)", token) :
+ luaO_pushfstring(ls->L, "%c", token);
+ }
+ else
+ return luaX_tokens[token-FIRST_RESERVED];
+}
+
+
+static const char *txtToken (LexState *ls, int token) {
+ switch (token) {
+ case TK_NAME:
+ case TK_STRING:
+ case TK_NUMBER:
+ save(ls, '\0');
+ return luaZ_buffer(ls->buff);
+ default:
+ return luaX_token2str(ls, token);
+ }
+}
+
+
+void luaX_lexerror (LexState *ls, const char *msg, int token) {
+ char buff[MAXSRC];
+ luaO_chunkid(buff, getstr(ls->source), MAXSRC);
+ msg = luaO_pushfstring(ls->L, "%s:%d: %s", buff, ls->linenumber, msg);
+ if (token)
+ luaO_pushfstring(ls->L, "%s near " LUA_QS, msg, txtToken(ls, token));
+ luaD_throw(ls->L, LUA_ERRSYNTAX);
+}
+
+
+void luaX_syntaxerror (LexState *ls, const char *msg) {
+ luaX_lexerror(ls, msg, ls->t.token);
+}
+
+
+TString *luaX_newstring (LexState *ls, const char *str, size_t l) {
+ lua_State *L = ls->L;
+ TString *ts = luaS_newlstr(L, str, l);
+ TValue *o = luaH_setstr(L, ls->fs->h, ts); /* entry for `str' */
+ if (ttisnil(o))
+ setbvalue(o, 1); /* make sure `str' will not be collected */
+ return ts;
+}
+
+
+static void inclinenumber (LexState *ls) {
+ int old = ls->current;
+ lua_assert(currIsNewline(ls));
+ next(ls); /* skip `\n' or `\r' */
+ if (currIsNewline(ls) && ls->current != old)
+ next(ls); /* skip `\n\r' or `\r\n' */
+ if (++ls->linenumber >= MAX_INT)
+ luaX_syntaxerror(ls, "chunk has too many lines");
+}
+
+
+void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source) {
+ ls->decpoint = '.';
+ 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;
+ luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); /* initialize buffer */
+ next(ls); /* read first char */
+}
+
+
+
+/*
+** =======================================================
+** LEXICAL ANALYZER
+** =======================================================
+*/
+
+
+
+static int check_next (LexState *ls, const char *set) {
+ if (!strchr(set, ls->current))
+ return 0;
+ save_and_next(ls);
+ return 1;
+}
+
+
+static void buffreplace (LexState *ls, char from, char to) {
+ size_t n = luaZ_bufflen(ls->buff);
+ char *p = luaZ_buffer(ls->buff);
+ while (n--)
+ if (p[n] == from) p[n] = to;
+}
+
+
+static void trydecpoint (LexState *ls, SemInfo *seminfo) {
+ /* format error: try to update decimal point separator */
+ struct lconv *cv = localeconv();
+ char old = ls->decpoint;
+ ls->decpoint = (cv ? cv->decimal_point[0] : '.');
+ buffreplace(ls, old, ls->decpoint); /* try updated decimal separator */
+ if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r)) {
+ /* format error with correct decimal point: no more options */
+ buffreplace(ls, ls->decpoint, '.'); /* undo change (for error message) */
+ luaX_lexerror(ls, "malformed number", TK_NUMBER);
+ }
+}
+
+
+/* LUA_NUMBER */
+static void read_numeral (LexState *ls, SemInfo *seminfo) {
+ lua_assert(isdigit(ls->current));
+ do {
+ save_and_next(ls);
+ } while (isdigit(ls->current) || ls->current == '.');
+ if (check_next(ls, "Ee")) /* `E'? */
+ check_next(ls, "+-"); /* optional exponent sign */
+ while (isalnum(ls->current) || ls->current == '_')
+ save_and_next(ls);
+ save(ls, '\0');
+ buffreplace(ls, '.', ls->decpoint); /* follow locale for decimal point */
+ if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r)) /* format error? */
+ trydecpoint(ls, seminfo); /* try to update decimal point separator */
+}
+
+
+static int skip_sep (LexState *ls) {
+ int count = 0;
+ int s = ls->current;
+ lua_assert(s == '[' || s == ']');
+ save_and_next(ls);
+ while (ls->current == '=') {
+ save_and_next(ls);
+ count++;
+ }
+ return (ls->current == s) ? count : (-count) - 1;
+}
+
+
+static void read_long_string (LexState *ls, SemInfo *seminfo, int sep) {
+ int cont = 0;
+ (void)(cont); /* avoid warnings when `cont' is not used */
+ save_and_next(ls); /* skip 2nd `[' */
+ if (currIsNewline(ls)) /* string starts with a newline? */
+ inclinenumber(ls); /* skip it */
+ for (;;) {
+ switch (ls->current) {
+ case EOZ:
+ luaX_lexerror(ls, (seminfo) ? "unfinished long string" :
+ "unfinished long comment", TK_EOS);
+ break; /* to avoid warnings */
+#if defined(LUA_COMPAT_LSTR)
+ case '[': {
+ if (skip_sep(ls) == sep) {
+ save_and_next(ls); /* skip 2nd `[' */
+ cont++;
+#if LUA_COMPAT_LSTR == 1
+ if (sep == 0)
+ luaX_lexerror(ls, "nesting of [[...]] is deprecated", '[');
+#endif
+ }
+ break;
+ }
+#endif
+ case ']': {
+ if (skip_sep(ls) == sep) {
+ save_and_next(ls); /* skip 2nd `]' */
+#if defined(LUA_COMPAT_LSTR) && LUA_COMPAT_LSTR == 2
+ cont--;
+ if (sep == 0 && cont >= 0) break;
+#endif
+ goto endloop;
+ }
+ break;
+ }
+ case '\n':
+ case '\r': {
+ save(ls, '\n');
+ inclinenumber(ls);
+ if (!seminfo) luaZ_resetbuffer(ls->buff); /* avoid wasting space */
+ break;
+ }
+ default: {
+ if (seminfo) save_and_next(ls);
+ else next(ls);
+ }
+ }
+ } endloop:
+ if (seminfo)
+ seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep),
+ luaZ_bufflen(ls->buff) - 2*(2 + sep));
+}
+
+
+static void read_string (LexState *ls, int del, SemInfo *seminfo) {
+ save_and_next(ls);
+ while (ls->current != del) {
+ switch (ls->current) {
+ case EOZ:
+ luaX_lexerror(ls, "unfinished string", TK_EOS);
+ continue; /* to avoid warnings */
+ case '\n':
+ case '\r':
+ luaX_lexerror(ls, "unfinished string", TK_STRING);
+ continue; /* to avoid warnings */
+ case '\\': {
+ int c;
+ next(ls); /* do not save the `\' */
+ switch (ls->current) {
+ case 'a': c = '\a'; break;
+ case 'b': c = '\b'; break;
+ case 'f': c = '\f'; break;
+ case 'n': c = '\n'; break;
+ case 'r': c = '\r'; break;
+ case 't': c = '\t'; break;
+ case 'v': c = '\v'; break;
+ case '\n': /* go through */
+ case '\r': save(ls, '\n'); inclinenumber(ls); continue;
+ case EOZ: continue; /* will raise an error next loop */
+ default: {
+ if (!isdigit(ls->current))
+ save_and_next(ls); /* handles \\, \", \', and \? */
+ else { /* \xxx */
+ int i = 0;
+ c = 0;
+ do {
+ c = 10*c + (ls->current-'0');
+ next(ls);
+ } while (++i<3 && isdigit(ls->current));
+ if (c > UCHAR_MAX)
+ luaX_lexerror(ls, "escape sequence too large", TK_STRING);
+ save(ls, c);
+ }
+ continue;
+ }
+ }
+ save(ls, c);
+ next(ls);
+ continue;
+ }
+ default:
+ save_and_next(ls);
+ }
+ }
+ save_and_next(ls); /* skip delimiter */
+ seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1,
+ luaZ_bufflen(ls->buff) - 2);
+}
+
+
+static int llex (LexState *ls, SemInfo *seminfo) {
+ luaZ_resetbuffer(ls->buff);
+ for (;;) {
+ switch (ls->current) {
+ case '\n':
+ case '\r': {
+ inclinenumber(ls);
+ continue;
+ }
+ case '-': {
+ next(ls);
+ if (ls->current != '-') return '-';
+ /* else is a comment */
+ next(ls);
+ if (ls->current == '[') {
+ int sep = skip_sep(ls);
+ luaZ_resetbuffer(ls->buff); /* `skip_sep' may dirty the buffer */
+ if (sep >= 0) {
+ read_long_string(ls, NULL, sep); /* long comment */
+ luaZ_resetbuffer(ls->buff);
+ continue;
+ }
+ }
+ /* else short comment */
+ while (!currIsNewline(ls) && ls->current != EOZ)
+ next(ls);
+ continue;
+ }
+ case '[': {
+ int sep = skip_sep(ls);
+ if (sep >= 0) {
+ read_long_string(ls, seminfo, sep);
+ return TK_STRING;
+ }
+ else if (sep == -1) return '[';
+ else luaX_lexerror(ls, "invalid long string delimiter", 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 '.': {
+ save_and_next(ls);
+ if (check_next(ls, ".")) {
+ if (check_next(ls, "."))
+ return TK_DOTS; /* ... */
+ else return TK_CONCAT; /* .. */
+ }
+ else if (!isdigit(ls->current)) return '.';
+ else {
+ read_numeral(ls, seminfo);
+ return TK_NUMBER;
+ }
+ }
+ case EOZ: {
+ return TK_EOS;
+ }
+ default: {
+ if (isspace(ls->current)) {
+ lua_assert(!currIsNewline(ls));
+ next(ls);
+ continue;
+ }
+ else if (isdigit(ls->current)) {
+ read_numeral(ls, seminfo);
+ return TK_NUMBER;
+ }
+ else if (isalpha(ls->current) || ls->current == '_') {
+ /* identifier or reserved word */
+ TString *ts;
+ do {
+ save_and_next(ls);
+ } while (isalnum(ls->current) || ls->current == '_');
+ ts = luaX_newstring(ls, luaZ_buffer(ls->buff),
+ luaZ_bufflen(ls->buff));
+ if (ts->tsv.reserved > 0) /* reserved word? */
+ return ts->tsv.reserved - 1 + FIRST_RESERVED;
+ else {
+ seminfo->ts = ts;
+ return TK_NAME;
+ }
+ }
+ else {
+ int c = ls->current;
+ next(ls);
+ return c; /* single-char tokens (+ - / ...) */
+ }
+ }
+ }
+ }
+}
+
+
+void luaX_next (LexState *ls) {
+ ls->lastline = ls->linenumber;
+ if (ls->lookahead.token != TK_EOS) { /* is there a look-ahead token? */
+ ls->t = ls->lookahead; /* use this one */
+ ls->lookahead.token = TK_EOS; /* and discharge it */
+ }
+ else
+ ls->t.token = llex(ls, &ls->t.seminfo); /* read next token */
+}
+
+
+void luaX_lookahead (LexState *ls) {
+ lua_assert(ls->lookahead.token == TK_EOS);
+ ls->lookahead.token = llex(ls, &ls->lookahead.seminfo);
+}
+
diff --git a/src/luajit/llex.h b/src/luajit/llex.h
new file mode 100644
index 0000000000..a9201cee48
--- /dev/null
+++ b/src/luajit/llex.h
@@ -0,0 +1,81 @@
+/*
+** $Id: llex.h,v 1.58.1.1 2007/12/27 13:02:25 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_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, TK_NUMBER,
+ TK_NAME, TK_STRING, TK_EOS
+};
+
+/* number of reserved words */
+#define NUM_RESERVED (cast(int, TK_WHILE-FIRST_RESERVED+1))
+
+
+/* array with token `names' */
+LUAI_DATA const char *const luaX_tokens [];
+
+
+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 */
+ char decpoint; /* locale decimal point */
+} LexState;
+
+
+LUAI_FUNC void luaX_init (lua_State *L);
+LUAI_FUNC void luaX_setinput (lua_State *L, LexState *ls, ZIO *z,
+ TString *source);
+LUAI_FUNC TString *luaX_newstring (LexState *ls, const char *str, size_t l);
+LUAI_FUNC void luaX_next (LexState *ls);
+LUAI_FUNC void luaX_lookahead (LexState *ls);
+LUAI_FUNC void luaX_lexerror (LexState *ls, const char *msg, int token);
+LUAI_FUNC void luaX_syntaxerror (LexState *ls, const char *s);
+LUAI_FUNC const char *luaX_token2str (LexState *ls, int token);
+
+
+#endif
diff --git a/src/luajit/llimits.h b/src/luajit/llimits.h
new file mode 100644
index 0000000000..ca8dcb7224
--- /dev/null
+++ b/src/luajit/llimits.h
@@ -0,0 +1,128 @@
+/*
+** $Id: llimits.h,v 1.69.1.1 2007/12/27 13:02:25 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"
+
+
+typedef LUAI_UINT32 lu_int32;
+
+typedef LUAI_UMEM lu_mem;
+
+typedef LUAI_MEM l_mem;
+
+
+
+/* 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_LUMEM ((lu_mem)(~(lu_mem)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) ((unsigned int)(lu_mem)(p))
+
+
+
+/* type to ensure maximum alignment */
+typedef LUAI_USER_ALIGNMENT_T L_Umaxalign;
+
+
+/* result of a `usual argument conversion' over lua_Number */
+typedef LUAI_UACNUMBER l_uacNumber;
+
+
+/* internal assertions for in-house debugging */
+#ifdef lua_assert
+
+#define check_exp(c,e) (lua_assert(c), (e))
+#define api_check(l,e) lua_assert(e)
+
+#else
+
+#define lua_assert(c) ((void)0)
+#define check_exp(c,e) (e)
+#define api_check luai_apicheck
+
+#endif
+
+
+#ifndef UNUSED
+#define UNUSED(x) ((void)(x)) /* to avoid warnings */
+#endif
+
+
+#ifndef cast
+#define cast(t, exp) ((t)(exp))
+#endif
+
+#define cast_byte(i) cast(lu_byte, (i))
+#define cast_num(i) cast(lua_Number, (i))
+#define cast_int(i) cast(int, (i))
+
+
+
+/*
+** type for virtual-machine instructions
+** must be an unsigned with (at least) 4 bytes (see details in lopcodes.h)
+*/
+typedef lu_int32 Instruction;
+
+
+
+/* maximum stack for a Lua function */
+#define MAXSTACK 250
+
+
+
+/* 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
+
+
+#ifndef lua_lock
+#define lua_lock(L) ((void) 0)
+#define lua_unlock(L) ((void) 0)
+#endif
+
+#ifndef luai_threadyield
+#define luai_threadyield(L) {lua_unlock(L); lua_lock(L);}
+#endif
+
+
+/*
+** macro to control inclusion of some hard tests on stack reallocation
+*/
+#ifndef HARDSTACKTESTS
+#define condhardstacktests(x) ((void)0)
+#else
+#define condhardstacktests(x) x
+#endif
+
+#endif
diff --git a/src/luajit/lmathlib.c b/src/luajit/lmathlib.c
new file mode 100644
index 0000000000..441fbf736c
--- /dev/null
+++ b/src/luajit/lmathlib.c
@@ -0,0 +1,263 @@
+/*
+** $Id: lmathlib.c,v 1.67.1.1 2007/12/27 13:02:25 roberto Exp $
+** Standard mathematical library
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdlib.h>
+#include <math.h>
+
+#define lmathlib_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+#undef PI
+#define PI (3.14159265358979323846)
+#define RADIANS_PER_DEGREE (PI/180.0)
+
+
+
+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(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_sinh (lua_State *L) {
+ lua_pushnumber(L, sinh(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_cos (lua_State *L) {
+ lua_pushnumber(L, cos(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_cosh (lua_State *L) {
+ lua_pushnumber(L, cosh(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_tan (lua_State *L) {
+ lua_pushnumber(L, tan(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_tanh (lua_State *L) {
+ lua_pushnumber(L, tanh(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_asin (lua_State *L) {
+ lua_pushnumber(L, asin(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_acos (lua_State *L) {
+ lua_pushnumber(L, acos(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_atan (lua_State *L) {
+ lua_pushnumber(L, atan(luaL_checknumber(L, 1)));
+ return 1;
+}
+
+static int math_atan2 (lua_State *L) {
+ lua_pushnumber(L, 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_fmod (lua_State *L) {
+ lua_pushnumber(L, fmod(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));
+ return 1;
+}
+
+static int math_modf (lua_State *L) {
+ double ip;
+ double fp = modf(luaL_checknumber(L, 1), &ip);
+ lua_pushnumber(L, ip);
+ lua_pushnumber(L, fp);
+ return 2;
+}
+
+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_pushinteger(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, 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, 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},
+ {"acos", math_acos},
+ {"asin", math_asin},
+ {"atan2", math_atan2},
+ {"atan", math_atan},
+ {"ceil", math_ceil},
+ {"cosh", math_cosh},
+ {"cos", math_cos},
+ {"deg", math_deg},
+ {"exp", math_exp},
+ {"floor", math_floor},
+ {"fmod", math_fmod},
+ {"frexp", math_frexp},
+ {"ldexp", math_ldexp},
+ {"log10", math_log10},
+ {"log", math_log},
+ {"max", math_max},
+ {"min", math_min},
+ {"modf", math_modf},
+ {"pow", math_pow},
+ {"rad", math_rad},
+ {"random", math_random},
+ {"randomseed", math_randomseed},
+ {"sinh", math_sinh},
+ {"sin", math_sin},
+ {"sqrt", math_sqrt},
+ {"tanh", math_tanh},
+ {"tan", math_tan},
+ {NULL, NULL}
+};
+
+
+/*
+** Open math library
+*/
+LUALIB_API int luaopen_math (lua_State *L) {
+ luaL_register(L, LUA_MATHLIBNAME, mathlib);
+ lua_pushnumber(L, PI);
+ lua_setfield(L, -2, "pi");
+ lua_pushnumber(L, HUGE_VAL);
+ lua_setfield(L, -2, "huge");
+#if defined(LUA_COMPAT_MOD)
+ lua_getfield(L, -1, "fmod");
+ lua_setfield(L, -2, "mod");
+#endif
+ return 1;
+}
+
diff --git a/src/luajit/lmem.c b/src/luajit/lmem.c
new file mode 100644
index 0000000000..ae7d8c965f
--- /dev/null
+++ b/src/luajit/lmem.c
@@ -0,0 +1,86 @@
+/*
+** $Id: lmem.c,v 1.70.1.1 2007/12/27 13:02:25 roberto Exp $
+** Interface to Memory Manager
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stddef.h>
+
+#define lmem_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+
+
+
+/*
+** About the realloc function:
+** void * frealloc (void *ud, void *ptr, size_t osize, size_t nsize);
+** (`osize' is the old size, `nsize' is the new size)
+**
+** Lua ensures that (ptr == NULL) iff (osize == 0).
+**
+** * frealloc(ud, NULL, 0, x) creates a new block of size `x'
+**
+** * frealloc(ud, p, x, 0) frees the block `p'
+** (in this specific case, frealloc must return NULL).
+** particularly, frealloc(ud, NULL, 0, 0) does nothing
+** (which is equivalent to free(NULL) in ANSI C)
+**
+** frealloc returns NULL if it cannot create or reallocate the area
+** (any reallocation to an equal or smaller size cannot fail!)
+*/
+
+
+
+#define MINSIZEARRAY 4
+
+
+void *luaM_growaux_ (lua_State *L, void *block, int *size, size_t size_elems,
+ int limit, const char *errormsg) {
+ void *newblock;
+ int newsize;
+ if (*size >= limit/2) { /* cannot double it? */
+ if (*size >= limit) /* cannot grow even a little? */
+ luaG_runerror(L, errormsg);
+ newsize = limit; /* still have at least one free place */
+ }
+ else {
+ newsize = (*size)*2;
+ if (newsize < MINSIZEARRAY)
+ newsize = MINSIZEARRAY; /* minimum size */
+ }
+ newblock = luaM_reallocv(L, block, *size, newsize, size_elems);
+ *size = newsize; /* update only when everything else is OK */
+ return newblock;
+}
+
+
+void *luaM_toobig (lua_State *L) {
+ luaG_runerror(L, "memory allocation error: block too big");
+ return NULL; /* to avoid warnings */
+}
+
+
+
+/*
+** generic allocation routine.
+*/
+void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) {
+ global_State *g = G(L);
+ lua_assert((osize == 0) == (block == NULL));
+ block = (*g->frealloc)(g->ud, block, osize, nsize);
+ if (block == NULL && nsize > 0)
+ luaD_throw(L, LUA_ERRMEM);
+ lua_assert((nsize == 0) == (block == NULL));
+ g->totalbytes = (g->totalbytes - osize) + nsize;
+ return block;
+}
+
diff --git a/src/luajit/lmem.h b/src/luajit/lmem.h
new file mode 100644
index 0000000000..7c2dcb3220
--- /dev/null
+++ b/src/luajit/lmem.h
@@ -0,0 +1,49 @@
+/*
+** $Id: lmem.h,v 1.31.1.1 2007/12/27 13:02:25 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"
+
+
+#define luaM_reallocv(L,b,on,n,e) \
+ ((cast(size_t, (n)+1) <= MAX_SIZET/(e)) ? /* +1 to avoid warnings */ \
+ luaM_realloc_(L, (b), (on)*(e), (n)*(e)) : \
+ luaM_toobig(L))
+
+#define luaM_freemem(L, b, s) luaM_realloc_(L, (b), (s), 0)
+#define luaM_free(L, b) luaM_realloc_(L, (b), sizeof(*(b)), 0)
+#define luaM_freearray(L, b, n, t) luaM_reallocv(L, (b), n, 0, sizeof(t))
+
+#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_reallocv(L, NULL, 0, n, 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_reallocv(L, v, oldn, n, sizeof(t))))
+
+
+LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize,
+ size_t size);
+LUAI_FUNC void *luaM_toobig (lua_State *L);
+LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int *size,
+ size_t size_elem, int limit,
+ const char *errormsg);
+
+#endif
+
diff --git a/src/luajit/loadlib.c b/src/luajit/loadlib.c
new file mode 100644
index 0000000000..eedfc8550a
--- /dev/null
+++ b/src/luajit/loadlib.c
@@ -0,0 +1,686 @@
+/*
+** $Id: loadlib.c,v 1.52.1.3 2008/08/06 13:29:28 roberto Exp $
+** Dynamic library loader for Lua
+** See Copyright Notice in lua.h
+**
+** This module contains an implementation of loadlib for Unix systems
+** that have dlfcn, an implementation for Darwin (Mac OS X), an
+** implementation for Windows, and a stub for other systems.
+*/
+
+
+#include <stdlib.h>
+#include <string.h>
+
+
+#define loadlib_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+#include "luajit.h"
+
+
+/* prefix for open functions in C libraries */
+#define LUA_POF "luaopen_"
+
+/* separator for open functions in C libraries */
+#define LUA_OFSEP "_"
+
+
+#define LIBPREFIX "LOADLIB: "
+
+#define POF LUA_POF
+#define LIB_FAIL "open"
+
+
+/* error codes for ll_loadfunc */
+#define ERRLIB 1
+#define ERRFUNC 2
+
+#define setprogdir(L) ((void)0)
+
+#include "physfs.h"
+
+static void ll_unloadlib (void *lib);
+static void *ll_load (lua_State *L, const char *path);
+static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym);
+
+
+
+#if defined(LUA_DL_DLOPEN)
+/*
+** {========================================================================
+** This is an implementation of loadlib based on the dlfcn interface.
+** The dlfcn interface is available in Linux, SunOS, Solaris, IRIX, FreeBSD,
+** NetBSD, AIX 4.2, HPUX 11, and probably most other Unix flavors, at least
+** as an emulation layer on top of native functions.
+** =========================================================================
+*/
+
+#include <dlfcn.h>
+
+static void ll_unloadlib (void *lib) {
+ dlclose(lib);
+}
+
+
+static void *ll_load (lua_State *L, const char *path) {
+ void *lib = dlopen(path, RTLD_NOW);
+ if (lib == NULL) lua_pushstring(L, dlerror());
+ return lib;
+}
+
+
+static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {
+ lua_CFunction f = (lua_CFunction)dlsym(lib, sym);
+ if (f == NULL) lua_pushstring(L, dlerror());
+ return f;
+}
+
+/* }====================================================== */
+
+
+
+#elif defined(LUA_DL_DLL)
+/*
+** {======================================================================
+** This is an implementation of loadlib for Windows using native functions.
+** =======================================================================
+*/
+
+#include <windows.h>
+
+
+#undef setprogdir
+
+static void setprogdir (lua_State *L) {
+ char buff[MAX_PATH + 1];
+ char *lb;
+ DWORD nsize = sizeof(buff)/sizeof(char);
+ DWORD n = GetModuleFileNameA(NULL, buff, nsize);
+ if (n == 0 || n == nsize || (lb = strrchr(buff, '\\')) == NULL)
+ luaL_error(L, "unable to get ModuleFileName");
+ else {
+ *lb = '\0';
+ luaL_gsub(L, lua_tostring(L, -1), LUA_EXECDIR, buff);
+ lua_remove(L, -2); /* remove original string */
+ }
+}
+
+
+static void pusherror (lua_State *L) {
+ int error = GetLastError();
+ char buffer[128];
+ if (FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM,
+ NULL, error, 0, buffer, sizeof(buffer), NULL))
+ lua_pushstring(L, buffer);
+ else
+ lua_pushfstring(L, "system error %d\n", error);
+}
+
+static void ll_unloadlib (void *lib) {
+ FreeLibrary((HINSTANCE)lib);
+}
+
+
+static void *ll_load (lua_State *L, const char *path) {
+ HINSTANCE lib = LoadLibraryA(path);
+ if (lib == NULL) pusherror(L);
+ return lib;
+}
+
+
+static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {
+ lua_CFunction f = (lua_CFunction)GetProcAddress((HINSTANCE)lib, sym);
+ if (f == NULL) pusherror(L);
+ return f;
+}
+
+/* }====================================================== */
+
+
+
+#elif defined(LUA_DL_DYLD)
+/*
+** {======================================================================
+** Native Mac OS X / Darwin Implementation
+** =======================================================================
+*/
+
+#include <mach-o/dyld.h>
+
+
+/* Mac appends a `_' before C function names */
+#undef POF
+#define POF "_" LUA_POF
+
+
+static void pusherror (lua_State *L) {
+ const char *err_str;
+ const char *err_file;
+ NSLinkEditErrors err;
+ int err_num;
+ NSLinkEditError(&err, &err_num, &err_file, &err_str);
+ lua_pushstring(L, err_str);
+}
+
+
+static const char *errorfromcode (NSObjectFileImageReturnCode ret) {
+ switch (ret) {
+ case NSObjectFileImageInappropriateFile:
+ return "file is not a bundle";
+ case NSObjectFileImageArch:
+ return "library is for wrong CPU type";
+ case NSObjectFileImageFormat:
+ return "bad format";
+ case NSObjectFileImageAccess:
+ return "cannot access file";
+ case NSObjectFileImageFailure:
+ default:
+ return "unable to load library";
+ }
+}
+
+
+static void ll_unloadlib (void *lib) {
+ NSUnLinkModule((NSModule)lib, NSUNLINKMODULE_OPTION_RESET_LAZY_REFERENCES);
+}
+
+
+static void *ll_load (lua_State *L, const char *path) {
+ NSObjectFileImage img;
+ NSObjectFileImageReturnCode ret;
+ /* this would be a rare case, but prevents crashing if it happens */
+ if(!_dyld_present()) {
+ lua_pushliteral(L, "dyld not present");
+ return NULL;
+ }
+ ret = NSCreateObjectFileImageFromFile(path, &img);
+ if (ret == NSObjectFileImageSuccess) {
+ NSModule mod = NSLinkModule(img, path, NSLINKMODULE_OPTION_PRIVATE |
+ NSLINKMODULE_OPTION_RETURN_ON_ERROR);
+ NSDestroyObjectFileImage(img);
+ if (mod == NULL) pusherror(L);
+ return mod;
+ }
+ lua_pushstring(L, errorfromcode(ret));
+ return NULL;
+}
+
+
+static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {
+ NSSymbol nss = NSLookupSymbolInModule((NSModule)lib, sym);
+ if (nss == NULL) {
+ lua_pushfstring(L, "symbol " LUA_QS " not found", sym);
+ return NULL;
+ }
+ return (lua_CFunction)NSAddressOfSymbol(nss);
+}
+
+/* }====================================================== */
+
+
+
+#else
+/*
+** {======================================================
+** Fallback for other systems
+** =======================================================
+*/
+
+#undef LIB_FAIL
+#define LIB_FAIL "absent"
+
+
+#define DLMSG "dynamic libraries not enabled; check your Lua installation"
+
+
+static void ll_unloadlib (void *lib) {
+ (void)lib; /* to avoid warnings */
+}
+
+
+static void *ll_load (lua_State *L, const char *path) {
+ (void)path; /* to avoid warnings */
+ lua_pushliteral(L, DLMSG);
+ return NULL;
+}
+
+
+static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {
+ (void)lib; (void)sym; /* to avoid warnings */
+ lua_pushliteral(L, DLMSG);
+ return NULL;
+}
+
+/* }====================================================== */
+#endif
+
+
+
+static void **ll_register (lua_State *L, const char *path) {
+ void **plib;
+ lua_pushfstring(L, "%s%s", LIBPREFIX, path);
+ lua_gettable(L, LUA_REGISTRYINDEX); /* check library in registry? */
+ if (!lua_isnil(L, -1)) /* is there an entry? */
+ plib = (void **)lua_touserdata(L, -1);
+ else { /* no entry yet; create one */
+ lua_pop(L, 1);
+ plib = (void **)lua_newuserdata(L, sizeof(const void *));
+ *plib = NULL;
+ luaL_getmetatable(L, "_LOADLIB");
+ lua_setmetatable(L, -2);
+ lua_pushfstring(L, "%s%s", LIBPREFIX, path);
+ lua_pushvalue(L, -2);
+ lua_settable(L, LUA_REGISTRYINDEX);
+ }
+ return plib;
+}
+
+
+/*
+** __gc tag method: calls library's `ll_unloadlib' function with the lib
+** handle
+*/
+static int gctm (lua_State *L) {
+ void **lib = (void **)luaL_checkudata(L, 1, "_LOADLIB");
+ if (*lib) ll_unloadlib(*lib);
+ *lib = NULL; /* mark library as closed */
+ return 0;
+}
+
+
+static int ll_loadfunc (lua_State *L, const char *path, const char *sym) {
+ void **reg = ll_register(L, path);
+ if (*reg == NULL) *reg = ll_load(L, path);
+ if (*reg == NULL)
+ return ERRLIB; /* unable to load library */
+ else {
+ lua_CFunction f = ll_sym(L, *reg, sym);
+ if (f == NULL)
+ return ERRFUNC; /* unable to find function */
+ lua_pushcfunction(L, f);
+ return 0; /* return function */
+ }
+}
+
+
+static int ll_loadlib (lua_State *L) {
+ const char *path = luaL_checkstring(L, 1);
+ const char *init = luaL_checkstring(L, 2);
+ int stat = ll_loadfunc(L, path, init);
+ if (stat == 0) /* no errors? */
+ return 1; /* return the loaded function */
+ else { /* error; error message is on stack top */
+ lua_pushnil(L);
+ lua_insert(L, -2);
+ lua_pushstring(L, (stat == ERRLIB) ? LIB_FAIL : "init");
+ return 3; /* return nil, error message, and where */
+ }
+}
+
+
+
+/*
+** {======================================================
+** 'require' function
+** =======================================================
+*/
+
+
+static int readable (const char *filename) {
+ FILE *f = fopen(filename, "r"); /* try to open file */
+ if (f == NULL) return 0; /* open failed */
+ fclose(f);
+ return 1;
+}
+
+
+static const char *pushnexttemplate (lua_State *L, const char *path) {
+ const char *l;
+ while (*path == *LUA_PATHSEP) path++; /* skip separators */
+ if (*path == '\0') return NULL; /* no more templates */
+ l = strchr(path, *LUA_PATHSEP); /* find next separator */
+ if (l == NULL) l = path + strlen(path);
+ lua_pushlstring(L, path, l - path); /* template */
+ return l;
+}
+
+
+static const char *findfile (lua_State *L, const char *name,
+ const char *pname) {
+ const char *path;
+ name = luaL_gsub(L, name, ".", LUA_DIRSEP);
+ lua_getfield(L, LUA_ENVIRONINDEX, pname);
+ path = lua_tostring(L, -1);
+ if (path == NULL)
+ luaL_error(L, LUA_QL("package.%s") " must be a string", pname);
+ lua_pushliteral(L, ""); /* error accumulator */
+ while ((path = pushnexttemplate(L, path)) != NULL) {
+ const char *filename;
+ filename = luaL_gsub(L, lua_tostring(L, -1), LUA_PATH_MARK, name);
+ lua_remove(L, -2); /* remove path template */
+ if (readable(filename)) /* does file exist and is readable? */
+ return filename; /* return that file name */
+ lua_pushfstring(L, "\n\tno file " LUA_QS, filename);
+ lua_remove(L, -2); /* remove file name */
+ lua_concat(L, 2); /* add entry to possible error message */
+ }
+ return NULL; /* not found */
+}
+
+
+static void loaderror (lua_State *L, const char *filename) {
+ luaL_error(L, "error loading module " LUA_QS " from file " LUA_QS ":\n\t%s",
+ lua_tostring(L, 1), filename, lua_tostring(L, -1));
+}
+
+
+static int loader_Physfs (lua_State *L) {
+ char filename[1024];
+ char path[1024];
+ int i = 0;
+ const char *name = luaL_checkstring(L, 1);
+ while (name[i]){
+ filename[i] = (name[i] != '.') ? name[i] : '/';
+ i++;
+ }
+ filename[i] = 0;
+ snprintf(path, 1023, "/%s.lua", filename);
+ if (luaL_loadfile(L, path) != 0)
+ loaderror(L, path);
+ /* not useful to JIT compile main chunk of a module */
+ luaJIT_setmode(L, -1, LUAJIT_MODE_FUNC|LUAJIT_MODE_OFF);
+ return 1; /* library loaded successfully */
+}
+
+static int loader_Lua (lua_State *L) {
+ const char *filename;
+ const char *name = luaL_checkstring(L, 1);
+ filename = findfile(L, name, "path");
+ if (filename == NULL) return 1; /* library not found in this path */
+ if (luaL_loadfile(L, filename) != 0)
+ loaderror(L, filename);
+ return 1; /* library loaded successfully */
+}
+
+
+static const char *mkfuncname (lua_State *L, const char *modname) {
+ const char *funcname;
+ const char *mark = strchr(modname, *LUA_IGMARK);
+ if (mark) modname = mark + 1;
+ funcname = luaL_gsub(L, modname, ".", LUA_OFSEP);
+ funcname = lua_pushfstring(L, POF"%s", funcname);
+ lua_remove(L, -2); /* remove 'gsub' result */
+ return funcname;
+}
+
+
+static int loader_C (lua_State *L) {
+ const char *funcname;
+ const char *name = luaL_checkstring(L, 1);
+ const char *filename = findfile(L, name, "cpath");
+ if (filename == NULL) return 1; /* library not found in this path */
+ funcname = mkfuncname(L, name);
+ if (ll_loadfunc(L, filename, funcname) != 0)
+ loaderror(L, filename);
+ return 1; /* library loaded successfully */
+}
+
+
+static int loader_Croot (lua_State *L) {
+ const char *funcname;
+ const char *filename;
+ const char *name = luaL_checkstring(L, 1);
+ const char *p = strchr(name, '.');
+ int stat;
+ if (p == NULL) return 0; /* is root */
+ lua_pushlstring(L, name, p - name);
+ filename = findfile(L, lua_tostring(L, -1), "cpath");
+ if (filename == NULL) return 1; /* root not found */
+ funcname = mkfuncname(L, name);
+ if ((stat = ll_loadfunc(L, filename, funcname)) != 0) {
+ if (stat != ERRFUNC) loaderror(L, filename); /* real error */
+ lua_pushfstring(L, "\n\tno module " LUA_QS " in file " LUA_QS,
+ name, filename);
+ return 1; /* function not found */
+ }
+ return 1;
+}
+
+
+static int loader_preload (lua_State *L) {
+ const char *name = luaL_checkstring(L, 1);
+ lua_getfield(L, LUA_ENVIRONINDEX, "preload");
+ if (!lua_istable(L, -1))
+ luaL_error(L, LUA_QL("package.preload") " must be a table");
+ lua_getfield(L, -1, name);
+ if (lua_isnil(L, -1)) /* not found? */
+ lua_pushfstring(L, "\n\tno field package.preload['%s']", name);
+ return 1;
+}
+
+
+static const int sentinel_ = 0;
+#define sentinel ((void *)&sentinel_)
+
+
+static int ll_require (lua_State *L) {
+ const char *name = luaL_checkstring(L, 1);
+ int i;
+ lua_settop(L, 1); /* _LOADED table will be at index 2 */
+ lua_getfield(L, LUA_REGISTRYINDEX, "_LOADED");
+ lua_getfield(L, 2, name);
+ if (lua_toboolean(L, -1)) { /* is it there? */
+ if (lua_touserdata(L, -1) == sentinel) /* check loops */
+ luaL_error(L, "loop or previous error loading module " LUA_QS, name);
+ return 1; /* package is already loaded */
+ }
+ /* else must load it; iterate over available loaders */
+ lua_getfield(L, LUA_ENVIRONINDEX, "loaders");
+ if (!lua_istable(L, -1))
+ luaL_error(L, LUA_QL("package.loaders") " must be a table");
+ lua_pushliteral(L, ""); /* error message accumulator */
+ for (i=1; ; i++) {
+ lua_rawgeti(L, -2, i); /* get a loader */
+ if (lua_isnil(L, -1))
+ luaL_error(L, "module " LUA_QS " not found:%s",
+ name, lua_tostring(L, -2));
+ lua_pushstring(L, name);
+ lua_call(L, 1, 1); /* call it */
+ if (lua_isfunction(L, -1)) /* did it find module? */
+ break; /* module loaded successfully */
+ else if (lua_isstring(L, -1)) /* loader returned error message? */
+ lua_concat(L, 2); /* accumulate it */
+ else
+ lua_pop(L, 1);
+ }
+ lua_pushlightuserdata(L, sentinel);
+ lua_setfield(L, 2, name); /* _LOADED[name] = sentinel */
+ lua_pushstring(L, name); /* pass name as argument to module */
+ lua_call(L, 1, 1); /* run loaded module */
+ if (!lua_isnil(L, -1)) /* non-nil return? */
+ lua_setfield(L, 2, name); /* _LOADED[name] = returned value */
+ lua_getfield(L, 2, name);
+ if (lua_touserdata(L, -1) == sentinel) { /* module did not set a value? */
+ lua_pushboolean(L, 1); /* use true as result */
+ lua_pushvalue(L, -1); /* extra copy to be returned */
+ lua_setfield(L, 2, name); /* _LOADED[name] = true */
+ }
+ return 1;
+}
+
+/* }====================================================== */
+
+
+
+/*
+** {======================================================
+** 'module' function
+** =======================================================
+*/
+
+
+static void setfenv (lua_State *L) {
+ lua_Debug ar;
+ if (lua_getstack(L, 1, &ar) == 0 ||
+ lua_getinfo(L, "f", &ar) == 0 || /* get calling function */
+ lua_iscfunction(L, -1))
+ luaL_error(L, LUA_QL("module") " not called from a Lua function");
+ lua_pushvalue(L, -2);
+ lua_setfenv(L, -2);
+ lua_pop(L, 1);
+}
+
+
+static void dooptions (lua_State *L, int n) {
+ int i;
+ for (i = 2; i <= n; i++) {
+ lua_pushvalue(L, i); /* get option (a function) */
+ lua_pushvalue(L, -2); /* module */
+ lua_call(L, 1, 0);
+ }
+}
+
+
+static void modinit (lua_State *L, const char *modname) {
+ const char *dot;
+ lua_pushvalue(L, -1);
+ lua_setfield(L, -2, "_M"); /* module._M = module */
+ lua_pushstring(L, modname);
+ lua_setfield(L, -2, "_NAME");
+ dot = strrchr(modname, '.'); /* look for last dot in module name */
+ if (dot == NULL) dot = modname;
+ else dot++;
+ /* set _PACKAGE as package name (full module name minus last part) */
+ lua_pushlstring(L, modname, dot - modname);
+ lua_setfield(L, -2, "_PACKAGE");
+}
+
+
+static int ll_module (lua_State *L) {
+ const char *modname = luaL_checkstring(L, 1);
+ int loaded = lua_gettop(L) + 1; /* index of _LOADED table */
+ lua_getfield(L, LUA_REGISTRYINDEX, "_LOADED");
+ lua_getfield(L, loaded, modname); /* get _LOADED[modname] */
+ if (!lua_istable(L, -1)) { /* not found? */
+ lua_pop(L, 1); /* remove previous result */
+ /* try global variable (and create one if it does not exist) */
+ if (luaL_findtable(L, LUA_GLOBALSINDEX, modname, 1) != NULL)
+ return luaL_error(L, "name conflict for module " LUA_QS, modname);
+ lua_pushvalue(L, -1);
+ lua_setfield(L, loaded, modname); /* _LOADED[modname] = new table */
+ }
+ /* check whether table already has a _NAME field */
+ lua_getfield(L, -1, "_NAME");
+ if (!lua_isnil(L, -1)) /* is table an initialized module? */
+ lua_pop(L, 1);
+ else { /* no; initialize it */
+ lua_pop(L, 1);
+ modinit(L, modname);
+ }
+ lua_pushvalue(L, -1);
+ setfenv(L);
+ dooptions(L, loaded - 1);
+ return 0;
+}
+
+
+static int ll_seeall (lua_State *L) {
+ luaL_checktype(L, 1, LUA_TTABLE);
+ if (!lua_getmetatable(L, 1)) {
+ lua_createtable(L, 0, 1); /* create new metatable */
+ lua_pushvalue(L, -1);
+ lua_setmetatable(L, 1);
+ }
+ lua_pushvalue(L, LUA_GLOBALSINDEX);
+ lua_setfield(L, -2, "__index"); /* mt.__index = _G */
+ return 0;
+}
+
+
+/* }====================================================== */
+
+
+
+/* auxiliary mark (for internal use) */
+#define AUXMARK "\1"
+
+static void setpath (lua_State *L, const char *fieldname, const char *envname,
+ const char *def) {
+ const char *path = getenv(envname);
+ if (path == NULL) /* no environment variable? */
+ lua_pushstring(L, def); /* use default */
+ else {
+ /* replace ";;" by ";AUXMARK;" and then AUXMARK by default path */
+ path = luaL_gsub(L, path, LUA_PATHSEP LUA_PATHSEP,
+ LUA_PATHSEP AUXMARK LUA_PATHSEP);
+ luaL_gsub(L, path, AUXMARK, def);
+ lua_remove(L, -2);
+ }
+ setprogdir(L);
+ lua_setfield(L, -2, fieldname);
+}
+
+
+static const luaL_Reg pk_funcs[] = {
+ {"loadlib", ll_loadlib},
+ {"seeall", ll_seeall},
+ {NULL, NULL}
+};
+
+
+static const luaL_Reg ll_funcs[] = {
+ {"module", ll_module},
+ {"require", ll_require},
+ {NULL, NULL}
+};
+
+
+static const lua_CFunction loaders[] =
+ {loader_preload, loader_Physfs, loader_C, loader_Croot, NULL};
+
+
+LUALIB_API int luaopen_package (lua_State *L) {
+ int i;
+ /* create new type _LOADLIB */
+ luaL_newmetatable(L, "_LOADLIB");
+ lua_pushcfunction(L, gctm);
+ lua_setfield(L, -2, "__gc");
+ /* create `package' table */
+ luaL_register(L, LUA_LOADLIBNAME, pk_funcs);
+#if defined(LUA_COMPAT_LOADLIB)
+ lua_getfield(L, -1, "loadlib");
+ lua_setfield(L, LUA_GLOBALSINDEX, "loadlib");
+#endif
+ lua_pushvalue(L, -1);
+ lua_replace(L, LUA_ENVIRONINDEX);
+ /* create `loaders' table */
+ lua_createtable(L, 0, sizeof(loaders)/sizeof(loaders[0]) - 1);
+ /* fill it with pre-defined loaders */
+ for (i=0; loaders[i] != NULL; i++) {
+ lua_pushcfunction(L, loaders[i]);
+ lua_rawseti(L, -2, i+1);
+ }
+ lua_setfield(L, -2, "loaders"); /* put it in field `loaders' */
+ setpath(L, "path", LUA_PATH, LUA_PATH_DEFAULT); /* set field `path' */
+ setpath(L, "cpath", LUA_CPATH, LUA_CPATH_DEFAULT); /* set field `cpath' */
+ /* store config information */
+ lua_pushliteral(L, LUA_DIRSEP "\n" LUA_PATHSEP "\n" LUA_PATH_MARK "\n"
+ LUA_EXECDIR "\n" LUA_IGMARK);
+ lua_setfield(L, -2, "config");
+ /* set field `loaded' */
+ luaL_findtable(L, LUA_REGISTRYINDEX, "_LOADED", 2);
+ lua_setfield(L, -2, "loaded");
+ /* set field `preload' */
+ lua_newtable(L);
+ lua_setfield(L, -2, "preload");
+ lua_pushvalue(L, LUA_GLOBALSINDEX);
+ luaL_register(L, NULL, ll_funcs); /* open lib into global table */
+ lua_pop(L, 1);
+ return 1; /* return 'package' table */
+}
+
diff --git a/src/luajit/lobject.c b/src/luajit/lobject.c
new file mode 100644
index 0000000000..4ff50732a4
--- /dev/null
+++ b/src/luajit/lobject.c
@@ -0,0 +1,214 @@
+/*
+** $Id: lobject.c,v 2.22.1.1 2007/12/27 13:02:25 roberto Exp $
+** Some generic functions over Lua objects
+** See Copyright Notice in lua.h
+*/
+
+#include <ctype.h>
+#include <stdarg.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define lobject_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "ldo.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "lvm.h"
+
+
+
+const TValue luaO_nilobject_ = {{NULL}, LUA_TNIL};
+
+
+/*
+** converts an integer to a "floating point byte", represented as
+** (eeeeexxx), where the real value is (1xxx) * 2^(eeeee - 1) if
+** eeeee != 0 and (xxx) otherwise.
+*/
+int luaO_int2fb (unsigned int x) {
+ int e = 0; /* expoent */
+ while (x >= 16) {
+ x = (x+1) >> 1;
+ e++;
+ }
+ if (x < 8) return x;
+ else return ((e+1) << 3) | (cast_int(x) - 8);
+}
+
+
+/* converts back */
+int luaO_fb2int (int x) {
+ int e = (x >> 3) & 31;
+ if (e == 0) return x;
+ else return ((x & 7)+8) << (e - 1);
+}
+
+
+int luaO_log2 (unsigned int x) {
+ static const lu_byte log_2[256] = {
+ 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
+ 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
+ 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
+ 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
+ 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
+ 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
+ 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
+ 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8
+ };
+ int l = -1;
+ while (x >= 256) { l += 8; x >>= 8; }
+ return l + log_2[x];
+
+}
+
+
+int luaO_rawequalObj (const TValue *t1, const TValue *t2) {
+ if (ttype(t1) != ttype(t2)) return 0;
+ else switch (ttype(t1)) {
+ case LUA_TNIL:
+ return 1;
+ case LUA_TNUMBER:
+ return luai_numeq(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;
+ *result = lua_str2number(s, &endptr);
+ if (endptr == s) return 0; /* conversion failed */
+ if (*endptr == 'x' || *endptr == 'X') /* maybe an hexadecimal constant? */
+ *result = cast_num(strtoul(s, &endptr, 16));
+ if (*endptr == '\0') return 1; /* most common case */
+ while (isspace(cast(unsigned char, *endptr))) endptr++;
+ if (*endptr != '\0') return 0; /* invalid trailing characters? */
+ return 1;
+}
+
+
+
+static void pushstr (lua_State *L, const char *str) {
+ setsvalue2s(L, L->top, luaS_new(L, str));
+ incr_top(L);
+}
+
+
+/* this function handles only `%d', `%c', %f, %p, 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, L->top, luaS_newlstr(L, fmt, e-fmt));
+ incr_top(L);
+ switch (*(e+1)) {
+ case 's': {
+ const char *s = va_arg(argp, char *);
+ if (s == NULL) s = "(null)";
+ pushstr(L, s);
+ 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_num(va_arg(argp, int)));
+ incr_top(L);
+ break;
+ }
+ case 'f': {
+ setnvalue(L->top, cast_num(va_arg(argp, l_uacNumber)));
+ incr_top(L);
+ break;
+ }
+ case 'p': {
+ char buff[4*sizeof(void *) + 8]; /* should be enough space for a `%p' */
+ sprintf(buff, "%p", va_arg(argp, void *));
+ pushstr(L, buff);
+ break;
+ }
+ case '%': {
+ pushstr(L, "%");
+ break;
+ }
+ default: {
+ char buff[3];
+ buff[0] = '%';
+ buff[1] = *(e+1);
+ buff[2] = '\0';
+ pushstr(L, buff);
+ break;
+ }
+ }
+ n += 2;
+ fmt = e+2;
+ }
+ pushstr(L, fmt);
+ luaV_concat(L, n+1, cast_int(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, size_t 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 == '@') {
+ size_t 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"] */
+ size_t len = strcspn(source, "\n\r"); /* 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, "\"]");
+ }
+ }
+}
diff --git a/src/luajit/lobject.h b/src/luajit/lobject.h
new file mode 100644
index 0000000000..df9c528d9c
--- /dev/null
+++ b/src/luajit/lobject.h
@@ -0,0 +1,386 @@
+/*
+** $Id: lobject.h,v 2.20.1.2 2008/08/06 13:29:48 roberto Exp $
+** Type definitions for Lua objects
+** See Copyright Notice in lua.h
+*/
+
+
+#ifndef lobject_h
+#define lobject_h
+
+
+#include <stdarg.h>
+
+
+#include "llimits.h"
+#include "lua.h"
+
+
+/* tags for values visible from Lua */
+#define LAST_TAG LUA_TTHREAD
+
+#define NUM_TAGS (LAST_TAG+1)
+
+
+/*
+** Extra tags for non-values
+*/
+#define LUA_TPROTO (LAST_TAG+1)
+#define LUA_TUPVAL (LAST_TAG+2)
+#define LUA_TDEADKEY (LAST_TAG+3)
+
+
+/*
+** 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;
+ ptrdiff_t na[sizeof(lua_Number)/sizeof(ptrdiff_t)]; /* LuaJIT kludge */
+ int b;
+} Value;
+
+
+/*
+** Tagged Values
+*/
+
+#define TValuefields Value value; int tt
+
+typedef struct lua_TValue {
+ TValuefields;
+} LUA_TVALUE_ALIGN TValue;
+
+
+/* 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 rawtsvalue(o) check_exp(ttisstring(o), &(o)->value.gc->ts)
+#define tsvalue(o) (&rawtsvalue(o)->tsv)
+#define rawuvalue(o) check_exp(ttisuserdata(o), &(o)->value.gc->u)
+#define uvalue(o) (&rawuvalue(o)->uv)
+#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))
+
+/*
+** for internal debug only
+*/
+#define checkconsistency(obj) \
+ lua_assert(!iscollectable(obj) || (ttype(obj) == (obj)->value.gc->gch.tt))
+
+#define checkliveness(g,obj) \
+ lua_assert(!iscollectable(obj) || \
+ ((ttype(obj) == (obj)->value.gc->gch.tt) && !isdead(g, (obj)->value.gc)))
+
+
+/* Macros to set values */
+#define setnilvalue(obj) ((obj)->tt=LUA_TNIL)
+
+#define setnvalue(obj,x) \
+ { TValue *i_o=(obj); i_o->value.n=(x); i_o->tt=LUA_TNUMBER; }
+
+#define setpvalue(obj,x) \
+ { TValue *i_o=(obj); i_o->value.p=(x); i_o->tt=LUA_TLIGHTUSERDATA; }
+
+#define setbvalue(obj,x) \
+ { TValue *i_o=(obj); i_o->value.b=(x); i_o->tt=LUA_TBOOLEAN; }
+
+#define setsvalue(L,obj,x) \
+ { TValue *i_o=(obj); \
+ i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TSTRING; \
+ checkliveness(G(L),i_o); }
+
+#define setuvalue(L,obj,x) \
+ { TValue *i_o=(obj); \
+ i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TUSERDATA; \
+ checkliveness(G(L),i_o); }
+
+#define setthvalue(L,obj,x) \
+ { TValue *i_o=(obj); \
+ i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TTHREAD; \
+ checkliveness(G(L),i_o); }
+
+#define setclvalue(L,obj,x) \
+ { TValue *i_o=(obj); \
+ i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TFUNCTION; \
+ checkliveness(G(L),i_o); }
+
+#define sethvalue(L,obj,x) \
+ { TValue *i_o=(obj); \
+ i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TTABLE; \
+ checkliveness(G(L),i_o); }
+
+#define setptvalue(L,obj,x) \
+ { TValue *i_o=(obj); \
+ i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TPROTO; \
+ checkliveness(G(L),i_o); }
+
+
+
+
+#define setobj(L,obj1,obj2) \
+ { const TValue *o2=(obj2); TValue *o1=(obj1); \
+ o1->value = o2->value; o1->tt=o2->tt; \
+ checkliveness(G(L),o1); }
+
+
+/*
+** 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
+#define sethvalue2s sethvalue
+#define setptvalue2s setptvalue
+/* 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 TValue *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;
+ unsigned int hash;
+ size_t len;
+ } tsv;
+} TString;
+
+
+#define getstr(ts) cast(const char *, (ts) + 1)
+#define svalue(o) getstr(rawtsvalue(o))
+
+
+
+typedef union Udata {
+ L_Umaxalign dummy; /* ensures maximum alignment for `local' udata */
+ struct {
+ CommonHeader;
+ struct Table *metatable;
+ struct Table *env;
+ size_t len;
+ } uv;
+} Udata;
+
+
+
+
+/*
+** Function Prototypes
+*/
+typedef struct Proto {
+ CommonHeader;
+ TValue *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;
+ int lastlinedefined;
+ GCObject *gclist;
+ lu_byte nups; /* number of upvalues */
+ lu_byte numparams;
+ lu_byte is_vararg;
+ lu_byte maxstacksize;
+ /* LuaJIT extensions */
+ void *jit_mcode; /* compiled machine code base address */
+ size_t jit_szmcode; /* size of compiled mcode */
+ int jit_status; /* JIT engine status code */
+} Proto;
+
+
+/* masks for new-style vararg */
+#define VARARG_HASARG 1
+#define VARARG_ISVARARG 2
+#define VARARG_NEEDSARG 4
+
+
+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;
+ TValue *v; /* points to stack or to its own value */
+ union {
+ TValue value; /* the value (when closed) */
+ struct { /* double linked list (when open) */
+ struct UpVal *prev;
+ struct UpVal *next;
+ } l;
+ } u;
+} UpVal;
+
+
+/*
+** Closures
+*/
+
+#define ClosureHeader \
+ CommonHeader; lu_byte isC; lu_byte nupvalues; GCObject *gclist; \
+ struct Table *env; lua_CFunction jit_gate
+
+typedef struct CClosure {
+ ClosureHeader;
+ lua_CFunction f;
+ TValue upvalue[1];
+} CClosure;
+
+
+typedef struct LClosure {
+ ClosureHeader;
+ struct Proto *p;
+ UpVal *upvals[1];
+} LClosure;
+
+
+typedef union Closure {
+ CClosure c;
+ LClosure l;
+} Closure;
+
+
+#define iscfunction(o) (ttype(o) == LUA_TFUNCTION && clvalue(o)->c.isC)
+#define isLfunction(o) (ttype(o) == LUA_TFUNCTION && !clvalue(o)->c.isC)
+
+
+/*
+** Tables
+*/
+
+typedef union TKey {
+ struct {
+ TValuefields;
+ struct Node *next; /* for chaining */
+ } nk;
+ TValue tvk;
+} TKey;
+
+
+typedef struct Node {
+ TValue i_val;
+ TKey i_key;
+} Node;
+
+
+typedef struct Table {
+ CommonHeader;
+ lu_byte flags; /* 1<<p means tagmethod(p) is not present */
+ lu_byte lsizenode; /* log2 of size of `node' array */
+ struct Table *metatable;
+ TValue *array; /* array part */
+ Node *node;
+ Node *lastfree; /* any free position is before this position */
+ 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))
+
+
+#define luaO_nilobject (&luaO_nilobject_)
+
+LUAI_DATA const TValue luaO_nilobject_;
+
+#define ceillog2(x) (luaO_log2((x)-1) + 1)
+
+LUAI_FUNC int luaO_log2 (unsigned int x);
+LUAI_FUNC int luaO_int2fb (unsigned int x);
+LUAI_FUNC int luaO_fb2int (int x);
+LUAI_FUNC int luaO_rawequalObj (const TValue *t1, const TValue *t2);
+LUAI_FUNC int luaO_str2d (const char *s, lua_Number *result);
+LUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt,
+ va_list argp);
+LUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...);
+LUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t len);
+
+
+#endif
+
diff --git a/src/luajit/lopcodes.c b/src/luajit/lopcodes.c
new file mode 100644
index 0000000000..4cc745230b
--- /dev/null
+++ b/src/luajit/lopcodes.c
@@ -0,0 +1,102 @@
+/*
+** $Id: lopcodes.c,v 1.37.1.1 2007/12/27 13:02:25 roberto Exp $
+** See Copyright Notice in lua.h
+*/
+
+
+#define lopcodes_c
+#define LUA_CORE
+
+
+#include "lopcodes.h"
+
+
+/* ORDER OP */
+
+const char *const luaP_opnames[NUM_OPCODES+1] = {
+ "MOVE",
+ "LOADK",
+ "LOADBOOL",
+ "LOADNIL",
+ "GETUPVAL",
+ "GETGLOBAL",
+ "GETTABLE",
+ "SETGLOBAL",
+ "SETUPVAL",
+ "SETTABLE",
+ "NEWTABLE",
+ "SELF",
+ "ADD",
+ "SUB",
+ "MUL",
+ "DIV",
+ "MOD",
+ "POW",
+ "UNM",
+ "NOT",
+ "LEN",
+ "CONCAT",
+ "JMP",
+ "EQ",
+ "LT",
+ "LE",
+ "TEST",
+ "TESTSET",
+ "CALL",
+ "TAILCALL",
+ "RETURN",
+ "FORLOOP",
+ "FORPREP",
+ "TFORLOOP",
+ "SETLIST",
+ "CLOSE",
+ "CLOSURE",
+ "VARARG",
+ NULL
+};
+
+
+#define opmode(t,a,b,c,m) (((t)<<7) | ((a)<<6) | ((b)<<4) | ((c)<<2) | (m))
+
+const lu_byte luaP_opmodes[NUM_OPCODES] = {
+/* T A B C mode opcode */
+ opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_MOVE */
+ ,opmode(0, 1, OpArgK, OpArgN, iABx) /* OP_LOADK */
+ ,opmode(0, 1, OpArgU, OpArgU, iABC) /* OP_LOADBOOL */
+ ,opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_LOADNIL */
+ ,opmode(0, 1, OpArgU, OpArgN, iABC) /* OP_GETUPVAL */
+ ,opmode(0, 1, OpArgK, OpArgN, iABx) /* OP_GETGLOBAL */
+ ,opmode(0, 1, OpArgR, OpArgK, iABC) /* OP_GETTABLE */
+ ,opmode(0, 0, OpArgK, OpArgN, iABx) /* OP_SETGLOBAL */
+ ,opmode(0, 0, OpArgU, OpArgN, iABC) /* OP_SETUPVAL */
+ ,opmode(0, 0, OpArgK, OpArgK, iABC) /* OP_SETTABLE */
+ ,opmode(0, 1, OpArgU, OpArgU, iABC) /* OP_NEWTABLE */
+ ,opmode(0, 1, OpArgR, OpArgK, iABC) /* OP_SELF */
+ ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_ADD */
+ ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_SUB */
+ ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_MUL */
+ ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_DIV */
+ ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_MOD */
+ ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_POW */
+ ,opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_UNM */
+ ,opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_NOT */
+ ,opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_LEN */
+ ,opmode(0, 1, OpArgR, OpArgR, iABC) /* OP_CONCAT */
+ ,opmode(0, 0, OpArgR, OpArgN, iAsBx) /* OP_JMP */
+ ,opmode(1, 0, OpArgK, OpArgK, iABC) /* OP_EQ */
+ ,opmode(1, 0, OpArgK, OpArgK, iABC) /* OP_LT */
+ ,opmode(1, 0, OpArgK, OpArgK, iABC) /* OP_LE */
+ ,opmode(1, 1, OpArgR, OpArgU, iABC) /* OP_TEST */
+ ,opmode(1, 1, OpArgR, OpArgU, iABC) /* OP_TESTSET */
+ ,opmode(0, 1, OpArgU, OpArgU, iABC) /* OP_CALL */
+ ,opmode(0, 1, OpArgU, OpArgU, iABC) /* OP_TAILCALL */
+ ,opmode(0, 0, OpArgU, OpArgN, iABC) /* OP_RETURN */
+ ,opmode(0, 1, OpArgR, OpArgN, iAsBx) /* OP_FORLOOP */
+ ,opmode(0, 1, OpArgR, OpArgN, iAsBx) /* OP_FORPREP */
+ ,opmode(1, 0, OpArgN, OpArgU, iABC) /* OP_TFORLOOP */
+ ,opmode(0, 0, OpArgU, OpArgU, iABC) /* OP_SETLIST */
+ ,opmode(0, 0, OpArgN, OpArgN, iABC) /* OP_CLOSE */
+ ,opmode(0, 1, OpArgU, OpArgN, iABx) /* OP_CLOSURE */
+ ,opmode(0, 1, OpArgU, OpArgN, iABC) /* OP_VARARG */
+};
+
diff --git a/src/luajit/lopcodes.h b/src/luajit/lopcodes.h
new file mode 100644
index 0000000000..41224d6ee1
--- /dev/null
+++ b/src/luajit/lopcodes.h
@@ -0,0 +1,268 @@
+/*
+** $Id: lopcodes.h,v 1.125.1.1 2007/12/27 13:02:25 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_OP 0
+#define POS_A (POS_OP + SIZE_OP)
+#define POS_C (POS_A + SIZE_A)
+#define POS_B (POS_C + SIZE_C)
+#define POS_Bx POS_C
+
+
+/*
+** limits for opcode arguments.
+** we use (signed) int to manipulate most arguments,
+** so they must fit in LUAI_BITSINT-1 bits (-1 for sign)
+*/
+#if SIZE_Bx < LUAI_BITSINT-1
+#define MAXARG_Bx ((1<<SIZE_Bx)-1)
+#define MAXARG_sBx (MAXARG_Bx>>1) /* `sBx' is signed */
+#else
+#define MAXARG_Bx MAX_INT
+#define MAXARG_sBx MAX_INT
+#endif
+
+
+#define MAXARG_A ((1<<SIZE_A)-1)
+#define MAXARG_B ((1<<SIZE_B)-1)
+#define MAXARG_C ((1<<SIZE_C)-1)
+
+
+/* creates a mask with `n' 1 bits at position `p' */
+#define MASK1(n,p) ((~((~(Instruction)0)<<n))<<p)
+
+/* creates a mask with `n' 0 bits at position `p' */
+#define MASK0(n,p) (~MASK1(n,p))
+
+/*
+** the following macros help to manipulate instructions
+*/
+
+#define GET_OPCODE(i) (cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0)))
+#define SET_OPCODE(i,o) ((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \
+ ((cast(Instruction, o)<<POS_OP)&MASK1(SIZE_OP,POS_OP))))
+
+#define GETARG_A(i) (cast(int, ((i)>>POS_A) & MASK1(SIZE_A,0)))
+#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)<<POS_OP) \
+ | (cast(Instruction, a)<<POS_A) \
+ | (cast(Instruction, b)<<POS_B) \
+ | (cast(Instruction, c)<<POS_C))
+
+#define CREATE_ABx(o,a,bc) ((cast(Instruction, o)<<POS_OP) \
+ | (cast(Instruction, a)<<POS_A) \
+ | (cast(Instruction, bc)<<POS_Bx))
+
+
+/*
+** Macros to operate RK indices
+*/
+
+/* this bit 1 means constant (0 means register) */
+#define BITRK (1 << (SIZE_B - 1))
+
+/* test whether value is a constant */
+#define ISK(x) ((x) & BITRK)
+
+/* gets the index of the constant */
+#define INDEXK(r) ((int)(r) & ~BITRK)
+
+#define MAXINDEXRK (BITRK - 1)
+
+/* code a constant index as a RK value */
+#define RKASK(x) ((x) | BITRK)
+
+
+/*
+** invalid register that fits in 8 bits
+*/
+#define NO_REG MAXARG_A
+
+
+/*
+** R(x) - register
+** Kst(x) - constant (in constant table)
+** RK(x) == if ISK(x) then Kst(INDEXK(x)) else R(x)
+*/
+
+
+/*
+** grep "ORDER OP" if you change these enums
+*/
+
+typedef enum {
+/*----------------------------------------------------------------------
+name args description
+------------------------------------------------------------------------*/
+OP_MOVE,/* A B R(A) := R(B) */
+OP_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_MOD,/* 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_LEN,/* A B R(A) := length of 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 C if not (R(A) <=> C) then pc++ */
+OP_TESTSET,/* A B C if (R(B) <=> C) then R(A) := R(B) else pc++ */
+
+OP_CALL,/* A B C R(A), ... ,R(A+C-2) := R(A)(R(A+1), ... ,R(A+B-1)) */
+OP_TAILCALL,/* A B C return R(A)(R(A+1), ... ,R(A+B-1)) */
+OP_RETURN,/* A B return R(A), ... ,R(A+B-2) (see note) */
+
+OP_FORLOOP,/* A sBx R(A)+=R(A+2);
+ if R(A) <?= R(A+1) then { pc+=sBx; R(A+3)=R(A) }*/
+OP_FORPREP,/* A sBx R(A)-=R(A+2); pc+=sBx */
+
+OP_TFORLOOP,/* A C R(A+3), ... ,R(A+2+C) := R(A)(R(A+1), R(A+2));
+ if R(A+3) ~= nil then R(A+2)=R(A+3) else pc++ */
+OP_SETLIST,/* A B C R(A)[(C-1)*FPF+i] := R(A+i), 1 <= i <= B */
+
+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)) */
+
+OP_VARARG/* A B R(A), R(A+1), ..., R(A+B-1) = vararg */
+} OpCode;
+
+
+#define NUM_OPCODES (cast(int, OP_VARARG) + 1)
+
+
+
+/*===========================================================================
+ Notes:
+ (*) 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'.
+
+ (*) In OP_VARARG, if (B == 0) then use actual number of varargs and
+ set top (like in OP_CALL with C == 0).
+
+ (*) In OP_RETURN, if (B == 0) then return up to `top'
+
+ (*) In OP_SETLIST, if (B == 0) then B = `top';
+ if (C == 0) then next `instruction' is real C
+
+ (*) For comparisons, A specifies what condition the test should accept
+ (true or false).
+
+ (*) All `skips' (pc++) assume that next instruction is a jump
+===========================================================================*/
+
+
+/*
+** masks for instruction properties. The format is:
+** bits 0-1: op mode
+** bits 2-3: C arg mode
+** bits 4-5: B arg mode
+** bit 6: instruction set register A
+** bit 7: operator is a test
+*/
+
+enum OpArgMask {
+ OpArgN, /* argument is not used */
+ OpArgU, /* argument is used */
+ OpArgR, /* argument is a register or a jump offset */
+ OpArgK /* argument is a constant or register/constant */
+};
+
+LUAI_DATA const lu_byte luaP_opmodes[NUM_OPCODES];
+
+#define getOpMode(m) (cast(enum OpMode, luaP_opmodes[m] & 3))
+#define getBMode(m) (cast(enum OpArgMask, (luaP_opmodes[m] >> 4) & 3))
+#define getCMode(m) (cast(enum OpArgMask, (luaP_opmodes[m] >> 2) & 3))
+#define testAMode(m) (luaP_opmodes[m] & (1 << 6))
+#define testTMode(m) (luaP_opmodes[m] & (1 << 7))
+
+
+LUAI_DATA const char *const luaP_opnames[NUM_OPCODES+1]; /* opcode names */
+
+
+/* number of list items to accumulate before a SETLIST instruction */
+#define LFIELDS_PER_FLUSH 50
+
+
+#endif
diff --git a/src/luajit/loslib.c b/src/luajit/loslib.c
new file mode 100644
index 0000000000..01a02a28c1
--- /dev/null
+++ b/src/luajit/loslib.c
@@ -0,0 +1,244 @@
+/*
+** $Id: loslib.c,v 1.19.1.3 2008/01/18 16:38:18 roberto Exp $
+** Standard Operating System library
+** See Copyright Notice in lua.h
+*/
+
+
+#include <errno.h>
+#include <locale.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+
+#define loslib_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+static int os_pushresult (lua_State *L, int i, const char *filename) {
+ int en = errno; /* calls to Lua API may change this value */
+ if (i) {
+ lua_pushboolean(L, 1);
+ return 1;
+ }
+ else {
+ lua_pushnil(L);
+ lua_pushfstring(L, "%s: %s", filename, strerror(en));
+ lua_pushinteger(L, en);
+ return 3;
+ }
+}
+
+
+static int os_execute (lua_State *L) {
+ lua_pushinteger(L, system(luaL_optstring(L, 1, NULL)));
+ return 1;
+}
+
+
+static int os_remove (lua_State *L) {
+ const char *filename = luaL_checkstring(L, 1);
+ return os_pushresult(L, remove(filename) == 0, filename);
+}
+
+
+static int os_rename (lua_State *L) {
+ const char *fromname = luaL_checkstring(L, 1);
+ const char *toname = luaL_checkstring(L, 2);
+ return os_pushresult(L, rename(fromname, toname) == 0, fromname);
+}
+
+
+static int os_tmpname (lua_State *L) {
+ char buff[LUA_TMPNAMBUFSIZE];
+ int err;
+ lua_tmpnam(buff, err);
+ if (err)
+ return luaL_error(L, "unable to generate a unique filename");
+ lua_pushstring(L, buff);
+ return 1;
+}
+
+
+static int os_getenv (lua_State *L) {
+ lua_pushstring(L, getenv(luaL_checkstring(L, 1))); /* if NULL push nil */
+ return 1;
+}
+
+
+static int os_clock (lua_State *L) {
+ lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC);
+ return 1;
+}
+
+
+/*
+** {======================================================
+** Time/Date operations
+** { year=%Y, month=%m, day=%d, hour=%H, min=%M, sec=%S,
+** wday=%w+1, yday=%j, isdst=? }
+** =======================================================
+*/
+
+static void setfield (lua_State *L, const char *key, int value) {
+ lua_pushinteger(L, value);
+ lua_setfield(L, -2, key);
+}
+
+static void setboolfield (lua_State *L, const char *key, int value) {
+ if (value < 0) /* undefined? */
+ return; /* does not set field */
+ lua_pushboolean(L, value);
+ lua_setfield(L, -2, key);
+}
+
+static int getboolfield (lua_State *L, const char *key) {
+ int res;
+ lua_getfield(L, -1, key);
+ res = lua_isnil(L, -1) ? -1 : lua_toboolean(L, -1);
+ lua_pop(L, 1);
+ return res;
+}
+
+
+static int getfield (lua_State *L, const char *key, int d) {
+ int res;
+ lua_getfield(L, -1, key);
+ if (lua_isnumber(L, -1))
+ res = (int)lua_tointeger(L, -1);
+ else {
+ if (d < 0)
+ return luaL_error(L, "field " LUA_QS " missing in date table", key);
+ res = d;
+ }
+ lua_pop(L, 1);
+ return res;
+}
+
+
+static int os_date (lua_State *L) {
+ const char *s = luaL_optstring(L, 1, "%c");
+ time_t t = luaL_opt(L, (time_t)luaL_checknumber, 2, time(NULL));
+ struct tm *stm;
+ 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_createtable(L, 0, 9); /* 9 = number of fields */
+ 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 cc[3];
+ luaL_Buffer b;
+ cc[0] = '%'; cc[2] = '\0';
+ luaL_buffinit(L, &b);
+ for (; *s; s++) {
+ if (*s != '%' || *(s + 1) == '\0') /* no conversion specifier? */
+ luaL_addchar(&b, *s);
+ else {
+ size_t reslen;
+ char buff[200]; /* should be big enough for any conversion result */
+ cc[1] = *(++s);
+ reslen = strftime(buff, sizeof(buff), cc, stm);
+ luaL_addlstring(&b, buff, reslen);
+ }
+ }
+ luaL_pushresult(&b);
+ }
+ return 1;
+}
+
+
+static int os_time (lua_State *L) {
+ time_t t;
+ if (lua_isnoneornil(L, 1)) /* called without args? */
+ t = time(NULL); /* get current time */
+ else {
+ struct tm ts;
+ luaL_checktype(L, 1, LUA_TTABLE);
+ lua_settop(L, 1); /* make sure table is at the top */
+ ts.tm_sec = getfield(L, "sec", 0);
+ ts.tm_min = getfield(L, "min", 0);
+ ts.tm_hour = getfield(L, "hour", 12);
+ ts.tm_mday = getfield(L, "day", -1);
+ ts.tm_mon = getfield(L, "month", -1) - 1;
+ ts.tm_year = getfield(L, "year", -1) - 1900;
+ ts.tm_isdst = getboolfield(L, "isdst");
+ t = mktime(&ts);
+ }
+ if (t == (time_t)(-1))
+ lua_pushnil(L);
+ else
+ lua_pushnumber(L, (lua_Number)t);
+ return 1;
+}
+
+
+static int os_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 os_setlocale (lua_State *L) {
+ static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY,
+ LC_NUMERIC, LC_TIME};
+ static const char *const catnames[] = {"all", "collate", "ctype", "monetary",
+ "numeric", "time", NULL};
+ const char *l = luaL_optstring(L, 1, NULL);
+ int op = luaL_checkoption(L, 2, "all", catnames);
+ lua_pushstring(L, setlocale(cat[op], l));
+ return 1;
+}
+
+
+static int os_exit (lua_State *L) {
+ exit(luaL_optint(L, 1, EXIT_SUCCESS));
+ return 0; /* to avoid warnings */
+}
+
+static const luaL_Reg syslib[] = {
+ {"clock", os_clock},
+ {"date", os_date},
+ {"difftime", os_difftime},
+ {"execute", os_execute},
+ {"exit", os_exit},
+ {"getenv", os_getenv},
+ {"remove", os_remove},
+ {"rename", os_rename},
+ {"setlocale", os_setlocale},
+ {"time", os_time},
+ {"tmpname", os_tmpname},
+ {NULL, NULL}
+};
+
+/* }====================================================== */
+
+
+
+LUALIB_API int luaopen_os (lua_State *L) {
+ luaL_register(L, LUA_OSLIBNAME, syslib);
+ return 1;
+}
+
diff --git a/src/luajit/lparser.c b/src/luajit/lparser.c
new file mode 100644
index 0000000000..1e2a9a88b7
--- /dev/null
+++ b/src/luajit/lparser.c
@@ -0,0 +1,1339 @@
+/*
+** $Id: lparser.c,v 2.42.1.3 2007/12/28 15:32:23 roberto Exp $
+** Lua Parser
+** See Copyright Notice in lua.h
+*/
+
+
+#include <string.h>
+
+#define lparser_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lcode.h"
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "llex.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lparser.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+
+
+
+#define hasmultret(k) ((k) == VCALL || (k) == VVARARG)
+
+#define getlocvar(fs, i) ((fs)->f->locvars[(fs)->actvar[i]])
+
+#define luaY_checklimit(fs,v,l,m) if ((v)>(l)) errorlimit(fs,l,m)
+
+
+/*
+** nodes for block list (list of active blocks)
+*/
+typedef struct BlockCnt {
+ struct BlockCnt *previous; /* chain */
+ int breaklist; /* list of jumps out of this loop */
+ lu_byte nactvar; /* # active locals outside the breakable structure */
+ lu_byte upval; /* true if some variable in the block is an upvalue */
+ lu_byte 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 anchor_token (LexState *ls) {
+ if (ls->t.token == TK_NAME || ls->t.token == TK_STRING) {
+ TString *ts = ls->t.seminfo.ts;
+ luaX_newstring(ls, getstr(ts), ts->tsv.len);
+ }
+}
+
+
+static void error_expected (LexState *ls, int token) {
+ luaX_syntaxerror(ls,
+ luaO_pushfstring(ls->L, LUA_QS " expected", luaX_token2str(ls, token)));
+}
+
+
+static void errorlimit (FuncState *fs, int limit, const char *what) {
+ const char *msg = (fs->f->linedefined == 0) ?
+ luaO_pushfstring(fs->L, "main function has more than %d %s", limit, what) :
+ luaO_pushfstring(fs->L, "function at line %d has more than %d %s",
+ fs->f->linedefined, limit, what);
+ luaX_lexerror(fs->ls, msg, 0);
+}
+
+
+static int testnext (LexState *ls, int c) {
+ if (ls->t.token == c) {
+ luaX_next(ls);
+ return 1;
+ }
+ else return 0;
+}
+
+
+static void check (LexState *ls, int c) {
+ if (ls->t.token != c)
+ error_expected(ls, c);
+}
+
+static void checknext (LexState *ls, int c) {
+ check(ls, c);
+ luaX_next(ls);
+}
+
+
+#define check_condition(ls,c,msg) { if (!(c)) luaX_syntaxerror(ls, msg); }
+
+
+
+static void check_match (LexState *ls, int what, int who, int where) {
+ if (!testnext(ls, what)) {
+ if (where == ls->linenumber)
+ error_expected(ls, what);
+ else {
+ luaX_syntaxerror(ls, luaO_pushfstring(ls->L,
+ LUA_QS " expected (to close " LUA_QS " at line %d)",
+ luaX_token2str(ls, what), luaX_token2str(ls, who), where));
+ }
+ }
+}
+
+
+static TString *str_checkname (LexState *ls) {
+ TString *ts;
+ check(ls, TK_NAME);
+ ts = ls->t.seminfo.ts;
+ luaX_next(ls);
+ return ts;
+}
+
+
+static void init_exp (expdesc *e, expkind k, int i) {
+ e->f = e->t = NO_JUMP;
+ e->k = k;
+ e->u.s.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 registerlocalvar (LexState *ls, TString *varname) {
+ FuncState *fs = ls->fs;
+ Proto *f = fs->f;
+ int oldsize = f->sizelocvars;
+ luaM_growvector(ls->L, f->locvars, fs->nlocvars, f->sizelocvars,
+ LocVar, SHRT_MAX, "too many local variables");
+ while (oldsize < f->sizelocvars) f->locvars[oldsize++].varname = NULL;
+ f->locvars[fs->nlocvars].varname = varname;
+ luaC_objbarrier(ls->L, f, varname);
+ return fs->nlocvars++;
+}
+
+
+#define new_localvarliteral(ls,v,n) \
+ new_localvar(ls, luaX_newstring(ls, "" v, (sizeof(v)/sizeof(char))-1), n)
+
+
+static void new_localvar (LexState *ls, TString *name, int n) {
+ FuncState *fs = ls->fs;
+ luaY_checklimit(fs, fs->nactvar+n+1, LUAI_MAXVARS, "local variables");
+ fs->actvar[fs->nactvar+n] = cast(unsigned short, registerlocalvar(ls, name));
+}
+
+
+static void adjustlocalvars (LexState *ls, int nvars) {
+ FuncState *fs = ls->fs;
+ fs->nactvar = cast_byte(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 int indexupvalue (FuncState *fs, TString *name, expdesc *v) {
+ int i;
+ Proto *f = fs->f;
+ int oldsize = f->sizeupvalues;
+ for (i=0; i<f->nups; i++) {
+ if (fs->upvalues[i].k == v->k && fs->upvalues[i].info == v->u.s.info) {
+ lua_assert(f->upvalues[i] == name);
+ return i;
+ }
+ }
+ /* new one */
+ luaY_checklimit(fs, f->nups + 1, LUAI_MAXUPVALUES, "upvalues");
+ luaM_growvector(fs->L, f->upvalues, f->nups, f->sizeupvalues,
+ TString *, MAX_INT, "");
+ while (oldsize < f->sizeupvalues) f->upvalues[oldsize++] = NULL;
+ f->upvalues[f->nups] = name;
+ luaC_objbarrier(fs->L, f, name);
+ lua_assert(v->k == VLOCAL || v->k == VUPVAL);
+ fs->upvalues[f->nups].k = cast_byte(v->k);
+ fs->upvalues[f->nups].info = cast_byte(v->u.s.info);
+ 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 int 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 */
+ return VGLOBAL;
+ }
+ 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 */
+ return VLOCAL;
+ }
+ else { /* not found at current level; try upper one */
+ if (singlevaraux(fs->prev, n, var, 0) == VGLOBAL)
+ return VGLOBAL;
+ var->u.s.info = indexupvalue(fs, n, var); /* else was LOCAL or UPVAL */
+ var->k = VUPVAL; /* upvalue in this level */
+ return VUPVAL;
+ }
+ }
+}
+
+
+static void singlevar (LexState *ls, expdesc *var) {
+ TString *varname = str_checkname(ls);
+ FuncState *fs = ls->fs;
+ if (singlevaraux(fs, varname, var, 1) == VGLOBAL)
+ var->u.s.info = luaK_stringK(fs, varname); /* info points to global name */
+}
+
+
+static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) {
+ FuncState *fs = ls->fs;
+ int extra = nvars - nexps;
+ if (hasmultret(e->k)) {
+ extra++; /* includes call itself */
+ if (extra < 0) extra = 0;
+ luaK_setreturns(fs, e, extra); /* last exp. provides the difference */
+ if (extra > 1) luaK_reserveregs(fs, extra-1);
+ }
+ 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 enterlevel (LexState *ls) {
+ if (++ls->L->nCcalls > LUAI_MAXCCALLS)
+ luaX_lexerror(ls, "chunk has too many syntax levels", 0);
+}
+
+
+#define leavelevel(ls) ((ls)->L->nCcalls--)
+
+
+static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte 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);
+ /* a block either controls scope or breaks (never both) */
+ lua_assert(!bl->isbreakable || !bl->upval);
+ 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 oldsize = f->sizep;
+ int i;
+ luaM_growvector(ls->L, f->p, fs->np, f->sizep, Proto *,
+ MAXARG_Bx, "constant table overflow");
+ while (oldsize < f->sizep) f->p[oldsize++] = NULL;
+ f->p[fs->np++] = func->f;
+ luaC_objbarrier(ls->L, f, 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) {
+ lua_State *L = ls->L;
+ Proto *f = luaF_newproto(L);
+ fs->f = f;
+ fs->prev = ls->fs; /* linked list of funcstates */
+ fs->ls = ls;
+ fs->L = L;
+ ls->fs = fs;
+ fs->pc = 0;
+ fs->lasttarget = -1;
+ fs->jpc = NO_JUMP;
+ fs->freereg = 0;
+ fs->nk = 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 */
+ fs->h = luaH_new(L, 0, 0);
+ /* anchor table of constants and prototype (to avoid being collected) */
+ sethvalue2s(L, L->top, fs->h);
+ incr_top(L);
+ setptvalue2s(L, L->top, f);
+ incr_top(L);
+}
+
+
+static void close_func (LexState *ls) {
+ lua_State *L = ls->L;
+ FuncState *fs = ls->fs;
+ Proto *f = fs->f;
+ removevars(ls, 0);
+ luaK_ret(fs, 0, 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, TValue);
+ 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;
+ L->top -= 2; /* remove table and prototype from the stack */
+ /* last token read was anchored in defunct function; must reanchor it */
+ if (fs) anchor_token(ls);
+}
+
+
+Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, const char *name) {
+ struct LexState lexstate;
+ struct FuncState funcstate;
+ lexstate.buff = buff;
+ luaX_setinput(L, &lexstate, z, luaS_new(L, name));
+ open_func(&lexstate, &funcstate);
+ funcstate.f->is_vararg = VARARG_ISVARARG; /* main func. is always vararg */
+ luaX_next(&lexstate); /* read first token */
+ chunk(&lexstate);
+ check(&lexstate, TK_EOS);
+ close_func(&lexstate);
+ lua_assert(funcstate.prev == NULL);
+ lua_assert(funcstate.f->nups == 0);
+ lua_assert(lexstate.fs == NULL);
+ return funcstate.f;
+}
+
+
+
+/*============================================================*/
+/* GRAMMAR RULES */
+/*============================================================*/
+
+
+static void field (LexState *ls, expdesc *v) {
+ /* field -> ['.' | ':'] NAME */
+ FuncState *fs = ls->fs;
+ expdesc key;
+ luaK_exp2anyreg(fs, v);
+ luaX_next(ls); /* skip the dot or colon */
+ checkname(ls, &key);
+ luaK_indexed(fs, v, &key);
+}
+
+
+static void yindex (LexState *ls, expdesc *v) {
+ /* index -> '[' expr ']' */
+ luaX_next(ls); /* skip the '[' */
+ expr(ls, v);
+ luaK_exp2val(ls->fs, v);
+ checknext(ls, ']');
+}
+
+
+/*
+** {======================================================================
+** Rules for Constructors
+** =======================================================================
+*/
+
+
+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;
+ int rkkey;
+ if (ls->t.token == TK_NAME) {
+ luaY_checklimit(fs, cc->nh, MAX_INT, "items in a constructor");
+ checkname(ls, &key);
+ }
+ else /* ls->t.token == '[' */
+ yindex(ls, &key);
+ cc->nh++;
+ checknext(ls, '=');
+ rkkey = luaK_exp2RK(fs, &key);
+ expr(ls, &val);
+ luaK_codeABC(fs, OP_SETTABLE, cc->t->u.s.info, rkkey, 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_setlist(fs, cc->t->u.s.info, cc->na, cc->tostore); /* flush */
+ cc->tostore = 0; /* no more items pending */
+ }
+}
+
+
+static void lastlistfield (FuncState *fs, struct ConsControl *cc) {
+ if (cc->tostore == 0) return;
+ if (hasmultret(cc->v.k)) {
+ luaK_setmultret(fs, &cc->v);
+ luaK_setlist(fs, cc->t->u.s.info, cc->na, LUA_MULTRET);
+ cc->na--; /* do not count last expression (unknown number of elements) */
+ }
+ else {
+ if (cc->v.k != VVOID)
+ luaK_exp2nextreg(fs, &cc->v);
+ luaK_setlist(fs, cc->t->u.s.info, cc->na, cc->tostore);
+ }
+}
+
+
+static void listfield (LexState *ls, struct ConsControl *cc) {
+ expr(ls, &cc->v);
+ luaY_checklimit(ls->fs, cc->na, MAX_INT, "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) */
+ checknext(ls, '{');
+ do {
+ lua_assert(cc.v.k == VVOID || cc.tostore > 0);
+ if (ls->t.token == '}') break;
+ closelistfield(fs, &cc);
+ switch(ls->t.token) {
+ case TK_NAME: { /* may be listfields or recfields */
+ luaX_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_int2fb(cc.nh)); /* set initial table size */
+}
+
+/* }====================================================================== */
+
+
+
+static void parlist (LexState *ls) {
+ /* parlist -> [ param { `,' param } ] */
+ FuncState *fs = ls->fs;
+ Proto *f = fs->f;
+ int nparams = 0;
+ f->is_vararg = 0;
+ if (ls->t.token != ')') { /* is `parlist' not empty? */
+ do {
+ switch (ls->t.token) {
+ case TK_NAME: { /* param -> NAME */
+ new_localvar(ls, str_checkname(ls), nparams++);
+ break;
+ }
+ case TK_DOTS: { /* param -> `...' */
+ luaX_next(ls);
+#if defined(LUA_COMPAT_VARARG)
+ /* use `arg' as default name */
+ new_localvarliteral(ls, "arg", nparams++);
+ f->is_vararg = VARARG_HASARG | VARARG_NEEDSARG;
+#endif
+ f->is_vararg |= VARARG_ISVARARG;
+ break;
+ }
+ default: luaX_syntaxerror(ls, "<name> or " LUA_QL("...") " expected");
+ }
+ } while (!f->is_vararg && testnext(ls, ','));
+ }
+ adjustlocalvars(ls, nparams);
+ f->numparams = cast_byte(fs->nactvar - (f->is_vararg & VARARG_HASARG));
+ luaK_reserveregs(fs, fs->nactvar); /* reserve register for parameters */
+}
+
+
+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;
+ checknext(ls, '(');
+ if (needself) {
+ new_localvarliteral(ls, "self", 0);
+ adjustlocalvars(ls, 1);
+ }
+ parlist(ls);
+ checknext(ls, ')');
+ chunk(ls);
+ new_fs.f->lastlinedefined = ls->linenumber;
+ 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)");
+ luaX_next(ls);
+ if (ls->t.token == ')') /* arg list is empty? */
+ args.k = VVOID;
+ else {
+ explist1(ls, &args);
+ luaK_setmultret(fs, &args);
+ }
+ check_match(ls, ')', '(', line);
+ break;
+ }
+ case '{': { /* funcargs -> constructor */
+ constructor(ls, &args);
+ break;
+ }
+ case TK_STRING: { /* funcargs -> STRING */
+ codestring(ls, &args, ls->t.seminfo.ts);
+ luaX_next(ls); /* must use `seminfo' before `next' */
+ break;
+ }
+ default: {
+ luaX_syntaxerror(ls, "function arguments expected");
+ return;
+ }
+ }
+ lua_assert(f->k == VNONRELOC);
+ base = f->u.s.info; /* base register for call */
+ if (hasmultret(args.k))
+ nparams = LUA_MULTRET; /* open call */
+ else {
+ if (args.k != VVOID)
+ luaK_exp2nextreg(fs, &args); /* close last argument */
+ nparams = fs->freereg - (base+1);
+ }
+ init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2));
+ luaK_fixline(fs, line);
+ fs->freereg = base+1; /* call 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;
+ luaX_next(ls);
+ expr(ls, v);
+ check_match(ls, ')', '(', line);
+ luaK_dischargevars(ls->fs, v);
+ return;
+ }
+ case TK_NAME: {
+ singlevar(ls, v);
+ return;
+ }
+ default: {
+ luaX_syntaxerror(ls, "unexpected symbol");
+ 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 */
+ field(ls, v);
+ break;
+ }
+ case '[': { /* `[' exp1 `]' */
+ expdesc key;
+ luaK_exp2anyreg(fs, v);
+ yindex(ls, &key);
+ luaK_indexed(fs, v, &key);
+ break;
+ }
+ case ':': { /* `:' NAME funcargs */
+ expdesc key;
+ luaX_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 | true | false | ... |
+ constructor | FUNCTION body | primaryexp */
+ switch (ls->t.token) {
+ case TK_NUMBER: {
+ init_exp(v, VKNUM, 0);
+ v->u.nval = ls->t.seminfo.r;
+ break;
+ }
+ case TK_STRING: {
+ codestring(ls, v, ls->t.seminfo.ts);
+ break;
+ }
+ case TK_NIL: {
+ init_exp(v, VNIL, 0);
+ break;
+ }
+ case TK_TRUE: {
+ init_exp(v, VTRUE, 0);
+ break;
+ }
+ case TK_FALSE: {
+ init_exp(v, VFALSE, 0);
+ break;
+ }
+ case TK_DOTS: { /* vararg */
+ FuncState *fs = ls->fs;
+ check_condition(ls, fs->f->is_vararg,
+ "cannot use " LUA_QL("...") " outside a vararg function");
+ fs->f->is_vararg &= ~VARARG_NEEDSARG; /* don't need 'arg' */
+ init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 1, 0));
+ break;
+ }
+ case '{': { /* constructor */
+ constructor(ls, v);
+ return;
+ }
+ case TK_FUNCTION: {
+ luaX_next(ls);
+ body(ls, v, 0, ls->linenumber);
+ return;
+ }
+ default: {
+ primaryexp(ls, v);
+ return;
+ }
+ }
+ luaX_next(ls);
+}
+
+
+static UnOpr getunopr (int op) {
+ switch (op) {
+ case TK_NOT: return OPR_NOT;
+ case '-': return OPR_MINUS;
+ case '#': return OPR_LEN;
+ default: return OPR_NOUNOPR;
+ }
+}
+
+
+static BinOpr getbinopr (int op) {
+ switch (op) {
+ case '+': return OPR_ADD;
+ case '-': return OPR_SUB;
+ case '*': return OPR_MUL;
+ case '/': return OPR_DIV;
+ case '%': return OPR_MOD;
+ 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}, {7, 7}, /* `+' `-' `/' `%' */
+ {10, 9}, {5, 4}, /* power and concat (right associative) */
+ {3, 3}, {3, 3}, /* equality and inequality */
+ {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 -> (simpleexp | unop subexpr) { binop subexpr }
+** where `binop' is any binary operator with a priority higher than `limit'
+*/
+static BinOpr subexpr (LexState *ls, expdesc *v, unsigned int limit) {
+ BinOpr op;
+ UnOpr uop;
+ enterlevel(ls);
+ uop = getunopr(ls->t.token);
+ if (uop != OPR_NOUNOPR) {
+ luaX_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 && priority[op].left > limit) {
+ expdesc v2;
+ BinOpr nextop;
+ luaX_next(ls);
+ luaK_infix(ls->fs, op, v);
+ /* read sub-expression with higher priority */
+ nextop = subexpr(ls, &v2, priority[op].right);
+ luaK_posfix(ls->fs, op, v, &v2);
+ op = nextop;
+ }
+ leavelevel(ls);
+ return op; /* return first untreated operator */
+}
+
+
+static void expr (LexState *ls, expdesc *v) {
+ subexpr(ls, v, 0);
+}
+
+/* }==================================================================== */
+
+
+
+/*
+** {======================================================================
+** Rules for Statements
+** =======================================================================
+*/
+
+
+static 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.u.s.info == v->u.s.info) { /* conflict? */
+ conflict = 1;
+ lh->v.u.s.info = extra; /* previous assignment will use safe copy */
+ }
+ if (lh->v.u.s.aux == v->u.s.info) { /* conflict? */
+ conflict = 1;
+ lh->v.u.s.aux = extra; /* previous assignment will use safe copy */
+ }
+ }
+ }
+ if (conflict) {
+ luaK_codeABC(fs, OP_MOVE, fs->freereg, v->u.s.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);
+ luaY_checklimit(ls->fs, nvars, LUAI_MAXCCALLS - ls->L->nCcalls,
+ "variables in assignment");
+ assignment(ls, &nv, nvars+1);
+ }
+ else { /* assignment -> `=' explist1 */
+ int nexps;
+ checknext(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_setoneret(ls->fs, &e); /* close last expression */
+ luaK_storevar(ls->fs, &lh->v, &e);
+ return; /* avoid default */
+ }
+ }
+ init_exp(&e, VNONRELOC, ls->fs->freereg-1); /* default assignment */
+ luaK_storevar(ls->fs, &lh->v, &e);
+}
+
+
+static int cond (LexState *ls) {
+ /* cond -> exp */
+ expdesc v;
+ expr(ls, &v); /* read condition */
+ if (v.k == VNIL) v.k = VFALSE; /* `falses' are all equal here */
+ luaK_goiftrue(ls->fs, &v);
+ return v.f;
+}
+
+
+static void breakstat (LexState *ls) {
+ FuncState *fs = ls->fs;
+ BlockCnt *bl = fs->bl;
+ int upval = 0;
+ 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 void whilestat (LexState *ls, int line) {
+ /* whilestat -> WHILE cond DO block END */
+ FuncState *fs = ls->fs;
+ int whileinit;
+ int condexit;
+ BlockCnt bl;
+ luaX_next(ls); /* skip WHILE */
+ whileinit = luaK_getlabel(fs);
+ condexit = cond(ls);
+ enterblock(fs, &bl, 1);
+ checknext(ls, TK_DO);
+ block(ls);
+ luaK_patchlist(fs, luaK_jump(fs), whileinit);
+ check_match(ls, TK_END, TK_WHILE, line);
+ leaveblock(fs);
+ luaK_patchtohere(fs, condexit); /* false conditions finish the loop */
+}
+
+
+static void repeatstat (LexState *ls, int line) {
+ /* repeatstat -> REPEAT block UNTIL cond */
+ int condexit;
+ FuncState *fs = ls->fs;
+ int repeat_init = luaK_getlabel(fs);
+ BlockCnt bl1, bl2;
+ enterblock(fs, &bl1, 1); /* loop block */
+ enterblock(fs, &bl2, 0); /* scope block */
+ luaX_next(ls); /* skip REPEAT */
+ chunk(ls);
+ check_match(ls, TK_UNTIL, TK_REPEAT, line);
+ condexit = cond(ls); /* read condition (inside scope block) */
+ if (!bl2.upval) { /* no upvalues? */
+ leaveblock(fs); /* finish scope */
+ luaK_patchlist(ls->fs, condexit, repeat_init); /* close the loop */
+ }
+ else { /* complete semantics when there are upvalues */
+ breakstat(ls); /* if condition then break */
+ luaK_patchtohere(ls->fs, condexit); /* else... */
+ leaveblock(fs); /* finish scope... */
+ luaK_patchlist(ls->fs, luaK_jump(fs), repeat_init); /* and repeat */
+ }
+ leaveblock(fs); /* finish loop */
+}
+
+
+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) {
+ /* forbody -> DO block */
+ BlockCnt bl;
+ FuncState *fs = ls->fs;
+ int prep, endfor;
+ adjustlocalvars(ls, 3); /* control variables */
+ checknext(ls, TK_DO);
+ prep = isnum ? luaK_codeAsBx(fs, OP_FORPREP, base, NO_JUMP) : luaK_jump(fs);
+ enterblock(fs, &bl, 0); /* scope for declared variables */
+ adjustlocalvars(ls, nvars);
+ luaK_reserveregs(fs, nvars);
+ block(ls);
+ leaveblock(fs); /* end of scope for declared variables */
+ luaK_patchtohere(fs, prep);
+ endfor = (isnum) ? luaK_codeAsBx(fs, OP_FORLOOP, base, NO_JUMP) :
+ luaK_codeABC(fs, OP_TFORLOOP, base, 0, nvars);
+ luaK_fixline(fs, line); /* pretend that `OP_FOR' starts the loop */
+ luaK_patchlist(fs, (isnum ? endfor : luaK_jump(fs)), prep + 1);
+}
+
+
+static void fornum (LexState *ls, TString *varname, int line) {
+ /* fornum -> NAME = exp1,exp1[,exp1] forbody */
+ FuncState *fs = ls->fs;
+ int base = fs->freereg;
+ new_localvarliteral(ls, "(for index)", 0);
+ new_localvarliteral(ls, "(for limit)", 1);
+ new_localvarliteral(ls, "(for step)", 2);
+ new_localvar(ls, varname, 3);
+ checknext(ls, '=');
+ exp1(ls); /* initial value */
+ checknext(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);
+ }
+ forbody(ls, base, line, 1, 1);
+}
+
+
+static void forlist (LexState *ls, TString *indexname) {
+ /* forlist -> NAME {,NAME} IN explist1 forbody */
+ FuncState *fs = ls->fs;
+ expdesc e;
+ int nvars = 0;
+ int line;
+ int base = fs->freereg;
+ /* create control variables */
+ new_localvarliteral(ls, "(for generator)", nvars++);
+ new_localvarliteral(ls, "(for state)", nvars++);
+ new_localvarliteral(ls, "(for control)", nvars++);
+ /* create declared variables */
+ new_localvar(ls, indexname, nvars++);
+ while (testnext(ls, ','))
+ new_localvar(ls, str_checkname(ls), nvars++);
+ checknext(ls, TK_IN);
+ line = ls->linenumber;
+ adjust_assign(ls, 3, explist1(ls, &e), &e);
+ luaK_checkstack(fs, 3); /* extra space to call generator */
+ forbody(ls, base, line, nvars - 3, 0);
+}
+
+
+static void forstat (LexState *ls, int line) {
+ /* forstat -> FOR (fornum | forlist) END */
+ FuncState *fs = ls->fs;
+ TString *varname;
+ BlockCnt bl;
+ enterblock(fs, &bl, 1); /* scope for loop and control variables */
+ luaX_next(ls); /* skip `for' */
+ varname = str_checkname(ls); /* first variable name */
+ switch (ls->t.token) {
+ case '=': fornum(ls, varname, line); break;
+ case ',': case TK_IN: forlist(ls, varname); break;
+ default: luaX_syntaxerror(ls, LUA_QL("=") " or " LUA_QL("in") " expected");
+ }
+ check_match(ls, TK_END, TK_FOR, line);
+ leaveblock(fs); /* loop scope (`break' jumps to this point) */
+}
+
+
+static int test_then_block (LexState *ls) {
+ /* test_then_block -> [IF | ELSEIF] cond THEN block */
+ int condexit;
+ luaX_next(ls); /* skip IF or ELSEIF */
+ condexit = cond(ls);
+ checknext(ls, TK_THEN);
+ block(ls); /* `then' part */
+ return condexit;
+}
+
+
+static void ifstat (LexState *ls, int line) {
+ /* ifstat -> IF cond THEN block {ELSEIF cond THEN block} [ELSE block] END */
+ FuncState *fs = ls->fs;
+ int flist;
+ int escapelist = NO_JUMP;
+ flist = test_then_block(ls); /* IF cond THEN block */
+ while (ls->t.token == TK_ELSEIF) {
+ luaK_concat(fs, &escapelist, luaK_jump(fs));
+ luaK_patchtohere(fs, flist);
+ flist = test_then_block(ls); /* ELSEIF cond THEN block */
+ }
+ if (ls->t.token == TK_ELSE) {
+ luaK_concat(fs, &escapelist, luaK_jump(fs));
+ luaK_patchtohere(fs, flist);
+ luaX_next(ls); /* skip ELSE (after patch, for correct line info) */
+ block(ls); /* `else' part */
+ }
+ else
+ luaK_concat(fs, &escapelist, flist);
+ 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);
+ while (ls->t.token == '.')
+ field(ls, v);
+ if (ls->t.token == ':') {
+ needself = 1;
+ field(ls, v);
+ }
+ return needself;
+}
+
+
+static void funcstat (LexState *ls, int line) {
+ /* funcstat -> FUNCTION funcname body */
+ int needself;
+ expdesc v, b;
+ luaX_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 */
+ SETARG_C(getcode(fs, &v.v), 1); /* 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 */
+ luaX_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 (hasmultret(e.k)) {
+ luaK_setmultret(fs, &e);
+ if (e.k == VCALL && 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_ret(fs, first, nret);
+}
+
+
+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 */
+ luaX_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 */
+ luaX_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 */
+ luaX_next(ls); /* skip BREAK */
+ 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->f->maxstacksize >= ls->fs->freereg &&
+ ls->fs->freereg >= ls->fs->nactvar);
+ ls->fs->freereg = ls->fs->nactvar; /* free registers */
+ }
+ leavelevel(ls);
+}
+
+/* }====================================================================== */
diff --git a/src/luajit/lparser.h b/src/luajit/lparser.h
new file mode 100644
index 0000000000..18836afd1c
--- /dev/null
+++ b/src/luajit/lparser.h
@@ -0,0 +1,82 @@
+/*
+** $Id: lparser.h,v 1.57.1.1 2007/12/27 13:02:25 roberto Exp $
+** Lua Parser
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lparser_h
+#define lparser_h
+
+#include "llimits.h"
+#include "lobject.h"
+#include "lzio.h"
+
+
+/*
+** Expression descriptor
+*/
+
+typedef enum {
+ VVOID, /* no value */
+ VNIL,
+ VTRUE,
+ VFALSE,
+ VK, /* info = index of constant in `k' */
+ VKNUM, /* nval = numerical value */
+ 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 = instruction pc */
+ VVARARG /* info = instruction pc */
+} expkind;
+
+typedef struct expdesc {
+ expkind k;
+ union {
+ struct { int info, aux; } s;
+ lua_Number nval;
+ } u;
+ int t; /* patch list of `exit when true' */
+ int f; /* patch list of `exit when false' */
+} expdesc;
+
+
+typedef struct upvaldesc {
+ lu_byte k;
+ lu_byte info;
+} upvaldesc;
+
+
+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' */
+ short nlocvars; /* number of elements in `locvars' */
+ lu_byte nactvar; /* number of active local variables */
+ upvaldesc upvalues[LUAI_MAXUPVALUES]; /* upvalues */
+ unsigned short actvar[LUAI_MAXVARS]; /* declared-variable stack */
+} FuncState;
+
+
+LUAI_FUNC Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff,
+ const char *name);
+
+
+#endif
diff --git a/src/luajit/lstate.c b/src/luajit/lstate.c
new file mode 100644
index 0000000000..2bf835bdbf
--- /dev/null
+++ b/src/luajit/lstate.c
@@ -0,0 +1,218 @@
+/*
+** $Id: lstate.c,v 2.36.1.2 2008/01/03 15:20:39 roberto Exp $
+** Global State
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stddef.h>
+
+#define lstate_c
+#define LUA_CORE
+
+#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"
+#include "ljit.h"
+
+
+#define state_size(x) (sizeof(x) + LUAI_EXTRASPACE)
+#define fromstate(l) (cast(lu_byte *, (l)) - LUAI_EXTRASPACE)
+#define tostate(l) (cast(lua_State *, cast(lu_byte *, l) + LUAI_EXTRASPACE))
+
+
+/*
+** Main thread combines a thread state and the global state
+*/
+typedef struct LG {
+ lua_State l;
+ global_State g;
+} LG;
+
+
+
+static void stack_init (lua_State *L1, lua_State *L) {
+ /* initialize CallInfo array */
+ L1->base_ci = luaM_newvector(L, BASIC_CI_SIZE, CallInfo);
+ L1->ci = L1->base_ci;
+ L1->size_ci = BASIC_CI_SIZE;
+ L1->end_ci = L1->base_ci + L1->size_ci - 1;
+ /* initialize stack array */
+ L1->stack = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, TValue);
+ L1->stacksize = BASIC_STACK_SIZE + EXTRA_STACK;
+ L1->top = L1->stack;
+ L1->stack_last = L1->stack+(L1->stacksize - EXTRA_STACK)-1;
+ /* initialize first ci */
+ L1->ci->func = L1->top;
+ setnilvalue(L1->top++); /* `function' entry for this `ci' */
+ L1->base = L1->ci->base = L1->top;
+ L1->ci->top = L1->top + LUA_MINSTACK;
+}
+
+
+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, TValue);
+}
+
+
+/*
+** open parts that may cause memory-allocation errors
+*/
+static void f_luaopen (lua_State *L, void *ud) {
+ global_State *g = G(L);
+ UNUSED(ud);
+ stack_init(L, L); /* init stack */
+ sethvalue(L, gt(L), luaH_new(L, 0, 2)); /* table of globals */
+ sethvalue(L, registry(L), luaH_new(L, 0, 2)); /* 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->totalbytes;
+ luaJIT_initstate(L);
+}
+
+
+static void preinit_state (lua_State *L, global_State *g) {
+ G(L) = g;
+ L->stack = NULL;
+ L->stacksize = 0;
+ L->errorJmp = NULL;
+ L->hook = NULL;
+ L->hookmask = 0;
+ L->basehookcount = 0;
+ L->allowhook = 1;
+ resethookcount(L);
+ L->openupval = NULL;
+ L->size_ci = 0;
+ L->nCcalls = 0;
+ L->status = 0;
+ L->base_ci = L->ci = NULL;
+ L->savedpc = NULL;
+ L->errfunc = 0;
+ setnilvalue(gt(L));
+}
+
+
+static void close_state (lua_State *L) {
+ global_State *g = G(L);
+ luaF_close(L, L->stack); /* close all upvalues for this thread */
+ luaC_freeall(L); /* collect all objects */
+ luaJIT_freestate(L);
+ lua_assert(g->rootgc == obj2gco(L));
+ lua_assert(g->strt.nuse == 0);
+ luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size, TString *);
+ luaZ_freebuffer(L, &g->buff);
+ freestack(L, L);
+ lua_assert(g->totalbytes == sizeof(LG));
+ (*g->frealloc)(g->ud, fromstate(L), state_size(LG), 0);
+}
+
+
+lua_State *luaE_newthread (lua_State *L) {
+ lua_State *L1 = tostate(luaM_malloc(L, state_size(lua_State)));
+ luaC_link(L, obj2gco(L1), LUA_TTHREAD);
+ preinit_state(L1, G(L));
+ stack_init(L1, L); /* init stack */
+ setobj2n(L, gt(L1), gt(L)); /* share table of globals */
+ L1->hookmask = L->hookmask;
+ L1->basehookcount = L->basehookcount;
+ L1->hook = L->hook;
+ resethookcount(L1);
+ lua_assert(iswhite(obj2gco(L1)));
+ 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);
+ luai_userstatefree(L1);
+ freestack(L, L1);
+ luaM_freemem(L, fromstate(L1), state_size(lua_State));
+}
+
+
+LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud) {
+ int i;
+ lua_State *L;
+ global_State *g;
+ void *l = (*f)(ud, NULL, 0, state_size(LG));
+ if (l == NULL) return NULL;
+ L = tostate(l);
+ g = &((LG *)L)->g;
+ L->next = NULL;
+ L->tt = LUA_TTHREAD;
+ g->currentwhite = bit2mask(WHITE0BIT, FIXEDBIT);
+ L->marked = luaC_white(g);
+ set2bits(L->marked, FIXEDBIT, SFIXEDBIT);
+ preinit_state(L, g);
+ g->frealloc = f;
+ g->ud = ud;
+ g->mainthread = L;
+ g->uvhead.u.l.prev = &g->uvhead;
+ g->uvhead.u.l.next = &g->uvhead;
+ g->GCthreshold = 0; /* mark it as unfinished state */
+ g->strt.size = 0;
+ g->strt.nuse = 0;
+ g->strt.hash = NULL;
+ setnilvalue(registry(L));
+ luaZ_initbuffer(L, &g->buff);
+ g->panic = NULL;
+ g->gcstate = GCSpause;
+ g->rootgc = obj2gco(L);
+ g->sweepstrgc = 0;
+ g->sweepgc = &g->rootgc;
+ g->gray = NULL;
+ g->grayagain = NULL;
+ g->weak = NULL;
+ g->tmudata = NULL;
+ g->totalbytes = sizeof(LG);
+ g->gcpause = LUAI_GCPAUSE;
+ g->gcstepmul = LUAI_GCMUL;
+ g->gcdept = 0;
+ g->jit_state = NULL;
+ for (i=0; i<NUM_TAGS; i++) g->mt[i] = NULL;
+ if (luaD_rawrunprotected(L, f_luaopen, NULL) != 0) {
+ /* memory allocation error: free partial state */
+ close_state(L);
+ L = NULL;
+ }
+ else
+ luai_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) {
+ L = G(L)->mainthread; /* only the main thread can be closed */
+ lua_lock(L);
+ luaF_close(L, L->stack); /* close all upvalues for this thread */
+ luaC_separateudata(L, 1); /* 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);
+ luai_userstateclose(L);
+ close_state(L);
+}
+
diff --git a/src/luajit/lstate.h b/src/luajit/lstate.h
new file mode 100644
index 0000000000..ddaa554f78
--- /dev/null
+++ b/src/luajit/lstate.h
@@ -0,0 +1,179 @@
+/*
+** $Id: lstate.h,v 2.24.1.2 2008/01/03 15:20:39 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"
+#ifndef COCO_DISABLE
+#include "lcoco.h"
+#endif
+
+
+
+struct lua_longjmp; /* defined in ldo.c */
+struct jit_State; /* defined in ljit.c */
+typedef int (*luaJIT_GateLJ)(lua_State *L, StkId func, int nresults);
+
+
+/* table of globals */
+#define gt(L) (&L->l_gt)
+
+/* registry */
+#define registry(L) (&G(L)->l_registry)
+
+
+/* extra stack space to handle TM calls and some other extras */
+/* LuaJIT uses more than the default (5) to speed up calls (setnil loop) */
+#define EXTRA_STACK 8
+
+
+#define BASIC_CI_SIZE 8
+
+#define BASIC_STACK_SIZE (2*LUA_MINSTACK)
+
+
+
+typedef struct stringtable {
+ GCObject **hash;
+ lu_int32 nuse; /* number of elements */
+ int size;
+} stringtable;
+
+
+/*
+** informations about a call
+*/
+typedef struct CallInfo {
+ StkId base; /* base for this function */
+ StkId func; /* function index in the stack */
+ StkId top; /* top for this function */
+ const Instruction *savedpc;
+ int nresults; /* expected number of results from this function */
+ int tailcalls; /* number of tail calls lost under this entry */
+} CallInfo;
+
+
+
+#define curr_func(L) (clvalue(L->ci->func))
+#define ci_func(ci) (clvalue((ci)->func))
+#define f_isLua(ci) (!ci_func(ci)->c.isC)
+#define isLua(ci) (ttisfunction((ci)->func) && f_isLua(ci))
+
+
+/*
+** `global state', shared by all threads of this state
+*/
+typedef struct global_State {
+ stringtable strt; /* hash table for strings */
+ lua_Alloc frealloc; /* function to reallocate memory */
+ void *ud; /* auxiliary data to `frealloc' */
+ lu_byte currentwhite;
+ lu_byte gcstate; /* state of garbage collector */
+ int sweepstrgc; /* position of sweep in `strt' */
+ GCObject *rootgc; /* list of all collectable objects */
+ GCObject **sweepgc; /* position of sweep in `rootgc' */
+ GCObject *gray; /* list of gray objects */
+ GCObject *grayagain; /* list of objects to be traversed atomically */
+ GCObject *weak; /* list of weak tables (to be cleared) */
+ GCObject *tmudata; /* last element of list of userdata to be GC */
+ Mbuffer buff; /* temporary buffer for string concatentation */
+ lu_mem GCthreshold;
+ lu_mem totalbytes; /* number of bytes currently allocated */
+ lu_mem estimate; /* an estimate of number of bytes actually in use */
+ lu_mem gcdept; /* how much GC is `behind schedule' */
+ int gcpause; /* size of pause between successive GCs */
+ int gcstepmul; /* GC `granularity' */
+ lua_CFunction panic; /* to be called in unprotected errors */
+ TValue l_registry;
+ struct lua_State *mainthread;
+ UpVal uvhead; /* head of double-linked list of all open upvalues */
+ struct Table *mt[NUM_TAGS]; /* metatables for basic types */
+ TString *tmname[TM_N]; /* array with tag-method names */
+ /* LuaJIT extensions */
+ struct jit_State *jit_state; /* JIT state */
+ luaJIT_GateLJ jit_gateLJ; /* Lua -> JIT gate */
+ lua_CFunction jit_gateJL; /* JIT -> Lua callgate */
+ lua_CFunction jit_gateJC; /* JIT -> C callgate */
+} global_State;
+
+
+/*
+** `per thread' state
+*/
+struct lua_State {
+ CommonHeader;
+ lu_byte status;
+ 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 */
+ const Instruction *savedpc; /* `savedpc' of current function */
+ StkId stack_last; /* last free slot in the stack */
+ StkId stack; /* stack base */
+ CallInfo *end_ci; /* points after end of ci array*/
+ CallInfo *base_ci; /* array of CallInfo's */
+ int stacksize;
+ int size_ci; /* size of array `base_ci' */
+ unsigned short nCcalls; /* number of nested C calls */
+ lu_byte hookmask;
+ lu_byte allowhook;
+ int basehookcount;
+ int hookcount;
+ lua_Hook hook;
+ TValue l_gt; /* table of globals */
+ TValue env; /* temporary place for environments */
+ 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 rawgco2ts(o) check_exp((o)->gch.tt == LUA_TSTRING, &((o)->ts))
+#define gco2ts(o) (&rawgco2ts(o)->tsv)
+#define rawgco2u(o) check_exp((o)->gch.tt == LUA_TUSERDATA, &((o)->u))
+#define gco2u(o) (&rawgco2u(o)->uv)
+#define gco2cl(o) check_exp((o)->gch.tt == LUA_TFUNCTION, &((o)->cl))
+#define gco2h(o) check_exp((o)->gch.tt == LUA_TTABLE, &((o)->h))
+#define gco2p(o) check_exp((o)->gch.tt == LUA_TPROTO, &((o)->p))
+#define gco2uv(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 gco2th(o) check_exp((o)->gch.tt == LUA_TTHREAD, &((o)->th))
+
+/* macro to convert any Lua object into a GCObject */
+#define obj2gco(v) (cast(GCObject *, (v)))
+
+
+LUAI_FUNC lua_State *luaE_newthread (lua_State *L);
+LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1);
+
+#endif
+
diff --git a/src/luajit/lstring.c b/src/luajit/lstring.c
new file mode 100644
index 0000000000..49113151cc
--- /dev/null
+++ b/src/luajit/lstring.c
@@ -0,0 +1,111 @@
+/*
+** $Id: lstring.c,v 2.8.1.1 2007/12/27 13:02:25 roberto Exp $
+** String table (keeps all strings handled by Lua)
+** See Copyright Notice in lua.h
+*/
+
+
+#include <string.h>
+
+#define lstring_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+#include "lstring.h"
+
+
+
+void luaS_resize (lua_State *L, int newsize) {
+ GCObject **newhash;
+ stringtable *tb;
+ int i;
+ if (G(L)->gcstate == GCSsweepstring)
+ return; /* cannot resize during GC traverse */
+ newhash = luaM_newvector(L, newsize, GCObject *);
+ tb = &G(L)->strt;
+ 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 */
+ unsigned int h = gco2ts(p)->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,
+ unsigned int h) {
+ TString *ts;
+ stringtable *tb;
+ if (l+1 > (MAX_SIZET - sizeof(TString))/sizeof(char))
+ luaM_toobig(L);
+ ts = cast(TString *, luaM_malloc(L, (l+1)*sizeof(char)+sizeof(TString)));
+ ts->tsv.len = l;
+ ts->tsv.hash = h;
+ ts->tsv.marked = luaC_white(G(L));
+ 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] = obj2gco(ts);
+ tb->nuse++;
+ if (tb->nuse > cast(lu_int32, 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;
+ unsigned int h = cast(unsigned int, 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)+cast(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 = rawgco2ts(o);
+ if (ts->tsv.len == l && (memcmp(str, getstr(ts), l) == 0)) {
+ /* string may be dead */
+ if (isdead(G(L), o)) changewhite(o);
+ return ts;
+ }
+ }
+ return newlstr(L, str, l, h); /* not found */
+}
+
+
+Udata *luaS_newudata (lua_State *L, size_t s, Table *e) {
+ Udata *u;
+ if (s > MAX_SIZET - sizeof(Udata))
+ luaM_toobig(L);
+ u = cast(Udata *, luaM_malloc(L, s + sizeof(Udata)));
+ u->uv.marked = luaC_white(G(L)); /* is not finalized */
+ u->uv.tt = LUA_TUSERDATA;
+ u->uv.len = s;
+ u->uv.metatable = NULL;
+ u->uv.env = e;
+ /* chain it on udata list (after main thread) */
+ u->uv.next = G(L)->mainthread->next;
+ G(L)->mainthread->next = obj2gco(u);
+ return u;
+}
+
diff --git a/src/luajit/lstring.h b/src/luajit/lstring.h
new file mode 100644
index 0000000000..73a2ff8b38
--- /dev/null
+++ b/src/luajit/lstring.h
@@ -0,0 +1,31 @@
+/*
+** $Id: lstring.h,v 1.43.1.1 2007/12/27 13:02:25 roberto Exp $
+** String table (keep all strings handled by Lua)
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lstring_h
+#define lstring_h
+
+
+#include "lgc.h"
+#include "lobject.h"
+#include "lstate.h"
+
+
+#define sizestring(s) (sizeof(union TString)+((s)->len+1)*sizeof(char))
+
+#define sizeudata(u) (sizeof(union Udata)+(u)->len)
+
+#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) l_setbit((s)->tsv.marked, FIXEDBIT)
+
+LUAI_FUNC void luaS_resize (lua_State *L, int newsize);
+LUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, Table *e);
+LUAI_FUNC TString *luaS_newlstr (lua_State *L, const char *str, size_t l);
+
+
+#endif
diff --git a/src/luajit/lstrlib.c b/src/luajit/lstrlib.c
new file mode 100644
index 0000000000..1b4763d4ee
--- /dev/null
+++ b/src/luajit/lstrlib.c
@@ -0,0 +1,869 @@
+/*
+** $Id: lstrlib.c,v 1.132.1.4 2008/07/11 17:27:21 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
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+/* macro to `unsign' a character */
+#define uchar(c) ((unsigned char)(c))
+
+
+
+static int str_len (lua_State *L) {
+ size_t l;
+ luaL_checklstring(L, 1, &l);
+ lua_pushinteger(L, l);
+ return 1;
+}
+
+
+static ptrdiff_t posrelat (ptrdiff_t pos, size_t len) {
+ /* relative string position: negative means back from end */
+ if (pos < 0) pos += (ptrdiff_t)len + 1;
+ return (pos >= 0) ? pos : 0;
+}
+
+
+static int str_sub (lua_State *L) {
+ size_t l;
+ const char *s = luaL_checklstring(L, 1, &l);
+ ptrdiff_t start = posrelat(luaL_checkinteger(L, 2), l);
+ ptrdiff_t end = posrelat(luaL_optinteger(L, 3, -1), l);
+ if (start < 1) start = 1;
+ if (end > (ptrdiff_t)l) end = (ptrdiff_t)l;
+ if (start <= end)
+ lua_pushlstring(L, s+start-1, end-start+1);
+ else lua_pushliteral(L, "");
+ return 1;
+}
+
+
+static int str_reverse (lua_State *L) {
+ size_t l;
+ luaL_Buffer b;
+ const char *s = luaL_checklstring(L, 1, &l);
+ luaL_buffinit(L, &b);
+ while (l--) luaL_addchar(&b, s[l]);
+ luaL_pushresult(&b);
+ 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_addchar(&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_addchar(&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);
+ ptrdiff_t posi = posrelat(luaL_optinteger(L, 2, 1), l);
+ ptrdiff_t pose = posrelat(luaL_optinteger(L, 3, posi), l);
+ int n, i;
+ if (posi <= 0) posi = 1;
+ if ((size_t)pose > l) pose = l;
+ if (posi > pose) return 0; /* empty interval; return no values */
+ n = (int)(pose - posi + 1);
+ if (posi + n <= pose) /* overflow? */
+ luaL_error(L, "string slice too long");
+ luaL_checkstack(L, n, "string slice too long");
+ for (i=0; i<n; i++)
+ lua_pushinteger(L, uchar(s[posi+i-1]));
+ return n;
+}
+
+
+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_addchar(&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 0;
+}
+
+
+static int str_dump (lua_State *L) {
+ luaL_Buffer b;
+ luaL_checktype(L, 1, LUA_TFUNCTION);
+ lua_settop(L, 1);
+ luaL_buffinit(L,&b);
+ if (lua_dump(L, writer, &b) != 0)
+ luaL_error(L, "unable to dump given function");
+ luaL_pushresult(&b);
+ return 1;
+}
+
+
+
+/*
+** {======================================================
+** PATTERN MATCHING
+** =======================================================
+*/
+
+
+#define CAP_UNFINISHED (-1)
+#define CAP_POSITION (-2)
+
+typedef struct MatchState {
+ const char *src_init; /* init of source string */
+ const char *src_end; /* end (`\0') of source string */
+ lua_State *L;
+ int level; /* total number of captures (finished or unfinished) */
+ struct {
+ const char *init;
+ ptrdiff_t len;
+ } capture[LUA_MAXCAPTURES];
+} MatchState;
+
+
+#define L_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 *classend (MatchState *ms, const char *p) {
+ switch (*p++) {
+ case L_ESC: {
+ if (*p == '\0')
+ luaL_error(ms->L, "malformed pattern (ends with " LUA_QL("%%") ")");
+ return p+1;
+ }
+ case '[': {
+ if (*p == '^') p++;
+ do { /* look for a `]' */
+ if (*p == '\0')
+ luaL_error(ms->L, "malformed pattern (missing " LUA_QL("]") ")");
+ if (*(p++) == L_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 == L_ESC) {
+ p++;
+ if (match_class(c, uchar(*p)))
+ return sig;
+ }
+ else if ((*(p+1) == '-') && (p+2 < ec)) {
+ p+=2;
+ if (uchar(*(p-2)) <= c && c <= uchar(*p))
+ return sig;
+ }
+ else if (uchar(*p) == c) return sig;
+ }
+ return !sig;
+}
+
+
+static int singlematch (int c, const char *p, const char *ep) {
+ switch (*p) {
+ case '.': return 1; /* matches any char */
+ case L_ESC: return match_class(c, uchar(*(p+1)));
+ case '[': return matchbracketclass(c, p, ep-1);
+ default: return (uchar(*p) == c);
+ }
+}
+
+
+static const char *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) {
+ ptrdiff_t i = 0; /* counts maximum expand for item */
+ while ((s+i)<ms->src_end && 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 && 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 >= LUA_MAXCAPTURES) luaL_error(ms->L, "too many captures");
+ ms->capture[level].init = s;
+ ms->capture[level].len = what;
+ ms->level = level+1;
+ if ((res=match(ms, s, p)) == NULL) /* match failed? */
+ ms->level--; /* undo capture */
+ return res;
+}
+
+
+static const char *end_capture (MatchState *ms, const char *s,
+ const char *p) {
+ int l = capture_to_close(ms);
+ const char *res;
+ ms->capture[l].len = s - ms->capture[l].init; /* close capture */
+ if ((res = match(ms, s, p)) == NULL) /* match failed? */
+ ms->capture[l].len = CAP_UNFINISHED; /* undo capture */
+ return res;
+}
+
+
+static const char *match_capture (MatchState *ms, const char *s, int l) {
+ size_t len;
+ l = check_capture(ms, l);
+ len = ms->capture[l].len;
+ if ((size_t)(ms->src_end-s) >= len &&
+ memcmp(ms->capture[l].init, s, len) == 0)
+ return s+len;
+ else return NULL;
+}
+
+
+static const char *match (MatchState *ms, const char *s, const char *p) {
+ 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 L_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 " LUA_QL("[") " after "
+ LUA_QL("%%f") " in pattern");
+ ep = classend(ms, p); /* points to what is next */
+ previous = (s == ms->src_init) ? '\0' : *(s-1);
+ if (matchbracketclass(uchar(previous), p, ep-1) ||
+ !matchbracketclass(uchar(*s), p, ep-1)) 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, uchar(*(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 = classend(ms, p); /* points to what is next */
+ int m = s<ms->src_end && 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, const char *s,
+ const char *e) {
+ if (i >= ms->level) {
+ if (i == 0) /* ms->level == 0, too */
+ lua_pushlstring(ms->L, s, e - s); /* add whole match */
+ else
+ luaL_error(ms->L, "invalid capture index");
+ }
+ else {
+ ptrdiff_t l = ms->capture[i].len;
+ if (l == CAP_UNFINISHED) luaL_error(ms->L, "unfinished capture");
+ if (l == CAP_POSITION)
+ lua_pushinteger(ms->L, 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;
+ int nlevels = (ms->level == 0 && s) ? 1 : ms->level;
+ luaL_checkstack(ms->L, nlevels, "too many captures");
+ for (i = 0; i < nlevels; i++)
+ push_onecapture(ms, i, s, e);
+ return nlevels; /* number of strings pushed */
+}
+
+
+static int str_find_aux (lua_State *L, int find) {
+ size_t l1, l2;
+ const char *s = luaL_checklstring(L, 1, &l1);
+ const char *p = luaL_checklstring(L, 2, &l2);
+ ptrdiff_t init = posrelat(luaL_optinteger(L, 3, 1), l1) - 1;
+ if (init < 0) init = 0;
+ else if ((size_t)(init) > l1) init = (ptrdiff_t)l1;
+ if (find && (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_pushinteger(L, s2-s+1);
+ lua_pushinteger(L, 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) {
+ if (find) {
+ lua_pushinteger(L, s1-s+1); /* start */
+ lua_pushinteger(L, res-s); /* end */
+ return push_captures(&ms, NULL, 0) + 2;
+ }
+ else
+ return push_captures(&ms, s1, res);
+ }
+ } while (s1++ < ms.src_end && !anchor);
+ }
+ lua_pushnil(L); /* not found */
+ return 1;
+}
+
+
+static int str_find (lua_State *L) {
+ return str_find_aux(L, 1);
+}
+
+
+static int str_match (lua_State *L) {
+ return str_find_aux(L, 0);
+}
+
+
+static int gmatch_aux (lua_State *L) {
+ MatchState ms;
+ size_t ls;
+ const char *s = lua_tolstring(L, lua_upvalueindex(1), &ls);
+ 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_tointeger(L, lua_upvalueindex(3));
+ src <= ms.src_end;
+ src++) {
+ const char *e;
+ ms.level = 0;
+ if ((e = match(&ms, src, p)) != NULL) {
+ lua_Integer newstart = e-s;
+ if (e == src) newstart++; /* empty match? go at least one position */
+ lua_pushinteger(L, newstart);
+ lua_replace(L, lua_upvalueindex(3));
+ return push_captures(&ms, src, e);
+ }
+ }
+ return 0; /* not found */
+}
+
+
+static int gmatch (lua_State *L) {
+ luaL_checkstring(L, 1);
+ luaL_checkstring(L, 2);
+ lua_settop(L, 2);
+ lua_pushinteger(L, 0);
+ lua_pushcclosure(L, gmatch_aux, 3);
+ return 1;
+}
+
+
+static int gfind_nodef (lua_State *L) {
+ return luaL_error(L, LUA_QL("string.gfind") " was renamed to "
+ LUA_QL("string.gmatch"));
+}
+
+
+static void add_s (MatchState *ms, luaL_Buffer *b, const char *s,
+ const char *e) {
+ size_t l, i;
+ const char *news = lua_tolstring(ms->L, 3, &l);
+ for (i = 0; i < l; i++) {
+ if (news[i] != L_ESC)
+ luaL_addchar(b, news[i]);
+ else {
+ i++; /* skip ESC */
+ if (!isdigit(uchar(news[i])))
+ luaL_addchar(b, news[i]);
+ else if (news[i] == '0')
+ luaL_addlstring(b, s, e - s);
+ else {
+ push_onecapture(ms, news[i] - '1', s, e);
+ luaL_addvalue(b); /* add capture to accumulated result */
+ }
+ }
+ }
+}
+
+
+static void add_value (MatchState *ms, luaL_Buffer *b, const char *s,
+ const char *e) {
+ lua_State *L = ms->L;
+ switch (lua_type(L, 3)) {
+ case LUA_TNUMBER:
+ case LUA_TSTRING: {
+ add_s(ms, b, s, e);
+ return;
+ }
+ case LUA_TFUNCTION: {
+ int n;
+ lua_pushvalue(L, 3);
+ n = push_captures(ms, s, e);
+ lua_call(L, n, 1);
+ break;
+ }
+ case LUA_TTABLE: {
+ push_onecapture(ms, 0, s, e);
+ lua_gettable(L, 3);
+ break;
+ }
+ }
+ if (!lua_toboolean(L, -1)) { /* nil or false? */
+ lua_pop(L, 1);
+ lua_pushlstring(L, s, e - s); /* keep original text */
+ }
+ else if (!lua_isstring(L, -1))
+ luaL_error(L, "invalid replacement value (a %s)", luaL_typename(L, -1));
+ luaL_addvalue(b); /* add result to accumulator */
+}
+
+
+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 tr = lua_type(L, 3);
+ 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, tr == LUA_TNUMBER || tr == LUA_TSTRING ||
+ tr == LUA_TFUNCTION || tr == LUA_TTABLE, 3,
+ "string/function/table 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_value(&ms, &b, src, e);
+ }
+ if (e && e>src) /* non empty match? */
+ src = e; /* skip it */
+ else if (src < ms.src_end)
+ luaL_addchar(&b, *src++);
+ else break;
+ if (anchor) break;
+ }
+ luaL_addlstring(&b, src, ms.src_end-src);
+ luaL_pushresult(&b);
+ lua_pushinteger(L, n); /* number of substitutions */
+ return 2;
+}
+
+/* }====================================================== */
+
+
+/* maximum size of each formatted item (> len(format('%99.99f', -1e308))) */
+#define MAX_ITEM 512
+/* valid flags in a format specification */
+#define FLAGS "-+ #0"
+/*
+** maximum size of each format specification (such as '%-099.99d')
+** (+10 accounts for %99.99x plus margin of error)
+*/
+#define MAX_FORMAT (sizeof(FLAGS) + sizeof(LUA_INTFRMLEN) + 10)
+
+
+static void addquoted (lua_State *L, luaL_Buffer *b, int arg) {
+ size_t l;
+ const char *s = luaL_checklstring(L, arg, &l);
+ luaL_addchar(b, '"');
+ while (l--) {
+ switch (*s) {
+ case '"': case '\\': case '\n': {
+ luaL_addchar(b, '\\');
+ luaL_addchar(b, *s);
+ break;
+ }
+ case '\r': {
+ luaL_addlstring(b, "\\r", 2);
+ break;
+ }
+ case '\0': {
+ luaL_addlstring(b, "\\000", 4);
+ break;
+ }
+ default: {
+ luaL_addchar(b, *s);
+ break;
+ }
+ }
+ s++;
+ }
+ luaL_addchar(b, '"');
+}
+
+static const char *scanformat (lua_State *L, const char *strfrmt, char *form) {
+ const char *p = strfrmt;
+ while (*p != '\0' && strchr(FLAGS, *p) != NULL) p++; /* skip flags */
+ if ((size_t)(p - strfrmt) >= sizeof(FLAGS))
+ luaL_error(L, "invalid format (repeated flags)");
+ if (isdigit(uchar(*p))) p++; /* skip width */
+ if (isdigit(uchar(*p))) p++; /* (2 digits at most) */
+ if (*p == '.') {
+ p++;
+ 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)");
+ *(form++) = '%';
+ strncpy(form, strfrmt, p - strfrmt + 1);
+ form += p - strfrmt + 1;
+ *form = '\0';
+ return p;
+}
+
+
+static void addintlen (char *form) {
+ size_t l = strlen(form);
+ char spec = form[l - 1];
+ strcpy(form + l - 1, LUA_INTFRMLEN);
+ form[l + sizeof(LUA_INTFRMLEN) - 2] = spec;
+ form[l + sizeof(LUA_INTFRMLEN) - 1] = '\0';
+}
+
+
+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 != L_ESC)
+ luaL_addchar(&b, *strfrmt++);
+ else if (*++strfrmt == L_ESC)
+ luaL_addchar(&b, *strfrmt++); /* %% */
+ else { /* format item */
+ char form[MAX_FORMAT]; /* to store the format (`%...') */
+ char buff[MAX_ITEM]; /* to store the formatted item */
+ arg++;
+ strfrmt = scanformat(L, strfrmt, form);
+ switch (*strfrmt++) {
+ case 'c': {
+ sprintf(buff, form, (int)luaL_checknumber(L, arg));
+ break;
+ }
+ case 'd': case 'i': {
+ addintlen(form);
+ sprintf(buff, form, (LUA_INTFRM_T)luaL_checknumber(L, arg));
+ break;
+ }
+ case 'o': case 'u': case 'x': case 'X': {
+ addintlen(form);
+ sprintf(buff, form, (unsigned LUA_INTFRM_T)luaL_checknumber(L, arg));
+ break;
+ }
+ case 'e': case 'E': case 'f':
+ case 'g': case 'G': {
+ sprintf(buff, form, (double)luaL_checknumber(L, arg));
+ break;
+ }
+ case 'q': {
+ 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 (!strchr(form, '.') && 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 " LUA_QL("%%%c") " to "
+ LUA_QL("format"), *(strfrmt - 1));
+ }
+ }
+ luaL_addlstring(&b, buff, strlen(buff));
+ }
+ }
+ luaL_pushresult(&b);
+ return 1;
+}
+
+
+static const luaL_Reg strlib[] = {
+ {"byte", str_byte},
+ {"char", str_char},
+ {"dump", str_dump},
+ {"find", str_find},
+ {"format", str_format},
+ {"gfind", gfind_nodef},
+ {"gmatch", gmatch},
+ {"gsub", str_gsub},
+ {"len", str_len},
+ {"lower", str_lower},
+ {"match", str_match},
+ {"rep", str_rep},
+ {"reverse", str_reverse},
+ {"sub", str_sub},
+ {"upper", str_upper},
+ {NULL, NULL}
+};
+
+
+static void createmetatable (lua_State *L) {
+ lua_createtable(L, 0, 1); /* create metatable for strings */
+ lua_pushliteral(L, ""); /* dummy string */
+ lua_pushvalue(L, -2);
+ lua_setmetatable(L, -2); /* set string metatable */
+ lua_pop(L, 1); /* pop dummy string */
+ lua_pushvalue(L, -2); /* string library... */
+ lua_setfield(L, -2, "__index"); /* ...is the __index metamethod */
+ lua_pop(L, 1); /* pop metatable */
+}
+
+
+/*
+** Open string library
+*/
+LUALIB_API int luaopen_string (lua_State *L) {
+ luaL_register(L, LUA_STRLIBNAME, strlib);
+#if defined(LUA_COMPAT_GFIND)
+ lua_getfield(L, -1, "gmatch");
+ lua_setfield(L, -2, "gfind");
+#endif
+ createmetatable(L);
+ return 1;
+}
+
diff --git a/src/luajit/ltable.c b/src/luajit/ltable.c
new file mode 100644
index 0000000000..6b226ad479
--- /dev/null
+++ b/src/luajit/ltable.c
@@ -0,0 +1,588 @@
+/*
+** $Id: ltable.c,v 2.32.1.2 2007/12/28 15:32:23 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.
+** Hence even when the load factor reaches 100%, performance remains good.
+*/
+
+#include <math.h>
+#include <string.h>
+
+#define ltable_c
+#define LUA_CORE
+
+#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 LUAI_BITSINT > 26
+#define MAXBITS 26
+#else
+#define MAXBITS (LUAI_BITSINT-2)
+#endif
+
+#define MAXASIZE (1 << MAXBITS)
+
+
+#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))
+
+
+
+#define dummynode (&dummynode_)
+
+static const Node dummynode_ = {
+ {{NULL}, LUA_TNIL}, /* value */
+ {{{NULL}, LUA_TNIL, NULL}} /* key */
+};
+
+
+/*
+** hash for lua_Numbers
+*/
+static Node *hashnum (const Table *t, lua_Number n) {
+ unsigned int a[numints];
+ int i;
+ if (luai_numeq(n, 0)) /* avoid problems with -0 */
+ return gnode(t, 0);
+ memcpy(a, &n, sizeof(a));
+ for (i = 1; i < numints; i++) a[0] += a[i];
+ return hashmod(t, a[0]);
+}
+
+
+
+/*
+** returns the `main' position of an element in a table (that is, the index
+** of its hash value)
+*/
+static Node *mainposition (const Table *t, const TValue *key) {
+ switch (ttype(key)) {
+ case LUA_TNUMBER:
+ return hashnum(t, nvalue(key));
+ case LUA_TSTRING:
+ return hashstr(t, rawtsvalue(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 TValue *key) {
+ if (ttisnumber(key)) {
+ lua_Number n = nvalue(key);
+ int k;
+ lua_number2int(k, n);
+ if (luai_numeq(cast_num(k), n))
+ 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 of a traversal is signalled by -1.
+*/
+static int findindex (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 {
+ Node *n = mainposition(t, key);
+ do { /* check whether `key' is somewhere in the chain */
+ /* key may be dead already, but it is ok to use it in `next' */
+ if (luaO_rawequalObj(key2tval(n), key) ||
+ (ttype(gkey(n)) == LUA_TDEADKEY && iscollectable(key) &&
+ gcvalue(gkey(n)) == gcvalue(key))) {
+ i = cast_int(n - gnode(t, 0)); /* key index in hash table */
+ /* hash elements are numbered after array ones */
+ return i + t->sizearray;
+ }
+ else n = gnext(n);
+ } while (n);
+ luaG_runerror(L, "invalid key to " LUA_QL("next")); /* key not found */
+ return 0; /* to avoid warnings */
+ }
+}
+
+
+int luaH_next (lua_State *L, Table *t, StkId key) {
+ int i = findindex(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_num(i+1));
+ setobj2s(L, 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(L, key, key2tval(gnode(t, i)));
+ setobj2s(L, key+1, gval(gnode(t, i)));
+ return 1;
+ }
+ }
+ return 0; /* no more elements */
+}
+
+
+/*
+** {=============================================================
+** Rehash
+** ==============================================================
+*/
+
+
+static int computesizes (int nums[], int *narray) {
+ int i;
+ int twotoi; /* 2^i */
+ int a = 0; /* number of elements smaller than 2^i */
+ int na = 0; /* number of elements to go to array part */
+ int n = 0; /* optimal size for array part */
+ for (i = 0, twotoi = 1; twotoi/2 < *narray; i++, twotoi *= 2) {
+ if (nums[i] > 0) {
+ a += nums[i];
+ if (a > twotoi/2) { /* more than half elements present? */
+ n = twotoi; /* optimal size (till now) */
+ na = a; /* all elements smaller than n will go to array part */
+ }
+ }
+ if (a == *narray) break; /* all elements already counted */
+ }
+ *narray = n;
+ lua_assert(*narray/2 <= na && na <= *narray);
+ return na;
+}
+
+
+static int countint (const TValue *key, int *nums) {
+ int k = arrayindex(key);
+ if (0 < k && k <= MAXASIZE) { /* is `key' an appropriate array index? */
+ nums[ceillog2(k)]++; /* count as such */
+ return 1;
+ }
+ else
+ return 0;
+}
+
+
+static int numusearray (const Table *t, int *nums) {
+ int lg;
+ int ttlg; /* 2^lg */
+ int ause = 0; /* summation of `nums' */
+ int i = 1; /* count to traverse all array keys */
+ for (lg=0, ttlg=1; lg<=MAXBITS; lg++, ttlg*=2) { /* for each slice */
+ int lc = 0; /* counter */
+ int lim = ttlg;
+ if (lim > t->sizearray) {
+ lim = t->sizearray; /* adjust upper limit */
+ if (i > lim)
+ break; /* no more elements to count */
+ }
+ /* count elements in range (2^(lg-1), 2^lg] */
+ for (; i <= lim; i++) {
+ if (!ttisnil(&t->array[i-1]))
+ lc++;
+ }
+ nums[lg] += lc;
+ ause += lc;
+ }
+ return ause;
+}
+
+
+static int numusehash (const Table *t, int *nums, int *pnasize) {
+ int totaluse = 0; /* total number of elements */
+ int ause = 0; /* summation of `nums' */
+ int i = sizenode(t);
+ while (i--) {
+ Node *n = &t->node[i];
+ if (!ttisnil(gval(n))) {
+ ause += countint(key2tval(n), nums);
+ totaluse++;
+ }
+ }
+ *pnasize += ause;
+ return totaluse;
+}
+
+
+static void setarrayvector (lua_State *L, Table *t, int size) {
+ int i;
+ luaM_reallocvector(L, t->array, t->sizearray, size, TValue);
+ for (i=t->sizearray; i<size; i++)
+ setnilvalue(&t->array[i]);
+ t->sizearray = size;
+}
+
+
+static void setnodevector (lua_State *L, Table *t, int size) {
+ int lsize;
+ if (size == 0) { /* no elements to hash part? */
+ t->node = cast(Node *, dummynode); /* use common `dummynode' */
+ lsize = 0;
+ }
+ else {
+ int i;
+ lsize = ceillog2(size);
+ if (lsize > MAXBITS)
+ luaG_runerror(L, "table overflow");
+ size = twoto(lsize);
+ t->node = luaM_newvector(L, size, Node);
+ for (i=0; i<size; i++) {
+ Node *n = gnode(t, i);
+ gnext(n) = NULL;
+ setnilvalue(gkey(n));
+ setnilvalue(gval(n));
+ }
+ }
+ t->lsizenode = cast_byte(lsize);
+ t->lastfree = gnode(t, size); /* all positions are free */
+}
+
+
+static void resize (lua_State *L, Table *t, int nasize, int nhsize) {
+ int i;
+ int oldasize = t->sizearray;
+ int oldhsize = t->lsizenode;
+ Node *nold = t->node; /* save old hash ... */
+ if (nasize > oldasize) /* array part must grow? */
+ setarrayvector(L, t, nasize);
+ /* create new hash part with appropriate size */
+ setnodevector(L, t, nhsize);
+ if (nasize < oldasize) { /* array part must shrink? */
+ t->sizearray = nasize;
+ /* re-insert elements from vanishing slice */
+ for (i=nasize; i<oldasize; i++) {
+ if (!ttisnil(&t->array[i]))
+ setobjt2t(L, luaH_setnum(L, t, i+1), &t->array[i]);
+ }
+ /* shrink array */
+ luaM_reallocvector(L, t->array, oldasize, nasize, TValue);
+ }
+ /* re-insert elements from hash part */
+ for (i = twoto(oldhsize) - 1; i >= 0; i--) {
+ Node *old = nold+i;
+ if (!ttisnil(gval(old)))
+ setobjt2t(L, luaH_set(L, t, key2tval(old)), gval(old));
+ }
+ if (nold != dummynode)
+ luaM_freearray(L, nold, twoto(oldhsize), Node); /* free old array */
+}
+
+
+void luaH_resizearray (lua_State *L, Table *t, int nasize) {
+ int nsize = (t->node == dummynode) ? 0 : sizenode(t);
+ resize(L, t, nasize, nsize);
+}
+
+
+static void rehash (lua_State *L, Table *t, const TValue *ek) {
+ int nasize, na;
+ int nums[MAXBITS+1]; /* nums[i] = number of keys between 2^(i-1) and 2^i */
+ int i;
+ int totaluse;
+ for (i=0; i<=MAXBITS; i++) nums[i] = 0; /* reset counts */
+ nasize = numusearray(t, nums); /* count keys in array part */
+ totaluse = nasize; /* all those keys are integer keys */
+ totaluse += numusehash(t, nums, &nasize); /* count keys in hash part */
+ /* count extra key */
+ nasize += countint(ek, nums);
+ totaluse++;
+ /* compute new size for array part */
+ na = computesizes(nums, &nasize);
+ /* resize the table to new computed sizes */
+ resize(L, t, nasize, totaluse - na);
+}
+
+
+
+/*
+** }=============================================================
+*/
+
+
+Table *luaH_new (lua_State *L, int narray, int nhash) {
+ Table *t = luaM_new(L, Table);
+ luaC_link(L, obj2gco(t), LUA_TTABLE);
+ t->metatable = NULL;
+ t->flags = cast_byte(~0);
+ /* temporary values (kept only if some malloc fails) */
+ t->array = NULL;
+ t->sizearray = 0;
+ t->lsizenode = 0;
+ t->node = cast(Node *, dummynode);
+ setarrayvector(L, t, narray);
+ setnodevector(L, t, nhash);
+ return t;
+}
+
+
+void luaH_free (lua_State *L, Table *t) {
+ if (t->node != dummynode)
+ luaM_freearray(L, t->node, sizenode(t), Node);
+ luaM_freearray(L, t->array, t->sizearray, TValue);
+ luaM_free(L, t);
+}
+
+
+static Node *getfreepos (Table *t) {
+ while (t->lastfree-- > t->node) {
+ if (ttisnil(gkey(t->lastfree)))
+ return t->lastfree;
+ }
+ return NULL; /* could not find a free place */
+}
+
+
+
+/*
+** inserts a new key into a hash table; first, check whether key's main
+** position is free. If not, check whether colliding node is in its main
+** position or not: if it is not, move colliding node to an empty place and
+** put new key in its main position; otherwise (colliding node is in its main
+** position), new key goes to an empty position.
+*/
+TValue *luaH_newkey (lua_State *L, Table *t, const TValue *key) {
+ Node *mp = mainposition(t, key);
+ if (!ttisnil(gval(mp)) || mp == dummynode) {
+ Node *othern;
+ Node *n = getfreepos(t); /* get a free place */
+ if (n == NULL) { /* cannot find a free place? */
+ rehash(L, t, key); /* grow table */
+ return luaH_set(L, t, key); /* re-insert key into grown table */
+ }
+ lua_assert(n != dummynode);
+ othern = mainposition(t, key2tval(mp));
+ if (othern != mp) { /* is colliding node out of its main position? */
+ /* yes; move colliding node into free position */
+ while (gnext(othern) != mp) othern = gnext(othern); /* find previous */
+ gnext(othern) = n; /* redo the chain with `n' in place of `mp' */
+ *n = *mp; /* copy colliding node into free pos. (mp->next also goes) */
+ gnext(mp) = NULL; /* now `mp' is free */
+ setnilvalue(gval(mp));
+ }
+ else { /* colliding node is in its own main position */
+ /* new node will go into free position */
+ gnext(n) = gnext(mp); /* chain new position */
+ gnext(mp) = n;
+ mp = n;
+ }
+ }
+ gkey(mp)->value = key->value; gkey(mp)->tt = key->tt;
+ luaC_barriert(L, t, key);
+ lua_assert(ttisnil(gval(mp)));
+ return gval(mp);
+}
+
+
+/*
+** search function for integers
+*/
+const TValue *luaH_getnum (Table *t, int key) {
+ /* (1 <= key && key <= t->sizearray) */
+ if (cast(unsigned int, key-1) < cast(unsigned int, t->sizearray))
+ return &t->array[key-1];
+ else {
+ lua_Number nk = cast_num(key);
+ Node *n = hashnum(t, nk);
+ do { /* check whether `key' is somewhere in the chain */
+ if (ttisnumber(gkey(n)) && luai_numeq(nvalue(gkey(n)), nk))
+ return gval(n); /* that's it */
+ else n = gnext(n);
+ } while (n);
+ return luaO_nilobject;
+ }
+}
+
+
+/*
+** search function for strings
+*/
+const TValue *luaH_getstr (Table *t, TString *key) {
+ Node *n = hashstr(t, key);
+ do { /* check whether `key' is somewhere in the chain */
+ if (ttisstring(gkey(n)) && rawtsvalue(gkey(n)) == key)
+ return gval(n); /* that's it */
+ else n = gnext(n);
+ } while (n);
+ return luaO_nilobject;
+}
+
+
+/*
+** main search function
+*/
+const TValue *luaH_get (Table *t, const TValue *key) {
+ switch (ttype(key)) {
+ case LUA_TNIL: return luaO_nilobject;
+ case LUA_TSTRING: return luaH_getstr(t, rawtsvalue(key));
+ case LUA_TNUMBER: {
+ int k;
+ lua_Number n = nvalue(key);
+ lua_number2int(k, n);
+ if (luai_numeq(cast_num(k), nvalue(key))) /* index is int? */
+ return luaH_getnum(t, k); /* use specialized version */
+ /* else go through */
+ }
+ default: {
+ Node *n = mainposition(t, key);
+ do { /* check whether `key' is somewhere in the chain */
+ if (luaO_rawequalObj(key2tval(n), key))
+ return gval(n); /* that's it */
+ else n = gnext(n);
+ } while (n);
+ return luaO_nilobject;
+ }
+ }
+}
+
+
+TValue *luaH_set (lua_State *L, Table *t, const TValue *key) {
+ const TValue *p = luaH_get(t, key);
+ t->flags = 0;
+ if (p != luaO_nilobject)
+ return cast(TValue *, p);
+ else {
+ if (ttisnil(key)) luaG_runerror(L, "table index is nil");
+ else if (ttisnumber(key) && luai_numisnan(nvalue(key)))
+ luaG_runerror(L, "table index is NaN");
+ return luaH_newkey(L, t, key);
+ }
+}
+
+
+TValue *luaH_setnum (lua_State *L, Table *t, int key) {
+ const TValue *p = luaH_getnum(t, key);
+ if (p != luaO_nilobject)
+ return cast(TValue *, p);
+ else {
+ TValue k;
+ setnvalue(&k, cast_num(key));
+ return luaH_newkey(L, t, &k);
+ }
+}
+
+
+TValue *luaH_setstr (lua_State *L, Table *t, TString *key) {
+ const TValue *p = luaH_getstr(t, key);
+ if (p != luaO_nilobject)
+ return cast(TValue *, p);
+ else {
+ TValue k;
+ setsvalue(L, &k, key);
+ return luaH_newkey(L, t, &k);
+ }
+}
+
+
+static int unbound_search (Table *t, unsigned int j) {
+ unsigned int i = j; /* i is zero or a present index */
+ j++;
+ /* find `i' and `j' such that i is present and j is not */
+ while (!ttisnil(luaH_getnum(t, j))) {
+ i = j;
+ j *= 2;
+ if (j > cast(unsigned int, MAX_INT)) { /* overflow? */
+ /* table was built with bad purposes: resort to linear search */
+ i = 1;
+ while (!ttisnil(luaH_getnum(t, i))) i++;
+ return i - 1;
+ }
+ }
+ /* now do a binary search between them */
+ while (j - i > 1) {
+ unsigned int m = (i+j)/2;
+ if (ttisnil(luaH_getnum(t, m))) j = m;
+ else i = m;
+ }
+ return i;
+}
+
+
+/*
+** Try to find a boundary in table `t'. A `boundary' is an integer index
+** such that t[i] is non-nil and t[i+1] is nil (and 0 if t[1] is nil).
+*/
+int luaH_getn (Table *t) {
+ unsigned int j = t->sizearray;
+ if (j > 0 && ttisnil(&t->array[j - 1])) {
+ /* there is a boundary in the array part: (binary) search for it */
+ unsigned int i = 0;
+ while (j - i > 1) {
+ unsigned int m = (i+j)/2;
+ if (ttisnil(&t->array[m - 1])) j = m;
+ else i = m;
+ }
+ return i;
+ }
+ /* else must find a boundary in hash part */
+ else if (t->node == dummynode) /* hash part is empty? */
+ return j; /* that is easy... */
+ else return unbound_search(t, j);
+}
+
+
+
+#if defined(LUA_DEBUG)
+
+Node *luaH_mainposition (const Table *t, const TValue *key) {
+ return mainposition(t, key);
+}
+
+int luaH_isdummy (Node *n) { return n == dummynode; }
+
+#endif
diff --git a/src/luajit/ltable.h b/src/luajit/ltable.h
new file mode 100644
index 0000000000..a61c981307
--- /dev/null
+++ b/src/luajit/ltable.h
@@ -0,0 +1,41 @@
+/*
+** $Id: ltable.h,v 2.10.1.1 2007/12/27 13:02:25 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.nk)
+#define gval(n) (&(n)->i_val)
+#define gnext(n) ((n)->i_key.nk.next)
+
+#define key2tval(n) (&(n)->i_key.tvk)
+
+
+LUAI_FUNC const TValue *luaH_getnum (Table *t, int key);
+LUAI_FUNC TValue *luaH_setnum (lua_State *L, Table *t, int key);
+LUAI_FUNC const TValue *luaH_getstr (Table *t, TString *key);
+LUAI_FUNC TValue *luaH_setstr (lua_State *L, Table *t, TString *key);
+LUAI_FUNC const TValue *luaH_get (Table *t, const TValue *key);
+LUAI_FUNC TValue *luaH_set (lua_State *L, Table *t, const TValue *key);
+LUAI_FUNC Table *luaH_new (lua_State *L, int narray, int lnhash);
+LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, int nasize);
+LUAI_FUNC void luaH_free (lua_State *L, Table *t);
+LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key);
+LUAI_FUNC int luaH_getn (Table *t);
+LUAI_FUNC TValue *luaH_newkey (lua_State *L, Table *t, const TValue *key);
+
+
+#if defined(LUA_DEBUG)
+LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key);
+LUAI_FUNC int luaH_isdummy (Node *n);
+#endif
+
+
+#endif
diff --git a/src/luajit/ltablib.c b/src/luajit/ltablib.c
new file mode 100644
index 0000000000..b6d9cb4ac7
--- /dev/null
+++ b/src/luajit/ltablib.c
@@ -0,0 +1,287 @@
+/*
+** $Id: ltablib.c,v 1.38.1.3 2008/02/14 16:46:58 roberto Exp $
+** Library for Table Manipulation
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stddef.h>
+
+#define ltablib_c
+#define LUA_LIB
+
+#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 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_pushinteger(L, 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 foreach (lua_State *L) {
+ luaL_checktype(L, 1, LUA_TTABLE);
+ luaL_checktype(L, 2, LUA_TFUNCTION);
+ lua_pushnil(L); /* first key */
+ while (lua_next(L, 1)) {
+ 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 */
+ }
+ return 0;
+}
+
+
+static int maxn (lua_State *L) {
+ lua_Number max = 0;
+ luaL_checktype(L, 1, LUA_TTABLE);
+ lua_pushnil(L); /* first key */
+ while (lua_next(L, 1)) {
+ lua_pop(L, 1); /* remove value */
+ if (lua_type(L, -1) == LUA_TNUMBER) {
+ lua_Number v = lua_tonumber(L, -1);
+ if (v > max) max = v;
+ }
+ }
+ lua_pushnumber(L, max);
+ return 1;
+}
+
+
+static int getn (lua_State *L) {
+ lua_pushinteger(L, aux_getn(L, 1));
+ return 1;
+}
+
+
+static int setn (lua_State *L) {
+ luaL_checktype(L, 1, LUA_TTABLE);
+#ifndef luaL_setn
+ luaL_setn(L, 1, luaL_checkint(L, 2));
+#else
+ luaL_error(L, LUA_QL("setn") " is obsolete");
+#endif
+ lua_pushvalue(L, 1);
+ return 1;
+}
+
+
+static int tinsert (lua_State *L) {
+ int e = aux_getn(L, 1) + 1; /* first empty element */
+ int pos; /* where to insert new element */
+ switch (lua_gettop(L)) {
+ case 2: { /* called with only 2 arguments */
+ pos = e; /* insert new element at the end */
+ break;
+ }
+ case 3: {
+ int i;
+ pos = luaL_checkint(L, 2); /* 2nd argument is the position */
+ if (pos > e) e = pos; /* `grow' array if necessary */
+ for (i = e; i > pos; i--) { /* move up elements */
+ lua_rawgeti(L, 1, i-1);
+ lua_rawseti(L, 1, i); /* t[i] = t[i-1] */
+ }
+ break;
+ }
+ default: {
+ return luaL_error(L, "wrong number of arguments to " LUA_QL("insert"));
+ }
+ }
+ luaL_setn(L, 1, e); /* new size */
+ lua_rawseti(L, 1, pos); /* t[pos] = v */
+ return 0;
+}
+
+
+static int tremove (lua_State *L) {
+ int e = aux_getn(L, 1);
+ int pos = luaL_optint(L, 2, e);
+ if (!(1 <= pos && pos <= e)) /* position is outside bounds? */
+ return 0; /* nothing to remove */
+ luaL_setn(L, 1, e - 1); /* t.n = n-1 */
+ lua_rawgeti(L, 1, pos); /* result = t[pos] */
+ for ( ;pos<e; pos++) {
+ lua_rawgeti(L, 1, pos+1);
+ lua_rawseti(L, 1, pos); /* t[pos] = t[pos+1] */
+ }
+ lua_pushnil(L);
+ lua_rawseti(L, 1, e); /* t[e] = nil */
+ return 1;
+}
+
+
+static void addfield (lua_State *L, luaL_Buffer *b, int i) {
+ lua_rawgeti(L, 1, i);
+ if (!lua_isstring(L, -1))
+ luaL_error(L, "invalid value (%s) at index %d in table for "
+ LUA_QL("concat"), luaL_typename(L, -1), i);
+ luaL_addvalue(b);
+}
+
+
+static int tconcat (lua_State *L) {
+ luaL_Buffer b;
+ size_t lsep;
+ int i, last;
+ const char *sep = luaL_optlstring(L, 2, "", &lsep);
+ luaL_checktype(L, 1, LUA_TTABLE);
+ i = luaL_optint(L, 3, 1);
+ last = luaL_opt(L, luaL_checkint, 4, luaL_getn(L, 1));
+ luaL_buffinit(L, &b);
+ for (; i < last; i++) {
+ addfield(L, &b, i);
+ luaL_addlstring(&b, sep, lsep);
+ }
+ if (i == last) /* add last value (if interval was not empty) */
+ addfield(L, &b, i);
+ luaL_pushresult(&b);
+ return 1;
+}
+
+
+
+/*
+** {======================================================
+** 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 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", tconcat},
+ {"foreach", foreach},
+ {"foreachi", foreachi},
+ {"getn", getn},
+ {"maxn", maxn},
+ {"insert", tinsert},
+ {"remove", tremove},
+ {"setn", setn},
+ {"sort", sort},
+ {NULL, NULL}
+};
+
+
+LUALIB_API int luaopen_table (lua_State *L) {
+ luaL_register(L, LUA_TABLIBNAME, tab_funcs);
+ return 1;
+}
+
diff --git a/src/luajit/ltm.c b/src/luajit/ltm.c
new file mode 100644
index 0000000000..c27f0f6fab
--- /dev/null
+++ b/src/luajit/ltm.c
@@ -0,0 +1,75 @@
+/*
+** $Id: ltm.c,v 2.8.1.1 2007/12/27 13:02:25 roberto Exp $
+** Tag methods
+** See Copyright Notice in lua.h
+*/
+
+
+#include <string.h>
+
+#define ltm_c
+#define LUA_CORE
+
+#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",
+ "proto", "upval"
+};
+
+
+void luaT_init (lua_State *L) {
+ static const char *const luaT_eventname[] = { /* ORDER TM */
+ "__index", "__newindex",
+ "__gc", "__mode", "__eq",
+ "__add", "__sub", "__mul", "__div", "__mod",
+ "__pow", "__unm", "__len", "__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 TValue *luaT_gettm (Table *events, TMS event, TString *ename) {
+ const TValue *tm = luaH_getstr(events, ename);
+ lua_assert(event <= TM_EQ);
+ if (ttisnil(tm)) { /* no tag method? */
+ events->flags |= cast_byte(1u<<event); /* cache this fact */
+ return NULL;
+ }
+ else return tm;
+}
+
+
+const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, TMS event) {
+ Table *mt;
+ switch (ttype(o)) {
+ case LUA_TTABLE:
+ mt = hvalue(o)->metatable;
+ break;
+ case LUA_TUSERDATA:
+ mt = uvalue(o)->metatable;
+ break;
+ default:
+ mt = G(L)->mt[ttype(o)];
+ }
+ return (mt ? luaH_getstr(mt, G(L)->tmname[event]) : luaO_nilobject);
+}
+
diff --git a/src/luajit/ltm.h b/src/luajit/ltm.h
new file mode 100644
index 0000000000..64343b781b
--- /dev/null
+++ b/src/luajit/ltm.h
@@ -0,0 +1,54 @@
+/*
+** $Id: ltm.h,v 2.6.1.1 2007/12/27 13:02:25 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_MOD,
+ TM_POW,
+ TM_UNM,
+ TM_LEN,
+ TM_LT,
+ TM_LE,
+ TM_CONCAT,
+ TM_CALL,
+ TM_N /* number of elements in the enum */
+} TMS;
+
+
+
+#define gfasttm(g,et,e) ((et) == NULL ? NULL : \
+ ((et)->flags & (1u<<(e))) ? NULL : luaT_gettm(et, e, (g)->tmname[e]))
+
+#define fasttm(l,et,e) gfasttm(G(l), et, e)
+
+LUAI_DATA const char *const luaT_typenames[];
+
+
+LUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename);
+LUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o,
+ TMS event);
+LUAI_FUNC void luaT_init (lua_State *L);
+
+#endif
diff --git a/src/luajit/lua.h b/src/luajit/lua.h
new file mode 100644
index 0000000000..7d6ee45f13
--- /dev/null
+++ b/src/luajit/lua.h
@@ -0,0 +1,385 @@
+/*
+** $Id: lua.h,v 1.218.1.5 2008/08/06 13:30:12 roberto Exp $
+** Lua - An Extensible Extension Language
+** Lua.org, PUC-Rio, Brazil (http://www.lua.org)
+** See Copyright Notice at the end of this file
+*/
+
+
+#ifndef lua_h
+#define lua_h
+
+#include <stdarg.h>
+#include <stddef.h>
+
+
+#include "luaconf.h"
+
+
+#define LUA_VERSION "Lua 5.1"
+#define LUA_RELEASE "Lua 5.1.4"
+#define LUA_VERSION_NUM 501
+#define LUA_COPYRIGHT "Copyright (C) 1994-2008 Lua.org, PUC-Rio"
+#define LUA_AUTHORS "R. Ierusalimschy, L. H. de Figueiredo & W. Celes"
+
+
+/* mark for precompiled code (`<esc>Lua') */
+#define LUA_SIGNATURE "\033Lua"
+
+/* option for multiple returns in `lua_pcall' and `lua_call' */
+#define LUA_MULTRET (-1)
+
+
+/*
+** pseudo-indices
+*/
+#define LUA_REGISTRYINDEX (-10000)
+#define LUA_ENVIRONINDEX (-10001)
+#define LUA_GLOBALSINDEX (-10002)
+#define lua_upvalueindex(i) (LUA_GLOBALSINDEX-(i))
+
+
+/* thread status; 0 is OK */
+#define LUA_YIELD 1
+#define LUA_ERRRUN 2
+#define LUA_ERRSYNTAX 3
+#define LUA_ERRMEM 4
+#define LUA_ERRERR 5
+
+
+typedef struct lua_State lua_State;
+
+typedef int (*lua_CFunction) (lua_State *L);
+
+
+/*
+** functions that read/write blocks when loading/dumping Lua chunks
+*/
+typedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz);
+
+typedef int (*lua_Writer) (lua_State *L, const void* p, size_t sz, void* ud);
+
+
+/*
+** prototype for memory-allocation functions
+*/
+typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize);
+
+
+/*
+** 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
+*/
+#if defined(LUA_USER_H)
+#include LUA_USER_H
+#endif
+
+
+/* type of numbers in Lua */
+typedef LUA_NUMBER lua_Number;
+
+
+/* type for integer functions */
+typedef LUA_INTEGER lua_Integer;
+
+
+
+/*
+** state manipulation
+*/
+LUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud);
+LUA_API void (lua_close) (lua_State *L);
+LUA_API lua_State *(lua_newthread) (lua_State *L);
+
+LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf);
+
+
+/*
+** 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 lua_Integer (lua_tointeger) (lua_State *L, int idx);
+LUA_API int (lua_toboolean) (lua_State *L, int idx);
+LUA_API const char *(lua_tolstring) (lua_State *L, int idx, size_t *len);
+LUA_API size_t (lua_objlen) (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_pushinteger) (lua_State *L, lua_Integer 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);
+LUA_API int (lua_pushthread) (lua_State *L);
+
+
+/*
+** get functions (Lua -> stack)
+*/
+LUA_API void (lua_gettable) (lua_State *L, int idx);
+LUA_API void (lua_getfield) (lua_State *L, int idx, const char *k);
+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_createtable) (lua_State *L, int narr, int nrec);
+LUA_API void *(lua_newuserdata) (lua_State *L, size_t sz);
+LUA_API int (lua_getmetatable) (lua_State *L, int objindex);
+LUA_API 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_setfield) (lua_State *L, int idx, const char *k);
+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_Reader reader, void *dt,
+ const char *chunkname);
+
+LUA_API int (lua_dump) (lua_State *L, lua_Writer 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);
+LUA_API int (lua_status) (lua_State *L);
+
+/*
+** garbage-collection function and options
+*/
+
+#define LUA_GCSTOP 0
+#define LUA_GCRESTART 1
+#define LUA_GCCOLLECT 2
+#define LUA_GCCOUNT 3
+#define LUA_GCCOUNTB 4
+#define LUA_GCSTEP 5
+#define LUA_GCSETPAUSE 6
+#define LUA_GCSETSTEPMUL 7
+
+LUA_API int (lua_gc) (lua_State *L, int what, int data);
+
+
+/*
+** miscellaneous functions
+*/
+
+LUA_API int (lua_error) (lua_State *L);
+
+LUA_API int (lua_next) (lua_State *L, int idx);
+
+LUA_API void (lua_concat) (lua_State *L, int n);
+
+LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud);
+LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud);
+
+
+
+/*
+** ===============================================================
+** some useful macros
+** ===============================================================
+*/
+
+#define lua_pop(L,n) lua_settop(L, -(n)-1)
+
+#define lua_newtable(L) lua_createtable(L, 0, 0)
+
+#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n)))
+
+#define lua_pushcfunction(L,f) lua_pushcclosure(L, (f), 0)
+
+#define lua_strlen(L,i) lua_objlen(L, (i))
+
+#define lua_isfunction(L,n) (lua_type(L, (n)) == LUA_TFUNCTION)
+#define lua_istable(L,n) (lua_type(L, (n)) == LUA_TTABLE)
+#define lua_islightuserdata(L,n) (lua_type(L, (n)) == LUA_TLIGHTUSERDATA)
+#define lua_isnil(L,n) (lua_type(L, (n)) == LUA_TNIL)
+#define lua_isboolean(L,n) (lua_type(L, (n)) == LUA_TBOOLEAN)
+#define lua_isthread(L,n) (lua_type(L, (n)) == LUA_TTHREAD)
+#define lua_isnone(L,n) (lua_type(L, (n)) == LUA_TNONE)
+#define lua_isnoneornil(L, n) (lua_type(L, (n)) <= 0)
+
+#define lua_pushliteral(L, s) \
+ lua_pushlstring(L, "" s, (sizeof(s)/sizeof(char))-1)
+
+#define lua_setglobal(L,s) lua_setfield(L, LUA_GLOBALSINDEX, (s))
+#define lua_getglobal(L,s) lua_getfield(L, LUA_GLOBALSINDEX, (s))
+
+#define lua_tostring(L,i) lua_tolstring(L, (i), NULL)
+
+
+
+/*
+** compatibility macros and functions
+*/
+
+#define lua_open() luaL_newstate()
+
+#define lua_getregistry(L) lua_pushvalue(L, LUA_REGISTRYINDEX)
+
+#define lua_getgccount(L) lua_gc(L, LUA_GCCOUNT, 0)
+
+#define lua_Chunkreader lua_Reader
+#define lua_Chunkwriter lua_Writer
+
+
+
+/*
+** {======================================================================
+** 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 */
+
+
+/* Functions to be called by the debuger in specific events */
+typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar);
+
+
+LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar);
+LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar);
+LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n);
+LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n);
+LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n);
+LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n);
+
+LUA_API 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);
+
+
+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) */
+ int lastlinedefined; /* (S) */
+ char short_src[LUA_IDSIZE]; /* (S) */
+ /* private part */
+ int i_ci; /* active function */
+};
+
+/* }====================================================================== */
+
+
+/******************************************************************************
+* Copyright (C) 1994-2008 Lua.org, 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
diff --git a/src/luajit/luaconf.h b/src/luajit/luaconf.h
new file mode 100644
index 0000000000..35a6bd1562
--- /dev/null
+++ b/src/luajit/luaconf.h
@@ -0,0 +1,786 @@
+/*
+** $Id: luaconf.h,v 1.82.1.7 2008/02/11 16:25:08 roberto Exp $
+** Configuration file for Lua
+** See Copyright Notice in lua.h
+*/
+
+
+#ifndef lconfig_h
+#define lconfig_h
+
+#include <limits.h>
+#include <stddef.h>
+
+
+/*
+** ==================================================================
+** Search for "@@" to find all configurable definitions.
+** ===================================================================
+*/
+
+
+/*
+@@ LUA_ANSI controls the use of non-ansi features.
+** CHANGE it (define it) if you want Lua to avoid the use of any
+** non-ansi feature or library.
+*/
+#if defined(__STRICT_ANSI__)
+#define LUA_ANSI
+#endif
+
+
+#if !defined(LUA_ANSI) && defined(_WIN32)
+#define LUA_WIN
+#endif
+
+#if defined(LUA_USE_LINUX)
+#define LUA_USE_POSIX
+#define LUA_USE_DLOPEN /* needs an extra library: -ldl */
+/* #define LUA_USE_READLINE */ /* needs some extra libraries */
+#endif
+
+#if defined(LUA_USE_MACOSX)
+#define LUA_USE_POSIX
+#define LUA_DL_DYLD /* does not need extra library */
+#endif
+
+
+
+/*
+@@ LUA_USE_POSIX includes all functionallity listed as X/Open System
+@* Interfaces Extension (XSI).
+** CHANGE it (define it) if your system is XSI compatible.
+*/
+#if defined(LUA_USE_POSIX)
+#define LUA_USE_MKSTEMP
+#define LUA_USE_ISATTY
+#define LUA_USE_POPEN
+#define LUA_USE_ULONGJMP
+#endif
+
+
+/*
+@@ LUA_PATH and LUA_CPATH are the names of the environment variables that
+@* Lua check to set its paths.
+@@ LUA_INIT is the name of the environment variable that Lua
+@* checks for initialization code.
+** CHANGE them if you want different names.
+*/
+#define LUA_PATH "LUA_PATH"
+#define LUA_CPATH "LUA_CPATH"
+#define LUA_INIT "LUA_INIT"
+
+
+/*
+@@ LUA_PATH_DEFAULT is the default path that Lua uses to look for
+@* Lua libraries.
+@@ LUA_CPATH_DEFAULT is the default path that Lua uses to look for
+@* C libraries.
+** CHANGE them if your machine has a non-conventional directory
+** hierarchy or if you want to install your libraries in
+** non-conventional directories.
+*/
+#if defined(_WIN32)
+/*
+** In Windows, any exclamation mark ('!') in the path is replaced by the
+** path of the directory of the executable file of the current process.
+*/
+#define LUA_LDIR "!\\lua\\"
+#define LUA_CDIR "!\\"
+#define LUA_PATH_DEFAULT \
+ ".\\?.lua;" LUA_LDIR"?.lua;" LUA_LDIR"?\\init.lua;" \
+ LUA_CDIR"?.lua;" LUA_CDIR"?\\init.lua"
+#define LUA_CPATH_DEFAULT \
+ ".\\?.dll;" LUA_CDIR"?.dll;" LUA_CDIR"loadall.dll"
+
+#else
+#define LUA_ROOT "/usr/local/"
+#define LUA_LDIR LUA_ROOT "share/lua/5.1/"
+#define LUA_CDIR LUA_ROOT "lib/lua/5.1/"
+#define LUA_PATH_DEFAULT \
+ "./?.lua;" LUA_LDIR"?.lua;" LUA_LDIR"?/init.lua;" \
+ LUA_CDIR"?.lua;" LUA_CDIR"?/init.lua"
+#define LUA_CPATH_DEFAULT \
+ "./?.so;" LUA_CDIR"?.so;" LUA_CDIR"loadall.so"
+#endif
+
+
+/*
+@@ LUA_DIRSEP is the directory separator (for submodules).
+** CHANGE it if your machine does not use "/" as the directory separator
+** and is not Windows. (On Windows Lua automatically uses "\".)
+*/
+#if defined(_WIN32)
+#define LUA_DIRSEP "\\"
+#else
+#define LUA_DIRSEP "/"
+#endif
+
+
+/*
+@@ LUA_PATHSEP is the character that separates templates in a path.
+@@ LUA_PATH_MARK is the string that marks the substitution points in a
+@* template.
+@@ LUA_EXECDIR in a Windows path is replaced by the executable's
+@* directory.
+@@ LUA_IGMARK is a mark to ignore all before it when bulding the
+@* luaopen_ function name.
+** CHANGE them if for some reason your system cannot use those
+** characters. (E.g., if one of those characters is a common character
+** in file/directory names.) Probably you do not need to change them.
+*/
+#define LUA_PATHSEP ";"
+#define LUA_PATH_MARK "?"
+#define LUA_EXECDIR "!"
+#define LUA_IGMARK "-"
+
+
+/*
+@@ LUA_INTEGER is the integral type used by lua_pushinteger/lua_tointeger.
+** CHANGE that if ptrdiff_t is not adequate on your machine. (On most
+** machines, ptrdiff_t gives a good choice between int or long.)
+*/
+#define LUA_INTEGER ptrdiff_t
+
+
+/*
+@@ LUA_API is a mark for all core API functions.
+@@ LUALIB_API is a mark for all standard library functions.
+** CHANGE them if you need to define those functions in some special way.
+** For instance, if you want to create one Windows DLL with the core and
+** the libraries, you may want to use the following definition (define
+** LUA_BUILD_AS_DLL to get it).
+*/
+#if defined(LUA_BUILD_AS_DLL)
+
+#if defined(LUA_CORE) || defined(LUA_LIB)
+#define LUA_API __declspec(dllexport)
+#else
+#define LUA_API __declspec(dllimport)
+#endif
+
+#else
+
+#define LUA_API extern
+
+#endif
+
+/* more often than not the libs go together with the core */
+#define LUALIB_API LUA_API
+
+
+/*
+@@ LUAI_FUNC is a mark for all extern functions that are not to be
+@* exported to outside modules.
+@@ LUAI_DATA is a mark for all extern (const) variables that are not to
+@* be exported to outside modules.
+** CHANGE them if you need to mark them in some special way. Elf/gcc
+** (versions 3.2 and later) mark them as "hidden" to optimize access
+** when Lua is compiled as a shared library.
+*/
+#if defined(luaall_c)
+#define LUAI_FUNC static
+#define LUAI_DATA /* empty */
+
+#elif defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \
+ defined(__ELF__)
+#define LUAI_FUNC __attribute__((visibility("hidden"))) extern
+#define LUAI_DATA LUAI_FUNC
+
+#else
+#define LUAI_FUNC extern
+#define LUAI_DATA extern
+#endif
+
+
+
+/*
+@@ LUA_QL describes how error messages quote program elements.
+** CHANGE it if you want a different appearance.
+*/
+#define LUA_QL(x) "'" x "'"
+#define LUA_QS LUA_QL("%s")
+
+
+/*
+@@ LUA_IDSIZE gives the maximum size for the description of the source
+@* of a function in debug information.
+** CHANGE it if you want a different size.
+*/
+#define LUA_IDSIZE 60
+
+
+/*
+** {==================================================================
+** Stand-alone configuration
+** ===================================================================
+*/
+
+#if defined(lua_c) || defined(luaall_c)
+
+/*
+@@ lua_stdin_is_tty detects whether the standard input is a 'tty' (that
+@* is, whether we're running lua interactively).
+** CHANGE it if you have a better definition for non-POSIX/non-Windows
+** systems.
+*/
+#if defined(LUA_USE_ISATTY)
+#include <unistd.h>
+#define lua_stdin_is_tty() isatty(0)
+#elif defined(LUA_WIN)
+#include <io.h>
+#include <stdio.h>
+#define lua_stdin_is_tty() _isatty(_fileno(stdin))
+#else
+#define lua_stdin_is_tty() 1 /* assume stdin is a tty */
+#endif
+
+
+/*
+@@ LUA_PROMPT is the default prompt used by stand-alone Lua.
+@@ LUA_PROMPT2 is the default continuation prompt used by stand-alone Lua.
+** CHANGE them if you want different prompts. (You can also change the
+** prompts dynamically, assigning to globals _PROMPT/_PROMPT2.)
+*/
+#define LUA_PROMPT "> "
+#define LUA_PROMPT2 ">> "
+
+
+/*
+@@ LUA_PROGNAME is the default name for the stand-alone Lua program.
+** CHANGE it if your stand-alone interpreter has a different name and
+** your system is not able to detect that name automatically.
+*/
+#define LUA_PROGNAME "luajit"
+
+
+/*
+@@ LUA_MAXINPUT is the maximum length for an input line in the
+@* stand-alone interpreter.
+** CHANGE it if you need longer lines.
+*/
+#define LUA_MAXINPUT 512
+
+
+/*
+@@ lua_readline defines how to show a prompt and then read a line from
+@* the standard input.
+@@ lua_saveline defines how to "save" a read line in a "history".
+@@ lua_freeline defines how to free a line read by lua_readline.
+** CHANGE them if you want to improve this functionality (e.g., by using
+** GNU readline and history facilities).
+*/
+#if defined(LUA_USE_READLINE)
+#include <stdio.h>
+#include <readline/readline.h>
+#include <readline/history.h>
+#define lua_readline(L,b,p) ((void)L, ((b)=readline(p)) != NULL)
+#define lua_saveline(L,idx) \
+ if (lua_strlen(L,idx) > 0) /* non-empty line? */ \
+ add_history(lua_tostring(L, idx)); /* add it to history */
+#define lua_freeline(L,b) ((void)L, free(b))
+#else
+#define lua_readline(L,b,p) \
+ ((void)L, fputs(p, stdout), fflush(stdout), /* show prompt */ \
+ fgets(b, LUA_MAXINPUT, stdin) != NULL) /* get line */
+#define lua_saveline(L,idx) { (void)L; (void)idx; }
+#define lua_freeline(L,b) { (void)L; (void)b; }
+#endif
+
+#endif
+
+/* }================================================================== */
+
+
+/*
+@@ LUAI_GCPAUSE defines the default pause between garbage-collector cycles
+@* as a percentage.
+** CHANGE it if you want the GC to run faster or slower (higher values
+** mean larger pauses which mean slower collection.) You can also change
+** this value dynamically.
+*/
+#define LUAI_GCPAUSE 200 /* 200% (wait memory to double before next GC) */
+
+
+/*
+@@ LUAI_GCMUL defines the default speed of garbage collection relative to
+@* memory allocation as a percentage.
+** CHANGE it if you want to change the granularity of the garbage
+** collection. (Higher values mean coarser collections. 0 represents
+** infinity, where each step performs a full collection.) You can also
+** change this value dynamically.
+*/
+#define LUAI_GCMUL 200 /* GC runs 'twice the speed' of memory allocation */
+
+
+
+/*
+@@ LUA_COMPAT_GETN controls compatibility with old getn behavior.
+** CHANGE it (define it) if you want exact compatibility with the
+** behavior of setn/getn in Lua 5.0.
+**
+** Note: this is not supported by LuaJIT. Leave it undefined.
+*/
+#undef LUA_COMPAT_GETN
+
+/*
+@@ LUA_COMPAT_LOADLIB controls compatibility about global loadlib.
+** CHANGE it to undefined as soon as you do not need a global 'loadlib'
+** function (the function is still available as 'package.loadlib').
+*/
+#undef LUA_COMPAT_LOADLIB
+
+/*
+@@ LUA_COMPAT_VARARG controls compatibility with old vararg feature.
+** CHANGE it to undefined as soon as your programs use only '...' to
+** access vararg parameters (instead of the old 'arg' table).
+**
+** Note: this has a slightly negative performance impact with LuaJIT
+** for all vararg functions. Leave it off if possible and upgrade your
+** code (replace unpack(arg) with ... and/or add local arg = {...}).
+*/
+#undef LUA_COMPAT_VARARG
+
+/*
+@@ LUA_COMPAT_MOD controls compatibility with old math.mod function.
+** CHANGE it to undefined as soon as your programs use 'math.fmod' or
+** the new '%' operator instead of 'math.mod'.
+*/
+#define LUA_COMPAT_MOD
+
+/*
+@@ LUA_COMPAT_LSTR controls compatibility with old long string nesting
+@* facility.
+** CHANGE it to 2 if you want the old behaviour, or undefine it to turn
+** off the advisory error when nesting [[...]].
+*/
+#define LUA_COMPAT_LSTR 1
+
+/*
+@@ LUA_COMPAT_GFIND controls compatibility with old 'string.gfind' name.
+** CHANGE it to undefined as soon as you rename 'string.gfind' to
+** 'string.gmatch'.
+*/
+#define LUA_COMPAT_GFIND
+
+/*
+@@ LUA_COMPAT_OPENLIB controls compatibility with old 'luaL_openlib'
+@* behavior.
+** CHANGE it to undefined as soon as you replace to 'luaL_register'
+** your uses of 'luaL_openlib'
+*/
+#define LUA_COMPAT_OPENLIB
+
+
+
+/*
+@@ luai_apicheck is the assert macro used by the Lua-C API.
+** CHANGE luai_apicheck if you want Lua to perform some checks in the
+** parameters it gets from API calls. This may slow down the interpreter
+** a bit, but may be quite useful when debugging C code that interfaces
+** with Lua. A useful redefinition is to use assert.h.
+*/
+#if defined(LUA_USE_APICHECK)
+#include <assert.h>
+#define luai_apicheck(L,o) { (void)L; assert(o); }
+#else
+#define luai_apicheck(L,o) { (void)L; }
+#endif
+
+
+/*
+@@ LUAI_BITSINT defines the number of bits in an int.
+** CHANGE here if Lua cannot automatically detect the number of bits of
+** your machine. Probably you do not need to change this.
+*/
+/* avoid overflows in comparison */
+#if INT_MAX-20 < 32760
+#define LUAI_BITSINT 16
+#elif INT_MAX > 2147483640L
+/* int has at least 32 bits */
+#define LUAI_BITSINT 32
+#else
+#error "you must define LUA_BITSINT with number of bits in an integer"
+#endif
+
+
+/*
+@@ LUAI_UINT32 is an unsigned integer with at least 32 bits.
+@@ LUAI_INT32 is an signed integer with at least 32 bits.
+@@ LUAI_UMEM is an unsigned integer big enough to count the total
+@* memory used by Lua.
+@@ LUAI_MEM is a signed integer big enough to count the total memory
+@* used by Lua.
+** CHANGE here if for some weird reason the default definitions are not
+** good enough for your machine. (The definitions in the 'else'
+** part always works, but may waste space on machines with 64-bit
+** longs.) Probably you do not need to change this.
+*/
+#if LUAI_BITSINT >= 32
+#define LUAI_UINT32 unsigned int
+#define LUAI_INT32 int
+#define LUAI_MAXINT32 INT_MAX
+#define LUAI_UMEM size_t
+#define LUAI_MEM ptrdiff_t
+#else
+/* 16-bit ints */
+#define LUAI_UINT32 unsigned long
+#define LUAI_INT32 long
+#define LUAI_MAXINT32 LONG_MAX
+#define LUAI_UMEM unsigned long
+#define LUAI_MEM long
+#endif
+
+
+/*
+@@ LUAI_MAXCALLS limits the number of nested calls.
+** CHANGE it if you need really deep recursive calls. This limit is
+** arbitrary; its only purpose is to stop infinite recursion before
+** exhausting memory.
+*/
+#define LUAI_MAXCALLS 20000
+
+
+/*
+@@ LUAI_MAXCSTACK limits the number of Lua stack slots that a C function
+@* can use.
+** CHANGE it if you need lots of (Lua) stack space for your C
+** functions. This limit is arbitrary; its only purpose is to stop C
+** functions to consume unlimited stack space. (must be smaller than
+** -LUA_REGISTRYINDEX)
+*/
+#define LUAI_MAXCSTACK 8000
+
+
+/*
+** {==================================================================
+** CHANGE (to smaller values) the following definitions if your system
+** has a small C stack. (Or you may want to change them to larger
+** values if your system has a large C stack and these limits are
+** too rigid for you.) Some of these constants control the size of
+** stack-allocated arrays used by the compiler or the interpreter, while
+** others limit the maximum number of recursive calls that the compiler
+** or the interpreter can perform. Values too large may cause a C stack
+** overflow for some forms of deep constructs.
+** ===================================================================
+*/
+
+
+/*
+@@ LUAI_MAXCCALLS is the maximum depth for nested C calls (short) and
+@* syntactical nested non-terminals in a program.
+*/
+#define LUAI_MAXCCALLS 200
+
+
+/*
+@@ LUAI_MAXVARS is the maximum number of local variables per function
+@* (must be smaller than 250).
+*/
+#define LUAI_MAXVARS 200
+
+
+/*
+@@ LUAI_MAXUPVALUES is the maximum number of upvalues per function
+@* (must be smaller than 250).
+*/
+#define LUAI_MAXUPVALUES 60
+
+
+/*
+@@ LUAL_BUFFERSIZE is the buffer size used by the lauxlib buffer system.
+*/
+#define LUAL_BUFFERSIZE BUFSIZ
+
+/* }================================================================== */
+
+
+
+
+/*
+** {==================================================================
+@@ LUA_NUMBER is the type of numbers in Lua.
+** CHANGE the following definitions only if you want to build Lua
+** with a number type different from double. You may also need to
+** change lua_number2int & lua_number2integer.
+** ===================================================================
+*/
+
+#define LUA_NUMBER_DOUBLE
+#define LUA_NUMBER double
+
+/*
+@@ LUAI_UACNUMBER is the result of an 'usual argument conversion'
+@* over a number.
+*/
+#define LUAI_UACNUMBER double
+
+
+/*
+@@ LUA_NUMBER_SCAN is the format for reading numbers.
+@@ LUA_NUMBER_FMT is the format for writing numbers.
+@@ lua_number2str converts a number to a string.
+@@ LUAI_MAXNUMBER2STR is maximum size of previous conversion.
+@@ lua_str2number converts a string to a number.
+*/
+#define LUA_NUMBER_SCAN "%lf"
+#define LUA_NUMBER_FMT "%.14g"
+#define lua_number2str(s,n) sprintf((s), LUA_NUMBER_FMT, (n))
+#define LUAI_MAXNUMBER2STR 32 /* 16 digits, sign, point, and \0 */
+#define lua_str2number(s,p) strtod((s), (p))
+
+
+/*
+@@ The luai_num* macros define the primitive operations over numbers.
+*/
+#if defined(LUA_CORE)
+#include <math.h>
+#define luai_numadd(a,b) ((a)+(b))
+#define luai_numsub(a,b) ((a)-(b))
+#define luai_nummul(a,b) ((a)*(b))
+#define luai_numdiv(a,b) ((a)/(b))
+#define luai_nummod(a,b) ((a) - floor((a)/(b))*(b))
+#define luai_numpow(a,b) (pow(a,b))
+#define luai_numunm(a) (-(a))
+#define luai_numeq(a,b) ((a)==(b))
+#define luai_numlt(a,b) ((a)<(b))
+#define luai_numle(a,b) ((a)<=(b))
+#define luai_numisnan(a) (!luai_numeq((a), (a)))
+#endif
+
+
+/*
+@@ lua_number2int is a macro to convert lua_Number to int.
+@@ lua_number2integer is a macro to convert lua_Number to lua_Integer.
+** CHANGE them if you know a faster way to convert a lua_Number to
+** int (with any rounding method and without throwing errors) in your
+** system. In Pentium machines, a naive typecast from double to int
+** in C is extremely slow, so any alternative is worth trying.
+*/
+
+/* On a Pentium, resort to a trick */
+#if defined(LUA_NUMBER_DOUBLE) && !defined(LUA_ANSI) && !defined(__SSE2__) && \
+ (defined(__i386) || defined (_M_IX86) || defined(__i386__))
+
+/* On a Microsoft compiler, use assembler */
+#if defined(_MSC_VER)
+
+#define lua_number2int(i,d) __asm fld d __asm fistp i
+#define lua_number2integer(i,n) lua_number2int(i, n)
+
+/* the next trick should work on any Pentium, but sometimes clashes
+ with a DirectX idiosyncrasy */
+#else
+
+union luai_Cast { double l_d; long l_l; };
+#define lua_number2int(i,d) \
+ { volatile union luai_Cast u; u.l_d = (d) + 6755399441055744.0; (i) = u.l_l; }
+#define lua_number2integer(i,n) lua_number2int(i, n)
+
+#endif
+
+
+/* this option always works, but may be slow */
+#else
+#define lua_number2int(i,d) ((i)=(int)(d))
+#define lua_number2integer(i,d) ((i)=(lua_Integer)(d))
+
+#endif
+
+
+/*
+@@ LUA_TVALUE_ALIGN specifies extra alignment constraints for the
+@@ tagged value structure to get better lua_Number alignment.
+** CHANGE it to an empty define if you want to save some space
+** at the cost of execution time. Note that this is only needed
+** for the x86 ABI on most POSIX systems, but not on Windows and
+** not for most other CPUs. If you change it then you need to follow
+** the instructions in ljit_x86.dash, too (look for TVALUE_SIZE).
+*/
+
+#if defined(LUA_NUMBER_DOUBLE) && defined(__GNUC__) && \
+ (defined(__i386) || defined(__i386__)) && !defined(_WIN32)
+#define LUA_TVALUE_ALIGN __attribute__ ((aligned(8)))
+#else
+#define LUA_TVALUE_ALIGN
+#endif
+
+/* }================================================================== */
+
+
+/*
+@@ LUAI_USER_ALIGNMENT_T is a type that requires maximum alignment.
+** CHANGE it if your system requires alignments larger than double. (For
+** instance, if your system supports long doubles and they must be
+** aligned in 16-byte boundaries, then you should add long double in the
+** union.) Probably you do not need to change this.
+*/
+#define LUAI_USER_ALIGNMENT_T union { double u; void *s; long l; }
+
+
+/*
+@@ LUAI_THROW/LUAI_TRY define how Lua does exception handling.
+** CHANGE them if you prefer to use longjmp/setjmp even with C++
+** or if want/don't to use _longjmp/_setjmp instead of regular
+** longjmp/setjmp. By default, Lua handles errors with exceptions when
+** compiling as C++ code, with _longjmp/_setjmp when asked to use them,
+** and with longjmp/setjmp otherwise.
+*/
+#if defined(__cplusplus)
+/* C++ exceptions */
+#define LUAI_THROW(L,c) throw(c)
+#define LUAI_TRY(L,c,a) try { a } catch(...) \
+ { if ((c)->status == 0) (c)->status = -1; }
+#define luai_jmpbuf int /* dummy variable */
+
+#elif defined(LUA_USE_ULONGJMP)
+/* in Unix, try _longjmp/_setjmp (more efficient) */
+#define LUAI_THROW(L,c) _longjmp((c)->b, 1)
+#define LUAI_TRY(L,c,a) if (_setjmp((c)->b) == 0) { a }
+#define luai_jmpbuf jmp_buf
+
+#else
+/* default handling with long jumps */
+#define LUAI_THROW(L,c) longjmp((c)->b, 1)
+#define LUAI_TRY(L,c,a) if (setjmp((c)->b) == 0) { a }
+#define luai_jmpbuf jmp_buf
+
+#endif
+
+
+/*
+@@ LUA_MAXCAPTURES is the maximum number of captures that a pattern
+@* can do during pattern-matching.
+** CHANGE it if you need more captures. This limit is arbitrary.
+*/
+#define LUA_MAXCAPTURES 32
+
+
+/*
+@@ lua_tmpnam is the function that the OS library uses to create a
+@* temporary name.
+@@ LUA_TMPNAMBUFSIZE is the maximum size of a name created by lua_tmpnam.
+** CHANGE them if you have an alternative to tmpnam (which is considered
+** insecure) or if you want the original tmpnam anyway. By default, Lua
+** uses tmpnam except when POSIX is available, where it uses mkstemp.
+*/
+#if defined(loslib_c) || defined(luaall_c)
+
+#if defined(LUA_USE_MKSTEMP)
+#include <unistd.h>
+#define LUA_TMPNAMBUFSIZE 32
+#define lua_tmpnam(b,e) { \
+ strcpy(b, "/tmp/lua_XXXXXX"); \
+ e = mkstemp(b); \
+ if (e != -1) close(e); \
+ e = (e == -1); }
+
+#else
+#define LUA_TMPNAMBUFSIZE L_tmpnam
+#define lua_tmpnam(b,e) { e = (tmpnam(b) == NULL); }
+#endif
+
+#endif
+
+
+/*
+@@ lua_popen spawns a new process connected to the current one through
+@* the file streams.
+** CHANGE it if you have a way to implement it in your system.
+*/
+#if defined(LUA_USE_POPEN)
+
+#define lua_popen(L,c,m) ((void)L, fflush(NULL), popen(c,m))
+#define lua_pclose(L,file) ((void)L, (pclose(file) != -1))
+
+#elif defined(LUA_WIN)
+
+#define lua_popen(L,c,m) ((void)L, _popen(c,m))
+#define lua_pclose(L,file) ((void)L, (_pclose(file) != -1))
+
+#else
+
+#define lua_popen(L,c,m) ((void)((void)c, m), \
+ luaL_error(L, LUA_QL("popen") " not supported"), (FILE*)0)
+#define lua_pclose(L,file) ((void)((void)L, file), 0)
+
+#endif
+
+/*
+@@ LUA_DL_* define which dynamic-library system Lua should use.
+** CHANGE here if Lua has problems choosing the appropriate
+** dynamic-library system for your platform (either Windows' DLL, Mac's
+** dyld, or Unix's dlopen). If your system is some kind of Unix, there
+** is a good chance that it has dlopen, so LUA_DL_DLOPEN will work for
+** it. To use dlopen you also need to adapt the src/Makefile (probably
+** adding -ldl to the linker options), so Lua does not select it
+** automatically. (When you change the makefile to add -ldl, you must
+** also add -DLUA_USE_DLOPEN.)
+** If you do not want any kind of dynamic library, undefine all these
+** options.
+** By default, _WIN32 gets LUA_DL_DLL and MAC OS X gets LUA_DL_DYLD.
+*/
+#if defined(LUA_USE_DLOPEN)
+#define LUA_DL_DLOPEN
+#endif
+
+#if defined(LUA_WIN)
+#define LUA_DL_DLL
+#endif
+
+
+/*
+@@ LUAI_EXTRASPACE allows you to add user-specific data in a lua_State
+@* (the data goes just *before* the lua_State pointer).
+** CHANGE (define) this if you really need that. This value must be
+** a multiple of the maximum alignment required for your machine.
+*/
+#define LUAI_EXTRASPACE 0
+
+
+/*
+@@ luai_userstate* allow user-specific actions on threads.
+** CHANGE them if you defined LUAI_EXTRASPACE and need to do something
+** extra when a thread is created/deleted/resumed/yielded.
+*/
+#define luai_userstateopen(L) ((void)L)
+#define luai_userstateclose(L) ((void)L)
+#define luai_userstatethread(L,L1) ((void)L)
+#define luai_userstatefree(L) ((void)L)
+#define luai_userstateresume(L,n) ((void)L)
+#define luai_userstateyield(L,n) ((void)L)
+
+
+/*
+@@ LUA_INTFRMLEN is the length modifier for integer conversions
+@* in 'string.format'.
+@@ LUA_INTFRM_T is the integer type correspoding to the previous length
+@* modifier.
+** CHANGE them if your system supports long long or does not support long.
+*/
+
+#if defined(LUA_USELONGLONG)
+
+#define LUA_INTFRMLEN "ll"
+#define LUA_INTFRM_T long long
+
+#else
+
+#define LUA_INTFRMLEN "l"
+#define LUA_INTFRM_T long
+
+#endif
+
+
+
+/* =================================================================== */
+
+/*
+** Local configuration. You can use this space to add your redefinitions
+** without modifying the main part of the file.
+*/
+
+
+
+#endif
+
diff --git a/src/luajit/luajit b/src/luajit/luajit
new file mode 100755
index 0000000000000000000000000000000000000000..83f67e3a1c1ca671ca6be3f3174fa99232da208e
GIT binary patch
literal 267353
zcmd443tU{)wLd<<kQ^=cj5;b-RMgQ6l~$;zAZU4m2_{7HKoj$*2@*pR3TKk2d63SG
z=JYrTx7F6Rw#M6+x3#_A)}|yr0wIz|A7XqoHnqk_+ZjhKKB_TV`G3D_?=uYKar^r}
z?&pu5oU_h;t-aRTYpuQZ-e=a;HrA!3rFq=HbWetd(8J&K8pXJ8?#+;-Vo$E;1W%sl
zY|m#r6Yz#<#ofq*D;EWLW#XL|7fVbBJbk^_;B_isUQEMlxp4D%P?p!u2QxgpSl;7P
z>E8d!@OZyy7`#@edpr-~V!KSoqbD2b*+}EHA22VbvkhKtXs8Ws^U4Lx%T1g17i%HF
zBmUg-*C9Q%{g0887t0g>?$f-Ba69rZPvyC!eestrX<zuc_QlJBt3Kbg{PSN>?}56M
zub(nQ%CaA9^8{SgxEA1=kLv<l*Wlt`sk+I(lko4gxXN&`hUvIS>rdgDjcY2dS-4Ke
zRgQ~)lW|>%i|w3)i#S|{>oi>atHd=I7inLMi+^9lH4Rr40sJ-MIt5ogft0@nJQw0B
z(C^p>{;^*<xTfH`0vBn<zdBsk;i|_q5mytg3S1yh^6%f0Pyf#zPWnG6PT6$-&U7DA
z?q}io(<v|?4Gp)XyuS#~7vmy7ug8^(i+|_h`m8*8Jm=wliGKbZ?w8|&*obVMf&1CG
z`1g5S0bJR*nsMETYYwiNxQcM`?^0Yh;Q9=%3vt!p;<&sD*F0SAUkM&eT<5zl^xcp9
z$@)1<->=5~ME%Sg<%{i8_Q|tuu-13+0~5Sy-D&G<G9`_&$o4+_-q%;>pM6(O#}#+4
zp83XiS9f-7_|!v_U+sJF%DY!TJo9_2OWtvET4yZqO^9yzR9D44t3UI-4WGK^?U#t!
zm_PQDf9r8k?jF<vbQA7`TXFI4UR;E`bUJBAcrz~kkrsp}>U2lLzrdY;^Kmh~K&LOz
z@bwzriaXOEpg`mA5nO}^G)&nh{30&?{RtOgjz{+|7Z2o*`<IJ{*EBF6^)UZMx<1MR
z;ZhCXtlQtK@%g(>|Eq@AX!tqY`S*QXEPuI9U#-iZtLvj&F#S56&hbk4Cpz8j@4su9
zW`XHX;NqW~&hg8?r*wL?u5Sn4G5;hDe^<i`bbaL-{<DT()$kzh{9A&H<?kkdKfkV@
zV}XBdxR`#ruAlmd@Y5Q0>kn)AR9*f;4SzxB|CNT%1RgB^bq%}pZy1N~8_2`I4Y-*9
z=Q=-i72$FX|Cfe)apxb$C)263`A7Xgc&e_SV~y}fy8JyFp9k@de{&|N^snml9=v1z
zA`QFp_!KkaFHM)<qSKe-9rK@}+gpS8gh^-qb>bpiq0<8zUZ~68q4O8(^jw{8YnXIo
z`3w!S--HKrd5&Yklso=?3m4)4(CH`Z@<CnR<=<mE{U<v8H#(j6iRFKZi+|LYgwN6W
zU3$N#VYferm>GZH(e=Hl)7|kfqLQUv)<?a;zl(7ZrkwDvQkOqTmv`}5qT!z-5A%02
zGyYtDKc>sO{Q9<rsk52?JIsu~w{a0J)akTggg>R>^E6C*{My}K!_qMOwYd_$65x|z
zF}{rZ556{<K8yJQuh;o$?{|LPYy3jP5!@HPJW-c7MQ;75pLUGxm*DyVU{@c#g!Z~q
z+It7-;S~5wfUR$MjfZe&`4zYV@F(5&sdsA7eggF{eHyO!?(rI%aVPA7|Fo2T)8(Fd
z^KM?ceA&D%YeA<qZ=Pq~q!sh7TXgf{E^AR|b^C&@u0>s*t}l05o(0x|Wgc8@^7I8y
z$MTh)rOOw#dKTQYyvx(R{N|!UPuF53w=Z0@s)H{)tw{H@b`o5GBo8todGVKS(k)*z
z70oVOylh^uYY{TGwg-{EXw_oN)78<rc$wAe=~`s9FTZI)`yx+Q=YnO(v%F)`GEbM)
z*?Ci2r)OUK@?|&Qvb4j~YAtGS=j&xRb=(RpZeF&a-P5^fK|2b2Zo)rHkcfsnOBXF=
zLFDZCQs)x%L08vmEnd3Fvvdi1jp}Y*D&XR-1(tQIXX(-fXkpRvR!{5Ai!4yX>TCxR
z!DWDM@>okdS{DO9)C^?NZDM=V@?|TS5C8LaQ&-0_(0Ng3=d$I%`KATd;^oUctzC;2
zEdh3m7IY%TGY`et7a+PkXn9&Yf~cMUb_v$#S1Wqb1xld81s1xuboq)!9w4y@jm?{P
zlXYvyqIq9p{j7skcHPSUc$Nm2Nf)|qTCfbA=v?IXdKv5KP_?$M>|AUuV(Nm0sC(H0
z&_g;Sq*%DPRgs8|gMh7?KTDTL@;vad(^|f89+<YMlf-xNv6crrIu>;bR-^CQm#@_C
z(CHOl3buOYK^BCbY(S_$qAUkl=22j@crIN49=56kW?T-g>$ZdKqm82zi#+v>*Hl%{
z`@-ihO+I}g`BapAqI2!xjEooNL-KE?{F}if{lv7f|1rN8KEHZPNIk0>)LXBvHMOK_
z$9*$e&V9qXo5#JgB|fLie`)fs%BSAY|Mz-s2ev+3^!ZO+ycnu&g6CD}HNHDV;7re(
z8a`QIujc~|`vk_kRCOBl@jq1-H;+nBPo@uJPB;NAP)B8AVnp4P31dVZnK>N=Dhz`@
zp_g~GVepQ+vv`LR_3@qw|ATkf;B4OE{O0g(cs#khLpcU`hqIi=JDk1(-r)=v@(zc(
zn0Me&!n+ASfp<9Y6}+S4HN3+CZ{Qt@uaWmtK_lM%nBVaZ$GU}gOxWh|e!9mqpLZC)
zg}i6OFX9~&mv-LaY<BRDNsGlhl>aK;b3C5ayq^ua@O}>H!uz@KYk0?m<u2ZHJ)R!k
z&x0Sv`}y#*dB4EpxsP`k)y=%ac>REP7`X>|hcomL@0gH0%zGaEW!~YW_41Ah&||ze
zdpv!-!?^C`y};wy&HLv(p5O8gXK#r2OFW)uc`wA=p7$d7*Svqh<2lGXjQwl87kfN0
z-Y@fb-ryZh+%WG~z^3pH<8_GlQq19bzY_e1988=K{_|c2{__s!Ba3%91wP*4ocVeG
zBKXgH1^CZ<CHT+#jo?4;Rp3AG)!;wxHQ+z*wctPRb>KhmaGJ|`Zvg*!zXts0eG>T3
z`(*H+cNpg;-eKgY^L{P(&-)bcpZBTYKkpbw3wej}Y~%ep#02cWgx)Y>|AgqqrbBLH
z=T6P=>>2QkTy_W}V&uY)@h^Js8M)8{O0@AYesBbT7kUXZEj}c$L6}1`-Y0MtVMv-M
z{;<G4!nuSu3+yMHN4Q7eY{KB2C*Cb^4q>_x@eYA=30DxFFK~cx1K}ot^9ZAdo_K}8
z1%z7&7YbZRcs}7=fr|;VLvf$LC4@T&dju{gyo&JfCwOsT1>tVO2L-Mnyn*nLzzu|Z
z2=@uxNcdjD4-4Excr)S60#7IWAmJW?TL?c)xLe>kgnJ2h2t1!~AL01|FC@I1aFf7o
zgog-M2;5G1KjA`wI|v^noGY+JI7Zkf@G8Q?ggpYUCVYtS@ITrAZo<@|@q+?~2^)lm
z1l~Z{N4QVmy9j3!epuih!nuSu3w$@>Ji<K!-%GfVaJRts5iTLzA@F9x6@=#t`~$)b
zgqs9@kZ=>>3V|OY+(Nie;D-s%C!8zrBZS)s`vmSK+(FnQ@MDBm5gz`S{qG~(P57X|
zI|*+fJS6aL!aaoh1pY1IdkH@*@DSn6gf|QPEa3+U_Xxb7@WX_=1^yG^Ucwy$A0*sI
zc)q}|5#CL>N#GdaA;J{`zd?9E;X;9j2_Gb!EAV@SV}yMIA0j+V*dy@AgbxuO{)qjj
z25f_+M*jt-CTueZ4+%_-*ybbLConZ*TQ=c`1*V2<%O$*7U~0;?Ji<K!Q)9Mq8WZmp
zn3}V#gm8zz)Szt@gy#!PP1?q3cf3hpYSgwS!W9Bjv$nMmE)<v=wrxJ)T!E=++u8{G
z1g6Gq>mckAn3}h372)B-GX4p76Fw*~HF4Vp!b1X6Be(Ss?h}}rx$R!U4+~5U-L{$V
zW`U`x+a4s`BQP~~+rxyr1*Yb1>m}SFFg18vAL01|Q<JytCfp=2HG10+;R?VQx5>Yv
zH|N?fhh7_Qntokd_rZz468}t_*>><guMzttI{RKv59~m5=nXIRfoJym0Y5_P&etgi
zk$qNX?Dwd#W%izd9{E!?qx-5Kphb_BmB<P8dB1M~7}@s#Z;mgrFPIq2WO^D3sr(Q4
zVM-!>)+y9!9z2||%NyXkks-HYReewBjRJd4Ajh@>x%Tt+>OjDL%5D$j*-zTuK<s`v
zJ9a_99w_R|f7h-F7`=Vp@)~&X#sctPP|%Cy*u8o1AqsU08UkHBu@62R83~P~o!N(~
zy~vrx^2~h$Jcyz_c4NS+v)Y5Py~ym=HVGa{<bCUmqJ3nD$DWR2Xpu#qf|F$rJHXcg
zz7DW;fNN-H!GQgK^f88eJfSyoiuO4*=*@JLK_8Z*YL09VD#_}F7sv;rw_Bt8z=I$h
z^Mx8vcxTQ);v`KOb!#r_3%!wzCUaT7sE>u^U$31Lh)qGEt!<c^1NmHZDG=J3Jv(lA
z(>*=WN8ouOHp`$Kuu@f^(=0X%&PJp!cp`EOYO@En1yM=wTl+x<x4+0Y70ysE<YEM^
zO2N0_<%JGqT4(jrY`AX?_@<*(_1;c=*vHh8-tkp^U#gm5oxYVCnCu{CkHg)KFT#s$
zLNd}2Z?Aw;shFYhs6&e`QH?Pve}exT51<0w|5^4QX4-?zy%8X_{tX{E8ripPBLK5@
zhaf3^X0^qE*gQCaio~P1<8?zN$z>0i;e(*%XxEW+67YRsGg+7uh|UT4NRrrZ-ya!K
zFTvNp9|90oIix`kaFA^O_+VtDXded0b@mHRTBzR}?HT#xlTSVvI&a7NSGw_M#qFW~
znD2uf-Q5V#*9=7~)6JUQo_(PgGV)&t=0!%ViQTIMzN;(_A?d&}c=<xP^*h;BduaCD
zc>_`Jr@B{-oEUs+uwulM*b}V@oc!pwHILkazXI8$VB*O~zlpTSNbfgDq?-NlEE02t
zXH>o;`!J;Z_8>-Uw*3dx;0vB<A98TVsPJP{WK)hc{l^gUzs@5et$js(kD^jF;y5Zn
z$k*UUlg7P`uSl~GtOCi9_cNr~1Kj|&{(v}BPC(Usj4FA%?LYaJaxw=MA;ol42y}wP
zWB7F=rdjc+XxkkhQB(+ZIr8O?sfjG;pGIgSj;7UtJg3yT-W$vRAdRRETCE@*Ic)TL
z{=>^5=SL=CIeTy&mDLV=z#fkM0i%PjE<uDmazF&tIy<@r!sBsJJxG-cQUyRNDv#)b
zkD=f~pqt0Mr!VoMli~KeSGo+5lCH8tMUbZ6c92NWkiMrTpF&|Hv6wdqF_g9wUrpto
z(zgS>KO^Cw#-8{UAE3*&dx4+Sn;a9=#LsaA)?(U(JS-q1vepO1lR9wk&V>MJeJMFY
zptOvotkHogW13?PH9iBS9qBW}4jLUl=8*g>=2=Ys8InKVz6~gDok;Ws-~Evpxff4k
z1ms9U8Q{E7V!IHj9jLEXqVpC<r%R)0|8Qw^sp8L83g#1Mo(d9D)GU+(Hg%XiZWEQK
zHPVI9UPXOi<dK$OKUkY9V@Z-njfD7$GiFg8QK=U=pQDU_pZ{o$4v~2baRH_KhGX<?
zK!eEl(cSo|ATHTh6UaMa@cbB)QwUbxw%6UkFaQBa`%UZ=^fi>2SUO-vPDc6d(go6i
z@`{#<_CZ=-fWarJ{~PSty7MB#cvSer?sH5b>#R?wb{{V;!a$aVe~61zcF###A#Z<`
zDCoEML+PVD?YGF4%m3K>m{o%xS-Jt{k98s}A3Bs_?=r(@fCsMBNcCILUT9>*3^TMI
z88IW=K2Wqr(BB45W7O?HPv((e2h7ON^!S?xbBmsB{4U__JAl}uBH57RBBgxLl_dxi
zh>a9}<He+0K{|Fm3ZsGPz><Pr9B2?U&w^PcwXQ*(MF&J&q!%O?O6Q<w+jhHbK;NM*
zVzXc+?1BG5VrRaGPLCbYBtHgnIZ~1md;dElBk|v2=qY&}m7K32(j-;~ZVeuljakp4
zVxLgYLKL+{=%96A8EzaHL*!}f_+gMS8v+qu%qCWNW=NJ<GvP3nv;R&_pouuW28G~E
z$Mb1)V4OBD5_6ndkj65*OJJ=slfoU_Fh320WxM9S7IwFy+aZQhkstmBjFu7=N!0`P
zdgMT#-UU%(>xU_;G{yHo9dwsenBg@L>?htK#VxQ3s9no$(jbELZY!s~Lmh60mmsqm
zo9IXE64(l~or4;y3^Oth7&_N_qqW}19y6R^1ErrcBV~9H<cr>iB$O2GD;jxJR3)v&
zbZE%cfdX^Ow6yNSi_I|C63tDm__zD;R5Q$_R&x^<s>1tvqSi$oGs1`>G($<`fWR9X
zkq9L6BKyopCYl1uB|tUu5+XE2&N&5*<ib4UrkNYB=O{)2PvShq|8g|akARMA&+1E&
z(cD-hjXVzPW4&o^sZJ|jgls6+v-bDpw}1@5zr3C82Y=svd%7pul^)EjcdW;S6<aw<
z9u@oGDgiL3s!(ui5)%M2r$eYoUKu<>)7T}DHhTwO#-7EfB*EJ;l<^{GSA{{eLp#fh
z`b6})Z%y|Eo0Y1Y4qNEyUWFG`u0-aIfD9y4|EuZInzKEQL7prIO~{k*T^N1wE%>MV
zaJx09`|t|uiSEO<Kwhn>GR(H#O&dw<UH8ET%I`vYk^^bx-xc$V`gT>hxGBsIFA8o`
z(hANh#LNggA~+E*D}pJ48EL_*#3o8_v?7h8!v>uu!NDW{?!f>eDT?+9g<_|?tK2;^
z+>Mm@3jEW37~<84N=OXFPcu>u*l9dlWbjsSmW{@LgWMuNW4YD)G36c;1FD`G=#Vfc
zMefi3yOR4HFnm<*uYg$~iZ_9PN?<lUrLZlb#6?IEFw0|x@1<}CJw+p!5uH%)%%MaD
zKY*<%u@B|%jy8>i`qJ5Pb`)Y-xa|Vcol^*qyYO%t<*B5q^e|o(uelJpO6+H%pq^9b
ztqu)(NjjHqzkrb`eQDiakf|8&3-MkJUz%Lh_9ZIwk+o$MilX;FIN;R$%2StG!Ix1%
z(%C~TP1MWPEc)vJs{SDOJLZ0387-XH0UCGe2{7%ne?vdfD|1Wcy%!ip|I6vl^piYS
zrU$=>H{ZgWE349impY9neGIq)eY`TwjJ%%#5^c$>Bv=XfuL`abINgjq4_NTfJt+JH
z^soYjMB{_!g;fJ=d_TN)nyrP*kDeFpVX4^5kXCy@D)?h8jG=`zS5-ZN={oQYU{FMQ
zz$qk^P=VaX_ceh6a<@l4=kYm=XXsEeHTJVN)X=;d&GqKICIV!PvpgW$;F~FfB_Cya
zn~s_H+o^f~nGhVBFmr*NpNN*n3hg$ycAQp=z1;k|tI$7&sO1l%Ba{f`Xo5C>!U*WC
zqfp_cnxMMk1{{BWv2?vD$#xq>PQY9y`9jEtoR1XfoETkd;)<N-Vm==_G{Fpi9&Ptx
z1W1Zoq)4-GTNav+4S)fp<l7t(V9!>J9W`x5?WYR|ty778v^uE@UZM-p2PXo!7xjU~
z_s|b=2a6c1-<}QMZZ`}ri@GkA(ffn<q{kwgFJSDl#cg+k{;@KR$6}%^IOrOo!)>7A
zWJ5(lr3WXAB~6A5_%5}5WNkv*_KtWQUK8tg71iRmTt)R1QsPfCnOw2dP&pBuN_?Mh
zo{;AC>r>Hg{8hX`N{-ea@t<?L0z~PIln6cn`L{s+%|ojtNXd<#14B#|_BBXD{6jF}
zICA-Uh*wgH|9kwna+#i*cM<Z&zXy!iS=Wlu`o`~tj269LbO2!?+VnYr0+^0GasEo;
z^I1ami9Lyz0@tE_@e9=GYASjY@hVYJ)1dC){+v3hXP?3dj-Nm$BZa&tVywut|4)hM
zdJzBO1Or1k3wq5*teh_!PKML$4OJRGdxBGK*fYI$o#7xCQbRk90c9zo+kuS-^ND8E
zo?TiaQ|}zB)@d>94}q}1|7CC53(hTu-C)><8dl}oiK6#=LJ40e?sGEg&_d}4b{gxS
z=Cv!0;9sQ7-@N(%v~MxQ5Yj(D-PF>C)8KO|TkL5q?!;cl1CZu*stjjRR{rk(L*4-*
z!>(ZNzUpFUa#sIAuhVR#?JnKXbw+fOugBh7I<%|u5K)g_<6AjwHyd`fF?#@+kTq>6
z)aMh}^=H_2?=}d2=rF<^j`yD2cP4@Y$#{g|*JOk$44)P{mpm#S$MhF5{G2A^#n0$m
z7}p-R8%#fNyma(WCg+C7nPhMPrG=`{R;9QM13l8d(8sV(mij9V_+De`N85Hfu%k_N
zntaSvR@GtN-Dhs;8z1juedd;m2}%4K#R|e3u(D9rsq%qmRapb_oTb~xd-?!Xycsr9
zN9lujB;?r-jszfF*$|=J&_`)&Tb!AwtEQ}~qU$OL!ZnjqF>n8?)XDinU?e9yM(mtI
zSgblDe?QrRY^({jq{MfSKep-tXoRgwD&ZcyfQj*3rLR}Oa#G_l*Vq05H@;dn5!o4`
zI>VQE7-$kdjhEo*qSYxA&vQ^S`jp4|)LaTsfHlUd$5%H7xukrA-pE1`pAB_aiK!V_
zxfA4pU?<~QS-ms~6n-FLpnE=&0wXdzba<jO*S9ifByi6`NT5?a-JU#sTznR-dQrw;
zweTdXWj!hpcdDE0$xVruo$4BUZ~rSNmhM<NDSybWu5hX=%BpKt){!C=o2jZ#^8{ZP
z9hvwga$h(C=}i15p88`aCLUlm`+nk`xQBIBSK!G(GY}<D;ul4I@!Ns?nEvDd^<1aY
z2*rG%RmKGCB&l3j#_{ayzHNdhm=Fa_dC3DcNg`6!aH{-vmZI;wi|MT&5s$_+uy^a}
z;OZRsF>?ZqoDm_8RRP)+M=c5DdtvBm_M^%MyPS2g_8Qh6yZ_oW2JMw`FAv1FH-o*b
z2!&Be31$c5#{=UeqYhyJ&$JkM8ht9BT-zVW-_3Rq8<Af04n6D@v5S3g8aq*tG9EaQ
z<!Dd=xN3h{b)L1vsqi`;ry@%&3)neQOYH5X!0vRr$q(IRr$bR<2xI=?ab|jzma=`A
z)o`#QEsAj+^Ff=zYM?wc0x<H%em9Q@_-D^ej_2xz#Jywql||8Ws=TC-<2utKusu>3
z;wq6trSC__bDleHKoi<53}UKKNKF2Y(Ca=rSg|Rnp&E)KW!yS-eq=0bGCJdS)0h!0
z^NZt;$Bo}bXOBJ}fBC))Z@6n7HM~<B9j}jkNX!NP)FzxiXM_6zr&+5cjD5u1&PQ9w
zl7}pevoczmjc(?ms1Je}zwZ0k>D>c%=HX4@xWa$A5B5dLiZGKhgi3`cXQE(eXWnd4
z11L`-_{Nq0A<83v?8P_H;bwB4%G*v4RYUhze2iyQ0kZ}Bodf=n{vuW6$@;?;=XyNr
z8lB08)0JiK&L4(8je66slGm3-_O1P*Q=MZ!-~U%{{_fJ@wN+SB>N1>Wf7)<qmC<!R
zVi7WAfmTx6@)>GX>s~@Ci+&;AG|*k!0Il$Fs=UxYAdWRMTua1kQ0<$cAE6IGy%1x*
ztSZk8|AMd{2qKFp61`nTQlLFwy#@V;qd`idShfvSv7hB3bNN*UqI1@za5kbH!&nPI
zI$lTT_<T|C=chWp&|5yI!Ru5QH20IU>}ntVkdcw#L4|?A5*SPzUN*H-A&n%sEPe>{
z*#1Dw_nk2qN2XA3S2e_Wcl`x)R+hSw{Dgf|qr7%p=K|ob$iuBk9wYif9{2glW~^v|
zzsMB3_uFV!DhWR7VEjHYX8h(rIJxRU`|1OSav=*@@CmcAK68y-jy0{9faXk}{iHUy
zHMC}KKpOh}*0;tPMzA*v75Px99}A3PZefLKGeINZ=t=y^MnMnoO8i1Ev?T4BkF*5Z
zFatELUew0%V_?~)J&<K?L~H0xR{tyBv>nmT;j%8HYk6ePTFY6IMUOEaoi<$7Y;;||
z{*%p#iH3Fc`onU+oT3ekWZeVUc_DK-4w^xwp`E^X^Lc5EPpeYfSS0u)VB`?F^|GkW
zI}q9P1T(C=YyF4A`w`aNGzgs5fB1JkhhLCqz9*T@a0a~Y^&fJ=uHgR^{QcYcM%u}L
zik!_ex71E7-DPg7fi&2MD1OuPjQHh%)*ohV>!z<itXjC6Ey%mp9y9!Nf!zA78Q`?k
zEhy&yVNBi6Vt%9QwovyVXFKqpIg--`<G%*j<J@l0;Cs^!#~%e8ZElGFlJ~BL_%|iH
zKib^lN+Q&X=*#Ms_(q-BHJVtLOuUha&A!l%`SDghcKJes^W*h+OzIzs3+618J&{3(
zjxapi-1s^PR;L+$!*JPLqpJxFpTT!vct06F)9AWv{YS!Rzh-zAx>km;XgG@Uvet2g
zP=de0fyB<po=1hFKXp0!8mX!|`hh%?2c-7}<M_Ep&^tCixf(pm&sl_MT^YE+7+9Sn
z0j_)KOUGMAnLW#8_BYwMFk8i6kK}iqYFj!mj^EFL#H#H%;P)=lzRs|pfuEc<5a;Z>
zhp_N_NBl9s(U}eLM|hvx5WiQl`=c{QS*rP6*Am~P6X%X5Rx5rZaV`^Q3cqjW<6K{8
zV1B#-kKp(J?eTrPu=~T~jBh_iD~QWkLh5*pe-jICTFv~gjc*Cjsqy_Aju(XH>ba1m
z#`k_1-zEPG<9mr7-*2h$ZSRFy=lI_Hzcap@q0O@}vZ21$Ug}h;Q4II4Y?{%P?Ocbj
z(ripqFqaG+PB-t~VQ$%X!q9*klrK|XYTehMhC^$Q)ui57i`E~e&a+CKO1}jB^PiSt
zq;)oy3?`QLue;ygEp*N{5_fC<V`3qeBN2*DYmmtY%15V-O0gF4N=PwAqccsUxEYVi
zE1@?+(^L$zR0u6pM^of#A()*@Lbn+i;@eo+aNyMHI&6PU_UJed?F`VN7Oz-!b+1x8
z>#CH>v8E{)`pLRU*$(S+==Je3RcLOhgG{Y+Y$Z>HMxvVvT@UCl6Kg2&#q3D+F%&ly
zlGe?YcueKj70&g-uRpr{!tC=l%*fIa?ns~Ay=npja*P2;Csbna)x@isXElmv)=bT@
zn>EL-J`TseJIb-IiN16BrE8BQBIH{ak*@S7?NH@>u|t(D5T^mnGwzarf1M(KpB*QE
zr)o>_DFlGvO$$F}_oCRyfI=DcUkCqzR@bW4y|_X5qHweqsUo+1v;z-NeqH<%UkBca
zjmH!=@=7D#ipP}wSTes7M~G8<C^+$j)*|dN#w1<@P41lPO!m^vf)5HuwZY37l8U?0
zec>EmtVH4&&7vyZxoOG%Lf+K4x*QWNwU9=`nE&*s4(nfcx9a4a5+h-!7?j(9I1NW9
z`%>qR9@RF?V4^Yzlkmv-+A;jk^&>*~AlAz_K1U;qAP@bbw4rDVy@1Y4>5MbQKtyo;
z2(^Ke<{%iD0ixT@Uc}+n<c4lFGS+^^Ir;sn%na)kP98Z$c)udk8|)x|Ldy(J=8kX;
zoSFWznR(VqOl)Opy{k@%SX~R>_(<%EVT7vipaK;cYafw%GpvWume=|b=O8k#ftA0b
z3!d)XV)u142?vWjiLbQwtRJCYu{Mun{7Bj5i$RvH16-@nYx3EjW#|2}w_FqDMpX{_
zuuk<H`e9}&zdj_I%BSpKcY@|uo}r4H5xN5LFQ6gvi#tOUOImy4+<U;rGMKo+!|-e)
z-1zAMAGF<6r<2;wxy?v>JNo5e`=ioNI!_Wuv-A`DqpqCR9;bOYT0QJcey?=UK9zyP
z$zINx20H)hOmt>>5fHA|0bxvy2DI9{N~^u=6l~ox>MvtbR;Bb_zL-(1^5Fg5W=O+{
zh;xHs{~jQ{*gq@PaGMeBY>2m^3n(4!Y(Z*LS7^7iswLjQ^iCfV>5g7W=r%*CQmfF2
z=i@~W`_K3WHcG*QUF+13TCiD|WH>90XqB&YaK-u28**j5HxFZ4Ir%-i`JmH$$e#R~
z-5d)IAjitTMC*p_dPb(TebY(?N?&Q1sanG<)Fbc;r~a6h?ari{iQh`R>y=fDbCowb
zt0BHnUizc6jxcQXE%ACL&Jx2`&ipDolidG_{xTlGs0(8o>^ox}=s#zL=0=&oXgWkE
z4VO(dy3WBcn_yjl4F<zU8%$fNLYO7^qH{9icV>7e26W`W+TWR5s%XKUgy=uPXlu0n
zRKuBPV0tZ!2=+X~uEliEuxEJfS|fBjM)P-^42<6l>+3SAy_S<4X_&0$bYO{N1$*_#
zMQB3%59X$@JgfQBx03Ja&;MAU<oszRsQv^YK|23=%8eRFgXX5wP_aEspP~`|^h7|B
z15T&k+?bBXvbh0s(}x^BHQ)9-ZH7~a%~kh)92)eQ5z12hC8k0ApB9IK^e`iP@Gky0
z{1ctpAR7YEe9`+!VXaqM2Tc197M|)0_0JdI+l?16J`DMUT>#;;lV(EMh)&l=(12r#
zbf%c^bBYc?MCl@<kTwfq!I>I-#W_WB=xd-0IJ8f5XfHSvU45$YD7i%ScZM_7wKcP}
ztx5d2N6E0c>5hM$-rCNj_;1Qr?l(7aZ-JI{_{vu+dQSqqOG)qRLGMC52)$PsP9;KF
zp!W`+{frs89tm+jQ|r{&VDHQb&&$Nm#6O(ryh)nY`HK!D>7CT_@fVn;<}jQmyYyD^
zS8n(~C=VK;9w9P1l<$zl@c#-Ss|=*7V5pAJ%=#-x*=L=o!ZM7ehL$iu!zbkc?$HLh
zQtN^#3Wk1PptV6UJh<_Gu2P2m@c)#bEB>GB-qS~-_qT*JIF|P(At*I7uSULB%+Jap
zPmK_yLWp4_0^e9oL|-eQ2^iyU2p#r74U||HnHy!{UPoed_dA>=*ax5gR?>d~IUwzi
z&;M^Pqvk%;l9#_*5eNa(TvX+S>|$vlCH@`zG4|cnTMS4RKu!zMY%xMF5?)7`5fhlQ
zNk-?(_9P?mC$uLNWTT0%!Jf)gdF@GTmk}cAz9wq5O0-%ONyWdkW`Z^{-t(WAipGrh
z&x0mvyfYTVvslNZB<-d4qYpt|NcmyhN8_t>GbCmV8f0Uy!^ZU(BFR7&^yp-xs|cP;
z=+H!~G;|1oi#}w)^1gL3oL|Tb$}>JkeJmk0!C$nLDiz!ddkw!2PSAD3b`#?tPSdbB
zK3Ps0T^=)nn6%n>p7@zk`&#Z+DH2g1B66&?CheIS{*k~*{kY1dSBidA;}!bxswBM{
zF<vhbk|=yaeGQ2HiI?t+e+dchd<?2x=|efn)&n_UWKJUJO$gb_R4V>YQgm`d{6*Z+
zesZ{0EA@!@lML6%q8=I7NXnl}f6`6GHYtNbf2t^Ft&HBov}03@u39LIq5}|5crG|h
zlI~<X)39=zX_au28vZYqsPozP^&p@iuA_=#k7JBbCh>@xzobPD*e!;&@BM0+tlug=
zSUaVga17VXfE&0)F~Qt)r;u71DXL%nK8%1rp2>n9D+q-p^FT%aXGn`=Y(eNRbHOD2
zRr_X`Bb_*yVFnnrJcLW|j1ex2JvQ)pu?^<)0%kyrSNQTmJVxSAX^^9YbnB;#`V^JP
zkk0@)Gv(Oy2hAb3j4gAM0AhRQ#(zhzTz`sz+?7UG5TWxtn14~96W|2c<pGi^_K&xb
zm$RGHnN5At_0HF>_j%3)%DHu>&=>B&**Fe8*1uVP<Umq>WLWs6$HQp6VTO7GpH$6@
zu5!IH6<?Kkk&ZWL`4?SmWo!9|z1Q(os*mW(hIlr~Tknsq9Hpc7Nnz$cA{|#se3a@V
z86Sn`1r?}b^U4>4XJ&3>Y}2XL6T#bt%hr&FHyY9EgCt?JYuK4+;{Xy#xC0?gc<1y@
zeON)$vqSh)vd)^Z_Cig=vz>`T!_$O@I5qUbby!tMo)21Ta0Tm#`O<c}c!{vqzw3@i
zzglI-q=cGRCh5lrgtBF;LBC5$s9MARL;v5rX}i>^m^BUY9C_`Jt{J6Yy^_P)miP$i
zx5gLRH9!8Iq95&94ec4mf6|K4s);{af`x-ALchIH6<fX$G8fx32t-y(h?azm-Gd1z
z9<qDAAUGa!IbTyDTxHC-c$+O*_afl0XO%}-uht$l|GrO)*)`fS!6M0m0pdNQa(3kW
zThHgrO>}M)ofy}hOoEKYb;YO0w60iQA7dJR1{2jZJd2ej`I}r19A~fAHaZBva$$hF
z61M6x*cTfP4koG5rr}VGC&uKET5NYZD6mB2WQ@V0JyE)Gr|v(3Dl*5%(uUjrRz1#2
zk8NkxMYInN8?%!A=+e6CZJF}XP|W9RI6ad`Wkl;L*a~_&j<OZhe`EB6O!tU&7M#0V
z#`(|xhCmU`^Oa(rAAl&(JQslWDQjD<Pp9$*pVfxW-EV{#gyCG5l{AJdi6WXH9hx9(
z6ij<;qZvgL($AU=6+GS#Opc#9=#KUUF@D6kI}w_kZG`$8#z#lcEaU&mPdbm3fKN={
z7)>Ni?5Ib~$&dDkIkXhn#>_ut{}+Z0gS|_~xi<B%r1oyw(nhhRSPO;s<8$s7TZ-L<
z`>fL_Q9iXqEdyFv*RcUC5g@m&AYv{s)rme$zGh9nFOAC63N26d$Cf8^6UAjzrmka0
z(@?LR<RenrLn%c9rK^Y;j^R?<Ln`i|<cm|paq`9e8=ODD8v&W>#);S^w1ChfUTmen
zs`VP^9nC-lozxQasf?*$mXR`j*sJ?LE|kFd@#y^Fm~xYxKOj!tofHU}KR_U4{s6Oo
z)MX$MF*Qq4^M`+Zex!StIDj6`mI?oHI{5#y`O)$1$=JZG*pplPAYia3>WrE`R#Wj5
zYzdtrZc9ko6F{TJ<ab`EQjA`h+#`&M_$&XP*^^~@oiGvqf61QsF`MN42fp{(igA(n
zd`4`i!`x;Cv^f=1`V>qldY;@x0(n-`<)ME?-Ya$7@R{Vi&RsA0_tEu|JJ7OHfVXm}
zVr@Yp@yA*dn$D50)`YIXBj?Lp-Qw0eZlm+jAX5MBF*iL!y)F9#)}BM|szn(@Aq?|Q
z&Z%G@MgkGfUvREh)|ssumD>z+!COT@ssI1RyxQlNo~S^m_W9TST=xaB`0sQ6cZ`wR
z<IcCzow54#sJb2%x%Mh`{{t5g7=@>Yizs{(*WJypFt#O##m~hPqQp(qX<QRST%NP4
zLYYLRTbE!Si)mDZ>jXG3+@~Vi+N5ynHSNy<+?A8C$4Nsx`dVbxWIU0&iS;Ia?k>$=
zolLbZ*9&E(=+QRLmGbv0TajE4++l9w(gY4AGk^yJDN#~2X`x5ONzOFhRX}t*2=7T*
zKU%j~OWkB`WiV-`*J8CP6C>l%T0Ochl$1MdpVxgRX`2(K%a7|t{QfBGTZUd*8yGu0
zI$x2R5(kvzC7wCv(ihj5el^D4aC_KvkxLAuEQ%?nUYpiX!c?T>^P~1nvB?Z?K&oO@
z_#QlJfeB&fHsdR5dU{u~1`A{%xy>-P^T4DZF*|if-DV}JjfhfVFQ}fgh%eb0ajiO5
zfrH^x`oj(@d1dq3X_G;i@*a{jfOeBEOEM~eT_2-`X}CW_?mlu6@O0%nmA_b0CO_A?
z{IxWHbwFP6ch&zPf3<p%$ZO^7qQ3FG{j1{bOPaTTI4*CuI_X??wSMhX_|^VDH@?9T
zgwn6vEG6*`nP2M_T+VH-H@e_d!-4f$*Q}j`&mgGy&S4M(POT;jj@bd0?J{G0ceT_e
zrGq<I(A5taP<xEjakp1C_MmdlEsntkAG0|<$_m7Og3a>ySi|#)pRkxFag&lG#5d=u
zH)dGvYEqKa4IDrSiOWgLDh{u79^y=waTrS+9&3>Ce*;7VqW86A6U=ZbeDNzJ!5_VT
zbQYjDsZ_SO<8KW9usXTioB563K|ro=i2n}C$hls2uk4_HQv1Et+Q{gBIkiTT$JG&R
z9adpcXi3IlTrJtP1Oni-D#gel&T<d-6yY?EYz~70bYv^L8Tuvq%_;`je<)Gz(}_0A
z_NL3#sNhEvoOICH#tqweIjU)RK>g%iJ0(#YMPAkOp7kG5vh^~^M`{Rvnj4wa`|!E)
ztcWig?6k8e#q(d_&`M4|xooHv877|rLg>+@or3zNTEHptp&D3Q<iMZ!BMt5AaeC1-
zhyw1AGdEb`4YS%^+`;G(hOQSZxxT4Ul;GG$3PlOs9f_ijhnt(82eUMaSjgK=E*`@!
z#(zq_!tTsDUZz?mDmS-y^sz%1ZNuHQuPOTEi2W|7*-y)k7ff}GN!B8n-Qd$D5;=KI
z%cCA22ndi#7#~=V7b6qY^O(uU(LeW(+81}f3-oxYXEyd}==}|jwl}hvOm{~XNsqRb
zBF@RA_I2pnEBV9rmpmvMcl%3|yZwcxo<RYwx7&O5-WR`$JT?3Se(nyL;`v_49D>L5
zr}P&Q498RlqYWFGmA&67`awJ<#E--$LjRlfnsA#o?`5uq$^T8#y!-ST)mOBI@fmT8
z7(?Gc;fc!-zlkqk0%o&U$C$gt>zJr!ZVWzQyvu%E98|<O%Y|!$S>&i|gZ>uk{(c7G
zAH&xDZF!G_+urfQTbB35{V%4=PF&4j)zv+!Q|oHSE_|asYoYGv702o4S4aD~TDqhA
zxSTknk2lN9V{G`5*{$m17m;t=d62R4J9huinR>s>$=oj!ie-cjrJ3K54M4PON<Osw
zmM7&GD_SDI*agI~i)cx5zZSKM>l!^iD!SitUGl^x`ZHfefunEGTFP!JXPhev^1&f>
zehUi-5K<~fKi1vO!r`Mc?5YYGaP|!)_6_A5CS9)VCyqDnNxYik?{ey0Q8D0-XUHhe
zGhLoM{~+ll$#i#rfKtJ*yUrB<+5%^8UgB)gzfPrh5|3cx%t|IYf};&_PJm7<ePQKm
za*})i3u=~c&AWo!uKM{@fQi33b$O+`yZ)Tt-~VC8;{Koh<R?F|>*p(l!7t*Z*k8_?
zhC&Cw7;Shh^x=e+r%9$~4nA0Ko!I~S8TybG+4G3FJ)t)mVVKMD!3j&Ep*65t4NgUY
zthsQ%31*+zJvX`h@XCO>W%49!@4_o`=^A@)=#{jzp)!DL&vEG^o<cb+Pz5Yd4MNln
zp`DEb2=pAxq@!`r+|t}o+RR;<IqRNrsta+>FU#`69~cB>vm$+KpTGhtJXE@-*f{@<
zkI|LTp>u*iW-_WZ8Y1rl0UnwOm>V-Dz%DZ5>GpG>zkD(D&kM~vWj29nCBHQ^;ldG+
z4|(%Shs`LXI-!>*;9D8+jO1*LzsKAXt#}Jx=-JXAIw%4hz8?pc%&+9&-_W6SGweZx
zSD$$;fLI{ogB8}Pz=jbUZz&FRm^HhIO?Z#F;p;5*&kI*xGZOgOv(RgkdV*I+>(kju
zbK}dj6g<{A9SAr2yd(<xc7E`z^)Gw+)_Ke@zh^RT{P8%uVQ%~kR?67XXx8Ht2z0>j
z_=`q69bw&#M|66(dDmI!wCu80;}Hnth59ncG&4GtrK~`~dPE{fsA%KWX;!rK!?kuP
zc4$WH)9k0r#zSgH31k5;^UO`Rph7$qn0HB(3<m}3<FaW`j%iz`0}X~I@}f0GBdVDg
z4!}mMMnZ>R)dxW#48c>73pvtsjzQ!|l5>-R77{-KrUeb~i8jg>is{UruCm|7{Soo6
zp-gKJ7mhZtwA6QEx@wUhBLI2(NO`Y$7k9G9Mb8P2YyGSnvYD3_Q~B$VA2mg|YaQK2
zsS<p10xv_m(&M+0O6XMC<YF_L!?qBn^lpF_Xo&htN+GM}#!OZKT<4;D<df6*gg5l^
z7p)UQA7YjDZy!qyzQ^HJd7{NzYfEG1U6(Q|_NomsBeGd>9)5oeSraeu>lo>xFU-hK
zSQt#2ViyPMun5dAVelA{KM<`sT@&PaG#_7&j6MAe0|j0fIS5%nXmz^bHN*U_QG6j1
z#r}c+6{^$I@Ji?t`6hFG0o_Drz*o}K9nbNLRr5KJbR;ch&TPEGBGy}H*uxi&pi7Yc
zf(^U-Vo;2IGKw&49zjpx_M74FA_Io^NhEosug8r15$CTr?6#lpi>3F!^=aypcTi~k
zE38RI9KSIlMJuGJ8QFmLz@2b6?(y$P@nmEDuYZ~!*#X|xM4V#25n0Nb^USD)Y(@JJ
zFPMxs$ssrwZ^23ikf2<OyfOe!H^U9Axe|#zNXb@RZGjY`{KYBlu`!^EL*4wePdZx-
zel<G%j5I7A;Y^RY;giEcLkPrsc%p2IJB59}j@9$AJ*)=28KEq$|Emo8i1--5M~(m%
zN2h<|P~r^d3vS-vnW5LcDr@l5BRs2w3tTG<9(W&5_)5c9(Gq%o6Ywm<UU&1Z>+uw~
z@Rt1kV9*09TIFOFSc2n$=6CzTm}y+fTvL!s=eXdA9J4rT3Xnsp{cc}kH`?aG>;hDQ
z&w9D4%z`Ro&y>Y6@BHvXeMp{G2hl5lkQFn07Kq#vKL9XUv>iobEZXr}=#vTNolm$$
z?YC9opRw?pD0~71?|wk_No7@)X4W2x{|N|!rPRh4l^f%0kSEn1LIG@L&z+_M`IZ_+
zsoJEh^r6~sI%X}}skfk^mfM3)eQw%dXf1ZKo!l!s6;Kx!16ScwU|5uPs)zBRyXN=c
z>SBv&^&xCA#ZgK`;++XRf}X}XO{L+~=is>UA>Z2CXths$n5iD?vBOZ|YLy)ou7oL8
z9~;B+HVk;|bha>V7lFc8eanhdX_T9HvLKT9;i$h7dZQh#=PFpw`JhM#hGq*cet5)!
zou7kPz(QE~HoWuNT;Io*3TLk0-sMz#<#g@2d`ta`=I5Y>`7q-Pp(@)#JKK5eRG+tf
z!KvfwCXUMcZ7fS%bS8JR+x@F<!7==zH#s3i_=Ub!hEuRXVja~*ecQ^x2lUUtmj!d2
zid;J<z=Nl#CbsBiZ0)G|+e8Bh`hcMNl9ont)l$p>B{nC~j^M9Qb>bIj>2VCBk;G<2
z8Fiji{Bs&-&L=7i#~<MVdvrgKP?kWL9i(4bnQmPG9%OBu!d4Nc<t7stxfpl9hIVFi
z=Q#S?`v#MVh{_WCPD(Py7r(N{vvTSypU;8D>f4_fDNe1BG`L#(dzRBe!;@Xs=C{^j
zkzUsti=Tm0#HgJ!hCv!#5@hG+z!>NhP!(TZIRRtXe#idM-XEKcZ{65CM3H=I<#~u0
zxBnFgKHdNNg#P#$=9V3$yX~jeg_G;I;*Vk9A*cZ~Y4bujKkQUwC%Wk%efs^KP$67W
zlvB`b(N6EZ6@5<Za?^v&scBtI`zfbUuYVfzcgKq_%iwq;_?X_?&a_Q947!y^s=@se
z;Bq=yJ)wR%18Ez*6V5P<I6Vk#+7gAtn8<EOo;Uby$AelD_hQFVGG&M<W`vH0q{?iq
z_ia=jzYy=hpBY7caw3#2M+Nji4XBrgZZ<%wF>m1Zr*b6%8Kpy=CnRQ~jnW+}rk3^x
z|AB~#{m1-%jF-Ir5BbRpd@HN~?B!g|`W$5jto3jA#X#WE^NnbLhmo^l{|<cyV#<-u
zN4qH|t0A|{$l-}$)RB_GwWo~FK|GOd%>E5vFO4}B^POw+qTY&V&XZt@C+#=xz?@Zf
zqu&f~#5>T}IW?ajH7FfidoH|Leyj3`ppW+NBkynj7EoKe-^sv!XuBYgHpqR)6tQWK
zVestG!uf!+${%5T;a;?3eF4*2C>Y5$=`@HZp5g5RHe#Q>SZ1@kf<IFSNotL_OuTBd
zsdf{)b;CLy=$_YYhvl*YCEaU0SDWE3`Y?6#@f9X~fQI&|mzv?xp90Zcbp|(-?yB>u
zTh@={r61fL*;SXLZn^5_V*%n6t>Xq|`DjVbP5Se9yXvw@Ko0TVRz7eHWB1C)e~`h}
zWehR#2N@{6n7`U35S~JPWEX*NY#z-Yg4#AW;%k{aBQ7U+dmB?~`jx8b3WVUy?sXIJ
z$ujic48O?ys0)?gJS1@#t?QnYx=<&Bqar@c52p7Y%y6#BOWO@xeVh!J5Xpm(NSp=L
zUr~hM(Ry=@rJzy1%u<dIp->)I-XiU9>4Q$V4>|#LVvD|&&pT$F)b3_@K6{MXLoupv
z#Ao&Ug?JCr6WdV^5aP$ys@WoaXpFal#`63X-<HV}=Y>oQCgR^lBC7>qPaf0WH^^La
z%dYdg*&mB9VO@{N{F8(;!{;O0t~y_@@OmthvmVDwkq>g3yY0Y8G8|^-k_Dp(MmXh<
zpDe_xpJ>-{iYk~#xG)z#1pk4oF4|MejTqR`SAuitkPe@mV;wcCh)^3R!rsh4O)5Y@
z!NJ>iPQcrDQH?liqhI|iBqk9o5#c~|z2E78;e*y*d%0BE<J5fbW6`SZYWUdxK&<39
z$o$9ZU6gzeM2<HUEo~}XHw5b8B#~j~Q3jPn()Eb*Yfh}bBA2SR&L_|1Hnx=G<xE)9
z3Va86C&xowZtr&7`90vetT@Be;7lQpUi52ujGxQOBnV+f<ZLDgQ-*ESVeBrT?E0K(
zSr91%KE%2=;D@Vd-OUX}tZh2d)hQUi(}Yv}bj{CZg7>TO(|Ff4-_2I0ackeE2k;mV
zr?lF`XMBl*m`%z88@L*rUDn{YZp2y_h(s>Op7LS6SEjn_?WZwIidMdc7}E+&s?IYb
z*P;qoy=Wb#9eaUPHu%8$Vv7%n3a`T#5U*yt7qhMFvg4nH9MJGRkm@gt*T?W8p-T9P
zOwiiZ#l=b&{~lj?6DMg&SrEkf0f_|$oUU{+%*ERCibg_9aop;t8d=4EkWDl)L}VZO
zmWSPW&IE)cvAHp=U!8HN9EN$dr@d!a9!fl{^>Y-?13rFu2U^C_9vCi4WlkXWkePHI
z(D^(e+lC9ZhQ2@E%sxXy%LKhPyR|1VI95N4@vMLWnNBkZAE60qnl7W%{=Jvb#aVuQ
zDF~Xn=3SBea`?4Qj<TugrMqEM=g_A1ub5Ff*xD0(7h5><2m3$qqP}wbZ7{_?6nkDi
z&<Cqp1SHErU_UJilolHD_3ozFVsQ70r6uDp{|8NL1<%Hi8&5EYGO>sNiK>V9d-7-|
zC?;)hq(6lqYz_K>Z3PDW02P{qD`3_&1{$Ojh&qmO49vuQJs%MFpn0r&P>^&FPD<@a
z!PY+$b97^yU=EqFWh;jd0xkO&VoTp+M+(`IUdhaECVd6T?2R>yX5#)%k_QZty%FdH
zw#9#p6@s(qa^VXb!*+G*_fO)pKb7Wb4c%Vs3FfLCgVht#B$w!2RK(e?Y!L4)rYECW
z`^>wr{=bv`r1VEro5^pmFjiNyHh@Jz>q~mLsPjOW#EkoJ5+=f{<B$pJ)Nwm@5>NN^
zVv0iBYxHh(8;55!^C2ic_uEN{pZ1=COj|dr4B~}@j<KRKneNd1k?$+9OT?KG-CT^-
z>}XxuRS1fn=-i&Sa!%B{0+tkwV#|9WQYp&Hx)PCCehV<F&f^O4<UFT2&+aPBKa{rH
z#v*`sMbx{4wy`>ZnlWhy@lZS0F!iuORWbfDOX6{bkL%y?NP-0;UVq|M7;>gFH#fTc
z1oO@v?0pPQu3%GFAhKH=P%n(w_hxxK*v#t8Y)jh(#myPx+8k$XuDz@ve}CE`gca%x
z>s-x%?Wl{pM4TzPNZbwc<(z^aD|nN!;W~e3t+Uo2ZO9%MKXfXGam0HWOT=s_mdaQX
zh&h#SB!M?V{n@2|=o*4*$=?s`)Aqx9xb6wL(FIiH*J{S<kM(an2COj4xI55?2Rj_-
z6)Zc@VIFwKcU3xY%Yhz<6@Q0{Ihf;w1G||?7okA<10#0_cJd{?5}i=hft;*v{Z2L_
zVQ!9(l)d}l5;xdjyHp2!kF)K2HzQ-xY~w9{-hoZ$e;azR&bMLi1gD|}x-9%v<OAX0
zmN*{t6xfQ(el1jI=p!$V0U&aPEbG1;`Y3(%>Ep!v411~<NB5kW;5Uau>#n+Dk7uy%
zinR5IbEkMbYqJsX#|mTq{{BN5i~AU^zv>*m$7X%st~v`9!`;EjG!U#fFw)e5Pg&9l
zi0!)%>f)o!;16X)JenL4dO~q7j@s?2SDzf4nCL$G*gE`RN+$V)MAUoTR!{Rp4+jO@
zVGaT<hq1F~5R*b8ZPyWHXJ#HmWr%dC%gc;iHxcgxaaqKbT`)>Nsc{EB2<@8-RkzJe
zKSw8`#iw8tx&zX@la!8nzoAED)O)&m;%rH5%(thb?c)!}^`8iW)q%CSz1v(hf`Mq_
z3$f$nz1kn@!}wKO5RN{6A4H3ZyVR(9g5H(PZBXC+@D$vEJ#PNOPckw3)?84!!@LU)
zoF`g-iqn<r4tN>u{2^8u?U)#Iz{51CZ-b%kUpA|u-prw1O<ir@p5xq}YcDCtAC{qB
zZCL&uj_=92c#|@|tMkgL{VQvo+mAWEm#~C8zFk1Zw+qPlKD=TG6FW4@7GX!+@f|Hs
zAKw*7+A+Hl!vO$lt>bp(Ohw;g_Q$+aHr7d>QsZ@^uUxD}U%9}M{eixU^K>+o@-sjR
zZh)-o5+2a-26&_?^}G6d4tUuPo@P)xtb`}-%<v)Nr}tevfZm5bIjeX6*D{T5eM6b>
zra?JQJ+h+JWGy~viOD1$yd(P%JgaTsJABcjLBEZ?cP{9+3co7Ry{^Gy;fSScKQIMd
z#k895WmmI6>Hc*I9%@L=J!cqBt(tqTJ2|PzICK3nq%%~@bAoEp$alYMf>vfUIVHX@
zMn7U_F~=xA3^AcR4IdXr$HIM9J4br<);5f#?a+808>f4)&IIisTJYC!ZIkAiF78Z2
zCc|sb<KELpF<11+iP7XfAE2bydq**b&Dj1i#?x=nR#{zMaFg<X>pq5}mKYgyHv=hw
z6e}D5962Fd(4iRR6rj<Y`{_*aT4Fs2?P4A>U=_nXan>3e>Lyro))mqLIoYWnc4obY
zO)&L`Y#b|xa>fRaSw0&FTd;4N+mg*Kb0>%*gHscH`RFdk6W>qKor%Yeu3*14Cet^^
z+QS*WK2S%z&>V*X2FHN1LAij!i>-cwyobT6&E<>-kA5EfwN88DB*ZDfI;9uE+Vk;U
zRVQfRqo(h6U673Djh?69HU2z3q-Gcqi*+ZDPG(U}8RGn$L&=;Z+nJF|5z60<qf==^
z&Z#{0Bj1L=Cr7ndjqT6+H@LG8=3=#TUw{WZ?MDLLxH)$P?k4nDAk5oCfen1Qq$2Vr
zK4p)`?%S{Ms2{^{s&lcr#dDhYl$7eS0lR)L^W)2STuunzL11#8J(Q1+u4;>k6r3&0
z$v<>e1=Om!@hi-O?OKH3`@pHl9<07X#dUH5BhTUVC}4a5mQzV1|MzLn+Z_!28u<ur
z=R)b;&JW|Qb~OG9aYrG(ekXg$c(2S3Qrca2*I0V=`jHW+iRpR?0*Q{vu>hToKP!-O
zLKX}yM69pG{B?D)vm_4%q51u|<sdw9#fF-|zd6+wz&s$@WLI0bH9&je4N<Sb-5dLs
znse+5UVvA5$Rw;}z*D3PQYI&1wZ5&vVckJ=7`3Dg(y+yD&4Dr-@tWabpl)v3i+@8S
z=^EeF=YXcEuKVfs6n>u9)hAJe8n9N+RSn`kxiJ6rRvUe(&P&^|{zIB&9875Tb5c@;
z@8ChvpidjBuP`_Adn-;?Uj94%hcg!MNcuqLrpu8K^<MM1>yor<mxKXEDDJN|Qu!#C
zM7agcd9YVQwCUB_C8-X`VOsDjG?HmXIJ=brO}h2cYf7A^`*)Nfj5eOXpKgzGq$b3(
zQQYnC%&neJyarYgib;P6Oa<!X&ZGw13q?BgC!ZDLd@!7}<<y)ww>*qo+^wHWOk#hB
z#&*A-nFX#u*7+WHF&(k{CxaC`i|t{YywUj5KB+P1JQmmtRzY4FXn4Q=a;&O8$`|#l
zJj<!CfG))J84J7^5#8%J-u??un6HZxcBWF?^3*JFxq;_$dkEjgNF8EfHEgj&71N{a
z3D$t)bEBgyZ?ImEvhu(PV?VR}c$0=saHo4#{s0il|6SUEeFN6Ia?_r)m*cam_(+Ou
zOr=0093U%ci3}743Ju=qbup(65zd%B%O82ut{2&<&$ceZnNKtH4mxQk5+{qjz}FH=
z@$!zB*z*ZkNSMquHcVvdbc7`MqCM46<9BwnHjTdmLRwjOU}>rWA9buS!>cHXnq1k|
z%OsU`04O=Y6yFMg3U-h2DQb~a;PjEi5gm6t;$%BhbA>pFnV?$G2LGo02BgVHa1g{H
zY9J88Zoo->0AiLu{#*Dcb^<@3f&C>LKZg{1chNpIo~sZaMAx}AQu<8rZSI(SI({Ou
zj4GmX%%>3w0deE=#wT2*6Y|l5&{N45r&AEDXL)-pFvR+?%xQ-CB@8iOAc68+QTd)<
zi^j_%#jp(nNdZ~WJFQntR!Yw0e+3%LjncR51UzGzFO1r&BfkGasgnr%X6}SwD6AdM
zz`Wd0J<hkJ<-dhb_oV$9ABaITRDCggYOamwQZ~*zO!Y&_W@Fb+WtRFl#UreuJ_ny)
z$sg8|{B^h~Wm5xYcox#4)3PCJ;0_p)owgg+Yd^YbS9uvtO{WCb8}=lhEB0U$mc_nC
z@=V1t5~LaNs*xtYEYjjj;LEW5%Q^g?^9N;MMka9B0IS_ji!VAY2GMq|@lv`Ej7oPA
zq`UL9_+DgHQZ4cNI~c@2x@5lq$(9hmn*YkLpWQg%EEglo{flbQUymoWjXC%%GN(n2
z_>~mwc90VvY{goUYgF-L6WH?UPSe2xms}MfS90K2(!92$4*ciPf*$rIGUU@J+a>n(
zh92GaN+Z4xQs&I6fS@39L47klP+^@YSVp+3!zHGuhSN~KTo;b>xVXrtjNQLrXIz6_
z>94>romT-G&IvSFf01$fk{-9{1N5^yZdISzVHvj)f=E$n50H`WxIMCO)3I7OOO0D_
z8`a9Vtx0=^y&E@fWtE`{6xaHiyR*4eAR`v*KdIyOk9xcc55dbg_X<BM4g@Fk7+T+Z
zTUZyL4nr|!Ku2_fYz~>K6?zJL*;NSJV)*5wyw$N6bbP-a1N6;~+wqD~w(?wbxpX)G
z8EEmvqRj{J!5#Tf<EUQ`wExE60hk2mo_%;7lW_d%!e)Tmq;FU_;QJlOgxcdj9^beB
z)CrVe=Q?~UdOGAJmzzg7PJj@aTW*-lp*#zHlRe?3L*~X8C_NnV%c+BM(-PgcP4bu#
z{>}v>lHyNQT?3aWhYQNXrS-;&3`_!K{Qm=)5Z$uDTY56rdr=YfK#qN~JqwFi&69Uk
z5^)ce>kh7b;$-SGc6~OyRM8TZSZy(|X#D9ET|BVzouYkI6CjWoo{i39T!!kiy>x)-
zOscUdPV1~(j7=y9cWest@B=a&ue<T{2*>APExUef;eE~(U91CPANHu<TMSy|52Pi4
zU}$-^7h8mW#i;;1ffyouAOXMP+=OY->}yK@NS}3eX5!2q`^hS90*luAcGZgE0TtK1
zZa>M0Ml62_6fA&0n}aQ@W%_5(3KQw}Kb(wc5c3Exb|@9<4>Umm&EPkhK<PqECP`p^
z_zFHy@F`&>?BPKC296y)8hYMR5_2lvAx?Nc;((;TgBTlqLs>B}MtX1rl0WnDH*WmV
zdR!;N?~mR7Pf6W_R7znZW>I#3JRMbz8DIh37C)n;EY;}mPpp6AJ~sPM;9=hG3Os^a
z_nHYFXN_OEV1u;)>a~v(EWkGvYO|c$Jk0U(clD2CEZ!v>bm_Z)_YaI-vN~DkZS8r#
z7Jgjhdw5|Viq48TEnfWO<aA8WW?(UmE)g^*DywJgDBG^hwu;KGg-`Tn_W60ly5Iqo
z;>8_LQ!3Ix&?)@FT{QwF_{80NcJ-m)i~Qxq5&K4nrEES!<p{!n5pfy{F%A$wBZ@!^
zr!kl!#y%ju&4?@(t?{el%rh!5MHMxk!{MnSrrm4kWp)F5XGWf=gsrHPzcPd0PvS}z
znBEv@94pZGGCL-xu2Nb|)N8eiiM>!LJXot;%mTWYxga#&(8c7(|8rm@YIE~{gXzpl
z0~1*2Wwhjy-#S~eDK6#rBWGH_{7SjvD(P*#h(*!{yB_xB8K+jc&3UjV=#2G}m=Mgf
z*#~7gXVAZH#E`{zNAx_kmNbBOuhr^C>Ctg|kT==`ejGFagMuFX9!@g0jiCq66D>Ok
zKTzz+mDGe-q`_}+ZM>QTVn5tJwLYF|Po7uy<e5<h-wE9s|I8TK20t4Ts1AG-ev3-h
zjJ`xCtfkPa`p3m{fkhtUMGiI#an4#{{<^RAs$Cw=`Bt3Tdev^Qe;s<?deuSC%2xQR
z$%sWxAhsFKCW1TV4(5l=z6O~ms^8>bym-uN3Wj_x+DZ)|#nZ0F@41cI8B{p$Sp;hT
zdvxy|UVZ#Ggp|J8+nW*vKH&urf#*B8;eUqxBz}?d_n5$yJ1x1T&sd+rdNKq4lM(2J
zbHEsG9rh`h;fHXx$XV-iYRe-O;9@h}$v0E*rXsROy(z&P?7e8fMBOd+&k6GCnv_>N
z)T>D;ukOSvRF1NfBO`ooh8y_`wcl9atjR(Hh(Ma*zXB_24tS+0s6EKHc!f3MX+^Gj
z(!c*w>wXs!v(A(TNjJ{qx#c#7XGF-%@I08)1~WW@8~2fCgI~cXc)V;)F-A5bQ}_W&
zq~TY{&PISz`Rlbl`)!D*<Gr^!_Fs^b(wBk>ED9AJfJV-6ZY%`#AX~(qMEsdoQ#A*9
zkYl1#TY`>Y4U0Rza$L&JMK+FP>~P-r9kj^b9HdrB<dGsZXW)ReA~?Ta0~?YX+Qnbl
z$c44Y!LQ_@gfk=C$vFewR+wIS=%ZovAq-gSiWI_8O`<w)@>TGDOcd3x8_vOuMorF(
zara`ArZ+G$(~F9^onj0cky{~6njUq=HXtwC7LQgOW#xM-siGytIYC8pu7^rBca(P3
zH#u}xAn!q$BeD`d#oEY)9J#_M_q=7D@5Kxpp30*FKLe?5yEM4EGKv@aTdz7yK|qaW
z<iDXj#t1`%yIb7y(&?ikBfs9K^@np7dBUGs1y4AC4gZil7{ivxI#ushsgq0NN8<w=
zA_O#uSd&JBt0&A^?URpj>iF^hK-Oe6;W{ERBRig8b>MGCWRHx*$S}P%@KxyTHUjp<
zp9TGdk%6Q%2Y>;$mGJJWfHqc)R~Vj`VR$M<>hhyD$I0o%PK}E|59>TGx6JfmZw`xF
z*KrgEf(Jr7%f%f4z3|N)B|7+_p_hTwF=#Z(y8uWO{FYlo&;P_OIBbfn!4R{$y{+~o
zel$j8|3u&LC?Xs0JCYff;T5_5Gx%6C5`REf%w>5cwQJ-*_zFJBQHMYpC2<;mhs$Mo
z7qgGSFP@80kMGAG1t(OR9KN7NoaZi)@3_O9`EEN#A5-hoBABPMa*dKA=;dOtj3-xb
zu)_3zp+e>>RJ}W{BGC>1{X<2F<2SrV<#Gf4M;%aX_%2-=xggShi~&9EU(9#<znJg9
zA?d|&J52mGt9<_>=UP?1qf3)k<gBj%`NodNW_-TyjS`I33Ye@sY&<WpCA`kxeQ7{_
z+>P6aJ12xqxCdf;e~8hIXjEiRkOMz=TNXLbfx~GED2bQcYX(O(2Vfq+nkd#aiuT3U
z!I1`tE!HLYsTKKSybZ5p4-TBF9H*@$^5)u$ordhPTfM6<h)#oLO(6d1#Rj(>S*3^8
z`O0oJ)?`ev%<9q?X|G?ySxN>qXFG^(B3gB$UTD+$2L2m{QGih}3n#LxCSv}}1#mDL
z&8kywvX{^HV!z~NP}5kdW4@?2l8uffo*PRq)(3|*TInmTG%OQ=7@VlIF*CuxRfsW>
z0KK{HSU?LB`9|H(6sx+&t;fqs7?%*}?ggBxw&)FQ&TUW;K{Me;|EyLg&HfF%#))Me
z*rB-M?{4MEA9}R)X24D~Fj(O|5&ICgAdcK&bib0Zp(zt<Sib12RdxoE{3d7K_=PL{
zbew%BpF=x+_HORJ!cr?Xpiavy&d43YnWG0Ytk=5V$*^~Cn3jn=%%RMx`d-l-S(VHc
zj$<A3&O_SE!G@xO{)7BcE1dqwvi1J0{g;j=7blZ_Zt~WY<UGCehf4;!^tV%z3zMb&
zZu0FZ$tALjNjIPE=D40Y_J9w-4m*o<a*msPC6o8{wvaNEU^J^X-WjoTkra~8MkUu5
zXBO>gF4~80Qa#E7js*sDJEY#vhQhJezkrHR$v`hQ#EME}wK49cw)g9a{;ujgq+uDy
zr*2>!A&w;63e>Go-2%J~RyQC43sro)2G=B9lkv*WSG%f9)Gb@x%GIqx-E!5fQQex<
zjX$Wa`!>d3f_y6p!*ok}2YD8$=7wHuf@9BMUSi&4FR>YTw3q)xwG24n$J10?9_!#K
zJM3C}W)+Q4ggDs=AcdRL@LO5GBH|o6swt?T*!PRD<qcB;?ogNWCp<*zjopU^2I~=C
zfEr=w7)K4exk1=Q5M+2m{lsV;&rxEdh#t25QO`TG8}Kgp9)<moh%y3^qx!*}&ta-Y
zHAIFYUs6wuc3*e>1Ykxo4D<?mkab}&KH>+SOyH~>i;(#A{)Xy_oD6hl5k1g^lo&I~
zV|<(Xk2+;F7Au$gV9!^!;is2pp_1a#I-_$6%xQfarb+(djPvU<)yS;Gq9YQaeYhV<
zv=9Crt9=;pA!g-)*!2)3sW$kZP;TN_;e++jxjtey#o*os{E}oH>hY^D-r+UZ6tHNS
zT;mAhz?J$)Abkrcd;C6V_m?t1aw_xes%(2&p1VE=#Jy0E_<TIR3Cjp#16Fb?{DF)O
zm6=G(+ED3r74&v67w1#<X$l|=h6Rpd48Ck<mCsq(;hY0Ev3{JsL^v{&=eILXh*=lB
zzrzTggMF*m{&~XtRTI3_m*;m+&NT3#`D_1~)dY8=ZEjOky_Y@Y;LJ{nm!AS{^kR5Y
z0==<G2tGmI_CmDqp`0|7b23;bKgC~&gp;w@k%31$+n!e_8;9+)_;fAiMEt&04i#{f
zx4>IIVPz2*hT{gm#cW)e2L7HW<G=WBS04kOM(okgW5lG$Bg~Ie=^JUluaF{LR{q=q
zCrg2^qCjH5t|itEk0Y_yh33MMN<8L5g|{Q;&t2#p*naG9{+<iJ5~lx{*f`d{x$=np
zTxveC#OKT?<QDd)K_KVK(!*vLpJDSLrkC#2c7PU`(stM-upf}l8UDZ_m>pvX(diBK
znc&NI@+G)c#_3VXeE`8f_;!QVJzVj}u_w$y&O(R*ef4wyf>T?Q)@RpNI1{+ADTfB-
z_iK54*@sgp__4kU17QeHv?><@s}%@I1|@PeqL^H9KMO1FkN`jHaXS>b1PpUUVppwb
zTlo!xG5V17SpUXDN;tA0)gYf*%|>;U?BWa_(WR77>QBH#9p?kAx)CgRBM#*qvC5F(
z>%P@%SRFtCA&;ia4MS2Yf>PGSNcMNXa>(3LiBV$gU>=xlvO4h)0Ic1zbtSl5US>1t
zAOzYkYsv|pfWw50k5<voVNf9}whHqPb>;|AsK4!Tz&z7mK=k2~5N!mh^IX&!f-BId
zBb+c3xq*Hj(9gs9ntDLUkRx5V3=LpFr*<J=h9w?@Zw8F*Mvm%6L1Htp0v_8n9u*3Y
zV!>l|pxniyBym;`S}Gn}O`)o$0x1<5$wD*CcovW>2a@GLl0O=T426Q^RcNnpERrR`
zAAvmF_g<liR}A8r;d2;CVgl(_fq8G@UXAP%8rkUz*#<$@3N*RMHlnWS8lM^~3S63i
zOVfz;6(rOM9@nF)nz48^T67;9#`dsA^>8})jZg1Ny^6sNf@8T?aI6s=@57WT5!N_9
zs&Q;nIL;9q=L8nIIL_DjwU}XUCIpTPf#X8Zi(yqX)FOB;L3J%-@tiMmIcF@MEyT0m
zIRP@%CUV{qd`LEj0PPmk)}~22N6_x#k~7H~=j;xt@nvjOiNZFG`D%rEhhRQEu*${U
z(wMg+NQY9ud=)TX1<adRNn@ZriFx~2%q_vZV=U(FqnNK2%-eza1lBYiYru`z^`r>i
zA(;P|@ibz7iNbt!D(3cGvdxQlhXYWdh=00DAS}B@)bGlN19u@!dU02vo7n{Ok-Ox5
z=rOsWJ7q*d<zSD@Fssxr=#RUqLe*_ufh6Wg?Or(0jW=!&!-5_<sVWUd<NG=NPs1*E
zg*jA*LR|X#eK;r5*J@5(RSww&s2PQ7Hludc-MjIW+TD8ryWQm)j=j6b$>Rbadxfs@
z9lFXJx_S}bb+4fwgrP|37;C{XJhfpirDJw%!;DPqoZF0aR*M6b@_X~O+!-$~^&Y$Q
zvc(w6zh^dZ&3-+$lGEX^<WZkvh3_8?D*fYJ<3pc*fXvjmO5VbO2LUU42X6uEl|XfB
z2(}|UjY!`Pq-WCe807{FSmy(2)&!*OKf4NiLvyCM9NXikp)B^nP5>&*Ro0SYaf=!b
z)yAH~Oc+0Lh4>cWXmcCCK`|2BL}UI<dj|?t<s_bUYCU#kj{00%I{Hk;Q_tTW=*ClA
zKC(sS-=UO$d%PaCh&h;}-n7JTXDE+(8t^8*1<C`@R6zw=;&UMd+J@w+LY(nu#fpJo
z{58r1OBb{BvltCMGiHevS57NkHZdvKyfs+iuMQ2;2o*ZFz{=5MRhH2&j$9e(X<bHI
znqeH61NlekNn09z6`f)^p(ahCOUWmR5ss%LZnp6bWD*<CIdhia0-xRIr1$?dJ&ila
z3bAu4we{?={*B;rso?UtBl${$e92L9_#L9|VqMX!ue8Zn*X_Cv<Z#)IIaV$k2Wt;w
zl}D^dVUn-ECbz$djI}w57u@_8>HK?<U;P{d$|sA2Nq_l~1}XK7JD<VS362ex-|65F
zV(P-9*F0&8Q+~~v1)1Hid|aLh!mT`Axt=k&o(@ifR%hFD1C+PXubINz#twJifF#!-
zIq`}-w)621@`%Yn02`DMTwi5mm>W4#`Qr(*;Ogyo5GyHn3d`!f8=mfd`Qr^!(SCX6
z%Aji56GzLp8{K=oKnG`lKb0&OY;$IFUx8Z-mtolhRm)_l#k`ZdwpC5ptO-9}036n4
zIX?bE2R?cNC5_W1*vSy|c2CXpV%Aw&jRnKAPz>(6H-3tgABWo=s>VXr*lcv~@otz*
zFZD!K=MNy3Kuv!3A@U&9Ccba-8){EQ0Q{1YG;Vzz2jRQ$9^cxUC6!D~sbo1TnUy6q
zhED|&$Xtia^7BWeYJI!CHV~Ju_7JKelwd34yU3jls*7f1FEX&3@qXrHxono>Z_NsX
zgHeI_4_!#=eBFg4=bv0ia{k_h1eZQSNA~1bWcNC7D#`C}A|pKgG5j{~TrY1q(P<dv
z6u$MtS`l-b;qv)f$ycjOU#t0iMY8mKmQF!q0%;h$E=kNYku%Q5K+*T0*f?#9H!Aow
z7uM;|x-d-<^6zwEe!md#BN|RTK=RdQ+sgv+pHY1hG6>yIXoj%&TC(>fVq;B2*;Od(
z%+MUBvyFHBeo(yKt)QJ1%q3K-#Mac3!{ViEy4F`(3u(O)dAhF!Tlq01Y5V_T?Onj5
zs;>V33>hG5^o$xcYSdsyO_bUM5s3s1<SHVfToqAlt@Tw}d2vP%xddmT9FL>X(zn`b
zZ`#)OwfDXlP>_ofP}?HDR?tTA*3K9&s1+k#_<z28pEEN_P}|@8=XuDSv(LV)z4lsb
zuf6u#Yd5Iqmw2<w5aQ8_)sb<<@V&7huvIgr413-MDB_lf2FFWUuRA0ZJ6v-R;xiDQ
zxnQnPFx+Lx-LTQCK0JR@ysmKU8LuhQI-eR4opmLxFR6xgutxX8zPw00T9jGJ?7{tR
z?#4-4pI<VkvpEWZaNx??vYLnLEdZ%7c3eM}zR|G8C3E}*mRbKNuAiv;24|pO2lAk;
z0=f_69e^d~Us1UDFmL*-yezNLl$o!qclD9)cRwg8h2`MXZ1&iReL<O5YURLuL$653
z2KSPvsjn&V=|1sQ8=DUa$x!4qN0lJyc}X;WFLCCAgd!zye-g8Fe>w6KAn+y`0*U>a
z<GsyVmj5(cb~a^gj3de~_l3)nO9BaYT_C~c7zx%_F3P#pLf;PbeS7BIBuQbv-*3K)
zFW0J{R(9P5JP%6GXy@VAJlMcr%^*Q=F|HZK=iE!L?v!A&y>gPLij8{G-;{<x5xvqs
zS&VEQ(I7#XQw}*T1#&bi#Ltt2^9A=SVg&@ZGXGuNpz1U(N_ZwnP<5HXLFH;K^P#@=
z9|WSt<iJ&Vz+Ho4nAsfErT%8LhRQZ&MSw5uvrxXya0XD`LUuE~B!Y4VqA9_ffyn4#
zc@SAac3l>ECy*OxsszoEK}mHrv%lW__WcoyUmCQneOc4CiI*0PSY|uP)b_G821RA%
z`L8@%F3a3wQyx`{<mEic!=CgXgLml|yx-@)ci+LwcX=^R)Us!3pTx)>%os)#$(}nW
z(z+ONF$95wbe|fSePraz2_3a3`Xnx*G?SO4nVdavUYDiLZK6q}t<g+~oux;kZ>-KA
zOpCe;0&e=TyEE57=50=Xm~uvYY3qx)p#kEgU>L+*!h<Ow9mm8jM;`xzS}=?4O#es^
zPxO{2)*d$0n<FbB0=FsLI$<EDJsZL8+VWbo*~c*=)b3;P?IiyM-4R9B4}4QQF#awV
zQV<Rb#jy-m-LX-L>8z}qfaz*i{UB<Yzdz-kXQP766^u3I-r_R1=Ukbg8M!NVI!VRO
zYgah=bVzZ3(8tcy5*tw#)RsJ%g#Hqt)TBxd>@+x6@Vhbq@h;A3VX>yZ<>q0ZQJJFG
z_o^$U0XG<xeIb#u^ra}W?X8R1XuG6!@n9Cb-w-DH>^Ium)f=ji>JfTyl$P4lkz&~{
z>_<vpP@J3OqiVq^7dRJVdh<)fj_Q~D#=|kp`@?7<c^VD|66n#pXiYxCe#M7=<!}0~
zNmb`Zs<ozu0AWq#7=XjAvj%?bO<)7mx%F9~wG{{c4O5H!OLy%MJ)jQew<!0X{w=nd
zRJAx!EozN6*09Ef(cbi^8?2jadYs!%5lw?^|JV}AhUB0Zc0o&VgAeK`axaX+UU}lk
zF`CRiX3!oW%t0`W_nMUNk;3{VC_Y=o-GH?Y^k)%U_-e8SJSJ~t!($hU$AZ!gl(zTA
z=C$u@+hg|2QINKq%hJcF>HY1-u>UvP-wjAc)8DoT4Jg_4*WadP1315jehd5LwQ#6u
zVfDL#VD!i9+{Bv^E%e*&MT$BrCJYYz04koo%<NsWBRMcNe@C}}UN>=lY2o61JL^lS
zTIXpKZ<k}73T&lyVn}vUKEnIIUID(g&??h!e55Hi4C8ZFAC5&?X!h2HZ@iN7y~mqH
zS~;eVJIzh5cX&tU=)SE#6<uvGBPzOL?@U|5W?eAaI$uzhegH@Me0{9BW-&2LM`#*q
z0`SFO3J%%?^v!A4aC^W7V{4{Hmk=ajID7V2!3V4_**r4-J;q*QmWi>m`$9Ue#`1FO
z-k}`9#%TbhW1t+Ag%bFNFZrG~btE3vLnSWz(2E3ZSePGdxOD2s`oy~8n&+1MBUOC9
zN1)-UI4M<l7gupDS2%$;ds8&DKJ-*7oSM#fW}0O1Ynm<cm3$ma{Dax<+=|xA2Y!@T
zjG}swcX7U=YR-gE-GmZO+cH0txC$@#$-KisM1ZfcMKzB(W7CQCr8SRV`;IrYyyjU}
z?`(2iJ3;bD<Lcb{cN+Ib<t?<HF%qcnLQ5L6#oV1>&giTDhO#`zyRUthhzmiefgP%H
zA!n>U%!Wi}@4IIG;)4^rBa07sYPZ=3V!!(Fhv@S~>|ab6TG_Sk6Lw=I6bouLIjQML
z-Nc8pIIGCRQy(%bX?r|f@h~N(R#70M^V0cCHlOisU{>>&Z81eQElW3W3c~akKriM-
zm$0M+sGC|2_6+JkNoJ%{;h6o{r9jStcCqBDa<$S_W*GkImoGua%}g~!$~ORk(um)1
zF%g0;Nj0pSKNC-ez8doz;Q(#F1#K3Ao9t6Nys|@77ziv$%gjxzbOMQ&)dC;aq~hzU
zmy^K=yP3)vlr2@+v-49VJTo=<DMlckpp>aqnKKQ)_67HsFrNjorypdWAf>YHncBPa
zQ%vpB2eWw$Or1*UtJNNs*Pow}!Sv^zys}s(7SJD~Yxgm}e1ygmSSC&+gRx8uQBEHh
zSSKj!<fjxV<r4{(AkS>281KVg82k@0VUS|RV_JTS>0_f(`t~R;sQeL%lEL)o$o#Sf
zWBcr_>{)qbdxElW=a)5*bmga*+MdWyF|e)7Pciuad47s1^^7#vppT~12Bq}v(FQ0t
z=+RHeV0xtU&e^i2{+ses44m=&6qDz@{1lVtC8hMAmgmr>FMXZlYUL6CCUK3={3gE+
z(~o=dQ%pZRrS$E`*?IlAk_@IFm*$r>F#bk%`v5Bj#(R{~AI5IYv%ymII^_|JJ6;FI
ztMcnGFkX<KVqk1mN?#Z|HTU||b37Rgj7Q~_#Yl8zv{(HYibyf_=NXE88F-pt46H<_
zsvf~uD;Q76uXVQSI3z!%K`Dhw@vTQ$8Kjulf$2!=J!3lB&O;V!!XxVqHZj_MiZ+$`
zC4aIXh0^Yq_JU7^tO#b@bq3Dm8C0<q*^)wJ_s{#`Yy;&i&f+%<U+hc<!)FjZSMt37
z@GZ<W$AO^$HA84J^Q$~WV34>ln)!ZyimBCAO5fpY$%5jvT|ovje3#^xH6(UUeu^Qn
zQ9;TLo0w)~TxZk014I|_5KfO;DE|Z}c`2GBDm~Fwr}5;Kc3kD>VCtn%y7OGt(PgMi
zHheN=qaD`<mHd*AU?%%@pY?n%j~&NGjAC7}f*!c;rNW|3tuOzBZI7t~Ef$9orO}-`
zl<`o(<VI?<>Y&s15<q93Ln|_a^$!kxWPV4KH1oDyZx4&PL~u{&ZI1e=x7B*f1UY}B
zw+fkX^zFyIwP(6m#hKSTc*Xv`J@|ZseJ@h)m3^*#e?R#CRr`LuWSzdBZ{LmV)B9Na
z{$<U53sGv(xo-iGOi9p-A!KMbRz_3)Ae(=sW+as#VBZG@@9%P$8u)&y`t<!}`!45e
z^S;%-R|fgl+xOMM`|s_0EXe;8`~KzN{SNznKkrgpe0?tPSE^;3i7_l~U35rz-j!(b
zhoDJBy3r)8x6IwrVU4%U9Ys9-i{3JbjzM83d9u`}#+Fr=G2)4y%dXuwk-p4rY%%)N
zqeLmN&LFg&{wCrCU-#;*Gu$omg7q339+5fLi<gVS@;AbKe;zqi_1cTOz$~rv_u_D`
zIK(9GbuaEvH_o{?CuwxNDGimluC8h)JCO^pT2!9X68PQ=7Ld2cJ4c*U<`DpQcpI=4
z)M0NIWT8I?TZBWi{*`8b?liMMS8ewS@1=xRJ;B~<1EK6MQ1O2Igqvw%RAbS?@W#eN
z3Oxf_*(&3nDA3A!fo3@B2C4>HH!Xx_4#ZigJ=mSQ2pTG7H*e^3kmxt)g}*EdzSsNT
zi}n5I(sRh4-M!oRJgLp<dw%L~m3q7KnmxUH?9U4C9=Qsn7R|5uC^ntFr@?XV?6C^h
zFt19o!7igPs5klR#R+EbWZuD6O^k}{8aen->f(|;qon4ect`hOH=RCHA#xh&DmJLb
zp`DG!Lhm-pZJPm@XzO*79W=k}DP&G5HahvPEgR?W&FCDaZKF15qk%TMS%8_1kqP-5
zBkA-duh8C9e`Dktx(^IzlV&g25rjpQHs|gPytDOow$Ma)MD6b7wn@_IgD7Yn9i6rl
z$RoR3=4fT61B#O~rqn$r>V3zU`?Fhk)#!2FcjR%9+t&NCN&8W+v`Uk9U$3;|Oxpdu
z(uSC{2YRI)Wzv4zEA4QT_QzgnhnO^B7g!E5MwjADghbGCpE+t6ZQG-vspxDJ)5;I7
zF&aC7&u#h~kGAdNGlNyFBmPnA7TL!>VEh%Hq%iBAfw*lSet%K?5awLleMyt0%w^1m
zMeYmTPYHL7vpaUSJ0+UYeJXn8{A)k-fBPlA(X>#FrybtzPTOtdZ#|1)xKRazVQ63&
zGBH2JRL;rfXy&U*p#pZD2(G)VC2x!LcBz=uOBh{Y#Yv7JFTFm7HZxjJcr&XIQzy&Z
zkux9nSo5(@^pkyp#C$w6I%;NBe5-K_r~oWh{|8aq7-S>vn>Ho>mbYlA!bQ(VRPAaW
z$OaZZBQJnAdpFdao!y6-dzN)PD^K1h-in-^_=s|UAghiYze5z-^NJF?3m3nd*bR24
zlHUulZ6@Te?i_=($Ln$vU}!^SX4Jo0yUzk@q7*q_**sIkeKuGfVToJ29+ayH-iq{g
zgx>mVQXl7QQoAe`x4#G$wfU=VI4jN_te7<gPybyP01iw|-_d=tIs7O(#~qcs>kDHe
z6AMZUJ8d-X#l@Xtjdjb|7ZTm&6B3{9iPh+o`EwXd#>%*o@y3>Nlyb=mBHt!HEL^-@
z_p^M>8(`58|6St4!SToLFN&>eXWMH@spfjcnQM)g6s8)>5YKWd(QamiOPsI9hR()P
zp)K@W<rW;a8(T7mNUI3Rgk!Il85_}acRTkvD(!NxaX$o^qSDL-{4vx-9D=>O^v;`W
zcnhCuq7qwGsML$sIV+~0wy_QuQ?Wo}1AXCXxb-$2;GK`RDfd(;N$10fhbxL5Q)Jyv
z30|IaI~|knc3O-sxB-YD{bkcnbK`ZHYBgyJM^-Xk1wNFrrda3W^k4r|06NJjQceQD
z<7h9xV<&m0C@tUjxInoD``iffxNU1{Y@u`3`gJ`6YMR2=?337C=iK&BHP=*|=&7@p
z=z{uirU`gDt;1`3=Ig8;B#*i*y<{Fif8%|5@V>#mCxiD+`yLD4wf-glWx@Mj?EB>4
z{b~E&5WGKY--ie9&)fHC@cs|IZ+NO3fme*$fc1SiKVhNM<rvK^Ai=$uz}~|%RS*F!
zzy3F9pa)d&{DPkE6IwvGZ{lJ+KA41U?|sO`dTMW?iR!JOqM);Jyy!0TGqh!j|4_ws
zQB2N$Cr2mkzDGESh%h>&HgxTIwc*$y!TvPcMj15b*6R-m$KT`SZ#&FOLF`~_RV8V&
z{az4%uj81u?(;tQT8mddaoy_!o!@M6C)G_?Y^(Y*EXsm}$d{e<Q9Wgkh?q%xWBnlm
zjKA2lscY!Rl1Zr0h%nB*PWC3%rNXVDwNB$sufCyjOQ?Q)p8R4r?<~LlSas#bwp~l!
z^y<ft-h=#^=a7G30kYVwH=(4zY@f%I?5FGvVC{?NO!VCE!O&E(F{q;)QNXH|YccDT
zk&Iv&;ePl$oKN=V2aP00Avhg2iQ~|CeRBe|p)#Ec50=#1iA3mk7YD9G&j+W3MFv%r
zP9O3MmZy)({{BYss@a+faL+OpO+J=>PsdafT)wRROT`qHPuoZ;uM?b%X02c~aB?hT
zUHX{Nwx@a&x3mq!*F5K>wA4zS9df%k81xBb_Q5X9p*P%4sw#3naDMZNr!9*r=Qr==
zcQJ-LRt!Sz+f930D_s@4R&KG~HC0vYz0;|o2PHl!Oq~;QZo7{5vtX=5dnj1VkjXxq
zxSCIbVx=%pz025V)&ILdjvvLH&ka8R7{q;iCnP?Ea=sd&DbZXVqiR%dP{|*DPR4O$
z%#F34s4rZ-Inm=>dw`iA>c%`pkSb^12V9BkuD`Z8Rq`jzfQfVwYuqgx+UYR&?Gb|~
zvE!K7eu<X{C)O9GTJ}8sG9N{zs&5so>>0g>V%P4!E?q<p^D^%}XGQB;dKTKUA-g`9
zMBE8^z#|=)hDS{*(iPB&-JzI&-|OPzxDq*5$^2~jFMf1asH^bBOxHGD?f3olGtBX}
z4Q*S^K2L0e7aCPK!@u=U@C4@{Vn}_R$x&>=6@zL=b6Yc#r?$>X{+?fF#UbAYuq4Z%
zVdi!J<$C3QvJ}10brAnU^2jaDn#Y~wFL|uq+Ffk$<*Zp-vo5yJSZ76e7*|8=OwD||
z=4q$-IgW-6o^efVZfA4&Kfd*i^2-Thd~88$t@ih1^@oPDXK}tscqNx}JyXUY#=|2|
zKKbMVy*BY0>bbnL;MkcP*_cT9hh3Z%M}0@IJ-_UtDECC^&gs_C|3ylH4G$z>b%4rQ
zvsJKd(bj~M+(kBL&GwpYPO{rPj*lJ&#TkW(z8s>gNMt8j%h1(qi0z->sh3lYZ`Z7M
zH#kjn%U*aZZ$)4n0O%QPA$!<Hpy%m3>Qvfk-bTKUk!yrrUE-{HPPK1~#ho>qYc|Ec
zMSBM;WdlCG<f&PQDTLnug|B8hcq5)N{H*g%qW1KEoUv!m#)hx#$)X{3amXdgdAuim
zG;MAiTu`%d?onV>qN&QqRpx7;kUgcf=EO9y3TvaG4e7Ve%%Zvb&m9_ewE*<m3JKAn
zpaY`-1OM2m=18r=Pu8V4K>-Cdn9<`fh)Vp0>Y(0=>a{g5bj>V?u@zQWJ3n@M?ey4)
z)=@S#cPyITMhCni{DTJ8Q@X-gf!e!%SHqZ4dHk*FwGiHN1f0EFXH|p|!f(JHOwrX0
zrlA$|vwG|K6JHz}#d}Ll(p>l5efG<ytkgX+)2iRpL|5zC`wb>5w2QDQ6@_8zJV*19
z4F_2m#GW#t>0U&iQ9Qa}*R-_zKU;Ty%}HKPdh71XoTQ@6weCL7N&bL`jSbP$j^m8+
zY0e5g*A#HpXQX1{lyQcX4%5>x$Tg?dCaKLJ1f|-%q{!S8=G>|vj%qUj0S-vT2dqAh
z{sXS*bsYrB#PXPvBvNic<xcfPHTnej3G;ogo@8tFs02_5kx1}40_m_%8*1HsxsB`N
z+<H7j+q!#>lblJlt-G&r%<&<l*K|yQVka!F4cpX_HKX(O2h+H^1sYq`cz%}@!porX
zT^gr5)5Gdl=1a7tn3Yx*Q}Da@!8VtW%K1Q!T2KemcR|;HuA_w*#q=|^$g5hl6q#DO
zAV>8cnmY-Qd<+Pl^ap46!GaG+en4fKEvH$pxyZY^SUPWWQDvHtSS_l7ewWgtI-bMn
z46`QLxLL7Ono=o@L!r8z#tuYD%u>C2v-w_nBW4MR#vtbpO6?KM^l;?`2NvlTv}5p6
z7Y$mYZ2H?Ze758=opH|m(9cfJ)4c&u)F|0+A*$2UBlUd=--8$crjZG1L>^BXxaTz(
z29ZZ+zC~I9PEp4_K9gszVe$`>O$Ga_g8fJh^gqt~rF7s^2(gGU0*Ly{U8Z8~ry*T(
z3X{$UO0$&%HvzRF+fo>|#G79s3i-hX2I`t(_xgyh4|3+0Vc*kPU#=gVJ|FX%qI=a4
zt@G5z`eEq%!>e~)PKa0yatVY|u(9#%0W7rqvvEEvygPwmo2EOMq*J(r?H-WFW{X=G
zQakK!1xp>BWhOT{49WJPlwCijn+i**X<5p$x<uF1^<HEDCo*y!9}}%_PxbLZLEYyO
zasMi8RQ_3b@ecOpM^j_p)0H-7agoDmZMzm9<6UBJ+5%ZaW^lEOG%laLs=rQb?7aXG
ze7}7`sG$2H_x;BCLyU0qi=9q2=PWj%fHee9Tu81CA60&q!^qNopP9c+{3LT?cRKbM
z<Z}Hm?-Zu3p}s!#=_YSN>9YD^Sk1girOt!N`Uk)q=hEHDOOYw{n)I1rL@Va6Ii@)8
zYd}7!G&ME^qwYD=xv3RSPKCci$pUf~drjF>^<2f^PjNS3Jm+Qx4+BWk&|aleeM@JL
z%{Q5QWyG`%rZf?QDP6@SAAZ}8bCZ^tie|_03a=@99v{n{-|oJqB<K5aj^KKbp*g7E
zH$BaRI(yh3ml(hFlk7(kiNbkgQWdcRSjMUNlqpjVac;WT6hGgd(5LPE)BKn={R%u&
z0p`o8EzTqLRW8|lw9UJ)7s|3n{hP{yvgewz^5SbrTwPSo%?%h@We;sE{_;^0o>1D?
z0>z0!=^s$Q+<&E)+j(j4engKq@@Vx-b1%G-u2B;4^^Xys^8Pjd{V61i-Y5C*H%a<5
zayZ%uRU0E;Q+N8SKjhNXAjWvse?;pSt*vy_BT6VdySA!=rprc6EOwGwlhj-hj$LTv
zB(mP48eau)H>4NoZ8m%*nFGyr{OE0~zc93tPor7vGDGkwoPO%ZhJX4k!2H_M)v8N%
zT+W5iD&g1hp;qjE9VzPQUd6{MII(X{nR7SrwYPtl^d)x#y=2l>@LV>;oaEu?3Ye0H
zx$DO{%Z!UjApt?U_W{4-61(@rz6oDV5?>)}D&VbA!<WYYj>wI6))j;PJ)L#(5!>TV
z40jgb<)B4I9p;s`pX>ST5+auzl=(i-)Ta}A_S!&PSqWmf@U4ww_6ea{nZx~dqlMVs
zfW^F2!964tD@Zp{d!nZ(cAlJe&Ta9oj&j%i1wa$6-s+8Dz{<M!v-B~x=J6PYriMwU
zaH()ve5dm0b@-^JaQtP#Y@lSrr=UZB0;R4O1c?tvEpGCfYt@J2pwo`qjxQ=&Q%m-h
zPulU+b>K!_v#aa$*Rh`|^Z|()D8dmi*b{#c0<Fz0b)%Z2OBRm0I_jiMT;6GAzRwT%
zXzUDweBf9cuDLq8WG6jG$ThdP#W(C4!)c5YZ3m{cc!QSFDO{FXJa#4Mka9UIwtTvF
zS#yg~VX(4>V_O(e6SCh2?187503OnDw<RX}O{zJ%Mj9yamylI!cx(1)F0+u!SdbpE
zlhJH0GoFN<W6T(LXqnl`NqPQthU|;Eq&vXisvMGb3Q3cxT&F0YVDX9%Pc61EKQ3=s
z#-Xl0^r?9D1cHNq#D^wUy?2H9MNvW&+y!aUILv)Jw23Hy++Z`2LwjDG8L9QWcPxTe
z9tj4iV-raRfQ10iXu9?g_P4x|YBVGDGs0YmHkbg>Lx*{%Et?!Y$$4a2m3Ohk9V?Do
zzD-q3HJUi_e{#!~>eNzf(5|L|;rPkqVc^OxcbnNiYKWc`+H|?QywPxsg74E2k4|ZE
zi;^Z+QC${glw=Q|HxNE>D?UiH*Zn_h)Psiv_)3FDP13$FF=({Ccpn2==2Xzv5hJ^)
z5O=taJxfe~BOS%I<Hf0_k?Mc;c3jigbT-~bT|ClV#}3w_qf_A-OaXy@Ro|&_rlQB<
znu|v+*(spRNh*K7oifdRR!342Z(PK<cy+~zo(d<qjxwVq(VgVIkaI`Mmsl<W@^x?v
zp$GnX+~U-8x|950+E{X|DSRd65<Mqd{>AXG*GDfhq5ykR&-G5SMb#h8pUc}h>uR#k
zh(C`O+G1oSAtoQ2i>#!vnb_W0nmvaZ@T&lV@&@w4!tl4RLEJAco*6r}W2QxpS-(7a
z*WQKfa*TLX2=c<|3VNW*3#i<T8`R{|=+4DZjqOjHjH6PslyBSWP{Gp0#li=z=||P*
z%f+A3+VOd<t@=K-UK~;O+o;Iz!b8-*NB!7uTBu;9UV>m&;*~l`qrt}oZH+`lmKC=s
zy$BH9-C$$*0hnE-p9dIwZ;t=v2z~jwX32{Uj7QKYC{&?i1p3aE72s=CrI1z@P1{gf
z=JF7M^T0)+g3Jjj4XT9~DdwaP|4)mvCm;SST%3O=IrcKW9U*<k$NaA`0{OT|P*Go8
z?3vOF7m^voBrt-)g2I*b2n{iS57y{KfU6^9@)|acl%y+F^Tkp3L)fT<8HY}@NtND;
zq+-r-+RjpTIh&SQa&T$YZMH|qi0}E#G`G_(<|k@8MF$=0hbi4en9{MsottE7V=F7s
z^JOP_D7BA1fIkHI;BTVmOHOjD()Q;MY(h9w=+?Pyv(g6h$4Tlq!D!vMEc!wN;ni@(
zW-_`x9KXJTMUScfVyEp*+A?=YIV+MQ-q<;~NM@tChj;&n&%Y!esbu#B=Eu@&CrVYS
zcnAb=yhRoWEmj!5`0bjyZW-|=SyR#zdeR4p0D~+W{6!d%fuqX*S`zO1$cg`m_%G8c
zys^Vu)OGFkbC(1Q(&}9gm8#Xe<-@S=s#SxPHtn9V=L#%$uVP3wyST5@<_|<zK4d;0
z&zR>IyVx<OJ(n~Yyu$w$KexU?;Y3eu(BC8#@_t74{c6yb==qA1r2T?5#MvpxoJH40
zm+~t4VhoJ8Jwf_tha@NIP++vi&EmgCuOVK|`Xs)3&Hk!FJ7f9|DtQ}5h4S$#Xg8<H
zM;~S?g5$VP;YHP47L<3A@9}7ao3&TA>1qUR{z;Fp$Ss`|V&}waT8(xBZY(gi<Hm6J
z)rp=Houn#F^qk}*XH#3E=QyYBSU^~#Oqq9~-_b{qZsC7~H0PEZ1jUggI&CrntdTCH
z@0mx*-LEn70fA~Wrq2&pqi5!+m_B4~r^p(O8T4yzRULh>srZt;RVA$WRdxSijpnJ$
zdE_(0eJ09d<`~s0GeM?C^=cuU`HG$_KBIb+lS$?Xp87$mf`0Ypyb<eHw)N%{oIUwF
zKDEvo_mMF$paQVavkSuxW6+YmA~B7O`|gCjARIAS;5LRc9|=CaWbT6Rs&{4X;76qU
z(u1N*to8IItXoFspuA=jJao-|%6=vJ)<`|h%;L!hvR?;e9O!C}bj=JK*OisEVjJHs
z_`~neLSg1KhBlb5r?`LeHTv-i+J`YYkshR|yEkbbM-ff*47Kh>iJsB1Qy&>k^=r(6
zLK2d`K5+-qOk6K1$r=-8z7zc*5Ozap60_<^Gt$cc(F%Wh*p@C}F_XBycxe2T-26_K
zru4Jq(PTjUH`TX{8Q#n&+tPnx?V=*FXKUWK!jLOjUw5|&f0w?EZTI~}<Ge}H%C{=#
zavUIPW<4|8tu`9XMbQRC(8v~mt@R|*bsnGiE^Z0&oz#VJdd78H){VC-iAmA!l^s6}
zlo6nxxf~2yq_pV_xO!9xw5kj_7p01FWdETkiNrsNa_sC+APl^$l1An{SU0?Kea$m0
z4z7t3Aj#^TOZn3AfNi9>!|0yDI)F)r{<q*3l&5lHQXugZ@J@@g#;#M^oadYr6{a(C
z)z8D;zReaq_0{jBkJmZ#b6tHz09cKYol58+r+8Z+HoSqxcr8@}di7?ex>9d(w0n@Q
z?2H|oSP<SP{!g~unG`Bwles!c5Am0+Eonh<_cpECw4-Y{CIY%DKov%VsGUW9<4Stw
z*`eHZmr`NgKzGYLOhLb@qVAtqMKAF0^JmZTXp>8q7@Y~=OXSYMkT}VMpkfrgks^@R
zKl;jDPr8lCS<=y;6jl(!J+Y*>az}x;Z|kdKG#dhc5N{tUH1u+|=%2h_qH-w!d+@Ya
zQVgrC5vv%^;OkGRX{BKsv7%VT*7VK1nnHd}+y6j~00!7msflL+ockOMuo0Q?q_+PB
zH6N<@peAWVqs1-OC990xuTGyqgJ~(f&p4j|8rfK|guQe@DPm=bb8AY}nOy;`6D2+x
zP@-}OR7;YYPVCxYC4M@2<Y-qw_t8Ng|FKa<XSGs75>frXl|BSg!ghTw)dWZ!gt}md
zl|6Fhf9ChVY{w_7xt=$^kG9re23G7lnE{5SGuKPDsslPDyyWv1K>w8UvK)B&tRJVW
z)ZCz`hb&UurxS08u((#<mlOuE5SArl^S3yCKQw9(($ZNdNzM4wx}D}@o%!3)K|>gY
z%@hov!~J(N7xO;S<YJ4-y<S6RZq*fQz~;ALBxTugeQd--M29nUA-0%;&9FB;H5tl0
zif&ns3a5X^khClFvfr6H7U4`o6;O=g##Z1H+J<&-S0FP8F~zgL20M*M=uNAji&$AK
zT^MZ;J{O;jn#+~mR%}77pGz#pZ6JM1x)-rn!^S+I-@`^X|FK5cDP|HFO7x6!lG?*Y
zK9sIhe^<$x1Rj9oCkP<YTX1I@W%^(&&CZR?wfO5fZPonhI|wZ1w}D@&?X?;_Yqm?j
zh#~~Fr-rYl)&lnfuf^mH{lz=R1=m}4(AQV!C^yR<whz9!1@1A}{ivia^jGg_W%-rO
za%StEbvq6?u3+twf_*l)M+a=hG$wra{6_dL9qqI|2tE3Wqc5)vQk$9hGKKW>^7eq2
z@57{w55&S~%P;`1aN4w@>L6&R);OQlABX-J(rL-aBTxF*N>RU}buD3Di&zfG7v^?U
zcHt{+)@;5SZp6tDK*+38Jpix<==RWb*s`DWZY0i{dLv4-L2BlQKKNa7KI6(t(wJZ^
zKf^$V9X7x~4cJ3ttTksd>T?WJG0bK*y*^fBR9J2?pvPua{|XNs&s$k!6pfd0CGy}b
zk19MW^QZ>IZ!pV?ZRvV+A{oCh=v@*{jWN3r`!nmbohZ7P8m)XT2pJjaC=*(R6&X<^
zp%}DR8qnFAt&-eqmE^(F%=yM*jgA^Gk#rds$))N;n4&ZC=4i((wc4P{UvWObY@4^d
zR)Ea$2q!Ip%<^w&diSqD^Z6>P@lwU3xGDF*jw__737E2IdY6Z|WcwTIar$xcqw-Y7
zM_DPM5_wB%cw<}oMoF_z8M=0rzLOFlIZ&U@y3|a2Xi4c?@!dD-(>5c4Xiodaw*O<W
z_1@c_B?wRwp`eLhBS3@s)^yH974fh2tJ6$V`uotb<<XmkFB|ZTs>|H<G72wCnlNkC
zYk6?Vz%1n^qpdup><^JpH2^O^@L4PUE0)n8O+<YR*;TLRgx#YzLmk%YaTgUCse%*8
zlPLY8_k#kQ<PKUi$}Csd6s&HLiP7)+GL@wdm@10M>Xt-T$<CUtLUw^|#mFMgH97^+
zytsRYL->n|yy;l_CJj4%O3}3=ygdDN*%pj^Y${FiH<kMBC{1FkX?;!S!oRjI+J`V|
z)vN$ujmSe^0xC`9m?wkC+!9}9E>fp?tN{?y<=A05=i2ByB8JoFz>xlBf#x_tQ}mG|
z=-Fy5OTCFvu%_!z!jEX_MR#RYEf=zXdZVF<^~lx7nTJ<u+FEs@a3b@sGzT)ZlF6!F
z%J&oUbr_D&P>fJspLM1ypH^3{@-0w(T1FXBH=8%+uc5J`%rPXkyK=)wT^&ll_sh>3
z?(3*-Z^J$2<=k*T14;P9{YxrxKXiBE{J#e_Fpb@X`AnmZ`Ak0npvQbh&Hs2QSM&8E
zHb5kx>LU~_NROj_uSv_Y=cq?BQ48xEH4{Gx`8_<^oIXJypp^M@_O_V@xtczY^0UUC
zbw6BXkg`)8x`M7`k1R3DX6}Az6b-R)fyb0a3FM|4KVkT(W)Ko9a{*Evox4M0#SVr+
z(FcKmWVoKfh60otgI!SW%0h<7WM)jm%B?YdfK0hD{WJN@iHi<L<LNIulrO1#*)jc@
zsV^AQJ9(r3=(rt5$Mwlz9YqXKec04x&ZJ6pD1FpTh|i0->y0Mfxj&1hUCixy2>k9v
zMqwFB14GrQ-@vTTXrLmmfrlAl8knvI+H(zjr*{J*f(9<H-n^=yVCR_zMe07f=Us?+
znlz><qvRKv6~BT1p3(X16EcslHG@`av%GFV-RT<v)8`(+u>FL|9*7zQ(WgJpcDb-O
zMEA`={H`#bf|)ZJ=-m38`+taNI~!V*CL?jg?x%uRCwdN^H<(jQcUv3VEH~}VjHbWO
z;G|;Fi%=zI?H?QBrmOv>)4K?Qi_*nAwFX=IsOqz8+(M}BGVhAw)a36Jcms~xgKo2b
zK^<5hU~^TkwfPW&xZM8jC{)9>-D}VWs`sQ%rawy;70bBjv>9tJO2XkJau$O0qe%BH
z*pCE6AvNN=H-KTp620Ldj3NHZUVs98HLZtn_GU(u^G`oB2ur)q89gL@6p9O6W@lL0
zLfpHf59{Za=vw_G&E;lxFqWJ9&di8_`g>2O(sK~nV}^MLvgtKOTmDGrF~6jocOhpR
zN~<@Ueg8x_b+?IuDLMO`7%-iF?I1H<=?safP>KVUp3Dl2-RWW8q14o5Y8qGSO)a(l
z1B8Um+`*)*etnQ0Kv#U6q~?Wuw3y21XWP=gykpUFPFD^sFD0^QS;46XWFBZq@An$a
zxCjAz7k`=Yjy{k9dLFba1J=~TcJ6)N-R{0ib_jM9hz1Yty9MVBBXW5;A;hP%I}cXQ
z!xLzNFd`ky$3*-!`tWB7o+(kV0<jl7V$_|7qgU{(o?-P!9}hf6K&I0tA%l%*Bao=F
zhs4)TW751ZK1$Q-oN28J`-7K^jwc1g9Hja%pRjV)<3omEv}6Q5m*ZfediWj?%qf4%
zVWv~`M7AH^M}<=mpoTusH!fG5w?t>@hnxO1f0B9`uSOkVZRM*Y7x9!zM)jjPeo94u
zD|{z%*E^?pX(mjj#D_=DJHU|H(>s1KxFA#%httyMqJuID+$4yZ9TOk0;AUngZCqEU
zWDVP}+)%EH1f~iTuXCtXEKn*uDgP)I&Wia(r%x=pwg%-Q|9+%@UB94>iq-}Dz?hYS
z-0!~B2epc=52;FPfg?<?K4DyX#43%&qX*Jar|nQo3KWUDCCINc_+p<m6kyCyfh2q4
zR6a3$=CcGg*?&Vt8kfQMS}sm4k5*7;dhkDTG@^u%=tB?ChkmHnya_@}Dg&>j_T|x$
zd<;m1IdX5LGKw{AA5tlLE=MYNi;@5-_7nAy?SD%u%X^WEcE1AM_5Y1n9>X4P_4_=E
zac)xdsC=ryAD5KggfZL_MpY2VRT`%y4EBa|gi!@ypqBqz^iXB#VK;)4VZsBzs*?%<
zo27^0CO(@`bl#7%0;`X-dUhd5Wc+gqxs_Hw+?GT1DN8_bJc0x&(7;k(i29hJ+z*32
zvUgdLJb-{RyJY{1;o4Y;P>;SLx=BXGXqkse2UyKLt+?bMj?VlLakMC^Du4YWs+>}s
zx>?T1@T7C&Ci<4xjTzx79+-AxzF1n$TEW<$B`f2V6mCk-p|sIDER7A}jtxKe<>WR(
z^;t+dmPqff+gxvK!-kyrG~^_Q@L*^RdD_hy99N2AnahM#YQj^|g^3c_BY=B4?=5z*
zl{9kbw;^9H{j0(#C=7H~YF)^KUwC?ub^#A|VKtE__(wllSb-$>heFa`B$_MQ%cIY|
zNVG*VWcw2BNeP0!5^ZHf?cL3--~zyI+kvyPRZ0L43|j{F^YMBB)|Fs#P=@T}U~(sI
zEp{{xo(t5=qfv6TJ{(p5B*MpI^cO)aBFZ3_Q9H>ak!`Kl?^_W6O7*VpLFP#T#`f`!
z+-D>ANW9f?L9kE(6F-D*xs$T(C-g*f;a5awR>e!<Pbo3>aFrRh@w64lo{W`j(>0nN
zk@y>kBk!*SEniN~=gXnqDgPEvPPRN*W2Nl$98Y3J4`j3<sILkP5fp;;+8XmL!>3t=
z`BHKT@-cHKYdsD79ruvuvn5=^|53tKX&64Ac<Qhn2E=o>k#nCl9b&GdYYi5=b-l4$
zmyg}kk$QhT9$E<O5&ssh>nyID!H}BE;kqt|>jp9Ju2T$t5jraiMaO|f;AjLK5@@wt
z3_$T$?j~E76u*T4Fa$UPQrzDM^9v|){{@yJZ>Fp$@*YgDeJJw8ll>(}rio@ztc~W3
z@_8UUE+~HS{m+uqUztaay~ybg@D`$^A$adP`e2pqSyUvkW>jsTr2aOXb)Ymp>n?J4
z^i?t9EjY9AWA8Ke;Xz>kP2=KUGEK8-2Ym`f0_PkjSx+50h=lLX%@+S<h>bT?O&a{7
z$u5ONXx@6CSt0OeR??Ctg474-`$Lh^Ycr?IJ(Kwl`Lg}pfXrft<;y2rA$l;2{eVA0
z(+%GX>Hd_iy;xj0E*dD8n))GtXAlFKZIm=Nx1tW?d;k!tXeGKxCd#+bnxKgD$TAsn
zDyQdHh**>jz9h-$OjiOhT5j-(?il6w+jf2siS3(DVh=rINbEv7)mu|Io@uXoE!HB{
z9|KL0%UdG?+BlK?RGlZJCiZ5diTP~w?+U4jmT~->E%Joa#2n)oA+=iKvmrX3&bMR{
zVaM`i@l*ieXIs-oW))sJ8vGmjjqGVo+f^7@XgmvIqZCm=l0FvDAe;~;(7g=mt1$-k
zC>X4I?IT|jQL>+AvSE;eJQjj;C>r>Ox{${Tcrx<~<+cGpBiIj2##N@Q>}NK&ktWNO
z+rtb{y=RRfBz9trssl02R=a;>SG%u=3*RQ{+YAUTAf+W%EQzdCe=0{+>F|jLyX7XU
zD1=#}>MK@2Ec-6sK6@sp{XfnGQK39<CU9=L3WDxUyhcCiwf?EKYVJs*=GNw~e@6aa
zD0QTzR1?N?a<n!l;z#BvwN^uTum(j@!1E;PBjYT>rv2AvNz|_Y+`B~m>7Q~EwT5By
zCF%iG)K{Y3%&6o^)LWu*Wn{g+ML)}<kLpL{hQ%xymDd2nY!W3=S5NiLcbSI_&14i2
z8X5QuE&{<+dkxs{Ee9_~JI*Y!mWcEMJTfw0g$pFhzNwcJbefu%S$dfk2)!)%<8tqt
z!F<LDr&pXr&hb_t$!l4jFV=DmkR3rb&sT+)Dfc%(HR8)$w`6m}R(s2Rp>qG1xMeNh
zKM#s3<s1(1)w{5G;OM&2w9MX=;aT7689*^WxfP2oWsM>afhIG5{>O5o_wNRc-`Zx-
zIMiu-LOv`*qxI>t`Ks~or=O3Tvzf>EnPbmp?y<Sq|4Sc9ev4~ODahz6TS#cuXsJKF
zr;=~Y;oDkarvElTuSv;}Y#ltFIUZxoYGZ<tIp1&Nc$Ui;{9^mZ4$)d<jlO4|*7)qo
z>_$vYh^M{5h=%#>c&18j_XZ?(tW9h>${o<XrSJZ??i-)vK7qxNX^o*RXMe3K{r=--
zdZ|JqZ&mulTBxmpWnqPoD0u_@to_#BnPVA+`L1l~GBFT&|9J<B4?)j<ugR0JFd-yp
z1v#P{>&6vOccqiOg{sjWs`nW8x7Zo}=JZrbbX=XM)o%ugvYWSFH?AOFLD`}4W7Wj%
zG$Av_VGMM9y;7Dag=x8U+_(X<f%O!O8OCw-<Bbi>nppx%SkJlrEMY3C9Y%<299R7e
zi-s!JLtN2i6VFm9x7haZ^y3)|I)HJak{<N3WBuTpRvw5De8cBen{&w7bG1dzv$q51
z-d1d<(D&Z@Z*Rd{(ogWpP)t=TWuncl&!))mQ{_&q!({9aXrSTNN|2?~k7>LKPILxG
znY>Ge*U5u@nyNULn+J!2i7K~bX`K!-QIQErvagO0IBje_vRg6~>81HUaFC1oRFa+v
za=>A^e<;8|58#e50Ck46wb44ir65)x+}~ckwRPb|UmN6nXT22%>s}sE{U$#07hP8G
z?`IiFNmJ<|Cr~%wu<6)Rvu(*^n6E*XF<#T7KWNj!tYo>ADQ^|)Bv(p0ZsQL^8_TQ+
zWokPEA^YkF=%v5-3*WyF+v!U!U%DR&;u{ooT$x9R6R$F|VLh$IDMKroe!P9LHjnkK
z&0~#?_^eXz{J=(>`4sl=SZ1ri1D{9_ATAQLP@HNup4fp$XQQ!}{}m1&b;)o%@S7t}
z>PleuZ**?Y`QL|YE*ZXLXGWKJu*qTcj$m((e*6<yGYa=5Qnd2T)ci09{>))dpUlkW
zL%W#t?x-eJgy&?vaRrlp{uuocKQ3F_$!L<N^qc`yDXGNtMa}72%+bMgracv|R#E|d
zT8i-;;ZllM(|>I=;-wVkA0V0e*IOCN<x#~Q>~DxwaPVw=0d91fMXsDxc5%Mq!4-bC
z7LoqahfP*(Q^>hER<p|NSV&o;$-*lca=^;jw34QM7hR$AF*;@DK>P#QIRWDPIxWOY
z9~E*SGXIuLKApuL1;%fIg(Wz46d=s!Ico{FSM+7Rii~FekfzfqXli@)^DE6DX$7RI
zix1}llZhmh^N-~Ggz*-aTN2W_l&r*7Zye@LDF_!XYxK#i@n_)3V=H1xKxQ_N4mdX6
z&o_UAA}>{h>8IkyrB!e2)Q8OC*PmlvW(CvR<*3<E%r76!A?FOJN`N0qj}Q`<Del}_
z`p$`egIzhYl)^>^(dD$rLpa@Xtoc|5@hg(<<mjx84bgG>#uB}87%yk(<avwNSfb;k
zxZ|YwUodHyOF~0*79K&T;FdH#I?J0=+Gjp92R<j2R&F|ruIJ8n-WZO*rlJ;>aJsD=
zfTu+b1hjXC8kg6G;b0O*3xHZ#*jOOaIu~q};Hci8IG58~-(YXnFW$Mi9Ruek$hwbW
zj75rua~lK9CuW{8cBb;)OStlU#rXfl{#$O9<MnFO@0;BZD9<U!W^uZU5%H#!aGIOF
z0%5t)H$nH>oA|PKO8dWMfARMtG)rk<b&?Ysm#-Pzpf<JE_uuE*_sbM#$+#&(?O8hN
zIL0R)<z}&+4l{sy)|Fx!q;Ps}8TE0fQSlhE%dMHmF**BAkj6d_zuv`WJT9B!)oY-E
zJU%@W*_n~@OwH*5OkGr5mYIUo1bwsC3;~8}t-4FiYHlG8MOGCyzEXFHq~x7xAPlEp
zKGMRYx>f*2y}L1UDFiQm`MZk*Nc2{C(f<r4a{6@oOj~6|W{rgU7c4!^K<-b8OhmcY
z+NGzYy*AZo^c}XpG8fUAe0nwVWsMlo9MP&Xju3RqKZsnK9tEg$tJGzI`NJd3geSiU
z?!HJ@p*vXXE-^ZM)2{Rk{`)5p&X7R}-c<!~)rBEonap=6d#w2U0<qb2*vuC}e3}Ti
zO@!O}NTbQ@%j``Wm95Q5qu;Xqr;aXLMyt)yRq7RuOpsbD?WDpkd`UV-?cxA0%4wj%
zhR<Se-G9+*Kdv`_{{YI)pMOwd#cRFzyMoSFSW9QLH-95+w7+wO+4%eS`1`Sif2G=}
z<!@H88X_sG#$8ByYu1)*WcH!Vd>R9nK|JwG=DAF4ME9kMnG;yU#D5z2o|T7CAz7_g
z)Dau(%%}37;}!Mq!JqSoT3aoZB(laV<zOiUg{4?1HvsK491GNZ(7~LMM_z>FD%V$a
z2B_1Oqy+~8b&1k1UdZzMVZHhND=<oC0)Ip`=ilht3)c!B!<%+pDJ3CqiE9x0Q-n=M
zA@lk!@~FuDD&PJWK2toV%-J_u!==C9I<0#1)Q+_Xl1bIObj>=)L%r)|PBJ#W)HN;A
zt)$)7{}CH(K_RD8>Z^(*{OY;2ykwvzbGM!?Z!*b=US5r+L^ypQCAgfPuo5_CEnPnc
z(sd`5d6UdN;q~S2SR4d{Yu^<)f_44?E<z`9V4VhhZ1$3ERqR(fo2{?TCKH0fyC#y@
zILobX2^=f)vNe)zWjQVTdEG&#OJ&jYk+O92`}DE)_eh)!SD_>pbll3-hib;B!*mFH
zaBIuJa<92TF$S9J5ai{FM<Xa(nfI^o_g8gtuEfJr-iv`bdga48`39)8{$o@F6RqaB
zuW9p4i1g~KP;=JpC=|kUV8tk^;q)uN_Xm$0L~jV&&vKUIDV%;Z`?;ePVD&Xs-xGZO
z8DA5RmJk}wo^35rkg>XK;m)Oy)bMEf>RasZv)_P0r}{L-sR<iGLDxk4txe6g=GE6)
zNQMXBPUl-^eJwyR@WcI1HC6FBuU}1CONY}3<mxeNvY=m0<>vF-zk?Q=dRQK?s!{YB
zO<-0C1VP_yuX6e)=q@!3#(nYA=j0*$l~(AJS|nVJ59?Ms-B}+KoO%AEV4P4V!v%W@
z(hr)e4;G2P{r*7Hwx}b1p~3>ipGrJh>Ta8n`5ByL#qP8YfofwmMZAUB(iu}c<`{k9
z$)H2C+n&D?pn%9z_mMj_y(o2ikKkx+<?qJ&aFHMPlS@#CY^)!6>BjmIB%c=ASU(8<
z8cHU9M%o{PX%n4AiKaiD^%M2YttaeDxy?1l{?yqYsFOv8>8BskrL(@mezIW$+n4d?
zwi^@2q=-AG7`y)b2%_(It$e87)j8Hwk-GhEy>51=&*`kI<FSCyF7_vEf50RaO)Tg9
zL3;sx<+tNblBnvprtB_v*^l(T*=@g1zkI*n|Nek}`TkpeSFQ#7oprXeb<;^H*jRT+
zfjhmdv(A9rS*Jxj?N`_zi=;Y97ZMwoV)>c4$-GUrKjZbyZU3YGc68`(4C<0-V}!pw
z-Hb38{8-uGYX+KSl)J6^`Sc3b#NBU*Y^HUz@>N_O@yFOF7k{MTs><IOu40tkP7`H7
zgrGHO`j{mMfu>0HR)3hPH)jXej28oFWN&AE9gRQ%BZ6TUG5Ac@S$~B-`V?RX)zV3c
zO}7ZK@gVyUh*&|3Zo}5a=_S7wOYB8_cSx{XO7^MP7X;^+68{$&?lrY|Q^&i_6TPO1
z?zG8nGg~7~Be;-fS^WsFsm`4=(w$W6*4JeRK(kctUoZKZ_$YI&@p~HqSgHCFh{<rD
zks3b4-~SajpBiyioL{oBjxdqaBdsqNa@n;{xJ=9yE@vvHM!fUqcn7&eLe-NyzzP}@
zkBt~ZWWy&#cU%r|l3TztGG}<*XcRc2?TEVc?i)?5dQjrWk10+c4g_u|85GlGI2Rss
ziyJ!4;)AN!Uf$jrzDc82$Fb(&#A@ceHDL+4n`ji&HN5)G2__}vmEBJ~<6{wf-q}U&
zyI$dt$5SQWZCmT@>+a_s;cmd3N{xg`ZmfBI$&-E<8|fUzzFkZu(t0J(i|zE$_5fIs
z!lb3+=}fH&KXQ!8S{zNkN(Q$x(?kz@>6gKMc3S>&;9*^QU}{dN=KZ-NDA>Ts#}6vk
zfAC`J!abpkEr!kN^>wcg2z^BC;LsM#lzT!ShPG5cmI@zTv+>%OC{@Re+JwdR4umqx
zT85;(vK#2@<d3`e6~B2$^3trC7EoJ8)fdO#1Tzipi|)EaXQXEBdq0c+jY@Du*L`lf
zklO@kB$o1^)^`ha12o!K!jE*PD(VtFZ#p;q0`Z_X#L~iOII;FXpKydE)&nj^maqP|
zK~W1|%ApYV3Po|LV+hN=F_2ST3359u#)}p%s~^abPo^qR+91^>EUke#{OwP52Bc+U
z!+wzhO4fO2Ta8NHrK`-dUdaIWVESGL4#Et59T61Agq<53LHyF)OfzRXx7F}$+8*N*
zV1-7d>>ziWr9iM#;oS5O$S4(lM$}~XAK(Nd-()UfK)?M<Lxqz80-LdSeuOLDQN$OQ
zRj>62*w_d1=&{1kV>F;g8mWHsYzku>_loZ)2+qLn@^<$fzPsDJ>LElWy{T=N7jX}C
ziwr$R`_p5z`c15)qQ|=4^!WZS=%TbHt%61|4fBv2HU)%0L{Fp(8C`|UM>9lcnm(B$
z>4AipWR^ROLlM=XACDXS^bUBYWymIPTtqause7<jSB4(8e`0<qF?UBzkHp`av0+BX
zj|kd!dHaSw_L^Su#+wvbx_j0;gNtHAte(?R4z{_Ta<GOQsrvK|bt`=Wz3~;H`m#XB
z;i#D}l8UmQO?gcX_ES;%&HDqz&9`?Zh-{=Q9m|OLChek=F)as&74Z{0$3_GTn^;?y
zO&SbrFh;pl5E!!}v_%RH<)HlysWE#X$@CV`mAWF7_~Z!Zw#5K${LkFX(|;%Ur9|1_
zd6$|P-#K2$sxRru09L)VZ5LD2;;-cEPiIHmEn^L0YyR3<S4OqWyZ#Jaq__CrI1BMQ
zIWkjeLo1nO)Ybj_j@tuMHAz1m%h1l|yV2*gK!ndyWA}`zFS{nfkt_m=h1RFW5)-g=
z#)k8s4|8%f+=X#t`&-*LKcDH^9zSJ4H5g!Q&oAQu@ZpL_9)GWEY{Y(EkdFVoYn!{J
z`;o3~RAI(?#s<i!1WGZRg`xF^aKywK&!=|~WY*o1*c__f`oTLKs#^E*z|i{c``f2f
zZ=P1Yb?T&t%ITUWhS`X91^5YU*-)K}MI}o3TYlY*9rz__DmAl0`lxvfL9@ZO)7fP3
zv$1K=p3bIXa<Mou_}kbtm`5|X^S)tjgVcy{fmuLGoVYfom~eXa&)|j$WyEo-`OD%V
z?nl*IE1%#hvs6Q<$a3}APE}0!n@G)b@poPB1Whx4a0D#<6IOsoeLtXuVBSe(-M{O-
zpA*EhRW}!vu{m|9H?!D9MF$qIp|nTVurv)UU1Z>Odz|E7cxB&W`&+4|J);`S=3bsJ
zU#8~9?)i+<HUK&7+$@dDn-UROY2f^;YBZAV@wd9RtrBYzUA=8{?BrB<#ApCt;@tEJ
zh1d_-Xj{4FXZT%;dc&bDsfjyH?)X;5d}n2k!m^DDx>a_@Q{Ab00p=ub)+|7=ZP{Wb
zI(?Yg<vsTWzv#Rt-JW1}bf0p2DmSUVqf#Z#Q?C=57&OE{!>;%%oF=p%=e;7lZZbPP
zSrT+^J_+(B`i9z6*Bo;ZW#%YS_d<x;us5`L4z$R=%9gXLw?d5{ydy$<F7pgh&}<l|
zuGv!)FPk?$IG-^oAHVUd7W{|sY8|$Xd>4LWXBYtBk9^b~Rd4IM_Tk<r5#Hmkh;IT~
z$@Xc%gRwJhRrh!QVQ-yS^f{f_Z9?C5ZR>9B+Lk$*{^Wt4W$TFxCisNm+b0bCNA!k2
z(@1H5d~>ipA8WGNp7gtE8rch!IXw5``9`1TQ-Jp>BxkW0#OJN`W@8v^<T3*%c|Vk>
z5EV%o&l5dph{t2wu=$<a9yW;~A3i5}Hs6psIBAZvmxX#W3yip7cv);n+~CpaKJ876
ztb1i(=;`kLyct~lYXe7f=L5n&>>|yF{nRX2O1T+yzxdx0i;4=xKZ~~_tVT5!#2;51
zsH~M6ys>5LJ{lO>P~SbEYn$r!=9JaEx2Td}SMGL%g}0DcsU=15_JQ4B=VAtTdt!Zr
zbk@65>ucVNzoD8Qp%(>}MAT+N{YTA5i-u9PN)L4Z%<NPW+Q=0wsj216s|R<_z=Xg7
zkH7LYv7V&(xO%RXc|E~BL-y<r2UaIqI_+$<5maYN8=K7G=Fn4U7w3iDM(Kp^loGD`
zp`4M;hM#ml=u}eK)Gc+VkWZQd1tX!Sx*zLmEZ9D9%WH#+wyo>38e_TI*}j?C!pstf
zEjWZbNe^@-`X|>+FC#uqDh=^4l~jr56z4mB-GX@rcNa!X6dW_Mx0)dilfSKw{HDz*
z%=|5O2pPZWd+4>w4cXu=FeCSoG2M0S%N%WeJFtLIaH7lL{m&@oyE%SMswVReB*xd_
zOnlPShjIffFdEe^ua%ZPP>H$CoW5qHBpOiTfMPVAaS;F+@}3CiiOgT9lKs-e8&zlq
z4a`z?43g>2jkY^np2kDlS|ecN`y?K%GIv95fQDm^bK5?aa-HPeJm?}2t6Lr2hgym4
z^RyZ?@z_P6F-xGg|3n1Jp>x_WBpiR47ED{_wkeapYf#>Z8B?@ocYnlU7j|uDXv%}3
zaoS#|F6ZV~RpTX*?mN6g4M>8`n-@XT8z)Uq+Q?2nUb@xwZt``#iRgOn`pm)L&F9Aj
z_jGNOp3z)(&3SOgB}UVDF7bLK^A@8cj67$7HF*0K4eRogHhs)t<j`RJ8T)24_8T(q
zkt2ZJ(BAb6uJfj4HI$<y$XL(CcjhG4YZ9}WYgKStMsYu(0HX*&4`rbZRzcyWRW%%p
zfeBmWCqROO@*wz6RWvB`P*4$wG!<nvom@pZP3K%A^&Zd66pD~1cK+8P_vuKyi4f7`
zfQZ)l$Vh(3LqJ4_F5Ru!+TF6TnTx!yfp-ntilUBCea>xc$%4b2Jly>+64xJ(rx{&(
z6VO-nk1Tz?L$Xg_Y83D!lpiD2jM;V`%tDBTp0u3Du~Y?MUEbb{{;FW6s(kvp*w9}^
zj{evugZ|j95dE1G_xU7vVG$&FZlq-h3WZi0`x9?lYYiv)HPC5j@a<91;Oo%f|1vC$
ze~$i~#4;f5O@qH7Q%5-hgn=`_FFFmmaWa*;&zYlqU4vdsFCePVkt98IiZW_3K`$pO
z<3P2liAfeU=$7`Jwsz|LeA2y>9FVT*c0TFuEBk}dua6M*_S3I31uAGM7}6bzD60T)
zg5U?FTi%Ow5BDLl+>=kbhpM7MnO1&GMKaQ;qAcm=D(X+VvxJ^qL3{w>*+~SB_ZG-&
zy9_;D+cc~bA~k;@p`6)2y69W(CbN_#eDQRqXLl1CvafBU?4sk569=hc*EgRueILNi
zDXXC}x3PF}1wAdzSG^&0zy03&H}u7<RYvWz+}G(@S-R|9JZBaH)2+H$fe)qb6Ye=>
z-Nn9qs;_x*@mYaFmKr|5P<Jd-AE>a!kfObTs$sy+(T4S~GB=4p2i3gjP300Iif|7R
z7Z5FZkS0rmj$TY26LWptKTI?k(>5k|b<@sN=B)pW?}5!mR?>J$871K9f4Ds@^QX`i
z9M-CLLFuWBB0IVdu=-9D7e3W|8XLi`4Z6TPR9XhhHVJ=5aVh3}z(*kOVDIcO#<odC
zCcoPfb|)6aA1AU))U2;hH0_z?arG{mDuaWI?dqC7_zuV6^qRXQqiqZ!+kQ@otP7M#
zr|mnS*17pMA$Uqw0-q`xZjZm4lfVCnzotcEfW<b&9`WnT(vx5@d&=~vik;aC6b;d)
z?H#*&SJ8^QF0)vqE4WFz6DZ9k6B==s+5aXbJZvZY26D+5Qkx_0k<JQf{d?0!&82|0
zrzxY)OFl1s<4JXGxj6)Z7GhM;A27VmZFloQXT_3tA@y*X(#+{knP!p8l#w*W5>JG@
zDt9N*N^UWkK6no+m;21R*9L|j^A@2TI&F7QcIhV?9w#|h)!kwn^z}8AHK}aqYu9lT
z-{D@!xZxe>H%fF_rcKUJ5gtO&+B*}`G>}e@V{A6F>I^v7uhjtQm-P<RlH8js>3Vh~
zb;X_`?+dO!Wh7ODJlG*#U@s91z#r|IkS(bTcW|5fbMD0@&W#6(A+9N9nYJS}B@*Ch
zEDbxiiSZ1M3e~BkDebZEozv}%)@6`m>qbQ<2-#EUx1n`4e~Ry)iBpjs756Fcyt0~S
z;vcvdl({dO$d4bpZ@u@^&PHn*X*6s8%vzDha?_MQ97cV!7)6ECa8zezlgnV}xBx?%
zmZ9MQ$^{rJd@%jmK+)U?lr!W*LHCZC$HB-Bq1@V;($`%M^-0T+{TY+_<YaAKqUXr?
zKRIdunq;h~@*7yGccZ*|SCrMf?Y_Rap(e9rYJg%it#DxzdqqqP!TM}|Pbl%io-r~w
zJih3iQ0(rJ^`RJ7q<mBsJ32&I#G1F4JY2o2=0kTko^g3!31)3kZ>&<)Oi?X^v3L!w
z-lLo6CLm_GMvmL(V)FSF8Dn%D7YS{`$f(;9nOvbHP5RYq_eg#2oPcDZNPLS=Q6ftx
z`GLuSI>WB(;1Ks&Ik#Si#K(yCCjB065Fk$$VhZdBxINtKv~ls_jo#!3YO%@}hn}w4
zwrCKT9PWO|(x?l;KU9^W8x8m2N;RAks!YS?^k)aHrLX&tF|%CeX8|I8F=9i8LxkdT
z9KkJTShGQ0Wc%7}W-ZfocXTb8sX;&4^^CcasLg>MoSXOIZ_8-@5GL^x239iWmH*<s
zAz5e0E0ZC$E0k5W?~ZEwiz@Zgr^*+|>f9{<)1b;HZI#A9Ded*D_YZuc8jS~sYcuAe
zcuT}wn`8qX<di3kj&rlbR=~7ZMKV9sY+%{SSusIk?}{w8@a>HZu`(z#FPG1opfzCT
z2sY)s#xl3Q%$-^0c4cOhqpLB}r&(!7)0NYPVxTE0L%4@Nzz@q-3%vWss8;crLCR^N
zfz5n?TC{05#Ik#)I9C_K@@`XGzz=?<zPfX_snT1VtH#}COgL7oev-M*IN`HJ1L0+U
z&vXDAS^IV34XG5vnHrc2B&hAe2I*%NOW%ZjY~HfQ%vzVX6T8w^lpj8U4iyA`yX7gS
zei0mVkRl3~8fgHXJOp(n9<7++`-@6fYB1XVMbXJJtzm#YlB>Oa(^?`OF%89<6OT6F
zUeKPi=Zy^J+xX=RE|V>GKk55cU##4#zKA{c_kQ{8{0f-mCR(Zw>qIT&nfxmPc=t2#
zs%?5wD+~#JxyiHYv(2|ATx1{ne&P)b=+qK%%e2%|>_QBB(c+~Gj6E~9U)D@xv=1yM
z?oN-aWJ^3+l(~l^rNP#N`JDt*+TYOj1D7;#(dWR}Nn8wyQ$N>BE^oh+F+pAp(OdG)
zhk29vi7ph+$kY*rz#~i&0xkZc-H_P8aM-Fee7-M9sqz`IHxL-GW8-sc*!<}oMfHP7
z!pyS4Cxa;p9Y`g`NT_n@?`5lJy^A$9t`4Wq$Bt+aYs|?->7y0FD!E2r>5hqHhn||{
z^pe<fV0=U3(PAT=@_NiZxbd=}+X^31+*xqs`1qylw4S%IZXiYjk~Y>24sWb0;{QJ3
zWfKQ&tlPI}W8HqN!6MwRXK!za24q^K@dq2Y0vRLMug=iYGJXjoR9?LnywJTUV=ttk
zVw#+VE@XTkk$;S{rHI9<>$ZlgYz@-^(0pp4Oc6IHQ>N+_k-n<yxDT9Y5ZG$a_l`f<
z_pr@4?M~m3FxTGyj${&LBHi-^Maw8^qfg;yU~9WeMZZZ=yS|qHv;sR0^&<V<cfU;F
zEEg5>F;pWOk9ayYgDX!Fy7OUdVRK3wzv?1Pd@@T%oLgTd%tvBuQN-;r!IIN=BcM~L
z>MTMVW&De{({W(32R1eJfQGX`o$NG26(I!Wn&)L-^`8xAjIGTdo~S_rRZ#Q*zi5m&
zToAl`RhRuz&s1ZJ+WAK~Wn}Y<K3!{D{gj;#XN{kK+1M6C$a~3uub=<hL4Ko~sF7u3
z&&sb`8!>=(ji0|F$ZxZb`>guq!6YoK=FEqI$HYFeh0e~ef3~gvU_XC^{N##a&|lW1
zXV8FsQ?oIy0rLh+w@`QNR+=|BHT)jNOcse^f%!2mSZc%_TkKw_D<T+6yZ*8meqfXZ
z>s$MxVS=TH&{3s05KB7@=bElA^Yi>kXZFdX0W2gxEFa}QGJ(Rv_IWwFrL|xad-z@}
zTr4kk5xxM#T_;f5-gL(mxmQ*=w?0Z+)m#1LhMiB$W?#7a`I=|ki;9ZkJJJ1m%{R0k
zaj`$@&gLwtfi?8Bs1UX_js5j>fAG<3b-@IyA1676uC+V2>R@**n%X@5hMlD7n7HaI
z#gY$Y#FyG)lh=+Id9YxAa5+dEY~z{vEet<(&z>e?GPhkN9;FH)jVQO_d@#=S!8i=1
zJV4wzdd?w^G2F%uo`1m!$ND5B1~X>|$0BHcq-Vzv#9<V_a`@s=)mwx8n9guJZ5NDX
zN$^i@)oK@hQf2?6v?f`tG4q$>1NuI?OU?UkVf;lOM8mxzhX7^w)>xFi#V`i2Mxn0W
z^fnGyKbPKaxjCS>68Az~y9&J-|8&t4eW~@E8Ba5!H+!e2Pj5bJmHK)9o5liAUea?6
zdSffuUdQxXke&)(Tm2?p4guaU0ayzaEe-G?VNaPohq)u2TX#wk-<%~lv%VeE8IA~9
ziS@-be~!Py=QkPqlJ2W~vJ2XOl{|Vjywq?~*bF&gv^47Z+)Kk3jI@|Ec0-?CPSyI5
zXO<3N<D{a*W5uIloMcH}1WbI0xZU1FP6maZPLGp1FODtzoHpJ+&9sr6DeB8kE?oZ&
zIJwEi5by5W^CuURG;bJ9SjgNHs6i8jzrO0|f&&aM7)qqZUYzhND(k}uCsJAFC8hzR
zzkdNR-|P>}>(x16boE_te*Xe^j_ME3_oy!;BjmpVPgi?C<XlMkKxVW(3E%XRPljgw
zRjiSbKFwY>!VdcP_*T8PbzwA$2VIdeI^S7~pl}P>*`cz`7XD<t_NdLcZTrk|j9-aN
z)?Iv}1_W3^*O8gqDP{V@b*OC<c;ORYxSNA#`1=sz){tc6P@%md+KSE35>0<R)x!HY
zP5Gp-tU$EbOEht2{PRWAJvUlnm1rt+uZ%7pon<d8&p%&2af$+ppU&FU2&b0~-J^~S
zDmQzNBeHUN*IwoFF}L-j#=E~l(qSBbOI%qLF_&tHyApweR&((x!!4+ddtsHo+}e*C
z##3MBB&f;G1Yf4VSl><+k7lRZF!w!^o>|@#WE-T{SF@!)Xyf&CR%5o3v|cY|;CfZD
zRjKR9^aU(*Vt*iij>SIn1Pi<`DEfA)U;k!PG!O+cuN!__?W?DRge<m;CG81kr^EZH
zCO5I4sKy_oaWa1%a_9DM{OvF28b3xom+%SXPJc;O)xU;cQA6fcjYf0vYK`m~13Ern
z4~cV(@{xsmr*xsgW<A1?%~erjI|(L#Lm3ixQUJ20R+&=0CjZm&;Qkwf{snN)r-s0$
z8@43y{!kkKv5J1a@E+a2=qic^BlZW_{$ClfUD6=3s@QxrKA)muFSWnQAkDhN=Z*7P
zO7($zbYA11ur~dIo-giS!$&94_<9vp%U?igXY_)5t%^>gsK`>KA2M)D)0OElJ7Ptq
zRCZP5GT3btMYu?dc2^M~;0xg1i0;s*=k;oQiHd&yh<W{s7O7|vMZbVUCiXA-rxPi9
z53zs#75a`)K1bhosOT_?egVMGx&8V&O+`D|Ir>+|=zEmU(N-Bn{gs+Kl^R51;_A;J
zv6=lFf3A|okMxUbfFCjl@5h(Nns$5f<qs(uu*MJG0sPOGCp(t)>-kJI{xyoO*3|8m
z=#r;!`ax08VVSV1{L5ac)@Bq5rf;U!96pK#(qWl92}5h<Z@b?;9+S#!)Y;3N6$iHN
zu5*(6(Om0p!kNlptz!>uwC+CAX<SE*3OO+A5muQB?<b8~VbW_i;-Y#UU(5M=1utWC
zVRe0&KMmr9iePQj(jj{ZDTIc>ADQos%G6ZEpJtr`9E%a$>deErPxQ-HD_BNrAFouK
z?pyAQ@BNG`F7|)V7tKIKb$ME*3?H!A9XI7;(@)&Lf<)8`vpVW1wRMEmBNcJBqFu4?
zM-1mp>GR*t+iM#WqK%=M5Xvc;hZ=>{usr?Gsib}*rL;`0@?Ny?Z4}!KmXO}&GyE&x
zH2bw>6c~v_(3RqHUl~q&<{Fspkpb$m2S=B^!KA+dqX-M%<P&rzaeWb1-yJ+Px-TR?
zxr~@t3|nGx(ZKfjI`07JKjPL#wT=juap{s5sRNbH)Dl0H)=R93?ZjPU2Mr+dM03Pz
zT}zFkIic6kAM2v@g|yDuo(*vqqA8~CQtQD~sNJwhVSJg*&cm$=6JR&RoTQvG)dX8)
ztZ-MVTDnQSTrpNA6I<qg$6K|(BXtayThgGJD)E%P>IjBG{cA%9+ru&QNn!75V<N;U
z%FVb_!ijYe?(&%$#<z+^TtTn_Oh)#Ay+S@~J2-^-3}A~%Qvuau((G2T?rBaZdg>OB
zNj287N7StSO>@^h>(P+`kjG$J@Sity94X@I(~CbJiuKDVy%G;VFM0#q?q3A!WA4Xf
zy((L`LQ==5`}(57n9w+!QKzNa4PAvDL#aE(dJJQ*kP&v_g^jDRUB2Um66?aL_C23|
z`soK-hOA%uax4F085}dykq_3lwxZuRY)Oq7;52Lk;dKRD6Wa?b-!aJaR|Y5kB~LXs
z!<yf?J^R6VbU9AN2jOkNmDFrj#)|OAe6-BnqMPI7K^!KCjq&_X*R+ZtVlUEOlvP5+
zUEfuTsZRP%_anLwRC`A1?Lzv<1sh;?Bx-#fKvmKE!SnWGXo#bIADwRZ3P%lgmao-y
z(7{%dicv(UG2nK;#%}uHn)U3qV;5{7AotuNA}JrTt7%ZgNnQ`3=B*#u*IMCcUvIOQ
z+w6Z=_V^B&eOsRt*$lUIZbnaZJ~w0N93F|Ss=?Ddc0L^}r=t((cUK*yf8wssmG}81
zTYi`+?<5z9Y~|;mab)M~%7v<z`(FHXud&>V7s&?@{1Jyowtw6h28o^C5vf9`O|swy
zL_E#V_24XBL#xnvW0`KXuX1iR?#N9xcs}leMx4s#H8h&O<a9v6UI#c8-jwpn?cU6y
z&{K(SpB-iv<#U7_8l0rAerj>r*jQxyG%-r6$IMrG=_>3RY_{YWtM9KjXHYWZNYCM;
zFFub=2l#Z7my;8mmN`is`2e3~YHOnZEZjQDAMr-Kxc9Y;FuJqwM<-TADG@Kql!8C*
z7v;WZ-JA^nfVpz<5Iv4cib7`<P}ZoXqS)bl?{~ZMkP?Kk*>2V$ac#&a59T3z#{%^l
z9zOgZh|0%&aXXP5E3x?Mv}RUDeeid3_#WyW<E_pR3<on_kvFZJaV_-;Afh`gIMeM-
zk?>(~&I|8NOfme7=($DSpv1azG8%^#CWlfb+Z*K>=$$|T>LO+XnXi$=+A0YySp;QB
zL;QS;35TwisCgh^z%R)k@JsRsoNb{=+FG7zO~&yl!FYF{jkG*e5$ZWqJGVHsAkuxf
z%Vx?zXrpFh?9!UYVwcv1HdH<q>a5hY+va%Te4_fmE6=V=AJfZTv6q3^0JI||5-D4i
zIiF$gDy&|Mrx(tt&Ue>#KM4<SvYfwewV?!bAocFI$I?4G3=WL@q1j*f!uj-6YcHfx
zQ^}~;@+MQ`_G%{6dqHk6nGP3uFqy_5^Nt3S+DVcXD&78!nL|tL9D1@v-wDj0q4*Fp
ze?BZav2wwh!_!C6nwdQB@`t6k?@WY{HG59J*=ePj5A$ek2F{#zKAb55(p(M!F~b-l
zE2Pp0GoqW3aKLByUz-+vs$%}DT6|fmQA89>_twn^Tt`RHm<X9E6w1WQy16`&iAZdn
zTZHd!NK?O20hs^&E_4jr%M|(F4(F83D2h(0`E}-XO_4VmeKhgLY{=j;_;)@eaS@|5
z3!a_>FJHkVuu#MOk>OdQCRm<*L2QtWwhGrGJ}Y<9Ut_Zi`@U6@2t<LOWVv^-FK5g0
z;N316i%dm57;I%MTni2*Qwy>}7G5QxsjPCF5wcULFjZe=wgQpP@LX1B-94QC5cpbB
z&6^-hH3gWO&=*tPk*;m{<K~@LpyWk#coqn_j1FIscyzXA+!n@{rMf@kcFwmlW*`*6
zjN1~($2v6fk?0H~bN(q3GOvTM7}u=gkn}X%m938M*%^GEU*G?T_wwqiV)MW_eC5?=
zF^%{ikVp?q^bB%tssRe7??)MI?EU^oh(-O8*!~g-;c)OecFWr2hr?jnh@NOQPacL^
zJeUdsdN-sY?TL?nIhv9e7a7mb?d!I^vwdN7s`Fq&bn0<?-YY2Bzks>+au73l`)vMy
z%-^ZnJ*NldFKh<=u@^E~O(b(K4V$!exwPAYw9UCRU19gahsx>eFkPjYZ;&QctP81k
zE=cPA^(=kWUSn+gj$A#bkP6y@_0_`Y6`5{PDuHV{*yJn#ZaaUJu%ELdk5(^~)stLk
z)fX0dSC)}cB<;WGI+LaT!;t)dz9(g#$M8N=!X?2=k?oj{$Ct95tcu!3f`_uP_b
zWj8ESlx`koa5KwmDe~rsSX~}Mq4%;)!`t;m=0aSGmebYCkb~uwo9gJrWi8IF`wM0k
zezaa*xkag0m=nOW@U_$-hi6msb~1~lrfEr2mPi-M|Lmrnpa@8%UCtLzx4kG#4z}7a
z+Fw@t1?`)DkM_I$-_w3)S?zbbnX1)gmUu&nmetv84by|=A267St?f-GdA{TcOc!!)
z)fMQLvwHxyy!%jgNy<ZAI70ANLs%^*`AhNtoSm$~biyDUyVk&eDh0dhckZ<Vga3c(
zz*QUQK$GpjAO!sM;tn*VJ(X!f1l}--Cs9C0y(F&`Ca9}sUsy~`s`)WXdkohsBQHV9
zX)omHudS8pREH?TOp;Ww3suS9M#QjZKJKNG@%e-!efojR*Jr-X=fFwTqK6=4O4ATO
z$V1nly<+IK-~RtI#AmI~!%(J)22FPmIy%Fnn`X7R4yP|IgJ|&*;iZC8f}gTcT)ENA
z)6qP6*AzJ?u`xmoQABbD=$6c+cxX3O!3~^YWn@EW)opJsc?ztSBf{lNjo_C;Z(X_N
zhBOOeGBkMqy1W%w=GStt62AKZxb{dRCMqmUs+z+*zZA$BR?FE!#x&HsYd88OgK4}x
z!w8x2*LqC;dpc8Y*JUjXwAN*H05FpA(rtLsm#v>)Zt<0Qrzp^u6?!nIFXK8<07kOf
zaOQcash7TNa!7{}6Efv@Du=Hx&$#+?^yPA^FPC}D$AP|Vm18txe_4+NL_Ar2nZ>^J
zWgKNtto!QAM_3_Mst*aHDhKGXIx~QsVGZeWST9Fau3RTAhvg9spg6C~Ey8H;^YrCG
zEIF;dyr4KWH_|=CMT9*Aeb;o_Q*$+sImuRJh}D}nR(2XrBU9b4KZQ{WVt;mipha-|
zUIt=AzZJ^7=khSVo8joULYbl*KE~yXqZP_invT#PS!aM=(JG4*R)(5bv|bg$|DDxI
zg$5zJI@zq+Q5X$%T6F8x%>CG+#DH65#?(?28=`kfdF4AHtxvMc(O#<)GgL;yc9J^5
zR=swdoiFSvW%=67R#J)QcoDjih#P{=j4;B6wM3y=OMH86=2xa@%_o=`GC$_oRBNuw
z40I?%pi{Bq*p)?TW;2!a`dFin=PHm&sSOTk)i=ApX#LY~QRkD<AL(ae39|&To~|z?
z-j1+Lh$o~8j}^EgSewMqoIl{XVed4m9#4RW5xdqG;}4=r>T6qAHq_U~_Sv;Q%=DwQ
z<+gs4ckBr7%2Ib6M?JRf+E5hR&l_8-Ar9e7uxmp&_H`UL1q>HQb4tE0EU!C-ZXEAj
zSWF!7%5Cd<2DGsDEA)zQVAXa+&Ftv-YfI#S78_LA<u#o6am}V!xtTv;B6TC|cMnjF
zPfqj*kYXWfT`&mmmj6b{@y5wETH(G=Qx)sp9OQO$y({H$mkDj75*+XoJI>^~`*{^8
zkUN;OOvbkkTle=cgkKff=|#MjuyAy+%lV0V>_ZCy+IA+hg#m<qqU+u|Ou4;=-<3*(
zG5+~EYh?G6lp)UnV12wQ{{I*|_rN%-qW@>pZM#5ZqXdZ%CCGw_1WYh$Vxy)>niN_g
z(ApL(7hkbfK`pSM1xjhz#P)I7QeVLvqKKk^H(u1TN$4dlG%X;MqSAszK!IJBOF>9O
zX`A2YJLh>en*#6e{iDsZ=Q?L*&YU@O=FA~D2&VvaKR>vuz91M(XE^}W0CP!b7X{==
zG2ib^W7aIb5u<zZ$`bgi%H4<Z$xP!O9uvC;GKUV`%lLn&@n00HInD;mHSLTV^v5R{
z0EJHIDtD9kp?^Gx!BP5V;pgQ;;p6ielmX1P*f~kbsjtR6OV6h3YEB-;IRY;8KNy?>
zrsJwBD9=7549ygt2Qo)2drt4=dc}h+&JUm)c{GxM3BnfNX%zLLU8C!tA2tR**hc7e
z*)DtHSzrL8kO^!BR64>tJ<RSgJInQ(r%e2=a=QV;@?w`@-2E4sKBFr?s<PvBd4k8&
z_#SGPjkrvy_ZT*WHxrKt=$lSOml@WQ{w`?WEpI&D+RCGy=NK8gk;L+*7vydBX)AKD
zINKpBG=?bQ%$G4&1$16choZ@@<3>Vof0%I{lsR)gB9$%9#>`ZGp$Uiz0VknV4XmXF
zkPp5^Td&xsuE?4^qZB$OTiPbIG)EJQnWp|=lUF;|D$^Ks)ke@8yKwQ|;e*|_S+6G(
zD1wEq%$qE(CB#qx_wD4Y1lo+EVOWs(0N64tq-w}mBsafIUv5q%zo@gzs_YFYC8LP@
ziduUcQXQY4uROGcJi@mpu8555IykXN*AH$ZvYf`drhvP}z!zb%=@(M+#Cc4<gzwVF
zHsy^OO<^D9ejmZ;&MNP>a{z21xwG>f^vrjIs6sUh8B;j;zoFzY^R%$-ZK4eDuf_8$
zn4N+@j#DbE55--`wi0_4Ci7X&jIz!2p6|BXo~?VAac$7J-W7K{{Jz)7vu1Q~!d>o~
zd<Q+BdgpO9DfwM-cD&#AXtVutt%dfb*<(=^N1LDb&dpz_<S}!p5N-8-^Xu@+EChWq
z&EKn;t@Xgfd}x<rl+9|-Nx!vV#gJ|ocE~nFi)Cfufo1jHLiREC|G=P@Y#o<GRd^o7
zn&@=wRGSxf*$wi_fVcgApA5Dp=O8f>!{ejfT@oE`irG<PFsZb{`NqOSAEAv-nKB5h
z{4x0q`-^ZWc||07w(Zp?%5eXt)YI9vSI3&9y?XNSU*_18nK5^A<mbA%=u}w02`}{X
z+f)D@ifubFJh1Rq&_k-DR*@i)J6d)f0@!k0FWaY9G6!(=4(|aea%Pm1InEj8oZ$fN
zb&pI2XNp&=vc1Dp)mr%Sp{eWd3KtEJkUTwm3(0x1cYj>|w1xB?P@bDICn;|XOGBw(
zRc7>)urOR%PMB?I%2`^*L__0-Xg7~%1VpxVCwYqL2icDZB1e2;=j=A%GKZS59eCvk
z?+l%tM5>3I`D4`owFH(ck01@C=<y=CTNY$?U<n)uZ4A9hrK;@n@-6{L_V7;7xv?0S
z$G&YiqiC?aF|$Z81VUa`KLq_E9T2>*>=~`}ja#EVA7BFIzVU9|eMer)W3V^co#l-Y
z2=CBcBfbcQ-QA%H1qGAE3@UZ~HF=7DR~aZq1-f(3lL!+Czw9}!WR1JJPIU^vtwYv^
zTW(B3x=IR$67Bi!*h<8!5ju<2cJj=yM~Jp@GE9jHCJKgomKzNGcCB}~)@!YTO8K<o
zka1(BcX_!i1Kmf17u!^3=*?&A^rF{&I|gh2#cyJHV-*AZoyGq+mSt78!ktILrqff`
z{*QIZXLg4?a?q$KX9{*{vf@tkC+^8i1)C9{c+u6_71LwKB28^ietiv_B3+4V_U4o=
zIn&!%H)Qtc<jlLn9D+(qMJxGlNgT<p7mjFGh^DQD<be~;#k<05El+F=H@?wzuRI)%
zO)Xxo>&AMKsTN3^0ozumgM$@Ud4!;3d*EvWr)&JadgJSH6Eq|zY7k$kZ<^YR;;wzg
z$;{ri>P^YXWdr-e#A!RFdQ)QGNNR~9y-kgFE7~FUt(6<)?*qXQl651ypTwq-d;g$w
z+U(#*Vq+=0qVAh0)kwW1{|4SRX3N2$%?Ik>xrcencK5&whr;nN5i>N}y$w=GCcesF
z5LAm$A0O>GU42GU;r~vBm!{$!4^6sQ_tBf8*J+4cv0ZtR50u?G4=ENIyT8+UV~}+3
zWk6`sSbfQ$Gc8$A5dZD>({TPu^{6(vWWCcQ<7t3slD9$p_knzs>_Bi{2%&R7f)cep
z0i^ADDE7C=E6QA(SlGoo6mio;o8;NC!~h2)oym?WqBtgJml4QOZ$iv&ll`@$If?c)
zTUR1)mZ0vK%2`4O+YHHbZ&))UvHpDIxOatg2N#4BU>>Sq96qW2mBdk8jLQy#olmM{
zQtGVQ<fRd6b9=LUnou^mHhD(9H<^IDD1fptP4_1AlI_^}@8;eEk`@x(CQi9(Ytkm#
zqcfOb9*PCE8@pV$<V=kfl8<?x*$H}{mfghBV1(x*7+(^l^MUL~*a`WKePOh*bqGH(
z+H|*1i7<>>TGPUvdHB7qMH%jcVY3fiFhB7^dGgdSp7Fejs=x)r>xygJTnu3}#WLgN
z#-+@b^5ofJADZf6c9F&2WbSq}ULLvZ#N@>s4y{4;(8|@2JPg+LFWsl+ex|7LKaNkl
zOzIn@m+TCt-%Ltk<VsvvR?c+B5uu|@A(~mWTg$zUlI&zWrGilk5x$<>I-h;AbigWs
zsKNagb3YiAq_OrCYzW0&NQU^KpygV_9+%Srk?na;b`)(6rGG_#6vB3PRPLNeP@fJ3
ze0$)Zxt)(kzx^jvXhrOaes8^;uHOeR#GZH&@aQTgiIi;nZh0VmqCG8d!OxfTU$Uja
z<4Tk0BKbFJ%YXsDA=~id>XjWtA`|9n!m@j>1w1>04EO`F!LlwZLAYmIY7zWrc8kf8
zXirquOQ<dWNgjsa)69p9rbm0u0JQ8r0f5#qR_pGui64(uxiub*d{?$wjQ#eKH_O=&
zB`;rcbM{6hjjjA4B~dwFYINJza}YBC4c|b>WbGGZ%a<I^ei=aVaTo`JbfN1Kl@G{l
z18t3D&r#yrq5G_W9t&Ng8^`E|XmqpD^F4t%w)2$^@>&q&qdP@p3&ckDyV?R?ge)S*
z2?uNlEs^Z^oWWS>p{;?$A^jw!Lq^Fi7MoNzH&W2;NZI+moo8zs3cD2zwlwHZ_K(t`
z-lm3_g2z!Fd1Dd0jwG|W{hHy~4bs{~V-aSwQ3d-;YEkMqaE)q<J=@%JJc{rQ*}ss)
z(sTqGc_FvG3p6(f8t9j&SSGv5ph>(LiuPQ9DuNC0(}E>C+kRjf{D4cvU*-Ds;3H6X
zqCF~+jqqP^pXObd<}#@){$Ms|?bo}M+^O+_EDd{C)_#Hgokbi59_iye+s<|+V5u3b
z+C<%sWS`FgMO$o<=@5Z4)r)7Fi0ppL^<T?j<|2Y+i)1@LAkjb+SUWRAW8%3lr!m#>
z;cHB5=Ii7~N(~y*=XUKM$!?(~WK`z0nX->&Z(-~n(*0lj#LSbuAA0KdqyF!>gu$p5
zt)*oEIhOodgwQ^mG7U#p{tjS#z6&G-p>f$>gdX*_hjeCEg#@S-4_`xX$q8H>Z!S5r
z^Pe?@v6K^DEsBSY=%{SXiz*-qdCl)fM*JvgAig#~=<Gohq0M~c>f3ktk<KMTe+nmL
ze;^KVFy~iSS}f(LEPI0>&;dGYkXDi_i%9$|Q{CoBfc_SoXG#UdMQ1tu%TO#Z4F4St
z+OuSEF<rF_nwvuS4PoB(ysih#bMZ?%R2tey$gJ$=DW`}+$ZUIpF3pa}ws97bQ}BpP
zX%4IcSB0KCWM6bGt~uM$(rrI!^SoElfSoAFo`gVhqMTzW4eXW?GJVDR@`!hTb^|S;
zC|7Erd1X1<|AM6|bX!5{tu9p-gIbP9jW|bVud`HGS!eI}#J&yiyy9bj3s2yAdWxJK
zzjc51@}ZKP-gc@JFxdIz79Rjk<d4iYxXx<Fg79Ibs#auYu@2gwyTPgZqo5a2A{9_<
zoKLX+*^XdxEHGl_S!*j?v5KqURpL162~Di(vhs1=TGSrF;c30Mp{pcuZ&k0>$1i%D
z?bMF7{l%%?xKxYWTB55D_FB39US+v3BJ30%lpUNm8cO+5GT4GbqhHF>)z*!9dp`b@
zuw*#`LWhNlP+J9CRVHUe8Xv#(xWrpWFFdKgQg!8;s<tNtjJoX%xMG5b%gO|5mC-^u
zjx`&(YnvF}ciF=f%Y5uiblE4y_*VtvO^#y>@8ec^bajzH5AMhRFL)S;3w&<VV!XSz
z%JhXVZWI=9ex61<?*$7j@qdqu8<`f)-RjFv=ig8P-!uTB#RVa-;^oQrb97Lz^YvNO
zEN+f}wehpwThaCpF-CduG2BSzPf(c0LCy_V|1;i^e1B*s_uU@`K-=yo+a00WjZm{h
zr~$$Vkjub6Fx8tNuue0u+5v0g$b^y8!nswT$Qv%Wv=5JklkZtPIYMNDqQ&p&iuM)l
z0^5fx1!AvSwrAuzeEy17!P=*7%{?c7Le?6syU?wY{_26Xf>|9)UbWZjh@}>mCI-WU
z6Amew5b@@Py>CY3j{Mc|$VZl5H6cXUgDHCzV+JoNF1m`K&G{FViaI&>ow8S~!mBEx
z>VZCq8&}QXjb>hWke9`by(o_*$(BmvTduSDx^VC5IzF~$5(*DIhW_F=!fQc~O5iS~
zp%~-P>p_`1&Z!e`5j9}(Me!q-y`^!_TXpp%{TjO=K<7I|-~6Cq>tDMF@twan?cCSY
z$|QPE%`D%ZcxD$@>{2azy|XLf|C>Xgqa`xfA_<3*v3LFY-#zJ_?9JNCCQ^U^1V9-J
zC)9TC7TaIXuz42@S(8-eHh-i)!@&t^A5t((onOt+@`9hq!0@=Qt^ds(ciaJ-tSseU
z%q}6GgU^^jJhZ%beQmONZ>lrw4W#Dl0KXjKl;u7oxV%>eCp<3r$B>h0TArL7>u)B9
zZ&Skv{mn8mHx{nmK*&UqH#2QFVv6kU^(!{4m^^{~CObY`Ylu~}fsVqN%<KC{a^H7k
za`Pn&f0e^2-X;QE6Wn=Im}Py_lnJ51312Qg5D?M{HWNvPV+uw5YO*tiw>SO;1C2W_
z`$XeImz`ATKZZ?_t$cFwuEvLwXT0vU?n+J`_Ga)gyzt*@fy(FL*rvBXh<mp6+=8iM
zQ7#UQ2kzjNl#4;es^t9X$>vUG2=3|Qi&9JU8g_}dClx-bdc(ZLr}ueVyFQ$nfuDLR
z{J!deTzC~fqIXXoN(>ZxkIqAI#a~WMem#13>Ab|A{aweVW`tCbn8ri7i17m{-lOCv
zGQ}zqf2D5Ayq;}~rlOdyn;7l>1I#s#b$`W!e2}#&diTV{D-<2xcgYp}zd!ozgykge
zE%hT3hc-=a+|kv+=JM69>?-IjDaZL<vQwH0#$xa9aE8Vazu()6yeJ86otIcNRFvu*
zx;#xZ{`=~-jGl)@?=DWf;QFgqf0x}-w<UK6blfoTa+J4jHY|IsXeohq{zj+Ko^x4K
zaK_BT!uj;zz$?*c_g9rMu<TWpwU||P+X_Z<n2lulCn?lI80%-fY_8uM7|2HFt%@HU
zbdh^DbYJc%M<2JY#PQjfM&z36%^c@08b7JEW=Tu3b-IR@Z0+PvDgJpn^HIdz(&|SV
z2QE1w6)tv&DCt2-6B<gpo-o;;(0e-PokI|mvZ?k#QC?fSuqHsxqR$i8>J4xA;;qrU
zJBOgwzDtf2%@(e2hkBN?I>@>7Ibx>fqFz}nevrcupGh3h9_iU~_109!NNyE@vX+Bg
zBPHwsDVN7VKnLi~{ma`(ZN@&hY`0LBd!c%OivQw0`TWA>&fiDZTgksN0vRQLsCQYQ
z<4In9Ec4>Ax(_Xsq}yN=&1Ji+Z_jF+cPhFU3y#%*-A5PQ(Rg1kRs<D=bjjw?2T@p}
z`EAyuGMXYj3oq2PH_;FA&71YdyHmg*-!g~satyL<A{k-JFIRqHr#2rPeVf#5vbi3l
z!Tc-lNBOXq1*FA=lTAD?R>~Jq>yqJBHa2M|@u(O*xu6rXk-Jf$Rq1S=PMpbXTB-M_
z?70k8Wtq{RQtCq$nkcthQY_+Xgj+(L^cyr%P7B;<79{TvAW>lX@;oGE0VI{yj5Sg@
z7Lv+QNE9*JAkniUTs;va6?sUi3L(KFRtQPeC?q`c<!~Z%SXCa9SO7`wC?vIGA*mgO
zL<i$kuQh0D93(Y)NE!+uX&4JhL-Ol}SS+o-7acJx*;^a+$$FnU^*k0)v&unn5IfeZ
zI<+}Xo>T8lfgVfd)tP@*vII9A-l|B}r$>t}aYbj<d+jrc%Jzw5SZvVq03Gp8ue(_9
zuXnI7yRGmKTL+tGiU~6PSP>e}t-t!Yj>fC%ufBN%g+{<Z)%wPk`sj6YnPVi{o5Cd4
zSYokDbf`r1TjDR#uqo+?#9vF)oevTn`T1*!yXccd$5{Ne#P7RA$FgYRme@oh7kf;;
z)IAXZpID>;Z)o*8XTpt{VGJ7@!c!VT^g0D)$kx+?^cCj2vux=^7KM!o?c8e?v#x8A
z{bp(MCe69zwC14!JfL;z99@kKCNYAS#(ny=@+JOHjD*!*^g59bUC~Etv?s^!WIJ}C
z7cp&d4Q-`<m*V776z#djRZLz|7VUmU=`4}U{-y4s-A`LRacj3+vXbr7*)0sV&*YoV
zisK(kwljs6RLLv)S<>7p9-tskzqc@;8U5@)M*d(Wj8m4!GAR-0yBoP5L7W@r>Y;1Z
z^{MunQFO|#WlxV_**fSU@6u*ToXO4TdE^)6`g%sX?%&-Ot5Wf<qZ3c>w{&k>bM9wL
zCMQp`pwRd8{6zL3&`b=seD>1O5oVjnOZI5WxPgh?vK&kDjs)8qvrc8VKr6<qUd_v!
z1;jCE+NW^`H0F)x!!^n!^;bWgJ=`bkJLqrnMHK7KspM^F*ox)5gd14R5l%mKxA75z
z+*S{#=I`PpWnf>}Tq};GYuLK9cPSv4Zs{NR9D5VGr4D?`mo)PTR}ep!4$9ln=LqV9
z-W<VGiC*l?VcY*O+_FiHZzQKr3gg8xb5g_^l)E0FQfcy25*JI#+;Wp_ZN4qs6}~Oh
z)oPa=)S^P5Ej4tpC?T2k8k8=5YNDJ`8A2W9r_PAVfHQwF@<wh*C1((fF~0h?V#Nw7
z>bfi00b9jSPj*cAXiA;4Q5ftn)&dHuHzd!r7X3_xDyvni$rWJ`0@G;5jXdqKiF~|;
z>7+R&7%e=<nw#9Io3kTPWcT;Ur5n$d2I)_>&SgG#C&aGBMMx)FRF@x0X<}M)F<r?B
zGBTqn@#W@yw#Pm^d0wYjy#xC8seD#$eE5OKUzIF-f*+cH_PC8c4xm5q!|ogoaEx8*
zWu*TOLgv)zyC5^&m0cRolNd;J`OB!*bYq^(pSE~JG=!m?0p#iH+fQEmg9bTiml61N
zBk-_K;QMK@j9aY};+1`XkHq34q{%F>QVUixH%tbJSCW-%Tzd6{qOR@ANG`<G=j$KF
z5Ye7ng(y)o+Wlib1BzbF<6yit!&XOPf@7swGjl)IF!JG2(mqXWP+z^l=%JornNfQD
z0TY_nFqR&*??R8`lHcs?d8z9<qlLQ4v!{*2xHk8^=(7`xz>^kx7B$${M;KnG&Zy2t
zH3(}G;ZbN$CRY%qbTMnh=_O7JJ!n!#O?2glFep)_BH1Eslv5mOqYWZ6srC5v^Go_@
z^qQrV%<H7}flk`c^%xOLwb`hm^(u;2pv2DUOm<EWJw7k7_|rrCQePkHs!X+ga)0%P
z!u=2-=7vs5Y%sMl{u<r|ukA*=Up%E~U)P6tTg7_?*V|##)m6T{=d)#AqG4Zr$a}2%
z;eqE%4|>=eK5m4g{m}Z|+o{PZOmu}d-vB}XdGCYOh(FNSnO;gBfcgQ@Jf=_jhmZ?v
z7($qgN>e}cZ+nI_KO(#L7EL+LnvH=|qR86mVfDNGdq(X_weAZewVxUIEz~Y2RwZro
zN}ziaw6$jT6ZTq=Z#E09uf8vJ&fe75OLra_z59@Pi8pzZ<tM=E4SV<7xDvVI>J1#g
z4wp7=Son{5iAj5-=9&zmJJYunoWH+{kPzmDchM5-IIAs+&-B#X4;H1a97=_wLLF1D
zzU!FOEbeQ#UEnyrgH7PyrQeU)1b!$r%Qk^nwuW*P4S9cmr~Tj1*!|x>7{dR)|7!~N
ze;X$^zRLdZ32%q?f0DQW7|OV94=l#hBewBrh~Lkc8@#Qd;b4oy{%`32wEx@4{*MjH
znEl_Yqx-)AmUrL(@vcv}X!mx^0q}VCDAXcDb#qCwYz0Yd`OOF6{Tz58DLH&kUH{&3
z1jvC36_d`Wi6%bpBzTNNz`a)Vm}pNUY0K`1b&DXf|BBRL{sof6eWlr~I$|z+$goFP
z(6fysX#T-cbt3^9*z`qLoWjE4Hhj@*zlBB?Z0#=jur__s<zFN%*!V@S{d_@*OP_R`
zKUTQ-!T#=#Z~85>{ofXEf2!$oyZ?#dsw!JaMNJmAPX1CV>C%AwOn$43HMPnuhR67#
zGk$bX*e$Kd&M(Z&HZuw*!JdA*1O>4+uZ~&u&hzSPw--uL2|6aNNl~{_6s~ITO-^Ac
z?mEJ)Xcud32v)QUv>Hs2G#8Bqr?}Pmtj_E@M%egD^tz9t^8_1Svn52AA3>6Bc>g)Z
z9`F&j9X_5>wKTpadqDO!zTKwysQjjQli3L3hvzK>kJ>Kz_gMwS4Bcn@$=uq4V5WRJ
zc`iFAdX?nqU~?w|j5p1u>klh-x9`bckABr$>V;#zcy;^jRQM1kQtHyf63^{QHPs=X
zSP^7KU;`IRp0zi5n{>=nhmuNgMNduESETD|tc&+2p4wZzVW?$qNM=NKxLscx+E^Uz
z*-Xbn9eX+4dxkG=Xq_HLg$TvR<5Yn+IN?7#BB9Nxk_p6Zq#W-L{graQ{!BB8Nb#sX
zCnGDGiBu2FuPoh_ws6x?*Ca+=GE@}mI$80~aMj?3rFAq;-C)%vJM^-5ab&2dm^Y*V
zJMpjmi3f_k^4x97FAxA>w6M#gsCTfgPn74D`|C;Ql1LW!;E_~W9hH+U%*}BJZBkp_
zC40T{>|AjP;U{;6HtYCc_TI!Z;||*Db?nWemf0PIJ)sSLwE^$cy;;0eOi}XnBgMLv
znW8e;4wB+LseZtI5N`>N8+{$;!%Ml9{e<^;S7xwXswA4A9!)OLw`7TB6OQhyZH7D>
zN|EOlHzf7-y~(rpCN?=zpA1c*r;+V&i1~<!IWROCVnX6@EZzl*<MoWRLN5Fva8(>1
z=XHibgLg@UR})VSdpv{0K>!_<AbCrX%Vmjs%XI=17FoDsjH0b~vPBkGn`M8Y2!p4m
zs1ISj<P+tbqTF5cR*9~Y#XMbKf^lYxaf*#`I*E?Q?cWH`rBzJu&N9a7I#M^M_k>>X
z5xmhmdvEsZAUJff%&qW|(I<5ODCtB4z|OXbI%kP)+vT!ZK(~*IKzVzSuP<?`(I8X-
zxyhcdIE4t=;k7jM$+<Y%Gr?_D8v0N%iat~HdZ;M6{53vP3l38?O|Wl@7#MMJ!*KCl
zl1KJD(RFxMuVDK8&-<ZnTgzEx<EB*$Urx=~+qj8&SsCr#tf^S@@#<ZAMv8F3Ro;}a
z4vM%c4r%6dM`iDBJJ^bLFQI7S`F)9piW3iqyes#5U3(37>}4K0$=~1}_{6~<?bZ!>
zsMwI4=JN+z?Nrmp-L$WY_Ur&YkGBa%C;Zp<Mte4rIyAuaRRjYjO5*cH#fA$k0=|B&
z2QrF?0~lR?4Taa~bImTi&P<0Yb31?b9O)0M1Ey<QsN}=^WCz34#RPKCBHgJ%Tt>TJ
z;kTaDd0fw%^1jbt^Iq*m@L#+#lKeaj8Rqp#oQCFvquut7Q%H|Y10MU86-d$4+GuG}
z(X!`@*jT5&wJR$Nr48Yalu(0#To?yJ=ZM^u?5=sTc1GAn=HbW1{rF&b<j(|+4XAN#
zu{mBTId$9Y{iSm@a{CI@r%I}lXZS*ad1ZviUZS<$?f?|qIiIE#omYauQ1%OC4z>a%
zApeb3LSzaSL1aO>$TxwTwpmUklvy=YjHGQAKQrBMAac{qAHcUFp_gg83c!b^Fxw<E
zH6%x;EyZ5MUj5RHi#NYrkhwu4&8mgGvX4_Ukb%fQdav{jwldj>p!xrc`ku!$B>d{e
zibdDPz2uEu-tzAmYiC`QSX5HQ@GqN|EQ_th>$fOfC9<)nEScD|Wl7BY&+aF@&8f1K
zke4ip4Gfp3!p+Hx25Jxy2YW|ia(;@c?WwQ@v~6rDS$H4CFt|;Q$r^eW)#_ft?#Jen
z=@3SGMkr5IScM2KPql5ROieA}W?=GSIX;)*l7=ZK{>3Cq<@B41k_(V(tz+ePbaiNQ
z`0%E(g+ts1<dRhB8xtdw!CNFW^QNNK+*6PP`N=2evy(%+j@epGLT=0C+@?vKx^>;k
z+E;=pF03w2(LxapalqENAQrvuzeI9cB8vyiX{cTd$osgqKu+d$;eDn<eJ0DW5Flmo
zPaU_5&&2wr@tB){shKy4$IB8Mi@oBk)>mrn&uyNZ{RH1;tx&~OnTr99a=>BB%)@aN
zT@=SK>OD3vQr`GzDtvXaZBtFMe$`bMPr`j-$#H-cK7p@P_)OuiZ9`2E#<OMIg0jT=
z^2W!y-k=aDJ-jHnD9pKDdMQ0t?`It;tL6=h#pQ|pS6_V?11_t^j^pjh&LKZF^Q5qY
zTu{6B<iJ<;rrcdV+MT@CbaeM$i;{C<9_CgI<~hWG8HU5qTo3|Xs%@Y$#dF$F_3L3g
zU{Yn@B~mm<jdtHAnF!X;DN5WIMr2#RxX2tx-$Uv~Al@UXYh?K%ruo7N$*WXl#b(hx
zy8NTXEDlEd3!r^!`BF%5J5DU@<IW<>HS2wrGsN6otvJ=LxRC-}<xG{W;lnz&<48iJ
z`~18Ze%_Nj7|-q%Is{-STo9|?%HPuJ4UD`rwfMbzQ6}!-K71*HP!S0>wU6YyH&-0m
zp5<U;#QIsM0n)VJtlwYKwT^BST`}HoJ=Iid0A>%RE>%+D0JPoPlV@;jP|QoByHbnx
zx>7O>jTz^~!u)y<`94o2inE)X=mPBM>O)$qxAqM1T%>Ash7Ne|z}tMx)|O2ZR<)z0
z|0lbWGE!}_J$y{!6qEN2=kRGW#1Xae45r41NrQHMLSVAFGKBQd%OS<YEUJyRZ9qwJ
z)*m2pWte3Qc=fnw+e6{frs8PJBR%q2Dv9<yPCdOx48Q3$aL$AiPfax6q4zT?yLj>!
ziY(o*bj2AX*_V)D(bb2wCiWZ@UHOzmT{yOM(tnauiN)+zFBrTQAFJ?pvjcwFG5Yw5
z_qW^L09Zt%?w?R-1>Sh6vd^0Szd|o=cfILt%3h<^^R&nlLX4E1r#uGdy~&&F{EfD4
z684ui?=N<A5F<>cP$8Lm7Lss^hp7xsD)Zi4`q5?;J5p_35q6|~kN?AwJ6i&tPxIc4
zuAZ>s(3;W}?IZ2koHmZDLm(-ua1b!E8KDFF4A6v=QUH0vvj@BtO**6O(vQk^RaT1C
z{;DIqt-JA4HM!k3P&4pM@$Scy;nIy=B@Rt#QG25)4u+2d&%2#IEe{<w-O0K{rpjxV
zG^k3>DoKTVv|coBxb$<0J*E9xVxz5(H*UYIbX4C9J<+&*;U1krNDAn_qX3?4t8URr
zaNoHl#EThKyPdpo&njQVb!^s=C7<G5;~>m@az-ttUxc#opKPtCRq5Ou;aii6H`|`r
zSl+lWcJ*I*Zn2<jhm5|3WtUMlIa?u~g66mdJGRKV6v50UeO!+b71nMgi`BvSzF@y#
zk3;h)27)#QYgV$>rNZ~sfSR85gHpzd;&li$L)K-)hjI9^;mATJJPAQ~&!d+76W@GP
zvx(^YLtZH+E!7`vb}l8&rqT>Hm$^hcF7+0~mehM2kjjDm-rGER;He{bZy#)_RXMMv
zX0WB+YP8rnY+^$>an*Mu?k!~`yvO0|=WuK%7h2|MuL3|7-29w$r3~ri$qTjlsa#x-
z3x4X`+L|_QieB?QNj4q-4j)I#NUFqmap2`*F3hLeYM)1ItiGRz?xo+wX@qxDd3y)d
z3BQZ7bO&8ju_c(p--bXpiy1#gS0CCQUA<%3TQAV=k}oZL>vjG{uhXd&jWp0_Rf-MK
z`&3gagjd$z(R5IBIlBdal}KxqxMnF8Y?bJ0w+^OIAvUJ*tA8OfPRXUTm$;tl1(o6t
zSS3~=Rm;j-!5(5r+*b@TV)nAR#W`#b{S73=f|ayN(r~>uGd-LiRaW~UAU&k%;OO!X
z@$J^Kr+|`aFVhGr7RzXjH(62KDn0I2U&uDloe5Gzr!f`&WFL1%<TFEbvE(DmUf8ZJ
z6wA!z$8r93j3LMNnx)`J*hv<r%9g1>bVW6zqZM?&UhmVX#34Y@!Pqd>M3*NK2)T3B
z4-daV7Oy7VVXuWLDOF)~CB1@ce>`4r2x{U9zQAQS0)yq%MWA$YXWYzz8nnevqb)w|
z4P(<&ST5S_?{F_N%XWHdsQ?~@v|?HA7tz(T_A?)2cE7oOO7KE%%&iykE?X-;2DpX&
zkK%a)qBXHU5KB)YmL|B##>lmwkMP2`4i6^_JHbZa8@jY0E&Ob}x5C+KiD$M103GhL
zhzilw?fU^Bca5*M%ytj{l!Fq&VwA93NVV1^uZ#?~N;DSnI2DioT=s$8gEB8fd+z1`
zG3(P_?~%Io1KHxC4aNWYO*}GBG9od^&rp2arin$#D@$=7{3tgtXlCIBV@h|mQmU(Q
ztp1d2mBc*8d%SLo%^#cpI4Cp>wlvc>?<kZvPK#Zg`QmvSX+F2Lu)~dr?OfJ@8oxgA
z0xH^GC$q3-42JViuE=e1$rK^oMR5)Ap#?)0KDS^r^7sSCK5V#OyR>O6H4ZWO3f2cm
zq8mh`>%&tYG4XdEw@*rWR<-&yxPh>nlF^}uJe*g?UC2h(Nv>d<<K&kXM8!U=OwPxV
zxza=JoK=}Tr=sz3p1sD;>+g0|zn05Hwf5}wm$V}N9bYlhQH;)%m(h!Qg;6?PQT5~A
zqda=O=c-ygo1}NZ90;81;-UFfp1sb!S4O46C$G=&pS(t>yCvf6koT(pn55Q)!4A82
zu=70HEa8@}T~O_4mb2XKHr<zE6T)G(yXfkaD{66Atk<tQYW4c{?0T=G0p|$fu#Bml
z#JEKRQ!1Ku9cWA&^W^_)2CagFIHJ_bhx91Z<x6_I88I@<7HSVO_}Rxp1&+&ak=r=}
zNy=XK3&ZRzB`^JWraW4TDu~;c&ZJM1%V@($GaiO9Fjdtz?tRD`JwL5&Q`o&XTEZ19
zjFyDX;aNZSudLxB>Ebsr2G5N(<1&lz0jzV=hf!Nxq3m<W_O|zbkR*;g<-W+gORQJ*
zk`&u@JOJoI2gfeB4plx%6$H+K;d^{H(R6u1>m!URceCrb>xlHHSz&3>VS<*PQud$H
zgX700Z&C71KL7L5EJ$iHd^Cd(E&_Oe11oLG<{G>=i)|#t&4VQ~rB@-LxE|DXaIP|l
zddFsY7-*Yd-eyqNhOJ?0;@;^Sz3s=zaLmAB(eB3}5mEHK$GLHc{Nv^&aXv!#Taemt
zv^%4DPPE!T?kvu~_=n3k&DG*r_8Dr7TX>z0#q61Fg@Wl?amBY8wl?iO<LE}m{I5W#
zls&NpW{p1So6$Ugz$o!3_XvjCn=7N;hf*PZm$DY4y<oo#irh(&brk@!MjA{1uqzU=
zIR#==)|y&Dxh%+$nK0QdG>x-vd^G9&6}JXO;Kg4>xA6<~EeCbHipze_hSxDP7fp}7
zG#rt>(g!$moVvJ$?DR5{)=_MPF;WE>N(yPbm)jxP%PHt(`UN^%=HhJAT;B@nirI+q
zEVZ8TN?f^HnDEDX)fIZvkE-7SO#F%*kX0H#A+1Oh0fMe0Ih|1ghLIrg3bk^dT6w0R
z=mn(a9#wqT>EbEaqElSO`527iJw#_sTr4*h;o1;w)kb?JqLi6t*}xiB<Gso|B<E;R
z9Nv%V@7hhqC0si7C?>+ohO>K<njlE8l!=Z??g;@%-=XgT5d=4x>W11BL;NDGGY`MP
z)S@eDcb}jdtl{Ye0n|;J{E^HZu27A-=(c8K#t&<ow~deVOKt7_1MM>^J-#P|IwsQL
zFaFgRQoWGg?>IM17VJvRkq2vi-+DDCMP3x3i7J{%FG6`X6q9fS3Co^yBh~-uhg3t1
zP3E508B|AX?P*GjTN+tq=6%LTY1#~=;x1ZLtw?52Rd5-=f?)B-!AS!Xd)$(GQ%BbP
z-8Emb_FsJD&$Ah^b?8ys?<jMXT9RHXZpR<%ccRA1gP@Szvzg6Ln+0z`7L{X&rQ8Yy
z)c{1disTkaA4Qx5KEfGYD>R=YXlYmEsfM%wISta^_>+Aaj!17S9KUW5y+uKj?*^?i
zT&ZOn3Hx}pE@b_M!fA~vNVtcDp^oOt_=R2u0PCR)StU+HN79KyC@KLB+(8vj9meQT
zWcJyq=SD`_^Ai5dJ^#{}-`XGT{uLknzfoV38+6{OiaDuh8u$wu7^hn_A4#lNuTskD
z9d61}tj`e7X_zJH8w7_iRH8P1tu{ag^77>!TkL{T_i6ODBcltZMBVLq8B#~TBf;7`
zpL_YteuLm4cMGyUT?)o?@00vO!HzG{$kT5)Py<{EuFOqT$TrX&q9^@c6$sWB#<NtJ
zkFeiouBE#*jhJKsmcFda>&VnR8scyICD(qw#AKED2RRz{nvi(F2{(aCGm*^ED$%D7
zE{N4Am6DPbk@R6qOvA@sE=gt2a*Z_fU8u2YCix9Ksa$OrsMz2qrhh3ogv<5HJp)3n
z{k4+Z+{x$yS9S_5M!)l0@^)@tdx2W@bFWoyFX@uS;9`wI;?In4DHHvm;QVMbzI83~
zFXlZ=r7Bj~Jv3O!db=ZY1<Ns~8`18sh=tZiyLH$i_v!9ZrV;+;ENdOR0JuEWF>HfB
z-XDMzjJ+IWxMl59sx!=T2UrQ2R`?R^<Tl!EI`WtjStr4==5wwI=OIQje<l<7Y<as~
zO%5`dXNrN_RnlMht|KSe9&@oZ<xggPl)YWTq)iwJ$8)KY{WT-<^$lzIH~dB)AefjC
z>E7Ox%od!q$u&eIVdfaBGWdRDJ1saq6bF$`M1&s2ze}&$F+S1<>!~i!?@EN1Ij~C7
zlGTQT!~M214{<p%SE0%ek=J{$(ls@}z#qxde9(Eb6mf{9bCblqH5-A@vA5*212NN0
z@$9);mY)r$rfBw-r8-{ckEEK#M{-a^(kBO<pP?#OFyh`*3;La;)L)BdEDRmZ_4+L3
z{D}aqTt(hTU%-dU*T>gQP<@|TZ@o-ry91;@U(-j`lgd2YWsc=mnjIiB_s0Y5tzVcu
z`o3p#GsvkT^j7>6vNfX&7FiI{zE2AC9qjzbH#?bO1&Q!YnjGrj^@5&1QW%qK$Y`4E
zF#U1sC9sbR=o}>*G*{u;zM@*+9hFNLomvFX!*gkwh<g8`_Cc$?YiYDxt8|idh+1N@
z#usb5U!q|YcPt?*m(dyo;}~Zs_sMyyQtc6$PD-6-7)f8rYDm?x#HLb78}8Z!u-`=^
z#LcUUPt|(R#hn(bS&?cNb<14?w4+}o>Bj|Kz8&JA<lFhW-%eLL{gNAkiQX9`BgU$H
zF;+z@k@V|+fy^h!O;>7oCb`0y7zyy6?WB4&?!J2{YrzrL8ebDdivD#B6(~8GUF>+^
zK6W9|l`E)XXaF)WQGXyFJ|O{`hrbXHchJiJ9S<F2+9|}tfBEfnrQbH}`+{MAmNLO8
z(+iFsA6Zl3vhr7;D>Np@D4vcE9WJKBC50m&;wrX0M1IVujeEduSup>dQ>;-<Mh!!J
zO5OOV?xk`bh`h|0<-<s+%nvA$J&E3j?uE7G&TcWi)}9HkX<C6uqw%*?ZU@<8D1Vkx
zk9LyIEnI;dq3I@No}#(^r{e*R{b>z+S>Zieuv*+l`<2ONQ(J#R86rwDujrFKv&X({
z(YL_SoQNC;rf3nE;^tD%2Fj*ob!Et<0X9kk{6x~n2ScohW&ZR6Q0pyG%7#4>exU?@
zJA7TKCD70D$ayC*Y5G^6wK3DRaULZ(8QR{Q7>-<hMdLpgZ}y%<S17c9!I!N@ky$X3
zCZ*p=jH-?Qyy~gk4K{*xK3&S~olzS?ze$ODHwL%2(R>hYB^DUMQ(16}O=iTJ&^8`C
zFe%*jup|%(OAE&KJ5@QFD!t;yKI6t<hSB0mvh(QuGR4d_t8hHC>bA_Ndm{0o+yc&*
z(ZVharOik&t9-D%5{woNN+st?k=T(xTE6(>?Bnfa$MDOBz)<{$NU@$k=cP#UK5L0%
z3A8g?5J~?nM_{9`)*#tGLhQpnYlc!f!?1NaocSm3T%?!oo|s?7UWWT@$7M_4om9iB
zJzezRZ>Q0M=7#?vEza8*=iFnaw;hM05zOu0hU1Esy4!p`-$p%M_6%^d;k}q|7OLPr
z3+?qA8##Rh`DE>8W;}5KEdK>8fggy0a}3}Z<uIYO#hQ#6gS~A-z|K{{mHb%1td#+S
zR|LFYo~{>4=f>)dXTYs42(iWN^ZC0h9diXr9jJw?8sq=r^8ivw2@^iR(wr`RZdC1P
zN*7HWFO)Vo363@!Kvx@pP??^t9<W0jy35lu-On-yEaskmgOT;N_q#5u)Lq)ZpiDL6
z>i{^z&Nu<3DbT0?DAH87-Z6my@in6Q04aGuYOMdN0KjrLa!E^B4``+|-7Mj%HO{az
zGu9mR5J}6$2|UJJD0$hXF@{stAi7xGMS-GT=?A1%ru7ljt_bK-9&}#jjNcl(W&(7n
z>ec%!28G}G=-_MjhVvTH1a;N?RyfiJkLYZ+!Er~W>zMtG`>3_i)&y9n3J4TS*M^K_
z#K^VY{GTNO&YJ?(h@@|IW3CK%M;o?sD%qH?dX@>a#k%V|R;vLB1VJVJMu0$az(X@B
z=wS4b6Ehn1>1>`#mFZolOb`!M1P21;hCEWr(oGIIZk->~0S&*!mFa-oCFz?_w_!!n
z3i?E419H2Hw9yD$-xjNJ&{jGORRsa%V*$>}%&CTg1xtoMPjGsNP&R%HtNqPtf@71Q
zp9SjYsb7qb^nOjn-id2JA3)ouaulgFkb8gaDpUj`DL1;51u*%b6wU?XdS7?n{VzJ!
z3K8rCYOEa_ZdE{P=kih+FyClbjxTYd7&RN%+v74DaEH`PJ`B?>O<>$pZ^B6Lxo+_(
z51=j!`ts+lzzeWo97*kI)UI0}Op5Y=HOtcH7a2lIgOq~(%LnPLaHdTZ1YoSF*IyPZ
z?U%{PilBaZFyH*9HO;KJrr9-WQ6x6X3eG~@S|YIi>>1XP()#g{^ugLiYRU0gs)wBX
zsQo!4fHd5o-$?p{{@#=ICo@AegoIvyZn~lO`6DO`JpW3qwNYbLx=xKCb0EPOaZ^l#
zZs+>|J=Z-^x24bay0Re@OuQ#}y~H5xUq97mSVMYF0p{HL(RaRsy<icMAY(KY!RFSd
zlok<_lq@1{F&eXuBn51+d|)%`f35%podTuOwQCdeb0j!M_fcqw&x>A`VFs@I&EW4a
zRj#6PK=ZQnTm0%%l2H;XzeB%|-$;7Aj7FND1p@2Ar+jqSS`n~eS^6lI6~G2UFan?2
zKTsv<EXH9~#x%X~zWU3{je?mqhQgGIq(A0BaaaD-Dicei`ixr6GmbxmNP3})`<)+2
z5l82fQ4#CbI|z}B5M01I8=dTP2SEMwKWSSf`WD=6Qws?Y=ns{~1dfs-GSX5VmOE<e
z4CpooLRm1KoLCnU3c2el^&wf`x5t%dW$Bm@=`}1$y7}x~!Swcf5ckoQZ=jW?EN%_N
zdh>073Swe3{J*nCT7iQDB)#z@D(g2f3pj~cD0mdeTrF;+NS~TdUoZ1P!DLR86G+;U
z^!hc1tVsGJvdH;FxIsnoIcF5)TuF|&)X5h5`MQc~$qFXAztWk0Bb4~M$*6k9IEhs2
za3<703;!5~jE{t&06Y0rm41rVPvw4An;HU0Q>4<Vc_OFZMY*j;)|8)8`ZoLsHFxi%
zDU}FT{j&6~Lrqw`(;8T(rL|y6T~6&(yOxJY$_2eqn;Rc-N^`WwtnIVV!-;Osb+fRy
zOm{eS0J}`LNfjD?SqUG3avjWvKsO1dhp|H>y`(^*>_;=teuzsaiPM@Zv#YS4^HJ(+
z;@wO6oqN_8*!B@lx9Ih4$-xrqv+C$B8EWPgt((-r-FszRAKjm7H>%T9naFhE3Zn_8
zGK;gL17G5kEL|@quaNQ<&V1lJI7HWcW!$`n3|^gzpO9*wLjy84JG};!-T9q&-dN(;
za~ju1c|ye7tf*03(5NE3nC2oGxEV=qB-`gCXU$Cv=>3rP^A)h!y{kk`o?5IWl|w;N
zXIY459s=9SbD`0dKcQ->r5T?t(958-u>~dtL(*zf&j15EVD_oa`$v{en^0^4T>$?g
zIMeNFGH=8I{Rl3)aPM@sf3G-kwZh|{Fhb5m7asp;zK5nLJicsl)YmJbiZ7+J&X~IN
zO^(@~$M*Z@89w!Gy}0_1To{`b$xfs8yV9fHr-#m3DnyU-poh>N(8D_?Pmiuj#uFNx
zA|7~0(<kpMPKX~RT3s}jRx?+@TYs6iDxgjBTo9ipPs9I#JcWd)UDA?jsjc1#8Jq^5
zE98s$gA5xw+B<APaO~3}`QX^Z;%f#YE}EJzux8>;3aWCq9bn&-eWieZg)4_A|5=SW
zdRC)8K-IZi7nYaIAd@#$V@|ICR_0|wTRE~>y5y5Q?OA@=#AJIDrzr8E_D_c6bwoHa
z&jk4>OiYHWs8G&*{S#@oywBDdNi?5tezzJhMJK^D%4)hoQx*WRgAhxNgG<)oR8zMF
z?>{~AF$vGMuHWVEU6pKa@Y>%gI4JX}lg7>WtKdA+_jVyNQY1-Kz&RC5Kb?(#dT8?G
zP}lebt|=VcGcz*dfx3i)y4F2hzzxsyTKD6%3s5DSTE?&PT0&M-&00<3r0nsEqj$IN
zpNAKc<&DaVx5rPL;9<0wajxWJ*WrUMhB4QUQ3*hUMMMzwiKGTC=~M17nKIdq^_U1w
zc?59hipLBY8=3rK-LbU`?J+K%j2ezX=TbzD#nwtrNS&*@aG3|049$LbzCG~vi|J}s
zY4WtP1Kzq=ax&9NGdW(JoM6F;kD<Lv0GIIB{0%~6W$)vmKC_1@vmj&R=y^~>o(}{0
zDf%lwA@U*1pv+%vFCW2jmOlaM02vBq5wGr5h(R$9gVQU!Re2ev7y>XAhRtl|X3d4l
z<Pu5Ra$MQ*Yf*rE0tK2rgP@#v;4_wbDv==emC=<y0D=_9vAO)@l*sl^AO5n@O-=k*
zl1uEF#87oE^p>L6kC~u(|4#7nc4i+pCcq@(2t}`GCl|sV;XPqd>G-+%*pdage+<+%
z6ORAI%S#N=ZZVA7p925fxS^*Zxnx)B++AGp=XmROI=Sp?f!!mLE*Wx$F<7ovoeq3K
z7jfK6ZR2=^@r7}N?N3n$Q(cDTx@gg{I{Rt+#MVN7JJsh%9$ZQ68R^=UxVOUF<@}*K
z$|iMG;Ty+JGkqNO#dYcV8Q&UL#(XX4uzgqVT3)%C)DhvD0K!ej_1ss})1CkEwhs{L
z7jeS5O7-T(jh9}k3zd=?wLEi$*F)n&mmU+W57|;Z$P`jIG5;MxdkpZB=L83>mg_Q~
z^hJ!(>+XcFhC`Q4)>S(?WDvw;&c_d*waYv0b+3Im`^tU*nq8I(e?WI0r3x{1kZPGH
zIWe_YbqHs|n|wOnBbIsm3iajX<Rp-(oHi&I25!aSBUb{p^aB9Ozzjl<0bg=(?gY5A
z@$|@L$MRs{rqXEwy`4yC5pS0I?|Pc{%DmZ;>`&={*gLztU3J@90?e;3ZG5!rRqVW>
zCv$%{yv>dz7veZs0RpREtKQzY_3G%r9&LFo8bdWe3&4IFBiOQFd>0V21a}P<Uf;gy
z))UQrJ%6j{2DMDZN{p^JK*ZnAWR73dYf<oh9AEfj{KwAqBaz0BwArqxXnhv=RUko#
zb``pm^UTp!W~CLM6slW+<0!yXk{%`<%#JBd-e9*i;}lO1qbb3~UkppmM!OdRI`K6z
zLA%-Yq3mU(tjd>f#VyS$eAFt$R}~iiV(EdM<?FQv^<Eq2I{J9fksrwO+|q2_DB6Pa
z4f)^c{9B^yF|EROSjAlpq<gZxHuNZK!<S7OGE)b^Pjuw~oMK)j8GeE{8!w^jNgkc=
zJuk)I+h0ims9<8@3H0!H5<33;NaxQeosV11EQ&i-Rfa!w4m+3Z`72GDVZ(Mcfz`r4
zLy>VPa57=tov$uiBXuKd#M|<V>G`bTn)Nby7>ATSTLj=996+3#M@jk%I)f<Kk{w4A
z*;-+8+^CDk=V@-##p5`BMZa@2|EJBx!&iKAThZ<cn?4flxUlK_DUkgeyl(ij{m>fU
zgzQX4>w+_tVDnnAHMnS0^k1WPOph(>?UVxsGFPSa{;H2}SkZ3ma2nG)nX-W^rDg}H
zJ5j|ODDDlf`xe>eD5YhqG<lfhrN8b7+vs4FEurihoz<+fvzh|<o_Uz;CbHA!6%w4e
z(aC1zY$qrB9fb+rxjk(j9zFu^P;MXTh9AeTmEK0pZoD@%-xkzzY~8aB8bU!N-AKGK
zpyQa~SK$9iV?9G%jgku}foC2#jaCH}$1ngDV^%Rf=<G%QPAW>`fh{CkYap<H&faS0
zf%9jWdcee435*oz{gJk;Gy;}Q*~#4Z(A!(G@%CC<lvCVO#76~fF(q}!K<5(4R+|r9
zQv-WJ!3No9qJncp#xa+U?1A&TZCP}pk)+{nKAfE;xb?^?+w89O4Mxs%Xs0ZrGt9UV
zy-;g}7{Np!Ef>>r?w59IEY3*#C&w1O@43Iwey8SKg7>KXcc@L;T!5^Z@BIz$R@!U8
zb#sh|>q%z<A&;OACf=IRRlmEvxd`J)*9p$aGprRm>^pgeDJhq^u0wMl#uqk!-i0O_
zx0m1MLh=jH$mZ(>XfEO{*uS$VK9wbI0T6W3(sW)!K0A7MTkPz4?<p#oN6MTX7scj0
zG1uNhKAVy=qjwV{wG=&&af@zE3vcEMX)}6?FPFNy(+pAvAk%}7&fKr*t(lt<7n5Th
zN4w|o={8nvv9@5JBw!jENr-lDhqTSnp3kY+uf;3=T=?mO-~*=`w_8cy=VxWUt@I--
zj1xuk-g4iOs8Lnt8<aUu#ps}C{i0)8VcTd&7e1NPT5CkK8~qxYdWr&U)A;D}lM!ju
zYGSB!G*r&pw1CMv??%@1131SY*|p*+#-S2R`8G84GY%o84bo4gU<2M&F_L<JrUCe(
zX2SzEw!XDWE7+3VLAsYooK_zKP6qkEjPGiSn(vK+t9z~wVsX3#y`veYnVuK-6=I%|
z2|-h{%iIW>i{iD>Yd2FyEfm8>(d+v7m3vUX-)q0`@N=U!KbPDUD7|d~L8oRvE+oLt
zRGQ9EZ$^Ed9PQqv6Lm43p(EP!C4nM)q<N75M(MiWg8sl<@7#)gz5dqw8Ch-6bLyN>
z^t%7hoVR`5aa0-WB<aiK%*E6Zu@aesIPZ@xzljRaZ~-*bXhLeGTdR?N5jEf@K7Hca
z`p9>u_qcQSEJ<vT)K?Tb0Oh$?X+CAaMyNEsO2GI``sNll`s_Z?KqtM=Kn5N2n=^Rc
zl(mgw21m5}(ST0O3<1IH(yA=CzVuVm%<xx|&QS>daVi(9#(xLheBY-XQ*1e(US{2^
zun>^;?<LGs%ECsMraG&*=FAYBh090lX=<arrgxmc7aywq`q)&4Qj)0)I`{;w3Z~SQ
zkmT+!Xx#zca|Ahb)F(eLe+v1moB7XX!@efMio-;s3t|mgQZ+fy<LM!iKElUZW)p=C
znR-i1Go>p1)aNHe`o81}sM7Q`Vim=@8R_4pLh^TBY~r^vu!&<{(#CW2yhX|<sQN0+
z1F?AV60nH<0&Y4_>^BX_0=i9h5O?<fRJ}TNZ7gSHKBOWrcJ{-nd~QMIFgdw_^p^^f
zUL7Rq_kFEOa`QR!q>^q-cNCO*KuIguLIsY#4mDpXC~_M`vj3$qKfdM)(oIiOG3V=c
zkyBN!QK=?MiByto-S4Y8grMX?^cj9@nR8U=2nvCY1(E2t&%suk-L4xR(_>S66#saI
z@4PydW;$smq}b5bNS<2dYUE@nK_d;kZ~jB-n-6AiTHQwZsoBG5JD^Mn3j}XTO{2k}
zxmyF6wrrxge^FR~uj^K_W6xyxhV%UqWPYha=Zd|z_tpsqy1ioaFkoq4j9#gN;{nd~
zL&RQxxhT*K#6&ivi2(ynp_Vw4mEl9isq1XCzyVMVK&{E2Ihs;7qTtx3#98TU6=NGb
z+fh*ZD8EryXjDmn3!lEv`k2m)Sa~`8!-CwY9s4<@buXcQ<{F&tnRg8|mpH-?7)SfE
z<tEygLTqnLO<Xsh&U0KeWb2+2Ns;u4LGSeVElTUCs_Ryo?lspqP9t>Bhlx?(K&Vc{
zO$CPbdaCAb5P^%MD-YHR2s<FetPDg9whE=`+ts1J+sN#@mvL!=g!Y(wA#oJWcLJ<5
zJ<QZIrWzGus+ZZ~*KsqnXB*s<P8E#ecJi|u9giZA*XX34{@2aX;>F6|{{V$0pOFXy
zPZJSJB37GDMXq;K#7*YRc>#1^R%;AsO^LWo@VH5oA68j<>+R!B&lh4c#|IVdGSs_a
zLeVYqnE1~|9}~L~X=BE-gPiOlO^&k*M!8X`!(h$dnB?PCdXLTWHqG!Jz;XzO$`a)5
z%KZ5aZEn5$qANO}4Hxr!=JVI_ru5#vVdn}kDhgqT^Xa1JiA5hYVH0RP!K{YIGoPbC
zeof0y96ug)x(L%I*a&CJDVEqbfptrZ_hCx*WzhZ&C^c;)*!}E6e)=~#0`n=V1YJbZ
zr}#~(^9_`M1!~z@|4@bU&VS_n%Fl~Luha9@oF3)xXK!z1q6f@>C-y^usP-<Q4maUy
zyZ(XfvBSJR6FHp9nj~@}*_TF{Hud0NM{kXG%gC5Mv;evo`PpNT8}a|iJw}KMUnZJ^
zv)^GzMeOR+aNl~+@0Woi44!8O$PPLATx;7XbJ_%4=Na1H>AEv-;#ByEpt{eyzfkp)
zsh&Ql0IZZ!zk^r|?Azuq?L9QZdz70_$<7*gi!fQFr`)=Wby;v3VA|G!H|BH{ABLkc
z_f28=+CD_Hr?R~7+#a+i-{WZa@i14awYXOz3Aj?7wNxxibv9^r2>EUwlsDWBtw-=!
zO+|9ziII1#q?O5pT(FC3ie>J}*KDCC!v6o-WrB*S8RN_$Tykm{9!Oo<kU<F=Nk5@W
zigC_EFRV58praZ2j*c=AD@BM@YZZS=9aK7DqE1lZ!&G1bHhX54kEE;pi;tOu$Vl8f
z-HfWMz><x%0hCmvIu&1`JjDS4L*%w)YN`-d(r2Pr`$teff|<}Ztn+c!^C0vLaCSgD
zt^qZrs_A??zWfEY%oX`|)@r$w0-NH+HVOU~U2iI9i=R4Gc(B_%tZRkfNM0H^AE%k@
zZwwOQq$1TCv&yaYsTsmmiR)a3&p29`3>}&W0PyBoYHm}_`0+)%J8aLovnbl5TSDwH
zPt_jt)L@S}l|ANE_Lyz_Jr(q}eMTGpX!i;x;AcYm?6I{{h=1HBjK*_zbLtX}pefbT
z#vd-ePvuW-a8iv^Vd~UM#7}+y0}}A)lb|56K_2R{wdT^$hP6+wC>OC(a8AOvGnvWv
zK{JkV)M*^YG7eEaSo)0krRk+rzE<Ar+7D;Osq`BR@c{W<_tI?d;aM}hjmuuVmN5<8
z7Xrie$v?$z=2!eMER5b?mOX11Po5>LPlNynuW?`wPjXk2|Lv5$Dd`?cw1d34iOhRs
z#QXLtvU?uuIzp!H-%2UJiUZyo^qODy4XUY|-qV%&8#2@R3oRm5MJ#jX8XFlWh0$&c
zHp}anqn8gc&Pd}q(G{AjLJCQixW}Fxd{5t<&)~SR^f5f-<)>io&})yyY!aQKH%c%k
z$3U$VbaO^`_sL4s?GyLdx>&Efes@w8ZDDSoT?rQBnN28?Sxq5#ijhQZ*A?@%7fH0o
ztw`nvWEVd4)>`SkN^o*W#rh8^n{=I*KXwfi>gj2Lp4UK$tvozx^-DTl^I5<J*79`c
z6D;-2eh0J~C>0>$aqT(yh-6}PX(tIZH`nDx+y!T?h!d212Eut2ZH%<mCa2Yy$PH~i
zasP<f!scer1U$~CF^}bqJkC6JN;8Wlz-b4@YbdxS#6KXra?d1cI3kYPbLieERt!4O
zV49rDt(&ZRlMDsgr_e#s?ke;x|JT9M?i-!<rHy5G6}|0vnWox!9;=ekAhLob^mlU4
z(U?x|cbv}~T1=MUTHnLKIcoFO4k-GaIs89r^M%H{bxiHB42)A#ZKn<;hTjuiK9PRe
zfnV>eC^n848KcIe#RuNaevTPrmz$h>yoEdiz|1ezq#JwBnUo3ECtdZk3t54rrtBih
zX4@$Q+EC`}!};rZKx1d=V(l|kO1B@Q-#G!w6<S?sqh7fUq&My+PLd|Mzvj>6@y-BS
zx?439=mOmJ2e=#R1zKXX^mZymI}?9C?Ia`nv>5e*SX(%KqAxut+ZGh*qsUNeb7{1@
z5t5DGcLu1Rxn>mvb1nz(ygF9XEbdGzh@gljOkJTu(_{4nxMoimOjyx@=OOAgr^20f
zGxjx>^5{zAkztG<Au-GFxK+{aNn#ZC+nO`7l%~x{<v0F8HO}0&=@ChrtxC)?p7g}D
z`cU>Od;PIdgjU3sk@VI8FHfe8ilPBXBv0!SF3r9koLNgg5!>pyKn?0AaflV|UceVE
zHBcwO^9OyjWmZx?dpZRiI{)hTQ;5zBDUwTyia%jsuH1t`x#<q=2>nc}nmXSnIPXpS
zMYmHl_o%DZ_Pwy=gs5)R66nLh(8j5LWdKU=Q%Z;Mg`hljH$`L=vgZ2KT>9TC$LbBm
zgey^yYP@BpvX2C13z7McpvUj32#3t5>;>e%QmH>A)ydEF*?~$7Yn(@3?|3CRmdu={
z!jHdc2sWdpc8`G4oIHiVmC+TwE=!{|t;VE;6qth@5T?9jBDA7q=I1Ok;HFt)08KVg
zjJ_2C$WN{Y+6#T^Q7rQp60$Ea38`lscb4n`w4nuO8N38A*d?Of8{tF&wlh=^l3@`g
z7tzC<sh?3q_2}}ufZz!kuKjDrihmsa&U;;(ZGF=nvV~;Feu1SpGX*$?s2J+1NYC-1
z6?`X>{>b9k9LtOU8*0vZWDoS}Bt|Jvr@vTGHbhxAFrA^Uk7nlrh&#_JZ0(<aw$?hW
zRJ8k36r$nIP<%)F{DOwk6w7V$*FQwMJ23K@L!#>k6v*DV$6;Mz-%t`R0`GC-p{dzn
z$kuDo4}3b$Q-uu<4f)mU2%l>*Q<Zy=kUcXtxA!O|7l^EnDmO=62?R6KuwthV8)Z4;
z*RV?6ryjJPAFbSi_58U%k^5_xD-v=`oQH?MeFbpt+|KK-Gc>Q_oZ()yGvtM1tV-dL
zGZ#bMw%&O{j04BfEHJ*38>dz&e;4pqv+^STMlzSHv+vWHsZP!2N2j?pHLCz5jIlY8
z<t6E31GIxy(fc#1dp4ByUX?1bIgmK39TYQZM%<G*T;-000z6&*CK{>i4tP>(3qd?2
z6wAbb=0>^9653FFRQ08#OTYBnc;t_?@iJ)V+2wBnS>F~{$U69wG9RIXG3@wLrS>cJ
z%K_j3vqGu2lFE8#`@ghwXxjqTs59;JrgK`zK5yrzz`*>7X6qqts#g&pZJ5ZmNQ{xp
zxz8GzS15V_o_5&8`EYmS+68wc{mo$W*+l#m`W+J&V&pEWbM5hA2?Dz$x#(!fQq^ll
z1`)BzsT!qfE3=j2M2hIUQf<0zhoz^LPBj>A#e-_fzl_`SEucvcP+Ho!uqew7fGi)a
zuyQ#Hitd=c%Y9qhZ=&$y#zF1Ed!{Wk^8dYO$_`OIm!$6#%xrvIJB9a5_xz7*$G>M<
zx86>(gCoVV{_WJ%=$NtY#;mp*phE*$OI<7J;(Dxhos1ghC~_l3MmlPP3!;dUD$Lpo
z!Azem)DDlCIK{v%jjHX@g?cXOiPP&tz75C`^(*Q}_@w<w6v!?aT|Za}-94RBJD924
z=5QZLKNnPzu}#}R8Qy7N&z%AFmRw!;k{N>RhH&m=?FZ9CRGUIsw{7%Efbu3p`XHof
z!6@-L*$}!O1m{!8E9W2gFm#|FH!oG6h$3Vm0WSBecMY)4R)ulPKT375`xx3Cf_(E=
zW;%tl9>ZO$L;GGkv;`VU8#Yc<_TQPKF0O)dE^;}CDdz~S0r>+;2EXqQW6+*IpnR5e
z3-}zIZbi~|XV@R{Cb9{<eG<&_VZkbqA;jB={f~UlKT=zNr)Mbfw)?w_$;_ok_X~b}
zspMQ+9%_kngL*~On~PAW{wCv4XAM!N3hhHJ2#2<<P_)Xs-)%&D9tDn=V)XI`;q~hq
z?~8VS0)C^-w*`e-<!wG_yKd+&B(m4n6g6c>eq+W#c4!AqQ>K2-p@Ha1b2DeF(|tKV
zaiQV-q5BKW_)+*JsT3dyu^r3rx5U*5?96q)2NPY)2SSJa$9pJu9s4Wb1~0nR>&IU5
z1=l(`<rf&5W>7cTQLq_vF#+y5ndD}<IYqnM9Z=EkAwJTTe;d7GiKm+&kSnR1oPiO~
zDEGYc|2GDD@ppiT&<)H2uwZPhxj)2>kElTW8x@l4hnCobDGd01DO%w+vI@|ZHTE-=
zdx3IlC79Z_cZQEL%akkE76r$Tc0Vuv(O!iX0zD`F-vywZq4IjlK{yLa;yvYL!mTPP
z6O~pipG}XZ22-*$e&y)41g4LWY*Wh@Ho<Nr^U81O;nVamdeBYr9i&R^=MTDFHG6+1
zy@hT~K1rHry7^uIl1l2jt7kN<6K$nP&Lsli^TWKUV3=PQ5PxR6Btzb7EY)HH|1_7z
z<z8LoP+5}xqhBraN!3}V$(`T)&{-v^?<7+rr1x$=5O80D<bFd_pQI_L&$)OOibB;{
zGuT`Ujf!LfV!uYrXQDk5640BiXwdbIvumQ)T`1P?h$T^a!aNoX!v<vk0n<dt$$W<n
zNGDV=dbRI&12506@mTL)`WWJVQG|nT#jJFpFk1QIfrXs|nF+_CHLH~dxo{qeL&|`+
z-MwwklP^qM0*MX0bVOqKxajilQIfs;gW9_X>+y+P+_A&hUM<QJ!-3p<;|_2~nn|!!
z_;-OFCH+$;-i)2MQb-aWH3K6OglKSK3~p5!S*hF<aV$)fZZU&@9WQe|b+w)(XICXp
zubrn?26&Z;VEePHqAS<Ha;b2N?u$aF*MvG^xniE_Z7HVMKCXUv9aTh7=J=$ew(I!-
z)hlnHQeehS68I+G?AtDhI!TsrH`q}N?uw$_>OgAXNnhjri}hXA=~+HCpibt^+oAZ4
zlt^||%^Sqxo>*T@m)Vby6yPM1wpa~5a}QD@*Y8jf<vNW};o>nd`9?htQd3KHhOfoJ
z)EH+#HdOY|0wZbgvS#?s9IoByQwBpNy6GAP6+^5g!y$kDqLoPIbk&M;>WTZ<GVW0I
zE~HpM!jm<OoAOQgwf!j`1S!jus0qN8<oXg#q%Tzy{<vPbjV8`k6Fz8}->o5KYC(!l
zYN~dSXg(t<Hk_INcYe$8>M$|{J2;H2vBLnH!Ubrdw}3f<#rZOItjJucDL4=pMXyZ&
zn(fD;-S?9$cuX^~b0O4(hVYtYhXFX|u;9R3(XSdnhOXa~!SWm$o#M9-M>_qXV3iKM
z%`$s_P2XSfI|=B~g?^vyRN{G>!J!?gWg$4jIl@W8BP}xPRr3T25j{PVniERAg<<B0
zqFhJJPMrHHpB%5E?gpjI*3yXbbL%1Px}5XBF~tJfLyu};XKs_9nbz|mv6oT9nM$R0
zA{3q5A14G_Ey{I-3YTdsqYmtpK^mUK%~1mK4BC5##q(+mX|{NVquq1q$ZiaLlL2td
z-Dd&0G^_o^Y}>CW>~qd~NF1CBmZcX=pJ4sxWo^M2Q~tg)^F69(_iIZjGQF_o7BaGm
zaNbA9ww(x=PAt}yq4ZWt_tKNGI8PmbhBUV%iy)F1cGx4L#&i|bPSsuOL^sdf9b5$t
z=YAX9z76Mo9>k#w=f007Bp-pyb${JILL<_UH)XEjM~aOtyTHDubc<3tuM`mJ4E{8l
z<xiH(eYc`wHUrDrHvV(0`H*DF=q4dATYp5^Y*-^VI=TrTlT!E!d%(PKK8hpA^e!n!
z@R#kHY?KJ7IW!=w)ormj2W#(_yq!xF1=BRS)(n5U6Q*EZIkAPp6I@6v31m8>Q~SQC
z&g}aoGLChqNarF&_S}PY|FY|1^qj?)5PzY3wn1RCUTqF-6^N-jH8r$pWdW<HwgqgQ
z9$Q(+f@0LRT_mTEoQ9=%ymKaD!aKElFxi+`AG0q1tn)d|6^D0IVlwB@A5x{1y8xKM
z#%M7uWc8cjLTZP926Up}lYfi)l~(l!#%1yX5*jQ*?!SYh!2Q4QHxm7uWMwO8=-=dI
zPp2WgZ&^TN$yzpXsqpHamr~)SskWkrfVnB!b2cPUv%OzIV6B}44y_TVONcCUG)~*P
zX1+_4umF!gF8Kg;ngXV}imDU}XBJSv?iKe+xRc~AqOPq_vpV?jcNS#<E0?D4TnnQz
z=L>qxRMSk~ZEC@vx#jAZ;}v38%UPx=-1m~7TL4DpwOi=@Rb@yo@aesiL{$2oDagZM
zEi7@ub($oRX{#87!Lq7ken<IiIfaea6@l|8w36%urJ(ctDI``I&jU+V+~=9$<9(iC
zqp|@y7@d5c(J3DXveMo;zphHnsihyuQ_fU<%TgpgP4v{sh_Cx*jt30KHg|!uF>G@P
zS*iArkj9Rqf3ahQJOjP>bAuEReaBwM)?e^JjCL0@)G=GgK5C?!J10aOo7v(ch0u=|
zSm4IATz#<*GE60?mVJ51DARyd%B0y(C9HQSQ9|-H58sgiaJXE_8%Rz=9>ZMrVHuTB
z=iILW%}BaTeICd6%xy1G{CjFeN$n#v<1)_MNrvLBj+UK{6(##sCC#o>xS@&_(bcU}
zSG2{Z5vLtM+m>EIShb$lSwMOvocdnXAY>KunXCV1*PM%SI^rmy0Cpy0{G|#>M3-%}
zmyfPPREZB6@49nb#N5SdiIZi$wQ@59imnC<tN~KtlHZb<y*V{Clx(|Uuf1;=W^3C5
zkUY-O-1vwohUSHN8DiM{ckI1T|6V!GzmMi~pGm*y2yP4R$j?CHf};!!+|Hdsk>5Q%
zO)hUMgn9I%E!w@GW|M6vWN!Oh*9!xgBjT$A-VcNc(;@SFs^orW#LE_}*Cq#yU$rK`
z%W~}mpC-|KTFE~72H1cLz?*_2i<?4v_SPvfmBH#;5bs42oaS95p443Yq@Q#8z+G-q
zOA>`8C^8c@ZWA3$_5Q6cJFFXx5+#h|xt{{T7M3hC$-aZulzyWCjcJu0ma-(S&#smJ
z5saQK!T+YNI4#BcyhN?+{15A@k;pgO%vI`Ha6{etwbyG=k~Zzj!O=(|jLHall1e`!
zVFTt&BXA*&q-0@FauUnAci`-yt!24|q$o?@t+s=?`TR{Zb0(lzPgY{Iue5<tV43Ju
z>2<FG;*gmEbBB&{jow2@&O9OGKi?Vd`uD&KN2J0x<aNNK4`8~BXe_sGjU5K~C^$>)
zp8_$)q_!$`uRqjx*nEf+{4JQ<efSdn5Y?N!+YYrF#+<a8zybxC%ugutLCFM7Eo4CS
zy5C?@(+m#HuFZz2JjOtfraVjJ+YAIZlP=ppb|T2Jo%!0}0Mf-bg3}hex;_B`I+FRC
zlJH67$|RNH9_XU&11#ly1<QKlPOB_O=u3R$Rjre#n*GtM2Dyf#71-1c3PJEn+Bd7D
zn?#ZHPn|H!-wVmSbYrk^{0*@)X5rXImTps7fZXNRfP}Q2$S|R3*4Xb46v-axci(%G
zYg{=7N2y!9tTTV{lE<lAvm%*G@?9^W>%N^*HGLU7n=IcOJsq5-YMOpdAWgwFz`^ua
z>ba$jkjTE?tzzW@>myQ%-fllze6+2-#9ixv-?h~LhE_C@``4=pr&r~tu(@Yu27gS0
z`(F2X$VCmMpiO@?W%1B2Rb(!xc$@MSxZq`$smNlAj4|3=NNRo~QD6w4q4am>3aLlt
z0xJ11Ly$XLSe`bAskbGs&|5ytIH=k8BT|pwe?aQ<O4Y+42D}+L(0SH=mAPtTlwxg4
z8S*2#x^tT2QQmiA$7#fV*WG6NW18<0@(KC~gm`J%f|E)3j+#+2UlJ4#z8t741T8M0
zX`3=<Xc|8oUTY{VsQD3P>K5F*Rm)!diI#<XV%JL&-4nZ6zkU+CR)78!Tctn0js1{6
zJVoJR4eIW0^DeJFzp_L|-yR2JxpLc~1oxO0A7%VAA>PrC=El`#;e|hy`r~s?=I&$m
zyX!+q*E8N!>KSkhDhI%_dj;vnWYN+^JfQwR$<DHVt!T@xsL`g+n^k%BEvEObv8S>T
z6nK>)A@wo@`;M7o!Fu*cpk$YaEp2?X`&AvCwO1x*@iwha*k+=@i!mZ-JYE@Y3iU>k
z&P&j5;C`K-=yEd-A#hQB3z>5fg)>R4Nvt2o&pB}7+`;yG$`*O2RjIc2ldmw*#>7W_
zNKDI8q@Bn@0padU*D9@r<}RRp^XGg6G}<+}u1ZdbF2If;^K#w#vG~m1Lt<hNu144K
z;SSdSQN-!%0vcSvv%k;iSe<t3qbt8biAF{cz4ps|aShCSBs9=CT?z7R5<2Gd0DQE&
zO~3HDO3tb}v1lm)8F@ovLoqL<&#D64`pljeRJw+BU}iLRJ0zj-ObUa7nJ1219aO-S
zHw#mqXxJ|t<_>Aao0r~nz-NpAf<Aja(Gt3z(@y~KpxaM44&bLBVzMM{Pm^nYeEIt<
zg!eeVTdkIEHUE>gY1&Z9*)y<T((orJJ=8v#o3j5zIS^>xE+b`TlE9ZAb{p5}W>pQf
z*N0MP%d$vA=VI?`DMr)msdL1sN&iaej-22zlKICCR(&Sqm03``$J_lPnf1!M2=}u3
zSanX&^vj<?gUj4XR;oL;RAZ+OpWW`$_~dy{M+a<?d;TJ5UAek#cHI|0EGvr70?&oa
z83OjXGMxJU<vfj^npzCooX^87*=W}(b=!EQyLew$lot{y#^d#iJB#<lck80ur1lzM
zi?$K8Ph-lg`)>fA&NYz@JWkaX>!j`Tr_A#XOXP}kzv30|ebH;UzgeXByf6C~BWn<U
z{8%80KYo%QgHOAsF6G6=jfvcNhP-%FQ5JSt>~#`8r!qOUGdX9vYK3-$)_eC?Zy*fF
z(0huOB9gq8q2%?}lt1v$*5nz(Ugt3HoO+#m{Y1r^@G*g(K(eKiXXY98{7}Z5I!s3w
zsVEbOKITBE+U(c&!bpEx_C^sn&mKF%K!y2+Y?$<9d(|4rC4$VPI-$Kt0kf{2c1m>h
zz>4Xy(|Z-jg5qs<+!tLvV;VmygFC8uN$5wOoQZoWT8UKcn3}>>OT0pY<4etHc=G4p
zqi1v`_WKop*+yEhXQ*-Ag)>)CX6cpMVf~$!mM)H+UKH)V1uo(mNU7+_OT7F_f5NYz
zc2A*>-El=Z*C8n$H-Tq*h0PLMR{C096>Y`b^8>-AjV3101ahVs|NI{dKhA+?r9$N+
zRo~S`|6%w?kJWVj!y@yKuG=*ENAlA0C;|;O{98!K-sW2824{5Ta>PP<7Esl_q%uwg
zq~_(S$<n5p1#$b%Eg14F6_LfZ_hO|o`K=8*Nj4EmGbdBVyf2$_r>4&FBXtL355$EJ
z+XTwmgte%__o*F&`Q`7zIGAQYNRt%b_^0eT&Yh_#T>BA$O?ynI1cV|l$y6napVnT#
z>EF;q?icP3vK<*0p#3`X%!&eAOr^qTa5$eo#72%s2*v4-KXVqfAaYwZ8{lj^(%OYZ
zm5`;4Ncuq)^erFak7~+i-`s<B%+4(-5)3b@oX?OGoN5Qb645nXTZUeLBu}rR^yfiH
z`qMrrYW)GFUbT<ZlM7P+tkkcPni!rqcFp4P2DB6wkTrE2MWG%EQJGsmfJRWQ1dYHS
zis{h5;rx-HM0V#pD7}!<hGT!5x12KBpV2Jm$H<AZJA0mppGvTc<eBov4dM?ib|Hrr
z6K+T%$w?DlxKB2Bg0A`Wd{H2QHcR~YLWKr>Y27m2&-Yq7vkTa2@#q$WQpA$*U^8M7
zq;*Dk{?#kp82GnBC?bIoa0GwPD22&Oh6X2FVZAptqi$Q`MKhk@!*l2L6L>G?V7C~=
z-<w{*Z=pv=Rlne_X5!um;gbEAn^No4VdBN$dJlw=sW?n0r5-Ekh7Qgrx^@3f@&_<~
zzH~A_$f*eJN0mt2Tf%#X)Te^1F=ZT?X~S>(5i+ym_jA}*h7aAyKEF8d62E}*(vJf3
zX%)Yl_+66Hp|;3Z>Vr*2tw(>uM+)>Bdse<Mev*rwR0TJdCMVGQu`Z5v-@V62B7^cZ
zmWx8Ew>25h2SVDIY&ZSrAk2o;2-j`PJwa0HTzP*9h;&h<&$<B<Wxm01y~kN!CwBcI
z_t4wocgYDr@thnSn9=dDC{HeqRrU-mx;T}HeuRq*`tP!t=DnY{4BkR42w6{TGNA}x
z!!_H$?(p~bgW+w0o7|X<f(B_++dG1*RAgsTTJjv0&SVbfd+xYU?x*mtkWnyR;Y&$^
z%fVSG_zK{Pe*1PXl@7@7F((&tR4Enn=VX}0#sNvrOZcRZDf$x*^QhttrV%8@Kbfxq
z4less%=zCJgny>q*p|LmPsPQfvLvD3db(>2_^S*%bbN0sV_X!<Jt+8gm$?DkU3cqv
zT_N}xvU7h7&fE2%UWw=dI|-HkX@59#2BXZ4OPw3)JBe|ESeqwTzqL=g)c<4dP2i)d
z&j0@eA_R>LYJjLwQXOqjY7<2TMGb@`D2NM!3yMoETBT}r0xrnnB+58O;#Re_)qbs7
zTf193fFKYScabiF6svXV9V1Fz5EaPp{dvy4Gk1o8e*L|E|JUp9>m`|c?^&MnoM%7J
zIcG(r<t@Gaj6>igjWrHXy^x8?j8re4&Orz-j>Y@a;_*U*2!}$Y4(6p6!&-kroAV7*
zzAHZF5YF&B{;)_(jPh`e)TQkt%IT#aBQmK*QQC_%I13EP0L_+oe-7lC4`u&+C@0f@
z3e{;7B!HG5g~Yo?FDj$nZCkc>wGHl`j_^DWncGDPF}?TTUShm5A0k^nosinNrmG8-
zmV-(=?ne;Nib&bJJqH^!{jGyU$SjecnjH_X8)?{)gByXM__!iWTD<r@b?2!!;}QuW
zUj73zF+)7QtUR%bqu=xR5y(n`tPhi2E~tc_(jh(&JtY8FP1MO$6~V_}?His^dU$_m
z9vt5zH<A(T<4{AJLQTt_CQfTtPfV=p$j&JBudlW*2Bbdb?gw)B0gI_QZz#ltQ%?q{
zYM<JHy3{+Ii4f{yhXy?G5P$@_Eu`dNhzSVy9IS{-UfshN3y*~CeYXn<kG%y-L>-yK
z{D5=ZpN!7oWgCDQ#@)Pn&!Y!`V%WT=qzfdl{Ha)S2AUOF&V88!fVgb_JPIJhM+*Fa
zon8d8&i-z$Q&SJL{pdE4*FXZk3xNBsj@^!)JbXEMUm<LPhH{;gS2l1>%q==X?r7-*
zD&ino>q4~eFZmAO{_884rIn33-c+g}bDUoYAJ9uRpR^;vYxx3&1y%EZ*#c8S;wPjA
zgR0V?7_BL!OJK+Nvg(PZ|AryObS!5br8I#$&#?xXF(i3qY1{dV{+DJYCM(RB)iLm+
z(d*TTkGUCBfu^D=F3DUq^w~&UM>^{0hgLz{R8p5{Dj7B7bXr;jHFTLHO!Ib|#2=1F
zV6I54`Fs^^*qeuVqf<tgBvuVvqbn{BANumN!vM*?UIaPNB)4DCC_~;pcTZ@kANu-?
zmx^ERe9R|X=Fx;7Q5@lUA&nR(cd?0Fvu;h_0%4kEhyD?3$wajyT1vbs;`qF)F7BBX
z03e|uLXBw*N#_|&hZ}TGnVVzn$*WHGY@1d#aAR}7#702f?u0%eRe12B`lcIN;%JAj
z7kE8Ci!Vu9K?V3Tjss`Qon~<MPk=vzn-b?zA_s>hLtmO&Cam-<ehK@f^JOb3oKm`X
zpAb&%fS(EDW`AI;<#?*C#e!i8=aR!(m5zbMMm~RCM!-b;mCEp!|KY;ZXdH?Q_zU`~
z)4)^Wv!M1ANKyQ?$mcD$5)U!&CD8ncfyu#Ap2Y2{>AefT*jCwqnMX1q;(=jQo4rgU
zK(;d8;JiYP!hr|1^JoZ;d`;rZ&sTG&w$OS87tyzTDtcvKHUp78SW%xWThsbn^XAkN
zU^U5Pkef6QTnorx(q`;_&6EvCNa5v)m^Rs$yzusi-8SzM`(6$Sb=#d{AFiQpI8~71
zy=W9T`Yw1b5LiA3T!4(2XT3>+QSy`lh)q*?>RNQd%j*yGN!(!K#p4Hn8pf-U28He+
z0;zFYqS%!odD7Z7W52|<+I645;i#-WVAr=9#L#~>e}tu6A-g9@s?DIN`tY8WDC9Ng
zo7$UF8|T2y_ObI@44$4Oe5||X2V`u+BsBmt7+X;0Li*F)5ccpd^3sH@W}%t}RLy$f
zuLZ~s1qoCN#H_Oql?54v(IogKYgN;vbQ=QH<}@TdQ~!2&t)`$>Osc4;b;zjf(k)mS
zVg7RQVnFhv!cRmW5)Hb5E&NdJ2aiz&Ki3Br!UYUR;h_Jd;ii5YA>Ut6;+e11yFzu-
zZNBKZ%)41(f&U&0hMv{(qMQHIv-Fwk{*AZj%hF9JGXsciJ4AlVCy&OC1IL3>^ZNN+
z4T`p|Cdj1z1KUdxu(H&*%P8Tm-FZboVd==Dn-}|~=j}lOkUPlujM)uVXa4#XWlw|{
z^X!*kKAgQC=sgQ2yoIGw7wau-3-g-9$?d6=1%U|Mor&dXnIT-HVEgh1%nv~B27W<x
z0x<zjz3b>lzeSoGdhuJ6Vb5i$bJd$Ze2TmP3hnTf@DAue4xsrbC4eD%4CDu~bIEwB
z4A#9+?}Ev;Tgs|}y#;Me+8Sfgkk0+MDSb}2wh_f$P&_BWB65cE%WW5KO!hw(d|$mT
zvFcDJAg0uGAy|4gPzM$8g1zb)sL;sm)9J8~S}0E-#xFUVQ7$+8Hlz>i(-=PG=!59c
zm!`>;kY{E(VAowKfky4`G;8{JCRO@kUGYnuzi;>Xvm@C*eGnh;mt`Nwa1PEZA523|
z=V3Ew7BvT-Vdg5Li$~2PZ@qft09NSvdd5kReJ88mSF;VJ{KijNXcIIgAcrz<Om9B8
zCWI+(3N&hG!ij4uHT_A{t$Ei^fg&=-BvHlv@_OiH!MC&GFl5N^<t<c?yu`~GSIVTQ
zs`25{p6H|>IVlhxuk<=+j028NX{r?LK<b@M^o6mmjP*1BZ+m6$hU3*@N`iscQ^eLy
zi>a?M^rcqRSckW$B8!s4^+j^RP!uBFp(u`^icq30hn+3Hy(4;^{lTCrsO8CMo&G!!
z9myZ{HLHjDptXxz*MXsEq~(VI!j^eoNcf|Fog*MqTLw5jfp5IyJ~EFI#)!0P@xmL%
zA#Al9h$lmO?ff=W`*YOcorG%!+<g|@>NhN<Up7C+(?TL-&QS%LtLY~ojvkfL+JZXa
zIq%U*GP=~;Z&^^xCZ-FN{H#S$94QBSKVZXFH0yzhrEIXIX*lzqk<oqQU+x=eu{!}&
ztlUY0qbcf}@yxd)5ukVgW$j}a`$R=cQ&so4u#<O!q{niY#X4)=xV4Lj^u9$}sE{Qh
zL7>C+jHEXR!-ws%t;^ewP1z1P*YGPBIp3nYd3Pbcg(2CQhMe>pk~T)a!AAP1Kc7M8
zL%=h)nrftfr0e+RU7OztzEx@tmZrDSi0oGbwv^$fCo)ijm?b|x>f8KQ&5BF~XH<D}
zDG2rQsreZ1BDS(R&{O;h_^!j@&ASSw7TgANYK|HLU1>}SYdXP%+`)(q%-AmR&HFZc
zRx_Huh9dst*ba|i-g^@nOLymE<~$rHZ)Mw$gt_a4)L%0^gRm;nvVpOO<Su7HN$yqy
zM@8p1B(FoVx7uWHHL{nAPg2pz-b!EgR%B$a#C9NiA7BQ-ljOGVzC>=HMcqQOH>weL
z)`~_l@Q38DeSVS81?8_qh{@kuQ8i)tdkm8nmcQ=KO62c1_|QI{^EkxeW2%6uC3>m;
zJQ=;1KLX|^M{pw<kfOF1=rtQhq3kh25&zfa=~KTA#{wnZ9s#Z^-F3MGH&Q3+^j+<S
z&i?J-w_#4V5ggtnTcFO}cio7!QP<WI6;MN$=Hl1yy9A_;5{Sn#T>o7i??$$9#)k-M
z<fs`BtIRWu(svXkQhai5tpUp`W&im8B1MhPr|^N^M`oSIZw-BA+Ccm4BX}SLrk(_(
zbR0j^M+%ps7h!sJ@hcgB5qwPXk$EI6V01Sq((+l6Nm6|R4gDfdb@#C_$YJ4ce6Rl+
zSU3`xc7}yT!h)<j7x(x5_L=B1uwa71U;j*ObpA5~G}r!Iie&JyQBHJ#5BaA?aC>(P
z;bWu22Z`?vAB{sl&cz2VAHIH7@yqE~(UIcE{n9>O21i;nZif&f3$pbGJA^#Vhp$5x
zQGnVRLbmgVha@1TEAVyL449<}dwUjdGdQq7LNzoI1x32U!*I}-n0P)-3;_oshu0v7
zC-_)*C@d3;LNAI6iGeaiJeBHthlM9zGeUj_O;AM2o6TIP>@Nw`Cw*SjIVZA4eJBPn
zS+kdkYfR}m|3~&!6!|Cnsu~$6`>IO(2|IY}58u{BenZ9D4|SZl(wt(MKqh6Y^;X8v
z_3sBFb^!*|c2>vVwX{KdYPQ20h0m;C0PQ`kFNLg*4)`{x0!F;IKbF;jJs7MXWbJW<
zFBPZuVNOTz9M{CYYomsK&d%xl1-=HIpRl9O8zm#9F=g+`T6ZR>yf(AeCjg9N3zbS@
z*Q=B~j37RvxtIMW8(u^j#A+Cd*;2#MU1p&sR>bx#9JDcc5#(ByB&acWE69@ZHcV(N
z)=2mzG&bvt&}h#g<83;OA5;+<ANUVwoQq%!oqz8JsTf@L9-wnsV{(JGv_#pRci7C%
z_?GqKpzvNAWVYyv*td2t237{&#Q@wCGvoO5cLB3|=U?1SeX<G|)jY!K0f-&mq4W}r
z>Op-eG^$78-k^#`wSv^>^!1V{f&Zk030(dpaTpL(Azs8UzmDIf{8rYfJWD^I@VP94
z70I5IIJkCQXK8)1<UxM#0|tzHzj{v+sM%wJ{n-Azxw1yYS~M{R<di#zYUp5yI^b_6
z)=&*}&ZMy~ey4X5SwP&cXuc&o$GGpmVm(ETx}dw}c5m6=ex){j1tSa0ZxLJDhcfSO
zB!v5I<D>f$?{{R|rAeGO$8sn09n7<Q4CqI5{RqY~akM>sBzx}$w7R1JqfZYDaqh(Z
z3(V&bd`$3~FT)djlI(DwY!~rmo<Eczi4@SwyyXb7@C3h08Xi7}t%rj49C?KdlANuQ
zoC>7SySTK#uM;gLbiBTZ=sY>r7uJ<u8HGkNa;*LObWr7EjB$ptHphM1T|>zTvYGS}
z$dXT7FnoLW=}VS#gDRrceKeFfOWF3{gjCTnJxlG%VMQsb{54OePhh_xSzfY!v53tV
zn1@1WwX1_=4dvz<XSE>8DET5K>w!AOat{GX*2`hC<cNyIh)R~ou|Kpv4i%Op_lSSF
zd+gx&m%U@$Ji@(NMJtQ7w`<A2x^+L5n}cw^XBO?wi{eB#asnx_vRGLP$-1&+Nqc51
z?C_ExFy_;jwaq<0;yCgFkeIh_v4!Xi{YicYaT@88XmUcd_%BIpoDrjkcFfpq_E%rf
z&&+;v&Kb?uOz6h<Pf~q$H#dM4i?Re7`Nh$|)UR`OyZ;?yHU5DlvP5qcKt$u)x?-m#
zb(;%+da`Sn&8<t@D(^^kXAAGQv=s&iBG#*IWVd2|G`~IY?`+w)zjoEYRmbV$%!879
zwcV^!$(Fp?n*_fTii&zIC1s1dmL{Fwk>Fqn`!Vkb!G$D9;voRnVBqRpKH21v&X%mC
ze<<5FbVXWpX^O8uhO`aRBBwiKIq@M)uvxyWctx^D0AAY}-HYoYBhTO(s&!0v#f&|Z
zja%BrZebV3tW@2HJxhzO?UwjYat}Ypec#wbhCO)TnzpluT-={nRm+V~ZYbYO_G^o4
zP$0G<G@STXU5S3NsZ=XZUyi(hXv$MIAW;hU+cBW;oWy{hX`hWkBge5QR-0JGHVmAd
zn%JRKteO3<6Bd)__-2oT7CRK}k@zrqWf`CP6n~h$f>x~p1vn&O@yw$5v-^O@Jv!G0
z5g&(-uzq(6Sh)ewWMeehFY#4zM*%7+o}o}|juy_Rl1EQ;RHFO~t?!qK?qEu(?JDF<
zMH1ZyUG_<K=is&2_3_QUW0DVL5K<q?l=I!xdpj#p<3xLH<?YE`IpBNAoBg%#duCCu
zC8Ee(`KnKBSlczg#q76)nO;lycz!hURO9IS5Sbq}XVT~{HeBBs_}@L%K3m(>bnk<N
zDR#LhccqgPW?3WYi@{}ffR5ajk79sFcmBcRWx|)%hZL~VPD`iPojz|WOP*4py+%iq
zsUvzN4My_`ZC0>#>11r~WK+e;rYbt=sw06hGIutg5gUV-yxoH#E_t_i^2~}}FZAk6
zR5H#A%GAs_IyDyZUr6PdB68ap+14nFLaAMfHFD#DtS8u`kEp5d{YcKna$4d&jaMYf
z)EJxc6TA}OQc4;Kz{|k24%D_HXX+%o3#F}bkn2GG1RXqipE@W@*E0;?fq8~;D4<
z|G&o1w-h+f!;f;g1N@v>vE<$UWUbfr235UY;B{TE&R#EUhpHWoMD{}-s@}i%|6^1o
ztb;N;y{|nZKOOcPE07oDqQ_1r(aVX@9{&pw`dV94ScD#o2)$*8B9wc_oD9v194Fg1
zHXw4A`HbP~kMX9C4a#BA$Ehg)Gr(C5-cdCQzB+kjA44I_t-i_hORPJneNwd@nb`6&
zv$d|NdS#uvMhRhC4GC9A<|^WS?4;@&D|N->8nOUQU)DZXpBU4plnn(#Csoh<52g9c
zv<{*GiL+!ECAibB4?k+iMI)!Pru)pjIAnovJZBihmkm?W#rfySnya>}=ic7bxJyZF
zy?{jE2ug3%b;N&PNX_}kB9G-M9V5Ya|E^Qap|(avoS+LcHz9KGZ}*5O+)a|}i#R3r
z;K-jxMh^~7iH)u$UcxD{Rs1~|*ue0xiIWnm03<IS<LqT6T%I9x(oJ<>jv7w4$LBel
z{{N28&C|X%K3nhpe}vDl{=y}MQmT=F(jn2IV=H0@rA*j<iHH-OipeTS^&f*o!ihu`
zre7efQam@dGB&~Ixk*XmxgN6Lc5b@l@!gPue5bzEoBEc^nwX)rjht8coH%&|ocIUz
zKi&c(#($F0HHf+7*ox#8Rctwt%1G{?ytdRv6lfOj3+-fU<l-`4r_`fUR!e4bq3*b{
zl_fXzo7FXwhq`0yYaAQ$z_oMSmzfxLQ*uT{TT?ODbjBuvmPpHARkKIpOGzQlKiWAy
z{>FJ0SyL`D_hD7utF5(wEUHXwb}IqWWNz1DSlhJK*Dy;?lhr#-)@Yh+^qo*neR+Bm
zgWs8ws&`7N-YF?pH)3_m(jVi0%D4PzVq&v|#eB29WVt&*`0qM$>POOn?3aA~<zfrc
z@gd!QX(=0;v)bKj{w!Z_&AbktA0nN8N=5vI{gV^Q>ab;cbtEcp&1&@$@HI~efmX}3
z@;_5r-R<mhayCb+pKwP=RV4<scQyS#(dAydnk}<yb9FwK$Sy{#UO7Wkh;S)~NI6Ag
zD~=soIpe#n&&AG89^Y2p2Jpnu%ZisK&)Je#W1E({H;>ZMJ?<c%q06TqqbJ=F#74{I
zGY7%01h04R!mN!(+LYBX`)wI_4m0O$>5O5&9X@pVjZ>1xi}J};&bOjC8OrO)*1Ryq
zH$m}gOwDVnXpiKiium*0)stFYDxabJK4XEVnwdC6XeC)i)mTMca7lsWqn(jjQw;;+
z(1b9V{(LStY$_)+UbATNm$s%s3v6!jvY1o158Nt-Y4mcdSY|i$n*Tj4jCVk*(|j2I
z$8!_&mv(i~%?y^qk1mFClJ#ZD(J*>d@<#3?D@`5|B1=iY#2Rl6(X?cJ#mf4S(RnsI
z8Nl$8fA>y~tBAj{OJW#DL7TA|nfoVw8|Pb&Rk9q%Rjh0%lKU#PTVIhFkMe%<V4mga
zY?ru2S-G;EZ{q^{*YkYYyZLWip*p_AZ$}n5W_OMo-1*1k_|i=)iko+1i~iw5mrn2A
zH9DGXF8O?goj%^OPTe(>`lCHoM5V!RPatc&_lUxUM=S#Qi0W95(cVzQlK1*+*e~~h
z2%^1SP7HQ~Z$dtrwaMTef!HG4e?c)ZE3Y}PL)rCqPnS?^eZ4}cCX3>qYAgYYEA4z-
z8}y3EZF@`1+rZPk1DUr-f`S2Ot@AdBFy_lkpAhR!UhdmwglN|0PKnsbOE^PDy{r4r
z+f=vAZa>^vU1XG*OO63t-G^1TvE1TeR@WFoFgs?zi3sxmf;ZdmC04gAeL1{i{>OY@
zCgwUJc+IZgaNR@wx`_In>W4xwf0T4EN9Z@8&H_Q0hLUt&N|?Pme*S>g&eP7U-Jm##
zD1Q_rG)8PXmZh8bIr(k#0Pap5xHR!BqGx#9^~I3}Z?<9rTwOL(v!3DCBeo;mD3o+4
zLB%lXijvNyHriyQxD{TXP=@OpfA)Z0n|pbQl3O!;`vVmVh$<@CR<AJ8$ht&5xlsPP
z<4(G-ru!#|p5=Fcmfw9&-#I-`4fkA)3_@lE9Su(aGWv2&NHBQ~1-dctfp`Mv7~JF!
zYUThpASt`;2ZOwHq!zHpGZMa1q0<q!fjQx;P)DX)5?I&cD&!mU-dgSag<0hJdRX*o
zdq=jXxj)m06y~M>7c_T+)h$ntqwaR_XPj^O+!^@8<UY*rdWx!JFYb_Cl#S=JOPEc!
z%yA??HmL7&T2`_I?g?JepzVkLwAC+j;M2eEkF*;jkwzDQ_KR7*(|wZeP%w+`5Bvg>
zYA%XzE1PygSM*PFq_ldX3eW*iXQhQ-wvXim`h^m{K1no`z-Q;ea~EJ*UyNyTX`H(w
zv9FFjr808+HH5@<GWU7>O&;A=>CBS}WyC(mZSiAw9HO}&nJBX42+`zgjwk_|CprN(
zF931WF2;V^R8*Nfzalx-@n82P|LWgsRifm6-=2%ieHA*)gj|dPn<~;;|3`~)$_i`n
z#6xL5h!G9g4uoNVFfb1U+4G0`AV_f$Um7O}dTkW*D?%i@-gep&+o_jfGfd1+-;0>#
zY<JCOAPit`0^fo8t)a(1YY%Z~(CYD*G6F#UlJ|Pcf_=HTP^U{&DCo4t@AO1EwJ5^+
zh7vkBm5>yXgHik(OcX(XwZm*MITDF-x4L%8zjIt(-Lh9Ogm5onhA;ugOZg#$$?ZFe
zAB+j&2cv@c!Kp5OaBBC+++Gq_=T}1|^@<{7F_cdcI{oiQ>0IPUAny_&=WQV;5Xi;7
z)&w)s$c$9_$gu$25Fa^%q-rt*kl){+WKYmjO|MbcD~PJj1Pe#db9dLXwyqm3j$*qU
z25)>@H;xNJ<HVosM%cIfepNKu7y%>?Nbg|oYO02dJ_h;F{8ZsK=0uT`NK2ZDQ}iU#
z@=t!*JTYf5wy|+Hq+NOiA0kgR9gYEC8EHFT)sIg9nm-m@q2<9;+j)eg%+2{VEfPef
z=|Q5F9Sb2Ccd@fJMmRCnWLD0R)Yga+!^_hL1XfZZuQDq}eb3O<|BO|OM15I$AEskR
zA{37_5TU+D>gvw3y5;Has=H&z^TemCd!y>2Ii#qpt~=u{$FgfwWLYvlFHkw$>XxT}
zp}Nv|frV9;SY?hze6h2!<Zq}p3k%tRZFg!rjFqJq(1Jy^8Y4ut8iS~o?mQYvRI84^
zjWTJ{|I*CvY=}9Apc~?kZgLvtlP~{E-5l-W>Q1t{W$D|4x&;hhrX?_ZbEf40)g@5y
zc~I9Vk&)&_vvUIluHW}&J94<6x>`o@{Z|qBZLgrdY-xq|s&rgXWn}IGsWh@^IBx>Y
zbC#ZXuj474FS|4`ZcBPNuUVf;tdyxZ3|f+BKgfHY?EsXni4Wlx99>xstJWk>DobA7
zXXt+-Eqm}L{zX@8GCJ~7O<>dyuRqP6O=-BcGunz+q8hQK?VK$+OH_YhaplbuNYjh7
zUZiHb1q)nSf9u~irns1Pn-}HAd!Y)}vm(i}%K$DqxxIB$TlpVd^C#st|7x;0XukV)
z%~!O=dKA-E^D}wz&xJ5&*CPER&B?Gq+n~hxl}Qdr+?+rbti^mN@s51QAw^%4Y&iBm
zA$q)hf=^_?udFLmQ!DHG=uhI*l9lFZTJ)8;4)#>?suIA6v^<7bp&>%*oaQTwz*Z)^
z|Ce}H?$Tsr?hjS7(DG!uN$oRn1d~lv4v8PbbiOV@+f+7RFQpi!Rr$hOmuBY#j7Ado
zKt40xXhyydN4_7Y9(jLSCU7SOKO7-`N$`bzgf~$H(il?5SQAa8qCdt*g5$c#SwERj
z9aW~V=ZRl)JvK5|2h0^5v_|ACrx<g1N@f0_mb}-)n*t9A{xd@3lHPhvBqNWVHkjXy
zyLYQoisP*+Ncp;BrKfZ`pD^O|lr8F%C9kyQv;l1=7bi}sP_Ow)b1>@iGu8-cCWA_|
zU^E%^WwSZAbe60XdHI30q=ViC<~V7?!G^g+*-go56*^xE+%{pWjYf80CK?HGI<8Mb
zJ73(UwIKsvO*}g)8x>_1SpC@G#$TP>i-gqTBDc`Z3Z&M$({KG3F<VGv9dV-*S^Ge0
z`PyKiM7H#%JZ>EkVcH<9KR=sp+8`?Zd2677zlN~=6ZIu*wKHfZ3PRf3iTNB|G%eG6
zS^D2#IdN54dXvO<W=)*11gn^*917O^BRQiM8i0O=B$}$ye;`3Vzi5=A>C*x{E({#P
zj6<cXQwD(xNz~HhaQz9EGSfGJ3;IaBnix@*o~bsZHMWmIsEw>mFg%RUM?!6sr^nL<
zoRY~|&{*P!03g{dUCD^}GW}bX>5nQKV&i*=NBMJZ{d~LqFo{Y(Ul89QenMI7tmIzF
zYgp_aF}iW+iW$4l-ex%+2PHPn88JFJI-2-0u?D|8dLmjpyzr3zJ~}D8wv9;yWa)um
zd9O}Cf91>)h2S3YLvZ&IiR!#dfaT<uSSk(Pp5+c`{Uzb&1|Ao{$4ASs8RWm1mh6|D
zWB{`|KXYJmtYF+YJTW$UqPIpG(e{9bVRi8M*(zs|t<w3t<a<-uu}ytqtCFXbSg3f(
z^m|wh`O>?42W^n6t?|sZ!b>B!HA^&)ji$fPAM>B{@?HK>4Kn(5wrAp-<p03b%F;M?
zM4#9$>93%8X3W<1(_?X*a`madpZRIGpV{9%_Jr*xPCntbHFKB{`^{!aI@w^{Z7GH@
z7At=&#nO|zCn7CP$c(AA+G$uDe1++iI60jhacjWu$93RuSmr*9t6!OYW3^VoX0EW?
zEhZz<X$SmqixsWLxnk|^#qI>uAwjNFU9zDMY%vHYZHRG+xo^sm9V9YYx)wHR=8PeK
zp|=n1tZN7@^fvely*d+83%v&hURpRmAm3kW@Yj2X1^(KQz+bC#{#spk(ocZM7I*it
z#a$=Q1eWibTrv^R#@m{3Lv>=+?ur*D&MaBkQ(_?fqHxw!a-8rHnfnKxtU&rnezgaP
zZP7W~I2F#3VfZ_DVkA9$y!?{YP&qQapeQq{kCIV+RA5vO#+V+AQC-8|qYyJSwu@tZ
zQ%R8bcB-6Xhx+P_f1E*mwNT%*CXD*n{RPo}7=zxy`g*tQ`g(xxo%zSN|4taoxP|}2
zlXDBn`3T%XW%HO@*m*W?;Y>cbSx$~G2~Kam3O2b^13QC~vSUX^FEzU2w?_4Y*TSQU
zv^+y21xI#=Pf!PB2r4U&jGhXN@7#c%&LR_m`bCbc0wS^dYW{Z_0dA^o9-e7-Q%!Qf
z*P;^}?oEDWoudFF2Kg3=m(J9E+T6eqAG(WFL8Rpu;!qZ}_l&fZ`#;MgEf%!UxoC)5
z1d?|rS}@Up2?0)}*-YHt$jhM}iItJIhZ%GH#-g%F%j2|x2)iIYl!t%l!L2E?xVHax
z#*~)VezAt>&s$K|vanV%>dSg5y@wSvlvpoW>$2ww_qz4vnb+u(#h|MFr5=5pz$L$0
zV@`}OiTgJbXXASp#D@Ubff}jcZ9NYJK}Lw}Nb70*4n%hYza_el;}4ffuG6^F-Feu7
zy4I3%o&)ceg*UT(NydvBH{<1h6*zEppSHSX>5Zaz>FevtI9^ZD)cAFMSU--mj^H=U
z!>Bl4<w$+FRz=80=2stneS=@?hnK9cE5SVS%2?2wHi^Z&r?J^MufQMpXbJ@bKY`yG
z_|g1Lp6U?uYUulN|NBCHKh1rw;J4tj5a9YX>({Wu;JgyMNb8Ly>%7R1xt6zi12?_h
zg-N3O@7AT)uf3id)>@e8wM*9ghnyD|9XP1#lOi%z5v7yCxWx$8Zc&5)xm81YP|X|9
zy^*#SJD+&tIrrn?OpD!Oz25l3y}Vsuqz|M&YL>3AjCyZBxwXr_*-f^<_@;ZhknvjK
zO|pufw1viiUuvH_)7+~G&rqmq+#&*_7)`@!*MajhhzaYoydg;S!6-gtl(It<6{(4h
zzq(v%uSL86eTNY??11JtLGuQ&1+hxwBV<!wvP6(q)m+6;64i(K9ClmejRl^JvuWFQ
z!j<ae`!t|j%OW?Qs0JI#lH>bm`&>r?F*v>~_5&49)`aXSc(HAmC8#F8C|=UKZpL28
z;al2H3%TBrQO{>{Pu&?vV&IaVVfVhGjq{dBGv!36-GkI;`<pzkjMtHtT|pMw=hWok
zx%m8={l`w&uJ1_8Z$xWB|LKQ#B3|--|AUlVso3Q6`w%8Cw!@Ly3w`PQRs2S=2sU(A
z{6?|J57eUJH$9b~aL1c)htP(&ag$UQ^{yi6B6pI?HA#=-Nd%LG48rs&N~=MB;~E#G
zzsqk!MMDYLC~M_i5h2{-S4n8!5%viQ4J+Pzu}i{@zgcGkVv{SFU8?Fpm8?ykok>59
zIJ-46S2i3esMeq6{-o&e#7WT;6YqOV-_vL%pl7Lt^K`uMshF9`!;>dfD9LA4^7JZ6
zdOw5I+v6`j+#@PhjtDK~>l6S1u;lIjOiuiTy^^PKnoxUkxGm?;93z_ZWpVOUt?Fwb
z`ZSZs!zGc^XTXy5ziA}`S7)H8vB*=y4<FhQx$P33yH1SqIejj_%+s_)6=Xq~MIE)=
zrii0Ebs!V79By&iwky!_nle^~b)wWxe8s$Y=?JTTGW8WNtyJBNsgC;wkJj$TxQ(CE
zKVl{vy`V@-d8wQZ=bw@1r@|MLGP1IJFHn`JFO4rN4NjfQ?oX|w+DIu^6u#H@6T|h$
z_%Y1SrQ&5vke20QDbn$dZX_9JW_hw^`JB=5#%MQYag<uY=<z;ME1YboJeK{F*Oib#
z!}epCH$Q|St$X;Z6wcGSztz;zsWk6cQeR2daBEMy1#7>)+C4d|cBOBz-N<V}uf_%d
z&q!d1uI#3j?ZinaV7C(N+iRvzn%6pAGyPTcOy`TH4=sp*4z)E^iz0*<RdaH*9%D69
z3RT3jvl-5fV>pF+xz#O8_oc4<yVITix=p;LTp)b5S^Sp%yOzIMB5<i&gZ2eO{mcNh
z_4y!w2@E9Jb1dl(Dbz_JFb4TG70DhP;ux_bVy59;q4Pds`m*+j@D^$LlTcqExkdRm
zEyq$JzPVTPt6&;lb2L+|G#i(Sb1eN-Y6bj?(&SXFx`p_dPg-cNe}&Saq#UKFyoIbH
zMWxcEsPtf+I{tDmCa;pD=UyM?=BZpqS*?v{6PfBO(#M0Sz(P2I-_DDV+;#-N@#NEo
z@+S=PVeFjpK?clYAx>b<hgK;>_q@D4w6fUnU|lZFl6QN=UoP$SVK|j$g-{rPSfwQ=
zKs5h0gtcEO-@##R#~>&%V$T8~{6jqm1Z6Q92t9K__&f}PpAwOlZ3I>;%pg|0Jvp`{
zu?9vdlnItT2G4M3MBU`pKys3Be)v5YqN&`nhjwJ0HfgJ|b7hHk$;)sV3g=kevh>eH
z?F!@t%RGJ}4fVo_G&yzm_v?B=UD_?QvR?@1f3dzNm|qfhd@J&8eg`y!w`Mf-irPkF
z6bO(hDJe51Cw|?SZuZ+&NOh;U90b5*)`jtLlGQCszm4t1exJnONRCZtA1H)eXFRT4
z1D^+PB(KCgQ=V6PSMn4;UX4{nS{@R^uwTGt{Te;Mqip5cFTS;ZOiL5m@LI*ek#*1v
zRjNCCOCC{(wRSy=HyoiB&fNLI3%NX^h2mF4T?Bv;;4pTTb}c}uy<Xy7Rj*fiZ6yOG
zlfH9_%CcAt$0!EwC()R(tK65%tNa8$0fBk2CfHdbXYjM<x9{8X<t(2j$N>%#{ABXb
zt#W`TSPt+FmIGX05j)#*fbS6`-CYi_;@yMq$nKWP+su`p0eqpV_S-%KxSwV#aV-lr
zx(+SSK|7-b%nH#$PWI06lVuK+r%!+scUsrcQBIOsH>+Eg)+%=>Nwcx$8C&3-4ljoJ
zDyQES*o^A;Jkh=tFU(hs1^T_!>XxNHla=N3m9Fv(_^O%TlFi@O_X$q>$s!BBkMh6Q
z@i+02MXjL3oY?X=v3t|(p>z4mVA{^`L3;&zjFk|jJvl?zc!e6Qj@<HdW&yLhyf?YW
z=epRz?7sm(6aJ`TJQXZJj&sXrc6)YaSIVF}aB;$}M`mZ=zv#GP;3_JYg_b`eb9FN)
zpYVl>cFAA+7%w{OndA~{;=f#w%iRnFrCDS`ZZ!1~{}tG)1i&?kFXqdhX)m}fI{m1`
zz!&qizfy%e*YdzEK<?p19=NUCJv_sMoz1Ocf8c>@Q{9(GfaKWvK9QEYA?W}|TTuq_
zV|Q!rPdIzDg2Ks?Ikqa=m-AUe<&ONT$_2J#zvLAb`feDye8wKLw<=a2nfsoKdy3Z+
z3x7R`g}=x`7Etu{p)kXj&IfZ(RDZpj&Q_e<^CAjhDE)U_AUk=+RieHscCL2s>~fyq
z-6HpHZ`YwK_e*-qDRe(Ca!Skz5HdziNs~FbumlNCP+@YMc7sM*Zl_JRwL(H<=Y&&k
zgwrQPI5Tg6X!;Z;n)C`WgHN~5ttNDPiS?UrI}(q%Z3bUtJ<5?x)b~jzRh85aq+e(i
z$yt+cKniv(W_EeWeORs!Q)ozwFDE6hEb*^%W!)azY-La7Mi)Pu?Bh}ZdcDt%C8O!|
zF!hpgTwG(<(ik=?`<A<C>GS0ZS2zF0tlj0)9|cyC)|DllKZgFvA9&5_yGoAZlhLwy
zw@Ay=)KHkArHvoSLv1OjK}$iAxs&uJv;yRvLo^SlBP}MHr@>}{8asBow9MZu1Ef5o
z^a7k_bXP?-Z+iC2>rS8(fXOvUzZ9cmkD|biFvaE;!vCxC8j{zm6zA1ytDy3-w5o#2
z>l{;FAE>6UyllPyYiO@Ot8O9fmDm<%|Hww$!QvL%*z7`K7Tg*}r{$~!{=>8&U%mA%
z-kK06srwcYAxYiSO46)-b}?lmN|NKtl7nwbY&7|?SEQA5w#*V{e#TXusH|CO`H<(}
zMLKe)rvXI$4k(s<$cdYn1uVeRD52wuBFhHrtxdoy5`$fea04ssjT&HsKSjz%|6fkg
zJxg<Y-uV>$Tr?P-qHAnjy`DscKQTy4(6~yFbWeO7>~<V>M=~d(l~F5i56rhQhN)`*
z?QM+y=`(44r~0{oP4PZTUAo=UstVZK==2=BK;~p%tN+I8mZeV@m+!<bC}eM6t-9FT
z&tuo_w63!$a%|$GtZrHQV(MZOOv({uZdG?L)ML6PNBX!AUm~lLho(p9lh()b^PUUt
zKXPXLGv_)~Rs9z<H#jsmgk6BR>Nb?8X9TFqb88xM(cBP5bCcCAOP2?AnSw%YO(FAZ
zH-p(tQR2h&k-~N+&A?&A!z4}rindMOy2O4m;jovq2a0_gQSZAiLbf*+?K&-j^@H7X
zDt42<e>L$w`6uI1xQP`IcI+I5e5L*VF75aA&qE*zAnqxYbd+r7YSIcz`Ke?JmZhe|
zE^vMH^5xIY_v_{6H_bf0U^gopEXgXc(Gw&w<-KX{lfDXhmc=8)NsR3w!fTwgWVzjE
zm9>@K0|ttU*K$A1*9og8n@iGvlqhVfGT(=cp_OjCd~yKuZrQq5<z-WCTB!0tITE4~
zjJpVpO7Y3bq*AK1Mb#|%2T@twl^C2&{E4&-2?SKJ>i5hFs2!hZft^xq=1Vkez8uBt
zXu))!zln@9H0W@5F^iPx9^$LK52N|e`Q*+71j}4<lyZ_G`?4ylh@7HoJ95^E#s$tg
zd?2CLWTDcvXQ?hZs+t5=P|^nhZ;%f`e2sDC#MR)FQTW_7&bJsctrGs24u8Z?U|~hK
z?fC}lGa?7<(2+E%kZ~Oq2V=bsV%25{0sHjgH((;=jj%NI>9cfB8UzbAAJatS7Uh1A
zn%o|1b|)&5;Nrc>#@EDh>^PX<Oy{de8?uv!y{o0J*RSWj-l^(^^gr9QokC00SHj}s
zTvpgInclvpm%PW0`dQgznT=_&&dyLZUW>mzs-9cv8+eaXsbF5vwT1G6^0)1!Ps9I<
z&(uPU)M$LB7Gh53SB}47^Tqtx+_`z{h;Jr&{B_mYylbQtc`LIveKCLMndM7>LS7vb
zVurRc>}AO}E-@$4IvNTMT-_7+Em!zx{v_*t_8%Q=T*RpKqcHiqi9VmF@<BOwsz#;Q
zx1a%OVM%={ckDmtrsU-noCm_jM%J>Rbto#*Qla|Y6YmH1$&Rhag6toe`=(|?BB0-P
zUT?p26Wt^(uS%DJq{NkF=?8K|f<xA6XlIwFkP!*)!w`KKuNpfsISPeOy3TO=TPKTJ
z-8>zP{@kId(_wYX(!bF35<*C~6wstU#aBr8WcD&^kkY2g7K;*Ity<AI<gnzV8X=7P
z$yPR23;@Y1-F*m&Mg{Z+t!&iUJ-m$aZ&9LgaH>jw6+R$5AUW4PQSRdHcZ_3gX~LjH
z_he%YNggVf>^3UVtu97(G}&RC#mbrHz2kOL6P3JGMId`g@WzpKkZ&i-;yed<N{7*v
zC$Fit&a~j;FA1%F6yyOwVr8;Enq=|bf4|RSz&N$Eb#?RZE9J=*0gL`@e|e1M3)uNM
zb}keB*f~wJzf!dseUl|WspNPmz{niRG`ZdT=MQy+>!y;kx;01VEpg!*cMuYXR=`q8
z<vxX~AXrNmr2Mc>(v`9Ns8E^E`tz9+>_kdtNoOcjwI?h8RN04^5F&V&d+jVV**_Y$
z_v#}c;N!+wqjsr^Z|gVb)E>>N<L+RQP<!zYrl(HT=%+_x+<!SsKhKR$Y17$fG4646
zS8HHaU2FJl8ca{_HqjEV9TH1sZW8RH4MIAcj=4{b)Zyr+qHNGVJcqNxHYJwFj%mC3
z9S9OVG4;&Z+l0r+?LVW>WXYd|OZq8YxL(Mh5!rH_FCwH(p#CB)1_M*@ZZ*l7AaV-C
zdKIXMLFCuQmrd_To?nA6pBz_OH+0q1+Sy9soH_0Kw!wRnDjeUub=vu~Vb{h&nOO)w
zJr!hiPh5juE=lgSqNH0<U4matHOZp%WEjNjd5@ddtGdO;q-?%)+FiDRKPs<km;|8%
z`M}dSqLTX_e(4{2yv&WttW$ZH0GQTdZOUjQx2;RmmNHg?`?2~c2fIXzl-i1Aw+ML3
zTZwarR&IX4_{4H|7=>&F@ASJN38H)e;^$)|&#Ot^h@cG+G}Iv|a?2;oMFvTcTbA*d
zhbU6@n2Hxp$s#K8MRKn>W!>tM;|B>@#>|nH=csB7T_J{MdMXm<5m(wY@~q-gk_H%a
z{3|Xjx|$!*i<ZmZ2RB~hojO#Id=HUBGY4sukUqv7Ms7J-+Ly<Eb1Ge5{Pz306QZ!b
zYD{=E8-dW`2DSL<9cnQ)MPuH6z_X~@Hf&E0(|{@>w`da^Oc16FH{jPv7J@Qv5M^+z
z*j}A8B%20r;q8*d$wm438|NY<Kydd>CD)cV_lkF&A8Gx!MihqO$N=fT;Y$YT)4o#>
z;pe#ijWP=(Tyd_D1U<PZJ(V|3UMAfj?xB%%gUHT3D+8+YamZr6=+f?&EkT#)JRL8M
zts?6D5YB1WSVw)uSUb{(Q@uT(nkhfeFRw+*oMC2YYi=%WEpUvyJ*uz7d?~<$1VWxV
zc?j#IWa5+@e$pu1wb))h+0PnsSnSYIC-JKJ(<EM|abyErD_Z^b={mA7Hi=k}MS>Xb
zoYGO9uLkHpQgCHSpr2?yAOS5QmH60tZ47YrNX#frEBNof909QDv5eW<aytgdQ{y>M
zllWyzMC8vo*hO<X<}?gRHq^{{HCY4j8PNOt2AbK|$CSpt=fMALJMgbUguoH4#|g1n
zBviDO?BkHI`{Z`&ALiGeClhM^M#&kDdeUSnr(s__-C+E4Dn@nQwW8>-QJpW<b}cfA
zggj-)Ht+w@wy1HX8G4M|vL_v<!C^4uQ@}&|6P^oD!5>w7LTUO5K8tAf`U0G-Xir~?
z+3~x>{&-mWqij1p)sC*>EYQy74vO@Jd}h9a{a9>XsYzBdq6$V<UWlFXyF#Gv#bX{j
zIk~(WnR)?@CDOk9Ix{T4ZlY>de#O7qH8FsVUp<N7e#P+^Bl!{1pUI=++j#p3ByI79
z$lQ~d1&f$Hg4l|0W0%n!@jp^n^bs4Mqn|P?(w%M2ZG-m2tTk!$2!=QMFU%qi{4pmP
z_?HLLNa9zr_sl_oNc@Ft_N+Y>aS*mnVlKgF;ocjm6GC2p^<GFzzI<X9d8Q?It)pl4
zKOpFSpPcUFU+kKQL|R4(CtrZ46T}=G?0y`xJCik}$Xwg{X2^-O{#GQ?gmI`iSCM6=
z#kWlafriraBCSuUKv=(L@Haen1fSAE!4Z_@kKnvu1inVm*t4@=yCMG7aft!3v(kN~
zF6{o7?I-2Wqw>&lTwbF~rNKs&G(?^<ooH=FTJ3FkG>Zelq~-3+d`wOHCdDec>AZL7
z+DOYh;UPQap9Nabnb46O4B!4!!zza~m|2)Aj+l8>;uYhLr`bqp87A}h(d%K+*2Sq>
zenm#EO3Bzq2s$zH*Uu<y=Wc`n&Y=HpVJ9%LBDb6&Wm<@U+SrE|aGw#-#5_!077WD@
z6`=pL^pg;T*sfr!N9VVii~rcU`M7VsG>3|wb$DktSuljD_xd<Lm!>-(&X-d}7&}N%
zLt1veh_Gw$4*HaFbvRo2d04(Dy!clWKVQY6A{^OY9%+41%5qxPx|y0m;X=)MRs#H#
z$BYDU%E(E8lN#x&M}kbHj7bCwW=*2I9j*EPR8r<*L|4L{PS2@{piy(0+U!#SQ|@gh
z?Ja!-p9>80AAFNBa0QCbMtUsr-ydnD<#@eigy)4u_&y4!@Cg5yJHiWgG{Q?URCYGP
z)wv^_f=-CEZeW(rl&e~<lLD?TDPH{fn&ORduSCO5b}N=`P^r}5a(8cfiTC^a=tlIt
zLdTQhAo@8eU;G}o=B!fPE~03d*3A;NfeQ7>q5%-oA8Vv;QjXN~#XNHqvFTOqIKqGs
zdhh?(q439imS+6oKlHmK{g(guzC9))>2a#Q*k&i}ES%$4e?yAV^|o>(z5NLhs^)$f
z)bGIyzrdp^(6{i6?&`O9vS0r))$d5(!DE5m|M4FO{6jvp!(8cic=Y=^MtxllA<Q#V
za)W$0bhHiqr>c!n5Ovh!ZNsTy=(?CWB)-U34{0n@8L`Qzi`a#^f~?*4jFrtd35IRs
zOEhl?y`-<<V~#(ct~a^o{7-(TA6Ksqfj8?}_dpMQA@<`CBtOi7ggLnZty#OlMiw5I
z&R1t#8Frm^Z~AaruifNI%A4~s@PJC@7**HFsJf88HF+Dbia<yy@AUYFdmQMa>lHnA
zq_6V}FSf5h^)4gx?ccyY8kDS4E?0%GJCg(AU+G}_%Giv^TnTcsUA_(DL~ifJzeLh1
z50E@1f`+Qp<2RlC((+TDQFOk)=tXYEg<OF_`{$CgHZ7})w7gF)MhIp5uox3EH(pS`
z5%t`Bv)T`p{27*0wq*PZ%0*gjV{cZI-IiBoqO6DSir*O!rj$-^x1sE3Kf18D_u^Nm
zm-|`N2=}sU;sv#_0hB>f%`fEpYXj1&^$7$V=kW0(uobzz1xnCMtPfr4rk^w1_q%+2
z9Up1^rzk87{JA-(h<|ZhBGUZr(D$E_(vk%&wYT(Z1b(kn!-0R!W3ZB=*XkH&IgWX#
zpTi=pm*sY<w3=+AuG9IUPFLo9PwkWGwDWFjUz-gMz~U8pTYJ-XZag8>(xkvHHY-DH
zYM4D-<Rsf}pr$Eo+ui=4KxMro-}1O+1Mdf<&xXt!*eJyW&fg!nQYT6&g(T<sl*^y5
zEV{Skz>_*oGbWr1qmfoylFAl-Be$@k#VVK3o#+{ahmC^BE&EbNj)tN^`DV((oaQi7
z)N$<Ow3ez0nkaW44=ab`OL->BCCnk_p^sWo&Lv@JrUoX;fbC6`c{JVmus>}DMEKqx
zfNd<5<(hA#OoKPAQ&Pvld_Vg83umEVdbe)y1xRGht<n#h6Y1L3-ZZI<j9t#mJ&0-v
zY}LEu5CwKq<d$kEwIBxWJkG~J`Z37j*mIermY1M_5QV*z!~M)n4mD}Fc>33>QP6(6
zNN{BBr)T8D1Rhk_e%e)VWbLPOqX#OiBm*i-Ee|n`e*7fIlX8bb>1s1`?EXfv$lRCh
z(T}%8T7E1xC}<?Fl4Q+7co79N5Qbxsmku*b<@k62mkqJCDk3R;@f(sOQ6JiW6@vb$
z9OATTj<i0^l!eOtET>FLwC*@3eLV$JVn?$?E(zI*t8~WE(T0Oo!e2Y^#1`awVoeOX
zAU)i4tWOWdW09xEFcFF+h6md6MBt4XV_@Jx6qt7-O5$EO!AFi&C9D2eTHe2Ir@aE^
z+##%h6pHuDBTv)>BdrX}0dwg$Gs5_`b0e+a)=;ywF*E?lLXPom7bQMP98K7gaYk<c
z9_~wg+trbly+w`i8|PR`bZ?vN^Jk>x_b90Nwkv|?)>EmnVr2ACPQx!0rtFu?UT5rx
zy^c60ADxG$JH#x`;<=m8>Bo4UFKZxW(;AYrpZy!&s^qh%>a2eoRh@%HrN<N9<CU_$
z3WC_c2tpE|CyxbZynSdGM5O9rd9!^>4r&ue(~82wH*<}u_s!`R9&SAd1bElqXu<fA
zR}oQec}{>SFtpj*rrdvp!61an^zU{EaSYZALEIotEaa}fL3Tlo)Xvuf?=b6G?HlNU
z)6)+l8O)w4*z7I&&E_cs`K!JzXfXC|o{)q2Kp7P9SD&D14z)E?d=s5#4AH&Vz83ha
z-c&5e#FEbc$;$rL4UsulWe}N2KO+g?%|LY!9;{4%7ZcPd2lbr8Dz%Fj`p!z`9;e6O
zwVu*@AV@?%y{xnJTSO4__$3QK$gGQW3bv!o&1{rSzlD3F&+FXhpU|QId96O5lyx|s
z)ALdqM+Rg6-Ol7i<|=MbkJ%b&nLx>q{d&p`kV<J{`KFOS(DK8r3@Znh8UK3@gcXv`
z6=JkNe}tv;^W^<O6FJfu(VSkG_0PU32$yA<ufLwV@mv5~H|V$|9BieN7f{~k`kx>0
zy|t&`Htap<BlFkpu}hg1An&K{aX*k(pshZBTVt7LmA=ZAKAzGNK&2-73y{v5w;hNF
zgIV`E$H|+g&p3HA{bu)e&7MMO^|Gry;<X&+fB)iN3}Hojsb=)dLGcf3g3zIYc1HOY
z``I+|?BY^FZ=)&HR`OI^tbSEca8Mv8ata=>eZhl*f_`9(XqTz%67^J2mT3_`L<NWQ
zSda>q4K7RtYecsNTb3dW$((0*Bqc9%EoWCEGcneqgYoYx@G~MJV~Ot#CzvJPhab7N
z({N*_?Je=Gq_3x=_R$>W@6&nuPd+Q2`j$;p%%8~NdR&t3Z=8p{-xsSRzU{(D>+R5{
z2&gA)mp+Qh@oh1VhY&Q|rbb$?^gr(=eVFdYcNN|}UFLU_e$(0=PNYfn^16F$04P1a
z;2zKMAD?!QgDG5q!VhCOVx|`)$qLTG;h;S<zn=nR!TEiM)vkOlhrY5lSc}x0O+vLT
zJ${>JGRo?D)`{lZauVWFi<$??f-VTqHv~}De11~^6;egx96)Xvu;9AICe3<=DpLKW
z2F)2tKSqFL=qHgDPa-L6$=s7u0S<kZ@51?+IJV66IaJ%U459f`(79<@iRQ2Qp!iqk
z$ErfDe4O9PPz8OitVuSIF>Q<R4S}oh4j{Fa?1^$_TbCAHwN*o#r_AXaL(WKpG<UGV
ze?cu^G+0tjqM_8<E3zeE=7Gljfc-OSBQtESLclBCR5A*%r-?wnU;*|66#=3FS(tur
zi|@|uye`k}^xl9e)<fo^(_ZO|5w7}GX7oEDtGDWaFKw%4PLI{-c{tSWE3PU%zeYO+
zD7A$?M5*n37RujQkCl2dR~x5GcvC>ij`J&=4c8QCZ?OOQM}B*E(_Ui9<o5I%{)>2~
zgBK-u9mF$gfUvJW>la!T+l%6VK3|`&-&PQwj`eN;Iu}a=I8e2hx2HehxpuJ)fT_%w
zA9t(x_|o)NI`dmEruFu8wcq>O{}90KX}kh!?=SWYQSKlxUGMk5*zf;gzkZ22AP{U`
zf*>##K~&`}zKJdhcnGBr6!s9<;n9OrHx5z+c;SA~P@)zluS}n%-AW9(CIGRC7aY#C
zi}G3MpfY_FFP#5q``bBit8JW)ogXWEibVVDe)ixyPSETdEWe8V?y>zXJI;S3ld6)9
zFeKQKA?m7*>qBG3)>xUn$>eX1n-9@<#XqR9Q=-U^smcUYND=Bim;PB8pQ_37!`;8U
zl`Er{x$+Y`0(ki9tx6F3^Gl8Vt4gsAKQA8RpP%Ipw5r`ObQPh$>50Gi2WBN!B;1Kt
ziC1C=31u(QndIRwQNyDmEpPB=Ap)={dw;W^BzZ==E2tgA@vR(maDZ^Dm1<H(NagbW
zI0xYT!v9{UTd#{Fx2Qcq-cOK|@3pe6uGpr27r(iORY0w1-J62nS1X&7|K)@(4y~xr
z@{A_8)R@mIZ(L+B&K(8D)!0KcrokP;bC7>45ElZvfi-ik6=>DAZr}e)J*4a{trRe(
zuImsyz4^FsjozYA^fs-xO{#+YwQSmFc<8bfet#H`-okC;gL#=O`Sq;w(o$Ez65dKv
z3;iCvS>!2L^J>VCH<C{`Z^If|BTXmC9b*=^CiP4mZ~UXfVu!ba_Sy5cgkukOgFm^Z
zv*X&nY{6C~3dgxM#~+W8A0%gxKlrr9+uTo$9mve*)(Flqv!Xw5#&e@-F{r(`h7`+`
zk8^wRFR<JBrwLXIDs@NN`Gp&SR6xb9P*)WOZQH0Wz&#gnpfA@Q;?Eo3*YG{3ub%W3
zUsi72aZ6+lV82ph{sqTseBF<&EGJQ`<R=cdr8!kb-N1xh!&tC~!u<3QO_7db$$Fm>
zR)?Rg9%ox*;_b`_fa(-Lu`cB1a6pP9lvH8Jfzle2Mscv0<l23&J8oW?fx`QYTtJRW
zh>cJ6*rT-6QU=vnK=zMbk4!hJ)G`GPw%&)qVlNy^NoaVdwpxZ=A8VGm&fJjHy6L(l
znZ8v0DUu$U=sP=q$#_K)ReD<k3Q{%Eo~5p3%@xu_E%$5F=mVJ(UM~&JZw>-nW$)x$
z{efq?_l^O|%#*qu$ayEA`S8|FGY->$-RSvH$D9NhxEln`GxG8=5Z5{fT|x&FC#9R2
zD)ZmRS<}Iwd?@Y(ed_7AEnB<TX~{6fjg}X{>rpl-4?jqIm8_>{4(==Q&d-4AOV!)&
z4?3-wn7)wK+Q%7CL4Q7M-=x3!2CNv1jvFbOGv)>w3SN|@3?L_}{Eqq-facXqBYvR^
zTmmU50Ghv$RW16p)8PVmM2|)#J|bqcGQ%c5{1?YT2stGN@ggfRkEct`yF@-zj~E(f
zWJvqgPf~NPL5o%y=l--m-`e*FzW$!P_Fv?MO8y*hLoJ8+Nv96#UR&E!En`szfAvB<
zLuI;FF33>5)-7T1U$(#-8Ol&XD=+_c3xJrSa-xmH3hpGgk`st749*2KA$2mWpXfjj
zel`8@#F~Md6U!S~H!zxt89Lb2id>Iwf>(}DRl=Df6}7)hjC#ux9tha}s>ck*DY)f#
zjJKonCl1NdWPS^G{bFm^(644Zousq2^NZW2_be8E8KRrA`k>%tR<QZK&O7vdg2@+?
zr;gu@zHW8|o>*bC(n!_pyn6|@Z3b-g{hNaMP^if#f>L^LH0Tr7B^+9Ye%^brnCtUZ
z@i)6o3iQP|lMOlqNT-tevwSp`yBnb2z`-=YEUN?WM{LFqejjGGOGb(^9^|J4WpX-%
zB%!HRhk;*J8Wv?h0W!VS<ePGAXY9DlD;2yAW!t*At+L0pJ%_H~?4Yr4aK_h|#KwVZ
z1R!LT5rR%?8Et2gqb8nXie?Qtu=z3W%{7$pu7UoopU#vKeClX7`5F7T9R1gM-{kfQ
z<BT8!{pK4x2Tz42Poj#Gq<(In2<HP1Mn%}|CiSJE<*Tm`$bpq<)S?|Kk=s}BFWWz2
z7cp{wy;o;oXLSKh?)}R^7x=W^;XO(#^k(?qXBNM8;Jt5NjQ7dd`-Z8s3>f*Cq2=HH
zHrvcKsB=4F%%R_J{MWyy@2BOD4OS}B|L}`cB+-R8f(oHgB3N5>!l1F=f^YxF^35~W
z;dt<!_OK_ilS}^(G7MYp&Fb6n#_FU@FJSQ&>KT;OE<$m=#1J#L4r*tg45ZNVV@l+Y
ziV}Ozh96e6)o+V$K499U+6{KZnIea3#pllSrCYm>)#-N2W8d_io{V1AeGe6#y>!l^
zwpT2TJhf}&sU@36))!Ybzu)p)Y^pkcncbJH2KzJ1iRr0xeY(k-MihJPYKZ4%M;n?m
zUVVzL%Z{BFM_~LxD39m7?EMF03(of|@ou88&O2*YpFaMdgSdW3$zb;WvV0hPb?wf#
zpRh=xG9y1?^j?X7fuTE35;m7!;oueCNi(6?O|b#-ZM($wNnNqsc&Of!@uXUUF9FA@
z;qxvta^E9Wx0f$GdHL)W6c-qQontT@z#2gyrr!He4(){OU*CUuAUccs3E%X4(oO?T
z{2k|Ij$Zq6?IBQT=TE)H%hpYimV5bYeLDULqV0h6h|vUP<}9L28zJ<t*YRi2&RkrR
zI%OY55eRXr{f5K40_|;s_?FFDbKhq!)_B!{v(LQ0!uLrBHG4E#=!D%H0@goNI7<vP
z`)6sF6}F8l^{YZ?{oz$utYERL-6=@FlPl@H^ZrzOp(@`|l>@2b8~(mOvAw-us?^8e
z*c%BBtj2e36>EmSl+aaH3ITJRb05IbzBvP#gaFY|mH$kyUxRI%@fRq6#BEl7K<YkW
z%GVXYnF8}JtFSgECRTM!ZqKQ63I>mTqob9S<8IoH>mL`Lea5OmPSJOuX!pWzdM{bn
z%PMMDtKF<T*||M4c6y#6cQRPa8W40mEdRyC>wV1;P~q!F%Yp5@J-);2@&@Ke4w~0r
znfGGLb$QJn`ZF7s6FD92h3((`R&M5n2~sy(fqr5<TVz)ID7%26fHJ>nCq~Af`OJs7
zpW1d-mX!aAm_7@bjLuOC%Tr@~>hpd8WGqwNuI&Rxrk(ZdkLfC&(f4N$4KFQap^%kT
zV^;5&?`-X|mrX(6-lSmue2LthPKIus{(}XOaOP-|84#V{vv)PWjUsc$1bo#<L|+eB
zWxvH&F?-}{Mp|uO&x@i%U#%UC*kZ4aZ9)iumA=uOdTkd8E!+!apY!4?fqmqhDhYRx
z+Ft@MJkL{6+0gKws2pd#_r2ElUkuK&)VzR&jpzLN=p$p*ewU_3`x~~r8@^{O6P&lG
ziHR~Xy8PJrqnUoe#Qw4q8DodvjkWHpJ@5DW=nNRfS%zV14R}K@fC<zJ5bv+~_NIYp
z<7MewUQC0R&EJVHi|W4U5PwZby}(d1`bLJSIt9Y&fI+@@c^-CtfyEu5D-^!Da5~-E
z1gcxmx)=)sn1;`{mp-o7{mNb*lf$J)VRyP0>em_0=uCNzFFd-nYb9%k7!%9NHK!e^
z%^_V?c`2&;-K@M&{KYUT%Tn}@mB~@bn6S0-DYZGn84{r70&G*zlj!h{nhKrzs9ovJ
zf%|~l9F?b;c!QrA!P7RJP_-F(Cd_Vab}l_#l@HvUq#KLfU^r*wx1h=Tdxn_D@-eyz
z8H5kBr?7Siuw=P9Pi^~@_UJ`MR5_gAX8T_P`gZpJ8gI&Gh$D>ui3kt|w{J>fBADX8
z<DO%p`0eFr%tP^nv!C#%<+U*$4qVYZ38fH?0RKH?$6vMSJpx{`g9zCNnxBXInwB=F
zV*b03pChKg<ClveS3_c8Sk$}qTHqWO@Pr?~Q6G0OeaXt7T&mXiuIU33?-0O<f7Ly)
zB6dXlt6gGOoVu<AQc_c9es#un5QNF`KUfefQlsi;EfX?<MhNt}rq=9UMNE*-Z!EDU
z@1x1iU%C1L)XVhlUi=T^Oye(6qnH4)`TI2)FP^7SFiyZv_WAQij2w38gj_=0V^r*7
zCrJG!|4771HvHW{p4t$Ir?7A-hE;O9nMIWazKF4YBXVxCj*q6TcCmBl!K}$7EB6{q
zktGsF@IwId`Nw;nvAGbaFMY1V+3dVG8`hwFKj=NDfn6A}v0}zZ@cwW$16mhpJrU|n
zAHqL={77bSmY+hdA|!Y`hFOk&{yvT5m_gG6Q3$*3E~;HX2}300DtjegUl^Zc`*ZwD
z*kxYNJ#in6i9+i6CB~Y1NYnwsQYvBuK|h~-7tqK(l8!1(?Hc;>1qe&+>0XrPu;olz
zBOX?B2+mljlj@L-QJOln+HDQiV0!DzzClxAb8fJjT5Nr{56xCs&rCX{{5v%h>ZC(+
zTv@28^qqY12`eB9`d$i~WapF@vk4*Pn0UXFO)7eue}LKzb+(B~NImWQoEZ|(h^B`-
zOVtg@f_{JiJSYG#EX_tyXI>qXFn_?N+(BJ&ahL^Ye!m~k$YDVvVT5(35lJw?JFz3P
zo-)A(Fs^nn5rqXuP!Y)=1o<`Ba^t<8IE(Y8vrJ`3!vy#$@qYXRK(NS{<Qs*bzcMp3
zZw>}rg#!FfbD@kJ&EET}0HuD3pFoMeW-m9*Zjd?S24MUd&qx7Ad^x^gAf+EfB4pd=
z<8Oc^2mQxo+c)kA;wiH~Fc;~`;6@i4NgqP_wrcQ$+SNnfh-rU_HwcJPHv>n-##_8E
zS#pmSRK)9&tqT#>vzMtY!;nl9->mVa4Na{5xj)9%#WNSH%{f<Co4=KOGVnVepQnWb
z`<)>xP#gIUq5}sYdmIDz+n1%9-*Qxh1=VMMU4NjFW@j1i6x6E0f%(|s<hkNsQb-+6
ztVl2YUDkw65wJW#>Zs7UGG+5E-VU(s{Z3|m@Fc+hiJ^<!xg2+W6pfVTIEPm|#XL4>
z`F~`SZ2Wvx@caitgKW7^=7r6ibd%5PTV2;PWpt8q@T)kgTGmitoIH6j=+4?FPM<q_
zK~x2tJ;7Ui8HcY;tX-Y{60XSFSKzF~@SG;=i2d~A3@>@|aixuukOWuvxR8W#4I{}w
z8M_eDGu`9cg&k8MJwq1Q6lvUqO$adddn(ynA#=hV0BQD)=5ym3XUS+jHI1b+{iZaH
z`SM&x=T@XrnstA)LuowIhK7GFvNA`KeNN~@W0{!48+!n;VIL1XB+KSYq=egFtC598
z%cY<vr^7Q*N(^rz{`3T^8nVYrn7gQ;x>L;rL)D8{kx-^|`Q0p7tPh_Gp5$YW-FJkI
zp+~HTnbjTSb+CJ@r1fbZ5#AB9iyF&Y7hgLtK+Kz$XC#x&ls_5Q!P2e~L2(0xIA3&A
zVDHZN^|R4MQYK<xHdFYg#19-J`M7`SG6of9kuqD;Yu>|!9sE*9pIgA(b@8&mpU$D*
zCOo1Xt^Y%!4e*4Ssn63T#BIG!?3n$*12BUt?4%jtpNDvrcp!S4{$#GOx=&BON%J1&
zza50WnwL!f=M1vK8A_O;ZLEh#vbQ5nSfw!QR21FkA%kLAYOzdKF@tkCyh|oo@JapA
zd%OO)Zn-i`-OgSnAZ>jI8s{QEjto({c8T{b*M+QGHR!!$-W3bC7X?^#Ym~#H-fBXo
zL5Gc3he;Ap|EBniCfVImpc!$Np=N;ZM`~FpvmRPu=W6Nwjo<U<&yMOqOo$(Y`3(5c
zgS_o!0e;l|1G7I+iZNI_Aia`~w><Mt@H5Zk>4%>@8fp28m-F5g&g3F+Lc-;z0nHR3
zW5~&tXbrW+_cf=<Z)+aJ<v6SL$*GW_z!}t~&_t{f6w(+!%!X{-Zx+!GmCx{eP=(@S
z?(?z6?@v$O+VwLPCNz?XHVio3XOfaotxcEsC7;p3s4k3(h+gm|Pl}<^z+W5<lzGQ9
zn4h%>1W^Mg4QL+Mjun)VR`&OyAB7%2oI!j?=oQk8Tpox%q&BBJ!95oH&**Y1Qr#lS
ziS_hXVGtNP%2Jzr;xkI}S$YET6u|{Uvl4d}N*NSgtT%0P$l=_PSnNF8Q3xWukv}m2
zTPo?u-U|YzX4o(Fp8dek>7so}G`Ej_H!~+{G=iJZOk(MIMEcZ++P@oX&SJrxP~kI0
zswkc2e{G~<VyUYtGe>uwIyF|i+NqY103IqqIZjv+@k05-m^YBwB4!1yA&X2<`Y;_U
zljjiiCkn7Hss>2KgfH4gM#oq)Jnx~BwS`K)hR~wnkwTx4^Vnocp5T`Z#_$JMXjD+>
zCJN0vmO}Hb)6f9sxRN>=$eOzkdna{4p^hg}GBqVM)YHb;)Expe!-DF23!2e|st-{0
z=1}!Lv(@VsovA852!H!-pkG7-zK(eli)H>5s(yw;^j}6>?`P2aprGbDY1cRREr8#j
zQJs=CLCN2%<hh05oJPsim=K(oxsHw=x<1l!KKu{}`+$eMcL`X||1NF084anRL)F&g
zP+R-cmTv?{S_pP@snNG75XiAiqwO@B`pKs~OBecN;!=trjlbjnI_k8R2w@wEVxKZN
z@2rapel;s5wMFbGQunFuP}Gxewp-Z7f4vNwM3m(7BV2lb{4L1>YGwf0K<qO;g%m!+
zh?4;RY+a2G43^xvh9$k>D|B&~-d`nVlVbdts8Ai!B)uCitk|OPC&hOH!roiO=F*bv
z@$rTL6Y3_Po_6xdCy?J@WSD#smov((z+RCJK@5v}|3EWI@ZG2a>xOQP+}$A-zK3xg
zOIg-k`2f{a@V3sl<JNmsqq&d6zhT4#gj+~jb};A-XqJX<V=huZfH2&t=fbXtgD+R>
zi;vIpj6H(@s5S&U;cWUqvgA}swq3)O&t)@?037V5*r6)hcFk^9T!IU6xF706!_nE(
zi8mPWCwwi(UtttQ^XG`z1I7o0k07w1!&K67f;IEr&oiQ^G&MK)K#i@J7!M62aiXvK
zP2Cmx_@?_<GiykZ3FN^XqBHFKkrpkX4XcmEhQ(r60sF{#3mhE26;b93y;AQ%8pyMs
z!BpZCug8USi^;>29sF71-7Ug<1tOrqK`JC*?)8E3Ca9rhq7O4N7Npz<$5{+x6SX^k
zu332E0$SDy1hnkYNQrk0-}2`+^>}EQUreTJ9Q!VJ@uDzXnz|`e;67Ri@&^sQ%%##d
z?3A7xerV+L@3w0`BTlSLy-(6T8HZ_O02(dEV>}%hUhyh`QLq;A*NC$9a(KgM+NlSc
zs58YgKu96z;pl3CJS`1Lb>B(S#`1vPD$-lvS>fkQd!<!^sw79&`^6L6ylZePjCI~u
zE0|vYBa_Uc*K_zKnpEiTxU1@VvWF|d&y*eiFJ!C=AtTAuZR#j)p3pWXx-WLpvzt1)
z#d?ldQFL`%$sU_JN@6`%6isOxxohzXx{>Gr*#0sd>GA}1X>(iRb({}8%c?At0lx+M
z82nb62vGAYMn?DjPUlbANY+ZezR3$(dybkJWUBd6L~_=7;l)bCMEXo-l=VfQBMpw<
z-b()~>{gjzKF3=DcSKtVVctkNDY~j?A`Q4kw$^R}ox15n)FsS%`&)D(a=W$`xcO^q
zG{ah8-GLXOf*l#x-m0qJ-_H-`yRFgoGO2tqUbE9><*D!ZQ|&Dt3CNbVb`ST>ZcJSr
ze0WSBK8`=H4VMcvX{2Wanmp3*v3CpKNt7;EnG$BV;p5ilW_0I{A+UKgI|9u9rPmuK
znFPoTX*Y&6-$b=9bHBv#%R%?q=UI(%6N^r)fs8V*7)odL!Z$R1`$|Ku-2`X&7^|c*
zRC7kO+%huT&FOIlu9^a%U0EFpY%=MY+oTyX`D4y(brbSrbQaj~Js$XNdXU`gvY(Ci
zp}OlZe{3pO33s2@Zpb)VqRB(Y)4W8H6XQ0mkKz2H5{}%?(b{$@0_wjdC!g2dc%Qbr
za43S`2a@?35TnZ)pumiY$mIq{F+4tahNBpG4nD9Lk@v#G%(EZudgWrj4ZA7K;@Q@u
zOK66$oGPTH<+o64Wx78+kV!?iA7s=3Q6(ASiaV~ra)?3+)rpt9slyrcy5x}N9|$e)
z02ybvG-^hk=F9vU{&A3Is~J3H-ZRJoa~-Jg2^EZ)!OwOnb81EHyMcsOH*chc&Zh(O
z%f&O*khr$<PfYuG8{3(Qm0aTRf`Hdl;Y%$$2h3fyExxU*InsGq>xSm*#`2r<ye8Ef
z#_4c2cD!<{{$(;-;@YRM&4dHU0$dt<QPk;>CvUJ^Os#cM)7aj-^(LOHV@+e(NJ>YK
z0FO>9uYJz5WBC1x;DTmPLsF*(eUga{3QpE{O1-CP2n9ROdP+0LA$mqoXYzBeVoa%h
zM5HEkLm{Sq5KlZ4Om>kuw_X=oA9Ar0b3JZ8#n&0e1C_*g5RnK9^6ffZv!$6(koWj(
zz}pn-8&IdU@N)~nHSa|wZ_U~2J(EZlxVgFB&ckR?jF?xFy<4A)Rocn;HjLXVe0@ek
zr!cjhf0{3!Hg${MhwSPj^zDA)S6VvDtanM<L0pp|6S?-FrepgN7`@I4>j0|6F>k$#
z>I77xdrm$cL*XWh+UIIlPfBl)+H~PS7Z0-YIun0aOrgpWh58tQLvaVxu~OV$_!tBw
zGt{25rg!h!H8zf;j4Y?In3X1zi5;mT>ISGEdxA<guMiJxYs9i<{=4L-qa3}3%nQQ#
zp2axn)S1Yx6<Pk+MryKn)hJr&<E^BcD`0aJ_FrdzFid?t9Ubhzts?F;NN-+X%SR1A
z78xv0M2G0*-)OEP7|>}an6&XuWWU7FH%#e9nm$1ql-VdG{u%ZOBer%i!m5ECv67)1
zV=rqMM*~mmI)kP8K(e0HA!1nF5qJ_L1fJC4>}7(kBcPZP@tYc5fxlzJX1tw?!t|{B
z$;9kpb)BV5;k6T>-9gc|v(VjMAI<2x<{@@#z$vm9W6?g1To8+~{Ep2_r1dtWhfa(7
zEq_sgeaP6;)guF+Rl?qXpns<TBxM`-ihr0<*o#lH3DmlO9}agZ?}|O%4k}D54aS6#
zFuBsH`QY{UZT^Ut?J{e~A+V4|EF^0DYA?|wr*jt%o8oSs9d-rxNf%*0Ul?iG%-@Bj
zVgtqa{0a|H0eIaM%m4G=mspl^r1fW1(pZNa2T~-oI)tLjcyfT*zXtKY&fMBn4`oH3
zS|h{IkFR!N5;WT2A}!B?KCO^eK#=JLPR$x#KZh$wYW|DVE>mw;MVF>Z0#2s;wGj2F
z=09+Kag{@+zdHWXc)0k-Y)sLm4w$!U<~B)8PA!@JMRsV82`FT>y`v~;r)CI>jOo1b
z48{n#okgSh^BCA~tgkq^h2@RrQIc`RBHEA>TAKQ3jr}l**6jvb6E@-C$%wpU4MMLf
z@o{z&jHw|km^AULF5iBc*Pl_(-%mpi94+d<N2aUuN5;*UK-H1}#8zYwgoN4~qaje`
z)eJCj8r2L^SSDZ`VK0%cY7;xMw)T(!%XBjU%FmYZ*RTEltSgOC4X8zp>x!Vi;W@7#
zV?e1>UBlTZr7HXyq`0||sm_ZjV1~b4tLPU?j>V43d8RVJD|}I9Vj_bIxjV?(&&4<$
z?u^$5kC%bBQof4N!JW~pLQ%6Ka?jG*=Y(B5J}Zd#YyQIRqfE=Q_L(?|_U{d~f5Nf3
z?IYe@^LP8r@AG+BzlQSZW$@$>1ubtNY?zTw>T1kPD5IivU2H#L<LYD7nYxJFy%fEH
z)|ix@$Bxs~SphbUG<-GnN<Cz;GDn|ieDc*bF3_<P`n(8G0{UEm_T346{u>Aa`V=7B
z(PyIoF@IV8+lCER?~>E$KQBAxT=m3wBQ5_Fl&{0KUu<SJWh;1h4Kp#_dOx39H`&y4
zHoRI`#f)ZF1Q&cDHuH_E8{!USvDY}oSVT1}>V1<Cb#~hbFCP64XwMKXFLr4zNTGb$
zjp$HzhIsKj5YuSaD%KXYHtQ`!dMr}DoFl;ANBej*kE7H(W(2@3O<QjI`2lm$&H=o)
z=+t)el|zpi789-e^V}1SDSC&o58~8v1n`MNG-^;oASaI=Z~YW<nHqEqi9J4?$$8eF
zzYKr*^W*p{n501D0PbDvIQ09xA=SP&i37UMAy}a|60-r9c=wOP$go&}Lq8@{QI*Mv
zQtu~NpXPqatWtdr&3}l-#2DTgL;XSY(d;si%}`7Ql<)X<$tO4y*^vO#KQW2y>iMjH
zrt#Rsiax|~3}t~K6iXP(L&pW1N!Ni5kz`$*qcB?@g1%BuXiUcnrqo>lbJ?(bq%S=k
z1OT+lZ7j{?KzPqF-embtp4KoxfiHf&O^^i>v_I1U47JZ`OiU3VNC<sOKtXDe8s0xd
zF@}y3Z_p|51Lci6RmHE+ksUZw_}&Q&9HG=jK7cR30{+g>3nGufm{5HU;?tRZQUu9<
zi8bclidg8tpy>x{9T{f3sf>Cv>8A7LeEM|q*zeELi~0&^g?g9#xBh-80pjAv8Oo$y
zWc&WcS#Rh!>j;>YtYSydCaAD&q_5vbWx1KxD~Ztfh6qnzuzV6M+Loqfo#PxNReul#
zpQqn)$A3KIe<Wx8!Fp|wqGI^Hchc6by4ZCFszXQ!#&ZG~8*^a1i#SJNop?XdBPVeX
zg3O?I*7eW_BL~!pU2o<<xc)dGd@MV<u)%Q$q3ARjGJ%8P=NquR2p>eDs~UOU&i%w^
zUa(~V1Psd%W|{)sKu99a(PQCe;{!2{PNEPaLFdc8H~FMvu7dRwB=&J&bSI7y?Jc;5
z(V3Mc;^f6SEWxs#NHay=O-J~$6BF;|TJaCQQzf(Rj4a4iQN?HyxG_?d2AoLSc5U<c
zjk|)6={rC2?^Df;R)h3qgBxTu<H>mC7oCh~dTzd9AxP!aFazY4cpE99k*^56%M$P8
zasO?+FE9%^<GoD5NZEmm@oL6vW88a(W8CoofB&K5e`c#9@si#7Zo*9oSa=YY=Tn|o
zDfRH^=_o)+!OYxPB1T{-G7HgsFgpl&6Qnp|#=$w-Z;HZ5MrBh#oj-;BwTiAeU5Mc-
z%hx7$xQg0LgEP_bMi$|cSnNh#_O8@Bm(Vj~SFV2_rna1^wG`xbUq5B|pF%EAtrGq|
z62haWE(-?n;_nmb>gR>>@3ycUm8$bKOjafw1m6Vg7|H=$G!{Hno!v8h0|L!YJC#N<
z_G^ZC`SKGrA7;8i8uXii{`i%GRze3w|1eDS<vJBBiNAO~nl3pcxaxGoQZOI9F4<w1
zhtOrRuPwN*F;xfiyhBEq_aBg-?5nL0zJ%w)y+Govu@74K$0X9V(?8YQrM%4&CS4Yf
z0`x}$&<(vl=sl5D))lHdB-z>#tcKFk)Z(+UQuRbsSYd2k8PEv>H;Q;ec32pnH#UVO
zGW?xgPmoa{1KPCrL4<^G;BW6hYWN@+XZxRjs89$Rb!C=Q9|o#<qWTOAm{kzW1WNTA
zS2Fnq%o(ne#R_+tJW#X4IOF@<j$NHEO$Xk>#;oc-4VVI&D$!|2MGH*XP;4s0LJT=s
z!}GyRdVHBv@>+bbYR?!zkcA1UELBl{1);=n{T|0N)ujZwnll{=npe&W^j>;8^XDBn
z2vV`slI!?o4LGYSWzked<xL-xnZwMC(^B85!ML&xo;T|ltd1TOn{P_n$I>}R^OoJJ
zF27lE6C||D4Ag|JkdjHfgx08pzB9p}i_dfus5PJ3b<SjyV$poi|2^2_2*#BhxlMtr
zlHt?qP+jgE%H+u;mQms?EyQQ2iWi@=j^zs-uj^aE9Nt39h$E#Vi5W8p_eL@A1wWkN
zgw+m|k=ZjgiB8Le=6eFXZ}W9!&U_632|CTA%e(H7tzD*x-E=+AW5MZq>7;_wH5rq^
z2Iz+3{e1{?Qk6ebze8-=3D%)_4C5@B_tTF!lR*TVJ`S|y*gN)JJYaTBdOyDB1oX$H
z9%9d85JVOle-n~<i=d5pUwxxjU8>?+BhN6|Ayz`zL|Go1|15IZO;kwoorIQff;v@H
zv~gx2CqJoYQeW@|d3JVbYHuo}R`JCJ5`e*|h%cuwUsiPfznpGR*OIc{yG(J`@(bak
zpndl_?kqL`vHP`*)wWE07ij+X_5bYGKQdGQp#N6CI(e?YddfJaQGf09=)sXckBlCC
zP#5Q;?_R`tt&_n`bnO)W-@?BK1EIn891+v_vTCEW?e_!NJO=Y67N-6F4!*T-S^b37
z4<bW(>*tyMjKG)C$FJeauBV;2q>K+meNHQxe1wAdz1Oe*$-r#=?q8$+nbcpqc<q<#
zyz9Hgs@AU&EKQ-d{!CytJ6r45cD}cBczXKqbPtW^nw&OvUVkMXwqW?qH?!k8qHz5}
z`GyrkAvdhHyAKv8#FfjPS%0*ZVz;zDjQt`+qn$+>Xg_Z>eaE*I&-kXT#kDh|eUQDT
zzG?&(@%**VtxLcD>iV_yL*KaZpH#P5zl)~gtcR<i(0X`oe=ieubq<aw2NQ0Ew+<g%
z{T;M@e~bB~{??_}`Mtdr^mb5QZy|h24h8h-3yWzq<Wz*zgArIC)>d5WKwm0kPXJp1
z@vQ*P?1cLQ&FwF<0meVb;jjKQr9iV}jheb4(^MZtm<>PI(4?AYJofw@>!RAcgV6qp
zg7p386C6FfU7ZE-z#I@m<JSb_kKeC<V5t7v$A^cQsjql|d22yDAQT2ze3Xf?@Szv`
z(XyN%je7ZkS?F46JxLRWt^Y&Zy9Y*9T@BwSVL}cXov2Y$jXG+OL;({;B@#6dt~E*o
zL@FSJBtSGIn9Ojo2*F8!aSYPh+Pk%_ZEdZsPalf`ECix}S{1blh+Mp%aZo@A5D3is
zTYH}~mk|2A&-ecE1@@eC_St*wwbxpEt+lTws7DF(`7E~n(DbwQ$5z}C=%>u6KpGS$
z_k#qIyt7@t+ZEmp-MU|YzZ7_<@VkykoB9gf8{^RZfcc02%<qK$dLID=p1;eE)%b}7
z5K($|%g-<AJxKnx-m&~+{}=iHXy^CG(doSZMgAFf{_ErLe~+=!7ztwd>)kc>B(Ke{
zKIB)NMc||D>0AM-rCZVWa9ri)BmhrnPl`{Dyz1s@ZNl9V`doQMj6T;VfQaE|x5otj
zEOqk7)$btV?%ma|yY@VS{9WxO;}oZ{mp@aGPh&6nUNY)a&I%eBl#@Wb*#oRXC?n0F
zDA0D~tHAd49ha>?c1iB*fp^w_d|B>0xo?c!p>}M3bVGw2=b-d!y7dG@`5e6B9k0HL
z{1+NI$I8s%{7j*_qZZEw6`Eb1)9eON=0HBJ+}84?cs?jx7-m`5;7yW>b{R|H7yuGk
zTd$La<m^0OzMXO$beM_UIS%c=AiJ+P5`Aq)!X`|AT!{Y4k?4zl%LJ>;k5ZOVfzXr)
z9=`&wmA*9(@Pf<6*w9ENQF1=cqS3hrISS3*v-(l2$o^7f|HLBuQe<CMWPhhf*{AA%
zMNG@C^&t+kkF>n+xO_^hiM&$5!~Gcc`te$Mr}YFXOgVkL`;d3)11k1<leCspVFNi)
zL+Ps<vUm`869ao0NwxgM?UyQSxz;;tHt923uC4Z!ag*6HWx|9Bh`|6pgDQjYSuH%v
z)aXE1P(*|W?Ph)M5e`SZeFb!;h`!iex*tCsthhSB;i}@OGk=mP_~5qFbS(GPim?NL
zs?*Fd#;f}2{d)O_;ktIZq`r()OR@J3f<1e5tt0}roc*opjmPaZPN7ABuZtZsostv`
zZ@gSJPQbXV!^#{-S6IaP!>3=bv+)u-QnFs>PO0MnCLn|}>6dbqp`orF&GXRvv?4{2
z5hOnCS{+3t!Aij1A}K}o!vEG<XMFy<j!M?^S;9(53?-fxzexySj|eytV=a{z3L%#@
z8Uz`}I6(W@W>2c!7rFou*YM-!57c}kJj`JJSrnUePeJKs0j6fXUxDF(+8!hg;PwZx
zlL};3=v72l&zH(hOGmlI`qF~#0Xk{Ih*=O)&=y9_O7IHM5BP^&#y5hZFUU3qzRPtv
ze2n>rdjF)F3evNUcEe3`h;)tZT&BjA`VvzWG2LpbcYA-5;O{s~dZa8Z+U%tkLD1-8
zt23>Qcp9QXqDpxBSw>n^{qCS$NQZ@xy(3F{FjraIpe5jxYh@~Q9EEH*6np&u^sqWX
z-PSPMZm2+<ZIY<WZ`@!@jQGvdSKO^|yC<I$Mb^ldbr<jL^w8~pF+2ToH7Tmqh8(H@
zYu#`pwy6(+X|rBtfJX+J<eLVudXx53I@46|BGGFXIn~RgE}2v>gX=|Ll@VynK16v9
zgD!VBhLFc*{VaSNe=#+Nmx4ScG#=r#du7Tpwi?{b_t<wJ^e^;Y)|lNve)bl5@>_X0
z&V$|2x6a9uwH@a*GJ&;(#LX|Obui&e3l?O1-2Na@fc69qE=yM`N+tD9X*kxKb>F@Z
zWmO0_jVzf0?lIsBBL22yS}|y)HS3bOHCr|VOXSDeAgx;(vAxZw28E^I`kuAfB%|6t
zy+W1?37u8bRclEkermQ#9jc_YQPY6bw3wq@&)3h7s^?^PQwq;5a(2r<M{3QD+^wTQ
zsgdP1kIP;R7;rALg|beG^L*{5y`RzamY}>Aq@4_s_At{DDlH!rw-dL?R0E1i?}eaF
z>z=UzzZOkwYcZGgB#C1yd{G2?od}SB8BHt_q=-~S;?++BEOBUq#I@1H=_D4exU4~f
z^pCnjdT=zgEOJPxPPLiPOLF|YyBzLl4jI(a@ONBC>R;Qb9ntw>tV55iXu`jfP>ng!
zI*GJ4MALW>&t=y@PeE8-{gI@r{shd#tv|eJCR4~DDdHo7UmQTvv$C|Lht4^{@T)!5
zGXn8PZG}GU1THxbGTkH3ZKR2_Khg6)hXyBQmnsBMI#)4#BCT=>tx`4cwd(jr(b8B(
zCa_5JEiOsSZ6V@vN{ERE;-u@tn?5pf8y|527903YXG^P(3KA)I=8;lKCAxmCokcC4
z(uMA11a_5*wq4<WVOa&zUufM4ke(1oN|r@fRTgh{*4i|?sYwl104xEmMK-VzU4ab;
z*eVe@JuBjj(aZQNa7K28bCZVCI0NI5P{5_-a7wulPNl6dW8PXmz1i6bH5SlcGlH2=
z-;Xe0)VJ|&KqpMmv`sq&^a?=hGZAxQ@*K~G$AO-J-$EPu2T)1lf=?rOR02KLK&1xO
zbpn0KkB&wn4%U5JL}rnp#5G8{T}#<)llfIjN#NP;{(!`+iRUMRU4EhR_}uD?zRo!<
zwh=3)c>gOyZ4KDgBHU3$7m5ER4GFX_^&o^BL!37rvGwO_Y1l0)O`K<Q_%f9acQsB|
z!~=R?C-^IX1nwU|G`{e7qTV|dMr_nawarOn|7B(B)o*Bm3A{_y@$}#l*|AT9k|yjl
z>)DV*9kghV63h73qxv)#?SJpNgz8Jxpx>`AKgIw4&*zt2dMz0;1cL1^?Yz|SK8O$(
z`d<kS6z74R?)-zd9Ugp$V=5B+2;7cMbVJ0&fO3xP<grd3N1SxB$@q^_FWM`JW7c;>
z<Hl25&KeVhH%5iY`mu~Gs)ZrJxHTT=KXKBP7N*4gxH5r_;jQugZQGy0o6-B!vw{og
zojUGmVYYP~A&IFyB0jtqD1~C0WIae+pWvK)r<b^#su%Fy{a7P+DwT2@MM{A%atueK
z(I;FuNM>gPyTZwVT}rN-?^CC#E6<p89@43JQNoH&f)6tm1!3Qt0?19RgMx=bC*}=X
zACQPuF)??62YVk!m+@yA-%`3BOu)tyL)JNWgo$Jbm>~|wzP`46DP)Lv3q{Y1<_Sqw
zk87muCVTtKs@hTO#)(jA&&FDYV-@UXPFl=TV7J~ZB9lA9Du8}R&B=t{)cYY&%|b!-
zX7rWxirbjQx}&Y&=t8>3Q0}0nT)j3vLMT9dQR+}mIvIBE^`oHNkp*vto8#=^e{LTq
z85vL;&$Sop*nuq8Ci6x#!(&&oK(;>S$rAN5+I0&}J8BM>b&Z%S5w=9c1W3U36YCH!
z>yI&l!D{nsS1EwD5&R=#@iCbs+e&S}o4jQ8%fS)+Xy%`C-i10glrEIY4_6Y_|D0{t
zY9$41{|5hGPpK*jQp{*ojQ6|Ib|)xbMA`(Dx2utv9==x+VtY(Jp@zep!Eyl}{*4-}
zu{C@dfMR&t`ujig=RW*pO-R%MY_@K}_JEYS&+iW2JxbbTJ$mc}_-NatHfd3aA~i&W
z$7_gj2f8>SY3<IX#Yf!BA4Nu$7>6%Vq>%%iRpyfnNFs8x669k(^ii@7^kzn&W4%3*
zULtdt&F)?mp3P)y0##?>w6h8=;E$X9=3cdRHNG6v*Q%B%$G}^(%gn%5lw8zqu4E24
z0q(F#O6+b-@I?#?bBODuW~&!SBiA3(k?K-w)A~gwf?vqo6=MKFc-%!Fb6$b$h_sKj
zRZ4g9UbWxgFWE&N)uGGb0;n{lwr!p8DwK}VNgB24F=bkla%}ai*AF^o10C>)$TF$g
zVrv#|8>mdv^2gy<G*<M*Vay&yX4nVGDrJ*=Hp+&s=faz$3M-uc*!IA&fK_ZggJ%$I
z%vQK+?W+{A$l#w)cLfK1?@MN{=w@qchIHVhmby`@Eg`a(4^Y;<Knibn)PX8`F8vNc
zC&ck6jw56D*JVG&_`pWwH>=<sSeW5no`zE$(*|_G#Qp#5c4Zo*rz32Mg16q_h4SpQ
zN3!3#`ly&Kz7;A?aI`7dV48=X28>r;U>0)saY85#8<`=16qjTLHmv{ZvgWL01?`>V
zl&=PRtWt_TrG!C(k7zvI_t|g#ob}#<&sacemJ7Q@^HHr6XdqozL2#Uow21UalHHBT
zP8HS(K&M>E_dYg7nWKI3bc6vB!8RsQ1JqXqltH)tL|R>j6l|B#NEwR5UFrFNyug^-
z@}cTCLKVG0bK+jWB@kTJo6}~84}yH|$DbBiL<BUtAou!}Sd^BQ7o}|p<%k+VkKTbF
zpY+!xRdu*M>ambIG|Hi<vKjlWk-EU11>uKV!+$8)y=YjB3pSF!AL6h^>TDOgg2)i9
zD3XB8YJ^#>m0gXSs#lCrXa=ZsOP`5gb4qc;iR?D@B~d&C2OBw)NMTptSngN3M+-K%
zn`O&Q;H&1*k>=VYK0@*(m<+0hnvWgg4qrzNk;H5;_<66OE{Iy<LYDi8Rgk-K_4lmZ
zN?@9+T`^7fKjJ0p0lK!`f*8Y#5KAf4uHEK)l15XVj1Wsa<D3H!+i^L`aGCA#((%eZ
zJEwN)Az4w>B8HfTS$IG(Y7$X`rz5I&V~f4f+-%7a;y^yD6|qUMJhw5@!N$dlq8peK
z-kt;O1c$u{)B@WA2UKIQ9yu<g)km(zmaN2`@1V5!FB7ylSTod?1vaW_NeynN6g6xD
z(wnSbnNc-LlNf6Kz+?z`2Tpo#Ti)F((*_j>dotLR6?83ImOP~3ms;r(F(*T0sDSx{
zx^1GxOV2@*z9o0l-KQ#C?e$0feZ3)&&2F;Gt@$t6nOtQ23KNi~S`)bbnt?Z^HH5&{
zfmFa>5d4u!O37*Nl^GZ4!N4?3fdClE_@rEmycZU*@2>7$(f+H_$+y|DA4F`%vUJ`4
z=hzqecTy=RCZn)whXU8E0KL1ru&DO(1srF`9@yvq=wsp&E2VK!6#$$N|1CO*;(Bmu
zh??4X)#|)Z$A}DVvd*T8O_7CH<?nFtu`5<=k8}xM)@J0YV7KoxQB9p^om!Xp{uPEw
zjds(`Pc%e=&TXJW?XsnC5!gkSi3jKmR4e~q`n!3TYE?*5HBvtig34&Lxbac{hL^G#
z$3Bj)U~Jl=oThiZQ`bJMS7Ez?#j1<kiDU%3xFx{_?`8NS5$^<l<fOMsv`%p7!F0jM
z&NRbA8}E|I=4b9^A&Cf#opw++X;(cVNW{|21&Q!af<xa+51yC1r6{hXhZzvoAC8ZW
z&#P&#w&q6~432YHgoUP>X5fQ4S2qv&wg2dM=B7omn;JZ(spwU(OMMS#o7x3ug0xF0
zW&JFb8W_Qh7s9Vwze<sN_e)t57Jq6mTbVFFahPxZCi~Vi5k(<UP!5=B(X9SYlf&;>
zW1`Q1Vg*&W)w(S{3VR%W-s&5T@_*_I|H{gWK9h^q5`NU`6(2<v)v;sNL6?K6|5H=#
zC$#oNqsW_1!rM`(Y<K#R?2EKEsJ9_j$vO5?pC{IhYNC<Zsww6iA&1s;m&WU-6Fn03
z(_KCPAN11;X^wu{c*g1UQ^I+jiI|-OW-O?OrUtSUH3`Qq>7wNWj0Ecie^Q@ovar8+
zh+-1VmOanK))gPX`1zy#L|dN6t8+^Al;GmM*>K0+2+UNiK2t#qGY$V!yxf>2BH~<`
zf3e59HzxCP>SL4@=T1C`Y@_7QY59Y+1{+K@G!Zmk>?IVD@)S@x_*1R_w9kVRJYH6+
zS~TiUE~2PH_7b2~R6Diqrog7J7e1(aVQLO&__EBRf_BPDUvRJJJjr<Wd6d@1Cgp-Q
z@A<1<(XCPsJn(iudbznVJBz|FD(Q8r1pM#-s`oJb673TO`S9~Ly%YwdID{eVs?$Y3
zja@Z>?hgI!mZ?`TvF6M-+xqw$wCCz~K|^=GoZbuckiE|>+clx$=3aR75F-K(;p3Lt
zk41N`5+4B8i?eK(@E5qEJ!{*8IDQS;l@n<z-K%eMB7`LrFzP#9A~s8wZg&HGLsvHD
zyps1U^2W)O%(oUg{`$aRb#@W-%2CeDB#s5rAB`HIaK&opU95C-4i=m!ebg>DF6$l)
zJCQ5~Xr9y~$$e*=nz_$mj`)as)KRD78n=aP32j0Z8_PmJ{mx^!5#(}@+*q*1J$ggI
zrbPpY$;>?}Dp<Od%|mZiez@gB!eEyEG7PFPFSvlUA=P>rfjxm7J=q7;hmoG0U7T;B
z7Wnm5)szP3bf}P?B9Ww$i>PBsb`ijH0%=lDy-Gk3h<anzMjBTP^~BoRZCOTti^Nt5
z)F(;L!7x$!P{&bQnzWd>?>tJ<9Ngv+TljF+RxEkuqG^FGxksC4CN;aRE!ZG24^I-T
z*6c>&NS&$LtwPUb%|BD2oXL4J*MN3L{^6wK(e*}5dq#$<Z(k{Vz-2Wf)&=dpF9eLU
z^Ic%C71*jFrg44+&4qC|=%xBE5N+|^Nmr=u|2Qr}jbLN;Y`GO-2JCs?0gE4HtG8{c
z<>w{I@dt9uqDn`a(I-zbHtP2Kp}Ir)jBrkKW40VyK%35U`>*94sO2%uTCAP7JPvqU
zBIkEC4C?KBPtD_gKdG?yvJLLW^N5YWqQ=(1NpD`@WY`?;UdcC0y%)OIwo2g))3;MC
zOU`RznC@dfWObC2VckpRh(_!Blb!5|B*)>QLy}DId6L=vl50qBv6U=d^6!c?+}hvW
zm`37gs!LiL9DgTPvtc-9%Dx8<zR)}OI5W(*3bl%5yx63Ew+W>fZf$;9y%2&e0i}&Y
zFH1HURR(z9VTISv<r7G)cncQZf_rVTh`QPG!l|WgWmCf9SA-v`BZV;M3B>(OB!^nj
z9TXTN=-y;aP^P+}XTeT@=DC-?Aj#}}+c2UUoUPmC+=i*A7CV(<Lz~DbbW$XPG??<Z
z#}o24w1r<$=k+H#Bh9W<_sY`9#-b!+`lg~twXsaJe@63**|)-T;ZdA`EW~qF{_ue8
z(=Mej)%uB%$2uco=F%xb39ZoCuFqzyL1+_QHgK@Zu`H;48dSRAaE$)*f5c%o!*hZI
z)zAYHFL!j>+j1MTONG(WI-JfyOhyh!<*<qyTlyQi=GGW$A!8{YAYjzObf|))Nae}}
zFue+~ZKt7FNeo*?Y)vaqvV1DcO~eJk6Orgr*ZZWWAQLJZ-Tt3}1LfpxG_EKjSsrYW
z%1D<<u0`%f`BK{O@E}=$A?x`Xj-A2zKf@R%$#XA}g?EzMZnAdf;c>a;NL=^I@sWmO
zXL$!LT-|W&3bDT&<Z*10Z;b{b2i<8DCKVNI5+vM9er#v60f&F@XkoMExHi8ohwocN
zX*D@dpWt%1SB^~zMHq8Xy9HODB!hbGxMwt)Uyvzu2Q=0wJQ77gQz5j7ZnXpQaRqXG
zBy_Ggu%H(Jz(Yg|(xLHjk(ES-m~V>sUslvBcQ46;DWua~#+X!`nXTqn6{vj%xz3I&
z@KOOYD-P~i5-}b~PXAAhH`0kKfm-S4;xtq_9p7^rj^)lRcCXxkHfgyWn^A&0eRmS&
zrw^7?)++$T*?R{~{o+;B+3BzPUnvP#TB|7kjvQ%4tf2us5+LW{HXNI%H6pJ>P%>qq
z$)NjP_4n$cC&T5W!v5Yqg`}I5%-JiwIR%nAEalckzXqC3c0O_E%@)*@FCf{j@m<aa
z^`>t~&KXcqTqI5YyDEWq_o9mnuXZ<X#LhOoyTZFo-VKvFg_5XKVLx|cgA{t3@8hO-
zr>}4~NvwDgLvU--LOX>E+z74`Q{-Oxy`+ZY)7*_KdQ!LJ)7_1KVBv|Cd9)Mhc`s-j
z9$K2jx73rsh<rs2HyeDtnO>RHUR6KTsTrH5z<T+zduwvTLrM3!hwjIIHrz`3OSJtM
zE|eI=eZ#GjeP0Zx!DohKoevq)gLP?l&b!FJ;M<Id@2v1OpvRFo2RITZTh7_??UOXC
z&c`l@y$udA14!N$#D#6{Bn^%`kRGr&+VQKv&;uD#H_%HTZ0$k`;)T8HZpzk3rmuq<
zsJHzYp>rjMaRySR4R4s2l<RIh9}*~J?oIO_zs&u(U!DQ4GKn!;ustJCy*)iJI4y8M
zN(g*qeLq^ndhR4LGBPdn4}Gs_B2+4ZB8I!^HHik`pemQU@drHQe;v9&@F1=w%WlrW
z!K!xOMoz+ko<g*yH%O!V8;YKP<Z*atrDQ}GgK^R5hMVtWlv|iYl^ow9d-{sz@ks?+
z=Ufx#4-Ln6@QwnXe%?M>BpV+DlfVZm>0A!|<hY(}13?Av?9ko3^Ka}?aAXehH~eHl
z+k(HiR}M)oXj}A5i1`*!9Fr8-=HHlX9oVOuRC9=ao75;X5QZF?gGa)$fxt4uS5IFd
zB5;USBqeW(HiiKt93Y0^VRRK)2No;perR37vu0qqypfi6ugmQpuanWx2kFN4M&U%?
zGeQVO2U#x@Plo{rqCH+Am82Up=Nh}&QzxOv9f}^g8mq<{kr71?lFt1|QDlHkkpUsj
z<Wm&EUd?$+(PYztXBAC0EqXe19d8v)jtWh7exqm-2+?&A;h?#tbL7cJqM^uukV{9W
z^RcIDhWHoY2hViPEeib^$y5H6&`VBAiP6jA8)%Im6NTfKLoG)Nsc`*slG+E&gf<&_
z1tp-(!{kav6MX=2UcxiZ6a;Q>7>J~Z`zI7qdl2Kt!-PKXohmOQ6@9L->GKd+Yx=x5
zcNgf$;D)7+G+iO0a&XR8n=JojljTp*@0Z6&v*Bw+n&qLsLIWJ|z)|$J^&HWh!pN|n
zbZ~MQI$8GZF?BENb4McZImJmQ!{^%kyORT^a@@;?NfK$0+XLTPR)-cE?<b*t5-*MG
zsN>G*#`R;AR;U0=<M3pgb)6I}5?@Xp))apolEcjDOMRd?)h6xWt9<vedqw$48@?;e
z-FycR{sr%3MBI%-?D*hdS8&oh8M#(Ln|tX^Qoi?{^nx9MeVu{roDScVO;i#`HvbST
z{pg<L&?xRiw3~+|sWWW)77TIC9TM6GK-FFx{<lTjOCD(FNqhMnd_)fVN_LQ<Uw2m0
zpdm=XqrzbHpnGMeZXw$dg1;xKi@#w);+sjHRu)&s%Y)rMH2<#@{<nD_adgEes%7Na
zEh8^99j0kr@qrS6wgu1Iy5je0Muuh>Qx_Y;ivPh-p0L_(8r!Vrh=$;KA^KAhj$mv{
zZkV5JczZT{KgsYZTf4TOm;pviY%}oMF;SGm3|7%LZDO*}y>`Edg0`t^Cng0)x`q|J
z>GnUT-VHOT!Nmm|q2(~Dle9rzt%$zzeg0kFJHyaX%<>6$T%qT<Q{=Uc!bhT9M5K@o
zFx{RZhCv$zA-I2ia_D0iY70(w=phk-aoK&b>&tQ|2Z~EI`VMcNbbeC!%-a#*zV2m>
zQi=%hfxw4WA09;OA;8t#w)Bt+OHV=Dy=@%`Z-odAa{+)#^KZi9CQo!Xeg)T8{aZv`
ztRzU<w&V}w0J=`xDks2Z2xCOK+^(yWQ8<x2Ls`hjvl>7s6m$mVcun`pyJZ@!kmfiP
zm>IV>6re$lQ<SzdvP3FN>y6wMT3&2V2^)imYVF0r!-d`p9j&oVNlun6Iaw5yg*Z2v
zQd<BcCO!kO9$sW9g(c(4Oj4nnuC>KeuUB`k9D)9JH~x`KN=KE8jBcc)ttz=~&pdWX
z9?0d9BY>V_&Jo~4DI_hlxn0ZcLHCj|FjZt%&~-n4m3kVItezgr<SBF)KmJWU3Xact
zlCn=CNRL(6sknc90{7vci<G1ODWK5$&=O|Sdq7@7jPGgdupgdT>+DxdIYmO#_?f-}
z{L)+0oIs4<){&EPqSUWZSGH8;h3>)v2DbP$F9REj0`H0C8@jDwkU{5vWshQvT5iLj
z$-ZyoeA1zzTyYjeYP)zDj{!UUw&Z%XSo$O3H@ZsO{iFz;iS|P`Z9+yoA+OepZwcQ+
zJ>=nQtXEEGf=D{_Y?#->@aE{o;1a0{JtrOktfY1s%6>A3#^_aOKebq`R5PQ0QgvIx
z4<81rwSv#x`Cse7m&?`Q%LFbI8#iu6PeS5w2Y<jAL|~JW-Pll7F!ugId5=Tlj5e!|
zx1IOZ3mCC&Be4`vq)I^hN>TBt-ewS(ntF&9k<C<+c`*r_i%&3IGUqz~@t)p(@)f@v
zyWBN}ICc7PEE#FG$BO#U9Gz|l-*<p~iRJX!OLNtTGo&Oap)|5MbaSW&oEo!B<Z?7=
zOVeQ<M#@8VcD8%DCrQyrC4$(>e}D^_5c^njqt5)x>{8NOuYRjE3?78L@p%LIFDjr4
zQ|yUaTN$7S{`~ojmoi?|m;r3}<Gc7}{ha%;e!8e}m$S6P9`KU^F@=~6<id^(Oy&k&
zB~lVe0~k!6{KH|P+(1URbcc4}@PZdr3ip!B1?Hq1WSEQcL@iMX2E_)}z1hsKz&!g9
za<Q)9WmV}p>L7bb;P$^sUJduc5jJ2RS;+1?n`<_SvfPi0JqI5}Fh&@1j|!h1&`$_Y
z>|!<@Q0g+f3tJj`$jR=LsE+D`t6n0|a{?Xg3UXyPYZ6<%J`<G<Q6;+&(US3LTDM4_
zir6$jtzH_g_aap5$hu^PbOo9o{Lt80k1=E9ptS|G7_G>0FTvu8^3PFj(i#PNl7`Zk
z(Q<12uT?5i<P8MAJP%gbyA>u<%<4(f)et`Ebp_UvgV6P-(%$5oCQYNsoKS=58Q}I8
zB|5l!P2!L+Ufn3)!B*-*xsgImr{^K9MhOE<+up9I*_BM6d}8Z*$%g<dOy6YwN)4Ym
zb<X-0?Q;dywcCreDAXCjbl!l8IFnhzmG7tys`rM5jy!kce~T!KP_KO_(1EuW$CY}D
zbAT>I5<-4kCy4;nSCebtGE-Xqz)%%$94#1?YC(|7q){392=Nd|l)nRgEgbtW&><Ti
znr#6vDXL(n@3YV)Br4MDN6{9zES}K2C~*gkBKS!y!hQwh6p2g{#k&&?8SjrVe!o`E
zR~(zagLP@rVjA)Mm8=P>j56va#h^M^HVN2AC2G|ptx=`m?UlSmxv0F=Ah*$ZC-c-+
z(iSMeNpqCMjd0V+7iP6{^Q07G5C^=>Ne}%2iWjqzEX)1KFSw;2g9FnnwWSkj-KV-g
zflc0zaxK2GcYLh?WXqfa9}l&+0XB)~zk4oG=rzvT9?SWdqm^i_j=DmisilrC8nn0S
z5n)yCb{ZpNul_wUs4En*$8++(PI!doo>dB(42Id<?GF&9=|0Fm?2IpQUh8%Ns}3f=
z7MM&OgcATcirhKR`F(A#G*7Z%&jg!2v9<we1?4@AUtsjI0vV!dJR}|GBt`ov^<lj%
zX-Y6RztnJ;^N4=dDsDpQ28OU>(<^d>C=)D!_ilGD^NJ$XNYEh}u}#|VSrpT78%~_~
zW?<lf7+I7e-#!}(DkYq^iQOSp(i@6ZBcuH-*gn$j|Eq8vOWQ%>QpN9~R^47@QZ{-&
zk|N5a*y`+3x!=saocP%)aX|m4kX@e`#DW&hMNxW?<awGz01iU(p`y9|xeIq{oS-Iz
zN_xXavcyI&uo?6|1c{L#gQL+rI!Q2++}0<mf5FIZQ#H*{XsAnKc4sbw<|uL@wjS$~
z`ma?6pKgWV(VKP7;*iSM%-FhC1j3D&uz-3zYp^`NroZjtUU~iyd3<--xa>ae#;d4f
z!!5<cFx+zw5AKy0Hoof}%Y2M`?Yqon(OGjh&XN~v4-|asZk(oWOS1bEysn+^z|rs}
zl9Voj23PQbyYW&|6};naynt&FV+f7!`gXuokrzcAn_JuIHAsKBQC9fpe#k81QUoJ1
zGFQqS0Cxwv8&Rlqky1xMP_Z>Kgr66_j;8_5lar)_7}(WW@NVFpgMaYqG~05w<f0bc
zjnd<RQh89Eo;l^psE#_uo+e}s|3b#{1F!mCR3F!oB|6xX&|@f5npcjDP#_GA^#X()
zi~po1a$v8($;v&hr;1zwxbq#RD)2{C-QY{oK}u6hF?i9HZJZNsXB8d_>pnbAcAAq2
zOzuYMCk8S&zn@s8(}P~Mt;{4ziF!$voA%M{4==npe+NFUXs@Bg&i<Cdk7)9{d|x)#
zB!^`5E@l@bzpXZoe4~xRvn0rO)V0<JETI+sF?57T^S&JbJK+n57Lia1#tL`i4T>N8
z-D@{+-1$B3wXYRy_Ld?9>56_L2_JZ`D0s(vsm=GVmCL<KL{j;a=(_M{Y8s^}2V)WX
zTwv?jKhcBx_H;(Vp8#){_6Ok@2ie|@8Hzruo^oi2M6I|d|F!55|9S<wGgpw6ZC%T#
zNq}kjs0MObGWXN6{!G<BjXRZ##2Z+h*CI?-LLw8vL_RN(NTha!h<F*_h*9vIgvgsX
zkL8v;zJ%m%EC7Q4mDtH?tM;%=VYNDeFAlNsUBR}Wq5M`Bb7W>K+|<f}Uw?Iy9+YE{
zO=n4>dUquP!uUjNwE)9=g7F~MEhHfKb3ltb`-oIc)E0^UkVGQdqSQ6!1Ie3CR82zm
zi3+ox-tQ;G`qU|9-U}7MqRaF5$z<03P-_)35*e=84a|{@&4)OIR`6xPjlAPkbivIi
z*6f3rU=KQJEfy3L9#~Ivz(QygsaFeamH!8{uYh(6pZ>u*38!+eVVk?J++|%Wx3HJ;
zKJ|WrwUng!Y%~7_NU53}rH*6TN3*!;5-PAt5wAp3b08S4R++^`CGnSl)hG%i(K$q(
z3yPtSrAaCwi+gi4lQ;7Luy!x&O%y3a3y|k23kp0>p6GaZoV>r%fYy<ZSw@LTlP#oM
zAYO8twc)Uuac!QLbgH~t@3VFYH6?{9KlW9gV+;mP1q(;zldOwk0!HjYU^=8t)1T57
zAW}o#Hhhd)Y4yqnea$tmNgESI$cwFCo{aeSHqZfSOYrm8QAj)%`&jDGWk1#GBuJt$
z6UWIe>4L84{)6>+BINrZM*_zGYLAm=)?CScVrvBD>T1Mc|E_M?mniH<%f@aS``7d?
zhbHkTR~Jh26gC6KpjxW1(GFhUfJQ>`zdEN&L?QUF!hd0rI*w}k3Mr&mfc<yZtiL6~
z9vrY+sw#9MQ_uywAKnB#^{$kJ@^-RdJAsdrfTCJsORC70NUU^UDDV*(La?j&Bn?AT
zS~bo%N>3tHbpBgJa^H?l4wZn-Db1xxxgSD{D4|w}beti@h*nXM9DV^M<db%znu%Zm
z26-$}6sAei&~N!cKa9_R?X-)vr!vX{3QWkK=M>@`ZECq>S)KxJH@DvbTm<->mWnuy
zddKImESk(#nVVVD6^o>fGZbRJ^J)C%+GUd6Zjaxf;QX;Ky@2oC_XOS^zv^P}85`Ir
zoBx)`x4;-zRYGEudM^Dp)vRflug1=CETvqV!%>tVO94y&aZK9WjaS2XjuvoMqC1T>
z2N?>d>RuLe#ytuLd5?;>w-e!CH%Ju10tie!ez#q@IGj@XcZofkyG=3QX8Om-iu8)5
zOQiUcc#g>5nHF2UN@^o4uBJw+^UZ!7ybrmL`(oQ1X;7W^e4vzEfRxa!zqe(Oa7tR4
z-nK&Z{w(@CUN{OQbJXyX;@N}Pi)=_DkamBFoh$4Sx|L@?yDoR|)oj`CBd*g}-VtZV
zv|J)(Eubu0>ZY=;BJ{Gz6^>nW{jc-A@$Wh^G)`_9l_slf<B~PcwhTr1&`0d#PLO$v
zWoZeLatlK&w1wQYih;J2<cM<J*v<A?&`@nrHABE%dw^!A+<4I_L_CFjZGs&zYh%mz
z90a3hhms--D-xp~5o^vSBC#%vvagHJGf=7#r8s#;fVCqd&oS1bhB&o6{pbCGx8jUD
z`d=aZE5_U4bAb~Xw}A3o(FReurqp*B$w{!A2B@$8W*dCAtN%ArbiXk2ee|ebe{mzR
z|C*pL7_f-9g?V7B1l4Y2j*M9s%8L)#=<<!2R{f!Z@vHtqLtk^V&|dVD$Skt>GAxqo
zp?$DQ(NJ(D!p}fgOO<AkiWq}ji*AsSG+A!@;#I=O76nlBp@4TJb2?D<CqM+$Pk|ld
z4-tI?_B3FJe;ZwoujKLrkx}W5NWbI#_oa<_XRWRw<*GVCMWk3fD@T6ACnKwU@<K$y
z#@_a`T-L|Db)?`Ql&G|wN@UCN)O1EPx-8RoGE^W_;Wzo7`q(uhr~bVeL7_gXWsMSO
zYO$Uf1l+wX>sYqzxO+suE*ANvQ_jNX&3-r4-rHM|$!z(Zb51L7F8Cx~Z4=QXKAxle
zg@)tsXz2{WHCu}jw*o!VlHQVP#<l<acZ-!ivsJ_`f=sk&*gUt=sJH7^E}Twe`%Ue_
zt3*^|jcQr85ZnsJf&HuILV?vme&~f+u-O_;>QxOA`zSww{lt5zm(`zmb#e?GGFw*2
zI~$R4A_G6y5s9|*Luuf)=%#5`4k}YirH)POjBO_)t9~P8IVh^;ME##8rxtzntE6<n
zx0Dk#pDKrqL7kMNTB99tISa8`GR5;2GiDo&$M#T~%0}_D6YGJ!2_{kYmqZnp<G0Xv
zO&5K=4~4AN8`EjB;Y8Lm>+}9|km@`nFkAO_L;_`Px0GDS{v$f9tAxOT4Xj33cGMoZ
zxmr<=_cvnJVbygGootU$D#F{$Q4Ht;O(`kFG@G(=SV}A9JBCkKFU_9htHdnJCm5w@
ztejH|>uFwqRXS*<$t&UE%UWDr*1?Z3HVe>qiTX*`kETJnc`Anj$6zCnvSgq^)d6lj
z@-@wIQ_R-_lTY8#zLvXjFRCQ>=s#_B8g<(*<@;>#wi?8RQb6g%LakClw*mcjAM=x{
zw=4r4+S0G-2Pnl&3V4J9Ry`|p6^~^A>$`C3lndh?x>bo0V67JXTwW^d|ExvSWqrzA
zSghqxave>Q^-TM%pTQnmsovGS`kR5wwEROLiCeJ%%x#fd4p4<J?8;If(ec2mY#EEO
z`PDtZ3jnA%sg){?!{H~0g)o^mKb6-K<>waZGzveX&P^OYuiODY?>U8^_vE+gkH;pk
z(?)+C8r30w8<g11JS~*R|9W3cfug+X<hm?#3mDtJqA*TVURdECCc{<2P`+LN1qxh|
zTq_)5fmPMjTpVRtG~+h=t;=AyP5HUq6YA@)Y(gcHXd^w)Zb|e!FBFMn7oRNxQIR)L
z@cvhHvy#4@sM+p|okOvjHQ~jvy^eCnQb=|BT(CGj*kHh#V38R~&wqDJ>25YCyduU*
z9h>$eOVo^W2m=k*_UEF5Kg#|Dho=XBDo`91_$wT$rq)F_2aD6<U=GkQi-1YFLR8-C
z>bb1fnXplM1Y?dJk2ZhaTbH8!VCaT<DT9hL7Nq32t_W{upIXqh;#BCLu!~k@4zG-}
zKhg7|G`{zxIii11+y~CztYt>aJG-SPXVR>(B{iyie~nD$x2ip*!3h~kUx8F$cMPck
z3(f{@=@{DkeT1$qRyh=nbn16Mc*XT$g2OX{6ZZPQZ}#*(8tl<9uczUCD%=nqZ@~Xp
zrM{1aTO8CDUXCw`ex|4p_tE`QW?<8F|M8RFd2=hco?xU|l*~4^lr<Pe@5mw^>?X38
zQCB72AZ~z(b7BpT=Lo@6S$5h6m?!>+;s%9BzcnP0`K|FW&glbYOQAMc%GgDKNVTn-
zC^Y<IHGa67#iB;b06m^$hGp_YJ_Rj1Qihv@hNrogJc6wa4o~yXGkbb_iJkI@YzGY?
z4eL7Raol3dnNmH(MryKVvH+u$%fp~MVjQ<pSu2@Bl}TRp-E&DG4OqM&5}NeMS&MPI
zlXBbVRD7^)XcKhmE~XbrIm$`-S4mmYUCI|p8645qN!TO_$99)6s1oKl2`7;-)+a%0
zuKB%S3zpM#*(05l*O7Ad<ABr{ig~p8G*E#Y;3VuNWmj}pwp)Yzu9GstIB-i<cPT%o
z2cFRKTyzpOo^hIe9jSu%l&XZXNTw9WBsii3-Np=9a6~DWtS;k8jNZ$#!mPmSNgJAW
zG!HrKO`q<6=&&)bSGbQfQ@@ow-9IqmJCeIOsVz7}rra}wLplW#*)nl5{;8O5yFgZ!
zRH3fBDqJDRfy}#O)-B+@qt9&J^U9})rdU4PuR4SS9<NK40-)5m(OG!%)K-krl=$&L
z=^xM>_3V_`vbJbPLCrz@l1{#;m75k;qgdqozuiF2%C?3A`P61LeMNrUfs-V=18^g~
zMS=bP&GK1L?T8TnkK0c2y~}69FDpdCZxlK6kqcJfl{1W@lobgdBVqVS$4^sz$SNl5
zLGe4SM_3=^>a{=ohd6x+(PjLfeGhTt|DxeT$wYB}X7tm?S*w-^8(2B+UU~mW)z)0{
z?PhH42TZlvUy&}vzx!CJAU%o7^Y*dyVZUZV8U6-_XDsZWzawT}g7>5awyobIj$sn$
ziAU<PUXnushCY>9%&hsY;D|IeH$)2O{ZHh)5pl|ZemkWFN0`l}>4AI9Kwj{k^i4%(
zPxMD{$k0JUit3bq`(&eVUmvrO=s!C45j$w@XKG~RylVvodAxiG=9jNWZt!vz6??Pu
zh!izrEu%<()K+%S?{V*o?dD{oF6|@w{e+eZ!BKp0af^l36uA&TTlr_YD5U|cRktWm
z7#%s!RGo#Ov}#&V>_t}*KF%O<f|i&5jVOe;4_SRl_n3jf<+6Q2iHiDKjjA_|;AeDr
z{3nt)%=x155Tz4Xo2Ibj<wv_29zC((>R1ud$arxjx+gXqL4?fL7ql&0+dMhB;P}D<
zhwQ~C^_Li>#@gw!EKx?vFrj;HchJ~?*Hv(Q(OU^>>T57>wl{*so3bC1I41Oz{t5}B
zFddM!q@rJ>#&svRF|q%xask4bO6AJgr?$pDyo<7TE_hEt&~0Ddh-w7(K*6_bSK&%r
zWJU}A(OjHd@alq_o%X4XyHr-#Oy=V#B259HNncsTzRv)$%K7kHlIRP{k5Skz_P<CY
zFJI%Op5ruQX^8&;?_;&I>8-~%(v+aFtV0%1pf1!2Y2v!Ppj^T`*(>RrrxtFllcuAv
zLL7Iic|_mE>Jw`sZe2dng+9kSlcqP;q}8$8zzF2DJeGr+u-nkDz*PkMZXgAQXC@5x
zU49aLA28E{_wl7yC&PlB)O=YSgo#3m_|dkXLqJLm<oJtCY3ovIOhzaxq~_|qQ#TFI
z<dva2b)qeJcL_qd`lskI3{CcL<daxyp5@7@wKf;@qyrlnB9(J!^CN2&rx(CMuZGdV
z@I_!lc)jWnDYgRmGe#<uhcCr&GR2D@0pJy^SeN!M>lc+kiC?5zaCnGr@o@%!D+<OD
zFeM&0exn*}(=O^0`$RE3zk_0EolReRr#Fv~wGN3Qv0MiHY)MsszNSMfQv%Nm(c)iZ
z%SemrzA4KK`>X?uF&}PA^8Px0y^)f*HPM_x7SOngavV$hs4BvHXKW~v1UE<pzE*6~
zdnA?m=0zbDPz^W4<OB95#w}hxE~@L*5Zf2Ex+f}4D*TGx(W1twyU=%h%bq^W6(}M(
zgJwdN;h)$C2>>JKZB(Rv(5l(8QLLKX?)!`My{99TET~~1>!nVdxcPmMZo3gLfi$ak
zknR*;?J<(JR2+#F_6r=5mM?9PI=Nj~8A<i<QA-BwaB#R8E41qAM|*0GLEG2e6!6}U
zSSVRJrPL?!<YQw{7Q^<AGE5xnsv%vhbpi5(By~70oP11r`YYa6LyAh_t?4DW@up5n
zj~|>XJBH<@L#Voyn~DmJw^F0tl-aW7jTjAX5_#U+9StTQ=Z!}<ceCZ7PNF2$|0aEX
z=}d^$g$*|4v#>w$@+jYrmF#w>px-CT_fQZ%-VVa5Znlzrfeu6qOCm&6QN1=B?v?ox
zTs}QDO+^C`$$#ARJ<}o`i#05I65b>d^7qs|dMZ(j@(V@XNuNa(3#`fD@SB++80!Nl
zOiimC2&)YvIog%JPLftf>k=!^8YqPsMvth7q)O7+-6cIsCv`=Wezc9G-tLlqLN$S!
z5>5JFl60OVjjMsw+<J+mt4_e2Q-(mL{~r~#7#-$FJF*F<cyYJDZs-n;i2|XsJJ}e_
z8$m^cuX3x5)UApRJ=i_Hrv}*m5~oC&bh-mu=$J=kGFUWF%LNPLPzu6u>o0tCUJX1j
z(z!+aslcl^Q~5jmdnX}c8Nu($swg>5Agk#$_wr=M+VkI~Ua~4ruOZ5$hm#Q;!WKiu
z99=5_Bg>;L>%Bu5i&iNk(3fvP+{BO`$3nC@#Bo`_{QwoX!<&v9JR23<^misQq#T~J
zgGI92ZTVrk#`&$RnbgaEWfxC&{$Vwf9V@l3Q|bUpolL39E>Y%#Ql`+0a#@UI<x?Qp
zO888mEVQ3Z53Z>Pg;HRNltA2o;1E^tROyrRs47sRe)Du4^HjlhJqsx@%%_55^*nLo
zDfL_}(<X8Cd>+`KRYI|a!FdDZ{K;1O7x{;2)Ux(!5?|4f-6T=64s<Fwl;Rdhar#5v
zRB<`Q#SZ9K^_*ahqCkL8!26N|wiIzwr9#9}&r+Zdwd;8S1<RwVzy$SML_L-JOMFp$
zWk*u_NtVUODw{5qU7!ivX1)7wyPjT(JnU}zt=3f&D0XCU!T=UHE|(>1`LDsxlI(He
zi}m`dN!jBlY2=84hX%NpUq%85pkf>X3}^{hY+Cb6(K1S|<mtz(3hN?IV|4klUzIBR
zu2OKg4}2?-0`$!+i-}ShPiylo)2Y0TawR3iayNYf#yl$`vB-ZQ_l4j#u%L8+`|+8m
zFvf;Un<7w^D)OR~{RQK)OWaNWBqJH}h?AX~c?Cnr@Gr{3%`AcUvg39(?Wak;?nnY9
zZe-}oeKwi;suBb_9ys>OH<y>PKu?AaJPO(mW$Buq?D3*>o7UYENL@tgp`<QSsRs(O
zN(9`E*O7>O5rf7{<zA4NcZa1_xEqTlj%rYq9G%X0fuJF6Tpi;Cc}hYzYbZJ7krtZe
ze`S)M7N^CAzlrr<@vpV>=}a8T7=a9>P0=Hdh1u48d|w$N@XE-ePjwg72ujpgs($R1
zn{Y~yS|eDm=f}zEe#0JlWY5*`kp&wT+{G#L#BX{R%_!a|_ZPp1^mjLir>$ggM0EJE
zNe@3F4L=FZp?dauzb7(-Q_SE<(;rR`CI#<u1$xLPv9Yc|aUz0$r_k_^PdmQ)1b&Xx
zvO;QE*-fVyEq>cZ8DC{+HL4Xwx97foGV-(hExB7z;*9&|EF2`UYHmjBQ=V?1a2Zq;
z0x1<At<{h1LDfHngEFiUSWn+z{l~80eP+`7;NbmItGf<KosLo`?P=3_zzEZ_tX<5{
z#DRsa@!y+e9ypGTf5)|;g8IuGRMOqJ4P?5hC`=j8_g`38sMyIsvdyZZ*Myx5uNzd{
zcTvCK?P<*!O+YY`ULP5(>s)vaqhY;oYhA>ai!0oXuks>r(EsUe{^PypoFT)c=`u{Z
zLj0Yt@vPMJ80QCXM-uk0w|e%DNCvS!6#pfYAMTaEDEcN9!D;jF=^>06>3-xlq~XkK
z-wW%%IlFmD65nZXa{PlFYGytBWK3e*O{)E<L2Gwoe?%s97C)_FmlSz6#{u|1=@D3e
z<Q@O99`2#*9avQkEVaq^H#uP8pt~G5fC0Pl_S{3Eo+rqZ3}`|_o$aw~Tj1MP%eDS1
zwym{-Xy6?xu=wK$2^N1LztmvvNNQ9+M(Voe?as)uZLL-^sZ~wwmlNdWQ@n%%y&K|)
z^A&OGQ036GXbpBR`C1QeO!B6<SH6BkPN-EB{5^@n&#IS4Hj3BbH7T6*M?P@4`G_R>
zZS*`z6aji7FE~N3Orj6D7)M?SjO?jU0+Y*4ckN#?2FP()8-s-7`23d$jv{9U>v?3}
zj|tvrq?7utw`loerMQgX_cMaE16WSITqXuEtzUy>W;mVwD3dr1qM&xb!a1ll#%$B`
zcPK+M;8_LcTkB$$>8o4u9Khk4Yc&pP7DSOFLsmO}_NKCSvSTzIg`K0I$+WX$Z3Kq(
zS9VcG?M*rcxzT?-;vLhp!*>S5Z}zxLd}+5(2i_>|EBz|f4-Ro!x4Vg6K*Z5o?0n}b
zBu=QJlFZ>inK(5Cxpu4<2hSerW4)UKO<y}3JCGNQ%?Evot1ivrPSIDRyJ^N~oyUQt
z^i{C96cbw@dg*ou5iE|*LM-4>amN2jHi~IQ+;q=#wq{xv{!Ns30-*rqAZkjiViu6O
zc%t(`qd2w71BE;=E-PtUu=J?drC?DfWF^+OJHIvjBWka=XKYE@Jl#L<aHM&{Vei>W
zpZmj%uMc8;J+S4}DYL)*OL<DNMl-h!4w}lf1g^^(Ai^YI1sM)S-r~2;P%n0nM_V{i
zE}(xugj@CWt2Al=C;=hzZmf{fA0c++#eX6A?!f1h)x@PepU5-*wlxVcUEKD)DKw0|
zS=N>RMW@csDVdSxC*(JG%lf0qfnoc-dH7Br*xfz7em*!XT}~@DgTs`44GuE{uI$JK
z{*A7JhxhwFb~qo*%5GB=p_Dgvjq5g9LF4+3y7Gm#3*zi|*cI6lL_tP;hbBy%yh3tG
z9+F$&XiQw(_TqhPkbH4vXXJYmUu%=N_&@w<)I+jSRpYI!tMkqFR#seYR8&s$%`m)m
zW#yIA%E})wrj(8ueMjlI>zo_o)>}PBU8UDoSL5kjZ}hIe*~8BnL_O%Ms;e~auk!Xc
zX4O{ssw+Ll>^fi@0I#j{l$TXkSJlk$^ih$0JUPAVbB$Z-y%kk8MxVmU+Ud9UF>Wcj
zd+?M|ca9oo+>%pXJ8M>1O@)U{mAQtm=7E~pxiy|@U)gs@jq}(q4R39&hg9=DWpy)r
zvnp%6^&W4nr@p+dYPQ$t*Uun12vN@*jYRFV`zy=6o~n9JO|92c=Bf9B;f!3vC@-s#
znDV;HGH)f({NAk6RMyn`X3X@=s+?6@H{URP^<^`7)4Sd?v39n%s<x(nvS*?$&odDu
z>L*X`f5zZBWmVN>)1ZKz2J|X#KEvbbr$Ku>mGdggeX1ZS-_u75>>~-PJvC*sDm@;X
zoYa0=U0L0HPala^Dem`_&#LfvJhLn7rq|ZZ@{~9fsqxm;Ry&jtSfeLa	j5@zhs(
zom7I)tg45~1anVy<($fDNmvCq`GbCybsi-SW#!(gIh7t5S?MX8F3}ogjjf`u!e)-n
z>8YPtJJ&O(vaVhLSJen+st^I+&q?F0o$Z+kPn8_lq>%*n`#7o~6dqxIeYaWQC$;w6
z&_BQb0FS4*cJ}<bsu?rAo}A)bPkuqcfPUBI<qec7_phy+(brRYcX7WlRke~wWGA0&
zH+0QLjvI8gJE|V2^pqm3eLXY1-q|-_D_>F+sRq`y4h)-)ki`~t5uU0V*jQa%Sz*-F
zdghc>`zqzek^9P;IaPJFH6o;TBkcP(ml-51BFrVsBHTu}iEt*NXsZqn+E;l_w}ZsV
zy$!0{OEwk0S;$~h>i?Edp6oNS2m8D;YwKv-WBPkWRn{T))m5|V%V*B->nZ8)8QI^1
zTnw+8;j5(0SJZm0^4!zkQ(ReHSudII9#e9&XYSm&{h^$YjW~^9>-S#x%w<ZbAq@Q7
zW!~_m%iQyYj+3iAJ86u#dnc~D>!qYS2Uy*`yO($ge<m1q*uwQBLDJtunSUUBu-9eo
zj|=5ryUY=UYY6f2a(^aqc?VqP@Y949r-?sZ`u`Mvx^nKd%lK;l>GAlKH0bBv6{4?<
zGOxFC)@-lnN3`c`G?HksxmDho@^(gb?X<FLV|rC(b%imj66ROL=OAU7B-c`%bG3k~
z6~&Zmc+qvJYq=;{N2yONo@^8wv&zuyNT1<os<Ju?19nxpr?$o@udOLZ%hnJOj&88?
z&aI6WSugSvmj+b$-=}vyb|i)vdOR-8e5s44th}zaz8?MUMS)7St}X5-P0};1)>l(O
z4WhcguCg8zg3_<)SMRHzU0G96Spli)YJFZz5KY;Of{Zr?+N7YV^o^t0jAF4L<qvpj
z(TCHkYv&5?jhCmGpAg<9e2?%7VI|>N!oROcF?;n*G4CXt<o+NbgZsDprI<Sj9fUAp
zJz+@ySo*Kx(x1<}-xL0ua4lg9VHV;01P4w7c^x=ECGWR98`q|oXA=e!77#|ubAF0>
z8R0s@M8dauDP|qlUtE`B{)zAs;Y&h0p~v+pW<SCp!YIO@2tI<JP{R8`1e0)t{Eu>-
zOsE-<V$LTt5<VgP7vW`s@75G^DPi@%6!U$qKO;Ox_~UIU<|@JkH$pqE4-g(ETz?C2
z3scMqq#wrpJ%nC_rkhgC*9hAPChvw5E+mW~&pCuQ3R27~x!yqd68N=6Ddu9r6NFa@
zTL~e;CSd)5@ZilU=I^-vgRq@&8+q;`Tu<5MTze4CC%iNm-Vi<|oINDPEFxS&c!P3w
z67~@;2k!NRVTAKY*PCz?p^ET*LNnoA@_a@ZLue#CNqCm<=V2-47sFG`+X?HqA53T&
zkz(FEGR5pem`TVY%pv@aQ21SBim-cBig`8H16-fyy8QMO^OuB?ga*QRg7$AbG>lqW
zr5JG~)Hi#k5%B;@qt-L6YKC#fSw>Ecuev(d=q*zHKl~*nC->mbW&fpg`Rn;V{H6Xs
z{+a(j|J^Zq{4k?r^x&bltKT7`N0+FZJ4clmBZiH;yL9|ubu*%5^bmbFZt#$jVaC{D
z<LoHzbSiH2yE}*7<0L8>ZVVne)EImB5aW)!ON^nT#v6Bx9%_`1zQ?%x&O3}dM~^c~
zhTUltkG`{b@HpeUca$2#?lMZo8RLeH)jt3=#tj}-Qare%#27<SW9~GDj~-JxW>~2)
zj+>Ivqe}&ul2K$RE*U-c?lHrR@q@<<9y3BQzIAV^`6}TJ!oLY05k4pEBOE0pGuU$`
zA%k!U;R?c4gsTbt3D*&BB-~86l`w=boNx!>F2XoMJ8<sdI*BloP(heQc$nZNEFd%y
z9%YiGnd^@Uj#N&4aNN|=2dneb3&&M2P=8aWPMvwh%P+tD*=OU%rB9pIm|@&is*FhG
zyxH^%@Z6#u3TX$`*t@zaapddifH-M9_48*<tF1Qb=ht}4=IM4~L=)l#ddlkSt7d3V
zuL?_9ui`Kz_=k1Aa&K*&G2K^#gH0=o^;;b9Mh?z1IVvjW<?4GpuPU#7U+=A)ZQstQ
ztf{Ok16uSIrqsTtEa?s88hvi*;{jZss+vBy*LEfGN~>$}#c>6u(cyW(sIRP^ZWKxv
z<5rcrfB*h*$ra*dHMkDCPve-i1j>1G#IdNZt*_K(xy-A2Zl2y1SY<;w1D<HDXO>}+
zYw<w57)_Fh2f{b*qeO}3rMqxy%JP}?2GyG=w`^Xh9*y!9?Eaij&{4I)iq}_3XGVAm
z)uYJZGt5G@`D%Uja8|K2CyI&k6y|wqD(C7xp?L4AKJ%NfM~x|F>O+a)^9Jk?VderI
zKd;OC<%_XdypPXUMH*3sTHT$|E5#*R)A>tIPD-k(!SSl9@H|jCUzpYhS@ib7^O7#6
zk`&dW#SiNeb!XX~PGk80aGh3LTU}XJL!Y;@uA<CaW_V{JEfw_YYrVCGZ#Fm?Q>Li$
zxk4l7c1AhR(skrg`5-@K6&3u}`=&{}PjXdM&5?V&%qdf5<04I&;;Wg(Z*^sj{Cd?b
zKiW%_8%$G|I$X;}p$5V-!p{$;ngduNFW>82!)8N?`vKvngr^8yvZ_ZpX8$h)*>LnS
zp^dPa@D}0UgbxXO2wxEP622uIC7d86^O^cH32|xxhtZJX5FAr<!0ft8akH!F4tkWp
z;_xDVBC!>fm9vd$WfdgzR?eubQ}<3Ivmc<{w5l5E`RgGH6+IK`ll+$34Ap!og|59~
zxzW3S{(u?L=owD5&P-3gW(IzK)FI`4G;X@l2Zhsz){2(#%<|QHJ=3I_)c9siqcHta
z)Xu5zpkmGYDQ2l1j((u;pRu2PT%X^GA4gbEc%M*32oX|u;cI@04{4>Cza_j*XyEx7
zLK64G2p5G?%z1<mVbWJA<_^Mb;S}>}!i9TzN7zcZ@oVxD{z@3N4?pai6!R^@bKGCF
zpY((`2){p+Vnzs`x8qwKPBC*2q?qp=1cz_Q!}TXT-_O0Sa#c;0w@R4+I`XI1T~q{v
zWef!9-`KFqbb3Nq62p-GHv<l;3mzMINbH4oGw#sMu!HVE-<8$VJYBfplGwZLq)X@7
ziSzR8BQy|xLYPYUxgAbi*3;a3sSdT=FXes$*V$Zu>gj0~aUH?)a;`ri9415vW9@ej
z@oo|Kf9JZ!4sF>z&EMG}#C03tNx~b1V}vt%>$oXgml2%nhumLxRZnvh*9ly2Clqpj
z2f^0ob|0;Rh7i{^t0=3VHDxyJkSl(x-PlXV_cZ@a`0YJC&EXSzn%^h<l<*qirhB<3
zO#fa_a|^*kcxPfy^D{yXp?H!G&vCz&aD;FParZo+!z=d#gZoG9a87kka|8EQl@6bC
z|0H1m@e<DZeoynnL%bt=KzL?ePxA?`g9xRB!3%queF^_~xTkr1eoynyTz^gY5g|aB
zN*F?TfN&k*&kK5*DTF=1eS@&z5%4D5Ll{E%72#3BO2Sd#UcI=dnMwF~5%ng#M*L{<
z%^P^5O|4Tezq~i_&f?B*4Z~xM`PDD)&2N=cd)ki_jdlNaVqi;0Qd{JtaopW;24}*!
z+PFEB!DoNxUNbPcvokn3E#ONF`ar((XmD*f=nn^%ho^T&mavd%h1>^-{6Uy8@xYUE
z!yLhrVfV83qb#USYGc{NQ{j%Jz~kY?n+_E0c0bad)R7z^`|@zhzMz1VGJI))&b^bR
z=(OO9@Z#0s1Ma5wBf%er11l)yla3^?NeeCx2UKaBhGv_c>|2z7fhA$409@BR6_#m%
zLrttGXg|s=X<STn8P=hWWR~jncq$wLc`4zn=A~f)H)shTy=Xss(DHC|APhO&0{my;
zz~XT5iSXjK15^vtiRnlOUT5ToVFif_N2pnFmE<`VB*llhZ5=%ry>D{`QvI7;1@BSG
z9v!aW&%%pC2LP()09H`+Ih}`>ggJYv{X|Dk8>WtFY)_7`s9&SKFTQ@(p}@9KdvZr=
z;Jwql{xH<u6WC|xb{<{ddDI2kLW~l%CQ?nF9Ad7`gaDd(5Ti5lbeJ4&si6?9c^Sm<
z3vun2k&bik4Yi-wkwJ=%^I)e+MqL5X8QF8(9pOd9YCk^$nDd<~92KUDTty=~l7g;m
zp*8t6Diol>bR@S$jzvO;BgYO#P9{;<N#oeb<YUK^gsCTcAglJ@Nu#-=*Xn&I4fzeV
zXPh+P0HUz&$caIVg@YG#qzW1rI5>7jzKr<Sgi|0hJ9`4u%O5`3<C||z8veCm1N?ez
zS`yv|gCosr!VzJyO$LovWYf~H6def$!<`4+3&|f0Pj`RdhekmW4WU#p9C$+Da!3cv
z?j_}M9DRE)-uYW%g=okkpTg38)**^u`==y#spP@%j>X|k{%{Wp-1&>JU}Uvl2w>t^
z^=0UY%(w`$a-wj1ujVD;o&NBS%*6vcWzyZfw7r*2WGPBZeq1&PbYXC57{NW$`R#W-
zB>?K&olC>~-@!y0!4-TwjBGOtXBKRwZpS*3&ZH^1m$!FzB<F5$Kh}Pt`LPp8;UOJ8
z)Eu<P85`0?ww8t?gO&<MPKFM3xJY@tdECvgHmM^e(0NR*ELUiU!$*tUk0a74db(YN
zo6R5XJ%o#yQ6&9Vv5i~|D;tbyi<EUpi&N-Ol;O<aiLh#6lZR$lrJtoqScjCLGsAp{
z8M_^>Y=~}?UqC3zLRLv6q=K8BN3R!hN49gy6w4e4-|pNN*<P5vz2Cm=ot@kJW=FPv
zOzg1;`S{<Fw7v7_?mbVrA8k+Cx!sQ3-gz*xGmAo{5RS5J@3nYMc%Om`iX1sFCBS=W
zRa9wlXZXP4zlIOAsW`A-z}%=(ZHEQ3B7_ju1~Tkw2A73d=G538*`egdmL>FPupuU?
zp~D>%aT?7>GeKFQ^3ZL~PlOA$MgqGd?h#bVy`=p}U~5N`M57r4KM0F9pw0X&96>sc
zceqZ%$iPyi-9=tfLhY`Th6w&D$q?6y9+y^xjObQ`LEt9vlQ1`tK<9Db3jq}T2=F2u
z$^6CvMnQ_Mia5#z_46I7gv@+L6apf<G#qS^U-lPa6>J$1JJ3a;iqHUhNto8yrq-Jy
z_COYr2X+hbNf8mCjs^!aiE@fQVYOd`(g_Y_yX=y%pl}g-?td&(sn50uCbFROIL+iJ
z>QPyZWd8=2L@C=S*y(b&itSKX2~Hvy;6Z*>TWwn6RMO*$m=KP1&@+O$m82qYA~dV_
zLE8v|#;Nd4?dNeKO#2b5{bD!^`WGu=!C0jUMPI3=#V%u-wX*kZXyp}3Te22GgaMPD
zz@DV2XgfE@MKU6yv$K?UktLE7SAf(5hhY_<f|<gz%fxtY5h_3cilvIwMU0hHz>ynt
zu-3jor7nduK%zZJZ6T241v7bGsuZ|-uoXBWg2YiHBDDgS9Fq12f<{+v04uOnUZW#W
zvWC4aikweG<9H?778USKWV;pFnX*q(?;|J$PGL0TU|5qZso))PHkPy}*=z)n2<;at
zL{Pk9Z@?^SZ)hVwQMg9!jZO<nq64HgA9e8{%}8lpyFGRuegrq8vE9{qc(J~*+AmQJ
z6J}o``dax1tO!GO5_PHY!f8Pv_OlarnSWh4CAcn(w4B?~%f0gPuu|9W?HPIHBPhp|
z9!sGZ#!d{`(Sj9{?kLzPP1F&Qnlw0O6HU~j=q>gZ{?Y6@l2J~|S>x*hcuz~^0e`CV
zaDzgaia04#kQ*$vP&1gOy$SfOwIZU5PM0QwVFhUqfJAXG7RrnRd-w|2UZM7L<@M#%
zv*C~7uZb1)^b=S^>=oVA{>uMF?T_i&AG0k#c5)*wL`M(w#Zu+%ofKse^(K}HSsLKC
z_9jqz%f!tMv=AkfF|GE?L+z<JkPd~A3`N%C4m(eDq+tKaw5dVS#c{E)6Ieb?5pf!6
z`F7T1owZ4MlK*$~RJ6(d4+Mn=QSFLvgQO$$DXN+5LpxtexI!%0>V5J{8xYNq5?mvq
z5?Qqm$b%ja<G378Ft=mnZKU&Cce+2!Z{JpauHHOyy1V~oJ1eF&B8GKGhFI{(?hpp~
z!w@!CG+RX8qK!#A(soCVBN0d|=v+qdP_!tph<Jfx?;0~+<R@L^2L-SqEIW)jE=Jm!
zww|<pOwkkJlgU<lZ}MLiQJzdUgjN12ek>x@oA%{WTw#eMw^~NIVNq!A=Ebd;c2Zp>
zpCVKoqZzIdnq5iAR+x>sYivAbG1(G4`j9LqDqbf#dZ21kmDuz+X&@8uz|mC*7JA!`
z<Dzuc&Yz0ph@&8H_7Rk>0;N7t#O(&AoF-{tU6IczQvTlp{J)`mt>BP!32<iUg>)X-
zCLIys7A-nLZ6gIrI~{Rat&-7>B-K99aImctOG71ks!Al`<F5%XUPmubT#STtNRsk6
zG<vpMtvKRjUAzI$J{U%+B>C670@}EC0Es@CNMH{XrU(iOXPFix(b<Gk96vkZnWQJB
z_U{w~$u6n4ZH{bj<>#Z<BD-FTaQ=^Y8rt31CnZU`9euMu3Wm40;w*j?+Wy-1&i&i1
zUF)}Zp1?bV;JMqaoseUDr+m7}wPRpgv;cLJ&@`@(Y-^2tM7baRj=(ob037+~zX>Q-
zq%9pEQ?Rs^V!DpwNg~DlM9?GK_s~QR<Gc};5S9}Bhn36;dtfv60Tt5JDs95us9#Cl
z5=2rp<)9F<S0D}0fo|Ms7b;E?(8r1Mv!&fhNq8BQMoCf*q$aUi8GZTscdTCPWsKsS
zR@+Eh?N@8<qQuk&5F@n)0Wq%@kpz_OyIVsk{al(gUd(^1uG@00NROWRh?32u&4`84
z5@;c;#o~<zuw2gs9}PGE9b^1V?xvuunzm&eJn7gZGhos~qIqn?N_Fn1>(Y@TG0l%V
zUZ*0XqlxodMLv5;3b8{_j?Sg3@5oWTHp}hEGhwP0n8U&=<dG*V>tX39NQyxsvxi|Q
z-#LJyl1Q@9%;XW$4H9<<A37+uQqecc$&oPv2R2;(dUHnUJ6|dPPxR%Hh~1k|E(W~>
zJd-E^b>}D2;nL;pL~CM}oY$Jlw_J}NAr4q}6KQHCAuZ;}_Sb-hO%O#R^48G{1>vBF
zv|ERiPojY%*JR_rok7sBi}i<htxtHTnyv;f)I`l3Q5`>Es?A3c)Q96>t>X^&$hK8l
zwngb_fs&2J>b*F((!aou5<`GL^n);(q`C3L#o^p7daUR;%BSE%JogUV7tt$vyyruN
zC|T*?lxvoR)ff!ot?DNt(=O^P3QrkA1w`Ec7?8ICdyIJ12gq-wcdh$WZ`+E?Sajwh
z*@)QfpZ7_ZdFaP3^OYxD=4U^2nb|*ana}))!2M@jGYF-F?;KTpv&UB>lRj#S)L!kv
z<b#?VV>(J!m<=u+rB-yFVT`SoSrA!tWK5CC?_om?wWN^=j_K7^EWVWKO?%ax%pe+x
zi)Hk>P?;TZrbaziGC`<Ti%NlN0ivw?Ve(W`$<*a(^2kh?S|KDWP1VY!*c2#}G|qHr
zU(XDd_AmokM6k!1d99~%jJjzoZLMWBkl{?i>4l35v@x4?J}d||s%n|x^v+Bqvz*Oo
z+?;C4X?3mtWR9A-sfLBA=5z8qE!9lrAX%ec&s*jFFxC7k@l$6qr}S~Ex#bq-!rAw`
ze@krcDmp6(0YRRzaJAY}rj%r=sk(BW0g=@zP(9J?lNnatR@c_d;1$zP^;HkCDAk$3
z1>FG~dYZ1bp5|}X_cUj5?}-bya4%u`X2#G7<KEC=!)uIvzpmruU3?hN^Kjn3x3j0&
zdsk1hKj9|A=RDud^#Q`G+|TD)xVxvhZV%(v1m`OE5+5J766g6?hac_jX|5)0BK({1
zG2t7+aYEzQyd%6t_=Iqnkopbd-h@xX<ZsvEF|H3C?rF+Zf)nptujAdIquqyJbTD4e
zyY9mGc{iJP<ul9ba%A4Scew#mst{WbOCx3OIK~bntfsPznR#gf!zzty`XNEpvTl|M
zLwoM6n~82&4K0firZYWNKa-@wTW5~2Ycx`!mYX_~8<&<zNHyWd3}0L>d#<svzPxNU
z!org7%9?UphG>qJMn$brSzTYLeyXM$)63)mq-Av+?PNBqr<o<Dv9Qpg63AZWr033L
zKFqk~7UR}ijKW)th5YLJ-D)p6FbZ|KJj*h0gBr5pZic6Jx@Y1<ChsRtmg((^N|{n+
zi9?0c$}XdQRP0MNpKzPzlZ0Oo{>Gf_Z@E58ka^%=b6x*ss(FCJYGuCoFFgN=@B-o5
z3r+JSt}heT6E+c=NY_Ysllv`%_Xr;lwi7-fgb3df1c&JA14mP-#pim8%26ctgcaP5
ztt5=*lb6+c$-0xvS#B8BPO^eBx>g|;+Z_y)w5-_I3j$d0AOx%{tATA(rg&>@-YT^w
z)6cAoNJvw|`b`vzUP0jKMsmu^Nj=A`R#!x4LS>y~P2~(0i_Jm**$Wg@5`*<Gm33-)
zi=GR;JVq+vEmG^KG8AqtE2hi6#x%XyKv2Nc%$pyp>XZ?R2CVirri>ppX6&fZcN$f*
z%c|<?jR)o+EOS+Q0F~FW4z;?rjFzX@@f&r%ni?cYOpMo8Z_KSLn{B9Np+>o~I-(AZ
z=weTVm{sf5%;&PmLD#`SZ$??&G|}@FwbMnIXOznlcY|s4=`8D(YaEq8KqV4PY@*A0
z4Wq7XE)5F!+>k>qOyA4e8>v6H3KrKGEN`u?3FggK>mOt}Jk1Q;>%5>w`=V+rCLq)7
zGL~t`jYP;Ai|D#m)Dbe^DHFQdCOlRGOMx6-u(~z6LR}f@=#pNKEas8T0xZ=5ZXX-h
zK6n6n*Mu%1K0l&21Hq{A=p7eEA4dTDXaTZ!kT^Rq(2LH-5Q7TJGKUymYE43y4ATDi
zI*FX1d)mK29D&f<o3$J1rnx7Z^<_M-;8~7FNXNe3#kJw8RC7GnqAOTq#?|2J0F?AI
z2oDnG$-6Fp4->cL`c$)#Yw1nsA+9gnkZS&cU4yN_{W;I+#Q#R(Z%j4+#I=a)N_j3!
zH7~$FNawna=h6YG=IdNn6r`GI=keSp)!cv|@WOSe=G*d~>o%_Y^Ha^;TpPH4!PU4X
z)%;qX^H?j#b#{N&rjS3cU#eMxztPHjBa8B`PBrs*PS0iC3h!HiA735m;LFZEak^zN
zMm*fpI*z=PzjJ|eA>ni2UdFXI;cCM51bMGTCPB$m`^u)M9Y$;-5?|#ETC95Zh^=DB
zN3Jowx@N4;xD{V4Dwya54J)da9DSpGF{8fLS67bovt_|MrM?ccTUPHCQ&~}op~Pa8
z`|9d2zY=BC_-5BDmvrt-td-vAqRp!IM5BA3ZZ^*7h56yv7+a&fS_8M%VA)PgHkJ97
z7+LLZFZA);mYAkc`NOvwD1pkl8k~WdwY3k3(r~VhGEr*|<wafPj4D*ee7RTatT3iD
zI+dQQPREV&PPJ6sLWJ=4pZJkei?#gaaovSon_Yt3a9uGp)%=F*p24Z+5w1_)rseZ#
zo_k;y(|H!T%H#QLo}a!0dF5I<TFaS-_m}a!=hjs7`;?P6Dke`eDgP|&u-Mlzz!urK
zntMlEs6~R%T9)5q3Phm}A5}8!>X?;?8dRe<3lkk?i*p3Ws%mEYMDN-8F|7hZTm-fJ
zu!2ntJm%;J<VijCX4NE%$fRfki4+J<uCi)TIP;y{aXScP^<bGDuL==4qT~u7$VHZ#
z%vODa>D9janTB`PYypa$Vc91PtCW?M-Z|5J(=jcGbC(rtV=|%V6#4^P8@`unUdXiw
z|33r&qP2ql0{sD_EY+MqyodPTb4{O$p23fqdQYnPUp(iH)$M!gm{fBW&&ItmKE%U+
zVWJK9KApdm>pIf!pOk98!qvl7^6#0f*Ta=gKu^-H_fU=_Pygcm+XUgM#EHI;KhYhZ
zAS+MsPW&$wX~#>N*;U3&AI5XKEca8p%jk>=zhpnke5fTZtTuGwvc#BQHjQm7<+c3O
zvy}udq~<#HYm`^wSMp*ewt5B{qgIyG)}bAYYL?CNTRS5^Pk!;K=NYreOwrS^xD|w&
zirQKB1r}8pz@BN;KZr%80Fm8-Uyb?g@ZCSS%`jTo(7AiCuFrm+6aSLvzop-wYNl{~
zdUmRL2G^-v-O{h)dOp|I+Enu*t}j&4Ubr^!+>>h&*KDq{iNBGn!E+ARJ>=W+9pKfl
zMw;hRt^>I4pT#<9t}k#c;yRn_P_A1ZNHs@tEviP}b4@4SLOx#L`7WOGfPc5Ve-Qh|
z^=Z=2;5wD-nOr?wtGRBW9uIO|!Sw>JrCgobUM=29xiJ$Z3mt3d=FX?*V$7{5n{UjQ
zpQ?Hs9fQV&_sK$0+@z}M)7fZ9KSA$v<jO8gl$m%-b!?@?Wkesd-dGxlQfHOYdQ^;f
zgaV}8JAZbi6o><gDnvjk>#E8@%2%TnzTz_2OQ5Bd`f94^t*BP2ppZ^&X3|3dv#RJT
zBW37lK~Q_Ss(#ttQBFO(UjKG6beWTC{)4MAH`QFtwTS07uKRtgd*|B9bqm)9u3Ne0
zaoxpri<h<V@}B<vTDd;Nx_Eidvs2F5w3Q>oMF=U_=(7ouR^E&K6<aKSGJNUSXYsvQ
z%1z^`omS8CT<C;atSl>^>0GOX&Io+jJQ=bOM_g!JgN@|w^o>n<U^;yt%5!wC9yXED
z7jXi0*P^$qT(vt26z=JRC8uL1*`oPs>k?czNhS!0GamhOQU9W*RI|?|&}%XFf@`Zk
z)f~umHrHF^`4Rj!dEcPvyJb<TIf~~O7)QC2>(obM^kf&U?56EM1Djvb$1|6u<66in
zROOtv*pTv>@paU8#gp@Y+B@_3I;*PRKW$G=9*Tv46#=IM$W$avTc}u6QqqwI8cL~9
z(33P%)27Wa1Er`h;i`zB7zGr{6hWDXfJ`z-L_kH60D=O75!4qEF>28(irnvS?X}N2
ziTJ+W_jCWafAF+B&;C7Y?Ri>zpS{-(^H<GII-A;AGKzT+>6<!Qw24*|l-A~s;@XR5
z)wU-*@)s9~_T001Zwos3pfF=a-21q_{ao$dd+ymrfwE&*BTx56?Uj$~0RAbr4||LK
ztRC!p6WZ(W6utg13?Z>IqX;!~!nCfKHqzY5QEywD@Uqr<x>Dj<3E-?Z!>bM?l&=*y
zp{zBw^ld1()E~nwhGTvw?Uwh66_7_U*TbS<*)rAs`{nkiNsjMMj<2byDM<t#T2Il#
zm^GznaDK6g)ryv4Mt<boGxj^AdY|L=+&@{fSse=NGKnIYv}-FmC-YeSAOkQuxy*V+
zfuoAW>Y3bgW@S2vc@;D53&Ae@dL}o4KBo-VxqX$tJ9(e%_H%eYer{#@{V$i^vj0!b
zH23S@asRcipa=n@@S~ACeS1Ck(eG`}3-nKTSn<2u$X<JXW!munkvZc+#@Y)?ajFL2
z1YX9qgSoT$&b#nM#!23z1MK@}-Kgfq%Cri3rs15*^a*g`^Ofl%yc?mfhHvDu%5*E^
zYz^P@;33NKQRq3`wSoseSDAM39zKKdL40R1zJja3v4&}ZfO;p{MA{N;ty-r{+jKH@
z9uuJa5%UjUnB)&f_rm<TW%Cy=Oz3&!Dw&z=?Mu(qTH!A3+7IoXDT^ldl6-A~qILNC
zrH7iT2KnnaLBP^+bZvD{4xV&ya`3?nG}6J)Fn{F|v(%Zbnbx*8nK|{~sfSG6ZR-A-
zy0vi{&=SB24yjp?7@Ws%3%NW+^lYVw$OS457?E0ao+I!nKkPt5=vq(c&{3RlrdIqK
zx63?a{UIjZ!tWlJ{;*O7PjIn!P8q7T6Lss|T^o=T$`{m1etFK8=VkQEGgGIDW5~{Z
zoO1WWihs*yqz(=?2Yn44twF&AA`VA%S`KDn*vcu&%}7udylV=ugO*8BJ@XKqls|Z8
zUr+Z;6NYB?&{efc@xV-$z5ZMBOcmfnFNn#%_Fx>b=$v#YE<Ii4Q5nbjU(i$-<TD(~
zkAGQwp%jWWV&2qks5D9PC~G0LcUGoP@gBIN)JAkgPcn==dk<%Ec+2l+;i<W~GQF00
zXD#hb-{MoZ{P07U9<eZ4uyFnYMi|yZdpf&%d-$QIyJ<s@jRX22MC*>6#_M76k2yw1
zPdF2nY%rP@1<l5>rS8%Y<df~5WS^*v#1gr0avU{E=R2rh9Oyx7MOgLJNuUo;)!Jq8
z@JFI?hGT#6okyrmnz|9*82cr|NzVkw%{hp_mWfhNBA1-qVcCKKnBzIYXMXQup`@#=
zja1kXqxjaaMxt@30Z)ku>6C2V!zj+uN3sqkOI^sGLT|SYeddo^xv(L>ELnMM!$SMB
zY~iuV(j)4Xmq#qu;m?K1@?}`T3y)aL=lt?Ti^%5s`N#4L-%8H5&R;<XMgBK1mtT=z
zxMIcf70H76M;-3gSVE=uQ>@F^Jixq&vzs~ITCW)RL1ns!Fz@|%H$FYSd`qsAWG?jn
z`zzD;^R9WSGF`~K;YsFKtTi+~LH`aOyO;i&ck*-A`FPiY8-;mCzYaiyX9wSUF`F@`
zh|Y7GzbAFB>zs^<{P8^i{VdGIm~%0gVy?#Ag!v98^1bnXBM08dfj4sCjU0F*2mWt!
zfCWe$)Jfu7cC7_P^D*pF2miw_X3}ZA4`2+{deLd8WYU-a@mg2zQyIHu;Ox^gcC*N*
zz*5GvEsIOr@~*<X1*1pnO<NC1Q?1$llt0sX?|^x$zMqMXCEh>gy(8}&=FJ!la%j!#
zYT-L^?2_9t-h-e2uXR(w_PWo`gdYj7kfy2ZMcNfJ12YeE7-ltQ9p)s=>6k5;t1!1?
z9>6?_c>(hZW-5D|cE!xV%)=apS&dnTISF$*W((#j%<Y&5Fi&D$z`TN)${wg)F*7jp
zFo$7QW7c6#!kmuTg1HKFJLUn*lb9DUuVALKziL;^49q;tVVKpJb(oVdr(?EYuEN}o
zc>wby<^{|vn5pd1+7&YcGY@kZW;JFV<|NGNm@SyAFt=kKz&we00rLuGDto$i#mvCW
z!yJZLjai2|33EDT3nu1y75QKHEV9uUUl!M~^=qHSM;yIx?f{gg&Bo4jkqt!w6=qe}
zRL^EH>i-?zoPW!=H@K`c$p1HT;*Fe`*e2ho6K~Xs|5=^*cYE`HuZ9KRs?nCjLRwPI
z%4B%2jW+u!xR6w{MAuq9|InrT_cpaB)$JSms?qwhHmPP!4aeclDuq$v0!lf^Lt|Z3
z{J~N{e@wM4YF77Z=T)_KOG4^0EjHDyYx8Za2DK*D(#6z60O7T+8IOD+kI>lBs6W-_
zTX4Ci2kyA5G7g#l?fY$T#NY2$BA4lE1<6kF5lzn?m`aRfsI~B|g^<G@AIWuk4#a4W
zj`$?!od(~z0DaRVKABk<lv<liCOI(2#}>X#<U5#ek_F|T<ik(FSH%yI`VCTXlV6e(
z>oAfL#V2|4Yy?Tkk?|3)o@JOQ3rY?gL@>RFZ!uiCmpKL_*->`Mk1gA=R{*=h)i;H!
zM?V>EgV8t1pFf5#hdufyJ_#^#8~G%!ZiP>BtoS4&M?O?OTDlaD<mMkD*h<EYPYhRj
zT9qd8{Sv-k!Z#cP<(v3qPR2yOA!Ml`Jp0trQpPCn^n4l<`6Q<w&@?4^yHUcQ815O)
zr}Q?$*9c$Z;u2%dt!MF;f8rbFewyJcrWEr`EYZIUv5QYJk{apE^;0arfc8YbuYn@p
zo8WuXzu>#NjBh%8)8UJL$irwK!mhkixRUF4hEMkn=$jt#socJaiQ$gHH}*RIiT7J&
ze43|hh3`Z;^hZ20-^E1#I_IZp=M7VAF5_&)_&vx6g|GPOI<<cI-V>R4=iL4X@3LSL
z@hymnD5Gh9R4Vl(x%bv7$y4r!UeOP|Rc7(o=dLM9j>f9Ga0*1FL3KuTx!k`cFHK2y
z*o%+;ME@c#f2*Gnp5mdZKM6R5tbQZl5Q6%LfE9Y^2LcWiUhO^LknlLao8r3!)qVrr
zUe-<nRw}~$G2oyISnV!g^*o_{1+12uBx*+iYgQZPwE@$pdDJcf-rlh4f54%&sh$U{
zQlb49v1YH#ZHqYc#BtskYl`Zj_@?;mSoJO7o%BjnuL2G|hw4wjJL^?^rX;%*%UvHc
z$sb-*AK!RxCRIJ1oJ>oUqT%y0>0ceohZ^vF$2s2p;Da2i3S2>WDyd1y&Pg@z;VtL^
zrb5WS_kyb~$fV!nE&M^=Cl>kNnpjtINhbXWMI-v*&_^!Jr2X#xIB>(onN+tQiQWW`
zkK(@;Ffx=$)t`x8;N5rw=Z73`;vFCH_XDb)%cPG{b;SQ!a07ajKjGn>9hrHHe~a)x
zGO79s@n6b2w;g)GJU&;6?vMCy#6G%1MLL-h5dYng$Xj&fb9{u=?rV3eNaarakMXYB
zqaxj&f)V~XcyPap^aYxR@EACU4qTd_VU<(WffZ>5RZa9t(vg#HR?p8J!SPXeyG+1)
zfQNre{pCF=**>YBK!4u^TnBDEmhgBhyu*1HR-@mHK!lG2=Z>pL+dO~TzylwyNFR23
zxA;GTE?cLc46bTIFB@;U{~Yh3HKgCu_Z9GPEBe)_V4`0P9_&UpuJd2P`^B-!^qu&x
z_}>6-=&DE$bN6=%pNTGBcYhDKb{)EjJ^Tm3$p-Y-I({5n=tXBDU5&zf20V6FMY_`6
z{~A2Hxgu?1K}z&7aKpLig!AxT0mn!AJq3S<&L_Y4DE{ri!{CGA6W#?paA8IIxYPFp
z$4BmGPQV9&8~F`C2b0oU2X45$B2~SRe@B7`ZbJ7jZ{cHj$4CBs1l;&X_UrLc?z<<@
zKMt-Lu1Nn5UG6_4{OyYL47xVqvnTLxnSj4K0bdFJcv*YbO&Noe&<E!J-v_P*uW&pv
z!Try`joEDacF*7EC(!>i0lzi@Z-=}7eX{90J-^=p9@{sYZsT}gaI#-ERlX>F?*%vR
z&v`8`@5REiIg{q}4}q%=<jfdv@wf6GI4GOm<o@-7`~SkeJi2n_?<c`yOS9?Ap1v=D
zhnHm2-JJhoaLr=$syRlCNE(-AQ^|Yse;7Op9&r3HxKNL-IOl&>^ux(NkKbRwwGG)+
zSLDcjmUI-3%%)d6{mtOqO3t`BeGl;H(b;r&hC=a6qtb$HV}HJV@&Rxo_}zrB^c(@M
zYRsnlxPPm`wQJBlN4Rpo4m{Gz`91e<ljwzPs(6V08Qu-Ol)v+T5j?sHy><+RqJIq>
zAJy0Ez*T3X?~ae6e*-)O-rw;Z-~w3Vis;`4=g!Hdr#QYJ93T1jBk(YLnH%`1^gKR+
z{tS5VCUn$!{z$Drj&p?X^8Wa*;M#}KkLTmZBpP<(Q{<ngXIt>V^VB!T)4~0}CqH;A
ze(&NPAH`=c!<FfS_$&Gx@JOaI-NpOw1>mu1oZp~6iN17#`<24Gv-g0P=q+HKAKA@u
z7q|ev+0(Nb+&`VYKhUjyf@|K*o(AV10PB3pwT>?W>zs<ldHH`WSm#)V9p3@gxs?MP
ze^+#{<_+S11g!HT+K3_iwCLc^JN}L6`>-F_@yp;L@G8d%`K)syZ}<4W30yOyGS$3E
z{_O<Td6Ig^Ik3*5NIn-`<)m{bvAxWb`~54^Iqu&Qu+FL6?EI@mpUFN?r>_C)Jj<V*
z-X%P%GA%g%7+B|E@{T_P*7=y#j?V$>+{_N{-ym4$bWU>mHR9*I&8d#>1doF6cl-me
z&hdQO@lU`yx6|VIH==`M_<siLoR8+^O8;c)t<D3z<aj6W;9J<!09N_uz-z&h_l5Td
z*B-=v1&{B+V4VYMa`y}6p86wsPW%nx2iH127OZnbgJ6Z<4A%Lg7{8B-{sGP%IlcTu
zxZ1;M@{c_eC%S)Uf|C!j-_7~Y1M8f}UXCx9f1Ll2+^X<y2J1XX>_6`V>paPBPX94@
z1bmU>Ux05TJd$hac>!Fg<=lbO$G~?&XSg@I1ZJH>X?FTl<UE~Isdc<7Sm#(I7b!k_
zfpy*`hCd6eb1*edp9j|YmkYf8FBJb$_K|r1(E!#tnSGr9IIzyYT;{k9taC849e0D{
zqx}3Bc%Y%wo=*kW9?2d{kMEh_+=^2BJrAt&8xJ}Ct6-h$=y7}vcnEx@<6FePl5-o5
zzb*cwiLZ|j-xK{q=tg(?2w3Mh);s<gSm!%pdwLc;4E~VQUj*llE%gU~2J3uEjL&Oe
zoimC4r}UfsV9B-0|LI_zH|cQy-VWCJlKUO+1s>pxL+lR^1P_8W^Hcpk1gvu@zjyvc
z;A_hGj|Sga#-9i4+)At;?O>g6iFhM;82m~1?*!5F>;ZLrGFazoVtYLetaCS-2Pi!Q
z;8Ad#k6Z+<CHw~HitnYOvsbjy@s(hm-?`fJ<3@0yjq^K>buG2d^Dw-a|M!7)?kD0O
zf#ak4^aOa2Ga1kGQQ`dptaBZ)zj*<yb0iV}2|NTo5`M-1Rj|&fu*6_Ei=3eI9hxVK
zzCBpyJ|f-)JOW<q^gX~jClcxJ0qguo#B;%e;MhMbl6!E6yI&60`IL6Y$AEP{Wu@aL
zu+FV~$nkox&bLJWIVG43mEn`YW8gS`oetJHndR>O9I(#MME@@a>wHc0?+UQa-$Z-^
zxW5eF0Uj>H_sM;s<lhLm5ggq=2_7uNzXXqhWB&ghtn)Xz3|;yCH*kDZzL{+apR*s0
zd{p^v3)VT2I9~4r);W?s=yJaYcohCPe#`>@9lW!<p9ik(<@}iQF9GX3N*o_ofOSq~
znbVI4>-@?G9JhgWt|gY|MzGGi)H!`KSm$8=m*Y=^bxx+*@tI(qm$`XLi0_xdI{)%b
z#}|q2kJ5hyc$Bjou|3@gw(}kED809e|Kzg%4y<z^e{lNuh5I>|==fpbQ!3M6IDP`G
zb0k+feg>@bB}*MYCp!2=$1j41K2^&9m%%!x68rmC!TqPQPu$Z}LC2+YD3`hWsp`o5
zQTnEXweR~Xz9~KL1Z!XTxsGSZJ^RJ?bUX{J{o`jlejix-%(YH0_w&KpkFN3;K3x3Z
z#~goHbj~Sg9YORCu=c0N@O!}8#~$Umlfa`_SEgTb{!a@-kM-wFu=dB_>HdF3?ssRs
z6s-Ds5m@`%f9Leez}i>8zx#JRSo`SDMb1=wZU>KT;l2>^QFs`v{qz~9e;?d`ZDo4C
zkI#>TwXYs_;~xcUe}0rdeglq=^7~I<?F;@-9}oW_e)f3coyAuhWwd|zX{YZ9);{BF
zp({SSfrr7dzn%du+|D^ZPtRPi_9$QC{Iy{1T^@D344k{GB<~yr9=V(RaQZRe7xyf+
z*Cud=_)Ukd{Okbl436!&8>~IhQ6BpQSbL$huA=y!4%YtYC_kSiet(o77Yg6YIYVCJ
zzY?r{uwQq43t0PPFL!(|SeImuI(`VOeYUrHe*IMLzhA0vqhRgdjpg%eu=e%F^7*a!
z!7=_@#s7nneEScu_Wj2BWEO`b;C(&3?d8#rDpReEEB?EHKgW7+EYBI>)5`EX@W4a#
zzs|o9Jj#CD8oW{d)`N5KFLC@K@E|znxEZ__9P@uYxF0OBNA7#&{xR~?>t{b$`;Et-
zD}HBywGa7e$7h4JKe@)!GbsM2E7J=-e%FGvKe^BGE#SD`JZbVy$q&JCJv*7aL-O<l
zJO+;I*OMksPyPxX`UX1m@pi|_(~@nrFRfSS_@!$)SkEaKmH?7H9XAuc@Lb30pM)2I
zhqrRx4*L$I|0t(xeL(asaO1-nlmB)k{r$q1WYbQgPfN}Ok6nPCea9CG-<`GfU&Zfo
zaKlp->4W5t@Qq+S2Vms?ec%D~1?@_Hi~cZp2z@>e(*FuS4IX)o^#JjMUvl?nxck=}
zH#)AW!tz>0s&!`Z?+TV)rWr=(hAVK@%NdhbML!5UP?5FyvG7uG!;drR-j-j}l2u?m
zO&G<u4V>fd3$1U7zZYECwIV%AbnvOp|4q;D3&1tM$fS3ed)lYdZ*u?c5`KU?B0anx
zfpa%!Z2VPzKMfuwzIVI-FS&ckCyLLc9Z26O=adakOLhR)KAVx)4xRoET-c5KBZP_H
zEb(Wu>12fmJ_Ia%Rj+#Zhk*xA=UxUp5dBzi?YG(g=l->T<L@`}e?3?_#d?jNBp(AO
z*Mxn9qJIXQTfx0`9{yS2!5cH_``y1w!K2qyq(h#c*MbY*&Zg&k`45AuZq26CJ-!cu
zhtB8j3Xkto;M(1}TfzPR6}WLScc(f37`Wy;nN;iAiqC7{0q(*3g7a@jCKldB_>Ol0
z58qW`@`cjBCwP?KE40oo_ch>#|D8$y==_I*3y)>fa~vN9*7GxrtgZZ!p08@vZ`^+r
zoO?U>1c{FS{bFLhdcg4jcre4=e4ZZ{itbO2_casnFnIW{?DzBZ{s64s&(wdaJwM|7
zjq;Cgzv7Sd!JUF#_+|c#9hObk3KJhqR0i(MrWSwjTQzav(fA_%_kc$SxiiqiI~Y9j
zWA26#9sZ@@!mYG-Dx~ny;-^0D>-08o4gJ>&$9>?c7fS8%lVCmVmfuNoj^p3+P2pb-
z?&tTZMTY55!1}!%2z|TcHqo!mr0;V2{ouxF+4S?~AHN5I^?U*&|NhhQrH)?#OJCco
zhUs4!xJPc_4jC_x9l^OLGbS&oJa-3I{e?Z6;wQaxz_o<Go4Y?$_=<}3Vy7P={76Om
zyyxHX;KCrf*POo-ynwx_(#op%eGJ@4{`EQiH1II~U+DNO@W_=F=~Qno7lQSC+}&U2
z_yc^Cf5VRJ96tiC9nFOLPI`V0u3FArg`$(5--2sc4?e*7rzL*{C#?UU==6%Wz<&Vu
zNIHHqIJvu2ANBy(G;pV*(`Sj!6Z^*_98dE2t^qePU%n3><!=|bir@c!C`^1dPjLS^
z#}B#t3&3OiUb)KMUjrT>K1aLzTfoCN^819-?*-T1!5uAfkN*#YbF@Fn&%(bJKmFM*
z&i^vF@#;*-59k#;QNRE0;~{uDxbS=S&v<*!fgA4R9$a_7KX_m_<W2Yg{op}<KUwB@
zIk@V+Z2BfI&*Q<PmuAx!+<m8TS$sYYu6Zbv{>kZ|1xx4SjfUAfB>sEDek0}Q<zPMc
zU{oKzDf*=qsrDEtz4wC$89!@82R{KW<hXOm@r&+0)IWw=@sl6Nn}4*Ix6(g9%X+`_
z?*wis>yP#X508}kk6GZ_^Rnre+<hH*;E_!FjN|2CJz>1yPAc%&MHT6bR^HQ+kAX)R
ze-DL6@%^0hKPQa209=LMzP(+(xLo|mFWbBOTfqa@Wo>?^{P{jux-rA}nIunulP4I@
zod0?75cfA9Y5q@3{s7L=9%KEeM6ev4oJ|M4KJ5%n-if>*e&V+mc<|h8`bBqt5IFZX
zelK<UV$tzW*{t{+4UYQ}s*vy2fCrwau=NJ{R}iMY>vw(eZw4oo+%e0#s_3VJYrc!F
zPmlkA=sfE&%Ac<}w(%8w3wVh3`cBbte~;5`eBj$7j;%ij{|Y=peL30rw}Nx%<mw0S
zFnRlgEfUEH{%QUq|F%;`@x=1n+wq$%eo1l=xMqYs?H=C+;8E&FA8wSs72uJZz5U`}
zv%8;dbo7Tf*6+Yd-)F%6U(bgA8~5jc$B_3d{kXpj-0*7Feh*OmZU#%AXO+31mfQ!H
z-qbiAJqE7*X(s)K$LCq_DC5BfkMHlmHIul1%+vcfu%5XX#b-M;e4d#8960w4`U}1(
zeKWxgU!gy6|2_z=y*_K}$D$u0dXi1&h@bc#2Ohg2Yrh|ez7E{DEx(U?_<dkKr(qQS
zsbKAA3G%_t$+_T~e`M2(oc}Vg^uzW#|1Iu*Z^z#Qk6c#jA0Gja9bJ(g<o(qz#eWoc
zxp{x`2k_9hDr|j8@tyoO`V;DV94~hO>$x7I`0W86WxRY=82<NwYmvuJa(obYjQ;$C
zju(K3ke7e&`E?{%kL3^VHQ<`t_`T87*X4Are<{5G05{;@`-BPav*6+DGAZ4>mB(4&
z0rLB5$CrRdkf&|_1OGSV9{Kj|?*4A@DDuo!#}9&s=<gRh{s~x*#h>?9(fNIK5WC9n
zHE;p>HqcqW#pC{+vgtz63GdzDn!jgkzlQJ}aBk;p`ccpSL%;(UWz%asKkC7H&hhq;
z2R9&pYrd!O3g80uK|DK5erxgx=RZCxdXjtzTysm-*2@*%B~CYa75XjU#!I+o8N2BB
zf^+}i?qtW0I{!_=nCBc%^7w284^Kya_wuQD2k~b<({B9JlDB~Sx5=iDd3xRr9(f1%
zoOya{z%`7AOPv2;x&LOVJ}eRc2TJq5Rp7!ioTG967I4d7TwbQXDu73Sn<<uWKX~|C
zrSbbr@CfCx$m4sl_>qs^@BUp69{OcAea7Q=7q}MrV2kMF&kw-;KggtqczS*!OnaK|
z^yk2hj2EAFycIljQzmV7|1)&VgKuL$g14{jz+>Mm$uDmMS3S;MbnbpXa4qfgtB&V_
z^;miFUhG)=wNyUGg2%SwzPpML-}O%Kh9>&Q!Gp+$rwWsvQ=R^9r=JI|`Ze<_#zoOD
z12-VQs)DJ$-Rk_OdU)S=oOAb2fTg#3(D4gSxB9`iSHV@t|4l|`KZXQ-p4%{r-!6`i
zcf22X@Xwi0KMDUpaNN&V#roNN@iX4)rT86*Wo(yHe{&pol<^_9zgBQ9@{pyM^mU2<
zTUp!hrSzT%PN*-px__sD8^1(;DZS7?4{rE*#@166-ud7H{fG6h(7!JFJnm3@Q{cZ1
zocyS?9&sPI2KnL~`49i2;Gt((fAISDtoV25-f|Cb3_N%@^99TAY02M3=Q$6f{F;{I
z508FN7k+1s_WQ@m^ga4Ud)Qx?^lBJWcpn7!zmy66Gx1*ru4Vob<N?+Tz|xCdY3+Mj
z(gq&h1G>kr3!J09R>7w9p9F58{(eaq|IZM<za;;i4eq~#vu~oqe<}D=W#iXP;E~@k
zzZV_%-vJN)mhl^`_&+NAJAMy#JPJ;b|Dyc%5_p98?-uh1T>Go=`+(-p+1)7LS4-tn
z1uk6V^@I5A3U2sWCf(W7yAQbbo=o~2!6?3Sz$28`B*#m@xo0ZU&$&Fh609fmA4$>!
zu6-%|KBM^eJN>Fj@{j%)e2w?ls=r?W50>S}mEhVde7qz4+rZKVe+_Qs{=48Y)}w+v
zLj3{jvHH#X58#@z_WCM#l=1LBXi86JciP`pU;hB_03K%kd%Ec4e-2#3e#TgzXNms9
zQh)b;aP8kbf8bvte%22L-Tf+XLVfv`<3?c~x)Y0k0X)F?(jkodlbs&N`!70<{n4f1
z{-0E&Z<-wVZxH@oX}#?(=Rbc^@c$vvA1l?rpMh(Bl1=yW@_OF+Kj86s1w8f}&S83d
zw%G#<PmmAU_YH1LD$;xSrugm$F3{hE`NgzkuJi9FI%c6`n~#E5fvea*b*8&t<Mdcw
zCkPWiMN9sF5<EzKZE*Z~a6j!W&L_5jtA?`aTP(fPlB>bG8{ic2W9|UgUYkvWJT@))
zq1>0%w@1Ob8SEdGd%_z953rtN@)G!W;Ks)}$Kn3}P54UIlcvaj=F2J=p6f6QZ)fl@
z@~@3o(Dwz85&odjS)T<L?#ibB;o%+X?xXy6q%gmq&T#(Y!Hv|{RgOEs!xyri?06G+
z<ZD^`y-@M_EVv4J>u9H+2i6nim8%`^$v4IKF7Oz4*Q!A){oix?ADsSE$I~3Y2p)YF
zJ^0T5XK)Sj`dvn6{F28!yJ0Lpz++p{Yp?vm|GmJ2l;4|;J}sFo%y?nr8}vHx!1WdB
z`zHtfdT@^N*jD_|SA)mS!asMv7W^0FE1=O&2G`t`3G;jM;|t)1FLRf#^PdZD+`=6J
zjxPm|vj6<oj;{d6{r)?0(&#$5XFamh{r?U)_YUr2cKk4S1bH!zPfvqKkw*`4|9%S|
zytO31y$miqT56981wV#-^l|r3>Zz)^9k|PMXcyJ{q9nLkO3IT?Q>)$H*@XtV`lNs+
zSJM-WW;m%#L~C|Cx}93tl7Na|(|LuK9@kve($$Lw)6S+s2LZI@>nwz}a9KI3NZ0hW
z^PNL%YorKMiWyOdZJu?ubeRkE5}~3I4Rk%Iw?um>+UfYdfY%}}m=4jCGCe+aw(Boy
zPFwLL>Dk0B;+<#-#w}`>Hg9O^UhlfLW$o_b_!?0!G@+rrRbQm%w7pa6*U^u<p>>0N
z3=YiJo}XQPz=7|Z!^eVYLDJU{J8Y)iOYumWTGnwzcpmlW9qk)UuTX2=2&UpH9~AtB
zprll(??h>6&zn{&Fj49tGMlBO6+J|}P~3{Q=zK*-Q+G!fnsYY?okiV!I-Q4J_?FF5
z#!hH<mjS95O|PfaT}suF-o_(fdJMyb14g4{`AGa#F8ptAUU@jhM13%=y`~O0Z#=35
zraY2Vo8B)RQ5YLGZ$ybw-ZW@pIRQ=W#EH_9j;PLF%f!B>m3b%|dsVR2b7m_KQQ#Iz
zvL3BiN14xwtc!|;dV;w<sYBJEQ@ZOFU~5|w7Xp;&rWb)crQVs1s8S<4segH{6Hvm)
zjy&o;sgA@)-@RmI)pgkNUG_C-!a_9_P{>l4H?8!7U4?uv6~jpDTQ{SNZM_sl1q!|!
zd&E@YaoE*PJGZoeag%^ChvsE<R8(oNM)8@Eq9^&bHHKp#5r+u6rdT-+A6%cQK5+F!
zrxKOtZhP~hc)vp48<TN$b(2%AQVuRiLKVUF<v<q?81C4pW*^$Fxh?cHZ!!v%daY_{
zPkz>{=+s)e``Jq!lmfd*YoZpLE-%Yju7fXUZvCjSx#q5XN4TM(la_*}HOhyqIV$PQ
zlf15G)Rt}RuuqE;B8PG?ijyk@I#60hrD;(OKs8@89TruCw${?oBQ2Nht+P=fj@I3R
zy~P>gB%4A`)=@pXHlhTrB|$gdiTEQW*wRPV+N~=J1f<xM)}dx$ObHpzZ3PxfVsU7`
ztfCqYS1S+?F9EeIH3}jtb_jL@LvTy|4Sk;Z)D^F4aH3z};Hc!xRIUZ@!j%Zd;nyRW
z-LHl)d$=XStnqRT`=qS0ucl(yY<>+x_!=+Ea1?Y?2N!B=#TzjwE9?8*hj4>~0l(ZK
z+F=aN`5rETFbX{$>KD!G_f42xb=33SG#qy{Q>UdXGO+q36vm3jrRc;jc9BE?;i3w&
z`%N41DhssK_EgU~aMpY2+<SXSqQF5RgyN+d=Fs{H6}@%zQk~}(qbjn&m29T}+=El`
zbL&QD%bHMU?46MJQEh$88ueXeh}4v!aaj#7)N;l6>Q6#Xgs!^$lI5tU)2BB3Yt^oL
z&H)F^NkS-=C&80ah6QYclh_C#vf0?}-%LF}WUG60Sb@`&@na>HW!B(VXGd2^vV;lM
za}K1p=Yv}Kj;{R1uAqn>t5ra~U3GkDc)F&*Y--FsI2GWMsp31{rlD``&H7s?df8U8
znO1s;#gOHX2{&!|pt8PA@iz_i8bUnR=DznJspe!boBQ7PGG3Y{`*Ql+S&=@s272(m
zEyRxDmFS~XvCGx%D{?m6VhO`8vCw!EDhro_t${iGb+_&Lj&RY6oCIzC*n;B!PW8qi
zcio0E<leP;DR(!ERKlCZw8WcDisa3LhWDanZLpc<cOxRT_$O(Ew@*P^ys3#dZ0h6{
zn(366rO>r0u#!J*!4~w+Lknu?&0)|>Z`PowK3H)S+(;m@Pf~XuEglIez7OAm3Vb7*
zO8j6eIthyK?W3!?N9|+Cs-DfVBwanKX)0z}DSE4~Xo>WWy83`wbLR@la-ew1YB0!^
zwwukgxMQQ$NUb|I)ADZb*5*DGE@Lffg2zt1L_xehQv7<Gig**ZY)qjsd&fe=g2HkJ
zZw4!xy#<E)aMNebaBCXRO~*OGZ!GCPM`dRa4|{`Ba&<SR`P}|U$n*T@?al{v&wL_T
zK>@T?WZm$fPe`b|C0>}mYFaJwnN1J!=%jBBda+e5&1*>-{deFut<q7^b)agvkzbMt
z&0?CU`Jy5bA?WSw&YPNQeISK64W1i^X{<I1inukB+E?@5Y*Kk{bCZy~&Q22W(Y}su
zDcI*0u8pmoXzA_DQ{PZEY>chl`KV1;jzh;SXS#YsLrtgJJz|J#>e?-`x@ZX5roFj$
zLsD2D#{sBPWDKK;NzwoMzNTocvk8g3A>2BXNkdH6^+^D4UN1eQ*h|_;0qV%2*3!QG
zhPDk{t6^LkS;%ged)MWq3YEVbL+RAl)q`BX!WR1Sb$QpZYHC_dq9Cn^yW;Gnm!|*l
z4^fdTZcEk<ZjUixRr*;iFKl?D$3k*8ZLRqw{$8{MpPEZC=%cCy1?WnY6wfNDMHQ{Z
zxT+dJ2-;cmi|dykI=^0OR*zb^GQV>Eq4f*%++iXyFyGYO-LyH6KtKKi`NI4lzu;ID
zM=vFp`<j;JZC++soJfg@a$9o<-IGyUyBMv|b<F(e#kmrtXWR$sN;$?eiMt()5(J^a
zaAOzsg1&+|^aMur38hgMm-RN#b$2s)GDOWQa4kw(5NVd>HD!RXiiAmY?lHlrZGx}M
zRAJjXOmxHE)#LVK@;#e3_BNduWJ4QkN-k$5J?aZfAGjB!uW2>)JcunevkhVd-xr4n
z6s1h`?@|R?8LZT0!C*2%2dbbGt}7asffjv}?I>!oE)uWxuh!p&o|e)-p%j<d<|TJi
z1R<N3g<N8=$f}<nmz&lpyBmvi=<7nP`7TMX+>bn!bPe^fr!Q}sa6BCnTQ)TH=+2Iw
z4T>x>MAMp9i@YVAZlPck4$GvDF2z;^pG=0xhc4Nxl}4rVkQGuBU4~{c*q2j#duJm;
z>AOajwo)pVg!w3xWsDj=jbX{aCJ$6&df)knTG`j<>E%OvvY4xY<l_Q_AnUL2oGgoN
z4oaQm3g)!Mk_jRblqKSn7G~_!i8v!!p!%U1SZFv9mod5(W=j;NlVB}{HKB2N42$Iw
zZA5-8vTCCn*DTi-8uVTUGEwc~l0`b#e7>D4PD1wOY2SyPkYC|laGeH~FnL;#$1RdZ
zzO9g7yGgR4B3GW%Wc=E4Odu*M>-$i!)X~N=l~PfhF48j-0S&<uoGqjvHkG2fin{|#
z6Cjn+COS=dwm9@HN;Y#}^PS9OY-C9w(5*&p=+OmyD7o$~4~Xi9)KLBf5Aw~S1jkiV
zOKO`uRDxo+jzGh5Pq}--*w|dyT>c3+Rw(7Qj3~-4Qq`=%DlD<7L?BpvwYnw-)z4Bk
zEKvjTin2<)#Xh6Hyo*H~oDc!IE7l_Q{`8pgKX{n5iCpd^h*;%cSkfW9@-HF&rBbP5
z+|}xq{H<3Bh5jnEYwAsC#dS2??(UA(Zp+M-idgT4HJd%XhsP?fLB{$EJmESutv;29
zonN|KF2_|qg0*}`9$Bk6EC{P8Wc$Qomy}%Yn^F?y`o;WQX+vB{ihLz5-UozYToyto
z-e%}asPaigR?3z6hJ8^K@-ZQ2!g>bWq{60la@nC7@R~3j9mBBJwZ3Vsj}X=s(#4eZ
zddpM+Y~aVOmw%tB2#c|hZnO5_U8%B67;?o+9AZD!$1RQjl&wc8&JtUd=(^=~%O@<l
z)Zx2y+xNDH@O>Ux%Hmmam_O0vXKc&JT!#Ku1P98IIatTWJlCAr4F2eRShfsVPh>Rc
z1Zi4+uymmuqjuQMOf(=9pd|y8f}3N(6>A{wLQm+ToGo9MxNUe-lzb$&p50esLo7^s
ziC;ARnc!HlU`|lXdlRu0TUCY5j`p>zK$OT<lw?4Vuq<*!wKy(V(-}9?hR7EgRFvKw
z<u!{bN>dVD$edyw_Fn+3qem1}M{kh|UA`99)@>LkJ+#?$d_v+5Cv{zGxM)Lj)N<N}
z_3He_d4Ts;JxXKPF}P;U*V@kE`F6SirVVP`q4?HJEVwpJ^UFg~j7d~nO`@KY4rPzh
zvP`38Yd7<zR+jENdJwM1b-iH~qU4>`!+OFjtr4j-B+Z7-3O_x@v%R`om*O{W*xhU;
z--2A!+g0kH^R#o#)$k_tKDH>M0-KQ28`i(hm{;C~<3qg$pq653*0XNW8!I7X%jhU|
z7_roOC{e6shTG7}BOLAvEdOFDX7M%1ZMx{LoJz0%&!gEAlOvSK<yON_C=;OQ8rE_%
zMTfQJB`O|%q_ByC_^HVxDb!^0m#iue3<ew7#c3ju7s1ha^@84y@#9fXFIT-X+ooGC
zIk%#X5?US0gX7YHk3Q7M^RS3!Hd<b@m!Az(6jfg#{0b-fa()Y#?aQN!m8Bt@pr{{5
zt7D$-tGl<Wg*v2rv;IjOtEW3-z97Fsy@TDBvV$O@^0R(`6q@w1z}iT0s8&HrY7Fju
zAX5J|KJlR@s<$bY1zkf=SDuV&VXCcxLW0&rDa(eC@Y@M1s+|-R=_}=_d25}2aa>t#
zt7knlh}NWyi?Yj^+j?8ai~J<oIy({>gwV1%fZCi=B?h9$kj#yJngVdyx9pJgU3U%3
zTE1j$O)|`<MdIhoaBXw+&h9dSvN&%Sz!i%uRMw_W?lFZLV^-{jL-~|X2>D5tMHzlD
zgq``FMrz&JsX)WhdWY;LLwQwQq>-{djx%CZ*B(26OJ6Kb=9@Oyn<Nng`=*VXCD-Fj
zqhj}Lu8h@Pq2uz{R)@;Jz^$aTP$lS7^phafWBjxl7KUj3=GykUbJ|r*E5c%#VoYzV
zZY$pG%nzL7s>DBaT)O76JVNA?)^f`~$y;^062T>UmeazrTKN}ohhK5>d6b<Jb6YIn
zt7>>zVILh9v*16*`f%l3m}SYP!NH|$-QmcWW0`o^FWuOwHf7?`a-!F66Jh10>Smds
zrIIg7AlB`M*x}16mgblq*^S!3Ivbr9*YN|df?$0?_uAQYp|i_VsCAAqdBxh<N?V<<
z#qW>~my;C{^Nn(`Ml4W|-*Jh|#a{h35?WBKqml*UoXBQey<KY=Da|wMycEX{ZXS2p
z#00VOXhL6Xu_`v9<ys^O!mM4m)j)SpjIzt1)Z!3D{R9|STYSj|A6FNP%9rL9i{7rX
zk&U!PNl~TY+II7^_;;XuUKJ-WQHsE|7Ca})60j<M>RN1BbV9|ml`GQB+Wv$@n*>Nz
zwT`;0eF9b0A&l#x@9*pUSDk-sN|xhcVkF1KQY=pJ>z0ZojHYFSsrNFXg>fP9X)^4w
zvmV8|($`&IDor8UH%x4|ZA|?)PHd&2KHK<8pjPp<tS&KN{LEQY)h}Hwruc;pY{jx<
zL*K@KUX$`kx^?Wtys)NwqKwDdLic7(g}v!W9OGxZ39>dlThqi<G>!Q-oyB9j?{z|P
zg_!xG%W4D=7lZYqS6CA(&YskRvVM!~FmV;btF}v6`PL}vGv{S+bIE!cp7Z-TKbt9c
zXnNMe*yvH8k89`6J%uu<r8ICimkk;oTKrvjSzbSsYwOH}q}f2oPc;h8rW&!%Dn-Sn
z=f0KocJ;<BA)TKDS^i{2wA^QWX&x`vmqa7GM7Nwd{<c#7&FTZcWxLp;Z1tIF_<^v*
z>rz{LS4UfKcNmu~ZoU+|yg2SJ59=W|)`t3~?l3MC*5@^BTRUKFdhS7UtD&+G$AT5Y
zX!ROfv7@USx7eaS)ML2G`bFE~QtX{*oK2gM_=;0}1#9DbaY5}Ud<dIxC;$ffvWY-(
PNRTf?rs%jXmh=AsW9KzQ
literal 0
HcmV?d00001
diff --git a/src/luajit/luajit.h b/src/luajit/luajit.h
new file mode 100644
index 0000000000..b91115389d
--- /dev/null
+++ b/src/luajit/luajit.h
@@ -0,0 +1,68 @@
+/*
+** Copyright (C) 2005-2008 Mike Pall. 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.
+**
+** [ MIT license: http://www.opensource.org/licenses/mit-license.php ]
+*/
+
+/* LuaJIT -- a Just-In-Time Compiler for Lua. http://luajit.org/ */
+
+/* LuaJIT public C API. */
+#ifndef luajit_h
+#define luajit_h
+
+#include "lua.h"
+
+
+#define LUAJIT_VERSION "LuaJIT 1.1.5"
+#define LUAJIT_VERSION_NUM 10105 /* Version 1.1.5 = 01.01.05. */
+#define LUAJIT_VERSION_SYM luaJIT_version_1_1_5
+#define LUAJIT_COPYRIGHT "Copyright (C) 2005-2008 Mike Pall"
+#define LUAJIT_URL "http://luajit.org/"
+
+/* Modes for luaJIT_setmode. */
+#define LUAJIT_MODE_MASK 0x00ff
+
+enum {
+ LUAJIT_MODE_ENGINE, /* Set mode for whole JIT engine. */
+ LUAJIT_MODE_DEBUG, /* Set debug mode (idx = level). */
+
+ LUAJIT_MODE_FUNC, /* Change mode for a function. */
+ LUAJIT_MODE_ALLFUNC, /* Recurse into subroutine protos. */
+ LUAJIT_MODE_ALLSUBFUNC, /* Change only the subroutines. */
+ LUAJIT_MODE_MAX
+};
+
+/* Flags or'ed in to the mode. */
+#define LUAJIT_MODE_OFF 0x0000 /* Disable JIT compilation. */
+#define LUAJIT_MODE_ON 0x0100 /* (Re-)enable JIT compilation. */
+
+
+/* Compile a Lua function. Pass arguments as hints. */
+LUA_API int luaJIT_compile(lua_State *L, int nargs);
+
+/* Set the JIT mode for the whole engine or a function (idx = 0: self). */
+LUA_API int luaJIT_setmode(lua_State *L, int idx, int mode);
+
+/* Enforce (dynamic) linker error for version mismatches. Call from main. */
+LUA_API void LUAJIT_VERSION_SYM(void);
+
+#endif
diff --git a/src/luajit/lualib.h b/src/luajit/lualib.h
new file mode 100644
index 0000000000..c4567e9d37
--- /dev/null
+++ b/src/luajit/lualib.h
@@ -0,0 +1,56 @@
+/*
+** $Id: lualib.h,v 1.36 2005/12/27 17:12:00 roberto Exp $
+** Lua standard libraries
+** See Copyright Notice in lua.h
+*/
+
+
+#ifndef lualib_h
+#define lualib_h
+
+#include "lua.h"
+
+
+/* Key to file-handle type */
+#define LUA_FILEHANDLE "FILE*"
+
+
+#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"
+LUALIB_API int (luaopen_io) (lua_State *L);
+
+#define LUA_OSLIBNAME "os"
+LUALIB_API int (luaopen_os) (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);
+
+#define LUA_LOADLIBNAME "package"
+LUALIB_API int (luaopen_package) (lua_State *L);
+
+#define LUA_JITLIBNAME "jit"
+LUALIB_API int (luaopen_jit) (lua_State *L);
+
+
+/* open all previous libraries */
+LUALIB_API void (luaL_openlibs) (lua_State *L);
+
+
+
+#ifndef lua_assert
+#define lua_assert(x) ((void)0)
+#endif
+
+
+#endif
diff --git a/src/luajit/lundump.c b/src/luajit/lundump.c
new file mode 100644
index 0000000000..8010a45795
--- /dev/null
+++ b/src/luajit/lundump.c
@@ -0,0 +1,227 @@
+/*
+** $Id: lundump.c,v 2.7.1.4 2008/04/04 19:51:41 roberto Exp $
+** load precompiled Lua chunks
+** See Copyright Notice in lua.h
+*/
+
+#include <string.h>
+
+#define lundump_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstring.h"
+#include "lundump.h"
+#include "lzio.h"
+
+typedef struct {
+ lua_State* L;
+ ZIO* Z;
+ Mbuffer* b;
+ const char* name;
+} LoadState;
+
+#ifdef LUAC_TRUST_BINARIES
+#define IF(c,s)
+#define error(S,s)
+#else
+#define IF(c,s) if (c) error(S,s)
+
+static void error(LoadState* S, const char* why)
+{
+ luaO_pushfstring(S->L,"%s: %s in precompiled chunk",S->name,why);
+ luaD_throw(S->L,LUA_ERRSYNTAX);
+}
+#endif
+
+#define LoadMem(S,b,n,size) LoadBlock(S,b,(n)*(size))
+#define LoadByte(S) (lu_byte)LoadChar(S)
+#define LoadVar(S,x) LoadMem(S,&x,1,sizeof(x))
+#define LoadVector(S,b,n,size) LoadMem(S,b,n,size)
+
+static void LoadBlock(LoadState* S, void* b, size_t size)
+{
+ size_t r=luaZ_read(S->Z,b,size);
+ IF (r!=0, "unexpected end");
+}
+
+static int LoadChar(LoadState* S)
+{
+ char x;
+ LoadVar(S,x);
+ return x;
+}
+
+static int LoadInt(LoadState* S)
+{
+ int x;
+ LoadVar(S,x);
+ IF (x<0, "bad integer");
+ return x;
+}
+
+static lua_Number LoadNumber(LoadState* S)
+{
+ lua_Number x;
+ LoadVar(S,x);
+ return x;
+}
+
+static TString* LoadString(LoadState* S)
+{
+ size_t size;
+ LoadVar(S,size);
+ if (size==0)
+ return NULL;
+ else
+ {
+ char* s=luaZ_openspace(S->L,S->b,size);
+ LoadBlock(S,s,size);
+ return luaS_newlstr(S->L,s,size-1); /* remove trailing '\0' */
+ }
+}
+
+static void LoadCode(LoadState* S, Proto* f)
+{
+ int n=LoadInt(S);
+ f->code=luaM_newvector(S->L,n,Instruction);
+ f->sizecode=n;
+ LoadVector(S,f->code,n,sizeof(Instruction));
+}
+
+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,TValue);
+ f->sizek=n;
+ for (i=0; i<n; i++) setnilvalue(&f->k[i]);
+ for (i=0; i<n; i++)
+ {
+ TValue* o=&f->k[i];
+ int t=LoadChar(S);
+ switch (t)
+ {
+ case LUA_TNIL:
+ setnilvalue(o);
+ break;
+ case LUA_TBOOLEAN:
+ setbvalue(o,LoadChar(S)!=0);
+ break;
+ case LUA_TNUMBER:
+ setnvalue(o,LoadNumber(S));
+ break;
+ case LUA_TSTRING:
+ setsvalue2n(S->L,o,LoadString(S));
+ break;
+ default:
+ error(S,"bad constant");
+ break;
+ }
+ }
+ n=LoadInt(S);
+ f->p=luaM_newvector(S->L,n,Proto*);
+ f->sizep=n;
+ for (i=0; i<n; i++) f->p[i]=NULL;
+ for (i=0; i<n; i++) f->p[i]=LoadFunction(S,f->source);
+}
+
+static void LoadDebug(LoadState* S, Proto* f)
+{
+ int i,n;
+ n=LoadInt(S);
+ f->lineinfo=luaM_newvector(S->L,n,int);
+ f->sizelineinfo=n;
+ LoadVector(S,f->lineinfo,n,sizeof(int));
+ n=LoadInt(S);
+ f->locvars=luaM_newvector(S->L,n,LocVar);
+ f->sizelocvars=n;
+ for (i=0; i<n; i++) f->locvars[i].varname=NULL;
+ for (i=0; i<n; i++)
+ {
+ f->locvars[i].varname=LoadString(S);
+ f->locvars[i].startpc=LoadInt(S);
+ f->locvars[i].endpc=LoadInt(S);
+ }
+ n=LoadInt(S);
+ f->upvalues=luaM_newvector(S->L,n,TString*);
+ f->sizeupvalues=n;
+ for (i=0; i<n; i++) f->upvalues[i]=NULL;
+ for (i=0; i<n; i++) f->upvalues[i]=LoadString(S);
+}
+
+static Proto* LoadFunction(LoadState* S, TString* p)
+{
+ Proto* f;
+ if (++S->L->nCcalls > LUAI_MAXCCALLS) error(S,"code too deep");
+ f=luaF_newproto(S->L);
+ setptvalue2s(S->L,S->L->top,f); incr_top(S->L);
+ f->source=LoadString(S); if (f->source==NULL) f->source=p;
+ f->linedefined=LoadInt(S);
+ f->lastlinedefined=LoadInt(S);
+ f->nups=LoadByte(S);
+ f->numparams=LoadByte(S);
+ f->is_vararg=LoadByte(S);
+ f->maxstacksize=LoadByte(S);
+ LoadCode(S,f);
+ LoadConstants(S,f);
+ LoadDebug(S,f);
+ IF (!luaG_checkcode(f), "bad code");
+ S->L->top--;
+ S->L->nCcalls--;
+ return f;
+}
+
+static void LoadHeader(LoadState* S)
+{
+ char h[LUAC_HEADERSIZE];
+ char s[LUAC_HEADERSIZE];
+ luaU_header(h);
+ LoadBlock(S,s,LUAC_HEADERSIZE);
+ IF (memcmp(h,s,LUAC_HEADERSIZE)!=0, "bad header");
+}
+
+/*
+** load precompiled chunk
+*/
+Proto* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff, const char* name)
+{
+ LoadState S;
+ if (*name=='@' || *name=='=')
+ S.name=name+1;
+ else if (*name==LUA_SIGNATURE[0])
+ S.name="binary string";
+ else
+ S.name=name;
+ S.L=L;
+ S.Z=Z;
+ S.b=buff;
+ LoadHeader(&S);
+ return LoadFunction(&S,luaS_newliteral(L,"=?"));
+}
+
+/*
+* make header
+*/
+void luaU_header (char* h)
+{
+ int x=1;
+ memcpy(h,LUA_SIGNATURE,sizeof(LUA_SIGNATURE)-1);
+ h+=sizeof(LUA_SIGNATURE)-1;
+ *h++=(char)LUAC_VERSION;
+ *h++=(char)LUAC_FORMAT;
+ *h++=(char)*(char*)&x; /* endianness */
+ *h++=(char)sizeof(int);
+ *h++=(char)sizeof(size_t);
+ *h++=(char)sizeof(Instruction);
+ *h++=(char)sizeof(lua_Number);
+ *h++=(char)(((lua_Number)0.5)==0); /* is lua_Number integral? */
+}
diff --git a/src/luajit/lundump.h b/src/luajit/lundump.h
new file mode 100644
index 0000000000..c80189dbff
--- /dev/null
+++ b/src/luajit/lundump.h
@@ -0,0 +1,36 @@
+/*
+** $Id: lundump.h,v 1.37.1.1 2007/12/27 13:02:25 roberto Exp $
+** load precompiled 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 */
+LUAI_FUNC Proto* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff, const char* name);
+
+/* make header; from lundump.c */
+LUAI_FUNC void luaU_header (char* h);
+
+/* dump one chunk; from ldump.c */
+LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip);
+
+#ifdef luac_c
+/* print one chunk; from print.c */
+LUAI_FUNC void luaU_print (const Proto* f, int full);
+#endif
+
+/* for header of binary files -- this is Lua 5.1 */
+#define LUAC_VERSION 0x51
+
+/* for header of binary files -- this is the official format */
+#define LUAC_FORMAT 0
+
+/* size of header of binary files */
+#define LUAC_HEADERSIZE 12
+
+#endif
diff --git a/src/luajit/lvm.c b/src/luajit/lvm.c
new file mode 100644
index 0000000000..67389f9a29
--- /dev/null
+++ b/src/luajit/lvm.c
@@ -0,0 +1,763 @@
+/*
+** $Id: lvm.c,v 2.63.1.3 2007/12/28 15:32:23 roberto Exp $
+** Lua virtual machine
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define lvm_c
+#define LUA_CORE
+
+#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"
+
+
+
+/* limit for table tag-method chains (to avoid loops) */
+#define MAXTAGLOOP 100
+
+
+const TValue *luaV_tonumber (const TValue *obj, TValue *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[LUAI_MAXNUMBER2STR];
+ lua_Number n = nvalue(obj);
+ lua_number2str(s, n);
+ setsvalue2s(L, obj, luaS_new(L, s));
+ return 1;
+ }
+}
+
+
+static void traceexec (lua_State *L, const Instruction *pc) {
+ lu_byte mask = L->hookmask;
+ const Instruction *oldpc = L->savedpc;
+ L->savedpc = pc;
+ if ((mask & LUA_MASKCOUNT) && L->hookcount == 0) {
+ resethookcount(L);
+ luaD_callhook(L, LUA_HOOKCOUNT, -1);
+ }
+ if (mask & LUA_MASKLINE) {
+ Proto *p = ci_func(L->ci)->l.p;
+ int npc = pcRel(pc, p);
+ int newline = getline(p, npc);
+ /* call linehook when enter a new function, when jump back (loop),
+ or when enter a new line */
+ if (npc == 0 || pc <= oldpc || newline != getline(p, pcRel(oldpc, p)))
+ luaD_callhook(L, LUA_HOOKLINE, newline);
+ }
+}
+
+
+static void callTMres (lua_State *L, StkId res, const TValue *f,
+ const TValue *p1, const TValue *p2) {
+ ptrdiff_t result = savestack(L, res);
+ setobj2s(L, L->top, f); /* push function */
+ setobj2s(L, L->top+1, p1); /* 1st argument */
+ setobj2s(L, L->top+2, p2); /* 2nd argument */
+ luaD_checkstack(L, 3);
+ L->top += 3;
+ luaD_call(L, L->top - 3, 1);
+ res = restorestack(L, result);
+ L->top--;
+ setobjs2s(L, res, L->top);
+}
+
+
+
+static void callTM (lua_State *L, const TValue *f, const TValue *p1,
+ const TValue *p2, const TValue *p3) {
+ setobj2s(L, L->top, f); /* push function */
+ setobj2s(L, L->top+1, p1); /* 1st argument */
+ setobj2s(L, L->top+2, p2); /* 2nd argument */
+ setobj2s(L, L->top+3, p3); /* 3th argument */
+ luaD_checkstack(L, 4);
+ L->top += 4;
+ luaD_call(L, L->top - 4, 0);
+}
+
+
+void luaV_gettable (lua_State *L, const TValue *t, TValue *key, StkId val) {
+ int loop;
+ for (loop = 0; loop < MAXTAGLOOP; loop++) {
+ const TValue *tm;
+ if (ttistable(t)) { /* `t' is a table? */
+ Table *h = hvalue(t);
+ const TValue *res = luaH_get(h, key); /* do a primitive get */
+ if (!ttisnil(res) || /* result is no nil? */
+ (tm = fasttm(L, h->metatable, TM_INDEX)) == NULL) { /* or no TM? */
+ setobj2s(L, val, res);
+ return;
+ }
+ /* else will try the tag method */
+ }
+ else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_INDEX)))
+ luaG_typeerror(L, t, "index");
+ if (ttisfunction(tm)) {
+ callTMres(L, val, tm, t, key);
+ return;
+ }
+ t = tm; /* else repeat with `tm' */
+ }
+ luaG_runerror(L, "loop in gettable");
+}
+
+
+void luaV_settable (lua_State *L, const TValue *t, TValue *key, StkId val) {
+ int loop;
+ for (loop = 0; loop < MAXTAGLOOP; loop++) {
+ const TValue *tm;
+ if (ttistable(t)) { /* `t' is a table? */
+ Table *h = hvalue(t);
+ TValue *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(L, oldval, val);
+ luaC_barriert(L, h, val);
+ 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' */
+ }
+ luaG_runerror(L, "loop in settable");
+}
+
+
+static int call_binTM (lua_State *L, const TValue *p1, const TValue *p2,
+ StkId res, TMS event) {
+ const TValue *tm = luaT_gettmbyobj(L, p1, event); /* try first operand */
+ if (ttisnil(tm))
+ tm = luaT_gettmbyobj(L, p2, event); /* try second operand */
+ if (ttisnil(tm)) return 0;
+ callTMres(L, res, tm, p1, p2);
+ return 1;
+}
+
+
+static const TValue *get_compTM (lua_State *L, Table *mt1, Table *mt2,
+ TMS event) {
+ const TValue *tm1 = fasttm(L, mt1, event);
+ const TValue *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 TValue *p1, const TValue *p2,
+ TMS event) {
+ const TValue *tm1 = luaT_gettmbyobj(L, p1, event);
+ const TValue *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, L->top, tm1, p1, p2);
+ return !l_isfalse(L->top);
+}
+
+
+static int l_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 TValue *l, const TValue *r) {
+ int res;
+ if (ttype(l) != ttype(r))
+ return luaG_ordererror(L, l, r);
+ else if (ttisnumber(l))
+ return luai_numlt(nvalue(l), nvalue(r));
+ else if (ttisstring(l))
+ return l_strcmp(rawtsvalue(l), rawtsvalue(r)) < 0;
+ else if ((res = call_orderTM(L, l, r, TM_LT)) != -1)
+ return res;
+ return luaG_ordererror(L, l, r);
+}
+
+
+int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) {
+ int res;
+ if (ttype(l) != ttype(r))
+ return luaG_ordererror(L, l, r);
+ else if (ttisnumber(l))
+ return luai_numle(nvalue(l), nvalue(r));
+ else if (ttisstring(l))
+ return l_strcmp(rawtsvalue(l), rawtsvalue(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 TValue *t1, const TValue *t2) {
+ const TValue *tm;
+ lua_assert(ttype(t1) == ttype(t2));
+ switch (ttype(t1)) {
+ case LUA_TNIL: return 1;
+ case LUA_TNUMBER: return luai_numeq(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)->metatable, uvalue(t2)->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, L->top, 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 (!(ttisstring(top-2) || ttisnumber(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)->len == 0) /* second op is empty? */
+ (void)tostring(L, top - 2); /* result is first op (as string) */
+ else {
+ /* at least two string values; get as many as possible */
+ size_t tl = tsvalue(top-1)->len;
+ char *buffer;
+ int i;
+ /* collect total length */
+ for (n = 1; n < total && tostring(L, top-n-1); n++) {
+ size_t l = tsvalue(top-n-1)->len;
+ if (l >= MAX_SIZET - tl) luaG_runerror(L, "string length overflow");
+ tl += l;
+ }
+ 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)->len;
+ memcpy(buffer+tl, svalue(top-i), l);
+ tl += l;
+ }
+ setsvalue2s(L, 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 */
+}
+
+
+void luaV_arith (lua_State *L, StkId ra, const TValue *rb,
+ const TValue *rc, TMS op) {
+ TValue tempb, tempc;
+ const TValue *b, *c;
+ if ((b = luaV_tonumber(rb, &tempb)) != NULL &&
+ (c = luaV_tonumber(rc, &tempc)) != NULL) {
+ lua_Number nb = nvalue(b), nc = nvalue(c);
+ switch (op) {
+ case TM_ADD: setnvalue(ra, luai_numadd(nb, nc)); break;
+ case TM_SUB: setnvalue(ra, luai_numsub(nb, nc)); break;
+ case TM_MUL: setnvalue(ra, luai_nummul(nb, nc)); break;
+ case TM_DIV: setnvalue(ra, luai_numdiv(nb, nc)); break;
+ case TM_MOD: setnvalue(ra, luai_nummod(nb, nc)); break;
+ case TM_POW: setnvalue(ra, luai_numpow(nb, nc)); break;
+ case TM_UNM: setnvalue(ra, luai_numunm(nb)); 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)) break; }
+
+#define RA(i) (base+GETARG_A(i))
+/* to be used after possible stack reallocation */
+#define RB(i) check_exp(getBMode(GET_OPCODE(i)) == OpArgR, base+GETARG_B(i))
+#define RC(i) check_exp(getCMode(GET_OPCODE(i)) == OpArgR, base+GETARG_C(i))
+#define RKB(i) check_exp(getBMode(GET_OPCODE(i)) == OpArgK, \
+ ISK(GETARG_B(i)) ? k+INDEXK(GETARG_B(i)) : base+GETARG_B(i))
+#define RKC(i) check_exp(getCMode(GET_OPCODE(i)) == OpArgK, \
+ ISK(GETARG_C(i)) ? k+INDEXK(GETARG_C(i)) : base+GETARG_C(i))
+#define KBx(i) check_exp(getBMode(GET_OPCODE(i)) == OpArgK, k+GETARG_Bx(i))
+
+
+#define dojump(L,pc,i) {(pc) += (i); luai_threadyield(L);}
+
+
+#define Protect(x) { L->savedpc = pc; {x;}; base = L->base; }
+
+
+#define arith_op(op,tm) { \
+ TValue *rb = RKB(i); \
+ TValue *rc = RKC(i); \
+ if (ttisnumber(rb) && ttisnumber(rc)) { \
+ lua_Number nb = nvalue(rb), nc = nvalue(rc); \
+ setnvalue(ra, op(nb, nc)); \
+ } \
+ else \
+ Protect(luaV_arith(L, ra, rb, rc, tm)); \
+ }
+
+
+
+void luaV_execute (lua_State *L, int nexeccalls) {
+ LClosure *cl;
+ StkId base;
+ TValue *k;
+ const Instruction *pc;
+ reentry: /* entry point */
+ lua_assert(isLua(L->ci));
+ pc = L->savedpc;
+ cl = &clvalue(L->ci->func)->l;
+ base = L->base;
+ k = cl->p->k;
+ /* main loop of interpreter */
+ for (;;) {
+ const Instruction i = *pc++;
+ StkId ra;
+ if ((L->hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) &&
+ (--L->hookcount == 0 || L->hookmask & LUA_MASKLINE)) {
+ traceexec(L, pc);
+ if (L->status == LUA_YIELD) { /* did hook yield? */
+ L->savedpc = pc - 1;
+ return;
+ }
+ base = L->base;
+ }
+ /* warning!! several calls may realloc the stack and invalidate `ra' */
+ ra = RA(i);
+ lua_assert(base == L->base && L->base == L->ci->base);
+ lua_assert(base <= L->top && L->top <= L->stack + L->stacksize);
+ lua_assert(L->top == L->ci->top || luaG_checkopenop(i));
+ switch (GET_OPCODE(i)) {
+ case OP_MOVE: {
+ setobjs2s(L, ra, RB(i));
+ continue;
+ }
+ case OP_LOADK: {
+ setobj2s(L, ra, KBx(i));
+ continue;
+ }
+ case OP_LOADBOOL: {
+ setbvalue(ra, GETARG_B(i));
+ if (GETARG_C(i)) pc++; /* skip next instruction (if C) */
+ continue;
+ }
+ case OP_LOADNIL: {
+ TValue *rb = RB(i);
+ do {
+ setnilvalue(rb--);
+ } while (rb >= ra);
+ continue;
+ }
+ case OP_GETUPVAL: {
+ int b = GETARG_B(i);
+ setobj2s(L, ra, cl->upvals[b]->v);
+ continue;
+ }
+ case OP_GETGLOBAL: {
+ TValue g;
+ TValue *rb = KBx(i);
+ sethvalue(L, &g, cl->env);
+ lua_assert(ttisstring(rb));
+ Protect(luaV_gettable(L, &g, rb, ra));
+ continue;
+ }
+ case OP_GETTABLE: {
+ Protect(luaV_gettable(L, RB(i), RKC(i), ra));
+ continue;
+ }
+ case OP_SETGLOBAL: {
+ TValue g;
+ sethvalue(L, &g, cl->env);
+ lua_assert(ttisstring(KBx(i)));
+ Protect(luaV_settable(L, &g, KBx(i), ra));
+ continue;
+ }
+ case OP_SETUPVAL: {
+ UpVal *uv = cl->upvals[GETARG_B(i)];
+ setobj(L, uv->v, ra);
+ luaC_barrier(L, uv, ra);
+ continue;
+ }
+ case OP_SETTABLE: {
+ Protect(luaV_settable(L, ra, RKB(i), RKC(i)));
+ continue;
+ }
+ case OP_NEWTABLE: {
+ int b = GETARG_B(i);
+ int c = GETARG_C(i);
+ sethvalue(L, ra, luaH_new(L, luaO_fb2int(b), luaO_fb2int(c)));
+ Protect(luaC_checkGC(L));
+ continue;
+ }
+ case OP_SELF: {
+ StkId rb = RB(i);
+ setobjs2s(L, ra+1, rb);
+ Protect(luaV_gettable(L, rb, RKC(i), ra));
+ continue;
+ }
+ case OP_ADD: {
+ arith_op(luai_numadd, TM_ADD);
+ continue;
+ }
+ case OP_SUB: {
+ arith_op(luai_numsub, TM_SUB);
+ continue;
+ }
+ case OP_MUL: {
+ arith_op(luai_nummul, TM_MUL);
+ continue;
+ }
+ case OP_DIV: {
+ arith_op(luai_numdiv, TM_DIV);
+ continue;
+ }
+ case OP_MOD: {
+ arith_op(luai_nummod, TM_MOD);
+ continue;
+ }
+ case OP_POW: {
+ arith_op(luai_numpow, TM_POW);
+ continue;
+ }
+ case OP_UNM: {
+ TValue *rb = RB(i);
+ if (ttisnumber(rb)) {
+ lua_Number nb = nvalue(rb);
+ setnvalue(ra, luai_numunm(nb));
+ }
+ else {
+ Protect(luaV_arith(L, ra, rb, rb, TM_UNM));
+ }
+ continue;
+ }
+ case OP_NOT: {
+ int res = l_isfalse(RB(i)); /* next assignment may change this value */
+ setbvalue(ra, res);
+ continue;
+ }
+ case OP_LEN: {
+ const TValue *rb = RB(i);
+ switch (ttype(rb)) {
+ case LUA_TTABLE: {
+ setnvalue(ra, cast_num(luaH_getn(hvalue(rb))));
+ break;
+ }
+ case LUA_TSTRING: {
+ setnvalue(ra, cast_num(tsvalue(rb)->len));
+ break;
+ }
+ default: { /* try metamethod */
+ Protect(
+ if (!call_binTM(L, rb, luaO_nilobject, ra, TM_LEN))
+ luaG_typeerror(L, rb, "get length of");
+ )
+ }
+ }
+ continue;
+ }
+ case OP_CONCAT: {
+ int b = GETARG_B(i);
+ int c = GETARG_C(i);
+ Protect(luaV_concat(L, c-b+1, c); luaC_checkGC(L));
+ setobjs2s(L, RA(i), base+b);
+ continue;
+ }
+ case OP_JMP: {
+ dojump(L, pc, GETARG_sBx(i));
+ continue;
+ }
+ case OP_EQ: {
+ TValue *rb = RKB(i);
+ TValue *rc = RKC(i);
+ Protect(
+ if (equalobj(L, rb, rc) == GETARG_A(i))
+ dojump(L, pc, GETARG_sBx(*pc));
+ )
+ pc++;
+ continue;
+ }
+ case OP_LT: {
+ Protect(
+ if (luaV_lessthan(L, RKB(i), RKC(i)) == GETARG_A(i))
+ dojump(L, pc, GETARG_sBx(*pc));
+ )
+ pc++;
+ continue;
+ }
+ case OP_LE: {
+ Protect(
+ if (luaV_lessequal(L, RKB(i), RKC(i)) == GETARG_A(i))
+ dojump(L, pc, GETARG_sBx(*pc));
+ )
+ pc++;
+ continue;
+ }
+ case OP_TEST: {
+ if (l_isfalse(ra) != GETARG_C(i))
+ dojump(L, pc, GETARG_sBx(*pc));
+ pc++;
+ continue;
+ }
+ case OP_TESTSET: {
+ TValue *rb = RB(i);
+ if (l_isfalse(rb) != GETARG_C(i)) {
+ setobjs2s(L, ra, rb);
+ dojump(L, pc, GETARG_sBx(*pc));
+ }
+ pc++;
+ continue;
+ }
+ case OP_CALL: {
+ int b = GETARG_B(i);
+ int nresults = GETARG_C(i) - 1;
+ if (b != 0) L->top = ra+b; /* else previous instruction set top */
+ L->savedpc = pc;
+ switch (luaD_precall(L, ra, nresults)) {
+ case PCRLUA: {
+ nexeccalls++;
+ goto reentry; /* restart luaV_execute over new Lua function */
+ }
+ case PCRC: {
+ /* it was a C function (`precall' called it); adjust results */
+ if (nresults >= 0) L->top = L->ci->top;
+ base = L->base;
+ continue;
+ }
+ default: {
+ return; /* yield */
+ }
+ }
+ }
+ case OP_TAILCALL: {
+ int b = GETARG_B(i);
+ if (b != 0) L->top = ra+b; /* else previous instruction set top */
+ L->savedpc = pc;
+ lua_assert(GETARG_C(i) - 1 == LUA_MULTRET);
+ switch (luaD_precall(L, ra, LUA_MULTRET)) {
+ case PCRLUA: {
+ /* tail call: put new frame in place of previous one */
+ CallInfo *ci = L->ci - 1; /* previous frame */
+ int aux;
+ StkId func = ci->func;
+ StkId pfunc = (ci+1)->func; /* previous function index */
+ if (L->openupval) luaF_close(L, ci->base);
+ L->base = ci->base = ci->func + ((ci+1)->base - pfunc);
+ for (aux = 0; pfunc+aux < L->top; aux++) /* move frame down */
+ setobjs2s(L, func+aux, pfunc+aux);
+ ci->top = L->top = func+aux; /* correct top */
+ lua_assert(L->top == L->base + clvalue(func)->l.p->maxstacksize);
+ ci->savedpc = L->savedpc;
+ ci->tailcalls++; /* one more call lost */
+ L->ci--; /* remove new frame */
+ goto reentry;
+ }
+ case PCRC: { /* it was a C function (`precall' called it) */
+ base = L->base;
+ continue;
+ }
+ default: {
+ return; /* yield */
+ }
+ }
+ }
+ case OP_RETURN: {
+ int b = GETARG_B(i);
+ if (b != 0) L->top = ra+b-1;
+ if (L->openupval) luaF_close(L, base);
+ L->savedpc = pc;
+ b = luaD_poscall(L, ra);
+ if (--nexeccalls == 0) /* was previous function running `here'? */
+ return; /* no: return */
+ else { /* yes: continue its execution */
+ if (b) L->top = L->ci->top;
+ lua_assert(isLua(L->ci));
+ lua_assert(GET_OPCODE(*((L->ci)->savedpc - 1)) == OP_CALL);
+ goto reentry;
+ }
+ }
+ case OP_FORLOOP: {
+ lua_Number step = nvalue(ra+2);
+ lua_Number idx = luai_numadd(nvalue(ra), step); /* increment index */
+ lua_Number limit = nvalue(ra+1);
+ if (luai_numlt(0, step) ? luai_numle(idx, limit)
+ : luai_numle(limit, idx)) {
+ dojump(L, pc, GETARG_sBx(i)); /* jump back */
+ setnvalue(ra, idx); /* update internal index... */
+ setnvalue(ra+3, idx); /* ...and external index */
+ }
+ continue;
+ }
+ case OP_FORPREP: {
+ const TValue *init = ra;
+ const TValue *plimit = ra+1;
+ const TValue *pstep = ra+2;
+ L->savedpc = pc; /* next steps may throw errors */
+ if (!tonumber(init, ra))
+ luaG_runerror(L, LUA_QL("for") " initial value must be a number");
+ else if (!tonumber(plimit, ra+1))
+ luaG_runerror(L, LUA_QL("for") " limit must be a number");
+ else if (!tonumber(pstep, ra+2))
+ luaG_runerror(L, LUA_QL("for") " step must be a number");
+ setnvalue(ra, luai_numsub(nvalue(ra), nvalue(pstep)));
+ dojump(L, pc, GETARG_sBx(i));
+ continue;
+ }
+ case OP_TFORLOOP: {
+ StkId cb = ra + 3; /* call base */
+ setobjs2s(L, cb+2, ra+2);
+ setobjs2s(L, cb+1, ra+1);
+ setobjs2s(L, cb, ra);
+ L->top = cb+3; /* func. + 2 args (state and index) */
+ Protect(luaD_call(L, cb, GETARG_C(i)));
+ L->top = L->ci->top;
+ cb = RA(i) + 3; /* previous call may change the stack */
+ if (!ttisnil(cb)) { /* continue loop? */
+ setobjs2s(L, cb-1, cb); /* save control variable */
+ dojump(L, pc, GETARG_sBx(*pc)); /* jump back */
+ }
+ pc++;
+ continue;
+ }
+ case OP_SETLIST: {
+ int n = GETARG_B(i);
+ int c = GETARG_C(i);
+ int last;
+ Table *h;
+ if (n == 0) {
+ n = cast_int(L->top - ra) - 1;
+ L->top = L->ci->top;
+ }
+ if (c == 0) c = cast_int(*pc++);
+ runtime_check(L, ttistable(ra));
+ h = hvalue(ra);
+ last = ((c-1)*LFIELDS_PER_FLUSH) + n;
+ if (last > h->sizearray) /* needs more space? */
+ luaH_resizearray(L, h, last); /* pre-alloc it at once */
+ for (; n > 0; n--) {
+ TValue *val = ra+n;
+ setobj2t(L, luaH_setnum(L, h, last--), val);
+ luaC_barriert(L, h, val);
+ }
+ continue;
+ }
+ case OP_CLOSE: {
+ luaF_close(L, ra);
+ continue;
+ }
+ 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->env);
+ 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(L, ra, ncl);
+ Protect(luaC_checkGC(L));
+ continue;
+ }
+ case OP_VARARG: {
+ int b = GETARG_B(i) - 1;
+ int j;
+ CallInfo *ci = L->ci;
+ int n = cast_int(ci->base - ci->func) - cl->p->numparams - 1;
+ if (b == LUA_MULTRET) {
+ Protect(luaD_checkstack(L, n));
+ ra = RA(i); /* previous call may change the stack */
+ b = n;
+ L->top = ra + n;
+ }
+ for (j = 0; j < b; j++) {
+ if (j < n) {
+ setobjs2s(L, ra + j, ci->base - n + j);
+ }
+ else {
+ setnilvalue(ra + j);
+ }
+ }
+ continue;
+ }
+ }
+ }
+}
+
diff --git a/src/luajit/lvm.h b/src/luajit/lvm.h
new file mode 100644
index 0000000000..506a29411f
--- /dev/null
+++ b/src/luajit/lvm.h
@@ -0,0 +1,40 @@
+/*
+** $Id: lvm.h,v 2.5.1.1 2007/12/27 13:02:25 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))
+
+
+LUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r);
+LUAI_FUNC int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r);
+LUAI_FUNC int luaV_equalval (lua_State *L, const TValue *t1, const TValue *t2);
+LUAI_FUNC const TValue *luaV_tonumber (const TValue *obj, TValue *n);
+LUAI_FUNC int luaV_tostring (lua_State *L, StkId obj);
+LUAI_FUNC void luaV_gettable (lua_State *L, const TValue *t, TValue *key,
+ StkId val);
+LUAI_FUNC void luaV_settable (lua_State *L, const TValue *t, TValue *key,
+ StkId val);
+LUAI_FUNC void luaV_arith (lua_State *L, StkId ra, const TValue *rb,
+ const TValue *rc, TMS op);
+
+LUAI_FUNC void luaV_execute (lua_State *L, int nexeccalls);
+LUAI_FUNC void luaV_concat (lua_State *L, int total, int last);
+
+#endif
diff --git a/src/luajit/lzio.c b/src/luajit/lzio.c
new file mode 100644
index 0000000000..293edd59b0
--- /dev/null
+++ b/src/luajit/lzio.c
@@ -0,0 +1,82 @@
+/*
+** $Id: lzio.c,v 1.31.1.1 2007/12/27 13:02:25 roberto Exp $
+** a generic input stream interface
+** See Copyright Notice in lua.h
+*/
+
+
+#include <string.h>
+
+#define lzio_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "llimits.h"
+#include "lmem.h"
+#include "lstate.h"
+#include "lzio.h"
+
+
+int luaZ_fill (ZIO *z) {
+ size_t size;
+ lua_State *L = z->L;
+ const char *buff;
+ lua_unlock(L);
+ buff = z->reader(L, z->data, &size);
+ lua_lock(L);
+ if (buff == NULL || size == 0) return EOZ;
+ z->n = size - 1;
+ z->p = buff;
+ return char2int(*(z->p++));
+}
+
+
+int luaZ_lookahead (ZIO *z) {
+ if (z->n == 0) {
+ if (luaZ_fill(z) == EOZ)
+ return EOZ;
+ else {
+ z->n++; /* luaZ_fill removed first byte; put back it */
+ z->p--;
+ }
+ }
+ return char2int(*z->p);
+}
+
+
+void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) {
+ z->L = L;
+ z->reader = reader;
+ z->data = data;
+ z->n = 0;
+ z->p = NULL;
+}
+
+
+/* --------------------------------------------------------------- read --- */
+size_t luaZ_read (ZIO *z, void *b, size_t n) {
+ while (n) {
+ size_t m;
+ if (luaZ_lookahead(z) == EOZ)
+ return n; /* return number of missing bytes */
+ m = (n <= z->n) ? n : z->n; /* min. between n and z->n */
+ memcpy(b, z->p, m);
+ z->n -= m;
+ z->p += m;
+ b = (char *)b + m;
+ n -= m;
+ }
+ return 0;
+}
+
+/* ------------------------------------------------------------------------ */
+char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n) {
+ if (n > buff->buffsize) {
+ if (n < LUA_MINBUFFER) n = LUA_MINBUFFER;
+ luaZ_resizebuffer(L, buff, n);
+ }
+ return buff->buffer;
+}
+
+
diff --git a/src/luajit/lzio.h b/src/luajit/lzio.h
new file mode 100644
index 0000000000..51d695d8c1
--- /dev/null
+++ b/src/luajit/lzio.h
@@ -0,0 +1,67 @@
+/*
+** $Id: lzio.h,v 1.21.1.1 2007/12/27 13:02:25 roberto Exp $
+** Buffered streams
+** See Copyright Notice in lua.h
+*/
+
+
+#ifndef lzio_h
+#define lzio_h
+
+#include "lua.h"
+
+#include "lmem.h"
+
+
+#define EOZ (-1) /* end of stream */
+
+typedef struct Zio ZIO;
+
+#define char2int(c) cast(int, cast(unsigned char, (c)))
+
+#define zgetc(z) (((z)->n--)>0 ? char2int(*(z)->p++) : luaZ_fill(z))
+
+typedef struct Mbuffer {
+ char *buffer;
+ size_t n;
+ size_t buffsize;
+} Mbuffer;
+
+#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0)
+
+#define luaZ_buffer(buff) ((buff)->buffer)
+#define luaZ_sizebuffer(buff) ((buff)->buffsize)
+#define luaZ_bufflen(buff) ((buff)->n)
+
+#define luaZ_resetbuffer(buff) ((buff)->n = 0)
+
+
+#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)
+
+
+LUAI_FUNC char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n);
+LUAI_FUNC void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader,
+ void *data);
+LUAI_FUNC size_t luaZ_read (ZIO* z, void* b, size_t n); /* read next n bytes */
+LUAI_FUNC int luaZ_lookahead (ZIO *z);
+
+
+
+/* --------- Private Part ------------------ */
+
+struct Zio {
+ size_t n; /* bytes still unread */
+ const char *p; /* current position in buffer */
+ lua_Reader reader;
+ void* data; /* additional data */
+ lua_State *L; /* Lua state (for reader) */
+};
+
+
+LUAI_FUNC int luaZ_fill (ZIO *z);
+
+#endif
diff --git a/src/luajit/print.c b/src/luajit/print.c
new file mode 100644
index 0000000000..e240cfc3c6
--- /dev/null
+++ b/src/luajit/print.c
@@ -0,0 +1,227 @@
+/*
+** $Id: print.c,v 1.55a 2006/05/31 13:30:05 lhf Exp $
+** print bytecodes
+** See Copyright Notice in lua.h
+*/
+
+#include <ctype.h>
+#include <stdio.h>
+
+#define luac_c
+#define LUA_CORE
+
+#include "ldebug.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lundump.h"
+
+#define PrintFunction luaU_print
+
+#define Sizeof(x) ((int)sizeof(x))
+#define VOID(p) ((const void*)(p))
+
+static void PrintString(const TString* ts)
+{
+ const char* s=getstr(ts);
+ size_t i,n=ts->tsv.len;
+ putchar('"');
+ for (i=0; i<n; i++)
+ {
+ int c=s[i];
+ switch (c)
+ {
+ case '"': printf("\\\""); break;
+ case '\\': printf("\\\\"); break;
+ case '\a': printf("\\a"); break;
+ case '\b': printf("\\b"); break;
+ case '\f': printf("\\f"); break;
+ case '\n': printf("\\n"); break;
+ case '\r': printf("\\r"); break;
+ case '\t': printf("\\t"); break;
+ case '\v': printf("\\v"); break;
+ default: if (isprint((unsigned char)c))
+ putchar(c);
+ else
+ printf("\\%03u",(unsigned char)c);
+ }
+ }
+ putchar('"');
+}
+
+static void PrintConstant(const Proto* f, int i)
+{
+ const TValue* o=&f->k[i];
+ switch (ttype(o))
+ {
+ case LUA_TNIL:
+ printf("nil");
+ break;
+ case LUA_TBOOLEAN:
+ printf(bvalue(o) ? "true" : "false");
+ break;
+ case LUA_TNUMBER:
+ printf(LUA_NUMBER_FMT,nvalue(o));
+ break;
+ case LUA_TSTRING:
+ PrintString(rawtsvalue(o));
+ 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 bx=GETARG_Bx(i);
+ int sbx=GETARG_sBx(i);
+ int line=getline(f,pc);
+ printf("\t%d\t",pc+1);
+ if (line>0) printf("[%d]\t",line); else printf("[-]\t");
+ printf("%-9s\t",luaP_opnames[o]);
+ switch (getOpMode(o))
+ {
+ case iABC:
+ printf("%d",a);
+ if (getBMode(o)!=OpArgN) printf(" %d",ISK(b) ? (-1-INDEXK(b)) : b);
+ if (getCMode(o)!=OpArgN) printf(" %d",ISK(c) ? (-1-INDEXK(c)) : c);
+ break;
+ case iABx:
+ if (getBMode(o)==OpArgK) printf("%d %d",a,-1-bx); else printf("%d %d",a,bx);
+ break;
+ case iAsBx:
+ if (o==OP_JMP) printf("%d",sbx); else printf("%d %d",a,sbx);
+ break;
+ }
+ switch (o)
+ {
+ case OP_LOADK:
+ printf("\t; "); PrintConstant(f,bx);
+ 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[bx]));
+ break;
+ case OP_GETTABLE:
+ case OP_SELF:
+ if (ISK(c)) { printf("\t; "); PrintConstant(f,INDEXK(c)); }
+ break;
+ case OP_SETTABLE:
+ case OP_ADD:
+ case OP_SUB:
+ case OP_MUL:
+ case OP_DIV:
+ case OP_POW:
+ case OP_EQ:
+ case OP_LT:
+ case OP_LE:
+ if (ISK(b) || ISK(c))
+ {
+ printf("\t; ");
+ if (ISK(b)) PrintConstant(f,INDEXK(b)); else printf("-");
+ printf(" ");
+ if (ISK(c)) PrintConstant(f,INDEXK(c)); else printf("-");
+ }
+ break;
+ case OP_JMP:
+ case OP_FORLOOP:
+ case OP_FORPREP:
+ printf("\t; to %d",sbx+pc+2);
+ break;
+ case OP_CLOSURE:
+ printf("\t; %p",VOID(f->p[bx]));
+ break;
+ case OP_SETLIST:
+ if (c==0) printf("\t; %d",(int)code[++pc]);
+ else printf("\t; %d",c);
+ break;
+ default:
+ break;
+ }
+ printf("\n");
+ }
+}
+
+#define SS(x) (x==1)?"":"s"
+#define S(x) x,SS(x)
+
+static void PrintHeader(const Proto* f)
+{
+ const char* s=getstr(f->source);
+ if (*s=='@' || *s=='=')
+ s++;
+ else if (*s==LUA_SIGNATURE[0])
+ s="(bstring)";
+ else
+ s="(string)";
+ printf("\n%s <%s:%d,%d> (%d instruction%s, %d bytes at %p)\n",
+ (f->linedefined==0)?"main":"function",s,
+ f->linedefined,f->lastlinedefined,
+ S(f->sizecode),f->sizecode*Sizeof(Instruction),VOID(f));
+ printf("%d%s param%s, %d slot%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));
+}
+
+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+1);
+ 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+1,f->locvars[i].endpc+1);
+ }
+}
+
+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]));
+ }
+}
+
+void PrintFunction(const Proto* f, int full)
+{
+ int i,n=f->sizep;
+ PrintHeader(f);
+ PrintCode(f);
+ if (full)
+ {
+ PrintConstants(f);
+ PrintLocals(f);
+ PrintUpvalues(f);
+ }
+ for (i=0; i<n; i++) PrintFunction(f->p[i],full);
+}
--
GitLab