├── .gitignore ├── .travis.yml ├── CoordinatedOmission └── wrk2_CleanVsCO.png ├── LICENSE ├── Makefile ├── NOTICE ├── README.md ├── SCRIPTING ├── deps └── luajit │ ├── COPYRIGHT │ ├── Makefile │ ├── README │ ├── doc │ ├── bluequad-print.css │ ├── bluequad.css │ ├── changes.html │ ├── contact.html │ ├── ext_c_api.html │ ├── ext_ffi.html │ ├── ext_ffi_api.html │ ├── ext_ffi_semantics.html │ ├── ext_ffi_tutorial.html │ ├── ext_jit.html │ ├── extensions.html │ ├── faq.html │ ├── img │ │ └── contact.png │ ├── install.html │ ├── luajit.html │ ├── running.html │ └── status.html │ ├── dynasm │ ├── dasm_arm.h │ ├── dasm_arm.lua │ ├── dasm_mips.h │ ├── dasm_mips.lua │ ├── dasm_ppc.h │ ├── dasm_ppc.lua │ ├── dasm_proto.h │ ├── dasm_x64.lua │ ├── dasm_x86.h │ ├── dasm_x86.lua │ └── dynasm.lua │ ├── etc │ ├── luajit.1 │ └── luajit.pc │ └── src │ ├── Makefile │ ├── Makefile.dep │ ├── host │ ├── README │ ├── buildvm.c │ ├── buildvm.h │ ├── buildvm_asm.c │ ├── buildvm_fold.c │ ├── buildvm_lib.c │ ├── buildvm_peobj.c │ ├── genminilua.lua │ └── minilua.c │ ├── jit │ ├── bc.lua │ ├── bcsave.lua │ ├── dis_arm.lua │ ├── dis_mips.lua │ ├── dis_mipsel.lua │ ├── dis_ppc.lua │ ├── dis_x64.lua │ ├── dis_x86.lua │ ├── dump.lua │ └── v.lua │ ├── lauxlib.h │ ├── lib_aux.c │ ├── lib_base.c │ ├── lib_bit.c │ ├── lib_debug.c │ ├── lib_ffi.c │ ├── lib_init.c │ ├── lib_io.c │ ├── lib_jit.c │ ├── lib_math.c │ ├── lib_os.c │ ├── lib_package.c │ ├── lib_string.c │ ├── lib_table.c │ ├── lj.supp │ ├── lj_alloc.c │ ├── lj_alloc.h │ ├── lj_api.c │ ├── lj_arch.h │ ├── lj_asm.c │ ├── lj_asm.h │ ├── lj_asm_arm.h │ ├── lj_asm_mips.h │ ├── lj_asm_ppc.h │ ├── lj_asm_x86.h │ ├── lj_bc.c │ ├── lj_bc.h │ ├── lj_bcdump.h │ ├── lj_bcread.c │ ├── lj_bcwrite.c │ ├── lj_carith.c │ ├── lj_carith.h │ ├── lj_ccall.c │ ├── lj_ccall.h │ ├── lj_ccallback.c │ ├── lj_ccallback.h │ ├── lj_cconv.c │ ├── lj_cconv.h │ ├── lj_cdata.c │ ├── lj_cdata.h │ ├── lj_char.c │ ├── lj_char.h │ ├── lj_clib.c │ ├── lj_clib.h │ ├── lj_cparse.c │ ├── lj_cparse.h │ ├── lj_crecord.c │ ├── lj_crecord.h │ ├── lj_ctype.c │ ├── lj_ctype.h │ ├── lj_debug.c │ ├── lj_debug.h │ ├── lj_def.h │ ├── lj_dispatch.c │ ├── lj_dispatch.h │ ├── lj_emit_arm.h │ ├── lj_emit_mips.h │ ├── lj_emit_ppc.h │ ├── lj_emit_x86.h │ ├── lj_err.c │ ├── lj_err.h │ ├── lj_errmsg.h │ ├── lj_ff.h │ ├── lj_ffrecord.c │ ├── lj_ffrecord.h │ ├── lj_frame.h │ ├── lj_func.c │ ├── lj_func.h │ ├── lj_gc.c │ ├── lj_gc.h │ ├── lj_gdbjit.c │ ├── lj_gdbjit.h │ ├── lj_ir.c │ ├── lj_ir.h │ ├── lj_ircall.h │ ├── lj_iropt.h │ ├── lj_jit.h │ ├── lj_lex.c │ ├── lj_lex.h │ ├── lj_lib.c │ ├── lj_lib.h │ ├── lj_load.c │ ├── lj_mcode.c │ ├── lj_mcode.h │ ├── lj_meta.c │ ├── lj_meta.h │ ├── lj_obj.c │ ├── lj_obj.h │ ├── lj_opt_dce.c │ ├── lj_opt_fold.c │ ├── lj_opt_loop.c │ ├── lj_opt_mem.c │ ├── lj_opt_narrow.c │ ├── lj_opt_sink.c │ ├── lj_opt_split.c │ ├── lj_parse.c │ ├── lj_parse.h │ ├── lj_record.c │ ├── lj_record.h │ ├── lj_snap.c │ ├── lj_snap.h │ ├── lj_state.c │ ├── lj_state.h │ ├── lj_str.c │ ├── lj_str.h │ ├── lj_strscan.c │ ├── lj_strscan.h │ ├── lj_tab.c │ ├── lj_tab.h │ ├── lj_target.h │ ├── lj_target_arm.h │ ├── lj_target_mips.h │ ├── lj_target_ppc.h │ ├── lj_target_x86.h │ ├── lj_trace.c │ ├── lj_trace.h │ ├── lj_traceerr.h │ ├── lj_udata.c │ ├── lj_udata.h │ ├── lj_vm.h │ ├── lj_vmevent.c │ ├── lj_vmevent.h │ ├── lj_vmmath.c │ ├── ljamalg.c │ ├── lua.h │ ├── lua.hpp │ ├── luaconf.h │ ├── luajit.c │ ├── luajit.h │ ├── lualib.h │ ├── msvcbuild.bat │ ├── ps4build.bat │ ├── vm_arm.dasc │ ├── vm_mips.dasc │ ├── vm_ppc.dasc │ ├── vm_ppcspe.dasc │ ├── vm_x86.dasc │ └── xedkbuild.bat ├── scripts ├── addr.lua ├── auth.lua ├── counter.lua ├── pipeline.lua ├── post.lua ├── report.lua ├── setup.lua └── stop.lua └── src ├── ae.c ├── ae.h ├── ae_epoll.c ├── ae_evport.c ├── ae_kqueue.c ├── ae_select.c ├── aprintf.c ├── aprintf.h ├── config.h ├── hdr_histogram.c ├── hdr_histogram.h ├── http_parser.c ├── http_parser.h ├── main.h ├── net.c ├── net.h ├── script.c ├── script.h ├── ssl.c ├── ssl.h ├── stats.c ├── stats.h ├── tinymt64.c ├── tinymt64.h ├── units.c ├── units.h ├── wrk.c ├── wrk.h ├── wrk.lua ├── zmalloc.c └── zmalloc.h /.gitignore: -------------------------------------------------------------------------------- 1 | *.o 2 | *.a 3 | wrk 4 | 5 | deps/luajit/src/host/buildvm 6 | deps/luajit/src/host/buildvm_arch.h 7 | deps/luajit/src/host/minilua 8 | deps/luajit/src/jit/vmdef.lua 9 | deps/luajit/src/lj_bcdef.h 10 | deps/luajit/src/lj_ffdef.h 11 | deps/luajit/src/lj_folddef.h 12 | deps/luajit/src/lj_libdef.h 13 | deps/luajit/src/lj_recdef.h 14 | deps/luajit/src/lj_vm.s 15 | deps/luajit/src/luajit 16 | 17 | .idea 18 | CMakeLists.txt 19 | -------------------------------------------------------------------------------- /.travis.yml: -------------------------------------------------------------------------------- 1 | language: c 2 | 3 | os: 4 | - linux 5 | - osx 6 | 7 | compiler: 8 | - gcc 9 | - clang 10 | 11 | script: 12 | - make 13 | -------------------------------------------------------------------------------- /CoordinatedOmission/wrk2_CleanVsCO.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/devhands-io/wrkx/6ef7f0c237e3931e2d78e7ab02ca770c1d64c0a8/CoordinatedOmission/wrk2_CleanVsCO.png -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | CFLAGS := -std=c99 -Wall -O2 -D_REENTRANT 2 | LIBS := -lpthread -lm -lcrypto -lssl 3 | 4 | TARGET := $(shell uname -s | tr '[A-Z]' '[a-z]' 2>/dev/null || echo unknown) 5 | 6 | ifeq ($(TARGET), sunos) 7 | CFLAGS += -D_PTHREADS -D_POSIX_C_SOURCE=200112L 8 | LIBS += -lsocket 9 | else ifeq ($(TARGET), darwin) 10 | # Per https://luajit.org/install.html: If MACOSX_DEPLOYMENT_TARGET 11 | # is not set then it's forced to 10.4, which breaks compile on Mojave. 12 | export MACOSX_DEPLOYMENT_TARGET = $(shell sw_vers -productVersion) 13 | LDFLAGS += -pagezero_size 10000 -image_base 100000000 14 | LIBS += -L/usr/local/opt/openssl/lib 15 | CFLAGS += -I/usr/local/include -I/usr/local/opt/openssl/include 16 | else ifeq ($(TARGET), linux) 17 | CFLAGS += -D_GNU_SOURCE 18 | LIBS += -ldl 19 | LDFLAGS += -Wl,-E 20 | else ifeq ($(TARGET), freebsd) 21 | CFLAGS += -D_DECLARE_C99_LDBL_MATH 22 | LDFLAGS += -Wl,-E 23 | endif 24 | 25 | SRC := wrk.c net.c ssl.c aprintf.c stats.c script.c units.c \ 26 | ae.c zmalloc.c http_parser.c tinymt64.c hdr_histogram.c 27 | BIN := wrk 28 | 29 | ODIR := obj 30 | OBJ := $(patsubst %.c,$(ODIR)/%.o,$(SRC)) $(ODIR)/bytecode.o 31 | 32 | LDIR = deps/luajit/src 33 | LIBS := -lluajit $(LIBS) 34 | CFLAGS += -I$(LDIR) 35 | LDFLAGS += -L$(LDIR) 36 | 37 | all: $(BIN) 38 | 39 | clean: 40 | $(RM) $(BIN) obj/* 41 | @$(MAKE) -C deps/luajit clean 42 | 43 | $(BIN): $(OBJ) 44 | @echo LINK $(BIN) 45 | @$(CC) $(LDFLAGS) -o $@ $^ $(LIBS) 46 | 47 | $(OBJ): config.h Makefile $(LDIR)/libluajit.a | $(ODIR) 48 | 49 | $(ODIR): 50 | @mkdir -p $@ 51 | 52 | $(ODIR)/bytecode.o: src/wrk.lua 53 | @echo LUAJIT $< 54 | @$(SHELL) -c 'cd $(LDIR) && ./luajit -b $(CURDIR)/$< $(CURDIR)/$@' 55 | 56 | $(ODIR)/%.o : %.c 57 | @echo CC $< 58 | @$(CC) $(CFLAGS) -c -o $@ $< 59 | 60 | $(LDIR)/libluajit.a: 61 | @echo Building LuaJIT... 62 | @$(MAKE) -C $(LDIR) BUILDMODE=static 63 | 64 | .PHONY: all clean 65 | .SUFFIXES: 66 | .SUFFIXES: .c .o .lua 67 | 68 | vpath %.c src 69 | vpath %.h src 70 | vpath %.lua scripts 71 | -------------------------------------------------------------------------------- /SCRIPTING: -------------------------------------------------------------------------------- 1 | Overview 2 | 3 | wrk supports executing a LuaJIT script during three distinct phases: setup, 4 | running, and done. Each wrk thread has an independent scripting environment 5 | and the setup & done phases execute in a separate environment which does 6 | not participate in the running phase. 7 | 8 | The public Lua API consists of a global table and a number of global 9 | functions: 10 | 11 | wrk = { 12 | scheme = "http", 13 | host = "localhost", 14 | port = nil, 15 | method = "GET", 16 | path = "/", 17 | headers = {}, 18 | body = nil, 19 | thread = , 20 | } 21 | 22 | function wrk.format(method, path, headers, body) 23 | 24 | wrk.format returns a HTTP request string containing the passed parameters 25 | merged with values from the wrk table. 26 | 27 | function wrk.lookup(host, service) 28 | 29 | wrk.lookup returns a table containing all known addresses for the host 30 | and service pair. This corresponds to the POSIX getaddrinfo() function. 31 | 32 | function wrk.connect(addr) 33 | 34 | wrk.connect returns true if the address can be connected to, otherwise 35 | it returns false. The address must be one returned from wrk.lookup(). 36 | 37 | The following globals are optional, and if defined must be functions: 38 | 39 | global setup -- called during thread setup 40 | global init -- called when the thread is starting 41 | global request -- called to generate the HTTP request 42 | global response -- called with HTTP response data 43 | global done -- called with results of run 44 | 45 | Setup 46 | 47 | function setup(thread) 48 | 49 | The setup phase begins after the target IP address has been resolved and all 50 | threads have been initialized but not yet started. 51 | 52 | setup() is called once for each thread and receives a userdata object 53 | representing the thread. 54 | 55 | thread.addr - get or set the thread's server address 56 | thread:get(name) - get the value of a global in the thread's env 57 | thread:set(name, value) - set the value of a global in the thread's env 58 | thread:stop() - stop the thread 59 | 60 | Only boolean, nil, number, and string values or tables of the same may be 61 | transfered via get()/set() and thread:stop() can only be called while the 62 | thread is running. 63 | 64 | Running 65 | 66 | function init(args) 67 | function request() 68 | function response(status, headers, body) 69 | 70 | The running phase begins with a single call to init(), followed by 71 | a call to request() and response() for each request cycle. 72 | 73 | The init() function receives any extra command line arguments for the 74 | script which must be separated from wrk arguments with "--". 75 | 76 | request() returns a string containing the HTTP request. Building a new 77 | request each time is expensive, when testing a high performance server 78 | one solution is to pre-generate all requests in init() and do a quick 79 | lookup in request(). 80 | 81 | response() is called with the HTTP response status, headers, and body. 82 | Parsing the headers and body is expensive, so if the response global is 83 | nil after the call to init() wrk will ignore the headers and body. 84 | 85 | Done 86 | 87 | function done(summary, latency, requests) 88 | 89 | The done() function receives a table containing result data, and two 90 | statistics objects representing the per-request latency and per-thread 91 | request rate. Duration and latency are microsecond values and rate is 92 | measured in requests per second. 93 | 94 | latency.min -- minimum value seen 95 | latency.max -- maximum value seen 96 | latency.mean -- average value seen 97 | latency.stdev -- standard deviation 98 | latency:percentile(99.0) -- 99th percentile value 99 | latency(i) -- raw value and count 100 | 101 | summary = { 102 | duration = N, -- run duration in microseconds 103 | requests = N, -- total completed requests 104 | bytes = N, -- total bytes received 105 | errors = { 106 | connect = N, -- total socket connection errors 107 | read = N, -- total socket read errors 108 | write = N, -- total socket write errors 109 | status = N, -- total HTTP status codes > 399 110 | timeout = N -- total request timeouts 111 | } 112 | } 113 | -------------------------------------------------------------------------------- /deps/luajit/COPYRIGHT: -------------------------------------------------------------------------------- 1 | =============================================================================== 2 | LuaJIT -- a Just-In-Time Compiler for Lua. http://luajit.org/ 3 | 4 | Copyright (C) 2005-2014 Mike Pall. All rights reserved. 5 | 6 | Permission is hereby granted, free of charge, to any person obtaining a copy 7 | of this software and associated documentation files (the "Software"), to deal 8 | in the Software without restriction, including without limitation the rights 9 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 10 | copies of the Software, and to permit persons to whom the Software is 11 | furnished to do so, subject to the following conditions: 12 | 13 | The above copyright notice and this permission notice shall be included in 14 | all copies or substantial portions of the Software. 15 | 16 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 17 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 18 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 19 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 20 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 21 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 22 | THE SOFTWARE. 23 | 24 | [ MIT license: http://www.opensource.org/licenses/mit-license.php ] 25 | 26 | =============================================================================== 27 | [ LuaJIT includes code from Lua 5.1/5.2, which has this license statement: ] 28 | 29 | Copyright (C) 1994-2012 Lua.org, PUC-Rio. 30 | 31 | Permission is hereby granted, free of charge, to any person obtaining a copy 32 | of this software and associated documentation files (the "Software"), to deal 33 | in the Software without restriction, including without limitation the rights 34 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 35 | copies of the Software, and to permit persons to whom the Software is 36 | furnished to do so, subject to the following conditions: 37 | 38 | The above copyright notice and this permission notice shall be included in 39 | all copies or substantial portions of the Software. 40 | 41 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 42 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 43 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 44 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 45 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 46 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 47 | THE SOFTWARE. 48 | 49 | =============================================================================== 50 | [ LuaJIT includes code from dlmalloc, which has this license statement: ] 51 | 52 | This is a version (aka dlmalloc) of malloc/free/realloc written by 53 | Doug Lea and released to the public domain, as explained at 54 | http://creativecommons.org/licenses/publicdomain 55 | 56 | =============================================================================== 57 | -------------------------------------------------------------------------------- /deps/luajit/Makefile: -------------------------------------------------------------------------------- 1 | ############################################################################## 2 | # LuaJIT top level Makefile for installation. Requires GNU Make. 3 | # 4 | # Please read doc/install.html before changing any variables! 5 | # 6 | # Suitable for POSIX platforms (Linux, *BSD, OSX etc.). 7 | # Note: src/Makefile has many more configurable options. 8 | # 9 | # ##### This Makefile is NOT useful for Windows! ##### 10 | # For MSVC, please follow the instructions given in src/msvcbuild.bat. 11 | # For MinGW and Cygwin, cd to src and run make with the Makefile there. 12 | # 13 | # Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 14 | ############################################################################## 15 | 16 | MAJVER= 2 17 | MINVER= 0 18 | RELVER= 3 19 | VERSION= $(MAJVER).$(MINVER).$(RELVER) 20 | ABIVER= 5.1 21 | 22 | ############################################################################## 23 | # 24 | # Change the installation path as needed. This automatically adjusts 25 | # the paths in src/luaconf.h, too. Note: PREFIX must be an absolute path! 26 | # 27 | export PREFIX= /usr/local 28 | export MULTILIB= lib 29 | ############################################################################## 30 | 31 | DPREFIX= $(DESTDIR)$(PREFIX) 32 | INSTALL_BIN= $(DPREFIX)/bin 33 | INSTALL_LIB= $(DPREFIX)/$(MULTILIB) 34 | INSTALL_SHARE= $(DPREFIX)/share 35 | INSTALL_INC= $(DPREFIX)/include/luajit-$(MAJVER).$(MINVER) 36 | 37 | INSTALL_LJLIBD= $(INSTALL_SHARE)/luajit-$(VERSION) 38 | INSTALL_JITLIB= $(INSTALL_LJLIBD)/jit 39 | INSTALL_LMODD= $(INSTALL_SHARE)/lua 40 | INSTALL_LMOD= $(INSTALL_LMODD)/$(ABIVER) 41 | INSTALL_CMODD= $(INSTALL_LIB)/lua 42 | INSTALL_CMOD= $(INSTALL_CMODD)/$(ABIVER) 43 | INSTALL_MAN= $(INSTALL_SHARE)/man/man1 44 | INSTALL_PKGCONFIG= $(INSTALL_LIB)/pkgconfig 45 | 46 | INSTALL_TNAME= luajit-$(VERSION) 47 | INSTALL_TSYMNAME= luajit 48 | INSTALL_ANAME= libluajit-$(ABIVER).a 49 | INSTALL_SONAME= libluajit-$(ABIVER).so.$(MAJVER).$(MINVER).$(RELVER) 50 | INSTALL_SOSHORT= libluajit-$(ABIVER).so 51 | INSTALL_DYLIBNAME= libluajit-$(ABIVER).$(MAJVER).$(MINVER).$(RELVER).dylib 52 | INSTALL_DYLIBSHORT1= libluajit-$(ABIVER).dylib 53 | INSTALL_DYLIBSHORT2= libluajit-$(ABIVER).$(MAJVER).dylib 54 | INSTALL_PCNAME= luajit.pc 55 | 56 | INSTALL_STATIC= $(INSTALL_LIB)/$(INSTALL_ANAME) 57 | INSTALL_DYN= $(INSTALL_LIB)/$(INSTALL_SONAME) 58 | INSTALL_SHORT1= $(INSTALL_LIB)/$(INSTALL_SOSHORT) 59 | INSTALL_SHORT2= $(INSTALL_LIB)/$(INSTALL_SOSHORT) 60 | INSTALL_T= $(INSTALL_BIN)/$(INSTALL_TNAME) 61 | INSTALL_TSYM= $(INSTALL_BIN)/$(INSTALL_TSYMNAME) 62 | INSTALL_PC= $(INSTALL_PKGCONFIG)/$(INSTALL_PCNAME) 63 | 64 | INSTALL_DIRS= $(INSTALL_BIN) $(INSTALL_LIB) $(INSTALL_INC) $(INSTALL_MAN) \ 65 | $(INSTALL_PKGCONFIG) $(INSTALL_JITLIB) $(INSTALL_LMOD) $(INSTALL_CMOD) 66 | UNINSTALL_DIRS= $(INSTALL_JITLIB) $(INSTALL_LJLIBD) $(INSTALL_INC) \ 67 | $(INSTALL_LMOD) $(INSTALL_LMODD) $(INSTALL_CMOD) $(INSTALL_CMODD) 68 | 69 | RM= rm -f 70 | MKDIR= mkdir -p 71 | RMDIR= rmdir 2>/dev/null 72 | SYMLINK= ln -sf 73 | INSTALL_X= install -m 0755 74 | INSTALL_F= install -m 0644 75 | UNINSTALL= $(RM) 76 | LDCONFIG= ldconfig -n 77 | SED_PC= sed -e "s|^prefix=.*|prefix=$(PREFIX)|" \ 78 | -e "s|^multilib=.*|multilib=$(MULTILIB)|" 79 | 80 | FILE_T= luajit 81 | FILE_A= libluajit.a 82 | FILE_SO= libluajit.so 83 | FILE_MAN= luajit.1 84 | FILE_PC= luajit.pc 85 | FILES_INC= lua.h lualib.h lauxlib.h luaconf.h lua.hpp luajit.h 86 | FILES_JITLIB= bc.lua v.lua dump.lua dis_x86.lua dis_x64.lua dis_arm.lua \ 87 | dis_ppc.lua dis_mips.lua dis_mipsel.lua bcsave.lua vmdef.lua 88 | 89 | ifeq (,$(findstring Windows,$(OS))) 90 | ifeq (Darwin,$(shell uname -s)) 91 | INSTALL_SONAME= $(INSTALL_DYLIBNAME) 92 | INSTALL_SHORT1= $(INSTALL_LIB)/$(INSTALL_DYLIBSHORT1) 93 | INSTALL_SHORT2= $(INSTALL_LIB)/$(INSTALL_DYLIBSHORT2) 94 | LDCONFIG= : 95 | endif 96 | endif 97 | 98 | ############################################################################## 99 | 100 | INSTALL_DEP= src/luajit 101 | 102 | default all $(INSTALL_DEP): 103 | @echo "==== Building LuaJIT $(VERSION) ====" 104 | $(MAKE) -C src 105 | @echo "==== Successfully built LuaJIT $(VERSION) ====" 106 | 107 | install: $(INSTALL_DEP) 108 | @echo "==== Installing LuaJIT $(VERSION) to $(PREFIX) ====" 109 | $(MKDIR) $(INSTALL_DIRS) 110 | cd src && $(INSTALL_X) $(FILE_T) $(INSTALL_T) 111 | cd src && test -f $(FILE_A) && $(INSTALL_F) $(FILE_A) $(INSTALL_STATIC) || : 112 | $(RM) $(INSTALL_TSYM) $(INSTALL_DYN) $(INSTALL_SHORT1) $(INSTALL_SHORT2) 113 | cd src && test -f $(FILE_SO) && \ 114 | $(INSTALL_X) $(FILE_SO) $(INSTALL_DYN) && \ 115 | $(LDCONFIG) $(INSTALL_LIB) && \ 116 | $(SYMLINK) $(INSTALL_SONAME) $(INSTALL_SHORT1) && \ 117 | $(SYMLINK) $(INSTALL_SONAME) $(INSTALL_SHORT2) || : 118 | cd etc && $(INSTALL_F) $(FILE_MAN) $(INSTALL_MAN) 119 | cd etc && $(SED_PC) $(FILE_PC) > $(FILE_PC).tmp && \ 120 | $(INSTALL_F) $(FILE_PC).tmp $(INSTALL_PC) && \ 121 | $(RM) $(FILE_PC).tmp 122 | cd src && $(INSTALL_F) $(FILES_INC) $(INSTALL_INC) 123 | cd src/jit && $(INSTALL_F) $(FILES_JITLIB) $(INSTALL_JITLIB) 124 | $(SYMLINK) $(INSTALL_TNAME) $(INSTALL_TSYM) 125 | @echo "==== Successfully installed LuaJIT $(VERSION) to $(PREFIX) ====" 126 | 127 | uninstall: 128 | @echo "==== Uninstalling LuaJIT $(VERSION) from $(PREFIX) ====" 129 | $(UNINSTALL) $(INSTALL_TSYM) $(INSTALL_T) $(INSTALL_STATIC) $(INSTALL_DYN) $(INSTALL_SHORT1) $(INSTALL_SHORT2) $(INSTALL_MAN)/$(FILE_MAN) $(INSTALL_PC) 130 | for file in $(FILES_JITLIB); do \ 131 | $(UNINSTALL) $(INSTALL_JITLIB)/$$file; \ 132 | done 133 | for file in $(FILES_INC); do \ 134 | $(UNINSTALL) $(INSTALL_INC)/$$file; \ 135 | done 136 | $(LDCONFIG) $(INSTALL_LIB) 137 | $(RMDIR) $(UNINSTALL_DIRS) || : 138 | @echo "==== Successfully uninstalled LuaJIT $(VERSION) from $(PREFIX) ====" 139 | 140 | ############################################################################## 141 | 142 | amalg: 143 | @echo "Building LuaJIT $(VERSION)" 144 | $(MAKE) -C src amalg 145 | 146 | clean: 147 | $(MAKE) -C src clean 148 | 149 | .PHONY: all install amalg clean 150 | 151 | ############################################################################## 152 | -------------------------------------------------------------------------------- /deps/luajit/README: -------------------------------------------------------------------------------- 1 | README for LuaJIT 2.0.3 2 | ----------------------- 3 | 4 | LuaJIT is a Just-In-Time (JIT) compiler for the Lua programming language. 5 | 6 | Project Homepage: http://luajit.org/ 7 | 8 | LuaJIT is Copyright (C) 2005-2014 Mike Pall. 9 | LuaJIT is free software, released under the MIT license. 10 | See full Copyright Notice in the COPYRIGHT file or in luajit.h. 11 | 12 | Documentation for LuaJIT is available in HTML format. 13 | Please point your favorite browser to: 14 | 15 | doc/luajit.html 16 | 17 | -------------------------------------------------------------------------------- /deps/luajit/doc/bluequad-print.css: -------------------------------------------------------------------------------- 1 | /* Copyright (C) 2004-2014 Mike Pall. 2 | * 3 | * You are welcome to use the general ideas of this design for your own sites. 4 | * But please do not steal the stylesheet, the layout or the color scheme. 5 | */ 6 | body { 7 | font-family: serif; 8 | font-size: 11pt; 9 | margin: 0 3em; 10 | padding: 0; 11 | border: none; 12 | } 13 | a:link, a:visited, a:hover, a:active { 14 | text-decoration: none; 15 | background: transparent; 16 | color: #0000ff; 17 | } 18 | h1, h2, h3 { 19 | font-family: sans-serif; 20 | font-weight: bold; 21 | text-align: left; 22 | margin: 0.5em 0; 23 | padding: 0; 24 | } 25 | h1 { 26 | font-size: 200%; 27 | } 28 | h2 { 29 | font-size: 150%; 30 | } 31 | h3 { 32 | font-size: 125%; 33 | } 34 | p { 35 | margin: 0 0 0.5em 0; 36 | padding: 0; 37 | } 38 | ul, ol { 39 | margin: 0.5em 0; 40 | padding: 0 0 0 2em; 41 | } 42 | ul { 43 | list-style: outside square; 44 | } 45 | ol { 46 | list-style: outside decimal; 47 | } 48 | li { 49 | margin: 0; 50 | padding: 0; 51 | } 52 | dl { 53 | margin: 1em 0; 54 | padding: 1em; 55 | border: 1px solid black; 56 | } 57 | dt { 58 | font-weight: bold; 59 | margin: 0; 60 | padding: 0; 61 | } 62 | dt sup { 63 | float: right; 64 | margin-left: 1em; 65 | } 66 | dd { 67 | margin: 0.5em 0 0 2em; 68 | padding: 0; 69 | } 70 | table { 71 | table-layout: fixed; 72 | width: 100%; 73 | margin: 1em 0; 74 | padding: 0; 75 | border: 1px solid black; 76 | border-spacing: 0; 77 | border-collapse: collapse; 78 | } 79 | tr { 80 | margin: 0; 81 | padding: 0; 82 | border: none; 83 | } 84 | td { 85 | text-align: left; 86 | margin: 0; 87 | padding: 0.2em 0.5em; 88 | border-top: 1px solid black; 89 | border-bottom: 1px solid black; 90 | } 91 | tr.separate td { 92 | border-top: double; 93 | } 94 | tt, pre, code, kbd, samp { 95 | font-family: monospace; 96 | font-size: 75%; 97 | } 98 | kbd { 99 | font-weight: bolder; 100 | } 101 | blockquote, pre { 102 | margin: 1em 2em; 103 | padding: 0; 104 | } 105 | img { 106 | border: none; 107 | vertical-align: baseline; 108 | margin: 0; 109 | padding: 0; 110 | } 111 | img.left { 112 | float: left; 113 | margin: 0.5em 1em 0.5em 0; 114 | } 115 | img.right { 116 | float: right; 117 | margin: 0.5em 0 0.5em 1em; 118 | } 119 | .flush { 120 | clear: both; 121 | visibility: hidden; 122 | } 123 | .hide, .noprint, #nav { 124 | display: none !important; 125 | } 126 | .pagebreak { 127 | page-break-before: always; 128 | } 129 | #site { 130 | text-align: right; 131 | font-family: sans-serif; 132 | font-weight: bold; 133 | margin: 0 1em; 134 | border-bottom: 1pt solid black; 135 | } 136 | #site a { 137 | font-size: 1.2em; 138 | } 139 | #site a:link, #site a:visited { 140 | text-decoration: none; 141 | font-weight: bold; 142 | background: transparent; 143 | color: #ffffff; 144 | } 145 | #logo { 146 | color: #ff8000; 147 | } 148 | #head { 149 | clear: both; 150 | margin: 0 1em; 151 | } 152 | #main { 153 | line-height: 1.3; 154 | text-align: justify; 155 | margin: 1em; 156 | } 157 | #foot { 158 | clear: both; 159 | font-size: 80%; 160 | text-align: center; 161 | margin: 0 1.25em; 162 | padding: 0.5em 0 0 0; 163 | border-top: 1pt solid black; 164 | page-break-before: avoid; 165 | page-break-after: avoid; 166 | } 167 | -------------------------------------------------------------------------------- /deps/luajit/doc/contact.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | Contact 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 |
14 | Lua 15 |
16 | 19 | 60 |
61 |

62 | Please send general questions to the 63 | » LuaJIT mailing list. 64 | You can also send any questions you have directly to me: 65 |

66 | 67 | 75 | 79 | 83 | 84 |

Copyright

85 |

86 | All documentation is 87 | Copyright © 2005-2014 Mike Pall. 88 |

89 | 90 | 91 |
92 |
93 | 101 | 102 | 103 | -------------------------------------------------------------------------------- /deps/luajit/doc/img/contact.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/devhands-io/wrkx/6ef7f0c237e3931e2d78e7ab02ca770c1d64c0a8/deps/luajit/doc/img/contact.png -------------------------------------------------------------------------------- /deps/luajit/doc/status.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | Status & Roadmap 5 | 6 | 7 | 8 | 9 | 10 | 11 | 14 | 15 | 16 |
17 | Lua 18 |
19 | 22 | 63 |
64 |

65 | LuaJIT 2.0 is the current 66 | stable branch. This branch is in 67 | feature-freeze — new features will only be added to LuaJIT 2.1. 68 |

69 | 70 |

Current Status

71 |

72 | LuaJIT ought to run all Lua 5.1-compatible source code just fine. 73 | It's considered a serious bug if the VM crashes or produces unexpected 74 | results — please report this. 75 |

76 |

77 | Known incompatibilities and issues in LuaJIT 2.0: 78 |

79 | 105 | 106 |

Roadmap

107 |

108 | Please refer to the 109 | » LuaJIT Roadmap 2012/2013 and an 110 | » update on release planning for details. 111 |

112 |

113 |

