/tsuiteyour.frt
https://bitbucket.org/avanderhorst/yourforth · Forth · 969 lines · 812 code · 155 blank · 2 comment · 1 complexity · 6bf692aebc742c222437fba78033cbaa MD5 · raw file
- 'NOOP 'OK 3 CELLS MOVE
- \ AH This is based on something from MHX.
- \ Modifications have to do with where Hayce moves the interpret
- \ pointer to the end or begin of the input buffer
- \ ciforth uses PP instead of >IN
- \ The jump out of a BEGIN loop, is refused with _SECURITY_( _yes )
- \ so NO-SECURITY is invoked.
- \ ==================================================================
- \ This is the ISO compatibility layer, to be phased out
- HEX
- "RDROP" (CREATE)
- 8D C, 6D C, 04 C, \ LEA EBP,[EBP+(CW*(1))]
- AD C, \ LODSD ; NEXT
- FF C, 20 C, \ JMP LONG[EAX]
- : LEAVE RDROP RDROP RDROP ;
- \ FIXME! This definition is terribly wrong, but it helps out.
- : D+ SDSWAP + >R + R> ;
- : ( PP@@ 2DROP &) PARSE 2DROP ; IMMEDIATE
- DECIMAL
- \ Reasonable additions.
- : TRUE -1 ;
- : SOURCE SRC 2@ SWAP OVER - ;
- \ Words used in the preambule of the Hayes test.
- \ Words actually used in the Hayes test.
- : >NUMBER
- 2DUP + >R 0 2DUP - IF
- DO
- DUP C@ DIGIT IF DROP LEAVE THEN
- SWAP >R SWAP BASE @ M* DROP SDSWAP BASE @ M* D+ R> 1+
- LOOP
- ELSE
- 2DROP
- THEN
- R> OVER - ;
- : 1- 1 - ;
- : 2/ DUP 0< 31 RSHIFT 31 LSHIFT SWAP 1 RSHIFT OR ;
- : S>D DUP 0< ;
- \ ==================================================================
- \ This is based on a testsuite of
- \ (C) 1993 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
- \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
- \ VERSION 1.0
- \ It has the test for words replaced by tests for
- \ the equivalent words in yourforth
- HEX
- \ SET THE FOLLOWING FLAG TO TRUE FOR MORE VERBOSE OUTPUT; THIS MAY
- \ ALLOW YOU TO TELL WHICH TEST CAUSED YOUR SYSTEM TO HANG.
- VARIABLE VERBOSE
- TRUE VERBOSE !
- \ FALSE VERBOSE !
- : EMPTY-STACK CLS ; \ ( ... -- ) EMPTY STACK.
- ' ERROR HIDDEN
- : ERROR \ ( C-ADDR U -- ) DISPLAY AN ERROR MESSAGE FOLLOWED BY
- \ THE LINE THAT HAD THE ERROR.
- TYPE ( SOURCE TYPE ) CR \ DISPLAY LINE CORRESPONDING TO ERROR
- EMPTY-STACK \ THROW AWAY EVERY THING ELSE
- ;
- VARIABLE ACTUAL-DEPTH \ STACK RECORD
- CREATE ACTUAL-RESULTS 20 CELLS ALLOT
- : { \ ( -- ) SYNTACTIC SUGAR.
- \ SOURCE TYPE CR \ DISPLAY LINE CORRESPONDING TO TEST
- \ PP @ SRC CELL+ @ OVER - 0A $/ TYPE CR 2DROP
- ( #LINES @ CR DEC. ) ; \ If your system has #LINES DEC.
- : -> \ ( ... -- ) RECORD DEPTH AND CONTENT OF STACK.
- DEPTH DUP ACTUAL-DEPTH ! \ RECORD DEPTH
- DUP IF \ IF THERE IS SOMETHING ON STACK
- 0 DO ACTUAL-RESULTS I CELLS + ! LOOP \ SAVE THEM
- ELSE DROP THEN ;
- : } \ ( ... -- ) COMPARE STACK (EXPECTED) CONTENTS WITH SAVED
- \ (ACTUAL) CONTENTS.
- DEPTH ACTUAL-DEPTH @ = IF \ IF DEPTHS MATCH
- DEPTH DUP IF \ IF THERE IS SOMETHING ON THE STACK
- 0 DO \ FOR EACH STACK ITEM
- ACTUAL-RESULTS I CELLS + @ \ COMPARE ACTUAL WITH EXPECTED
- <> IF "INCORRECT RESULT: " ERROR LEAVE THEN
- LOOP
- ELSE DROP THEN
- ELSE \ DEPTH MISMATCH
- "WRONG NUMBER OF RESULTS: " ERROR
- THEN ;
- : TESTING \ ( -- ) TALKING COMMENT.
- POSTPONE \
- VERBOSE @ IF SOURCE TYPE CR THEN
- ;
- \ (C) 1993 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
- \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
- \ VERSION 1.0
- \ THIS PROGRAM TESTS THE CORE WORDS OF AN ANS FORTH SYSTEM.
- \ THE PROGRAM ASSUMES A TWO'S COMPLEMENT IMPLEMENTATION WHERE
- \ THE RANGE OF SIGNED NUMBERS IS -2^(N-1) ... 2^(N-1)-1 AND
- \ THE RANGE OF UNSIGNED NUMBER IS 0 ... 2^(N)-1.
- \ I HAVEN'T FIGURED OUT HOW TO TEST KEY, QUIT, ABORT, OR ABORT"...
- \ I ALSO HAVEN'T THOUGHT OF A WAY TO TEST ENVIRONMENT?...
- TESTING CORE WORDS
- HEX
- \ ------------------------------------------------------------------------
- TESTING BOOLEANS: INVERT AND OR XOR
- { 0 0 AND -> 0 }
- { 0 1 AND -> 0 }
- { 1 0 AND -> 0 }
- { 1 1 AND -> 1 }
- { 0 INVERT 1 AND -> 1 }
- { 1 INVERT 1 AND -> 0 }
- 0 CONSTANT 0S
- 0 INVERT CONSTANT 1S
- { 0S INVERT -> 1S }
- { 1S INVERT -> 0S }
- { 0S 0S AND -> 0S }
- { 0S 1S AND -> 0S }
- { 1S 0S AND -> 0S }
- { 1S 1S AND -> 1S }
- { 0S 0S OR -> 0S }
- { 0S 1S OR -> 1S }
- { 1S 0S OR -> 1S }
- { 1S 1S OR -> 1S }
- { 0S 0S XOR -> 0S }
- { 0S 1S XOR -> 1S }
- { 1S 0S XOR -> 1S }
- { 1S 1S XOR -> 0S }
- \ ------------------------------------------------------------------------
- TESTING LSHIFT RSHIFT
- : FIND-MSB
- 1 BEGIN DUP 1 LSHIFT WHILE 1 LSHIFT REPEAT ;
- FIND-MSB CONSTANT MSB
- { 1 0 LSHIFT -> 1 }
- { 1 1 LSHIFT -> 2 }
- { 1 2 LSHIFT -> 4 }
- { 1 F LSHIFT -> 8000 } \ BIGGEST GUARANTEED SHIFT
- { 0 INVERT 1 LSHIFT 1 XOR -> 0 INVERT }
- { MSB 1 LSHIFT -> 0 }
- { 1 0 RSHIFT -> 1 }
- { 1 1 RSHIFT -> 0 }
- { 2 1 RSHIFT -> 1 }
- { 4 2 RSHIFT -> 1 }
- { 8000 F RSHIFT -> 1 } \ BIGGEST
- { MSB 1 RSHIFT MSB AND -> 0 } \ RSHIFT ZERO FILLS MSBS
- { MSB 1 RSHIFT 1 LSHIFT -> MSB }
- \ ------------------------------------------------------------------------
- TESTING COMPARISONS: 0= = 0< < > MIN MAX
- 0 INVERT CONSTANT MAX-UINT
- 0 INVERT 1 RSHIFT CONSTANT MAX-INT
- 0 INVERT 1 RSHIFT INVERT CONSTANT MIN-INT
- 0 INVERT 1 RSHIFT CONSTANT MID-UINT
- 0 INVERT 1 RSHIFT INVERT CONSTANT MID-UINT+1
- 0S CONSTANT <FALSE>
- 1S CONSTANT <TRUE>
- { -> } \ START WITH CLEAN SLATE
- { 0 0= -> <TRUE> }
- { 1 0= -> <FALSE> }
- { 2 0= -> <FALSE> }
- { -1 0= -> <FALSE> }
- { MAX-UINT 0= -> <FALSE> }
- { MIN-INT 0= -> <FALSE> }
- { MAX-INT 0= -> <FALSE> }
- { 0 0 = -> <TRUE> }
- { 1 1 = -> <TRUE> }
- { -1 -1 = -> <TRUE> }
- { 1 0 = -> <FALSE> }
- { -1 0 = -> <FALSE> }
- { 0 1 = -> <FALSE> }
- { 0 -1 = -> <FALSE> }
- { 0 0< -> <FALSE> }
- { -1 0< -> <TRUE> }
- { MIN-INT 0< -> <TRUE> }
- { 1 0< -> <FALSE> }
- { MAX-INT 0< -> <FALSE> }
- { 0 1 < -> <TRUE> }
- { 1 2 < -> <TRUE> }
- { -1 0 < -> <TRUE> }
- { -1 1 < -> <TRUE> }
- { MIN-INT 0 < -> <TRUE> }
- { MIN-INT MAX-INT < -> <TRUE> }
- { 0 MAX-INT < -> <TRUE> }
- { 0 0 < -> <FALSE> }
- { 1 1 < -> <FALSE> }
- { 1 0 < -> <FALSE> }
- { 2 1 < -> <FALSE> }
- { 0 -1 < -> <FALSE> }
- { 1 -1 < -> <FALSE> }
- { 0 MIN-INT < -> <FALSE> }
- { MAX-INT MIN-INT < -> <FALSE> }
- { MAX-INT 0 < -> <FALSE> }
- { 0 1 > -> <FALSE> }
- { 1 2 > -> <FALSE> }
- { -1 0 > -> <FALSE> }
- { -1 1 > -> <FALSE> }
- { MIN-INT 0 > -> <FALSE> }
- { MIN-INT MAX-INT > -> <FALSE> }
- { 0 MAX-INT > -> <FALSE> }
- { 0 0 > -> <FALSE> }
- { 1 1 > -> <FALSE> }
- { 1 0 > -> <TRUE> }
- { 2 1 > -> <TRUE> }
- { 0 -1 > -> <TRUE> }
- { 1 -1 > -> <TRUE> }
- { 0 MIN-INT > -> <TRUE> }
- { MAX-INT MIN-INT > -> <TRUE> }
- { MAX-INT 0 > -> <TRUE> }
- { 0 1 MIN -> 0 }
- { 1 2 MIN -> 1 }
- { -1 0 MIN -> -1 }
- { -1 1 MIN -> -1 }
- { MIN-INT 0 MIN -> MIN-INT }
- { MIN-INT MAX-INT MIN -> MIN-INT }
- { 0 MAX-INT MIN -> 0 }
- { 0 0 MIN -> 0 }
- { 1 1 MIN -> 1 }
- { 1 0 MIN -> 0 }
- { 2 1 MIN -> 1 }
- { 0 -1 MIN -> -1 }
- { 1 -1 MIN -> -1 }
- { 0 MIN-INT MIN -> MIN-INT }
- { MAX-INT MIN-INT MIN -> MIN-INT }
- { MAX-INT 0 MIN -> 0 }
- { 0 1 MAX -> 1 }
- { 1 2 MAX -> 2 }
- { -1 0 MAX -> 0 }
- { -1 1 MAX -> 1 }
- { MIN-INT 0 MAX -> 0 }
- { MIN-INT MAX-INT MAX -> MAX-INT }
- { 0 MAX-INT MAX -> MAX-INT }
- { 0 0 MAX -> 0 }
- { 1 1 MAX -> 1 }
- { 1 0 MAX -> 1 }
- { 2 1 MAX -> 2 }
- { 0 -1 MAX -> 0 }
- { 1 -1 MAX -> 1 }
- { 0 MIN-INT MAX -> 0 }
- { MAX-INT MIN-INT MAX -> MAX-INT }
- { MAX-INT 0 MAX -> MAX-INT }
- \ ------------------------------------------------------------------------
- TESTING STACK OPS: 2DROP 2DUP 2OVER 2SWAP DEPTH DROP DUP OVER SDSWAP SWAP
- { 1 2 2DROP -> }
- { 1 2 2DUP -> 1 2 1 2 }
- { 1 2 3 4 2OVER -> 1 2 3 4 1 2 }
- { 1 2 3 4 2SWAP -> 3 4 1 2 }
- { DEPTH -> 0 }
- { 0 DEPTH -> 0 1 }
- { 0 1 DEPTH -> 0 1 2 }
- { 0 DROP -> }
- { 1 2 DROP -> 1 }
- { 1 DUP -> 1 1 }
- { 1 2 OVER -> 1 2 1 }
- { 1 2 3 SDSWAP -> 2 3 1 }
- { 1 2 SWAP -> 2 1 }
- \ ------------------------------------------------------------------------
- TESTING >R R> R@
- { : GR1 >R R> ; -> }
- { : GR2 >R R@ R> DROP ; -> }
- { 123 GR1 -> 123 }
- { 123 GR2 -> 123 }
- \ ------------------------------------------------------------------------
- TESTING ADD/SUBTRACT: + - 1+ ABS NEGATE
- { 0 5 + -> 5 }
- { 5 0 + -> 5 }
- { 0 -5 + -> -5 }
- { -5 0 + -> -5 }
- { 1 2 + -> 3 }
- { 1 -2 + -> -1 }
- { -1 2 + -> 1 }
- { -1 -2 + -> -3 }
- { -1 1 + -> 0 }
- { MID-UINT 1 + -> MID-UINT+1 }
- { 0 5 - -> -5 }
- { 5 0 - -> 5 }
- { 0 -5 - -> 5 }
- { -5 0 - -> -5 }
- { 1 2 - -> -1 }
- { 1 -2 - -> 3 }
- { -1 2 - -> -3 }
- { -1 -2 - -> 1 }
- { 0 1 - -> -1 }
- { MID-UINT+1 1 - -> MID-UINT }
- { 0 1+ -> 1 }
- { -1 1+ -> 0 }
- { 1 1+ -> 2 }
- { MID-UINT 1+ -> MID-UINT+1 }
- { 0 NEGATE -> 0 }
- { 1 NEGATE -> -1 }
- { -1 NEGATE -> 1 }
- { 2 NEGATE -> -2 }
- { -2 NEGATE -> 2 }
- { 0 ABS -> 0 }
- { 1 ABS -> 1 }
- { -1 ABS -> 1 }
- { MIN-INT ABS -> MID-UINT+1 }
- \ ------------------------------------------------------------------------
- TESTING MULTIPLY: S>D * M*
- { 0 S>D -> 0 0 }
- { 1 S>D -> 1 0 }
- { 2 S>D -> 2 0 }
- { -1 S>D -> -1 -1 }
- { -2 S>D -> -2 -1 }
- { MIN-INT S>D -> MIN-INT -1 }
- { MAX-INT S>D -> MAX-INT 0 }
- { 0 0 M* -> 0 S>D }
- { 0 1 M* -> 0 S>D }
- { 1 0 M* -> 0 S>D }
- { 1 2 M* -> 2 S>D }
- { 2 1 M* -> 2 S>D }
- { 3 3 M* -> 9 S>D }
- { -3 3 M* -> -9 S>D }
- { 3 -3 M* -> -9 S>D }
- { -3 -3 M* -> 9 S>D }
- { 0 MIN-INT M* -> 0 S>D }
- { 1 MIN-INT M* -> MIN-INT S>D }
- { 2 MIN-INT M* -> 0 1S }
- { 0 MAX-INT M* -> 0 S>D }
- { 1 MAX-INT M* -> MAX-INT S>D }
- { 2 MAX-INT M* -> MAX-INT 1 LSHIFT 0 }
- { MIN-INT MIN-INT M* -> 0 MSB 1 RSHIFT }
- { MAX-INT MIN-INT M* -> MSB MSB 2/ }
- { MAX-INT MAX-INT M* -> 1 MSB 2/ INVERT }
- { 0 0 * -> 0 } \ TEST IDENTITIES
- { 0 1 * -> 0 }
- { 1 0 * -> 0 }
- { 1 2 * -> 2 }
- { 2 1 * -> 2 }
- { 3 3 * -> 9 }
- { -3 3 * -> -9 }
- { 3 -3 * -> -9 }
- { -3 -3 * -> 9 }
- { MID-UINT+1 1 RSHIFT 2 * -> MID-UINT+1 }
- { MID-UINT+1 2 RSHIFT 4 * -> MID-UINT+1 }
- { MID-UINT+1 1 RSHIFT MID-UINT+1 OR 2 * -> MID-UINT+1 }
- \ ------------------------------------------------------------------------
- TESTING DIVIDE: SM/REM */ */MOD / /MOD MOD
- { 0 S>D 1 SM/REM -> 0 0 }
- { 1 S>D 1 SM/REM -> 0 1 }
- { 2 S>D 1 SM/REM -> 0 2 }
- { -1 S>D 1 SM/REM -> 0 -1 }
- { -2 S>D 1 SM/REM -> 0 -2 }
- { 0 S>D -1 SM/REM -> 0 0 }
- { 1 S>D -1 SM/REM -> 0 -1 }
- { 2 S>D -1 SM/REM -> 0 -2 }
- { -1 S>D -1 SM/REM -> 0 1 }
- { -2 S>D -1 SM/REM -> 0 2 }
- { 2 S>D 2 SM/REM -> 0 1 }
- { -1 S>D -1 SM/REM -> 0 1 }
- { -2 S>D -2 SM/REM -> 0 1 }
- { 7 S>D 3 SM/REM -> 1 2 }
- { 7 S>D -3 SM/REM -> 1 -2 }
- { -7 S>D 3 SM/REM -> -1 -2 }
- { -7 S>D -3 SM/REM -> -1 2 }
- { MAX-INT S>D 1 SM/REM -> 0 MAX-INT }
- { MIN-INT S>D 1 SM/REM -> 0 MIN-INT }
- { MAX-INT S>D MAX-INT SM/REM -> 0 1 }
- { MIN-INT S>D MIN-INT SM/REM -> 0 1 }
- { 1S 1 4 SM/REM -> 3 MAX-INT }
- { 2 MIN-INT M* 2 SM/REM -> 0 MIN-INT }
- { 2 MIN-INT M* MIN-INT SM/REM -> 0 2 }
- { 2 MAX-INT M* 2 SM/REM -> 0 MAX-INT }
- { 2 MAX-INT M* MAX-INT SM/REM -> 0 2 }
- { MIN-INT MIN-INT M* MIN-INT SM/REM -> 0 MIN-INT }
- { MIN-INT MAX-INT M* MIN-INT SM/REM -> 0 MAX-INT }
- { MIN-INT MAX-INT M* MAX-INT SM/REM -> 0 MIN-INT }
- { MAX-INT MAX-INT M* MAX-INT SM/REM -> 0 MAX-INT }
- : IFSYM
- [ -3 2 / -1 = INVERT ] LITERAL IF POSTPONE \ THEN ;
- \ THE SYSTEM MIGHT DO EITHER FLOORED OR SYMMETRIC DIVISION.
- \ SINCE WE HAVE ALREADY TESTED M*, AND SM/REM WE CAN USE THEM IN TEST.
- IFSYM : T/MOD >R S>D R> SM/REM ;
- IFSYM : T/ T/MOD SWAP DROP ;
- IFSYM : TMOD T/MOD DROP ;
- IFSYM : T*/MOD >R M* R> SM/REM ;
- IFSYM : T*/ T*/MOD SWAP DROP ;
- { 0 1 /MOD -> 0 1 T/MOD }
- { 1 1 /MOD -> 1 1 T/MOD }
- { 2 1 /MOD -> 2 1 T/MOD }
- { -1 1 /MOD -> -1 1 T/MOD }
- { -2 1 /MOD -> -2 1 T/MOD }
- { 0 -1 /MOD -> 0 -1 T/MOD }
- { 1 -1 /MOD -> 1 -1 T/MOD }
- { 2 -1 /MOD -> 2 -1 T/MOD }
- { -1 -1 /MOD -> -1 -1 T/MOD }
- { -2 -1 /MOD -> -2 -1 T/MOD }
- { 2 2 /MOD -> 2 2 T/MOD }
- { -1 -1 /MOD -> -1 -1 T/MOD }
- { -2 -2 /MOD -> -2 -2 T/MOD }
- { 7 3 /MOD -> 7 3 T/MOD }
- { 7 -3 /MOD -> 7 -3 T/MOD }
- { -7 3 /MOD -> -7 3 T/MOD }
- { -7 -3 /MOD -> -7 -3 T/MOD }
- { MAX-INT 1 /MOD -> MAX-INT 1 T/MOD }
- { MIN-INT 1 /MOD -> MIN-INT 1 T/MOD }
- { MAX-INT MAX-INT /MOD -> MAX-INT MAX-INT T/MOD }
- { MIN-INT MIN-INT /MOD -> MIN-INT MIN-INT T/MOD }
- { 0 1 / -> 0 1 T/ }
- { 1 1 / -> 1 1 T/ }
- { 2 1 / -> 2 1 T/ }
- { -1 1 / -> -1 1 T/ }
- { -2 1 / -> -2 1 T/ }
- { 0 -1 / -> 0 -1 T/ }
- { 1 -1 / -> 1 -1 T/ }
- { 2 -1 / -> 2 -1 T/ }
- { -1 -1 / -> -1 -1 T/ }
- { -2 -1 / -> -2 -1 T/ }
- { 2 2 / -> 2 2 T/ }
- { -1 -1 / -> -1 -1 T/ }
- { -2 -2 / -> -2 -2 T/ }
- { 7 3 / -> 7 3 T/ }
- { 7 -3 / -> 7 -3 T/ }
- { -7 3 / -> -7 3 T/ }
- { -7 -3 / -> -7 -3 T/ }
- { MAX-INT 1 / -> MAX-INT 1 T/ }
- { MIN-INT 1 / -> MIN-INT 1 T/ }
- { MAX-INT MAX-INT / -> MAX-INT MAX-INT T/ }
- { MIN-INT MIN-INT / -> MIN-INT MIN-INT T/ }
- { 0 1 MOD -> 0 1 TMOD }
- { 1 1 MOD -> 1 1 TMOD }
- { 2 1 MOD -> 2 1 TMOD }
- { -1 1 MOD -> -1 1 TMOD }
- { -2 1 MOD -> -2 1 TMOD }
- { 0 -1 MOD -> 0 -1 TMOD }
- { 1 -1 MOD -> 1 -1 TMOD }
- { 2 -1 MOD -> 2 -1 TMOD }
- { -1 -1 MOD -> -1 -1 TMOD }
- { -2 -1 MOD -> -2 -1 TMOD }
- { 2 2 MOD -> 2 2 TMOD }
- { -1 -1 MOD -> -1 -1 TMOD }
- { -2 -2 MOD -> -2 -2 TMOD }
- { 7 3 MOD -> 7 3 TMOD }
- { 7 -3 MOD -> 7 -3 TMOD }
- { -7 3 MOD -> -7 3 TMOD }
- { -7 -3 MOD -> -7 -3 TMOD }
- { MAX-INT 1 MOD -> MAX-INT 1 TMOD }
- { MIN-INT 1 MOD -> MIN-INT 1 TMOD }
- { MAX-INT MAX-INT MOD -> MAX-INT MAX-INT TMOD }
- { MIN-INT MIN-INT MOD -> MIN-INT MIN-INT TMOD }
- { 0 2 1 */ -> 0 2 1 T*/ }
- { 1 2 1 */ -> 1 2 1 T*/ }
- { 2 2 1 */ -> 2 2 1 T*/ }
- { -1 2 1 */ -> -1 2 1 T*/ }
- { -2 2 1 */ -> -2 2 1 T*/ }
- { 0 2 -1 */ -> 0 2 -1 T*/ }
- { 1 2 -1 */ -> 1 2 -1 T*/ }
- { 2 2 -1 */ -> 2 2 -1 T*/ }
- { -1 2 -1 */ -> -1 2 -1 T*/ }
- { -2 2 -1 */ -> -2 2 -1 T*/ }
- { 2 2 2 */ -> 2 2 2 T*/ }
- { -1 2 -1 */ -> -1 2 -1 T*/ }
- { -2 2 -2 */ -> -2 2 -2 T*/ }
- { 7 2 3 */ -> 7 2 3 T*/ }
- { 7 2 -3 */ -> 7 2 -3 T*/ }
- { -7 2 3 */ -> -7 2 3 T*/ }
- { -7 2 -3 */ -> -7 2 -3 T*/ }
- \ J.H has now removed this one!!! { MAX-INT 2 1 */ -> MAX-INT 2 1 T*/ }
- \ J.H has now removed this one!!! { MIN-INT 2 1 */ -> MIN-INT 2 1 T*/ }
- { MAX-INT 2 MAX-INT */ -> MAX-INT 2 MAX-INT T*/ }
- { MIN-INT 2 MIN-INT */ -> MIN-INT 2 MIN-INT T*/ }
- { 0 2 1 */MOD -> 0 2 1 T*/MOD }
- { 1 2 1 */MOD -> 1 2 1 T*/MOD }
- { 2 2 1 */MOD -> 2 2 1 T*/MOD }
- { -1 2 1 */MOD -> -1 2 1 T*/MOD }
- { -2 2 1 */MOD -> -2 2 1 T*/MOD }
- { 0 2 -1 */MOD -> 0 2 -1 T*/MOD }
- { 1 2 -1 */MOD -> 1 2 -1 T*/MOD }
- { 2 2 -1 */MOD -> 2 2 -1 T*/MOD }
- { -1 2 -1 */MOD -> -1 2 -1 T*/MOD }
- { -2 2 -1 */MOD -> -2 2 -1 T*/MOD }
- { 2 2 2 */MOD -> 2 2 2 T*/MOD }
- { -1 2 -1 */MOD -> -1 2 -1 T*/MOD }
- { -2 2 -2 */MOD -> -2 2 -2 T*/MOD }
- { 7 2 3 */MOD -> 7 2 3 T*/MOD }
- { 7 2 -3 */MOD -> 7 2 -3 T*/MOD }
- { -7 2 3 */MOD -> -7 2 3 T*/MOD }
- { -7 2 -3 */MOD -> -7 2 -3 T*/MOD }
- \ has now removed this one!!! { MAX-INT 2 1 */MOD -> MAX-INT 2 1 T*/MOD }
- \ has now removed this one!!! { MIN-INT 2 1 */MOD -> MIN-INT 2 1 T*/MOD }
- { MAX-INT 2 MAX-INT */MOD -> MAX-INT 2 MAX-INT T*/MOD }
- { MIN-INT 2 MIN-INT */MOD -> MIN-INT 2 MIN-INT T*/MOD }
- \ ------------------------------------------------------------------------
- TESTING HERE , @ ! CELL+ CELLS C, C@ C! 2@ 2! ALIGN ALIGNED +! ALLOT
- HERE 1 ALLOT
- HERE
- CONSTANT 2NDA
- CONSTANT 1STA
- { 1STA 2NDA < -> <TRUE> } \ HERE MUST GROW WITH ALLOT
- { 1STA 1+ -> 2NDA } \ ... BY ONE ADDRESS UNIT
- ( MISSING TEST: NEGATIVE ALLOT )
- HERE 1 ,
- HERE 2 ,
- CONSTANT 2ND
- CONSTANT 1ST
- { 1ST 2ND < -> <TRUE> } \ HERE MUST GROW WITH ALLOT
- { 1ST CELL+ -> 2ND } \ ... BY ONE CELL
- { 1ST 1 CELLS + -> 2ND }
- { 1ST @ 2ND @ -> 1 2 }
- { 5 1ST ! -> }
- { 1ST @ 2ND @ -> 5 2 }
- { 6 2ND ! -> }
- { 1ST @ 2ND @ -> 5 6 }
- { 1ST 2@ -> 6 5 }
- { 2 1 1ST 2! -> }
- { 1ST 2@ -> 2 1 }
- HERE 1 C,
- HERE 2 C,
- CONSTANT 2NDC
- CONSTANT 1STC
- { 1STC 2NDC < -> <TRUE> } \ HERE MUST GROW WITH ALLOT
- { 1STC 1+ -> 2NDC } \ ... BY ONE CHAR
- { 1STC 1 + -> 2NDC }
- { 1STC C@ 2NDC C@ -> 1 2 }
- { 3 1STC C! -> }
- { 1STC C@ 2NDC C@ -> 3 2 }
- { 4 2NDC C! -> }
- { 1STC C@ 2NDC C@ -> 3 4 }
- HERE 1 ALLOT ALIGN 123 , CONSTANT X
- { X 1+ ALIGNED @ -> 123 }
- ( MISSING TEST: CHARS AT ALIGNED ADDRESS )
- { 1 CELLS 1 MOD -> 0 } \ SIZE OF CELL MULTIPLE OF SIZE OF CHAR
- { 0 1ST ! -> }
- { 1 1ST +! -> }
- { 1ST @ -> 1 }
- { -1 1ST +! 1ST @ -> 0 }
- \ ------------------------------------------------------------------------
- TESTING [ ] BL & "
- { BL -> 20 }
- { &X -> 58 }
- { &H -> 48 }
- { : GC1 &X ; -> }
- { : GC2 &H ; -> }
- { GC1 -> 58 }
- { GC2 -> 48 }
- { : GC3 [ GC1 ] LITERAL ; -> }
- { GC3 -> 58 }
- { : GC4 "XY" ; -> }
- { GC4 SWAP DROP -> 2 }
- { GC4 DROP DUP C@ SWAP 1+ C@ -> 58 59 }
- \ ------------------------------------------------------------------------
- TESTING FIND EXECUTE IMMEDIATE COUNT LITERAL POSTPONE STATE '
- { : GT1 123 ; -> }
- { 'GT1 EXECUTE -> 123 }
- { : GT2 'GT1 ; IMMEDIATE -> }
- { GT2 EXECUTE -> 123 }
- : GT1STRING "GT1" ;
- : GT2STRING "GT2" ;
- { GT1STRING FOUND -> 'GT1 }
- { GT2STRING FOUND -> 'GT2 }
- ( HOW TO SEARCH FOR NON-EXISTENT WORD? ) \ Solved AH see next lines
- CREATE GT2A -1 C,
- : GT2ASTRING GT2A 1 ;
- { GT2ASTRING FOUND >NFA @ @ -> 0 }
- { : GT3 GT2 LITERAL ; -> }
- { GT3 -> 'GT1 }
- { GT1STRING DROP DUP COUNT >R SWAP - R> -> 1 &G }
- { : GT4 POSTPONE GT1 ; IMMEDIATE -> }
- { : GT5 GT4 ; -> }
- { GT5 -> 123 }
- { : GT6 345 ; IMMEDIATE -> }
- { : GT7 POSTPONE GT6 ; -> }
- { GT7 -> 345 }
- { : GT8 STATE @ ; IMMEDIATE -> }
- { GT8 -> 0 }
- { : GT9 GT8 LITERAL ; -> }
- { GT9 0= -> <FALSE> }
- \ ------------------------------------------------------------------------
- TESTING IF ELSE THEN BEGIN WHILE REPEAT UNTIL
- { : GI1 IF 123 THEN ; -> }
- { : GI2 IF 123 ELSE 234 THEN ; -> }
- { 0 GI1 -> }
- { 1 GI1 -> 123 }
- { -1 GI1 -> 123 }
- { 0 GI2 -> 234 }
- { 1 GI2 -> 123 }
- { -1 GI1 -> 123 }
- { : GI3 BEGIN DUP 5 < WHILE DUP 1+ REPEAT ; -> }
- { 0 GI3 -> 0 1 2 3 4 5 }
- { 4 GI3 -> 4 5 }
- { 5 GI3 -> 5 }
- { 6 GI3 -> 6 }
- { : GI4 BEGIN DUP 1+ DUP 5 > UNTIL ; -> }
- { 3 GI4 -> 3 4 5 6 }
- { 5 GI4 -> 5 6 }
- { 6 GI4 -> 6 7 }
- { : GI5 BEGIN DUP 2 > WHILE DUP 5 < WHILE DUP 1+ REPEAT 123 ELSE 345 THEN ; -> }
- { 1 GI5 -> 1 345 }
- { 2 GI5 -> 2 345 }
- { 3 GI5 -> 3 4 5 123 }
- { 4 GI5 -> 4 5 123 }
- { 5 GI5 -> 5 123 }
- \ ------------------------------------------------------------------------
- TESTING DO LOOP +LOOP I J UNLOOP LEAVE EXIT
- : UNLOOP 'RDROP , 'RDROP , 'RDROP , ; IMMEDIATE
- { : GD1 DO I LOOP ; -> }
- { 4 1 GD1 -> 1 2 3 }
- { 2 -1 GD1 -> -1 0 1 }
- { MID-UINT+1 MID-UINT GD1 -> MID-UINT }
- { : GD2 DO I -1 +LOOP ; -> }
- { 1 4 GD2 -> 4 3 2 1 }
- { -1 2 GD2 -> 2 1 0 -1 }
- { MID-UINT MID-UINT+1 GD2 -> MID-UINT+1 MID-UINT }
- { : GD3 DO 1 0 DO J LOOP LOOP ; -> }
- { 4 1 GD3 -> 1 2 3 }
- { 2 -1 GD3 -> -1 0 1 }
- { MID-UINT+1 MID-UINT GD3 -> MID-UINT }
- { : GD4 DO 1 0 DO J LOOP -1 +LOOP ; -> }
- { 1 4 GD4 -> 4 3 2 1 }
- { -1 2 GD4 -> 2 1 0 -1 }
- { MID-UINT MID-UINT+1 GD4 -> MID-UINT+1 MID-UINT }
- { : GD5 123 SWAP 0 DO I 4 > IF DROP 234 LEAVE THEN LOOP ; -> }
- { 1 GD5 -> 123 }
- { 5 GD5 -> 123 }
- { 6 GD5 -> 234 }
- { : GD6 ( PAT: {0 0},{0 0}{1 0}{1 1},{0 0}{1 0}{1 1}{2 0}{2 1}{2 2} )
- 0 SWAP 0 DO
- I 1+ 0 DO I J + 3 = IF I UNLOOP I UNLOOP EXIT THEN 1+ LOOP
- LOOP ; -> }
- { 1 GD6 -> 1 }
- { 2 GD6 -> 3 }
- { 3 GD6 -> 4 1 2 }
- \ ------------------------------------------------------------------------
- TESTING DEFINING WORDS: : ; CONSTANT VARIABLE CREATE DOES> >BODY
- { 123 CONSTANT X123 -> }
- { X123 -> 123 }
- { : EQU CONSTANT ; -> }
- { X123 EQU Y123 -> }
- { Y123 -> 123 }
- { VARIABLE V1 -> }
- { 123 V1 ! -> }
- { V1 @ -> 123 }
- { : NOP : POSTPONE ; ; -> }
- { NOP NOP1 NOP NOP2 -> }
- { NOP1 -> }
- { NOP2 -> }
- { : DOES1 DOES> @ 1 + ; -> }
- { : DOES2 DOES> @ 2 + ; -> }
- { CREATE CR1 -> }
- { CR1 -> HERE }
- { 'CR1 >BODY -> HERE }
- { 1 , -> }
- { CR1 @ -> 1 }
- { DOES1 -> }
- { CR1 -> 2 }
- { DOES2 -> }
- { CR1 -> 3 }
- { : WEIRD: CREATE DOES> 1 + DOES> 2 + ; -> }
- { WEIRD: W1 -> }
- { 'W1 >BODY -> HERE }
- { W1 -> HERE 1 + }
- { W1 -> HERE 2 + }
- \ ------------------------------------------------------------------------
- TESTING EVALUATE
- : GE1 "123" ; IMMEDIATE
- : GE2 "123 1+" ; IMMEDIATE
- : GE3 ": GE4 345 ;" ;
- : GE5 EVALUATE ; IMMEDIATE
- { GE1 EVALUATE -> 123 } ( TEST EVALUATE IN INTERP. STATE )
- { GE2 EVALUATE -> 124 }
- { GE3 EVALUATE -> }
- { GE4 -> 345 }
- { : GE6 GE1 GE5 ; -> } ( TEST EVALUATE IN COMPILE STATE )
- { GE6 -> 123 }
- { : GE7 GE2 GE5 ; -> }
- { GE7 -> 124 }
- \ ------------------------------------------------------------------------
- TESTING SRC PP NAME
- \ The phrase results is equivalent to ISO `` SOURCE ''
- : GS1 "SRC 2@ SWAP OVER - " 2DUP EVALUATE
- >R SWAP >R = R> R> = ;
- { GS1 -> <TRUE> <TRUE> }
- VARIABLE SCANS
- : RESCAN? -1 SCANS +! SCANS @ IF SRC @ PP ! THEN ;
- { 2 SCANS !
- 345 RESCAN?
- -> 345 345 }
- : GS2 5 SCANS ! "123 RESCAN?" EVALUATE ;
- { GS2 -> 123 123 123 123 123 }
- : GS3 NAME SWAP C@ ;
- { GS3 HELLO -> 5 &H }
- : GS4 SRC CELL+ @ PP ! ;
- { GS4 123 456
- -> }
- \ ------------------------------------------------------------------------
- TESTING <% % %S %> HOLD SIGN BASE >NUMBER HEX DECIMAL
- : S= \ ( ADDR1 C1 ADDR2 C2 -- T/F ) COMPARE TWO STRINGS.
- SDSWAP OVER <> IF \ COMPARE LENGTHS
- DROP 2DROP <FALSE> \ LENGTHS MISMATCH
- ELSE
- CORA 0= \ IF NON-EMPTY STRINGS
- THEN ;
- : GP1 <% 41 HOLD 42 HOLD 0 %> "BA" S= ;
- { GP1 -> <TRUE> }
- : GP2 <% -1 SIGN 0 SIGN -1 SIGN 0 %> "--" S= ;
- { GP2 -> <TRUE> }
- : GP3 <% 1 % % %> "01" S= ;
- { GP3 -> <TRUE> }
- : GP4 <% 1 %S %> "1" S= ;
- { GP4 -> <TRUE> }
- 24 CONSTANT MAX-BASE \ BASE 2 .. 36
- : COUNT-BITS
- 0 0 INVERT BEGIN DUP WHILE >R 1+ R> 1 LSHIFT REPEAT DROP ;
- COUNT-BITS CONSTANT #BITS-U \ NUMBER OF BITS IN UD
- : GP5
- BASE @ <TRUE>
- MAX-BASE 1+ 2 DO \ FOR EACH POSSIBLE BASE
- I BASE ! \ TBD: ASSUMES BASE WORKS
- I <% %S %> "10" S= AND
- LOOP
- SWAP BASE ! ;
- { GP5 -> <TRUE> }
- : GP6
- BASE @ >R 2 BASE !
- MAX-UINT <% %S %> \ MAXIMUM UD TO BINARY
- R> BASE ! \ S: C-ADDR U
- DUP #BITS-U = SWAP
- 0 DO \ S: C-ADDR FLAG
- OVER C@ &1 = AND \ ALL ONES
- >R 1+ R>
- LOOP SWAP DROP ;
- { GP6 -> <TRUE> }
- : GP7
- BASE @ >R MAX-BASE BASE !
- <TRUE>
- A 0 DO
- I <% %S %>
- 1 = SWAP C@ I 30 + = AND AND
- LOOP
- MAX-BASE A DO
- I <% %S %>
- 1 = SWAP C@ 41 I A - + = AND AND
- LOOP
- R> BASE ! ;
- { GP7 -> <TRUE> }
- \ >NUMBER TESTS
- CREATE GN-BUF _ , _ C,
- : GN-STRING GN-BUF $@ ;
- : GN-CONSUMED GN-BUF $@ DROP 1+ 0 ;
- : GN' PP@@ 2DROP &' PARSE GN-BUF $! GN-STRING ;
- \ : >NUMBER SAVE SET-SRC 'NUMBER CATCH RESTORE THROW 0 D+ ;
- { 0 0 GN' 0' >NUMBER -> 0 0 GN-CONSUMED }
- { 0 0 GN' 1' >NUMBER -> 1 0 GN-CONSUMED }
- { 1 0 GN' 1' >NUMBER -> BASE @ 1+ 0 GN-CONSUMED }
- { 0 0 GN' -' >NUMBER -> 0 0 GN-STRING } \ SHOULD FAIL TO CONVERT THESE
- { 0 0 GN' +' >NUMBER -> 0 0 GN-STRING }
- \ { 0 0 GN' .' >NUMBER -> 0 0 GN-STRING }
- : >NUMBER-BASED
- BASE @ >R BASE ! >NUMBER R> BASE ! ;
- { 0 0 GN' 2' 10 >NUMBER-BASED -> 2 0 GN-CONSUMED }
- { 0 0 GN' 2' 2 >NUMBER-BASED -> 0 0 GN-STRING }
- { 0 0 GN' F' 10 >NUMBER-BASED -> F 0 GN-CONSUMED }
- { 0 0 GN' G' 10 >NUMBER-BASED -> 0 0 GN-STRING }
- { 0 0 GN' G' MAX-BASE >NUMBER-BASED -> 10 0 GN-CONSUMED }
- { 0 0 GN' Z' MAX-BASE >NUMBER-BASED -> 23 0 GN-CONSUMED }
- : GN1 \ ( U BASE -- U' LEN ) U SHOULD EQUAL U' AND LEN SHOULD BE ZERO.
- BASE @ >R BASE !
- <% %S %>
- 0 0 2SWAP >NUMBER SWAP DROP SWAP DROP \ REMOVE STRING ADDRESS AND MS CELL
- R> BASE ! ;
- { 0 2 GN1 -> 0 0 }
- { MAX-UINT 2 GN1 -> MAX-UINT 0 }
- \ test removed
- { 0 MAX-BASE GN1 -> 0 0 }
- { MAX-UINT MAX-BASE GN1 -> MAX-UINT 0 }
- \ test removed
- : GN2 \ ( -- 16 10 )
- BASE @ >R HEX BASE @ DECIMAL BASE @ R> BASE ! ;
- { GN2 -> 10 A }
- \ ------------------------------------------------------------------------
- TESTING FILL MOVE
- CREATE FBUF 00 C, 00 C, 00 C,
- CREATE SBUF 12 C, 34 C, 56 C,
- : SEEBUF FBUF C@ FBUF 1+ C@ FBUF 1+ 1+ C@ ;
- { FBUF 0 20 FILL -> }
- { SEEBUF -> 00 00 00 }
- { FBUF 1 20 FILL -> }
- { SEEBUF -> 20 00 00 }
- { FBUF 3 20 FILL -> }
- { SEEBUF -> 20 20 20 }
- { FBUF FBUF 3 MOVE -> } \ BIZARRE SPECIAL CASE
- { SEEBUF -> 20 20 20 }
- { SBUF FBUF 0 MOVE -> }
- { SEEBUF -> 20 20 20 }
- { SBUF FBUF 1 MOVE -> }
- { SEEBUF -> 12 20 20 }
- { SBUF FBUF 3 MOVE -> }
- { SEEBUF -> 12 34 56 }
- { FBUF FBUF 1+ 2 MOVE -> }
- { SEEBUF -> 12 12 34 }
- { FBUF 1+ FBUF 2 MOVE -> }
- { SEEBUF -> 12 34 34 }
- \ ------------------------------------------------------------------------
- TESTING OUTPUT: . " CR EMIT SPACE TYPE
- : OUTPUT-TEST
- "YOU SHOULD SEE 0-9 SEPARATED BY A SPACE:" TYPE CR
- 9 1+ 0 DO I . LOOP CR
- "YOU SHOULD SEE A-G SEPARATED BY A SPACE:" TYPE CR
- &G 1+ &A DO I EMIT SPACE LOOP CR
- "YOU SHOULD SEE TWO SEPARATE LINES:" TYPE CR
- "LINE 1" TYPE CR "LINE 2" TYPE CR
- "YOU SHOULD SEE THE NUMBER RANGES OF SIGNED AND UNSIGNED NUMBERS:" TYPE CR
- " SIGNED: " TYPE MIN-INT . MAX-INT . CR
- "UNSIGNED: " TYPE 0 U. MAX-UINT U. CR
- ;
- { OUTPUT-TEST -> }
- \ ------------------------------------------------------------------------
- TESTING INPUT: ACCEPT
- CREATE ABUF 80 ALLOT
- : ACCEPT-TEST
- CR "PLEASE TYPE UP TO 80 CHARACTERS:" TYPE CR
- ABUF 80 ACCEPT
- CR "RECEIVED: " TYPE &" EMIT
- ABUF SWAP TYPE &" EMIT CR
- ;
- "YOU SHOULD SEE THE FOLLOWING LINE ANOTHER TIME AFTER RECEIVED:" TYPE CR
- "THIS IS AN INPUT LINE FOLLOWING IN THE SOURCE" TYPE CR
- { ACCEPT-TEST -> }
- THIS IS AN INPUT LINE FOLLOWING IN THE SOURCE
- \ ------------------------------------------------------------------------
- TESTING DICTIONARY SEARCH RULES
- { : GDX 123 ; : GDX GDX 234 ; -> }
- { GDX -> 123 234 }
- TESTING FINISHED
- BYE