├── .gitignore ├── COPYRIGHT ├── Makefile ├── README ├── README.md ├── doc ├── bluequad-print.css ├── bluequad.css ├── contact.html ├── ext_buffer.html ├── ext_c_api.html ├── ext_ffi.html ├── ext_ffi_api.html ├── ext_ffi_semantics.html ├── ext_ffi_tutorial.html ├── ext_jit.html ├── ext_profiler.html ├── extensions.html ├── faq.html ├── img │ └── contact.png ├── install.html ├── luajit.html ├── running.html └── status.html ├── dynasm ├── dasm_arm.h ├── dasm_arm.lua ├── dasm_arm64.h ├── dasm_arm64.lua ├── dasm_mips.h ├── dasm_mips.lua ├── dasm_mips64.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 ├── .gitignore ├── Makefile ├── Makefile.dep ├── compat53 ├── math.lua └── utf8.lua ├── compat54 └── utf8.lua ├── host ├── .gitignore ├── README ├── buildvm.c ├── buildvm.h ├── buildvm_asm.c ├── buildvm_fold.c ├── buildvm_lib.c ├── buildvm_libbc.h ├── buildvm_peobj.c ├── genlibbc.lua ├── genminilua.lua └── minilua.c ├── jit ├── .gitignore ├── bc.lua ├── bcsave.lua ├── dis_arm.lua ├── dis_arm64.lua ├── dis_arm64be.lua ├── dis_mips.lua ├── dis_mips64.lua ├── dis_mips64el.lua ├── dis_mips64r6.lua ├── dis_mips64r6el.lua ├── dis_mipsel.lua ├── dis_ppc.lua ├── dis_x64.lua ├── dis_x86.lua ├── dump.lua ├── p.lua ├── v.lua └── zone.lua ├── lauxlib.h ├── lib_aux.c ├── lib_base.c ├── lib_bit.c ├── lib_buffer.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_alloc.c ├── lj_alloc.h ├── lj_api.c ├── lj_arch.h ├── lj_asm.c ├── lj_asm.h ├── lj_asm_arm.h ├── lj_asm_arm64.h ├── lj_asm_mips.h ├── lj_asm_ppc.h ├── lj_asm_x86.h ├── lj_assert.c ├── lj_bc.c ├── lj_bc.h ├── lj_bcdump.h ├── lj_bcread.c ├── lj_bcwrite.c ├── lj_buf.c ├── lj_buf.h ├── 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_arm64.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_prng.c ├── lj_prng.h ├── lj_profile.c ├── lj_profile.h ├── lj_record.c ├── lj_record.h ├── lj_serialize.c ├── lj_serialize.h ├── lj_snap.c ├── lj_snap.h ├── lj_state.c ├── lj_state.h ├── lj_str.c ├── lj_str.h ├── lj_strfmt.c ├── lj_strfmt.h ├── lj_strfmt_num.c ├── lj_strscan.c ├── lj_strscan.h ├── lj_tab.c ├── lj_tab.h ├── lj_target.h ├── lj_target_arm.h ├── lj_target_arm64.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 ├── nxbuild.bat ├── ps4build.bat ├── ps5build.bat ├── psvitabuild.bat ├── vm_arm.dasc ├── vm_arm64.dasc ├── vm_mips.dasc ├── vm_mips64.dasc ├── vm_ppc.dasc ├── vm_x64.dasc ├── vm_x86.dasc ├── xb1build.bat └── xedkbuild.bat /.gitignore: -------------------------------------------------------------------------------- 1 | *.[oa] 2 | *.so 3 | *.obj 4 | *.lib 5 | *.exp 6 | *.dll 7 | *.exe 8 | *.manifest 9 | *.dmp 10 | *.swp 11 | .tags 12 | -------------------------------------------------------------------------------- /COPYRIGHT: -------------------------------------------------------------------------------- 1 | =============================================================================== 2 | LuaJIT -- a Just-In-Time Compiler for Lua. https://luajit.org/ 3 | 4 | Copyright (C) 2005-2022 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: https://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 | https://creativecommons.org/licenses/publicdomain 55 | 56 | =============================================================================== 57 | -------------------------------------------------------------------------------- /README: -------------------------------------------------------------------------------- 1 | README for LuaJIT 2.1.0-beta3 2 | ----------------------------- 3 | 4 | LuaJIT is a Just-In-Time (JIT) compiler for the Lua programming language. 5 | 6 | Project Homepage: https://luajit.org/ 7 | 8 | LuaJIT is Copyright (C) 2005-2022 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 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | 2 | # my *tiny* LuaJIT 2.1 fork 3 | 4 | ## Overview 5 | 6 | I've worked in order to fill the compatibility gap between LuaJIT 2.1 and Lua 5.2/5.3/5.4. 7 | 8 | Some of my Pull Requests were merged upstream by Mike Pall. 9 | 10 | My unmerged work is available in the branch `tiny_fork` on . 11 | It contains: 12 | 13 | - [PR#269](https://github.com/LuaJIT/LuaJIT/pull/269) : backport string.\*pack\* from 5.3 14 | - [PR#327](https://github.com/LuaJIT/LuaJIT/pull/327) : backport lua\_rawlen, lua\_len & luaL\_len from 5.2 15 | - [PR#364](https://github.com/LuaJIT/LuaJIT/pull/364) : patterns better compatibility with 5.2 ('\0' in pattern) 16 | - optional `utf8` modules (5.3 & 5.4 variants) (rework of [PR#270](https://github.com/LuaJIT/LuaJIT/pull/270)) 17 | - an optional `math` integer module (rework of [PR#313](https://github.com/LuaJIT/LuaJIT/pull/313)) 18 | 19 | ## Pull Requests 20 | 21 | - [PR#265](https://github.com/LuaJIT/LuaJIT/pull/265) : backport package.searchers from 5.2 22 | 23 | status : Merged in v2.1.0-beta3 24 | 25 | - [PR#266](https://github.com/LuaJIT/LuaJIT/pull/266) : io:read compat with 5.3 26 | 27 | status : Merged in v2.1.0-beta3 28 | 29 | - [PR#267](https://github.com/LuaJIT/LuaJIT/pull/267) : backport table.move from 5.3 30 | 31 | status : Merged in v2.1.0-beta3 (fully reworked by Mike Pall) 32 | 33 | - [PR#268](https://github.com/LuaJIT/LuaJIT/pull/268) : backport coroutine.isyieldable from 5.3 34 | 35 | status : Merged in v2.1.0-beta3 36 | 37 | - [PR#269](https://github.com/LuaJIT/LuaJIT/pull/269) : backport string.\*pack\* from 5.3 38 | 39 | status : Rejected / Included in my fork 40 | 41 | - [PR#270](https://github.com/LuaJIT/LuaJIT/pull/270) : backport utf8 library from 5.3 42 | 43 | status : Rejected / Reworked in my fork as optional Lua modules (5.3 & 5.4 variants) 44 | 45 | - [PR#273](https://github.com/LuaJIT/LuaJIT/pull/273) : refactor table.maxn with LJLIB_LUA 46 | 47 | status : Rejected 48 | 49 | - [PR#302](https://github.com/LuaJIT/LuaJIT/pull/302) : remove compatibility with Lua 5.0 50 | 51 | status : Merged in v2.1.0-beta3 52 | 53 | - [PR#307](https://github.com/LuaJIT/LuaJIT/pull/307) : remove old compatibility macros 54 | 55 | status : Merged in v2.1.0-beta3 56 | 57 | - [PR#309](https://github.com/LuaJIT/LuaJIT/pull/309) : package/module better compatibility with Lua 5.2 58 | 59 | status : Merged in v2.1.0-beta3 60 | 61 | - [PR#312](https://github.com/LuaJIT/LuaJIT/pull/312) : backport operators from 5.3 62 | 63 | status : Pending (huge change, break bytecode compatibility, waiting for v2.2) 64 | 65 | - [PR#313](https://github.com/LuaJIT/LuaJIT/pull/313) : backport math.type and math.tointeger from 5.3 66 | 67 | status : Rejected (incompatible numeric model) / Reworked in my fork as an optional Lua module 68 | 69 | - [PR#314](https://github.com/LuaJIT/LuaJIT/pull/314) : backport some C/API from 5.2/5.3 70 | 71 | status : Merged in v2.1.0-beta3 72 | 73 | - [PR#315](https://github.com/LuaJIT/LuaJIT/pull/315) : extract lib\_coro from lib\_base 74 | 75 | status : Rejected (break binary compatibility) 76 | 77 | - [PR#317](https://github.com/LuaJIT/LuaJIT/pull/317) : add 5.3 operators as syntax sugar 78 | 79 | status : Bugged / needs some rework 80 | 81 | - [PR#327](https://github.com/LuaJIT/LuaJIT/pull/327) : backport lua\_rawlen, lua\_len & luaL\_len from 5.2 82 | 83 | status : Pending / Included in my fork 84 | 85 | - [PR#364](https://github.com/LuaJIT/LuaJIT/pull/364) : patterns better compatibility with 5.2 ('\0' in pattern) 86 | 87 | status : Pending / Included in my fork 88 | 89 | - [PR#404](https://github.com/LuaJIT/LuaJIT/pull/404) : add luaJIT_compat52 symbol 90 | 91 | status : Pending (no feedback) 92 | 93 | - [PR#423](https://github.com/LuaJIT/LuaJIT/pull/423) : allow assert to take a table object as error 94 | 95 | status : Merged in v2.1.0-??? (fully reworked by Mike Pall) 96 | 97 | - [PR#525](https://github.com/LuaJIT/LuaJIT/pull/525) : backport more C/API from 5.2/5.4 98 | 99 | status : Pending (no feedback) 100 | 101 | - [PR#590](https://github.com/LuaJIT/LuaJIT/pull/590) : backport warning system from 5.4 102 | 103 | status : Rejected 104 | 105 | - [PR#591](https://github.com/LuaJIT/LuaJIT/pull/591) : backport 31bits utf8 from lexico 5.4 106 | 107 | status : Rejected 108 | 109 | ## Build / Install Instructions 110 | 111 | From source, like with LuaJIT, see . 112 | 113 | Note: [hererocks](https://github.com/luarocks/hererocks) could be used like this : 114 | 115 | ``` 116 | $ hererocks somewhere --luajit https://github.com/fperrad/LuaJIT.git@tiny_fork --compat 5.2 117 | ``` 118 | 119 | ## Usage and Limitations 120 | 121 | The optional `utf8` module must be explicitly loaded by: 122 | ```lua 123 | utf8 = require'compat53.utf8' 124 | ``` 125 | or 126 | ```lua 127 | utf8 = require'compat54.utf8' 128 | ``` 129 | 130 | After `require'compat53.math'`, the following functions and numbers are added in the `math` module: 131 | - `math.maxinteger` 132 | - `math.mininteger` 133 | - `math.tointeger (n)` 134 | - `math.type (n)` 135 | - `math.ult (m, n)` 136 | 137 | LuaJIT uses the same numeric type model as Lua 5.1 which is incompatible with Lua 5.3. 138 | As a result, these functions work only in the range [-2^53, 2^53]. 139 | `math.maxinteger` and `math.mininteger` thus give the limits of this range. 140 | 141 | ## TODO 142 | 143 | - Fix [PR#317](https://github.com/LuaJIT/LuaJIT/pull/317) : add 5.3 operators as syntax sugar 144 | -------------------------------------------------------------------------------- /doc/bluequad-print.css: -------------------------------------------------------------------------------- 1 | /* Copyright (C) 2004-2022 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 | -------------------------------------------------------------------------------- /doc/contact.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | Contact 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | Lua 14 |
15 | 18 | 56 |
57 |

58 | If you want to report bugs, propose fixes or suggest enhancements, 59 | please use the 60 | » GitHub issue tracker. 61 |

62 |

63 | Please send general questions to the 64 | » LuaJIT mailing list. 65 |

66 |

67 | You can also send any questions you have directly to me: 68 |

69 | 70 | 78 | 82 | 86 | 87 |

88 | Note: I cannot reply to GMail, Google Workplace, Outlook or Office365 89 | mail addresses, since they prefer to mindlessly filter out mails sent 90 | from small domains using independent mail servers, such as mine. If you 91 | don't like that, please complain to Google or Microsoft, not me. 92 |

93 | 94 |

Copyright

95 |

96 | All documentation is 97 | Copyright © 2005-2022 Mike Pall. 98 |

99 | 100 | 101 |
102 |
103 | 111 | 112 | 113 | -------------------------------------------------------------------------------- /doc/ext_c_api.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | Lua/C API Extensions 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | Lua 14 |
15 | 18 | 56 |
57 |

58 | LuaJIT adds some extensions to the standard Lua/C API. The LuaJIT include 59 | directory must be in the compiler search path (-Ipath) 60 | to be able to include the required header for C code: 61 |

62 | 
 63 | #include "luajit.h"
 64 |
65 |

66 | Or for C++ code: 67 |

68 | 
 69 | #include "lua.hpp"
 70 |
71 | 72 |

luaJIT_setmode(L, idx, mode) 73 | — Control VM

74 |

75 | This is a C API extension to allow control of the VM from C code. The 76 | full prototype of LuaJIT_setmode is: 77 |

78 | 
 79 | LUA_API int luaJIT_setmode(lua_State *L, int idx, int mode);
 80 |
81 |

82 | The returned status is either success (1) or failure (0). 83 | The second argument is either 0 or a stack index (similar to the 84 | other Lua/C API functions). 85 |

86 |

87 | The third argument specifies the mode, which is 'or'ed with a flag. 88 | The flag can be LUAJIT_MODE_OFF to turn a feature off, 89 | LUAJIT_MODE_ON to turn a feature on, or 90 | LUAJIT_MODE_FLUSH to flush cached code. 91 |

92 |

93 | The following modes are defined: 94 |

95 | 96 |

luaJIT_setmode(L, 0, LUAJIT_MODE_ENGINE|flag)

97 |

98 | Turn the whole JIT compiler on or off or flush the whole cache of compiled code. 99 |

100 | 101 |

luaJIT_setmode(L, idx, LUAJIT_MODE_FUNC|flag)
102 | luaJIT_setmode(L, idx, LUAJIT_MODE_ALLFUNC|flag)
103 | luaJIT_setmode(L, idx, LUAJIT_MODE_ALLSUBFUNC|flag)

104 |

105 | This sets the mode for the function at the stack index idx or 106 | the parent of the calling function (idx = 0). It either 107 | enables JIT compilation for a function, disables it and flushes any 108 | already compiled code, or only flushes already compiled code. This 109 | applies recursively to all sub-functions of the function with 110 | LUAJIT_MODE_ALLFUNC or only to the sub-functions with 111 | LUAJIT_MODE_ALLSUBFUNC. 112 |

113 | 114 |

luaJIT_setmode(L, trace,
115 |   LUAJIT_MODE_TRACE|LUAJIT_MODE_FLUSH)

116 |

117 | Flushes the specified root trace and all of its side traces from the cache. 118 | The code for the trace will be retained as long as there are any other 119 | traces which link to it. 120 |

121 | 122 |

luaJIT_setmode(L, idx, LUAJIT_MODE_WRAPCFUNC|flag)

123 |

124 | This mode defines a wrapper function for calls to C functions. If 125 | called with LUAJIT_MODE_ON, the stack index at idx 126 | must be a lightuserdata object holding a pointer to the wrapper 127 | function. From now on, all C functions are called through the wrapper 128 | function. If called with LUAJIT_MODE_OFF this mode is turned 129 | off and all C functions are directly called. 130 |

131 |

132 | The wrapper function can be used for debugging purposes or to catch 133 | and convert foreign exceptions. But please read the section on 134 | C++ exception interoperability 135 | first. Recommended usage can be seen in this C++ code excerpt: 136 |

137 | 
138 | #include <exception>
139 | #include "lua.hpp"
140 | 
141 | // Catch C++ exceptions and convert them to Lua error messages.
142 | // Customize as needed for your own exception classes.
143 | static int wrap_exceptions(lua_State *L, lua_CFunction f)
144 | {
145 |   try {
146 |     return f(L);  // Call wrapped function and return result.
147 |   } catch (const char *s) {  // Catch and convert exceptions.
148 |     lua_pushstring(L, s);
149 |   } catch (std::exception& e) {
150 |     lua_pushstring(L, e.what());
151 |   } catch (...) {
152 |     lua_pushliteral(L, "caught (...)");
153 |   }
154 |   return lua_error(L);  // Rethrow as a Lua error.
155 | }
156 | 
157 | static int myinit(lua_State *L)
158 | {
159 |   ...
160 |   // Define wrapper function and enable it.
161 |   lua_pushlightuserdata(L, (void *)wrap_exceptions);
162 |   luaJIT_setmode(L, -1, LUAJIT_MODE_WRAPCFUNC|LUAJIT_MODE_ON);
163 |   lua_pop(L, 1);
164 |   ...
165 | }
166 |
167 |

168 | Note that you can only define a single global wrapper function, 169 | so be careful when using this mechanism from multiple C++ modules. 170 | Also note that this mechanism is not without overhead. 171 |

172 |
173 |
174 | 182 | 183 | 184 | -------------------------------------------------------------------------------- /doc/ext_jit.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | jit.* Library 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | Lua 14 |
15 | 18 | 56 |
57 |

58 | The functions in this built-in module control the behavior of the JIT 59 | compiler engine. Note that JIT-compilation is fully automatic — 60 | you probably won't need to use any of the following functions unless 61 | you have special needs. 62 |

63 | 64 |

jit.on()
65 | jit.off()

66 |

67 | Turns the whole JIT compiler on (default) or off. 68 |

69 |

70 | These functions are typically used with the command line options 71 | -j on or -j off. 72 |

73 | 74 |

jit.flush()

75 |

76 | Flushes the whole cache of compiled code. 77 |

78 | 79 |

jit.on(func|true [,true|false])
80 | jit.off(func|true [,true|false])
81 | jit.flush(func|true [,true|false])

82 |

83 | jit.on enables JIT compilation for a Lua function (this is 84 | the default). 85 |

86 |

87 | jit.off disables JIT compilation for a Lua function and 88 | flushes any already compiled code from the code cache. 89 |

90 |

91 | jit.flush flushes the code, but doesn't affect the 92 | enable/disable status. 93 |

94 |

95 | The current function, i.e. the Lua function calling this library 96 | function, can also be specified by passing true as the first 97 | argument. 98 |

99 |

100 | If the second argument is true, JIT compilation is also 101 | enabled, disabled or flushed recursively for all sub-functions of a 102 | function. With false only the sub-functions are affected. 103 |

104 |

105 | The jit.on and jit.off functions only set a flag 106 | which is checked when the function is about to be compiled. They do 107 | not trigger immediate compilation. 108 |

109 |

110 | Typical usage is jit.off(true, true) in the main chunk 111 | of a module to turn off JIT compilation for the whole module for 112 | debugging purposes. 113 |

114 | 115 |

jit.flush(tr)

116 |

117 | Flushes the root trace, specified by its number, and all of its side 118 | traces from the cache. The code for the trace will be retained as long 119 | as there are any other traces which link to it. 120 |

121 | 122 |

status, ... = jit.status()

123 |

124 | Returns the current status of the JIT compiler. The first result is 125 | either true or false if the JIT compiler is turned 126 | on or off. The remaining results are strings for CPU-specific features 127 | and enabled optimizations. 128 |

129 | 130 |

jit.version

131 |

132 | Contains the LuaJIT version string. 133 |

134 | 135 |

jit.version_num

136 |

137 | Contains the version number of the LuaJIT core. Version xx.yy.zz 138 | is represented by the decimal number xxyyzz. 139 |

140 | 141 |

jit.os

142 |

143 | Contains the target OS name: 144 | "Windows", "Linux", "OSX", "BSD", "POSIX" or "Other". 145 |

146 | 147 |

jit.arch

148 |

149 | Contains the target architecture name: 150 | "x86", "x64", "arm", "arm64", "arm64be", "ppc", "mips", "mipsel", "mips64", "mips64el", "mips64r6", "mips64r6el". 151 |

152 | 153 |

jit.opt.* — JIT compiler optimization control

154 |

155 | This submodule provides the backend for the -O command line 156 | option. 157 |

158 |

159 | You can also use it programmatically, e.g.: 160 |

161 | 
162 | jit.opt.start(2) -- same as -O2
163 | jit.opt.start("-dce")
164 | jit.opt.start("hotloop=10", "hotexit=2")
165 |
166 |

167 | Unlike in LuaJIT 1.x, the module is built-in and 168 | optimization is turned on by default! 169 | It's no longer necessary to run require("jit.opt").start(), 170 | which was one of the ways to enable optimization. 171 |

172 | 173 |

jit.util.* — JIT compiler introspection

174 |

175 | This submodule holds functions to introspect the bytecode, generated 176 | traces, the IR and the generated machine code. The functionality 177 | provided by this module is still in flux and therefore undocumented. 178 |

179 |

180 | The debug modules -jbc, -jv and -jdump make 181 | extensive use of these functions. Please check out their source code, 182 | if you want to know more. 183 |

184 |
185 |
186 | 194 | 195 | 196 | -------------------------------------------------------------------------------- /doc/img/contact.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/fperrad/LuaJIT/bfd8bd07f26410d229f01b01d6d117f005fcc9e0/doc/img/contact.png -------------------------------------------------------------------------------- /doc/status.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | Status 5 | 6 | 7 | 8 | 9 | 10 | 13 | 14 | 15 |
16 | Lua 17 |
18 | 21 | 59 |
60 |

61 | This documentation is for LuaJIT 2.1.0-beta3. Please check the doc 62 | directory in each git branch for the version-specific documentation. 63 |

64 |

65 | The currently developed branches are LuaJIT 2.1 and LuaJIT 2.0. 66 |

67 |

68 | LuaJIT 2.0 is in feature-freeze — new features will only 69 | be added to LuaJIT 2.1. 70 |

71 | 72 |

Current Status

73 |

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

78 |

79 | Known incompatibilities and issues in LuaJIT 2.0: 80 |

81 |
    82 |
  • 83 | There are some differences in implementation-defined behavior. 84 | These either have a good reason, are arbitrary design choices, 85 | or are due to quirks in the VM. The latter cases may get fixed if a 86 | demonstrable need is shown. 87 |
    • 88 |
  • 89 | The Lua debug API is missing a couple of features (return 90 | hooks for non-Lua functions) and shows slightly different behavior 91 | in LuaJIT (no per-coroutine hooks, no tail call counting). 92 |
    • 93 |
