Compare commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
2800685cfc | ||
|
|
c479d9d706 | ||
|
|
338fbfbeaf | ||
|
|
5ca12bb421 | ||
|
|
6c94e0c9bf | ||
|
|
83d0f6bb50 | ||
|
|
7e06fc986f | ||
|
|
3f5328371a | ||
|
|
148fcc8dab | ||
|
|
72a67d306f | ||
|
|
0dcdcc3da1 | ||
|
|
729c60c9b0 | ||
|
|
1b418caf6b | ||
|
|
d275db9bb4 | ||
|
|
21cfd7c361 | ||
|
|
5a44afcd9f | ||
|
|
3c282b5022 | ||
|
|
f4d40bd55f | ||
|
|
5d8bb3223f | ||
|
|
5e1f943a38 | ||
|
|
612431c1f1 | ||
|
|
fca7b4a837 | ||
|
|
d2bab80b29 | ||
|
|
465fea8bb3 | ||
|
|
78ab90c1a6 | ||
|
|
102e944fd5 | ||
|
|
04385d9700 | ||
|
|
d47e20b54e | ||
|
|
7ef2da5922 | ||
|
|
5638709670 | ||
|
|
9bd4a933cf | ||
|
|
e233635783 | ||
|
|
da24ba20c7 | ||
|
|
74bdabc636 | ||
|
|
4b129314d3 | ||
|
|
3a55972997 | ||
|
|
6e04e4171e | ||
|
|
4e9f9b7e0e | ||
|
|
9650139470 | ||
|
|
054a40a4b2 | ||
|
|
db67176eca | ||
|
|
0b7a4ff4e0 | ||
|
|
972ee5cf76 | ||
|
|
aef02cb347 | ||
|
|
36e485b2a3 | ||
|
|
d23c51e707 | ||
|
|
0db437aadd | ||
|
|
e351c1e62a | ||
|
|
b541de4f8c | ||
|
|
604bc40021 | ||
|
|
be8ddebd80 | ||
|
|
02feb3ad5c | ||
|
|
49f13d2a59 | ||
|
|
b2a36850cb | ||
|
|
8353c1efdd | ||
|
|
d19a2e0912 | ||
|
|
07432c0381 | ||
|
|
4fb3b63152 | ||
|
|
85b736620a | ||
|
|
9f770993d4 | ||
|
|
4bd02ad325 | ||
|
|
6e7b45d15c | ||
|
|
99ebca51d5 | ||
|
|
24eb888af3 | ||
|
|
09ce33abb9 | ||
|
|
044ff158a1 | ||
|
|
36c68d055c | ||
|
|
ddf7d7cdcb | ||
|
|
38950d580f | ||
|
|
707701f317 | ||
|
|
09507d635b | ||
|
|
ab85d6a693 | ||
|
|
5011b17f88 | ||
|
|
7bef45f701 | ||
|
|
40cbce8f9f | ||
|
|
70a70084c9 | ||
|
|
b6da6359d3 | ||
|
|
97075ca5c5 | ||
|
|
e94737945a | ||
|
|
57f15e0213 | ||
|
|
2eae9b197c | ||
|
|
68c7620349 | ||
|
|
7a3faf34e7 | ||
|
|
d401644447 | ||
|
|
dfc349b230 | ||
|
|
be3e5a964d | ||
|
|
687d2bd894 | ||
|
|
78b642cf2d | ||
|
|
cb3b6ca34b | ||
|
|
ad15bf0ea3 | ||
|
|
56021ed999 | ||
|
|
3d22a5906f | ||
|
|
b6d771b48f | ||
|
|
ab30fb2e5e | ||
|
|
618d9e4cdf | ||
|
|
bf78ad9c75 | ||
|
|
918a4e8cd9 | ||
|
|
e90c84c9ac | ||
|
|
a9209a4887 | ||
|
|
0a3e7ba09f | ||
|
|
eb132b08c0 | ||
|
|
82407c3560 | ||
|
|
f1a8210663 | ||
|
|
1d722be4bc | ||
|
|
62a660bfe1 | ||
|
|
2984795175 | ||
|
|
da706d89a5 | ||
|
|
a8005d5cec | ||
|
|
793ccff6e6 | ||
|
|
e7db9bf1fd | ||
|
|
88d62c93a1 | ||
|
|
d73532d019 | ||
|
|
84d3d23936 | ||
|
|
717947843b | ||
|
|
968584a316 | ||
|
|
ccd67f621a | ||
|
|
80b301dbbe | ||
|
|
001e61d39d | ||
|
|
19c98a436a | ||
|
|
8dd6d7cfdd | ||
|
|
7456b6e02c | ||
|
|
5e8096f74c | ||
|
|
6af77afc44 | ||
|
|
42eeb7bdf5 | ||
|
|
6f4b1e5125 | ||
|
|
22e65cdda8 | ||
|
|
9d342d0f3d | ||
|
|
9583bed718 | ||
|
|
b69ce75712 | ||
|
|
a1cd19b023 | ||
|
|
6e50710b25 | ||
|
|
989a971d27 | ||
|
|
24ee56ce7a | ||
|
|
52f99dd9c1 | ||
|
|
6374fda570 | ||
|
|
cdd2d6323e | ||
|
|
c508a7ea78 | ||
|
|
1380a394c7 | ||
|
|
2c937099d4 | ||
|
|
0a936b3bba | ||
|
|
0a31e0a65e | ||
|
|
8627a18452 | ||
|
|
be528adea5 | ||
|
|
5eb4ed8391 | ||
|
|
9a00d30c0c | ||
|
|
71237c5e11 | ||
|
|
9c6e32a1ab | ||
|
|
1bc18801c8 | ||
|
|
221f2a956e | ||
|
|
b450abdf4d | ||
|
|
d36eed3c09 | ||
|
|
43ee791d4a | ||
|
|
c921945922 | ||
|
|
5f8c77e752 | ||
|
|
064db977aa | ||
|
|
5868cd9777 | ||
|
|
b0ddde996a | ||
|
|
e03c3766f0 | ||
|
|
953c0d7451 | ||
|
|
97b303c362 | ||
|
|
2ffe736a20 | ||
|
|
21f2032f34 | ||
|
|
2f66207205 | ||
|
|
5a14b09c1f | ||
|
|
7e9da92dbe | ||
|
|
a27550b95b | ||
|
|
556883487d | ||
|
|
96f8533479 | ||
|
|
f3cca27448 | ||
|
|
252563725d | ||
|
|
9a934a55e2 | ||
|
|
f07d5d381e | ||
|
|
3faab66ef4 | ||
|
|
2a023246be | ||
|
|
006e7fe8f8 | ||
|
|
1a7ff21a04 | ||
|
|
98cb0fdcb2 | ||
|
|
1fd7e9cdac | ||
|
|
0a2eac4d3a | ||
|
|
9ac6fffd4d | ||
|
|
da20f4a087 | ||
|
|
dbf822ced9 | ||
|
|
095842f4aa | ||
|
|
8c290d7597 | ||
|
|
8a6f4db9af | ||
|
|
99186a86db | ||
|
|
c67bf97f7b | ||
|
|
33a1540fcd | ||
|
|
529b0d643a | ||
|
|
4576efbe5c | ||
|
|
185375ece1 | ||
|
|
d11521954e | ||
|
|
41c4300ec2 | ||
|
|
51d5023f29 | ||
|
|
d2878f8834 | ||
|
|
7808159d23 | ||
|
|
e759431948 | ||
|
|
268ccce955 | ||
|
|
f2d3432bf5 | ||
|
|
2da89f1946 | ||
|
|
6153733df4 | ||
|
|
d280b39f9f | ||
|
|
236e7b8d45 | ||
|
|
dcccf672c9 | ||
|
|
03f81bed16 | ||
|
|
fc51c1ba88 | ||
|
|
83d20a72ab | ||
|
|
d50c1ab6d7 | ||
|
|
984c2ff8d6 | ||
|
|
74646acdca | ||
|
|
45ffe87ba6 | ||
|
|
37eb8cfa57 | ||
|
|
a0f903f162 | ||
|
|
8fb1775606 | ||
|
|
fab7635373 | ||
|
|
b29ca13916 | ||
|
|
f1f0782256 | ||
|
|
0e9a825f63 | ||
|
|
e13ba89f1a | ||
|
|
68ae880979 | ||
|
|
5c53a90eea | ||
|
|
55c6ba6d12 | ||
|
|
d8b2134aef | ||
|
|
c168832f8e | ||
|
|
448a603a56 | ||
|
|
2a95201c6d | ||
|
|
a73de55f96 | ||
|
|
e4a4496be6 | ||
|
|
a8f3a8dfb0 | ||
|
|
e19b9d1c60 | ||
|
|
e28ec4e7cb | ||
|
|
d0f09b467b | ||
|
|
6617382f54 | ||
|
|
dd499a410f | ||
|
|
c04ba992a7 | ||
|
|
27c053cd48 | ||
|
|
7d68c0598c | ||
|
|
201c725dc7 | ||
|
|
e47e58a982 | ||
|
|
c05068f22f | ||
|
|
f5cb473f3d | ||
|
|
c5b72f24b5 | ||
|
|
57b2316c42 | ||
|
|
fe682a8071 | ||
|
|
bf44a054a1 | ||
|
|
eca9c60d9b | ||
|
|
cf42c35b9f | ||
|
|
a364068abb | ||
|
|
e88093d9cf | ||
|
|
5e532a76cf | ||
|
|
fb9c459269 | ||
|
|
7c34733eea | ||
|
|
359befd857 | ||
|
|
a6898bd1cd | ||
|
|
ff474d18ee | ||
|
|
279dfcafc4 | ||
|
|
f15d3be263 | ||
|
|
19e5366c5b | ||
|
|
346dee019c | ||
|
|
18914f22f2 | ||
|
|
1219ecf818 | ||
|
|
b6923d0d0d | ||
|
|
393ade780c | ||
|
|
8b2e6ea17b | ||
|
|
8c31682723 | ||
|
|
7c87b5259a | ||
|
|
e8969b0645 | ||
|
|
7932c1af6f | ||
|
|
95b4228d3c | ||
|
|
a0ff44043f | ||
|
|
1e15816057 | ||
|
|
a4566e9496 | ||
|
|
18f88c28dd | ||
|
|
b8dc1b13df | ||
|
|
33c03f1e7a | ||
|
|
7e5ae71714 | ||
|
|
b574ed0b1b | ||
|
|
01c621832b | ||
|
|
608cc66d78 | ||
|
|
35103ad810 | ||
|
|
5ac0262654 | ||
|
|
c361285790 | ||
|
|
a168b5e2b9 | ||
|
|
f70c38a853 | ||
|
|
4c05c063a9 | ||
|
|
e1e45ad3ad | ||
|
|
ca9b001c9f | ||
|
|
3976d80867 | ||
|
|
1ee10457f8 | ||
|
|
116bcd0cb1 | ||
|
|
fcdccb96aa | ||
|
|
723286826b | ||
|
|
b190f09aea | ||
|
|
ff6358b031 | ||
|
|
c68c61975e | ||
|
|
7e31536ff9 | ||
|
|
c2cf6f17d1 |
No files matched your search
+8
-8
@@ -4,7 +4,6 @@
|
|||||||
*.plg
|
*.plg
|
||||||
*.suo
|
*.suo
|
||||||
*.vcproj.*.*.user
|
*.vcproj.*.*.user
|
||||||
*.kate-swp
|
|
||||||
Win32_LIB_ASM_Debug
|
Win32_LIB_ASM_Debug
|
||||||
Win32_LIB_ASM_Release
|
Win32_LIB_ASM_Release
|
||||||
*.bsc
|
*.bsc
|
||||||
@@ -14,16 +13,17 @@ Win32_LIB_ASM_Release
|
|||||||
*.dgb
|
*.dgb
|
||||||
*.debug
|
*.debug
|
||||||
*.debug.txt
|
*.debug.txt
|
||||||
/bin/VC10/
|
|
||||||
/objs/VC10/
|
|
||||||
*.user
|
*.user
|
||||||
*.db
|
*.db
|
||||||
*.opendb
|
*.opendb
|
||||||
/.vs
|
/.vs
|
||||||
/debian
|
/debian
|
||||||
/assets/debian
|
/assets/debian
|
||||||
compile.sh
|
/make
|
||||||
*.gz
|
/bin
|
||||||
.vscode/
|
/build
|
||||||
out
|
/build/*
|
||||||
build
|
/CMakeUserPresets.json
|
||||||
|
/out
|
||||||
|
/objs/VC10
|
||||||
|
*.kate-swp
|
||||||
+31
@@ -161,6 +161,37 @@ Duration is in milliseconds and is optional to set, default value is 84ms.
|
|||||||
Exactly same as P_CheckSight but uses cheaper algorithm, useful for things like nametags. Doesn't work exactly
|
Exactly same as P_CheckSight but uses cheaper algorithm, useful for things like nametags. Doesn't work exactly
|
||||||
like P_CheckSight so don't use it for anything gameplay-related.
|
like P_CheckSight so don't use it for anything gameplay-related.
|
||||||
|
|
||||||
|
## musicdef_t
|
||||||
|
|
||||||
|
Userdata structure representing a musicdef. Fields:
|
||||||
|
|
||||||
|
`musicdef.name` - song identifier ("kmap01" for example).
|
||||||
|
|
||||||
|
`musicdef.usage`, `musicdef.source` - fields from vanilla MUSICDEFS lump.
|
||||||
|
|
||||||
|
`musicdef.filename` - unused for now.
|
||||||
|
|
||||||
|
`musicdef.title`, `musicdef.alttitle`, `musicdef.authors` - fields from MUSCINFO lump.
|
||||||
|
|
||||||
|
`#musicdef` - returns integer id for musicdef (which can be used as index in `musicdefs`).
|
||||||
|
|
||||||
|
All fields are read-only.
|
||||||
|
|
||||||
|
## S_FindMusicCredit(name)
|
||||||
|
|
||||||
|
Returns musicdef corresponding to music with given identifier. For example, `S_FindMusicCredit("kmap01")` will return
|
||||||
|
musicdef for green hills music.
|
||||||
|
|
||||||
|
## musicdefs
|
||||||
|
|
||||||
|
Global table for all musicdefs, similar to mobjinfo, states, etc. Can take either integer indices,
|
||||||
|
from `0` to `#musicdefs-1`, or string indices (which is equal to calling `S_FindMusicCredit`).
|
||||||
|
|
||||||
|
## addHook("MusicCredit", function(musicdef))
|
||||||
|
|
||||||
|
Hook is called whenever `S_ShowMusicCredit` (either from game or mod) is called. Takes musicdef as only argument, returning true
|
||||||
|
will overwrite vanilla behavior (not show music credit), can be used to implement custom music credit pop-ups.
|
||||||
|
|
||||||
# Other changes
|
# Other changes
|
||||||
|
|
||||||
## P_PlayRinglossSound(source, damager)
|
## P_PlayRinglossSound(source, damager)
|
||||||
|
|||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1 +0,0 @@
|
|||||||
/lsdlsrb2
|
|
||||||
@@ -1,3 +0,0 @@
|
|||||||
/lsdlsrb2
|
|
||||||
/pnd
|
|
||||||
/*.mo
|
|
||||||
@@ -1 +0,0 @@
|
|||||||
/lsdlsrb2
|
|
||||||
@@ -1 +0,0 @@
|
|||||||
/lsdl2srb2kart
|
|
||||||
@@ -1,4 +0,0 @@
|
|||||||
*.exe
|
|
||||||
*.mo
|
|
||||||
r_opengl.dll
|
|
||||||
*.bat
|
|
||||||
@@ -1,4 +0,0 @@
|
|||||||
*.exe
|
|
||||||
*.mo
|
|
||||||
r_opengl.dll
|
|
||||||
*.bat
|
|
||||||
@@ -1,3 +0,0 @@
|
|||||||
/srb2sdl.exe
|
|
||||||
/srb2win.exe
|
|
||||||
/r_opengl.dll
|
|
||||||
@@ -1,4 +0,0 @@
|
|||||||
*.exe
|
|
||||||
*.mo
|
|
||||||
r_opengl.dll
|
|
||||||
*.bat
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -42,3 +42,4 @@ compversion() {
|
|||||||
|
|
||||||
[ -f "$path/comptime.c" ] && compversion "$@"
|
[ -f "$path/comptime.c" ] && compversion "$@"
|
||||||
exit 2
|
exit 2
|
||||||
|
|
||||||
@@ -32,7 +32,3 @@ and don't forget to build r_opengl.dll for srb2dd.
|
|||||||
Updated 2/17/2024 (v1.6 Saturn)
|
Updated 2/17/2024 (v1.6 Saturn)
|
||||||
No i threw everthing into dll-binaries
|
No i threw everthing into dll-binaries
|
||||||
theres no reason at all to have stuff spread across multiple directories
|
theres no reason at all to have stuff spread across multiple directories
|
||||||
|
|
||||||
Updated 3/19/2025 (v1.6; Neptune)
|
|
||||||
We're using some C++ code now, so we need to have a few more DLLs.
|
|
||||||
Otherwise, it's about the same as prior.
|
|
||||||
File diff suppressed because it is too large.
Load diff
@@ -0,0 +1,191 @@
|
|||||||
|
/* include/curl/curlbuild.h. Generated from curlbuild.h.in by configure. */
|
||||||
|
#ifndef __CURL_CURLBUILD_H
|
||||||
|
#define __CURL_CURLBUILD_H
|
||||||
|
/***************************************************************************
|
||||||
|
* _ _ ____ _
|
||||||
|
* Project ___| | | | _ \| |
|
||||||
|
* / __| | | | |_) | |
|
||||||
|
* | (__| |_| | _ <| |___
|
||||||
|
* \___|\___/|_| \_\_____|
|
||||||
|
*
|
||||||
|
* Copyright (C) 1998 - 2009, Daniel Stenberg, <daniel@haxx.se>, et al.
|
||||||
|
*
|
||||||
|
* This software is licensed as described in the file COPYING, which
|
||||||
|
* you should have received as part of this distribution. The terms
|
||||||
|
* are also available at http://curl.haxx.se/docs/copyright.html.
|
||||||
|
*
|
||||||
|
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
||||||
|
* copies of the Software, and permit persons to whom the Software is
|
||||||
|
* furnished to do so, under the terms of the COPYING file.
|
||||||
|
*
|
||||||
|
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
||||||
|
* KIND, either express or implied.
|
||||||
|
*
|
||||||
|
***************************************************************************/
|
||||||
|
|
||||||
|
/* ================================================================ */
|
||||||
|
/* NOTES FOR CONFIGURE CAPABLE SYSTEMS */
|
||||||
|
/* ================================================================ */
|
||||||
|
|
||||||
|
/*
|
||||||
|
* NOTE 1:
|
||||||
|
* -------
|
||||||
|
*
|
||||||
|
* Nothing in this file is intended to be modified or adjusted by the
|
||||||
|
* curl library user nor by the curl library builder.
|
||||||
|
*
|
||||||
|
* If you think that something actually needs to be changed, adjusted
|
||||||
|
* or fixed in this file, then, report it on the libcurl development
|
||||||
|
* mailing list: http://cool.haxx.se/mailman/listinfo/curl-library/
|
||||||
|
*
|
||||||
|
* This header file shall only export symbols which are 'curl' or 'CURL'
|
||||||
|
* prefixed, otherwise public name space would be polluted.
|
||||||
|
*
|
||||||
|
* NOTE 2:
|
||||||
|
* -------
|
||||||
|
*
|
||||||
|
* Right now you might be staring at file include/curl/curlbuild.h.in or
|
||||||
|
* at file include/curl/curlbuild.h, this is due to the following reason:
|
||||||
|
*
|
||||||
|
* On systems capable of running the configure script, the configure process
|
||||||
|
* will overwrite the distributed include/curl/curlbuild.h file with one that
|
||||||
|
* is suitable and specific to the library being configured and built, which
|
||||||
|
* is generated from the include/curl/curlbuild.h.in template file.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* ================================================================ */
|
||||||
|
/* DEFINITION OF THESE SYMBOLS SHALL NOT TAKE PLACE ANYWHERE ELSE */
|
||||||
|
/* ================================================================ */
|
||||||
|
|
||||||
|
#ifdef CURL_SIZEOF_LONG
|
||||||
|
# error "CURL_SIZEOF_LONG shall not be defined except in curlbuild.h"
|
||||||
|
Error Compilation_aborted_CURL_SIZEOF_LONG_already_defined
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef CURL_TYPEOF_CURL_SOCKLEN_T
|
||||||
|
# error "CURL_TYPEOF_CURL_SOCKLEN_T shall not be defined except in curlbuild.h"
|
||||||
|
Error Compilation_aborted_CURL_TYPEOF_CURL_SOCKLEN_T_already_defined
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef CURL_SIZEOF_CURL_SOCKLEN_T
|
||||||
|
# error "CURL_SIZEOF_CURL_SOCKLEN_T shall not be defined except in curlbuild.h"
|
||||||
|
Error Compilation_aborted_CURL_SIZEOF_CURL_SOCKLEN_T_already_defined
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef CURL_TYPEOF_CURL_OFF_T
|
||||||
|
# error "CURL_TYPEOF_CURL_OFF_T shall not be defined except in curlbuild.h"
|
||||||
|
Error Compilation_aborted_CURL_TYPEOF_CURL_OFF_T_already_defined
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef CURL_FORMAT_CURL_OFF_T
|
||||||
|
# error "CURL_FORMAT_CURL_OFF_T shall not be defined except in curlbuild.h"
|
||||||
|
Error Compilation_aborted_CURL_FORMAT_CURL_OFF_T_already_defined
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef CURL_FORMAT_CURL_OFF_TU
|
||||||
|
# error "CURL_FORMAT_CURL_OFF_TU shall not be defined except in curlbuild.h"
|
||||||
|
Error Compilation_aborted_CURL_FORMAT_CURL_OFF_TU_already_defined
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef CURL_FORMAT_OFF_T
|
||||||
|
# error "CURL_FORMAT_OFF_T shall not be defined except in curlbuild.h"
|
||||||
|
Error Compilation_aborted_CURL_FORMAT_OFF_T_already_defined
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef CURL_SIZEOF_CURL_OFF_T
|
||||||
|
# error "CURL_SIZEOF_CURL_OFF_T shall not be defined except in curlbuild.h"
|
||||||
|
Error Compilation_aborted_CURL_SIZEOF_CURL_OFF_T_already_defined
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef CURL_SUFFIX_CURL_OFF_T
|
||||||
|
# error "CURL_SUFFIX_CURL_OFF_T shall not be defined except in curlbuild.h"
|
||||||
|
Error Compilation_aborted_CURL_SUFFIX_CURL_OFF_T_already_defined
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef CURL_SUFFIX_CURL_OFF_TU
|
||||||
|
# error "CURL_SUFFIX_CURL_OFF_TU shall not be defined except in curlbuild.h"
|
||||||
|
Error Compilation_aborted_CURL_SUFFIX_CURL_OFF_TU_already_defined
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* ================================================================ */
|
||||||
|
/* EXTERNAL INTERFACE SETTINGS FOR CONFIGURE CAPABLE SYSTEMS ONLY */
|
||||||
|
/* ================================================================ */
|
||||||
|
|
||||||
|
/* Configure process defines this to 1 when it finds out that system */
|
||||||
|
/* header file ws2tcpip.h must be included by the external interface. */
|
||||||
|
#define CURL_PULL_WS2TCPIP_H 1
|
||||||
|
#ifdef CURL_PULL_WS2TCPIP_H
|
||||||
|
# ifndef WIN32_LEAN_AND_MEAN
|
||||||
|
# define WIN32_LEAN_AND_MEAN 1
|
||||||
|
# endif
|
||||||
|
# include <windows.h>
|
||||||
|
# include <winsock2.h>
|
||||||
|
# include <ws2tcpip.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Configure process defines this to 1 when it finds out that system */
|
||||||
|
/* header file sys/types.h must be included by the external interface. */
|
||||||
|
#define CURL_PULL_SYS_TYPES_H 1
|
||||||
|
#ifdef CURL_PULL_SYS_TYPES_H
|
||||||
|
# include <sys/types.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Configure process defines this to 1 when it finds out that system */
|
||||||
|
/* header file stdint.h must be included by the external interface. */
|
||||||
|
#define CURL_PULL_STDINT_H 1
|
||||||
|
#ifdef CURL_PULL_STDINT_H
|
||||||
|
# include <stdint.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Configure process defines this to 1 when it finds out that system */
|
||||||
|
/* header file inttypes.h must be included by the external interface. */
|
||||||
|
#define CURL_PULL_INTTYPES_H 1
|
||||||
|
#ifdef CURL_PULL_INTTYPES_H
|
||||||
|
# include <inttypes.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Configure process defines this to 1 when it finds out that system */
|
||||||
|
/* header file sys/socket.h must be included by the external interface. */
|
||||||
|
/* #undef CURL_PULL_SYS_SOCKET_H */
|
||||||
|
#ifdef CURL_PULL_SYS_SOCKET_H
|
||||||
|
# include <sys/socket.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* The size of `long', as computed by sizeof. */
|
||||||
|
#define CURL_SIZEOF_LONG 4
|
||||||
|
|
||||||
|
/* Integral data type used for curl_socklen_t. */
|
||||||
|
#define CURL_TYPEOF_CURL_SOCKLEN_T socklen_t
|
||||||
|
|
||||||
|
/* The size of `curl_socklen_t', as computed by sizeof. */
|
||||||
|
#define CURL_SIZEOF_CURL_SOCKLEN_T 4
|
||||||
|
|
||||||
|
/* Data type definition of curl_socklen_t. */
|
||||||
|
typedef CURL_TYPEOF_CURL_SOCKLEN_T curl_socklen_t;
|
||||||
|
|
||||||
|
/* Signed integral data type used for curl_off_t. */
|
||||||
|
#define CURL_TYPEOF_CURL_OFF_T int64_t
|
||||||
|
|
||||||
|
/* Data type definition of curl_off_t. */
|
||||||
|
typedef CURL_TYPEOF_CURL_OFF_T curl_off_t;
|
||||||
|
|
||||||
|
/* curl_off_t formatting string directive without "%" conversion specifier. */
|
||||||
|
#define CURL_FORMAT_CURL_OFF_T "I64d"
|
||||||
|
|
||||||
|
/* unsigned curl_off_t formatting string without "%" conversion specifier. */
|
||||||
|
#define CURL_FORMAT_CURL_OFF_TU "I64u"
|
||||||
|
|
||||||
|
/* curl_off_t formatting string directive with "%" conversion specifier. */
|
||||||
|
#define CURL_FORMAT_OFF_T "%I64d"
|
||||||
|
|
||||||
|
/* The size of `curl_off_t', as computed by sizeof. */
|
||||||
|
#define CURL_SIZEOF_CURL_OFF_T 8
|
||||||
|
|
||||||
|
/* curl_off_t constant suffix. */
|
||||||
|
#define CURL_SUFFIX_CURL_OFF_T LL
|
||||||
|
|
||||||
|
/* unsigned curl_off_t constant suffix. */
|
||||||
|
#define CURL_SUFFIX_CURL_OFF_TU ULL
|
||||||
|
|
||||||
|
#endif /* __CURL_CURLBUILD_H */
|
||||||
@@ -0,0 +1,261 @@
|
|||||||
|
#ifndef __CURL_CURLRULES_H
|
||||||
|
#define __CURL_CURLRULES_H
|
||||||
|
/***************************************************************************
|
||||||
|
* _ _ ____ _
|
||||||
|
* Project ___| | | | _ \| |
|
||||||
|
* / __| | | | |_) | |
|
||||||
|
* | (__| |_| | _ <| |___
|
||||||
|
* \___|\___/|_| \_\_____|
|
||||||
|
*
|
||||||
|
* Copyright (C) 1998 - 2011, Daniel Stenberg, <daniel@haxx.se>, et al.
|
||||||
|
*
|
||||||
|
* This software is licensed as described in the file COPYING, which
|
||||||
|
* you should have received as part of this distribution. The terms
|
||||||
|
* are also available at http://curl.haxx.se/docs/copyright.html.
|
||||||
|
*
|
||||||
|
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
||||||
|
* copies of the Software, and permit persons to whom the Software is
|
||||||
|
* furnished to do so, under the terms of the COPYING file.
|
||||||
|
*
|
||||||
|
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
||||||
|
* KIND, either express or implied.
|
||||||
|
*
|
||||||
|
***************************************************************************/
|
||||||
|
|
||||||
|
/* ================================================================ */
|
||||||
|
/* COMPILE TIME SANITY CHECKS */
|
||||||
|
/* ================================================================ */
|
||||||
|
|
||||||
|
/*
|
||||||
|
* NOTE 1:
|
||||||
|
* -------
|
||||||
|
*
|
||||||
|
* All checks done in this file are intentionally placed in a public
|
||||||
|
* header file which is pulled by curl/curl.h when an application is
|
||||||
|
* being built using an already built libcurl library. Additionally
|
||||||
|
* this file is also included and used when building the library.
|
||||||
|
*
|
||||||
|
* If compilation fails on this file it is certainly sure that the
|
||||||
|
* problem is elsewhere. It could be a problem in the curlbuild.h
|
||||||
|
* header file, or simply that you are using different compilation
|
||||||
|
* settings than those used to build the library.
|
||||||
|
*
|
||||||
|
* Nothing in this file is intended to be modified or adjusted by the
|
||||||
|
* curl library user nor by the curl library builder.
|
||||||
|
*
|
||||||
|
* Do not deactivate any check, these are done to make sure that the
|
||||||
|
* library is properly built and used.
|
||||||
|
*
|
||||||
|
* You can find further help on the libcurl development mailing list:
|
||||||
|
* http://cool.haxx.se/mailman/listinfo/curl-library/
|
||||||
|
*
|
||||||
|
* NOTE 2
|
||||||
|
* ------
|
||||||
|
*
|
||||||
|
* Some of the following compile time checks are based on the fact
|
||||||
|
* that the dimension of a constant array can not be a negative one.
|
||||||
|
* In this way if the compile time verification fails, the compilation
|
||||||
|
* will fail issuing an error. The error description wording is compiler
|
||||||
|
* dependent but it will be quite similar to one of the following:
|
||||||
|
*
|
||||||
|
* "negative subscript or subscript is too large"
|
||||||
|
* "array must have at least one element"
|
||||||
|
* "-1 is an illegal array size"
|
||||||
|
* "size of array is negative"
|
||||||
|
*
|
||||||
|
* If you are building an application which tries to use an already
|
||||||
|
* built libcurl library and you are getting this kind of errors on
|
||||||
|
* this file, it is a clear indication that there is a mismatch between
|
||||||
|
* how the library was built and how you are trying to use it for your
|
||||||
|
* application. Your already compiled or binary library provider is the
|
||||||
|
* only one who can give you the details you need to properly use it.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Verify that some macros are actually defined.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef CURL_SIZEOF_LONG
|
||||||
|
# error "CURL_SIZEOF_LONG definition is missing!"
|
||||||
|
Error Compilation_aborted_CURL_SIZEOF_LONG_is_missing
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef CURL_TYPEOF_CURL_SOCKLEN_T
|
||||||
|
# error "CURL_TYPEOF_CURL_SOCKLEN_T definition is missing!"
|
||||||
|
Error Compilation_aborted_CURL_TYPEOF_CURL_SOCKLEN_T_is_missing
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef CURL_SIZEOF_CURL_SOCKLEN_T
|
||||||
|
# error "CURL_SIZEOF_CURL_SOCKLEN_T definition is missing!"
|
||||||
|
Error Compilation_aborted_CURL_SIZEOF_CURL_SOCKLEN_T_is_missing
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef CURL_TYPEOF_CURL_OFF_T
|
||||||
|
# error "CURL_TYPEOF_CURL_OFF_T definition is missing!"
|
||||||
|
Error Compilation_aborted_CURL_TYPEOF_CURL_OFF_T_is_missing
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef CURL_FORMAT_CURL_OFF_T
|
||||||
|
# error "CURL_FORMAT_CURL_OFF_T definition is missing!"
|
||||||
|
Error Compilation_aborted_CURL_FORMAT_CURL_OFF_T_is_missing
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef CURL_FORMAT_CURL_OFF_TU
|
||||||
|
# error "CURL_FORMAT_CURL_OFF_TU definition is missing!"
|
||||||
|
Error Compilation_aborted_CURL_FORMAT_CURL_OFF_TU_is_missing
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef CURL_FORMAT_OFF_T
|
||||||
|
# error "CURL_FORMAT_OFF_T definition is missing!"
|
||||||
|
Error Compilation_aborted_CURL_FORMAT_OFF_T_is_missing
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef CURL_SIZEOF_CURL_OFF_T
|
||||||
|
# error "CURL_SIZEOF_CURL_OFF_T definition is missing!"
|
||||||
|
Error Compilation_aborted_CURL_SIZEOF_CURL_OFF_T_is_missing
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef CURL_SUFFIX_CURL_OFF_T
|
||||||
|
# error "CURL_SUFFIX_CURL_OFF_T definition is missing!"
|
||||||
|
Error Compilation_aborted_CURL_SUFFIX_CURL_OFF_T_is_missing
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef CURL_SUFFIX_CURL_OFF_TU
|
||||||
|
# error "CURL_SUFFIX_CURL_OFF_TU definition is missing!"
|
||||||
|
Error Compilation_aborted_CURL_SUFFIX_CURL_OFF_TU_is_missing
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Macros private to this header file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#define CurlchkszEQ(t, s) sizeof(t) == s ? 1 : -1
|
||||||
|
|
||||||
|
#define CurlchkszGE(t1, t2) sizeof(t1) >= sizeof(t2) ? 1 : -1
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Verify that the size previously defined and expected for long
|
||||||
|
* is the same as the one reported by sizeof() at compile time.
|
||||||
|
*/
|
||||||
|
|
||||||
|
typedef char
|
||||||
|
__curl_rule_01__
|
||||||
|
[CurlchkszEQ(long, CURL_SIZEOF_LONG)];
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Verify that the size previously defined and expected for
|
||||||
|
* curl_off_t is actually the the same as the one reported
|
||||||
|
* by sizeof() at compile time.
|
||||||
|
*/
|
||||||
|
|
||||||
|
typedef char
|
||||||
|
__curl_rule_02__
|
||||||
|
[CurlchkszEQ(curl_off_t, CURL_SIZEOF_CURL_OFF_T)];
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Verify at compile time that the size of curl_off_t as reported
|
||||||
|
* by sizeof() is greater or equal than the one reported for long
|
||||||
|
* for the current compilation.
|
||||||
|
*/
|
||||||
|
|
||||||
|
typedef char
|
||||||
|
__curl_rule_03__
|
||||||
|
[CurlchkszGE(curl_off_t, long)];
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Verify that the size previously defined and expected for
|
||||||
|
* curl_socklen_t is actually the the same as the one reported
|
||||||
|
* by sizeof() at compile time.
|
||||||
|
*/
|
||||||
|
|
||||||
|
typedef char
|
||||||
|
__curl_rule_04__
|
||||||
|
[CurlchkszEQ(curl_socklen_t, CURL_SIZEOF_CURL_SOCKLEN_T)];
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Verify at compile time that the size of curl_socklen_t as reported
|
||||||
|
* by sizeof() is greater or equal than the one reported for int for
|
||||||
|
* the current compilation.
|
||||||
|
*/
|
||||||
|
|
||||||
|
typedef char
|
||||||
|
__curl_rule_05__
|
||||||
|
[CurlchkszGE(curl_socklen_t, int)];
|
||||||
|
|
||||||
|
/* ================================================================ */
|
||||||
|
/* EXTERNALLY AND INTERNALLY VISIBLE DEFINITIONS */
|
||||||
|
/* ================================================================ */
|
||||||
|
|
||||||
|
/*
|
||||||
|
* CURL_ISOCPP and CURL_OFF_T_C definitions are done here in order to allow
|
||||||
|
* these to be visible and exported by the external libcurl interface API,
|
||||||
|
* while also making them visible to the library internals, simply including
|
||||||
|
* setup.h, without actually needing to include curl.h internally.
|
||||||
|
* If some day this section would grow big enough, all this should be moved
|
||||||
|
* to its own header file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Figure out if we can use the ## preprocessor operator, which is supported
|
||||||
|
* by ISO/ANSI C and C++. Some compilers support it without setting __STDC__
|
||||||
|
* or __cplusplus so we need to carefully check for them too.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#if defined(__STDC__) || defined(_MSC_VER) || defined(__cplusplus) || \
|
||||||
|
defined(__HP_aCC) || defined(__BORLANDC__) || defined(__LCC__) || \
|
||||||
|
defined(__POCC__) || defined(__SALFORDC__) || defined(__HIGHC__) || \
|
||||||
|
defined(__ILEC400__)
|
||||||
|
/* This compiler is believed to have an ISO compatible preprocessor */
|
||||||
|
#define CURL_ISOCPP
|
||||||
|
#else
|
||||||
|
/* This compiler is believed NOT to have an ISO compatible preprocessor */
|
||||||
|
#undef CURL_ISOCPP
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Macros for minimum-width signed and unsigned curl_off_t integer constants.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#if defined(__BORLANDC__) && (__BORLANDC__ == 0x0551)
|
||||||
|
# define __CURL_OFF_T_C_HLPR2(x) x
|
||||||
|
# define __CURL_OFF_T_C_HLPR1(x) __CURL_OFF_T_C_HLPR2(x)
|
||||||
|
# define CURL_OFF_T_C(Val) __CURL_OFF_T_C_HLPR1(Val) ## \
|
||||||
|
__CURL_OFF_T_C_HLPR1(CURL_SUFFIX_CURL_OFF_T)
|
||||||
|
# define CURL_OFF_TU_C(Val) __CURL_OFF_T_C_HLPR1(Val) ## \
|
||||||
|
__CURL_OFF_T_C_HLPR1(CURL_SUFFIX_CURL_OFF_TU)
|
||||||
|
#else
|
||||||
|
# ifdef CURL_ISOCPP
|
||||||
|
# define __CURL_OFF_T_C_HLPR2(Val,Suffix) Val ## Suffix
|
||||||
|
# else
|
||||||
|
# define __CURL_OFF_T_C_HLPR2(Val,Suffix) Val/**/Suffix
|
||||||
|
# endif
|
||||||
|
# define __CURL_OFF_T_C_HLPR1(Val,Suffix) __CURL_OFF_T_C_HLPR2(Val,Suffix)
|
||||||
|
# define CURL_OFF_T_C(Val) __CURL_OFF_T_C_HLPR1(Val,CURL_SUFFIX_CURL_OFF_T)
|
||||||
|
# define CURL_OFF_TU_C(Val) __CURL_OFF_T_C_HLPR1(Val,CURL_SUFFIX_CURL_OFF_TU)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Get rid of macros private to this header file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#undef CurlchkszEQ
|
||||||
|
#undef CurlchkszGE
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Get rid of macros not intended to exist beyond this point.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#undef CURL_PULL_WS2TCPIP_H
|
||||||
|
#undef CURL_PULL_SYS_TYPES_H
|
||||||
|
#undef CURL_PULL_SYS_SOCKET_H
|
||||||
|
#undef CURL_PULL_STDINT_H
|
||||||
|
#undef CURL_PULL_INTTYPES_H
|
||||||
|
|
||||||
|
#undef CURL_TYPEOF_CURL_SOCKLEN_T
|
||||||
|
#undef CURL_TYPEOF_CURL_OFF_T
|
||||||
|
|
||||||
|
#ifdef CURL_NO_OLDIES
|
||||||
|
#undef CURL_FORMAT_OFF_T /* not required since 7.19.0 - obsoleted in 7.20.0 */
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#endif /* __CURL_CURLRULES_H */
|
||||||
@@ -0,0 +1 @@
|
|||||||
|
/* not used */
|
||||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
@@ -1,89 +0,0 @@
|
|||||||
/* Included at the beginning of library source files, after all other #include lines.
|
|
||||||
* Sets up helpful macros and services used in my source code. They don't need
|
|
||||||
* module an annoying module prefix on their names since they are defined after
|
|
||||||
* all other #include lines. */
|
|
||||||
|
|
||||||
#ifndef BLARGG_SOURCE_H
|
|
||||||
#define BLARGG_SOURCE_H
|
|
||||||
|
|
||||||
/* If debugging is enabled, abort program if expr is false. Meant for checking
|
|
||||||
* internal state and consistency. A failed assertion indicates a bug in the module.
|
|
||||||
* void assert( bool expr ); */
|
|
||||||
#include <assert.h>
|
|
||||||
|
|
||||||
/* If debugging is enabled and expr is false, abort program. Meant for checking
|
|
||||||
* caller-supplied parameters and operations that are outside the control of the
|
|
||||||
* module. A failed requirement indicates a bug outside the module.
|
|
||||||
* void require( bool expr ); */
|
|
||||||
#undef require
|
|
||||||
#define require( expr ) assert( expr )
|
|
||||||
|
|
||||||
/* Use to provide hints to compiler for optimized code layout in situations where we
|
|
||||||
* can almost always expect a conditional to go one way or the other. Should only be
|
|
||||||
* used in situations where an unexpected branch is truly exceptional though! */
|
|
||||||
#undef likely
|
|
||||||
#undef unlikely
|
|
||||||
#ifdef __GNUC__
|
|
||||||
#define likely( x ) __builtin_expect(x, 1)
|
|
||||||
#define unlikely( x ) __builtin_expect(x, 0)
|
|
||||||
#else
|
|
||||||
#define likely( x ) (x)
|
|
||||||
#define unlikely( x ) (x)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Like printf() except output goes to debug log file. Might be defined to do
|
|
||||||
* nothing (not even evaluate its arguments).
|
|
||||||
* void debug_printf( const char* format, ... ); */
|
|
||||||
#if defined(__cplusplus)
|
|
||||||
static inline void blargg_dprintf_( const char* fmt_str, ... ) { (void) fmt_str; }
|
|
||||||
#undef debug_printf
|
|
||||||
#define debug_printf (1) ? (void) 0 : blargg_dprintf_
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* If enabled, evaluate expr and if false, make debug log entry with source file
|
|
||||||
* and line. Meant for finding situations that should be examined further, but that
|
|
||||||
* don't indicate a problem. In all cases, execution continues normally. */
|
|
||||||
#undef check
|
|
||||||
#define check( expr ) ((void) 0)
|
|
||||||
|
|
||||||
/* If expr yields error string, return it from current function, otherwise continue. */
|
|
||||||
#undef RETURN_ERR
|
|
||||||
#define RETURN_ERR( expr ) do { \
|
|
||||||
blargg_err_t blargg_return_err_ = (expr); \
|
|
||||||
if ( blargg_return_err_ ) return blargg_return_err_; \
|
|
||||||
} while ( 0 )
|
|
||||||
|
|
||||||
/* If ptr is 0, return out of memory error string. */
|
|
||||||
#undef CHECK_ALLOC
|
|
||||||
#define CHECK_ALLOC( ptr ) do { if ( (ptr) == 0 ) return "Out of memory"; } while ( 0 )
|
|
||||||
|
|
||||||
/* TODO: good idea? bad idea? */
|
|
||||||
#undef byte
|
|
||||||
#define byte byte_
|
|
||||||
typedef unsigned char byte;
|
|
||||||
|
|
||||||
/* Setup compiler defines useful for exporting required public API symbols in gme.cpp */
|
|
||||||
#ifndef BLARGG_EXPORT
|
|
||||||
#if defined (_WIN32)
|
|
||||||
#if defined(BLARGG_BUILD_DLL)
|
|
||||||
#define BLARGG_EXPORT __declspec(dllexport)
|
|
||||||
#else
|
|
||||||
#define BLARGG_EXPORT /* Leave blank: friendly with both static and shared linking */
|
|
||||||
#endif
|
|
||||||
#elif defined (LIBGME_VISIBILITY) && defined(__cplusplus)
|
|
||||||
#define BLARGG_EXPORT __attribute__((visibility ("default")))
|
|
||||||
#else
|
|
||||||
#define BLARGG_EXPORT
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* deprecated */
|
|
||||||
#define BLARGG_CHECK_ALLOC CHECK_ALLOC
|
|
||||||
#define BLARGG_RETURN_ERR RETURN_ERR
|
|
||||||
|
|
||||||
/* BLARGG_SOURCE_BEGIN: If defined, #included, allowing redefition of debug_printf and check */
|
|
||||||
#ifdef BLARGG_SOURCE_BEGIN
|
|
||||||
#include BLARGG_SOURCE_BEGIN
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif
|
|
||||||
@@ -1,339 +0,0 @@
|
|||||||
GNU GENERAL PUBLIC LICENSE
|
|
||||||
Version 2, June 1991
|
|
||||||
|
|
||||||
Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
|
|
||||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
||||||
Everyone is permitted to copy and distribute verbatim copies
|
|
||||||
of this license document, but changing it is not allowed.
|
|
||||||
|
|
||||||
Preamble
|
|
||||||
|
|
||||||
The licenses for most software are designed to take away your
|
|
||||||
freedom to share and change it. By contrast, the GNU General Public
|
|
||||||
License is intended to guarantee your freedom to share and change free
|
|
||||||
software--to make sure the software is free for all its users. This
|
|
||||||
General Public License applies to most of the Free Software
|
|
||||||
Foundation's software and to any other program whose authors commit to
|
|
||||||
using it. (Some other Free Software Foundation software is covered by
|
|
||||||
the GNU Lesser General Public License instead.) You can apply it to
|
|
||||||
your programs, too.
|
|
||||||
|
|
||||||
When we speak of free software, we are referring to freedom, not
|
|
||||||
price. Our General Public Licenses are designed to make sure that you
|
|
||||||
have the freedom to distribute copies of free software (and charge for
|
|
||||||
this service if you wish), that you receive source code or can get it
|
|
||||||
if you want it, that you can change the software or use pieces of it
|
|
||||||
in new free programs; and that you know you can do these things.
|
|
||||||
|
|
||||||
To protect your rights, we need to make restrictions that forbid
|
|
||||||
anyone to deny you these rights or to ask you to surrender the rights.
|
|
||||||
These restrictions translate to certain responsibilities for you if you
|
|
||||||
distribute copies of the software, or if you modify it.
|
|
||||||
|
|
||||||
For example, if you distribute copies of such a program, whether
|
|
||||||
gratis or for a fee, you must give the recipients all the rights that
|
|
||||||
you have. You must make sure that they, too, receive or can get the
|
|
||||||
source code. And you must show them these terms so they know their
|
|
||||||
rights.
|
|
||||||
|
|
||||||
We protect your rights with two steps: (1) copyright the software, and
|
|
||||||
(2) offer you this license which gives you legal permission to copy,
|
|
||||||
distribute and/or modify the software.
|
|
||||||
|
|
||||||
Also, for each author's protection and ours, we want to make certain
|
|
||||||
that everyone understands that there is no warranty for this free
|
|
||||||
software. If the software is modified by someone else and passed on, we
|
|
||||||
want its recipients to know that what they have is not the original, so
|
|
||||||
that any problems introduced by others will not reflect on the original
|
|
||||||
authors' reputations.
|
|
||||||
|
|
||||||
Finally, any free program is threatened constantly by software
|
|
||||||
patents. We wish to avoid the danger that redistributors of a free
|
|
||||||
program will individually obtain patent licenses, in effect making the
|
|
||||||
program proprietary. To prevent this, we have made it clear that any
|
|
||||||
patent must be licensed for everyone's free use or not licensed at all.
|
|
||||||
|
|
||||||
The precise terms and conditions for copying, distribution and
|
|
||||||
modification follow.
|
|
||||||
|
|
||||||
GNU GENERAL PUBLIC LICENSE
|
|
||||||
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
|
||||||
|
|
||||||
0. This License applies to any program or other work which contains
|
|
||||||
a notice placed by the copyright holder saying it may be distributed
|
|
||||||
under the terms of this General Public License. The "Program", below,
|
|
||||||
refers to any such program or work, and a "work based on the Program"
|
|
||||||
means either the Program or any derivative work under copyright law:
|
|
||||||
that is to say, a work containing the Program or a portion of it,
|
|
||||||
either verbatim or with modifications and/or translated into another
|
|
||||||
language. (Hereinafter, translation is included without limitation in
|
|
||||||
the term "modification".) Each licensee is addressed as "you".
|
|
||||||
|
|
||||||
Activities other than copying, distribution and modification are not
|
|
||||||
covered by this License; they are outside its scope. The act of
|
|
||||||
running the Program is not restricted, and the output from the Program
|
|
||||||
is covered only if its contents constitute a work based on the
|
|
||||||
Program (independent of having been made by running the Program).
|
|
||||||
Whether that is true depends on what the Program does.
|
|
||||||
|
|
||||||
1. You may copy and distribute verbatim copies of the Program's
|
|
||||||
source code as you receive it, in any medium, provided that you
|
|
||||||
conspicuously and appropriately publish on each copy an appropriate
|
|
||||||
copyright notice and disclaimer of warranty; keep intact all the
|
|
||||||
notices that refer to this License and to the absence of any warranty;
|
|
||||||
and give any other recipients of the Program a copy of this License
|
|
||||||
along with the Program.
|
|
||||||
|
|
||||||
You may charge a fee for the physical act of transferring a copy, and
|
|
||||||
you may at your option offer warranty protection in exchange for a fee.
|
|
||||||
|
|
||||||
2. You may modify your copy or copies of the Program or any portion
|
|
||||||
of it, thus forming a work based on the Program, and copy and
|
|
||||||
distribute such modifications or work under the terms of Section 1
|
|
||||||
above, provided that you also meet all of these conditions:
|
|
||||||
|
|
||||||
a) You must cause the modified files to carry prominent notices
|
|
||||||
stating that you changed the files and the date of any change.
|
|
||||||
|
|
||||||
b) You must cause any work that you distribute or publish, that in
|
|
||||||
whole or in part contains or is derived from the Program or any
|
|
||||||
part thereof, to be licensed as a whole at no charge to all third
|
|
||||||
parties under the terms of this License.
|
|
||||||
|
|
||||||
c) If the modified program normally reads commands interactively
|
|
||||||
when run, you must cause it, when started running for such
|
|
||||||
interactive use in the most ordinary way, to print or display an
|
|
||||||
announcement including an appropriate copyright notice and a
|
|
||||||
notice that there is no warranty (or else, saying that you provide
|
|
||||||
a warranty) and that users may redistribute the program under
|
|
||||||
these conditions, and telling the user how to view a copy of this
|
|
||||||
License. (Exception: if the Program itself is interactive but
|
|
||||||
does not normally print such an announcement, your work based on
|
|
||||||
the Program is not required to print an announcement.)
|
|
||||||
|
|
||||||
These requirements apply to the modified work as a whole. If
|
|
||||||
identifiable sections of that work are not derived from the Program,
|
|
||||||
and can be reasonably considered independent and separate works in
|
|
||||||
themselves, then this License, and its terms, do not apply to those
|
|
||||||
sections when you distribute them as separate works. But when you
|
|
||||||
distribute the same sections as part of a whole which is a work based
|
|
||||||
on the Program, the distribution of the whole must be on the terms of
|
|
||||||
this License, whose permissions for other licensees extend to the
|
|
||||||
entire whole, and thus to each and every part regardless of who wrote it.
|
|
||||||
|
|
||||||
Thus, it is not the intent of this section to claim rights or contest
|
|
||||||
your rights to work written entirely by you; rather, the intent is to
|
|
||||||
exercise the right to control the distribution of derivative or
|
|
||||||
collective works based on the Program.
|
|
||||||
|
|
||||||
In addition, mere aggregation of another work not based on the Program
|
|
||||||
with the Program (or with a work based on the Program) on a volume of
|
|
||||||
a storage or distribution medium does not bring the other work under
|
|
||||||
the scope of this License.
|
|
||||||
|
|
||||||
3. You may copy and distribute the Program (or a work based on it,
|
|
||||||
under Section 2) in object code or executable form under the terms of
|
|
||||||
Sections 1 and 2 above provided that you also do one of the following:
|
|
||||||
|
|
||||||
a) Accompany it with the complete corresponding machine-readable
|
|
||||||
source code, which must be distributed under the terms of Sections
|
|
||||||
1 and 2 above on a medium customarily used for software interchange; or,
|
|
||||||
|
|
||||||
b) Accompany it with a written offer, valid for at least three
|
|
||||||
years, to give any third party, for a charge no more than your
|
|
||||||
cost of physically performing source distribution, a complete
|
|
||||||
machine-readable copy of the corresponding source code, to be
|
|
||||||
distributed under the terms of Sections 1 and 2 above on a medium
|
|
||||||
customarily used for software interchange; or,
|
|
||||||
|
|
||||||
c) Accompany it with the information you received as to the offer
|
|
||||||
to distribute corresponding source code. (This alternative is
|
|
||||||
allowed only for noncommercial distribution and only if you
|
|
||||||
received the program in object code or executable form with such
|
|
||||||
an offer, in accord with Subsection b above.)
|
|
||||||
|
|
||||||
The source code for a work means the preferred form of the work for
|
|
||||||
making modifications to it. For an executable work, complete source
|
|
||||||
code means all the source code for all modules it contains, plus any
|
|
||||||
associated interface definition files, plus the scripts used to
|
|
||||||
control compilation and installation of the executable. However, as a
|
|
||||||
special exception, the source code distributed need not include
|
|
||||||
anything that is normally distributed (in either source or binary
|
|
||||||
form) with the major components (compiler, kernel, and so on) of the
|
|
||||||
operating system on which the executable runs, unless that component
|
|
||||||
itself accompanies the executable.
|
|
||||||
|
|
||||||
If distribution of executable or object code is made by offering
|
|
||||||
access to copy from a designated place, then offering equivalent
|
|
||||||
access to copy the source code from the same place counts as
|
|
||||||
distribution of the source code, even though third parties are not
|
|
||||||
compelled to copy the source along with the object code.
|
|
||||||
|
|
||||||
4. You may not copy, modify, sublicense, or distribute the Program
|
|
||||||
except as expressly provided under this License. Any attempt
|
|
||||||
otherwise to copy, modify, sublicense or distribute the Program is
|
|
||||||
void, and will automatically terminate your rights under this License.
|
|
||||||
However, parties who have received copies, or rights, from you under
|
|
||||||
this License will not have their licenses terminated so long as such
|
|
||||||
parties remain in full compliance.
|
|
||||||
|
|
||||||
5. You are not required to accept this License, since you have not
|
|
||||||
signed it. However, nothing else grants you permission to modify or
|
|
||||||
distribute the Program or its derivative works. These actions are
|
|
||||||
prohibited by law if you do not accept this License. Therefore, by
|
|
||||||
modifying or distributing the Program (or any work based on the
|
|
||||||
Program), you indicate your acceptance of this License to do so, and
|
|
||||||
all its terms and conditions for copying, distributing or modifying
|
|
||||||
the Program or works based on it.
|
|
||||||
|
|
||||||
6. Each time you redistribute the Program (or any work based on the
|
|
||||||
Program), the recipient automatically receives a license from the
|
|
||||||
original licensor to copy, distribute or modify the Program subject to
|
|
||||||
these terms and conditions. You may not impose any further
|
|
||||||
restrictions on the recipients' exercise of the rights granted herein.
|
|
||||||
You are not responsible for enforcing compliance by third parties to
|
|
||||||
this License.
|
|
||||||
|
|
||||||
7. If, as a consequence of a court judgment or allegation of patent
|
|
||||||
infringement or for any other reason (not limited to patent issues),
|
|
||||||
conditions are imposed on you (whether by court order, agreement or
|
|
||||||
otherwise) that contradict the conditions of this License, they do not
|
|
||||||
excuse you from the conditions of this License. If you cannot
|
|
||||||
distribute so as to satisfy simultaneously your obligations under this
|
|
||||||
License and any other pertinent obligations, then as a consequence you
|
|
||||||
may not distribute the Program at all. For example, if a patent
|
|
||||||
license would not permit royalty-free redistribution of the Program by
|
|
||||||
all those who receive copies directly or indirectly through you, then
|
|
||||||
the only way you could satisfy both it and this License would be to
|
|
||||||
refrain entirely from distribution of the Program.
|
|
||||||
|
|
||||||
If any portion of this section is held invalid or unenforceable under
|
|
||||||
any particular circumstance, the balance of the section is intended to
|
|
||||||
apply and the section as a whole is intended to apply in other
|
|
||||||
circumstances.
|
|
||||||
|
|
||||||
It is not the purpose of this section to induce you to infringe any
|
|
||||||
patents or other property right claims or to contest validity of any
|
|
||||||
such claims; this section has the sole purpose of protecting the
|
|
||||||
integrity of the free software distribution system, which is
|
|
||||||
implemented by public license practices. Many people have made
|
|
||||||
generous contributions to the wide range of software distributed
|
|
||||||
through that system in reliance on consistent application of that
|
|
||||||
system; it is up to the author/donor to decide if he or she is willing
|
|
||||||
to distribute software through any other system and a licensee cannot
|
|
||||||
impose that choice.
|
|
||||||
|
|
||||||
This section is intended to make thoroughly clear what is believed to
|
|
||||||
be a consequence of the rest of this License.
|
|
||||||
|
|
||||||
8. If the distribution and/or use of the Program is restricted in
|
|
||||||
certain countries either by patents or by copyrighted interfaces, the
|
|
||||||
original copyright holder who places the Program under this License
|
|
||||||
may add an explicit geographical distribution limitation excluding
|
|
||||||
those countries, so that distribution is permitted only in or among
|
|
||||||
countries not thus excluded. In such case, this License incorporates
|
|
||||||
the limitation as if written in the body of this License.
|
|
||||||
|
|
||||||
9. The Free Software Foundation may publish revised and/or new versions
|
|
||||||
of the General Public License from time to time. Such new versions will
|
|
||||||
be similar in spirit to the present version, but may differ in detail to
|
|
||||||
address new problems or concerns.
|
|
||||||
|
|
||||||
Each version is given a distinguishing version number. If the Program
|
|
||||||
specifies a version number of this License which applies to it and "any
|
|
||||||
later version", you have the option of following the terms and conditions
|
|
||||||
either of that version or of any later version published by the Free
|
|
||||||
Software Foundation. If the Program does not specify a version number of
|
|
||||||
this License, you may choose any version ever published by the Free Software
|
|
||||||
Foundation.
|
|
||||||
|
|
||||||
10. If you wish to incorporate parts of the Program into other free
|
|
||||||
programs whose distribution conditions are different, write to the author
|
|
||||||
to ask for permission. For software which is copyrighted by the Free
|
|
||||||
Software Foundation, write to the Free Software Foundation; we sometimes
|
|
||||||
make exceptions for this. Our decision will be guided by the two goals
|
|
||||||
of preserving the free status of all derivatives of our free software and
|
|
||||||
of promoting the sharing and reuse of software generally.
|
|
||||||
|
|
||||||
NO WARRANTY
|
|
||||||
|
|
||||||
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
|
|
||||||
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
|
|
||||||
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
|
|
||||||
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
|
|
||||||
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
||||||
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
|
|
||||||
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
|
|
||||||
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
|
|
||||||
REPAIR OR CORRECTION.
|
|
||||||
|
|
||||||
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
|
||||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
|
|
||||||
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
|
|
||||||
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
|
|
||||||
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
|
|
||||||
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
|
|
||||||
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
|
|
||||||
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
|
|
||||||
POSSIBILITY OF SUCH DAMAGES.
|
|
||||||
|
|
||||||
END OF TERMS AND CONDITIONS
|
|
||||||
|
|
||||||
How to Apply These Terms to Your New Programs
|
|
||||||
|
|
||||||
If you develop a new program, and you want it to be of the greatest
|
|
||||||
possible use to the public, the best way to achieve this is to make it
|
|
||||||
free software which everyone can redistribute and change under these terms.
|
|
||||||
|
|
||||||
To do so, attach the following notices to the program. It is safest
|
|
||||||
to attach them to the start of each source file to most effectively
|
|
||||||
convey the exclusion of warranty; and each file should have at least
|
|
||||||
the "copyright" line and a pointer to where the full notice is found.
|
|
||||||
|
|
||||||
<one line to give the program's name and a brief idea of what it does.>
|
|
||||||
Copyright (C) <year> <name of author>
|
|
||||||
|
|
||||||
This program is free software; you can redistribute it and/or modify
|
|
||||||
it under the terms of the GNU General Public License as published by
|
|
||||||
the Free Software Foundation; either version 2 of the License, or
|
|
||||||
(at your option) any later version.
|
|
||||||
|
|
||||||
This program is distributed in the hope that it will be useful,
|
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
||||||
GNU General Public License for more details.
|
|
||||||
|
|
||||||
You should have received a copy of the GNU General Public License along
|
|
||||||
with this program; if not, write to the Free Software Foundation, Inc.,
|
|
||||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
||||||
|
|
||||||
Also add information on how to contact you by electronic and paper mail.
|
|
||||||
|
|
||||||
If the program is interactive, make it output a short notice like this
|
|
||||||
when it starts in an interactive mode:
|
|
||||||
|
|
||||||
Gnomovision version 69, Copyright (C) year name of author
|
|
||||||
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
|
||||||
This is free software, and you are welcome to redistribute it
|
|
||||||
under certain conditions; type `show c' for details.
|
|
||||||
|
|
||||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
|
||||||
parts of the General Public License. Of course, the commands you use may
|
|
||||||
be called something other than `show w' and `show c'; they could even be
|
|
||||||
mouse-clicks or menu items--whatever suits your program.
|
|
||||||
|
|
||||||
You should also get your employer (if you work as a programmer) or your
|
|
||||||
school, if any, to sign a "copyright disclaimer" for the program, if
|
|
||||||
necessary. Here is a sample; alter the names:
|
|
||||||
|
|
||||||
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
|
|
||||||
`Gnomovision' (which makes passes at compilers) written by James Hacker.
|
|
||||||
|
|
||||||
<signature of Ty Coon>, 1 April 1989
|
|
||||||
Ty Coon, President of Vice
|
|
||||||
|
|
||||||
This General Public License does not permit incorporating your program into
|
|
||||||
proprietary programs. If your program is a subroutine library, you may
|
|
||||||
consider it more useful to permit linking proprietary applications with the
|
|
||||||
library. If this is what you want to do, use the GNU Lesser General
|
|
||||||
Public License instead of this License.
|
|
||||||
@@ -1,5 +1,5 @@
|
|||||||
/* backtrace.h -- Public header file for stack backtrace library.
|
/* backtrace.h -- Public header file for stack backtrace library.
|
||||||
Copyright (C) 2012-2021 Free Software Foundation, Inc.
|
Copyright (C) 2012-2024 Free Software Foundation, Inc.
|
||||||
Written by Ian Lance Taylor, Google.
|
Written by Ian Lance Taylor, Google.
|
||||||
|
|
||||||
Redistribution and use in source and binary forms, with or without
|
Redistribution and use in source and binary forms, with or without
|
||||||
|
|||||||
Binary file not shown.
@@ -1,11 +0,0 @@
|
|||||||
#All folders
|
|
||||||
SRB2.res
|
|
||||||
depend.dep
|
|
||||||
depend.ped
|
|
||||||
*.o
|
|
||||||
buildvm*
|
|
||||||
minilua*
|
|
||||||
lj_vm.S
|
|
||||||
#VC9 folder only
|
|
||||||
/VC9/Win32
|
|
||||||
/VC9/x64
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
# DON'T REMOVE
|
|
||||||
# This keeps the folder from disappearing
|
|
||||||
+13
-1
@@ -228,6 +228,14 @@ set(SRB2_CONFIG_STATIC_OPENGL OFF CACHE BOOL
|
|||||||
"Use statically linked OpenGL. NOT RECOMMENDED.")
|
"Use statically linked OpenGL. NOT RECOMMENDED.")
|
||||||
set(SRB2_CONFIG_USE_FBO_OGL ON CACHE BOOL
|
set(SRB2_CONFIG_USE_FBO_OGL ON CACHE BOOL
|
||||||
"Enable OpenGL FBO Downsampling support.")
|
"Enable OpenGL FBO Downsampling support.")
|
||||||
|
set(SRB2_CONFIG_DEDICATED OFF CACHE BOOL
|
||||||
|
"Build a dedicated server.")
|
||||||
|
|
||||||
|
if(${SRB2_CONFIG_DEDICATED})
|
||||||
|
set(SRB2_CONFIG_HAVE_GME NO)
|
||||||
|
set(SRB2_CONFIG_HAVE_OPENMPT NO)
|
||||||
|
set(SRB2_CONFIG_HWRENDER NO)
|
||||||
|
endif()
|
||||||
|
|
||||||
### use internal libraries?
|
### use internal libraries?
|
||||||
if(${CMAKE_SYSTEM} MATCHES "Windows") ###set on Windows only
|
if(${CMAKE_SYSTEM} MATCHES "Windows") ###set on Windows only
|
||||||
@@ -554,7 +562,11 @@ add_definitions(-DCMAKECONFIG)
|
|||||||
# ${SRB2_BLUA_HEADERS}
|
# ${SRB2_BLUA_HEADERS}
|
||||||
#)
|
#)
|
||||||
|
|
||||||
add_subdirectory(sdl)
|
if(${SRB2_CONFIG_DEDICATED})
|
||||||
|
add_subdirectory(dedicated)
|
||||||
|
else()
|
||||||
|
add_subdirectory(sdl)
|
||||||
|
endif()
|
||||||
|
|
||||||
if(NOT ${SRB2_SDL2_AVAILABLE} AND NOT ${SRB2_WIN32_AVAILABLE})
|
if(NOT ${SRB2_SDL2_AVAILABLE} AND NOT ${SRB2_WIN32_AVAILABLE})
|
||||||
message(FATAL_ERROR "There are no targets available to build an SRB2Kart executable. :(")
|
message(FATAL_ERROR "There are no targets available to build an SRB2Kart executable. :(")
|
||||||
|
|||||||
+348
-745
File diff suppressed because it is too large.
Load diff
@@ -0,0 +1,19 @@
|
|||||||
|
makedir:=$(makedir)/Dedicated
|
||||||
|
|
||||||
|
sources+=$(call List,dedicated/Sourcefile)
|
||||||
|
|
||||||
|
opts+=-DDEDICATED
|
||||||
|
|
||||||
|
ifdef MINGW
|
||||||
|
libs+=-mconsole
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifndef NOTHREADS
|
||||||
|
opts+=-DHAVE_THREADS
|
||||||
|
sources+=dedicated/i_threads.c
|
||||||
|
endif
|
||||||
|
|
||||||
|
NOOPENMPT=1
|
||||||
|
NOGME=1
|
||||||
|
NOHW=1
|
||||||
|
NOUPNP=1
|
||||||
@@ -0,0 +1,124 @@
|
|||||||
|
#
|
||||||
|
# Detect the host system and compiler version.
|
||||||
|
#
|
||||||
|
|
||||||
|
# Previously featured:\
|
||||||
|
PANDORA\
|
||||||
|
DUMMY\
|
||||||
|
DJGPPDOS\
|
||||||
|
SOLARIS\
|
||||||
|
MACOSX\
|
||||||
|
|
||||||
|
all_systems:=\
|
||||||
|
LINUX64\
|
||||||
|
MINGW64\
|
||||||
|
MINGW\
|
||||||
|
UNIX\
|
||||||
|
LINUX\
|
||||||
|
FREEBSD\
|
||||||
|
HAIKU\
|
||||||
|
|
||||||
|
# check for user specified system
|
||||||
|
ifeq (,$(filter $(all_systems),$(.VARIABLES)))
|
||||||
|
ifeq ($(OS),Windows_NT) # all windows are Windows_NT...
|
||||||
|
|
||||||
|
ifeq ($(shell uname -s | grep -o MINGW64),MINGW64) # 64-bit MinGW
|
||||||
|
_m=Detected a Windows system,\
|
||||||
|
compiling for 64-bit MinGW SDL...)
|
||||||
|
$(call Print,$(_m))
|
||||||
|
MINGW64=1
|
||||||
|
else # 32-bit MinGW
|
||||||
|
_m=Detected a Windows system,\
|
||||||
|
compiling for 32-bit MinGW SDL...)
|
||||||
|
$(call Print,$(_m))
|
||||||
|
MINGW=1
|
||||||
|
endif
|
||||||
|
|
||||||
|
NOOBJDUMP=1
|
||||||
|
else # if you on the *nix
|
||||||
|
|
||||||
|
system:=$(shell uname -s)
|
||||||
|
|
||||||
|
ifeq ($(system),Linux)
|
||||||
|
new_system:=LINUX
|
||||||
|
else ifeq ($(system),Haiku)
|
||||||
|
new_system:=HAIKU
|
||||||
|
else
|
||||||
|
|
||||||
|
$(error \
|
||||||
|
Could not automatically detect your system,\
|
||||||
|
try specifying a system manually)
|
||||||
|
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifeq ($(shell getconf LONG_BIT),64)
|
||||||
|
system+=64-bit
|
||||||
|
new_system:=$(new_system)64
|
||||||
|
endif
|
||||||
|
|
||||||
|
$(call Print,Detected $(system) ($(new_system))...)
|
||||||
|
$(new_system):=1
|
||||||
|
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
|
||||||
|
# This must have high to low order.
|
||||||
|
gcc_versions:=\
|
||||||
|
151 150 15\
|
||||||
|
142 141 140 14\
|
||||||
|
132 131 130 13\
|
||||||
|
123 122 121 120 12\
|
||||||
|
114 113 112 111 110 11\
|
||||||
|
105 104 103 102 101 100 10\
|
||||||
|
95 94 93 92 91 90\
|
||||||
|
85 84 83 82 81 80\
|
||||||
|
75 74 73 72 71 70\
|
||||||
|
64 63 62 61 60\
|
||||||
|
55 54 53 52 51 50\
|
||||||
|
49 48 47 46 45 44 43 42 41 40
|
||||||
|
|
||||||
|
latest_gcc_version:=15.1.1
|
||||||
|
|
||||||
|
# Automatically set version flag, but not if one was
|
||||||
|
# manually set. And don't bother if this is a clean only
|
||||||
|
# run.
|
||||||
|
ifeq (,$(call Wildvar,GCC% destructive))
|
||||||
|
|
||||||
|
# can't use $(CC) --version here since that uses argv[0] to display the name
|
||||||
|
# also gcc outputs the information to stderr, so I had to do 2>&1
|
||||||
|
# this program really doesn't like identifying itself
|
||||||
|
shellversion:=$(shell $(CC) -v 2>&1)
|
||||||
|
# Try to remove "-win32"
|
||||||
|
version:=$(subst -win32,.0,$(shellversion))
|
||||||
|
|
||||||
|
# check if this is in fact GCC
|
||||||
|
ifneq (,$(findstring gcc version,$(version)))
|
||||||
|
|
||||||
|
# in stark contrast to the name, gcc will give me a nicely formatted version number for free
|
||||||
|
shellversion:=$(shell $(CC) -dumpfullversion)
|
||||||
|
|
||||||
|
# Try to remove "-win32"
|
||||||
|
version:=$(subst -win32,.0,$(shellversion))
|
||||||
|
|
||||||
|
# Turn version into words of major, minor
|
||||||
|
v:=$(subst ., ,$(version))
|
||||||
|
# concat. major minor
|
||||||
|
v:=$(word 1,$(v))$(word 2,$(v))
|
||||||
|
|
||||||
|
# If this version is not in the list,
|
||||||
|
# default to the latest supported
|
||||||
|
ifeq (,$(filter $(v),$(gcc_versions)))
|
||||||
|
define line =
|
||||||
|
Your compiler version, GCC $(version), \
|
||||||
|
is not supported by the Makefile.
|
||||||
|
The Makefile will assume GCC $(latest_gcc_version).
|
||||||
|
endef
|
||||||
|
$(call Print,$(line))
|
||||||
|
GCC$(subst .,,$(latest_gcc_version)):=1
|
||||||
|
else
|
||||||
|
$(call Print,Detected GCC $(version) (GCC$(v)))
|
||||||
|
GCC$(v):=1
|
||||||
|
endif
|
||||||
|
|
||||||
|
endif
|
||||||
|
endif
|
||||||
@@ -0,0 +1,106 @@
|
|||||||
|
#
|
||||||
|
# Makefile for feature flags.
|
||||||
|
#
|
||||||
|
|
||||||
|
passthru_opts+=\
|
||||||
|
NOHW NOMD5 NOPOSTPROCESSING\
|
||||||
|
MOBJCONSISTANCY PACKETDROP ZDEBUG\
|
||||||
|
HAVE_MINIUPNPC\
|
||||||
|
HAVE_DISCORDRPC DEVELOP\
|
||||||
|
NOBLUAJIT
|
||||||
|
|
||||||
|
# build with debugging information
|
||||||
|
ifdef DEBUGMODE
|
||||||
|
PACKETDROP=1
|
||||||
|
opts+=-DPARANOIA -DRANGECHECK
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifndef NOHW
|
||||||
|
opts+=-DHWRENDER
|
||||||
|
|
||||||
|
ifndef NOSCREENFBO
|
||||||
|
opts+=-DUSE_FBO_OGL
|
||||||
|
endif
|
||||||
|
|
||||||
|
sources+=$(call List,hardware/Sourcefile)
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifndef NOMD5
|
||||||
|
sources+=md5.c
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifndef NONET
|
||||||
|
ifndef NOSATURNJOIN
|
||||||
|
opts+=-DDOSATURNJOIN
|
||||||
|
endif
|
||||||
|
ifndef NOSATURNPAK
|
||||||
|
opts+=-DDOSATURNPAK
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifndef NOZLIB
|
||||||
|
ifndef NOPNG
|
||||||
|
ifdef PNG_PKGCONFIG
|
||||||
|
$(eval $(call Use_pkg_config,PNG_PKGCONFIG))
|
||||||
|
else
|
||||||
|
PNG_CONFIG?=$(call Prefix,libpng-config)
|
||||||
|
$(eval $(call Configure,PNG,$(PNG_CONFIG) \
|
||||||
|
$(if $(PNG_STATIC),--static),,--ldflags))
|
||||||
|
endif
|
||||||
|
ifdef LINUX
|
||||||
|
opts+=-D_LARGEFILE64_SOURCE
|
||||||
|
endif
|
||||||
|
opts+=-DHAVE_PNG
|
||||||
|
sources+=apng.c
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifndef NOCURL
|
||||||
|
CURLCONFIG?=curl-config
|
||||||
|
$(eval $(call Configure,CURL,$(CURLCONFIG)))
|
||||||
|
opts+=-DHAVE_CURL
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef HAVE_MINIUPNPC
|
||||||
|
MINIUPNPC_PKGCONFIG?=miniupnpc
|
||||||
|
$(eval $(call Use_pkg_config,MINIUPNPC))
|
||||||
|
HAVE_MINIUPNPC=1
|
||||||
|
opts+=-DHAVE_MINIUPNPC
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifndef NOLIBBACKTRACE
|
||||||
|
$(eval $(call Propogate_flags,LIBBACKTRACE))
|
||||||
|
libs+=-lbacktrace
|
||||||
|
opts+=-DHAVE_LIBBACKTRACE
|
||||||
|
endif
|
||||||
|
|
||||||
|
#windoze hack
|
||||||
|
ifdef MINGW
|
||||||
|
ifndef NODISCORDRPC
|
||||||
|
HAVE_DISCORDRPC=1
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef HAVE_DISCORDRPC
|
||||||
|
$(eval $(call Propogate_flags,DISCORDRPC))
|
||||||
|
libs+=-ldiscord-rpc
|
||||||
|
opts+=-DUSE_STUN
|
||||||
|
sources+=discord.c stun.c
|
||||||
|
endif
|
||||||
|
|
||||||
|
# (Valgrind is a memory debugger.)
|
||||||
|
ifdef VALGRIND
|
||||||
|
VALGRIND_PKGCONFIG?=valgrind
|
||||||
|
VALGRIND_LDFLAGS=
|
||||||
|
$(eval $(call Use_pkg_config,VALGRIND))
|
||||||
|
ZDEBUG=1
|
||||||
|
opts+=-DHAVE_VALGRIND
|
||||||
|
endif
|
||||||
|
|
||||||
|
default_packages:=\
|
||||||
|
GME/libgme/LIBGME\
|
||||||
|
OPENMPT/libopenmpt/LIBOPENMPT\
|
||||||
|
ZLIB/zlib\
|
||||||
|
|
||||||
|
$(foreach p,$(default_packages),\
|
||||||
|
$(eval $(call Check_pkg_config,$(p))))
|
||||||
@@ -0,0 +1,71 @@
|
|||||||
|
#
|
||||||
|
# Makefile options for Haiku
|
||||||
|
#
|
||||||
|
|
||||||
|
opts+=-DUNIXCOMMON -DLUA_USE_POSIX
|
||||||
|
|
||||||
|
ifndef DEDICATED
|
||||||
|
ifndef DUMMY
|
||||||
|
SDL?=1
|
||||||
|
DEDICATED?=0
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
|
||||||
|
NOEXECINFO=1
|
||||||
|
|
||||||
|
ifeq (${SDL},1)
|
||||||
|
EXENAME?=srb2haiku
|
||||||
|
else ifeq (${DEDICATED},1)
|
||||||
|
EXENAME?=srb2haikud
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifndef NONET
|
||||||
|
libs+=-lnetwork
|
||||||
|
endif
|
||||||
|
|
||||||
|
define _set =
|
||||||
|
$(1)_CFLAGS?=$($(1)_opts)
|
||||||
|
$(1)_LDFLAGS?=$($(1)_libs)
|
||||||
|
endef
|
||||||
|
|
||||||
|
lib:=../libs/gme
|
||||||
|
LIBGME_opts:=-I$(lib)/include
|
||||||
|
LIBGME_libs:=-l:libgme.so.0
|
||||||
|
$(eval $(call _set,LIBGME))
|
||||||
|
|
||||||
|
lib:=../libs/libopenmpt
|
||||||
|
LIBOPENMPT_opts:=-I$(lib)/inc
|
||||||
|
LIBOPENMPT_libs:=-l:libopenmpt.so.0
|
||||||
|
$(eval $(call _set,LIBOPENMPT))
|
||||||
|
|
||||||
|
ifdef SDL
|
||||||
|
lib:=../libs/SDL2_mixer
|
||||||
|
mixer_opts:=-I$(lib)/include
|
||||||
|
mixer_libs:=-l:libSDL2_mixer-2.0.so.0
|
||||||
|
|
||||||
|
lib:=../libs/SDL2
|
||||||
|
SDL_opts:=-I$(lib)/include $(mixer_opts)
|
||||||
|
SDL_libs:=$(mixer_libs) -l:libSDL2-2.0.so.0
|
||||||
|
$(eval $(call _set,SDL))
|
||||||
|
endif
|
||||||
|
|
||||||
|
lib:=../libs/zlib
|
||||||
|
ZLIB_opts:=-I$(lib)
|
||||||
|
ZLIB_libs:=-l:libz.so.1
|
||||||
|
$(eval $(call _set,ZLIB))
|
||||||
|
|
||||||
|
ifndef PNG_CONFIG
|
||||||
|
PNG_opts:=
|
||||||
|
PNG_libs:=-l:libpng16.so.16
|
||||||
|
$(eval $(call _set,PNG))
|
||||||
|
endif
|
||||||
|
|
||||||
|
lib:=../libs/curl
|
||||||
|
CURL_opts:=-I$(lib)/include
|
||||||
|
CURL_libs:=-l:libcurl.so.4
|
||||||
|
$(eval $(call _set,CURL))
|
||||||
|
|
||||||
|
lib:=../libs/miniupnpc
|
||||||
|
MINIUPNPC_opts:=-I$(lib)/include
|
||||||
|
MINIUPNPC_libs:=-l:libminiupnpc.so.17
|
||||||
|
$(eval $(call _set,MINIUPNPC))
|
||||||
@@ -0,0 +1,47 @@
|
|||||||
|
#
|
||||||
|
# Makefile options for unices (linux, bsd...)
|
||||||
|
#
|
||||||
|
|
||||||
|
|
||||||
|
opts+=-DUNIXCOMMON -DLUA_USE_POSIX
|
||||||
|
# Use -rdynamic so a backtrace log shows function names
|
||||||
|
# instead of addresses
|
||||||
|
libs+=-lm -rdynamic
|
||||||
|
|
||||||
|
ifndef NOHW
|
||||||
|
opts+=-I/usr/X11R6/include
|
||||||
|
libs+=-L/usr/X11R6/lib
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifndef DEDICATED
|
||||||
|
SDL?=1
|
||||||
|
DEDICATED?=0
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifeq (${SDL},1)
|
||||||
|
EXENAME?=lsdl2srb2kart
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifeq (${DEDICATED},1)
|
||||||
|
EXENAME?=lsrb2kartd
|
||||||
|
endif
|
||||||
|
|
||||||
|
# In common usage.
|
||||||
|
ifdef LINUX
|
||||||
|
libs+=-lrt
|
||||||
|
passthru_opts+=NOTERMIOS
|
||||||
|
endif
|
||||||
|
|
||||||
|
# Tested by Steel, as of release 2.2.8.
|
||||||
|
ifdef FREEBSD
|
||||||
|
opts+=-I/usr/X11R6/include -DLINUX -DFREEBSD
|
||||||
|
libs+=-L/usr/X11R6/lib -lkvm -lexecinfo
|
||||||
|
endif
|
||||||
|
|
||||||
|
# FIXME: UNTESTED
|
||||||
|
#ifdef SOLARIS
|
||||||
|
#NOIPX=1
|
||||||
|
#opts+=-I/usr/local/include -I/opt/sfw/include \
|
||||||
|
# -DSOLARIS -DINADDR_NONE=INADDR_ANY -DBSD_COMP
|
||||||
|
#libs+=-L/opt/sfw/lib -lsocket -lnsl
|
||||||
|
#endif
|
||||||
@@ -0,0 +1,16 @@
|
|||||||
|
#
|
||||||
|
# Warn about old build directories and offer to purge.
|
||||||
|
#
|
||||||
|
|
||||||
|
_old:=$(wildcard $(addprefix ../bin/,FreeBSD Linux \
|
||||||
|
Linux64 Mingw Mingw64 SDL dummy) ../objs ../dep)
|
||||||
|
|
||||||
|
ifdef _old
|
||||||
|
$(foreach v,$(_old),$(info $(abspath $(v))))
|
||||||
|
$(info )
|
||||||
|
$(info These directories are no longer\
|
||||||
|
required and should be removed.)
|
||||||
|
$(info You may remove them manually or\
|
||||||
|
by using 'make distclean')
|
||||||
|
$(error )
|
||||||
|
endif
|
||||||
@@ -0,0 +1,76 @@
|
|||||||
|
#
|
||||||
|
# Platform specific options.
|
||||||
|
#
|
||||||
|
|
||||||
|
PKG_CONFIG?=pkg-config
|
||||||
|
|
||||||
|
ifdef WINDOWSHELL
|
||||||
|
rmrf=-2>NUL DEL /S /Q
|
||||||
|
mkdir=-2>NUL MD
|
||||||
|
cat=TYPE
|
||||||
|
else
|
||||||
|
rmrf=rm -rf
|
||||||
|
mkdir=mkdir -p
|
||||||
|
cat=cat
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef LINUX64
|
||||||
|
LINUX=1
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef MINGW64
|
||||||
|
MINGW=1
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef LINUX
|
||||||
|
UNIX=1
|
||||||
|
ifdef LINUX64
|
||||||
|
NONX86=1
|
||||||
|
# LINUX64 does not imply X86_64=1;
|
||||||
|
# could mean ARM64 or Itanium
|
||||||
|
platform=linux/64
|
||||||
|
else
|
||||||
|
platform=linux
|
||||||
|
endif
|
||||||
|
else ifdef FREEBSD
|
||||||
|
UNIX=1
|
||||||
|
platform=freebsd
|
||||||
|
else ifdef HAIKU
|
||||||
|
# Give Haiku its own configuration, since it
|
||||||
|
# isn't actually UNIX.
|
||||||
|
include Makefile.d/haiku.mk
|
||||||
|
else ifdef SOLARIS # FIXME: UNTESTED
|
||||||
|
UNIX=1
|
||||||
|
platform=solaris
|
||||||
|
else ifdef CYGWIN32 # FIXME: UNTESTED
|
||||||
|
platform=cygwin
|
||||||
|
else ifdef MINGW
|
||||||
|
ifdef MINGW64
|
||||||
|
NONX86=1
|
||||||
|
NOASM=1
|
||||||
|
# MINGW64 should not necessarily imply X86_64=1,
|
||||||
|
# but we make that assumption elsewhere
|
||||||
|
# Once that changes, remove this
|
||||||
|
X86_64=1
|
||||||
|
platform=mingw/64
|
||||||
|
else
|
||||||
|
platform=mingw
|
||||||
|
endif
|
||||||
|
include Makefile.d/win32.mk
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef platform
|
||||||
|
makedir:=$(makedir)/$(platform)
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef UNIX
|
||||||
|
include Makefile.d/nix.mk
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifeq ($(SDL), 1)
|
||||||
|
include Makefile.d/sdl.mk
|
||||||
|
else ifeq ($(DEDICATED), 1)
|
||||||
|
include Makefile.d/dedicated.mk
|
||||||
|
else
|
||||||
|
include Makefile.d/dummy.mk
|
||||||
|
endif
|
||||||
@@ -0,0 +1,71 @@
|
|||||||
|
#
|
||||||
|
# Makefile options for SDL2 backend.
|
||||||
|
#
|
||||||
|
|
||||||
|
#
|
||||||
|
# SDL...., *looks at Alam*, THIS IS A MESS!
|
||||||
|
#
|
||||||
|
# ...a little bird flexes its muscles...
|
||||||
|
#
|
||||||
|
|
||||||
|
makedir:=$(makedir)/SDL
|
||||||
|
|
||||||
|
opts+=-DDIRECTFULLSCREEN -DHAVE_SDL
|
||||||
|
sources+=$(call List,sdl/Sourcefile)
|
||||||
|
|
||||||
|
NOUPNP=1
|
||||||
|
|
||||||
|
# FIXME: UNTESTED
|
||||||
|
#ifdef PANDORA
|
||||||
|
#include sdl/SRB2Pandora/Makefile.cfg
|
||||||
|
#endif #ifdef PANDORA
|
||||||
|
|
||||||
|
# FIXME: UNTESTED
|
||||||
|
#ifdef CYGWIN32
|
||||||
|
#include sdl/MakeCYG.cfg
|
||||||
|
#endif #ifdef CYGWIN32
|
||||||
|
|
||||||
|
ifndef NOHW
|
||||||
|
sources+=sdl/ogl_sdl.c
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef NOMIXER
|
||||||
|
sources+=sdl/sdl_sound.c
|
||||||
|
else
|
||||||
|
opts+=-DHAVE_MIXER
|
||||||
|
sources+=sdl/mixer_sound.c
|
||||||
|
|
||||||
|
ifndef HAIKU # Haiku has a special import path
|
||||||
|
libs+=-lSDL2_mixer
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifndef NOTHREADS
|
||||||
|
opts+=-DHAVE_THREADS
|
||||||
|
sources+=sdl/i_threads.c
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef SDL_PKGCONFIG
|
||||||
|
$(eval $(call Use_pkg_config,SDL))
|
||||||
|
else
|
||||||
|
SDL_CONFIG?=$(call Prefix,sdl2-config)
|
||||||
|
SDL_CFLAGS?=$(shell $(SDL_CONFIG) --cflags)
|
||||||
|
SDL_LDFLAGS?=$(shell $(SDL_CONFIG) \
|
||||||
|
$(if $(STATIC),--static-libs,--libs))
|
||||||
|
$(eval $(call Propogate_flags,SDL))
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef MINGW
|
||||||
|
ifndef NOSDLMAIN
|
||||||
|
SDLMAIN=1
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef SDLMAIN
|
||||||
|
opts+=-DSDLMAIN
|
||||||
|
else
|
||||||
|
ifdef MINGW
|
||||||
|
opts+=-Umain
|
||||||
|
libs+=-mconsole
|
||||||
|
endif
|
||||||
|
endif
|
||||||
@@ -0,0 +1,93 @@
|
|||||||
|
#
|
||||||
|
# Utility macros for the rest of the Makefiles.
|
||||||
|
#
|
||||||
|
|
||||||
|
Ifnot=$(if $(1),$(3),$(2))
|
||||||
|
Ifndef=$(call Ifnot,$($(1)),$(2),$(3))
|
||||||
|
|
||||||
|
# Match and expand a list of variables by pattern.
|
||||||
|
Wildvar=$(foreach v,$(filter $(1),$(.VARIABLES)),$($(v)))
|
||||||
|
|
||||||
|
# Read a list of words from file and prepend each with the
|
||||||
|
# directory of the file.
|
||||||
|
_cat=$(shell $(cat) $(call Windows_path,$(1)))
|
||||||
|
List=$(addprefix $(dir $(1)),$(call _cat,$(1)))
|
||||||
|
|
||||||
|
# Convert path separators to backslash on Windows.
|
||||||
|
Windows_path=$(if $(WINDOWSHELL),$(subst /,\,$(1)),$(1))
|
||||||
|
|
||||||
|
define Propogate_flags =
|
||||||
|
opts+=$$($(1)_CFLAGS)
|
||||||
|
libs+=$$($(1)_LDFLAGS)
|
||||||
|
endef
|
||||||
|
|
||||||
|
# Set library's _CFLAGS and _LDFLAGS from some command.
|
||||||
|
# Automatically propogates the flags too.
|
||||||
|
# 1: variable prefix (e.g. CURL)
|
||||||
|
# 2: start of command (e.g. curl-config)
|
||||||
|
# --- optional ----
|
||||||
|
# 3: CFLAGS command arguments, default '--cflags'
|
||||||
|
# 4: LDFLAGS command arguments, default '--libs'
|
||||||
|
# 5: common command arguments at the end of command
|
||||||
|
define Configure =
|
||||||
|
$(1)_CFLAGS?=$$(shell $(2) $(or $(3),--cflags) $(5))
|
||||||
|
$(1)_LDFLAGS?=$$(shell $(2) $(or $(4),--libs) $(5))
|
||||||
|
$(call Propogate_flags,$(1))
|
||||||
|
endef
|
||||||
|
|
||||||
|
# Configure library with pkg-config. The package name is
|
||||||
|
# taken from a _PKGCONFIG variable.
|
||||||
|
# 1: variable prefix
|
||||||
|
#
|
||||||
|
# LIBGME_PKGCONFIG=libgme
|
||||||
|
# $(eval $(call Use_pkg_config,LIBGME))
|
||||||
|
define Use_pkg_config =
|
||||||
|
$(call Configure,$(1),$(PKG_CONFIG),,,$($(1)_PKGCONFIG))
|
||||||
|
endef
|
||||||
|
|
||||||
|
# Check disabling flag and configure package in one step
|
||||||
|
# according to delimited argument.
|
||||||
|
# (There is only one argument, but it split by slash.)
|
||||||
|
# 1/: short form library name (uppercase). This is
|
||||||
|
# prefixed with 'NO' and 'HAVE_'. E.g. NOGME, HAVE_GME
|
||||||
|
# /2: package name (e.g. libgme)
|
||||||
|
# /3: variable prefix
|
||||||
|
#
|
||||||
|
# The following example would check if NOGME is not
|
||||||
|
# defined before attempting to define LIBGME_CFLAGS and
|
||||||
|
# LIBGME_LDFLAGS as with Use_pkg_config.
|
||||||
|
#
|
||||||
|
# $(eval $(call Check_pkg_config,GME/libgme/LIBGME))
|
||||||
|
define Check_pkg_config =
|
||||||
|
_p:=$(subst /, ,$(1))
|
||||||
|
_v1:=$$(word 1,$$(_p))
|
||||||
|
_v2:=$$(or $$(word 3,$$(_p)),$$(_v1))
|
||||||
|
ifndef NO$$(_v1)
|
||||||
|
$$(_v2)_PKGCONFIG?=$$(word 2,$$(_p))
|
||||||
|
$$(eval $$(call Use_pkg_config,$$(_v2)))
|
||||||
|
opts+=-DHAVE_$$(_v1)
|
||||||
|
endif
|
||||||
|
endef
|
||||||
|
|
||||||
|
# $(call Prefix,gcc)
|
||||||
|
Prefix=$(if $(PREFIX),$(PREFIX)-)$(1)
|
||||||
|
|
||||||
|
Echo=
|
||||||
|
Echo_name=
|
||||||
|
Print=
|
||||||
|
|
||||||
|
ifndef SILENT
|
||||||
|
Echo=@echo $(1)
|
||||||
|
ifndef ECHO
|
||||||
|
ifndef NOECHOFILENAMES
|
||||||
|
Echo_name=$(call Echo,-- $(1) ...)
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
ifndef MAKE_RESTARTS
|
||||||
|
ifndef destructive
|
||||||
|
Print=$(info $(1))
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
|
||||||
|
.=$(call Ifndef,ECHO,@)
|
||||||
@@ -0,0 +1,181 @@
|
|||||||
|
#
|
||||||
|
# Flags to put a sock in GCC!
|
||||||
|
#
|
||||||
|
|
||||||
|
# See the versions list in detect.mk
|
||||||
|
# This will define all version flags going backward.
|
||||||
|
# Yes, it's magic.
|
||||||
|
define _predecessor =
|
||||||
|
ifdef GCC$(firstword $(1))
|
||||||
|
GCC$(lastword $(1)):=1
|
||||||
|
endif
|
||||||
|
endef
|
||||||
|
_n:=$(words $(gcc_versions))
|
||||||
|
$(foreach v,$(join $(wordlist 2,$(_n),- $(gcc_versions)),\
|
||||||
|
$(addprefix =,$(wordlist 2,$(_n),$(gcc_versions)))),\
|
||||||
|
$(and $(findstring =,$(v)),\
|
||||||
|
$(eval $(call _predecessor,$(subst =, ,$(v))))))
|
||||||
|
|
||||||
|
# aggregate returns seem to happen alot in c++ so just supress em lel
|
||||||
|
CXXFLAGS+= -Wno-aggregate-return
|
||||||
|
|
||||||
|
# -W -Wno-unused
|
||||||
|
|
||||||
|
ifdef GCC150
|
||||||
|
opts+=-std=gnu17
|
||||||
|
endif
|
||||||
|
WFLAGS:=-Wall -Wno-trigraphs
|
||||||
|
ifndef GCC295
|
||||||
|
#WFLAGS+=-Wno-packed
|
||||||
|
endif
|
||||||
|
ifndef RELAXWARNINGS
|
||||||
|
WFLAGS+=-W
|
||||||
|
#WFLAGS+=-Wno-sign-compare
|
||||||
|
ifndef GCC295
|
||||||
|
WFLAGS+=-Wno-div-by-zero
|
||||||
|
endif
|
||||||
|
#WFLAGS+=-Wsystem-headers
|
||||||
|
WFLAGS+=-Wfloat-equal
|
||||||
|
#WFLAGS+=-Wtraditional
|
||||||
|
WFLAGS+=-Wundef
|
||||||
|
ifndef GCC295
|
||||||
|
WFLAGS+=-Wendif-labels
|
||||||
|
endif
|
||||||
|
ifdef GCC41
|
||||||
|
WFLAGS+=-Wshadow
|
||||||
|
endif
|
||||||
|
#WFLAGS+=-Wlarger-than-%len%
|
||||||
|
WFLAGS+=-Wpointer-arith -Wbad-function-cast
|
||||||
|
ifdef GCC45
|
||||||
|
#WFLAGS+=-Wc++-compat
|
||||||
|
endif
|
||||||
|
WFLAGS+=-Wcast-qual
|
||||||
|
ifndef NOCASTALIGNWARN
|
||||||
|
WFLAGS+=-Wcast-align
|
||||||
|
endif
|
||||||
|
WFLAGS+=-Wwrite-strings
|
||||||
|
ifndef ERRORMODE
|
||||||
|
#WFLAGS+=-Wconversion
|
||||||
|
ifdef GCC43
|
||||||
|
#WFLAGS+=-Wno-sign-conversion
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
WFLAGS+=-Wsign-compare
|
||||||
|
ifdef GCC91
|
||||||
|
WFLAGS+=-Wno-error=address-of-packed-member
|
||||||
|
endif
|
||||||
|
ifdef GCC45
|
||||||
|
WFLAGS+=-Wlogical-op
|
||||||
|
endif
|
||||||
|
WFLAGS+=-Waggregate-return
|
||||||
|
ifdef HAIKU
|
||||||
|
ifdef GCC41
|
||||||
|
#WFLAGS+=-Wno-attributes
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
#WFLAGS+=-Wstrict-prototypes
|
||||||
|
ifdef GCC40
|
||||||
|
WFLAGS+=-Wold-style-definition
|
||||||
|
endif
|
||||||
|
WFLAGS+=-Wmissing-prototypes -Wmissing-declarations
|
||||||
|
ifdef GCC40
|
||||||
|
WFLAGS+=-Wmissing-field-initializers
|
||||||
|
endif
|
||||||
|
WFLAGS+=-Wmissing-noreturn
|
||||||
|
#WFLAGS+=-Wmissing-format-attribute
|
||||||
|
#WFLAGS+=-Wno-multichar
|
||||||
|
#WFLAGS+=-Wno-deprecated-declarations
|
||||||
|
#WFLAGS+=-Wpacked
|
||||||
|
#WFLAGS+=-Wpadded
|
||||||
|
#WFLAGS+=-Wredundant-decls
|
||||||
|
WFLAGS+=-Wnested-externs
|
||||||
|
#WFLAGS+=-Wunreachable-code
|
||||||
|
WFLAGS+=-Winline
|
||||||
|
ifdef DEBUGMODE
|
||||||
|
WFLAGS+=-Wno-error=inline
|
||||||
|
endif
|
||||||
|
ifdef GCC43
|
||||||
|
WFLAGS+=-funit-at-a-time
|
||||||
|
WFLAGS+=-Wlogical-op
|
||||||
|
endif
|
||||||
|
ifndef GCC295
|
||||||
|
WFLAGS+=-Wdisabled-optimization
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
WFLAGS+=-Wformat-y2k
|
||||||
|
ifdef GCC71
|
||||||
|
WFLAGS+=-Wno-error=format-overflow=2
|
||||||
|
endif
|
||||||
|
WFLAGS+=-Wformat-security
|
||||||
|
ifndef GCC29
|
||||||
|
#WFLAGS+=-Winit-self
|
||||||
|
endif
|
||||||
|
ifdef GCC46
|
||||||
|
WFLAGS+=-Wno-suggest-attribute=noreturn
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef NOLDWARNING
|
||||||
|
LDFLAGS+=-Wl,--as-needed
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef ERRORMODE
|
||||||
|
WFLAGS+=-Werror
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef GCC43
|
||||||
|
#WFLAGS+=-Wno-error=clobbered
|
||||||
|
endif
|
||||||
|
ifdef GCC44
|
||||||
|
#WFLAGS+=-Wno-error=array-bounds
|
||||||
|
endif
|
||||||
|
ifdef GCC46
|
||||||
|
WFLAGS+=-Wno-error=suggest-attribute=noreturn
|
||||||
|
endif
|
||||||
|
ifdef GCC54
|
||||||
|
WFLAGS+=-Wno-logical-op -Wno-error=logical-op
|
||||||
|
endif
|
||||||
|
ifdef GCC61
|
||||||
|
WFLAGS+=-Wno-tautological-compare -Wno-error=tautological-compare
|
||||||
|
endif
|
||||||
|
ifdef GCC71
|
||||||
|
WFLAGS+=-Wimplicit-fallthrough=4
|
||||||
|
endif
|
||||||
|
ifdef GCC81
|
||||||
|
WFLAGS+=-Wno-error=format-overflow
|
||||||
|
WFLAGS+=-Wno-format-overflow
|
||||||
|
WFLAGS+=-Wno-error=multistatement-macros
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef NONX86
|
||||||
|
ifdef X86_64 # yeah that SEEMS contradictory
|
||||||
|
opts+=-march=nocona
|
||||||
|
endif
|
||||||
|
else
|
||||||
|
ifndef GCC29
|
||||||
|
opts+=-msse3 -mfpmath=sse
|
||||||
|
else
|
||||||
|
opts+=-mpentium
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef DEBUGMODE
|
||||||
|
ifdef GCC48
|
||||||
|
opts+=-Og
|
||||||
|
else
|
||||||
|
opts+=-O0
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef VALGRIND
|
||||||
|
ifdef GCC46
|
||||||
|
WFLAGS+=-Wno-error=unused-but-set-variable
|
||||||
|
WFLAGS+=-Wno-unused-but-set-variable
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
|
||||||
|
# Lua
|
||||||
|
ifdef GCC43
|
||||||
|
ifndef GCC44
|
||||||
|
WFLAGS+=-Wno-logical-op
|
||||||
|
endif
|
||||||
|
endif
|
||||||
@@ -0,0 +1,124 @@
|
|||||||
|
#
|
||||||
|
# Mingw, if you don't know, that's Win32/Win64
|
||||||
|
#
|
||||||
|
|
||||||
|
ifndef MINGW64
|
||||||
|
EXENAME?=srb2kart-saturn_32bit.exe
|
||||||
|
else
|
||||||
|
EXENAME?=srb2kart-saturn_64bit.exe
|
||||||
|
endif
|
||||||
|
|
||||||
|
# disable dynamicbase if under msys2
|
||||||
|
ifdef MSYSTEM
|
||||||
|
libs+=-Wl,--disable-dynamicbase
|
||||||
|
endif
|
||||||
|
|
||||||
|
sources+=win32/Srb2win.rc
|
||||||
|
opts+=-DSTDC_HEADERS
|
||||||
|
libs+=-ladvapi32 -lkernel32 -lmsvcrt -luser32
|
||||||
|
|
||||||
|
ifndef DEDICATED
|
||||||
|
ifndef DUMMY
|
||||||
|
SDL?=1
|
||||||
|
endif
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifndef NOHW
|
||||||
|
opts+=-DUSE_WGL_SWAP
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef MINGW64
|
||||||
|
libs+=-lws2_32
|
||||||
|
else
|
||||||
|
#ifndef HAVE_IPV6
|
||||||
|
#libs+=-lwsock32
|
||||||
|
#else
|
||||||
|
libs+=-lws2_32
|
||||||
|
#endif
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifndef MINGW64
|
||||||
|
libs+=-Wl,--large-address-aware
|
||||||
|
NOLIBBACKTRACE=1
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifndef MINGW64
|
||||||
|
32=32
|
||||||
|
x86=x86
|
||||||
|
i686=i686
|
||||||
|
else
|
||||||
|
32=64
|
||||||
|
x86=x86_64
|
||||||
|
i686=x86_64
|
||||||
|
endif
|
||||||
|
|
||||||
|
mingw:=$(i686)-w64-mingw32
|
||||||
|
|
||||||
|
define _set =
|
||||||
|
$(1)_CFLAGS?=$($(1)_opts)
|
||||||
|
$(1)_LDFLAGS?=$($(1)_libs)
|
||||||
|
endef
|
||||||
|
|
||||||
|
lib:=../libs/gme
|
||||||
|
LIBGME_opts:=-I$(lib)/include
|
||||||
|
LIBGME_libs:=-L$(lib)/win$(32) -lgme
|
||||||
|
$(eval $(call _set,LIBGME))
|
||||||
|
|
||||||
|
lib:=../libs/libopenmpt
|
||||||
|
LIBOPENMPT_opts:=-I$(lib)/inc
|
||||||
|
LIBOPENMPT_libs:=-L$(lib)/lib/$(x86)/mingw -lopenmpt
|
||||||
|
$(eval $(call _set,LIBOPENMPT))
|
||||||
|
|
||||||
|
lib:=../libs/SDL2_mixer/$(mingw)
|
||||||
|
|
||||||
|
ifdef SDL
|
||||||
|
mixer_opts:=-I$(lib)/include/SDL2
|
||||||
|
mixer_libs:=-L$(lib)/lib
|
||||||
|
|
||||||
|
lib:=../libs/SDL2/$(mingw)
|
||||||
|
SDL_opts:=-I$(lib)/include/SDL2\
|
||||||
|
$(mixer_opts) -Dmain=SDL_main
|
||||||
|
SDL_libs:=-L$(lib)/lib $(mixer_libs)\
|
||||||
|
-lmingw32 -lSDL2main -lSDL2 -mwindows
|
||||||
|
$(eval $(call _set,SDL))
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifdef MINGW64
|
||||||
|
lib:=../libs/libbacktrace
|
||||||
|
LIBBACKTRACE_opts:=-I$(lib)/include
|
||||||
|
LIBBACKTRACE_libs:=-L$(lib)/lib/x86_64 -lbacktrace
|
||||||
|
$(eval $(call _set,LIBBACKTRACE))
|
||||||
|
else
|
||||||
|
lib:=../libs/drmingw
|
||||||
|
opts+=-I$(lib)/include
|
||||||
|
libs+=-L$(lib)/lib/win32 -lmgwhelp -lexchndl
|
||||||
|
endif
|
||||||
|
|
||||||
|
lib:=../libs/zlib
|
||||||
|
ZLIB_opts:=-I$(lib)
|
||||||
|
ZLIB_libs:=-L$(lib)/win32 -l:libz$(32).a
|
||||||
|
$(eval $(call _set,ZLIB))
|
||||||
|
|
||||||
|
ifndef PNG_CONFIG
|
||||||
|
lib:=../libs/libpng-src
|
||||||
|
PNG_opts:=-I$(lib)
|
||||||
|
PNG_libs:=-L$(lib)/projects -lpng$(32)
|
||||||
|
$(eval $(call _set,PNG))
|
||||||
|
endif
|
||||||
|
|
||||||
|
lib:=../libs/curl
|
||||||
|
CURL_opts:=-I$(lib)/include
|
||||||
|
CURL_libs:=-L$(lib)/lib$(32) -lcurl
|
||||||
|
$(eval $(call _set,CURL))
|
||||||
|
|
||||||
|
ifndef MINGW64 # miniupnc is broken with MINGW64
|
||||||
|
lib:=../libs/miniupnpc
|
||||||
|
MINIUPNPC_opts:=-I$(lib)/include -DMINIUPNP_STATICLIB
|
||||||
|
MINIUPNPC_libs:=-L$(lib)/mingw$(32) -lminiupnpc -lws2_32 -liphlpapi
|
||||||
|
$(eval $(call _set,MINIUPNPC))
|
||||||
|
endif
|
||||||
|
|
||||||
|
lib:=../libs/discord-rpc/win$(32)-dynamic
|
||||||
|
DISCORDRPC_opts+=-I$(lib)/include
|
||||||
|
DISCORDRPC_libs+=-L$(lib)/lib -ldiscord-rpc
|
||||||
|
$(eval $(call _set,DISCORDRPC))
|
||||||
+100
@@ -0,0 +1,100 @@
|
|||||||
|
am_map.c
|
||||||
|
b_bot.c
|
||||||
|
command.c
|
||||||
|
console.c
|
||||||
|
d_clisrv.c
|
||||||
|
d_main.c
|
||||||
|
d_net.c
|
||||||
|
d_netcmd.c
|
||||||
|
d_netfil.c
|
||||||
|
d_protocol.c
|
||||||
|
dehacked.c
|
||||||
|
f_finale.c
|
||||||
|
f_wipe.c
|
||||||
|
filesrch.c
|
||||||
|
g_game.c
|
||||||
|
g_demo.c
|
||||||
|
g_input.c
|
||||||
|
hu_stuff.c
|
||||||
|
i_tcp.c
|
||||||
|
i_time.c
|
||||||
|
info.c
|
||||||
|
lzf.c
|
||||||
|
m_aatree.c
|
||||||
|
m_anigif.c
|
||||||
|
m_argv.c
|
||||||
|
m_bbox.c
|
||||||
|
m_cheat.c
|
||||||
|
m_cond.c
|
||||||
|
m_fixed.c
|
||||||
|
m_menu.c
|
||||||
|
m_textinput.c
|
||||||
|
m_emotes.cpp
|
||||||
|
m_misc.c
|
||||||
|
m_perfstats.c
|
||||||
|
m_queue.c
|
||||||
|
m_random.c
|
||||||
|
mserv.c
|
||||||
|
http-mserv.c
|
||||||
|
qs22j.c
|
||||||
|
s_sound.c
|
||||||
|
screen.c
|
||||||
|
sounds.c
|
||||||
|
st_stuff.c
|
||||||
|
string.c
|
||||||
|
tables.c
|
||||||
|
v_video.c
|
||||||
|
w_wad.c
|
||||||
|
y_inter.c
|
||||||
|
z_zone.c
|
||||||
|
r_bsp.c
|
||||||
|
r_data.c
|
||||||
|
r_draw.c
|
||||||
|
r_fps.c
|
||||||
|
r_main.cpp
|
||||||
|
r_patch.c
|
||||||
|
r_patchrotation.c
|
||||||
|
r_plane.cpp
|
||||||
|
r_segs.cpp
|
||||||
|
r_skins.c
|
||||||
|
r_sky.c
|
||||||
|
r_splats.c
|
||||||
|
r_things.cpp
|
||||||
|
r_portal.c
|
||||||
|
p_ceilng.c
|
||||||
|
p_enemy.c
|
||||||
|
p_floor.c
|
||||||
|
p_inter.c
|
||||||
|
p_lights.c
|
||||||
|
p_map.c
|
||||||
|
p_maputl.c
|
||||||
|
p_mobj.c
|
||||||
|
p_polyobj.c
|
||||||
|
p_saveg.c
|
||||||
|
p_setup.c
|
||||||
|
p_sight.c
|
||||||
|
p_slopes.c
|
||||||
|
p_spec.c
|
||||||
|
p_telept.c
|
||||||
|
p_tick.c
|
||||||
|
p_user.c
|
||||||
|
k_director.c
|
||||||
|
k_kart.c
|
||||||
|
k_hud.c
|
||||||
|
k_stats.c
|
||||||
|
lua_baselib.c
|
||||||
|
lua_blockmaplib.c
|
||||||
|
lua_consolelib.c
|
||||||
|
lua_hooklib.c
|
||||||
|
lua_hudlib.c
|
||||||
|
lua_hudlib_drawlist.c
|
||||||
|
lua_infolib.c
|
||||||
|
lua_maplib.c
|
||||||
|
lua_mathlib.c
|
||||||
|
lua_mobjlib.c
|
||||||
|
lua_playerlib.c
|
||||||
|
lua_script.c
|
||||||
|
lua_skinlib.c
|
||||||
|
lua_thinkerlib.c
|
||||||
|
lua_udatalib.c
|
||||||
|
lua_glib.c
|
||||||
+10
-7
@@ -197,7 +197,7 @@ static fixed_t scale_mtof = (fixed_t)INITSCALEMTOF;
|
|||||||
// used by FTOM to scale from frame-buffer-to-map coords (=1/scale_mtof)
|
// used by FTOM to scale from frame-buffer-to-map coords (=1/scale_mtof)
|
||||||
static fixed_t scale_ftom;
|
static fixed_t scale_ftom;
|
||||||
|
|
||||||
static player_t *plr; // the player represented by an arrow
|
static player_t *plr = NULL; // the player represented by an arrow
|
||||||
|
|
||||||
static boolean followplayer = true; // specifies whether to follow the player around
|
static boolean followplayer = true; // specifies whether to follow the player around
|
||||||
|
|
||||||
@@ -237,7 +237,7 @@ static inline void AM_restoreScaleAndLoc(void)
|
|||||||
m_x = old_m_x;
|
m_x = old_m_x;
|
||||||
m_y = old_m_y;
|
m_y = old_m_y;
|
||||||
}
|
}
|
||||||
else
|
else if (plr && plr->mo)
|
||||||
{
|
{
|
||||||
m_x = (plr->mo->x >> FRACTOMAPBITS) - m_w/2;
|
m_x = (plr->mo->x >> FRACTOMAPBITS) - m_w/2;
|
||||||
m_y = (plr->mo->y >> FRACTOMAPBITS) - m_h/2;
|
m_y = (plr->mo->y >> FRACTOMAPBITS) - m_h/2;
|
||||||
@@ -312,14 +312,14 @@ static void AM_initVariables(void)
|
|||||||
m_h = FTOM(f_h);
|
m_h = FTOM(f_h);
|
||||||
|
|
||||||
// find player to center on initially
|
// find player to center on initially
|
||||||
if (!players[pnum = consoleplayer].ingame)
|
if (!playeringame[pnum = consoleplayer])
|
||||||
for (pnum = 0; pnum < MAXPLAYERS; pnum++)
|
for (pnum = 0; pnum < MAXPLAYERS; pnum++)
|
||||||
if (players[pnum].ingame)
|
if (playeringame[pnum])
|
||||||
break;
|
break;
|
||||||
|
|
||||||
plr = &players[pnum];
|
plr = &players[pnum];
|
||||||
|
|
||||||
if (plr != NULL && plr->mo != NULL)
|
if (plr && plr->mo)
|
||||||
{
|
{
|
||||||
m_x = (plr->mo->x >> FRACTOMAPBITS) - m_w/2;
|
m_x = (plr->mo->x >> FRACTOMAPBITS) - m_w/2;
|
||||||
m_y = (plr->mo->y >> FRACTOMAPBITS) - m_h/2;
|
m_y = (plr->mo->y >> FRACTOMAPBITS) - m_h/2;
|
||||||
@@ -341,7 +341,7 @@ static void AM_FrameBufferInit(void)
|
|||||||
f_x = f_y = 0;
|
f_x = f_y = 0;
|
||||||
f_w = vid.width;
|
f_w = vid.width;
|
||||||
f_h = vid.height;
|
f_h = vid.height;
|
||||||
am_buf = screens[0];
|
am_buf = vid.screens[0];
|
||||||
}
|
}
|
||||||
|
|
||||||
//
|
//
|
||||||
@@ -598,6 +598,9 @@ static inline void AM_changeWindowScale(void)
|
|||||||
|
|
||||||
static inline void AM_doFollowPlayer(void)
|
static inline void AM_doFollowPlayer(void)
|
||||||
{
|
{
|
||||||
|
if (!plr || !plr->mo)
|
||||||
|
return;
|
||||||
|
|
||||||
if (f_oldloc.x != plr->mo->x || f_oldloc.y != plr->mo->y)
|
if (f_oldloc.x != plr->mo->x || f_oldloc.y != plr->mo->y)
|
||||||
{
|
{
|
||||||
m_x = FTOM(MTOF(plr->mo->x >> FRACTOMAPBITS)) - m_w/2;
|
m_x = FTOM(MTOF(plr->mo->x >> FRACTOMAPBITS)) - m_w/2;
|
||||||
@@ -1228,7 +1231,7 @@ static inline void AM_drawPlayers(void)
|
|||||||
|
|
||||||
for (i = 0; i < MAXPLAYERS; i++)
|
for (i = 0; i < MAXPLAYERS; i++)
|
||||||
{
|
{
|
||||||
if (!players[i].ingame || players[i].spectator)
|
if (!playeringame[i] || players[i].spectator)
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
if (!players[i].mo)
|
if (!players[i].mo)
|
||||||
|
|||||||
@@ -46,7 +46,6 @@ INT32 VID_SetMode(INT32 modenum)
|
|||||||
vid.modenum = 0;
|
vid.modenum = 0;
|
||||||
vid.width = 320;
|
vid.width = 320;
|
||||||
vid.height = 240;
|
vid.height = 240;
|
||||||
vid.bpp = 1;
|
|
||||||
vid.buffer = android_surface;
|
vid.buffer = android_surface;
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -1,57 +0,0 @@
|
|||||||
ifdef UNIXCOMMON
|
|
||||||
LUA_CFLAGS+=-DLUA_USE_POSIX
|
|
||||||
endif
|
|
||||||
ifdef LINUX
|
|
||||||
LUA_CFLAGS+=-DLUA_USE_POSIX
|
|
||||||
endif
|
|
||||||
ifdef GCC43
|
|
||||||
ifndef GCC44
|
|
||||||
WFLAGS+=-Wno-logical-op
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
|
|
||||||
OBJS:=$(OBJS) \
|
|
||||||
$(OBJDIR)/lapi.o \
|
|
||||||
$(OBJDIR)/lbaselib.o \
|
|
||||||
$(OBJDIR)/ldo.o \
|
|
||||||
$(OBJDIR)/ldblib.o \
|
|
||||||
$(OBJDIR)/lfunc.o \
|
|
||||||
$(OBJDIR)/linit.o \
|
|
||||||
$(OBJDIR)/liolib.o \
|
|
||||||
$(OBJDIR)/llex.o \
|
|
||||||
$(OBJDIR)/lmem.o \
|
|
||||||
$(OBJDIR)/lobject.o \
|
|
||||||
$(OBJDIR)/lstate.o \
|
|
||||||
$(OBJDIR)/lstrlib.o \
|
|
||||||
$(OBJDIR)/ltablib.o \
|
|
||||||
$(OBJDIR)/lundump.o \
|
|
||||||
$(OBJDIR)/lzio.o \
|
|
||||||
$(OBJDIR)/lauxlib.o \
|
|
||||||
$(OBJDIR)/lcode.o \
|
|
||||||
$(OBJDIR)/ldebug.o \
|
|
||||||
$(OBJDIR)/ldump.o \
|
|
||||||
$(OBJDIR)/lgc.o \
|
|
||||||
$(OBJDIR)/lopcodes.o \
|
|
||||||
$(OBJDIR)/lparser.o \
|
|
||||||
$(OBJDIR)/lstring.o \
|
|
||||||
$(OBJDIR)/ltable.o \
|
|
||||||
$(OBJDIR)/ltm.o \
|
|
||||||
$(OBJDIR)/lvm.o \
|
|
||||||
$(OBJDIR)/lua_script.o \
|
|
||||||
$(OBJDIR)/lua_baselib.o \
|
|
||||||
$(OBJDIR)/lua_blockmaplib.o \
|
|
||||||
$(OBJDIR)/lua_mathlib.o \
|
|
||||||
$(OBJDIR)/lua_hooklib.o \
|
|
||||||
$(OBJDIR)/lua_consolelib.o \
|
|
||||||
$(OBJDIR)/lua_infolib.o \
|
|
||||||
$(OBJDIR)/lua_mobjlib.o \
|
|
||||||
$(OBJDIR)/lua_playerlib.o \
|
|
||||||
$(OBJDIR)/lua_skinlib.o \
|
|
||||||
$(OBJDIR)/lua_thinkerlib.o \
|
|
||||||
$(OBJDIR)/lua_maplib.o \
|
|
||||||
$(OBJDIR)/hashtable.o \
|
|
||||||
$(OBJDIR)/lua_hudlib.o \
|
|
||||||
$(OBJDIR)/lua_hudlib_drawlist.o \
|
|
||||||
$(OBJDIR)/lua_udatalib.o \
|
|
||||||
$(OBJDIR)/lua_glib.o
|
|
||||||
|
|
||||||
@@ -0,0 +1,26 @@
|
|||||||
|
lapi.c
|
||||||
|
lauxlib.c
|
||||||
|
lbaselib.c
|
||||||
|
ldblib.c
|
||||||
|
lcode.c
|
||||||
|
ldebug.c
|
||||||
|
ldo.c
|
||||||
|
ldump.c
|
||||||
|
lfunc.c
|
||||||
|
lgc.c
|
||||||
|
linit.c
|
||||||
|
liolib.c
|
||||||
|
llex.c
|
||||||
|
lmem.c
|
||||||
|
lobject.c
|
||||||
|
lopcodes.c
|
||||||
|
lparser.c
|
||||||
|
lstate.c
|
||||||
|
lstring.c
|
||||||
|
lstrlib.c
|
||||||
|
ltable.c
|
||||||
|
ltablib.c
|
||||||
|
ltm.c
|
||||||
|
lundump.c
|
||||||
|
lvm.c
|
||||||
|
lzio.c
|
||||||
+70
-5
@@ -17,14 +17,27 @@
|
|||||||
|
|
||||||
#include "lauxlib.h"
|
#include "lauxlib.h"
|
||||||
#include "lualib.h"
|
#include "lualib.h"
|
||||||
|
#include "../i_system.h"
|
||||||
|
#include "../doomdef.h"
|
||||||
|
#include "../d_main.h"
|
||||||
|
#include "../m_misc.h"
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
#define IO_INPUT 1
|
#define IO_INPUT 1
|
||||||
#define IO_OUTPUT 2
|
#define IO_OUTPUT 2
|
||||||
|
|
||||||
|
#define FILELIMIT 1024*1024 // Size limit for reading/writing files
|
||||||
|
|
||||||
|
|
||||||
static const char *const fnames[] = {"input", "output"};
|
static const char *const fnames[] = {"input", "output"};
|
||||||
|
static const char *whitelist[] = { // Allow scripters to write files of these types to SRB2's folder
|
||||||
|
".txt",
|
||||||
|
".sav2",
|
||||||
|
".cfg",
|
||||||
|
".png",
|
||||||
|
".bmp"
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
static int pushresult (lua_State *L, int i, const char *filename) {
|
static int pushresult (lua_State *L, int i, const char *filename) {
|
||||||
@@ -146,12 +159,59 @@ static int io_tostring (lua_State *L) {
|
|||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static int StartsWith(const char *a, const char *b) // this is wolfs being lazy yet again
|
||||||
|
{
|
||||||
|
if(strncmp(a, b, strlen(b)) == 0) return 1;
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
static int io_open (lua_State *L) {
|
static int io_open (lua_State *L) {
|
||||||
const char *filename = luaL_checkstring(L, 1);
|
FILE **pf;
|
||||||
const char *mode = luaL_optstring(L, 2, "r");
|
const char *filename = luaL_checkstring(L, 1);
|
||||||
FILE **pf = newfile(L);
|
int pass = 0;
|
||||||
*pf = fopen(filename, mode);
|
size_t i;
|
||||||
return (*pf == NULL) ? pushresult(L, 0, filename) : 1;
|
int length = strlen(filename);
|
||||||
|
char *splitter, *forward, *backward;
|
||||||
|
char *destFilename;
|
||||||
|
const char *mode = luaL_optstring(L, 2, "r");
|
||||||
|
|
||||||
|
for (i = 0; i < (sizeof (whitelist) / sizeof(const char *)); i++)
|
||||||
|
{
|
||||||
|
if (!stricmp(&filename[length - strlen(whitelist[i])], whitelist[i]))
|
||||||
|
{
|
||||||
|
pass = 1;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (strstr(filename, "..") || strchr(filename, ':') || StartsWith(filename, "\\")
|
||||||
|
|| StartsWith(filename, "/") || !pass)
|
||||||
|
{
|
||||||
|
luaL_error(L,"access denied to %s", filename);
|
||||||
|
return pushresult(L,0,filename);
|
||||||
|
}
|
||||||
|
|
||||||
|
destFilename = va("%s"PATHSEP"luafiles"PATHSEP"%s", srb2home, filename);
|
||||||
|
|
||||||
|
// Make directories as needed
|
||||||
|
splitter = destFilename;
|
||||||
|
|
||||||
|
forward = strchr(splitter, '/');
|
||||||
|
backward = strchr(splitter, '\\');
|
||||||
|
while ((splitter = (forward && backward) ? min(forward, backward) : (forward ?: backward)))
|
||||||
|
{
|
||||||
|
*splitter = 0;
|
||||||
|
I_mkdir(destFilename, 0755);
|
||||||
|
*splitter = '/';
|
||||||
|
splitter++;
|
||||||
|
|
||||||
|
forward = strchr(splitter, '/');
|
||||||
|
backward = strchr(splitter, '\\');
|
||||||
|
}
|
||||||
|
|
||||||
|
pf = newfile(L);
|
||||||
|
*pf = fopen(destFilename, mode);
|
||||||
|
return (*pf == NULL) ? pushresult(L, 0, filename) : 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
@@ -394,6 +454,11 @@ static int g_write (lua_State *L, FILE *f, int arg) {
|
|||||||
else {
|
else {
|
||||||
size_t l;
|
size_t l;
|
||||||
const char *s = luaL_checklstring(L, arg, &l);
|
const char *s = luaL_checklstring(L, arg, &l);
|
||||||
|
if (ftell(f) + l > FILELIMIT)
|
||||||
|
{
|
||||||
|
luaL_error(L,"write limit bypassed in file. Changes have been discarded.");
|
||||||
|
break;
|
||||||
|
}
|
||||||
status = status && (fwrite(s, sizeof(char), l, f) == l);
|
status = status && (fwrite(s, sizeof(char), l, f) == l);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -1,9 +0,0 @@
|
|||||||
luajit
|
|
||||||
luajit.h
|
|
||||||
luajit_relver.txt
|
|
||||||
lj_bcdef.h
|
|
||||||
lj_ffdef.h
|
|
||||||
lj_libdef.h
|
|
||||||
lj_recdef.h
|
|
||||||
lj_folddef.h
|
|
||||||
lj_vm.[sS]
|
|
||||||
@@ -1,408 +0,0 @@
|
|||||||
##############################################################################
|
|
||||||
# LuaJIT Makefile. Requires GNU Make.
|
|
||||||
#
|
|
||||||
# Please read doc/install.html before changing any variables!
|
|
||||||
#
|
|
||||||
# Suitable for POSIX platforms (Linux, *BSD, OSX etc.).
|
|
||||||
# Also works with MinGW and Cygwin on Windows.
|
|
||||||
# Please check msvcbuild.bat for building with MSVC on Windows.
|
|
||||||
#
|
|
||||||
# Copyright (C) 2005-2023 Mike Pall. See Copyright Notice in luajit.h
|
|
||||||
##############################################################################
|
|
||||||
|
|
||||||
# this is a very dumbed down version of the LuaJIT makefile.
|
|
||||||
# to get the original makefile, visit
|
|
||||||
# https://github.com/GenericHeroGuy/bluajit
|
|
||||||
|
|
||||||
XCFLAGS=
|
|
||||||
XCFLAGS+= -DLUAJIT_DISABLE_FFI
|
|
||||||
#XCFLAGS+= -DLUAJIT_ENABLE_LUA52COMPAT
|
|
||||||
#XCFLAGS+= -DLUAJIT_DISABLE_JIT
|
|
||||||
#XCFLAGS+= -DLUAJIT_USE_SYSMALLOC
|
|
||||||
#XCFLAGS+= -DLUAJIT_USE_VALGRIND
|
|
||||||
#XCFLAGS+= -DLUAJIT_USE_GDBJIT
|
|
||||||
#XCFLAGS+= -DLUA_USE_APICHECK
|
|
||||||
#XCFLAGS+= -DLUA_USE_ASSERT
|
|
||||||
XCFLAGS+= -DLUAJIT_DISABLE_BYTECODE
|
|
||||||
|
|
||||||
# load standard libraries in debug mode, so jit.dump etc works
|
|
||||||
ifndef DEBUGMODE
|
|
||||||
XCFLAGS+= -DLUAJIT_SRB2LIB -DLUAJIT_DISABLE_BUFFER
|
|
||||||
endif
|
|
||||||
# additional functions
|
|
||||||
#XCFLAGS+= -DLUAJIT_SRB2LIB_OS
|
|
||||||
XCFLAGS+= -DLUAJIT_SRB2LIB_DEBUG
|
|
||||||
XCFLAGS+= -DLUAJIT_SRB2LIB_IO
|
|
||||||
|
|
||||||
# don't touch these unless you wanna have a bad time
|
|
||||||
XCFLAGS+= -DLUAJIT_NUMMODE=2
|
|
||||||
XCFLAGS+= -DLUAJIT_INTONLY
|
|
||||||
# needed for the headers
|
|
||||||
OPTS+=-DLUAJIT_INTONLY
|
|
||||||
|
|
||||||
ifdef MINGW
|
|
||||||
TARGET_SYS= Windows
|
|
||||||
HOST_MSYS= mingw
|
|
||||||
endif
|
|
||||||
|
|
||||||
ifeq (Windows,$(findstring Windows,$(OS))$(MSYSTEM)$(TERM))
|
|
||||||
HOST_SYS= Windows
|
|
||||||
else
|
|
||||||
HOST_SYS:= $(shell uname -s)
|
|
||||||
ifneq (,$(findstring MINGW,$(HOST_SYS)))
|
|
||||||
HOST_SYS= Windows
|
|
||||||
HOST_MSYS= mingw
|
|
||||||
endif
|
|
||||||
ifneq (,$(findstring MSYS,$(HOST_SYS)))
|
|
||||||
HOST_SYS= Windows
|
|
||||||
HOST_MSYS= mingw
|
|
||||||
endif
|
|
||||||
ifneq (,$(findstring CYGWIN,$(HOST_SYS)))
|
|
||||||
HOST_SYS= Windows
|
|
||||||
HOST_MSYS= cygwin
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
|
|
||||||
ASOPTIONS= $(CCOPT) $(XCFLAGS) $(CFLAGS)
|
|
||||||
CCOPTIONS= $(ASOPTIONS)
|
|
||||||
|
|
||||||
HOST_CC= $(CC)
|
|
||||||
HOST_RM?= rm -f
|
|
||||||
|
|
||||||
HOST_XCFLAGS= -Ibluajit
|
|
||||||
HOST_XLIBS=
|
|
||||||
HOST_ACFLAGS= $(XCFLAGS) $(HOST_XCFLAGS) $(TARGET_ARCH)
|
|
||||||
|
|
||||||
TARGET_CC= $(CROSS)$(CC)
|
|
||||||
|
|
||||||
TARGET_LFSFLAGS= -D_FILE_OFFSET_BITS=64 -D_LARGEFILE_SOURCE
|
|
||||||
TARGET_XCFLAGS= $(TARGET_LFSFLAGS) -U_FORTIFY_SOURCE
|
|
||||||
TARGET_XLIBS= -lm
|
|
||||||
TARGET_ACFLAGS= $(CCOPTIONS) $(TARGET_XCFLAGS) $(TARGET_FLAGS)
|
|
||||||
TARGET_ASFLAGS= $(ASOPTIONS) $(TARGET_XCFLAGS) $(TARGET_FLAGS)
|
|
||||||
TARGET_ACFLAGS+= $(LUA_CFLAGS)
|
|
||||||
|
|
||||||
TARGET_TESTARCH:=$(shell $(TARGET_CC) $(TARGET_ACFLAGS) -E bluajit/lj_arch.h -dM)
|
|
||||||
ifneq (,$(findstring LJ_TARGET_X64 ,$(TARGET_TESTARCH)))
|
|
||||||
TARGET_LJARCH= x64
|
|
||||||
else
|
|
||||||
ifneq (,$(findstring LJ_TARGET_X86 ,$(TARGET_TESTARCH)))
|
|
||||||
TARGET_LJARCH= x86
|
|
||||||
else
|
|
||||||
ifneq (,$(findstring LJ_TARGET_ARM ,$(TARGET_TESTARCH)))
|
|
||||||
TARGET_LJARCH= arm
|
|
||||||
else
|
|
||||||
ifneq (,$(findstring LJ_TARGET_ARM64 ,$(TARGET_TESTARCH)))
|
|
||||||
ifneq (,$(findstring __AARCH64EB__ ,$(TARGET_TESTARCH)))
|
|
||||||
TARGET_ARCH= -D__AARCH64EB__=1
|
|
||||||
endif
|
|
||||||
TARGET_LJARCH= arm64
|
|
||||||
else
|
|
||||||
ifneq (,$(findstring LJ_TARGET_PPC ,$(TARGET_TESTARCH)))
|
|
||||||
ifneq (,$(findstring LJ_LE 1,$(TARGET_TESTARCH)))
|
|
||||||
TARGET_ARCH= -DLJ_ARCH_ENDIAN=LUAJIT_LE
|
|
||||||
else
|
|
||||||
TARGET_ARCH= -DLJ_ARCH_ENDIAN=LUAJIT_BE
|
|
||||||
endif
|
|
||||||
TARGET_LJARCH= ppc
|
|
||||||
else
|
|
||||||
ifneq (,$(findstring LJ_TARGET_MIPS ,$(TARGET_TESTARCH)))
|
|
||||||
ifneq (,$(findstring MIPSEL ,$(TARGET_TESTARCH)))
|
|
||||||
TARGET_ARCH= -D__MIPSEL__=1
|
|
||||||
endif
|
|
||||||
ifneq (,$(findstring LJ_TARGET_MIPS64 ,$(TARGET_TESTARCH)))
|
|
||||||
TARGET_LJARCH= mips64
|
|
||||||
else
|
|
||||||
TARGET_LJARCH= mips
|
|
||||||
endif
|
|
||||||
else
|
|
||||||
$(error Unsupported target architecture)
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
|
|
||||||
ifneq (,$(findstring LJ_TARGET_PS3 1,$(TARGET_TESTARCH)))
|
|
||||||
TARGET_SYS= PS3
|
|
||||||
TARGET_ARCH+= -D__CELLOS_LV2__
|
|
||||||
TARGET_XCFLAGS+= -DLUAJIT_USE_SYSMALLOC
|
|
||||||
TARGET_XLIBS+= -lpthread
|
|
||||||
endif
|
|
||||||
|
|
||||||
TARGET_ARCH+= $(patsubst %,-DLUAJIT_TARGET=LUAJIT_ARCH_%,$(TARGET_LJARCH))
|
|
||||||
|
|
||||||
ifneq (,$(PREFIX))
|
|
||||||
ifneq (/usr/local,$(PREFIX))
|
|
||||||
TARGET_XCFLAGS+= -DLUA_ROOT=\"$(PREFIX)\"
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
ifneq (,$(MULTILIB))
|
|
||||||
TARGET_XCFLAGS+= -DLUA_MULTILIB=\"$(MULTILIB)\"
|
|
||||||
endif
|
|
||||||
ifneq (,$(LMULTILIB))
|
|
||||||
TARGET_XCFLAGS+= -DLUA_LMULTILIB=\"$(LMULTILIB)\"
|
|
||||||
endif
|
|
||||||
ifneq (,$(INSTALL_LJLIBD))
|
|
||||||
TARGET_XCFLAGS+= -DLUA_LJDIR=\"$(INSTALL_LJLIBD)\"
|
|
||||||
endif
|
|
||||||
|
|
||||||
##############################################################################
|
|
||||||
# Target system detection.
|
|
||||||
##############################################################################
|
|
||||||
|
|
||||||
TARGET_SYS?= $(HOST_SYS)
|
|
||||||
ifeq (,$(shell $(TARGET_CC) -o /dev/null -c -x c /dev/null -fno-stack-protector 2>/dev/null || echo 1))
|
|
||||||
TARGET_XCFLAGS+= -fno-stack-protector
|
|
||||||
endif
|
|
||||||
ifeq (Darwin,$(TARGET_SYS))
|
|
||||||
ifeq (,$(MACOSX_DEPLOYMENT_TARGET))
|
|
||||||
$(error missing: export MACOSX_DEPLOYMENT_TARGET=XX.YY)
|
|
||||||
endif
|
|
||||||
TARGET_XCFLAGS+= -DLUAJIT_UNWIND_EXTERNAL
|
|
||||||
else
|
|
||||||
ifeq (iOS,$(TARGET_SYS))
|
|
||||||
ifeq (arm64,$(TARGET_LJARCH))
|
|
||||||
TARGET_XCFLAGS+= -fno-omit-frame-pointer
|
|
||||||
endif
|
|
||||||
else
|
|
||||||
ifeq (,$(findstring LJ_NO_UNWIND 1,$(TARGET_TESTARCH)))
|
|
||||||
# Find out whether the target toolchain always generates unwind tables.
|
|
||||||
TARGET_TESTUNWIND=$(shell exec 2>/dev/null; echo 'extern void b(void);int a(void){b();return 0;}' | $(TARGET_CC) -c -x c - -o tmpunwind.o && { grep -qa -e eh_frame -e __unwind_info tmpunwind.o || grep -qU -e eh_frame -e __unwind_info tmpunwind.o; } && echo E; rm -f tmpunwind.o)
|
|
||||||
ifneq (,$(findstring E,$(TARGET_TESTUNWIND)))
|
|
||||||
TARGET_XCFLAGS+= -DLUAJIT_UNWIND_EXTERNAL
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
ifeq (Linux,$(TARGET_SYS))
|
|
||||||
TARGET_XLIBS+= -ldl
|
|
||||||
endif
|
|
||||||
ifeq (GNU/kFreeBSD,$(TARGET_SYS))
|
|
||||||
TARGET_XLIBS+= -ldl
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
|
|
||||||
ifneq ($(HOST_SYS),$(TARGET_SYS))
|
|
||||||
ifeq (Windows,$(TARGET_SYS))
|
|
||||||
HOST_XCFLAGS+= -malign-double -DLUAJIT_OS=LUAJIT_OS_WINDOWS
|
|
||||||
else
|
|
||||||
ifeq (Linux,$(TARGET_SYS))
|
|
||||||
HOST_XCFLAGS+= -DLUAJIT_OS=LUAJIT_OS_LINUX
|
|
||||||
else
|
|
||||||
ifeq (Darwin,$(TARGET_SYS))
|
|
||||||
HOST_XCFLAGS+= -DLUAJIT_OS=LUAJIT_OS_OSX
|
|
||||||
else
|
|
||||||
ifeq (iOS,$(TARGET_SYS))
|
|
||||||
HOST_XCFLAGS+= -DLUAJIT_OS=LUAJIT_OS_OSX -DTARGET_OS_IPHONE=1
|
|
||||||
else
|
|
||||||
HOST_XCFLAGS+= -DLUAJIT_OS=LUAJIT_OS_OTHER
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
|
|
||||||
##############################################################################
|
|
||||||
# Files and pathnames.
|
|
||||||
##############################################################################
|
|
||||||
|
|
||||||
MINILUA_O= $(OBJDIR)/minilua.o
|
|
||||||
MINILUA_LIBS= -lm
|
|
||||||
MINILUA_T= $(OBJDIR)/minilua
|
|
||||||
MINILUA_X= $(MINILUA_T)
|
|
||||||
MINILUA_DEP=
|
|
||||||
|
|
||||||
HOST_LUA= $(MINILUA_X)
|
|
||||||
MINILUA_DEP= $(MINILUA_T)
|
|
||||||
|
|
||||||
DASM_DIR= bluajit/dynasm
|
|
||||||
DASM= $(HOST_LUA) $(DASM_DIR)/dynasm.lua
|
|
||||||
DASM_XFLAGS=
|
|
||||||
DASM_AFLAGS=
|
|
||||||
DASM_ARCH= $(TARGET_LJARCH)
|
|
||||||
|
|
||||||
ifneq (,$(findstring LJ_LE 1,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D ENDIAN_LE
|
|
||||||
else
|
|
||||||
DASM_AFLAGS+= -D ENDIAN_BE
|
|
||||||
endif
|
|
||||||
ifneq (,$(findstring LJ_ARCH_BITS 64,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D P64
|
|
||||||
endif
|
|
||||||
ifneq (,$(findstring LJ_HASJIT 1,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D JIT
|
|
||||||
endif
|
|
||||||
ifneq (,$(findstring LJ_HASFFI 1,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D FFI
|
|
||||||
endif
|
|
||||||
ifneq (,$(findstring LJ_DUALNUM 1,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D DUALNUM
|
|
||||||
endif
|
|
||||||
ifneq (,$(findstring LJ_INTONLY 1,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D INTONLY
|
|
||||||
endif
|
|
||||||
ifneq (,$(findstring LJ_ARCH_HASFPU 1,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D FPU
|
|
||||||
TARGET_ARCH+= -DLJ_ARCH_HASFPU=1
|
|
||||||
else
|
|
||||||
TARGET_ARCH+= -DLJ_ARCH_HASFPU=0
|
|
||||||
endif
|
|
||||||
ifeq (,$(findstring LJ_ABI_SOFTFP 1,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D HFABI
|
|
||||||
TARGET_ARCH+= -DLJ_ABI_SOFTFP=0
|
|
||||||
else
|
|
||||||
TARGET_ARCH+= -DLJ_ABI_SOFTFP=1
|
|
||||||
endif
|
|
||||||
ifneq (,$(findstring LJ_NO_UNWIND 1,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D NO_UNWIND
|
|
||||||
TARGET_ARCH+= -DLUAJIT_NO_UNWIND
|
|
||||||
endif
|
|
||||||
ifneq (,$(findstring LJ_ABI_PAUTH 1,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D PAUTH
|
|
||||||
TARGET_ARCH+= -DLJ_ABI_PAUTH=1
|
|
||||||
endif
|
|
||||||
DASM_AFLAGS+= -D VER=$(subst LJ_ARCH_VERSION_,,$(filter LJ_ARCH_VERSION_%,$(subst LJ_ARCH_VERSION ,LJ_ARCH_VERSION_,$(TARGET_TESTARCH))))
|
|
||||||
ifeq (Windows,$(TARGET_SYS))
|
|
||||||
DASM_AFLAGS+= -D WIN
|
|
||||||
endif
|
|
||||||
ifeq (x64,$(TARGET_LJARCH))
|
|
||||||
ifeq (,$(findstring LJ_FR2 1,$(TARGET_TESTARCH)))
|
|
||||||
DASM_ARCH= x86
|
|
||||||
endif
|
|
||||||
else
|
|
||||||
ifeq (arm,$(TARGET_LJARCH))
|
|
||||||
ifeq (iOS,$(TARGET_SYS))
|
|
||||||
DASM_AFLAGS+= -D IOS
|
|
||||||
endif
|
|
||||||
else
|
|
||||||
ifneq (,$(findstring LJ_TARGET_MIPSR6 ,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D MIPSR6
|
|
||||||
endif
|
|
||||||
ifeq (ppc,$(TARGET_LJARCH))
|
|
||||||
ifneq (,$(findstring LJ_ARCH_SQRT 1,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D SQRT
|
|
||||||
endif
|
|
||||||
ifneq (,$(findstring LJ_ARCH_ROUND 1,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D ROUND
|
|
||||||
endif
|
|
||||||
ifneq (,$(findstring LJ_ARCH_PPC32ON64 1,$(TARGET_TESTARCH)))
|
|
||||||
DASM_AFLAGS+= -D GPR64
|
|
||||||
endif
|
|
||||||
ifeq (PS3,$(TARGET_SYS))
|
|
||||||
DASM_AFLAGS+= -D PPE -D TOC
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
|
|
||||||
DASM_FLAGS= $(DASM_XFLAGS) $(DASM_AFLAGS)
|
|
||||||
DASM_DASC= bluajit/vm_$(DASM_ARCH).dasc
|
|
||||||
|
|
||||||
GIT= git
|
|
||||||
ifeq (Windows,$(HOST_SYS)$(HOST_MSYS))
|
|
||||||
GIT_RELVER= if exist ..\.git ( $(GIT) show -s --format=%%ct >bluajit/luajit_relver.txt ) else ( type ..\.relver >bluajit/luajit_relver.txt )
|
|
||||||
else
|
|
||||||
GIT_RELVER= [ -e ../.git ] && $(GIT) show -s --format=%ct >bluajit/luajit_relver.txt 2>/dev/null || cat ../.relver >bluajit/luajit_relver.txt 2>/dev/null || :
|
|
||||||
endif
|
|
||||||
GIT_DEP= $(wildcard ../.git/HEAD ../.git/refs/heads/*)
|
|
||||||
|
|
||||||
BUILDVM_O= $(OBJDIR)/buildvm.o $(OBJDIR)/buildvm_asm.o $(OBJDIR)/buildvm_peobj.o \
|
|
||||||
$(OBJDIR)/buildvm_lib.o $(OBJDIR)/buildvm_fold.o
|
|
||||||
BUILDVM_T= $(OBJDIR)/buildvm
|
|
||||||
BUILDVM_X= $(BUILDVM_T)
|
|
||||||
|
|
||||||
HOST_O= $(MINILUA_O) $(BUILDVM_O)
|
|
||||||
HOST_T= $(MINILUA_T) $(BUILDVM_T)
|
|
||||||
|
|
||||||
LJVM_S= $(OBJDIR)/lj_vm.S
|
|
||||||
LJVM_O= $(OBJDIR)/lj_vm.o
|
|
||||||
LJVM_BOUT= $(LJVM_S)
|
|
||||||
LJVM_MODE= elfasm
|
|
||||||
|
|
||||||
LJLIB_O= lib_base.o lib_string.o lib_table.o lib_io.o lib_jit.o
|
|
||||||
ifeq (,$(filter -DLUAJIT_SRB2LIB,$(XCFLAGS)))
|
|
||||||
LJLIB_O+= lib_math.o lib_bit.o lib_os.o lib_package.o lib_debug.o lib_ffi.o lib_buffer.o
|
|
||||||
else
|
|
||||||
ifneq (,$(filter -DLUAJIT_SRB2LIB_OS,$(XCFLAGS)))
|
|
||||||
LJLIB_O+= lib_os.o
|
|
||||||
endif
|
|
||||||
ifneq (,$(filter -DLUAJIT_SRB2LIB_DEBUG,$(XCFLAGS)))
|
|
||||||
LJLIB_O+= lib_debug.o
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
LJLIB_C= $(addprefix bluajit/,$(LJLIB_O:.o=.c))
|
|
||||||
|
|
||||||
LJCORE_O= lj_assert.o lj_gc.o lj_err.o lj_char.o lj_bc.o lj_obj.o lj_buf.o \
|
|
||||||
lj_str.o lj_tab.o lj_func.o lj_udata.o lj_meta.o lj_debug.o \
|
|
||||||
lj_prng.o lj_state.o lj_dispatch.o lj_vmevent.o lj_vmmath.o \
|
|
||||||
lj_strscan.o lj_strfmt.o lj_strfmt_num.o lj_serialize.o \
|
|
||||||
lj_api.o lj_profile.o \
|
|
||||||
lj_lex.o lj_parse.o lj_bcread.o lj_bcwrite.o lj_load.o \
|
|
||||||
lj_ir.o lj_opt_mem.o lj_opt_fold.o lj_opt_narrow.o \
|
|
||||||
lj_opt_dce.o lj_opt_loop.o lj_opt_split.o lj_opt_sink.o \
|
|
||||||
lj_mcode.o lj_snap.o lj_record.o lj_crecord.o lj_ffrecord.o \
|
|
||||||
lj_asm.o lj_trace.o lj_gdbjit.o \
|
|
||||||
lj_ctype.o lj_cdata.o lj_cconv.o lj_ccall.o lj_ccallback.o \
|
|
||||||
lj_carith.o lj_clib.o lj_cparse.o \
|
|
||||||
lj_lib.o lj_alloc.o lib_aux.o \
|
|
||||||
$(LJLIB_O) lib_init.o
|
|
||||||
|
|
||||||
LJCORE_O:= $(addprefix $(OBJDIR)/,$(LJCORE_O))
|
|
||||||
LJVMCORE_O= $(LJVM_O) $(LJCORE_O)
|
|
||||||
|
|
||||||
LIB_VMDEF= bluajit/jit/vmdef.lua
|
|
||||||
LIB_VMDEFP= $(LIB_VMDEF)
|
|
||||||
|
|
||||||
ALL_T= $(HOST_T)
|
|
||||||
ALL_HDRGEN:= lj_bcdef.h lj_ffdef.h lj_libdef.h lj_recdef.h lj_folddef.h \
|
|
||||||
host/buildvm_arch.h luajit.h
|
|
||||||
ALL_HDRGEN:= $(addprefix bluajit/,$(ALL_HDRGEN))
|
|
||||||
ALL_GEN= $(LJVM_S) $(ALL_HDRGEN) bluajit/luajit_relver.txt $(LIB_VMDEFP)
|
|
||||||
|
|
||||||
##############################################################################
|
|
||||||
# Build mode handling.
|
|
||||||
##############################################################################
|
|
||||||
|
|
||||||
ifeq (Windows,$(TARGET_SYS))
|
|
||||||
LJVM_MODE= peobj
|
|
||||||
LJVM_BOUT= $(LJVM_O)
|
|
||||||
endif
|
|
||||||
ifeq (Darwin,$(TARGET_SYS))
|
|
||||||
LJVM_MODE= machasm
|
|
||||||
endif
|
|
||||||
ifeq (iOS,$(TARGET_SYS))
|
|
||||||
LJVM_MODE= machasm
|
|
||||||
endif
|
|
||||||
|
|
||||||
ifeq (Windows,$(TARGET_SYS))
|
|
||||||
MINILUA_T= $(OBJDIR)/minilua.exe
|
|
||||||
BUILDVM_T= $(OBJDIR)/buildvm.exe
|
|
||||||
ifeq (,$(HOST_MSYS))
|
|
||||||
MINILUA_X= $(OBJDIR)\minilua
|
|
||||||
BUILDVM_X= $(OBJDIR)\buildvm
|
|
||||||
HOST_RM= del
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
|
|
||||||
|
|
||||||
OBJS:=$(OBJS) \
|
|
||||||
$(LJVMCORE_O) \
|
|
||||||
$(OBJDIR)/lua_script.o \
|
|
||||||
$(OBJDIR)/lua_baselib.o \
|
|
||||||
$(OBJDIR)/lua_blockmaplib.o \
|
|
||||||
$(OBJDIR)/lua_mathlib.o \
|
|
||||||
$(OBJDIR)/lua_hooklib.o \
|
|
||||||
$(OBJDIR)/lua_consolelib.o \
|
|
||||||
$(OBJDIR)/lua_infolib.o \
|
|
||||||
$(OBJDIR)/lua_mobjlib.o \
|
|
||||||
$(OBJDIR)/lua_playerlib.o \
|
|
||||||
$(OBJDIR)/lua_skinlib.o \
|
|
||||||
$(OBJDIR)/lua_thinkerlib.o \
|
|
||||||
$(OBJDIR)/lua_maplib.o \
|
|
||||||
$(OBJDIR)/hashtable.o \
|
|
||||||
$(OBJDIR)/lua_hudlib.o \
|
|
||||||
$(OBJDIR)/lua_hudlib_drawlist.o \
|
|
||||||
$(OBJDIR)/lua_udatalib.o \
|
|
||||||
$(OBJDIR)/lua_glib.o
|
|
||||||
|
|
||||||
@@ -1,63 +0,0 @@
|
|||||||
Q= @
|
|
||||||
E= @true
|
|
||||||
#Q=
|
|
||||||
#E= @:
|
|
||||||
|
|
||||||
$(MINILUA_T): $(MINILUA_O)
|
|
||||||
$(E) "HOSTLINK $@"
|
|
||||||
$(HOST_CC) -o $@ $(MINILUA_O) $(MINILUA_LIBS)
|
|
||||||
|
|
||||||
bluajit/luajit.h: $(MINILUA_DEP) $(GIT_DEP) bluajit/luajit_rolling.h
|
|
||||||
$(E) "VERSION $@"
|
|
||||||
$(Q)$(GIT_RELVER)
|
|
||||||
$(Q)cd bluajit && ../$(HOST_LUA) host/genversion.lua
|
|
||||||
|
|
||||||
bluajit/host/buildvm_arch.h: $(DASM_DASC) $(MINILUA_DEP) bluajit/lj_arch.h bluajit/lua.h bluajit/luaconf.h
|
|
||||||
$(E) "DYNASM $@"
|
|
||||||
$(Q)$(DASM) $(DASM_FLAGS) -o $@ $(DASM_DASC)
|
|
||||||
|
|
||||||
$(OBJDIR)/buildvm.o: $(DASM_DIR)/dasm_*.h
|
|
||||||
|
|
||||||
$(BUILDVM_T): $(BUILDVM_O)
|
|
||||||
$(E) "HOSTLINK $@"
|
|
||||||
$(HOST_CC) -o $@ $(BUILDVM_O)
|
|
||||||
|
|
||||||
$(LJVM_BOUT): $(BUILDVM_T)
|
|
||||||
$(E) "BUILDVM $@"
|
|
||||||
$(Q)$(BUILDVM_X) -m $(LJVM_MODE) -o $@
|
|
||||||
|
|
||||||
bluajit/lj_bcdef.h: $(BUILDVM_T) $(LJLIB_C)
|
|
||||||
$(E) "BUILDVM $@"
|
|
||||||
$(Q)$(BUILDVM_X) -m bcdef -o $@ $(LJLIB_C)
|
|
||||||
|
|
||||||
bluajit/lj_ffdef.h: $(BUILDVM_T) $(LJLIB_C)
|
|
||||||
$(E) "BUILDVM $@"
|
|
||||||
$(Q)$(BUILDVM_X) -m ffdef -o $@ $(LJLIB_C)
|
|
||||||
|
|
||||||
bluajit/lj_libdef.h: $(BUILDVM_T) $(LJLIB_C)
|
|
||||||
$(E) "BUILDVM $@"
|
|
||||||
$(Q)$(BUILDVM_X) -m libdef -o $@ $(LJLIB_C)
|
|
||||||
|
|
||||||
bluajit/lj_recdef.h: $(BUILDVM_T) $(LJLIB_C)
|
|
||||||
$(E) "BUILDVM $@"
|
|
||||||
$(Q)$(BUILDVM_X) -m recdef -o $@ $(LJLIB_C)
|
|
||||||
|
|
||||||
$(LIB_VMDEF): $(BUILDVM_T) $(LJLIB_C)
|
|
||||||
$(E) "BUILDVM $@"
|
|
||||||
$(Q)$(BUILDVM_X) -m vmdef -o $(LIB_VMDEFP) $(LJLIB_C)
|
|
||||||
|
|
||||||
bluajit/lj_folddef.h: $(BUILDVM_T) bluajit/lj_opt_fold.c
|
|
||||||
$(E) "BUILDVM $@"
|
|
||||||
$(Q)$(BUILDVM_X) -m folddef -o $@ bluajit/lj_opt_fold.c
|
|
||||||
|
|
||||||
$(OBJDIR)/%.o: bluajit/%.c
|
|
||||||
$(E) "CC $@"
|
|
||||||
$(TARGET_CC) $(TARGET_ACFLAGS) -c -o $@ $<
|
|
||||||
|
|
||||||
$(OBJDIR)/%.o: $(OBJDIR)/lj_vm.S
|
|
||||||
$(E) "ASM $@"
|
|
||||||
$(TARGET_CC) $(TARGET_ASFLAGS) -c -o $@ $<
|
|
||||||
|
|
||||||
$(HOST_O): $(OBJDIR)/%.o: bluajit/host/%.c
|
|
||||||
$(E) "HOSTCC $@"
|
|
||||||
$(HOST_CC) $(HOST_ACFLAGS) -c -o $@ $<
|
|
||||||
@@ -1,456 +0,0 @@
|
|||||||
/*
|
|
||||||
** DynASM ARM encoding engine.
|
|
||||||
** Copyright (C) 2005-2023 Mike Pall. All rights reserved.
|
|
||||||
** Released under the MIT license. See dynasm.lua for full copyright notice.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <stddef.h>
|
|
||||||
#include <stdarg.h>
|
|
||||||
#include <string.h>
|
|
||||||
#include <stdlib.h>
|
|
||||||
|
|
||||||
#define DASM_ARCH "arm"
|
|
||||||
|
|
||||||
#ifndef DASM_EXTERN
|
|
||||||
#define DASM_EXTERN(a,b,c,d) 0
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Action definitions. */
|
|
||||||
enum {
|
|
||||||
DASM_STOP, DASM_SECTION, DASM_ESC, DASM_REL_EXT,
|
|
||||||
/* The following actions need a buffer position. */
|
|
||||||
DASM_ALIGN, DASM_REL_LG, DASM_LABEL_LG,
|
|
||||||
/* The following actions also have an argument. */
|
|
||||||
DASM_REL_PC, DASM_LABEL_PC,
|
|
||||||
DASM_IMM, DASM_IMM12, DASM_IMM16, DASM_IMML8, DASM_IMML12, DASM_IMMV8,
|
|
||||||
DASM__MAX
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Maximum number of section buffer positions for a single dasm_put() call. */
|
|
||||||
#define DASM_MAXSECPOS 25
|
|
||||||
|
|
||||||
/* DynASM encoder status codes. Action list offset or number are or'ed in. */
|
|
||||||
#define DASM_S_OK 0x00000000
|
|
||||||
#define DASM_S_NOMEM 0x01000000
|
|
||||||
#define DASM_S_PHASE 0x02000000
|
|
||||||
#define DASM_S_MATCH_SEC 0x03000000
|
|
||||||
#define DASM_S_RANGE_I 0x11000000
|
|
||||||
#define DASM_S_RANGE_SEC 0x12000000
|
|
||||||
#define DASM_S_RANGE_LG 0x13000000
|
|
||||||
#define DASM_S_RANGE_PC 0x14000000
|
|
||||||
#define DASM_S_RANGE_REL 0x15000000
|
|
||||||
#define DASM_S_UNDEF_LG 0x21000000
|
|
||||||
#define DASM_S_UNDEF_PC 0x22000000
|
|
||||||
|
|
||||||
/* Macros to convert positions (8 bit section + 24 bit index). */
|
|
||||||
#define DASM_POS2IDX(pos) ((pos)&0x00ffffff)
|
|
||||||
#define DASM_POS2BIAS(pos) ((pos)&0xff000000)
|
|
||||||
#define DASM_SEC2POS(sec) ((sec)<<24)
|
|
||||||
#define DASM_POS2SEC(pos) ((pos)>>24)
|
|
||||||
#define DASM_POS2PTR(D, pos) (D->sections[DASM_POS2SEC(pos)].rbuf + (pos))
|
|
||||||
|
|
||||||
/* Action list type. */
|
|
||||||
typedef const unsigned int *dasm_ActList;
|
|
||||||
|
|
||||||
/* Per-section structure. */
|
|
||||||
typedef struct dasm_Section {
|
|
||||||
int *rbuf; /* Biased buffer pointer (negative section bias). */
|
|
||||||
int *buf; /* True buffer pointer. */
|
|
||||||
size_t bsize; /* Buffer size in bytes. */
|
|
||||||
int pos; /* Biased buffer position. */
|
|
||||||
int epos; /* End of biased buffer position - max single put. */
|
|
||||||
int ofs; /* Byte offset into section. */
|
|
||||||
} dasm_Section;
|
|
||||||
|
|
||||||
/* Core structure holding the DynASM encoding state. */
|
|
||||||
struct dasm_State {
|
|
||||||
size_t psize; /* Allocated size of this structure. */
|
|
||||||
dasm_ActList actionlist; /* Current actionlist pointer. */
|
|
||||||
int *lglabels; /* Local/global chain/pos ptrs. */
|
|
||||||
size_t lgsize;
|
|
||||||
int *pclabels; /* PC label chains/pos ptrs. */
|
|
||||||
size_t pcsize;
|
|
||||||
void **globals; /* Array of globals. */
|
|
||||||
dasm_Section *section; /* Pointer to active section. */
|
|
||||||
size_t codesize; /* Total size of all code sections. */
|
|
||||||
int maxsection; /* 0 <= sectionidx < maxsection. */
|
|
||||||
int status; /* Status code. */
|
|
||||||
dasm_Section sections[1]; /* All sections. Alloc-extended. */
|
|
||||||
};
|
|
||||||
|
|
||||||
/* The size of the core structure depends on the max. number of sections. */
|
|
||||||
#define DASM_PSZ(ms) (sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))
|
|
||||||
|
|
||||||
|
|
||||||
/* Initialize DynASM state. */
|
|
||||||
void dasm_init(Dst_DECL, int maxsection)
|
|
||||||
{
|
|
||||||
dasm_State *D;
|
|
||||||
size_t psz = 0;
|
|
||||||
Dst_REF = NULL;
|
|
||||||
DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));
|
|
||||||
D = Dst_REF;
|
|
||||||
D->psize = psz;
|
|
||||||
D->lglabels = NULL;
|
|
||||||
D->lgsize = 0;
|
|
||||||
D->pclabels = NULL;
|
|
||||||
D->pcsize = 0;
|
|
||||||
D->globals = NULL;
|
|
||||||
D->maxsection = maxsection;
|
|
||||||
memset((void *)D->sections, 0, maxsection * sizeof(dasm_Section));
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Free DynASM state. */
|
|
||||||
void dasm_free(Dst_DECL)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int i;
|
|
||||||
for (i = 0; i < D->maxsection; i++)
|
|
||||||
if (D->sections[i].buf)
|
|
||||||
DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);
|
|
||||||
if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);
|
|
||||||
if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);
|
|
||||||
DASM_M_FREE(Dst, D, D->psize);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Setup global label array. Must be called before dasm_setup(). */
|
|
||||||
void dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
D->globals = gl;
|
|
||||||
DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Grow PC label array. Can be called after dasm_setup(), too. */
|
|
||||||
void dasm_growpc(Dst_DECL, unsigned int maxpc)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
size_t osz = D->pcsize;
|
|
||||||
DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));
|
|
||||||
memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Setup encoder. */
|
|
||||||
void dasm_setup(Dst_DECL, const void *actionlist)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int i;
|
|
||||||
D->actionlist = (dasm_ActList)actionlist;
|
|
||||||
D->status = DASM_S_OK;
|
|
||||||
D->section = &D->sections[0];
|
|
||||||
memset((void *)D->lglabels, 0, D->lgsize);
|
|
||||||
if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);
|
|
||||||
for (i = 0; i < D->maxsection; i++) {
|
|
||||||
D->sections[i].pos = DASM_SEC2POS(i);
|
|
||||||
D->sections[i].rbuf = D->sections[i].buf - D->sections[i].pos;
|
|
||||||
D->sections[i].ofs = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
#define CK(x, st) \
|
|
||||||
do { if (!(x)) { \
|
|
||||||
D->status = DASM_S_##st|(p-D->actionlist-1); return; } } while (0)
|
|
||||||
#define CKPL(kind, st) \
|
|
||||||
do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \
|
|
||||||
D->status = DASM_S_RANGE_##st|(p-D->actionlist-1); return; } } while (0)
|
|
||||||
#else
|
|
||||||
#define CK(x, st) ((void)0)
|
|
||||||
#define CKPL(kind, st) ((void)0)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
static int dasm_imm12(unsigned int n)
|
|
||||||
{
|
|
||||||
int i;
|
|
||||||
for (i = 0; i < 16; i++, n = (n << 2) | (n >> 30))
|
|
||||||
if (n <= 255) return (int)(n + (i << 8));
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */
|
|
||||||
void dasm_put(Dst_DECL, int start, ...)
|
|
||||||
{
|
|
||||||
va_list ap;
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
dasm_ActList p = D->actionlist + start;
|
|
||||||
dasm_Section *sec = D->section;
|
|
||||||
int pos = sec->pos, ofs = sec->ofs;
|
|
||||||
int *b;
|
|
||||||
|
|
||||||
if (pos >= sec->epos) {
|
|
||||||
DASM_M_GROW(Dst, int, sec->buf, sec->bsize,
|
|
||||||
sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));
|
|
||||||
sec->rbuf = sec->buf - DASM_POS2BIAS(pos);
|
|
||||||
sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);
|
|
||||||
}
|
|
||||||
|
|
||||||
b = sec->rbuf;
|
|
||||||
b[pos++] = start;
|
|
||||||
|
|
||||||
va_start(ap, start);
|
|
||||||
while (1) {
|
|
||||||
unsigned int ins = *p++;
|
|
||||||
unsigned int action = (ins >> 16);
|
|
||||||
if (action >= DASM__MAX) {
|
|
||||||
ofs += 4;
|
|
||||||
} else {
|
|
||||||
int *pl, n = action >= DASM_REL_PC ? va_arg(ap, int) : 0;
|
|
||||||
switch (action) {
|
|
||||||
case DASM_STOP: goto stop;
|
|
||||||
case DASM_SECTION:
|
|
||||||
n = (ins & 255); CK(n < D->maxsection, RANGE_SEC);
|
|
||||||
D->section = &D->sections[n]; goto stop;
|
|
||||||
case DASM_ESC: p++; ofs += 4; break;
|
|
||||||
case DASM_REL_EXT: break;
|
|
||||||
case DASM_ALIGN: ofs += (ins & 255); b[pos++] = ofs; break;
|
|
||||||
case DASM_REL_LG:
|
|
||||||
n = (ins & 2047) - 10; pl = D->lglabels + n;
|
|
||||||
/* Bkwd rel or global. */
|
|
||||||
if (n >= 0) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }
|
|
||||||
pl += 10; n = *pl;
|
|
||||||
if (n < 0) n = 0; /* Start new chain for fwd rel if label exists. */
|
|
||||||
goto linkrel;
|
|
||||||
case DASM_REL_PC:
|
|
||||||
pl = D->pclabels + n; CKPL(pc, PC);
|
|
||||||
putrel:
|
|
||||||
n = *pl;
|
|
||||||
if (n < 0) { /* Label exists. Get label pos and store it. */
|
|
||||||
b[pos] = -n;
|
|
||||||
} else {
|
|
||||||
linkrel:
|
|
||||||
b[pos] = n; /* Else link to rel chain, anchored at label. */
|
|
||||||
*pl = pos;
|
|
||||||
}
|
|
||||||
pos++;
|
|
||||||
break;
|
|
||||||
case DASM_LABEL_LG:
|
|
||||||
pl = D->lglabels + (ins & 2047) - 10; CKPL(lg, LG); goto putlabel;
|
|
||||||
case DASM_LABEL_PC:
|
|
||||||
pl = D->pclabels + n; CKPL(pc, PC);
|
|
||||||
putlabel:
|
|
||||||
n = *pl; /* n > 0: Collapse rel chain and replace with label pos. */
|
|
||||||
while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos;
|
|
||||||
}
|
|
||||||
*pl = -pos; /* Label exists now. */
|
|
||||||
b[pos++] = ofs; /* Store pass1 offset estimate. */
|
|
||||||
break;
|
|
||||||
case DASM_IMM:
|
|
||||||
case DASM_IMM16:
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
CK((n & ((1<<((ins>>10)&31))-1)) == 0, RANGE_I);
|
|
||||||
if ((ins & 0x8000))
|
|
||||||
CK(((n + (1<<(((ins>>5)&31)-1)))>>((ins>>5)&31)) == 0, RANGE_I);
|
|
||||||
else
|
|
||||||
CK((n>>((ins>>5)&31)) == 0, RANGE_I);
|
|
||||||
#endif
|
|
||||||
b[pos++] = n;
|
|
||||||
break;
|
|
||||||
case DASM_IMMV8:
|
|
||||||
CK((n & 3) == 0, RANGE_I);
|
|
||||||
n >>= 2;
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_IMML8:
|
|
||||||
case DASM_IMML12:
|
|
||||||
CK(n >= 0 ? ((n>>((ins>>5)&31)) == 0) :
|
|
||||||
(((-n)>>((ins>>5)&31)) == 0), RANGE_I);
|
|
||||||
b[pos++] = n;
|
|
||||||
break;
|
|
||||||
case DASM_IMM12:
|
|
||||||
CK(dasm_imm12((unsigned int)n) != -1, RANGE_I);
|
|
||||||
b[pos++] = n;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop:
|
|
||||||
va_end(ap);
|
|
||||||
sec->pos = pos;
|
|
||||||
sec->ofs = ofs;
|
|
||||||
}
|
|
||||||
#undef CK
|
|
||||||
|
|
||||||
/* Pass 2: Link sections, shrink aligns, fix label offsets. */
|
|
||||||
int dasm_link(Dst_DECL, size_t *szp)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int secnum;
|
|
||||||
int ofs = 0;
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
*szp = 0;
|
|
||||||
if (D->status != DASM_S_OK) return D->status;
|
|
||||||
{
|
|
||||||
int pc;
|
|
||||||
for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)
|
|
||||||
if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
{ /* Handle globals not defined in this translation unit. */
|
|
||||||
int idx;
|
|
||||||
for (idx = 10; idx*sizeof(int) < D->lgsize; idx++) {
|
|
||||||
int n = D->lglabels[idx];
|
|
||||||
/* Undefined label: Collapse rel chain and replace with marker (< 0). */
|
|
||||||
while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Combine all code sections. No support for data sections (yet). */
|
|
||||||
for (secnum = 0; secnum < D->maxsection; secnum++) {
|
|
||||||
dasm_Section *sec = D->sections + secnum;
|
|
||||||
int *b = sec->rbuf;
|
|
||||||
int pos = DASM_SEC2POS(secnum);
|
|
||||||
int lastpos = sec->pos;
|
|
||||||
|
|
||||||
while (pos != lastpos) {
|
|
||||||
dasm_ActList p = D->actionlist + b[pos++];
|
|
||||||
while (1) {
|
|
||||||
unsigned int ins = *p++;
|
|
||||||
unsigned int action = (ins >> 16);
|
|
||||||
switch (action) {
|
|
||||||
case DASM_STOP: case DASM_SECTION: goto stop;
|
|
||||||
case DASM_ESC: p++; break;
|
|
||||||
case DASM_REL_EXT: break;
|
|
||||||
case DASM_ALIGN: ofs -= (b[pos++] + ofs) & (ins & 255); break;
|
|
||||||
case DASM_REL_LG: case DASM_REL_PC: pos++; break;
|
|
||||||
case DASM_LABEL_LG: case DASM_LABEL_PC: b[pos++] += ofs; break;
|
|
||||||
case DASM_IMM: case DASM_IMM12: case DASM_IMM16:
|
|
||||||
case DASM_IMML8: case DASM_IMML12: case DASM_IMMV8: pos++; break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop: (void)0;
|
|
||||||
}
|
|
||||||
ofs += sec->ofs; /* Next section starts right after current section. */
|
|
||||||
}
|
|
||||||
|
|
||||||
D->codesize = ofs; /* Total size of all code sections */
|
|
||||||
*szp = ofs;
|
|
||||||
return DASM_S_OK;
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
#define CK(x, st) \
|
|
||||||
do { if (!(x)) return DASM_S_##st|(p-D->actionlist-1); } while (0)
|
|
||||||
#else
|
|
||||||
#define CK(x, st) ((void)0)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Pass 3: Encode sections. */
|
|
||||||
int dasm_encode(Dst_DECL, void *buffer)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
char *base = (char *)buffer;
|
|
||||||
unsigned int *cp = (unsigned int *)buffer;
|
|
||||||
int secnum;
|
|
||||||
|
|
||||||
/* Encode all code sections. No support for data sections (yet). */
|
|
||||||
for (secnum = 0; secnum < D->maxsection; secnum++) {
|
|
||||||
dasm_Section *sec = D->sections + secnum;
|
|
||||||
int *b = sec->buf;
|
|
||||||
int *endb = sec->rbuf + sec->pos;
|
|
||||||
|
|
||||||
while (b != endb) {
|
|
||||||
dasm_ActList p = D->actionlist + *b++;
|
|
||||||
while (1) {
|
|
||||||
unsigned int ins = *p++;
|
|
||||||
unsigned int action = (ins >> 16);
|
|
||||||
int n = (action >= DASM_ALIGN && action < DASM__MAX) ? *b++ : 0;
|
|
||||||
switch (action) {
|
|
||||||
case DASM_STOP: case DASM_SECTION: goto stop;
|
|
||||||
case DASM_ESC: *cp++ = *p++; break;
|
|
||||||
case DASM_REL_EXT:
|
|
||||||
n = DASM_EXTERN(Dst, (unsigned char *)cp, (ins&2047), !(ins&2048));
|
|
||||||
goto patchrel;
|
|
||||||
case DASM_ALIGN:
|
|
||||||
ins &= 255; while ((((char *)cp - base) & ins)) *cp++ = 0xe1a00000;
|
|
||||||
break;
|
|
||||||
case DASM_REL_LG:
|
|
||||||
if (n < 0) {
|
|
||||||
n = (int)((ptrdiff_t)D->globals[-n-10] - (ptrdiff_t)cp - 4);
|
|
||||||
goto patchrel;
|
|
||||||
}
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_REL_PC:
|
|
||||||
CK(n >= 0, UNDEF_PC);
|
|
||||||
n = *DASM_POS2PTR(D, n) - (int)((char *)cp - base) - 4;
|
|
||||||
patchrel:
|
|
||||||
if ((ins & 0x800) == 0) {
|
|
||||||
CK((n & 3) == 0 && ((n+0x02000000) >> 26) == 0, RANGE_REL);
|
|
||||||
cp[-1] |= ((n >> 2) & 0x00ffffff);
|
|
||||||
} else if ((ins & 0x1000)) {
|
|
||||||
CK((n & 3) == 0 && -256 <= n && n <= 256, RANGE_REL);
|
|
||||||
goto patchimml8;
|
|
||||||
} else if ((ins & 0x2000) == 0) {
|
|
||||||
CK((n & 3) == 0 && -4096 <= n && n <= 4096, RANGE_REL);
|
|
||||||
goto patchimml;
|
|
||||||
} else {
|
|
||||||
CK((n & 3) == 0 && -1020 <= n && n <= 1020, RANGE_REL);
|
|
||||||
n >>= 2;
|
|
||||||
goto patchimml;
|
|
||||||
}
|
|
||||||
break;
|
|
||||||
case DASM_LABEL_LG:
|
|
||||||
ins &= 2047; if (ins >= 20) D->globals[ins-20] = (void *)(base + n);
|
|
||||||
break;
|
|
||||||
case DASM_LABEL_PC: break;
|
|
||||||
case DASM_IMM:
|
|
||||||
cp[-1] |= ((n>>((ins>>10)&31)) & ((1<<((ins>>5)&31))-1)) << (ins&31);
|
|
||||||
break;
|
|
||||||
case DASM_IMM12:
|
|
||||||
cp[-1] |= dasm_imm12((unsigned int)n);
|
|
||||||
break;
|
|
||||||
case DASM_IMM16:
|
|
||||||
cp[-1] |= ((n & 0xf000) << 4) | (n & 0x0fff);
|
|
||||||
break;
|
|
||||||
case DASM_IMML8: patchimml8:
|
|
||||||
cp[-1] |= n >= 0 ? (0x00800000 | (n & 0x0f) | ((n & 0xf0) << 4)) :
|
|
||||||
((-n & 0x0f) | ((-n & 0xf0) << 4));
|
|
||||||
break;
|
|
||||||
case DASM_IMML12: case DASM_IMMV8: patchimml:
|
|
||||||
cp[-1] |= n >= 0 ? (0x00800000 | n) : (-n);
|
|
||||||
break;
|
|
||||||
default: *cp++ = ins; break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop: (void)0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (base + D->codesize != (char *)cp) /* Check for phase errors. */
|
|
||||||
return DASM_S_PHASE;
|
|
||||||
return DASM_S_OK;
|
|
||||||
}
|
|
||||||
#undef CK
|
|
||||||
|
|
||||||
/* Get PC label offset. */
|
|
||||||
int dasm_getpclabel(Dst_DECL, unsigned int pc)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
if (pc*sizeof(int) < D->pcsize) {
|
|
||||||
int pos = D->pclabels[pc];
|
|
||||||
if (pos < 0) return *DASM_POS2PTR(D, -pos);
|
|
||||||
if (pos > 0) return -1; /* Undefined. */
|
|
||||||
}
|
|
||||||
return -2; /* Unused or out of range. */
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
/* Optional sanity checker to call between isolated encoding steps. */
|
|
||||||
int dasm_checkstep(Dst_DECL, int secmatch)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
if (D->status == DASM_S_OK) {
|
|
||||||
int i;
|
|
||||||
for (i = 1; i <= 9; i++) {
|
|
||||||
if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_LG|i; break; }
|
|
||||||
D->lglabels[i] = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (D->status == DASM_S_OK && secmatch >= 0 &&
|
|
||||||
D->section != &D->sections[secmatch])
|
|
||||||
D->status = DASM_S_MATCH_SEC|(D->section-D->sections);
|
|
||||||
return D->status;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
File diff suppressed because it is too large.
Load diff
@@ -1,558 +0,0 @@
|
|||||||
/*
|
|
||||||
** DynASM ARM64 encoding engine.
|
|
||||||
** Copyright (C) 2005-2023 Mike Pall. All rights reserved.
|
|
||||||
** Released under the MIT license. See dynasm.lua for full copyright notice.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <stddef.h>
|
|
||||||
#include <stdarg.h>
|
|
||||||
#include <string.h>
|
|
||||||
#include <stdlib.h>
|
|
||||||
|
|
||||||
#define DASM_ARCH "arm64"
|
|
||||||
|
|
||||||
#ifndef DASM_EXTERN
|
|
||||||
#define DASM_EXTERN(a,b,c,d) 0
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Action definitions. */
|
|
||||||
enum {
|
|
||||||
DASM_STOP, DASM_SECTION, DASM_ESC, DASM_REL_EXT,
|
|
||||||
/* The following actions need a buffer position. */
|
|
||||||
DASM_ALIGN, DASM_REL_LG, DASM_LABEL_LG,
|
|
||||||
/* The following actions also have an argument. */
|
|
||||||
DASM_REL_PC, DASM_LABEL_PC, DASM_REL_A,
|
|
||||||
DASM_IMM, DASM_IMM6, DASM_IMM12, DASM_IMM13W, DASM_IMM13X, DASM_IMML,
|
|
||||||
DASM_IMMV, DASM_VREG,
|
|
||||||
DASM__MAX
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Maximum number of section buffer positions for a single dasm_put() call. */
|
|
||||||
#define DASM_MAXSECPOS 25
|
|
||||||
|
|
||||||
/* DynASM encoder status codes. Action list offset or number are or'ed in. */
|
|
||||||
#define DASM_S_OK 0x00000000
|
|
||||||
#define DASM_S_NOMEM 0x01000000
|
|
||||||
#define DASM_S_PHASE 0x02000000
|
|
||||||
#define DASM_S_MATCH_SEC 0x03000000
|
|
||||||
#define DASM_S_RANGE_I 0x11000000
|
|
||||||
#define DASM_S_RANGE_SEC 0x12000000
|
|
||||||
#define DASM_S_RANGE_LG 0x13000000
|
|
||||||
#define DASM_S_RANGE_PC 0x14000000
|
|
||||||
#define DASM_S_RANGE_REL 0x15000000
|
|
||||||
#define DASM_S_RANGE_VREG 0x16000000
|
|
||||||
#define DASM_S_UNDEF_LG 0x21000000
|
|
||||||
#define DASM_S_UNDEF_PC 0x22000000
|
|
||||||
|
|
||||||
/* Macros to convert positions (8 bit section + 24 bit index). */
|
|
||||||
#define DASM_POS2IDX(pos) ((pos)&0x00ffffff)
|
|
||||||
#define DASM_POS2BIAS(pos) ((pos)&0xff000000)
|
|
||||||
#define DASM_SEC2POS(sec) ((sec)<<24)
|
|
||||||
#define DASM_POS2SEC(pos) ((pos)>>24)
|
|
||||||
#define DASM_POS2PTR(D, pos) (D->sections[DASM_POS2SEC(pos)].rbuf + (pos))
|
|
||||||
|
|
||||||
/* Action list type. */
|
|
||||||
typedef const unsigned int *dasm_ActList;
|
|
||||||
|
|
||||||
/* Per-section structure. */
|
|
||||||
typedef struct dasm_Section {
|
|
||||||
int *rbuf; /* Biased buffer pointer (negative section bias). */
|
|
||||||
int *buf; /* True buffer pointer. */
|
|
||||||
size_t bsize; /* Buffer size in bytes. */
|
|
||||||
int pos; /* Biased buffer position. */
|
|
||||||
int epos; /* End of biased buffer position - max single put. */
|
|
||||||
int ofs; /* Byte offset into section. */
|
|
||||||
} dasm_Section;
|
|
||||||
|
|
||||||
/* Core structure holding the DynASM encoding state. */
|
|
||||||
struct dasm_State {
|
|
||||||
size_t psize; /* Allocated size of this structure. */
|
|
||||||
dasm_ActList actionlist; /* Current actionlist pointer. */
|
|
||||||
int *lglabels; /* Local/global chain/pos ptrs. */
|
|
||||||
size_t lgsize;
|
|
||||||
int *pclabels; /* PC label chains/pos ptrs. */
|
|
||||||
size_t pcsize;
|
|
||||||
void **globals; /* Array of globals. */
|
|
||||||
dasm_Section *section; /* Pointer to active section. */
|
|
||||||
size_t codesize; /* Total size of all code sections. */
|
|
||||||
int maxsection; /* 0 <= sectionidx < maxsection. */
|
|
||||||
int status; /* Status code. */
|
|
||||||
dasm_Section sections[1]; /* All sections. Alloc-extended. */
|
|
||||||
};
|
|
||||||
|
|
||||||
/* The size of the core structure depends on the max. number of sections. */
|
|
||||||
#define DASM_PSZ(ms) (sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))
|
|
||||||
|
|
||||||
|
|
||||||
/* Initialize DynASM state. */
|
|
||||||
void dasm_init(Dst_DECL, int maxsection)
|
|
||||||
{
|
|
||||||
dasm_State *D;
|
|
||||||
size_t psz = 0;
|
|
||||||
Dst_REF = NULL;
|
|
||||||
DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));
|
|
||||||
D = Dst_REF;
|
|
||||||
D->psize = psz;
|
|
||||||
D->lglabels = NULL;
|
|
||||||
D->lgsize = 0;
|
|
||||||
D->pclabels = NULL;
|
|
||||||
D->pcsize = 0;
|
|
||||||
D->globals = NULL;
|
|
||||||
D->maxsection = maxsection;
|
|
||||||
memset((void *)D->sections, 0, maxsection * sizeof(dasm_Section));
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Free DynASM state. */
|
|
||||||
void dasm_free(Dst_DECL)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int i;
|
|
||||||
for (i = 0; i < D->maxsection; i++)
|
|
||||||
if (D->sections[i].buf)
|
|
||||||
DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);
|
|
||||||
if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);
|
|
||||||
if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);
|
|
||||||
DASM_M_FREE(Dst, D, D->psize);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Setup global label array. Must be called before dasm_setup(). */
|
|
||||||
void dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
D->globals = gl;
|
|
||||||
DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Grow PC label array. Can be called after dasm_setup(), too. */
|
|
||||||
void dasm_growpc(Dst_DECL, unsigned int maxpc)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
size_t osz = D->pcsize;
|
|
||||||
DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));
|
|
||||||
memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Setup encoder. */
|
|
||||||
void dasm_setup(Dst_DECL, const void *actionlist)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int i;
|
|
||||||
D->actionlist = (dasm_ActList)actionlist;
|
|
||||||
D->status = DASM_S_OK;
|
|
||||||
D->section = &D->sections[0];
|
|
||||||
memset((void *)D->lglabels, 0, D->lgsize);
|
|
||||||
if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);
|
|
||||||
for (i = 0; i < D->maxsection; i++) {
|
|
||||||
D->sections[i].pos = DASM_SEC2POS(i);
|
|
||||||
D->sections[i].rbuf = D->sections[i].buf - D->sections[i].pos;
|
|
||||||
D->sections[i].ofs = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
#define CK(x, st) \
|
|
||||||
do { if (!(x)) { \
|
|
||||||
D->status = DASM_S_##st|(int)(p-D->actionlist-1); return; } } while (0)
|
|
||||||
#define CKPL(kind, st) \
|
|
||||||
do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \
|
|
||||||
D->status = DASM_S_RANGE_##st|(int)(p-D->actionlist-1); return; } } while (0)
|
|
||||||
#else
|
|
||||||
#define CK(x, st) ((void)0)
|
|
||||||
#define CKPL(kind, st) ((void)0)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
static int dasm_imm12(unsigned int n)
|
|
||||||
{
|
|
||||||
if ((n >> 12) == 0)
|
|
||||||
return n;
|
|
||||||
else if ((n & 0xff000fff) == 0)
|
|
||||||
return (n >> 12) | 0x1000;
|
|
||||||
else
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
static int dasm_ffs(unsigned long long x)
|
|
||||||
{
|
|
||||||
int n = -1;
|
|
||||||
while (x) { x >>= 1; n++; }
|
|
||||||
return n;
|
|
||||||
}
|
|
||||||
|
|
||||||
static int dasm_imm13(int lo, int hi)
|
|
||||||
{
|
|
||||||
int inv = 0, w = 64, s = 0xfff, xa, xb;
|
|
||||||
unsigned long long n = (((unsigned long long)hi) << 32) | (unsigned int)lo;
|
|
||||||
unsigned long long m = 1ULL, a, b, c;
|
|
||||||
if (n & 1) { n = ~n; inv = 1; }
|
|
||||||
a = n & (unsigned long long)-(long long)n;
|
|
||||||
b = (n+a)&(unsigned long long)-(long long)(n+a);
|
|
||||||
c = (n+a-b)&(unsigned long long)-(long long)(n+a-b);
|
|
||||||
xa = dasm_ffs(a); xb = dasm_ffs(b);
|
|
||||||
if (c) {
|
|
||||||
w = dasm_ffs(c) - xa;
|
|
||||||
if (w == 32) m = 0x0000000100000001UL;
|
|
||||||
else if (w == 16) m = 0x0001000100010001UL;
|
|
||||||
else if (w == 8) m = 0x0101010101010101UL;
|
|
||||||
else if (w == 4) m = 0x1111111111111111UL;
|
|
||||||
else if (w == 2) m = 0x5555555555555555UL;
|
|
||||||
else return -1;
|
|
||||||
s = (-2*w & 0x3f) - 1;
|
|
||||||
} else if (!a) {
|
|
||||||
return -1;
|
|
||||||
} else if (xb == -1) {
|
|
||||||
xb = 64;
|
|
||||||
}
|
|
||||||
if ((b-a) * m != n) return -1;
|
|
||||||
if (inv) {
|
|
||||||
return ((w - xb) << 6) | (s+w+xa-xb);
|
|
||||||
} else {
|
|
||||||
return ((w - xa) << 6) | (s+xb-xa);
|
|
||||||
}
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */
|
|
||||||
void dasm_put(Dst_DECL, int start, ...)
|
|
||||||
{
|
|
||||||
va_list ap;
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
dasm_ActList p = D->actionlist + start;
|
|
||||||
dasm_Section *sec = D->section;
|
|
||||||
int pos = sec->pos, ofs = sec->ofs;
|
|
||||||
int *b;
|
|
||||||
|
|
||||||
if (pos >= sec->epos) {
|
|
||||||
DASM_M_GROW(Dst, int, sec->buf, sec->bsize,
|
|
||||||
sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));
|
|
||||||
sec->rbuf = sec->buf - DASM_POS2BIAS(pos);
|
|
||||||
sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);
|
|
||||||
}
|
|
||||||
|
|
||||||
b = sec->rbuf;
|
|
||||||
b[pos++] = start;
|
|
||||||
|
|
||||||
va_start(ap, start);
|
|
||||||
while (1) {
|
|
||||||
unsigned int ins = *p++;
|
|
||||||
unsigned int action = (ins >> 16);
|
|
||||||
if (action >= DASM__MAX) {
|
|
||||||
ofs += 4;
|
|
||||||
} else {
|
|
||||||
int *pl, n = action >= DASM_REL_PC ? va_arg(ap, int) : 0;
|
|
||||||
switch (action) {
|
|
||||||
case DASM_STOP: goto stop;
|
|
||||||
case DASM_SECTION:
|
|
||||||
n = (ins & 255); CK(n < D->maxsection, RANGE_SEC);
|
|
||||||
D->section = &D->sections[n]; goto stop;
|
|
||||||
case DASM_ESC: p++; ofs += 4; break;
|
|
||||||
case DASM_REL_EXT: if ((ins & 0x8000)) ofs += 8; break;
|
|
||||||
case DASM_ALIGN: ofs += (ins & 255); b[pos++] = ofs; break;
|
|
||||||
case DASM_REL_LG:
|
|
||||||
n = (ins & 2047) - 10; pl = D->lglabels + n;
|
|
||||||
/* Bkwd rel or global. */
|
|
||||||
if (n >= 0) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }
|
|
||||||
pl += 10; n = *pl;
|
|
||||||
if (n < 0) n = 0; /* Start new chain for fwd rel if label exists. */
|
|
||||||
goto linkrel;
|
|
||||||
case DASM_REL_PC:
|
|
||||||
pl = D->pclabels + n; CKPL(pc, PC);
|
|
||||||
putrel:
|
|
||||||
n = *pl;
|
|
||||||
if (n < 0) { /* Label exists. Get label pos and store it. */
|
|
||||||
b[pos] = -n;
|
|
||||||
} else {
|
|
||||||
linkrel:
|
|
||||||
b[pos] = n; /* Else link to rel chain, anchored at label. */
|
|
||||||
*pl = pos;
|
|
||||||
}
|
|
||||||
pos++;
|
|
||||||
if ((ins & 0x8000)) ofs += 8;
|
|
||||||
break;
|
|
||||||
case DASM_REL_A:
|
|
||||||
b[pos++] = n;
|
|
||||||
b[pos++] = va_arg(ap, int);
|
|
||||||
break;
|
|
||||||
case DASM_LABEL_LG:
|
|
||||||
pl = D->lglabels + (ins & 2047) - 10; CKPL(lg, LG); goto putlabel;
|
|
||||||
case DASM_LABEL_PC:
|
|
||||||
pl = D->pclabels + n; CKPL(pc, PC);
|
|
||||||
putlabel:
|
|
||||||
n = *pl; /* n > 0: Collapse rel chain and replace with label pos. */
|
|
||||||
while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos;
|
|
||||||
}
|
|
||||||
*pl = -pos; /* Label exists now. */
|
|
||||||
b[pos++] = ofs; /* Store pass1 offset estimate. */
|
|
||||||
break;
|
|
||||||
case DASM_IMM:
|
|
||||||
CK((n & ((1<<((ins>>10)&31))-1)) == 0, RANGE_I);
|
|
||||||
n >>= ((ins>>10)&31);
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
if ((ins & 0x8000))
|
|
||||||
CK(((n + (1<<(((ins>>5)&31)-1)))>>((ins>>5)&31)) == 0, RANGE_I);
|
|
||||||
else
|
|
||||||
CK((n>>((ins>>5)&31)) == 0, RANGE_I);
|
|
||||||
#endif
|
|
||||||
b[pos++] = n;
|
|
||||||
break;
|
|
||||||
case DASM_IMM6:
|
|
||||||
CK((n >> 6) == 0, RANGE_I);
|
|
||||||
b[pos++] = n;
|
|
||||||
break;
|
|
||||||
case DASM_IMM12:
|
|
||||||
CK(dasm_imm12((unsigned int)n) != -1, RANGE_I);
|
|
||||||
b[pos++] = n;
|
|
||||||
break;
|
|
||||||
case DASM_IMM13W:
|
|
||||||
CK(dasm_imm13(n, n) != -1, RANGE_I);
|
|
||||||
b[pos++] = n;
|
|
||||||
break;
|
|
||||||
case DASM_IMM13X: {
|
|
||||||
int m = va_arg(ap, int);
|
|
||||||
CK(dasm_imm13(n, m) != -1, RANGE_I);
|
|
||||||
b[pos++] = n;
|
|
||||||
b[pos++] = m;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case DASM_IMML: {
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
int scale = (ins & 3);
|
|
||||||
CK((!(n & ((1<<scale)-1)) && (unsigned int)(n>>scale) < 4096) ||
|
|
||||||
(unsigned int)(n+256) < 512, RANGE_I);
|
|
||||||
#endif
|
|
||||||
b[pos++] = n;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case DASM_IMMV:
|
|
||||||
ofs += 4;
|
|
||||||
b[pos++] = n;
|
|
||||||
break;
|
|
||||||
case DASM_VREG:
|
|
||||||
CK(n < 32, RANGE_VREG);
|
|
||||||
b[pos++] = n;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop:
|
|
||||||
va_end(ap);
|
|
||||||
sec->pos = pos;
|
|
||||||
sec->ofs = ofs;
|
|
||||||
}
|
|
||||||
#undef CK
|
|
||||||
|
|
||||||
/* Pass 2: Link sections, shrink aligns, fix label offsets. */
|
|
||||||
int dasm_link(Dst_DECL, size_t *szp)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int secnum;
|
|
||||||
int ofs = 0;
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
*szp = 0;
|
|
||||||
if (D->status != DASM_S_OK) return D->status;
|
|
||||||
{
|
|
||||||
int pc;
|
|
||||||
for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)
|
|
||||||
if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
{ /* Handle globals not defined in this translation unit. */
|
|
||||||
int idx;
|
|
||||||
for (idx = 10; idx*sizeof(int) < D->lgsize; idx++) {
|
|
||||||
int n = D->lglabels[idx];
|
|
||||||
/* Undefined label: Collapse rel chain and replace with marker (< 0). */
|
|
||||||
while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Combine all code sections. No support for data sections (yet). */
|
|
||||||
for (secnum = 0; secnum < D->maxsection; secnum++) {
|
|
||||||
dasm_Section *sec = D->sections + secnum;
|
|
||||||
int *b = sec->rbuf;
|
|
||||||
int pos = DASM_SEC2POS(secnum);
|
|
||||||
int lastpos = sec->pos;
|
|
||||||
|
|
||||||
while (pos != lastpos) {
|
|
||||||
dasm_ActList p = D->actionlist + b[pos++];
|
|
||||||
while (1) {
|
|
||||||
unsigned int ins = *p++;
|
|
||||||
unsigned int action = (ins >> 16);
|
|
||||||
switch (action) {
|
|
||||||
case DASM_STOP: case DASM_SECTION: goto stop;
|
|
||||||
case DASM_ESC: p++; break;
|
|
||||||
case DASM_REL_EXT: break;
|
|
||||||
case DASM_ALIGN: ofs -= (b[pos++] + ofs) & (ins & 255); break;
|
|
||||||
case DASM_REL_LG: case DASM_REL_PC: pos++; break;
|
|
||||||
case DASM_LABEL_LG: case DASM_LABEL_PC: b[pos++] += ofs; break;
|
|
||||||
case DASM_IMM: case DASM_IMM6: case DASM_IMM12: case DASM_IMM13W:
|
|
||||||
case DASM_IMML: case DASM_IMMV: case DASM_VREG: pos++; break;
|
|
||||||
case DASM_IMM13X: case DASM_REL_A: pos += 2; break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop: (void)0;
|
|
||||||
}
|
|
||||||
ofs += sec->ofs; /* Next section starts right after current section. */
|
|
||||||
}
|
|
||||||
|
|
||||||
D->codesize = ofs; /* Total size of all code sections */
|
|
||||||
*szp = ofs;
|
|
||||||
return DASM_S_OK;
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
#define CK(x, st) \
|
|
||||||
do { if (!(x)) return DASM_S_##st|(int)(p-D->actionlist-1); } while (0)
|
|
||||||
#else
|
|
||||||
#define CK(x, st) ((void)0)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Pass 3: Encode sections. */
|
|
||||||
int dasm_encode(Dst_DECL, void *buffer)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
char *base = (char *)buffer;
|
|
||||||
unsigned int *cp = (unsigned int *)buffer;
|
|
||||||
int secnum;
|
|
||||||
|
|
||||||
/* Encode all code sections. No support for data sections (yet). */
|
|
||||||
for (secnum = 0; secnum < D->maxsection; secnum++) {
|
|
||||||
dasm_Section *sec = D->sections + secnum;
|
|
||||||
int *b = sec->buf;
|
|
||||||
int *endb = sec->rbuf + sec->pos;
|
|
||||||
|
|
||||||
while (b != endb) {
|
|
||||||
dasm_ActList p = D->actionlist + *b++;
|
|
||||||
while (1) {
|
|
||||||
unsigned int ins = *p++;
|
|
||||||
unsigned int action = (ins >> 16);
|
|
||||||
int n = (action >= DASM_ALIGN && action < DASM__MAX) ? *b++ : 0;
|
|
||||||
switch (action) {
|
|
||||||
case DASM_STOP: case DASM_SECTION: goto stop;
|
|
||||||
case DASM_ESC: *cp++ = *p++; break;
|
|
||||||
case DASM_REL_EXT:
|
|
||||||
n = DASM_EXTERN(Dst, (unsigned char *)cp, (ins&2047), !(ins&2048));
|
|
||||||
goto patchrel;
|
|
||||||
case DASM_ALIGN:
|
|
||||||
ins &= 255; while ((((char *)cp - base) & ins)) *cp++ = 0xd503201f;
|
|
||||||
break;
|
|
||||||
case DASM_REL_LG:
|
|
||||||
if (n < 0) {
|
|
||||||
ptrdiff_t na = (ptrdiff_t)D->globals[-n-10] - (ptrdiff_t)cp + 4;
|
|
||||||
n = (int)na;
|
|
||||||
CK((ptrdiff_t)n == na, RANGE_REL);
|
|
||||||
goto patchrel;
|
|
||||||
}
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_REL_PC:
|
|
||||||
CK(n >= 0, UNDEF_PC);
|
|
||||||
n = *DASM_POS2PTR(D, n) - (int)((char *)cp - base) + 4;
|
|
||||||
patchrel:
|
|
||||||
if (!(ins & 0xf800)) { /* B, BL */
|
|
||||||
CK((n & 3) == 0 && ((n+0x08000000) >> 28) == 0, RANGE_REL);
|
|
||||||
cp[-1] |= ((n >> 2) & 0x03ffffff);
|
|
||||||
} else if ((ins & 0x800)) { /* B.cond, CBZ, CBNZ, LDR* literal */
|
|
||||||
CK((n & 3) == 0 && ((n+0x00100000) >> 21) == 0, RANGE_REL);
|
|
||||||
cp[-1] |= ((n << 3) & 0x00ffffe0);
|
|
||||||
} else if ((ins & 0x3000) == 0x2000) { /* ADR */
|
|
||||||
CK(((n+0x00100000) >> 21) == 0, RANGE_REL);
|
|
||||||
cp[-1] |= ((n << 3) & 0x00ffffe0) | ((n & 3) << 29);
|
|
||||||
} else if ((ins & 0x3000) == 0x3000) { /* ADRP */
|
|
||||||
cp[-1] |= ((n >> 9) & 0x00ffffe0) | (((n >> 12) & 3) << 29);
|
|
||||||
} else if ((ins & 0x1000)) { /* TBZ, TBNZ */
|
|
||||||
CK((n & 3) == 0 && ((n+0x00008000) >> 16) == 0, RANGE_REL);
|
|
||||||
cp[-1] |= ((n << 3) & 0x0007ffe0);
|
|
||||||
} else if ((ins & 0x8000)) { /* absolute */
|
|
||||||
cp[0] = (unsigned int)((ptrdiff_t)cp - 4 + n);
|
|
||||||
cp[1] = (unsigned int)(((ptrdiff_t)cp - 4 + n) >> 32);
|
|
||||||
cp += 2;
|
|
||||||
}
|
|
||||||
break;
|
|
||||||
case DASM_REL_A: {
|
|
||||||
ptrdiff_t na = (((ptrdiff_t)(*b++) << 32) | (unsigned int)n);
|
|
||||||
if ((ins & 0x3000) == 0x3000) { /* ADRP */
|
|
||||||
ins &= ~0x1000;
|
|
||||||
na = (na >> 12) - (((ptrdiff_t)cp - 4) >> 12);
|
|
||||||
} else {
|
|
||||||
na = na - (ptrdiff_t)cp + 4;
|
|
||||||
}
|
|
||||||
n = (int)na;
|
|
||||||
CK((ptrdiff_t)n == na, RANGE_REL);
|
|
||||||
goto patchrel;
|
|
||||||
}
|
|
||||||
case DASM_LABEL_LG:
|
|
||||||
ins &= 2047; if (ins >= 20) D->globals[ins-20] = (void *)(base + n);
|
|
||||||
break;
|
|
||||||
case DASM_LABEL_PC: break;
|
|
||||||
case DASM_IMM:
|
|
||||||
cp[-1] |= (n & ((1<<((ins>>5)&31))-1)) << (ins&31);
|
|
||||||
break;
|
|
||||||
case DASM_IMM6:
|
|
||||||
cp[-1] |= ((n&31) << 19) | ((n&32) << 26);
|
|
||||||
break;
|
|
||||||
case DASM_IMM12:
|
|
||||||
cp[-1] |= (dasm_imm12((unsigned int)n) << 10);
|
|
||||||
break;
|
|
||||||
case DASM_IMM13W:
|
|
||||||
cp[-1] |= (dasm_imm13(n, n) << 10);
|
|
||||||
break;
|
|
||||||
case DASM_IMM13X:
|
|
||||||
cp[-1] |= (dasm_imm13(n, *b++) << 10);
|
|
||||||
break;
|
|
||||||
case DASM_IMML: {
|
|
||||||
int scale = (ins & 3);
|
|
||||||
cp[-1] |= (!(n & ((1<<scale)-1)) && (unsigned int)(n>>scale) < 4096) ?
|
|
||||||
((n << (10-scale)) | 0x01000000) : ((n & 511) << 12);
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case DASM_IMMV:
|
|
||||||
*cp++ = n;
|
|
||||||
break;
|
|
||||||
case DASM_VREG:
|
|
||||||
cp[-1] |= (n & 0x1f) << (ins & 0x1f);
|
|
||||||
break;
|
|
||||||
default: *cp++ = ins; break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop: (void)0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (base + D->codesize != (char *)cp) /* Check for phase errors. */
|
|
||||||
return DASM_S_PHASE;
|
|
||||||
return DASM_S_OK;
|
|
||||||
}
|
|
||||||
#undef CK
|
|
||||||
|
|
||||||
/* Get PC label offset. */
|
|
||||||
int dasm_getpclabel(Dst_DECL, unsigned int pc)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
if (pc*sizeof(int) < D->pcsize) {
|
|
||||||
int pos = D->pclabels[pc];
|
|
||||||
if (pos < 0) return *DASM_POS2PTR(D, -pos);
|
|
||||||
if (pos > 0) return -1; /* Undefined. */
|
|
||||||
}
|
|
||||||
return -2; /* Unused or out of range. */
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
/* Optional sanity checker to call between isolated encoding steps. */
|
|
||||||
int dasm_checkstep(Dst_DECL, int secmatch)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
if (D->status == DASM_S_OK) {
|
|
||||||
int i;
|
|
||||||
for (i = 1; i <= 9; i++) {
|
|
||||||
if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_LG|i; break; }
|
|
||||||
D->lglabels[i] = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (D->status == DASM_S_OK && secmatch >= 0 &&
|
|
||||||
D->section != &D->sections[secmatch])
|
|
||||||
D->status = DASM_S_MATCH_SEC|(int)(D->section-D->sections);
|
|
||||||
return D->status;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
File diff suppressed because it is too large.
Load diff
@@ -1,419 +0,0 @@
|
|||||||
/*
|
|
||||||
** DynASM MIPS encoding engine.
|
|
||||||
** Copyright (C) 2005-2023 Mike Pall. All rights reserved.
|
|
||||||
** Released under the MIT license. See dynasm.lua for full copyright notice.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <stddef.h>
|
|
||||||
#include <stdarg.h>
|
|
||||||
#include <string.h>
|
|
||||||
#include <stdlib.h>
|
|
||||||
|
|
||||||
#define DASM_ARCH "mips"
|
|
||||||
|
|
||||||
#ifndef DASM_EXTERN
|
|
||||||
#define DASM_EXTERN(a,b,c,d) 0
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Action definitions. */
|
|
||||||
enum {
|
|
||||||
DASM_STOP, DASM_SECTION, DASM_ESC, DASM_REL_EXT,
|
|
||||||
/* The following actions need a buffer position. */
|
|
||||||
DASM_ALIGN, DASM_REL_LG, DASM_LABEL_LG,
|
|
||||||
/* The following actions also have an argument. */
|
|
||||||
DASM_REL_PC, DASM_LABEL_PC, DASM_IMM, DASM_IMMS,
|
|
||||||
DASM__MAX
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Maximum number of section buffer positions for a single dasm_put() call. */
|
|
||||||
#define DASM_MAXSECPOS 25
|
|
||||||
|
|
||||||
/* DynASM encoder status codes. Action list offset or number are or'ed in. */
|
|
||||||
#define DASM_S_OK 0x00000000
|
|
||||||
#define DASM_S_NOMEM 0x01000000
|
|
||||||
#define DASM_S_PHASE 0x02000000
|
|
||||||
#define DASM_S_MATCH_SEC 0x03000000
|
|
||||||
#define DASM_S_RANGE_I 0x11000000
|
|
||||||
#define DASM_S_RANGE_SEC 0x12000000
|
|
||||||
#define DASM_S_RANGE_LG 0x13000000
|
|
||||||
#define DASM_S_RANGE_PC 0x14000000
|
|
||||||
#define DASM_S_RANGE_REL 0x15000000
|
|
||||||
#define DASM_S_UNDEF_LG 0x21000000
|
|
||||||
#define DASM_S_UNDEF_PC 0x22000000
|
|
||||||
|
|
||||||
/* Macros to convert positions (8 bit section + 24 bit index). */
|
|
||||||
#define DASM_POS2IDX(pos) ((pos)&0x00ffffff)
|
|
||||||
#define DASM_POS2BIAS(pos) ((pos)&0xff000000)
|
|
||||||
#define DASM_SEC2POS(sec) ((sec)<<24)
|
|
||||||
#define DASM_POS2SEC(pos) ((pos)>>24)
|
|
||||||
#define DASM_POS2PTR(D, pos) (D->sections[DASM_POS2SEC(pos)].rbuf + (pos))
|
|
||||||
|
|
||||||
/* Action list type. */
|
|
||||||
typedef const unsigned int *dasm_ActList;
|
|
||||||
|
|
||||||
/* Per-section structure. */
|
|
||||||
typedef struct dasm_Section {
|
|
||||||
int *rbuf; /* Biased buffer pointer (negative section bias). */
|
|
||||||
int *buf; /* True buffer pointer. */
|
|
||||||
size_t bsize; /* Buffer size in bytes. */
|
|
||||||
int pos; /* Biased buffer position. */
|
|
||||||
int epos; /* End of biased buffer position - max single put. */
|
|
||||||
int ofs; /* Byte offset into section. */
|
|
||||||
} dasm_Section;
|
|
||||||
|
|
||||||
/* Core structure holding the DynASM encoding state. */
|
|
||||||
struct dasm_State {
|
|
||||||
size_t psize; /* Allocated size of this structure. */
|
|
||||||
dasm_ActList actionlist; /* Current actionlist pointer. */
|
|
||||||
int *lglabels; /* Local/global chain/pos ptrs. */
|
|
||||||
size_t lgsize;
|
|
||||||
int *pclabels; /* PC label chains/pos ptrs. */
|
|
||||||
size_t pcsize;
|
|
||||||
void **globals; /* Array of globals. */
|
|
||||||
dasm_Section *section; /* Pointer to active section. */
|
|
||||||
size_t codesize; /* Total size of all code sections. */
|
|
||||||
int maxsection; /* 0 <= sectionidx < maxsection. */
|
|
||||||
int status; /* Status code. */
|
|
||||||
dasm_Section sections[1]; /* All sections. Alloc-extended. */
|
|
||||||
};
|
|
||||||
|
|
||||||
/* The size of the core structure depends on the max. number of sections. */
|
|
||||||
#define DASM_PSZ(ms) (sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))
|
|
||||||
|
|
||||||
|
|
||||||
/* Initialize DynASM state. */
|
|
||||||
void dasm_init(Dst_DECL, int maxsection)
|
|
||||||
{
|
|
||||||
dasm_State *D;
|
|
||||||
size_t psz = 0;
|
|
||||||
Dst_REF = NULL;
|
|
||||||
DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));
|
|
||||||
D = Dst_REF;
|
|
||||||
D->psize = psz;
|
|
||||||
D->lglabels = NULL;
|
|
||||||
D->lgsize = 0;
|
|
||||||
D->pclabels = NULL;
|
|
||||||
D->pcsize = 0;
|
|
||||||
D->globals = NULL;
|
|
||||||
D->maxsection = maxsection;
|
|
||||||
memset((void *)D->sections, 0, maxsection * sizeof(dasm_Section));
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Free DynASM state. */
|
|
||||||
void dasm_free(Dst_DECL)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int i;
|
|
||||||
for (i = 0; i < D->maxsection; i++)
|
|
||||||
if (D->sections[i].buf)
|
|
||||||
DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);
|
|
||||||
if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);
|
|
||||||
if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);
|
|
||||||
DASM_M_FREE(Dst, D, D->psize);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Setup global label array. Must be called before dasm_setup(). */
|
|
||||||
void dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
D->globals = gl;
|
|
||||||
DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Grow PC label array. Can be called after dasm_setup(), too. */
|
|
||||||
void dasm_growpc(Dst_DECL, unsigned int maxpc)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
size_t osz = D->pcsize;
|
|
||||||
DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));
|
|
||||||
memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Setup encoder. */
|
|
||||||
void dasm_setup(Dst_DECL, const void *actionlist)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int i;
|
|
||||||
D->actionlist = (dasm_ActList)actionlist;
|
|
||||||
D->status = DASM_S_OK;
|
|
||||||
D->section = &D->sections[0];
|
|
||||||
memset((void *)D->lglabels, 0, D->lgsize);
|
|
||||||
if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);
|
|
||||||
for (i = 0; i < D->maxsection; i++) {
|
|
||||||
D->sections[i].pos = DASM_SEC2POS(i);
|
|
||||||
D->sections[i].rbuf = D->sections[i].buf - D->sections[i].pos;
|
|
||||||
D->sections[i].ofs = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
#define CK(x, st) \
|
|
||||||
do { if (!(x)) { \
|
|
||||||
D->status = DASM_S_##st|(int)(p-D->actionlist-1); return; } } while (0)
|
|
||||||
#define CKPL(kind, st) \
|
|
||||||
do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \
|
|
||||||
D->status = DASM_S_RANGE_##st|(int)(p-D->actionlist-1); return; } } while (0)
|
|
||||||
#else
|
|
||||||
#define CK(x, st) ((void)0)
|
|
||||||
#define CKPL(kind, st) ((void)0)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */
|
|
||||||
void dasm_put(Dst_DECL, int start, ...)
|
|
||||||
{
|
|
||||||
va_list ap;
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
dasm_ActList p = D->actionlist + start;
|
|
||||||
dasm_Section *sec = D->section;
|
|
||||||
int pos = sec->pos, ofs = sec->ofs;
|
|
||||||
int *b;
|
|
||||||
|
|
||||||
if (pos >= sec->epos) {
|
|
||||||
DASM_M_GROW(Dst, int, sec->buf, sec->bsize,
|
|
||||||
sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));
|
|
||||||
sec->rbuf = sec->buf - DASM_POS2BIAS(pos);
|
|
||||||
sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);
|
|
||||||
}
|
|
||||||
|
|
||||||
b = sec->rbuf;
|
|
||||||
b[pos++] = start;
|
|
||||||
|
|
||||||
va_start(ap, start);
|
|
||||||
while (1) {
|
|
||||||
unsigned int ins = *p++;
|
|
||||||
unsigned int action = (ins >> 16) - 0xff00;
|
|
||||||
if (action >= DASM__MAX) {
|
|
||||||
ofs += 4;
|
|
||||||
} else {
|
|
||||||
int *pl, n = action >= DASM_REL_PC ? va_arg(ap, int) : 0;
|
|
||||||
switch (action) {
|
|
||||||
case DASM_STOP: goto stop;
|
|
||||||
case DASM_SECTION:
|
|
||||||
n = (ins & 255); CK(n < D->maxsection, RANGE_SEC);
|
|
||||||
D->section = &D->sections[n]; goto stop;
|
|
||||||
case DASM_ESC: p++; ofs += 4; break;
|
|
||||||
case DASM_REL_EXT: break;
|
|
||||||
case DASM_ALIGN: ofs += (ins & 255); b[pos++] = ofs; break;
|
|
||||||
case DASM_REL_LG:
|
|
||||||
n = (ins & 2047) - 10; pl = D->lglabels + n;
|
|
||||||
/* Bkwd rel or global. */
|
|
||||||
if (n >= 0) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }
|
|
||||||
pl += 10; n = *pl;
|
|
||||||
if (n < 0) n = 0; /* Start new chain for fwd rel if label exists. */
|
|
||||||
goto linkrel;
|
|
||||||
case DASM_REL_PC:
|
|
||||||
pl = D->pclabels + n; CKPL(pc, PC);
|
|
||||||
putrel:
|
|
||||||
n = *pl;
|
|
||||||
if (n < 0) { /* Label exists. Get label pos and store it. */
|
|
||||||
b[pos] = -n;
|
|
||||||
} else {
|
|
||||||
linkrel:
|
|
||||||
b[pos] = n; /* Else link to rel chain, anchored at label. */
|
|
||||||
*pl = pos;
|
|
||||||
}
|
|
||||||
pos++;
|
|
||||||
break;
|
|
||||||
case DASM_LABEL_LG:
|
|
||||||
pl = D->lglabels + (ins & 2047) - 10; CKPL(lg, LG); goto putlabel;
|
|
||||||
case DASM_LABEL_PC:
|
|
||||||
pl = D->pclabels + n; CKPL(pc, PC);
|
|
||||||
putlabel:
|
|
||||||
n = *pl; /* n > 0: Collapse rel chain and replace with label pos. */
|
|
||||||
while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos;
|
|
||||||
}
|
|
||||||
*pl = -pos; /* Label exists now. */
|
|
||||||
b[pos++] = ofs; /* Store pass1 offset estimate. */
|
|
||||||
break;
|
|
||||||
case DASM_IMM: case DASM_IMMS:
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
CK((n & ((1<<((ins>>10)&31))-1)) == 0, RANGE_I);
|
|
||||||
#endif
|
|
||||||
n >>= ((ins>>10)&31);
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
if (ins & 0x8000)
|
|
||||||
CK(((n + (1<<(((ins>>5)&31)-1)))>>((ins>>5)&31)) == 0, RANGE_I);
|
|
||||||
else
|
|
||||||
CK((n>>((ins>>5)&31)) == 0, RANGE_I);
|
|
||||||
#endif
|
|
||||||
b[pos++] = n;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop:
|
|
||||||
va_end(ap);
|
|
||||||
sec->pos = pos;
|
|
||||||
sec->ofs = ofs;
|
|
||||||
}
|
|
||||||
#undef CK
|
|
||||||
|
|
||||||
/* Pass 2: Link sections, shrink aligns, fix label offsets. */
|
|
||||||
int dasm_link(Dst_DECL, size_t *szp)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int secnum;
|
|
||||||
int ofs = 0;
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
*szp = 0;
|
|
||||||
if (D->status != DASM_S_OK) return D->status;
|
|
||||||
{
|
|
||||||
int pc;
|
|
||||||
for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)
|
|
||||||
if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
{ /* Handle globals not defined in this translation unit. */
|
|
||||||
int idx;
|
|
||||||
for (idx = 10; idx*sizeof(int) < D->lgsize; idx++) {
|
|
||||||
int n = D->lglabels[idx];
|
|
||||||
/* Undefined label: Collapse rel chain and replace with marker (< 0). */
|
|
||||||
while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Combine all code sections. No support for data sections (yet). */
|
|
||||||
for (secnum = 0; secnum < D->maxsection; secnum++) {
|
|
||||||
dasm_Section *sec = D->sections + secnum;
|
|
||||||
int *b = sec->rbuf;
|
|
||||||
int pos = DASM_SEC2POS(secnum);
|
|
||||||
int lastpos = sec->pos;
|
|
||||||
|
|
||||||
while (pos != lastpos) {
|
|
||||||
dasm_ActList p = D->actionlist + b[pos++];
|
|
||||||
while (1) {
|
|
||||||
unsigned int ins = *p++;
|
|
||||||
unsigned int action = (ins >> 16) - 0xff00;
|
|
||||||
switch (action) {
|
|
||||||
case DASM_STOP: case DASM_SECTION: goto stop;
|
|
||||||
case DASM_ESC: p++; break;
|
|
||||||
case DASM_REL_EXT: break;
|
|
||||||
case DASM_ALIGN: ofs -= (b[pos++] + ofs) & (ins & 255); break;
|
|
||||||
case DASM_REL_LG: case DASM_REL_PC: pos++; break;
|
|
||||||
case DASM_LABEL_LG: case DASM_LABEL_PC: b[pos++] += ofs; break;
|
|
||||||
case DASM_IMM: case DASM_IMMS: pos++; break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop: (void)0;
|
|
||||||
}
|
|
||||||
ofs += sec->ofs; /* Next section starts right after current section. */
|
|
||||||
}
|
|
||||||
|
|
||||||
D->codesize = ofs; /* Total size of all code sections */
|
|
||||||
*szp = ofs;
|
|
||||||
return DASM_S_OK;
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
#define CK(x, st) \
|
|
||||||
do { if (!(x)) return DASM_S_##st|(int)(p-D->actionlist-1); } while (0)
|
|
||||||
#else
|
|
||||||
#define CK(x, st) ((void)0)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Pass 3: Encode sections. */
|
|
||||||
int dasm_encode(Dst_DECL, void *buffer)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
char *base = (char *)buffer;
|
|
||||||
unsigned int *cp = (unsigned int *)buffer;
|
|
||||||
int secnum;
|
|
||||||
|
|
||||||
/* Encode all code sections. No support for data sections (yet). */
|
|
||||||
for (secnum = 0; secnum < D->maxsection; secnum++) {
|
|
||||||
dasm_Section *sec = D->sections + secnum;
|
|
||||||
int *b = sec->buf;
|
|
||||||
int *endb = sec->rbuf + sec->pos;
|
|
||||||
|
|
||||||
while (b != endb) {
|
|
||||||
dasm_ActList p = D->actionlist + *b++;
|
|
||||||
while (1) {
|
|
||||||
unsigned int ins = *p++;
|
|
||||||
unsigned int action = (ins >> 16) - 0xff00;
|
|
||||||
int n = (action >= DASM_ALIGN && action < DASM__MAX) ? *b++ : 0;
|
|
||||||
switch (action) {
|
|
||||||
case DASM_STOP: case DASM_SECTION: goto stop;
|
|
||||||
case DASM_ESC: *cp++ = *p++; break;
|
|
||||||
case DASM_REL_EXT:
|
|
||||||
n = DASM_EXTERN(Dst, (unsigned char *)cp, (ins & 2047), 1);
|
|
||||||
goto patchrel;
|
|
||||||
case DASM_ALIGN:
|
|
||||||
ins &= 255; while ((((char *)cp - base) & ins)) *cp++ = 0x60000000;
|
|
||||||
break;
|
|
||||||
case DASM_REL_LG:
|
|
||||||
if (n < 0) {
|
|
||||||
n = (int)((ptrdiff_t)D->globals[-n-10] - (ptrdiff_t)cp);
|
|
||||||
goto patchrel;
|
|
||||||
}
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_REL_PC:
|
|
||||||
CK(n >= 0, UNDEF_PC);
|
|
||||||
n = *DASM_POS2PTR(D, n);
|
|
||||||
if (ins & 2048)
|
|
||||||
n = (n + (int)(size_t)base) & 0x0fffffff;
|
|
||||||
else
|
|
||||||
n = n - (int)((char *)cp - base);
|
|
||||||
patchrel: {
|
|
||||||
unsigned int e = 16 + ((ins >> 12) & 15);
|
|
||||||
CK((n & 3) == 0 &&
|
|
||||||
((n + ((ins & 2048) ? 0 : (1<<(e+1)))) >> (e+2)) == 0, RANGE_REL);
|
|
||||||
cp[-1] |= ((n>>2) & ((1<<e)-1));
|
|
||||||
}
|
|
||||||
break;
|
|
||||||
case DASM_LABEL_LG:
|
|
||||||
ins &= 2047; if (ins >= 20) D->globals[ins-20] = (void *)(base + n);
|
|
||||||
break;
|
|
||||||
case DASM_LABEL_PC: break;
|
|
||||||
case DASM_IMMS:
|
|
||||||
cp[-1] |= ((n>>3) & 4); n &= 0x1f;
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_IMM:
|
|
||||||
cp[-1] |= (n & ((1<<((ins>>5)&31))-1)) << (ins&31);
|
|
||||||
break;
|
|
||||||
default: *cp++ = ins; break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop: (void)0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (base + D->codesize != (char *)cp) /* Check for phase errors. */
|
|
||||||
return DASM_S_PHASE;
|
|
||||||
return DASM_S_OK;
|
|
||||||
}
|
|
||||||
#undef CK
|
|
||||||
|
|
||||||
/* Get PC label offset. */
|
|
||||||
int dasm_getpclabel(Dst_DECL, unsigned int pc)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
if (pc*sizeof(int) < D->pcsize) {
|
|
||||||
int pos = D->pclabels[pc];
|
|
||||||
if (pos < 0) return *DASM_POS2PTR(D, -pos);
|
|
||||||
if (pos > 0) return -1; /* Undefined. */
|
|
||||||
}
|
|
||||||
return -2; /* Unused or out of range. */
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
/* Optional sanity checker to call between isolated encoding steps. */
|
|
||||||
int dasm_checkstep(Dst_DECL, int secmatch)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
if (D->status == DASM_S_OK) {
|
|
||||||
int i;
|
|
||||||
for (i = 1; i <= 9; i++) {
|
|
||||||
if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_LG|i; break; }
|
|
||||||
D->lglabels[i] = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (D->status == DASM_S_OK && secmatch >= 0 &&
|
|
||||||
D->section != &D->sections[secmatch])
|
|
||||||
D->status = DASM_S_MATCH_SEC|(int)(D->section-D->sections);
|
|
||||||
return D->status;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
File diff suppressed because it is too large.
Load diff
@@ -1,12 +0,0 @@
|
|||||||
------------------------------------------------------------------------------
|
|
||||||
-- DynASM MIPS64 module.
|
|
||||||
--
|
|
||||||
-- Copyright (C) 2005-2023 Mike Pall. All rights reserved.
|
|
||||||
-- See dynasm.lua for full copyright notice.
|
|
||||||
------------------------------------------------------------------------------
|
|
||||||
-- This module just sets 64 bit mode for the combined MIPS/MIPS64 module.
|
|
||||||
-- All the interesting stuff is there.
|
|
||||||
------------------------------------------------------------------------------
|
|
||||||
|
|
||||||
mips64 = true -- Using a global is an ugly, but effective solution.
|
|
||||||
return require("dasm_mips")
|
|
||||||
@@ -1,418 +0,0 @@
|
|||||||
/*
|
|
||||||
** DynASM PPC/PPC64 encoding engine.
|
|
||||||
** Copyright (C) 2005-2023 Mike Pall. All rights reserved.
|
|
||||||
** Released under the MIT license. See dynasm.lua for full copyright notice.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <stddef.h>
|
|
||||||
#include <stdarg.h>
|
|
||||||
#include <string.h>
|
|
||||||
#include <stdlib.h>
|
|
||||||
|
|
||||||
#define DASM_ARCH "ppc"
|
|
||||||
|
|
||||||
#ifndef DASM_EXTERN
|
|
||||||
#define DASM_EXTERN(a,b,c,d) 0
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Action definitions. */
|
|
||||||
enum {
|
|
||||||
DASM_STOP, DASM_SECTION, DASM_ESC, DASM_REL_EXT,
|
|
||||||
/* The following actions need a buffer position. */
|
|
||||||
DASM_ALIGN, DASM_REL_LG, DASM_LABEL_LG,
|
|
||||||
/* The following actions also have an argument. */
|
|
||||||
DASM_REL_PC, DASM_LABEL_PC, DASM_IMM, DASM_IMMSH,
|
|
||||||
DASM__MAX
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Maximum number of section buffer positions for a single dasm_put() call. */
|
|
||||||
#define DASM_MAXSECPOS 25
|
|
||||||
|
|
||||||
/* DynASM encoder status codes. Action list offset or number are or'ed in. */
|
|
||||||
#define DASM_S_OK 0x00000000
|
|
||||||
#define DASM_S_NOMEM 0x01000000
|
|
||||||
#define DASM_S_PHASE 0x02000000
|
|
||||||
#define DASM_S_MATCH_SEC 0x03000000
|
|
||||||
#define DASM_S_RANGE_I 0x11000000
|
|
||||||
#define DASM_S_RANGE_SEC 0x12000000
|
|
||||||
#define DASM_S_RANGE_LG 0x13000000
|
|
||||||
#define DASM_S_RANGE_PC 0x14000000
|
|
||||||
#define DASM_S_RANGE_REL 0x15000000
|
|
||||||
#define DASM_S_UNDEF_LG 0x21000000
|
|
||||||
#define DASM_S_UNDEF_PC 0x22000000
|
|
||||||
|
|
||||||
/* Macros to convert positions (8 bit section + 24 bit index). */
|
|
||||||
#define DASM_POS2IDX(pos) ((pos)&0x00ffffff)
|
|
||||||
#define DASM_POS2BIAS(pos) ((pos)&0xff000000)
|
|
||||||
#define DASM_SEC2POS(sec) ((sec)<<24)
|
|
||||||
#define DASM_POS2SEC(pos) ((pos)>>24)
|
|
||||||
#define DASM_POS2PTR(D, pos) (D->sections[DASM_POS2SEC(pos)].rbuf + (pos))
|
|
||||||
|
|
||||||
/* Action list type. */
|
|
||||||
typedef const unsigned int *dasm_ActList;
|
|
||||||
|
|
||||||
/* Per-section structure. */
|
|
||||||
typedef struct dasm_Section {
|
|
||||||
int *rbuf; /* Biased buffer pointer (negative section bias). */
|
|
||||||
int *buf; /* True buffer pointer. */
|
|
||||||
size_t bsize; /* Buffer size in bytes. */
|
|
||||||
int pos; /* Biased buffer position. */
|
|
||||||
int epos; /* End of biased buffer position - max single put. */
|
|
||||||
int ofs; /* Byte offset into section. */
|
|
||||||
} dasm_Section;
|
|
||||||
|
|
||||||
/* Core structure holding the DynASM encoding state. */
|
|
||||||
struct dasm_State {
|
|
||||||
size_t psize; /* Allocated size of this structure. */
|
|
||||||
dasm_ActList actionlist; /* Current actionlist pointer. */
|
|
||||||
int *lglabels; /* Local/global chain/pos ptrs. */
|
|
||||||
size_t lgsize;
|
|
||||||
int *pclabels; /* PC label chains/pos ptrs. */
|
|
||||||
size_t pcsize;
|
|
||||||
void **globals; /* Array of globals. */
|
|
||||||
dasm_Section *section; /* Pointer to active section. */
|
|
||||||
size_t codesize; /* Total size of all code sections. */
|
|
||||||
int maxsection; /* 0 <= sectionidx < maxsection. */
|
|
||||||
int status; /* Status code. */
|
|
||||||
dasm_Section sections[1]; /* All sections. Alloc-extended. */
|
|
||||||
};
|
|
||||||
|
|
||||||
/* The size of the core structure depends on the max. number of sections. */
|
|
||||||
#define DASM_PSZ(ms) (sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))
|
|
||||||
|
|
||||||
|
|
||||||
/* Initialize DynASM state. */
|
|
||||||
void dasm_init(Dst_DECL, int maxsection)
|
|
||||||
{
|
|
||||||
dasm_State *D;
|
|
||||||
size_t psz = 0;
|
|
||||||
Dst_REF = NULL;
|
|
||||||
DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));
|
|
||||||
D = Dst_REF;
|
|
||||||
D->psize = psz;
|
|
||||||
D->lglabels = NULL;
|
|
||||||
D->lgsize = 0;
|
|
||||||
D->pclabels = NULL;
|
|
||||||
D->pcsize = 0;
|
|
||||||
D->globals = NULL;
|
|
||||||
D->maxsection = maxsection;
|
|
||||||
memset((void *)D->sections, 0, maxsection * sizeof(dasm_Section));
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Free DynASM state. */
|
|
||||||
void dasm_free(Dst_DECL)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int i;
|
|
||||||
for (i = 0; i < D->maxsection; i++)
|
|
||||||
if (D->sections[i].buf)
|
|
||||||
DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);
|
|
||||||
if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);
|
|
||||||
if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);
|
|
||||||
DASM_M_FREE(Dst, D, D->psize);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Setup global label array. Must be called before dasm_setup(). */
|
|
||||||
void dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
D->globals = gl;
|
|
||||||
DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Grow PC label array. Can be called after dasm_setup(), too. */
|
|
||||||
void dasm_growpc(Dst_DECL, unsigned int maxpc)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
size_t osz = D->pcsize;
|
|
||||||
DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));
|
|
||||||
memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Setup encoder. */
|
|
||||||
void dasm_setup(Dst_DECL, const void *actionlist)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int i;
|
|
||||||
D->actionlist = (dasm_ActList)actionlist;
|
|
||||||
D->status = DASM_S_OK;
|
|
||||||
D->section = &D->sections[0];
|
|
||||||
memset((void *)D->lglabels, 0, D->lgsize);
|
|
||||||
if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);
|
|
||||||
for (i = 0; i < D->maxsection; i++) {
|
|
||||||
D->sections[i].pos = DASM_SEC2POS(i);
|
|
||||||
D->sections[i].rbuf = D->sections[i].buf - D->sections[i].pos;
|
|
||||||
D->sections[i].ofs = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
#define CK(x, st) \
|
|
||||||
do { if (!(x)) { \
|
|
||||||
D->status = DASM_S_##st|(p-D->actionlist-1); return; } } while (0)
|
|
||||||
#define CKPL(kind, st) \
|
|
||||||
do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \
|
|
||||||
D->status = DASM_S_RANGE_##st|(p-D->actionlist-1); return; } } while (0)
|
|
||||||
#else
|
|
||||||
#define CK(x, st) ((void)0)
|
|
||||||
#define CKPL(kind, st) ((void)0)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */
|
|
||||||
void dasm_put(Dst_DECL, int start, ...)
|
|
||||||
{
|
|
||||||
va_list ap;
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
dasm_ActList p = D->actionlist + start;
|
|
||||||
dasm_Section *sec = D->section;
|
|
||||||
int pos = sec->pos, ofs = sec->ofs;
|
|
||||||
int *b;
|
|
||||||
|
|
||||||
if (pos >= sec->epos) {
|
|
||||||
DASM_M_GROW(Dst, int, sec->buf, sec->bsize,
|
|
||||||
sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));
|
|
||||||
sec->rbuf = sec->buf - DASM_POS2BIAS(pos);
|
|
||||||
sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);
|
|
||||||
}
|
|
||||||
|
|
||||||
b = sec->rbuf;
|
|
||||||
b[pos++] = start;
|
|
||||||
|
|
||||||
va_start(ap, start);
|
|
||||||
while (1) {
|
|
||||||
unsigned int ins = *p++;
|
|
||||||
unsigned int action = (ins >> 16);
|
|
||||||
if (action >= DASM__MAX) {
|
|
||||||
ofs += 4;
|
|
||||||
} else {
|
|
||||||
int *pl, n = action >= DASM_REL_PC ? va_arg(ap, int) : 0;
|
|
||||||
switch (action) {
|
|
||||||
case DASM_STOP: goto stop;
|
|
||||||
case DASM_SECTION:
|
|
||||||
n = (ins & 255); CK(n < D->maxsection, RANGE_SEC);
|
|
||||||
D->section = &D->sections[n]; goto stop;
|
|
||||||
case DASM_ESC: p++; ofs += 4; break;
|
|
||||||
case DASM_REL_EXT: break;
|
|
||||||
case DASM_ALIGN: ofs += (ins & 255); b[pos++] = ofs; break;
|
|
||||||
case DASM_REL_LG:
|
|
||||||
n = (ins & 2047) - 10; pl = D->lglabels + n;
|
|
||||||
/* Bkwd rel or global. */
|
|
||||||
if (n >= 0) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }
|
|
||||||
pl += 10; n = *pl;
|
|
||||||
if (n < 0) n = 0; /* Start new chain for fwd rel if label exists. */
|
|
||||||
goto linkrel;
|
|
||||||
case DASM_REL_PC:
|
|
||||||
pl = D->pclabels + n; CKPL(pc, PC);
|
|
||||||
putrel:
|
|
||||||
n = *pl;
|
|
||||||
if (n < 0) { /* Label exists. Get label pos and store it. */
|
|
||||||
b[pos] = -n;
|
|
||||||
} else {
|
|
||||||
linkrel:
|
|
||||||
b[pos] = n; /* Else link to rel chain, anchored at label. */
|
|
||||||
*pl = pos;
|
|
||||||
}
|
|
||||||
pos++;
|
|
||||||
break;
|
|
||||||
case DASM_LABEL_LG:
|
|
||||||
pl = D->lglabels + (ins & 2047) - 10; CKPL(lg, LG); goto putlabel;
|
|
||||||
case DASM_LABEL_PC:
|
|
||||||
pl = D->pclabels + n; CKPL(pc, PC);
|
|
||||||
putlabel:
|
|
||||||
n = *pl; /* n > 0: Collapse rel chain and replace with label pos. */
|
|
||||||
while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos;
|
|
||||||
}
|
|
||||||
*pl = -pos; /* Label exists now. */
|
|
||||||
b[pos++] = ofs; /* Store pass1 offset estimate. */
|
|
||||||
break;
|
|
||||||
case DASM_IMM:
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
CK((n & ((1<<((ins>>10)&31))-1)) == 0, RANGE_I);
|
|
||||||
#endif
|
|
||||||
n >>= ((ins>>10)&31);
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
if (ins & 0x8000)
|
|
||||||
CK(((n + (1<<(((ins>>5)&31)-1)))>>((ins>>5)&31)) == 0, RANGE_I);
|
|
||||||
else
|
|
||||||
CK((n>>((ins>>5)&31)) == 0, RANGE_I);
|
|
||||||
#endif
|
|
||||||
b[pos++] = n;
|
|
||||||
break;
|
|
||||||
case DASM_IMMSH:
|
|
||||||
CK((n >> 6) == 0, RANGE_I);
|
|
||||||
b[pos++] = n;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop:
|
|
||||||
va_end(ap);
|
|
||||||
sec->pos = pos;
|
|
||||||
sec->ofs = ofs;
|
|
||||||
}
|
|
||||||
#undef CK
|
|
||||||
|
|
||||||
/* Pass 2: Link sections, shrink aligns, fix label offsets. */
|
|
||||||
int dasm_link(Dst_DECL, size_t *szp)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int secnum;
|
|
||||||
int ofs = 0;
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
*szp = 0;
|
|
||||||
if (D->status != DASM_S_OK) return D->status;
|
|
||||||
{
|
|
||||||
int pc;
|
|
||||||
for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)
|
|
||||||
if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
{ /* Handle globals not defined in this translation unit. */
|
|
||||||
int idx;
|
|
||||||
for (idx = 10; idx*sizeof(int) < D->lgsize; idx++) {
|
|
||||||
int n = D->lglabels[idx];
|
|
||||||
/* Undefined label: Collapse rel chain and replace with marker (< 0). */
|
|
||||||
while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Combine all code sections. No support for data sections (yet). */
|
|
||||||
for (secnum = 0; secnum < D->maxsection; secnum++) {
|
|
||||||
dasm_Section *sec = D->sections + secnum;
|
|
||||||
int *b = sec->rbuf;
|
|
||||||
int pos = DASM_SEC2POS(secnum);
|
|
||||||
int lastpos = sec->pos;
|
|
||||||
|
|
||||||
while (pos != lastpos) {
|
|
||||||
dasm_ActList p = D->actionlist + b[pos++];
|
|
||||||
while (1) {
|
|
||||||
unsigned int ins = *p++;
|
|
||||||
unsigned int action = (ins >> 16);
|
|
||||||
switch (action) {
|
|
||||||
case DASM_STOP: case DASM_SECTION: goto stop;
|
|
||||||
case DASM_ESC: p++; break;
|
|
||||||
case DASM_REL_EXT: break;
|
|
||||||
case DASM_ALIGN: ofs -= (b[pos++] + ofs) & (ins & 255); break;
|
|
||||||
case DASM_REL_LG: case DASM_REL_PC: pos++; break;
|
|
||||||
case DASM_LABEL_LG: case DASM_LABEL_PC: b[pos++] += ofs; break;
|
|
||||||
case DASM_IMM: case DASM_IMMSH: pos++; break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop: (void)0;
|
|
||||||
}
|
|
||||||
ofs += sec->ofs; /* Next section starts right after current section. */
|
|
||||||
}
|
|
||||||
|
|
||||||
D->codesize = ofs; /* Total size of all code sections */
|
|
||||||
*szp = ofs;
|
|
||||||
return DASM_S_OK;
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
#define CK(x, st) \
|
|
||||||
do { if (!(x)) return DASM_S_##st|(p-D->actionlist-1); } while (0)
|
|
||||||
#else
|
|
||||||
#define CK(x, st) ((void)0)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Pass 3: Encode sections. */
|
|
||||||
int dasm_encode(Dst_DECL, void *buffer)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
char *base = (char *)buffer;
|
|
||||||
unsigned int *cp = (unsigned int *)buffer;
|
|
||||||
int secnum;
|
|
||||||
|
|
||||||
/* Encode all code sections. No support for data sections (yet). */
|
|
||||||
for (secnum = 0; secnum < D->maxsection; secnum++) {
|
|
||||||
dasm_Section *sec = D->sections + secnum;
|
|
||||||
int *b = sec->buf;
|
|
||||||
int *endb = sec->rbuf + sec->pos;
|
|
||||||
|
|
||||||
while (b != endb) {
|
|
||||||
dasm_ActList p = D->actionlist + *b++;
|
|
||||||
while (1) {
|
|
||||||
unsigned int ins = *p++;
|
|
||||||
unsigned int action = (ins >> 16);
|
|
||||||
int n = (action >= DASM_ALIGN && action < DASM__MAX) ? *b++ : 0;
|
|
||||||
switch (action) {
|
|
||||||
case DASM_STOP: case DASM_SECTION: goto stop;
|
|
||||||
case DASM_ESC: *cp++ = *p++; break;
|
|
||||||
case DASM_REL_EXT:
|
|
||||||
n = DASM_EXTERN(Dst, (unsigned char *)cp, (ins & 2047), 1) - 4;
|
|
||||||
goto patchrel;
|
|
||||||
case DASM_ALIGN:
|
|
||||||
ins &= 255; while ((((char *)cp - base) & ins)) *cp++ = 0x60000000;
|
|
||||||
break;
|
|
||||||
case DASM_REL_LG:
|
|
||||||
if (n < 0) {
|
|
||||||
n = (int)((ptrdiff_t)D->globals[-n-10] - (ptrdiff_t)cp);
|
|
||||||
goto patchrel;
|
|
||||||
}
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_REL_PC:
|
|
||||||
CK(n >= 0, UNDEF_PC);
|
|
||||||
n = *DASM_POS2PTR(D, n) - (int)((char *)cp - base);
|
|
||||||
patchrel:
|
|
||||||
CK((n & 3) == 0 &&
|
|
||||||
(((n+4) + ((ins & 2048) ? 0x00008000 : 0x02000000)) >>
|
|
||||||
((ins & 2048) ? 16 : 26)) == 0, RANGE_REL);
|
|
||||||
cp[-1] |= ((n+4) & ((ins & 2048) ? 0x0000fffc: 0x03fffffc));
|
|
||||||
break;
|
|
||||||
case DASM_LABEL_LG:
|
|
||||||
ins &= 2047; if (ins >= 20) D->globals[ins-20] = (void *)(base + n);
|
|
||||||
break;
|
|
||||||
case DASM_LABEL_PC: break;
|
|
||||||
case DASM_IMM:
|
|
||||||
cp[-1] |= (n & ((1<<((ins>>5)&31))-1)) << (ins&31);
|
|
||||||
break;
|
|
||||||
case DASM_IMMSH:
|
|
||||||
cp[-1] |= (ins & 1) ? ((n&31)<<11)|((n&32)>>4) : ((n&31)<<6)|(n&32);
|
|
||||||
break;
|
|
||||||
default: *cp++ = ins; break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop: (void)0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (base + D->codesize != (char *)cp) /* Check for phase errors. */
|
|
||||||
return DASM_S_PHASE;
|
|
||||||
return DASM_S_OK;
|
|
||||||
}
|
|
||||||
#undef CK
|
|
||||||
|
|
||||||
/* Get PC label offset. */
|
|
||||||
int dasm_getpclabel(Dst_DECL, unsigned int pc)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
if (pc*sizeof(int) < D->pcsize) {
|
|
||||||
int pos = D->pclabels[pc];
|
|
||||||
if (pos < 0) return *DASM_POS2PTR(D, -pos);
|
|
||||||
if (pos > 0) return -1; /* Undefined. */
|
|
||||||
}
|
|
||||||
return -2; /* Unused or out of range. */
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
/* Optional sanity checker to call between isolated encoding steps. */
|
|
||||||
int dasm_checkstep(Dst_DECL, int secmatch)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
if (D->status == DASM_S_OK) {
|
|
||||||
int i;
|
|
||||||
for (i = 1; i <= 9; i++) {
|
|
||||||
if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_LG|i; break; }
|
|
||||||
D->lglabels[i] = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (D->status == DASM_S_OK && secmatch >= 0 &&
|
|
||||||
D->section != &D->sections[secmatch])
|
|
||||||
D->status = DASM_S_MATCH_SEC|(D->section-D->sections);
|
|
||||||
return D->status;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
File diff suppressed because it is too large.
Load diff
@@ -1,83 +0,0 @@
|
|||||||
/*
|
|
||||||
** DynASM encoding engine prototypes.
|
|
||||||
** Copyright (C) 2005-2023 Mike Pall. All rights reserved.
|
|
||||||
** Released under the MIT license. See dynasm.lua for full copyright notice.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef _DASM_PROTO_H
|
|
||||||
#define _DASM_PROTO_H
|
|
||||||
|
|
||||||
#include <stddef.h>
|
|
||||||
#include <stdarg.h>
|
|
||||||
|
|
||||||
#define DASM_IDENT "DynASM 1.5.0"
|
|
||||||
#define DASM_VERSION 10500 /* 1.5.0 */
|
|
||||||
|
|
||||||
#ifndef Dst_DECL
|
|
||||||
#define Dst_DECL dasm_State **Dst
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef Dst_REF
|
|
||||||
#define Dst_REF (*Dst)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef DASM_FDEF
|
|
||||||
#define DASM_FDEF extern
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef DASM_M_GROW
|
|
||||||
#define DASM_M_GROW(ctx, t, p, sz, need) \
|
|
||||||
do { \
|
|
||||||
size_t _sz = (sz), _need = (need); \
|
|
||||||
if (_sz < _need) { \
|
|
||||||
if (_sz < 16) _sz = 16; \
|
|
||||||
while (_sz < _need) _sz += _sz; \
|
|
||||||
(p) = (t *)realloc((p), _sz); \
|
|
||||||
if ((p) == NULL) exit(1); \
|
|
||||||
(sz) = _sz; \
|
|
||||||
} \
|
|
||||||
} while(0)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef DASM_M_FREE
|
|
||||||
#define DASM_M_FREE(ctx, p, sz) free(p)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Internal DynASM encoder state. */
|
|
||||||
typedef struct dasm_State dasm_State;
|
|
||||||
|
|
||||||
|
|
||||||
/* Initialize and free DynASM state. */
|
|
||||||
DASM_FDEF void dasm_init(Dst_DECL, int maxsection);
|
|
||||||
DASM_FDEF void dasm_free(Dst_DECL);
|
|
||||||
|
|
||||||
/* Setup global array. Must be called before dasm_setup(). */
|
|
||||||
DASM_FDEF void dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl);
|
|
||||||
|
|
||||||
/* Grow PC label array. Can be called after dasm_setup(), too. */
|
|
||||||
DASM_FDEF void dasm_growpc(Dst_DECL, unsigned int maxpc);
|
|
||||||
|
|
||||||
/* Setup encoder. */
|
|
||||||
DASM_FDEF void dasm_setup(Dst_DECL, const void *actionlist);
|
|
||||||
|
|
||||||
/* Feed encoder with actions. Calls are generated by pre-processor. */
|
|
||||||
DASM_FDEF void dasm_put(Dst_DECL, int start, ...);
|
|
||||||
|
|
||||||
/* Link sections and return the resulting size. */
|
|
||||||
DASM_FDEF int dasm_link(Dst_DECL, size_t *szp);
|
|
||||||
|
|
||||||
/* Encode sections into buffer. */
|
|
||||||
DASM_FDEF int dasm_encode(Dst_DECL, void *buffer);
|
|
||||||
|
|
||||||
/* Get PC label offset. */
|
|
||||||
DASM_FDEF int dasm_getpclabel(Dst_DECL, unsigned int pc);
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
/* Optional sanity checker to call between isolated encoding steps. */
|
|
||||||
DASM_FDEF int dasm_checkstep(Dst_DECL, int secmatch);
|
|
||||||
#else
|
|
||||||
#define dasm_checkstep(a, b) 0
|
|
||||||
#endif
|
|
||||||
|
|
||||||
|
|
||||||
#endif /* _DASM_PROTO_H */
|
|
||||||
@@ -1,12 +0,0 @@
|
|||||||
------------------------------------------------------------------------------
|
|
||||||
-- DynASM x64 module.
|
|
||||||
--
|
|
||||||
-- Copyright (C) 2005-2023 Mike Pall. All rights reserved.
|
|
||||||
-- See dynasm.lua for full copyright notice.
|
|
||||||
------------------------------------------------------------------------------
|
|
||||||
-- This module just sets 64 bit mode for the combined x86/x64 module.
|
|
||||||
-- All the interesting stuff is there.
|
|
||||||
------------------------------------------------------------------------------
|
|
||||||
|
|
||||||
x64 = true -- Using a global is an ugly, but effective solution.
|
|
||||||
return require("dasm_x86")
|
|
||||||
@@ -1,523 +0,0 @@
|
|||||||
/*
|
|
||||||
** DynASM x86 encoding engine.
|
|
||||||
** Copyright (C) 2005-2023 Mike Pall. All rights reserved.
|
|
||||||
** Released under the MIT license. See dynasm.lua for full copyright notice.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <stddef.h>
|
|
||||||
#include <stdarg.h>
|
|
||||||
#include <string.h>
|
|
||||||
#include <stdlib.h>
|
|
||||||
|
|
||||||
#define DASM_ARCH "x86"
|
|
||||||
|
|
||||||
#ifndef DASM_EXTERN
|
|
||||||
#define DASM_EXTERN(a,b,c,d) 0
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Action definitions. DASM_STOP must be 255. */
|
|
||||||
enum {
|
|
||||||
DASM_DISP = 233,
|
|
||||||
DASM_IMM_S, DASM_IMM_B, DASM_IMM_W, DASM_IMM_D, DASM_IMM_WB, DASM_IMM_DB,
|
|
||||||
DASM_VREG, DASM_SPACE, DASM_SETLABEL, DASM_REL_A, DASM_REL_LG, DASM_REL_PC,
|
|
||||||
DASM_IMM_LG, DASM_IMM_PC, DASM_LABEL_LG, DASM_LABEL_PC, DASM_ALIGN,
|
|
||||||
DASM_EXTERN, DASM_ESC, DASM_MARK, DASM_SECTION, DASM_STOP
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Maximum number of section buffer positions for a single dasm_put() call. */
|
|
||||||
#define DASM_MAXSECPOS 25
|
|
||||||
|
|
||||||
/* DynASM encoder status codes. Action list offset or number are or'ed in. */
|
|
||||||
#define DASM_S_OK 0x00000000
|
|
||||||
#define DASM_S_NOMEM 0x01000000
|
|
||||||
#define DASM_S_PHASE 0x02000000
|
|
||||||
#define DASM_S_MATCH_SEC 0x03000000
|
|
||||||
#define DASM_S_RANGE_I 0x11000000
|
|
||||||
#define DASM_S_RANGE_SEC 0x12000000
|
|
||||||
#define DASM_S_RANGE_LG 0x13000000
|
|
||||||
#define DASM_S_RANGE_PC 0x14000000
|
|
||||||
#define DASM_S_RANGE_VREG 0x15000000
|
|
||||||
#define DASM_S_UNDEF_L 0x21000000
|
|
||||||
#define DASM_S_UNDEF_PC 0x22000000
|
|
||||||
|
|
||||||
/* Macros to convert positions (8 bit section + 24 bit index). */
|
|
||||||
#define DASM_POS2IDX(pos) ((pos)&0x00ffffff)
|
|
||||||
#define DASM_POS2BIAS(pos) ((pos)&0xff000000)
|
|
||||||
#define DASM_SEC2POS(sec) ((sec)<<24)
|
|
||||||
#define DASM_POS2SEC(pos) ((pos)>>24)
|
|
||||||
#define DASM_POS2PTR(D, pos) (D->sections[DASM_POS2SEC(pos)].rbuf + (pos))
|
|
||||||
|
|
||||||
/* Action list type. */
|
|
||||||
typedef const unsigned char *dasm_ActList;
|
|
||||||
|
|
||||||
/* Per-section structure. */
|
|
||||||
typedef struct dasm_Section {
|
|
||||||
int *rbuf; /* Biased buffer pointer (negative section bias). */
|
|
||||||
int *buf; /* True buffer pointer. */
|
|
||||||
size_t bsize; /* Buffer size in bytes. */
|
|
||||||
int pos; /* Biased buffer position. */
|
|
||||||
int epos; /* End of biased buffer position - max single put. */
|
|
||||||
int ofs; /* Byte offset into section. */
|
|
||||||
} dasm_Section;
|
|
||||||
|
|
||||||
/* Core structure holding the DynASM encoding state. */
|
|
||||||
struct dasm_State {
|
|
||||||
size_t psize; /* Allocated size of this structure. */
|
|
||||||
dasm_ActList actionlist; /* Current actionlist pointer. */
|
|
||||||
int *lglabels; /* Local/global chain/pos ptrs. */
|
|
||||||
size_t lgsize;
|
|
||||||
int *pclabels; /* PC label chains/pos ptrs. */
|
|
||||||
size_t pcsize;
|
|
||||||
void **globals; /* Array of globals. */
|
|
||||||
dasm_Section *section; /* Pointer to active section. */
|
|
||||||
size_t codesize; /* Total size of all code sections. */
|
|
||||||
int maxsection; /* 0 <= sectionidx < maxsection. */
|
|
||||||
int status; /* Status code. */
|
|
||||||
dasm_Section sections[1]; /* All sections. Alloc-extended. */
|
|
||||||
};
|
|
||||||
|
|
||||||
/* The size of the core structure depends on the max. number of sections. */
|
|
||||||
#define DASM_PSZ(ms) (sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))
|
|
||||||
|
|
||||||
|
|
||||||
/* Initialize DynASM state. */
|
|
||||||
void dasm_init(Dst_DECL, int maxsection)
|
|
||||||
{
|
|
||||||
dasm_State *D;
|
|
||||||
size_t psz = 0;
|
|
||||||
Dst_REF = NULL;
|
|
||||||
DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));
|
|
||||||
D = Dst_REF;
|
|
||||||
D->psize = psz;
|
|
||||||
D->lglabels = NULL;
|
|
||||||
D->lgsize = 0;
|
|
||||||
D->pclabels = NULL;
|
|
||||||
D->pcsize = 0;
|
|
||||||
D->globals = NULL;
|
|
||||||
D->maxsection = maxsection;
|
|
||||||
memset((void *)D->sections, 0, maxsection * sizeof(dasm_Section));
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Free DynASM state. */
|
|
||||||
void dasm_free(Dst_DECL)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int i;
|
|
||||||
for (i = 0; i < D->maxsection; i++)
|
|
||||||
if (D->sections[i].buf)
|
|
||||||
DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);
|
|
||||||
if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);
|
|
||||||
if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);
|
|
||||||
DASM_M_FREE(Dst, D, D->psize);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Setup global label array. Must be called before dasm_setup(). */
|
|
||||||
void dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
D->globals = gl;
|
|
||||||
DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Grow PC label array. Can be called after dasm_setup(), too. */
|
|
||||||
void dasm_growpc(Dst_DECL, unsigned int maxpc)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
size_t osz = D->pcsize;
|
|
||||||
DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));
|
|
||||||
memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Setup encoder. */
|
|
||||||
void dasm_setup(Dst_DECL, const void *actionlist)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int i;
|
|
||||||
D->actionlist = (dasm_ActList)actionlist;
|
|
||||||
D->status = DASM_S_OK;
|
|
||||||
D->section = &D->sections[0];
|
|
||||||
memset((void *)D->lglabels, 0, D->lgsize);
|
|
||||||
if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);
|
|
||||||
for (i = 0; i < D->maxsection; i++) {
|
|
||||||
D->sections[i].pos = DASM_SEC2POS(i);
|
|
||||||
D->sections[i].rbuf = D->sections[i].buf - D->sections[i].pos;
|
|
||||||
D->sections[i].ofs = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
#define CK(x, st) \
|
|
||||||
do { if (!(x)) { \
|
|
||||||
D->status = DASM_S_##st|(int)(p-D->actionlist-1); return; } } while (0)
|
|
||||||
#define CKPL(kind, st) \
|
|
||||||
do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \
|
|
||||||
D->status=DASM_S_RANGE_##st|(int)(p-D->actionlist-1); return; } } while (0)
|
|
||||||
#else
|
|
||||||
#define CK(x, st) ((void)0)
|
|
||||||
#define CKPL(kind, st) ((void)0)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */
|
|
||||||
void dasm_put(Dst_DECL, int start, ...)
|
|
||||||
{
|
|
||||||
va_list ap;
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
dasm_ActList p = D->actionlist + start;
|
|
||||||
dasm_Section *sec = D->section;
|
|
||||||
int pos = sec->pos, ofs = sec->ofs, mrm = -1;
|
|
||||||
int *b;
|
|
||||||
|
|
||||||
if (pos >= sec->epos) {
|
|
||||||
DASM_M_GROW(Dst, int, sec->buf, sec->bsize,
|
|
||||||
sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));
|
|
||||||
sec->rbuf = sec->buf - DASM_POS2BIAS(pos);
|
|
||||||
sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);
|
|
||||||
}
|
|
||||||
|
|
||||||
b = sec->rbuf;
|
|
||||||
b[pos++] = start;
|
|
||||||
|
|
||||||
va_start(ap, start);
|
|
||||||
while (1) {
|
|
||||||
int action = *p++;
|
|
||||||
if (action < DASM_DISP) {
|
|
||||||
ofs++;
|
|
||||||
} else if (action <= DASM_REL_A) {
|
|
||||||
int n = va_arg(ap, int);
|
|
||||||
b[pos++] = n;
|
|
||||||
switch (action) {
|
|
||||||
case DASM_DISP:
|
|
||||||
if (n == 0) { if (mrm < 0) mrm = p[-2]; if ((mrm&7) != 5) break; }
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_IMM_DB: if (((n+128)&-256) == 0) goto ob; /* fallthrough */
|
|
||||||
case DASM_REL_A: /* Assumes ptrdiff_t is int. !x64 */
|
|
||||||
case DASM_IMM_D: ofs += 4; break;
|
|
||||||
case DASM_IMM_S: CK(((n+128)&-256) == 0, RANGE_I); goto ob;
|
|
||||||
case DASM_IMM_B: CK((n&-256) == 0, RANGE_I); ob: ofs++; break;
|
|
||||||
case DASM_IMM_WB: if (((n+128)&-256) == 0) goto ob; /* fallthrough */
|
|
||||||
case DASM_IMM_W: CK((n&-65536) == 0, RANGE_I); ofs += 2; break;
|
|
||||||
case DASM_SPACE: p++; ofs += n; break;
|
|
||||||
case DASM_SETLABEL: b[pos-2] = -0x40000000; break; /* Neg. label ofs. */
|
|
||||||
case DASM_VREG: CK((n&-16) == 0 && (n != 4 || (*p>>5) != 2), RANGE_VREG);
|
|
||||||
if (*p < 0x40 && p[1] == DASM_DISP) mrm = n;
|
|
||||||
if (*p < 0x20 && (n&7) == 4) ofs++;
|
|
||||||
switch ((*p++ >> 3) & 3) {
|
|
||||||
case 3: n |= b[pos-3]; /* fallthrough */
|
|
||||||
case 2: n |= b[pos-2]; /* fallthrough */
|
|
||||||
case 1: if (n <= 7) { b[pos-1] |= 0x10; ofs--; }
|
|
||||||
}
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
mrm = -1;
|
|
||||||
} else {
|
|
||||||
int *pl, n;
|
|
||||||
switch (action) {
|
|
||||||
case DASM_REL_LG:
|
|
||||||
case DASM_IMM_LG:
|
|
||||||
n = *p++; pl = D->lglabels + n;
|
|
||||||
/* Bkwd rel or global. */
|
|
||||||
if (n <= 246) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }
|
|
||||||
pl -= 246; n = *pl;
|
|
||||||
if (n < 0) n = 0; /* Start new chain for fwd rel if label exists. */
|
|
||||||
goto linkrel;
|
|
||||||
case DASM_REL_PC:
|
|
||||||
case DASM_IMM_PC: pl = D->pclabels + va_arg(ap, int); CKPL(pc, PC);
|
|
||||||
putrel:
|
|
||||||
n = *pl;
|
|
||||||
if (n < 0) { /* Label exists. Get label pos and store it. */
|
|
||||||
b[pos] = -n;
|
|
||||||
} else {
|
|
||||||
linkrel:
|
|
||||||
b[pos] = n; /* Else link to rel chain, anchored at label. */
|
|
||||||
*pl = pos;
|
|
||||||
}
|
|
||||||
pos++;
|
|
||||||
ofs += 4; /* Maximum offset needed. */
|
|
||||||
if (action == DASM_REL_LG || action == DASM_REL_PC) {
|
|
||||||
b[pos++] = ofs; /* Store pass1 offset estimate. */
|
|
||||||
} else if (sizeof(ptrdiff_t) == 8) {
|
|
||||||
ofs += 4;
|
|
||||||
}
|
|
||||||
break;
|
|
||||||
case DASM_LABEL_LG: pl = D->lglabels + *p++; CKPL(lg, LG); goto putlabel;
|
|
||||||
case DASM_LABEL_PC: pl = D->pclabels + va_arg(ap, int); CKPL(pc, PC);
|
|
||||||
putlabel:
|
|
||||||
n = *pl; /* n > 0: Collapse rel chain and replace with label pos. */
|
|
||||||
while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos; }
|
|
||||||
*pl = -pos; /* Label exists now. */
|
|
||||||
b[pos++] = ofs; /* Store pass1 offset estimate. */
|
|
||||||
break;
|
|
||||||
case DASM_ALIGN:
|
|
||||||
ofs += *p++; /* Maximum alignment needed (arg is 2**n-1). */
|
|
||||||
b[pos++] = ofs; /* Store pass1 offset estimate. */
|
|
||||||
break;
|
|
||||||
case DASM_EXTERN: p += 2; ofs += 4; break;
|
|
||||||
case DASM_ESC: p++; ofs++; break;
|
|
||||||
case DASM_MARK: mrm = p[-2]; break;
|
|
||||||
case DASM_SECTION:
|
|
||||||
n = *p; CK(n < D->maxsection, RANGE_SEC); D->section = &D->sections[n];
|
|
||||||
case DASM_STOP: goto stop;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop:
|
|
||||||
va_end(ap);
|
|
||||||
sec->pos = pos;
|
|
||||||
sec->ofs = ofs;
|
|
||||||
}
|
|
||||||
#undef CK
|
|
||||||
|
|
||||||
/* Pass 2: Link sections, shrink branches/aligns, fix label offsets. */
|
|
||||||
int dasm_link(Dst_DECL, size_t *szp)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
int secnum;
|
|
||||||
int ofs = 0;
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
*szp = 0;
|
|
||||||
if (D->status != DASM_S_OK) return D->status;
|
|
||||||
{
|
|
||||||
int pc;
|
|
||||||
for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)
|
|
||||||
if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
{ /* Handle globals not defined in this translation unit. */
|
|
||||||
int idx;
|
|
||||||
for (idx = 10; idx*sizeof(int) < D->lgsize; idx++) {
|
|
||||||
int n = D->lglabels[idx];
|
|
||||||
/* Undefined label: Collapse rel chain and replace with marker (< 0). */
|
|
||||||
while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Combine all code sections. No support for data sections (yet). */
|
|
||||||
for (secnum = 0; secnum < D->maxsection; secnum++) {
|
|
||||||
dasm_Section *sec = D->sections + secnum;
|
|
||||||
int *b = sec->rbuf;
|
|
||||||
int pos = DASM_SEC2POS(secnum);
|
|
||||||
int lastpos = sec->pos;
|
|
||||||
|
|
||||||
while (pos != lastpos) {
|
|
||||||
dasm_ActList p = D->actionlist + b[pos++];
|
|
||||||
int op = 0;
|
|
||||||
while (1) {
|
|
||||||
int action = *p++;
|
|
||||||
switch (action) {
|
|
||||||
case DASM_REL_LG: p++;
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_REL_PC: {
|
|
||||||
int shrink = op == 0xe9 ? 3 : ((op&0xf0) == 0x80 ? 4 : 0);
|
|
||||||
if (shrink) { /* Shrinkable branch opcode? */
|
|
||||||
int lofs, lpos = b[pos];
|
|
||||||
if (lpos < 0) goto noshrink; /* Ext global? */
|
|
||||||
lofs = *DASM_POS2PTR(D, lpos);
|
|
||||||
if (lpos > pos) { /* Fwd label: add cumulative section offsets. */
|
|
||||||
int i;
|
|
||||||
for (i = secnum; i < DASM_POS2SEC(lpos); i++)
|
|
||||||
lofs += D->sections[i].ofs;
|
|
||||||
} else {
|
|
||||||
lofs -= ofs; /* Bkwd label: unfix offset. */
|
|
||||||
}
|
|
||||||
lofs -= b[pos+1]; /* Short branch ok? */
|
|
||||||
if (lofs >= -128-shrink && lofs <= 127) ofs -= shrink; /* Yes. */
|
|
||||||
else { noshrink: shrink = 0; } /* No, cannot shrink op. */
|
|
||||||
}
|
|
||||||
b[pos+1] = shrink;
|
|
||||||
pos += 2;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_SPACE: case DASM_IMM_LG: case DASM_VREG: p++;
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_DISP: case DASM_IMM_S: case DASM_IMM_B: case DASM_IMM_W:
|
|
||||||
case DASM_IMM_D: case DASM_IMM_WB: case DASM_IMM_DB:
|
|
||||||
case DASM_SETLABEL: case DASM_REL_A: case DASM_IMM_PC: pos++; break;
|
|
||||||
case DASM_LABEL_LG: p++;
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_LABEL_PC: b[pos++] += ofs; break; /* Fix label offset. */
|
|
||||||
case DASM_ALIGN: ofs -= (b[pos++]+ofs)&*p++; break; /* Adjust ofs. */
|
|
||||||
case DASM_EXTERN: p += 2; break;
|
|
||||||
case DASM_ESC: op = *p++; break;
|
|
||||||
case DASM_MARK: break;
|
|
||||||
case DASM_SECTION: case DASM_STOP: goto stop;
|
|
||||||
default: op = action; break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop: (void)0;
|
|
||||||
}
|
|
||||||
ofs += sec->ofs; /* Next section starts right after current section. */
|
|
||||||
}
|
|
||||||
|
|
||||||
D->codesize = ofs; /* Total size of all code sections */
|
|
||||||
*szp = ofs;
|
|
||||||
return DASM_S_OK;
|
|
||||||
}
|
|
||||||
|
|
||||||
#define dasmb(x) *cp++ = (unsigned char)(x)
|
|
||||||
#ifndef DASM_ALIGNED_WRITES
|
|
||||||
#define dasmw(x) \
|
|
||||||
do { *((unsigned short *)cp) = (unsigned short)(x); cp+=2; } while (0)
|
|
||||||
#define dasmd(x) \
|
|
||||||
do { *((unsigned int *)cp) = (unsigned int)(x); cp+=4; } while (0)
|
|
||||||
#define dasmq(x) \
|
|
||||||
do { *((unsigned long long *)cp) = (unsigned long long)(x); cp+=8; } while (0)
|
|
||||||
#else
|
|
||||||
#define dasmw(x) do { dasmb(x); dasmb((x)>>8); } while (0)
|
|
||||||
#define dasmd(x) do { dasmw(x); dasmw((x)>>16); } while (0)
|
|
||||||
#define dasmq(x) do { dasmd(x); dasmd((x)>>32); } while (0)
|
|
||||||
#endif
|
|
||||||
static unsigned char *dasma_(unsigned char *cp, ptrdiff_t x)
|
|
||||||
{
|
|
||||||
if (sizeof(ptrdiff_t) == 8)
|
|
||||||
dasmq((unsigned long long)x);
|
|
||||||
else
|
|
||||||
dasmd((unsigned int)x);
|
|
||||||
return cp;
|
|
||||||
}
|
|
||||||
#define dasma(x) (cp = dasma_(cp, (x)))
|
|
||||||
|
|
||||||
/* Pass 3: Encode sections. */
|
|
||||||
int dasm_encode(Dst_DECL, void *buffer)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
unsigned char *base = (unsigned char *)buffer;
|
|
||||||
unsigned char *cp = base;
|
|
||||||
int secnum;
|
|
||||||
|
|
||||||
/* Encode all code sections. No support for data sections (yet). */
|
|
||||||
for (secnum = 0; secnum < D->maxsection; secnum++) {
|
|
||||||
dasm_Section *sec = D->sections + secnum;
|
|
||||||
int *b = sec->buf;
|
|
||||||
int *endb = sec->rbuf + sec->pos;
|
|
||||||
|
|
||||||
while (b != endb) {
|
|
||||||
dasm_ActList p = D->actionlist + *b++;
|
|
||||||
unsigned char *mark = NULL;
|
|
||||||
while (1) {
|
|
||||||
int action = *p++;
|
|
||||||
int n = (action >= DASM_DISP && action <= DASM_ALIGN) ? *b++ : 0;
|
|
||||||
switch (action) {
|
|
||||||
case DASM_DISP: if (!mark) mark = cp; {
|
|
||||||
unsigned char *mm = mark;
|
|
||||||
if (*p != DASM_IMM_DB && *p != DASM_IMM_WB) mark = NULL;
|
|
||||||
if (n == 0) { int mrm = mm[-1]&7; if (mrm == 4) mrm = mm[0]&7;
|
|
||||||
if (mrm != 5) { mm[-1] -= 0x80; break; } }
|
|
||||||
if (((n+128) & -256) != 0) goto wd; else mm[-1] -= 0x40;
|
|
||||||
}
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_IMM_S: case DASM_IMM_B: wb: dasmb(n); break;
|
|
||||||
case DASM_IMM_DB: if (((n+128)&-256) == 0) {
|
|
||||||
db: if (!mark) mark = cp; mark[-2] += 2; mark = NULL; goto wb;
|
|
||||||
} else mark = NULL;
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_IMM_D: wd: dasmd(n); break;
|
|
||||||
case DASM_IMM_WB: if (((n+128)&-256) == 0) goto db; else mark = NULL;
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_IMM_W: dasmw(n); break;
|
|
||||||
case DASM_VREG: {
|
|
||||||
int t = *p++;
|
|
||||||
unsigned char *ex = cp - (t&7);
|
|
||||||
if ((n & 8) && t < 0xa0) {
|
|
||||||
if (*ex & 0x80) ex[1] ^= 0x20 << (t>>6); else *ex ^= 1 << (t>>6);
|
|
||||||
n &= 7;
|
|
||||||
} else if (n & 0x10) {
|
|
||||||
if (*ex & 0x80) {
|
|
||||||
*ex = 0xc5; ex[1] = (ex[1] & 0x80) | ex[2]; ex += 2;
|
|
||||||
}
|
|
||||||
while (++ex < cp) ex[-1] = *ex;
|
|
||||||
if (mark) mark--;
|
|
||||||
cp--;
|
|
||||||
n &= 7;
|
|
||||||
}
|
|
||||||
if (t >= 0xc0) n <<= 4;
|
|
||||||
else if (t >= 0x40) n <<= 3;
|
|
||||||
else if (n == 4 && t < 0x20) { cp[-1] ^= n; *cp++ = 0x20; }
|
|
||||||
cp[-1] ^= n;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case DASM_REL_LG: p++; if (n >= 0) goto rel_pc;
|
|
||||||
b++; n = (int)(ptrdiff_t)D->globals[-n-10];
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_REL_A: rel_a:
|
|
||||||
n -= (unsigned int)(ptrdiff_t)(cp+4); goto wd; /* !x64 */
|
|
||||||
case DASM_REL_PC: rel_pc: {
|
|
||||||
int shrink = *b++;
|
|
||||||
int *pb = DASM_POS2PTR(D, n); if (*pb < 0) { n = pb[1]; goto rel_a; }
|
|
||||||
n = *pb - ((int)(cp-base) + 4-shrink);
|
|
||||||
if (shrink == 0) goto wd;
|
|
||||||
if (shrink == 4) { cp--; cp[-1] = *cp-0x10; } else cp[-1] = 0xeb;
|
|
||||||
goto wb;
|
|
||||||
}
|
|
||||||
case DASM_IMM_LG:
|
|
||||||
p++;
|
|
||||||
if (n < 0) { dasma((ptrdiff_t)D->globals[-n-10]); break; }
|
|
||||||
/* fallthrough */
|
|
||||||
case DASM_IMM_PC: {
|
|
||||||
int *pb = DASM_POS2PTR(D, n);
|
|
||||||
dasma(*pb < 0 ? (ptrdiff_t)pb[1] : (*pb + (ptrdiff_t)base));
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case DASM_LABEL_LG: {
|
|
||||||
int idx = *p++;
|
|
||||||
if (idx >= 10)
|
|
||||||
D->globals[idx-10] = (void *)(base + (*p == DASM_SETLABEL ? *b : n));
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case DASM_LABEL_PC: case DASM_SETLABEL: break;
|
|
||||||
case DASM_SPACE: { int fill = *p++; while (n--) *cp++ = fill; break; }
|
|
||||||
case DASM_ALIGN:
|
|
||||||
n = *p++;
|
|
||||||
while (((cp-base) & n)) *cp++ = 0x90; /* nop */
|
|
||||||
break;
|
|
||||||
case DASM_EXTERN: n = DASM_EXTERN(Dst, cp, p[1], *p); p += 2; goto wd;
|
|
||||||
case DASM_MARK: mark = cp; break;
|
|
||||||
case DASM_ESC: action = *p++;
|
|
||||||
/* fallthrough */
|
|
||||||
default: *cp++ = action; break;
|
|
||||||
case DASM_SECTION: case DASM_STOP: goto stop;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
stop: (void)0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (base + D->codesize != cp) /* Check for phase errors. */
|
|
||||||
return DASM_S_PHASE;
|
|
||||||
return DASM_S_OK;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Get PC label offset. */
|
|
||||||
int dasm_getpclabel(Dst_DECL, unsigned int pc)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
if (pc*sizeof(int) < D->pcsize) {
|
|
||||||
int pos = D->pclabels[pc];
|
|
||||||
if (pos < 0) return *DASM_POS2PTR(D, -pos);
|
|
||||||
if (pos > 0) return -1; /* Undefined. */
|
|
||||||
}
|
|
||||||
return -2; /* Unused or out of range. */
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef DASM_CHECKS
|
|
||||||
/* Optional sanity checker to call between isolated encoding steps. */
|
|
||||||
int dasm_checkstep(Dst_DECL, int secmatch)
|
|
||||||
{
|
|
||||||
dasm_State *D = Dst_REF;
|
|
||||||
if (D->status == DASM_S_OK) {
|
|
||||||
int i;
|
|
||||||
for (i = 1; i <= 9; i++) {
|
|
||||||
if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_L|i; break; }
|
|
||||||
D->lglabels[i] = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (D->status == DASM_S_OK && secmatch >= 0 &&
|
|
||||||
D->section != &D->sections[secmatch])
|
|
||||||
D->status = DASM_S_MATCH_SEC|(int)(D->section-D->sections);
|
|
||||||
return D->status;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
File diff suppressed because it is too large.
Load diff
File diff suppressed because it is too large.
Load diff
@@ -1,3 +0,0 @@
|
|||||||
minilua
|
|
||||||
buildvm
|
|
||||||
buildvm_arch.h
|
|
||||||
@@ -1,4 +0,0 @@
|
|||||||
The files in this directory are only used during the build process of LuaJIT.
|
|
||||||
For cross-compilation, they must be executed on the host, not on the target.
|
|
||||||
|
|
||||||
These files should NOT be installed!
|
|
||||||
@@ -1,529 +0,0 @@
|
|||||||
/*
|
|
||||||
** LuaJIT VM builder.
|
|
||||||
** Copyright (C) 2005-2023 Mike Pall. See Copyright Notice in luajit.h
|
|
||||||
**
|
|
||||||
** This is a tool to build the hand-tuned assembler code required for
|
|
||||||
** LuaJIT's bytecode interpreter. It supports a variety of output formats
|
|
||||||
** to feed different toolchains (see usage() below).
|
|
||||||
**
|
|
||||||
** This tool is not particularly optimized because it's only used while
|
|
||||||
** _building_ LuaJIT. There's no point in distributing or installing it.
|
|
||||||
** Only the object code generated by this tool is linked into LuaJIT.
|
|
||||||
**
|
|
||||||
** Caveat: some memory is not free'd, error handling is lazy.
|
|
||||||
** It's a one-shot tool -- any effort fixing this would be wasted.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "buildvm.h"
|
|
||||||
#include "lj_obj.h"
|
|
||||||
#include "lj_gc.h"
|
|
||||||
#include "lj_bc.h"
|
|
||||||
#if LJ_HASJIT
|
|
||||||
#include "lj_ir.h"
|
|
||||||
#include "lj_ircall.h"
|
|
||||||
#endif
|
|
||||||
#include "lj_frame.h"
|
|
||||||
#include "lj_dispatch.h"
|
|
||||||
#if LJ_HASFFI
|
|
||||||
#include "lj_ctype.h"
|
|
||||||
#include "lj_ccall.h"
|
|
||||||
#endif
|
|
||||||
#include "luajit.h"
|
|
||||||
|
|
||||||
#if defined(_WIN32)
|
|
||||||
#include <fcntl.h>
|
|
||||||
#include <io.h>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* ------------------------------------------------------------------------ */
|
|
||||||
|
|
||||||
/* DynASM glue definitions. */
|
|
||||||
#define Dst ctx
|
|
||||||
#define Dst_DECL BuildCtx *ctx
|
|
||||||
#define Dst_REF (ctx->D)
|
|
||||||
#define DASM_CHECKS 1
|
|
||||||
|
|
||||||
#include "../dynasm/dasm_proto.h"
|
|
||||||
|
|
||||||
/* Glue macros for DynASM. */
|
|
||||||
static int collect_reloc(BuildCtx *ctx, uint8_t *addr, int idx, int type);
|
|
||||||
|
|
||||||
#define DASM_EXTERN(ctx, addr, idx, type) \
|
|
||||||
collect_reloc(ctx, addr, idx, type)
|
|
||||||
|
|
||||||
/* ------------------------------------------------------------------------ */
|
|
||||||
|
|
||||||
/* Avoid trouble if cross-compiling for an x86 target. Speed doesn't matter. */
|
|
||||||
#define DASM_ALIGNED_WRITES 1
|
|
||||||
|
|
||||||
/* Embed architecture-specific DynASM encoder. */
|
|
||||||
#if LJ_TARGET_X86ORX64
|
|
||||||
#include "../dynasm/dasm_x86.h"
|
|
||||||
#elif LJ_TARGET_ARM
|
|
||||||
#include "../dynasm/dasm_arm.h"
|
|
||||||
#elif LJ_TARGET_ARM64
|
|
||||||
#include "../dynasm/dasm_arm64.h"
|
|
||||||
#elif LJ_TARGET_PPC
|
|
||||||
#include "../dynasm/dasm_ppc.h"
|
|
||||||
#elif LJ_TARGET_MIPS
|
|
||||||
#include "../dynasm/dasm_mips.h"
|
|
||||||
#else
|
|
||||||
#error "No support for this architecture (yet)"
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Embed generated architecture-specific backend. */
|
|
||||||
#include "buildvm_arch.h"
|
|
||||||
|
|
||||||
/* ------------------------------------------------------------------------ */
|
|
||||||
|
|
||||||
void owrite(BuildCtx *ctx, const void *ptr, size_t sz)
|
|
||||||
{
|
|
||||||
if (fwrite(ptr, 1, sz, ctx->fp) != sz) {
|
|
||||||
fprintf(stderr, "Error: cannot write to output file: %s\n",
|
|
||||||
strerror(errno));
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* ------------------------------------------------------------------------ */
|
|
||||||
|
|
||||||
/* Emit code as raw bytes. Only used for DynASM debugging. */
|
|
||||||
static void emit_raw(BuildCtx *ctx)
|
|
||||||
{
|
|
||||||
owrite(ctx, ctx->code, ctx->codesz);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* -- Build machine code -------------------------------------------------- */
|
|
||||||
|
|
||||||
static const char *sym_decorate(BuildCtx *ctx,
|
|
||||||
const char *prefix, const char *suffix)
|
|
||||||
{
|
|
||||||
char name[256];
|
|
||||||
char *p;
|
|
||||||
#if LJ_64
|
|
||||||
const char *symprefix = ctx->mode == BUILD_machasm ? "_" : "";
|
|
||||||
#elif LJ_TARGET_XBOX360
|
|
||||||
const char *symprefix = "";
|
|
||||||
#else
|
|
||||||
const char *symprefix = ctx->mode != BUILD_elfasm ? "_" : "";
|
|
||||||
#endif
|
|
||||||
sprintf(name, "%s%s%s", symprefix, prefix, suffix);
|
|
||||||
p = strchr(name, '@');
|
|
||||||
if (p) {
|
|
||||||
#if LJ_TARGET_X86ORX64
|
|
||||||
if (!LJ_64 && (ctx->mode == BUILD_coffasm || ctx->mode == BUILD_peobj))
|
|
||||||
name[0] = name[1] == 'R' ? '_' : '@'; /* Just for _RtlUnwind@16. */
|
|
||||||
else
|
|
||||||
*p = '\0';
|
|
||||||
#elif LJ_TARGET_PPC && !LJ_TARGET_CONSOLE
|
|
||||||
/* Keep @plt etc. */
|
|
||||||
#else
|
|
||||||
*p = '\0';
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
p = (char *)malloc(strlen(name)+1); /* MSVC doesn't like strdup. */
|
|
||||||
strcpy(p, name);
|
|
||||||
return p;
|
|
||||||
}
|
|
||||||
|
|
||||||
#define NRELOCSYM (sizeof(extnames)/sizeof(extnames[0])-1)
|
|
||||||
|
|
||||||
static int relocmap[NRELOCSYM];
|
|
||||||
|
|
||||||
/* Collect external relocations. */
|
|
||||||
static int collect_reloc(BuildCtx *ctx, uint8_t *addr, int idx, int type)
|
|
||||||
{
|
|
||||||
if (ctx->nreloc >= BUILD_MAX_RELOC) {
|
|
||||||
fprintf(stderr, "Error: too many relocations, increase BUILD_MAX_RELOC.\n");
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
if (relocmap[idx] < 0) {
|
|
||||||
relocmap[idx] = ctx->nrelocsym;
|
|
||||||
ctx->relocsym[ctx->nrelocsym] = sym_decorate(ctx, "", extnames[idx]);
|
|
||||||
ctx->nrelocsym++;
|
|
||||||
}
|
|
||||||
ctx->reloc[ctx->nreloc].ofs = (int32_t)(addr - ctx->code);
|
|
||||||
ctx->reloc[ctx->nreloc].sym = relocmap[idx];
|
|
||||||
ctx->reloc[ctx->nreloc].type = type;
|
|
||||||
ctx->nreloc++;
|
|
||||||
#if LJ_TARGET_XBOX360
|
|
||||||
return (int)(ctx->code - addr) + 4; /* Encode symbol offset of .text. */
|
|
||||||
#else
|
|
||||||
return 0; /* Encode symbol offset of 0. */
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Naive insertion sort. Performance doesn't matter here. */
|
|
||||||
static void sym_insert(BuildCtx *ctx, int32_t ofs,
|
|
||||||
const char *prefix, const char *suffix)
|
|
||||||
{
|
|
||||||
ptrdiff_t i = ctx->nsym++;
|
|
||||||
while (i > 0) {
|
|
||||||
if (ctx->sym[i-1].ofs <= ofs)
|
|
||||||
break;
|
|
||||||
ctx->sym[i] = ctx->sym[i-1];
|
|
||||||
i--;
|
|
||||||
}
|
|
||||||
ctx->sym[i].ofs = ofs;
|
|
||||||
ctx->sym[i].name = sym_decorate(ctx, prefix, suffix);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Build the machine code. */
|
|
||||||
static int build_code(BuildCtx *ctx)
|
|
||||||
{
|
|
||||||
int status;
|
|
||||||
int i;
|
|
||||||
|
|
||||||
/* Initialize DynASM structures. */
|
|
||||||
ctx->nglob = GLOB__MAX;
|
|
||||||
ctx->glob = (void **)malloc(ctx->nglob*sizeof(void *));
|
|
||||||
memset(ctx->glob, 0, ctx->nglob*sizeof(void *));
|
|
||||||
ctx->nreloc = 0;
|
|
||||||
|
|
||||||
ctx->globnames = globnames;
|
|
||||||
ctx->extnames = extnames;
|
|
||||||
ctx->relocsym = (const char **)malloc(NRELOCSYM*sizeof(const char *));
|
|
||||||
ctx->nrelocsym = 0;
|
|
||||||
for (i = 0; i < (int)NRELOCSYM; i++) relocmap[i] = -1;
|
|
||||||
|
|
||||||
ctx->dasm_ident = DASM_IDENT;
|
|
||||||
ctx->dasm_arch = DASM_ARCH;
|
|
||||||
|
|
||||||
dasm_init(Dst, DASM_MAXSECTION);
|
|
||||||
dasm_setupglobal(Dst, ctx->glob, ctx->nglob);
|
|
||||||
dasm_setup(Dst, build_actionlist);
|
|
||||||
|
|
||||||
/* Call arch-specific backend to emit the code. */
|
|
||||||
ctx->npc = build_backend(ctx);
|
|
||||||
|
|
||||||
/* Finalize the code. */
|
|
||||||
(void)dasm_checkstep(Dst, -1);
|
|
||||||
if ((status = dasm_link(Dst, &ctx->codesz))) return status;
|
|
||||||
ctx->code = (uint8_t *)malloc(ctx->codesz);
|
|
||||||
if ((status = dasm_encode(Dst, (void *)ctx->code))) return status;
|
|
||||||
|
|
||||||
/* Allocate symbol table and bytecode offsets. */
|
|
||||||
ctx->beginsym = sym_decorate(ctx, "", LABEL_PREFIX "vm_asm_begin");
|
|
||||||
ctx->sym = (BuildSym *)malloc((ctx->npc+ctx->nglob+1)*sizeof(BuildSym));
|
|
||||||
ctx->nsym = 0;
|
|
||||||
ctx->bc_ofs = (int32_t *)malloc(ctx->npc*sizeof(int32_t));
|
|
||||||
|
|
||||||
/* Collect the opcodes (PC labels). */
|
|
||||||
for (i = 0; i < ctx->npc; i++) {
|
|
||||||
int32_t ofs = dasm_getpclabel(Dst, i);
|
|
||||||
if (ofs < 0) return 0x22000000|i;
|
|
||||||
ctx->bc_ofs[i] = ofs;
|
|
||||||
if ((LJ_HASJIT ||
|
|
||||||
!(i == BC_JFORI || i == BC_JFORL || i == BC_JITERL || i == BC_JLOOP ||
|
|
||||||
i == BC_IFORL || i == BC_IITERL || i == BC_ILOOP)) &&
|
|
||||||
(LJ_HASFFI || i != BC_KCDATA))
|
|
||||||
sym_insert(ctx, ofs, LABEL_PREFIX_BC, bc_names[i]);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Collect the globals (named labels). */
|
|
||||||
for (i = 0; i < ctx->nglob; i++) {
|
|
||||||
const char *gl = globnames[i];
|
|
||||||
int len = (int)strlen(gl);
|
|
||||||
if (!ctx->glob[i]) {
|
|
||||||
fprintf(stderr, "Error: undefined global %s\n", gl);
|
|
||||||
exit(2);
|
|
||||||
}
|
|
||||||
/* Skip the _Z symbols. */
|
|
||||||
if (!(len >= 2 && gl[len-2] == '_' && gl[len-1] == 'Z'))
|
|
||||||
sym_insert(ctx, (int32_t)((uint8_t *)(ctx->glob[i]) - ctx->code),
|
|
||||||
LABEL_PREFIX, globnames[i]);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Close the address range. */
|
|
||||||
sym_insert(ctx, (int32_t)ctx->codesz, "", "");
|
|
||||||
ctx->nsym--;
|
|
||||||
|
|
||||||
dasm_free(Dst);
|
|
||||||
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* -- Generate VM enums --------------------------------------------------- */
|
|
||||||
|
|
||||||
const char *const bc_names[] = {
|
|
||||||
#define BCNAME(name, ma, mb, mc, mt) #name,
|
|
||||||
BCDEF(BCNAME)
|
|
||||||
#undef BCNAME
|
|
||||||
NULL
|
|
||||||
};
|
|
||||||
|
|
||||||
#if LJ_HASJIT
|
|
||||||
const char *const ir_names[] = {
|
|
||||||
#define IRNAME(name, m, m1, m2) #name,
|
|
||||||
IRDEF(IRNAME)
|
|
||||||
#undef IRNAME
|
|
||||||
NULL
|
|
||||||
};
|
|
||||||
|
|
||||||
const char *const irt_names[] = {
|
|
||||||
#define IRTNAME(name, size) #name,
|
|
||||||
IRTDEF(IRTNAME)
|
|
||||||
#undef IRTNAME
|
|
||||||
NULL
|
|
||||||
};
|
|
||||||
|
|
||||||
const char *const irfpm_names[] = {
|
|
||||||
#define FPMNAME(name) #name,
|
|
||||||
IRFPMDEF(FPMNAME)
|
|
||||||
#undef FPMNAME
|
|
||||||
NULL
|
|
||||||
};
|
|
||||||
|
|
||||||
const char *const irfield_names[] = {
|
|
||||||
#define FLNAME(name, ofs) #name,
|
|
||||||
IRFLDEF(FLNAME)
|
|
||||||
#undef FLNAME
|
|
||||||
NULL
|
|
||||||
};
|
|
||||||
|
|
||||||
const char *const ircall_names[] = {
|
|
||||||
#define IRCALLNAME(cond, name, nargs, kind, type, flags) #name,
|
|
||||||
IRCALLDEF(IRCALLNAME)
|
|
||||||
#undef IRCALLNAME
|
|
||||||
NULL
|
|
||||||
};
|
|
||||||
|
|
||||||
static const char *const trace_errors[] = {
|
|
||||||
#define TREDEF(name, msg) msg,
|
|
||||||
#include "lj_traceerr.h"
|
|
||||||
NULL
|
|
||||||
};
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#if LJ_HASJIT
|
|
||||||
static const char *lower(char *buf, const char *s)
|
|
||||||
{
|
|
||||||
char *p = buf;
|
|
||||||
while (*s) {
|
|
||||||
*p++ = (*s >= 'A' && *s <= 'Z') ? *s+0x20 : *s;
|
|
||||||
s++;
|
|
||||||
}
|
|
||||||
*p = '\0';
|
|
||||||
return buf;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Emit C source code for bytecode-related definitions. */
|
|
||||||
static void emit_bcdef(BuildCtx *ctx)
|
|
||||||
{
|
|
||||||
int i;
|
|
||||||
fprintf(ctx->fp, "/* This is a generated file. DO NOT EDIT! */\n\n");
|
|
||||||
fprintf(ctx->fp, "LJ_DATADEF const uint16_t lj_bc_ofs[] = {\n");
|
|
||||||
for (i = 0; i < ctx->npc; i++) {
|
|
||||||
if (i != 0)
|
|
||||||
fprintf(ctx->fp, ",\n");
|
|
||||||
fprintf(ctx->fp, "%d", ctx->bc_ofs[i]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Emit VM definitions as Lua code for debug modules. */
|
|
||||||
static void emit_vmdef(BuildCtx *ctx)
|
|
||||||
{
|
|
||||||
#if LJ_HASJIT
|
|
||||||
char buf[80];
|
|
||||||
#endif
|
|
||||||
int i;
|
|
||||||
fprintf(ctx->fp, "-- This is a generated file. DO NOT EDIT!\n\n");
|
|
||||||
fprintf(ctx->fp, "assert(require(\"jit\").version == \"%s\", \"LuaJIT core/library version mismatch\")\n\n", LUAJIT_VERSION);
|
|
||||||
fprintf(ctx->fp, "return {\n\n");
|
|
||||||
|
|
||||||
fprintf(ctx->fp, "bcnames = \"");
|
|
||||||
for (i = 0; bc_names[i]; i++) fprintf(ctx->fp, "%-6s", bc_names[i]);
|
|
||||||
fprintf(ctx->fp, "\",\n\n");
|
|
||||||
|
|
||||||
#if LJ_HASJIT
|
|
||||||
fprintf(ctx->fp, "irnames = \"");
|
|
||||||
for (i = 0; ir_names[i]; i++) fprintf(ctx->fp, "%-6s", ir_names[i]);
|
|
||||||
fprintf(ctx->fp, "\",\n\n");
|
|
||||||
|
|
||||||
fprintf(ctx->fp, "irfpm = { [0]=");
|
|
||||||
for (i = 0; irfpm_names[i]; i++)
|
|
||||||
fprintf(ctx->fp, "\"%s\", ", lower(buf, irfpm_names[i]));
|
|
||||||
fprintf(ctx->fp, "},\n\n");
|
|
||||||
|
|
||||||
fprintf(ctx->fp, "irfield = { [0]=");
|
|
||||||
for (i = 0; irfield_names[i]; i++) {
|
|
||||||
char *p;
|
|
||||||
lower(buf, irfield_names[i]);
|
|
||||||
p = strchr(buf, '_');
|
|
||||||
if (p) *p = '.';
|
|
||||||
fprintf(ctx->fp, "\"%s\", ", buf);
|
|
||||||
}
|
|
||||||
fprintf(ctx->fp, "},\n\n");
|
|
||||||
|
|
||||||
fprintf(ctx->fp, "ircall = {\n[0]=");
|
|
||||||
for (i = 0; ircall_names[i]; i++)
|
|
||||||
fprintf(ctx->fp, "\"%s\",\n", ircall_names[i]);
|
|
||||||
fprintf(ctx->fp, "},\n\n");
|
|
||||||
|
|
||||||
fprintf(ctx->fp, "traceerr = {\n[0]=");
|
|
||||||
for (i = 0; trace_errors[i]; i++)
|
|
||||||
fprintf(ctx->fp, "\"%s\",\n", trace_errors[i]);
|
|
||||||
fprintf(ctx->fp, "},\n\n");
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
|
|
||||||
/* -- Argument parsing ---------------------------------------------------- */
|
|
||||||
|
|
||||||
/* Build mode names. */
|
|
||||||
static const char *const modenames[] = {
|
|
||||||
#define BUILDNAME(name) #name,
|
|
||||||
BUILDDEF(BUILDNAME)
|
|
||||||
#undef BUILDNAME
|
|
||||||
NULL
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Print usage information and exit. */
|
|
||||||
static void usage(void)
|
|
||||||
{
|
|
||||||
int i;
|
|
||||||
fprintf(stderr, LUAJIT_VERSION " VM builder.\n");
|
|
||||||
fprintf(stderr, LUAJIT_COPYRIGHT ", " LUAJIT_URL "\n");
|
|
||||||
fprintf(stderr, "Target architecture: " LJ_ARCH_NAME "\n\n");
|
|
||||||
fprintf(stderr, "Usage: buildvm -m mode [-o outfile] [infiles...]\n\n");
|
|
||||||
fprintf(stderr, "Available modes:\n");
|
|
||||||
for (i = 0; i < BUILD__MAX; i++)
|
|
||||||
fprintf(stderr, " %s\n", modenames[i]);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Parse the output mode name. */
|
|
||||||
static BuildMode parsemode(const char *mode)
|
|
||||||
{
|
|
||||||
int i;
|
|
||||||
for (i = 0; modenames[i]; i++)
|
|
||||||
if (!strcmp(mode, modenames[i]))
|
|
||||||
return (BuildMode)i;
|
|
||||||
usage();
|
|
||||||
return (BuildMode)-1;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Parse arguments. */
|
|
||||||
static void parseargs(BuildCtx *ctx, char **argv)
|
|
||||||
{
|
|
||||||
const char *a;
|
|
||||||
int i;
|
|
||||||
ctx->mode = (BuildMode)-1;
|
|
||||||
ctx->outname = "-";
|
|
||||||
for (i = 1; (a = argv[i]) != NULL; i++) {
|
|
||||||
if (a[0] != '-')
|
|
||||||
break;
|
|
||||||
switch (a[1]) {
|
|
||||||
case '-':
|
|
||||||
if (a[2]) goto err;
|
|
||||||
i++;
|
|
||||||
goto ok;
|
|
||||||
case '\0':
|
|
||||||
goto ok;
|
|
||||||
case 'm':
|
|
||||||
i++;
|
|
||||||
if (a[2] || argv[i] == NULL) goto err;
|
|
||||||
ctx->mode = parsemode(argv[i]);
|
|
||||||
break;
|
|
||||||
case 'o':
|
|
||||||
i++;
|
|
||||||
if (a[2] || argv[i] == NULL) goto err;
|
|
||||||
ctx->outname = argv[i];
|
|
||||||
break;
|
|
||||||
default: err:
|
|
||||||
usage();
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
ok:
|
|
||||||
ctx->args = argv+i;
|
|
||||||
if (ctx->mode == (BuildMode)-1) goto err;
|
|
||||||
}
|
|
||||||
|
|
||||||
int main(int argc, char **argv)
|
|
||||||
{
|
|
||||||
BuildCtx ctx_;
|
|
||||||
BuildCtx *ctx = &ctx_;
|
|
||||||
int status, binmode;
|
|
||||||
|
|
||||||
if (sizeof(void *) != 4*LJ_32+8*LJ_64) {
|
|
||||||
fprintf(stderr,"Error: pointer size mismatch in cross-build.\n");
|
|
||||||
fprintf(stderr,"Try: make HOST_CC=\"gcc -m32\" CROSS=...\n\n");
|
|
||||||
return 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
UNUSED(argc);
|
|
||||||
parseargs(ctx, argv);
|
|
||||||
|
|
||||||
if ((status = build_code(ctx))) {
|
|
||||||
fprintf(stderr,"Error: DASM error %08x\n", status);
|
|
||||||
return 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
switch (ctx->mode) {
|
|
||||||
case BUILD_peobj:
|
|
||||||
case BUILD_raw:
|
|
||||||
binmode = 1;
|
|
||||||
break;
|
|
||||||
default:
|
|
||||||
binmode = 0;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (ctx->outname[0] == '-' && ctx->outname[1] == '\0') {
|
|
||||||
ctx->fp = stdout;
|
|
||||||
#if defined(_WIN32)
|
|
||||||
if (binmode)
|
|
||||||
_setmode(_fileno(stdout), _O_BINARY); /* Yuck. */
|
|
||||||
#endif
|
|
||||||
} else if (!(ctx->fp = fopen(ctx->outname, binmode ? "wb" : "w"))) {
|
|
||||||
fprintf(stderr, "Error: cannot open output file '%s': %s\n",
|
|
||||||
ctx->outname, strerror(errno));
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
|
|
||||||
switch (ctx->mode) {
|
|
||||||
case BUILD_elfasm:
|
|
||||||
case BUILD_coffasm:
|
|
||||||
case BUILD_machasm:
|
|
||||||
emit_asm(ctx);
|
|
||||||
emit_asm_debug(ctx);
|
|
||||||
break;
|
|
||||||
case BUILD_peobj:
|
|
||||||
emit_peobj(ctx);
|
|
||||||
break;
|
|
||||||
case BUILD_raw:
|
|
||||||
emit_raw(ctx);
|
|
||||||
break;
|
|
||||||
case BUILD_bcdef:
|
|
||||||
emit_bcdef(ctx);
|
|
||||||
emit_lib(ctx);
|
|
||||||
break;
|
|
||||||
case BUILD_vmdef:
|
|
||||||
emit_vmdef(ctx);
|
|
||||||
emit_lib(ctx);
|
|
||||||
fprintf(ctx->fp, "}\n\n");
|
|
||||||
break;
|
|
||||||
case BUILD_ffdef:
|
|
||||||
case BUILD_libdef:
|
|
||||||
case BUILD_recdef:
|
|
||||||
emit_lib(ctx);
|
|
||||||
break;
|
|
||||||
case BUILD_folddef:
|
|
||||||
emit_fold(ctx);
|
|
||||||
break;
|
|
||||||
default:
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
|
|
||||||
fflush(ctx->fp);
|
|
||||||
if (ferror(ctx->fp)) {
|
|
||||||
fprintf(stderr, "Error: cannot write to output file: %s\n",
|
|
||||||
strerror(errno));
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
fclose(ctx->fp);
|
|
||||||
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
@@ -1,105 +0,0 @@
|
|||||||
/*
|
|
||||||
** LuaJIT VM builder.
|
|
||||||
** Copyright (C) 2005-2023 Mike Pall. See Copyright Notice in luajit.h
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef _BUILDVM_H
|
|
||||||
#define _BUILDVM_H
|
|
||||||
|
|
||||||
#include <sys/types.h>
|
|
||||||
#include <stdio.h>
|
|
||||||
#include <stdlib.h>
|
|
||||||
#include <string.h>
|
|
||||||
#include <errno.h>
|
|
||||||
|
|
||||||
#include "lj_def.h"
|
|
||||||
#include "lj_arch.h"
|
|
||||||
|
|
||||||
/* Hardcoded limits. Increase as needed. */
|
|
||||||
#define BUILD_MAX_RELOC 200 /* Max. number of relocations. */
|
|
||||||
#define BUILD_MAX_FOLD 4096 /* Max. number of fold rules. */
|
|
||||||
|
|
||||||
/* Prefix for scanned library definitions. */
|
|
||||||
#define LIBDEF_PREFIX "LJLIB_"
|
|
||||||
|
|
||||||
/* Prefix for scanned fold definitions. */
|
|
||||||
#define FOLDDEF_PREFIX "LJFOLD"
|
|
||||||
|
|
||||||
/* Prefixes for generated labels. */
|
|
||||||
#define LABEL_PREFIX "lj_"
|
|
||||||
#define LABEL_PREFIX_BC LABEL_PREFIX "BC_"
|
|
||||||
#define LABEL_PREFIX_FF LABEL_PREFIX "ff_"
|
|
||||||
#define LABEL_PREFIX_CF LABEL_PREFIX "cf_"
|
|
||||||
#define LABEL_PREFIX_FFH LABEL_PREFIX "ffh_"
|
|
||||||
#define LABEL_PREFIX_LIBCF LABEL_PREFIX "lib_cf_"
|
|
||||||
#define LABEL_PREFIX_LIBINIT LABEL_PREFIX "lib_init_"
|
|
||||||
|
|
||||||
/* Forward declaration. */
|
|
||||||
struct dasm_State;
|
|
||||||
|
|
||||||
/* Build modes. */
|
|
||||||
#define BUILDDEF(_) \
|
|
||||||
_(elfasm) _(coffasm) _(machasm) _(peobj) _(raw) \
|
|
||||||
_(bcdef) _(ffdef) _(libdef) _(recdef) _(vmdef) \
|
|
||||||
_(folddef)
|
|
||||||
|
|
||||||
typedef enum {
|
|
||||||
#define BUILDENUM(name) BUILD_##name,
|
|
||||||
BUILDDEF(BUILDENUM)
|
|
||||||
#undef BUILDENUM
|
|
||||||
BUILD__MAX
|
|
||||||
} BuildMode;
|
|
||||||
|
|
||||||
/* Code relocation. */
|
|
||||||
typedef struct BuildReloc {
|
|
||||||
int32_t ofs;
|
|
||||||
int sym;
|
|
||||||
int type;
|
|
||||||
} BuildReloc;
|
|
||||||
|
|
||||||
typedef struct BuildSym {
|
|
||||||
const char *name;
|
|
||||||
int32_t ofs;
|
|
||||||
} BuildSym;
|
|
||||||
|
|
||||||
/* Build context structure. */
|
|
||||||
typedef struct BuildCtx {
|
|
||||||
/* DynASM state pointer. Should be first member. */
|
|
||||||
struct dasm_State *D;
|
|
||||||
/* Parsed command line. */
|
|
||||||
BuildMode mode;
|
|
||||||
FILE *fp;
|
|
||||||
const char *outname;
|
|
||||||
char **args;
|
|
||||||
/* Code and symbols generated by DynASM. */
|
|
||||||
uint8_t *code;
|
|
||||||
size_t codesz;
|
|
||||||
int npc, nglob, nsym, nreloc, nrelocsym;
|
|
||||||
void **glob;
|
|
||||||
BuildSym *sym;
|
|
||||||
const char **relocsym;
|
|
||||||
int32_t *bc_ofs;
|
|
||||||
const char *beginsym;
|
|
||||||
/* Strings generated by DynASM. */
|
|
||||||
const char *const *globnames;
|
|
||||||
const char *const *extnames;
|
|
||||||
const char *dasm_ident;
|
|
||||||
const char *dasm_arch;
|
|
||||||
/* Relocations. */
|
|
||||||
BuildReloc reloc[BUILD_MAX_RELOC];
|
|
||||||
} BuildCtx;
|
|
||||||
|
|
||||||
extern void owrite(BuildCtx *ctx, const void *ptr, size_t sz);
|
|
||||||
extern void emit_asm(BuildCtx *ctx);
|
|
||||||
extern void emit_peobj(BuildCtx *ctx);
|
|
||||||
extern void emit_lib(BuildCtx *ctx);
|
|
||||||
extern void emit_fold(BuildCtx *ctx);
|
|
||||||
|
|
||||||
extern const char *const bc_names[];
|
|
||||||
extern const char *const ir_names[];
|
|
||||||
extern const char *const irt_names[];
|
|
||||||
extern const char *const irfpm_names[];
|
|
||||||
extern const char *const irfield_names[];
|
|
||||||
extern const char *const ircall_names[];
|
|
||||||
|
|
||||||
#endif
|
|
||||||
@@ -1,355 +0,0 @@
|
|||||||
/*
|
|
||||||
** LuaJIT VM builder: Assembler source code emitter.
|
|
||||||
** Copyright (C) 2005-2023 Mike Pall. See Copyright Notice in luajit.h
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "buildvm.h"
|
|
||||||
#include "lj_bc.h"
|
|
||||||
|
|
||||||
/* ------------------------------------------------------------------------ */
|
|
||||||
|
|
||||||
#if LJ_TARGET_X86ORX64
|
|
||||||
/* Emit bytes piecewise as assembler text. */
|
|
||||||
static void emit_asm_bytes(BuildCtx *ctx, uint8_t *p, int n)
|
|
||||||
{
|
|
||||||
int i;
|
|
||||||
for (i = 0; i < n; i++) {
|
|
||||||
if ((i & 15) == 0)
|
|
||||||
fprintf(ctx->fp, "\t.byte %d", p[i]);
|
|
||||||
else
|
|
||||||
fprintf(ctx->fp, ",%d", p[i]);
|
|
||||||
if ((i & 15) == 15) putc('\n', ctx->fp);
|
|
||||||
}
|
|
||||||
if ((n & 15) != 0) putc('\n', ctx->fp);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Emit relocation */
|
|
||||||
static void emit_asm_reloc(BuildCtx *ctx, int type, const char *sym)
|
|
||||||
{
|
|
||||||
switch (ctx->mode) {
|
|
||||||
case BUILD_elfasm:
|
|
||||||
if (type)
|
|
||||||
fprintf(ctx->fp, "\t.long %s-.-4\n", sym);
|
|
||||||
else
|
|
||||||
fprintf(ctx->fp, "\t.long %s\n", sym);
|
|
||||||
break;
|
|
||||||
case BUILD_coffasm:
|
|
||||||
fprintf(ctx->fp, "\t.def %s; .scl 3; .type 32; .endef\n", sym);
|
|
||||||
if (type)
|
|
||||||
fprintf(ctx->fp, "\t.long %s-.-4\n", sym);
|
|
||||||
else
|
|
||||||
fprintf(ctx->fp, "\t.long %s\n", sym);
|
|
||||||
break;
|
|
||||||
default: /* BUILD_machasm for relative relocations handled below. */
|
|
||||||
fprintf(ctx->fp, "\t.long %s\n", sym);
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static const char *const jccnames[] = {
|
|
||||||
"jo", "jno", "jb", "jnb", "jz", "jnz", "jbe", "ja",
|
|
||||||
"js", "jns", "jpe", "jpo", "jl", "jge", "jle", "jg"
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Emit x86/x64 text relocations. */
|
|
||||||
static void emit_asm_reloc_text(BuildCtx *ctx, uint8_t *cp, int n,
|
|
||||||
const char *sym)
|
|
||||||
{
|
|
||||||
const char *opname = NULL;
|
|
||||||
if (--n < 0) goto err;
|
|
||||||
if (cp[n] == 0xe8) {
|
|
||||||
opname = "call";
|
|
||||||
} else if (cp[n] == 0xe9) {
|
|
||||||
opname = "jmp";
|
|
||||||
} else if (cp[n] >= 0x80 && cp[n] <= 0x8f && n > 0 && cp[n-1] == 0x0f) {
|
|
||||||
opname = jccnames[cp[n]-0x80];
|
|
||||||
n--;
|
|
||||||
} else {
|
|
||||||
err:
|
|
||||||
fprintf(stderr, "Error: unsupported opcode for %s symbol relocation.\n",
|
|
||||||
sym);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
emit_asm_bytes(ctx, cp, n);
|
|
||||||
if (strncmp(sym+(*sym == '_'), LABEL_PREFIX, sizeof(LABEL_PREFIX)-1)) {
|
|
||||||
/* Various fixups for external symbols outside of our binary. */
|
|
||||||
if (ctx->mode == BUILD_elfasm) {
|
|
||||||
if (LJ_32)
|
|
||||||
fprintf(ctx->fp, "#if __PIC__\n\t%s lj_wrap_%s\n#else\n", opname, sym);
|
|
||||||
fprintf(ctx->fp, "\t%s %s@PLT\n", opname, sym);
|
|
||||||
if (LJ_32)
|
|
||||||
fprintf(ctx->fp, "#endif\n");
|
|
||||||
return;
|
|
||||||
} else if (LJ_32 && ctx->mode == BUILD_machasm) {
|
|
||||||
fprintf(ctx->fp, "\t%s L%s$stub\n", opname, sym);
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
fprintf(ctx->fp, "\t%s %s\n", opname, sym);
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
/* Emit words piecewise as assembler text. */
|
|
||||||
static void emit_asm_words(BuildCtx *ctx, uint8_t *p, int n)
|
|
||||||
{
|
|
||||||
int i;
|
|
||||||
for (i = 0; i < n; i += 4) {
|
|
||||||
uint32_t ins = *(uint32_t *)(p+i);
|
|
||||||
#if LJ_TARGET_ARM64 && LJ_BE
|
|
||||||
ins = lj_bswap(ins); /* ARM64 instructions are always little-endian. */
|
|
||||||
#endif
|
|
||||||
if ((i & 15) == 0)
|
|
||||||
fprintf(ctx->fp, "\t.long 0x%08x", ins);
|
|
||||||
else
|
|
||||||
fprintf(ctx->fp, ",0x%08x", ins);
|
|
||||||
if ((i & 15) == 12) putc('\n', ctx->fp);
|
|
||||||
}
|
|
||||||
if ((n & 15) != 0) putc('\n', ctx->fp);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Emit relocation as part of an instruction. */
|
|
||||||
static void emit_asm_wordreloc(BuildCtx *ctx, uint8_t *p, int n,
|
|
||||||
const char *sym)
|
|
||||||
{
|
|
||||||
uint32_t ins;
|
|
||||||
emit_asm_words(ctx, p, n-4);
|
|
||||||
ins = *(uint32_t *)(p+n-4);
|
|
||||||
#if LJ_TARGET_ARM
|
|
||||||
if ((ins & 0xff000000u) == 0xfa000000u) {
|
|
||||||
fprintf(ctx->fp, "\tblx %s\n", sym);
|
|
||||||
} else if ((ins & 0x0e000000u) == 0x0a000000u) {
|
|
||||||
fprintf(ctx->fp, "\t%s%.2s %s\n", (ins & 0x01000000u) ? "bl" : "b",
|
|
||||||
&"eqnecsccmiplvsvchilsgeltgtle"[2*(ins >> 28)], sym);
|
|
||||||
} else {
|
|
||||||
fprintf(stderr,
|
|
||||||
"Error: unsupported opcode %08x for %s symbol relocation.\n",
|
|
||||||
ins, sym);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
#elif LJ_TARGET_ARM64
|
|
||||||
if ((ins >> 26) == 0x25u) {
|
|
||||||
fprintf(ctx->fp, "\tbl %s\n", sym);
|
|
||||||
} else {
|
|
||||||
fprintf(stderr,
|
|
||||||
"Error: unsupported opcode %08x for %s symbol relocation.\n",
|
|
||||||
ins, sym);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
#elif LJ_TARGET_PPC
|
|
||||||
#if LJ_TARGET_PS3
|
|
||||||
#define TOCPREFIX "."
|
|
||||||
#else
|
|
||||||
#define TOCPREFIX ""
|
|
||||||
#endif
|
|
||||||
if ((ins >> 26) == 16) {
|
|
||||||
fprintf(ctx->fp, "\t%s %d, %d, " TOCPREFIX "%s\n",
|
|
||||||
(ins & 1) ? "bcl" : "bc", (ins >> 21) & 31, (ins >> 16) & 31, sym);
|
|
||||||
} else if ((ins >> 26) == 18) {
|
|
||||||
fprintf(ctx->fp, "\t%s " TOCPREFIX "%s\n", (ins & 1) ? "bl" : "b", sym);
|
|
||||||
} else {
|
|
||||||
fprintf(stderr,
|
|
||||||
"Error: unsupported opcode %08x for %s symbol relocation.\n",
|
|
||||||
ins, sym);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
#elif LJ_TARGET_MIPS
|
|
||||||
fprintf(stderr,
|
|
||||||
"Error: unsupported opcode %08x for %s symbol relocation.\n",
|
|
||||||
ins, sym);
|
|
||||||
exit(1);
|
|
||||||
#else
|
|
||||||
#error "missing relocation support for this architecture"
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#if LJ_TARGET_ARM
|
|
||||||
#define ELFASM_PX "%%"
|
|
||||||
#else
|
|
||||||
#define ELFASM_PX "@"
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Emit an assembler label. */
|
|
||||||
static void emit_asm_label(BuildCtx *ctx, const char *name, int size, int isfunc)
|
|
||||||
{
|
|
||||||
switch (ctx->mode) {
|
|
||||||
case BUILD_elfasm:
|
|
||||||
#if LJ_TARGET_PS3
|
|
||||||
if (!strncmp(name, "lj_vm_", 6) &&
|
|
||||||
strcmp(name, ctx->beginsym) &&
|
|
||||||
!strstr(name, "hook")) {
|
|
||||||
fprintf(ctx->fp,
|
|
||||||
"\n\t.globl %s\n"
|
|
||||||
"\t.section \".opd\",\"aw\"\n"
|
|
||||||
"%s:\n"
|
|
||||||
"\t.long .%s,.TOC.@tocbase32\n"
|
|
||||||
"\t.size %s,8\n"
|
|
||||||
"\t.previous\n"
|
|
||||||
"\t.globl .%s\n"
|
|
||||||
"\t.hidden .%s\n"
|
|
||||||
"\t.type .%s, " ELFASM_PX "function\n"
|
|
||||||
"\t.size .%s, %d\n"
|
|
||||||
".%s:\n",
|
|
||||||
name, name, name, name, name, name, name, name, size, name);
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
fprintf(ctx->fp,
|
|
||||||
"\n\t.globl %s\n"
|
|
||||||
"\t.hidden %s\n"
|
|
||||||
"\t.type %s, " ELFASM_PX "%s\n"
|
|
||||||
"\t.size %s, %d\n"
|
|
||||||
"%s:\n",
|
|
||||||
name, name, name, isfunc ? "function" : "object", name, size, name);
|
|
||||||
break;
|
|
||||||
case BUILD_coffasm:
|
|
||||||
fprintf(ctx->fp, "\n\t.globl %s\n", name);
|
|
||||||
if (isfunc)
|
|
||||||
fprintf(ctx->fp, "\t.def %s; .scl 3; .type 32; .endef\n", name);
|
|
||||||
fprintf(ctx->fp, "%s:\n", name);
|
|
||||||
break;
|
|
||||||
case BUILD_machasm:
|
|
||||||
fprintf(ctx->fp,
|
|
||||||
"\n\t.private_extern %s\n"
|
|
||||||
"\t.no_dead_strip %s\n"
|
|
||||||
"%s:\n", name, name, name);
|
|
||||||
break;
|
|
||||||
default:
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Emit alignment. */
|
|
||||||
static void emit_asm_align(BuildCtx *ctx, int bits)
|
|
||||||
{
|
|
||||||
switch (ctx->mode) {
|
|
||||||
case BUILD_elfasm:
|
|
||||||
case BUILD_coffasm:
|
|
||||||
fprintf(ctx->fp, "\t.p2align %d\n", bits);
|
|
||||||
break;
|
|
||||||
case BUILD_machasm:
|
|
||||||
fprintf(ctx->fp, "\t.align %d\n", bits);
|
|
||||||
break;
|
|
||||||
default:
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* ------------------------------------------------------------------------ */
|
|
||||||
|
|
||||||
/* Emit assembler source code. */
|
|
||||||
void emit_asm(BuildCtx *ctx)
|
|
||||||
{
|
|
||||||
int i, rel;
|
|
||||||
|
|
||||||
fprintf(ctx->fp, "\t.file \"buildvm_%s.dasc\"\n", ctx->dasm_arch);
|
|
||||||
fprintf(ctx->fp, "\t.text\n");
|
|
||||||
#if LJ_TARGET_MIPS32 && !LJ_ABI_SOFTFP
|
|
||||||
fprintf(ctx->fp, "\t.module fp=32\n");
|
|
||||||
#endif
|
|
||||||
#if LJ_TARGET_MIPS
|
|
||||||
fprintf(ctx->fp, "\t.set nomips16\n\t.abicalls\n\t.set noreorder\n\t.set nomacro\n");
|
|
||||||
#endif
|
|
||||||
emit_asm_align(ctx, 4);
|
|
||||||
|
|
||||||
#if LJ_TARGET_PS3
|
|
||||||
emit_asm_label(ctx, ctx->beginsym, ctx->codesz, 0);
|
|
||||||
#else
|
|
||||||
emit_asm_label(ctx, ctx->beginsym, 0, 0);
|
|
||||||
#endif
|
|
||||||
if (ctx->mode != BUILD_machasm)
|
|
||||||
fprintf(ctx->fp, ".Lbegin:\n");
|
|
||||||
|
|
||||||
#if LJ_TARGET_ARM && defined(__GNUC__) && !LJ_NO_UNWIND
|
|
||||||
/* This should really be moved into buildvm_arm.dasc. */
|
|
||||||
#if LJ_ARCH_HASFPU
|
|
||||||
fprintf(ctx->fp,
|
|
||||||
".fnstart\n"
|
|
||||||
".save {r5, r6, r7, r8, r9, r10, r11, lr}\n"
|
|
||||||
".vsave {d8-d15}\n"
|
|
||||||
".save {r4}\n"
|
|
||||||
".pad #28\n");
|
|
||||||
#else
|
|
||||||
fprintf(ctx->fp,
|
|
||||||
".fnstart\n"
|
|
||||||
".save {r4, r5, r6, r7, r8, r9, r10, r11, lr}\n"
|
|
||||||
".pad #28\n");
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
for (i = rel = 0; i < ctx->nsym; i++) {
|
|
||||||
int32_t ofs = ctx->sym[i].ofs;
|
|
||||||
int32_t next = ctx->sym[i+1].ofs;
|
|
||||||
#if LJ_TARGET_ARM && defined(__GNUC__) && !LJ_NO_UNWIND && LJ_HASFFI
|
|
||||||
if (!strcmp(ctx->sym[i].name, "lj_vm_ffi_call"))
|
|
||||||
fprintf(ctx->fp,
|
|
||||||
".globl lj_err_unwind_arm\n"
|
|
||||||
".personality lj_err_unwind_arm\n"
|
|
||||||
".fnend\n"
|
|
||||||
".fnstart\n"
|
|
||||||
".save {r4, r5, r11, lr}\n"
|
|
||||||
".setfp r11, sp\n");
|
|
||||||
#endif
|
|
||||||
emit_asm_label(ctx, ctx->sym[i].name, next - ofs, 1);
|
|
||||||
while (rel < ctx->nreloc && ctx->reloc[rel].ofs <= next) {
|
|
||||||
BuildReloc *r = &ctx->reloc[rel];
|
|
||||||
int n = r->ofs - ofs;
|
|
||||||
#if LJ_TARGET_X86ORX64
|
|
||||||
if (r->type != 0 &&
|
|
||||||
(ctx->mode == BUILD_elfasm || ctx->mode == BUILD_machasm)) {
|
|
||||||
emit_asm_reloc_text(ctx, ctx->code+ofs, n, ctx->relocsym[r->sym]);
|
|
||||||
} else {
|
|
||||||
emit_asm_bytes(ctx, ctx->code+ofs, n);
|
|
||||||
emit_asm_reloc(ctx, r->type, ctx->relocsym[r->sym]);
|
|
||||||
}
|
|
||||||
ofs += n+4;
|
|
||||||
#else
|
|
||||||
emit_asm_wordreloc(ctx, ctx->code+ofs, n, ctx->relocsym[r->sym]);
|
|
||||||
ofs += n;
|
|
||||||
#endif
|
|
||||||
rel++;
|
|
||||||
}
|
|
||||||
#if LJ_TARGET_X86ORX64
|
|
||||||
emit_asm_bytes(ctx, ctx->code+ofs, next-ofs);
|
|
||||||
#else
|
|
||||||
emit_asm_words(ctx, ctx->code+ofs, next-ofs);
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
|
|
||||||
#if LJ_TARGET_ARM && defined(__GNUC__) && !LJ_NO_UNWIND
|
|
||||||
fprintf(ctx->fp,
|
|
||||||
#if !LJ_HASFFI
|
|
||||||
".globl lj_err_unwind_arm\n"
|
|
||||||
".personality lj_err_unwind_arm\n"
|
|
||||||
#endif
|
|
||||||
".fnend\n");
|
|
||||||
#endif
|
|
||||||
|
|
||||||
fprintf(ctx->fp, "\n");
|
|
||||||
switch (ctx->mode) {
|
|
||||||
case BUILD_elfasm:
|
|
||||||
#if !(LJ_TARGET_PS3 || LJ_TARGET_PSVITA)
|
|
||||||
fprintf(ctx->fp, "\t.section .note.GNU-stack,\"\"," ELFASM_PX "progbits\n");
|
|
||||||
#endif
|
|
||||||
#if LJ_TARGET_PPC && !LJ_TARGET_PS3 && !LJ_ABI_SOFTFP
|
|
||||||
/* Hard-float ABI. */
|
|
||||||
fprintf(ctx->fp, "\t.gnu_attribute 4, 1\n");
|
|
||||||
#endif
|
|
||||||
/* fallthrough */
|
|
||||||
case BUILD_coffasm:
|
|
||||||
fprintf(ctx->fp, "\t.ident \"%s\"\n", ctx->dasm_ident);
|
|
||||||
break;
|
|
||||||
case BUILD_machasm:
|
|
||||||
#if defined(__apple_build_version__) && __apple_build_version__ >= 15000000 && __apple_build_version__ < 15000300
|
|
||||||
/* Workaround for XCode 15.0 - 15.2. */
|
|
||||||
fprintf(ctx->fp, "\t.subsections_via_symbols\n");
|
|
||||||
#endif
|
|
||||||
fprintf(ctx->fp,
|
|
||||||
"\t.cstring\n"
|
|
||||||
"\t.ascii \"%s\\0\"\n", ctx->dasm_ident);
|
|
||||||
break;
|
|
||||||
default:
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
fprintf(ctx->fp, "\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
@@ -1,236 +0,0 @@
|
|||||||
/*
|
|
||||||
** LuaJIT VM builder: IR folding hash table generator.
|
|
||||||
** Copyright (C) 2005-2023 Mike Pall. See Copyright Notice in luajit.h
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "buildvm.h"
|
|
||||||
#include "lj_obj.h"
|
|
||||||
#if LJ_HASJIT
|
|
||||||
#include "lj_ir.h"
|
|
||||||
|
|
||||||
/* Context for the folding hash table generator. */
|
|
||||||
static int lineno;
|
|
||||||
static uint32_t funcidx;
|
|
||||||
static uint32_t foldkeys[BUILD_MAX_FOLD];
|
|
||||||
static uint32_t nkeys;
|
|
||||||
|
|
||||||
/* Try to fill the hash table with keys using the hash parameters. */
|
|
||||||
static int tryhash(uint32_t *htab, uint32_t sz, uint32_t r, int dorol)
|
|
||||||
{
|
|
||||||
uint32_t i;
|
|
||||||
if (dorol && ((r & 31) == 0 || (r>>5) == 0))
|
|
||||||
return 0; /* Avoid zero rotates. */
|
|
||||||
memset(htab, 0xff, (sz+1)*sizeof(uint32_t));
|
|
||||||
for (i = 0; i < nkeys; i++) {
|
|
||||||
uint32_t key = foldkeys[i];
|
|
||||||
uint32_t k = key & 0xffffff;
|
|
||||||
uint32_t h = (dorol ? lj_rol(lj_rol(k, r>>5) - k, r&31) :
|
|
||||||
(((k << (r>>5)) - k) << (r&31))) % sz;
|
|
||||||
if (htab[h] != 0xffffffff) { /* Collision on primary slot. */
|
|
||||||
if (htab[h+1] != 0xffffffff) { /* Collision on secondary slot. */
|
|
||||||
/* Try to move the colliding key, if possible. */
|
|
||||||
if (h < sz-1 && htab[h+2] == 0xffffffff) {
|
|
||||||
uint32_t k2 = htab[h+1] & 0xffffff;
|
|
||||||
uint32_t h2 = (dorol ? lj_rol(lj_rol(k2, r>>5) - k2, r&31) :
|
|
||||||
(((k2 << (r>>5)) - k2) << (r&31))) % sz;
|
|
||||||
if (h2 != h+1) return 0; /* Cannot resolve collision. */
|
|
||||||
htab[h+2] = htab[h+1]; /* Move colliding key to secondary slot. */
|
|
||||||
} else {
|
|
||||||
return 0; /* Collision. */
|
|
||||||
}
|
|
||||||
}
|
|
||||||
htab[h+1] = key;
|
|
||||||
} else {
|
|
||||||
htab[h] = key;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return 1; /* Success, all keys could be stored. */
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Print the generated hash table. */
|
|
||||||
static void printhash(BuildCtx *ctx, uint32_t *htab, uint32_t sz)
|
|
||||||
{
|
|
||||||
uint32_t i;
|
|
||||||
fprintf(ctx->fp, "static const uint32_t fold_hash[%d] = {\n0x%08x",
|
|
||||||
sz+1, htab[0]);
|
|
||||||
for (i = 1; i < sz+1; i++)
|
|
||||||
fprintf(ctx->fp, ",\n0x%08x", htab[i]);
|
|
||||||
fprintf(ctx->fp, "\n};\n\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Exhaustive search for the shortest semi-perfect hash table. */
|
|
||||||
static void makehash(BuildCtx *ctx)
|
|
||||||
{
|
|
||||||
uint32_t htab[BUILD_MAX_FOLD*2+1];
|
|
||||||
uint32_t sz, r;
|
|
||||||
/* Search for the smallest hash table with an odd size. */
|
|
||||||
for (sz = (nkeys|1); sz < BUILD_MAX_FOLD*2; sz += 2) {
|
|
||||||
/* First try all shift hash combinations. */
|
|
||||||
for (r = 0; r < 32*32; r++) {
|
|
||||||
if (tryhash(htab, sz, r, 0)) {
|
|
||||||
printhash(ctx, htab, sz);
|
|
||||||
fprintf(ctx->fp,
|
|
||||||
"#define fold_hashkey(k)\t(((((k)<<%u)-(k))<<%u)%%%u)\n\n",
|
|
||||||
r>>5, r&31, sz);
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
/* Then try all rotate hash combinations. */
|
|
||||||
for (r = 0; r < 32*32; r++) {
|
|
||||||
if (tryhash(htab, sz, r, 1)) {
|
|
||||||
printhash(ctx, htab, sz);
|
|
||||||
fprintf(ctx->fp,
|
|
||||||
"#define fold_hashkey(k)\t(lj_rol(lj_rol((k),%u)-(k),%u)%%%u)\n\n",
|
|
||||||
r>>5, r&31, sz);
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
fprintf(stderr, "Error: search for perfect hash failed\n");
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Parse one token of a fold rule. */
|
|
||||||
static uint32_t nexttoken(char **pp, int allowlit, int allowany)
|
|
||||||
{
|
|
||||||
char *p = *pp;
|
|
||||||
if (p) {
|
|
||||||
uint32_t i;
|
|
||||||
char *q = strchr(p, ' ');
|
|
||||||
if (q) *q++ = '\0';
|
|
||||||
*pp = q;
|
|
||||||
if (allowlit && !strncmp(p, "IRFPM_", 6)) {
|
|
||||||
for (i = 0; irfpm_names[i]; i++)
|
|
||||||
if (!strcmp(irfpm_names[i], p+6))
|
|
||||||
return i;
|
|
||||||
} else if (allowlit && !strncmp(p, "IRFL_", 5)) {
|
|
||||||
for (i = 0; irfield_names[i]; i++)
|
|
||||||
if (!strcmp(irfield_names[i], p+5))
|
|
||||||
return i;
|
|
||||||
} else if (allowlit && !strncmp(p, "IRCALL_", 7)) {
|
|
||||||
for (i = 0; ircall_names[i]; i++)
|
|
||||||
if (!strcmp(ircall_names[i], p+7))
|
|
||||||
return i;
|
|
||||||
} else if (allowlit && !strncmp(p, "IRCONV_", 7)) {
|
|
||||||
for (i = 0; irt_names[i]; i++) {
|
|
||||||
const char *r = strchr(p+7, '_');
|
|
||||||
if (r && !strncmp(irt_names[i], p+7, r-(p+7))) {
|
|
||||||
uint32_t j;
|
|
||||||
for (j = 0; irt_names[j]; j++)
|
|
||||||
if (!strcmp(irt_names[j], r+1))
|
|
||||||
return (i << 5) + j;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
} else if (allowlit && *p >= '0' && *p <= '9') {
|
|
||||||
for (i = 0; *p >= '0' && *p <= '9'; p++)
|
|
||||||
i = i*10 + (*p - '0');
|
|
||||||
if (*p == '\0')
|
|
||||||
return i;
|
|
||||||
} else if (allowany && !strcmp("any", p)) {
|
|
||||||
return allowany;
|
|
||||||
} else {
|
|
||||||
for (i = 0; ir_names[i]; i++)
|
|
||||||
if (!strcmp(ir_names[i], p))
|
|
||||||
return i;
|
|
||||||
}
|
|
||||||
fprintf(stderr, "Error: bad fold definition token \"%s\" at line %d\n", p, lineno);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Parse a fold rule. */
|
|
||||||
static void foldrule(char *p)
|
|
||||||
{
|
|
||||||
uint32_t op = nexttoken(&p, 0, 0);
|
|
||||||
uint32_t left = nexttoken(&p, 0, 0x7f);
|
|
||||||
uint32_t right = nexttoken(&p, 1, 0x3ff);
|
|
||||||
uint32_t key = (funcidx << 24) | (op << 17) | (left << 10) | right;
|
|
||||||
uint32_t i;
|
|
||||||
if (nkeys >= BUILD_MAX_FOLD) {
|
|
||||||
fprintf(stderr, "Error: too many fold rules, increase BUILD_MAX_FOLD.\n");
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
/* Simple insertion sort to detect duplicates. */
|
|
||||||
for (i = nkeys; i > 0; i--) {
|
|
||||||
if ((foldkeys[i-1]&0xffffff) < (key & 0xffffff))
|
|
||||||
break;
|
|
||||||
if ((foldkeys[i-1]&0xffffff) == (key & 0xffffff)) {
|
|
||||||
fprintf(stderr, "Error: duplicate fold definition at line %d\n", lineno);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
foldkeys[i] = foldkeys[i-1];
|
|
||||||
}
|
|
||||||
foldkeys[i] = key;
|
|
||||||
nkeys++;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Emit C source code for IR folding hash table. */
|
|
||||||
void emit_fold(BuildCtx *ctx)
|
|
||||||
{
|
|
||||||
char buf[256]; /* We don't care about analyzing lines longer than that. */
|
|
||||||
const char *fname = ctx->args[0];
|
|
||||||
FILE *fp;
|
|
||||||
|
|
||||||
if (fname == NULL) {
|
|
||||||
fprintf(stderr, "Error: missing input filename\n");
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (fname[0] == '-' && fname[1] == '\0') {
|
|
||||||
fp = stdin;
|
|
||||||
} else {
|
|
||||||
fp = fopen(fname, "r");
|
|
||||||
if (!fp) {
|
|
||||||
fprintf(stderr, "Error: cannot open input file '%s': %s\n",
|
|
||||||
fname, strerror(errno));
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fprintf(ctx->fp, "/* This is a generated file. DO NOT EDIT! */\n\n");
|
|
||||||
fprintf(ctx->fp, "static const FoldFunc fold_func[] = {\n");
|
|
||||||
|
|
||||||
lineno = 0;
|
|
||||||
funcidx = 0;
|
|
||||||
nkeys = 0;
|
|
||||||
while (fgets(buf, sizeof(buf), fp) != NULL) {
|
|
||||||
lineno++;
|
|
||||||
/* The prefix must be at the start of a line, otherwise it's ignored. */
|
|
||||||
if (!strncmp(buf, FOLDDEF_PREFIX, sizeof(FOLDDEF_PREFIX)-1)) {
|
|
||||||
char *p = buf+sizeof(FOLDDEF_PREFIX)-1;
|
|
||||||
char *q = strchr(p, ')');
|
|
||||||
if (p[0] == '(' && q) {
|
|
||||||
p++;
|
|
||||||
*q = '\0';
|
|
||||||
foldrule(p);
|
|
||||||
} else if ((p[0] == 'F' || p[0] == 'X') && p[1] == '(' && q) {
|
|
||||||
p += 2;
|
|
||||||
*q = '\0';
|
|
||||||
if (funcidx)
|
|
||||||
fprintf(ctx->fp, ",\n");
|
|
||||||
if (p[-2] == 'X')
|
|
||||||
fprintf(ctx->fp, " %s", p);
|
|
||||||
else
|
|
||||||
fprintf(ctx->fp, " fold_%s", p);
|
|
||||||
funcidx++;
|
|
||||||
} else {
|
|
||||||
buf[strlen(buf)-1] = '\0';
|
|
||||||
fprintf(stderr, "Error: unknown fold definition tag %s%s at line %d\n",
|
|
||||||
FOLDDEF_PREFIX, p, lineno);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
fclose(fp);
|
|
||||||
fprintf(ctx->fp, "\n};\n\n");
|
|
||||||
|
|
||||||
makehash(ctx);
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
void emit_fold(BuildCtx *ctx)
|
|
||||||
{
|
|
||||||
UNUSED(ctx);
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
@@ -1,470 +0,0 @@
|
|||||||
/*
|
|
||||||
** LuaJIT VM builder: library definition compiler.
|
|
||||||
** Copyright (C) 2005-2023 Mike Pall. See Copyright Notice in luajit.h
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "buildvm.h"
|
|
||||||
#include "lj_obj.h"
|
|
||||||
#include "lj_bc.h"
|
|
||||||
#include "lj_lib.h"
|
|
||||||
#include "buildvm_libbc.h"
|
|
||||||
|
|
||||||
/* Context for library definitions. */
|
|
||||||
static uint8_t obuf[8192];
|
|
||||||
static uint8_t *optr;
|
|
||||||
static char modname[80];
|
|
||||||
static size_t modnamelen;
|
|
||||||
static char funcname[80];
|
|
||||||
static int modstate, regfunc;
|
|
||||||
static int ffid, recffid, ffasmfunc;
|
|
||||||
|
|
||||||
enum {
|
|
||||||
REGFUNC_OK,
|
|
||||||
REGFUNC_NOREG,
|
|
||||||
REGFUNC_NOREGUV
|
|
||||||
};
|
|
||||||
|
|
||||||
static void libdef_name(const char *p, int kind)
|
|
||||||
{
|
|
||||||
size_t n = strlen(p);
|
|
||||||
if (kind != LIBINIT_STRING) {
|
|
||||||
if (n > modnamelen && p[modnamelen] == '_' &&
|
|
||||||
!strncmp(p, modname, modnamelen)) {
|
|
||||||
p += modnamelen+1;
|
|
||||||
n -= modnamelen+1;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (n > LIBINIT_MAXSTR) {
|
|
||||||
fprintf(stderr, "Error: string too long: '%s'\n", p);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
if (optr+1+n+2 > obuf+sizeof(obuf)) { /* +2 for caller. */
|
|
||||||
fprintf(stderr, "Error: output buffer overflow\n");
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
*optr++ = (uint8_t)(n | kind);
|
|
||||||
memcpy(optr, p, n);
|
|
||||||
optr += n;
|
|
||||||
}
|
|
||||||
|
|
||||||
static void libdef_endmodule(BuildCtx *ctx)
|
|
||||||
{
|
|
||||||
if (modstate != 0) {
|
|
||||||
char line[80];
|
|
||||||
const uint8_t *p;
|
|
||||||
int n;
|
|
||||||
if (modstate == 1)
|
|
||||||
fprintf(ctx->fp, " (lua_CFunction)0");
|
|
||||||
fprintf(ctx->fp, "\n};\n");
|
|
||||||
fprintf(ctx->fp, "static const uint8_t %s%s[] = {\n",
|
|
||||||
LABEL_PREFIX_LIBINIT, modname);
|
|
||||||
line[0] = '\0';
|
|
||||||
for (n = 0, p = obuf; p < optr; p++) {
|
|
||||||
n += sprintf(line+n, "%d,", *p);
|
|
||||||
if (n >= 75) {
|
|
||||||
fprintf(ctx->fp, "%s\n", line);
|
|
||||||
n = 0;
|
|
||||||
line[0] = '\0';
|
|
||||||
}
|
|
||||||
}
|
|
||||||
fprintf(ctx->fp, "%s%d\n};\n#endif\n\n", line, LIBINIT_END);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static void libdef_module(BuildCtx *ctx, char *p, int arg)
|
|
||||||
{
|
|
||||||
UNUSED(arg);
|
|
||||||
if (ctx->mode == BUILD_libdef) {
|
|
||||||
libdef_endmodule(ctx);
|
|
||||||
optr = obuf;
|
|
||||||
*optr++ = (uint8_t)ffid;
|
|
||||||
*optr++ = (uint8_t)ffasmfunc;
|
|
||||||
*optr++ = 0; /* Hash table size. */
|
|
||||||
modstate = 1;
|
|
||||||
fprintf(ctx->fp, "#ifdef %sMODULE_%s\n", LIBDEF_PREFIX, p);
|
|
||||||
fprintf(ctx->fp, "#undef %sMODULE_%s\n", LIBDEF_PREFIX, p);
|
|
||||||
fprintf(ctx->fp, "static const lua_CFunction %s%s[] = {\n",
|
|
||||||
LABEL_PREFIX_LIBCF, p);
|
|
||||||
}
|
|
||||||
modnamelen = strlen(p);
|
|
||||||
if (modnamelen > sizeof(modname)-1) {
|
|
||||||
fprintf(stderr, "Error: module name too long: '%s'\n", p);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
strcpy(modname, p);
|
|
||||||
}
|
|
||||||
|
|
||||||
static int find_ffofs(BuildCtx *ctx, const char *name)
|
|
||||||
{
|
|
||||||
int i;
|
|
||||||
for (i = 0; i < ctx->nglob; i++) {
|
|
||||||
const char *gl = ctx->globnames[i];
|
|
||||||
if (gl[0] == 'f' && gl[1] == 'f' && gl[2] == '_' && !strcmp(gl+3, name)) {
|
|
||||||
return (int)((uint8_t *)ctx->glob[i] - ctx->code);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
fprintf(stderr, "Error: undefined fast function %s%s\n",
|
|
||||||
LABEL_PREFIX_FF, name);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
|
|
||||||
static void libdef_func(BuildCtx *ctx, char *p, int arg)
|
|
||||||
{
|
|
||||||
if (arg != LIBINIT_CF)
|
|
||||||
ffasmfunc++;
|
|
||||||
if (ctx->mode == BUILD_libdef) {
|
|
||||||
if (modstate == 0) {
|
|
||||||
fprintf(stderr, "Error: no module for function definition %s\n", p);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
if (regfunc == REGFUNC_NOREG) {
|
|
||||||
if (optr+1 > obuf+sizeof(obuf)) {
|
|
||||||
fprintf(stderr, "Error: output buffer overflow\n");
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
*optr++ = LIBINIT_FFID;
|
|
||||||
} else {
|
|
||||||
if (arg != LIBINIT_ASM_) {
|
|
||||||
if (modstate != 1) fprintf(ctx->fp, ",\n");
|
|
||||||
modstate = 2;
|
|
||||||
fprintf(ctx->fp, " %s%s", arg ? LABEL_PREFIX_FFH : LABEL_PREFIX_CF, p);
|
|
||||||
}
|
|
||||||
if (regfunc != REGFUNC_NOREGUV) obuf[2]++; /* Bump hash table size. */
|
|
||||||
libdef_name(regfunc == REGFUNC_NOREGUV ? "" : p, arg);
|
|
||||||
}
|
|
||||||
} else if (ctx->mode == BUILD_ffdef) {
|
|
||||||
fprintf(ctx->fp, "FFDEF(%s)\n", p);
|
|
||||||
} else if (ctx->mode == BUILD_recdef) {
|
|
||||||
if (strlen(p) > sizeof(funcname)-1) {
|
|
||||||
fprintf(stderr, "Error: function name too long: '%s'\n", p);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
strcpy(funcname, p);
|
|
||||||
} else if (ctx->mode == BUILD_vmdef) {
|
|
||||||
int i;
|
|
||||||
for (i = 1; p[i] && modname[i-1]; i++)
|
|
||||||
if (p[i] == '_') p[i] = '.';
|
|
||||||
fprintf(ctx->fp, "\"%s\",\n", p);
|
|
||||||
} else if (ctx->mode == BUILD_bcdef) {
|
|
||||||
if (arg != LIBINIT_CF)
|
|
||||||
fprintf(ctx->fp, ",\n%d", find_ffofs(ctx, p));
|
|
||||||
}
|
|
||||||
ffid++;
|
|
||||||
regfunc = REGFUNC_OK;
|
|
||||||
}
|
|
||||||
|
|
||||||
static uint8_t *libdef_uleb128(uint8_t *p, uint32_t *vv)
|
|
||||||
{
|
|
||||||
uint32_t v = *p++;
|
|
||||||
if (v >= 0x80) {
|
|
||||||
int sh = 0; v &= 0x7f;
|
|
||||||
do { v |= ((*p & 0x7f) << (sh += 7)); } while (*p++ >= 0x80);
|
|
||||||
}
|
|
||||||
*vv = v;
|
|
||||||
return p;
|
|
||||||
}
|
|
||||||
|
|
||||||
static void libdef_fixupbc(uint8_t *p)
|
|
||||||
{
|
|
||||||
uint32_t i, sizebc;
|
|
||||||
p += 4;
|
|
||||||
p = libdef_uleb128(p, &sizebc);
|
|
||||||
p = libdef_uleb128(p, &sizebc);
|
|
||||||
p = libdef_uleb128(p, &sizebc);
|
|
||||||
for (i = 0; i < sizebc; i++, p += 4) {
|
|
||||||
uint8_t op = p[libbc_endian ? 3 : 0];
|
|
||||||
uint8_t ra = p[libbc_endian ? 2 : 1];
|
|
||||||
uint8_t rc = p[libbc_endian ? 1 : 2];
|
|
||||||
uint8_t rb = p[libbc_endian ? 0 : 3];
|
|
||||||
if (!LJ_DUALNUM && op == BC_ISTYPE && rc == ~LJ_TNUMX+1) {
|
|
||||||
op = BC_ISNUM; rc++;
|
|
||||||
}
|
|
||||||
p[LJ_ENDIAN_SELECT(0, 3)] = op;
|
|
||||||
p[LJ_ENDIAN_SELECT(1, 2)] = ra;
|
|
||||||
p[LJ_ENDIAN_SELECT(2, 1)] = rc;
|
|
||||||
p[LJ_ENDIAN_SELECT(3, 0)] = rb;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static void libdef_lua(BuildCtx *ctx, char *p, int arg)
|
|
||||||
{
|
|
||||||
UNUSED(arg);
|
|
||||||
if (ctx->mode == BUILD_libdef) {
|
|
||||||
int i;
|
|
||||||
for (i = 0; libbc_map[i].name != NULL; i++) {
|
|
||||||
if (!strcmp(libbc_map[i].name, p)) {
|
|
||||||
int ofs = libbc_map[i].ofs;
|
|
||||||
int len = libbc_map[i+1].ofs - ofs;
|
|
||||||
obuf[2]++; /* Bump hash table size. */
|
|
||||||
*optr++ = LIBINIT_LUA;
|
|
||||||
libdef_name(p, 0);
|
|
||||||
memcpy(optr, libbc_code + ofs, len);
|
|
||||||
libdef_fixupbc(optr);
|
|
||||||
optr += len;
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
fprintf(stderr, "Error: missing libbc definition for %s\n", p);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static uint32_t find_rec(char *name)
|
|
||||||
{
|
|
||||||
char *p = (char *)obuf;
|
|
||||||
uint32_t n;
|
|
||||||
for (n = 2; *p; n++) {
|
|
||||||
if (strcmp(p, name) == 0)
|
|
||||||
return n;
|
|
||||||
p += strlen(p)+1;
|
|
||||||
}
|
|
||||||
if (p+strlen(name)+1 >= (char *)obuf+sizeof(obuf)) {
|
|
||||||
fprintf(stderr, "Error: output buffer overflow\n");
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
strcpy(p, name);
|
|
||||||
return n;
|
|
||||||
}
|
|
||||||
|
|
||||||
static void libdef_rec(BuildCtx *ctx, char *p, int arg)
|
|
||||||
{
|
|
||||||
UNUSED(arg);
|
|
||||||
if (ctx->mode == BUILD_recdef) {
|
|
||||||
char *q;
|
|
||||||
uint32_t n;
|
|
||||||
for (; recffid+1 < ffid; recffid++)
|
|
||||||
fprintf(ctx->fp, ",\n0");
|
|
||||||
recffid = ffid;
|
|
||||||
if (*p == '.') p = funcname;
|
|
||||||
q = strchr(p, ' ');
|
|
||||||
if (q) *q++ = '\0';
|
|
||||||
n = find_rec(p);
|
|
||||||
if (q)
|
|
||||||
fprintf(ctx->fp, ",\n0x%02x00+(%s)", n, q);
|
|
||||||
else
|
|
||||||
fprintf(ctx->fp, ",\n0x%02x00", n);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static void memcpy_endian(void *dst, void *src, size_t n)
|
|
||||||
{
|
|
||||||
union { uint8_t b; uint32_t u; } host_endian;
|
|
||||||
host_endian.u = 1;
|
|
||||||
if (host_endian.b == LJ_ENDIAN_SELECT(1, 0)) {
|
|
||||||
memcpy(dst, src, n);
|
|
||||||
} else {
|
|
||||||
size_t i;
|
|
||||||
for (i = 0; i < n; i++)
|
|
||||||
((uint8_t *)dst)[i] = ((uint8_t *)src)[n-i-1];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static void libdef_push(BuildCtx *ctx, char *p, int arg)
|
|
||||||
{
|
|
||||||
UNUSED(arg);
|
|
||||||
if (ctx->mode == BUILD_libdef) {
|
|
||||||
int len = (int)strlen(p);
|
|
||||||
if (*p == '"') {
|
|
||||||
if (len > 1 && p[len-1] == '"') {
|
|
||||||
p[len-1] = '\0';
|
|
||||||
libdef_name(p+1, LIBINIT_STRING);
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
} else if (*p >= '0' && *p <= '9') {
|
|
||||||
char *ep;
|
|
||||||
double d = strtod(p, &ep);
|
|
||||||
if (*ep == '\0') {
|
|
||||||
if (optr+1+sizeof(double) > obuf+sizeof(obuf)) {
|
|
||||||
fprintf(stderr, "Error: output buffer overflow\n");
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
*optr++ = LIBINIT_NUMBER;
|
|
||||||
memcpy_endian(optr, &d, sizeof(double));
|
|
||||||
optr += sizeof(double);
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
} else if (!strcmp(p, "lastcl")) {
|
|
||||||
if (optr+1 > obuf+sizeof(obuf)) {
|
|
||||||
fprintf(stderr, "Error: output buffer overflow\n");
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
*optr++ = LIBINIT_LASTCL;
|
|
||||||
return;
|
|
||||||
} else if (len > 4 && !strncmp(p, "top-", 4)) {
|
|
||||||
if (optr+2 > obuf+sizeof(obuf)) {
|
|
||||||
fprintf(stderr, "Error: output buffer overflow\n");
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
*optr++ = LIBINIT_COPY;
|
|
||||||
*optr++ = (uint8_t)atoi(p+4);
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
fprintf(stderr, "Error: bad value for %sPUSH(%s)\n", LIBDEF_PREFIX, p);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static void libdef_set(BuildCtx *ctx, char *p, int arg)
|
|
||||||
{
|
|
||||||
UNUSED(arg);
|
|
||||||
if (ctx->mode == BUILD_libdef) {
|
|
||||||
if (p[0] == '!' && p[1] == '\0') p[0] = '\0'; /* Set env. */
|
|
||||||
libdef_name(p, LIBINIT_STRING);
|
|
||||||
*optr++ = LIBINIT_SET;
|
|
||||||
obuf[2]++; /* Bump hash table size. */
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static void libdef_regfunc(BuildCtx *ctx, char *p, int arg)
|
|
||||||
{
|
|
||||||
UNUSED(ctx); UNUSED(p);
|
|
||||||
regfunc = arg;
|
|
||||||
}
|
|
||||||
|
|
||||||
typedef void (*LibDefFunc)(BuildCtx *ctx, char *p, int arg);
|
|
||||||
|
|
||||||
typedef struct LibDefHandler {
|
|
||||||
const char *suffix;
|
|
||||||
const char *stop;
|
|
||||||
const LibDefFunc func;
|
|
||||||
const int arg;
|
|
||||||
} LibDefHandler;
|
|
||||||
|
|
||||||
static const LibDefHandler libdef_handlers[] = {
|
|
||||||
{ "MODULE_", " \t\r\n", libdef_module, 0 },
|
|
||||||
{ "CF(", ")", libdef_func, LIBINIT_CF },
|
|
||||||
{ "ASM(", ")", libdef_func, LIBINIT_ASM },
|
|
||||||
{ "ASM_(", ")", libdef_func, LIBINIT_ASM_ },
|
|
||||||
{ "LUA(", ")", libdef_lua, 0 },
|
|
||||||
{ "REC(", ")", libdef_rec, 0 },
|
|
||||||
{ "PUSH(", ")", libdef_push, 0 },
|
|
||||||
{ "SET(", ")", libdef_set, 0 },
|
|
||||||
{ "NOREGUV", NULL, libdef_regfunc, REGFUNC_NOREGUV },
|
|
||||||
{ "NOREG", NULL, libdef_regfunc, REGFUNC_NOREG },
|
|
||||||
{ NULL, NULL, (LibDefFunc)0, 0 }
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Emit C source code for library function definitions. */
|
|
||||||
void emit_lib(BuildCtx *ctx)
|
|
||||||
{
|
|
||||||
const char *fname;
|
|
||||||
|
|
||||||
if (ctx->mode == BUILD_ffdef || ctx->mode == BUILD_libdef ||
|
|
||||||
ctx->mode == BUILD_recdef)
|
|
||||||
fprintf(ctx->fp, "/* This is a generated file. DO NOT EDIT! */\n\n");
|
|
||||||
else if (ctx->mode == BUILD_vmdef)
|
|
||||||
fprintf(ctx->fp, "ffnames = {\n[0]=\"Lua\",\n\"C\",\n");
|
|
||||||
if (ctx->mode == BUILD_recdef)
|
|
||||||
fprintf(ctx->fp, "static const uint16_t recff_idmap[] = {\n0,\n0x0100");
|
|
||||||
recffid = ffid = FF_C+1;
|
|
||||||
ffasmfunc = 0;
|
|
||||||
|
|
||||||
while ((fname = *ctx->args++)) {
|
|
||||||
char buf[256]; /* We don't care about analyzing lines longer than that. */
|
|
||||||
FILE *fp;
|
|
||||||
if (fname[0] == '-' && fname[1] == '\0') {
|
|
||||||
fp = stdin;
|
|
||||||
} else {
|
|
||||||
fp = fopen(fname, "r");
|
|
||||||
if (!fp) {
|
|
||||||
fprintf(stderr, "Error: cannot open input file '%s': %s\n",
|
|
||||||
fname, strerror(errno));
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
modstate = 0;
|
|
||||||
regfunc = REGFUNC_OK;
|
|
||||||
while (fgets(buf, sizeof(buf), fp) != NULL) {
|
|
||||||
char *p;
|
|
||||||
/* Simplistic pre-processor. Only handles top-level #if/#endif. */
|
|
||||||
if (buf[0] == '#' && buf[1] == 'i' && buf[2] == 'f') {
|
|
||||||
int ok = 1;
|
|
||||||
size_t len = strlen(buf);
|
|
||||||
if (buf[len-1] == '\n') {
|
|
||||||
buf[len-1] = 0;
|
|
||||||
if (buf[len-2] == '\r') {
|
|
||||||
buf[len-2] = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (!strcmp(buf, "#if LJ_52"))
|
|
||||||
ok = LJ_52;
|
|
||||||
else if (!strcmp(buf, "#if LJ_HASJIT"))
|
|
||||||
ok = LJ_HASJIT;
|
|
||||||
else if (!strcmp(buf, "#if LJ_HASFFI"))
|
|
||||||
ok = LJ_HASFFI;
|
|
||||||
else if (!strcmp(buf, "#if LJ_HASBUFFER"))
|
|
||||||
ok = LJ_HASBUFFER;
|
|
||||||
else if (!strcmp(buf, "#if !LJ_SRB2LIB"))
|
|
||||||
ok = !LJ_SRB2LIB;
|
|
||||||
else if (!strcmp(buf, "#if !LJ_SRB2LIB || (LJ_SRB2LIB && LJ_SRB2IO)"))
|
|
||||||
ok = !LJ_SRB2LIB || (LJ_SRB2LIB && LJ_SRB2IO); /* whacky! */
|
|
||||||
if (!ok) {
|
|
||||||
int lvl = 1;
|
|
||||||
while (fgets(buf, sizeof(buf), fp) != NULL) {
|
|
||||||
if (buf[0] == '#' && buf[1] == 'e' && buf[2] == 'n') {
|
|
||||||
if (--lvl == 0) break;
|
|
||||||
} else if (buf[0] == '#' && buf[1] == 'i' && buf[2] == 'f') {
|
|
||||||
lvl++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
for (p = buf; (p = strstr(p, LIBDEF_PREFIX)) != NULL; ) {
|
|
||||||
const LibDefHandler *ldh;
|
|
||||||
p += sizeof(LIBDEF_PREFIX)-1;
|
|
||||||
for (ldh = libdef_handlers; ldh->suffix != NULL; ldh++) {
|
|
||||||
size_t n, len = strlen(ldh->suffix);
|
|
||||||
if (!strncmp(p, ldh->suffix, len)) {
|
|
||||||
p += len;
|
|
||||||
n = ldh->stop ? strcspn(p, ldh->stop) : 0;
|
|
||||||
if (!p[n]) break;
|
|
||||||
p[n] = '\0';
|
|
||||||
ldh->func(ctx, p, ldh->arg);
|
|
||||||
p += n+1;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (ldh->suffix == NULL) {
|
|
||||||
buf[strlen(buf)-1] = '\0';
|
|
||||||
fprintf(stderr, "Error: unknown library definition tag %s%s\n",
|
|
||||||
LIBDEF_PREFIX, p);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
fclose(fp);
|
|
||||||
if (ctx->mode == BUILD_libdef) {
|
|
||||||
libdef_endmodule(ctx);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (ctx->mode == BUILD_ffdef) {
|
|
||||||
fprintf(ctx->fp, "\n#undef FFDEF\n\n");
|
|
||||||
fprintf(ctx->fp,
|
|
||||||
"#ifndef FF_NUM_ASMFUNC\n#define FF_NUM_ASMFUNC %d\n#endif\n\n",
|
|
||||||
ffasmfunc);
|
|
||||||
} else if (ctx->mode == BUILD_vmdef) {
|
|
||||||
fprintf(ctx->fp, "},\n\n");
|
|
||||||
} else if (ctx->mode == BUILD_bcdef) {
|
|
||||||
int i;
|
|
||||||
fprintf(ctx->fp, "\n};\n\n");
|
|
||||||
fprintf(ctx->fp, "LJ_DATADEF const uint16_t lj_bc_mode[] = {\n");
|
|
||||||
fprintf(ctx->fp, "BCDEF(BCMODE)\n");
|
|
||||||
for (i = ffasmfunc-1; i > 0; i--)
|
|
||||||
fprintf(ctx->fp, "BCMODE_FF,\n");
|
|
||||||
fprintf(ctx->fp, "BCMODE_FF\n};\n\n");
|
|
||||||
} else if (ctx->mode == BUILD_recdef) {
|
|
||||||
char *p = (char *)obuf;
|
|
||||||
fprintf(ctx->fp, "\n};\n\n");
|
|
||||||
fprintf(ctx->fp, "static const RecordFunc recff_func[] = {\n"
|
|
||||||
"recff_nyi,\n"
|
|
||||||
"recff_c");
|
|
||||||
while (*p) {
|
|
||||||
fprintf(ctx->fp, ",\nrecff_%s", p);
|
|
||||||
p += strlen(p)+1;
|
|
||||||
}
|
|
||||||
fprintf(ctx->fp, "\n};\n\n");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
@@ -1,81 +0,0 @@
|
|||||||
/* This is a generated file. DO NOT EDIT! */
|
|
||||||
|
|
||||||
static const int libbc_endian = 0;
|
|
||||||
|
|
||||||
static const uint8_t libbc_code[] = {
|
|
||||||
#if LJ_FR2
|
|
||||||
/* math.deg */ 0,1,2,0,0,1,2,BC_MULVN,1,0,0,BC_RET1,1,2,0,241,135,158,166,3,
|
|
||||||
220,203,178,130,4,
|
|
||||||
/* math.rad */ 0,1,2,0,0,1,2,BC_MULVN,1,0,0,BC_RET1,1,2,0,243,244,148,165,20,
|
|
||||||
198,190,199,252,3,
|
|
||||||
/* string.len */ 0,1,2,0,0,0,3,BC_ISTYPE,0,5,0,BC_LEN,1,0,0,BC_RET1,1,2,0,
|
|
||||||
/* table.foreachi */ 0,2,10,0,0,0,15,BC_ISTYPE,0,12,0,BC_ISTYPE,1,9,0,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
BC_RET1,6,2,0,BC_FORL,2,248,127,BC_RET0,0,1,0,
|
|
||||||
/* table.foreach */ 0,2,11,0,0,1,16,BC_ISTYPE,0,12,0,BC_ISTYPE,1,9,0,BC_KPRI,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
BC_ITERN,5,3,3,BC_ITERL,5,247,127,BC_RET0,0,1,0,1,255,255,249,255,15,
|
|
||||||
/* table.getn */ 0,1,2,0,0,0,3,BC_ISTYPE,0,12,0,BC_LEN,1,0,0,BC_RET1,1,2,0,
|
|
||||||
/* table.remove */ 0,2,10,0,0,2,30,BC_ISTYPE,0,12,0,BC_LEN,2,0,0,BC_ISNEP,1,0,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
BC_RET1,3,2,0,BC_RET0,0,1,0,0,2,
|
|
||||||
/* table.move */ 0,5,12,0,0,0,35,BC_ISTYPE,0,12,0,BC_ISTYPE,1,14,0,BC_ISTYPE,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
BC_KSHORT,8,255,255,BC_FORI,6,4,128,BC_ADDVV,10,5,9,BC_TGETR,11,9,0,BC_TSETR,
|
|
||||||
11,10,4,BC_FORL,6,252,127,BC_RET1,4,2,0,
|
|
||||||
#else
|
|
||||||
/* math.deg */ 0,1,2,0,0,1,2,BC_MULVN,1,0,0,BC_RET1,1,2,0,241,135,158,166,3,
|
|
||||||
220,203,178,130,4,
|
|
||||||
/* math.rad */ 0,1,2,0,0,1,2,BC_MULVN,1,0,0,BC_RET1,1,2,0,243,244,148,165,20,
|
|
||||||
198,190,199,252,3,
|
|
||||||
/* string.len */ 0,1,2,0,0,0,3,BC_ISTYPE,0,5,0,BC_LEN,1,0,0,BC_RET1,1,2,0,
|
|
||||||
/* table.foreachi */ 0,2,9,0,0,0,15,BC_ISTYPE,0,12,0,BC_ISTYPE,1,9,0,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
BC_RET1,6,2,0,BC_FORL,2,248,127,BC_RET0,0,1,0,
|
|
||||||
/* table.foreach */ 0,2,10,0,0,1,16,BC_ISTYPE,0,12,0,BC_ISTYPE,1,9,0,BC_KPRI,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
BC_ITERN,5,3,3,BC_ITERL,5,247,127,BC_RET0,0,1,0,1,255,255,249,255,15,
|
|
||||||
/* table.getn */ 0,1,2,0,0,0,3,BC_ISTYPE,0,12,0,BC_LEN,1,0,0,BC_RET1,1,2,0,
|
|
||||||
/* table.remove */ 0,2,10,0,0,2,30,BC_ISTYPE,0,12,0,BC_LEN,2,0,0,BC_ISNEP,1,0,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
BC_RET1,3,2,0,BC_RET0,0,1,0,0,2,
|
|
||||||
/* table.move */ 0,5,12,0,0,0,35,BC_ISTYPE,0,12,0,BC_ISTYPE,1,14,0,BC_ISTYPE,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
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,
|
|
||||||
BC_KSHORT,8,255,255,BC_FORI,6,4,128,BC_ADDVV,10,5,9,BC_TGETR,11,9,0,BC_TSETR,
|
|
||||||
11,10,4,BC_FORL,6,252,127,BC_RET1,4,2,0,
|
|
||||||
#endif
|
|
||||||
0
|
|
||||||
};
|
|
||||||
|
|
||||||
static const struct { const char *name; int ofs; } libbc_map[] = {
|
|
||||||
{"math_deg",0},
|
|
||||||
{"math_rad",25},
|
|
||||||
{"string_len",50},
|
|
||||||
{"table_foreachi",69},
|
|
||||||
{"table_foreach",136},
|
|
||||||
{"table_getn",213},
|
|
||||||
{"table_remove",232},
|
|
||||||
{"table_move",361},
|
|
||||||
{NULL,508}
|
|
||||||
};
|
|
||||||
|
|
||||||
Loaded 100 of 478 files, more files were not shown because too many files have changed in this diff.
Show more
Reference in new issue
Block a user