114 |
115 |
116 | 124 | 125 | 126 | -------------------------------------------------------------------------------- /deps/luajit/dynasm/dasm_proto.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** DynASM encoding engine prototypes. 3 | ** Copyright (C) 2005-2014 Mike Pall. All rights reserved. 4 | ** Released under the MIT license. See dynasm.lua for full copyright notice. 5 | */ 6 | 7 | #ifndef _DASM_PROTO_H 8 | #define _DASM_PROTO_H 9 | 10 | #include 11 | #include 12 | 13 | #define DASM_IDENT "DynASM 1.3.0" 14 | #define DASM_VERSION 10300 /* 1.3.0 */ 15 | 16 | #ifndef Dst_DECL 17 | #define Dst_DECL dasm_State **Dst 18 | #endif 19 | 20 | #ifndef Dst_REF 21 | #define Dst_REF (*Dst) 22 | #endif 23 | 24 | #ifndef DASM_FDEF 25 | #define DASM_FDEF extern 26 | #endif 27 | 28 | #ifndef DASM_M_GROW 29 | #define DASM_M_GROW(ctx, t, p, sz, need) \ 30 | do { \ 31 | size_t _sz = (sz), _need = (need); \ 32 | if (_sz < _need) { \ 33 | if (_sz < 16) _sz = 16; \ 34 | while (_sz < _need) _sz += _sz; \ 35 | (p) = (t *)realloc((p), _sz); \ 36 | if ((p) == NULL) exit(1); \ 37 | (sz) = _sz; \ 38 | } \ 39 | } while(0) 40 | #endif 41 | 42 | #ifndef DASM_M_FREE 43 | #define DASM_M_FREE(ctx, p, sz) free(p) 44 | #endif 45 | 46 | /* Internal DynASM encoder state. */ 47 | typedef struct dasm_State dasm_State; 48 | 49 | 50 | /* Initialize and free DynASM state. */ 51 | DASM_FDEF void dasm_init(Dst_DECL, int maxsection); 52 | DASM_FDEF void dasm_free(Dst_DECL); 53 | 54 | /* Setup global array. Must be called before dasm_setup(). */ 55 | DASM_FDEF void dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl); 56 | 57 | /* Grow PC label array. Can be called after dasm_setup(), too. */ 58 | DASM_FDEF void dasm_growpc(Dst_DECL, unsigned int maxpc); 59 | 60 | /* Setup encoder. */ 61 | DASM_FDEF void dasm_setup(Dst_DECL, const void *actionlist); 62 | 63 | /* Feed encoder with actions. Calls are generated by pre-processor. */ 64 | DASM_FDEF void dasm_put(Dst_DECL, int start, ...); 65 | 66 | /* Link sections and return the resulting size. */ 67 | DASM_FDEF int dasm_link(Dst_DECL, size_t *szp); 68 | 69 | /* Encode sections into buffer. */ 70 | DASM_FDEF int dasm_encode(Dst_DECL, void *buffer); 71 | 72 | /* Get PC label offset. */ 73 | DASM_FDEF int dasm_getpclabel(Dst_DECL, unsigned int pc); 74 | 75 | #ifdef DASM_CHECKS 76 | /* Optional sanity checker to call between isolated encoding steps. */ 77 | DASM_FDEF int dasm_checkstep(Dst_DECL, int secmatch); 78 | #else 79 | #define dasm_checkstep(a, b) 0 80 | #endif 81 | 82 | 83 | #endif /* _DASM_PROTO_H */ 84 | -------------------------------------------------------------------------------- /deps/luajit/dynasm/dasm_x64.lua: -------------------------------------------------------------------------------- 1 | ------------------------------------------------------------------------------ 2 | -- DynASM x64 module. 3 | -- 4 | -- Copyright (C) 2005-2014 Mike Pall. All rights reserved. 5 | -- See dynasm.lua for full copyright notice. 6 | ------------------------------------------------------------------------------ 7 | -- This module just sets 64 bit mode for the combined x86/x64 module. 8 | -- All the interesting stuff is there. 9 | ------------------------------------------------------------------------------ 10 | 11 | x64 = true -- Using a global is an ugly, but effective solution. 12 | return require("dasm_x86") 13 | -------------------------------------------------------------------------------- /deps/luajit/etc/luajit.1: -------------------------------------------------------------------------------- 1 | .TH luajit 1 "" "" "LuaJIT documentation" 2 | .SH NAME 3 | luajit \- Just-In-Time Compiler for the Lua Language 4 | \fB 5 | .SH SYNOPSIS 6 | .B luajit 7 | [\fIoptions\fR]... [\fIscript\fR [\fIargs\fR]...] 8 | .SH "WEB SITE" 9 | .IR http://luajit.org 10 | .SH DESCRIPTION 11 | .PP 12 | This is the command-line program to run Lua programs with \fBLuaJIT\fR. 13 | .PP 14 | \fBLuaJIT\fR is a just-in-time (JIT) compiler for the Lua language. 15 | The virtual machine (VM) is based on a fast interpreter combined with 16 | a trace compiler. It can significantly improve the performance of Lua programs. 17 | .PP 18 | \fBLuaJIT\fR is API\- and ABI-compatible with the VM of the standard 19 | Lua\ 5.1 interpreter. When embedding the VM into an application, 20 | the built library can be used as a drop-in replacement. 21 | .SH OPTIONS 22 | .TP 23 | .BI "\-e " chunk 24 | Run the given chunk of Lua code. 25 | .TP 26 | .BI "\-l " library 27 | Load the named library, just like \fBrequire("\fR\fIlibrary\fR\fB")\fR. 28 | .TP 29 | .BI "\-b " ... 30 | Save or list bytecode. Run without arguments to get help on options. 31 | .TP 32 | .BI "\-j " command 33 | Perform LuaJIT control command (optional space after \fB\-j\fR). 34 | .TP 35 | .BI "\-O" [opt] 36 | Control LuaJIT optimizations. 37 | .TP 38 | .B "\-i" 39 | Run in interactive mode. 40 | .TP 41 | .B "\-v" 42 | Show \fBLuaJIT\fR version. 43 | .TP 44 | .B "\-E" 45 | Ignore environment variables. 46 | .TP 47 | .B "\-\-" 48 | Stop processing options. 49 | .TP 50 | .B "\-" 51 | Read script from stdin instead. 52 | .PP 53 | After all options are processed, the given \fIscript\fR is run. 54 | The arguments are passed in the global \fIarg\fR table. 55 | .PP 56 | Interactive mode is only entered, if no \fIscript\fR and no \fB\-e\fR 57 | option is given. Interactive mode can be left with EOF (\fICtrl\-Z\fB). 58 | .SH EXAMPLES 59 | .TP 60 | luajit hello.lua world 61 | 62 | Prints "Hello world", assuming \fIhello.lua\fR contains: 63 | .br 64 | print("Hello", arg[1]) 65 | .TP 66 | luajit \-e "local x=0; for i=1,1e9 do x=x+i end; print(x)" 67 | 68 | Calculates the sum of the numbers from 1 to 1000000000. 69 | .br 70 | And finishes in a reasonable amount of time, too. 71 | .TP 72 | luajit \-jv \-e "for i=1,10 do for j=1,10 do for k=1,100 do end end end" 73 | 74 | Runs some nested loops and shows the resulting traces. 75 | .SH COPYRIGHT 76 | .PP 77 | \fBLuaJIT\fR is Copyright \(co 2005-2014 Mike Pall. 78 | .br 79 | \fBLuaJIT\fR is open source software, released under the MIT license. 80 | .SH SEE ALSO 81 | .PP 82 | More details in the provided HTML docs or at: 83 | .IR http://luajit.org 84 | .br 85 | More about the Lua language can be found at: 86 | .IR http://lua.org/docs.html 87 | .PP 88 | lua(1) 89 | -------------------------------------------------------------------------------- /deps/luajit/etc/luajit.pc: -------------------------------------------------------------------------------- 1 | # Package information for LuaJIT to be used by pkg-config. 2 | majver=2 3 | minver=0 4 | relver=3 5 | version=${majver}.${minver}.${relver} 6 | abiver=5.1 7 | 8 | prefix=/usr/local 9 | multilib=lib 10 | exec_prefix=${prefix} 11 | libdir=${exec_prefix}/${multilib} 12 | libname=luajit-${abiver} 13 | includedir=${prefix}/include/luajit-${majver}.${minver} 14 | 15 | INSTALL_LMOD=${prefix}/share/lua/${abiver} 16 | INSTALL_CMOD=${prefix}/${multilib}/lua/${abiver} 17 | 18 | Name: LuaJIT 19 | Description: Just-in-time compiler for Lua 20 | URL: http://luajit.org 21 | Version: ${version} 22 | Requires: 23 | Libs: -L${libdir} -l${libname} 24 | Libs.private: -Wl,-E -lm -ldl 25 | Cflags: -I${includedir} 26 | -------------------------------------------------------------------------------- /deps/luajit/src/host/README: -------------------------------------------------------------------------------- 1 | The files in this directory are only used during the build process of LuaJIT. 2 | For cross-compilation, they must be executed on the host, not on the target. 3 | 4 | These files should NOT be installed! 5 | -------------------------------------------------------------------------------- /deps/luajit/src/host/buildvm.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** LuaJIT VM builder. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _BUILDVM_H 7 | #define _BUILDVM_H 8 | 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | 15 | #include "lj_def.h" 16 | #include "lj_arch.h" 17 | 18 | /* Hardcoded limits. Increase as needed. */ 19 | #define BUILD_MAX_RELOC 200 /* Max. number of relocations. */ 20 | #define BUILD_MAX_FOLD 4096 /* Max. number of fold rules. */ 21 | 22 | /* Prefix for scanned library definitions. */ 23 | #define LIBDEF_PREFIX "LJLIB_" 24 | 25 | /* Prefix for scanned fold definitions. */ 26 | #define FOLDDEF_PREFIX "LJFOLD" 27 | 28 | /* Prefixes for generated labels. */ 29 | #define LABEL_PREFIX "lj_" 30 | #define LABEL_PREFIX_BC LABEL_PREFIX "BC_" 31 | #define LABEL_PREFIX_FF LABEL_PREFIX "ff_" 32 | #define LABEL_PREFIX_CF LABEL_PREFIX "cf_" 33 | #define LABEL_PREFIX_FFH LABEL_PREFIX "ffh_" 34 | #define LABEL_PREFIX_LIBCF LABEL_PREFIX "lib_cf_" 35 | #define LABEL_PREFIX_LIBINIT LABEL_PREFIX "lib_init_" 36 | 37 | /* Forward declaration. */ 38 | struct dasm_State; 39 | 40 | /* Build modes. */ 41 | #define BUILDDEF(_) \ 42 | _(elfasm) _(coffasm) _(machasm) _(peobj) _(raw) \ 43 | _(bcdef) _(ffdef) _(libdef) _(recdef) _(vmdef) \ 44 | _(folddef) 45 | 46 | typedef enum { 47 | #define BUILDENUM(name) BUILD_##name, 48 | BUILDDEF(BUILDENUM) 49 | #undef BUILDENUM 50 | BUILD__MAX 51 | } BuildMode; 52 | 53 | /* Code relocation. */ 54 | typedef struct BuildReloc { 55 | int32_t ofs; 56 | int sym; 57 | int type; 58 | } BuildReloc; 59 | 60 | typedef struct BuildSym { 61 | const char *name; 62 | int32_t ofs; 63 | } BuildSym; 64 | 65 | /* Build context structure. */ 66 | typedef struct BuildCtx { 67 | /* DynASM state pointer. Should be first member. */ 68 | struct dasm_State *D; 69 | /* Parsed command line. */ 70 | BuildMode mode; 71 | FILE *fp; 72 | const char *outname; 73 | char **args; 74 | /* Code and symbols generated by DynASM. */ 75 | uint8_t *code; 76 | size_t codesz; 77 | int npc, nglob, nsym, nreloc, nrelocsym; 78 | void **glob; 79 | BuildSym *sym; 80 | const char **relocsym; 81 | int32_t *bc_ofs; 82 | const char *beginsym; 83 | /* Strings generated by DynASM. */ 84 | const char *const *globnames; 85 | const char *dasm_ident; 86 | const char *dasm_arch; 87 | /* Relocations. */ 88 | BuildReloc reloc[BUILD_MAX_RELOC]; 89 | } BuildCtx; 90 | 91 | extern void owrite(BuildCtx *ctx, const void *ptr, size_t sz); 92 | extern void emit_asm(BuildCtx *ctx); 93 | extern void emit_peobj(BuildCtx *ctx); 94 | extern void emit_lib(BuildCtx *ctx); 95 | extern void emit_fold(BuildCtx *ctx); 96 | 97 | extern const char *const bc_names[]; 98 | extern const char *const ir_names[]; 99 | extern const char *const irt_names[]; 100 | extern const char *const irfpm_names[]; 101 | extern const char *const irfield_names[]; 102 | extern const char *const ircall_names[]; 103 | 104 | #endif 105 | -------------------------------------------------------------------------------- /deps/luajit/src/jit/bc.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- LuaJIT bytecode listing module. 3 | -- 4 | -- Copyright (C) 2005-2014 Mike Pall. All rights reserved. 5 | -- Released under the MIT license. See Copyright Notice in luajit.h 6 | ---------------------------------------------------------------------------- 7 | -- 8 | -- This module lists the bytecode of a Lua function. If it's loaded by -jbc 9 | -- it hooks into the parser and lists all functions of a chunk as they 10 | -- are parsed. 11 | -- 12 | -- Example usage: 13 | -- 14 | -- luajit -jbc -e 'local x=0; for i=1,1e6 do x=x+i end; print(x)' 15 | -- luajit -jbc=- foo.lua 16 | -- luajit -jbc=foo.list foo.lua 17 | -- 18 | -- Default output is to stderr. To redirect the output to a file, pass a 19 | -- filename as an argument (use '-' for stdout) or set the environment 20 | -- variable LUAJIT_LISTFILE. The file is overwritten every time the module 21 | -- is started. 22 | -- 23 | -- This module can also be used programmatically: 24 | -- 25 | -- local bc = require("jit.bc") 26 | -- 27 | -- local function foo() print("hello") end 28 | -- 29 | -- bc.dump(foo) --> -- BYTECODE -- [...] 30 | -- print(bc.line(foo, 2)) --> 0002 KSTR 1 1 ; "hello" 31 | -- 32 | -- local out = { 33 | -- -- Do something with each line: 34 | -- write = function(t, ...) io.write(...) end, 35 | -- close = function(t) end, 36 | -- flush = function(t) end, 37 | -- } 38 | -- bc.dump(foo, out) 39 | -- 40 | ------------------------------------------------------------------------------ 41 | 42 | -- Cache some library functions and objects. 43 | local jit = require("jit") 44 | assert(jit.version_num == 20003, "LuaJIT core/library version mismatch") 45 | local jutil = require("jit.util") 46 | local vmdef = require("jit.vmdef") 47 | local bit = require("bit") 48 | local sub, gsub, format = string.sub, string.gsub, string.format 49 | local byte, band, shr = string.byte, bit.band, bit.rshift 50 | local funcinfo, funcbc, funck = jutil.funcinfo, jutil.funcbc, jutil.funck 51 | local funcuvname = jutil.funcuvname 52 | local bcnames = vmdef.bcnames 53 | local stdout, stderr = io.stdout, io.stderr 54 | 55 | ------------------------------------------------------------------------------ 56 | 57 | local function ctlsub(c) 58 | if c == "\n" then return "\\n" 59 | elseif c == "\r" then return "\\r" 60 | elseif c == "\t" then return "\\t" 61 | else return format("\\%03d", byte(c)) 62 | end 63 | end 64 | 65 | -- Return one bytecode line. 66 | local function bcline(func, pc, prefix) 67 | local ins, m = funcbc(func, pc) 68 | if not ins then return end 69 | local ma, mb, mc = band(m, 7), band(m, 15*8), band(m, 15*128) 70 | local a = band(shr(ins, 8), 0xff) 71 | local oidx = 6*band(ins, 0xff) 72 | local op = sub(bcnames, oidx+1, oidx+6) 73 | local s = format("%04d %s %-6s %3s ", 74 | pc, prefix or " ", op, ma == 0 and "" or a) 75 | local d = shr(ins, 16) 76 | if mc == 13*128 then -- BCMjump 77 | return format("%s=> %04d\n", s, pc+d-0x7fff) 78 | end 79 | if mb ~= 0 then 80 | d = band(d, 0xff) 81 | elseif mc == 0 then 82 | return s.."\n" 83 | end 84 | local kc 85 | if mc == 10*128 then -- BCMstr 86 | kc = funck(func, -d-1) 87 | kc = format(#kc > 40 and '"%.40s"~' or '"%s"', gsub(kc, "%c", ctlsub)) 88 | elseif mc == 9*128 then -- BCMnum 89 | kc = funck(func, d) 90 | if op == "TSETM " then kc = kc - 2^52 end 91 | elseif mc == 12*128 then -- BCMfunc 92 | local fi = funcinfo(funck(func, -d-1)) 93 | if fi.ffid then 94 | kc = vmdef.ffnames[fi.ffid] 95 | else 96 | kc = fi.loc 97 | end 98 | elseif mc == 5*128 then -- BCMuv 99 | kc = funcuvname(func, d) 100 | end 101 | if ma == 5 then -- BCMuv 102 | local ka = funcuvname(func, a) 103 | if kc then kc = ka.." ; "..kc else kc = ka end 104 | end 105 | if mb ~= 0 then 106 | local b = shr(ins, 24) 107 | if kc then return format("%s%3d %3d ; %s\n", s, b, d, kc) end 108 | return format("%s%3d %3d\n", s, b, d) 109 | end 110 | if kc then return format("%s%3d ; %s\n", s, d, kc) end 111 | if mc == 7*128 and d > 32767 then d = d - 65536 end -- BCMlits 112 | return format("%s%3d\n", s, d) 113 | end 114 | 115 | -- Collect branch targets of a function. 116 | local function bctargets(func) 117 | local target = {} 118 | for pc=1,1000000000 do 119 | local ins, m = funcbc(func, pc) 120 | if not ins then break end 121 | if band(m, 15*128) == 13*128 then target[pc+shr(ins, 16)-0x7fff] = true end 122 | end 123 | return target 124 | end 125 | 126 | -- Dump bytecode instructions of a function. 127 | local function bcdump(func, out, all) 128 | if not out then out = stdout end 129 | local fi = funcinfo(func) 130 | if all and fi.children then 131 | for n=-1,-1000000000,-1 do 132 | local k = funck(func, n) 133 | if not k then break end 134 | if type(k) == "proto" then bcdump(k, out, true) end 135 | end 136 | end 137 | out:write(format("-- BYTECODE -- %s-%d\n", fi.loc, fi.lastlinedefined)) 138 | local target = bctargets(func) 139 | for pc=1,1000000000 do 140 | local s = bcline(func, pc, target[pc] and "=>") 141 | if not s then break end 142 | out:write(s) 143 | end 144 | out:write("\n") 145 | out:flush() 146 | end 147 | 148 | ------------------------------------------------------------------------------ 149 | 150 | -- Active flag and output file handle. 151 | local active, out 152 | 153 | -- List handler. 154 | local function h_list(func) 155 | return bcdump(func, out) 156 | end 157 | 158 | -- Detach list handler. 159 | local function bclistoff() 160 | if active then 161 | active = false 162 | jit.attach(h_list) 163 | if out and out ~= stdout and out ~= stderr then out:close() end 164 | out = nil 165 | end 166 | end 167 | 168 | -- Open the output file and attach list handler. 169 | local function bcliston(outfile) 170 | if active then bclistoff() end 171 | if not outfile then outfile = os.getenv("LUAJIT_LISTFILE") end 172 | if outfile then 173 | out = outfile == "-" and stdout or assert(io.open(outfile, "w")) 174 | else 175 | out = stderr 176 | end 177 | jit.attach(h_list, "bc") 178 | active = true 179 | end 180 | 181 | -- Public module functions. 182 | module(...) 183 | 184 | line = bcline 185 | dump = bcdump 186 | targets = bctargets 187 | 188 | on = bcliston 189 | off = bclistoff 190 | start = bcliston -- For -j command line option. 191 | 192 | -------------------------------------------------------------------------------- /deps/luajit/src/jit/dis_mipsel.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- LuaJIT MIPSEL disassembler wrapper module. 3 | -- 4 | -- Copyright (C) 2005-2014 Mike Pall. All rights reserved. 5 | -- Released under the MIT license. See Copyright Notice in luajit.h 6 | ---------------------------------------------------------------------------- 7 | -- This module just exports the little-endian functions from the 8 | -- MIPS disassembler module. All the interesting stuff is there. 9 | ------------------------------------------------------------------------------ 10 | 11 | local require = require 12 | 13 | module(...) 14 | 15 | local dis_mips = require(_PACKAGE.."dis_mips") 16 | 17 | create = dis_mips.create_el 18 | disass = dis_mips.disass_el 19 | regname = dis_mips.regname 20 | 21 | -------------------------------------------------------------------------------- /deps/luajit/src/jit/dis_x64.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- LuaJIT x64 disassembler wrapper module. 3 | -- 4 | -- Copyright (C) 2005-2014 Mike Pall. All rights reserved. 5 | -- Released under the MIT license. See Copyright Notice in luajit.h 6 | ---------------------------------------------------------------------------- 7 | -- This module just exports the 64 bit functions from the combined 8 | -- x86/x64 disassembler module. All the interesting stuff is there. 9 | ------------------------------------------------------------------------------ 10 | 11 | local require = require 12 | 13 | module(...) 14 | 15 | local dis_x86 = require(_PACKAGE.."dis_x86") 16 | 17 | create = dis_x86.create64 18 | disass = dis_x86.disass64 19 | regname = dis_x86.regname64 20 | 21 | -------------------------------------------------------------------------------- /deps/luajit/src/jit/v.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- Verbose mode of the LuaJIT compiler. 3 | -- 4 | -- Copyright (C) 2005-2014 Mike Pall. All rights reserved. 5 | -- Released under the MIT license. See Copyright Notice in luajit.h 6 | ---------------------------------------------------------------------------- 7 | -- 8 | -- This module shows verbose information about the progress of the 9 | -- JIT compiler. It prints one line for each generated trace. This module 10 | -- is useful to see which code has been compiled or where the compiler 11 | -- punts and falls back to the interpreter. 12 | -- 13 | -- Example usage: 14 | -- 15 | -- luajit -jv -e "for i=1,1000 do for j=1,1000 do end end" 16 | -- luajit -jv=myapp.out myapp.lua 17 | -- 18 | -- Default output is to stderr. To redirect the output to a file, pass a 19 | -- filename as an argument (use '-' for stdout) or set the environment 20 | -- variable LUAJIT_VERBOSEFILE. The file is overwritten every time the 21 | -- module is started. 22 | -- 23 | -- The output from the first example should look like this: 24 | -- 25 | -- [TRACE 1 (command line):1 loop] 26 | -- [TRACE 2 (1/3) (command line):1 -> 1] 27 | -- 28 | -- The first number in each line is the internal trace number. Next are 29 | -- the file name ('(command line)') and the line number (':1') where the 30 | -- trace has started. Side traces also show the parent trace number and 31 | -- the exit number where they are attached to in parentheses ('(1/3)'). 32 | -- An arrow at the end shows where the trace links to ('-> 1'), unless 33 | -- it loops to itself. 34 | -- 35 | -- In this case the inner loop gets hot and is traced first, generating 36 | -- a root trace. Then the last exit from the 1st trace gets hot, too, 37 | -- and triggers generation of the 2nd trace. The side trace follows the 38 | -- path along the outer loop and *around* the inner loop, back to its 39 | -- start, and then links to the 1st trace. Yes, this may seem unusual, 40 | -- if you know how traditional compilers work. Trace compilers are full 41 | -- of surprises like this -- have fun! :-) 42 | -- 43 | -- Aborted traces are shown like this: 44 | -- 45 | -- [TRACE --- foo.lua:44 -- leaving loop in root trace at foo:lua:50] 46 | -- 47 | -- Don't worry -- trace aborts are quite common, even in programs which 48 | -- can be fully compiled. The compiler may retry several times until it 49 | -- finds a suitable trace. 50 | -- 51 | -- Of course this doesn't work with features that are not-yet-implemented 52 | -- (NYI error messages). The VM simply falls back to the interpreter. This 53 | -- may not matter at all if the particular trace is not very high up in 54 | -- the CPU usage profile. Oh, and the interpreter is quite fast, too. 55 | -- 56 | -- Also check out the -jdump module, which prints all the gory details. 57 | -- 58 | ------------------------------------------------------------------------------ 59 | 60 | -- Cache some library functions and objects. 61 | local jit = require("jit") 62 | assert(jit.version_num == 20003, "LuaJIT core/library version mismatch") 63 | local jutil = require("jit.util") 64 | local vmdef = require("jit.vmdef") 65 | local funcinfo, traceinfo = jutil.funcinfo, jutil.traceinfo 66 | local type, format = type, string.format 67 | local stdout, stderr = io.stdout, io.stderr 68 | 69 | -- Active flag and output file handle. 70 | local active, out 71 | 72 | ------------------------------------------------------------------------------ 73 | 74 | local startloc, startex 75 | 76 | local function fmtfunc(func, pc) 77 | local fi = funcinfo(func, pc) 78 | if fi.loc then 79 | return fi.loc 80 | elseif fi.ffid then 81 | return vmdef.ffnames[fi.ffid] 82 | elseif fi.addr then 83 | return format("C:%x", fi.addr) 84 | else 85 | return "(?)" 86 | end 87 | end 88 | 89 | -- Format trace error message. 90 | local function fmterr(err, info) 91 | if type(err) == "number" then 92 | if type(info) == "function" then info = fmtfunc(info) end 93 | err = format(vmdef.traceerr[err], info) 94 | end 95 | return err 96 | end 97 | 98 | -- Dump trace states. 99 | local function dump_trace(what, tr, func, pc, otr, oex) 100 | if what == "start" then 101 | startloc = fmtfunc(func, pc) 102 | startex = otr and "("..otr.."/"..oex..") " or "" 103 | else 104 | if what == "abort" then 105 | local loc = fmtfunc(func, pc) 106 | if loc ~= startloc then 107 | out:write(format("[TRACE --- %s%s -- %s at %s]\n", 108 | startex, startloc, fmterr(otr, oex), loc)) 109 | else 110 | out:write(format("[TRACE --- %s%s -- %s]\n", 111 | startex, startloc, fmterr(otr, oex))) 112 | end 113 | elseif what == "stop" then 114 | local info = traceinfo(tr) 115 | local link, ltype = info.link, info.linktype 116 | if ltype == "interpreter" then 117 | out:write(format("[TRACE %3s %s%s -- fallback to interpreter]\n", 118 | tr, startex, startloc)) 119 | elseif link == tr or link == 0 then 120 | out:write(format("[TRACE %3s %s%s %s]\n", 121 | tr, startex, startloc, ltype)) 122 | elseif ltype == "root" then 123 | out:write(format("[TRACE %3s %s%s -> %d]\n", 124 | tr, startex, startloc, link)) 125 | else 126 | out:write(format("[TRACE %3s %s%s -> %d %s]\n", 127 | tr, startex, startloc, link, ltype)) 128 | end 129 | else 130 | out:write(format("[TRACE %s]\n", what)) 131 | end 132 | out:flush() 133 | end 134 | end 135 | 136 | ------------------------------------------------------------------------------ 137 | 138 | -- Detach dump handlers. 139 | local function dumpoff() 140 | if active then 141 | active = false 142 | jit.attach(dump_trace) 143 | if out and out ~= stdout and out ~= stderr then out:close() end 144 | out = nil 145 | end 146 | end 147 | 148 | -- Open the output file and attach dump handlers. 149 | local function dumpon(outfile) 150 | if active then dumpoff() end 151 | if not outfile then outfile = os.getenv("LUAJIT_VERBOSEFILE") end 152 | if outfile then 153 | out = outfile == "-" and stdout or assert(io.open(outfile, "w")) 154 | else 155 | out = stderr 156 | end 157 | jit.attach(dump_trace, "trace") 158 | active = true 159 | end 160 | 161 | -- Public module functions. 162 | module(...) 163 | 164 | on = dumpon 165 | off = dumpoff 166 | start = dumpon -- For -j command line option. 167 | 168 | -------------------------------------------------------------------------------- /deps/luajit/src/lib_bit.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Bit manipulation library. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #define lib_bit_c 7 | #define LUA_LIB 8 | 9 | #include "lua.h" 10 | #include "lauxlib.h" 11 | #include "lualib.h" 12 | 13 | #include "lj_obj.h" 14 | #include "lj_err.h" 15 | #include "lj_str.h" 16 | #include "lj_lib.h" 17 | 18 | /* ------------------------------------------------------------------------ */ 19 | 20 | #define LJLIB_MODULE_bit 21 | 22 | LJLIB_ASM(bit_tobit) LJLIB_REC(bit_unary IR_TOBIT) 23 | { 24 | lj_lib_checknumber(L, 1); 25 | return FFH_RETRY; 26 | } 27 | LJLIB_ASM_(bit_bnot) LJLIB_REC(bit_unary IR_BNOT) 28 | LJLIB_ASM_(bit_bswap) LJLIB_REC(bit_unary IR_BSWAP) 29 | 30 | LJLIB_ASM(bit_lshift) LJLIB_REC(bit_shift IR_BSHL) 31 | { 32 | lj_lib_checknumber(L, 1); 33 | lj_lib_checkbit(L, 2); 34 | return FFH_RETRY; 35 | } 36 | LJLIB_ASM_(bit_rshift) LJLIB_REC(bit_shift IR_BSHR) 37 | LJLIB_ASM_(bit_arshift) LJLIB_REC(bit_shift IR_BSAR) 38 | LJLIB_ASM_(bit_rol) LJLIB_REC(bit_shift IR_BROL) 39 | LJLIB_ASM_(bit_ror) LJLIB_REC(bit_shift IR_BROR) 40 | 41 | LJLIB_ASM(bit_band) LJLIB_REC(bit_nary IR_BAND) 42 | { 43 | int i = 0; 44 | do { lj_lib_checknumber(L, ++i); } while (L->base+i < L->top); 45 | return FFH_RETRY; 46 | } 47 | LJLIB_ASM_(bit_bor) LJLIB_REC(bit_nary IR_BOR) 48 | LJLIB_ASM_(bit_bxor) LJLIB_REC(bit_nary IR_BXOR) 49 | 50 | /* ------------------------------------------------------------------------ */ 51 | 52 | LJLIB_CF(bit_tohex) 53 | { 54 | uint32_t b = (uint32_t)lj_lib_checkbit(L, 1); 55 | int32_t i, n = L->base+1 >= L->top ? 8 : lj_lib_checkbit(L, 2); 56 | const char *hexdigits = "0123456789abcdef"; 57 | char buf[8]; 58 | if (n < 0) { n = -n; hexdigits = "0123456789ABCDEF"; } 59 | if (n > 8) n = 8; 60 | for (i = n; --i >= 0; ) { buf[i] = hexdigits[b & 15]; b >>= 4; } 61 | lua_pushlstring(L, buf, (size_t)n); 62 | return 1; 63 | } 64 | 65 | /* ------------------------------------------------------------------------ */ 66 | 67 | #include "lj_libdef.h" 68 | 69 | LUALIB_API int luaopen_bit(lua_State *L) 70 | { 71 | LJ_LIB_REG(L, LUA_BITLIBNAME, bit); 72 | return 1; 73 | } 74 | 75 | -------------------------------------------------------------------------------- /deps/luajit/src/lib_init.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Library initialization. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | ** 5 | ** Major parts taken verbatim from the Lua interpreter. 6 | ** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h 7 | */ 8 | 9 | #define lib_init_c 10 | #define LUA_LIB 11 | 12 | #include "lua.h" 13 | #include "lauxlib.h" 14 | #include "lualib.h" 15 | 16 | #include "lj_arch.h" 17 | 18 | static const luaL_Reg lj_lib_load[] = { 19 | { "", luaopen_base }, 20 | { LUA_LOADLIBNAME, luaopen_package }, 21 | { LUA_TABLIBNAME, luaopen_table }, 22 | { LUA_IOLIBNAME, luaopen_io }, 23 | { LUA_OSLIBNAME, luaopen_os }, 24 | { LUA_STRLIBNAME, luaopen_string }, 25 | { LUA_MATHLIBNAME, luaopen_math }, 26 | { LUA_DBLIBNAME, luaopen_debug }, 27 | { LUA_BITLIBNAME, luaopen_bit }, 28 | { LUA_JITLIBNAME, luaopen_jit }, 29 | { NULL, NULL } 30 | }; 31 | 32 | static const luaL_Reg lj_lib_preload[] = { 33 | #if LJ_HASFFI 34 | { LUA_FFILIBNAME, luaopen_ffi }, 35 | #endif 36 | { NULL, NULL } 37 | }; 38 | 39 | LUALIB_API void luaL_openlibs(lua_State *L) 40 | { 41 | const luaL_Reg *lib; 42 | for (lib = lj_lib_load; lib->func; lib++) { 43 | lua_pushcfunction(L, lib->func); 44 | lua_pushstring(L, lib->name); 45 | lua_call(L, 1, 0); 46 | } 47 | luaL_findtable(L, LUA_REGISTRYINDEX, "_PRELOAD", 48 | sizeof(lj_lib_preload)/sizeof(lj_lib_preload[0])-1); 49 | for (lib = lj_lib_preload; lib->func; lib++) { 50 | lua_pushcfunction(L, lib->func); 51 | lua_setfield(L, -2, lib->name); 52 | } 53 | lua_pop(L, 1); 54 | } 55 | 56 | -------------------------------------------------------------------------------- /deps/luajit/src/lj.supp: -------------------------------------------------------------------------------- 1 | # Valgrind suppression file for LuaJIT 2.0. 2 | { 3 | Optimized string compare 4 | Memcheck:Addr4 5 | fun:lj_str_cmp 6 | } 7 | { 8 | Optimized string compare 9 | Memcheck:Addr1 10 | fun:lj_str_cmp 11 | } 12 | { 13 | Optimized string compare 14 | Memcheck:Addr4 15 | fun:lj_str_new 16 | } 17 | { 18 | Optimized string compare 19 | Memcheck:Addr1 20 | fun:lj_str_new 21 | } 22 | { 23 | Optimized string compare 24 | Memcheck:Cond 25 | fun:lj_str_new 26 | } 27 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_alloc.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Bundled memory allocator. 3 | ** Donated to the public domain. 4 | */ 5 | 6 | #ifndef _LJ_ALLOC_H 7 | #define _LJ_ALLOC_H 8 | 9 | #include "lj_def.h" 10 | 11 | #ifndef LUAJIT_USE_SYSMALLOC 12 | LJ_FUNC void *lj_alloc_create(void); 13 | LJ_FUNC void lj_alloc_destroy(void *msp); 14 | LJ_FUNC void *lj_alloc_f(void *msp, void *ptr, size_t osize, size_t nsize); 15 | #endif 16 | 17 | #endif 18 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_asm.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** IR assembler (SSA IR -> machine code). 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_ASM_H 7 | #define _LJ_ASM_H 8 | 9 | #include "lj_jit.h" 10 | 11 | #if LJ_HASJIT 12 | LJ_FUNC void lj_asm_trace(jit_State *J, GCtrace *T); 13 | LJ_FUNC void lj_asm_patchexit(jit_State *J, GCtrace *T, ExitNo exitno, 14 | MCode *target); 15 | #endif 16 | 17 | #endif 18 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_bc.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Bytecode instruction modes. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #define lj_bc_c 7 | #define LUA_CORE 8 | 9 | #include "lj_obj.h" 10 | #include "lj_bc.h" 11 | 12 | /* Bytecode offsets and bytecode instruction modes. */ 13 | #include "lj_bcdef.h" 14 | 15 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_bcdump.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Bytecode dump definitions. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_BCDUMP_H 7 | #define _LJ_BCDUMP_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_lex.h" 11 | 12 | /* -- Bytecode dump format ------------------------------------------------ */ 13 | 14 | /* 15 | ** dump = header proto+ 0U 16 | ** header = ESC 'L' 'J' versionB flagsU [namelenU nameB*] 17 | ** proto = lengthU pdata 18 | ** pdata = phead bcinsW* uvdataH* kgc* knum* [debugB*] 19 | ** phead = flagsB numparamsB framesizeB numuvB numkgcU numknU numbcU 20 | ** [debuglenU [firstlineU numlineU]] 21 | ** kgc = kgctypeU { ktab | (loU hiU) | (rloU rhiU iloU ihiU) | strB* } 22 | ** knum = intU0 | (loU1 hiU) 23 | ** ktab = narrayU nhashU karray* khash* 24 | ** karray = ktabk 25 | ** khash = ktabk ktabk 26 | ** ktabk = ktabtypeU { intU | (loU hiU) | strB* } 27 | ** 28 | ** B = 8 bit, H = 16 bit, W = 32 bit, U = ULEB128 of W, U0/U1 = ULEB128 of W+1 29 | */ 30 | 31 | /* Bytecode dump header. */ 32 | #define BCDUMP_HEAD1 0x1b 33 | #define BCDUMP_HEAD2 0x4c 34 | #define BCDUMP_HEAD3 0x4a 35 | 36 | /* If you perform *any* kind of private modifications to the bytecode itself 37 | ** or to the dump format, you *must* set BCDUMP_VERSION to 0x80 or higher. 38 | */ 39 | #define BCDUMP_VERSION 1 40 | 41 | /* Compatibility flags. */ 42 | #define BCDUMP_F_BE 0x01 43 | #define BCDUMP_F_STRIP 0x02 44 | #define BCDUMP_F_FFI 0x04 45 | 46 | #define BCDUMP_F_KNOWN (BCDUMP_F_FFI*2-1) 47 | 48 | /* Type codes for the GC constants of a prototype. Plus length for strings. */ 49 | enum { 50 | BCDUMP_KGC_CHILD, BCDUMP_KGC_TAB, BCDUMP_KGC_I64, BCDUMP_KGC_U64, 51 | BCDUMP_KGC_COMPLEX, BCDUMP_KGC_STR 52 | }; 53 | 54 | /* Type codes for the keys/values of a constant table. */ 55 | enum { 56 | BCDUMP_KTAB_NIL, BCDUMP_KTAB_FALSE, BCDUMP_KTAB_TRUE, 57 | BCDUMP_KTAB_INT, BCDUMP_KTAB_NUM, BCDUMP_KTAB_STR 58 | }; 59 | 60 | /* -- Bytecode reader/writer ---------------------------------------------- */ 61 | 62 | LJ_FUNC int lj_bcwrite(lua_State *L, GCproto *pt, lua_Writer writer, 63 | void *data, int strip); 64 | LJ_FUNC GCproto *lj_bcread(LexState *ls); 65 | 66 | #endif 67 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_carith.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** C data arithmetic. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_CARITH_H 7 | #define _LJ_CARITH_H 8 | 9 | #include "lj_obj.h" 10 | 11 | #if LJ_HASFFI 12 | 13 | LJ_FUNC int lj_carith_op(lua_State *L, MMS mm); 14 | 15 | #if LJ_32 && LJ_HASJIT 16 | LJ_FUNC int64_t lj_carith_mul64(int64_t x, int64_t k); 17 | #endif 18 | LJ_FUNC uint64_t lj_carith_divu64(uint64_t a, uint64_t b); 19 | LJ_FUNC int64_t lj_carith_divi64(int64_t a, int64_t b); 20 | LJ_FUNC uint64_t lj_carith_modu64(uint64_t a, uint64_t b); 21 | LJ_FUNC int64_t lj_carith_modi64(int64_t a, int64_t b); 22 | LJ_FUNC uint64_t lj_carith_powu64(uint64_t x, uint64_t k); 23 | LJ_FUNC int64_t lj_carith_powi64(int64_t x, int64_t k); 24 | 25 | #endif 26 | 27 | #endif 28 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_ccall.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** FFI C call handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_CCALL_H 7 | #define _LJ_CCALL_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_ctype.h" 11 | 12 | #if LJ_HASFFI 13 | 14 | /* -- C calling conventions ----------------------------------------------- */ 15 | 16 | #if LJ_TARGET_X86ORX64 17 | 18 | #if LJ_TARGET_X86 19 | #define CCALL_NARG_GPR 2 /* For fastcall arguments. */ 20 | #define CCALL_NARG_FPR 0 21 | #define CCALL_NRET_GPR 2 22 | #define CCALL_NRET_FPR 1 /* For FP results on x87 stack. */ 23 | #define CCALL_ALIGN_STACKARG 0 /* Don't align argument on stack. */ 24 | #elif LJ_ABI_WIN 25 | #define CCALL_NARG_GPR 4 26 | #define CCALL_NARG_FPR 4 27 | #define CCALL_NRET_GPR 1 28 | #define CCALL_NRET_FPR 1 29 | #define CCALL_SPS_EXTRA 4 30 | #else 31 | #define CCALL_NARG_GPR 6 32 | #define CCALL_NARG_FPR 8 33 | #define CCALL_NRET_GPR 2 34 | #define CCALL_NRET_FPR 2 35 | #define CCALL_VECTOR_REG 1 /* Pass vectors in registers. */ 36 | #endif 37 | 38 | #define CCALL_SPS_FREE 1 39 | #define CCALL_ALIGN_CALLSTATE 16 40 | 41 | typedef LJ_ALIGN(16) union FPRArg { 42 | double d[2]; 43 | float f[4]; 44 | uint8_t b[16]; 45 | uint16_t s[8]; 46 | int i[4]; 47 | int64_t l[2]; 48 | } FPRArg; 49 | 50 | typedef intptr_t GPRArg; 51 | 52 | #elif LJ_TARGET_ARM 53 | 54 | #define CCALL_NARG_GPR 4 55 | #define CCALL_NRET_GPR 2 /* For softfp double. */ 56 | #if LJ_ABI_SOFTFP 57 | #define CCALL_NARG_FPR 0 58 | #define CCALL_NRET_FPR 0 59 | #else 60 | #define CCALL_NARG_FPR 8 61 | #define CCALL_NRET_FPR 4 62 | #endif 63 | #define CCALL_SPS_FREE 0 64 | 65 | typedef intptr_t GPRArg; 66 | typedef union FPRArg { 67 | double d; 68 | float f[2]; 69 | } FPRArg; 70 | 71 | #elif LJ_TARGET_PPC 72 | 73 | #define CCALL_NARG_GPR 8 74 | #define CCALL_NARG_FPR 8 75 | #define CCALL_NRET_GPR 4 /* For complex double. */ 76 | #define CCALL_NRET_FPR 1 77 | #define CCALL_SPS_EXTRA 4 78 | #define CCALL_SPS_FREE 0 79 | 80 | typedef intptr_t GPRArg; 81 | typedef double FPRArg; 82 | 83 | #elif LJ_TARGET_PPCSPE 84 | 85 | #define CCALL_NARG_GPR 8 86 | #define CCALL_NARG_FPR 0 87 | #define CCALL_NRET_GPR 4 /* For softfp complex double. */ 88 | #define CCALL_NRET_FPR 0 89 | #define CCALL_SPS_FREE 0 /* NYI */ 90 | 91 | typedef intptr_t GPRArg; 92 | 93 | #elif LJ_TARGET_MIPS 94 | 95 | #define CCALL_NARG_GPR 4 96 | #define CCALL_NARG_FPR 2 97 | #define CCALL_NRET_GPR 2 98 | #define CCALL_NRET_FPR 2 99 | #define CCALL_SPS_EXTRA 7 100 | #define CCALL_SPS_FREE 1 101 | 102 | typedef intptr_t GPRArg; 103 | typedef union FPRArg { 104 | double d; 105 | struct { LJ_ENDIAN_LOHI(float f; , float g;) }; 106 | } FPRArg; 107 | 108 | #else 109 | #error "Missing calling convention definitions for this architecture" 110 | #endif 111 | 112 | #ifndef CCALL_SPS_EXTRA 113 | #define CCALL_SPS_EXTRA 0 114 | #endif 115 | #ifndef CCALL_VECTOR_REG 116 | #define CCALL_VECTOR_REG 0 117 | #endif 118 | #ifndef CCALL_ALIGN_STACKARG 119 | #define CCALL_ALIGN_STACKARG 1 120 | #endif 121 | #ifndef CCALL_ALIGN_CALLSTATE 122 | #define CCALL_ALIGN_CALLSTATE 8 123 | #endif 124 | 125 | #define CCALL_NUM_GPR \ 126 | (CCALL_NARG_GPR > CCALL_NRET_GPR ? CCALL_NARG_GPR : CCALL_NRET_GPR) 127 | #define CCALL_NUM_FPR \ 128 | (CCALL_NARG_FPR > CCALL_NRET_FPR ? CCALL_NARG_FPR : CCALL_NRET_FPR) 129 | 130 | /* Check against constants in lj_ctype.h. */ 131 | LJ_STATIC_ASSERT(CCALL_NUM_GPR <= CCALL_MAX_GPR); 132 | LJ_STATIC_ASSERT(CCALL_NUM_FPR <= CCALL_MAX_FPR); 133 | 134 | #define CCALL_MAXSTACK 32 135 | 136 | /* -- C call state -------------------------------------------------------- */ 137 | 138 | typedef LJ_ALIGN(CCALL_ALIGN_CALLSTATE) struct CCallState { 139 | void (*func)(void); /* Pointer to called function. */ 140 | uint32_t spadj; /* Stack pointer adjustment. */ 141 | uint8_t nsp; /* Number of stack slots. */ 142 | uint8_t retref; /* Return value by reference. */ 143 | #if LJ_TARGET_X64 144 | uint8_t ngpr; /* Number of arguments in GPRs. */ 145 | uint8_t nfpr; /* Number of arguments in FPRs. */ 146 | #elif LJ_TARGET_X86 147 | uint8_t resx87; /* Result on x87 stack: 1:float, 2:double. */ 148 | #elif LJ_TARGET_PPC 149 | uint8_t nfpr; /* Number of arguments in FPRs. */ 150 | #endif 151 | #if LJ_32 152 | int32_t align1; 153 | #endif 154 | #if CCALL_NUM_FPR 155 | FPRArg fpr[CCALL_NUM_FPR]; /* Arguments/results in FPRs. */ 156 | #endif 157 | GPRArg gpr[CCALL_NUM_GPR]; /* Arguments/results in GPRs. */ 158 | GPRArg stack[CCALL_MAXSTACK]; /* Stack slots. */ 159 | } CCallState; 160 | 161 | /* -- C call handling ----------------------------------------------------- */ 162 | 163 | /* Really belongs to lj_vm.h. */ 164 | LJ_ASMF void LJ_FASTCALL lj_vm_ffi_call(CCallState *cc); 165 | 166 | LJ_FUNC CTypeID lj_ccall_ctid_vararg(CTState *cts, cTValue *o); 167 | LJ_FUNC int lj_ccall_func(lua_State *L, GCcdata *cd); 168 | 169 | #endif 170 | 171 | #endif 172 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_ccallback.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** FFI C callback handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_CCALLBACK_H 7 | #define _LJ_CCALLBACK_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_ctype.h" 11 | 12 | #if LJ_HASFFI 13 | 14 | /* Really belongs to lj_vm.h. */ 15 | LJ_ASMF void lj_vm_ffi_callback(void); 16 | 17 | LJ_FUNC MSize lj_ccallback_ptr2slot(CTState *cts, void *p); 18 | LJ_FUNCA lua_State * LJ_FASTCALL lj_ccallback_enter(CTState *cts, void *cf); 19 | LJ_FUNCA void LJ_FASTCALL lj_ccallback_leave(CTState *cts, TValue *o); 20 | LJ_FUNC void *lj_ccallback_new(CTState *cts, CType *ct, GCfunc *fn); 21 | LJ_FUNC void lj_ccallback_mcode_free(CTState *cts); 22 | 23 | #endif 24 | 25 | #endif 26 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_cconv.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** C type conversions. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_CCONV_H 7 | #define _LJ_CCONV_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_ctype.h" 11 | 12 | #if LJ_HASFFI 13 | 14 | /* Compressed C type index. ORDER CCX. */ 15 | enum { 16 | CCX_B, /* Bool. */ 17 | CCX_I, /* Integer. */ 18 | CCX_F, /* Floating-point number. */ 19 | CCX_C, /* Complex. */ 20 | CCX_V, /* Vector. */ 21 | CCX_P, /* Pointer. */ 22 | CCX_A, /* Refarray. */ 23 | CCX_S /* Struct/union. */ 24 | }; 25 | 26 | /* Convert C type info to compressed C type index. ORDER CT. ORDER CCX. */ 27 | static LJ_AINLINE uint32_t cconv_idx(CTInfo info) 28 | { 29 | uint32_t idx = ((info >> 26) & 15u); /* Dispatch bits. */ 30 | lua_assert(ctype_type(info) <= CT_MAYCONVERT); 31 | #if LJ_64 32 | idx = ((uint32_t)(U64x(f436fff5,fff7f021) >> 4*idx) & 15u); 33 | #else 34 | idx = (((idx < 8 ? 0xfff7f021u : 0xf436fff5) >> 4*(idx & 7u)) & 15u); 35 | #endif 36 | lua_assert(idx < 8); 37 | return idx; 38 | } 39 | 40 | #define cconv_idx2(dinfo, sinfo) \ 41 | ((cconv_idx((dinfo)) << 3) + cconv_idx((sinfo))) 42 | 43 | #define CCX(dst, src) ((CCX_##dst << 3) + CCX_##src) 44 | 45 | /* Conversion flags. */ 46 | #define CCF_CAST 0x00000001u 47 | #define CCF_FROMTV 0x00000002u 48 | #define CCF_SAME 0x00000004u 49 | #define CCF_IGNQUAL 0x00000008u 50 | 51 | #define CCF_ARG_SHIFT 8 52 | #define CCF_ARG(n) ((n) << CCF_ARG_SHIFT) 53 | #define CCF_GETARG(f) ((f) >> CCF_ARG_SHIFT) 54 | 55 | LJ_FUNC int lj_cconv_compatptr(CTState *cts, CType *d, CType *s, CTInfo flags); 56 | LJ_FUNC void lj_cconv_ct_ct(CTState *cts, CType *d, CType *s, 57 | uint8_t *dp, uint8_t *sp, CTInfo flags); 58 | LJ_FUNC int lj_cconv_tv_ct(CTState *cts, CType *s, CTypeID sid, 59 | TValue *o, uint8_t *sp); 60 | LJ_FUNC int lj_cconv_tv_bf(CTState *cts, CType *s, TValue *o, uint8_t *sp); 61 | LJ_FUNC void lj_cconv_ct_tv(CTState *cts, CType *d, 62 | uint8_t *dp, TValue *o, CTInfo flags); 63 | LJ_FUNC void lj_cconv_bf_tv(CTState *cts, CType *d, uint8_t *dp, TValue *o); 64 | LJ_FUNC int lj_cconv_multi_init(CTState *cts, CType *d, TValue *o); 65 | LJ_FUNC void lj_cconv_ct_init(CTState *cts, CType *d, CTSize sz, 66 | uint8_t *dp, TValue *o, MSize len); 67 | 68 | #endif 69 | 70 | #endif 71 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_cdata.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** C data management. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_CDATA_H 7 | #define _LJ_CDATA_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_gc.h" 11 | #include "lj_ctype.h" 12 | 13 | #if LJ_HASFFI 14 | 15 | /* Get C data pointer. */ 16 | static LJ_AINLINE void *cdata_getptr(void *p, CTSize sz) 17 | { 18 | if (LJ_64 && sz == 4) { /* Support 32 bit pointers on 64 bit targets. */ 19 | return ((void *)(uintptr_t)*(uint32_t *)p); 20 | } else { 21 | lua_assert(sz == CTSIZE_PTR); 22 | return *(void **)p; 23 | } 24 | } 25 | 26 | /* Set C data pointer. */ 27 | static LJ_AINLINE void cdata_setptr(void *p, CTSize sz, const void *v) 28 | { 29 | if (LJ_64 && sz == 4) { /* Support 32 bit pointers on 64 bit targets. */ 30 | *(uint32_t *)p = (uint32_t)(uintptr_t)v; 31 | } else { 32 | lua_assert(sz == CTSIZE_PTR); 33 | *(void **)p = (void *)v; 34 | } 35 | } 36 | 37 | /* Allocate fixed-size C data object. */ 38 | static LJ_AINLINE GCcdata *lj_cdata_new(CTState *cts, CTypeID id, CTSize sz) 39 | { 40 | GCcdata *cd; 41 | #ifdef LUA_USE_ASSERT 42 | CType *ct = ctype_raw(cts, id); 43 | lua_assert((ctype_hassize(ct->info) ? ct->size : CTSIZE_PTR) == sz); 44 | #endif 45 | cd = (GCcdata *)lj_mem_newgco(cts->L, sizeof(GCcdata) + sz); 46 | cd->gct = ~LJ_TCDATA; 47 | cd->ctypeid = ctype_check(cts, id); 48 | return cd; 49 | } 50 | 51 | /* Variant which works without a valid CTState. */ 52 | static LJ_AINLINE GCcdata *lj_cdata_new_(lua_State *L, CTypeID id, CTSize sz) 53 | { 54 | GCcdata *cd = (GCcdata *)lj_mem_newgco(L, sizeof(GCcdata) + sz); 55 | cd->gct = ~LJ_TCDATA; 56 | cd->ctypeid = id; 57 | return cd; 58 | } 59 | 60 | LJ_FUNC GCcdata *lj_cdata_newref(CTState *cts, const void *pp, CTypeID id); 61 | LJ_FUNC GCcdata *lj_cdata_newv(CTState *cts, CTypeID id, CTSize sz, 62 | CTSize align); 63 | 64 | LJ_FUNC void LJ_FASTCALL lj_cdata_free(global_State *g, GCcdata *cd); 65 | LJ_FUNCA TValue * LJ_FASTCALL lj_cdata_setfin(lua_State *L, GCcdata *cd); 66 | 67 | LJ_FUNC CType *lj_cdata_index(CTState *cts, GCcdata *cd, cTValue *key, 68 | uint8_t **pp, CTInfo *qual); 69 | LJ_FUNC int lj_cdata_get(CTState *cts, CType *s, TValue *o, uint8_t *sp); 70 | LJ_FUNC void lj_cdata_set(CTState *cts, CType *d, uint8_t *dp, TValue *o, 71 | CTInfo qual); 72 | 73 | #endif 74 | 75 | #endif 76 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_char.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Character types. 3 | ** Donated to the public domain. 4 | ** 5 | ** This is intended to replace the problematic libc single-byte NLS functions. 6 | ** These just don't make sense anymore with UTF-8 locales becoming the norm 7 | ** on POSIX systems. It never worked too well on Windows systems since hardly 8 | ** anyone bothered to call setlocale(). 9 | ** 10 | ** This table is hardcoded for ASCII. Identifiers include the characters 11 | ** 128-255, too. This allows for the use of all non-ASCII chars as identifiers 12 | ** in the lexer. This is a broad definition, but works well in practice 13 | ** for both UTF-8 locales and most single-byte locales (such as ISO-8859-*). 14 | ** 15 | ** If you really need proper character types for UTF-8 strings, please use 16 | ** an add-on library such as slnunicode: http://luaforge.net/projects/sln/ 17 | */ 18 | 19 | #define lj_char_c 20 | #define LUA_CORE 21 | 22 | #include "lj_char.h" 23 | 24 | LJ_DATADEF const uint8_t lj_char_bits[257] = { 25 | 0, 26 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 3, 3, 3, 3, 1, 1, 27 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 28 | 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 29 | 152,152,152,152,152,152,152,152,152,152, 4, 4, 4, 4, 4, 4, 30 | 4,176,176,176,176,176,176,160,160,160,160,160,160,160,160,160, 31 | 160,160,160,160,160,160,160,160,160,160,160, 4, 4, 4, 4,132, 32 | 4,208,208,208,208,208,208,192,192,192,192,192,192,192,192,192, 33 | 192,192,192,192,192,192,192,192,192,192,192, 4, 4, 4, 4, 1, 34 | 128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128, 35 | 128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128, 36 | 128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128, 37 | 128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128, 38 | 128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128, 39 | 128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128, 40 | 128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128, 41 | 128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128 42 | }; 43 | 44 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_char.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Character types. 3 | ** Donated to the public domain. 4 | */ 5 | 6 | #ifndef _LJ_CHAR_H 7 | #define _LJ_CHAR_H 8 | 9 | #include "lj_def.h" 10 | 11 | #define LJ_CHAR_CNTRL 0x01 12 | #define LJ_CHAR_SPACE 0x02 13 | #define LJ_CHAR_PUNCT 0x04 14 | #define LJ_CHAR_DIGIT 0x08 15 | #define LJ_CHAR_XDIGIT 0x10 16 | #define LJ_CHAR_UPPER 0x20 17 | #define LJ_CHAR_LOWER 0x40 18 | #define LJ_CHAR_IDENT 0x80 19 | #define LJ_CHAR_ALPHA (LJ_CHAR_LOWER|LJ_CHAR_UPPER) 20 | #define LJ_CHAR_ALNUM (LJ_CHAR_ALPHA|LJ_CHAR_DIGIT) 21 | #define LJ_CHAR_GRAPH (LJ_CHAR_ALNUM|LJ_CHAR_PUNCT) 22 | 23 | /* Only pass -1 or 0..255 to these macros. Never pass a signed char! */ 24 | #define lj_char_isa(c, t) ((lj_char_bits+1)[(c)] & t) 25 | #define lj_char_iscntrl(c) lj_char_isa((c), LJ_CHAR_CNTRL) 26 | #define lj_char_isspace(c) lj_char_isa((c), LJ_CHAR_SPACE) 27 | #define lj_char_ispunct(c) lj_char_isa((c), LJ_CHAR_PUNCT) 28 | #define lj_char_isdigit(c) lj_char_isa((c), LJ_CHAR_DIGIT) 29 | #define lj_char_isxdigit(c) lj_char_isa((c), LJ_CHAR_XDIGIT) 30 | #define lj_char_isupper(c) lj_char_isa((c), LJ_CHAR_UPPER) 31 | #define lj_char_islower(c) lj_char_isa((c), LJ_CHAR_LOWER) 32 | #define lj_char_isident(c) lj_char_isa((c), LJ_CHAR_IDENT) 33 | #define lj_char_isalpha(c) lj_char_isa((c), LJ_CHAR_ALPHA) 34 | #define lj_char_isalnum(c) lj_char_isa((c), LJ_CHAR_ALNUM) 35 | #define lj_char_isgraph(c) lj_char_isa((c), LJ_CHAR_GRAPH) 36 | 37 | #define lj_char_toupper(c) ((c) - (lj_char_islower(c) >> 1)) 38 | #define lj_char_tolower(c) ((c) + lj_char_isupper(c)) 39 | 40 | LJ_DATA const uint8_t lj_char_bits[257]; 41 | 42 | #endif 43 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_clib.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** FFI C library loader. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_CLIB_H 7 | #define _LJ_CLIB_H 8 | 9 | #include "lj_obj.h" 10 | 11 | #if LJ_HASFFI 12 | 13 | /* Namespace for C library indexing. */ 14 | #define CLNS_INDEX ((1u<env. */ 20 | } CLibrary; 21 | 22 | LJ_FUNC TValue *lj_clib_index(lua_State *L, CLibrary *cl, GCstr *name); 23 | LJ_FUNC void lj_clib_load(lua_State *L, GCtab *mt, GCstr *name, int global); 24 | LJ_FUNC void lj_clib_unload(CLibrary *cl); 25 | LJ_FUNC void lj_clib_default(lua_State *L, GCtab *mt); 26 | 27 | #endif 28 | 29 | #endif 30 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_cparse.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** C declaration parser. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_CPARSE_H 7 | #define _LJ_CPARSE_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_ctype.h" 11 | 12 | #if LJ_HASFFI 13 | 14 | /* C parser limits. */ 15 | #define CPARSE_MAX_BUF 32768 /* Max. token buffer size. */ 16 | #define CPARSE_MAX_DECLSTACK 100 /* Max. declaration stack depth. */ 17 | #define CPARSE_MAX_DECLDEPTH 20 /* Max. recursive declaration depth. */ 18 | #define CPARSE_MAX_PACKSTACK 7 /* Max. pack pragma stack depth. */ 19 | 20 | /* Flags for C parser mode. */ 21 | #define CPARSE_MODE_MULTI 1 /* Process multiple declarations. */ 22 | #define CPARSE_MODE_ABSTRACT 2 /* Accept abstract declarators. */ 23 | #define CPARSE_MODE_DIRECT 4 /* Accept direct declarators. */ 24 | #define CPARSE_MODE_FIELD 8 /* Accept field width in bits, too. */ 25 | #define CPARSE_MODE_NOIMPLICIT 16 /* Reject implicit declarations. */ 26 | #define CPARSE_MODE_SKIP 32 /* Skip definitions, ignore errors. */ 27 | 28 | typedef int CPChar; /* C parser character. Unsigned ext. from char. */ 29 | typedef int CPToken; /* C parser token. */ 30 | 31 | /* C parser internal value representation. */ 32 | typedef struct CPValue { 33 | union { 34 | int32_t i32; /* Value for CTID_INT32. */ 35 | uint32_t u32; /* Value for CTID_UINT32. */ 36 | }; 37 | CTypeID id; /* C Type ID of the value. */ 38 | } CPValue; 39 | 40 | /* C parser state. */ 41 | typedef struct CPState { 42 | CPChar c; /* Current character. */ 43 | CPToken tok; /* Current token. */ 44 | CPValue val; /* Token value. */ 45 | GCstr *str; /* Interned string of identifier/keyword. */ 46 | CType *ct; /* C type table entry. */ 47 | const char *p; /* Current position in input buffer. */ 48 | SBuf sb; /* String buffer for tokens. */ 49 | lua_State *L; /* Lua state. */ 50 | CTState *cts; /* C type state. */ 51 | TValue *param; /* C type parameters. */ 52 | const char *srcname; /* Current source name. */ 53 | BCLine linenumber; /* Input line counter. */ 54 | int depth; /* Recursive declaration depth. */ 55 | uint32_t tmask; /* Type mask for next identifier. */ 56 | uint32_t mode; /* C parser mode. */ 57 | uint8_t packstack[CPARSE_MAX_PACKSTACK]; /* Stack for pack pragmas. */ 58 | uint8_t curpack; /* Current position in pack pragma stack. */ 59 | } CPState; 60 | 61 | LJ_FUNC int lj_cparse(CPState *cp); 62 | 63 | #endif 64 | 65 | #endif 66 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_crecord.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Trace recorder for C data operations. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_CRECORD_H 7 | #define _LJ_CRECORD_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_jit.h" 11 | #include "lj_ffrecord.h" 12 | 13 | #if LJ_HASJIT && LJ_HASFFI 14 | LJ_FUNC void LJ_FASTCALL recff_cdata_index(jit_State *J, RecordFFData *rd); 15 | LJ_FUNC void LJ_FASTCALL recff_cdata_call(jit_State *J, RecordFFData *rd); 16 | LJ_FUNC void LJ_FASTCALL recff_cdata_arith(jit_State *J, RecordFFData *rd); 17 | LJ_FUNC void LJ_FASTCALL recff_clib_index(jit_State *J, RecordFFData *rd); 18 | LJ_FUNC void LJ_FASTCALL recff_ffi_new(jit_State *J, RecordFFData *rd); 19 | LJ_FUNC void LJ_FASTCALL recff_ffi_errno(jit_State *J, RecordFFData *rd); 20 | LJ_FUNC void LJ_FASTCALL recff_ffi_string(jit_State *J, RecordFFData *rd); 21 | LJ_FUNC void LJ_FASTCALL recff_ffi_copy(jit_State *J, RecordFFData *rd); 22 | LJ_FUNC void LJ_FASTCALL recff_ffi_fill(jit_State *J, RecordFFData *rd); 23 | LJ_FUNC void LJ_FASTCALL recff_ffi_typeof(jit_State *J, RecordFFData *rd); 24 | LJ_FUNC void LJ_FASTCALL recff_ffi_istype(jit_State *J, RecordFFData *rd); 25 | LJ_FUNC void LJ_FASTCALL recff_ffi_abi(jit_State *J, RecordFFData *rd); 26 | LJ_FUNC void LJ_FASTCALL recff_ffi_xof(jit_State *J, RecordFFData *rd); 27 | LJ_FUNC void LJ_FASTCALL recff_ffi_gc(jit_State *J, RecordFFData *rd); 28 | LJ_FUNC void LJ_FASTCALL lj_crecord_tonumber(jit_State *J, RecordFFData *rd); 29 | #endif 30 | 31 | #endif 32 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_debug.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Debugging and introspection. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_DEBUG_H 7 | #define _LJ_DEBUG_H 8 | 9 | #include "lj_obj.h" 10 | 11 | typedef struct lj_Debug { 12 | /* Common fields. Must be in the same order as in lua.h. */ 13 | int event; 14 | const char *name; 15 | const char *namewhat; 16 | const char *what; 17 | const char *source; 18 | int currentline; 19 | int nups; 20 | int linedefined; 21 | int lastlinedefined; 22 | char short_src[LUA_IDSIZE]; 23 | int i_ci; 24 | /* Extended fields. Only valid if lj_debug_getinfo() is called with ext = 1.*/ 25 | int nparams; 26 | int isvararg; 27 | } lj_Debug; 28 | 29 | LJ_FUNC cTValue *lj_debug_frame(lua_State *L, int level, int *size); 30 | LJ_FUNC BCLine LJ_FASTCALL lj_debug_line(GCproto *pt, BCPos pc); 31 | LJ_FUNC const char *lj_debug_uvname(GCproto *pt, uint32_t idx); 32 | LJ_FUNC const char *lj_debug_uvnamev(cTValue *o, uint32_t idx, TValue **tvp); 33 | LJ_FUNC const char *lj_debug_slotname(GCproto *pt, const BCIns *pc, 34 | BCReg slot, const char **name); 35 | LJ_FUNC const char *lj_debug_funcname(lua_State *L, TValue *frame, 36 | const char **name); 37 | LJ_FUNC void lj_debug_shortname(char *out, GCstr *str); 38 | LJ_FUNC void lj_debug_addloc(lua_State *L, const char *msg, 39 | cTValue *frame, cTValue *nextframe); 40 | LJ_FUNC void lj_debug_pushloc(lua_State *L, GCproto *pt, BCPos pc); 41 | LJ_FUNC int lj_debug_getinfo(lua_State *L, const char *what, lj_Debug *ar, 42 | int ext); 43 | 44 | /* Fixed internal variable names. */ 45 | #define VARNAMEDEF(_) \ 46 | _(FOR_IDX, "(for index)") \ 47 | _(FOR_STOP, "(for limit)") \ 48 | _(FOR_STEP, "(for step)") \ 49 | _(FOR_GEN, "(for generator)") \ 50 | _(FOR_STATE, "(for state)") \ 51 | _(FOR_CTL, "(for control)") 52 | 53 | enum { 54 | VARNAME_END, 55 | #define VARNAMEENUM(name, str) VARNAME_##name, 56 | VARNAMEDEF(VARNAMEENUM) 57 | #undef VARNAMEENUM 58 | VARNAME__MAX 59 | }; 60 | 61 | #endif 62 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_dispatch.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Instruction dispatch handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_DISPATCH_H 7 | #define _LJ_DISPATCH_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_bc.h" 11 | #if LJ_HASJIT 12 | #include "lj_jit.h" 13 | #endif 14 | 15 | #if LJ_TARGET_MIPS 16 | /* Need our own global offset table for the dreaded MIPS calling conventions. */ 17 | #if LJ_HASJIT 18 | #define JITGOTDEF(_) _(lj_trace_exit) _(lj_trace_hot) 19 | #else 20 | #define JITGOTDEF(_) 21 | #endif 22 | #if LJ_HASFFI 23 | #define FFIGOTDEF(_) \ 24 | _(lj_meta_equal_cd) _(lj_ccallback_enter) _(lj_ccallback_leave) 25 | #else 26 | #define FFIGOTDEF(_) 27 | #endif 28 | #define GOTDEF(_) \ 29 | _(floor) _(ceil) _(trunc) _(log) _(log10) _(exp) _(sin) _(cos) _(tan) \ 30 | _(asin) _(acos) _(atan) _(sinh) _(cosh) _(tanh) _(frexp) _(modf) _(atan2) \ 31 | _(pow) _(fmod) _(ldexp) \ 32 | _(lj_dispatch_call) _(lj_dispatch_ins) _(lj_err_throw) \ 33 | _(lj_ffh_coroutine_wrap_err) _(lj_func_closeuv) _(lj_func_newL_gc) \ 34 | _(lj_gc_barrieruv) _(lj_gc_step) _(lj_gc_step_fixtop) _(lj_meta_arith) \ 35 | _(lj_meta_call) _(lj_meta_cat) _(lj_meta_comp) _(lj_meta_equal) \ 36 | _(lj_meta_for) _(lj_meta_len) _(lj_meta_tget) _(lj_meta_tset) \ 37 | _(lj_state_growstack) _(lj_str_fromnum) _(lj_str_fromnumber) _(lj_str_new) \ 38 | _(lj_tab_dup) _(lj_tab_get) _(lj_tab_getinth) _(lj_tab_len) _(lj_tab_new) \ 39 | _(lj_tab_newkey) _(lj_tab_next) _(lj_tab_reasize) \ 40 | JITGOTDEF(_) FFIGOTDEF(_) 41 | 42 | enum { 43 | #define GOTENUM(name) LJ_GOT_##name, 44 | GOTDEF(GOTENUM) 45 | #undef GOTENUM 46 | LJ_GOT__MAX 47 | }; 48 | #endif 49 | 50 | /* Type of hot counter. Must match the code in the assembler VM. */ 51 | /* 16 bits are sufficient. Only 0.0015% overhead with maximum slot penalty. */ 52 | typedef uint16_t HotCount; 53 | 54 | /* Number of hot counter hash table entries (must be a power of two). */ 55 | #define HOTCOUNT_SIZE 64 56 | #define HOTCOUNT_PCMASK ((HOTCOUNT_SIZE-1)*sizeof(HotCount)) 57 | 58 | /* Hotcount decrements. */ 59 | #define HOTCOUNT_LOOP 2 60 | #define HOTCOUNT_CALL 1 61 | 62 | /* This solves a circular dependency problem -- bump as needed. Sigh. */ 63 | #define GG_NUM_ASMFF 62 64 | 65 | #define GG_LEN_DDISP (BC__MAX + GG_NUM_ASMFF) 66 | #define GG_LEN_SDISP BC_FUNCF 67 | #define GG_LEN_DISP (GG_LEN_DDISP + GG_LEN_SDISP) 68 | 69 | /* Global state, main thread and extra fields are allocated together. */ 70 | typedef struct GG_State { 71 | lua_State L; /* Main thread. */ 72 | global_State g; /* Global state. */ 73 | #if LJ_TARGET_MIPS 74 | ASMFunction got[LJ_GOT__MAX]; /* Global offset table. */ 75 | #endif 76 | #if LJ_HASJIT 77 | jit_State J; /* JIT state. */ 78 | HotCount hotcount[HOTCOUNT_SIZE]; /* Hot counters. */ 79 | #endif 80 | ASMFunction dispatch[GG_LEN_DISP]; /* Instruction dispatch tables. */ 81 | BCIns bcff[GG_NUM_ASMFF]; /* Bytecode for ASM fast functions. */ 82 | } GG_State; 83 | 84 | #define GG_OFS(field) ((int)offsetof(GG_State, field)) 85 | #define G2GG(gl) ((GG_State *)((char *)(gl) - GG_OFS(g))) 86 | #define J2GG(j) ((GG_State *)((char *)(j) - GG_OFS(J))) 87 | #define L2GG(L) (G2GG(G(L))) 88 | #define J2G(J) (&J2GG(J)->g) 89 | #define G2J(gl) (&G2GG(gl)->J) 90 | #define L2J(L) (&L2GG(L)->J) 91 | #define GG_G2DISP (GG_OFS(dispatch) - GG_OFS(g)) 92 | #define GG_DISP2G (GG_OFS(g) - GG_OFS(dispatch)) 93 | #define GG_DISP2J (GG_OFS(J) - GG_OFS(dispatch)) 94 | #define GG_DISP2HOT (GG_OFS(hotcount) - GG_OFS(dispatch)) 95 | #define GG_DISP2STATIC (GG_LEN_DDISP*(int)sizeof(ASMFunction)) 96 | 97 | #define hotcount_get(gg, pc) \ 98 | (gg)->hotcount[(u32ptr(pc)>>2) & (HOTCOUNT_SIZE-1)] 99 | #define hotcount_set(gg, pc, val) \ 100 | (hotcount_get((gg), (pc)) = (HotCount)(val)) 101 | 102 | /* Dispatch table management. */ 103 | LJ_FUNC void lj_dispatch_init(GG_State *GG); 104 | #if LJ_HASJIT 105 | LJ_FUNC void lj_dispatch_init_hotcount(global_State *g); 106 | #endif 107 | LJ_FUNC void lj_dispatch_update(global_State *g); 108 | 109 | /* Instruction dispatch callback for hooks or when recording. */ 110 | LJ_FUNCA void LJ_FASTCALL lj_dispatch_ins(lua_State *L, const BCIns *pc); 111 | LJ_FUNCA ASMFunction LJ_FASTCALL lj_dispatch_call(lua_State *L, const BCIns*pc); 112 | LJ_FUNCA void LJ_FASTCALL lj_dispatch_return(lua_State *L, const BCIns *pc); 113 | 114 | #if LJ_HASFFI && !defined(_BUILDVM_H) 115 | /* Save/restore errno and GetLastError() around hooks, exits and recording. */ 116 | #include 117 | #if LJ_TARGET_WINDOWS 118 | #define WIN32_LEAN_AND_MEAN 119 | #include 120 | #define ERRNO_SAVE int olderr = errno; DWORD oldwerr = GetLastError(); 121 | #define ERRNO_RESTORE errno = olderr; SetLastError(oldwerr); 122 | #else 123 | #define ERRNO_SAVE int olderr = errno; 124 | #define ERRNO_RESTORE errno = olderr; 125 | #endif 126 | #else 127 | #define ERRNO_SAVE 128 | #define ERRNO_RESTORE 129 | #endif 130 | 131 | #endif 132 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_err.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Error handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_ERR_H 7 | #define _LJ_ERR_H 8 | 9 | #include 10 | 11 | #include "lj_obj.h" 12 | 13 | typedef enum { 14 | #define ERRDEF(name, msg) \ 15 | LJ_ERR_##name, LJ_ERR_##name##_ = LJ_ERR_##name + sizeof(msg)-1, 16 | #include "lj_errmsg.h" 17 | LJ_ERR__MAX 18 | } ErrMsg; 19 | 20 | LJ_DATA const char *lj_err_allmsg; 21 | #define err2msg(em) (lj_err_allmsg+(int)(em)) 22 | 23 | LJ_FUNC GCstr *lj_err_str(lua_State *L, ErrMsg em); 24 | LJ_FUNCA_NORET void LJ_FASTCALL lj_err_throw(lua_State *L, int errcode); 25 | LJ_FUNC_NORET void lj_err_mem(lua_State *L); 26 | LJ_FUNC_NORET void lj_err_run(lua_State *L); 27 | LJ_FUNC_NORET void lj_err_msg(lua_State *L, ErrMsg em); 28 | LJ_FUNC_NORET void lj_err_lex(lua_State *L, GCstr *src, const char *tok, 29 | BCLine line, ErrMsg em, va_list argp); 30 | LJ_FUNC_NORET void lj_err_optype(lua_State *L, cTValue *o, ErrMsg opm); 31 | LJ_FUNC_NORET void lj_err_comp(lua_State *L, cTValue *o1, cTValue *o2); 32 | LJ_FUNC_NORET void lj_err_optype_call(lua_State *L, TValue *o); 33 | LJ_FUNC_NORET void lj_err_callermsg(lua_State *L, const char *msg); 34 | LJ_FUNC_NORET void lj_err_callerv(lua_State *L, ErrMsg em, ...); 35 | LJ_FUNC_NORET void lj_err_caller(lua_State *L, ErrMsg em); 36 | LJ_FUNC_NORET void lj_err_arg(lua_State *L, int narg, ErrMsg em); 37 | LJ_FUNC_NORET void lj_err_argv(lua_State *L, int narg, ErrMsg em, ...); 38 | LJ_FUNC_NORET void lj_err_argtype(lua_State *L, int narg, const char *xname); 39 | LJ_FUNC_NORET void lj_err_argt(lua_State *L, int narg, int tt); 40 | 41 | #endif 42 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_ff.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Fast function IDs. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_FF_H 7 | #define _LJ_FF_H 8 | 9 | /* Fast function ID. */ 10 | typedef enum { 11 | FF_LUA_ = FF_LUA, /* Lua function (must be 0). */ 12 | FF_C_ = FF_C, /* Regular C function (must be 1). */ 13 | #define FFDEF(name) FF_##name, 14 | #include "lj_ffdef.h" 15 | FF__MAX 16 | } FastFunc; 17 | 18 | #endif 19 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_ffrecord.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Fast function call recorder. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_FFRECORD_H 7 | #define _LJ_FFRECORD_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_jit.h" 11 | 12 | #if LJ_HASJIT 13 | /* Data used by handlers to record a fast function. */ 14 | typedef struct RecordFFData { 15 | TValue *argv; /* Runtime argument values. */ 16 | ptrdiff_t nres; /* Number of returned results (defaults to 1). */ 17 | uint32_t data; /* Per-ffid auxiliary data (opcode, literal etc.). */ 18 | } RecordFFData; 19 | 20 | LJ_FUNC int32_t lj_ffrecord_select_mode(jit_State *J, TRef tr, TValue *tv); 21 | LJ_FUNC void lj_ffrecord_func(jit_State *J); 22 | #endif 23 | 24 | #endif 25 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_func.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Function handling (prototypes, functions and upvalues). 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_FUNC_H 7 | #define _LJ_FUNC_H 8 | 9 | #include "lj_obj.h" 10 | 11 | /* Prototypes. */ 12 | LJ_FUNC void LJ_FASTCALL lj_func_freeproto(global_State *g, GCproto *pt); 13 | 14 | /* Upvalues. */ 15 | LJ_FUNCA void LJ_FASTCALL lj_func_closeuv(lua_State *L, TValue *level); 16 | LJ_FUNC void LJ_FASTCALL lj_func_freeuv(global_State *g, GCupval *uv); 17 | 18 | /* Functions (closures). */ 19 | LJ_FUNC GCfunc *lj_func_newC(lua_State *L, MSize nelems, GCtab *env); 20 | LJ_FUNC GCfunc *lj_func_newL_empty(lua_State *L, GCproto *pt, GCtab *env); 21 | LJ_FUNCA GCfunc *lj_func_newL_gc(lua_State *L, GCproto *pt, GCfuncL *parent); 22 | LJ_FUNC void LJ_FASTCALL lj_func_free(global_State *g, GCfunc *c); 23 | 24 | #endif 25 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_gc.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Garbage collector. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_GC_H 7 | #define _LJ_GC_H 8 | 9 | #include "lj_obj.h" 10 | 11 | /* Garbage collector states. Order matters. */ 12 | enum { 13 | GCSpause, GCSpropagate, GCSatomic, GCSsweepstring, GCSsweep, GCSfinalize 14 | }; 15 | 16 | /* Bitmasks for marked field of GCobj. */ 17 | #define LJ_GC_WHITE0 0x01 18 | #define LJ_GC_WHITE1 0x02 19 | #define LJ_GC_BLACK 0x04 20 | #define LJ_GC_FINALIZED 0x08 21 | #define LJ_GC_WEAKKEY 0x08 22 | #define LJ_GC_WEAKVAL 0x10 23 | #define LJ_GC_CDATA_FIN 0x10 24 | #define LJ_GC_FIXED 0x20 25 | #define LJ_GC_SFIXED 0x40 26 | 27 | #define LJ_GC_WHITES (LJ_GC_WHITE0 | LJ_GC_WHITE1) 28 | #define LJ_GC_COLORS (LJ_GC_WHITES | LJ_GC_BLACK) 29 | #define LJ_GC_WEAK (LJ_GC_WEAKKEY | LJ_GC_WEAKVAL) 30 | 31 | /* Macros to test and set GCobj colors. */ 32 | #define iswhite(x) ((x)->gch.marked & LJ_GC_WHITES) 33 | #define isblack(x) ((x)->gch.marked & LJ_GC_BLACK) 34 | #define isgray(x) (!((x)->gch.marked & (LJ_GC_BLACK|LJ_GC_WHITES))) 35 | #define tviswhite(x) (tvisgcv(x) && iswhite(gcV(x))) 36 | #define otherwhite(g) (g->gc.currentwhite ^ LJ_GC_WHITES) 37 | #define isdead(g, v) ((v)->gch.marked & otherwhite(g) & LJ_GC_WHITES) 38 | 39 | #define curwhite(g) ((g)->gc.currentwhite & LJ_GC_WHITES) 40 | #define newwhite(g, x) (obj2gco(x)->gch.marked = (uint8_t)curwhite(g)) 41 | #define makewhite(g, x) \ 42 | ((x)->gch.marked = ((x)->gch.marked & (uint8_t)~LJ_GC_COLORS) | curwhite(g)) 43 | #define flipwhite(x) ((x)->gch.marked ^= LJ_GC_WHITES) 44 | #define black2gray(x) ((x)->gch.marked &= (uint8_t)~LJ_GC_BLACK) 45 | #define fixstring(s) ((s)->marked |= LJ_GC_FIXED) 46 | #define markfinalized(x) ((x)->gch.marked |= LJ_GC_FINALIZED) 47 | 48 | /* Collector. */ 49 | LJ_FUNC size_t lj_gc_separateudata(global_State *g, int all); 50 | LJ_FUNC void lj_gc_finalize_udata(lua_State *L); 51 | #if LJ_HASFFI 52 | LJ_FUNC void lj_gc_finalize_cdata(lua_State *L); 53 | #else 54 | #define lj_gc_finalize_cdata(L) UNUSED(L) 55 | #endif 56 | LJ_FUNC void lj_gc_freeall(global_State *g); 57 | LJ_FUNCA int LJ_FASTCALL lj_gc_step(lua_State *L); 58 | LJ_FUNCA void LJ_FASTCALL lj_gc_step_fixtop(lua_State *L); 59 | #if LJ_HASJIT 60 | LJ_FUNC int LJ_FASTCALL lj_gc_step_jit(global_State *g, MSize steps); 61 | #endif 62 | LJ_FUNC void lj_gc_fullgc(lua_State *L); 63 | 64 | /* GC check: drive collector forward if the GC threshold has been reached. */ 65 | #define lj_gc_check(L) \ 66 | { if (LJ_UNLIKELY(G(L)->gc.total >= G(L)->gc.threshold)) \ 67 | lj_gc_step(L); } 68 | #define lj_gc_check_fixtop(L) \ 69 | { if (LJ_UNLIKELY(G(L)->gc.total >= G(L)->gc.threshold)) \ 70 | lj_gc_step_fixtop(L); } 71 | 72 | /* Write barriers. */ 73 | LJ_FUNC void lj_gc_barrierf(global_State *g, GCobj *o, GCobj *v); 74 | LJ_FUNCA void LJ_FASTCALL lj_gc_barrieruv(global_State *g, TValue *tv); 75 | LJ_FUNC void lj_gc_closeuv(global_State *g, GCupval *uv); 76 | #if LJ_HASJIT 77 | LJ_FUNC void lj_gc_barriertrace(global_State *g, uint32_t traceno); 78 | #endif 79 | 80 | /* Move the GC propagation frontier back for tables (make it gray again). */ 81 | static LJ_AINLINE void lj_gc_barrierback(global_State *g, GCtab *t) 82 | { 83 | GCobj *o = obj2gco(t); 84 | lua_assert(isblack(o) && !isdead(g, o)); 85 | lua_assert(g->gc.state != GCSfinalize && g->gc.state != GCSpause); 86 | black2gray(o); 87 | setgcrefr(t->gclist, g->gc.grayagain); 88 | setgcref(g->gc.grayagain, o); 89 | } 90 | 91 | /* Barrier for stores to table objects. TValue and GCobj variant. */ 92 | #define lj_gc_anybarriert(L, t) \ 93 | { if (LJ_UNLIKELY(isblack(obj2gco(t)))) lj_gc_barrierback(G(L), (t)); } 94 | #define lj_gc_barriert(L, t, tv) \ 95 | { if (tviswhite(tv) && isblack(obj2gco(t))) \ 96 | lj_gc_barrierback(G(L), (t)); } 97 | #define lj_gc_objbarriert(L, t, o) \ 98 | { if (iswhite(obj2gco(o)) && isblack(obj2gco(t))) \ 99 | lj_gc_barrierback(G(L), (t)); } 100 | 101 | /* Barrier for stores to any other object. TValue and GCobj variant. */ 102 | #define lj_gc_barrier(L, p, tv) \ 103 | { if (tviswhite(tv) && isblack(obj2gco(p))) \ 104 | lj_gc_barrierf(G(L), obj2gco(p), gcV(tv)); } 105 | #define lj_gc_objbarrier(L, p, o) \ 106 | { if (iswhite(obj2gco(o)) && isblack(obj2gco(p))) \ 107 | lj_gc_barrierf(G(L), obj2gco(p), obj2gco(o)); } 108 | 109 | /* Allocator. */ 110 | LJ_FUNC void *lj_mem_realloc(lua_State *L, void *p, MSize osz, MSize nsz); 111 | LJ_FUNC void * LJ_FASTCALL lj_mem_newgco(lua_State *L, MSize size); 112 | LJ_FUNC void *lj_mem_grow(lua_State *L, void *p, 113 | MSize *szp, MSize lim, MSize esz); 114 | 115 | #define lj_mem_new(L, s) lj_mem_realloc(L, NULL, 0, (s)) 116 | 117 | static LJ_AINLINE void lj_mem_free(global_State *g, void *p, size_t osize) 118 | { 119 | g->gc.total -= (MSize)osize; 120 | g->allocf(g->allocd, p, osize, 0); 121 | } 122 | 123 | #define lj_mem_newvec(L, n, t) ((t *)lj_mem_new(L, (MSize)((n)*sizeof(t)))) 124 | #define lj_mem_reallocvec(L, p, on, n, t) \ 125 | ((p) = (t *)lj_mem_realloc(L, p, (on)*sizeof(t), (MSize)((n)*sizeof(t)))) 126 | #define lj_mem_growvec(L, p, n, m, t) \ 127 | ((p) = (t *)lj_mem_grow(L, (p), &(n), (m), (MSize)sizeof(t))) 128 | #define lj_mem_freevec(g, p, n, t) lj_mem_free(g, (p), (n)*sizeof(t)) 129 | 130 | #define lj_mem_newobj(L, t) ((t *)lj_mem_newgco(L, sizeof(t))) 131 | #define lj_mem_newt(L, s, t) ((t *)lj_mem_new(L, (s))) 132 | #define lj_mem_freet(g, p) lj_mem_free(g, (p), sizeof(*(p))) 133 | 134 | #endif 135 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_gdbjit.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Client for the GDB JIT API. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_GDBJIT_H 7 | #define _LJ_GDBJIT_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_jit.h" 11 | 12 | #if LJ_HASJIT && defined(LUAJIT_USE_GDBJIT) 13 | 14 | LJ_FUNC void lj_gdbjit_addtrace(jit_State *J, GCtrace *T); 15 | LJ_FUNC void lj_gdbjit_deltrace(jit_State *J, GCtrace *T); 16 | 17 | #else 18 | #define lj_gdbjit_addtrace(J, T) UNUSED(T) 19 | #define lj_gdbjit_deltrace(J, T) UNUSED(T) 20 | #endif 21 | 22 | #endif 23 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_lex.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Lexical analyzer. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_LEX_H 7 | #define _LJ_LEX_H 8 | 9 | #include 10 | 11 | #include "lj_obj.h" 12 | #include "lj_err.h" 13 | 14 | /* Lua lexer tokens. */ 15 | #define TKDEF(_, __) \ 16 | _(and) _(break) _(do) _(else) _(elseif) _(end) _(false) \ 17 | _(for) _(function) _(goto) _(if) _(in) _(local) _(nil) _(not) _(or) \ 18 | _(repeat) _(return) _(then) _(true) _(until) _(while) \ 19 | __(concat, ..) __(dots, ...) __(eq, ==) __(ge, >=) __(le, <=) __(ne, ~=) \ 20 | __(label, ::) __(number, ) __(name, ) __(string, ) \ 21 | __(eof, ) 22 | 23 | enum { 24 | TK_OFS = 256, 25 | #define TKENUM1(name) TK_##name, 26 | #define TKENUM2(name, sym) TK_##name, 27 | TKDEF(TKENUM1, TKENUM2) 28 | #undef TKENUM1 29 | #undef TKENUM2 30 | TK_RESERVED = TK_while - TK_OFS 31 | }; 32 | 33 | typedef int LexToken; 34 | 35 | /* Combined bytecode ins/line. Only used during bytecode generation. */ 36 | typedef struct BCInsLine { 37 | BCIns ins; /* Bytecode instruction. */ 38 | BCLine line; /* Line number for this bytecode. */ 39 | } BCInsLine; 40 | 41 | /* Info for local variables. Only used during bytecode generation. */ 42 | typedef struct VarInfo { 43 | GCRef name; /* Local variable name or goto/label name. */ 44 | BCPos startpc; /* First point where the local variable is active. */ 45 | BCPos endpc; /* First point where the local variable is dead. */ 46 | uint8_t slot; /* Variable slot. */ 47 | uint8_t info; /* Variable/goto/label info. */ 48 | } VarInfo; 49 | 50 | /* Lua lexer state. */ 51 | typedef struct LexState { 52 | struct FuncState *fs; /* Current FuncState. Defined in lj_parse.c. */ 53 | struct lua_State *L; /* Lua state. */ 54 | TValue tokenval; /* Current token value. */ 55 | TValue lookaheadval; /* Lookahead token value. */ 56 | int current; /* Current character (charint). */ 57 | LexToken token; /* Current token. */ 58 | LexToken lookahead; /* Lookahead token. */ 59 | MSize n; /* Bytes left in input buffer. */ 60 | const char *p; /* Current position in input buffer. */ 61 | SBuf sb; /* String buffer for tokens. */ 62 | lua_Reader rfunc; /* Reader callback. */ 63 | void *rdata; /* Reader callback data. */ 64 | BCLine linenumber; /* Input line counter. */ 65 | BCLine lastline; /* Line of last token. */ 66 | GCstr *chunkname; /* Current chunk name (interned string). */ 67 | const char *chunkarg; /* Chunk name argument. */ 68 | const char *mode; /* Allow loading bytecode (b) and/or source text (t). */ 69 | VarInfo *vstack; /* Stack for names and extents of local variables. */ 70 | MSize sizevstack; /* Size of variable stack. */ 71 | MSize vtop; /* Top of variable stack. */ 72 | BCInsLine *bcstack; /* Stack for bytecode instructions/line numbers. */ 73 | MSize sizebcstack; /* Size of bytecode stack. */ 74 | uint32_t level; /* Syntactical nesting level. */ 75 | } LexState; 76 | 77 | LJ_FUNC int lj_lex_setup(lua_State *L, LexState *ls); 78 | LJ_FUNC void lj_lex_cleanup(lua_State *L, LexState *ls); 79 | LJ_FUNC void lj_lex_next(LexState *ls); 80 | LJ_FUNC LexToken lj_lex_lookahead(LexState *ls); 81 | LJ_FUNC const char *lj_lex_token2str(LexState *ls, LexToken token); 82 | LJ_FUNC_NORET void lj_lex_error(LexState *ls, LexToken token, ErrMsg em, ...); 83 | LJ_FUNC void lj_lex_init(lua_State *L); 84 | 85 | #endif 86 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_lib.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Library function support. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_LIB_H 7 | #define _LJ_LIB_H 8 | 9 | #include "lj_obj.h" 10 | 11 | /* 12 | ** A fallback handler is called by the assembler VM if the fast path fails: 13 | ** 14 | ** - too few arguments: unrecoverable. 15 | ** - wrong argument type: recoverable, if coercion succeeds. 16 | ** - bad argument value: unrecoverable. 17 | ** - stack overflow: recoverable, if stack reallocation succeeds. 18 | ** - extra handling: recoverable. 19 | ** 20 | ** The unrecoverable cases throw an error with lj_err_arg(), lj_err_argtype(), 21 | ** lj_err_caller() or lj_err_callermsg(). 22 | ** The recoverable cases return 0 or the number of results + 1. 23 | ** The assembler VM retries the fast path only if 0 is returned. 24 | ** This time the fallback must not be called again or it gets stuck in a loop. 25 | */ 26 | 27 | /* Return values from fallback handler. */ 28 | #define FFH_RETRY 0 29 | #define FFH_UNREACHABLE FFH_RETRY 30 | #define FFH_RES(n) ((n)+1) 31 | #define FFH_TAILCALL (-1) 32 | 33 | LJ_FUNC TValue *lj_lib_checkany(lua_State *L, int narg); 34 | LJ_FUNC GCstr *lj_lib_checkstr(lua_State *L, int narg); 35 | LJ_FUNC GCstr *lj_lib_optstr(lua_State *L, int narg); 36 | #if LJ_DUALNUM 37 | LJ_FUNC void lj_lib_checknumber(lua_State *L, int narg); 38 | #else 39 | #define lj_lib_checknumber(L, narg) lj_lib_checknum((L), (narg)) 40 | #endif 41 | LJ_FUNC lua_Number lj_lib_checknum(lua_State *L, int narg); 42 | LJ_FUNC int32_t lj_lib_checkint(lua_State *L, int narg); 43 | LJ_FUNC int32_t lj_lib_optint(lua_State *L, int narg, int32_t def); 44 | LJ_FUNC int32_t lj_lib_checkbit(lua_State *L, int narg); 45 | LJ_FUNC GCfunc *lj_lib_checkfunc(lua_State *L, int narg); 46 | LJ_FUNC GCtab *lj_lib_checktab(lua_State *L, int narg); 47 | LJ_FUNC GCtab *lj_lib_checktabornil(lua_State *L, int narg); 48 | LJ_FUNC int lj_lib_checkopt(lua_State *L, int narg, int def, const char *lst); 49 | 50 | /* Avoid including lj_frame.h. */ 51 | #define lj_lib_upvalue(L, n) \ 52 | (&gcref((L->base-1)->fr.func)->fn.c.upvalue[(n)-1]) 53 | 54 | #if LJ_TARGET_WINDOWS 55 | #define lj_lib_checkfpu(L) \ 56 | do { setnumV(L->top++, (lua_Number)1437217655); \ 57 | if (lua_tointeger(L, -1) != 1437217655) lj_err_caller(L, LJ_ERR_BADFPU); \ 58 | L->top--; } while (0) 59 | #else 60 | #define lj_lib_checkfpu(L) UNUSED(L) 61 | #endif 62 | 63 | /* Push internal function on the stack. */ 64 | static LJ_AINLINE void lj_lib_pushcc(lua_State *L, lua_CFunction f, 65 | int id, int n) 66 | { 67 | GCfunc *fn; 68 | lua_pushcclosure(L, f, n); 69 | fn = funcV(L->top-1); 70 | fn->c.ffid = (uint8_t)id; 71 | setmref(fn->c.pc, &G(L)->bc_cfunc_int); 72 | } 73 | 74 | #define lj_lib_pushcf(L, fn, id) (lj_lib_pushcc(L, (fn), (id), 0)) 75 | 76 | /* Library function declarations. Scanned by buildvm. */ 77 | #define LJLIB_CF(name) static int lj_cf_##name(lua_State *L) 78 | #define LJLIB_ASM(name) static int lj_ffh_##name(lua_State *L) 79 | #define LJLIB_ASM_(name) 80 | #define LJLIB_SET(name) 81 | #define LJLIB_PUSH(arg) 82 | #define LJLIB_REC(handler) 83 | #define LJLIB_NOREGUV 84 | #define LJLIB_NOREG 85 | 86 | #define LJ_LIB_REG(L, regname, name) \ 87 | lj_lib_register(L, regname, lj_lib_init_##name, lj_lib_cf_##name) 88 | 89 | LJ_FUNC void lj_lib_register(lua_State *L, const char *libname, 90 | const uint8_t *init, const lua_CFunction *cf); 91 | 92 | /* Library init data tags. */ 93 | #define LIBINIT_LENMASK 0x3f 94 | #define LIBINIT_TAGMASK 0xc0 95 | #define LIBINIT_CF 0x00 96 | #define LIBINIT_ASM 0x40 97 | #define LIBINIT_ASM_ 0x80 98 | #define LIBINIT_STRING 0xc0 99 | #define LIBINIT_MAXSTR 0x39 100 | #define LIBINIT_SET 0xfa 101 | #define LIBINIT_NUMBER 0xfb 102 | #define LIBINIT_COPY 0xfc 103 | #define LIBINIT_LASTCL 0xfd 104 | #define LIBINIT_FFID 0xfe 105 | #define LIBINIT_END 0xff 106 | 107 | /* Exported library functions. */ 108 | 109 | typedef struct RandomState RandomState; 110 | LJ_FUNC uint64_t LJ_FASTCALL lj_math_random_step(RandomState *rs); 111 | 112 | #endif 113 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_load.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Load and dump code. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #include 7 | #include 8 | 9 | #define lj_load_c 10 | #define LUA_CORE 11 | 12 | #include "lua.h" 13 | #include "lauxlib.h" 14 | 15 | #include "lj_obj.h" 16 | #include "lj_gc.h" 17 | #include "lj_err.h" 18 | #include "lj_str.h" 19 | #include "lj_func.h" 20 | #include "lj_frame.h" 21 | #include "lj_vm.h" 22 | #include "lj_lex.h" 23 | #include "lj_bcdump.h" 24 | #include "lj_parse.h" 25 | 26 | /* -- Load Lua source code and bytecode ----------------------------------- */ 27 | 28 | static TValue *cpparser(lua_State *L, lua_CFunction dummy, void *ud) 29 | { 30 | LexState *ls = (LexState *)ud; 31 | GCproto *pt; 32 | GCfunc *fn; 33 | int bc; 34 | UNUSED(dummy); 35 | cframe_errfunc(L->cframe) = -1; /* Inherit error function. */ 36 | bc = lj_lex_setup(L, ls); 37 | if (ls->mode && !strchr(ls->mode, bc ? 'b' : 't')) { 38 | setstrV(L, L->top++, lj_err_str(L, LJ_ERR_XMODE)); 39 | lj_err_throw(L, LUA_ERRSYNTAX); 40 | } 41 | pt = bc ? lj_bcread(ls) : lj_parse(ls); 42 | fn = lj_func_newL_empty(L, pt, tabref(L->env)); 43 | /* Don't combine above/below into one statement. */ 44 | setfuncV(L, L->top++, fn); 45 | return NULL; 46 | } 47 | 48 | LUA_API int lua_loadx(lua_State *L, lua_Reader reader, void *data, 49 | const char *chunkname, const char *mode) 50 | { 51 | LexState ls; 52 | int status; 53 | ls.rfunc = reader; 54 | ls.rdata = data; 55 | ls.chunkarg = chunkname ? chunkname : "?"; 56 | ls.mode = mode; 57 | lj_str_initbuf(&ls.sb); 58 | status = lj_vm_cpcall(L, NULL, &ls, cpparser); 59 | lj_lex_cleanup(L, &ls); 60 | lj_gc_check(L); 61 | return status; 62 | } 63 | 64 | LUA_API int lua_load(lua_State *L, lua_Reader reader, void *data, 65 | const char *chunkname) 66 | { 67 | return lua_loadx(L, reader, data, chunkname, NULL); 68 | } 69 | 70 | typedef struct FileReaderCtx { 71 | FILE *fp; 72 | char buf[LUAL_BUFFERSIZE]; 73 | } FileReaderCtx; 74 | 75 | static const char *reader_file(lua_State *L, void *ud, size_t *size) 76 | { 77 | FileReaderCtx *ctx = (FileReaderCtx *)ud; 78 | UNUSED(L); 79 | if (feof(ctx->fp)) return NULL; 80 | *size = fread(ctx->buf, 1, sizeof(ctx->buf), ctx->fp); 81 | return *size > 0 ? ctx->buf : NULL; 82 | } 83 | 84 | LUALIB_API int luaL_loadfilex(lua_State *L, const char *filename, 85 | const char *mode) 86 | { 87 | FileReaderCtx ctx; 88 | int status; 89 | const char *chunkname; 90 | if (filename) { 91 | ctx.fp = fopen(filename, "rb"); 92 | if (ctx.fp == NULL) { 93 | lua_pushfstring(L, "cannot open %s: %s", filename, strerror(errno)); 94 | return LUA_ERRFILE; 95 | } 96 | chunkname = lua_pushfstring(L, "@%s", filename); 97 | } else { 98 | ctx.fp = stdin; 99 | chunkname = "=stdin"; 100 | } 101 | status = lua_loadx(L, reader_file, &ctx, chunkname, mode); 102 | if (ferror(ctx.fp)) { 103 | L->top -= filename ? 2 : 1; 104 | lua_pushfstring(L, "cannot read %s: %s", chunkname+1, strerror(errno)); 105 | if (filename) 106 | fclose(ctx.fp); 107 | return LUA_ERRFILE; 108 | } 109 | if (filename) { 110 | L->top--; 111 | copyTV(L, L->top-1, L->top); 112 | fclose(ctx.fp); 113 | } 114 | return status; 115 | } 116 | 117 | LUALIB_API int luaL_loadfile(lua_State *L, const char *filename) 118 | { 119 | return luaL_loadfilex(L, filename, NULL); 120 | } 121 | 122 | typedef struct StringReaderCtx { 123 | const char *str; 124 | size_t size; 125 | } StringReaderCtx; 126 | 127 | static const char *reader_string(lua_State *L, void *ud, size_t *size) 128 | { 129 | StringReaderCtx *ctx = (StringReaderCtx *)ud; 130 | UNUSED(L); 131 | if (ctx->size == 0) return NULL; 132 | *size = ctx->size; 133 | ctx->size = 0; 134 | return ctx->str; 135 | } 136 | 137 | LUALIB_API int luaL_loadbufferx(lua_State *L, const char *buf, size_t size, 138 | const char *name, const char *mode) 139 | { 140 | StringReaderCtx ctx; 141 | ctx.str = buf; 142 | ctx.size = size; 143 | return lua_loadx(L, reader_string, &ctx, name, mode); 144 | } 145 | 146 | LUALIB_API int luaL_loadbuffer(lua_State *L, const char *buf, size_t size, 147 | const char *name) 148 | { 149 | return luaL_loadbufferx(L, buf, size, name, NULL); 150 | } 151 | 152 | LUALIB_API int luaL_loadstring(lua_State *L, const char *s) 153 | { 154 | return luaL_loadbuffer(L, s, strlen(s), s); 155 | } 156 | 157 | /* -- Dump bytecode ------------------------------------------------------- */ 158 | 159 | LUA_API int lua_dump(lua_State *L, lua_Writer writer, void *data) 160 | { 161 | cTValue *o = L->top-1; 162 | api_check(L, L->top > L->base); 163 | if (tvisfunc(o) && isluafunc(funcV(o))) 164 | return lj_bcwrite(L, funcproto(funcV(o)), writer, data, 0); 165 | else 166 | return 1; 167 | } 168 | 169 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_mcode.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Machine code management. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_MCODE_H 7 | #define _LJ_MCODE_H 8 | 9 | #include "lj_obj.h" 10 | 11 | #if LJ_HASJIT || LJ_HASFFI 12 | LJ_FUNC void lj_mcode_sync(void *start, void *end); 13 | #endif 14 | 15 | #if LJ_HASJIT 16 | 17 | #include "lj_jit.h" 18 | 19 | LJ_FUNC void lj_mcode_free(jit_State *J); 20 | LJ_FUNC MCode *lj_mcode_reserve(jit_State *J, MCode **lim); 21 | LJ_FUNC void lj_mcode_commit(jit_State *J, MCode *m); 22 | LJ_FUNC void lj_mcode_abort(jit_State *J); 23 | LJ_FUNC MCode *lj_mcode_patch(jit_State *J, MCode *ptr, int finish); 24 | LJ_FUNC_NORET void lj_mcode_limiterr(jit_State *J, size_t need); 25 | 26 | #define lj_mcode_commitbot(J, m) (J->mcbot = (m)) 27 | 28 | #endif 29 | 30 | #endif 31 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_meta.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Metamethod handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_META_H 7 | #define _LJ_META_H 8 | 9 | #include "lj_obj.h" 10 | 11 | /* Metamethod handling */ 12 | LJ_FUNC void lj_meta_init(lua_State *L); 13 | LJ_FUNC cTValue *lj_meta_cache(GCtab *mt, MMS mm, GCstr *name); 14 | LJ_FUNC cTValue *lj_meta_lookup(lua_State *L, cTValue *o, MMS mm); 15 | #if LJ_HASFFI 16 | LJ_FUNC int lj_meta_tailcall(lua_State *L, cTValue *tv); 17 | #endif 18 | 19 | #define lj_meta_fastg(g, mt, mm) \ 20 | ((mt) == NULL ? NULL : ((mt)->nomm & (1u<<(mm))) ? NULL : \ 21 | lj_meta_cache(mt, mm, mmname_str(g, mm))) 22 | #define lj_meta_fast(L, mt, mm) lj_meta_fastg(G(L), mt, mm) 23 | 24 | /* C helpers for some instructions, called from assembler VM. */ 25 | LJ_FUNCA cTValue *lj_meta_tget(lua_State *L, cTValue *o, cTValue *k); 26 | LJ_FUNCA TValue *lj_meta_tset(lua_State *L, cTValue *o, cTValue *k); 27 | LJ_FUNCA TValue *lj_meta_arith(lua_State *L, TValue *ra, cTValue *rb, 28 | cTValue *rc, BCReg op); 29 | LJ_FUNCA TValue *lj_meta_cat(lua_State *L, TValue *top, int left); 30 | LJ_FUNCA TValue * LJ_FASTCALL lj_meta_len(lua_State *L, cTValue *o); 31 | LJ_FUNCA TValue *lj_meta_equal(lua_State *L, GCobj *o1, GCobj *o2, int ne); 32 | LJ_FUNCA TValue * LJ_FASTCALL lj_meta_equal_cd(lua_State *L, BCIns ins); 33 | LJ_FUNCA TValue *lj_meta_comp(lua_State *L, cTValue *o1, cTValue *o2, int op); 34 | LJ_FUNCA void lj_meta_call(lua_State *L, TValue *func, TValue *top); 35 | LJ_FUNCA void LJ_FASTCALL lj_meta_for(lua_State *L, TValue *o); 36 | 37 | #endif 38 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_obj.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Miscellaneous object handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #define lj_obj_c 7 | #define LUA_CORE 8 | 9 | #include "lj_obj.h" 10 | 11 | /* Object type names. */ 12 | LJ_DATADEF const char *const lj_obj_typename[] = { /* ORDER LUA_T */ 13 | "no value", "nil", "boolean", "userdata", "number", "string", 14 | "table", "function", "userdata", "thread", "proto", "cdata" 15 | }; 16 | 17 | LJ_DATADEF const char *const lj_obj_itypename[] = { /* ORDER LJ_T */ 18 | "nil", "boolean", "boolean", "userdata", "string", "upval", "thread", 19 | "proto", "function", "trace", "cdata", "table", "userdata", "number" 20 | }; 21 | 22 | /* Compare two objects without calling metamethods. */ 23 | int lj_obj_equal(cTValue *o1, cTValue *o2) 24 | { 25 | if (itype(o1) == itype(o2)) { 26 | if (tvispri(o1)) 27 | return 1; 28 | if (!tvisnum(o1)) 29 | return gcrefeq(o1->gcr, o2->gcr); 30 | } else if (!tvisnumber(o1) || !tvisnumber(o2)) { 31 | return 0; 32 | } 33 | return numberVnum(o1) == numberVnum(o2); 34 | } 35 | 36 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_opt_dce.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** DCE: Dead Code Elimination. Pre-LOOP only -- ASM already performs DCE. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #define lj_opt_dce_c 7 | #define LUA_CORE 8 | 9 | #include "lj_obj.h" 10 | 11 | #if LJ_HASJIT 12 | 13 | #include "lj_ir.h" 14 | #include "lj_jit.h" 15 | #include "lj_iropt.h" 16 | 17 | /* Some local macros to save typing. Undef'd at the end. */ 18 | #define IR(ref) (&J->cur.ir[(ref)]) 19 | 20 | /* Scan through all snapshots and mark all referenced instructions. */ 21 | static void dce_marksnap(jit_State *J) 22 | { 23 | SnapNo i, nsnap = J->cur.nsnap; 24 | for (i = 0; i < nsnap; i++) { 25 | SnapShot *snap = &J->cur.snap[i]; 26 | SnapEntry *map = &J->cur.snapmap[snap->mapofs]; 27 | MSize n, nent = snap->nent; 28 | for (n = 0; n < nent; n++) { 29 | IRRef ref = snap_ref(map[n]); 30 | if (ref >= REF_FIRST) 31 | irt_setmark(IR(ref)->t); 32 | } 33 | } 34 | } 35 | 36 | /* Backwards propagate marks. Replace unused instructions with NOPs. */ 37 | static void dce_propagate(jit_State *J) 38 | { 39 | IRRef1 *pchain[IR__MAX]; 40 | IRRef ins; 41 | uint32_t i; 42 | for (i = 0; i < IR__MAX; i++) pchain[i] = &J->chain[i]; 43 | for (ins = J->cur.nins-1; ins >= REF_FIRST; ins--) { 44 | IRIns *ir = IR(ins); 45 | if (irt_ismarked(ir->t)) { 46 | irt_clearmark(ir->t); 47 | pchain[ir->o] = &ir->prev; 48 | } else if (!ir_sideeff(ir)) { 49 | *pchain[ir->o] = ir->prev; /* Reroute original instruction chain. */ 50 | ir->t.irt = IRT_NIL; 51 | ir->o = IR_NOP; /* Replace instruction with NOP. */ 52 | ir->op1 = ir->op2 = 0; 53 | ir->prev = 0; 54 | continue; 55 | } 56 | if (ir->op1 >= REF_FIRST) irt_setmark(IR(ir->op1)->t); 57 | if (ir->op2 >= REF_FIRST) irt_setmark(IR(ir->op2)->t); 58 | } 59 | } 60 | 61 | /* Dead Code Elimination. 62 | ** 63 | ** First backpropagate marks for all used instructions. Then replace 64 | ** the unused ones with a NOP. Note that compressing the IR to eliminate 65 | ** the NOPs does not pay off. 66 | */ 67 | void lj_opt_dce(jit_State *J) 68 | { 69 | if ((J->flags & JIT_F_OPT_DCE)) { 70 | dce_marksnap(J); 71 | dce_propagate(J); 72 | } 73 | } 74 | 75 | #undef IR 76 | 77 | #endif 78 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_parse.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Lua parser (source code -> bytecode). 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_PARSE_H 7 | #define _LJ_PARSE_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_lex.h" 11 | 12 | LJ_FUNC GCproto *lj_parse(LexState *ls); 13 | LJ_FUNC GCstr *lj_parse_keepstr(LexState *ls, const char *str, size_t l); 14 | #if LJ_HASFFI 15 | LJ_FUNC void lj_parse_keepcdata(LexState *ls, TValue *tv, GCcdata *cd); 16 | #endif 17 | 18 | #endif 19 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_record.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Trace recorder (bytecode -> SSA IR). 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_RECORD_H 7 | #define _LJ_RECORD_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_jit.h" 11 | 12 | #if LJ_HASJIT 13 | /* Context for recording an indexed load/store. */ 14 | typedef struct RecordIndex { 15 | TValue tabv; /* Runtime value of table (or indexed object). */ 16 | TValue keyv; /* Runtime value of key. */ 17 | TValue valv; /* Runtime value of stored value. */ 18 | TValue mobjv; /* Runtime value of metamethod object. */ 19 | GCtab *mtv; /* Runtime value of metatable object. */ 20 | cTValue *oldv; /* Runtime value of previously stored value. */ 21 | TRef tab; /* Table (or indexed object) reference. */ 22 | TRef key; /* Key reference. */ 23 | TRef val; /* Value reference for a store or 0 for a load. */ 24 | TRef mt; /* Metatable reference. */ 25 | TRef mobj; /* Metamethod object reference. */ 26 | int idxchain; /* Index indirections left or 0 for raw lookup. */ 27 | } RecordIndex; 28 | 29 | LJ_FUNC int lj_record_objcmp(jit_State *J, TRef a, TRef b, 30 | cTValue *av, cTValue *bv); 31 | LJ_FUNC TRef lj_record_constify(jit_State *J, cTValue *o); 32 | 33 | LJ_FUNC void lj_record_call(jit_State *J, BCReg func, ptrdiff_t nargs); 34 | LJ_FUNC void lj_record_tailcall(jit_State *J, BCReg func, ptrdiff_t nargs); 35 | LJ_FUNC void lj_record_ret(jit_State *J, BCReg rbase, ptrdiff_t gotresults); 36 | 37 | LJ_FUNC int lj_record_mm_lookup(jit_State *J, RecordIndex *ix, MMS mm); 38 | LJ_FUNC TRef lj_record_idx(jit_State *J, RecordIndex *ix); 39 | 40 | LJ_FUNC void lj_record_ins(jit_State *J); 41 | LJ_FUNC void lj_record_setup(jit_State *J); 42 | #endif 43 | 44 | #endif 45 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_snap.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Snapshot handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_SNAP_H 7 | #define _LJ_SNAP_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_jit.h" 11 | 12 | #if LJ_HASJIT 13 | LJ_FUNC void lj_snap_add(jit_State *J); 14 | LJ_FUNC void lj_snap_purge(jit_State *J); 15 | LJ_FUNC void lj_snap_shrink(jit_State *J); 16 | LJ_FUNC IRIns *lj_snap_regspmap(GCtrace *T, SnapNo snapno, IRIns *ir); 17 | LJ_FUNC void lj_snap_replay(jit_State *J, GCtrace *T); 18 | LJ_FUNC const BCIns *lj_snap_restore(jit_State *J, void *exptr); 19 | LJ_FUNC void lj_snap_grow_buf_(jit_State *J, MSize need); 20 | LJ_FUNC void lj_snap_grow_map_(jit_State *J, MSize need); 21 | 22 | static LJ_AINLINE void lj_snap_grow_buf(jit_State *J, MSize need) 23 | { 24 | if (LJ_UNLIKELY(need > J->sizesnap)) lj_snap_grow_buf_(J, need); 25 | } 26 | 27 | static LJ_AINLINE void lj_snap_grow_map(jit_State *J, MSize need) 28 | { 29 | if (LJ_UNLIKELY(need > J->sizesnapmap)) lj_snap_grow_map_(J, need); 30 | } 31 | 32 | #endif 33 | 34 | #endif 35 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_state.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** State and stack handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_STATE_H 7 | #define _LJ_STATE_H 8 | 9 | #include "lj_obj.h" 10 | 11 | #define incr_top(L) \ 12 | (++L->top >= tvref(L->maxstack) && (lj_state_growstack1(L), 0)) 13 | 14 | #define savestack(L, p) ((char *)(p) - mref(L->stack, char)) 15 | #define restorestack(L, n) ((TValue *)(mref(L->stack, char) + (n))) 16 | 17 | LJ_FUNC void lj_state_relimitstack(lua_State *L); 18 | LJ_FUNC void lj_state_shrinkstack(lua_State *L, MSize used); 19 | LJ_FUNCA void LJ_FASTCALL lj_state_growstack(lua_State *L, MSize need); 20 | LJ_FUNC void LJ_FASTCALL lj_state_growstack1(lua_State *L); 21 | 22 | static LJ_AINLINE void lj_state_checkstack(lua_State *L, MSize need) 23 | { 24 | if ((mref(L->maxstack, char) - (char *)L->top) <= 25 | (ptrdiff_t)need*(ptrdiff_t)sizeof(TValue)) 26 | lj_state_growstack(L, need); 27 | } 28 | 29 | LJ_FUNC lua_State *lj_state_new(lua_State *L); 30 | LJ_FUNC void LJ_FASTCALL lj_state_free(global_State *g, lua_State *L); 31 | #if LJ_64 32 | LJ_FUNC lua_State *lj_state_newstate(lua_Alloc f, void *ud); 33 | #endif 34 | 35 | #endif 36 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_str.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** String handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_STR_H 7 | #define _LJ_STR_H 8 | 9 | #include 10 | 11 | #include "lj_obj.h" 12 | 13 | /* String interning. */ 14 | LJ_FUNC int32_t LJ_FASTCALL lj_str_cmp(GCstr *a, GCstr *b); 15 | LJ_FUNC void lj_str_resize(lua_State *L, MSize newmask); 16 | LJ_FUNCA GCstr *lj_str_new(lua_State *L, const char *str, size_t len); 17 | LJ_FUNC void LJ_FASTCALL lj_str_free(global_State *g, GCstr *s); 18 | 19 | #define lj_str_newz(L, s) (lj_str_new(L, s, strlen(s))) 20 | #define lj_str_newlit(L, s) (lj_str_new(L, "" s, sizeof(s)-1)) 21 | 22 | /* Type conversions. */ 23 | LJ_FUNC size_t LJ_FASTCALL lj_str_bufnum(char *s, cTValue *o); 24 | LJ_FUNC char * LJ_FASTCALL lj_str_bufint(char *p, int32_t k); 25 | LJ_FUNCA GCstr * LJ_FASTCALL lj_str_fromnum(lua_State *L, const lua_Number *np); 26 | LJ_FUNC GCstr * LJ_FASTCALL lj_str_fromint(lua_State *L, int32_t k); 27 | LJ_FUNCA GCstr * LJ_FASTCALL lj_str_fromnumber(lua_State *L, cTValue *o); 28 | 29 | #define LJ_STR_INTBUF (1+10) 30 | #define LJ_STR_NUMBUF LUAI_MAXNUMBER2STR 31 | 32 | /* String formatting. */ 33 | LJ_FUNC const char *lj_str_pushvf(lua_State *L, const char *fmt, va_list argp); 34 | LJ_FUNC const char *lj_str_pushf(lua_State *L, const char *fmt, ...) 35 | #if defined(__GNUC__) 36 | __attribute__ ((format (printf, 2, 3))) 37 | #endif 38 | ; 39 | 40 | /* Resizable string buffers. Struct definition in lj_obj.h. */ 41 | LJ_FUNC char *lj_str_needbuf(lua_State *L, SBuf *sb, MSize sz); 42 | 43 | #define lj_str_initbuf(sb) ((sb)->buf = NULL, (sb)->sz = 0) 44 | #define lj_str_resetbuf(sb) ((sb)->n = 0) 45 | #define lj_str_resizebuf(L, sb, size) \ 46 | ((sb)->buf = (char *)lj_mem_realloc(L, (sb)->buf, (sb)->sz, (size)), \ 47 | (sb)->sz = (size)) 48 | #define lj_str_freebuf(g, sb) lj_mem_free(g, (void *)(sb)->buf, (sb)->sz) 49 | 50 | #endif 51 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_strscan.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** String scanning. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_STRSCAN_H 7 | #define _LJ_STRSCAN_H 8 | 9 | #include "lj_obj.h" 10 | 11 | /* Options for accepted/returned formats. */ 12 | #define STRSCAN_OPT_TOINT 0x01 /* Convert to int32_t, if possible. */ 13 | #define STRSCAN_OPT_TONUM 0x02 /* Always convert to double. */ 14 | #define STRSCAN_OPT_IMAG 0x04 15 | #define STRSCAN_OPT_LL 0x08 16 | #define STRSCAN_OPT_C 0x10 17 | 18 | /* Returned format. */ 19 | typedef enum { 20 | STRSCAN_ERROR, 21 | STRSCAN_NUM, STRSCAN_IMAG, 22 | STRSCAN_INT, STRSCAN_U32, STRSCAN_I64, STRSCAN_U64, 23 | } StrScanFmt; 24 | 25 | LJ_FUNC StrScanFmt lj_strscan_scan(const uint8_t *p, TValue *o, uint32_t opt); 26 | LJ_FUNC int LJ_FASTCALL lj_strscan_num(GCstr *str, TValue *o); 27 | #if LJ_DUALNUM 28 | LJ_FUNC int LJ_FASTCALL lj_strscan_number(GCstr *str, TValue *o); 29 | #else 30 | #define lj_strscan_number(s, o) lj_strscan_num((s), (o)) 31 | #endif 32 | 33 | /* Check for number or convert string to number/int in-place (!). */ 34 | static LJ_AINLINE int lj_strscan_numberobj(TValue *o) 35 | { 36 | return tvisnumber(o) || (tvisstr(o) && lj_strscan_number(strV(o), o)); 37 | } 38 | 39 | #endif 40 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_tab.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Table handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_TAB_H 7 | #define _LJ_TAB_H 8 | 9 | #include "lj_obj.h" 10 | 11 | /* Hash constants. Tuned using a brute force search. */ 12 | #define HASH_BIAS (-0x04c11db7) 13 | #define HASH_ROT1 14 14 | #define HASH_ROT2 5 15 | #define HASH_ROT3 13 16 | 17 | /* Scramble the bits of numbers and pointers. */ 18 | static LJ_AINLINE uint32_t hashrot(uint32_t lo, uint32_t hi) 19 | { 20 | #if LJ_TARGET_X86ORX64 21 | /* Prefer variant that compiles well for a 2-operand CPU. */ 22 | lo ^= hi; hi = lj_rol(hi, HASH_ROT1); 23 | lo -= hi; hi = lj_rol(hi, HASH_ROT2); 24 | hi ^= lo; hi -= lj_rol(lo, HASH_ROT3); 25 | #else 26 | lo ^= hi; 27 | lo = lo - lj_rol(hi, HASH_ROT1); 28 | hi = lo ^ lj_rol(hi, HASH_ROT1 + HASH_ROT2); 29 | hi = hi - lj_rol(lo, HASH_ROT3); 30 | #endif 31 | return hi; 32 | } 33 | 34 | #define hsize2hbits(s) ((s) ? ((s)==1 ? 1 : 1+lj_fls((uint32_t)((s)-1))) : 0) 35 | 36 | LJ_FUNCA GCtab *lj_tab_new(lua_State *L, uint32_t asize, uint32_t hbits); 37 | #if LJ_HASJIT 38 | LJ_FUNC GCtab * LJ_FASTCALL lj_tab_new1(lua_State *L, uint32_t ahsize); 39 | #endif 40 | LJ_FUNCA GCtab * LJ_FASTCALL lj_tab_dup(lua_State *L, const GCtab *kt); 41 | LJ_FUNC void LJ_FASTCALL lj_tab_free(global_State *g, GCtab *t); 42 | #if LJ_HASFFI 43 | LJ_FUNC void lj_tab_rehash(lua_State *L, GCtab *t); 44 | #endif 45 | LJ_FUNCA void lj_tab_reasize(lua_State *L, GCtab *t, uint32_t nasize); 46 | 47 | /* Caveat: all getters except lj_tab_get() can return NULL! */ 48 | 49 | LJ_FUNCA cTValue * LJ_FASTCALL lj_tab_getinth(GCtab *t, int32_t key); 50 | LJ_FUNC cTValue *lj_tab_getstr(GCtab *t, GCstr *key); 51 | LJ_FUNCA cTValue *lj_tab_get(lua_State *L, GCtab *t, cTValue *key); 52 | 53 | /* Caveat: all setters require a write barrier for the stored value. */ 54 | 55 | LJ_FUNCA TValue *lj_tab_newkey(lua_State *L, GCtab *t, cTValue *key); 56 | LJ_FUNC TValue *lj_tab_setinth(lua_State *L, GCtab *t, int32_t key); 57 | LJ_FUNC TValue *lj_tab_setstr(lua_State *L, GCtab *t, GCstr *key); 58 | LJ_FUNC TValue *lj_tab_set(lua_State *L, GCtab *t, cTValue *key); 59 | 60 | #define inarray(t, key) ((MSize)(key) < (MSize)(t)->asize) 61 | #define arrayslot(t, i) (&tvref((t)->array)[(i)]) 62 | #define lj_tab_getint(t, key) \ 63 | (inarray((t), (key)) ? arrayslot((t), (key)) : lj_tab_getinth((t), (key))) 64 | #define lj_tab_setint(L, t, key) \ 65 | (inarray((t), (key)) ? arrayslot((t), (key)) : lj_tab_setinth(L, (t), (key))) 66 | 67 | LJ_FUNCA int lj_tab_next(lua_State *L, GCtab *t, TValue *key); 68 | LJ_FUNCA MSize LJ_FASTCALL lj_tab_len(GCtab *t); 69 | 70 | #endif 71 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_trace.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Trace management. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_TRACE_H 7 | #define _LJ_TRACE_H 8 | 9 | #include "lj_obj.h" 10 | 11 | #if LJ_HASJIT 12 | #include "lj_jit.h" 13 | #include "lj_dispatch.h" 14 | 15 | /* Trace errors. */ 16 | typedef enum { 17 | #define TREDEF(name, msg) LJ_TRERR_##name, 18 | #include "lj_traceerr.h" 19 | LJ_TRERR__MAX 20 | } TraceError; 21 | 22 | LJ_FUNC_NORET void lj_trace_err(jit_State *J, TraceError e); 23 | LJ_FUNC_NORET void lj_trace_err_info(jit_State *J, TraceError e); 24 | 25 | /* Trace management. */ 26 | LJ_FUNC void LJ_FASTCALL lj_trace_free(global_State *g, GCtrace *T); 27 | LJ_FUNC void lj_trace_reenableproto(GCproto *pt); 28 | LJ_FUNC void lj_trace_flushproto(global_State *g, GCproto *pt); 29 | LJ_FUNC void lj_trace_flush(jit_State *J, TraceNo traceno); 30 | LJ_FUNC int lj_trace_flushall(lua_State *L); 31 | LJ_FUNC void lj_trace_initstate(global_State *g); 32 | LJ_FUNC void lj_trace_freestate(global_State *g); 33 | 34 | /* Event handling. */ 35 | LJ_FUNC void lj_trace_ins(jit_State *J, const BCIns *pc); 36 | LJ_FUNCA void LJ_FASTCALL lj_trace_hot(jit_State *J, const BCIns *pc); 37 | LJ_FUNCA int LJ_FASTCALL lj_trace_exit(jit_State *J, void *exptr); 38 | 39 | /* Signal asynchronous abort of trace or end of trace. */ 40 | #define lj_trace_abort(g) (G2J(g)->state &= ~LJ_TRACE_ACTIVE) 41 | #define lj_trace_end(J) (J->state = LJ_TRACE_END) 42 | 43 | #else 44 | 45 | #define lj_trace_flushall(L) (UNUSED(L), 0) 46 | #define lj_trace_initstate(g) UNUSED(g) 47 | #define lj_trace_freestate(g) UNUSED(g) 48 | #define lj_trace_abort(g) UNUSED(g) 49 | #define lj_trace_end(J) UNUSED(J) 50 | 51 | #endif 52 | 53 | #endif 54 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_traceerr.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Trace compiler error messages. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | /* This file may be included multiple times with different TREDEF macros. */ 7 | 8 | /* Recording. */ 9 | TREDEF(RECERR, "error thrown or hook called during recording") 10 | TREDEF(TRACEOV, "trace too long") 11 | TREDEF(STACKOV, "trace too deep") 12 | TREDEF(SNAPOV, "too many snapshots") 13 | TREDEF(BLACKL, "blacklisted") 14 | TREDEF(NYIBC, "NYI: bytecode %d") 15 | 16 | /* Recording loop ops. */ 17 | TREDEF(LLEAVE, "leaving loop in root trace") 18 | TREDEF(LINNER, "inner loop in root trace") 19 | TREDEF(LUNROLL, "loop unroll limit reached") 20 | 21 | /* Recording calls/returns. */ 22 | TREDEF(BADTYPE, "bad argument type") 23 | TREDEF(CJITOFF, "JIT compilation disabled for function") 24 | TREDEF(CUNROLL, "call unroll limit reached") 25 | TREDEF(DOWNREC, "down-recursion, restarting") 26 | TREDEF(NYICF, "NYI: C function %p") 27 | TREDEF(NYIFF, "NYI: FastFunc %s") 28 | TREDEF(NYIFFU, "NYI: unsupported variant of FastFunc %s") 29 | TREDEF(NYIRETL, "NYI: return to lower frame") 30 | 31 | /* Recording indexed load/store. */ 32 | TREDEF(STORENN, "store with nil or NaN key") 33 | TREDEF(NOMM, "missing metamethod") 34 | TREDEF(IDXLOOP, "looping index lookup") 35 | TREDEF(NYITMIX, "NYI: mixed sparse/dense table") 36 | 37 | /* Recording C data operations. */ 38 | TREDEF(NOCACHE, "symbol not in cache") 39 | TREDEF(NYICONV, "NYI: unsupported C type conversion") 40 | TREDEF(NYICALL, "NYI: unsupported C function type") 41 | 42 | /* Optimizations. */ 43 | TREDEF(GFAIL, "guard would always fail") 44 | TREDEF(PHIOV, "too many PHIs") 45 | TREDEF(TYPEINS, "persistent type instability") 46 | 47 | /* Assembler. */ 48 | TREDEF(MCODEAL, "failed to allocate mcode memory") 49 | TREDEF(MCODEOV, "machine code too long") 50 | TREDEF(MCODELM, "hit mcode limit (retrying)") 51 | TREDEF(SPILLOV, "too many spill slots") 52 | TREDEF(BADRA, "inconsistent register allocation") 53 | TREDEF(NYIIR, "NYI: cannot assemble IR instruction %d") 54 | TREDEF(NYIPHI, "NYI: PHI shuffling too complex") 55 | TREDEF(NYICOAL, "NYI: register coalescing too complex") 56 | 57 | #undef TREDEF 58 | 59 | /* Detecting unused error messages: 60 | awk -F, '/^TREDEF/ { gsub(/TREDEF./, ""); printf "grep -q LJ_TRERR_%s *.[ch] || echo %s\n", $1, $1}' lj_traceerr.h | sh 61 | */ 62 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_udata.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Userdata handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #define lj_udata_c 7 | #define LUA_CORE 8 | 9 | #include "lj_obj.h" 10 | #include "lj_gc.h" 11 | #include "lj_udata.h" 12 | 13 | GCudata *lj_udata_new(lua_State *L, MSize sz, GCtab *env) 14 | { 15 | GCudata *ud = lj_mem_newt(L, sizeof(GCudata) + sz, GCudata); 16 | global_State *g = G(L); 17 | newwhite(g, ud); /* Not finalized. */ 18 | ud->gct = ~LJ_TUDATA; 19 | ud->udtype = UDTYPE_USERDATA; 20 | ud->len = sz; 21 | /* NOBARRIER: The GCudata is new (marked white). */ 22 | setgcrefnull(ud->metatable); 23 | setgcref(ud->env, obj2gco(env)); 24 | /* Chain to userdata list (after main thread). */ 25 | setgcrefr(ud->nextgc, mainthread(g)->nextgc); 26 | setgcref(mainthread(g)->nextgc, obj2gco(ud)); 27 | return ud; 28 | } 29 | 30 | void LJ_FASTCALL lj_udata_free(global_State *g, GCudata *ud) 31 | { 32 | lj_mem_free(g, ud, sizeudata(ud)); 33 | } 34 | 35 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_udata.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Userdata handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_UDATA_H 7 | #define _LJ_UDATA_H 8 | 9 | #include "lj_obj.h" 10 | 11 | LJ_FUNC GCudata *lj_udata_new(lua_State *L, MSize sz, GCtab *env); 12 | LJ_FUNC void LJ_FASTCALL lj_udata_free(global_State *g, GCudata *ud); 13 | 14 | #endif 15 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_vm.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Assembler VM interface definitions. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_VM_H 7 | #define _LJ_VM_H 8 | 9 | #include "lj_obj.h" 10 | 11 | /* Entry points for ASM parts of VM. */ 12 | LJ_ASMF void lj_vm_call(lua_State *L, TValue *base, int nres1); 13 | LJ_ASMF int lj_vm_pcall(lua_State *L, TValue *base, int nres1, ptrdiff_t ef); 14 | typedef TValue *(*lua_CPFunction)(lua_State *L, lua_CFunction func, void *ud); 15 | LJ_ASMF int lj_vm_cpcall(lua_State *L, lua_CFunction func, void *ud, 16 | lua_CPFunction cp); 17 | LJ_ASMF int lj_vm_resume(lua_State *L, TValue *base, int nres1, ptrdiff_t ef); 18 | LJ_ASMF_NORET void LJ_FASTCALL lj_vm_unwind_c(void *cframe, int errcode); 19 | LJ_ASMF_NORET void LJ_FASTCALL lj_vm_unwind_ff(void *cframe); 20 | LJ_ASMF void lj_vm_unwind_c_eh(void); 21 | LJ_ASMF void lj_vm_unwind_ff_eh(void); 22 | #if LJ_TARGET_X86ORX64 23 | LJ_ASMF void lj_vm_unwind_rethrow(void); 24 | #endif 25 | 26 | /* Miscellaneous functions. */ 27 | #if LJ_TARGET_X86ORX64 28 | LJ_ASMF int lj_vm_cpuid(uint32_t f, uint32_t res[4]); 29 | #endif 30 | #if LJ_TARGET_PPC 31 | void lj_vm_cachesync(void *start, void *end); 32 | #endif 33 | LJ_ASMF double lj_vm_foldarith(double x, double y, int op); 34 | #if LJ_HASJIT 35 | LJ_ASMF double lj_vm_foldfpm(double x, int op); 36 | #endif 37 | #if !LJ_ARCH_HASFPU 38 | /* Declared in lj_obj.h: LJ_ASMF int32_t lj_vm_tobit(double x); */ 39 | #endif 40 | 41 | /* Dispatch targets for recording and hooks. */ 42 | LJ_ASMF void lj_vm_record(void); 43 | LJ_ASMF void lj_vm_inshook(void); 44 | LJ_ASMF void lj_vm_rethook(void); 45 | LJ_ASMF void lj_vm_callhook(void); 46 | 47 | /* Trace exit handling. */ 48 | LJ_ASMF void lj_vm_exit_handler(void); 49 | LJ_ASMF void lj_vm_exit_interp(void); 50 | 51 | /* Internal math helper functions. */ 52 | #if LJ_TARGET_X86ORX64 || LJ_TARGET_PPC 53 | #define lj_vm_floor floor 54 | #define lj_vm_ceil ceil 55 | #else 56 | LJ_ASMF double lj_vm_floor(double); 57 | LJ_ASMF double lj_vm_ceil(double); 58 | #if LJ_TARGET_ARM 59 | LJ_ASMF double lj_vm_floor_sf(double); 60 | LJ_ASMF double lj_vm_ceil_sf(double); 61 | #endif 62 | #endif 63 | #if defined(LUAJIT_NO_LOG2) || LJ_TARGET_X86ORX64 64 | LJ_ASMF double lj_vm_log2(double); 65 | #else 66 | #define lj_vm_log2 log2 67 | #endif 68 | 69 | #if LJ_HASJIT 70 | #if LJ_TARGET_X86ORX64 71 | LJ_ASMF void lj_vm_floor_sse(void); 72 | LJ_ASMF void lj_vm_ceil_sse(void); 73 | LJ_ASMF void lj_vm_trunc_sse(void); 74 | LJ_ASMF void lj_vm_exp_x87(void); 75 | LJ_ASMF void lj_vm_exp2_x87(void); 76 | LJ_ASMF void lj_vm_pow_sse(void); 77 | LJ_ASMF void lj_vm_powi_sse(void); 78 | #else 79 | #if LJ_TARGET_PPC 80 | #define lj_vm_trunc trunc 81 | #else 82 | LJ_ASMF double lj_vm_trunc(double); 83 | #if LJ_TARGET_ARM 84 | LJ_ASMF double lj_vm_trunc_sf(double); 85 | #endif 86 | #endif 87 | LJ_ASMF double lj_vm_powi(double, int32_t); 88 | #ifdef LUAJIT_NO_EXP2 89 | LJ_ASMF double lj_vm_exp2(double); 90 | #else 91 | #define lj_vm_exp2 exp2 92 | #endif 93 | #endif 94 | LJ_ASMF int32_t LJ_FASTCALL lj_vm_modi(int32_t, int32_t); 95 | #if LJ_HASFFI 96 | LJ_ASMF int lj_vm_errno(void); 97 | #endif 98 | #endif 99 | 100 | /* Continuations for metamethods. */ 101 | LJ_ASMF void lj_cont_cat(void); /* Continue with concatenation. */ 102 | LJ_ASMF void lj_cont_ra(void); /* Store result in RA from instruction. */ 103 | LJ_ASMF void lj_cont_nop(void); /* Do nothing, just continue execution. */ 104 | LJ_ASMF void lj_cont_condt(void); /* Branch if result is true. */ 105 | LJ_ASMF void lj_cont_condf(void); /* Branch if result is false. */ 106 | LJ_ASMF void lj_cont_hook(void); /* Continue from hook yield. */ 107 | 108 | enum { LJ_CONT_TAILCALL, LJ_CONT_FFI_CALLBACK }; /* Special continuations. */ 109 | 110 | /* Start of the ASM code. */ 111 | LJ_ASMF char lj_vm_asm_begin[]; 112 | 113 | /* Bytecode offsets are relative to lj_vm_asm_begin. */ 114 | #define makeasmfunc(ofs) ((ASMFunction)(lj_vm_asm_begin + (ofs))) 115 | 116 | #endif 117 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_vmevent.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** VM event handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #include 7 | 8 | #define lj_vmevent_c 9 | #define LUA_CORE 10 | 11 | #include "lj_obj.h" 12 | #include "lj_str.h" 13 | #include "lj_tab.h" 14 | #include "lj_state.h" 15 | #include "lj_dispatch.h" 16 | #include "lj_vm.h" 17 | #include "lj_vmevent.h" 18 | 19 | ptrdiff_t lj_vmevent_prepare(lua_State *L, VMEvent ev) 20 | { 21 | global_State *g = G(L); 22 | GCstr *s = lj_str_newlit(L, LJ_VMEVENTS_REGKEY); 23 | cTValue *tv = lj_tab_getstr(tabV(registry(L)), s); 24 | if (tvistab(tv)) { 25 | int hash = VMEVENT_HASH(ev); 26 | tv = lj_tab_getint(tabV(tv), hash); 27 | if (tv && tvisfunc(tv)) { 28 | lj_state_checkstack(L, LUA_MINSTACK); 29 | setfuncV(L, L->top++, funcV(tv)); 30 | return savestack(L, L->top); 31 | } 32 | } 33 | g->vmevmask &= ~VMEVENT_MASK(ev); /* No handler: cache this fact. */ 34 | return 0; 35 | } 36 | 37 | void lj_vmevent_call(lua_State *L, ptrdiff_t argbase) 38 | { 39 | global_State *g = G(L); 40 | uint8_t oldmask = g->vmevmask; 41 | uint8_t oldh = hook_save(g); 42 | int status; 43 | g->vmevmask = 0; /* Disable all events. */ 44 | hook_vmevent(g); 45 | status = lj_vm_pcall(L, restorestack(L, argbase), 0+1, 0); 46 | if (LJ_UNLIKELY(status)) { 47 | /* Really shouldn't use stderr here, but where else to complain? */ 48 | L->top--; 49 | fputs("VM handler failed: ", stderr); 50 | fputs(tvisstr(L->top) ? strVdata(L->top) : "?", stderr); 51 | fputc('\n', stderr); 52 | } 53 | hook_restore(g, oldh); 54 | if (g->vmevmask != VMEVENT_NOCACHE) 55 | g->vmevmask = oldmask; /* Restore event mask, but not if not modified. */ 56 | } 57 | 58 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_vmevent.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** VM event handling. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_VMEVENT_H 7 | #define _LJ_VMEVENT_H 8 | 9 | #include "lj_obj.h" 10 | 11 | /* Registry key for VM event handler table. */ 12 | #define LJ_VMEVENTS_REGKEY "_VMEVENTS" 13 | #define LJ_VMEVENTS_HSIZE 4 14 | 15 | #define VMEVENT_MASK(ev) ((uint8_t)1 << ((int)(ev) & 7)) 16 | #define VMEVENT_HASH(ev) ((int)(ev) & ~7) 17 | #define VMEVENT_HASHIDX(h) ((int)(h) << 3) 18 | #define VMEVENT_NOCACHE 255 19 | 20 | #define VMEVENT_DEF(name, hash) \ 21 | LJ_VMEVENT_##name##_, \ 22 | LJ_VMEVENT_##name = ((LJ_VMEVENT_##name##_) & 7)|((hash) << 3) 23 | 24 | /* VM event IDs. */ 25 | typedef enum { 26 | VMEVENT_DEF(BC, 0x00003883), 27 | VMEVENT_DEF(TRACE, 0xb2d91467), 28 | VMEVENT_DEF(RECORD, 0x9284bf4f), 29 | VMEVENT_DEF(TEXIT, 0xb29df2b0), 30 | LJ_VMEVENT__MAX 31 | } VMEvent; 32 | 33 | #ifdef LUAJIT_DISABLE_VMEVENT 34 | #define lj_vmevent_send(L, ev, args) UNUSED(L) 35 | #define lj_vmevent_send_(L, ev, args, post) UNUSED(L) 36 | #else 37 | #define lj_vmevent_send(L, ev, args) \ 38 | if (G(L)->vmevmask & VMEVENT_MASK(LJ_VMEVENT_##ev)) { \ 39 | ptrdiff_t argbase = lj_vmevent_prepare(L, LJ_VMEVENT_##ev); \ 40 | if (argbase) { \ 41 | args \ 42 | lj_vmevent_call(L, argbase); \ 43 | } \ 44 | } 45 | #define lj_vmevent_send_(L, ev, args, post) \ 46 | if (G(L)->vmevmask & VMEVENT_MASK(LJ_VMEVENT_##ev)) { \ 47 | ptrdiff_t argbase = lj_vmevent_prepare(L, LJ_VMEVENT_##ev); \ 48 | if (argbase) { \ 49 | args \ 50 | lj_vmevent_call(L, argbase); \ 51 | post \ 52 | } \ 53 | } 54 | 55 | LJ_FUNC ptrdiff_t lj_vmevent_prepare(lua_State *L, VMEvent ev); 56 | LJ_FUNC void lj_vmevent_call(lua_State *L, ptrdiff_t argbase); 57 | #endif 58 | 59 | #endif 60 | -------------------------------------------------------------------------------- /deps/luajit/src/lj_vmmath.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Math helper functions for assembler VM. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #define lj_vmmath_c 7 | #define LUA_CORE 8 | 9 | #include 10 | #include 11 | 12 | #include "lj_obj.h" 13 | #include "lj_ir.h" 14 | #include "lj_vm.h" 15 | 16 | /* -- Helper functions for generated machine code ------------------------- */ 17 | 18 | #if LJ_TARGET_X86ORX64 19 | /* Wrapper functions to avoid linker issues on OSX. */ 20 | LJ_FUNCA double lj_vm_sinh(double x) { return sinh(x); } 21 | LJ_FUNCA double lj_vm_cosh(double x) { return cosh(x); } 22 | LJ_FUNCA double lj_vm_tanh(double x) { return tanh(x); } 23 | #endif 24 | 25 | #if !LJ_TARGET_X86ORX64 26 | double lj_vm_foldarith(double x, double y, int op) 27 | { 28 | switch (op) { 29 | case IR_ADD - IR_ADD: return x+y; break; 30 | case IR_SUB - IR_ADD: return x-y; break; 31 | case IR_MUL - IR_ADD: return x*y; break; 32 | case IR_DIV - IR_ADD: return x/y; break; 33 | case IR_MOD - IR_ADD: return x-lj_vm_floor(x/y)*y; break; 34 | case IR_POW - IR_ADD: return pow(x, y); break; 35 | case IR_NEG - IR_ADD: return -x; break; 36 | case IR_ABS - IR_ADD: return fabs(x); break; 37 | #if LJ_HASJIT 38 | case IR_ATAN2 - IR_ADD: return atan2(x, y); break; 39 | case IR_LDEXP - IR_ADD: return ldexp(x, (int)y); break; 40 | case IR_MIN - IR_ADD: return x > y ? y : x; break; 41 | case IR_MAX - IR_ADD: return x < y ? y : x; break; 42 | #endif 43 | default: return x; 44 | } 45 | } 46 | #endif 47 | 48 | #if LJ_HASJIT 49 | 50 | #ifdef LUAJIT_NO_LOG2 51 | double lj_vm_log2(double a) 52 | { 53 | return log(a) * 1.4426950408889634074; 54 | } 55 | #endif 56 | 57 | #ifdef LUAJIT_NO_EXP2 58 | double lj_vm_exp2(double a) 59 | { 60 | return exp(a * 0.6931471805599453); 61 | } 62 | #endif 63 | 64 | #if !(LJ_TARGET_ARM || LJ_TARGET_PPC) 65 | int32_t LJ_FASTCALL lj_vm_modi(int32_t a, int32_t b) 66 | { 67 | uint32_t y, ua, ub; 68 | lua_assert(b != 0); /* This must be checked before using this function. */ 69 | ua = a < 0 ? (uint32_t)-a : (uint32_t)a; 70 | ub = b < 0 ? (uint32_t)-b : (uint32_t)b; 71 | y = ua % ub; 72 | if (y != 0 && (a^b) < 0) y = y - ub; 73 | if (((int32_t)y^b) < 0) y = (uint32_t)-(int32_t)y; 74 | return (int32_t)y; 75 | } 76 | #endif 77 | 78 | #if !LJ_TARGET_X86ORX64 79 | /* Unsigned x^k. */ 80 | static double lj_vm_powui(double x, uint32_t k) 81 | { 82 | double y; 83 | lua_assert(k != 0); 84 | for (; (k & 1) == 0; k >>= 1) x *= x; 85 | y = x; 86 | if ((k >>= 1) != 0) { 87 | for (;;) { 88 | x *= x; 89 | if (k == 1) break; 90 | if (k & 1) y *= x; 91 | k >>= 1; 92 | } 93 | y *= x; 94 | } 95 | return y; 96 | } 97 | 98 | /* Signed x^k. */ 99 | double lj_vm_powi(double x, int32_t k) 100 | { 101 | if (k > 1) 102 | return lj_vm_powui(x, (uint32_t)k); 103 | else if (k == 1) 104 | return x; 105 | else if (k == 0) 106 | return 1.0; 107 | else 108 | return 1.0 / lj_vm_powui(x, (uint32_t)-k); 109 | } 110 | 111 | /* Computes fpm(x) for extended math functions. */ 112 | double lj_vm_foldfpm(double x, int fpm) 113 | { 114 | switch (fpm) { 115 | case IRFPM_FLOOR: return lj_vm_floor(x); 116 | case IRFPM_CEIL: return lj_vm_ceil(x); 117 | case IRFPM_TRUNC: return lj_vm_trunc(x); 118 | case IRFPM_SQRT: return sqrt(x); 119 | case IRFPM_EXP: return exp(x); 120 | case IRFPM_EXP2: return lj_vm_exp2(x); 121 | case IRFPM_LOG: return log(x); 122 | case IRFPM_LOG2: return lj_vm_log2(x); 123 | case IRFPM_LOG10: return log10(x); 124 | case IRFPM_SIN: return sin(x); 125 | case IRFPM_COS: return cos(x); 126 | case IRFPM_TAN: return tan(x); 127 | default: lua_assert(0); 128 | } 129 | return 0; 130 | } 131 | #endif 132 | 133 | #if LJ_HASFFI 134 | int lj_vm_errno(void) 135 | { 136 | return errno; 137 | } 138 | #endif 139 | 140 | #endif 141 | -------------------------------------------------------------------------------- /deps/luajit/src/ljamalg.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** LuaJIT core and libraries amalgamation. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | /* 7 | +--------------------------------------------------------------------------+ 8 | | WARNING: Compiling the amalgamation needs a lot of virtual memory | 9 | | (around 300 MB with GCC 4.x)! If you don't have enough physical memory | 10 | | your machine will start swapping to disk and the compile will not finish | 11 | | within a reasonable amount of time. | 12 | | So either compile on a bigger machine or use the non-amalgamated build. | 13 | +--------------------------------------------------------------------------+ 14 | */ 15 | 16 | #define ljamalg_c 17 | #define LUA_CORE 18 | 19 | /* To get the mremap prototype. Must be defined before any system includes. */ 20 | #if defined(__linux__) && !defined(_GNU_SOURCE) 21 | #define _GNU_SOURCE 22 | #endif 23 | 24 | #ifndef WINVER 25 | #define WINVER 0x0501 26 | #endif 27 | 28 | #include "lua.h" 29 | #include "lauxlib.h" 30 | 31 | #include "lj_gc.c" 32 | #include "lj_err.c" 33 | #include "lj_char.c" 34 | #include "lj_bc.c" 35 | #include "lj_obj.c" 36 | #include "lj_str.c" 37 | #include "lj_tab.c" 38 | #include "lj_func.c" 39 | #include "lj_udata.c" 40 | #include "lj_meta.c" 41 | #include "lj_debug.c" 42 | #include "lj_state.c" 43 | #include "lj_dispatch.c" 44 | #include "lj_vmevent.c" 45 | #include "lj_vmmath.c" 46 | #include "lj_strscan.c" 47 | #include "lj_api.c" 48 | #include "lj_lex.c" 49 | #include "lj_parse.c" 50 | #include "lj_bcread.c" 51 | #include "lj_bcwrite.c" 52 | #include "lj_load.c" 53 | #include "lj_ctype.c" 54 | #include "lj_cdata.c" 55 | #include "lj_cconv.c" 56 | #include "lj_ccall.c" 57 | #include "lj_ccallback.c" 58 | #include "lj_carith.c" 59 | #include "lj_clib.c" 60 | #include "lj_cparse.c" 61 | #include "lj_lib.c" 62 | #include "lj_ir.c" 63 | #include "lj_opt_mem.c" 64 | #include "lj_opt_fold.c" 65 | #include "lj_opt_narrow.c" 66 | #include "lj_opt_dce.c" 67 | #include "lj_opt_loop.c" 68 | #include "lj_opt_split.c" 69 | #include "lj_opt_sink.c" 70 | #include "lj_mcode.c" 71 | #include "lj_snap.c" 72 | #include "lj_record.c" 73 | #include "lj_crecord.c" 74 | #include "lj_ffrecord.c" 75 | #include "lj_asm.c" 76 | #include "lj_trace.c" 77 | #include "lj_gdbjit.c" 78 | #include "lj_alloc.c" 79 | 80 | #include "lib_aux.c" 81 | #include "lib_base.c" 82 | #include "lib_math.c" 83 | #include "lib_string.c" 84 | #include "lib_table.c" 85 | #include "lib_io.c" 86 | #include "lib_os.c" 87 | #include "lib_package.c" 88 | #include "lib_debug.c" 89 | #include "lib_bit.c" 90 | #include "lib_jit.c" 91 | #include "lib_ffi.c" 92 | #include "lib_init.c" 93 | 94 | -------------------------------------------------------------------------------- /deps/luajit/src/lua.hpp: -------------------------------------------------------------------------------- 1 | // C++ wrapper for LuaJIT header files. 2 | 3 | extern "C" { 4 | #include "lua.h" 5 | #include "lauxlib.h" 6 | #include "lualib.h" 7 | #include "luajit.h" 8 | } 9 | 10 | -------------------------------------------------------------------------------- /deps/luajit/src/luaconf.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Configuration header. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef luaconf_h 7 | #define luaconf_h 8 | 9 | #ifndef WINVER 10 | #define WINVER 0x0501 11 | #endif 12 | #include 13 | #include 14 | 15 | /* Default path for loading Lua and C modules with require(). */ 16 | #if defined(_WIN32) 17 | /* 18 | ** In Windows, any exclamation mark ('!') in the path is replaced by the 19 | ** path of the directory of the executable file of the current process. 20 | */ 21 | #define LUA_LDIR "!\\lua\\" 22 | #define LUA_CDIR "!\\" 23 | #define LUA_PATH_DEFAULT \ 24 | ".\\?.lua;" LUA_LDIR"?.lua;" LUA_LDIR"?\\init.lua;" 25 | #define LUA_CPATH_DEFAULT \ 26 | ".\\?.dll;" LUA_CDIR"?.dll;" LUA_CDIR"loadall.dll" 27 | #else 28 | /* 29 | ** Note to distribution maintainers: do NOT patch the following lines! 30 | ** Please read ../doc/install.html#distro and pass PREFIX=/usr instead. 31 | */ 32 | #ifndef LUA_MULTILIB 33 | #define LUA_MULTILIB "lib" 34 | #endif 35 | #ifndef LUA_LMULTILIB 36 | #define LUA_LMULTILIB "lib" 37 | #endif 38 | #define LUA_LROOT "/usr/local" 39 | #define LUA_LUADIR "/lua/5.1/" 40 | #define LUA_LJDIR "/luajit-2.0.3/" 41 | 42 | #ifdef LUA_ROOT 43 | #define LUA_JROOT LUA_ROOT 44 | #define LUA_RLDIR LUA_ROOT "/share" LUA_LUADIR 45 | #define LUA_RCDIR LUA_ROOT "/" LUA_MULTILIB LUA_LUADIR 46 | #define LUA_RLPATH ";" LUA_RLDIR "?.lua;" LUA_RLDIR "?/init.lua" 47 | #define LUA_RCPATH ";" LUA_RCDIR "?.so" 48 | #else 49 | #define LUA_JROOT LUA_LROOT 50 | #define LUA_RLPATH 51 | #define LUA_RCPATH 52 | #endif 53 | 54 | #define LUA_JPATH ";" LUA_JROOT "/share" LUA_LJDIR "?.lua" 55 | #define LUA_LLDIR LUA_LROOT "/share" LUA_LUADIR 56 | #define LUA_LCDIR LUA_LROOT "/" LUA_LMULTILIB LUA_LUADIR 57 | #define LUA_LLPATH ";" LUA_LLDIR "?.lua;" LUA_LLDIR "?/init.lua" 58 | #define LUA_LCPATH1 ";" LUA_LCDIR "?.so" 59 | #define LUA_LCPATH2 ";" LUA_LCDIR "loadall.so" 60 | 61 | #define LUA_PATH_DEFAULT "./?.lua" LUA_JPATH LUA_LLPATH LUA_RLPATH 62 | #define LUA_CPATH_DEFAULT "./?.so" LUA_LCPATH1 LUA_RCPATH LUA_LCPATH2 63 | #endif 64 | 65 | /* Environment variable names for path overrides and initialization code. */ 66 | #define LUA_PATH "LUA_PATH" 67 | #define LUA_CPATH "LUA_CPATH" 68 | #define LUA_INIT "LUA_INIT" 69 | 70 | /* Special file system characters. */ 71 | #if defined(_WIN32) 72 | #define LUA_DIRSEP "\\" 73 | #else 74 | #define LUA_DIRSEP "/" 75 | #endif 76 | #define LUA_PATHSEP ";" 77 | #define LUA_PATH_MARK "?" 78 | #define LUA_EXECDIR "!" 79 | #define LUA_IGMARK "-" 80 | #define LUA_PATH_CONFIG \ 81 | LUA_DIRSEP "\n" LUA_PATHSEP "\n" LUA_PATH_MARK "\n" \ 82 | LUA_EXECDIR "\n" LUA_IGMARK 83 | 84 | /* Quoting in error messages. */ 85 | #define LUA_QL(x) "'" x "'" 86 | #define LUA_QS LUA_QL("%s") 87 | 88 | /* Various tunables. */ 89 | #define LUAI_MAXSTACK 65500 /* Max. # of stack slots for a thread (<64K). */ 90 | #define LUAI_MAXCSTACK 8000 /* Max. # of stack slots for a C func (<10K). */ 91 | #define LUAI_GCPAUSE 200 /* Pause GC until memory is at 200%. */ 92 | #define LUAI_GCMUL 200 /* Run GC at 200% of allocation speed. */ 93 | #define LUA_MAXCAPTURES 32 /* Max. pattern captures. */ 94 | 95 | /* Compatibility with older library function names. */ 96 | #define LUA_COMPAT_MOD /* OLD: math.mod, NEW: math.fmod */ 97 | #define LUA_COMPAT_GFIND /* OLD: string.gfind, NEW: string.gmatch */ 98 | 99 | /* Configuration for the frontend (the luajit executable). */ 100 | #if defined(luajit_c) 101 | #define LUA_PROGNAME "luajit" /* Fallback frontend name. */ 102 | #define LUA_PROMPT "> " /* Interactive prompt. */ 103 | #define LUA_PROMPT2 ">> " /* Continuation prompt. */ 104 | #define LUA_MAXINPUT 512 /* Max. input line length. */ 105 | #endif 106 | 107 | /* Note: changing the following defines breaks the Lua 5.1 ABI. */ 108 | #define LUA_INTEGER ptrdiff_t 109 | #define LUA_IDSIZE 60 /* Size of lua_Debug.short_src. */ 110 | /* 111 | ** Size of lauxlib and io.* on-stack buffers. Weird workaround to avoid using 112 | ** unreasonable amounts of stack space, but still retain ABI compatibility. 113 | ** Blame Lua for depending on BUFSIZ in the ABI, blame **** for wrecking it. 114 | */ 115 | #define LUAL_BUFFERSIZE (BUFSIZ > 16384 ? 8192 : BUFSIZ) 116 | 117 | /* The following defines are here only for compatibility with luaconf.h 118 | ** from the standard Lua distribution. They must not be changed for LuaJIT. 119 | */ 120 | #define LUA_NUMBER_DOUBLE 121 | #define LUA_NUMBER double 122 | #define LUAI_UACNUMBER double 123 | #define LUA_NUMBER_SCAN "%lf" 124 | #define LUA_NUMBER_FMT "%.14g" 125 | #define lua_number2str(s, n) sprintf((s), LUA_NUMBER_FMT, (n)) 126 | #define LUAI_MAXNUMBER2STR 32 127 | #define LUA_INTFRMLEN "l" 128 | #define LUA_INTFRM_T long 129 | 130 | /* Linkage of public API functions. */ 131 | #if defined(LUA_BUILD_AS_DLL) 132 | #if defined(LUA_CORE) || defined(LUA_LIB) 133 | #define LUA_API __declspec(dllexport) 134 | #else 135 | #define LUA_API __declspec(dllimport) 136 | #endif 137 | #else 138 | #define LUA_API extern 139 | #endif 140 | 141 | #define LUALIB_API LUA_API 142 | 143 | /* Support for internal assertions. */ 144 | #if defined(LUA_USE_ASSERT) || defined(LUA_USE_APICHECK) 145 | #include 146 | #endif 147 | #ifdef LUA_USE_ASSERT 148 | #define lua_assert(x) assert(x) 149 | #endif 150 | #ifdef LUA_USE_APICHECK 151 | #define luai_apicheck(L, o) { (void)L; assert(o); } 152 | #else 153 | #define luai_apicheck(L, o) { (void)L; } 154 | #endif 155 | 156 | #endif 157 | -------------------------------------------------------------------------------- /deps/luajit/src/luajit.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** LuaJIT -- a Just-In-Time Compiler for Lua. http://luajit.org/ 3 | ** 4 | ** Copyright (C) 2005-2014 Mike Pall. All rights reserved. 5 | ** 6 | ** Permission is hereby granted, free of charge, to any person obtaining 7 | ** a copy of this software and associated documentation files (the 8 | ** "Software"), to deal in the Software without restriction, including 9 | ** without limitation the rights to use, copy, modify, merge, publish, 10 | ** distribute, sublicense, and/or sell copies of the Software, and to 11 | ** permit persons to whom the Software is furnished to do so, subject to 12 | ** the following conditions: 13 | ** 14 | ** The above copyright notice and this permission notice shall be 15 | ** included in all copies or substantial portions of the Software. 16 | ** 17 | ** THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 18 | ** EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 19 | ** MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 20 | ** IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY 21 | ** CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, 22 | ** TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE 23 | ** SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 24 | ** 25 | ** [ MIT license: http://www.opensource.org/licenses/mit-license.php ] 26 | */ 27 | 28 | #ifndef _LUAJIT_H 29 | #define _LUAJIT_H 30 | 31 | #include "lua.h" 32 | 33 | #define LUAJIT_VERSION "LuaJIT 2.0.3" 34 | #define LUAJIT_VERSION_NUM 20003 /* Version 2.0.3 = 02.00.03. */ 35 | #define LUAJIT_VERSION_SYM luaJIT_version_2_0_3 36 | #define LUAJIT_COPYRIGHT "Copyright (C) 2005-2014 Mike Pall" 37 | #define LUAJIT_URL "http://luajit.org/" 38 | 39 | /* Modes for luaJIT_setmode. */ 40 | #define LUAJIT_MODE_MASK 0x00ff 41 | 42 | enum { 43 | LUAJIT_MODE_ENGINE, /* Set mode for whole JIT engine. */ 44 | LUAJIT_MODE_DEBUG, /* Set debug mode (idx = level). */ 45 | 46 | LUAJIT_MODE_FUNC, /* Change mode for a function. */ 47 | LUAJIT_MODE_ALLFUNC, /* Recurse into subroutine protos. */ 48 | LUAJIT_MODE_ALLSUBFUNC, /* Change only the subroutines. */ 49 | 50 | LUAJIT_MODE_TRACE, /* Flush a compiled trace. */ 51 | 52 | LUAJIT_MODE_WRAPCFUNC = 0x10, /* Set wrapper mode for C function calls. */ 53 | 54 | LUAJIT_MODE_MAX 55 | }; 56 | 57 | /* Flags or'ed in to the mode. */ 58 | #define LUAJIT_MODE_OFF 0x0000 /* Turn feature off. */ 59 | #define LUAJIT_MODE_ON 0x0100 /* Turn feature on. */ 60 | #define LUAJIT_MODE_FLUSH 0x0200 /* Flush JIT-compiled code. */ 61 | 62 | /* LuaJIT public C API. */ 63 | 64 | /* Control the JIT engine. */ 65 | LUA_API int luaJIT_setmode(lua_State *L, int idx, int mode); 66 | 67 | /* Enforce (dynamic) linker error for version mismatches. Call from main. */ 68 | LUA_API void LUAJIT_VERSION_SYM(void); 69 | 70 | #endif 71 | -------------------------------------------------------------------------------- /deps/luajit/src/lualib.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Standard library header. 3 | ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LUALIB_H 7 | #define _LUALIB_H 8 | 9 | #include "lua.h" 10 | 11 | #define LUA_FILEHANDLE "FILE*" 12 | 13 | #define LUA_COLIBNAME "coroutine" 14 | #define LUA_MATHLIBNAME "math" 15 | #define LUA_STRLIBNAME "string" 16 | #define LUA_TABLIBNAME "table" 17 | #define LUA_IOLIBNAME "io" 18 | #define LUA_OSLIBNAME "os" 19 | #define LUA_LOADLIBNAME "package" 20 | #define LUA_DBLIBNAME "debug" 21 | #define LUA_BITLIBNAME "bit" 22 | #define LUA_JITLIBNAME "jit" 23 | #define LUA_FFILIBNAME "ffi" 24 | 25 | LUALIB_API int luaopen_base(lua_State *L); 26 | LUALIB_API int luaopen_math(lua_State *L); 27 | LUALIB_API int luaopen_string(lua_State *L); 28 | LUALIB_API int luaopen_table(lua_State *L); 29 | LUALIB_API int luaopen_io(lua_State *L); 30 | LUALIB_API int luaopen_os(lua_State *L); 31 | LUALIB_API int luaopen_package(lua_State *L); 32 | LUALIB_API int luaopen_debug(lua_State *L); 33 | LUALIB_API int luaopen_bit(lua_State *L); 34 | LUALIB_API int luaopen_jit(lua_State *L); 35 | LUALIB_API int luaopen_ffi(lua_State *L); 36 | 37 | LUALIB_API void luaL_openlibs(lua_State *L); 38 | 39 | #ifndef lua_assert 40 | #define lua_assert(x) ((void)0) 41 | #endif 42 | 43 | #endif 44 | -------------------------------------------------------------------------------- /deps/luajit/src/msvcbuild.bat: -------------------------------------------------------------------------------- 1 | @rem Script to build LuaJIT with MSVC. 2 | @rem Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h 3 | @rem 4 | @rem Either open a "Visual Studio .NET Command Prompt" 5 | @rem (Note that the Express Edition does not contain an x64 compiler) 6 | @rem -or- 7 | @rem Open a "Windows SDK Command Shell" and set the compiler environment: 8 | @rem setenv /release /x86 9 | @rem -or- 10 | @rem setenv /release /x64 11 | @rem 12 | @rem Then cd to this directory and run this script. 13 | 14 | @if not defined INCLUDE goto :FAIL 15 | 16 | @setlocal 17 | @set LJCOMPILE=cl /nologo /c /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE 18 | @set LJLINK=link /nologo 19 | @set LJMT=mt /nologo 20 | @set LJLIB=lib /nologo /nodefaultlib 21 | @set DASMDIR=..\dynasm 22 | @set DASM=%DASMDIR%\dynasm.lua 23 | @set LJDLLNAME=lua51.dll 24 | @set LJLIBNAME=lua51.lib 25 | @set ALL_LIB=lib_base.c lib_math.c lib_bit.c lib_string.c lib_table.c lib_io.c lib_os.c lib_package.c lib_debug.c lib_jit.c lib_ffi.c 26 | 27 | %LJCOMPILE% host\minilua.c 28 | @if errorlevel 1 goto :BAD 29 | %LJLINK% /out:minilua.exe minilua.obj 30 | @if errorlevel 1 goto :BAD 31 | if exist minilua.exe.manifest^ 32 | %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe 33 | 34 | @set DASMFLAGS=-D WIN -D JIT -D FFI -D P64 35 | @set LJARCH=x64 36 | @minilua 37 | @if errorlevel 8 goto :X64 38 | @set DASMFLAGS=-D WIN -D JIT -D FFI 39 | @set LJARCH=x86 40 | :X64 41 | minilua %DASM% -LN %DASMFLAGS% -o host\buildvm_arch.h vm_x86.dasc 42 | @if errorlevel 1 goto :BAD 43 | 44 | %LJCOMPILE% /I "." /I %DASMDIR% host\buildvm*.c 45 | @if errorlevel 1 goto :BAD 46 | %LJLINK% /out:buildvm.exe buildvm*.obj 47 | @if errorlevel 1 goto :BAD 48 | if exist buildvm.exe.manifest^ 49 | %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe 50 | 51 | buildvm -m peobj -o lj_vm.obj 52 | @if errorlevel 1 goto :BAD 53 | buildvm -m bcdef -o lj_bcdef.h %ALL_LIB% 54 | @if errorlevel 1 goto :BAD 55 | buildvm -m ffdef -o lj_ffdef.h %ALL_LIB% 56 | @if errorlevel 1 goto :BAD 57 | buildvm -m libdef -o lj_libdef.h %ALL_LIB% 58 | @if errorlevel 1 goto :BAD 59 | buildvm -m recdef -o lj_recdef.h %ALL_LIB% 60 | @if errorlevel 1 goto :BAD 61 | buildvm -m vmdef -o jit\vmdef.lua %ALL_LIB% 62 | @if errorlevel 1 goto :BAD 63 | buildvm -m folddef -o lj_folddef.h lj_opt_fold.c 64 | @if errorlevel 1 goto :BAD 65 | 66 | @if "%1" neq "debug" goto :NODEBUG 67 | @shift 68 | @set LJCOMPILE=%LJCOMPILE% /Zi 69 | @set LJLINK=%LJLINK% /debug 70 | :NODEBUG 71 | @if "%1"=="amalg" goto :AMALGDLL 72 | @if "%1"=="static" goto :STATIC 73 | %LJCOMPILE% /MD /DLUA_BUILD_AS_DLL lj_*.c lib_*.c 74 | @if errorlevel 1 goto :BAD 75 | %LJLINK% /DLL /out:%LJDLLNAME% lj_*.obj lib_*.obj 76 | @if errorlevel 1 goto :BAD 77 | @goto :MTDLL 78 | :STATIC 79 | %LJCOMPILE% lj_*.c lib_*.c 80 | @if errorlevel 1 goto :BAD 81 | %LJLIB% /OUT:%LJLIBNAME% lj_*.obj lib_*.obj 82 | @if errorlevel 1 goto :BAD 83 | @goto :MTDLL 84 | :AMALGDLL 85 | %LJCOMPILE% /MD /DLUA_BUILD_AS_DLL ljamalg.c 86 | @if errorlevel 1 goto :BAD 87 | %LJLINK% /DLL /out:%LJDLLNAME% ljamalg.obj lj_vm.obj 88 | @if errorlevel 1 goto :BAD 89 | :MTDLL 90 | if exist %LJDLLNAME%.manifest^ 91 | %LJMT% -manifest %LJDLLNAME%.manifest -outputresource:%LJDLLNAME%;2 92 | 93 | %LJCOMPILE% luajit.c 94 | @if errorlevel 1 goto :BAD 95 | %LJLINK% /out:luajit.exe luajit.obj %LJLIBNAME% 96 | @if errorlevel 1 goto :BAD 97 | if exist luajit.exe.manifest^ 98 | %LJMT% -manifest luajit.exe.manifest -outputresource:luajit.exe 99 | 100 | @del *.obj *.manifest minilua.exe buildvm.exe 101 | @echo. 102 | @echo === Successfully built LuaJIT for Windows/%LJARCH% === 103 | 104 | @goto :END 105 | :BAD 106 | @echo. 107 | @echo ******************************************************* 108 | @echo *** Build FAILED -- Please check the error messages *** 109 | @echo ******************************************************* 110 | @goto :END 111 | :FAIL 112 | @echo You must open a "Visual Studio .NET Command Prompt" to run this script 113 | :END 114 | -------------------------------------------------------------------------------- /deps/luajit/src/ps4build.bat: -------------------------------------------------------------------------------- 1 | @rem Script to build LuaJIT with the PS4 SDK. 2 | @rem Donated to the public domain. 3 | @rem 4 | @rem Open a "Visual Studio .NET Command Prompt" (64 bit host compiler) 5 | @rem Then cd to this directory and run this script. 6 | 7 | @if not defined INCLUDE goto :FAIL 8 | @if not defined SCE_ORBIS_SDK_DIR goto :FAIL 9 | 10 | @setlocal 11 | @rem ---- Host compiler ---- 12 | @set LJCOMPILE=cl /nologo /c /MD /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE 13 | @set LJLINK=link /nologo 14 | @set LJMT=mt /nologo 15 | @set DASMDIR=..\dynasm 16 | @set DASM=%DASMDIR%\dynasm.lua 17 | @set ALL_LIB=lib_base.c lib_math.c lib_bit.c lib_string.c lib_table.c lib_io.c lib_os.c lib_package.c lib_debug.c lib_jit.c lib_ffi.c 18 | 19 | %LJCOMPILE% host\minilua.c 20 | @if errorlevel 1 goto :BAD 21 | %LJLINK% /out:minilua.exe minilua.obj 22 | @if errorlevel 1 goto :BAD 23 | if exist minilua.exe.manifest^ 24 | %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe 25 | 26 | @rem Check for 64 bit host compiler. 27 | @minilua 28 | @if not errorlevel 8 goto :FAIL 29 | 30 | @set DASMFLAGS=-D P64 31 | minilua %DASM% -LN %DASMFLAGS% -o host\buildvm_arch.h vm_x86.dasc 32 | @if errorlevel 1 goto :BAD 33 | 34 | %LJCOMPILE% /I "." /I %DASMDIR% -DLUAJIT_TARGET=LUAJIT_ARCH_X64 -DLUAJIT_OS=LUAJIT_OS_OTHER -DLUAJIT_DISABLE_JIT -DLUAJIT_DISABLE_FFI host\buildvm*.c 35 | @if errorlevel 1 goto :BAD 36 | %LJLINK% /out:buildvm.exe buildvm*.obj 37 | @if errorlevel 1 goto :BAD 38 | if exist buildvm.exe.manifest^ 39 | %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe 40 | 41 | buildvm -m elfasm -o lj_vm.s 42 | @if errorlevel 1 goto :BAD 43 | buildvm -m bcdef -o lj_bcdef.h %ALL_LIB% 44 | @if errorlevel 1 goto :BAD 45 | buildvm -m ffdef -o lj_ffdef.h %ALL_LIB% 46 | @if errorlevel 1 goto :BAD 47 | buildvm -m libdef -o lj_libdef.h %ALL_LIB% 48 | @if errorlevel 1 goto :BAD 49 | buildvm -m recdef -o lj_recdef.h %ALL_LIB% 50 | @if errorlevel 1 goto :BAD 51 | buildvm -m vmdef -o jit\vmdef.lua %ALL_LIB% 52 | @if errorlevel 1 goto :BAD 53 | buildvm -m folddef -o lj_folddef.h lj_opt_fold.c 54 | @if errorlevel 1 goto :BAD 55 | 56 | @rem ---- Cross compiler ---- 57 | @set LJCOMPILE="%SCE_ORBIS_SDK_DIR%\host_tools\bin\orbis-clang" -c -Wall -DLUAJIT_DISABLE_FFI 58 | @set LJLIB="%SCE_ORBIS_SDK_DIR%\host_tools\bin\orbis-ar" rcus 59 | @set INCLUDE="" 60 | 61 | orbis-as -o lj_vm.o lj_vm.s 62 | 63 | @if "%1" neq "debug" goto :NODEBUG 64 | @shift 65 | @set LJCOMPILE=%LJCOMPILE% -g -O0 66 | @set TARGETLIB=libluajitD.a 67 | goto :BUILD 68 | :NODEBUG 69 | @set LJCOMPILE=%LJCOMPILE% -O2 70 | @set TARGETLIB=libluajit.a 71 | :BUILD 72 | del %TARGETLIB% 73 | @if "%1"=="amalg" goto :AMALG 74 | for %%f in (lj_*.c lib_*.c) do ( 75 | %LJCOMPILE% %%f 76 | @if errorlevel 1 goto :BAD 77 | ) 78 | 79 | %LJLIB% %TARGETLIB% lj_*.o lib_*.o 80 | @if errorlevel 1 goto :BAD 81 | @goto :NOAMALG 82 | :AMALG 83 | %LJCOMPILE% ljamalg.c 84 | @if errorlevel 1 goto :BAD 85 | %LJLIB% %TARGETLIB% ljamalg.o lj_vm.o 86 | @if errorlevel 1 goto :BAD 87 | :NOAMALG 88 | 89 | @del *.o *.obj *.manifest minilua.exe buildvm.exe 90 | @echo. 91 | @echo === Successfully built LuaJIT for PS4 === 92 | 93 | @goto :END 94 | :BAD 95 | @echo. 96 | @echo ******************************************************* 97 | @echo *** Build FAILED -- Please check the error messages *** 98 | @echo ******************************************************* 99 | @goto :END 100 | :FAIL 101 | @echo To run this script you must open a "Visual Studio .NET Command Prompt" 102 | @echo (64 bit host compiler). The PS4 Orbis SDK must be installed, too. 103 | :END 104 | -------------------------------------------------------------------------------- /deps/luajit/src/xedkbuild.bat: -------------------------------------------------------------------------------- 1 | @rem Script to build LuaJIT with the Xbox 360 SDK. 2 | @rem Donated to the public domain. 3 | @rem 4 | @rem Open a "Visual Studio .NET Command Prompt" (32 bit host compiler) 5 | @rem Then cd to this directory and run this script. 6 | 7 | @if not defined INCLUDE goto :FAIL 8 | @if not defined XEDK goto :FAIL 9 | 10 | @setlocal 11 | @rem ---- Host compiler ---- 12 | @set LJCOMPILE=cl /nologo /c /MD /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE 13 | @set LJLINK=link /nologo 14 | @set LJMT=mt /nologo 15 | @set DASMDIR=..\dynasm 16 | @set DASM=%DASMDIR%\dynasm.lua 17 | @set ALL_LIB=lib_base.c lib_math.c lib_bit.c lib_string.c lib_table.c lib_io.c lib_os.c lib_package.c lib_debug.c lib_jit.c lib_ffi.c 18 | 19 | %LJCOMPILE% host\minilua.c 20 | @if errorlevel 1 goto :BAD 21 | %LJLINK% /out:minilua.exe minilua.obj 22 | @if errorlevel 1 goto :BAD 23 | if exist minilua.exe.manifest^ 24 | %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe 25 | 26 | @rem Error out for 64 bit host compiler 27 | @minilua 28 | @if errorlevel 8 goto :FAIL 29 | 30 | @set DASMFLAGS=-D GPR64 -D FRAME32 -D PPE -D SQRT -D DUALNUM 31 | minilua %DASM% -LN %DASMFLAGS% -o host\buildvm_arch.h vm_ppc.dasc 32 | @if errorlevel 1 goto :BAD 33 | 34 | %LJCOMPILE% /I "." /I %DASMDIR% /D_XBOX_VER=200 /DLUAJIT_TARGET=LUAJIT_ARCH_PPC host\buildvm*.c 35 | @if errorlevel 1 goto :BAD 36 | %LJLINK% /out:buildvm.exe buildvm*.obj 37 | @if errorlevel 1 goto :BAD 38 | if exist buildvm.exe.manifest^ 39 | %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe 40 | 41 | buildvm -m peobj -o lj_vm.obj 42 | @if errorlevel 1 goto :BAD 43 | buildvm -m bcdef -o lj_bcdef.h %ALL_LIB% 44 | @if errorlevel 1 goto :BAD 45 | buildvm -m ffdef -o lj_ffdef.h %ALL_LIB% 46 | @if errorlevel 1 goto :BAD 47 | buildvm -m libdef -o lj_libdef.h %ALL_LIB% 48 | @if errorlevel 1 goto :BAD 49 | buildvm -m recdef -o lj_recdef.h %ALL_LIB% 50 | @if errorlevel 1 goto :BAD 51 | buildvm -m vmdef -o jit\vmdef.lua %ALL_LIB% 52 | @if errorlevel 1 goto :BAD 53 | buildvm -m folddef -o lj_folddef.h lj_opt_fold.c 54 | @if errorlevel 1 goto :BAD 55 | 56 | @rem ---- Cross compiler ---- 57 | @set LJCOMPILE="%XEDK%\bin\win32\cl" /nologo /c /MT /O2 /W3 /GF /Gm- /GR- /GS- /Gy /openmp- /D_CRT_SECURE_NO_DEPRECATE /DNDEBUG /D_XBOX /D_LIB /DLUAJIT_USE_SYSMALLOC 58 | @set LJLIB="%XEDK%\bin\win32\lib" /nologo 59 | @set "INCLUDE=%XEDK%\include\xbox" 60 | 61 | @if "%1" neq "debug" goto :NODEBUG 62 | @shift 63 | @set "LJCOMPILE=%LJCOMPILE% /Zi" 64 | :NODEBUG 65 | @if "%1"=="amalg" goto :AMALG 66 | %LJCOMPILE% /DLUA_BUILD_AS_DLL lj_*.c lib_*.c 67 | @if errorlevel 1 goto :BAD 68 | %LJLIB% /OUT:luajit20.lib lj_*.obj lib_*.obj 69 | @if errorlevel 1 goto :BAD 70 | @goto :NOAMALG 71 | :AMALG 72 | %LJCOMPILE% /DLUA_BUILD_AS_DLL ljamalg.c 73 | @if errorlevel 1 goto :BAD 74 | %LJLIB% /OUT:luajit20.lib ljamalg.obj lj_vm.obj 75 | @if errorlevel 1 goto :BAD 76 | :NOAMALG 77 | 78 | @del *.obj *.manifest minilua.exe buildvm.exe 79 | @echo. 80 | @echo === Successfully built LuaJIT for Xbox 360 === 81 | 82 | @goto :END 83 | :BAD 84 | @echo. 85 | @echo ******************************************************* 86 | @echo *** Build FAILED -- Please check the error messages *** 87 | @echo ******************************************************* 88 | @goto :END 89 | :FAIL 90 | @echo To run this script you must open a "Visual Studio .NET Command Prompt" 91 | @echo (32 bit host compiler). The Xbox 360 SDK must be installed, too. 92 | :END 93 | -------------------------------------------------------------------------------- /scripts/addr.lua: -------------------------------------------------------------------------------- 1 | -- example script that demonstrates use of setup() to pass 2 | -- a random server address to each thread 3 | 4 | local addrs = nil 5 | 6 | function setup(thread) 7 | if not addrs then 8 | addrs = wrk.lookup(wrk.host, wrk.port or "http") 9 | for i = #addrs, 1, -1 do 10 | if not wrk.connect(addrs[i]) then 11 | table.remove(addrs, i) 12 | end 13 | end 14 | end 15 | 16 | thread.addr = addrs[math.random(#addrs)] 17 | end 18 | 19 | function init(args) 20 | local msg = "thread addr: %s" 21 | print(msg:format(wrk.thread.addr)) 22 | end 23 | -------------------------------------------------------------------------------- /scripts/auth.lua: -------------------------------------------------------------------------------- 1 | -- example script that demonstrates response handling and 2 | -- retrieving an authentication token to set on all future 3 | -- requests 4 | 5 | token = nil 6 | path = "/authenticate" 7 | 8 | request = function() 9 | return wrk.format("GET", path) 10 | end 11 | 12 | response = function(status, headers, body) 13 | if not token and status == 200 then 14 | token = headers["X-Token"] 15 | path = "/resource" 16 | wrk.headers["X-Token"] = token 17 | end 18 | end 19 | -------------------------------------------------------------------------------- /scripts/counter.lua: -------------------------------------------------------------------------------- 1 | -- example dynamic request script which demonstrates changing 2 | -- the request path and a header for each request 3 | ------------------------------------------------------------- 4 | -- NOTE: each wrk thread has an independent Lua scripting 5 | -- context and thus there will be one counter per thread 6 | 7 | counter = 0 8 | 9 | request = function() 10 | path = "/" .. counter 11 | wrk.headers["X-Counter"] = counter 12 | counter = counter + 1 13 | return wrk.format(nil, path) 14 | end 15 | -------------------------------------------------------------------------------- /scripts/pipeline.lua: -------------------------------------------------------------------------------- 1 | -- example script demonstrating HTTP pipelining 2 | 3 | init = function(args) 4 | local r = {} 5 | r[1] = wrk.format(nil, "/?foo") 6 | r[2] = wrk.format(nil, "/?bar") 7 | r[3] = wrk.format(nil, "/?baz") 8 | 9 | req = table.concat(r) 10 | end 11 | 12 | request = function() 13 | return req 14 | end 15 | -------------------------------------------------------------------------------- /scripts/post.lua: -------------------------------------------------------------------------------- 1 | -- example HTTP POST script which demonstrates setting the 2 | -- HTTP method, body, and adding a header 3 | 4 | wrk.method = "POST" 5 | wrk.body = "foo=bar&baz=quux" 6 | wrk.headers["Content-Type"] = "application/x-www-form-urlencoded" 7 | -------------------------------------------------------------------------------- /scripts/report.lua: -------------------------------------------------------------------------------- 1 | -- example reporting script which demonstrates a custom 2 | -- done() function that prints latency percentiles as CSV 3 | 4 | done = function(summary, latency, requests) 5 | io.write("------------------------------\n") 6 | for _, p in pairs({ 50, 90, 99, 99.999 }) do 7 | n = latency:percentile(p) 8 | io.write(string.format("%g%%,%d\n", p, n)) 9 | end 10 | end 11 | -------------------------------------------------------------------------------- /scripts/setup.lua: -------------------------------------------------------------------------------- 1 | -- example script that demonstrates use of setup() to pass 2 | -- data to and from the threads 3 | 4 | local counter = 1 5 | local threads = {} 6 | 7 | function setup(thread) 8 | thread:set("id", counter) 9 | table.insert(threads, thread) 10 | counter = counter + 1 11 | end 12 | 13 | function init(args) 14 | requests = 0 15 | responses = 0 16 | 17 | local msg = "thread %d created" 18 | print(msg:format(id)) 19 | end 20 | 21 | function request() 22 | requests = requests + 1 23 | return wrk.request() 24 | end 25 | 26 | function response(status, headers, body) 27 | responses = responses + 1 28 | end 29 | 30 | function done(summary, latency, requests) 31 | for index, thread in ipairs(threads) do 32 | local id = thread:get("id") 33 | local requests = thread:get("requests") 34 | local responses = thread:get("responses") 35 | local msg = "thread %d made %d requests and got %d responses" 36 | print(msg:format(id, requests, responses)) 37 | end 38 | end 39 | -------------------------------------------------------------------------------- /scripts/stop.lua: -------------------------------------------------------------------------------- 1 | -- example script that demonstrates use of thread:stop() 2 | 3 | local counter = 1 4 | 5 | function response() 6 | if counter == 100 then 7 | wrk.thread:stop() 8 | end 9 | counter = counter + 1 10 | end 11 | -------------------------------------------------------------------------------- /src/ae.h: -------------------------------------------------------------------------------- 1 | /* A simple event-driven programming library. Originally I wrote this code 2 | * for the Jim's event-loop (Jim is a Tcl interpreter) but later translated 3 | * it in form of a library for easy reuse. 4 | * 5 | * Copyright (c) 2006-2012, Salvatore Sanfilippo 6 | * All rights reserved. 7 | * 8 | * Redistribution and use in source and binary forms, with or without 9 | * modification, are permitted provided that the following conditions are met: 10 | * 11 | * * Redistributions of source code must retain the above copyright notice, 12 | * this list of conditions and the following disclaimer. 13 | * * Redistributions in binary form must reproduce the above copyright 14 | * notice, this list of conditions and the following disclaimer in the 15 | * documentation and/or other materials provided with the distribution. 16 | * * Neither the name of Redis nor the names of its contributors may be used 17 | * to endorse or promote products derived from this software without 18 | * specific prior written permission. 19 | * 20 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 21 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 24 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 25 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 26 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 27 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 28 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 29 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 30 | * POSSIBILITY OF SUCH DAMAGE. 31 | */ 32 | 33 | #ifndef __AE_H__ 34 | #define __AE_H__ 35 | 36 | #define AE_OK 0 37 | #define AE_ERR -1 38 | 39 | #define AE_NONE 0 40 | #define AE_READABLE 1 41 | #define AE_WRITABLE 2 42 | 43 | #define AE_FILE_EVENTS 1 44 | #define AE_TIME_EVENTS 2 45 | #define AE_ALL_EVENTS (AE_FILE_EVENTS|AE_TIME_EVENTS) 46 | #define AE_DONT_WAIT 4 47 | 48 | #define AE_NOMORE -1 49 | 50 | /* Macros */ 51 | #define AE_NOTUSED(V) ((void) V) 52 | 53 | struct aeEventLoop; 54 | 55 | /* Types and data structures */ 56 | typedef void aeFileProc(struct aeEventLoop *eventLoop, int fd, void *clientData, int mask); 57 | typedef int aeTimeProc(struct aeEventLoop *eventLoop, long long id, void *clientData); 58 | typedef void aeEventFinalizerProc(struct aeEventLoop *eventLoop, void *clientData); 59 | typedef void aeBeforeSleepProc(struct aeEventLoop *eventLoop); 60 | 61 | /* File event structure */ 62 | typedef struct aeFileEvent { 63 | int mask; /* one of AE_(READABLE|WRITABLE) */ 64 | aeFileProc *rfileProc; 65 | aeFileProc *wfileProc; 66 | void *clientData; 67 | } aeFileEvent; 68 | 69 | /* Time event structure */ 70 | typedef struct aeTimeEvent { 71 | long long id; /* time event identifier. */ 72 | long when_sec; /* seconds */ 73 | long when_ms; /* milliseconds */ 74 | aeTimeProc *timeProc; 75 | aeEventFinalizerProc *finalizerProc; 76 | void *clientData; 77 | struct aeTimeEvent *next; 78 | } aeTimeEvent; 79 | 80 | /* A fired event */ 81 | typedef struct aeFiredEvent { 82 | int fd; 83 | int mask; 84 | } aeFiredEvent; 85 | 86 | /* State of an event based program */ 87 | typedef struct aeEventLoop { 88 | int maxfd; /* highest file descriptor currently registered */ 89 | int setsize; /* max number of file descriptors tracked */ 90 | long long timeEventNextId; 91 | time_t lastTime; /* Used to detect system clock skew */ 92 | aeFileEvent *events; /* Registered events */ 93 | aeFiredEvent *fired; /* Fired events */ 94 | aeTimeEvent *timeEventHead; 95 | int stop; 96 | void *apidata; /* This is used for polling API specific data */ 97 | aeBeforeSleepProc *beforesleep; 98 | } aeEventLoop; 99 | 100 | /* Prototypes */ 101 | aeEventLoop *aeCreateEventLoop(int setsize); 102 | void aeDeleteEventLoop(aeEventLoop *eventLoop); 103 | void aeStop(aeEventLoop *eventLoop); 104 | int aeCreateFileEvent(aeEventLoop *eventLoop, int fd, int mask, 105 | aeFileProc *proc, void *clientData); 106 | void aeDeleteFileEvent(aeEventLoop *eventLoop, int fd, int mask); 107 | int aeGetFileEvents(aeEventLoop *eventLoop, int fd); 108 | long long aeCreateTimeEvent(aeEventLoop *eventLoop, long long milliseconds, 109 | aeTimeProc *proc, void *clientData, 110 | aeEventFinalizerProc *finalizerProc); 111 | int aeDeleteTimeEvent(aeEventLoop *eventLoop, long long id); 112 | int aeProcessEvents(aeEventLoop *eventLoop, int flags); 113 | int aeWait(int fd, int mask, long long milliseconds); 114 | void aeMain(aeEventLoop *eventLoop); 115 | char *aeGetApiName(void); 116 | void aeSetBeforeSleepProc(aeEventLoop *eventLoop, aeBeforeSleepProc *beforesleep); 117 | 118 | #endif 119 | -------------------------------------------------------------------------------- /src/ae_epoll.c: -------------------------------------------------------------------------------- 1 | /* Linux epoll(2) based ae.c module 2 | * 3 | * Copyright (c) 2009-2012, Salvatore Sanfilippo 4 | * All rights reserved. 5 | * 6 | * Redistribution and use in source and binary forms, with or without 7 | * modification, are permitted provided that the following conditions are met: 8 | * 9 | * * Redistributions of source code must retain the above copyright notice, 10 | * this list of conditions and the following disclaimer. 11 | * * Redistributions in binary form must reproduce the above copyright 12 | * notice, this list of conditions and the following disclaimer in the 13 | * documentation and/or other materials provided with the distribution. 14 | * * Neither the name of Redis nor the names of its contributors may be used 15 | * to endorse or promote products derived from this software without 16 | * specific prior written permission. 17 | * 18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 19 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 20 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 22 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 23 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 24 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 25 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 26 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 27 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 28 | * POSSIBILITY OF SUCH DAMAGE. 29 | */ 30 | 31 | 32 | #include 33 | 34 | typedef struct aeApiState { 35 | int epfd; 36 | struct epoll_event *events; 37 | } aeApiState; 38 | 39 | static int aeApiCreate(aeEventLoop *eventLoop) { 40 | aeApiState *state = zmalloc(sizeof(aeApiState)); 41 | 42 | if (!state) return -1; 43 | state->events = zmalloc(sizeof(struct epoll_event)*eventLoop->setsize); 44 | if (!state->events) { 45 | zfree(state); 46 | return -1; 47 | } 48 | state->epfd = epoll_create(1024); /* 1024 is just an hint for the kernel */ 49 | if (state->epfd == -1) { 50 | zfree(state->events); 51 | zfree(state); 52 | return -1; 53 | } 54 | eventLoop->apidata = state; 55 | return 0; 56 | } 57 | 58 | static void aeApiFree(aeEventLoop *eventLoop) { 59 | aeApiState *state = eventLoop->apidata; 60 | 61 | close(state->epfd); 62 | zfree(state->events); 63 | zfree(state); 64 | } 65 | 66 | static int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) { 67 | aeApiState *state = eventLoop->apidata; 68 | struct epoll_event ee; 69 | /* If the fd was already monitored for some event, we need a MOD 70 | * operation. Otherwise we need an ADD operation. */ 71 | int op = eventLoop->events[fd].mask == AE_NONE ? 72 | EPOLL_CTL_ADD : EPOLL_CTL_MOD; 73 | 74 | ee.events = 0; 75 | mask |= eventLoop->events[fd].mask; /* Merge old events */ 76 | if (mask & AE_READABLE) ee.events |= (EPOLLIN|EPOLLHUP|EPOLLRDHUP); 77 | if (mask & AE_WRITABLE) ee.events |= EPOLLOUT; 78 | ee.data.u64 = 0; /* avoid valgrind warning */ 79 | ee.data.fd = fd; 80 | if (epoll_ctl(state->epfd,op,fd,&ee) == -1) return -1; 81 | return 0; 82 | } 83 | 84 | static void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int delmask) { 85 | aeApiState *state = eventLoop->apidata; 86 | struct epoll_event ee; 87 | int mask = eventLoop->events[fd].mask & (~delmask); 88 | 89 | ee.events = 0; 90 | if (mask & AE_READABLE) ee.events |= EPOLLIN; 91 | if (mask & AE_WRITABLE) ee.events |= EPOLLOUT; 92 | ee.data.u64 = 0; /* avoid valgrind warning */ 93 | ee.data.fd = fd; 94 | if (mask != AE_NONE) { 95 | epoll_ctl(state->epfd,EPOLL_CTL_MOD,fd,&ee); 96 | } else { 97 | /* Note, Kernel < 2.6.9 requires a non null event pointer even for 98 | * EPOLL_CTL_DEL. */ 99 | epoll_ctl(state->epfd,EPOLL_CTL_DEL,fd,&ee); 100 | } 101 | } 102 | 103 | static int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) { 104 | aeApiState *state = eventLoop->apidata; 105 | int retval, numevents = 0; 106 | 107 | retval = epoll_wait(state->epfd,state->events,eventLoop->setsize, 108 | tvp ? (tvp->tv_sec*1000 + tvp->tv_usec/1000) : -1); 109 | if (retval > 0) { 110 | int j; 111 | 112 | numevents = retval; 113 | for (j = 0; j < numevents; j++) { 114 | int mask = 0; 115 | struct epoll_event *e = state->events+j; 116 | 117 | if (e->events & (EPOLLIN | EPOLLRDHUP | EPOLLHUP)) mask |= AE_READABLE; 118 | if (e->events & EPOLLOUT) mask |= AE_WRITABLE; 119 | if (e->events & EPOLLERR) mask |= AE_WRITABLE; 120 | if (e->events & EPOLLHUP) mask |= AE_WRITABLE; 121 | eventLoop->fired[j].fd = e->data.fd; 122 | eventLoop->fired[j].mask = mask; 123 | } 124 | } 125 | return numevents; 126 | } 127 | 128 | static char *aeApiName(void) { 129 | return "epoll"; 130 | } 131 | -------------------------------------------------------------------------------- /src/ae_kqueue.c: -------------------------------------------------------------------------------- 1 | /* Kqueue(2)-based ae.c module 2 | * 3 | * Copyright (C) 2009 Harish Mallipeddi - harish.mallipeddi@gmail.com 4 | * All rights reserved. 5 | * 6 | * Redistribution and use in source and binary forms, with or without 7 | * modification, are permitted provided that the following conditions are met: 8 | * 9 | * * Redistributions of source code must retain the above copyright notice, 10 | * this list of conditions and the following disclaimer. 11 | * * Redistributions in binary form must reproduce the above copyright 12 | * notice, this list of conditions and the following disclaimer in the 13 | * documentation and/or other materials provided with the distribution. 14 | * * Neither the name of Redis nor the names of its contributors may be used 15 | * to endorse or promote products derived from this software without 16 | * specific prior written permission. 17 | * 18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 19 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 20 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 22 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 23 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 24 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 25 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 26 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 27 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 28 | * POSSIBILITY OF SUCH DAMAGE. 29 | */ 30 | 31 | 32 | #include 33 | #include 34 | #include 35 | 36 | typedef struct aeApiState { 37 | int kqfd; 38 | struct kevent *events; 39 | } aeApiState; 40 | 41 | static int aeApiCreate(aeEventLoop *eventLoop) { 42 | aeApiState *state = zmalloc(sizeof(aeApiState)); 43 | 44 | if (!state) return -1; 45 | state->events = zmalloc(sizeof(struct kevent)*eventLoop->setsize); 46 | if (!state->events) { 47 | zfree(state); 48 | return -1; 49 | } 50 | state->kqfd = kqueue(); 51 | if (state->kqfd == -1) { 52 | zfree(state->events); 53 | zfree(state); 54 | return -1; 55 | } 56 | eventLoop->apidata = state; 57 | 58 | return 0; 59 | } 60 | 61 | static void aeApiFree(aeEventLoop *eventLoop) { 62 | aeApiState *state = eventLoop->apidata; 63 | 64 | close(state->kqfd); 65 | zfree(state->events); 66 | zfree(state); 67 | } 68 | 69 | static int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) { 70 | aeApiState *state = eventLoop->apidata; 71 | struct kevent ke; 72 | 73 | if (mask & AE_READABLE) { 74 | EV_SET(&ke, fd, EVFILT_READ, EV_ADD, 0, 0, NULL); 75 | if (kevent(state->kqfd, &ke, 1, NULL, 0, NULL) == -1) return -1; 76 | } 77 | if (mask & AE_WRITABLE) { 78 | EV_SET(&ke, fd, EVFILT_WRITE, EV_ADD, 0, 0, NULL); 79 | if (kevent(state->kqfd, &ke, 1, NULL, 0, NULL) == -1) return -1; 80 | } 81 | return 0; 82 | } 83 | 84 | static void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int mask) { 85 | aeApiState *state = eventLoop->apidata; 86 | struct kevent ke; 87 | 88 | if (mask & AE_READABLE) { 89 | EV_SET(&ke, fd, EVFILT_READ, EV_DELETE, 0, 0, NULL); 90 | kevent(state->kqfd, &ke, 1, NULL, 0, NULL); 91 | } 92 | if (mask & AE_WRITABLE) { 93 | EV_SET(&ke, fd, EVFILT_WRITE, EV_DELETE, 0, 0, NULL); 94 | kevent(state->kqfd, &ke, 1, NULL, 0, NULL); 95 | } 96 | } 97 | 98 | static int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) { 99 | aeApiState *state = eventLoop->apidata; 100 | int retval, numevents = 0; 101 | 102 | if (tvp != NULL) { 103 | struct timespec timeout; 104 | timeout.tv_sec = tvp->tv_sec; 105 | timeout.tv_nsec = tvp->tv_usec * 1000; 106 | retval = kevent(state->kqfd, NULL, 0, state->events, eventLoop->setsize, 107 | &timeout); 108 | } else { 109 | retval = kevent(state->kqfd, NULL, 0, state->events, eventLoop->setsize, 110 | NULL); 111 | } 112 | 113 | if (retval > 0) { 114 | int j; 115 | 116 | numevents = retval; 117 | for(j = 0; j < numevents; j++) { 118 | int mask = 0; 119 | struct kevent *e = state->events+j; 120 | 121 | if (e->filter == EVFILT_READ) mask |= AE_READABLE; 122 | if (e->filter == EVFILT_WRITE) mask |= AE_WRITABLE; 123 | eventLoop->fired[j].fd = e->ident; 124 | eventLoop->fired[j].mask = mask; 125 | } 126 | } 127 | return numevents; 128 | } 129 | 130 | static char *aeApiName(void) { 131 | return "kqueue"; 132 | } 133 | -------------------------------------------------------------------------------- /src/ae_select.c: -------------------------------------------------------------------------------- 1 | /* Select()-based ae.c module. 2 | * 3 | * Copyright (c) 2009-2012, Salvatore Sanfilippo 4 | * All rights reserved. 5 | * 6 | * Redistribution and use in source and binary forms, with or without 7 | * modification, are permitted provided that the following conditions are met: 8 | * 9 | * * Redistributions of source code must retain the above copyright notice, 10 | * this list of conditions and the following disclaimer. 11 | * * Redistributions in binary form must reproduce the above copyright 12 | * notice, this list of conditions and the following disclaimer in the 13 | * documentation and/or other materials provided with the distribution. 14 | * * Neither the name of Redis nor the names of its contributors may be used 15 | * to endorse or promote products derived from this software without 16 | * specific prior written permission. 17 | * 18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 19 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 20 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 22 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 23 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 24 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 25 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 26 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 27 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 28 | * POSSIBILITY OF SUCH DAMAGE. 29 | */ 30 | 31 | 32 | #include 33 | 34 | typedef struct aeApiState { 35 | fd_set rfds, wfds; 36 | /* We need to have a copy of the fd sets as it's not safe to reuse 37 | * FD sets after select(). */ 38 | fd_set _rfds, _wfds; 39 | } aeApiState; 40 | 41 | static int aeApiCreate(aeEventLoop *eventLoop) { 42 | aeApiState *state = zmalloc(sizeof(aeApiState)); 43 | 44 | if (!state) return -1; 45 | FD_ZERO(&state->rfds); 46 | FD_ZERO(&state->wfds); 47 | eventLoop->apidata = state; 48 | return 0; 49 | } 50 | 51 | static void aeApiFree(aeEventLoop *eventLoop) { 52 | zfree(eventLoop->apidata); 53 | } 54 | 55 | static int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) { 56 | aeApiState *state = eventLoop->apidata; 57 | 58 | if (mask & AE_READABLE) FD_SET(fd,&state->rfds); 59 | if (mask & AE_WRITABLE) FD_SET(fd,&state->wfds); 60 | return 0; 61 | } 62 | 63 | static void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int mask) { 64 | aeApiState *state = eventLoop->apidata; 65 | 66 | if (mask & AE_READABLE) FD_CLR(fd,&state->rfds); 67 | if (mask & AE_WRITABLE) FD_CLR(fd,&state->wfds); 68 | } 69 | 70 | static int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) { 71 | aeApiState *state = eventLoop->apidata; 72 | int retval, j, numevents = 0; 73 | 74 | memcpy(&state->_rfds,&state->rfds,sizeof(fd_set)); 75 | memcpy(&state->_wfds,&state->wfds,sizeof(fd_set)); 76 | 77 | retval = select(eventLoop->maxfd+1, 78 | &state->_rfds,&state->_wfds,NULL,tvp); 79 | if (retval > 0) { 80 | for (j = 0; j <= eventLoop->maxfd; j++) { 81 | int mask = 0; 82 | aeFileEvent *fe = &eventLoop->events[j]; 83 | 84 | if (fe->mask == AE_NONE) continue; 85 | if (fe->mask & AE_READABLE && FD_ISSET(j,&state->_rfds)) 86 | mask |= AE_READABLE; 87 | if (fe->mask & AE_WRITABLE && FD_ISSET(j,&state->_wfds)) 88 | mask |= AE_WRITABLE; 89 | eventLoop->fired[numevents].fd = j; 90 | eventLoop->fired[numevents].mask = mask; 91 | numevents++; 92 | } 93 | } 94 | return numevents; 95 | } 96 | 97 | static char *aeApiName(void) { 98 | return "select"; 99 | } 100 | -------------------------------------------------------------------------------- /src/aprintf.c: -------------------------------------------------------------------------------- 1 | // Copyright (C) 2012 - Will Glozer. All rights reserved. 2 | 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | char *aprintf(char **s, const char *fmt, ...) { 9 | char *c = NULL; 10 | int n, len; 11 | va_list ap; 12 | 13 | va_start(ap, fmt); 14 | n = vsnprintf(NULL, 0, fmt, ap) + 1; 15 | va_end(ap); 16 | 17 | len = *s ? strlen(*s) : 0; 18 | 19 | if ((*s = realloc(*s, (len + n) * sizeof(char)))) { 20 | c = *s + len; 21 | va_start(ap, fmt); 22 | vsnprintf(c, n, fmt, ap); 23 | va_end(ap); 24 | } 25 | 26 | return c; 27 | } 28 | -------------------------------------------------------------------------------- /src/aprintf.h: -------------------------------------------------------------------------------- 1 | #ifndef APRINTF_H 2 | #define APRINTF_H 3 | 4 | char *aprintf(char **, const char *, ...); 5 | 6 | #endif /* APRINTF_H */ 7 | -------------------------------------------------------------------------------- /src/config.h: -------------------------------------------------------------------------------- 1 | #ifndef CONFIG_H 2 | #define CONFIG_H 3 | 4 | #if defined(__FreeBSD__) || defined(__APPLE__) 5 | #define HAVE_KQUEUE 6 | #elif defined(__linux__) 7 | #define HAVE_EPOLL 8 | #define _POSIX_C_SOURCE 200809L 9 | #elif defined (__sun) 10 | #define HAVE_EVPORT 11 | #endif 12 | 13 | #endif /* CONFIG_H */ 14 | -------------------------------------------------------------------------------- /src/main.h: -------------------------------------------------------------------------------- 1 | #ifndef MAIN_H 2 | #define MAIN_H 3 | 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | #include 16 | #include 17 | #include 18 | #include 19 | #include 20 | #include 21 | 22 | #include "ssl.h" 23 | #include "aprintf.h" 24 | #include "stats.h" 25 | #include "units.h" 26 | #include "zmalloc.h" 27 | 28 | struct config; 29 | 30 | static void *thread_main(void *); 31 | static int connect_socket(thread *, connection *); 32 | static int reconnect_socket(thread *, connection *); 33 | 34 | static int calibrate(aeEventLoop *, long long, void *); 35 | static int sample_rate(aeEventLoop *, long long, void *); 36 | static int delayed_initial_connect(aeEventLoop *, long long, void *); 37 | static int check_timeouts(aeEventLoop *, long long, void *); 38 | 39 | static void socket_connected(aeEventLoop *, int, void *, int); 40 | static void socket_writeable(aeEventLoop *, int, void *, int); 41 | static void socket_readable(aeEventLoop *, int, void *, int); 42 | 43 | static int response_complete(http_parser *); 44 | static int header_field(http_parser *, const char *, size_t); 45 | static int header_value(http_parser *, const char *, size_t); 46 | static int response_body(http_parser *, const char *, size_t); 47 | 48 | static uint64_t time_us(); 49 | 50 | static int parse_args(struct config *, char **, struct http_parser_url *, char **, int, char **); 51 | static char *copy_url_part(char *, struct http_parser_url *, enum http_parser_url_fields); 52 | static void print_stats_header(); 53 | static void print_stats(char *, stats *, char *(*)(long double)); 54 | static void print_stats_latency(stats *); 55 | static void print_hdr_latency(struct hdr_histogram*, const char*); 56 | 57 | #endif /* MAIN_H */ 58 | -------------------------------------------------------------------------------- /src/net.c: -------------------------------------------------------------------------------- 1 | // Copyright (C) 2013 - Will Glozer. All rights reserved. 2 | 3 | #include 4 | #include 5 | #include 6 | 7 | #include "net.h" 8 | 9 | status sock_connect(connection *c, char *host) { 10 | return OK; 11 | } 12 | 13 | status sock_close(connection *c) { 14 | return OK; 15 | } 16 | 17 | status sock_read(connection *c, size_t *n) { 18 | ssize_t r = read(c->fd, c->buf, sizeof(c->buf)); 19 | *n = (size_t) r; 20 | if (r == 0) return READ_EOF; 21 | return r > 0 ? OK : ERROR; 22 | } 23 | 24 | status sock_write(connection *c, char *buf, size_t len, size_t *n) { 25 | ssize_t r; 26 | if ((r = write(c->fd, buf, len)) == -1) { 27 | switch (errno) { 28 | case EAGAIN: return RETRY; 29 | default: return ERROR; 30 | } 31 | } 32 | *n = (size_t) r; 33 | return OK; 34 | } 35 | 36 | size_t sock_readable(connection *c) { 37 | int n, rc; 38 | rc = ioctl(c->fd, FIONREAD, &n); 39 | return rc == -1 ? 0 : n; 40 | } 41 | -------------------------------------------------------------------------------- /src/net.h: -------------------------------------------------------------------------------- 1 | #ifndef NET_H 2 | #define NET_H 3 | 4 | #include "config.h" 5 | #include 6 | #include 7 | #include "wrk.h" 8 | 9 | typedef enum { 10 | OK, 11 | ERROR, 12 | RETRY, 13 | READ_EOF 14 | } status; 15 | 16 | struct sock { 17 | status ( *connect)(connection *, char *); 18 | status ( *close)(connection *); 19 | status ( *read)(connection *, size_t *); 20 | status ( *write)(connection *, char *, size_t, size_t *); 21 | size_t (*readable)(connection *); 22 | }; 23 | 24 | status sock_connect(connection *, char *); 25 | status sock_close(connection *); 26 | status sock_read(connection *, size_t *); 27 | status sock_write(connection *, char *, size_t, size_t *); 28 | size_t sock_readable(connection *); 29 | 30 | #endif /* NET_H */ 31 | -------------------------------------------------------------------------------- /src/script.h: -------------------------------------------------------------------------------- 1 | #ifndef SCRIPT_H 2 | #define SCRIPT_H 3 | 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include "stats.h" 10 | #include "wrk.h" 11 | 12 | lua_State *script_create(char *, char *, char **); 13 | 14 | bool script_resolve(lua_State *, char *, char *); 15 | void script_setup(lua_State *, thread *); 16 | void script_done(lua_State *, stats *, stats *); 17 | 18 | void script_init(lua_State *, thread *, int, char **); 19 | void script_request(lua_State *, char **, size_t *); 20 | void script_response(lua_State *, int, buffer *, buffer *); 21 | size_t script_verify_request(lua_State *L); 22 | 23 | bool script_is_static(lua_State *); 24 | bool script_want_response(lua_State *L); 25 | bool script_has_done(lua_State *L); 26 | void script_summary(lua_State *, uint64_t, uint64_t, uint64_t); 27 | void script_errors(lua_State *, errors *); 28 | 29 | void script_copy_value(lua_State *, lua_State *, int); 30 | int script_parse_url(char *, struct http_parser_url *); 31 | 32 | void buffer_append(buffer *, const char *, size_t); 33 | void buffer_reset(buffer *); 34 | char *buffer_pushlstring(lua_State *, char *); 35 | 36 | #endif /* SCRIPT_H */ 37 | -------------------------------------------------------------------------------- /src/ssl.c: -------------------------------------------------------------------------------- 1 | // Copyright (C) 2013 - Will Glozer. All rights reserved. 2 | 3 | #include 4 | 5 | #include 6 | #include 7 | #include 8 | 9 | #include "ssl.h" 10 | 11 | static pthread_mutex_t *locks; 12 | 13 | static void ssl_lock(int mode, int n, const char *file, int line) { 14 | pthread_mutex_t *lock = &locks[n]; 15 | if (mode & CRYPTO_LOCK) { 16 | pthread_mutex_lock(lock); 17 | } else { 18 | pthread_mutex_unlock(lock); 19 | } 20 | } 21 | 22 | static unsigned long ssl_id() { 23 | return (unsigned long) pthread_self(); 24 | } 25 | 26 | SSL_CTX *ssl_init() { 27 | SSL_CTX *ctx = NULL; 28 | 29 | SSL_load_error_strings(); 30 | SSL_library_init(); 31 | OpenSSL_add_all_algorithms(); 32 | 33 | if ((locks = calloc(CRYPTO_num_locks(), sizeof(pthread_mutex_t)))) { 34 | for (int i = 0; i < CRYPTO_num_locks(); i++) { 35 | pthread_mutex_init(&locks[i], NULL); 36 | } 37 | 38 | CRYPTO_set_locking_callback(ssl_lock); 39 | CRYPTO_set_id_callback(ssl_id); 40 | 41 | if ((ctx = SSL_CTX_new(SSLv23_client_method()))) { 42 | SSL_CTX_set_verify(ctx, SSL_VERIFY_NONE, NULL); 43 | SSL_CTX_set_verify_depth(ctx, 0); 44 | SSL_CTX_set_mode(ctx, SSL_MODE_AUTO_RETRY); 45 | SSL_CTX_set_session_cache_mode(ctx, SSL_SESS_CACHE_CLIENT); 46 | } 47 | } 48 | 49 | return ctx; 50 | } 51 | 52 | status ssl_connect(connection *c, char *host) { 53 | int r; 54 | SSL_set_fd(c->ssl, c->fd); 55 | SSL_set_tlsext_host_name(c->ssl, host); 56 | if ((r = SSL_connect(c->ssl)) != 1) { 57 | switch (SSL_get_error(c->ssl, r)) { 58 | case SSL_ERROR_WANT_READ: return RETRY; 59 | case SSL_ERROR_WANT_WRITE: return RETRY; 60 | default: return ERROR; 61 | } 62 | } 63 | return OK; 64 | } 65 | 66 | status ssl_close(connection *c) { 67 | SSL_shutdown(c->ssl); 68 | SSL_clear(c->ssl); 69 | return OK; 70 | } 71 | 72 | status ssl_read(connection *c, size_t *n) { 73 | int r; 74 | if ((r = SSL_read(c->ssl, c->buf, sizeof(c->buf))) <= 0) { 75 | switch (SSL_get_error(c->ssl, r)) { 76 | case SSL_ERROR_WANT_READ: return RETRY; 77 | case SSL_ERROR_WANT_WRITE: return RETRY; 78 | default: return ERROR; 79 | } 80 | } 81 | *n = (size_t) r; 82 | return OK; 83 | } 84 | 85 | status ssl_write(connection *c, char *buf, size_t len, size_t *n) { 86 | int r; 87 | if ((r = SSL_write(c->ssl, buf, len)) <= 0) { 88 | switch (SSL_get_error(c->ssl, r)) { 89 | case SSL_ERROR_WANT_READ: return RETRY; 90 | case SSL_ERROR_WANT_WRITE: return RETRY; 91 | default: return ERROR; 92 | } 93 | } 94 | *n = (size_t) r; 95 | return OK; 96 | } 97 | 98 | size_t ssl_readable(connection *c) { 99 | return SSL_pending(c->ssl); 100 | } 101 | -------------------------------------------------------------------------------- /src/ssl.h: -------------------------------------------------------------------------------- 1 | #ifndef SSL_H 2 | #define SSL_H 3 | 4 | #include "net.h" 5 | 6 | SSL_CTX *ssl_init(); 7 | 8 | status ssl_connect(connection *, char *); 9 | status ssl_close(connection *); 10 | status ssl_read(connection *, size_t *); 11 | status ssl_write(connection *, char *, size_t, size_t *); 12 | size_t ssl_readable(connection *); 13 | 14 | #endif /* SSL_H */ 15 | -------------------------------------------------------------------------------- /src/stats.c: -------------------------------------------------------------------------------- 1 | // Copyright (C) 2012 - Will Glozer. All rights reserved. 2 | 3 | #include 4 | #include 5 | #include 6 | 7 | #include "stats.h" 8 | #include "zmalloc.h" 9 | 10 | stats *stats_alloc(uint64_t samples) { 11 | stats *s = zcalloc(sizeof(stats) + sizeof(uint64_t) * samples); 12 | s->samples = samples; 13 | s->min = UINT64_MAX; 14 | s->histogram = NULL; 15 | return s; 16 | } 17 | 18 | void stats_free(stats *stats) { 19 | zfree(stats); 20 | } 21 | 22 | void stats_reset(stats *stats) { 23 | stats->limit = 0; 24 | stats->index = 0; 25 | stats->min = UINT64_MAX; 26 | stats->max = 0; 27 | } 28 | 29 | void stats_rewind(stats *stats) { 30 | stats->limit = 0; 31 | stats->index = 0; 32 | } 33 | 34 | void stats_record(stats *stats, uint64_t x) { 35 | if (x < stats->min) stats->min = x; 36 | if (x > stats->max) stats->max = x; 37 | if (stats->histogram != NULL) { 38 | hdr_record_value(stats->histogram, x); 39 | return; 40 | } 41 | 42 | stats->data[stats->index++] = x; 43 | if (stats->limit < stats->samples) stats->limit++; 44 | if (stats->index == stats->samples) stats->index = 0; 45 | } 46 | 47 | static int stats_compare(const void *a, const void *b) { 48 | uint64_t *x = (uint64_t *) a; 49 | uint64_t *y = (uint64_t *) b; 50 | return *x - *y; 51 | } 52 | 53 | long double stats_summarize(stats *stats) { 54 | qsort(stats->data, stats->limit, sizeof(uint64_t), &stats_compare); 55 | return stats_mean(stats); 56 | } 57 | 58 | long double stats_mean(stats *stats) { 59 | if (stats->histogram != NULL) { 60 | return hdr_mean(stats->histogram); 61 | } 62 | if (stats->limit == 0) return 0.0; 63 | 64 | uint64_t sum = 0; 65 | for (uint64_t i = 0; i < stats->limit; i++) { 66 | sum += stats->data[i]; 67 | } 68 | return sum / (long double) stats->limit; 69 | } 70 | 71 | long double stats_stdev(stats *stats, long double mean) { 72 | if (stats->histogram != NULL) { 73 | return hdr_stddev(stats->histogram); 74 | } 75 | long double sum = 0.0; 76 | if (stats->limit < 2) return 0.0; 77 | for (uint64_t i = 0; i < stats->limit; i++) { 78 | sum += powl(stats->data[i] - mean, 2); 79 | } 80 | return sqrtl(sum / (stats->limit - 1)); 81 | } 82 | 83 | long double stats_within_stdev(stats *stats, long double mean, long double stdev, uint64_t n) { 84 | long double upper = mean + (stdev * n); 85 | long double lower = mean - (stdev * n); 86 | if (stats->histogram != NULL) { 87 | int64_t total_count = stats->histogram->total_count; 88 | if (total_count == 0) { 89 | return 0.0; 90 | } 91 | int64_t upper_value = upper; 92 | int64_t lower_value = lower; 93 | struct hdr_iter iter; 94 | hdr_iter_init(&iter, stats->histogram); 95 | int64_t lower_count = 0; 96 | int64_t upper_count = 0; 97 | bool found_upper = false; 98 | while (hdr_iter_next(&iter)) { 99 | if (lower_value > iter.value_from_index) { 100 | lower_count = iter.count_to_index; 101 | } 102 | if (upper_value < iter.highest_equivalent_value) { 103 | upper_count = iter.count_to_index; 104 | found_upper = true; 105 | break; 106 | } 107 | } 108 | if (!found_upper) { 109 | upper_count = total_count; 110 | } 111 | return 100.0 * (upper_count - lower_count) / (double) total_count; 112 | } 113 | uint64_t sum = 0; 114 | 115 | for (uint64_t i = 0; i < stats->limit; i++) { 116 | uint64_t x = stats->data[i]; 117 | if (x >= lower && x <= upper) sum++; 118 | } 119 | 120 | return (sum / (long double) stats->limit) * 100; 121 | } 122 | 123 | uint64_t stats_percentile(stats *stats, long double p) { 124 | if (stats->histogram != NULL) { 125 | double percentile = p; 126 | int64_t value = hdr_value_at_percentile(stats->histogram, percentile); 127 | return (value < 0) ? 0 : value; 128 | } 129 | uint64_t rank = round((p / 100.0) * stats->limit + 0.5); 130 | return stats->data[rank - 1]; 131 | } 132 | 133 | void stats_sample(stats *dst, tinymt64_t *state, uint64_t count, stats *src) { 134 | for (uint64_t i = 0; i < count; i++) { 135 | uint64_t n = rand64(state, src->limit); 136 | stats_record(dst, src->data[n]); 137 | } 138 | } 139 | 140 | uint64_t rand64(tinymt64_t *state, uint64_t n) { 141 | uint64_t x, max = ~UINT64_C(0); 142 | max -= max % n; 143 | do { 144 | x = tinymt64_generate_uint64(state); 145 | } while (x >= max); 146 | return x % n; 147 | } 148 | -------------------------------------------------------------------------------- /src/stats.h: -------------------------------------------------------------------------------- 1 | #ifndef STATS_H 2 | #define STATS_H 3 | 4 | #include 5 | #include 6 | #include "tinymt64.h" 7 | #include "hdr_histogram.h" 8 | 9 | #define MAX(X, Y) ((X) > (Y) ? (X) : (Y)) 10 | #define MIN(X, Y) ((X) < (Y) ? (X) : (Y)) 11 | 12 | typedef struct { 13 | uint32_t connect; 14 | uint32_t read; 15 | uint32_t write; 16 | uint32_t status; 17 | uint32_t timeout; 18 | } errors; 19 | 20 | typedef struct { 21 | uint64_t samples; 22 | uint64_t index; 23 | uint64_t limit; 24 | uint64_t min; 25 | uint64_t max; 26 | struct hdr_histogram *histogram; 27 | uint64_t data[]; 28 | } stats; 29 | 30 | stats *stats_alloc(uint64_t); 31 | void stats_free(stats *); 32 | void stats_reset(stats *); 33 | void stats_rewind(stats *); 34 | 35 | void stats_record(stats *, uint64_t); 36 | 37 | long double stats_summarize(stats *); 38 | long double stats_mean(stats *); 39 | long double stats_stdev(stats *stats, long double); 40 | long double stats_within_stdev(stats *, long double, long double, uint64_t); 41 | uint64_t stats_percentile(stats *, long double); 42 | 43 | void stats_sample(stats *, tinymt64_t *, uint64_t, stats *); 44 | uint64_t rand64(tinymt64_t *, uint64_t); 45 | 46 | #endif /* STATS_H */ 47 | -------------------------------------------------------------------------------- /src/tinymt64.c: -------------------------------------------------------------------------------- 1 | /** 2 | * @file tinymt64.c 3 | * 4 | * @brief 64-bit Tiny Mersenne Twister only 127 bit internal state 5 | * 6 | * @author Mutsuo Saito (Hiroshima University) 7 | * @author Makoto Matsumoto (The University of Tokyo) 8 | * 9 | * Copyright (C) 2011 Mutsuo Saito, Makoto Matsumoto, 10 | * Hiroshima University and The University of Tokyo. 11 | * All rights reserved. 12 | * 13 | * The 3-clause BSD License is applied to this software, see 14 | * LICENSE.txt 15 | */ 16 | #include "tinymt64.h" 17 | 18 | #define MIN_LOOP 8 19 | 20 | /** 21 | * This function represents a function used in the initialization 22 | * by init_by_array 23 | * @param[in] x 64-bit integer 24 | * @return 64-bit integer 25 | */ 26 | static uint64_t ini_func1(uint64_t x) { 27 | return (x ^ (x >> 59)) * UINT64_C(2173292883993); 28 | } 29 | 30 | /** 31 | * This function represents a function used in the initialization 32 | * by init_by_array 33 | * @param[in] x 64-bit integer 34 | * @return 64-bit integer 35 | */ 36 | static uint64_t ini_func2(uint64_t x) { 37 | return (x ^ (x >> 59)) * UINT64_C(58885565329898161); 38 | } 39 | 40 | /** 41 | * This function certificate the period of 2^127-1. 42 | * @param random tinymt state vector. 43 | */ 44 | static void period_certification(tinymt64_t * random) { 45 | if ((random->status[0] & TINYMT64_MASK) == 0 && 46 | random->status[1] == 0) { 47 | random->status[0] = 'T'; 48 | random->status[1] = 'M'; 49 | } 50 | } 51 | 52 | /** 53 | * This function initializes the internal state array with a 64-bit 54 | * unsigned integer seed. 55 | * @param random tinymt state vector. 56 | * @param seed a 64-bit unsigned integer used as a seed. 57 | */ 58 | void tinymt64_init(tinymt64_t * random, uint64_t seed) { 59 | random->status[0] = seed ^ ((uint64_t)random->mat1 << 32); 60 | random->status[1] = random->mat2 ^ random->tmat; 61 | for (int i = 1; i < MIN_LOOP; i++) { 62 | random->status[i & 1] ^= i + UINT64_C(6364136223846793005) 63 | * (random->status[(i - 1) & 1] 64 | ^ (random->status[(i - 1) & 1] >> 62)); 65 | } 66 | period_certification(random); 67 | } 68 | 69 | /** 70 | * This function initializes the internal state array, 71 | * with an array of 64-bit unsigned integers used as seeds 72 | * @param random tinymt state vector. 73 | * @param init_key the array of 64-bit integers, used as a seed. 74 | * @param key_length the length of init_key. 75 | */ 76 | void tinymt64_init_by_array(tinymt64_t * random, const uint64_t init_key[], 77 | int key_length) { 78 | const int lag = 1; 79 | const int mid = 1; 80 | const int size = 4; 81 | int i, j; 82 | int count; 83 | uint64_t r; 84 | uint64_t st[4]; 85 | 86 | st[0] = 0; 87 | st[1] = random->mat1; 88 | st[2] = random->mat2; 89 | st[3] = random->tmat; 90 | if (key_length + 1 > MIN_LOOP) { 91 | count = key_length + 1; 92 | } else { 93 | count = MIN_LOOP; 94 | } 95 | r = ini_func1(st[0] ^ st[mid % size] 96 | ^ st[(size - 1) % size]); 97 | st[mid % size] += r; 98 | r += key_length; 99 | st[(mid + lag) % size] += r; 100 | st[0] = r; 101 | count--; 102 | for (i = 1, j = 0; (j < count) && (j < key_length); j++) { 103 | r = ini_func1(st[i] ^ st[(i + mid) % size] ^ st[(i + size - 1) % size]); 104 | st[(i + mid) % size] += r; 105 | r += init_key[j] + i; 106 | st[(i + mid + lag) % size] += r; 107 | st[i] = r; 108 | i = (i + 1) % size; 109 | } 110 | for (; j < count; j++) { 111 | r = ini_func1(st[i] ^ st[(i + mid) % size] ^ st[(i + size - 1) % size]); 112 | st[(i + mid) % size] += r; 113 | r += i; 114 | st[(i + mid + lag) % size] += r; 115 | st[i] = r; 116 | i = (i + 1) % size; 117 | } 118 | for (j = 0; j < size; j++) { 119 | r = ini_func2(st[i] + st[(i + mid) % size] + st[(i + size - 1) % size]); 120 | st[(i + mid) % size] ^= r; 121 | r -= i; 122 | st[(i + mid + lag) % size] ^= r; 123 | st[i] = r; 124 | i = (i + 1) % size; 125 | } 126 | random->status[0] = st[0] ^ st[1]; 127 | random->status[1] = st[2] ^ st[3]; 128 | period_certification(random); 129 | } 130 | -------------------------------------------------------------------------------- /src/units.c: -------------------------------------------------------------------------------- 1 | // Copyright (C) 2012 - Will Glozer. All rights reserved. 2 | 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | 10 | #include "units.h" 11 | #include "aprintf.h" 12 | #include "zmalloc.h" 13 | 14 | typedef struct { 15 | int scale; 16 | char *base; 17 | char *units[]; 18 | } units; 19 | 20 | units time_units_us = { 21 | .scale = 1000, 22 | .base = "us", 23 | .units = { "ms", "s", NULL } 24 | }; 25 | 26 | units time_units_s = { 27 | .scale = 60, 28 | .base = "s", 29 | .units = { "m", "h", NULL } 30 | }; 31 | 32 | units binary_units = { 33 | .scale = 1024, 34 | .base = "", 35 | .units = { "K", "M", "G", "T", "P", NULL } 36 | }; 37 | 38 | units metric_units = { 39 | .scale = 1000, 40 | .base = "", 41 | .units = { "k", "M", "G", "T", "P", NULL } 42 | }; 43 | 44 | static char *format_units(long double n, units *m, int p) { 45 | long double amt = n, scale; 46 | char *unit = m->base; 47 | char *msg = NULL; 48 | 49 | scale = m->scale * 0.85; 50 | 51 | for (int i = 0; m->units[i+1] && amt >= scale; i++) { 52 | amt /= m->scale; 53 | unit = m->units[i]; 54 | } 55 | 56 | aprintf(&msg, "%.*Lf%s", p, amt, unit); 57 | 58 | return msg; 59 | } 60 | 61 | static int scan_units(char *s, uint64_t *n, units *m) { 62 | uint64_t base, scale = 1; 63 | char unit[3] = { 0, 0, 0 }; 64 | int i, c; 65 | 66 | if ((c = sscanf(s, "%"SCNu64"%2s", &base, unit)) < 1) return -1; 67 | 68 | if (c == 2 && strncasecmp(unit, m->base, 3)) { 69 | for (i = 0; m->units[i] != NULL; i++) { 70 | scale *= m->scale; 71 | if (!strncasecmp(unit, m->units[i], 3)) break; 72 | } 73 | if (m->units[i] == NULL) return -1; 74 | } 75 | 76 | *n = base * scale; 77 | return 0; 78 | } 79 | 80 | char *format_binary(long double n) { 81 | return format_units(n, &binary_units, 2); 82 | } 83 | 84 | char *format_metric(long double n) { 85 | return format_units(n, &metric_units, 2); 86 | } 87 | 88 | char *format_time_us(long double n) { 89 | units *units = &time_units_us; 90 | if (n >= 1000000.0) { 91 | n /= 1000000.0; 92 | units = &time_units_s; 93 | } 94 | return format_units(n, units, 2); 95 | } 96 | 97 | char *format_time_s(long double n) { 98 | return format_units(n, &time_units_s, 0); 99 | } 100 | 101 | int scan_metric(char *s, uint64_t *n) { 102 | return scan_units(s, n, &metric_units); 103 | } 104 | 105 | int scan_time(char *s, uint64_t *n) { 106 | return scan_units(s, n, &time_units_s); 107 | } 108 | 109 | int scan_affinity(char *s, struct aff_set_head **as_head) { 110 | char *str = strdup(s); 111 | char *token = NULL; 112 | char *saveptr; 113 | struct aff_set_head *head = NULL; 114 | 115 | token = strtok_r(str, ",", &saveptr); 116 | if (token != NULL) { 117 | do { 118 | int val; 119 | struct aff_set *item = NULL; 120 | 121 | errno = 0; 122 | val = (int)strtol(token, NULL, 0); 123 | if (errno != 0) { 124 | free(str); 125 | return -1; 126 | } 127 | 128 | item = zcalloc(sizeof(struct aff_set)); 129 | CPU_ZERO(&item->set); 130 | CPU_SET(val, &item->set); 131 | if (head == NULL) { 132 | head = zmalloc(sizeof(struct aff_set_head)); 133 | STAILQ_INIT(head); 134 | } 135 | STAILQ_INSERT_TAIL(head, item, items); 136 | 137 | token = strtok_r(NULL, ",", &saveptr); 138 | } while (token != NULL); 139 | } 140 | 141 | free(str); 142 | *as_head = head; 143 | return 0; 144 | } 145 | -------------------------------------------------------------------------------- /src/units.h: -------------------------------------------------------------------------------- 1 | #ifndef UNITS_H 2 | #define UNITS_H 3 | 4 | #include 5 | #include 6 | 7 | char *format_binary(long double); 8 | char *format_metric(long double); 9 | char *format_time_us(long double); 10 | char *format_time_s(long double); 11 | 12 | int scan_metric(char *, uint64_t *); 13 | int scan_time(char *, uint64_t *); 14 | 15 | struct aff_set { 16 | cpu_set_t set; 17 | STAILQ_ENTRY(aff_set) items; 18 | }; 19 | 20 | STAILQ_HEAD(aff_set_head, aff_set); 21 | 22 | int scan_affinity(char *, struct aff_set_head **); 23 | 24 | #endif /* UNITS_H */ 25 | -------------------------------------------------------------------------------- /src/wrk.h: -------------------------------------------------------------------------------- 1 | #ifndef WRK_H 2 | #define WRK_H 3 | 4 | #include "config.h" 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | 11 | #include 12 | #include 13 | #include 14 | 15 | #include "stats.h" 16 | #include "ae.h" 17 | #include "http_parser.h" 18 | #include "hdr_histogram.h" 19 | 20 | #define VERSION "4.0.0" 21 | #define RECVBUF 8192 22 | #define SAMPLES 100000000 23 | 24 | #define SOCKET_TIMEOUT_MS 2000 25 | #define CALIBRATE_DELAY_MS 10000 26 | #define TIMEOUT_INTERVAL_MS 2000 27 | 28 | typedef struct { 29 | pthread_t thread; 30 | aeEventLoop *loop; 31 | struct addrinfo *addr; 32 | uint64_t connections; 33 | cpu_set_t *cpu_set; 34 | int interval; 35 | uint64_t stop_at; 36 | uint64_t complete; 37 | uint64_t requests; 38 | uint64_t bytes; 39 | uint64_t start; 40 | double throughput; 41 | uint64_t mean; 42 | struct hdr_histogram *latency_histogram; 43 | struct hdr_histogram *u_latency_histogram; 44 | tinymt64_t rand; 45 | lua_State *L; 46 | errors errors; 47 | struct connection *cs; 48 | } thread; 49 | 50 | typedef struct { 51 | char *buffer; 52 | size_t length; 53 | char *cursor; 54 | } buffer; 55 | 56 | typedef struct connection { 57 | thread *thread; 58 | http_parser parser; 59 | enum { 60 | FIELD, VALUE 61 | } state; 62 | int fd; 63 | SSL *ssl; 64 | double throughput; 65 | double catch_up_throughput; 66 | uint64_t complete; 67 | uint64_t complete_at_last_batch_start; 68 | uint64_t catch_up_start_time; 69 | uint64_t complete_at_catch_up_start; 70 | uint64_t thread_start; 71 | uint64_t start; 72 | char *request; 73 | size_t length; 74 | size_t written; 75 | uint64_t pending; 76 | buffer headers; 77 | buffer body; 78 | char buf[RECVBUF]; 79 | uint64_t actual_latency_start; 80 | bool has_pending; 81 | bool caught_up; 82 | // Internal tracking numbers (used purely for debugging): 83 | uint64_t latest_should_send_time; 84 | uint64_t latest_expected_start; 85 | uint64_t latest_connect; 86 | uint64_t latest_write; 87 | } connection; 88 | 89 | #endif /* WRK_H */ 90 | -------------------------------------------------------------------------------- /src/wrk.lua: -------------------------------------------------------------------------------- 1 | local wrk = { 2 | scheme = "http", 3 | host = "localhost", 4 | port = nil, 5 | method = "GET", 6 | path = "/", 7 | headers = {}, 8 | body = nil, 9 | thread = nil, 10 | } 11 | 12 | function wrk.resolve(host, service) 13 | local addrs = wrk.lookup(host, service) 14 | for i = #addrs, 1, -1 do 15 | if not wrk.connect(addrs[i]) then 16 | table.remove(addrs, i) 17 | end 18 | end 19 | wrk.addrs = addrs 20 | end 21 | 22 | function wrk.setup(thread) 23 | thread.addr = wrk.addrs[1] 24 | if type(setup) == "function" then 25 | setup(thread) 26 | end 27 | end 28 | 29 | function wrk.init(args) 30 | if not wrk.headers["Host"] then 31 | local host = wrk.host 32 | local port = wrk.port 33 | 34 | host = host:find(":") and ("[" .. host .. "]") or host 35 | host = port and (host .. ":" .. port) or host 36 | 37 | wrk.headers["Host"] = host 38 | end 39 | 40 | if type(init) == "function" then 41 | init(args) 42 | end 43 | 44 | local req = wrk.format() 45 | wrk.request = function() 46 | return req 47 | end 48 | end 49 | 50 | function wrk.format(method, path, headers, body) 51 | local method = method or wrk.method 52 | local path = path or wrk.path 53 | local headers = headers or wrk.headers 54 | local body = body or wrk.body 55 | local s = {} 56 | 57 | if not headers["Host"] then 58 | headers["Host"] = wrk.headers["Host"] 59 | end 60 | 61 | headers["Content-Length"] = body and string.len(body) 62 | 63 | s[1] = string.format("%s %s HTTP/1.1", method, path) 64 | for name, value in pairs(headers) do 65 | s[#s+1] = string.format("%s: %s", name, value) 66 | end 67 | 68 | s[#s+1] = "" 69 | s[#s+1] = body or "" 70 | 71 | return table.concat(s, "\r\n") 72 | end 73 | 74 | return wrk 75 | -------------------------------------------------------------------------------- /src/zmalloc.h: -------------------------------------------------------------------------------- 1 | /* zmalloc - total amount of allocated memory aware version of malloc() 2 | * 3 | * Copyright (c) 2009-2010, Salvatore Sanfilippo 4 | * All rights reserved. 5 | * 6 | * Redistribution and use in source and binary forms, with or without 7 | * modification, are permitted provided that the following conditions are met: 8 | * 9 | * * Redistributions of source code must retain the above copyright notice, 10 | * this list of conditions and the following disclaimer. 11 | * * Redistributions in binary form must reproduce the above copyright 12 | * notice, this list of conditions and the following disclaimer in the 13 | * documentation and/or other materials provided with the distribution. 14 | * * Neither the name of Redis nor the names of its contributors may be used 15 | * to endorse or promote products derived from this software without 16 | * specific prior written permission. 17 | * 18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 19 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 20 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 22 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 23 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 24 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 25 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 26 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 27 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 28 | * POSSIBILITY OF SUCH DAMAGE. 29 | */ 30 | 31 | #ifndef __ZMALLOC_H 32 | #define __ZMALLOC_H 33 | 34 | /* Double expansion needed for stringification of macro values. */ 35 | #define __xstr(s) __str(s) 36 | #define __str(s) #s 37 | 38 | #if defined(USE_TCMALLOC) 39 | #define ZMALLOC_LIB ("tcmalloc-" __xstr(TC_VERSION_MAJOR) "." __xstr(TC_VERSION_MINOR)) 40 | #include 41 | #if TC_VERSION_MAJOR >= 1 && TC_VERSION_MINOR >= 6 42 | #define HAVE_MALLOC_SIZE 1 43 | #define zmalloc_size(p) tc_malloc_size(p) 44 | #else 45 | #error "Newer version of tcmalloc required" 46 | #endif 47 | 48 | #elif defined(USE_JEMALLOC) 49 | #define ZMALLOC_LIB ("jemalloc-" __xstr(JEMALLOC_VERSION_MAJOR) "." __xstr(JEMALLOC_VERSION_MINOR) "." __xstr(JEMALLOC_VERSION_BUGFIX)) 50 | #define JEMALLOC_MANGLE 51 | #include 52 | #if JEMALLOC_VERSION_MAJOR >= 2 && JEMALLOC_VERSION_MINOR >= 1 53 | #define HAVE_MALLOC_SIZE 1 54 | #define zmalloc_size(p) JEMALLOC_P(malloc_usable_size)(p) 55 | #else 56 | #error "Newer version of jemalloc required" 57 | #endif 58 | 59 | #elif defined(__APPLE__) 60 | #include 61 | #define HAVE_MALLOC_SIZE 1 62 | #define zmalloc_size(p) malloc_size(p) 63 | #endif 64 | 65 | #ifndef ZMALLOC_LIB 66 | #define ZMALLOC_LIB "libc" 67 | #endif 68 | 69 | void *zmalloc(size_t size); 70 | void *zcalloc(size_t size); 71 | void *zrealloc(void *ptr, size_t size); 72 | void zfree(void *ptr); 73 | char *zstrdup(const char *s); 74 | size_t zmalloc_used_memory(void); 75 | void zmalloc_enable_thread_safeness(void); 76 | float zmalloc_get_fragmentation_ratio(void); 77 | size_t zmalloc_get_rss(void); 78 | 79 | #ifndef HAVE_MALLOC_SIZE 80 | size_t zmalloc_size(void *ptr); 81 | #endif 82 | 83 | #endif /* __ZMALLOC_H */ 84 | --------------------------------------------------------------------------------