94 |
95 |
96 | 104 | 105 | 106 | -------------------------------------------------------------------------------- /dynasm/dasm_mips64.lua: -------------------------------------------------------------------------------- 1 | ------------------------------------------------------------------------------ 2 | -- DynASM MIPS64 module. 3 | -- 4 | -- Copyright (C) 2005-2022 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 MIPS/MIPS64 module. 8 | -- All the interesting stuff is there. 9 | ------------------------------------------------------------------------------ 10 | 11 | mips64 = true -- Using a global is an ugly, but effective solution. 12 | return require("dasm_mips") 13 | -------------------------------------------------------------------------------- /dynasm/dasm_proto.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** DynASM encoding engine prototypes. 3 | ** Copyright (C) 2005-2022 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.5.0" 14 | #define DASM_VERSION 10500 /* 1.5.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 | -------------------------------------------------------------------------------- /dynasm/dasm_x64.lua: -------------------------------------------------------------------------------- 1 | ------------------------------------------------------------------------------ 2 | -- DynASM x64 module. 3 | -- 4 | -- Copyright (C) 2005-2022 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 | -------------------------------------------------------------------------------- /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 https://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-2022 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 https://luajit.org 84 | .br 85 | More about the Lua language can be found at: 86 | .IR https://lua.org/docs.html 87 | .PP 88 | lua(1) 89 | -------------------------------------------------------------------------------- /etc/luajit.pc: -------------------------------------------------------------------------------- 1 | # Package information for LuaJIT to be used by pkg-config. 2 | majver=2 3 | minver=1 4 | relver=0 5 | version=${majver}.${minver}.${relver}-beta3 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: https://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 | -------------------------------------------------------------------------------- /src/.gitignore: -------------------------------------------------------------------------------- 1 | luajit 2 | lj_bcdef.h 3 | lj_ffdef.h 4 | lj_libdef.h 5 | lj_recdef.h 6 | lj_folddef.h 7 | lj_vm.[sS] 8 | -------------------------------------------------------------------------------- /src/compat53/math.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- math integer library. 3 | -- 4 | -- Copyright (C) 2019 Francois Perrad 5 | -- 6 | -- This library is licensed under the terms of the MIT/X11 license, 7 | -- like LuaJIT itself. 8 | ---------------------------------------------------------------------------- 9 | 10 | local error, type = error, type 11 | local math = math 12 | 13 | math.maxinteger = 9007199254740992 -- 2^53 14 | math.mininteger = -9007199254740992 15 | 16 | function math.tointeger (n) 17 | if type(n) == 'number' and n <= 9007199254740992 and n >= -9007199254740992 and n % 1 == 0 then 18 | return n 19 | end 20 | return nil 21 | end 22 | 23 | function math.type (n) 24 | if type(n) == 'number' then 25 | if n <= 9007199254740992 and n >= -9007199254740992 and n % 1 == 0 then 26 | return 'integer' 27 | else 28 | return 'float' 29 | end 30 | else 31 | return nil 32 | end 33 | end 34 | 35 | function math.ult (m, n) 36 | local t = type(m) 37 | if t ~= 'number' then 38 | error("bad argument #1 to 'ult' (number expected, got " .. t .. ")", 2) 39 | end 40 | if m > 9007199254740992 or m < -9007199254740992 or m % 1 ~= 0 then 41 | error("bad argument #1 to 'ult' (number has no integer representation)", 2) 42 | end 43 | t = type(n) 44 | if t ~= 'number' then 45 | error("bad argument #2 to 'ult' (number expected, got " .. t .. ")", 2) 46 | end 47 | if n > 9007199254740992 or n < -9007199254740992 or n % 1 ~= 0 then 48 | error("bad argument #2 to 'ult' (number has no integer representation)", 2) 49 | end 50 | if m >= 0 and n < 0 then 51 | return true 52 | elseif m < 0 and n >= 0 then 53 | return false 54 | else 55 | return m < n 56 | end 57 | end 58 | -------------------------------------------------------------------------------- /src/host/.gitignore: -------------------------------------------------------------------------------- 1 | minilua 2 | buildvm 3 | buildvm_arch.h 4 | -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /src/host/buildvm.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** LuaJIT VM builder. 3 | ** Copyright (C) 2005-2022 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 *const *extnames; 86 | const char *dasm_ident; 87 | const char *dasm_arch; 88 | /* Relocations. */ 89 | BuildReloc reloc[BUILD_MAX_RELOC]; 90 | } BuildCtx; 91 | 92 | extern void owrite(BuildCtx *ctx, const void *ptr, size_t sz); 93 | extern void emit_asm(BuildCtx *ctx); 94 | extern void emit_peobj(BuildCtx *ctx); 95 | extern void emit_lib(BuildCtx *ctx); 96 | extern void emit_fold(BuildCtx *ctx); 97 | 98 | extern const char *const bc_names[]; 99 | extern const char *const ir_names[]; 100 | extern const char *const irt_names[]; 101 | extern const char *const irfpm_names[]; 102 | extern const char *const irfield_names[]; 103 | extern const char *const ircall_names[]; 104 | 105 | #endif 106 | -------------------------------------------------------------------------------- /src/host/buildvm_libbc.h: -------------------------------------------------------------------------------- 1 | /* This is a generated file. DO NOT EDIT! */ 2 | 3 | static const int libbc_endian = 0; 4 | 5 | static const uint8_t libbc_code[] = { 6 | #if LJ_FR2 7 | /* math.deg */ 0,1,2,0,0,1,2,BC_MULVN,1,0,0,BC_RET1,1,2,0,241,135,158,166,3, 8 | 220,203,178,130,4, 9 | /* math.rad */ 0,1,2,0,0,1,2,BC_MULVN,1,0,0,BC_RET1,1,2,0,243,244,148,165,20, 10 | 198,190,199,252,3, 11 | /* string.len */ 0,1,2,0,0,0,3,BC_ISTYPE,0,5,0,BC_LEN,1,0,0,BC_RET1,1,2,0, 12 | /* table.foreachi */ 0,2,10,0,0,0,15,BC_ISTYPE,0,12,0,BC_ISTYPE,1,9,0, 13 | BC_KSHORT,2,1,0,BC_LEN,3,0,0,BC_KSHORT,4,1,0,BC_FORI,2,8,128,BC_MOV,6,1,0, 14 | BC_MOV,8,5,0,BC_TGETR,9,5,0,BC_CALL,6,3,2,BC_ISEQP,6,0,0,BC_JMP,7,1,128, 15 | BC_RET1,6,2,0,BC_FORL,2,248,127,BC_RET0,0,1,0, 16 | /* table.foreach */ 0,2,11,0,0,1,16,BC_ISTYPE,0,12,0,BC_ISTYPE,1,9,0,BC_KPRI, 17 | 2,0,0,BC_MOV,3,0,0,BC_KNUM,4,0,0,BC_JMP,5,7,128,BC_MOV,7,1,0,BC_MOV,9,5,0, 18 | BC_MOV,10,6,0,BC_CALL,7,3,2,BC_ISEQP,7,0,0,BC_JMP,8,1,128,BC_RET1,7,2,0, 19 | BC_ITERN,5,3,3,BC_ITERL,5,247,127,BC_RET0,0,1,0,1,255,255,249,255,15, 20 | /* table.getn */ 0,1,2,0,0,0,3,BC_ISTYPE,0,12,0,BC_LEN,1,0,0,BC_RET1,1,2,0, 21 | /* table.remove */ 0,2,10,0,0,2,30,BC_ISTYPE,0,12,0,BC_LEN,2,0,0,BC_ISNEP,1,0, 22 | 0,BC_JMP,3,7,128,BC_ISEQN,2,0,0,BC_JMP,3,23,128,BC_TGETR,3,2,0,BC_KPRI,4,0,0, 23 | BC_TSETR,4,2,0,BC_RET1,3,2,0,BC_JMP,3,18,128,BC_ISTYPE,1,14,0,BC_KSHORT,3,1,0, 24 | BC_ISGT,3,1,0,BC_JMP,3,14,128,BC_ISGT,1,2,0,BC_JMP,3,12,128,BC_TGETR,3,1,0, 25 | BC_ADDVN,4,1,1,BC_MOV,5,2,0,BC_KSHORT,6,1,0,BC_FORI,4,4,128,BC_SUBVN,8,1,7, 26 | BC_TGETR,9,7,0,BC_TSETR,9,8,0,BC_FORL,4,252,127,BC_KPRI,4,0,0,BC_TSETR,4,2,0, 27 | BC_RET1,3,2,0,BC_RET0,0,1,0,0,2, 28 | /* table.move */ 0,5,12,0,0,0,35,BC_ISTYPE,0,12,0,BC_ISTYPE,1,14,0,BC_ISTYPE, 29 | 2,14,0,BC_ISTYPE,3,14,0,BC_ISNEP,4,0,0,BC_JMP,5,1,128,BC_MOV,4,0,0,BC_ISTYPE, 30 | 4,12,0,BC_ISGT,1,2,0,BC_JMP,5,24,128,BC_SUBVV,5,1,3,BC_ISLT,2,3,0,BC_JMP,6,4, 31 | 128,BC_ISLE,3,1,0,BC_JMP,6,2,128,BC_ISEQV,4,0,0,BC_JMP,6,9,128,BC_MOV,6,1,0, 32 | BC_MOV,7,2,0,BC_KSHORT,8,1,0,BC_FORI,6,4,128,BC_ADDVV,10,5,9,BC_TGETR,11,9,0, 33 | BC_TSETR,11,10,4,BC_FORL,6,252,127,BC_JMP,6,8,128,BC_MOV,6,2,0,BC_MOV,7,1,0, 34 | BC_KSHORT,8,255,255,BC_FORI,6,4,128,BC_ADDVV,10,5,9,BC_TGETR,11,9,0,BC_TSETR, 35 | 11,10,4,BC_FORL,6,252,127,BC_RET1,4,2,0, 36 | #else 37 | /* math.deg */ 0,1,2,0,0,1,2,BC_MULVN,1,0,0,BC_RET1,1,2,0,241,135,158,166,3, 38 | 220,203,178,130,4, 39 | /* math.rad */ 0,1,2,0,0,1,2,BC_MULVN,1,0,0,BC_RET1,1,2,0,243,244,148,165,20, 40 | 198,190,199,252,3, 41 | /* string.len */ 0,1,2,0,0,0,3,BC_ISTYPE,0,5,0,BC_LEN,1,0,0,BC_RET1,1,2,0, 42 | /* table.foreachi */ 0,2,9,0,0,0,15,BC_ISTYPE,0,12,0,BC_ISTYPE,1,9,0, 43 | BC_KSHORT,2,1,0,BC_LEN,3,0,0,BC_KSHORT,4,1,0,BC_FORI,2,8,128,BC_MOV,6,1,0, 44 | BC_MOV,7,5,0,BC_TGETR,8,5,0,BC_CALL,6,3,2,BC_ISEQP,6,0,0,BC_JMP,7,1,128, 45 | BC_RET1,6,2,0,BC_FORL,2,248,127,BC_RET0,0,1,0, 46 | /* table.foreach */ 0,2,10,0,0,1,16,BC_ISTYPE,0,12,0,BC_ISTYPE,1,9,0,BC_KPRI, 47 | 2,0,0,BC_MOV,3,0,0,BC_KNUM,4,0,0,BC_JMP,5,7,128,BC_MOV,7,1,0,BC_MOV,8,5,0, 48 | BC_MOV,9,6,0,BC_CALL,7,3,2,BC_ISEQP,7,0,0,BC_JMP,8,1,128,BC_RET1,7,2,0, 49 | BC_ITERN,5,3,3,BC_ITERL,5,247,127,BC_RET0,0,1,0,1,255,255,249,255,15, 50 | /* table.getn */ 0,1,2,0,0,0,3,BC_ISTYPE,0,12,0,BC_LEN,1,0,0,BC_RET1,1,2,0, 51 | /* table.remove */ 0,2,10,0,0,2,30,BC_ISTYPE,0,12,0,BC_LEN,2,0,0,BC_ISNEP,1,0, 52 | 0,BC_JMP,3,7,128,BC_ISEQN,2,0,0,BC_JMP,3,23,128,BC_TGETR,3,2,0,BC_KPRI,4,0,0, 53 | BC_TSETR,4,2,0,BC_RET1,3,2,0,BC_JMP,3,18,128,BC_ISTYPE,1,14,0,BC_KSHORT,3,1,0, 54 | BC_ISGT,3,1,0,BC_JMP,3,14,128,BC_ISGT,1,2,0,BC_JMP,3,12,128,BC_TGETR,3,1,0, 55 | BC_ADDVN,4,1,1,BC_MOV,5,2,0,BC_KSHORT,6,1,0,BC_FORI,4,4,128,BC_SUBVN,8,1,7, 56 | BC_TGETR,9,7,0,BC_TSETR,9,8,0,BC_FORL,4,252,127,BC_KPRI,4,0,0,BC_TSETR,4,2,0, 57 | BC_RET1,3,2,0,BC_RET0,0,1,0,0,2, 58 | /* table.move */ 0,5,12,0,0,0,35,BC_ISTYPE,0,12,0,BC_ISTYPE,1,14,0,BC_ISTYPE, 59 | 2,14,0,BC_ISTYPE,3,14,0,BC_ISNEP,4,0,0,BC_JMP,5,1,128,BC_MOV,4,0,0,BC_ISTYPE, 60 | 4,12,0,BC_ISGT,1,2,0,BC_JMP,5,24,128,BC_SUBVV,5,1,3,BC_ISLT,2,3,0,BC_JMP,6,4, 61 | 128,BC_ISLE,3,1,0,BC_JMP,6,2,128,BC_ISEQV,4,0,0,BC_JMP,6,9,128,BC_MOV,6,1,0, 62 | BC_MOV,7,2,0,BC_KSHORT,8,1,0,BC_FORI,6,4,128,BC_ADDVV,10,5,9,BC_TGETR,11,9,0, 63 | BC_TSETR,11,10,4,BC_FORL,6,252,127,BC_JMP,6,8,128,BC_MOV,6,2,0,BC_MOV,7,1,0, 64 | BC_KSHORT,8,255,255,BC_FORI,6,4,128,BC_ADDVV,10,5,9,BC_TGETR,11,9,0,BC_TSETR, 65 | 11,10,4,BC_FORL,6,252,127,BC_RET1,4,2,0, 66 | #endif 67 | 0 68 | }; 69 | 70 | static const struct { const char *name; int ofs; } libbc_map[] = { 71 | {"math_deg",0}, 72 | {"math_rad",25}, 73 | {"string_len",50}, 74 | {"table_foreachi",69}, 75 | {"table_foreach",136}, 76 | {"table_getn",213}, 77 | {"table_remove",232}, 78 | {"table_move",361}, 79 | {NULL,508} 80 | }; 81 | 82 | -------------------------------------------------------------------------------- /src/jit/.gitignore: -------------------------------------------------------------------------------- 1 | vmdef.lua 2 | -------------------------------------------------------------------------------- /src/jit/bc.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- LuaJIT bytecode listing module. 3 | -- 4 | -- Copyright (C) 2005-2022 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 == 20100, "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 | return { 183 | line = bcline, 184 | dump = bcdump, 185 | targets = bctargets, 186 | on = bcliston, 187 | off = bclistoff, 188 | start = bcliston -- For -j command line option. 189 | } 190 | 191 | -------------------------------------------------------------------------------- /src/jit/dis_arm64be.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- LuaJIT ARM64BE disassembler wrapper module. 3 | -- 4 | -- Copyright (C) 2005-2022 Mike Pall. All rights reserved. 5 | -- Released under the MIT license. See Copyright Notice in luajit.h 6 | ---------------------------------------------------------------------------- 7 | -- ARM64 instructions are always little-endian. So just forward to the 8 | -- common ARM64 disassembler module. All the interesting stuff is there. 9 | ------------------------------------------------------------------------------ 10 | 11 | return require((string.match(..., ".*%.") or "").."dis_arm64") 12 | 13 | -------------------------------------------------------------------------------- /src/jit/dis_mips64.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- LuaJIT MIPS64 disassembler wrapper module. 3 | -- 4 | -- Copyright (C) 2005-2022 Mike Pall. All rights reserved. 5 | -- Released under the MIT license. See Copyright Notice in luajit.h 6 | ---------------------------------------------------------------------------- 7 | -- This module just exports the big-endian functions from the 8 | -- MIPS disassembler module. All the interesting stuff is there. 9 | ------------------------------------------------------------------------------ 10 | 11 | local dis_mips = require((string.match(..., ".*%.") or "").."dis_mips") 12 | return { 13 | create = dis_mips.create, 14 | disass = dis_mips.disass, 15 | regname = dis_mips.regname 16 | } 17 | 18 | -------------------------------------------------------------------------------- /src/jit/dis_mips64el.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- LuaJIT MIPS64EL disassembler wrapper module. 3 | -- 4 | -- Copyright (C) 2005-2022 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 dis_mips = require((string.match(..., ".*%.") or "").."dis_mips") 12 | return { 13 | create = dis_mips.create_el, 14 | disass = dis_mips.disass_el, 15 | regname = dis_mips.regname 16 | } 17 | 18 | -------------------------------------------------------------------------------- /src/jit/dis_mips64r6.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- LuaJIT MIPS64R6 disassembler wrapper module. 3 | -- 4 | -- Copyright (C) 2005-2022 Mike Pall. All rights reserved. 5 | -- Released under the MIT license. See Copyright Notice in luajit.h 6 | ---------------------------------------------------------------------------- 7 | -- This module just exports the r6 big-endian functions from the 8 | -- MIPS disassembler module. All the interesting stuff is there. 9 | ------------------------------------------------------------------------------ 10 | 11 | local dis_mips = require((string.match(..., ".*%.") or "").."dis_mips") 12 | return { 13 | create = dis_mips.create_r6, 14 | disass = dis_mips.disass_r6, 15 | regname = dis_mips.regname 16 | } 17 | 18 | -------------------------------------------------------------------------------- /src/jit/dis_mips64r6el.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- LuaJIT MIPS64R6EL disassembler wrapper module. 3 | -- 4 | -- Copyright (C) 2005-2022 Mike Pall. All rights reserved. 5 | -- Released under the MIT license. See Copyright Notice in luajit.h 6 | ---------------------------------------------------------------------------- 7 | -- This module just exports the r6 little-endian functions from the 8 | -- MIPS disassembler module. All the interesting stuff is there. 9 | ------------------------------------------------------------------------------ 10 | 11 | local dis_mips = require((string.match(..., ".*%.") or "").."dis_mips") 12 | return { 13 | create = dis_mips.create_r6_el, 14 | disass = dis_mips.disass_r6_el, 15 | regname = dis_mips.regname 16 | } 17 | 18 | -------------------------------------------------------------------------------- /src/jit/dis_mipsel.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- LuaJIT MIPSEL disassembler wrapper module. 3 | -- 4 | -- Copyright (C) 2005-2022 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 dis_mips = require((string.match(..., ".*%.") or "").."dis_mips") 12 | return { 13 | create = dis_mips.create_el, 14 | disass = dis_mips.disass_el, 15 | regname = dis_mips.regname 16 | } 17 | 18 | -------------------------------------------------------------------------------- /src/jit/dis_x64.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- LuaJIT x64 disassembler wrapper module. 3 | -- 4 | -- Copyright (C) 2005-2022 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 dis_x86 = require((string.match(..., ".*%.") or "").."dis_x86") 12 | return { 13 | create = dis_x86.create64, 14 | disass = dis_x86.disass64, 15 | regname = dis_x86.regname64 16 | } 17 | 18 | -------------------------------------------------------------------------------- /src/jit/v.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- Verbose mode of the LuaJIT compiler. 3 | -- 4 | -- Copyright (C) 2005-2022 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 == 20100, "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 == -1 and "stitch" or 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 ltype == "stitch" then 120 | out:write(format("[TRACE %3s %s%s %s %s]\n", 121 | tr, startex, startloc, ltype, fmtfunc(func, pc))) 122 | elseif link == tr or link == 0 then 123 | out:write(format("[TRACE %3s %s%s %s]\n", 124 | tr, startex, startloc, ltype)) 125 | elseif ltype == "root" then 126 | out:write(format("[TRACE %3s %s%s -> %d]\n", 127 | tr, startex, startloc, link)) 128 | else 129 | out:write(format("[TRACE %3s %s%s -> %d %s]\n", 130 | tr, startex, startloc, link, ltype)) 131 | end 132 | else 133 | out:write(format("[TRACE %s]\n", what)) 134 | end 135 | out:flush() 136 | end 137 | end 138 | 139 | ------------------------------------------------------------------------------ 140 | 141 | -- Detach dump handlers. 142 | local function dumpoff() 143 | if active then 144 | active = false 145 | jit.attach(dump_trace) 146 | if out and out ~= stdout and out ~= stderr then out:close() end 147 | out = nil 148 | end 149 | end 150 | 151 | -- Open the output file and attach dump handlers. 152 | local function dumpon(outfile) 153 | if active then dumpoff() end 154 | if not outfile then outfile = os.getenv("LUAJIT_VERBOSEFILE") end 155 | if outfile then 156 | out = outfile == "-" and stdout or assert(io.open(outfile, "w")) 157 | else 158 | out = stderr 159 | end 160 | jit.attach(dump_trace, "trace") 161 | active = true 162 | end 163 | 164 | -- Public module functions. 165 | return { 166 | on = dumpon, 167 | off = dumpoff, 168 | start = dumpon -- For -j command line option. 169 | } 170 | 171 | -------------------------------------------------------------------------------- /src/jit/zone.lua: -------------------------------------------------------------------------------- 1 | ---------------------------------------------------------------------------- 2 | -- LuaJIT profiler zones. 3 | -- 4 | -- Copyright (C) 2005-2022 Mike Pall. All rights reserved. 5 | -- Released under the MIT license. See Copyright Notice in luajit.h 6 | ---------------------------------------------------------------------------- 7 | -- 8 | -- This module implements a simple hierarchical zone model. 9 | -- 10 | -- Example usage: 11 | -- 12 | -- local zone = require("jit.zone") 13 | -- zone("AI") 14 | -- ... 15 | -- zone("A*") 16 | -- ... 17 | -- print(zone:get()) --> "A*" 18 | -- ... 19 | -- zone() 20 | -- ... 21 | -- print(zone:get()) --> "AI" 22 | -- ... 23 | -- zone() 24 | -- 25 | ---------------------------------------------------------------------------- 26 | 27 | local remove = table.remove 28 | 29 | return setmetatable({ 30 | flush = function(t) 31 | for i=#t,1,-1 do t[i] = nil end 32 | end, 33 | get = function(t) 34 | return t[#t] 35 | end 36 | }, { 37 | __call = function(t, zone) 38 | if zone then 39 | t[#t+1] = zone 40 | else 41 | return (assert(remove(t), "empty zone stack")) 42 | end 43 | end 44 | }) 45 | 46 | -------------------------------------------------------------------------------- /src/lib_bit.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Bit manipulation library. 3 | ** Copyright (C) 2005-2022 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_buf.h" 16 | #include "lj_strscan.h" 17 | #include "lj_strfmt.h" 18 | #if LJ_HASFFI 19 | #include "lj_ctype.h" 20 | #include "lj_cdata.h" 21 | #include "lj_cconv.h" 22 | #include "lj_carith.h" 23 | #endif 24 | #include "lj_ff.h" 25 | #include "lj_lib.h" 26 | 27 | /* ------------------------------------------------------------------------ */ 28 | 29 | #define LJLIB_MODULE_bit 30 | 31 | #if LJ_HASFFI 32 | static int bit_result64(lua_State *L, CTypeID id, uint64_t x) 33 | { 34 | GCcdata *cd = lj_cdata_new_(L, id, 8); 35 | *(uint64_t *)cdataptr(cd) = x; 36 | setcdataV(L, L->base-1-LJ_FR2, cd); 37 | return FFH_RES(1); 38 | } 39 | #else 40 | static int32_t bit_checkbit(lua_State *L, int narg) 41 | { 42 | TValue *o = L->base + narg-1; 43 | if (!(o < L->top && lj_strscan_numberobj(o))) 44 | lj_err_argt(L, narg, LUA_TNUMBER); 45 | if (LJ_LIKELY(tvisint(o))) { 46 | return intV(o); 47 | } else { 48 | int32_t i = lj_num2bit(numV(o)); 49 | if (LJ_DUALNUM) setintV(o, i); 50 | return i; 51 | } 52 | } 53 | #endif 54 | 55 | LJLIB_ASM(bit_tobit) LJLIB_REC(bit_tobit) 56 | { 57 | #if LJ_HASFFI 58 | CTypeID id = 0; 59 | setintV(L->base-1-LJ_FR2, (int32_t)lj_carith_check64(L, 1, &id)); 60 | return FFH_RES(1); 61 | #else 62 | lj_lib_checknumber(L, 1); 63 | return FFH_RETRY; 64 | #endif 65 | } 66 | 67 | LJLIB_ASM(bit_bnot) LJLIB_REC(bit_unary IR_BNOT) 68 | { 69 | #if LJ_HASFFI 70 | CTypeID id = 0; 71 | uint64_t x = lj_carith_check64(L, 1, &id); 72 | return id ? bit_result64(L, id, ~x) : FFH_RETRY; 73 | #else 74 | lj_lib_checknumber(L, 1); 75 | return FFH_RETRY; 76 | #endif 77 | } 78 | 79 | LJLIB_ASM(bit_bswap) LJLIB_REC(bit_unary IR_BSWAP) 80 | { 81 | #if LJ_HASFFI 82 | CTypeID id = 0; 83 | uint64_t x = lj_carith_check64(L, 1, &id); 84 | return id ? bit_result64(L, id, lj_bswap64(x)) : FFH_RETRY; 85 | #else 86 | lj_lib_checknumber(L, 1); 87 | return FFH_RETRY; 88 | #endif 89 | } 90 | 91 | LJLIB_ASM(bit_lshift) LJLIB_REC(bit_shift IR_BSHL) 92 | { 93 | #if LJ_HASFFI 94 | CTypeID id = 0, id2 = 0; 95 | uint64_t x = lj_carith_check64(L, 1, &id); 96 | int32_t sh = (int32_t)lj_carith_check64(L, 2, &id2); 97 | if (id) { 98 | x = lj_carith_shift64(x, sh, curr_func(L)->c.ffid - (int)FF_bit_lshift); 99 | return bit_result64(L, id, x); 100 | } 101 | if (id2) setintV(L->base+1, sh); 102 | return FFH_RETRY; 103 | #else 104 | lj_lib_checknumber(L, 1); 105 | bit_checkbit(L, 2); 106 | return FFH_RETRY; 107 | #endif 108 | } 109 | LJLIB_ASM_(bit_rshift) LJLIB_REC(bit_shift IR_BSHR) 110 | LJLIB_ASM_(bit_arshift) LJLIB_REC(bit_shift IR_BSAR) 111 | LJLIB_ASM_(bit_rol) LJLIB_REC(bit_shift IR_BROL) 112 | LJLIB_ASM_(bit_ror) LJLIB_REC(bit_shift IR_BROR) 113 | 114 | LJLIB_ASM(bit_band) LJLIB_REC(bit_nary IR_BAND) 115 | { 116 | #if LJ_HASFFI 117 | CTypeID id = 0; 118 | TValue *o = L->base, *top = L->top; 119 | int i = 0; 120 | do { lj_carith_check64(L, ++i, &id); } while (++o < top); 121 | if (id) { 122 | CTState *cts = ctype_cts(L); 123 | CType *ct = ctype_get(cts, id); 124 | int op = curr_func(L)->c.ffid - (int)FF_bit_bor; 125 | uint64_t x, y = op >= 0 ? 0 : ~(uint64_t)0; 126 | o = L->base; 127 | do { 128 | lj_cconv_ct_tv(cts, ct, (uint8_t *)&x, o, 0); 129 | if (op < 0) y &= x; else if (op == 0) y |= x; else y ^= x; 130 | } while (++o < top); 131 | return bit_result64(L, id, y); 132 | } 133 | return FFH_RETRY; 134 | #else 135 | int i = 0; 136 | do { lj_lib_checknumber(L, ++i); } while (L->base+i < L->top); 137 | return FFH_RETRY; 138 | #endif 139 | } 140 | LJLIB_ASM_(bit_bor) LJLIB_REC(bit_nary IR_BOR) 141 | LJLIB_ASM_(bit_bxor) LJLIB_REC(bit_nary IR_BXOR) 142 | 143 | /* ------------------------------------------------------------------------ */ 144 | 145 | LJLIB_CF(bit_tohex) LJLIB_REC(.) 146 | { 147 | #if LJ_HASFFI 148 | CTypeID id = 0, id2 = 0; 149 | uint64_t b = lj_carith_check64(L, 1, &id); 150 | int32_t n = L->base+1>=L->top ? (id ? 16 : 8) : 151 | (int32_t)lj_carith_check64(L, 2, &id2); 152 | #else 153 | uint32_t b = (uint32_t)bit_checkbit(L, 1); 154 | int32_t n = L->base+1>=L->top ? 8 : bit_checkbit(L, 2); 155 | #endif 156 | SBuf *sb = lj_buf_tmp_(L); 157 | SFormat sf = (STRFMT_UINT|STRFMT_T_HEX); 158 | if (n < 0) { n = (int32_t)(~(uint32_t)n+1u); sf |= STRFMT_F_UPPER; } 159 | if ((uint32_t)n > 254) n = 254; 160 | sf |= ((SFormat)((n+1)&255) << STRFMT_SH_PREC); 161 | #if LJ_HASFFI 162 | if (n < 16) b &= ((uint64_t)1 << 4*n)-1; 163 | #else 164 | if (n < 8) b &= (1u << 4*n)-1; 165 | #endif 166 | sb = lj_strfmt_putfxint(sb, sf, b); 167 | setstrV(L, L->top-1, lj_buf_str(L, sb)); 168 | lj_gc_check(L); 169 | return 1; 170 | } 171 | 172 | /* ------------------------------------------------------------------------ */ 173 | 174 | #include "lj_libdef.h" 175 | 176 | LUALIB_API int luaopen_bit(lua_State *L) 177 | { 178 | LJ_LIB_REG(L, LUA_BITLIBNAME, bit); 179 | return 1; 180 | } 181 | 182 | -------------------------------------------------------------------------------- /src/lib_init.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Library initialization. 3 | ** Copyright (C) 2005-2022 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 | -------------------------------------------------------------------------------- /src/lib_math.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Math library. 3 | ** Copyright (C) 2005-2022 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #include 7 | 8 | #define lib_math_c 9 | #define LUA_LIB 10 | 11 | #include "lua.h" 12 | #include "lauxlib.h" 13 | #include "lualib.h" 14 | 15 | #include "lj_obj.h" 16 | #include "lj_lib.h" 17 | #include "lj_vm.h" 18 | #include "lj_prng.h" 19 | 20 | /* ------------------------------------------------------------------------ */ 21 | 22 | #define LJLIB_MODULE_math 23 | 24 | LJLIB_ASM(math_abs) LJLIB_REC(.) 25 | { 26 | lj_lib_checknumber(L, 1); 27 | return FFH_RETRY; 28 | } 29 | LJLIB_ASM_(math_floor) LJLIB_REC(math_round IRFPM_FLOOR) 30 | LJLIB_ASM_(math_ceil) LJLIB_REC(math_round IRFPM_CEIL) 31 | 32 | LJLIB_ASM(math_sqrt) LJLIB_REC(math_unary IRFPM_SQRT) 33 | { 34 | lj_lib_checknum(L, 1); 35 | return FFH_RETRY; 36 | } 37 | LJLIB_ASM_(math_log10) LJLIB_REC(math_call IRCALL_log10) 38 | LJLIB_ASM_(math_exp) LJLIB_REC(math_call IRCALL_exp) 39 | LJLIB_ASM_(math_sin) LJLIB_REC(math_call IRCALL_sin) 40 | LJLIB_ASM_(math_cos) LJLIB_REC(math_call IRCALL_cos) 41 | LJLIB_ASM_(math_tan) LJLIB_REC(math_call IRCALL_tan) 42 | LJLIB_ASM_(math_asin) LJLIB_REC(math_call IRCALL_asin) 43 | LJLIB_ASM_(math_acos) LJLIB_REC(math_call IRCALL_acos) 44 | LJLIB_ASM_(math_atan) LJLIB_REC(math_call IRCALL_atan) 45 | LJLIB_ASM_(math_sinh) LJLIB_REC(math_call IRCALL_sinh) 46 | LJLIB_ASM_(math_cosh) LJLIB_REC(math_call IRCALL_cosh) 47 | LJLIB_ASM_(math_tanh) LJLIB_REC(math_call IRCALL_tanh) 48 | LJLIB_ASM_(math_frexp) 49 | LJLIB_ASM_(math_modf) 50 | 51 | LJLIB_ASM(math_log) LJLIB_REC(math_log) 52 | { 53 | double x = lj_lib_checknum(L, 1); 54 | if (L->base+1 < L->top) { 55 | double y = lj_lib_checknum(L, 2); 56 | #ifdef LUAJIT_NO_LOG2 57 | x = log(x); y = 1.0 / log(y); 58 | #else 59 | x = lj_vm_log2(x); y = 1.0 / lj_vm_log2(y); 60 | #endif 61 | setnumV(L->base-1-LJ_FR2, x*y); /* Do NOT join the expression to x / y. */ 62 | return FFH_RES(1); 63 | } 64 | return FFH_RETRY; 65 | } 66 | 67 | LJLIB_LUA(math_deg) /* function(x) return x * 57.29577951308232 end */ 68 | LJLIB_LUA(math_rad) /* function(x) return x * 0.017453292519943295 end */ 69 | 70 | LJLIB_ASM(math_atan2) LJLIB_REC(.) 71 | { 72 | lj_lib_checknum(L, 1); 73 | lj_lib_checknum(L, 2); 74 | return FFH_RETRY; 75 | } 76 | LJLIB_ASM_(math_pow) LJLIB_REC(.) 77 | LJLIB_ASM_(math_fmod) 78 | 79 | LJLIB_ASM(math_ldexp) LJLIB_REC(.) 80 | { 81 | lj_lib_checknum(L, 1); 82 | #if LJ_DUALNUM && !LJ_TARGET_X86ORX64 83 | lj_lib_checkint(L, 2); 84 | #else 85 | lj_lib_checknum(L, 2); 86 | #endif 87 | return FFH_RETRY; 88 | } 89 | 90 | LJLIB_ASM(math_min) LJLIB_REC(math_minmax IR_MIN) 91 | { 92 | int i = 0; 93 | do { lj_lib_checknumber(L, ++i); } while (L->base+i < L->top); 94 | return FFH_RETRY; 95 | } 96 | LJLIB_ASM_(math_max) LJLIB_REC(math_minmax IR_MAX) 97 | 98 | LJLIB_PUSH(3.14159265358979323846) LJLIB_SET(pi) 99 | LJLIB_PUSH(1e310) LJLIB_SET(huge) 100 | 101 | /* ------------------------------------------------------------------------ */ 102 | 103 | /* This implements a Tausworthe PRNG with period 2^223. Based on: 104 | ** Tables of maximally-equidistributed combined LFSR generators, 105 | ** Pierre L'Ecuyer, 1991, table 3, 1st entry. 106 | ** Full-period ME-CF generator with L=64, J=4, k=223, N1=49. 107 | */ 108 | 109 | /* Union needed for bit-pattern conversion between uint64_t and double. */ 110 | typedef union { uint64_t u64; double d; } U64double; 111 | 112 | /* PRNG seeding function. */ 113 | static void random_seed(PRNGState *rs, double d) 114 | { 115 | uint32_t r = 0x11090601; /* 64-k[i] as four 8 bit constants. */ 116 | int i; 117 | for (i = 0; i < 4; i++) { 118 | U64double u; 119 | uint32_t m = 1u << (r&255); 120 | r >>= 8; 121 | u.d = d = d * 3.14159265358979323846 + 2.7182818284590452354; 122 | if (u.u64 < m) u.u64 += m; /* Ensure k[i] MSB of u[i] are non-zero. */ 123 | rs->u[i] = u.u64; 124 | } 125 | for (i = 0; i < 10; i++) 126 | (void)lj_prng_u64(rs); 127 | } 128 | 129 | /* PRNG extract function. */ 130 | LJLIB_PUSH(top-2) /* Upvalue holds userdata with PRNGState. */ 131 | LJLIB_CF(math_random) LJLIB_REC(.) 132 | { 133 | int n = (int)(L->top - L->base); 134 | PRNGState *rs = (PRNGState *)(uddata(udataV(lj_lib_upvalue(L, 1)))); 135 | U64double u; 136 | double d; 137 | u.u64 = lj_prng_u64d(rs); 138 | d = u.d - 1.0; 139 | if (n > 0) { 140 | #if LJ_DUALNUM 141 | int isint = 1; 142 | double r1; 143 | lj_lib_checknumber(L, 1); 144 | if (tvisint(L->base)) { 145 | r1 = (lua_Number)intV(L->base); 146 | } else { 147 | isint = 0; 148 | r1 = numV(L->base); 149 | } 150 | #else 151 | double r1 = lj_lib_checknum(L, 1); 152 | #endif 153 | if (n == 1) { 154 | d = lj_vm_floor(d*r1) + 1.0; /* d is an int in range [1, r1] */ 155 | } else { 156 | #if LJ_DUALNUM 157 | double r2; 158 | lj_lib_checknumber(L, 2); 159 | if (tvisint(L->base+1)) { 160 | r2 = (lua_Number)intV(L->base+1); 161 | } else { 162 | isint = 0; 163 | r2 = numV(L->base+1); 164 | } 165 | #else 166 | double r2 = lj_lib_checknum(L, 2); 167 | #endif 168 | d = lj_vm_floor(d*(r2-r1+1.0)) + r1; /* d is an int in range [r1, r2] */ 169 | } 170 | #if LJ_DUALNUM 171 | if (isint) { 172 | setintV(L->top-1, lj_num2int(d)); 173 | return 1; 174 | } 175 | #endif 176 | } /* else: d is a double in range [0, 1] */ 177 | setnumV(L->top++, d); 178 | return 1; 179 | } 180 | 181 | /* PRNG seed function. */ 182 | LJLIB_PUSH(top-2) /* Upvalue holds userdata with PRNGState. */ 183 | LJLIB_CF(math_randomseed) 184 | { 185 | PRNGState *rs = (PRNGState *)(uddata(udataV(lj_lib_upvalue(L, 1)))); 186 | random_seed(rs, lj_lib_checknum(L, 1)); 187 | return 0; 188 | } 189 | 190 | /* ------------------------------------------------------------------------ */ 191 | 192 | #include "lj_libdef.h" 193 | 194 | LUALIB_API int luaopen_math(lua_State *L) 195 | { 196 | PRNGState *rs = (PRNGState *)lua_newuserdata(L, sizeof(PRNGState)); 197 | lj_prng_seed_fixed(rs); 198 | LJ_LIB_REG(L, LUA_MATHLIBNAME, math); 199 | return 1; 200 | } 201 | 202 | -------------------------------------------------------------------------------- /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(PRNGState *rs); 13 | LJ_FUNC void lj_alloc_setprng(void *msp, PRNGState *rs); 14 | LJ_FUNC void lj_alloc_destroy(void *msp); 15 | LJ_FUNC void *lj_alloc_f(void *msp, void *ptr, size_t osize, size_t nsize); 16 | #endif 17 | 18 | #endif 19 | -------------------------------------------------------------------------------- /src/lj_asm.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** IR assembler (SSA IR -> machine code). 3 | ** Copyright (C) 2005-2022 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 | -------------------------------------------------------------------------------- /src/lj_assert.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Internal assertions. 3 | ** Copyright (C) 2005-2022 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #define lj_assert_c 7 | #define LUA_CORE 8 | 9 | #if defined(LUA_USE_ASSERT) || defined(LUA_USE_APICHECK) 10 | 11 | #include 12 | 13 | #include "lj_obj.h" 14 | 15 | void lj_assert_fail(global_State *g, const char *file, int line, 16 | const char *func, const char *fmt, ...) 17 | { 18 | va_list argp; 19 | va_start(argp, fmt); 20 | fprintf(stderr, "LuaJIT ASSERT %s:%d: %s: ", file, line, func); 21 | vfprintf(stderr, fmt, argp); 22 | fputc('\n', stderr); 23 | va_end(argp); 24 | UNUSED(g); /* May be NULL. TODO: optionally dump state. */ 25 | abort(); 26 | } 27 | 28 | #endif 29 | -------------------------------------------------------------------------------- /src/lj_bc.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Bytecode instruction modes. 3 | ** Copyright (C) 2005-2022 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 | -------------------------------------------------------------------------------- /src/lj_bcdump.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Bytecode dump definitions. 3 | ** Copyright (C) 2005-2022 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 2 40 | 41 | /* Compatibility flags. */ 42 | #define BCDUMP_F_BE 0x01 43 | #define BCDUMP_F_STRIP 0x02 44 | #define BCDUMP_F_FFI 0x04 45 | #define BCDUMP_F_FR2 0x08 46 | 47 | #define BCDUMP_F_KNOWN (BCDUMP_F_FR2*2-1) 48 | 49 | /* Type codes for the GC constants of a prototype. Plus length for strings. */ 50 | enum { 51 | BCDUMP_KGC_CHILD, BCDUMP_KGC_TAB, BCDUMP_KGC_I64, BCDUMP_KGC_U64, 52 | BCDUMP_KGC_COMPLEX, BCDUMP_KGC_STR 53 | }; 54 | 55 | /* Type codes for the keys/values of a constant table. */ 56 | enum { 57 | BCDUMP_KTAB_NIL, BCDUMP_KTAB_FALSE, BCDUMP_KTAB_TRUE, 58 | BCDUMP_KTAB_INT, BCDUMP_KTAB_NUM, BCDUMP_KTAB_STR 59 | }; 60 | 61 | /* -- Bytecode reader/writer ---------------------------------------------- */ 62 | 63 | LJ_FUNC int lj_bcwrite(lua_State *L, GCproto *pt, lua_Writer writer, 64 | void *data, int strip); 65 | LJ_FUNC GCproto *lj_bcread_proto(LexState *ls); 66 | LJ_FUNC GCproto *lj_bcread(LexState *ls); 67 | 68 | #endif 69 | -------------------------------------------------------------------------------- /src/lj_carith.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** C data arithmetic. 3 | ** Copyright (C) 2005-2022 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 16 | LJ_FUNC uint64_t lj_carith_shl64(uint64_t x, int32_t sh); 17 | LJ_FUNC uint64_t lj_carith_shr64(uint64_t x, int32_t sh); 18 | LJ_FUNC uint64_t lj_carith_sar64(uint64_t x, int32_t sh); 19 | LJ_FUNC uint64_t lj_carith_rol64(uint64_t x, int32_t sh); 20 | LJ_FUNC uint64_t lj_carith_ror64(uint64_t x, int32_t sh); 21 | #endif 22 | LJ_FUNC uint64_t lj_carith_shift64(uint64_t x, int32_t sh, int op); 23 | LJ_FUNC uint64_t lj_carith_check64(lua_State *L, int narg, CTypeID *id); 24 | 25 | #if LJ_32 && LJ_HASJIT 26 | LJ_FUNC int64_t lj_carith_mul64(int64_t x, int64_t k); 27 | #endif 28 | LJ_FUNC uint64_t lj_carith_divu64(uint64_t a, uint64_t b); 29 | LJ_FUNC int64_t lj_carith_divi64(int64_t a, int64_t b); 30 | LJ_FUNC uint64_t lj_carith_modu64(uint64_t a, uint64_t b); 31 | LJ_FUNC int64_t lj_carith_modi64(int64_t a, int64_t b); 32 | LJ_FUNC uint64_t lj_carith_powu64(uint64_t x, uint64_t k); 33 | LJ_FUNC int64_t lj_carith_powi64(int64_t x, int64_t k); 34 | 35 | #endif 36 | 37 | #endif 38 | -------------------------------------------------------------------------------- /src/lj_ccall.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** FFI C call handling. 3 | ** Copyright (C) 2005-2022 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_ARM64 72 | 73 | #define CCALL_NARG_GPR 8 74 | #define CCALL_NRET_GPR 2 75 | #define CCALL_NARG_FPR 8 76 | #define CCALL_NRET_FPR 4 77 | #define CCALL_SPS_FREE 0 78 | 79 | typedef intptr_t GPRArg; 80 | typedef union FPRArg { 81 | double d; 82 | struct { LJ_ENDIAN_LOHI(float f; , float g;) }; 83 | struct { LJ_ENDIAN_LOHI(uint32_t lo; , uint32_t hi;) }; 84 | } FPRArg; 85 | 86 | #elif LJ_TARGET_PPC 87 | 88 | #define CCALL_NARG_GPR 8 89 | #define CCALL_NARG_FPR (LJ_ABI_SOFTFP ? 0 : 8) 90 | #define CCALL_NRET_GPR 4 /* For complex double. */ 91 | #define CCALL_NRET_FPR (LJ_ABI_SOFTFP ? 0 : 1) 92 | #define CCALL_SPS_EXTRA 4 93 | #define CCALL_SPS_FREE 0 94 | 95 | typedef intptr_t GPRArg; 96 | typedef double FPRArg; 97 | 98 | #elif LJ_TARGET_MIPS32 99 | 100 | #define CCALL_NARG_GPR 4 101 | #define CCALL_NARG_FPR (LJ_ABI_SOFTFP ? 0 : 2) 102 | #define CCALL_NRET_GPR (LJ_ABI_SOFTFP ? 4 : 2) 103 | #define CCALL_NRET_FPR (LJ_ABI_SOFTFP ? 0 : 2) 104 | #define CCALL_SPS_EXTRA 7 105 | #define CCALL_SPS_FREE 1 106 | 107 | typedef intptr_t GPRArg; 108 | typedef union FPRArg { 109 | double d; 110 | struct { LJ_ENDIAN_LOHI(float f; , float g;) }; 111 | } FPRArg; 112 | 113 | #elif LJ_TARGET_MIPS64 114 | 115 | /* FP args are positional and overlay the GPR array. */ 116 | #define CCALL_NARG_GPR 8 117 | #define CCALL_NARG_FPR 0 118 | #define CCALL_NRET_GPR 2 119 | #define CCALL_NRET_FPR (LJ_ABI_SOFTFP ? 0 : 2) 120 | #define CCALL_SPS_EXTRA 3 121 | #define CCALL_SPS_FREE 1 122 | 123 | typedef intptr_t GPRArg; 124 | typedef union FPRArg { 125 | double d; 126 | struct { LJ_ENDIAN_LOHI(float f; , float g;) }; 127 | } FPRArg; 128 | 129 | #else 130 | #error "Missing calling convention definitions for this architecture" 131 | #endif 132 | 133 | #ifndef CCALL_SPS_EXTRA 134 | #define CCALL_SPS_EXTRA 0 135 | #endif 136 | #ifndef CCALL_VECTOR_REG 137 | #define CCALL_VECTOR_REG 0 138 | #endif 139 | #ifndef CCALL_ALIGN_STACKARG 140 | #define CCALL_ALIGN_STACKARG 1 141 | #endif 142 | #ifndef CCALL_ALIGN_CALLSTATE 143 | #define CCALL_ALIGN_CALLSTATE 8 144 | #endif 145 | 146 | #define CCALL_NUM_GPR \ 147 | (CCALL_NARG_GPR > CCALL_NRET_GPR ? CCALL_NARG_GPR : CCALL_NRET_GPR) 148 | #define CCALL_NUM_FPR \ 149 | (CCALL_NARG_FPR > CCALL_NRET_FPR ? CCALL_NARG_FPR : CCALL_NRET_FPR) 150 | 151 | /* Check against constants in lj_ctype.h. */ 152 | LJ_STATIC_ASSERT(CCALL_NUM_GPR <= CCALL_MAX_GPR); 153 | LJ_STATIC_ASSERT(CCALL_NUM_FPR <= CCALL_MAX_FPR); 154 | 155 | #define CCALL_MAXSTACK 32 156 | 157 | /* -- C call state -------------------------------------------------------- */ 158 | 159 | typedef LJ_ALIGN(CCALL_ALIGN_CALLSTATE) struct CCallState { 160 | void (*func)(void); /* Pointer to called function. */ 161 | uint32_t spadj; /* Stack pointer adjustment. */ 162 | uint8_t nsp; /* Number of stack slots. */ 163 | uint8_t retref; /* Return value by reference. */ 164 | #if LJ_TARGET_X64 165 | uint8_t ngpr; /* Number of arguments in GPRs. */ 166 | uint8_t nfpr; /* Number of arguments in FPRs. */ 167 | #elif LJ_TARGET_X86 168 | uint8_t resx87; /* Result on x87 stack: 1:float, 2:double. */ 169 | #elif LJ_TARGET_ARM64 170 | void *retp; /* Aggregate return pointer in x8. */ 171 | #elif LJ_TARGET_PPC 172 | uint8_t nfpr; /* Number of arguments in FPRs. */ 173 | #endif 174 | #if LJ_32 175 | int32_t align1; 176 | #endif 177 | #if CCALL_NUM_FPR 178 | FPRArg fpr[CCALL_NUM_FPR]; /* Arguments/results in FPRs. */ 179 | #endif 180 | GPRArg gpr[CCALL_NUM_GPR]; /* Arguments/results in GPRs. */ 181 | GPRArg stack[CCALL_MAXSTACK]; /* Stack slots. */ 182 | } CCallState; 183 | 184 | /* -- C call handling ----------------------------------------------------- */ 185 | 186 | /* Really belongs to lj_vm.h. */ 187 | LJ_ASMF void LJ_FASTCALL lj_vm_ffi_call(CCallState *cc); 188 | 189 | LJ_FUNC CTypeID lj_ccall_ctid_vararg(CTState *cts, cTValue *o); 190 | LJ_FUNC int lj_ccall_func(lua_State *L, GCcdata *cd); 191 | 192 | #endif 193 | 194 | #endif 195 | -------------------------------------------------------------------------------- /src/lj_ccallback.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** FFI C callback handling. 3 | ** Copyright (C) 2005-2022 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 | -------------------------------------------------------------------------------- /src/lj_cconv.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** C type conversions. 3 | ** Copyright (C) 2005-2022 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 | lj_assertX(ctype_type(info) <= CT_MAYCONVERT, 31 | "cannot convert ctype %08x", info); 32 | #if LJ_64 33 | idx = ((uint32_t)(U64x(f436fff5,fff7f021) >> 4*idx) & 15u); 34 | #else 35 | idx = (((idx < 8 ? 0xfff7f021u : 0xf436fff5) >> 4*(idx & 7u)) & 15u); 36 | #endif 37 | lj_assertX(idx < 8, "cannot convert ctype %08x", info); 38 | return idx; 39 | } 40 | 41 | #define cconv_idx2(dinfo, sinfo) \ 42 | ((cconv_idx((dinfo)) << 3) + cconv_idx((sinfo))) 43 | 44 | #define CCX(dst, src) ((CCX_##dst << 3) + CCX_##src) 45 | 46 | /* Conversion flags. */ 47 | #define CCF_CAST 0x00000001u 48 | #define CCF_FROMTV 0x00000002u 49 | #define CCF_SAME 0x00000004u 50 | #define CCF_IGNQUAL 0x00000008u 51 | 52 | #define CCF_ARG_SHIFT 8 53 | #define CCF_ARG(n) ((n) << CCF_ARG_SHIFT) 54 | #define CCF_GETARG(f) ((f) >> CCF_ARG_SHIFT) 55 | 56 | LJ_FUNC int lj_cconv_compatptr(CTState *cts, CType *d, CType *s, CTInfo flags); 57 | LJ_FUNC void lj_cconv_ct_ct(CTState *cts, CType *d, CType *s, 58 | uint8_t *dp, uint8_t *sp, CTInfo flags); 59 | LJ_FUNC int lj_cconv_tv_ct(CTState *cts, CType *s, CTypeID sid, 60 | TValue *o, uint8_t *sp); 61 | LJ_FUNC int lj_cconv_tv_bf(CTState *cts, CType *s, TValue *o, uint8_t *sp); 62 | LJ_FUNC void lj_cconv_ct_tv(CTState *cts, CType *d, 63 | uint8_t *dp, TValue *o, CTInfo flags); 64 | LJ_FUNC void lj_cconv_bf_tv(CTState *cts, CType *d, uint8_t *dp, TValue *o); 65 | LJ_FUNC int lj_cconv_multi_init(CTState *cts, CType *d, TValue *o); 66 | LJ_FUNC void lj_cconv_ct_init(CTState *cts, CType *d, CTSize sz, 67 | uint8_t *dp, TValue *o, MSize len); 68 | 69 | #endif 70 | 71 | #endif 72 | -------------------------------------------------------------------------------- /src/lj_cdata.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** C data management. 3 | ** Copyright (C) 2005-2022 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 | lj_assertX(sz == CTSIZE_PTR, "bad pointer size %d", sz); 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 | lj_assertX(sz == CTSIZE_PTR, "bad pointer size %d", sz); 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 | lj_assertCTS((ctype_hassize(ct->info) ? ct->size : CTSIZE_PTR) == sz, 44 | "inconsistent size of fixed-size cdata alloc"); 45 | #endif 46 | cd = (GCcdata *)lj_mem_newgco(cts->L, sizeof(GCcdata) + sz); 47 | cd->gct = ~LJ_TCDATA; 48 | cd->ctypeid = ctype_check(cts, id); 49 | return cd; 50 | } 51 | 52 | /* Variant which works without a valid CTState. */ 53 | static LJ_AINLINE GCcdata *lj_cdata_new_(lua_State *L, CTypeID id, CTSize sz) 54 | { 55 | GCcdata *cd = (GCcdata *)lj_mem_newgco(L, sizeof(GCcdata) + sz); 56 | cd->gct = ~LJ_TCDATA; 57 | cd->ctypeid = id; 58 | return cd; 59 | } 60 | 61 | LJ_FUNC GCcdata *lj_cdata_newref(CTState *cts, const void *pp, CTypeID id); 62 | LJ_FUNC GCcdata *lj_cdata_newv(lua_State *L, CTypeID id, CTSize sz, 63 | CTSize align); 64 | LJ_FUNC GCcdata *lj_cdata_newx(CTState *cts, CTypeID id, CTSize sz, 65 | CTInfo info); 66 | 67 | LJ_FUNC void LJ_FASTCALL lj_cdata_free(global_State *g, GCcdata *cd); 68 | LJ_FUNC void lj_cdata_setfin(lua_State *L, GCcdata *cd, GCobj *obj, 69 | uint32_t it); 70 | 71 | LJ_FUNC CType *lj_cdata_index(CTState *cts, GCcdata *cd, cTValue *key, 72 | uint8_t **pp, CTInfo *qual); 73 | LJ_FUNC int lj_cdata_get(CTState *cts, CType *s, TValue *o, uint8_t *sp); 74 | LJ_FUNC void lj_cdata_set(CTState *cts, CType *d, uint8_t *dp, TValue *o, 75 | CTInfo qual); 76 | 77 | #endif 78 | 79 | #endif 80 | -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /src/lj_clib.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** FFI C library loader. 3 | ** Copyright (C) 2005-2022 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 | -------------------------------------------------------------------------------- /src/lj_cparse.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** C declaration parser. 3 | ** Copyright (C) 2005-2022 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 | LJ_FUNC int lj_cparse_case(GCstr *str, const char *match); 64 | 65 | #endif 66 | 67 | #endif 68 | -------------------------------------------------------------------------------- /src/lj_crecord.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Trace recorder for C data operations. 3 | ** Copyright (C) 2005-2022 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 | 29 | LJ_FUNC void LJ_FASTCALL recff_bit64_tobit(jit_State *J, RecordFFData *rd); 30 | LJ_FUNC int LJ_FASTCALL recff_bit64_unary(jit_State *J, RecordFFData *rd); 31 | LJ_FUNC int LJ_FASTCALL recff_bit64_nary(jit_State *J, RecordFFData *rd); 32 | LJ_FUNC int LJ_FASTCALL recff_bit64_shift(jit_State *J, RecordFFData *rd); 33 | LJ_FUNC TRef recff_bit64_tohex(jit_State *J, RecordFFData *rd, TRef hdr); 34 | 35 | LJ_FUNC void LJ_FASTCALL lj_crecord_tonumber(jit_State *J, RecordFFData *rd); 36 | LJ_FUNC TRef lj_crecord_loadiu64(jit_State *J, TRef tr, cTValue *o); 37 | #if LJ_HASBUFFER 38 | LJ_FUNC TRef lj_crecord_topcvoid(jit_State *J, TRef tr, cTValue *o); 39 | LJ_FUNC TRef lj_crecord_topuint8(jit_State *J, TRef tr); 40 | #endif 41 | #endif 42 | 43 | #endif 44 | -------------------------------------------------------------------------------- /src/lj_debug.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Debugging and introspection. 3 | ** Copyright (C) 2005-2022 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 | GCobj **op); 34 | LJ_FUNC const char *lj_debug_slotname(GCproto *pt, const BCIns *pc, 35 | BCReg slot, const char **name); 36 | LJ_FUNC const char *lj_debug_funcname(lua_State *L, cTValue *frame, 37 | const char **name); 38 | LJ_FUNC void lj_debug_shortname(char *out, GCstr *str, BCLine line); 39 | LJ_FUNC void lj_debug_addloc(lua_State *L, const char *msg, 40 | cTValue *frame, cTValue *nextframe); 41 | LJ_FUNC void lj_debug_pushloc(lua_State *L, GCproto *pt, BCPos pc); 42 | LJ_FUNC int lj_debug_getinfo(lua_State *L, const char *what, lj_Debug *ar, 43 | int ext); 44 | #if LJ_HASPROFILE 45 | LJ_FUNC void lj_debug_dumpstack(lua_State *L, SBuf *sb, const char *fmt, 46 | int depth); 47 | #endif 48 | 49 | /* Fixed internal variable names. */ 50 | #define VARNAMEDEF(_) \ 51 | _(FOR_IDX, "(for index)") \ 52 | _(FOR_STOP, "(for limit)") \ 53 | _(FOR_STEP, "(for step)") \ 54 | _(FOR_GEN, "(for generator)") \ 55 | _(FOR_STATE, "(for state)") \ 56 | _(FOR_CTL, "(for control)") 57 | 58 | enum { 59 | VARNAME_END, 60 | #define VARNAMEENUM(name, str) VARNAME_##name, 61 | VARNAMEDEF(VARNAMEENUM) 62 | #undef VARNAMEENUM 63 | VARNAME__MAX 64 | }; 65 | 66 | #endif 67 | -------------------------------------------------------------------------------- /src/lj_dispatch.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Instruction dispatch handling. 3 | ** Copyright (C) 2005-2022 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 | 18 | #ifndef _LJ_VM_H 19 | LJ_ASMF int32_t LJ_FASTCALL lj_vm_modi(int32_t a, int32_t b); 20 | #endif 21 | 22 | #if LJ_SOFTFP 23 | #ifndef _LJ_IRCALL_H 24 | extern double __adddf3(double a, double b); 25 | extern double __subdf3(double a, double b); 26 | extern double __muldf3(double a, double b); 27 | extern double __divdf3(double a, double b); 28 | #endif 29 | #define SFGOTDEF(_) _(sqrt) _(__adddf3) _(__subdf3) _(__muldf3) _(__divdf3) 30 | #else 31 | #define SFGOTDEF(_) 32 | #endif 33 | #if LJ_HASJIT 34 | #define JITGOTDEF(_) _(lj_err_trace) _(lj_trace_exit) _(lj_trace_hot) 35 | #else 36 | #define JITGOTDEF(_) 37 | #endif 38 | #if LJ_HASFFI 39 | #define FFIGOTDEF(_) \ 40 | _(lj_meta_equal_cd) _(lj_ccallback_enter) _(lj_ccallback_leave) 41 | #else 42 | #define FFIGOTDEF(_) 43 | #endif 44 | #define GOTDEF(_) \ 45 | _(floor) _(ceil) _(trunc) _(log) _(log10) _(exp) _(sin) _(cos) _(tan) \ 46 | _(asin) _(acos) _(atan) _(sinh) _(cosh) _(tanh) _(frexp) _(modf) _(atan2) \ 47 | _(pow) _(fmod) _(ldexp) _(lj_vm_modi) \ 48 | _(lj_dispatch_call) _(lj_dispatch_ins) _(lj_dispatch_stitch) \ 49 | _(lj_dispatch_profile) _(lj_err_throw) \ 50 | _(lj_ffh_coroutine_wrap_err) _(lj_func_closeuv) _(lj_func_newL_gc) \ 51 | _(lj_gc_barrieruv) _(lj_gc_step) _(lj_gc_step_fixtop) _(lj_meta_arith) \ 52 | _(lj_meta_call) _(lj_meta_cat) _(lj_meta_comp) _(lj_meta_equal) \ 53 | _(lj_meta_for) _(lj_meta_istype) _(lj_meta_len) _(lj_meta_tget) \ 54 | _(lj_meta_tset) _(lj_state_growstack) _(lj_strfmt_number) \ 55 | _(lj_str_new) _(lj_tab_dup) _(lj_tab_get) _(lj_tab_getinth) _(lj_tab_len) \ 56 | _(lj_tab_new) _(lj_tab_newkey) _(lj_tab_next) _(lj_tab_reasize) \ 57 | _(lj_tab_setinth) _(lj_buf_putstr_reverse) _(lj_buf_putstr_lower) \ 58 | _(lj_buf_putstr_upper) _(lj_buf_tostr) \ 59 | JITGOTDEF(_) FFIGOTDEF(_) SFGOTDEF(_) 60 | 61 | enum { 62 | #define GOTENUM(name) LJ_GOT_##name, 63 | GOTDEF(GOTENUM) 64 | #undef GOTENUM 65 | LJ_GOT__MAX 66 | }; 67 | #endif 68 | 69 | /* Type of hot counter. Must match the code in the assembler VM. */ 70 | /* 16 bits are sufficient. Only 0.0015% overhead with maximum slot penalty. */ 71 | typedef uint16_t HotCount; 72 | 73 | /* Number of hot counter hash table entries (must be a power of two). */ 74 | #define HOTCOUNT_SIZE 64 75 | #define HOTCOUNT_PCMASK ((HOTCOUNT_SIZE-1)*sizeof(HotCount)) 76 | 77 | /* Hotcount decrements. */ 78 | #define HOTCOUNT_LOOP 2 79 | #define HOTCOUNT_CALL 1 80 | 81 | /* This solves a circular dependency problem -- bump as needed. Sigh. */ 82 | #define GG_NUM_ASMFF 57 83 | 84 | #define GG_LEN_DDISP (BC__MAX + GG_NUM_ASMFF) 85 | #define GG_LEN_SDISP BC_FUNCF 86 | #define GG_LEN_DISP (GG_LEN_DDISP + GG_LEN_SDISP) 87 | 88 | /* Global state, main thread and extra fields are allocated together. */ 89 | typedef struct GG_State { 90 | lua_State L; /* Main thread. */ 91 | global_State g; /* Global state. */ 92 | #if LJ_TARGET_ARM && !LJ_TARGET_NX 93 | /* Make g reachable via K12 encoded DISPATCH-relative addressing. */ 94 | uint8_t align1[(16-sizeof(global_State))&15]; 95 | #endif 96 | #if LJ_TARGET_MIPS 97 | ASMFunction got[LJ_GOT__MAX]; /* Global offset table. */ 98 | #endif 99 | #if LJ_HASJIT 100 | jit_State J; /* JIT state. */ 101 | HotCount hotcount[HOTCOUNT_SIZE]; /* Hot counters. */ 102 | #if LJ_TARGET_ARM && !LJ_TARGET_NX 103 | /* Ditto for J. */ 104 | uint8_t align2[(16-sizeof(jit_State)-sizeof(HotCount)*HOTCOUNT_SIZE)&15]; 105 | #endif 106 | #endif 107 | ASMFunction dispatch[GG_LEN_DISP]; /* Instruction dispatch tables. */ 108 | BCIns bcff[GG_NUM_ASMFF]; /* Bytecode for ASM fast functions. */ 109 | } GG_State; 110 | 111 | #define GG_OFS(field) ((int)offsetof(GG_State, field)) 112 | #define G2GG(gl) ((GG_State *)((char *)(gl) - GG_OFS(g))) 113 | #define J2GG(j) ((GG_State *)((char *)(j) - GG_OFS(J))) 114 | #define L2GG(L) (G2GG(G(L))) 115 | #define J2G(J) (&J2GG(J)->g) 116 | #define G2J(gl) (&G2GG(gl)->J) 117 | #define L2J(L) (&L2GG(L)->J) 118 | #define GG_G2J (GG_OFS(J) - GG_OFS(g)) 119 | #define GG_G2DISP (GG_OFS(dispatch) - GG_OFS(g)) 120 | #define GG_DISP2G (GG_OFS(g) - GG_OFS(dispatch)) 121 | #define GG_DISP2J (GG_OFS(J) - GG_OFS(dispatch)) 122 | #define GG_DISP2HOT (GG_OFS(hotcount) - GG_OFS(dispatch)) 123 | #define GG_DISP2STATIC (GG_LEN_DDISP*(int)sizeof(ASMFunction)) 124 | 125 | #define hotcount_get(gg, pc) \ 126 | (gg)->hotcount[(u32ptr(pc)>>2) & (HOTCOUNT_SIZE-1)] 127 | #define hotcount_set(gg, pc, val) \ 128 | (hotcount_get((gg), (pc)) = (HotCount)(val)) 129 | 130 | /* Dispatch table management. */ 131 | LJ_FUNC void lj_dispatch_init(GG_State *GG); 132 | #if LJ_HASJIT 133 | LJ_FUNC void lj_dispatch_init_hotcount(global_State *g); 134 | #endif 135 | LJ_FUNC void lj_dispatch_update(global_State *g); 136 | 137 | /* Instruction dispatch callback for hooks or when recording. */ 138 | LJ_FUNCA void LJ_FASTCALL lj_dispatch_ins(lua_State *L, const BCIns *pc); 139 | LJ_FUNCA ASMFunction LJ_FASTCALL lj_dispatch_call(lua_State *L, const BCIns*pc); 140 | #if LJ_HASJIT 141 | LJ_FUNCA void LJ_FASTCALL lj_dispatch_stitch(jit_State *J, const BCIns *pc); 142 | #endif 143 | #if LJ_HASPROFILE 144 | LJ_FUNCA void LJ_FASTCALL lj_dispatch_profile(lua_State *L, const BCIns *pc); 145 | #endif 146 | 147 | #if LJ_HASFFI && !defined(_BUILDVM_H) 148 | /* Save/restore errno and GetLastError() around hooks, exits and recording. */ 149 | #include 150 | #if LJ_TARGET_WINDOWS 151 | #define WIN32_LEAN_AND_MEAN 152 | #include 153 | #define ERRNO_SAVE int olderr = errno; DWORD oldwerr = GetLastError(); 154 | #define ERRNO_RESTORE errno = olderr; SetLastError(oldwerr); 155 | #else 156 | #define ERRNO_SAVE int olderr = errno; 157 | #define ERRNO_RESTORE errno = olderr; 158 | #endif 159 | #else 160 | #define ERRNO_SAVE 161 | #define ERRNO_RESTORE 162 | #endif 163 | 164 | #endif 165 | -------------------------------------------------------------------------------- /src/lj_err.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Error handling. 3 | ** Copyright (C) 2005-2022 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_FASTCALL lj_err_run(lua_State *L); 27 | #if LJ_HASJIT 28 | LJ_FUNCA_NORET void LJ_FASTCALL lj_err_trace(lua_State *L, int errcode); 29 | #endif 30 | LJ_FUNC_NORET void lj_err_msg(lua_State *L, ErrMsg em); 31 | LJ_FUNC_NORET void lj_err_lex(lua_State *L, GCstr *src, const char *tok, 32 | BCLine line, ErrMsg em, va_list argp); 33 | LJ_FUNC_NORET void lj_err_optype(lua_State *L, cTValue *o, ErrMsg opm); 34 | LJ_FUNC_NORET void lj_err_comp(lua_State *L, cTValue *o1, cTValue *o2); 35 | LJ_FUNC_NORET void lj_err_optype_call(lua_State *L, TValue *o); 36 | LJ_FUNC_NORET void lj_err_callermsg(lua_State *L, const char *msg); 37 | LJ_FUNC_NORET void lj_err_callerv(lua_State *L, ErrMsg em, ...); 38 | LJ_FUNC_NORET void lj_err_caller(lua_State *L, ErrMsg em); 39 | LJ_FUNC_NORET void lj_err_arg(lua_State *L, int narg, ErrMsg em); 40 | LJ_FUNC_NORET void lj_err_argv(lua_State *L, int narg, ErrMsg em, ...); 41 | LJ_FUNC_NORET void lj_err_argtype(lua_State *L, int narg, const char *xname); 42 | LJ_FUNC_NORET void lj_err_argt(lua_State *L, int narg, int tt); 43 | 44 | #if LJ_UNWIND_JIT && !LJ_ABI_WIN 45 | LJ_FUNC uint8_t *lj_err_register_mcode(void *base, size_t sz, uint8_t *info); 46 | LJ_FUNC void lj_err_deregister_mcode(void *base, size_t sz, uint8_t *info); 47 | #else 48 | #define lj_err_register_mcode(base, sz, info) (info) 49 | #define lj_err_deregister_mcode(base, sz, info) UNUSED(base) 50 | #endif 51 | 52 | #if LJ_UNWIND_EXT && !LJ_ABI_WIN && defined(LUA_USE_ASSERT) 53 | LJ_FUNC void lj_err_verify(void); 54 | #else 55 | #define lj_err_verify() ((void)0) 56 | #endif 57 | 58 | #endif 59 | -------------------------------------------------------------------------------- /src/lj_ff.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Fast function IDs. 3 | ** Copyright (C) 2005-2022 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 | -------------------------------------------------------------------------------- /src/lj_ffrecord.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Fast function call recorder. 3 | ** Copyright (C) 2005-2022 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 | -------------------------------------------------------------------------------- /src/lj_func.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Function handling (prototypes, functions and upvalues). 3 | ** Copyright (C) 2005-2022 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 | -------------------------------------------------------------------------------- /src/lj_gc.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Garbage collector. 3 | ** Copyright (C) 2005-2022 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 | lj_assertG(isblack(o) && !isdead(g, o), 85 | "bad object states for backward barrier"); 86 | lj_assertG(g->gc.state != GCSfinalize && g->gc.state != GCSpause, 87 | "bad GC state"); 88 | black2gray(o); 89 | setgcrefr(t->gclist, g->gc.grayagain); 90 | setgcref(g->gc.grayagain, o); 91 | } 92 | 93 | /* Barrier for stores to table objects. TValue and GCobj variant. */ 94 | #define lj_gc_anybarriert(L, t) \ 95 | { if (LJ_UNLIKELY(isblack(obj2gco(t)))) lj_gc_barrierback(G(L), (t)); } 96 | #define lj_gc_barriert(L, t, tv) \ 97 | { if (tviswhite(tv) && isblack(obj2gco(t))) \ 98 | lj_gc_barrierback(G(L), (t)); } 99 | #define lj_gc_objbarriert(L, t, o) \ 100 | { if (iswhite(obj2gco(o)) && isblack(obj2gco(t))) \ 101 | lj_gc_barrierback(G(L), (t)); } 102 | 103 | /* Barrier for stores to any other object. TValue and GCobj variant. */ 104 | #define lj_gc_barrier(L, p, tv) \ 105 | { if (tviswhite(tv) && isblack(obj2gco(p))) \ 106 | lj_gc_barrierf(G(L), obj2gco(p), gcV(tv)); } 107 | #define lj_gc_objbarrier(L, p, o) \ 108 | { if (iswhite(obj2gco(o)) && isblack(obj2gco(p))) \ 109 | lj_gc_barrierf(G(L), obj2gco(p), obj2gco(o)); } 110 | 111 | /* Allocator. */ 112 | LJ_FUNC void *lj_mem_realloc(lua_State *L, void *p, GCSize osz, GCSize nsz); 113 | LJ_FUNC void * LJ_FASTCALL lj_mem_newgco(lua_State *L, GCSize size); 114 | LJ_FUNC void *lj_mem_grow(lua_State *L, void *p, 115 | MSize *szp, MSize lim, MSize esz); 116 | 117 | #define lj_mem_new(L, s) lj_mem_realloc(L, NULL, 0, (s)) 118 | 119 | static LJ_AINLINE void lj_mem_free(global_State *g, void *p, size_t osize) 120 | { 121 | g->gc.total -= (GCSize)osize; 122 | g->allocf(g->allocd, p, osize, 0); 123 | } 124 | 125 | #define lj_mem_newvec(L, n, t) ((t *)lj_mem_new(L, (GCSize)((n)*sizeof(t)))) 126 | #define lj_mem_reallocvec(L, p, on, n, t) \ 127 | ((p) = (t *)lj_mem_realloc(L, p, (on)*sizeof(t), (GCSize)((n)*sizeof(t)))) 128 | #define lj_mem_growvec(L, p, n, m, t) \ 129 | ((p) = (t *)lj_mem_grow(L, (p), &(n), (m), (MSize)sizeof(t))) 130 | #define lj_mem_freevec(g, p, n, t) lj_mem_free(g, (p), (n)*sizeof(t)) 131 | 132 | #define lj_mem_newobj(L, t) ((t *)lj_mem_newgco(L, sizeof(t))) 133 | #define lj_mem_newt(L, s, t) ((t *)lj_mem_new(L, (s))) 134 | #define lj_mem_freet(g, p) lj_mem_free(g, (p), sizeof(*(p))) 135 | 136 | #endif 137 | -------------------------------------------------------------------------------- /src/lj_gdbjit.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Client for the GDB JIT API. 3 | ** Copyright (C) 2005-2022 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 | -------------------------------------------------------------------------------- /src/lj_lex.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Lexical analyzer. 3 | ** Copyright (C) 2005-2022 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 LexChar; /* Lexical character. Unsigned ext. from char. */ 34 | typedef int LexToken; /* Lexical token. */ 35 | 36 | /* Combined bytecode ins/line. Only used during bytecode generation. */ 37 | typedef struct BCInsLine { 38 | BCIns ins; /* Bytecode instruction. */ 39 | BCLine line; /* Line number for this bytecode. */ 40 | } BCInsLine; 41 | 42 | /* Info for local variables. Only used during bytecode generation. */ 43 | typedef struct VarInfo { 44 | GCRef name; /* Local variable name or goto/label name. */ 45 | BCPos startpc; /* First point where the local variable is active. */ 46 | BCPos endpc; /* First point where the local variable is dead. */ 47 | uint8_t slot; /* Variable slot. */ 48 | uint8_t info; /* Variable/goto/label info. */ 49 | } VarInfo; 50 | 51 | /* Lua lexer state. */ 52 | typedef struct LexState { 53 | struct FuncState *fs; /* Current FuncState. Defined in lj_parse.c. */ 54 | struct lua_State *L; /* Lua state. */ 55 | TValue tokval; /* Current token value. */ 56 | TValue lookaheadval; /* Lookahead token value. */ 57 | const char *p; /* Current position in input buffer. */ 58 | const char *pe; /* End of input buffer. */ 59 | LexChar c; /* Current character. */ 60 | LexToken tok; /* Current token. */ 61 | LexToken lookahead; /* Lookahead token. */ 62 | SBuf sb; /* String buffer for tokens. */ 63 | lua_Reader rfunc; /* Reader callback. */ 64 | void *rdata; /* Reader callback data. */ 65 | BCLine linenumber; /* Input line counter. */ 66 | BCLine lastline; /* Line of last token. */ 67 | GCstr *chunkname; /* Current chunk name (interned string). */ 68 | const char *chunkarg; /* Chunk name argument. */ 69 | const char *mode; /* Allow loading bytecode (b) and/or source text (t). */ 70 | VarInfo *vstack; /* Stack for names and extents of local variables. */ 71 | MSize sizevstack; /* Size of variable stack. */ 72 | MSize vtop; /* Top of variable stack. */ 73 | BCInsLine *bcstack; /* Stack for bytecode instructions/line numbers. */ 74 | MSize sizebcstack; /* Size of bytecode stack. */ 75 | uint32_t level; /* Syntactical nesting level. */ 76 | int endmark; /* Trust bytecode end marker, even if not at EOF. */ 77 | } LexState; 78 | 79 | LJ_FUNC int lj_lex_setup(lua_State *L, LexState *ls); 80 | LJ_FUNC void lj_lex_cleanup(lua_State *L, LexState *ls); 81 | LJ_FUNC void lj_lex_next(LexState *ls); 82 | LJ_FUNC LexToken lj_lex_lookahead(LexState *ls); 83 | LJ_FUNC const char *lj_lex_token2str(LexState *ls, LexToken tok); 84 | LJ_FUNC_NORET void lj_lex_error(LexState *ls, LexToken tok, ErrMsg em, ...); 85 | LJ_FUNC void lj_lex_init(lua_State *L); 86 | 87 | #ifdef LUA_USE_ASSERT 88 | #define lj_assertLS(c, ...) (lj_assertG_(G(ls->L), (c), __VA_ARGS__)) 89 | #else 90 | #define lj_assertLS(c, ...) ((void)ls) 91 | #endif 92 | 93 | #endif 94 | -------------------------------------------------------------------------------- /src/lj_lib.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Library function support. 3 | ** Copyright (C) 2005-2022 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 GCfunc *lj_lib_checkfunc(lua_State *L, int narg); 45 | LJ_FUNC GCtab *lj_lib_checktab(lua_State *L, int narg); 46 | LJ_FUNC GCtab *lj_lib_checktabornil(lua_State *L, int narg); 47 | LJ_FUNC int lj_lib_checkopt(lua_State *L, int narg, int def, const char *lst); 48 | 49 | #if LJ_HASBUFFER 50 | LJ_FUNC GCstr *lj_lib_checkstrx(lua_State *L, int narg); 51 | LJ_FUNC int32_t lj_lib_checkintrange(lua_State *L, int narg, 52 | int32_t a, int32_t b); 53 | #endif 54 | 55 | /* Avoid including lj_frame.h. */ 56 | #if LJ_GC64 57 | #define lj_lib_upvalue(L, n) \ 58 | (&gcval(L->base-2)->fn.c.upvalue[(n)-1]) 59 | #elif LJ_FR2 60 | #define lj_lib_upvalue(L, n) \ 61 | (&gcref((L->base-2)->gcr)->fn.c.upvalue[(n)-1]) 62 | #else 63 | #define lj_lib_upvalue(L, n) \ 64 | (&gcref((L->base-1)->fr.func)->fn.c.upvalue[(n)-1]) 65 | #endif 66 | 67 | #if LJ_TARGET_WINDOWS 68 | #define lj_lib_checkfpu(L) \ 69 | do { setnumV(L->top++, (lua_Number)1437217655); \ 70 | if (lua_tointeger(L, -1) != 1437217655) lj_err_caller(L, LJ_ERR_BADFPU); \ 71 | L->top--; } while (0) 72 | #else 73 | #define lj_lib_checkfpu(L) UNUSED(L) 74 | #endif 75 | 76 | LJ_FUNC GCfunc *lj_lib_pushcc(lua_State *L, lua_CFunction f, int id, int n); 77 | #define lj_lib_pushcf(L, fn, id) (lj_lib_pushcc(L, (fn), (id), 0)) 78 | 79 | /* Library function declarations. Scanned by buildvm. */ 80 | #define LJLIB_CF(name) static int lj_cf_##name(lua_State *L) 81 | #define LJLIB_ASM(name) static int lj_ffh_##name(lua_State *L) 82 | #define LJLIB_ASM_(name) 83 | #define LJLIB_LUA(name) 84 | #define LJLIB_SET(name) 85 | #define LJLIB_PUSH(arg) 86 | #define LJLIB_REC(handler) 87 | #define LJLIB_NOREGUV 88 | #define LJLIB_NOREG 89 | 90 | #define LJ_LIB_REG(L, regname, name) \ 91 | lj_lib_register(L, regname, lj_lib_init_##name, lj_lib_cf_##name) 92 | 93 | LJ_FUNC void lj_lib_register(lua_State *L, const char *libname, 94 | const uint8_t *init, const lua_CFunction *cf); 95 | LJ_FUNC void lj_lib_prereg(lua_State *L, const char *name, lua_CFunction f, 96 | GCtab *env); 97 | LJ_FUNC int lj_lib_postreg(lua_State *L, lua_CFunction cf, int id, 98 | const char *name); 99 | 100 | /* Library init data tags. */ 101 | #define LIBINIT_LENMASK 0x3f 102 | #define LIBINIT_TAGMASK 0xc0 103 | #define LIBINIT_CF 0x00 104 | #define LIBINIT_ASM 0x40 105 | #define LIBINIT_ASM_ 0x80 106 | #define LIBINIT_STRING 0xc0 107 | #define LIBINIT_MAXSTR 0x38 108 | #define LIBINIT_LUA 0xf9 109 | #define LIBINIT_SET 0xfa 110 | #define LIBINIT_NUMBER 0xfb 111 | #define LIBINIT_COPY 0xfc 112 | #define LIBINIT_LASTCL 0xfd 113 | #define LIBINIT_FFID 0xfe 114 | #define LIBINIT_END 0xff 115 | 116 | #endif 117 | -------------------------------------------------------------------------------- /src/lj_load.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Load and dump code. 3 | ** Copyright (C) 2005-2022 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_buf.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_buf_init(L, &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 | lj_checkapi(L->top > L->base, "top slot empty"); 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 | -------------------------------------------------------------------------------- /src/lj_mcode.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Machine code management. 3 | ** Copyright (C) 2005-2022 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 | -------------------------------------------------------------------------------- /src/lj_meta.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Metamethod handling. 3 | ** Copyright (C) 2005-2022 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_istype(lua_State *L, BCReg ra, BCReg tp); 35 | LJ_FUNCA void lj_meta_call(lua_State *L, TValue *func, TValue *top); 36 | LJ_FUNCA void LJ_FASTCALL lj_meta_for(lua_State *L, TValue *o); 37 | 38 | #endif 39 | -------------------------------------------------------------------------------- /src/lj_obj.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Miscellaneous object handling. 3 | ** Copyright (C) 2005-2022 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_FASTCALL 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 | /* Return pointer to object or its object data. */ 37 | const void * LJ_FASTCALL lj_obj_ptr(global_State *g, cTValue *o) 38 | { 39 | UNUSED(g); 40 | if (tvisudata(o)) 41 | return uddata(udataV(o)); 42 | else if (tvislightud(o)) 43 | return lightudV(g, o); 44 | else if (LJ_HASFFI && tviscdata(o)) 45 | return cdataptr(cdataV(o)); 46 | else if (tvisgcv(o)) 47 | return gcV(o); 48 | else 49 | return NULL; 50 | } 51 | 52 | -------------------------------------------------------------------------------- /src/lj_opt_dce.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** DCE: Dead Code Elimination. Pre-LOOP only -- ASM already performs DCE. 3 | ** Copyright (C) 2005-2022 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 | lj_ir_nop(ir); 51 | continue; 52 | } 53 | if (ir->op1 >= REF_FIRST) irt_setmark(IR(ir->op1)->t); 54 | if (ir->op2 >= REF_FIRST) irt_setmark(IR(ir->op2)->t); 55 | } 56 | } 57 | 58 | /* Dead Code Elimination. 59 | ** 60 | ** First backpropagate marks for all used instructions. Then replace 61 | ** the unused ones with a NOP. Note that compressing the IR to eliminate 62 | ** the NOPs does not pay off. 63 | */ 64 | void lj_opt_dce(jit_State *J) 65 | { 66 | if ((J->flags & JIT_F_OPT_DCE)) { 67 | dce_marksnap(J); 68 | dce_propagate(J); 69 | memset(J->bpropcache, 0, sizeof(J->bpropcache)); /* Invalidate cache. */ 70 | } 71 | } 72 | 73 | #undef IR 74 | 75 | #endif 76 | -------------------------------------------------------------------------------- /src/lj_parse.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Lua parser (source code -> bytecode). 3 | ** Copyright (C) 2005-2022 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 | -------------------------------------------------------------------------------- /src/lj_prng.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Pseudo-random number generation. 3 | ** Copyright (C) 2005-2022 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_PRNG_H 7 | #define _LJ_PRNG_H 8 | 9 | #include "lj_def.h" 10 | 11 | LJ_FUNC int LJ_FASTCALL lj_prng_seed_secure(PRNGState *rs); 12 | LJ_FUNC uint64_t LJ_FASTCALL lj_prng_u64(PRNGState *rs); 13 | LJ_FUNC uint64_t LJ_FASTCALL lj_prng_u64d(PRNGState *rs); 14 | 15 | /* This is just the precomputed result of lib_math.c:random_seed(rs, 0.0). */ 16 | static LJ_AINLINE void lj_prng_seed_fixed(PRNGState *rs) 17 | { 18 | rs->u[0] = U64x(a0d27757,0a345b8c); 19 | rs->u[1] = U64x(764a296c,5d4aa64f); 20 | rs->u[2] = U64x(51220704,070adeaa); 21 | rs->u[3] = U64x(2a2717b5,a7b7b927); 22 | } 23 | 24 | #endif 25 | -------------------------------------------------------------------------------- /src/lj_profile.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Low-overhead profiling. 3 | ** Copyright (C) 2005-2022 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_PROFILE_H 7 | #define _LJ_PROFILE_H 8 | 9 | #include "lj_obj.h" 10 | 11 | #if LJ_HASPROFILE 12 | 13 | LJ_FUNC void LJ_FASTCALL lj_profile_interpreter(lua_State *L); 14 | #if !LJ_PROFILE_SIGPROF 15 | LJ_FUNC void LJ_FASTCALL lj_profile_hook_enter(global_State *g); 16 | LJ_FUNC void LJ_FASTCALL lj_profile_hook_leave(global_State *g); 17 | #endif 18 | 19 | #endif 20 | 21 | #endif 22 | -------------------------------------------------------------------------------- /src/lj_record.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Trace recorder (bytecode -> SSA IR). 3 | ** Copyright (C) 2005-2022 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 void lj_record_stop(jit_State *J, TraceLink linktype, TraceNo lnk); 32 | LJ_FUNC TRef lj_record_constify(jit_State *J, cTValue *o); 33 | LJ_FUNC TRef lj_record_vload(jit_State *J, TRef ref, MSize idx, IRType t); 34 | 35 | LJ_FUNC void lj_record_call(jit_State *J, BCReg func, ptrdiff_t nargs); 36 | LJ_FUNC void lj_record_tailcall(jit_State *J, BCReg func, ptrdiff_t nargs); 37 | LJ_FUNC void lj_record_ret(jit_State *J, BCReg rbase, ptrdiff_t gotresults); 38 | 39 | LJ_FUNC int lj_record_mm_lookup(jit_State *J, RecordIndex *ix, MMS mm); 40 | LJ_FUNC TRef lj_record_idx(jit_State *J, RecordIndex *ix); 41 | LJ_FUNC int lj_record_next(jit_State *J, RecordIndex *ix); 42 | 43 | LJ_FUNC void lj_record_ins(jit_State *J); 44 | LJ_FUNC void lj_record_setup(jit_State *J); 45 | #endif 46 | 47 | #endif 48 | -------------------------------------------------------------------------------- /src/lj_serialize.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Object de/serialization. 3 | ** Copyright (C) 2005-2022 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_SERIALIZE_H 7 | #define _LJ_SERIALIZE_H 8 | 9 | #include "lj_obj.h" 10 | #include "lj_buf.h" 11 | 12 | #if LJ_HASBUFFER 13 | 14 | #define LJ_SERIALIZE_DEPTH 100 /* Default depth. */ 15 | 16 | LJ_FUNC void LJ_FASTCALL lj_serialize_dict_prep_str(lua_State *L, GCtab *dict); 17 | LJ_FUNC void LJ_FASTCALL lj_serialize_dict_prep_mt(lua_State *L, GCtab *dict); 18 | LJ_FUNC SBufExt * LJ_FASTCALL lj_serialize_put(SBufExt *sbx, cTValue *o); 19 | LJ_FUNC char * LJ_FASTCALL lj_serialize_get(SBufExt *sbx, TValue *o); 20 | LJ_FUNC GCstr * LJ_FASTCALL lj_serialize_encode(lua_State *L, cTValue *o); 21 | LJ_FUNC void lj_serialize_decode(lua_State *L, TValue *o, GCstr *str); 22 | #if LJ_HASJIT 23 | LJ_FUNC MSize LJ_FASTCALL lj_serialize_peektype(SBufExt *sbx); 24 | #endif 25 | 26 | #endif 27 | 28 | #endif 29 | -------------------------------------------------------------------------------- /src/lj_snap.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Snapshot handling. 3 | ** Copyright (C) 2005-2022 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(jit_State *J, GCtrace *T, SnapNo snapno, 17 | IRIns *ir); 18 | LJ_FUNC void lj_snap_replay(jit_State *J, GCtrace *T); 19 | LJ_FUNC const BCIns *lj_snap_restore(jit_State *J, void *exptr); 20 | LJ_FUNC void lj_snap_grow_buf_(jit_State *J, MSize need); 21 | LJ_FUNC void lj_snap_grow_map_(jit_State *J, MSize need); 22 | 23 | static LJ_AINLINE void lj_snap_grow_buf(jit_State *J, MSize need) 24 | { 25 | if (LJ_UNLIKELY(need > J->sizesnap)) lj_snap_grow_buf_(J, need); 26 | } 27 | 28 | static LJ_AINLINE void lj_snap_grow_map(jit_State *J, MSize need) 29 | { 30 | if (LJ_UNLIKELY(need > J->sizesnapmap)) lj_snap_grow_map_(J, need); 31 | } 32 | 33 | #endif 34 | 35 | #endif 36 | -------------------------------------------------------------------------------- /src/lj_state.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** State and stack handling. 3 | ** Copyright (C) 2005-2022 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 && !LJ_GC64 && !(defined(LUAJIT_USE_VALGRIND) && defined(LUAJIT_USE_SYSMALLOC)) 32 | LJ_FUNC lua_State *lj_state_newstate(lua_Alloc f, void *ud); 33 | #endif 34 | 35 | #define LJ_ALLOCF_INTERNAL ((lua_Alloc)(void *)(uintptr_t)(1237<<4)) 36 | 37 | #endif 38 | -------------------------------------------------------------------------------- /src/lj_str.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** String handling. 3 | ** Copyright (C) 2005-2022 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 helpers. */ 14 | LJ_FUNC int32_t LJ_FASTCALL lj_str_cmp(GCstr *a, GCstr *b); 15 | LJ_FUNC const char *lj_str_find(const char *s, const char *f, 16 | MSize slen, MSize flen); 17 | LJ_FUNC int lj_str_haspattern(GCstr *s); 18 | 19 | /* String interning. */ 20 | LJ_FUNC void lj_str_resize(lua_State *L, MSize newmask); 21 | LJ_FUNCA GCstr *lj_str_new(lua_State *L, const char *str, size_t len); 22 | LJ_FUNC void LJ_FASTCALL lj_str_free(global_State *g, GCstr *s); 23 | LJ_FUNC void LJ_FASTCALL lj_str_init(lua_State *L); 24 | #define lj_str_freetab(g) \ 25 | (lj_mem_freevec(g, g->str.tab, g->str.mask+1, GCRef)) 26 | 27 | #define lj_str_newz(L, s) (lj_str_new(L, s, strlen(s))) 28 | #define lj_str_newlit(L, s) (lj_str_new(L, "" s, sizeof(s)-1)) 29 | #define lj_str_size(len) (sizeof(GCstr) + (((len)+4) & ~(MSize)3)) 30 | 31 | #endif 32 | -------------------------------------------------------------------------------- /src/lj_strfmt.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** String formatting. 3 | ** Copyright (C) 2005-2022 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #ifndef _LJ_STRFMT_H 7 | #define _LJ_STRFMT_H 8 | 9 | #include "lj_obj.h" 10 | 11 | typedef uint32_t SFormat; /* Format indicator. */ 12 | 13 | /* Format parser state. */ 14 | typedef struct FormatState { 15 | const uint8_t *p; /* Current format string pointer. */ 16 | const uint8_t *e; /* End of format string. */ 17 | const char *str; /* Returned literal string. */ 18 | MSize len; /* Size of literal string. */ 19 | } FormatState; 20 | 21 | /* Format types (max. 16). */ 22 | typedef enum FormatType { 23 | STRFMT_EOF, STRFMT_ERR, STRFMT_LIT, 24 | STRFMT_INT, STRFMT_UINT, STRFMT_NUM, STRFMT_STR, STRFMT_CHAR, STRFMT_PTR 25 | } FormatType; 26 | 27 | /* Format subtypes (bits are reused). */ 28 | #define STRFMT_T_HEX 0x0010 /* STRFMT_UINT */ 29 | #define STRFMT_T_OCT 0x0020 /* STRFMT_UINT */ 30 | #define STRFMT_T_FP_A 0x0000 /* STRFMT_NUM */ 31 | #define STRFMT_T_FP_E 0x0010 /* STRFMT_NUM */ 32 | #define STRFMT_T_FP_F 0x0020 /* STRFMT_NUM */ 33 | #define STRFMT_T_FP_G 0x0030 /* STRFMT_NUM */ 34 | #define STRFMT_T_QUOTED 0x0010 /* STRFMT_STR */ 35 | 36 | /* Format flags. */ 37 | #define STRFMT_F_LEFT 0x0100 38 | #define STRFMT_F_PLUS 0x0200 39 | #define STRFMT_F_ZERO 0x0400 40 | #define STRFMT_F_SPACE 0x0800 41 | #define STRFMT_F_ALT 0x1000 42 | #define STRFMT_F_UPPER 0x2000 43 | 44 | /* Format indicator fields. */ 45 | #define STRFMT_SH_WIDTH 16 46 | #define STRFMT_SH_PREC 24 47 | 48 | #define STRFMT_TYPE(sf) ((FormatType)((sf) & 15)) 49 | #define STRFMT_WIDTH(sf) (((sf) >> STRFMT_SH_WIDTH) & 255u) 50 | #define STRFMT_PREC(sf) ((((sf) >> STRFMT_SH_PREC) & 255u) - 1u) 51 | #define STRFMT_FP(sf) (((sf) >> 4) & 3) 52 | 53 | /* Formats for conversion characters. */ 54 | #define STRFMT_A (STRFMT_NUM|STRFMT_T_FP_A) 55 | #define STRFMT_C (STRFMT_CHAR) 56 | #define STRFMT_D (STRFMT_INT) 57 | #define STRFMT_E (STRFMT_NUM|STRFMT_T_FP_E) 58 | #define STRFMT_F (STRFMT_NUM|STRFMT_T_FP_F) 59 | #define STRFMT_G (STRFMT_NUM|STRFMT_T_FP_G) 60 | #define STRFMT_I STRFMT_D 61 | #define STRFMT_O (STRFMT_UINT|STRFMT_T_OCT) 62 | #define STRFMT_P (STRFMT_PTR) 63 | #define STRFMT_Q (STRFMT_STR|STRFMT_T_QUOTED) 64 | #define STRFMT_S (STRFMT_STR) 65 | #define STRFMT_U (STRFMT_UINT) 66 | #define STRFMT_X (STRFMT_UINT|STRFMT_T_HEX) 67 | #define STRFMT_G14 (STRFMT_G | ((14+1) << STRFMT_SH_PREC)) 68 | 69 | /* Maximum buffer sizes for conversions. */ 70 | #define STRFMT_MAXBUF_XINT (1+22) /* '0' prefix + uint64_t in octal. */ 71 | #define STRFMT_MAXBUF_INT (1+10) /* Sign + int32_t in decimal. */ 72 | #define STRFMT_MAXBUF_NUM 32 /* Must correspond with STRFMT_G14. */ 73 | #define STRFMT_MAXBUF_PTR (2+2*sizeof(ptrdiff_t)) /* "0x" + hex ptr. */ 74 | 75 | /* Format parser. */ 76 | LJ_FUNC SFormat LJ_FASTCALL lj_strfmt_parse(FormatState *fs); 77 | 78 | static LJ_AINLINE void lj_strfmt_init(FormatState *fs, const char *p, MSize len) 79 | { 80 | fs->p = (const uint8_t *)p; 81 | fs->e = (const uint8_t *)p + len; 82 | /* Must be NUL-terminated. May have NULs inside, too. */ 83 | lj_assertX(*fs->e == 0, "format not NUL-terminated"); 84 | } 85 | 86 | /* Raw conversions. */ 87 | LJ_FUNC char * LJ_FASTCALL lj_strfmt_wint(char *p, int32_t k); 88 | LJ_FUNC char * LJ_FASTCALL lj_strfmt_wptr(char *p, const void *v); 89 | LJ_FUNC char * LJ_FASTCALL lj_strfmt_wuleb128(char *p, uint32_t v); 90 | LJ_FUNC const char *lj_strfmt_wstrnum(lua_State *L, cTValue *o, MSize *lenp); 91 | 92 | /* Unformatted conversions to buffer. */ 93 | LJ_FUNC SBuf * LJ_FASTCALL lj_strfmt_putint(SBuf *sb, int32_t k); 94 | #if LJ_HASJIT 95 | LJ_FUNC SBuf * LJ_FASTCALL lj_strfmt_putnum(SBuf *sb, cTValue *o); 96 | #endif 97 | LJ_FUNC SBuf * LJ_FASTCALL lj_strfmt_putptr(SBuf *sb, const void *v); 98 | #if LJ_HASJIT 99 | LJ_FUNC SBuf * LJ_FASTCALL lj_strfmt_putquoted(SBuf *sb, GCstr *str); 100 | #endif 101 | 102 | /* Formatted conversions to buffer. */ 103 | LJ_FUNC SBuf *lj_strfmt_putfxint(SBuf *sb, SFormat sf, uint64_t k); 104 | LJ_FUNC SBuf *lj_strfmt_putfnum_int(SBuf *sb, SFormat sf, lua_Number n); 105 | LJ_FUNC SBuf *lj_strfmt_putfnum_uint(SBuf *sb, SFormat sf, lua_Number n); 106 | LJ_FUNC SBuf *lj_strfmt_putfnum(SBuf *sb, SFormat, lua_Number n); 107 | LJ_FUNC SBuf *lj_strfmt_putfchar(SBuf *sb, SFormat, int32_t c); 108 | #if LJ_HASJIT 109 | LJ_FUNC SBuf *lj_strfmt_putfstr(SBuf *sb, SFormat, GCstr *str); 110 | #endif 111 | LJ_FUNC int lj_strfmt_putarg(lua_State *L, SBuf *sb, int arg, int retry); 112 | 113 | /* Conversions to strings. */ 114 | LJ_FUNC GCstr * LJ_FASTCALL lj_strfmt_int(lua_State *L, int32_t k); 115 | LJ_FUNCA GCstr * LJ_FASTCALL lj_strfmt_num(lua_State *L, cTValue *o); 116 | LJ_FUNCA GCstr * LJ_FASTCALL lj_strfmt_number(lua_State *L, cTValue *o); 117 | #if LJ_HASJIT 118 | LJ_FUNC GCstr * LJ_FASTCALL lj_strfmt_char(lua_State *L, int c); 119 | #endif 120 | LJ_FUNC GCstr * LJ_FASTCALL lj_strfmt_obj(lua_State *L, cTValue *o); 121 | 122 | /* Internal string formatting. */ 123 | LJ_FUNC const char *lj_strfmt_pushvf(lua_State *L, const char *fmt, 124 | va_list argp); 125 | LJ_FUNC const char *lj_strfmt_pushf(lua_State *L, const char *fmt, ...) 126 | #if defined(__GNUC__) || defined(__clang__) 127 | __attribute__ ((format (printf, 2, 3))) 128 | #endif 129 | ; 130 | 131 | #endif 132 | -------------------------------------------------------------------------------- /src/lj_strscan.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** String scanning. 3 | ** Copyright (C) 2005-2022 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, MSize len, TValue *o, 26 | uint32_t opt); 27 | LJ_FUNC int LJ_FASTCALL lj_strscan_num(GCstr *str, TValue *o); 28 | #if LJ_DUALNUM 29 | LJ_FUNC int LJ_FASTCALL lj_strscan_number(GCstr *str, TValue *o); 30 | #else 31 | #define lj_strscan_number(s, o) lj_strscan_num((s), (o)) 32 | #endif 33 | 34 | /* Check for number or convert string to number/int in-place (!). */ 35 | static LJ_AINLINE int lj_strscan_numberobj(TValue *o) 36 | { 37 | return tvisnumber(o) || (tvisstr(o) && lj_strscan_number(strV(o), o)); 38 | } 39 | 40 | #endif 41 | -------------------------------------------------------------------------------- /src/lj_tab.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Table handling. 3 | ** Copyright (C) 2005-2022 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 | /* Hash values are masked with the table hash mask and used as an index. */ 35 | static LJ_AINLINE Node *hashmask(const GCtab *t, uint32_t hash) 36 | { 37 | Node *n = noderef(t->node); 38 | return &n[hash & t->hmask]; 39 | } 40 | 41 | /* String IDs are generated when a string is interned. */ 42 | #define hashstr(t, s) hashmask(t, (s)->sid) 43 | 44 | #define hashlohi(t, lo, hi) hashmask((t), hashrot((lo), (hi))) 45 | #define hashnum(t, o) hashlohi((t), (o)->u32.lo, ((o)->u32.hi << 1)) 46 | #if LJ_GC64 47 | #define hashgcref(t, r) \ 48 | hashlohi((t), (uint32_t)gcrefu(r), (uint32_t)(gcrefu(r) >> 32)) 49 | #else 50 | #define hashgcref(t, r) hashlohi((t), gcrefu(r), gcrefu(r) + HASH_BIAS) 51 | #endif 52 | 53 | #define hsize2hbits(s) ((s) ? ((s)==1 ? 1 : 1+lj_fls((uint32_t)((s)-1))) : 0) 54 | 55 | LJ_FUNCA GCtab *lj_tab_new(lua_State *L, uint32_t asize, uint32_t hbits); 56 | LJ_FUNC GCtab *lj_tab_new_ah(lua_State *L, int32_t a, int32_t h); 57 | #if LJ_HASJIT 58 | LJ_FUNC GCtab * LJ_FASTCALL lj_tab_new1(lua_State *L, uint32_t ahsize); 59 | #endif 60 | LJ_FUNCA GCtab * LJ_FASTCALL lj_tab_dup(lua_State *L, const GCtab *kt); 61 | LJ_FUNC void LJ_FASTCALL lj_tab_clear(GCtab *t); 62 | LJ_FUNC void LJ_FASTCALL lj_tab_free(global_State *g, GCtab *t); 63 | #if LJ_HASFFI 64 | LJ_FUNC void lj_tab_rehash(lua_State *L, GCtab *t); 65 | #endif 66 | LJ_FUNC void lj_tab_resize(lua_State *L, GCtab *t, uint32_t asize, uint32_t hbits); 67 | LJ_FUNCA void lj_tab_reasize(lua_State *L, GCtab *t, uint32_t nasize); 68 | 69 | /* Caveat: all getters except lj_tab_get() can return NULL! */ 70 | 71 | LJ_FUNCA cTValue * LJ_FASTCALL lj_tab_getinth(GCtab *t, int32_t key); 72 | LJ_FUNC cTValue *lj_tab_getstr(GCtab *t, const GCstr *key); 73 | LJ_FUNCA cTValue *lj_tab_get(lua_State *L, GCtab *t, cTValue *key); 74 | 75 | /* Caveat: all setters require a write barrier for the stored value. */ 76 | 77 | LJ_FUNCA TValue *lj_tab_newkey(lua_State *L, GCtab *t, cTValue *key); 78 | LJ_FUNCA TValue *lj_tab_setinth(lua_State *L, GCtab *t, int32_t key); 79 | LJ_FUNC TValue *lj_tab_setstr(lua_State *L, GCtab *t, const GCstr *key); 80 | LJ_FUNC TValue *lj_tab_set(lua_State *L, GCtab *t, cTValue *key); 81 | 82 | #define inarray(t, key) ((MSize)(key) < (MSize)(t)->asize) 83 | #define arrayslot(t, i) (&tvref((t)->array)[(i)]) 84 | #define lj_tab_getint(t, key) \ 85 | (inarray((t), (key)) ? arrayslot((t), (key)) : lj_tab_getinth((t), (key))) 86 | #define lj_tab_setint(L, t, key) \ 87 | (inarray((t), (key)) ? arrayslot((t), (key)) : lj_tab_setinth(L, (t), (key))) 88 | 89 | LJ_FUNC uint32_t LJ_FASTCALL lj_tab_keyindex(GCtab *t, cTValue *key); 90 | LJ_FUNCA int lj_tab_next(GCtab *t, cTValue *key, TValue *o); 91 | LJ_FUNCA MSize LJ_FASTCALL lj_tab_len(GCtab *t); 92 | #if LJ_HASJIT 93 | LJ_FUNC MSize LJ_FASTCALL lj_tab_len_hint(GCtab *t, size_t hint); 94 | #endif 95 | 96 | #endif 97 | -------------------------------------------------------------------------------- /src/lj_trace.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Trace management. 3 | ** Copyright (C) 2005-2022 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 GCtrace * LJ_FASTCALL lj_trace_alloc(lua_State *L, GCtrace *T); 27 | LJ_FUNC void LJ_FASTCALL lj_trace_free(global_State *g, GCtrace *T); 28 | LJ_FUNC void lj_trace_reenableproto(GCproto *pt); 29 | LJ_FUNC void lj_trace_flushproto(global_State *g, GCproto *pt); 30 | LJ_FUNC void lj_trace_flush(jit_State *J, TraceNo traceno); 31 | LJ_FUNC int lj_trace_flushall(lua_State *L); 32 | LJ_FUNC void lj_trace_initstate(global_State *g); 33 | LJ_FUNC void lj_trace_freestate(global_State *g); 34 | 35 | /* Event handling. */ 36 | LJ_FUNC void lj_trace_ins(jit_State *J, const BCIns *pc); 37 | LJ_FUNCA void LJ_FASTCALL lj_trace_hot(jit_State *J, const BCIns *pc); 38 | LJ_FUNCA void LJ_FASTCALL lj_trace_stitch(jit_State *J, const BCIns *pc); 39 | LJ_FUNCA int LJ_FASTCALL lj_trace_exit(jit_State *J, void *exptr); 40 | #if LJ_UNWIND_EXT 41 | LJ_FUNC uintptr_t LJ_FASTCALL lj_trace_unwind(jit_State *J, uintptr_t addr, ExitNo *ep); 42 | #endif 43 | 44 | /* Signal asynchronous abort of trace or end of trace. */ 45 | #define lj_trace_abort(g) (G2J(g)->state &= ~LJ_TRACE_ACTIVE) 46 | #define lj_trace_end(J) (J->state = LJ_TRACE_END) 47 | 48 | #else 49 | 50 | #define lj_trace_flushall(L) (UNUSED(L), 0) 51 | #define lj_trace_initstate(g) UNUSED(g) 52 | #define lj_trace_freestate(g) UNUSED(g) 53 | #define lj_trace_abort(g) UNUSED(g) 54 | #define lj_trace_end(J) UNUSED(J) 55 | 56 | #endif 57 | 58 | #endif 59 | -------------------------------------------------------------------------------- /src/lj_traceerr.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Trace compiler error messages. 3 | ** Copyright (C) 2005-2022 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(TRACEUV, "trace too short") 11 | TREDEF(TRACEOV, "trace too long") 12 | TREDEF(STACKOV, "trace too deep") 13 | TREDEF(SNAPOV, "too many snapshots") 14 | TREDEF(BLACKL, "blacklisted") 15 | TREDEF(RETRY, "retry recording") 16 | TREDEF(NYIBC, "NYI: bytecode %d") 17 | 18 | /* Recording loop ops. */ 19 | TREDEF(LLEAVE, "leaving loop in root trace") 20 | TREDEF(LINNER, "inner loop in root trace") 21 | TREDEF(LUNROLL, "loop unroll limit reached") 22 | 23 | /* Recording calls/returns. */ 24 | TREDEF(BADTYPE, "bad argument type") 25 | TREDEF(CJITOFF, "JIT compilation disabled for function") 26 | TREDEF(CUNROLL, "call unroll limit reached") 27 | TREDEF(DOWNREC, "down-recursion, restarting") 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 | -------------------------------------------------------------------------------- /src/lj_udata.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Userdata handling. 3 | ** Copyright (C) 2005-2022 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_err.h" 12 | #include "lj_udata.h" 13 | 14 | GCudata *lj_udata_new(lua_State *L, MSize sz, GCtab *env) 15 | { 16 | GCudata *ud = lj_mem_newt(L, sizeof(GCudata) + sz, GCudata); 17 | global_State *g = G(L); 18 | newwhite(g, ud); /* Not finalized. */ 19 | ud->gct = ~LJ_TUDATA; 20 | ud->udtype = UDTYPE_USERDATA; 21 | ud->len = sz; 22 | /* NOBARRIER: The GCudata is new (marked white). */ 23 | setgcrefnull(ud->metatable); 24 | setgcref(ud->env, obj2gco(env)); 25 | /* Chain to userdata list (after main thread). */ 26 | setgcrefr(ud->nextgc, mainthread(g)->nextgc); 27 | setgcref(mainthread(g)->nextgc, obj2gco(ud)); 28 | return ud; 29 | } 30 | 31 | void LJ_FASTCALL lj_udata_free(global_State *g, GCudata *ud) 32 | { 33 | lj_mem_free(g, ud, sizeudata(ud)); 34 | } 35 | 36 | #if LJ_64 37 | void *lj_lightud_intern(lua_State *L, void *p) 38 | { 39 | global_State *g = G(L); 40 | uint64_t u = (uint64_t)p; 41 | uint32_t up = lightudup(u); 42 | uint32_t *segmap = mref(g->gc.lightudseg, uint32_t); 43 | MSize segnum = g->gc.lightudnum; 44 | if (segmap) { 45 | MSize seg; 46 | for (seg = 0; seg <= segnum; seg++) 47 | if (segmap[seg] == up) /* Fast path. */ 48 | return (void *)(((uint64_t)seg << LJ_LIGHTUD_BITS_LO) | lightudlo(u)); 49 | segnum++; 50 | /* Leave last segment unused to avoid clash with ITERN key. */ 51 | if (segnum >= (1 << LJ_LIGHTUD_BITS_SEG)-1) lj_err_msg(L, LJ_ERR_BADLU); 52 | } 53 | if (!((segnum-1) & segnum) && segnum != 1) { 54 | lj_mem_reallocvec(L, segmap, segnum, segnum ? 2*segnum : 2u, uint32_t); 55 | setmref(g->gc.lightudseg, segmap); 56 | } 57 | g->gc.lightudnum = segnum; 58 | segmap[segnum] = up; 59 | return (void *)(((uint64_t)segnum << LJ_LIGHTUD_BITS_LO) | lightudlo(u)); 60 | } 61 | #endif 62 | 63 | -------------------------------------------------------------------------------- /src/lj_udata.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Userdata handling. 3 | ** Copyright (C) 2005-2022 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 | #if LJ_64 14 | LJ_FUNC void * LJ_FASTCALL lj_lightud_intern(lua_State *L, void *p); 15 | #endif 16 | 17 | #endif 18 | -------------------------------------------------------------------------------- /src/lj_vm.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Assembler VM interface definitions. 3 | ** Copyright (C) 2005-2022 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 | #if LJ_ABI_WIN && LJ_TARGET_X86 21 | LJ_ASMF_NORET void LJ_FASTCALL lj_vm_rtlunwind(void *cframe, void *excptrec, 22 | void *unwinder, int errcode); 23 | #endif 24 | LJ_ASMF void lj_vm_unwind_c_eh(void); 25 | LJ_ASMF void lj_vm_unwind_ff_eh(void); 26 | #if LJ_TARGET_X86ORX64 27 | LJ_ASMF void lj_vm_unwind_rethrow(void); 28 | #endif 29 | #if LJ_TARGET_MIPS 30 | LJ_ASMF void lj_vm_unwind_stub(void); 31 | #endif 32 | 33 | /* Miscellaneous functions. */ 34 | #if LJ_TARGET_X86ORX64 35 | LJ_ASMF int lj_vm_cpuid(uint32_t f, uint32_t res[4]); 36 | #endif 37 | #if LJ_TARGET_PPC 38 | void lj_vm_cachesync(void *start, void *end); 39 | #endif 40 | LJ_ASMF double lj_vm_foldarith(double x, double y, int op); 41 | #if LJ_HASJIT 42 | LJ_ASMF double lj_vm_foldfpm(double x, int op); 43 | #endif 44 | #if !LJ_ARCH_HASFPU 45 | /* Declared in lj_obj.h: LJ_ASMF int32_t lj_vm_tobit(double x); */ 46 | #endif 47 | 48 | /* Dispatch targets for recording and hooks. */ 49 | LJ_ASMF void lj_vm_record(void); 50 | LJ_ASMF void lj_vm_inshook(void); 51 | LJ_ASMF void lj_vm_rethook(void); 52 | LJ_ASMF void lj_vm_callhook(void); 53 | LJ_ASMF void lj_vm_profhook(void); 54 | LJ_ASMF void lj_vm_IITERN(void); 55 | 56 | /* Trace exit handling. */ 57 | LJ_ASMF void lj_vm_exit_handler(void); 58 | LJ_ASMF void lj_vm_exit_interp(void); 59 | 60 | /* Internal math helper functions. */ 61 | #if LJ_TARGET_PPC || LJ_TARGET_ARM64 || (LJ_TARGET_MIPS && LJ_ABI_SOFTFP) 62 | #define lj_vm_floor floor 63 | #define lj_vm_ceil ceil 64 | #else 65 | LJ_ASMF double lj_vm_floor(double); 66 | LJ_ASMF double lj_vm_ceil(double); 67 | #if LJ_TARGET_ARM 68 | LJ_ASMF double lj_vm_floor_sf(double); 69 | LJ_ASMF double lj_vm_ceil_sf(double); 70 | #endif 71 | #endif 72 | #ifdef LUAJIT_NO_LOG2 73 | LJ_ASMF double lj_vm_log2(double); 74 | #else 75 | #define lj_vm_log2 log2 76 | #endif 77 | #if !(defined(_LJ_DISPATCH_H) && LJ_TARGET_MIPS) 78 | LJ_ASMF int32_t LJ_FASTCALL lj_vm_modi(int32_t, int32_t); 79 | #endif 80 | 81 | #if LJ_HASJIT 82 | #if LJ_TARGET_X86ORX64 83 | LJ_ASMF void lj_vm_floor_sse(void); 84 | LJ_ASMF void lj_vm_ceil_sse(void); 85 | LJ_ASMF void lj_vm_trunc_sse(void); 86 | #endif 87 | #if LJ_TARGET_PPC || LJ_TARGET_ARM64 88 | #define lj_vm_trunc trunc 89 | #else 90 | LJ_ASMF double lj_vm_trunc(double); 91 | #if LJ_TARGET_ARM 92 | LJ_ASMF double lj_vm_trunc_sf(double); 93 | #endif 94 | #endif 95 | #if LJ_HASFFI 96 | LJ_ASMF int lj_vm_errno(void); 97 | #endif 98 | LJ_ASMF TValue *lj_vm_next(GCtab *t, uint32_t idx); 99 | #endif 100 | 101 | /* Continuations for metamethods. */ 102 | LJ_ASMF void lj_cont_cat(void); /* Continue with concatenation. */ 103 | LJ_ASMF void lj_cont_ra(void); /* Store result in RA from instruction. */ 104 | LJ_ASMF void lj_cont_nop(void); /* Do nothing, just continue execution. */ 105 | LJ_ASMF void lj_cont_condt(void); /* Branch if result is true. */ 106 | LJ_ASMF void lj_cont_condf(void); /* Branch if result is false. */ 107 | LJ_ASMF void lj_cont_hook(void); /* Continue from hook yield. */ 108 | LJ_ASMF void lj_cont_stitch(void); /* Trace stitching. */ 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 | -------------------------------------------------------------------------------- /src/lj_vmevent.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** VM event handling. 3 | ** Copyright (C) 2005-2022 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 | if (LJ_FR2) setnilV(L->top++); 31 | return savestack(L, L->top); 32 | } 33 | } 34 | g->vmevmask &= ~VMEVENT_MASK(ev); /* No handler: cache this fact. */ 35 | return 0; 36 | } 37 | 38 | void lj_vmevent_call(lua_State *L, ptrdiff_t argbase) 39 | { 40 | global_State *g = G(L); 41 | uint8_t oldmask = g->vmevmask; 42 | uint8_t oldh = hook_save(g); 43 | int status; 44 | g->vmevmask = 0; /* Disable all events. */ 45 | hook_vmevent(g); 46 | status = lj_vm_pcall(L, restorestack(L, argbase), 0+1, 0); 47 | if (LJ_UNLIKELY(status)) { 48 | /* Really shouldn't use stderr here, but where else to complain? */ 49 | L->top--; 50 | fputs("VM handler failed: ", stderr); 51 | fputs(tvisstr(L->top) ? strVdata(L->top) : "?", stderr); 52 | fputc('\n', stderr); 53 | } 54 | hook_restore(g, oldh); 55 | if (g->vmevmask != VMEVENT_NOCACHE) 56 | g->vmevmask = oldmask; /* Restore event mask, but not if not modified. */ 57 | } 58 | 59 | -------------------------------------------------------------------------------- /src/lj_vmevent.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** VM event handling. 3 | ** Copyright (C) 2005-2022 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, 0x12d91467), 28 | VMEVENT_DEF(RECORD, 0x1284bf4f), 29 | VMEVENT_DEF(TEXIT, 0x129df2b0), 30 | VMEVENT_DEF(ERRFIN, 0x12d93888), 31 | LJ_VMEVENT__MAX 32 | } VMEvent; 33 | 34 | #ifdef LUAJIT_DISABLE_VMEVENT 35 | #define lj_vmevent_send(L, ev, args) UNUSED(L) 36 | #define lj_vmevent_send_(L, ev, args, post) UNUSED(L) 37 | #else 38 | #define lj_vmevent_send(L, ev, args) \ 39 | if (G(L)->vmevmask & VMEVENT_MASK(LJ_VMEVENT_##ev)) { \ 40 | ptrdiff_t argbase = lj_vmevent_prepare(L, LJ_VMEVENT_##ev); \ 41 | if (argbase) { \ 42 | args \ 43 | lj_vmevent_call(L, argbase); \ 44 | } \ 45 | } 46 | #define lj_vmevent_send_(L, ev, args, post) \ 47 | if (G(L)->vmevmask & VMEVENT_MASK(LJ_VMEVENT_##ev)) { \ 48 | ptrdiff_t argbase = lj_vmevent_prepare(L, LJ_VMEVENT_##ev); \ 49 | if (argbase) { \ 50 | args \ 51 | lj_vmevent_call(L, argbase); \ 52 | post \ 53 | } \ 54 | } 55 | 56 | LJ_FUNC ptrdiff_t lj_vmevent_prepare(lua_State *L, VMEvent ev); 57 | LJ_FUNC void lj_vmevent_call(lua_State *L, ptrdiff_t argbase); 58 | #endif 59 | 60 | #endif 61 | -------------------------------------------------------------------------------- /src/lj_vmmath.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** Math helper functions for assembler VM. 3 | ** Copyright (C) 2005-2022 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 | /* -- Wrapper functions --------------------------------------------------- */ 17 | 18 | #if LJ_TARGET_X86 && __ELF__ && __PIC__ 19 | /* Wrapper functions to deal with the ELF/x86 PIC disaster. */ 20 | LJ_FUNCA double lj_wrap_log(double x) { return log(x); } 21 | LJ_FUNCA double lj_wrap_log10(double x) { return log10(x); } 22 | LJ_FUNCA double lj_wrap_exp(double x) { return exp(x); } 23 | LJ_FUNCA double lj_wrap_sin(double x) { return sin(x); } 24 | LJ_FUNCA double lj_wrap_cos(double x) { return cos(x); } 25 | LJ_FUNCA double lj_wrap_tan(double x) { return tan(x); } 26 | LJ_FUNCA double lj_wrap_asin(double x) { return asin(x); } 27 | LJ_FUNCA double lj_wrap_acos(double x) { return acos(x); } 28 | LJ_FUNCA double lj_wrap_atan(double x) { return atan(x); } 29 | LJ_FUNCA double lj_wrap_sinh(double x) { return sinh(x); } 30 | LJ_FUNCA double lj_wrap_cosh(double x) { return cosh(x); } 31 | LJ_FUNCA double lj_wrap_tanh(double x) { return tanh(x); } 32 | LJ_FUNCA double lj_wrap_atan2(double x, double y) { return atan2(x, y); } 33 | LJ_FUNCA double lj_wrap_pow(double x, double y) { return pow(x, y); } 34 | LJ_FUNCA double lj_wrap_fmod(double x, double y) { return fmod(x, y); } 35 | #endif 36 | 37 | /* -- Helper functions ---------------------------------------------------- */ 38 | 39 | /* Required to prevent the C compiler from applying FMA optimizations. 40 | ** 41 | ** Yes, there's -ffp-contract and the FP_CONTRACT pragma ... in theory. 42 | ** But the current state of C compilers is a mess in this regard. 43 | ** Also, this function is not performance sensitive at all. 44 | */ 45 | LJ_NOINLINE static double lj_vm_floormul(double x, double y) 46 | { 47 | return lj_vm_floor(x / y) * y; 48 | } 49 | 50 | double lj_vm_foldarith(double x, double y, int op) 51 | { 52 | switch (op) { 53 | case IR_ADD - IR_ADD: return x+y; break; 54 | case IR_SUB - IR_ADD: return x-y; break; 55 | case IR_MUL - IR_ADD: return x*y; break; 56 | case IR_DIV - IR_ADD: return x/y; break; 57 | case IR_MOD - IR_ADD: return x-lj_vm_floormul(x, y); break; 58 | case IR_POW - IR_ADD: return pow(x, y); break; 59 | case IR_NEG - IR_ADD: return -x; break; 60 | case IR_ABS - IR_ADD: return fabs(x); break; 61 | #if LJ_HASJIT 62 | case IR_LDEXP - IR_ADD: return ldexp(x, (int)y); break; 63 | case IR_MIN - IR_ADD: return x < y ? x : y; break; 64 | case IR_MAX - IR_ADD: return x > y ? x : y; break; 65 | #endif 66 | default: return x; 67 | } 68 | } 69 | 70 | /* -- Helper functions for generated machine code ------------------------- */ 71 | 72 | #if (LJ_HASJIT && !(LJ_TARGET_ARM || LJ_TARGET_ARM64 || LJ_TARGET_PPC)) || LJ_TARGET_MIPS 73 | int32_t LJ_FASTCALL lj_vm_modi(int32_t a, int32_t b) 74 | { 75 | uint32_t y, ua, ub; 76 | /* This must be checked before using this function. */ 77 | lj_assertX(b != 0, "modulo with zero divisor"); 78 | ua = a < 0 ? ~(uint32_t)a+1u : (uint32_t)a; 79 | ub = b < 0 ? ~(uint32_t)b+1u : (uint32_t)b; 80 | y = ua % ub; 81 | if (y != 0 && (a^b) < 0) y = y - ub; 82 | if (((int32_t)y^b) < 0) y = ~y+1u; 83 | return (int32_t)y; 84 | } 85 | #endif 86 | 87 | #if LJ_HASJIT 88 | 89 | #ifdef LUAJIT_NO_LOG2 90 | double lj_vm_log2(double a) 91 | { 92 | return log(a) * 1.4426950408889634074; 93 | } 94 | #endif 95 | 96 | /* Computes fpm(x) for extended math functions. */ 97 | double lj_vm_foldfpm(double x, int fpm) 98 | { 99 | switch (fpm) { 100 | case IRFPM_FLOOR: return lj_vm_floor(x); 101 | case IRFPM_CEIL: return lj_vm_ceil(x); 102 | case IRFPM_TRUNC: return lj_vm_trunc(x); 103 | case IRFPM_SQRT: return sqrt(x); 104 | case IRFPM_LOG: return log(x); 105 | case IRFPM_LOG2: return lj_vm_log2(x); 106 | default: lj_assertX(0, "bad fpm %d", fpm); 107 | } 108 | return 0; 109 | } 110 | 111 | #if LJ_HASFFI 112 | int lj_vm_errno(void) 113 | { 114 | return errno; 115 | } 116 | #endif 117 | 118 | #endif 119 | -------------------------------------------------------------------------------- /src/ljamalg.c: -------------------------------------------------------------------------------- 1 | /* 2 | ** LuaJIT core and libraries amalgamation. 3 | ** Copyright (C) 2005-2022 Mike Pall. See Copyright Notice in luajit.h 4 | */ 5 | 6 | #define ljamalg_c 7 | #define LUA_CORE 8 | 9 | /* To get the mremap prototype. Must be defined before any system includes. */ 10 | #if defined(__linux__) && !defined(_GNU_SOURCE) 11 | #define _GNU_SOURCE 12 | #endif 13 | 14 | #ifndef WINVER 15 | #define WINVER 0x0501 16 | #endif 17 | 18 | #include "lua.h" 19 | #include "lauxlib.h" 20 | 21 | #include "lj_assert.c" 22 | #include "lj_gc.c" 23 | #include "lj_err.c" 24 | #include "lj_char.c" 25 | #include "lj_bc.c" 26 | #include "lj_obj.c" 27 | #include "lj_buf.c" 28 | #include "lj_str.c" 29 | #include "lj_tab.c" 30 | #include "lj_func.c" 31 | #include "lj_udata.c" 32 | #include "lj_meta.c" 33 | #include "lj_debug.c" 34 | #include "lj_prng.c" 35 | #include "lj_state.c" 36 | #include "lj_dispatch.c" 37 | #include "lj_vmevent.c" 38 | #include "lj_vmmath.c" 39 | #include "lj_strscan.c" 40 | #include "lj_strfmt.c" 41 | #include "lj_strfmt_num.c" 42 | #include "lj_serialize.c" 43 | #include "lj_api.c" 44 | #include "lj_profile.c" 45 | #include "lj_lex.c" 46 | #include "lj_parse.c" 47 | #include "lj_bcread.c" 48 | #include "lj_bcwrite.c" 49 | #include "lj_load.c" 50 | #include "lj_ctype.c" 51 | #include "lj_cdata.c" 52 | #include "lj_cconv.c" 53 | #include "lj_ccall.c" 54 | #include "lj_ccallback.c" 55 | #include "lj_carith.c" 56 | #include "lj_clib.c" 57 | #include "lj_cparse.c" 58 | #include "lj_lib.c" 59 | #include "lj_ir.c" 60 | #include "lj_opt_mem.c" 61 | #include "lj_opt_fold.c" 62 | #include "lj_opt_narrow.c" 63 | #include "lj_opt_dce.c" 64 | #include "lj_opt_loop.c" 65 | #include "lj_opt_split.c" 66 | #include "lj_opt_sink.c" 67 | #include "lj_mcode.c" 68 | #include "lj_snap.c" 69 | #include "lj_record.c" 70 | #include "lj_crecord.c" 71 | #include "lj_ffrecord.c" 72 | #include "lj_asm.c" 73 | #include "lj_trace.c" 74 | #include "lj_gdbjit.c" 75 | #include "lj_alloc.c" 76 | 77 | #include "lib_aux.c" 78 | #include "lib_base.c" 79 | #include "lib_math.c" 80 | #include "lib_string.c" 81 | #include "lib_table.c" 82 | #include "lib_io.c" 83 | #include "lib_os.c" 84 | #include "lib_package.c" 85 | #include "lib_debug.c" 86 | #include "lib_bit.c" 87 | #include "lib_jit.c" 88 | #include "lib_ffi.c" 89 | #include "lib_buffer.c" 90 | #include "lib_init.c" 91 | 92 | -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /src/luaconf.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Configuration header. 3 | ** Copyright (C) 2005-2022 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.1.0-beta3/" 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 "\n" 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 | /* Configuration for the frontend (the luajit executable). */ 96 | #if defined(luajit_c) 97 | #define LUA_PROGNAME "luajit" /* Fallback frontend name. */ 98 | #define LUA_PROMPT "> " /* Interactive prompt. */ 99 | #define LUA_PROMPT2 ">> " /* Continuation prompt. */ 100 | #define LUA_MAXINPUT 512 /* Max. input line length. */ 101 | #endif 102 | 103 | /* Note: changing the following defines breaks the Lua 5.1 ABI. */ 104 | #define LUA_INTEGER ptrdiff_t 105 | #define LUA_IDSIZE 60 /* Size of lua_Debug.short_src. */ 106 | /* 107 | ** Size of lauxlib and io.* on-stack buffers. Weird workaround to avoid using 108 | ** unreasonable amounts of stack space, but still retain ABI compatibility. 109 | ** Blame Lua for depending on BUFSIZ in the ABI, blame **** for wrecking it. 110 | */ 111 | #define LUAL_BUFFERSIZE (BUFSIZ > 16384 ? 8192 : BUFSIZ) 112 | 113 | /* The following defines are here only for compatibility with luaconf.h 114 | ** from the standard Lua distribution. They must not be changed for LuaJIT. 115 | */ 116 | #define LUA_NUMBER_DOUBLE 117 | #define LUA_NUMBER double 118 | #define LUAI_UACNUMBER double 119 | #define LUA_NUMBER_SCAN "%lf" 120 | #define LUA_NUMBER_FMT "%.14g" 121 | #define lua_number2str(s, n) sprintf((s), LUA_NUMBER_FMT, (n)) 122 | #define LUAI_MAXNUMBER2STR 32 123 | #define LUA_INTFRMLEN "l" 124 | #define LUA_INTFRM_T long 125 | 126 | /* Linkage of public API functions. */ 127 | #if defined(LUA_BUILD_AS_DLL) 128 | #if defined(LUA_CORE) || defined(LUA_LIB) 129 | #define LUA_API __declspec(dllexport) 130 | #else 131 | #define LUA_API __declspec(dllimport) 132 | #endif 133 | #else 134 | #define LUA_API extern 135 | #endif 136 | 137 | #define LUALIB_API LUA_API 138 | 139 | /* Compatibility support for assertions. */ 140 | #if defined(LUA_USE_ASSERT) || defined(LUA_USE_APICHECK) 141 | #include 142 | #endif 143 | #ifdef LUA_USE_ASSERT 144 | #define lua_assert(x) assert(x) 145 | #endif 146 | #ifdef LUA_USE_APICHECK 147 | #define luai_apicheck(L, o) { (void)L; assert(o); } 148 | #else 149 | #define luai_apicheck(L, o) { (void)L; } 150 | #endif 151 | 152 | #endif 153 | -------------------------------------------------------------------------------- /src/luajit.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** LuaJIT -- a Just-In-Time Compiler for Lua. https://luajit.org/ 3 | ** 4 | ** Copyright (C) 2005-2022 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: https://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.1.0-beta3" 34 | #define LUAJIT_VERSION_NUM 20100 /* Version 2.1.0 = 02.01.00. */ 35 | #define LUAJIT_VERSION_SYM luaJIT_version_2_1_0_beta3 36 | #define LUAJIT_COPYRIGHT "Copyright (C) 2005-2022 Mike Pall" 37 | #define LUAJIT_URL "https://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 | /* Low-overhead profiling API. */ 68 | typedef void (*luaJIT_profile_callback)(void *data, lua_State *L, 69 | int samples, int vmstate); 70 | LUA_API void luaJIT_profile_start(lua_State *L, const char *mode, 71 | luaJIT_profile_callback cb, void *data); 72 | LUA_API void luaJIT_profile_stop(lua_State *L); 73 | LUA_API const char *luaJIT_profile_dumpstack(lua_State *L, const char *fmt, 74 | int depth, size_t *len); 75 | 76 | /* Enforce (dynamic) linker error for version mismatches. Call from main. */ 77 | LUA_API void LUAJIT_VERSION_SYM(void); 78 | 79 | #endif 80 | -------------------------------------------------------------------------------- /src/lualib.h: -------------------------------------------------------------------------------- 1 | /* 2 | ** Standard library header. 3 | ** Copyright (C) 2005-2022 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 | LUALIB_API int luaopen_string_buffer(lua_State *L); 37 | 38 | LUALIB_API void luaL_openlibs(lua_State *L); 39 | 40 | #ifndef lua_assert 41 | #define lua_assert(x) ((void)0) 42 | #endif 43 | 44 | #endif 45 | -------------------------------------------------------------------------------- /src/msvcbuild.bat: -------------------------------------------------------------------------------- 1 | @rem Script to build LuaJIT with MSVC. 2 | @rem Copyright (C) 2005-2022 Mike Pall. See Copyright Notice in luajit.h 3 | @rem 4 | @rem Open a "Visual Studio Command Prompt" (either x86 or x64). 5 | @rem Then cd to this directory and run this script. Use the following 6 | @rem options (in order), if needed. The default is a dynamic release build. 7 | @rem 8 | @rem nogc64 disable LJ_GC64 mode for x64 9 | @rem debug emit debug symbols 10 | @rem amalg amalgamated build 11 | @rem static static linkage 12 | 13 | @if not defined INCLUDE goto :FAIL 14 | 15 | @setlocal 16 | @rem Add more debug flags here, e.g. DEBUGCFLAGS=/DLUA_USE_APICHECK 17 | @set DEBUGCFLAGS= 18 | @set LJCOMPILE=cl /nologo /c /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE /D_CRT_STDIO_INLINE=__declspec(dllexport)__inline 19 | @set LJLINK=link /nologo 20 | @set LJMT=mt /nologo 21 | @set LJLIB=lib /nologo /nodefaultlib 22 | @set DASMDIR=..\dynasm 23 | @set DASM=%DASMDIR%\dynasm.lua 24 | @set DASC=vm_x64.dasc 25 | @set LJDLLNAME=lua51.dll 26 | @set LJLIBNAME=lua51.lib 27 | @set BUILDTYPE=release 28 | @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 lib_buffer.c 29 | 30 | %LJCOMPILE% host\minilua.c 31 | @if errorlevel 1 goto :BAD 32 | %LJLINK% /out:minilua.exe minilua.obj 33 | @if errorlevel 1 goto :BAD 34 | if exist minilua.exe.manifest^ 35 | %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe 36 | 37 | @set DASMFLAGS=-D WIN -D JIT -D FFI -D P64 38 | @set LJARCH=x64 39 | @minilua 40 | @if errorlevel 8 goto :X64 41 | @set DASC=vm_x86.dasc 42 | @set DASMFLAGS=-D WIN -D JIT -D FFI 43 | @set LJARCH=x86 44 | @set LJCOMPILE=%LJCOMPILE% /arch:SSE2 45 | :X64 46 | @if "%1" neq "nogc64" goto :GC64 47 | @shift 48 | @set DASC=vm_x86.dasc 49 | @set LJCOMPILE=%LJCOMPILE% /DLUAJIT_DISABLE_GC64 50 | :GC64 51 | minilua %DASM% -LN %DASMFLAGS% -o host\buildvm_arch.h %DASC% 52 | @if errorlevel 1 goto :BAD 53 | 54 | %LJCOMPILE% /I "." /I %DASMDIR% host\buildvm*.c 55 | @if errorlevel 1 goto :BAD 56 | %LJLINK% /out:buildvm.exe buildvm*.obj 57 | @if errorlevel 1 goto :BAD 58 | if exist buildvm.exe.manifest^ 59 | %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe 60 | 61 | buildvm -m peobj -o lj_vm.obj 62 | @if errorlevel 1 goto :BAD 63 | buildvm -m bcdef -o lj_bcdef.h %ALL_LIB% 64 | @if errorlevel 1 goto :BAD 65 | buildvm -m ffdef -o lj_ffdef.h %ALL_LIB% 66 | @if errorlevel 1 goto :BAD 67 | buildvm -m libdef -o lj_libdef.h %ALL_LIB% 68 | @if errorlevel 1 goto :BAD 69 | buildvm -m recdef -o lj_recdef.h %ALL_LIB% 70 | @if errorlevel 1 goto :BAD 71 | buildvm -m vmdef -o jit\vmdef.lua %ALL_LIB% 72 | @if errorlevel 1 goto :BAD 73 | buildvm -m folddef -o lj_folddef.h lj_opt_fold.c 74 | @if errorlevel 1 goto :BAD 75 | 76 | @if "%1" neq "debug" goto :NODEBUG 77 | @shift 78 | @set BUILDTYPE=debug 79 | @set LJCOMPILE=%LJCOMPILE% /Zi %DEBUGCFLAGS% 80 | @set LJLINK=%LJLINK% /opt:ref /opt:icf /incremental:no 81 | :NODEBUG 82 | @set LJLINK=%LJLINK% /%BUILDTYPE% 83 | @if "%1"=="amalg" goto :AMALGDLL 84 | @if "%1"=="static" goto :STATIC 85 | %LJCOMPILE% /MD /DLUA_BUILD_AS_DLL lj_*.c lib_*.c 86 | @if errorlevel 1 goto :BAD 87 | %LJLINK% /DLL /out:%LJDLLNAME% lj_*.obj lib_*.obj 88 | @if errorlevel 1 goto :BAD 89 | @goto :MTDLL 90 | :STATIC 91 | %LJCOMPILE% lj_*.c lib_*.c 92 | @if errorlevel 1 goto :BAD 93 | %LJLIB% /OUT:%LJLIBNAME% lj_*.obj lib_*.obj 94 | @if errorlevel 1 goto :BAD 95 | @goto :MTDLL 96 | :AMALGDLL 97 | %LJCOMPILE% /MD /DLUA_BUILD_AS_DLL ljamalg.c 98 | @if errorlevel 1 goto :BAD 99 | %LJLINK% /DLL /out:%LJDLLNAME% ljamalg.obj lj_vm.obj 100 | @if errorlevel 1 goto :BAD 101 | :MTDLL 102 | if exist %LJDLLNAME%.manifest^ 103 | %LJMT% -manifest %LJDLLNAME%.manifest -outputresource:%LJDLLNAME%;2 104 | 105 | %LJCOMPILE% luajit.c 106 | @if errorlevel 1 goto :BAD 107 | %LJLINK% /out:luajit.exe luajit.obj %LJLIBNAME% 108 | @if errorlevel 1 goto :BAD 109 | if exist luajit.exe.manifest^ 110 | %LJMT% -manifest luajit.exe.manifest -outputresource:luajit.exe 111 | 112 | @del *.obj *.manifest minilua.exe buildvm.exe 113 | @del host\buildvm_arch.h 114 | @del lj_bcdef.h lj_ffdef.h lj_libdef.h lj_recdef.h lj_folddef.h 115 | @echo. 116 | @echo === Successfully built LuaJIT for Windows/%LJARCH% === 117 | 118 | @goto :END 119 | :BAD 120 | @echo. 121 | @echo ******************************************************* 122 | @echo *** Build FAILED -- Please check the error messages *** 123 | @echo ******************************************************* 124 | @goto :END 125 | :FAIL 126 | @echo You must open a "Visual Studio Command Prompt" to run this script 127 | :END 128 | -------------------------------------------------------------------------------- /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 or "VS2015 x64 Native Tools Command Prompt". 6 | @rem 7 | @rem Then cd to this directory and run this script. 8 | @rem 9 | @rem Recommended invocation: 10 | @rem 11 | @rem ps4build release build, amalgamated, 64-bit GC 12 | @rem ps4build debug debug build, amalgamated, 64-bit GC 13 | @rem 14 | @rem Additional command-line options (not generally recommended): 15 | @rem 16 | @rem gc32 (before debug) 32-bit GC 17 | @rem noamalg (after debug) non-amalgamated build 18 | 19 | @if not defined INCLUDE goto :FAIL 20 | @if not defined SCE_ORBIS_SDK_DIR goto :FAIL 21 | 22 | @setlocal 23 | @rem ---- Host compiler ---- 24 | @set LJCOMPILE=cl /nologo /c /MD /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE 25 | @set LJLINK=link /nologo 26 | @set LJMT=mt /nologo 27 | @set DASMDIR=..\dynasm 28 | @set DASM=%DASMDIR%\dynasm.lua 29 | @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 lib_buffer.c 30 | @set GC64= 31 | @set DASC=vm_x64.dasc 32 | 33 | @if "%1" neq "gc32" goto :NOGC32 34 | @shift 35 | @set GC64=-DLUAJIT_DISABLE_GC64 36 | @set DASC=vm_x86.dasc 37 | :NOGC32 38 | 39 | %LJCOMPILE% host\minilua.c 40 | @if errorlevel 1 goto :BAD 41 | %LJLINK% /out:minilua.exe minilua.obj 42 | @if errorlevel 1 goto :BAD 43 | if exist minilua.exe.manifest^ 44 | %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe 45 | 46 | @rem Check for 64 bit host compiler. 47 | @minilua 48 | @if not errorlevel 8 goto :FAIL 49 | 50 | @set DASMFLAGS=-D P64 -D NO_UNWIND 51 | minilua %DASM% -LN %DASMFLAGS% -o host\buildvm_arch.h %DASC% 52 | @if errorlevel 1 goto :BAD 53 | 54 | %LJCOMPILE% /I "." /I %DASMDIR% %GC64% -DLUAJIT_TARGET=LUAJIT_ARCH_X64 -DLUAJIT_OS=LUAJIT_OS_OTHER -DLUAJIT_DISABLE_JIT -DLUAJIT_DISABLE_FFI -DLUAJIT_USE_SYSMALLOC -DLUAJIT_NO_UNWIND host\buildvm*.c 55 | @if errorlevel 1 goto :BAD 56 | %LJLINK% /out:buildvm.exe buildvm*.obj 57 | @if errorlevel 1 goto :BAD 58 | if exist buildvm.exe.manifest^ 59 | %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe 60 | 61 | buildvm -m elfasm -o lj_vm.s 62 | @if errorlevel 1 goto :BAD 63 | buildvm -m bcdef -o lj_bcdef.h %ALL_LIB% 64 | @if errorlevel 1 goto :BAD 65 | buildvm -m ffdef -o lj_ffdef.h %ALL_LIB% 66 | @if errorlevel 1 goto :BAD 67 | buildvm -m libdef -o lj_libdef.h %ALL_LIB% 68 | @if errorlevel 1 goto :BAD 69 | buildvm -m recdef -o lj_recdef.h %ALL_LIB% 70 | @if errorlevel 1 goto :BAD 71 | buildvm -m vmdef -o jit\vmdef.lua %ALL_LIB% 72 | @if errorlevel 1 goto :BAD 73 | buildvm -m folddef -o lj_folddef.h lj_opt_fold.c 74 | @if errorlevel 1 goto :BAD 75 | 76 | @rem ---- Cross compiler ---- 77 | @set LJCOMPILE="%SCE_ORBIS_SDK_DIR%\host_tools\bin\orbis-clang" -c -Wall -DLUAJIT_DISABLE_FFI %GC64% 78 | @set LJLIB="%SCE_ORBIS_SDK_DIR%\host_tools\bin\orbis-ar" rcus 79 | @set INCLUDE="" 80 | 81 | "%SCE_ORBIS_SDK_DIR%\host_tools\bin\orbis-as" -o lj_vm.o lj_vm.s 82 | 83 | @if "%1" neq "debug" goto :NODEBUG 84 | @shift 85 | @set LJCOMPILE=%LJCOMPILE% -g -O0 86 | @set TARGETLIB=libluajitD_ps4.a 87 | goto :BUILD 88 | :NODEBUG 89 | @set LJCOMPILE=%LJCOMPILE% -O2 90 | @set TARGETLIB=libluajit_ps4.a 91 | :BUILD 92 | del %TARGETLIB% 93 | @if "%1" neq "noamalg" goto :AMALG 94 | for %%f in (lj_*.c lib_*.c) do ( 95 | %LJCOMPILE% %%f 96 | @if errorlevel 1 goto :BAD 97 | ) 98 | 99 | %LJLIB% %TARGETLIB% lj_*.o lib_*.o 100 | @if errorlevel 1 goto :BAD 101 | @goto :NOAMALG 102 | :AMALG 103 | %LJCOMPILE% ljamalg.c 104 | @if errorlevel 1 goto :BAD 105 | %LJLIB% %TARGETLIB% ljamalg.o lj_vm.o 106 | @if errorlevel 1 goto :BAD 107 | :NOAMALG 108 | 109 | @del *.o *.obj *.manifest minilua.exe buildvm.exe 110 | @echo. 111 | @echo === Successfully built LuaJIT for PS4 === 112 | 113 | @goto :END 114 | :BAD 115 | @echo. 116 | @echo ******************************************************* 117 | @echo *** Build FAILED -- Please check the error messages *** 118 | @echo ******************************************************* 119 | @goto :END 120 | :FAIL 121 | @echo To run this script you must open a "Visual Studio .NET Command Prompt" 122 | @echo (64 bit host compiler). The PS4 Orbis SDK must be installed, too. 123 | :END 124 | -------------------------------------------------------------------------------- /src/ps5build.bat: -------------------------------------------------------------------------------- 1 | @rem Script to build LuaJIT with the PS5 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 or "VS20xx x64 Native Tools Command Prompt". 6 | @rem 7 | @rem Then cd to this directory and run this script. 8 | @rem 9 | @rem Recommended invocation: 10 | @rem 11 | @rem ps5build release build, amalgamated, 64-bit GC 12 | @rem ps5build debug debug build, amalgamated, 64-bit GC 13 | @rem 14 | @rem Additional command-line options (not generally recommended): 15 | @rem 16 | @rem gc32 (before debug) 32-bit GC 17 | @rem noamalg (after debug) non-amalgamated build 18 | 19 | @if not defined INCLUDE goto :FAIL 20 | @if not defined SCE_PROSPERO_SDK_DIR goto :FAIL 21 | 22 | @setlocal 23 | @rem ---- Host compiler ---- 24 | @set LJCOMPILE=cl /nologo /c /MD /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE 25 | @set LJLINK=link /nologo 26 | @set LJMT=mt /nologo 27 | @set DASMDIR=..\dynasm 28 | @set DASM=%DASMDIR%\dynasm.lua 29 | @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 lib_buffer.c 30 | @set GC64= 31 | @set DASC=vm_x64.dasc 32 | 33 | @if "%1" neq "gc32" goto :NOGC32 34 | @shift 35 | @set GC64=-DLUAJIT_DISABLE_GC64 36 | @set DASC=vm_x86.dasc 37 | :NOGC32 38 | 39 | %LJCOMPILE% host\minilua.c 40 | @if errorlevel 1 goto :BAD 41 | %LJLINK% /out:minilua.exe minilua.obj 42 | @if errorlevel 1 goto :BAD 43 | if exist minilua.exe.manifest^ 44 | %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe 45 | 46 | @rem Check for 64 bit host compiler. 47 | @minilua 48 | @if not errorlevel 8 goto :FAIL 49 | 50 | @set DASMFLAGS=-D P64 -D NO_UNWIND 51 | minilua %DASM% -LN %DASMFLAGS% -o host\buildvm_arch.h %DASC% 52 | @if errorlevel 1 goto :BAD 53 | 54 | %LJCOMPILE% /I "." /I %DASMDIR% %GC64% -DLUAJIT_TARGET=LUAJIT_ARCH_X64 -DLUAJIT_OS=LUAJIT_OS_OTHER -DLUAJIT_DISABLE_JIT -DLUAJIT_DISABLE_FFI -DLUAJIT_NO_UNWIND host\buildvm*.c 55 | @if errorlevel 1 goto :BAD 56 | %LJLINK% /out:buildvm.exe buildvm*.obj 57 | @if errorlevel 1 goto :BAD 58 | if exist buildvm.exe.manifest^ 59 | %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe 60 | 61 | buildvm -m elfasm -o lj_vm.s 62 | @if errorlevel 1 goto :BAD 63 | buildvm -m bcdef -o lj_bcdef.h %ALL_LIB% 64 | @if errorlevel 1 goto :BAD 65 | buildvm -m ffdef -o lj_ffdef.h %ALL_LIB% 66 | @if errorlevel 1 goto :BAD 67 | buildvm -m libdef -o lj_libdef.h %ALL_LIB% 68 | @if errorlevel 1 goto :BAD 69 | buildvm -m recdef -o lj_recdef.h %ALL_LIB% 70 | @if errorlevel 1 goto :BAD 71 | buildvm -m vmdef -o jit\vmdef.lua %ALL_LIB% 72 | @if errorlevel 1 goto :BAD 73 | buildvm -m folddef -o lj_folddef.h lj_opt_fold.c 74 | @if errorlevel 1 goto :BAD 75 | 76 | @rem ---- Cross compiler ---- 77 | @set LJCOMPILE="%SCE_PROSPERO_SDK_DIR%\host_tools\bin\prospero-clang" -c -Wall -DLUAJIT_DISABLE_FFI -DLUAJIT_USE_SYSMALLOC %GC64% 78 | @set LJLIB="%SCE_PROSPERO_SDK_DIR%\host_tools\bin\prospero-llvm-ar" rcus 79 | @set INCLUDE="" 80 | 81 | "%SCE_PROSPERO_SDK_DIR%\host_tools\bin\prospero-clang" -c -o lj_vm.o lj_vm.s 82 | 83 | @if "%1" neq "debug" goto :NODEBUG 84 | @shift 85 | @set LJCOMPILE=%LJCOMPILE% -g -O0 86 | @set TARGETLIB=libluajitD_ps5.a 87 | goto :BUILD 88 | :NODEBUG 89 | @set LJCOMPILE=%LJCOMPILE% -O2 90 | @set TARGETLIB=libluajit_ps5.a 91 | :BUILD 92 | del %TARGETLIB% 93 | @if "%1" neq "noamalg" goto :AMALG 94 | for %%f in (lj_*.c lib_*.c) do ( 95 | %LJCOMPILE% %%f 96 | @if errorlevel 1 goto :BAD 97 | ) 98 | 99 | %LJLIB% %TARGETLIB% lj_*.o lib_*.o 100 | @if errorlevel 1 goto :BAD 101 | @goto :NOAMALG 102 | :AMALG 103 | %LJCOMPILE% ljamalg.c 104 | @if errorlevel 1 goto :BAD 105 | %LJLIB% %TARGETLIB% ljamalg.o lj_vm.o 106 | @if errorlevel 1 goto :BAD 107 | :NOAMALG 108 | 109 | @del *.o *.obj *.manifest minilua.exe buildvm.exe 110 | @echo. 111 | @echo === Successfully built LuaJIT for PS5 === 112 | 113 | @goto :END 114 | :BAD 115 | @echo. 116 | @echo ******************************************************* 117 | @echo *** Build FAILED -- Please check the error messages *** 118 | @echo ******************************************************* 119 | @goto :END 120 | :FAIL 121 | @echo To run this script you must open a "Visual Studio .NET Command Prompt" 122 | @echo (64 bit host compiler). The PS5 Prospero SDK must be installed, too. 123 | :END 124 | -------------------------------------------------------------------------------- /src/psvitabuild.bat: -------------------------------------------------------------------------------- 1 | @rem Script to build LuaJIT with the PS Vita 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 SCE_PSP2_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 lib_buffer.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 32 bit host compiler. 27 | @minilua 28 | @if errorlevel 8 goto :FAIL 29 | 30 | @set DASMFLAGS=-D FPU -D HFABI 31 | minilua %DASM% -LN %DASMFLAGS% -o host\buildvm_arch.h vm_arm.dasc 32 | @if errorlevel 1 goto :BAD 33 | 34 | %LJCOMPILE% /I "." /I %DASMDIR% -DLUAJIT_TARGET=LUAJIT_ARCH_ARM -DLUAJIT_OS=LUAJIT_OS_OTHER -DLUAJIT_DISABLE_JIT -DLUAJIT_DISABLE_FFI -DLJ_TARGET_PSVITA=1 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_PSP2_SDK_DIR%\host_tools\build\bin\psp2snc" -c -w -DLUAJIT_DISABLE_FFI -DLUAJIT_USE_SYSMALLOC 58 | @set LJLIB="%SCE_PSP2_SDK_DIR%\host_tools\build\bin\psp2ld32" -r --output= 59 | @set INCLUDE="" 60 | 61 | "%SCE_PSP2_SDK_DIR%\host_tools\build\bin\psp2as" -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 | 74 | %LJCOMPILE% ljamalg.c 75 | @if errorlevel 1 goto :BAD 76 | %LJLIB%%TARGETLIB% ljamalg.o lj_vm.o 77 | @if errorlevel 1 goto :BAD 78 | 79 | @del *.o *.obj *.manifest minilua.exe buildvm.exe 80 | @echo. 81 | @echo === Successfully built LuaJIT for PS Vita === 82 | 83 | @goto :END 84 | :BAD 85 | @echo. 86 | @echo ******************************************************* 87 | @echo *** Build FAILED -- Please check the error messages *** 88 | @echo ******************************************************* 89 | @goto :END 90 | :FAIL 91 | @echo To run this script you must open a "Visual Studio .NET Command Prompt" 92 | @echo (32 bit host compiler). The PS Vita SDK must be installed, too. 93 | :END 94 | -------------------------------------------------------------------------------- /src/xb1build.bat: -------------------------------------------------------------------------------- 1 | @rem Script to build LuaJIT with the Xbox One 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 DurangoXDK goto :FAIL 9 | 10 | @setlocal 11 | @echo ---- 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 lib_buffer.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 not errorlevel 8 goto :FAIL 29 | 30 | @set DASMFLAGS=-D WIN -D FFI -D P64 31 | minilua %DASM% -LN %DASMFLAGS% -o host\buildvm_arch.h vm_x64.dasc 32 | @if errorlevel 1 goto :BAD 33 | 34 | %LJCOMPILE% /I "." /I %DASMDIR% /D_DURANGO 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 | @echo ---- Cross compiler ---- 57 | 58 | @set CWD=%cd% 59 | @call "%DurangoXDK%\xdk\DurangoVars.cmd" XDK 60 | @cd /D "%CWD%" 61 | @shift 62 | 63 | @set LJCOMPILE="cl" /nologo /c /W3 /GF /Gm- /GR- /GS- /Gy /openmp- /D_CRT_SECURE_NO_DEPRECATE /D_LIB /D_UNICODE /D_DURANGO 64 | @set LJLIB="lib" /nologo 65 | 66 | @if "%1"=="debug" ( 67 | @shift 68 | @set LJCOMPILE=%LJCOMPILE% /Zi /MDd /Od 69 | @set LJLINK=%LJLINK% /debug 70 | ) else ( 71 | @set LJCOMPILE=%LJCOMPILE% /MD /O2 /DNDEBUG 72 | ) 73 | 74 | @if "%1"=="amalg" goto :AMALG 75 | %LJCOMPILE% /DLUA_BUILD_AS_DLL lj_*.c lib_*.c 76 | @if errorlevel 1 goto :BAD 77 | %LJLIB% /OUT:luajit.lib lj_*.obj lib_*.obj 78 | @if errorlevel 1 goto :BAD 79 | @goto :NOAMALG 80 | :AMALG 81 | %LJCOMPILE% /DLUA_BUILD_AS_DLL ljamalg.c 82 | @if errorlevel 1 goto :BAD 83 | %LJLIB% /OUT:luajit.lib ljamalg.obj lj_vm.obj 84 | @if errorlevel 1 goto :BAD 85 | :NOAMALG 86 | 87 | @del *.obj *.manifest minilua.exe buildvm.exe 88 | @echo. 89 | @echo === Successfully built LuaJIT for Xbox One === 90 | 91 | @goto :END 92 | :BAD 93 | @echo. 94 | @echo ******************************************************* 95 | @echo *** Build FAILED -- Please check the error messages *** 96 | @echo ******************************************************* 97 | @goto :END 98 | :FAIL 99 | @echo To run this script you must open a "Visual Studio .NET Command Prompt" 100 | @echo (64 bit host compiler). The Xbox One SDK must be installed, too. 101 | :END 102 | -------------------------------------------------------------------------------- /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 lib_buffer.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 | --------------------------------------------------------------------------------