1.1--- a/ffi.lisp Mon May 08 21:11:03 2023 -0400
1.2+++ b/ffi.lisp Fri May 12 22:58:05 2023 -0400
1.3@@ -4,4 +4,8 @@
1.4 (:win32 (:default "demo"))
1.5 (t (:default "libdemo")))
1.6
1.7-(use-foreign-library "./target/release/libdemo.dylib")
1.8+(defun install-demo-lib (&optional path)
1.9+ (if path
1.10+ (use-foreign-library path)
1.11+ (let ((path (rs-find-dll "libdemo.dylib")))
1.12+ (use-foreign-library path))))
2.1--- /dev/null Thu Jan 01 00:00:00 1970 +0000
2.2+++ b/fig/tests/core.fr Fri May 12 22:58:05 2023 -0400
2.3@@ -0,0 +1,1003 @@
2.4+\ From: John Hayes S1I
2.5+\ Subject: core.fr
2.6+\ Date: Mon, 27 Nov 95 13:10
2.7+
2.8+\ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
2.9+\ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
2.10+\ VERSION 1.2
2.11+\ THIS PROGRAM TESTS THE CORE WORDS OF AN ANS FORTH SYSTEM.
2.12+\ THE PROGRAM ASSUMES A TWO'S COMPLEMENT IMPLEMENTATION WHERE
2.13+\ THE RANGE OF SIGNED NUMBERS IS -2^(N-1) ... 2^(N-1)-1 AND
2.14+\ THE RANGE OF UNSIGNED NUMBERS IS 0 ... 2^(N)-1.
2.15+\ I HAVEN'T FIGURED OUT HOW TO TEST KEY, QUIT, ABORT, OR ABORT"...
2.16+\ I ALSO HAVEN'T THOUGHT OF A WAY TO TEST ENVIRONMENT?...
2.17+
2.18+CR
2.19+TESTING CORE WORDS
2.20+HEX
2.21+
2.22+\ ------------------------------------------------------------------------
2.23+TESTING BASIC ASSUMPTIONS
2.24+
2.25+T{ -> }T \ START WITH CLEAN SLATE
2.26+( TEST IF ANY BITS ARE SET; ANSWER IN BASE 1 )
2.27+T{ : BITSSET? IF 0 0 ELSE 0 THEN ; -> }T
2.28+T{ 0 BITSSET? -> 0 }T ( ZERO IS ALL BITS CLEAR )
2.29+T{ 1 BITSSET? -> 0 0 }T ( OTHER NUMBER HAVE AT LEAST ONE BIT )
2.30+T{ -1 BITSSET? -> 0 0 }T
2.31+
2.32+\ ------------------------------------------------------------------------
2.33+TESTING BOOLEANS: INVERT AND OR XOR
2.34+
2.35+T{ 0 0 AND -> 0 }T
2.36+T{ 0 1 AND -> 0 }T
2.37+T{ 1 0 AND -> 0 }T
2.38+T{ 1 1 AND -> 1 }T
2.39+
2.40+T{ 0 INVERT 1 AND -> 1 }T
2.41+T{ 1 INVERT 1 AND -> 0 }T
2.42+
2.43+0 CONSTANT 0S
2.44+0 INVERT CONSTANT 1S
2.45+
2.46+T{ 0S INVERT -> 1S }T
2.47+T{ 1S INVERT -> 0S }T
2.48+
2.49+T{ 0S 0S AND -> 0S }T
2.50+T{ 0S 1S AND -> 0S }T
2.51+T{ 1S 0S AND -> 0S }T
2.52+T{ 1S 1S AND -> 1S }T
2.53+
2.54+T{ 0S 0S OR -> 0S }T
2.55+T{ 0S 1S OR -> 1S }T
2.56+T{ 1S 0S OR -> 1S }T
2.57+T{ 1S 1S OR -> 1S }T
2.58+
2.59+T{ 0S 0S XOR -> 0S }T
2.60+T{ 0S 1S XOR -> 1S }T
2.61+T{ 1S 0S XOR -> 1S }T
2.62+T{ 1S 1S XOR -> 0S }T
2.63+
2.64+\ ------------------------------------------------------------------------
2.65+TESTING 2* 2/ LSHIFT RSHIFT
2.66+
2.67+( WE TRUST 1S, INVERT, AND BITSSET?; WE WILL CONFIRM RSHIFT LATER )
2.68+1S 1 RSHIFT INVERT CONSTANT MSB
2.69+T{ MSB BITSSET? -> 0 0 }T
2.70+
2.71+T{ 0S 2* -> 0S }T
2.72+T{ 1 2* -> 2 }T
2.73+T{ 4000 2* -> 8000 }T
2.74+T{ 1S 2* 1 XOR -> 1S }T
2.75+T{ MSB 2* -> 0S }T
2.76+
2.77+T{ 0S 2/ -> 0S }T
2.78+T{ 1 2/ -> 0 }T
2.79+T{ 4000 2/ -> 2000 }T
2.80+T{ 1S 2/ -> 1S }T \ MSB PROPOGATED
2.81+T{ 1S 1 XOR 2/ -> 1S }T
2.82+T{ MSB 2/ MSB AND -> MSB }T
2.83+
2.84+T{ 1 0 LSHIFT -> 1 }T
2.85+T{ 1 1 LSHIFT -> 2 }T
2.86+T{ 1 2 LSHIFT -> 4 }T
2.87+T{ 1 F LSHIFT -> 8000 }T \ BIGGEST GUARANTEED SHIFT
2.88+T{ 1S 1 LSHIFT 1 XOR -> 1S }T
2.89+T{ MSB 1 LSHIFT -> 0 }T
2.90+
2.91+T{ 1 0 RSHIFT -> 1 }T
2.92+T{ 1 1 RSHIFT -> 0 }T
2.93+T{ 2 1 RSHIFT -> 1 }T
2.94+T{ 4 2 RSHIFT -> 1 }T
2.95+T{ 8000 F RSHIFT -> 1 }T \ BIGGEST
2.96+T{ MSB 1 RSHIFT MSB AND -> 0 }T \ RSHIFT ZERO FILLS MSBS
2.97+T{ MSB 1 RSHIFT 2* -> MSB }T
2.98+
2.99+\ ------------------------------------------------------------------------
2.100+TESTING COMPARISONS: 0= = 0< < > U< MIN MAX
2.101+0 INVERT CONSTANT MAX-UINT
2.102+0 INVERT 1 RSHIFT CONSTANT MAX-INT
2.103+0 INVERT 1 RSHIFT INVERT CONSTANT MIN-INT
2.104+0 INVERT 1 RSHIFT CONSTANT MID-UINT
2.105+0 INVERT 1 RSHIFT INVERT CONSTANT MID-UINT+1
2.106+
2.107+0S CONSTANT <FALSE>
2.108+1S CONSTANT <TRUE>
2.109+
2.110+T{ 0 0= -> <TRUE> }T
2.111+T{ 1 0= -> <FALSE> }T
2.112+T{ 2 0= -> <FALSE> }T
2.113+T{ -1 0= -> <FALSE> }T
2.114+T{ MAX-UINT 0= -> <FALSE> }T
2.115+T{ MIN-INT 0= -> <FALSE> }T
2.116+T{ MAX-INT 0= -> <FALSE> }T
2.117+
2.118+T{ 0 0 = -> <TRUE> }T
2.119+T{ 1 1 = -> <TRUE> }T
2.120+T{ -1 -1 = -> <TRUE> }T
2.121+T{ 1 0 = -> <FALSE> }T
2.122+T{ -1 0 = -> <FALSE> }T
2.123+T{ 0 1 = -> <FALSE> }T
2.124+T{ 0 -1 = -> <FALSE> }T
2.125+
2.126+T{ 0 0< -> <FALSE> }T
2.127+T{ -1 0< -> <TRUE> }T
2.128+T{ MIN-INT 0< -> <TRUE> }T
2.129+T{ 1 0< -> <FALSE> }T
2.130+T{ MAX-INT 0< -> <FALSE> }T
2.131+
2.132+T{ 0 1 < -> <TRUE> }T
2.133+T{ 1 2 < -> <TRUE> }T
2.134+T{ -1 0 < -> <TRUE> }T
2.135+T{ -1 1 < -> <TRUE> }T
2.136+T{ MIN-INT 0 < -> <TRUE> }T
2.137+T{ MIN-INT MAX-INT < -> <TRUE> }T
2.138+T{ 0 MAX-INT < -> <TRUE> }T
2.139+T{ 0 0 < -> <FALSE> }T
2.140+T{ 1 1 < -> <FALSE> }T
2.141+T{ 1 0 < -> <FALSE> }T
2.142+T{ 2 1 < -> <FALSE> }T
2.143+T{ 0 -1 < -> <FALSE> }T
2.144+T{ 1 -1 < -> <FALSE> }T
2.145+T{ 0 MIN-INT < -> <FALSE> }T
2.146+T{ MAX-INT MIN-INT < -> <FALSE> }T
2.147+T{ MAX-INT 0 < -> <FALSE> }T
2.148+
2.149+T{ 0 1 > -> <FALSE> }T
2.150+T{ 1 2 > -> <FALSE> }T
2.151+T{ -1 0 > -> <FALSE> }T
2.152+T{ -1 1 > -> <FALSE> }T
2.153+T{ MIN-INT 0 > -> <FALSE> }T
2.154+T{ MIN-INT MAX-INT > -> <FALSE> }T
2.155+T{ 0 MAX-INT > -> <FALSE> }T
2.156+T{ 0 0 > -> <FALSE> }T
2.157+T{ 1 1 > -> <FALSE> }T
2.158+T{ 1 0 > -> <TRUE> }T
2.159+T{ 2 1 > -> <TRUE> }T
2.160+T{ 0 -1 > -> <TRUE> }T
2.161+T{ 1 -1 > -> <TRUE> }T
2.162+T{ 0 MIN-INT > -> <TRUE> }T
2.163+T{ MAX-INT MIN-INT > -> <TRUE> }T
2.164+T{ MAX-INT 0 > -> <TRUE> }T
2.165+
2.166+T{ 0 1 U< -> <TRUE> }T
2.167+T{ 1 2 U< -> <TRUE> }T
2.168+T{ 0 MID-UINT U< -> <TRUE> }T
2.169+T{ 0 MAX-UINT U< -> <TRUE> }T
2.170+T{ MID-UINT MAX-UINT U< -> <TRUE> }T
2.171+T{ 0 0 U< -> <FALSE> }T
2.172+T{ 1 1 U< -> <FALSE> }T
2.173+T{ 1 0 U< -> <FALSE> }T
2.174+T{ 2 1 U< -> <FALSE> }T
2.175+T{ MID-UINT 0 U< -> <FALSE> }T
2.176+T{ MAX-UINT 0 U< -> <FALSE> }T
2.177+T{ MAX-UINT MID-UINT U< -> <FALSE> }T
2.178+
2.179+T{ 0 1 MIN -> 0 }T
2.180+T{ 1 2 MIN -> 1 }T
2.181+T{ -1 0 MIN -> -1 }T
2.182+T{ -1 1 MIN -> -1 }T
2.183+T{ MIN-INT 0 MIN -> MIN-INT }T
2.184+T{ MIN-INT MAX-INT MIN -> MIN-INT }T
2.185+T{ 0 MAX-INT MIN -> 0 }T
2.186+T{ 0 0 MIN -> 0 }T
2.187+T{ 1 1 MIN -> 1 }T
2.188+T{ 1 0 MIN -> 0 }T
2.189+T{ 2 1 MIN -> 1 }T
2.190+T{ 0 -1 MIN -> -1 }T
2.191+T{ 1 -1 MIN -> -1 }T
2.192+T{ 0 MIN-INT MIN -> MIN-INT }T
2.193+T{ MAX-INT MIN-INT MIN -> MIN-INT }T
2.194+T{ MAX-INT 0 MIN -> 0 }T
2.195+
2.196+T{ 0 1 MAX -> 1 }T
2.197+T{ 1 2 MAX -> 2 }T
2.198+T{ -1 0 MAX -> 0 }T
2.199+T{ -1 1 MAX -> 1 }T
2.200+T{ MIN-INT 0 MAX -> 0 }T
2.201+T{ MIN-INT MAX-INT MAX -> MAX-INT }T
2.202+T{ 0 MAX-INT MAX -> MAX-INT }T
2.203+T{ 0 0 MAX -> 0 }T
2.204+T{ 1 1 MAX -> 1 }T
2.205+T{ 1 0 MAX -> 1 }T
2.206+T{ 2 1 MAX -> 2 }T
2.207+T{ 0 -1 MAX -> 0 }T
2.208+T{ 1 -1 MAX -> 1 }T
2.209+T{ 0 MIN-INT MAX -> 0 }T
2.210+T{ MAX-INT MIN-INT MAX -> MAX-INT }T
2.211+T{ MAX-INT 0 MAX -> MAX-INT }T
2.212+
2.213+\ ------------------------------------------------------------------------
2.214+TESTING STACK OPS: 2DROP 2DUP 2OVER 2SWAP ?DUP DEPTH DROP DUP OVER ROT SWAP
2.215+
2.216+T{ 1 2 2DROP -> }T
2.217+T{ 1 2 2DUP -> 1 2 1 2 }T
2.218+T{ 1 2 3 4 2OVER -> 1 2 3 4 1 2 }T
2.219+T{ 1 2 3 4 2SWAP -> 3 4 1 2 }T
2.220+T{ 0 ?DUP -> 0 }T
2.221+T{ 1 ?DUP -> 1 1 }T
2.222+T{ -1 ?DUP -> -1 -1 }T
2.223+T{ DEPTH -> 0 }T
2.224+T{ 0 DEPTH -> 0 1 }T
2.225+T{ 0 1 DEPTH -> 0 1 2 }T
2.226+T{ 0 DROP -> }T
2.227+T{ 1 2 DROP -> 1 }T
2.228+T{ 1 DUP -> 1 1 }T
2.229+T{ 1 2 OVER -> 1 2 1 }T
2.230+T{ 1 2 3 ROT -> 2 3 1 }T
2.231+T{ 1 2 SWAP -> 2 1 }T
2.232+
2.233+\ ------------------------------------------------------------------------
2.234+TESTING >R R> R@
2.235+
2.236+T{ : GR1 >R R> ; -> }T
2.237+T{ : GR2 >R R@ R> DROP ; -> }T
2.238+T{ 123 GR1 -> 123 }T
2.239+T{ 123 GR2 -> 123 }T
2.240+T{ 1S GR1 -> 1S }T ( RETURN STACK HOLDS CELLS )
2.241+
2.242+\ ------------------------------------------------------------------------
2.243+TESTING ADD/SUBTRACT: + - 1+ 1- ABS NEGATE
2.244+
2.245+T{ 0 5 + -> 5 }T
2.246+T{ 5 0 + -> 5 }T
2.247+T{ 0 -5 + -> -5 }T
2.248+T{ -5 0 + -> -5 }T
2.249+T{ 1 2 + -> 3 }T
2.250+T{ 1 -2 + -> -1 }T
2.251+T{ -1 2 + -> 1 }T
2.252+T{ -1 -2 + -> -3 }T
2.253+T{ -1 1 + -> 0 }T
2.254+T{ MID-UINT 1 + -> MID-UINT+1 }T
2.255+
2.256+T{ 0 5 - -> -5 }T
2.257+T{ 5 0 - -> 5 }T
2.258+T{ 0 -5 - -> 5 }T
2.259+T{ -5 0 - -> -5 }T
2.260+T{ 1 2 - -> -1 }T
2.261+T{ 1 -2 - -> 3 }T
2.262+T{ -1 2 - -> -3 }T
2.263+T{ -1 -2 - -> 1 }T
2.264+T{ 0 1 - -> -1 }T
2.265+T{ MID-UINT+1 1 - -> MID-UINT }T
2.266+
2.267+T{ 0 1+ -> 1 }T
2.268+T{ -1 1+ -> 0 }T
2.269+T{ 1 1+ -> 2 }T
2.270+T{ MID-UINT 1+ -> MID-UINT+1 }T
2.271+
2.272+T{ 2 1- -> 1 }T
2.273+T{ 1 1- -> 0 }T
2.274+T{ 0 1- -> -1 }T
2.275+T{ MID-UINT+1 1- -> MID-UINT }T
2.276+
2.277+T{ 0 NEGATE -> 0 }T
2.278+T{ 1 NEGATE -> -1 }T
2.279+T{ -1 NEGATE -> 1 }T
2.280+T{ 2 NEGATE -> -2 }T
2.281+T{ -2 NEGATE -> 2 }T
2.282+
2.283+T{ 0 ABS -> 0 }T
2.284+T{ 1 ABS -> 1 }T
2.285+T{ -1 ABS -> 1 }T
2.286+T{ MIN-INT ABS -> MID-UINT+1 }T
2.287+
2.288+\ ------------------------------------------------------------------------
2.289+TESTING MULTIPLY: S>D * M* UM*
2.290+
2.291+T{ 0 S>D -> 0 0 }T
2.292+T{ 1 S>D -> 1 0 }T
2.293+T{ 2 S>D -> 2 0 }T
2.294+T{ -1 S>D -> -1 -1 }T
2.295+T{ -2 S>D -> -2 -1 }T
2.296+T{ MIN-INT S>D -> MIN-INT -1 }T
2.297+T{ MAX-INT S>D -> MAX-INT 0 }T
2.298+
2.299+T{ 0 0 M* -> 0 S>D }T
2.300+T{ 0 1 M* -> 0 S>D }T
2.301+T{ 1 0 M* -> 0 S>D }T
2.302+T{ 1 2 M* -> 2 S>D }T
2.303+T{ 2 1 M* -> 2 S>D }T
2.304+T{ 3 3 M* -> 9 S>D }T
2.305+T{ -3 3 M* -> -9 S>D }T
2.306+T{ 3 -3 M* -> -9 S>D }T
2.307+T{ -3 -3 M* -> 9 S>D }T
2.308+T{ 0 MIN-INT M* -> 0 S>D }T
2.309+T{ 1 MIN-INT M* -> MIN-INT S>D }T
2.310+T{ 2 MIN-INT M* -> 0 1S }T
2.311+T{ 0 MAX-INT M* -> 0 S>D }T
2.312+T{ 1 MAX-INT M* -> MAX-INT S>D }T
2.313+T{ 2 MAX-INT M* -> MAX-INT 1 LSHIFT 0 }T
2.314+T{ MIN-INT MIN-INT M* -> 0 MSB 1 RSHIFT }T
2.315+T{ MAX-INT MIN-INT M* -> MSB MSB 2/ }T
2.316+T{ MAX-INT MAX-INT M* -> 1 MSB 2/ INVERT }T
2.317+
2.318+T{ 0 0 * -> 0 }T \ TEST IDENTITIES
2.319+T{ 0 1 * -> 0 }T
2.320+T{ 1 0 * -> 0 }T
2.321+T{ 1 2 * -> 2 }T
2.322+T{ 2 1 * -> 2 }T
2.323+T{ 3 3 * -> 9 }T
2.324+T{ -3 3 * -> -9 }T
2.325+T{ 3 -3 * -> -9 }T
2.326+T{ -3 -3 * -> 9 }T
2.327+
2.328+T{ MID-UINT+1 1 RSHIFT 2 * -> MID-UINT+1 }T
2.329+T{ MID-UINT+1 2 RSHIFT 4 * -> MID-UINT+1 }T
2.330+T{ MID-UINT+1 1 RSHIFT MID-UINT+1 OR 2 * -> MID-UINT+1 }T
2.331+
2.332+T{ 0 0 UM* -> 0 0 }T
2.333+T{ 0 1 UM* -> 0 0 }T
2.334+T{ 1 0 UM* -> 0 0 }T
2.335+T{ 1 2 UM* -> 2 0 }T
2.336+T{ 2 1 UM* -> 2 0 }T
2.337+T{ 3 3 UM* -> 9 0 }T
2.338+
2.339+T{ MID-UINT+1 1 RSHIFT 2 UM* -> MID-UINT+1 0 }T
2.340+T{ MID-UINT+1 2 UM* -> 0 1 }T
2.341+T{ MID-UINT+1 4 UM* -> 0 2 }T
2.342+T{ 1S 2 UM* -> 1S 1 LSHIFT 1 }T
2.343+T{ MAX-UINT MAX-UINT UM* -> 1 1 INVERT }T
2.344+
2.345+\ ------------------------------------------------------------------------
2.346+TESTING DIVIDE: FM/MOD SM/REM UM/MOD */ */MOD / /MOD MOD
2.347+
2.348+T{ 0 S>D 1 FM/MOD -> 0 0 }T
2.349+T{ 1 S>D 1 FM/MOD -> 0 1 }T
2.350+T{ 2 S>D 1 FM/MOD -> 0 2 }T
2.351+T{ -1 S>D 1 FM/MOD -> 0 -1 }T
2.352+T{ -2 S>D 1 FM/MOD -> 0 -2 }T
2.353+T{ 0 S>D -1 FM/MOD -> 0 0 }T
2.354+T{ 1 S>D -1 FM/MOD -> 0 -1 }T
2.355+T{ 2 S>D -1 FM/MOD -> 0 -2 }T
2.356+T{ -1 S>D -1 FM/MOD -> 0 1 }T
2.357+T{ -2 S>D -1 FM/MOD -> 0 2 }T
2.358+T{ 2 S>D 2 FM/MOD -> 0 1 }T
2.359+T{ -1 S>D -1 FM/MOD -> 0 1 }T
2.360+T{ -2 S>D -2 FM/MOD -> 0 1 }T
2.361+T{ 7 S>D 3 FM/MOD -> 1 2 }T
2.362+T{ 7 S>D -3 FM/MOD -> -2 -3 }T
2.363+T{ -7 S>D 3 FM/MOD -> 2 -3 }T
2.364+T{ -7 S>D -3 FM/MOD -> -1 2 }T
2.365+T{ MAX-INT S>D 1 FM/MOD -> 0 MAX-INT }T
2.366+T{ MIN-INT S>D 1 FM/MOD -> 0 MIN-INT }T
2.367+T{ MAX-INT S>D MAX-INT FM/MOD -> 0 1 }T
2.368+T{ MIN-INT S>D MIN-INT FM/MOD -> 0 1 }T
2.369+T{ 1S 1 4 FM/MOD -> 3 MAX-INT }T
2.370+T{ 1 MIN-INT M* 1 FM/MOD -> 0 MIN-INT }T
2.371+T{ 1 MIN-INT M* MIN-INT FM/MOD -> 0 1 }T
2.372+T{ 2 MIN-INT M* 2 FM/MOD -> 0 MIN-INT }T
2.373+T{ 2 MIN-INT M* MIN-INT FM/MOD -> 0 2 }T
2.374+T{ 1 MAX-INT M* 1 FM/MOD -> 0 MAX-INT }T
2.375+T{ 1 MAX-INT M* MAX-INT FM/MOD -> 0 1 }T
2.376+T{ 2 MAX-INT M* 2 FM/MOD -> 0 MAX-INT }T
2.377+T{ 2 MAX-INT M* MAX-INT FM/MOD -> 0 2 }T
2.378+T{ MIN-INT MIN-INT M* MIN-INT FM/MOD -> 0 MIN-INT }T
2.379+T{ MIN-INT MAX-INT M* MIN-INT FM/MOD -> 0 MAX-INT }T
2.380+T{ MIN-INT MAX-INT M* MAX-INT FM/MOD -> 0 MIN-INT }T
2.381+T{ MAX-INT MAX-INT M* MAX-INT FM/MOD -> 0 MAX-INT }T
2.382+
2.383+T{ 0 S>D 1 SM/REM -> 0 0 }T
2.384+T{ 1 S>D 1 SM/REM -> 0 1 }T
2.385+T{ 2 S>D 1 SM/REM -> 0 2 }T
2.386+T{ -1 S>D 1 SM/REM -> 0 -1 }T
2.387+T{ -2 S>D 1 SM/REM -> 0 -2 }T
2.388+T{ 0 S>D -1 SM/REM -> 0 0 }T
2.389+T{ 1 S>D -1 SM/REM -> 0 -1 }T
2.390+T{ 2 S>D -1 SM/REM -> 0 -2 }T
2.391+T{ -1 S>D -1 SM/REM -> 0 1 }T
2.392+T{ -2 S>D -1 SM/REM -> 0 2 }T
2.393+T{ 2 S>D 2 SM/REM -> 0 1 }T
2.394+T{ -1 S>D -1 SM/REM -> 0 1 }T
2.395+T{ -2 S>D -2 SM/REM -> 0 1 }T
2.396+T{ 7 S>D 3 SM/REM -> 1 2 }T
2.397+T{ 7 S>D -3 SM/REM -> 1 -2 }T
2.398+T{ -7 S>D 3 SM/REM -> -1 -2 }T
2.399+T{ -7 S>D -3 SM/REM -> -1 2 }T
2.400+T{ MAX-INT S>D 1 SM/REM -> 0 MAX-INT }T
2.401+T{ MIN-INT S>D 1 SM/REM -> 0 MIN-INT }T
2.402+T{ MAX-INT S>D MAX-INT SM/REM -> 0 1 }T
2.403+T{ MIN-INT S>D MIN-INT SM/REM -> 0 1 }T
2.404+T{ 1S 1 4 SM/REM -> 3 MAX-INT }T
2.405+T{ 2 MIN-INT M* 2 SM/REM -> 0 MIN-INT }T
2.406+T{ 2 MIN-INT M* MIN-INT SM/REM -> 0 2 }T
2.407+T{ 2 MAX-INT M* 2 SM/REM -> 0 MAX-INT }T
2.408+T{ 2 MAX-INT M* MAX-INT SM/REM -> 0 2 }T
2.409+T{ MIN-INT MIN-INT M* MIN-INT SM/REM -> 0 MIN-INT }T
2.410+T{ MIN-INT MAX-INT M* MIN-INT SM/REM -> 0 MAX-INT }T
2.411+T{ MIN-INT MAX-INT M* MAX-INT SM/REM -> 0 MIN-INT }T
2.412+T{ MAX-INT MAX-INT M* MAX-INT SM/REM -> 0 MAX-INT }T
2.413+
2.414+T{ 0 0 1 UM/MOD -> 0 0 }T
2.415+T{ 1 0 1 UM/MOD -> 0 1 }T
2.416+T{ 1 0 2 UM/MOD -> 1 0 }T
2.417+T{ 3 0 2 UM/MOD -> 1 1 }T
2.418+T{ MAX-UINT 2 UM* 2 UM/MOD -> 0 MAX-UINT }T
2.419+T{ MAX-UINT 2 UM* MAX-UINT UM/MOD -> 0 2 }T
2.420+T{ MAX-UINT MAX-UINT UM* MAX-UINT UM/MOD -> 0 MAX-UINT }T
2.421+
2.422+: IFFLOORED
2.423+ [ -3 2 / -2 = INVERT ] LITERAL IF POSTPONE \ THEN ;
2.424+
2.425+: IFSYM
2.426+ [ -3 2 / -1 = INVERT ] LITERAL IF POSTPONE \ THEN ;
2.427+
2.428+\ THE SYSTEM MIGHT DO EITHER FLOORED OR SYMMETRIC DIVISION.
2.429+\ SINCE WE HAVE ALREADY TESTED M*, FM/MOD, AND SM/REM WE CAN USE THEM IN TEST.
2.430+
2.431+IFFLOORED : T/MOD >R S>D R> FM/MOD ;
2.432+IFFLOORED : T/ T/MOD SWAP DROP ;
2.433+IFFLOORED : TMOD T/MOD DROP ;
2.434+IFFLOORED : T*/MOD >R M* R> FM/MOD ;
2.435+IFFLOORED : T*/ T*/MOD SWAP DROP ;
2.436+IFSYM : T/MOD >R S>D R> SM/REM ;
2.437+IFSYM : T/ T/MOD SWAP DROP ;
2.438+IFSYM : TMOD T/MOD DROP ;
2.439+IFSYM : T*/MOD >R M* R> SM/REM ;
2.440+IFSYM : T*/ T*/MOD SWAP DROP ;
2.441+
2.442+T{ 0 1 /MOD -> 0 1 T/MOD }T
2.443+T{ 1 1 /MOD -> 1 1 T/MOD }T
2.444+T{ 2 1 /MOD -> 2 1 T/MOD }T
2.445+T{ -1 1 /MOD -> -1 1 T/MOD }T
2.446+T{ -2 1 /MOD -> -2 1 T/MOD }T
2.447+T{ 0 -1 /MOD -> 0 -1 T/MOD }T
2.448+T{ 1 -1 /MOD -> 1 -1 T/MOD }T
2.449+T{ 2 -1 /MOD -> 2 -1 T/MOD }T
2.450+T{ -1 -1 /MOD -> -1 -1 T/MOD }T
2.451+T{ -2 -1 /MOD -> -2 -1 T/MOD }T
2.452+T{ 2 2 /MOD -> 2 2 T/MOD }T
2.453+T{ -1 -1 /MOD -> -1 -1 T/MOD }T
2.454+T{ -2 -2 /MOD -> -2 -2 T/MOD }T
2.455+T{ 7 3 /MOD -> 7 3 T/MOD }T
2.456+T{ 7 -3 /MOD -> 7 -3 T/MOD }T
2.457+T{ -7 3 /MOD -> -7 3 T/MOD }T
2.458+T{ -7 -3 /MOD -> -7 -3 T/MOD }T
2.459+T{ MAX-INT 1 /MOD -> MAX-INT 1 T/MOD }T
2.460+T{ MIN-INT 1 /MOD -> MIN-INT 1 T/MOD }T
2.461+T{ MAX-INT MAX-INT /MOD -> MAX-INT MAX-INT T/MOD }T
2.462+T{ MIN-INT MIN-INT /MOD -> MIN-INT MIN-INT T/MOD }T
2.463+
2.464+T{ 0 1 / -> 0 1 T/ }T
2.465+T{ 1 1 / -> 1 1 T/ }T
2.466+T{ 2 1 / -> 2 1 T/ }T
2.467+T{ -1 1 / -> -1 1 T/ }T
2.468+T{ -2 1 / -> -2 1 T/ }T
2.469+T{ 0 -1 / -> 0 -1 T/ }T
2.470+T{ 1 -1 / -> 1 -1 T/ }T
2.471+T{ 2 -1 / -> 2 -1 T/ }T
2.472+T{ -1 -1 / -> -1 -1 T/ }T
2.473+T{ -2 -1 / -> -2 -1 T/ }T
2.474+T{ 2 2 / -> 2 2 T/ }T
2.475+T{ -1 -1 / -> -1 -1 T/ }T
2.476+T{ -2 -2 / -> -2 -2 T/ }T
2.477+T{ 7 3 / -> 7 3 T/ }T
2.478+T{ 7 -3 / -> 7 -3 T/ }T
2.479+T{ -7 3 / -> -7 3 T/ }T
2.480+T{ -7 -3 / -> -7 -3 T/ }T
2.481+T{ MAX-INT 1 / -> MAX-INT 1 T/ }T
2.482+T{ MIN-INT 1 / -> MIN-INT 1 T/ }T
2.483+T{ MAX-INT MAX-INT / -> MAX-INT MAX-INT T/ }T
2.484+T{ MIN-INT MIN-INT / -> MIN-INT MIN-INT T/ }T
2.485+
2.486+T{ 0 1 MOD -> 0 1 TMOD }T
2.487+T{ 1 1 MOD -> 1 1 TMOD }T
2.488+T{ 2 1 MOD -> 2 1 TMOD }T
2.489+T{ -1 1 MOD -> -1 1 TMOD }T
2.490+T{ -2 1 MOD -> -2 1 TMOD }T
2.491+T{ 0 -1 MOD -> 0 -1 TMOD }T
2.492+T{ 1 -1 MOD -> 1 -1 TMOD }T
2.493+T{ 2 -1 MOD -> 2 -1 TMOD }T
2.494+T{ -1 -1 MOD -> -1 -1 TMOD }T
2.495+T{ -2 -1 MOD -> -2 -1 TMOD }T
2.496+T{ 2 2 MOD -> 2 2 TMOD }T
2.497+T{ -1 -1 MOD -> -1 -1 TMOD }T
2.498+T{ -2 -2 MOD -> -2 -2 TMOD }T
2.499+T{ 7 3 MOD -> 7 3 TMOD }T
2.500+T{ 7 -3 MOD -> 7 -3 TMOD }T
2.501+T{ -7 3 MOD -> -7 3 TMOD }T
2.502+T{ -7 -3 MOD -> -7 -3 TMOD }T
2.503+T{ MAX-INT 1 MOD -> MAX-INT 1 TMOD }T
2.504+T{ MIN-INT 1 MOD -> MIN-INT 1 TMOD }T
2.505+T{ MAX-INT MAX-INT MOD -> MAX-INT MAX-INT TMOD }T
2.506+T{ MIN-INT MIN-INT MOD -> MIN-INT MIN-INT TMOD }T
2.507+
2.508+T{ 0 2 1 */ -> 0 2 1 T*/ }T
2.509+T{ 1 2 1 */ -> 1 2 1 T*/ }T
2.510+T{ 2 2 1 */ -> 2 2 1 T*/ }T
2.511+T{ -1 2 1 */ -> -1 2 1 T*/ }T
2.512+T{ -2 2 1 */ -> -2 2 1 T*/ }T
2.513+T{ 0 2 -1 */ -> 0 2 -1 T*/ }T
2.514+T{ 1 2 -1 */ -> 1 2 -1 T*/ }T
2.515+T{ 2 2 -1 */ -> 2 2 -1 T*/ }T
2.516+T{ -1 2 -1 */ -> -1 2 -1 T*/ }T
2.517+T{ -2 2 -1 */ -> -2 2 -1 T*/ }T
2.518+T{ 2 2 2 */ -> 2 2 2 T*/ }T
2.519+T{ -1 2 -1 */ -> -1 2 -1 T*/ }T
2.520+T{ -2 2 -2 */ -> -2 2 -2 T*/ }T
2.521+T{ 7 2 3 */ -> 7 2 3 T*/ }T
2.522+T{ 7 2 -3 */ -> 7 2 -3 T*/ }T
2.523+T{ -7 2 3 */ -> -7 2 3 T*/ }T
2.524+T{ -7 2 -3 */ -> -7 2 -3 T*/ }T
2.525+T{ MAX-INT 2 MAX-INT */ -> MAX-INT 2 MAX-INT T*/ }T
2.526+T{ MIN-INT 2 MIN-INT */ -> MIN-INT 2 MIN-INT T*/ }T
2.527+
2.528+T{ 0 2 1 */MOD -> 0 2 1 T*/MOD }T
2.529+T{ 1 2 1 */MOD -> 1 2 1 T*/MOD }T
2.530+T{ 2 2 1 */MOD -> 2 2 1 T*/MOD }T
2.531+T{ -1 2 1 */MOD -> -1 2 1 T*/MOD }T
2.532+T{ -2 2 1 */MOD -> -2 2 1 T*/MOD }T
2.533+T{ 0 2 -1 */MOD -> 0 2 -1 T*/MOD }T
2.534+T{ 1 2 -1 */MOD -> 1 2 -1 T*/MOD }T
2.535+T{ 2 2 -1 */MOD -> 2 2 -1 T*/MOD }T
2.536+T{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }T
2.537+T{ -2 2 -1 */MOD -> -2 2 -1 T*/MOD }T
2.538+T{ 2 2 2 */MOD -> 2 2 2 T*/MOD }T
2.539+T{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }T
2.540+T{ -2 2 -2 */MOD -> -2 2 -2 T*/MOD }T
2.541+T{ 7 2 3 */MOD -> 7 2 3 T*/MOD }T
2.542+T{ 7 2 -3 */MOD -> 7 2 -3 T*/MOD }T
2.543+T{ -7 2 3 */MOD -> -7 2 3 T*/MOD }T
2.544+T{ -7 2 -3 */MOD -> -7 2 -3 T*/MOD }T
2.545+T{ MAX-INT 2 MAX-INT */MOD -> MAX-INT 2 MAX-INT T*/MOD }T
2.546+T{ MIN-INT 2 MIN-INT */MOD -> MIN-INT 2 MIN-INT T*/MOD }T
2.547+
2.548+\ ------------------------------------------------------------------------
2.549+TESTING HERE , @ ! CELL+ CELLS C, C@ C! CHARS 2@ 2! ALIGN ALIGNED +! ALLOT
2.550+
2.551+HERE 1 ALLOT
2.552+HERE
2.553+CONSTANT 2NDA
2.554+CONSTANT 1STA
2.555+T{ 1STA 2NDA U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
2.556+T{ 1STA 1+ -> 2NDA }T \ ... BY ONE ADDRESS UNIT
2.557+( MISSING TEST: NEGATIVE ALLOT )
2.558+
2.559+HERE 1 ,
2.560+HERE 2 ,
2.561+CONSTANT 2ND
2.562+CONSTANT 1ST
2.563+T{ 1ST 2ND U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
2.564+T{ 1ST CELL+ -> 2ND }T \ ... BY ONE CELL
2.565+T{ 1ST 1 CELLS + -> 2ND }T
2.566+T{ 1ST @ 2ND @ -> 1 2 }T
2.567+T{ 5 1ST ! -> }T
2.568+T{ 1ST @ 2ND @ -> 5 2 }T
2.569+T{ 6 2ND ! -> }T
2.570+T{ 1ST @ 2ND @ -> 5 6 }T
2.571+T{ 1ST 2@ -> 6 5 }T
2.572+T{ 2 1 1ST 2! -> }T
2.573+T{ 1ST 2@ -> 2 1 }T
2.574+T{ 1S 1ST ! 1ST @ -> 1S }T \ CAN STORE CELL-WIDE VALUE
2.575+
2.576+HERE 1 C,
2.577+HERE 2 C,
2.578+CONSTANT 2NDC
2.579+CONSTANT 1STC
2.580+T{ 1STC 2NDC U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
2.581+T{ 1STC CHAR+ -> 2NDC }T \ ... BY ONE CHAR
2.582+T{ 1STC 1 CHARS + -> 2NDC }T
2.583+T{ 1STC C@ 2NDC C@ -> 1 2 }T
2.584+T{ 3 1STC C! -> }T
2.585+T{ 1STC C@ 2NDC C@ -> 3 2 }T
2.586+T{ 4 2NDC C! -> }T
2.587+T{ 1STC C@ 2NDC C@ -> 3 4 }T
2.588+
2.589+ALIGN 1 ALLOT HERE ALIGN HERE 3 CELLS ALLOT
2.590+CONSTANT A-ADDR CONSTANT UA-ADDR
2.591+T{ UA-ADDR ALIGNED -> A-ADDR }T
2.592+T{ 1 A-ADDR C! A-ADDR C@ -> 1 }T
2.593+T{ 1234 A-ADDR ! A-ADDR @ -> 1234 }T
2.594+T{ 123 456 A-ADDR 2! A-ADDR 2@ -> 123 456 }T
2.595+T{ 2 A-ADDR CHAR+ C! A-ADDR CHAR+ C@ -> 2 }T
2.596+T{ 3 A-ADDR CELL+ C! A-ADDR CELL+ C@ -> 3 }T
2.597+T{ 1234 A-ADDR CELL+ ! A-ADDR CELL+ @ -> 1234 }T
2.598+T{ 123 456 A-ADDR CELL+ 2! A-ADDR CELL+ 2@ -> 123 456 }T
2.599+
2.600+: BITS ( X -- U )
2.601+ 0 SWAP BEGIN DUP WHILE DUP MSB AND IF >R 1+ R> THEN 2* REPEAT DROP ;
2.602+( CHARACTERS >= 1 AU, <= SIZE OF CELL, >= 8 BITS )
2.603+T{ 1 CHARS 1 < -> <FALSE> }T
2.604+T{ 1 CHARS 1 CELLS > -> <FALSE> }T
2.605+( TBD: HOW TO FIND NUMBER OF BITS? )
2.606+
2.607+( CELLS >= 1 AU, INTEGRAL MULTIPLE OF CHAR SIZE, >= 16 BITS )
2.608+T{ 1 CELLS 1 < -> <FALSE> }T
2.609+T{ 1 CELLS 1 CHARS MOD -> 0 }T
2.610+T{ 1S BITS 10 < -> <FALSE> }T
2.611+
2.612+T{ 0 1ST ! -> }T
2.613+T{ 1 1ST +! -> }T
2.614+T{ 1ST @ -> 1 }T
2.615+T{ -1 1ST +! 1ST @ -> 0 }T
2.616+
2.617+\ ------------------------------------------------------------------------
2.618+TESTING CHAR [CHAR] [ ] BL S"
2.619+
2.620+T{ BL -> 20 }T
2.621+T{ CHAR X -> 58 }T
2.622+T{ CHAR HELLO -> 48 }T
2.623+T{ : GC1 [CHAR] X ; -> }T
2.624+T{ : GC2 [CHAR] HELLO ; -> }T
2.625+T{ GC1 -> 58 }T
2.626+T{ GC2 -> 48 }T
2.627+T{ : GC3 [ GC1 ] LITERAL ; -> }T
2.628+T{ GC3 -> 58 }T
2.629+T{ : GC4 S" XY" ; -> }T
2.630+T{ GC4 SWAP DROP -> 2 }T
2.631+T{ GC4 DROP DUP C@ SWAP CHAR+ C@ -> 58 59 }T
2.632+
2.633+\ ------------------------------------------------------------------------
2.634+TESTING ' ['] FIND EXECUTE IMMEDIATE COUNT LITERAL POSTPONE STATE
2.635+
2.636+T{ : GT1 123 ; -> }T
2.637+T{ ' GT1 EXECUTE -> 123 }T
2.638+T{ : GT2 ['] GT1 ; IMMEDIATE -> }T
2.639+T{ GT2 EXECUTE -> 123 }T
2.640+HERE 3 C, CHAR G C, CHAR T C, CHAR 1 C, CONSTANT GT1STRING
2.641+HERE 3 C, CHAR G C, CHAR T C, CHAR 2 C, CONSTANT GT2STRING
2.642+T{ GT1STRING FIND -> ' GT1 -1 }T
2.643+T{ GT2STRING FIND -> ' GT2 1 }T
2.644+( HOW TO SEARCH FOR NON-EXISTENT WORD? )
2.645+T{ : GT3 GT2 LITERAL ; -> }T
2.646+T{ GT3 -> ' GT1 }T
2.647+T{ GT1STRING COUNT -> GT1STRING CHAR+ 3 }T
2.648+
2.649+T{ : GT4 POSTPONE GT1 ; IMMEDIATE -> }T
2.650+T{ : GT5 GT4 ; -> }T
2.651+T{ GT5 -> 123 }T
2.652+T{ : GT6 345 ; IMMEDIATE -> }T
2.653+T{ : GT7 POSTPONE GT6 ; -> }T
2.654+T{ GT7 -> 345 }T
2.655+
2.656+T{ : GT8 STATE @ ; IMMEDIATE -> }T
2.657+T{ GT8 -> 0 }T
2.658+T{ : GT9 GT8 LITERAL ; -> }T
2.659+T{ GT9 0= -> <FALSE> }T
2.660+
2.661+\ ------------------------------------------------------------------------
2.662+TESTING IF ELSE THEN BEGIN WHILE REPEAT UNTIL RECURSE
2.663+
2.664+T{ : GI1 IF 123 THEN ; -> }T
2.665+T{ : GI2 IF 123 ELSE 234 THEN ; -> }T
2.666+T{ 0 GI1 -> }T
2.667+T{ 1 GI1 -> 123 }T
2.668+T{ -1 GI1 -> 123 }T
2.669+T{ 0 GI2 -> 234 }T
2.670+T{ 1 GI2 -> 123 }T
2.671+T{ -1 GI1 -> 123 }T
2.672+
2.673+T{ : GI3 BEGIN DUP 5 < WHILE DUP 1+ REPEAT ; -> }T
2.674+T{ 0 GI3 -> 0 1 2 3 4 5 }T
2.675+T{ 4 GI3 -> 4 5 }T
2.676+T{ 5 GI3 -> 5 }T
2.677+T{ 6 GI3 -> 6 }T
2.678+
2.679+T{ : GI4 BEGIN DUP 1+ DUP 5 > UNTIL ; -> }T
2.680+T{ 3 GI4 -> 3 4 5 6 }T
2.681+T{ 5 GI4 -> 5 6 }T
2.682+T{ 6 GI4 -> 6 7 }T
2.683+
2.684+T{ : GI5 BEGIN DUP 2 >
2.685+ WHILE DUP 5 < WHILE DUP 1+ REPEAT 123 ELSE 345 THEN ; -> }T
2.686+T{ 1 GI5 -> 1 345 }T
2.687+T{ 2 GI5 -> 2 345 }T
2.688+T{ 3 GI5 -> 3 4 5 123 }T
2.689+T{ 4 GI5 -> 4 5 123 }T
2.690+T{ 5 GI5 -> 5 123 }T
2.691+
2.692+T{ : GI6 ( N -- 0,1,..N ) DUP IF DUP >R 1- RECURSE R> THEN ; -> }T
2.693+T{ 0 GI6 -> 0 }T
2.694+T{ 1 GI6 -> 0 1 }T
2.695+T{ 2 GI6 -> 0 1 2 }T
2.696+T{ 3 GI6 -> 0 1 2 3 }T
2.697+T{ 4 GI6 -> 0 1 2 3 4 }T
2.698+
2.699+\ ------------------------------------------------------------------------
2.700+TESTING DO LOOP +LOOP I J UNLOOP LEAVE EXIT
2.701+
2.702+T{ : GD1 DO I LOOP ; -> }T
2.703+T{ 4 1 GD1 -> 1 2 3 }T
2.704+T{ 2 -1 GD1 -> -1 0 1 }T
2.705+T{ MID-UINT+1 MID-UINT GD1 -> MID-UINT }T
2.706+
2.707+T{ : GD2 DO I -1 +LOOP ; -> }T
2.708+T{ 1 4 GD2 -> 4 3 2 1 }T
2.709+T{ -1 2 GD2 -> 2 1 0 -1 }T
2.710+T{ MID-UINT MID-UINT+1 GD2 -> MID-UINT+1 MID-UINT }T
2.711+
2.712+T{ : GD3 DO 1 0 DO J LOOP LOOP ; -> }T
2.713+T{ 4 1 GD3 -> 1 2 3 }T
2.714+T{ 2 -1 GD3 -> -1 0 1 }T
2.715+T{ MID-UINT+1 MID-UINT GD3 -> MID-UINT }T
2.716+
2.717+T{ : GD4 DO 1 0 DO J LOOP -1 +LOOP ; -> }T
2.718+T{ 1 4 GD4 -> 4 3 2 1 }T
2.719+T{ -1 2 GD4 -> 2 1 0 -1 }T
2.720+T{ MID-UINT MID-UINT+1 GD4 -> MID-UINT+1 MID-UINT }T
2.721+
2.722+T{ : GD5 123 SWAP 0 DO I 4 > IF DROP 234 LEAVE THEN LOOP ; -> }T
2.723+T{ 1 GD5 -> 123 }T
2.724+T{ 5 GD5 -> 123 }T
2.725+T{ 6 GD5 -> 234 }T
2.726+
2.727+T{ : GD6 ( PAT: T{0 0},{0 0}{1 0}{1 1},{0 0}{1 0}{1 1}{2 0}{2 1}{2 2} )
2.728+ 0 SWAP 0 DO
2.729+ I 1+ 0 DO I J + 3 = IF I UNLOOP I UNLOOP EXIT THEN 1+ LOOP
2.730+ LOOP ; -> }T
2.731+T{ 1 GD6 -> 1 }T
2.732+T{ 2 GD6 -> 3 }T
2.733+T{ 3 GD6 -> 4 1 2 }T
2.734+
2.735+\ ------------------------------------------------------------------------
2.736+TESTING DEFINING WORDS: : ; CONSTANT VARIABLE CREATE DOES> >BODY
2.737+
2.738+T{ 123 CONSTANT X123 -> }T
2.739+T{ X123 -> 123 }T
2.740+T{ : EQU CONSTANT ; -> }T
2.741+T{ X123 EQU Y123 -> }T
2.742+T{ Y123 -> 123 }T
2.743+
2.744+T{ VARIABLE V1 -> }T
2.745+T{ 123 V1 ! -> }T
2.746+T{ V1 @ -> 123 }T
2.747+
2.748+T{ : NOP : POSTPONE ; ; -> }T
2.749+T{ NOP NOP1 NOP NOP2 -> }T
2.750+T{ NOP1 -> }T
2.751+T{ NOP2 -> }T
2.752+
2.753+T{ : DOES1 DOES> @ 1 + ; -> }T
2.754+T{ : DOES2 DOES> @ 2 + ; -> }T
2.755+T{ CREATE CR1 -> }T
2.756+T{ CR1 -> HERE }T
2.757+T{ ' CR1 >BODY -> HERE }T
2.758+T{ 1 , -> }T
2.759+T{ CR1 @ -> 1 }T
2.760+T{ DOES1 -> }T
2.761+T{ CR1 -> 2 }T
2.762+T{ DOES2 -> }T
2.763+T{ CR1 -> 3 }T
2.764+
2.765+T{ : WEIRD: CREATE DOES> 1 + DOES> 2 + ; -> }T
2.766+T{ WEIRD: W1 -> }T
2.767+T{ ' W1 >BODY -> HERE }T
2.768+T{ W1 -> HERE 1 + }T
2.769+T{ W1 -> HERE 2 + }T
2.770+
2.771+\ ------------------------------------------------------------------------
2.772+TESTING EVALUATE
2.773+
2.774+: GE1 S" 123" ; IMMEDIATE
2.775+: GE2 S" 123 1+" ; IMMEDIATE
2.776+: GE3 S" : GE4 345 ;" ;
2.777+: GE5 EVALUATE ; IMMEDIATE
2.778+
2.779+T{ GE1 EVALUATE -> 123 }T ( TEST EVALUATE IN INTERP. STATE )
2.780+T{ GE2 EVALUATE -> 124 }T
2.781+T{ GE3 EVALUATE -> }T
2.782+T{ GE4 -> 345 }T
2.783+
2.784+T{ : GE6 GE1 GE5 ; -> }T ( TEST EVALUATE IN COMPILE STATE )
2.785+T{ GE6 -> 123 }T
2.786+T{ : GE7 GE2 GE5 ; -> }T
2.787+T{ GE7 -> 124 }T
2.788+
2.789+\ ------------------------------------------------------------------------
2.790+TESTING SOURCE >IN WORD
2.791+
2.792+: GS1 S" SOURCE" 2DUP EVALUATE
2.793+ >R SWAP >R = R> R> = ;
2.794+T{ GS1 -> <TRUE> <TRUE> }T
2.795+
2.796+VARIABLE SCANS
2.797+: RESCAN? -1 SCANS +! SCANS @ IF 0 >IN ! THEN ;
2.798+
2.799+T{ 2 SCANS !
2.800+345 RESCAN?
2.801+-> 345 345 }T
2.802+
2.803+: GS2 5 SCANS ! S" 123 RESCAN?" EVALUATE ;
2.804+T{ GS2 -> 123 123 123 123 123 }T
2.805+
2.806+: GS3 WORD COUNT SWAP C@ ;
2.807+T{ BL GS3 HELLO -> 5 CHAR H }T
2.808+T{ CHAR " GS3 GOODBYE" -> 7 CHAR G }T
2.809+T{ BL GS3
2.810+DROP -> 0 }T \ BLANK LINE RETURN ZERO-LENGTH STRING
2.811+
2.812+: GS4 SOURCE >IN ! DROP ;
2.813+T{ GS4 123 456
2.814+-> }T
2.815+
2.816+\ ------------------------------------------------------------------------
2.817+TESTING <# # #S #> HOLD SIGN BASE >NUMBER HEX DECIMAL
2.818+
2.819+: S= \ ( ADDR1 C1 ADDR2 C2 -- T/F ) COMPARE TWO STRINGS.
2.820+ >R SWAP R@ = IF \ MAKE SURE STRINGS HAVE SAME LENGTH
2.821+ R> ?DUP IF \ IF NON-EMPTY STRINGS
2.822+ 0 DO
2.823+ OVER C@ OVER C@ - IF 2DROP <FALSE> UNLOOP EXIT THEN
2.824+ SWAP CHAR+ SWAP CHAR+
2.825+ LOOP
2.826+ THEN
2.827+ 2DROP <TRUE> \ IF WE GET HERE, STRINGS MATCH
2.828+ ELSE
2.829+ R> DROP 2DROP <FALSE> \ LENGTHS MISMATCH
2.830+ THEN ;
2.831+
2.832+: GP1 <# 41 HOLD 42 HOLD 0 0 #> S" BA" S= ;
2.833+T{ GP1 -> <TRUE> }T
2.834+
2.835+: GP2 <# -1 SIGN 0 SIGN -1 SIGN 0 0 #> S" --" S= ;
2.836+T{ GP2 -> <TRUE> }T
2.837+
2.838+: GP3 <# 1 0 # # #> S" 01" S= ;
2.839+T{ GP3 -> <TRUE> }T
2.840+
2.841+: GP4 <# 1 0 #S #> S" 1" S= ;
2.842+T{ GP4 -> <TRUE> }T
2.843+
2.844+24 CONSTANT MAX-BASE \ BASE 2 .. 36
2.845+: COUNT-BITS
2.846+ 0 0 INVERT BEGIN DUP WHILE >R 1+ R> 2* REPEAT DROP ;
2.847+COUNT-BITS 2* CONSTANT #BITS-UD \ NUMBER OF BITS IN UD
2.848+
2.849+: GP5
2.850+ BASE @ <TRUE>
2.851+ MAX-BASE 1+ 2 DO \ FOR EACH POSSIBLE BASE
2.852+ I BASE ! \ TBD: ASSUMES BASE WORKS
2.853+ I 0 <# #S #> S" 10" S= AND
2.854+ LOOP
2.855+ SWAP BASE ! ;
2.856+T{ GP5 -> <TRUE> }T
2.857+
2.858+: GP6
2.859+ BASE @ >R 2 BASE !
2.860+ MAX-UINT MAX-UINT <# #S #> \ MAXIMUM UD TO BINARY
2.861+ R> BASE ! \ S: C-ADDR U
2.862+ DUP #BITS-UD = SWAP
2.863+ 0 DO \ S: C-ADDR FLAG
2.864+ OVER C@ [CHAR] 1 = AND \ ALL ONES
2.865+ >R CHAR+ R>
2.866+ LOOP SWAP DROP ;
2.867+T{ GP6 -> <TRUE> }T
2.868+
2.869+: GP7
2.870+ BASE @ >R MAX-BASE BASE !
2.871+ <TRUE>
2.872+ A 0 DO
2.873+ I 0 <# #S #>
2.874+ 1 = SWAP C@ I 30 + = AND AND
2.875+ LOOP
2.876+ MAX-BASE A DO
2.877+ I 0 <# #S #>
2.878+ 1 = SWAP C@ 41 I A - + = AND AND
2.879+ LOOP
2.880+ R> BASE ! ;
2.881+
2.882+T{ GP7 -> <TRUE> }T
2.883+
2.884+\ >NUMBER TESTS
2.885+CREATE GN-BUF 0 C,
2.886+: GN-STRING GN-BUF 1 ;
2.887+: GN-CONSUMED GN-BUF CHAR+ 0 ;
2.888+: GN' [CHAR] ' WORD CHAR+ C@ GN-BUF C! GN-STRING ;
2.889+
2.890+T{ 0 0 GN' 0' >NUMBER -> 0 0 GN-CONSUMED }T
2.891+T{ 0 0 GN' 1' >NUMBER -> 1 0 GN-CONSUMED }T
2.892+T{ 1 0 GN' 1' >NUMBER -> BASE @ 1+ 0 GN-CONSUMED }T
2.893+T{ 0 0 GN' -' >NUMBER -> 0 0 GN-STRING }T \ SHOULD FAIL TO CONVERT THESE
2.894+T{ 0 0 GN' +' >NUMBER -> 0 0 GN-STRING }T
2.895+T{ 0 0 GN' .' >NUMBER -> 0 0 GN-STRING }T
2.896+
2.897+: >NUMBER-BASED
2.898+ BASE @ >R BASE ! >NUMBER R> BASE ! ;
2.899+
2.900+T{ 0 0 GN' 2' 10 >NUMBER-BASED -> 2 0 GN-CONSUMED }T
2.901+T{ 0 0 GN' 2' 2 >NUMBER-BASED -> 0 0 GN-STRING }T
2.902+T{ 0 0 GN' F' 10 >NUMBER-BASED -> F 0 GN-CONSUMED }T
2.903+T{ 0 0 GN' G' 10 >NUMBER-BASED -> 0 0 GN-STRING }T
2.904+T{ 0 0 GN' G' MAX-BASE >NUMBER-BASED -> 10 0 GN-CONSUMED }T
2.905+T{ 0 0 GN' Z' MAX-BASE >NUMBER-BASED -> 23 0 GN-CONSUMED }T
2.906+
2.907+: GN1 \ ( UD BASE -- UD' LEN ) UD SHOULD EQUAL UD' AND LEN SHOULD BE ZERO.
2.908+ BASE @ >R BASE !
2.909+ <# #S #>
2.910+ 0 0 2SWAP >NUMBER SWAP DROP \ RETURN LENGTH ONLY
2.911+ R> BASE ! ;
2.912+T{ 0 0 2 GN1 -> 0 0 0 }T
2.913+T{ MAX-UINT 0 2 GN1 -> MAX-UINT 0 0 }T
2.914+T{ MAX-UINT DUP 2 GN1 -> MAX-UINT DUP 0 }T
2.915+T{ 0 0 MAX-BASE GN1 -> 0 0 0 }T
2.916+T{ MAX-UINT 0 MAX-BASE GN1 -> MAX-UINT 0 0 }T
2.917+T{ MAX-UINT DUP MAX-BASE GN1 -> MAX-UINT DUP 0 }T
2.918+
2.919+: GN2 \ ( -- 16 10 )
2.920+ BASE @ >R HEX BASE @ DECIMAL BASE @ R> BASE ! ;
2.921+T{ GN2 -> 10 A }T
2.922+
2.923+\ ------------------------------------------------------------------------
2.924+TESTING FILL MOVE
2.925+
2.926+CREATE FBUF 00 C, 00 C, 00 C,
2.927+CREATE SBUF 12 C, 34 C, 56 C,
2.928+: SEEBUF FBUF C@ FBUF CHAR+ C@ FBUF CHAR+ CHAR+ C@ ;
2.929+
2.930+T{ FBUF 0 20 FILL -> }T
2.931+T{ SEEBUF -> 00 00 00 }T
2.932+
2.933+T{ FBUF 1 20 FILL -> }T
2.934+T{ SEEBUF -> 20 00 00 }T
2.935+
2.936+T{ FBUF 3 20 FILL -> }T
2.937+T{ SEEBUF -> 20 20 20 }T
2.938+
2.939+T{ FBUF FBUF 3 CHARS MOVE -> }T \ BIZARRE SPECIAL CASE
2.940+T{ SEEBUF -> 20 20 20 }T
2.941+
2.942+T{ SBUF FBUF 0 CHARS MOVE -> }T
2.943+T{ SEEBUF -> 20 20 20 }T
2.944+
2.945+T{ SBUF FBUF 1 CHARS MOVE -> }T
2.946+T{ SEEBUF -> 12 20 20 }T
2.947+
2.948+T{ SBUF FBUF 3 CHARS MOVE -> }T
2.949+T{ SEEBUF -> 12 34 56 }T
2.950+
2.951+T{ FBUF FBUF CHAR+ 2 CHARS MOVE -> }T
2.952+T{ SEEBUF -> 12 12 34 }T
2.953+
2.954+T{ FBUF CHAR+ FBUF 2 CHARS MOVE -> }T
2.955+T{ SEEBUF -> 12 34 34 }T
2.956+
2.957+\ ------------------------------------------------------------------------
2.958+TESTING OUTPUT: . ." CR EMIT SPACE SPACES TYPE U.
2.959+
2.960+: OUTPUT-TEST
2.961+ ." YOU SHOULD SEE THE STANDARD GRAPHIC CHARACTERS:" CR
2.962+ 41 BL DO I EMIT LOOP CR
2.963+ 61 41 DO I EMIT LOOP CR
2.964+ 7F 61 DO I EMIT LOOP CR
2.965+ ." YOU SHOULD SEE 0-9 SEPARATED BY A SPACE:" CR
2.966+ 9 1+ 0 DO I . LOOP CR
2.967+ ." YOU SHOULD SEE 0-9 (WITH NO SPACES):" CR
2.968+ [CHAR] 9 1+ [CHAR] 0 DO I 0 SPACES EMIT LOOP CR
2.969+ ." YOU SHOULD SEE A-G SEPARATED BY A SPACE:" CR
2.970+ [CHAR] G 1+ [CHAR] A DO I EMIT SPACE LOOP CR
2.971+ ." YOU SHOULD SEE 0-5 SEPARATED BY TWO SPACES:" CR
2.972+ 5 1+ 0 DO I [CHAR] 0 + EMIT 2 SPACES LOOP CR
2.973+ ." YOU SHOULD SEE TWO SEPARATE LINES:" CR
2.974+ S" LINE 1" TYPE CR S" LINE 2" TYPE CR
2.975+ ." YOU SHOULD SEE THE NUMBER RANGES OF SIGNED AND UNSIGNED NUMBERS:" CR
2.976+ ." SIGNED: " MIN-INT . MAX-INT . CR
2.977+ ." UNSIGNED: " 0 U. MAX-UINT U. CR
2.978+;
2.979+
2.980+T{ OUTPUT-TEST -> }T
2.981+
2.982+
2.983+\ ------------------------------------------------------------------------
2.984+TESTING INPUT: ACCEPT
2.985+
2.986+CREATE ABUF 50 CHARS ALLOT
2.987+
2.988+: ACCEPT-TEST
2.989+ CR ." PLEASE TYPE UP TO 80 CHARACTERS:" CR
2.990+ ABUF 50 ACCEPT
2.991+ CR ." RECEIVED: " [CHAR] " EMIT
2.992+ ABUF SWAP TYPE [CHAR] " EMIT CR
2.993+;
2.994+
2.995+T{ ACCEPT-TEST -> }T
2.996+
2.997+\ ------------------------------------------------------------------------
2.998+TESTING DICTIONARY SEARCH RULES
2.999+
2.1000+T{ : GDX 123 ; : GDX GDX 234 ; -> }T
2.1001+
2.1002+T{ GDX -> 123 234 }T
2.1003+
2.1004+CR .( End of Core word set tests) CR
2.1005+
2.1006+
3.1--- /dev/null Thu Jan 01 00:00:00 1970 +0000
3.2+++ b/fig/tests/tester.fr Fri May 12 22:58:05 2023 -0400
3.3@@ -0,0 +1,66 @@
3.4+\ From: John Hayes S1I
3.5+\ Subject: tester.fr
3.6+\ Date: Mon, 27 Nov 95 13:10:09 PST
3.7+
3.8+\ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
3.9+\ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
3.10+\ VERSION 1.2
3.11+
3.12+\ 24/11/2015 Replaced Core Ext word <> with = 0=
3.13+\ 31/3/2015 Variable #ERRORS added and incremented for each error reported.
3.14+\ 22/1/09 The words { and } have been changed to T{ and }T respectively to
3.15+\ agree with the Forth 200X file ttester.fs. This avoids clashes with
3.16+\ locals using { ... } and the FSL use of }
3.17+
3.18+HEX
3.19+
3.20+\ SET THE FOLLOWING FLAG TO TRUE FOR MORE VERBOSE OUTPUT; THIS MAY
3.21+\ ALLOW YOU TO TELL WHICH TEST CAUSED YOUR SYSTEM TO HANG.
3.22+VARIABLE VERBOSE
3.23+ FALSE VERBOSE !
3.24+\ TRUE VERBOSE !
3.25+
3.26+: EMPTY-STACK \ ( ... -- ) EMPTY STACK: HANDLES UNDERFLOWED STACK TOO.
3.27+ DEPTH ?DUP IF DUP 0< IF NEGATE 0 DO 0 LOOP ELSE 0 DO DROP LOOP THEN THEN ;
3.28+
3.29+VARIABLE #ERRORS 0 #ERRORS !
3.30+
3.31+: ERROR \ ( C-ADDR U -- ) DISPLAY AN ERROR MESSAGE FOLLOWED BY
3.32+ \ THE LINE THAT HAD THE ERROR.
3.33+ CR TYPE SOURCE TYPE \ DISPLAY LINE CORRESPONDING TO ERROR
3.34+ EMPTY-STACK \ THROW AWAY EVERY THING ELSE
3.35+ #ERRORS @ 1 + #ERRORS !
3.36+\ QUIT \ *** Uncomment this line to QUIT on an error
3.37+;
3.38+
3.39+VARIABLE ACTUAL-DEPTH \ STACK RECORD
3.40+CREATE ACTUAL-RESULTS 20 CELLS ALLOT
3.41+
3.42+: T{ \ ( -- ) SYNTACTIC SUGAR.
3.43+ ;
3.44+
3.45+: -> \ ( ... -- ) RECORD DEPTH AND CONTENT OF STACK.
3.46+ DEPTH DUP ACTUAL-DEPTH ! \ RECORD DEPTH
3.47+ ?DUP IF \ IF THERE IS SOMETHING ON STACK
3.48+ 0 DO ACTUAL-RESULTS I CELLS + ! LOOP \ SAVE THEM
3.49+ THEN ;
3.50+
3.51+: }T \ ( ... -- ) COMPARE STACK (EXPECTED) CONTENTS WITH SAVED
3.52+ \ (ACTUAL) CONTENTS.
3.53+ DEPTH ACTUAL-DEPTH @ = IF \ IF DEPTHS MATCH
3.54+ DEPTH ?DUP IF \ IF THERE IS SOMETHING ON THE STACK
3.55+ 0 DO \ FOR EACH STACK ITEM
3.56+ ACTUAL-RESULTS I CELLS + @ \ COMPARE ACTUAL WITH EXPECTED
3.57+ = 0= IF S" INCORRECT RESULT: " ERROR LEAVE THEN
3.58+ LOOP
3.59+ THEN
3.60+ ELSE \ DEPTH MISMATCH
3.61+ S" WRONG NUMBER OF RESULTS: " ERROR
3.62+ THEN ;
3.63+
3.64+: TESTING \ ( -- ) TALKING COMMENT.
3.65+ SOURCE VERBOSE @
3.66+ IF DUP >R TYPE CR R> >IN !
3.67+ ELSE >IN ! DROP [CHAR] * EMIT
3.68+ THEN ;
3.69+
4.1--- a/tk.lisp Mon May 08 21:11:03 2023 -0400
4.2+++ b/tk.lisp Fri May 12 22:58:05 2023 -0400
4.3@@ -1,31 +1,15 @@
4.4-(in-package #:demo)
4.5+(in-package :demo)
4.6
4.7-(defvar *cargo-target* #P"/Users/ellis/dev/otom8/demo/target/")
4.8+(defvar *cargo-target* #p"/Users/ellis/dev/otom8/demo/target/")
4.9
4.10 (defvar *rs-macros* nil)
4.11
4.12-(defmacro rs-find-dll (name &optional debug)
4.13- "Find the rust dll specified by NAME."
4.14- (cond
4.15- ((uiop:directory-exists-p (merge-pathnames *cargo-target* "release"))
4.16- `,(mkstr "./target/release/" name))
4.17- ((uiop:directory-exists-p (merge-pathnames *cargo-target* "debug"))
4.18- `,(mkstr "./target/debug/" name))
4.19- (t (progn
4.20- (uiop:run-program `("cargo" "build" ,(unless debug "--release")) :output t)
4.21- `,(find-rust-dll name debug)))))
4.22+(defun mkstr (&rest args)
4.23+ (with-output-to-string (s)
4.24+ (dolist (a args) (princ a s))))
4.25
4.26-(defmacro rs-defmacro (args &body body)
4.27- "Define a macro which expands to a string of Rust code.")
4.28-
4.29-(defun rs-macroexpand-1 (form &optional env))
4.30-
4.31-(defun rs-macroexpand (env &rest body)
4.32- "Cbindgen is quite the menace and really doesn't like our macros used
4.33-to generate C FFI bindings. To compensate for this, we use a tool
4.34-called cargo-expand by the most excellent dtolnay which expands Rust
4.35-macros. The expansions are assembled into an equivalent Rust source
4.36-file which cbindgen won't get stuck in an infinite compile loop on.")
4.37+(defun symb (&rest args)
4.38+ (values (intern (apply #'mkstr args))))
4.39
4.40 (defun random-id ()
4.41 (format NIL "~8,'0x-~8,'0x" (random #xFFFFFFFF) (get-universal-time)))
4.42@@ -34,13 +18,6 @@
4.43 (dolist (path (directory (merge-pathnames (merge-pathnames filename "**/") dir)))
4.44 (funcall callback path)))
4.45
4.46-(defun mkstr (&rest args)
4.47- (with-output-to-string (s)
4.48- (dolist (a args) (princ a s))))
4.49-
4.50-(defun symb (&rest args)
4.51- (values (intern (apply #'mkstr args))))
4.52-
4.53 (defun sbq-reader (stream sub-char numarg)
4.54 "The anaphoric sharp-backquote reader: #`((,a1))"
4.55 (declare (ignore sub-char))
4.56@@ -53,3 +30,80 @@
4.57 (eval-when (:execute)
4.58 (set-dispatch-macro-character
4.59 #\# #\` #'demo:sbq-reader))
4.60+
4.61+;;; RUST MACROS
4.62+(defmacro rs-find-dll (name &optional debug)
4.63+ "Find the rust dll specified by NAME."
4.64+ (cond
4.65+ ((uiop:directory-exists-p (merge-pathnames *cargo-target* "release"))
4.66+ `,(mkstr "./target/release/" name))
4.67+ ((uiop:directory-exists-p (merge-pathnames *cargo-target* "debug"))
4.68+ `,(mkstr "./target/debug/" name))
4.69+ (t `(progn
4.70+ ,(uiop:run-program '("cargo" "build" (unless debug "--release")) :output t)
4.71+ (rs-find-dll ,name ,debug)))))
4.72+
4.73+(defun rs-mod-form (crate &optional mods pub)
4.74+ "Generate a basic mod form (CRATE . [MODS] [PUB])"
4.75+ `(,crate ,mods ,pub))
4.76+
4.77+(defmacro with-rs-env (imports &body body)
4.78+ "Generate an environment for use within a Rust generator macro."
4.79+ `(let ((imports ,(mapcar #'rs-mod-form imports)))
4.80+ (format nil "~A~&~A" imports ',body)))
4.81+
4.82+(defun rs-use (crate &optional mods pub)
4.83+ "Generate a single Rust use statement."
4.84+ (concatenate
4.85+ 'string
4.86+ (if pub "pub " "")
4.87+ "use " crate "::{"
4.88+ (cond
4.89+ ((consp mods)
4.90+ (reduce
4.91+ (lambda (x y) (format nil "~A,~A" x y))
4.92+ mods))
4.93+ (t mods))
4.94+ "};"))
4.95+
4.96+(defun rs-mod (mod &optional pub)
4.97+ "Generate a single Rust mod statement."
4.98+ (concatenate
4.99+ 'string
4.100+ (if pub "pub " "")
4.101+ "mod " mod ";"))
4.102+
4.103+(defun rs-imports (&rest imports)
4.104+ "Generate a string of Rust 'use' statements."
4.105+ (cond
4.106+ ((consp imports)
4.107+ (mapcar (lambda (x) (apply #'rs-use (apply #'rs-mod-form x))) imports))
4.108+ (t imports)))
4.109+
4.110+(defmacro rs-extern-c-fn (name args &optional pub unsafe no-mangle &body body)
4.111+ "Generate a Rust extern 'C' fn."
4.112+ `(concatenate
4.113+ 'string
4.114+ ,(when no-mangle (format nil "#[no_mangle]~&"))
4.115+ ,(when pub "pub ")
4.116+ ,(when unsafe "unsafe ")
4.117+ "extern \"C\" fn " ,name "("
4.118+ ,(cond
4.119+ ((consp args) (reduce (lambda (x y) (format nil "~A,~A" x y)) args))
4.120+ (t args))
4.121+ ")" "{" ,@body "}"))
4.122+
4.123+(defun rs-obj-impl (obj)
4.124+ "Implement Objective for give OBJ."
4.125+ (format nil "impl Objective for ~A {};" obj))
4.126+
4.127+;; (defun rs-macroexpand-1 (form &optional env))
4.128+
4.129+;; (defun rs-macroexpand (env &rest body)
4.130+;; "Cbindgen is quite the menace and really doesn't like our macros used
4.131+;; to generate C FFI bindings. To compensate for this, we use a tool
4.132+;; called cargo-expand by the most excellent dtolnay which expands Rust
4.133+;; macros. The expansions are assembled into an equivalent Rust source
4.134+;; file which cbindgen won't get stuck in an infinite compile loop on.")
4.135+
4.136+;;;
5.1--- a/ui.lisp Mon May 08 21:11:03 2023 -0400
5.2+++ b/ui.lisp Fri May 12 22:58:05 2023 -0400
5.3@@ -1,5 +1,4 @@
5.4 (in-package :demo)
5.5-
5.6 (defun on-new-window (body)
5.7 "Handle new window event."
5.8 (let ((elt (clog:create-child body "<h1>foobar</h1>")))
