; ------------------------------------- ; CORETEST.4TH for any FastForth target ; ------------------------------------- MARKER {CORETEST} : ABORT_TEST \ flag -- $0D EMIT \ return to column 1, no 'LF' ABORT" {CORE_ANS} word set not found !" POSTPONE {CORETEST} \ remove all test words ; [UNDEFINED] {CORE_ANS} ABORT_TEST : CORETESTSUCCESS $0D DUP EMIT \ return to column 1, set true flag for ABORT" $0A BASE ! \ set decimal {CORETEST} \ remove all coretest definitionss ABORT" CORETEST + COREPLUSTEST success!" \ true_flag -- ; [UNDEFINED] SM/REM [IF] \ https://forth-standard.org/standard/core/SMDivREM \ SM/REM d1 n1 -- r q symmetric signed div'n CODE SM/REM MOV R14,R12 MOV @R15,R11 CMP #0,R14 S< IF XOR #-1,R14 ADD #1,R14 THEN CMP #0,0(R15) S< IF XOR #-1,2(R15) XOR #-1,0(R15) ADD #1,2(R15) ADDC #0,0(R15) THEN PUSHM #3,R13 LO2HI UM/MOD HI2LO POPM #3,R13 CMP #0,R11 S< IF XOR #-1,0(R15) ADD #1,0(R15) THEN XOR R12,R11 CMP #0,R11 S< IF XOR #-1,R14 ADD #1,R14 THEN MOV @R13+,R0 ENDCODE [THEN] [UNDEFINED] FM/MOD [IF] \ https://forth-standard.org/standard/core/FMDivMOD \ FM/MOD d1 n1 -- r q floored signed div'n : FM/MOD SM/REM HI2LO \ -- remainder quotient S=divisor CMP #0,0(R15) \ remainder <> 0 ? 0<> IF CMP #1,R14 \ quotient < 1 ? S< IF ADD R12,0(R15) \ add divisor to remainder SUB #1,R14 \ decrement quotient THEN THEN MOV @R1+,R13 MOV @R13+,R0 ENDCODE [THEN] \ From: John Hayes S1I \ Subject: tester.fr \ Date: Mon, 27 Nov 95 13:10:09 PST \ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS. \ VERSION 1.1 \ 22/1/09 The words { and } have been changed to T{ and }T respectively to \ agree with the Forth 200X file ttester.fs. This avoids clashes with \ locals using { ... } and the FSL use of } \ 13/05/14 jmt. added colorised error messages. 0 CONSTANT FALSE -1 CONSTANT TRUE \ 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 FALSE VERBOSE ! \ TRUE VERBOSE ! : EMPTY-STACK ( ... -- ) \ EMPTY STACK: HANDLES UNDERFLOWED STACK TOO. DEPTH ?DUP IF DUP 0< IF NEGATE 0 DO 0 LOOP ELSE 0 DO DROP LOOP THEN THEN ; : 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 QUIT \ *** Uncomment this line to QUIT on an error ; VARIABLE ACTUAL-DEPTH \ STACK RECORD CREATE ACTUAL-RESULTS 20 CELLS ALLOT : T{ \ ( -- ) SYNTACTIC SUGAR. ; : -> \ ( ... -- ) 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 THEN ; : }T \ ( ... -- ) 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 \ = 0= IF S" INCORRECT RESULT: " ERROR LEAVE THEN \ jmt = 0= ABORT" INCORRECT RESULT" \ jmt : abort with colorised message LOOP THEN ELSE \ DEPTH MISMATCH \ S" WRONG NUMBER OF RESULTS: " ERROR \ jmt TRUE ABORT" WRONG NUMBER OF RESULTS" \ jmt : abort with colorised message THEN ; : TESTING \ ( -- ) TALKING COMMENT. SOURCE VERBOSE @ IF DUP >R TYPE CR R> >IN ! ELSE >IN ! DROP [CHAR] * EMIT THEN ; HEX \ From: John Hayes S1I \ Subject: core.fr \ Date: Mon, 27 Nov 95 13:10 \ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS. \ VERSION 1.2 \ 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 NUMBERS 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 BASIC ASSUMPTIONS T{ -> }T \ START WITH CLEAN SLATE ( TEST IF ANY BITS ARE SET; ANSWER IN BASE 1 ) T{ : BITSSET? IF 0 0 ELSE 0 THEN ; -> }T T{ 0 BITSSET? -> 0 }T ( ZERO IS ALL BITS CLEAR ) T{ 1 BITSSET? -> 0 0 }T ( OTHER NUMBER HAVE AT LEAST ONE BIT ) T{ -1 BITSSET? -> 0 0 }T \ ------------------------------------------------------------------------ TESTING BOOLEANS: INVERT AND OR XOR T{ 0 0 AND -> 0 }T T{ 0 1 AND -> 0 }T T{ 1 0 AND -> 0 }T T{ 1 1 AND -> 1 }T T{ 0 INVERT 1 AND -> 1 }T T{ 1 INVERT 1 AND -> 0 }T 0 CONSTANT 0S 0 INVERT CONSTANT 1S T{ 0S INVERT -> 1S }T T{ 1S INVERT -> 0S }T T{ 0S 0S AND -> 0S }T T{ 0S 1S AND -> 0S }T T{ 1S 0S AND -> 0S }T T{ 1S 1S AND -> 1S }T T{ 0S 0S OR -> 0S }T T{ 0S 1S OR -> 1S }T T{ 1S 0S OR -> 1S }T T{ 1S 1S OR -> 1S }T T{ 0S 0S XOR -> 0S }T T{ 0S 1S XOR -> 1S }T T{ 1S 0S XOR -> 1S }T T{ 1S 1S XOR -> 0S }T \ ------------------------------------------------------------------------ TESTING 2* 2/ LSHIFT RSHIFT ( WE TRUST 1S, INVERT, AND BITSSET?; WE WILL CONFIRM RSHIFT LATER ) 1S 1 RSHIFT INVERT CONSTANT MSB T{ MSB BITSSET? -> 0 0 }T T{ 0S 2* -> 0S }T T{ 1 2* -> 2 }T T{ 4000 2* -> 8000 }T T{ 1S 2* 1 XOR -> 1S }T T{ MSB 2* -> 0S }T T{ 0S 2/ -> 0S }T T{ 1 2/ -> 0 }T T{ 4000 2/ -> 2000 }T T{ 1S 2/ -> 1S }T \ MSB PROPOGATED T{ 1S 1 XOR 2/ -> 1S }T T{ MSB 2/ MSB AND -> MSB }T T{ 1 0 LSHIFT -> 1 }T T{ 1 1 LSHIFT -> 2 }T T{ 1 2 LSHIFT -> 4 }T T{ 1 F LSHIFT -> 8000 }T \ BIGGEST GUARANTEED SHIFT T{ 1S 1 LSHIFT 1 XOR -> 1S }T T{ MSB 1 LSHIFT -> 0 }T T{ 1 0 RSHIFT -> 1 }T T{ 1 1 RSHIFT -> 0 }T T{ 2 1 RSHIFT -> 1 }T T{ 4 2 RSHIFT -> 1 }T T{ 8000 F RSHIFT -> 1 }T \ BIGGEST T{ MSB 1 RSHIFT MSB AND -> 0 }T \ RSHIFT ZERO FILLS MSBS T{ MSB 1 RSHIFT 2* -> MSB }T \ ------------------------------------------------------------------------ TESTING COMPARISONS: 0= = 0< < > U< 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 1S CONSTANT T{ 0 0= -> }T T{ 1 0= -> }T T{ 2 0= -> }T T{ -1 0= -> }T T{ MAX-UINT 0= -> }T T{ MIN-INT 0= -> }T T{ MAX-INT 0= -> }T T{ 0 0 = -> }T T{ 1 1 = -> }T T{ -1 -1 = -> }T T{ 1 0 = -> }T T{ -1 0 = -> }T T{ 0 1 = -> }T T{ 0 -1 = -> }T T{ 0 0< -> }T T{ -1 0< -> }T T{ MIN-INT 0< -> }T T{ 1 0< -> }T T{ MAX-INT 0< -> }T T{ 0 1 < -> }T T{ 1 2 < -> }T T{ -1 0 < -> }T T{ -1 1 < -> }T T{ MIN-INT 0 < -> }T T{ MIN-INT MAX-INT < -> }T T{ 0 MAX-INT < -> }T T{ 0 0 < -> }T T{ 1 1 < -> }T T{ 1 0 < -> }T T{ 2 1 < -> }T T{ 0 -1 < -> }T T{ 1 -1 < -> }T T{ 0 MIN-INT < -> }T T{ MAX-INT MIN-INT < -> }T T{ MAX-INT 0 < -> }T T{ 0 1 > -> }T T{ 1 2 > -> }T T{ -1 0 > -> }T T{ -1 1 > -> }T T{ MIN-INT 0 > -> }T T{ MIN-INT MAX-INT > -> }T T{ 0 MAX-INT > -> }T T{ 0 0 > -> }T T{ 1 1 > -> }T T{ 1 0 > -> }T T{ 2 1 > -> }T T{ 0 -1 > -> }T T{ 1 -1 > -> }T T{ 0 MIN-INT > -> }T T{ MAX-INT MIN-INT > -> }T T{ MAX-INT 0 > -> }T T{ 0 1 U< -> }T T{ 1 2 U< -> }T T{ 0 MID-UINT U< -> }T T{ 0 MAX-UINT U< -> }T T{ MID-UINT MAX-UINT U< -> }T T{ 0 0 U< -> }T T{ 1 1 U< -> }T T{ 1 0 U< -> }T T{ 2 1 U< -> }T T{ MID-UINT 0 U< -> }T T{ MAX-UINT 0 U< -> }T T{ MAX-UINT MID-UINT U< -> }T T{ 0 1 MIN -> 0 }T T{ 1 2 MIN -> 1 }T T{ -1 0 MIN -> -1 }T T{ -1 1 MIN -> -1 }T T{ MIN-INT 0 MIN -> MIN-INT }T T{ MIN-INT MAX-INT MIN -> MIN-INT }T T{ 0 MAX-INT MIN -> 0 }T T{ 0 0 MIN -> 0 }T T{ 1 1 MIN -> 1 }T T{ 1 0 MIN -> 0 }T T{ 2 1 MIN -> 1 }T T{ 0 -1 MIN -> -1 }T T{ 1 -1 MIN -> -1 }T T{ 0 MIN-INT MIN -> MIN-INT }T T{ MAX-INT MIN-INT MIN -> MIN-INT }T T{ MAX-INT 0 MIN -> 0 }T T{ 0 1 MAX -> 1 }T T{ 1 2 MAX -> 2 }T T{ -1 0 MAX -> 0 }T T{ -1 1 MAX -> 1 }T T{ MIN-INT 0 MAX -> 0 }T T{ MIN-INT MAX-INT MAX -> MAX-INT }T T{ 0 MAX-INT MAX -> MAX-INT }T T{ 0 0 MAX -> 0 }T T{ 1 1 MAX -> 1 }T T{ 1 0 MAX -> 1 }T T{ 2 1 MAX -> 2 }T T{ 0 -1 MAX -> 0 }T T{ 1 -1 MAX -> 1 }T T{ 0 MIN-INT MAX -> 0 }T T{ MAX-INT MIN-INT MAX -> MAX-INT }T T{ MAX-INT 0 MAX -> MAX-INT }T \ ------------------------------------------------------------------------ TESTING STACK OPS: 2DROP 2DUP 2OVER 2SWAP ?DUP DEPTH DROP DUP OVER ROT SWAP T{ 1 2 2DROP -> }T T{ 1 2 2DUP -> 1 2 1 2 }T T{ 1 2 3 4 2OVER -> 1 2 3 4 1 2 }T T{ 1 2 3 4 2SWAP -> 3 4 1 2 }T T{ 0 ?DUP -> 0 }T T{ 1 ?DUP -> 1 1 }T T{ -1 ?DUP -> -1 -1 }T T{ DEPTH -> 0 }T T{ 0 DEPTH -> 0 1 }T T{ 0 1 DEPTH -> 0 1 2 }T T{ 0 DROP -> }T T{ 1 2 DROP -> 1 }T T{ 1 DUP -> 1 1 }T T{ 1 2 OVER -> 1 2 1 }T T{ 1 2 3 ROT -> 2 3 1 }T T{ 1 2 SWAP -> 2 1 }T \ ------------------------------------------------------------------------ TESTING >R R> R@ T{ : GR1 >R R> ; -> }T T{ : GR2 >R R@ R> DROP ; -> }T T{ 123 GR1 -> 123 }T T{ 123 GR2 -> 123 }T T{ 1S GR1 -> 1S }T ( RETURN STACK HOLDS CELLS ) \ ------------------------------------------------------------------------ TESTING ADD/SUBTRACT: + - 1+ 1- ABS NEGATE T{ 0 5 + -> 5 }T T{ 5 0 + -> 5 }T T{ 0 -5 + -> -5 }T T{ -5 0 + -> -5 }T T{ 1 2 + -> 3 }T T{ 1 -2 + -> -1 }T T{ -1 2 + -> 1 }T T{ -1 -2 + -> -3 }T T{ -1 1 + -> 0 }T T{ MID-UINT 1 + -> MID-UINT+1 }T T{ 0 5 - -> -5 }T T{ 5 0 - -> 5 }T T{ 0 -5 - -> 5 }T T{ -5 0 - -> -5 }T T{ 1 2 - -> -1 }T T{ 1 -2 - -> 3 }T T{ -1 2 - -> -3 }T T{ -1 -2 - -> 1 }T T{ 0 1 - -> -1 }T T{ MID-UINT+1 1 - -> MID-UINT }T T{ 0 1+ -> 1 }T T{ -1 1+ -> 0 }T T{ 1 1+ -> 2 }T T{ MID-UINT 1+ -> MID-UINT+1 }T T{ 2 1- -> 1 }T T{ 1 1- -> 0 }T T{ 0 1- -> -1 }T T{ MID-UINT+1 1- -> MID-UINT }T T{ 0 NEGATE -> 0 }T T{ 1 NEGATE -> -1 }T T{ -1 NEGATE -> 1 }T T{ 2 NEGATE -> -2 }T T{ -2 NEGATE -> 2 }T T{ 0 ABS -> 0 }T T{ 1 ABS -> 1 }T T{ -1 ABS -> 1 }T T{ MIN-INT ABS -> MID-UINT+1 }T \ ------------------------------------------------------------------------ TESTING MULTIPLY: S>D * M* UM* T{ 0 S>D -> 0 0 }T T{ 1 S>D -> 1 0 }T T{ 2 S>D -> 2 0 }T T{ -1 S>D -> -1 -1 }T T{ -2 S>D -> -2 -1 }T T{ MIN-INT S>D -> MIN-INT -1 }T T{ MAX-INT S>D -> MAX-INT 0 }T T{ 0 0 M* -> 0 S>D }T T{ 0 1 M* -> 0 S>D }T T{ 1 0 M* -> 0 S>D }T T{ 1 2 M* -> 2 S>D }T T{ 2 1 M* -> 2 S>D }T T{ 3 3 M* -> 9 S>D }T T{ -3 3 M* -> -9 S>D }T T{ 3 -3 M* -> -9 S>D }T T{ -3 -3 M* -> 9 S>D }T T{ 0 MIN-INT M* -> 0 S>D }T T{ 1 MIN-INT M* -> MIN-INT S>D }T T{ 2 MIN-INT M* -> 0 1S }T T{ 0 MAX-INT M* -> 0 S>D }T T{ 1 MAX-INT M* -> MAX-INT S>D }T T{ 2 MAX-INT M* -> MAX-INT 1 LSHIFT 0 }T T{ MIN-INT MIN-INT M* -> 0 MSB 1 RSHIFT }T T{ MAX-INT MIN-INT M* -> MSB MSB 2/ }T T{ MAX-INT MAX-INT M* -> 1 MSB 2/ INVERT }T T{ 0 0 * -> 0 }T \ TEST IDENTITIES T{ 0 1 * -> 0 }T T{ 1 0 * -> 0 }T T{ 1 2 * -> 2 }T T{ 2 1 * -> 2 }T T{ 3 3 * -> 9 }T T{ -3 3 * -> -9 }T T{ 3 -3 * -> -9 }T T{ -3 -3 * -> 9 }T T{ MID-UINT+1 1 RSHIFT 2 * -> MID-UINT+1 }T T{ MID-UINT+1 2 RSHIFT 4 * -> MID-UINT+1 }T T{ MID-UINT+1 1 RSHIFT MID-UINT+1 OR 2 * -> MID-UINT+1 }T T{ 0 0 UM* -> 0 0 }T T{ 0 1 UM* -> 0 0 }T T{ 1 0 UM* -> 0 0 }T T{ 1 2 UM* -> 2 0 }T T{ 2 1 UM* -> 2 0 }T T{ 3 3 UM* -> 9 0 }T T{ MID-UINT+1 1 RSHIFT 2 UM* -> MID-UINT+1 0 }T T{ MID-UINT+1 2 UM* -> 0 1 }T T{ MID-UINT+1 4 UM* -> 0 2 }T T{ 1S 2 UM* -> 1S 1 LSHIFT 1 }T T{ MAX-UINT MAX-UINT UM* -> 1 1 INVERT }T \ ------------------------------------------------------------------------ TESTING DIVIDE: FM/MOD SM/REM UM/MOD */ */MOD / /MOD MOD T{ 0 S>D 1 FM/MOD -> 0 0 }T T{ 1 S>D 1 FM/MOD -> 0 1 }T T{ 2 S>D 1 FM/MOD -> 0 2 }T T{ -1 S>D 1 FM/MOD -> 0 -1 }T T{ -2 S>D 1 FM/MOD -> 0 -2 }T T{ 0 S>D -1 FM/MOD -> 0 0 }T T{ 1 S>D -1 FM/MOD -> 0 -1 }T T{ 2 S>D -1 FM/MOD -> 0 -2 }T T{ -1 S>D -1 FM/MOD -> 0 1 }T T{ -2 S>D -1 FM/MOD -> 0 2 }T T{ 2 S>D 2 FM/MOD -> 0 1 }T T{ -1 S>D -1 FM/MOD -> 0 1 }T T{ -2 S>D -2 FM/MOD -> 0 1 }T T{ 7 S>D 3 FM/MOD -> 1 2 }T T{ 7 S>D -3 FM/MOD -> -2 -3 }T T{ -7 S>D 3 FM/MOD -> 2 -3 }T T{ -7 S>D -3 FM/MOD -> -1 2 }T T{ MAX-INT S>D 1 FM/MOD -> 0 MAX-INT }T T{ MIN-INT S>D 1 FM/MOD -> 0 MIN-INT }T T{ MAX-INT S>D MAX-INT FM/MOD -> 0 1 }T T{ MIN-INT S>D MIN-INT FM/MOD -> 0 1 }T T{ 1S 1 4 FM/MOD -> 3 MAX-INT }T T{ 1 MIN-INT M* 1 FM/MOD -> 0 MIN-INT }T T{ 1 MIN-INT M* MIN-INT FM/MOD -> 0 1 }T T{ 2 MIN-INT M* 2 FM/MOD -> 0 MIN-INT }T T{ 2 MIN-INT M* MIN-INT FM/MOD -> 0 2 }T T{ 1 MAX-INT M* 1 FM/MOD -> 0 MAX-INT }T T{ 1 MAX-INT M* MAX-INT FM/MOD -> 0 1 }T T{ 2 MAX-INT M* 2 FM/MOD -> 0 MAX-INT }T T{ 2 MAX-INT M* MAX-INT FM/MOD -> 0 2 }T T{ MIN-INT MIN-INT M* MIN-INT FM/MOD -> 0 MIN-INT }T T{ MIN-INT MAX-INT M* MIN-INT FM/MOD -> 0 MAX-INT }T T{ MIN-INT MAX-INT M* MAX-INT FM/MOD -> 0 MIN-INT }T T{ MAX-INT MAX-INT M* MAX-INT FM/MOD -> 0 MAX-INT }T T{ 0 S>D 1 SM/REM -> 0 0 }T T{ 1 S>D 1 SM/REM -> 0 1 }T T{ 2 S>D 1 SM/REM -> 0 2 }T T{ -1 S>D 1 SM/REM -> 0 -1 }T T{ -2 S>D 1 SM/REM -> 0 -2 }T T{ 0 S>D -1 SM/REM -> 0 0 }T T{ 1 S>D -1 SM/REM -> 0 -1 }T T{ 2 S>D -1 SM/REM -> 0 -2 }T T{ -1 S>D -1 SM/REM -> 0 1 }T T{ -2 S>D -1 SM/REM -> 0 2 }T T{ 2 S>D 2 SM/REM -> 0 1 }T T{ -1 S>D -1 SM/REM -> 0 1 }T T{ -2 S>D -2 SM/REM -> 0 1 }T T{ 7 S>D 3 SM/REM -> 1 2 }T T{ 7 S>D -3 SM/REM -> 1 -2 }T T{ -7 S>D 3 SM/REM -> -1 -2 }T T{ -7 S>D -3 SM/REM -> -1 2 }T T{ MAX-INT S>D 1 SM/REM -> 0 MAX-INT }T T{ MIN-INT S>D 1 SM/REM -> 0 MIN-INT }T T{ MAX-INT S>D MAX-INT SM/REM -> 0 1 }T T{ MIN-INT S>D MIN-INT SM/REM -> 0 1 }T T{ 1S 1 4 SM/REM -> 3 MAX-INT }T T{ 2 MIN-INT M* 2 SM/REM -> 0 MIN-INT }T T{ 2 MIN-INT M* MIN-INT SM/REM -> 0 2 }T T{ 2 MAX-INT M* 2 SM/REM -> 0 MAX-INT }T T{ 2 MAX-INT M* MAX-INT SM/REM -> 0 2 }T T{ MIN-INT MIN-INT M* MIN-INT SM/REM -> 0 MIN-INT }T T{ MIN-INT MAX-INT M* MIN-INT SM/REM -> 0 MAX-INT }T T{ MIN-INT MAX-INT M* MAX-INT SM/REM -> 0 MIN-INT }T T{ MAX-INT MAX-INT M* MAX-INT SM/REM -> 0 MAX-INT }T T{ 0 0 1 UM/MOD -> 0 0 }T T{ 1 0 1 UM/MOD -> 0 1 }T T{ 1 0 2 UM/MOD -> 1 0 }T T{ 3 0 2 UM/MOD -> 1 1 }T T{ MAX-UINT 2 UM* 2 UM/MOD -> 0 MAX-UINT }T T{ MAX-UINT 2 UM* MAX-UINT UM/MOD -> 0 2 }T T{ MAX-UINT MAX-UINT UM* MAX-UINT UM/MOD -> 0 MAX-UINT }T : IFFLOORED [ -3 2 / -2 = INVERT ] LITERAL IF POSTPONE \ THEN ; : IFSYM [ -3 2 / -1 = INVERT ] LITERAL IF POSTPONE \ THEN ; \ THE SYSTEM MIGHT DO EITHER FLOORED OR SYMMETRIC DIVISION. \ SINCE WE HAVE ALREADY TESTED M*, FM/MOD, AND SM/REM WE CAN USE THEM IN TEST. IFFLOORED : T/MOD >R S>D R> FM/MOD ; IFFLOORED : T/ T/MOD SWAP DROP ; IFFLOORED : TMOD T/MOD DROP ; IFFLOORED : T*/MOD >R M* R> FM/MOD ; IFFLOORED : T*/ T*/MOD SWAP DROP ; 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 ; T{ 0 1 /MOD -> 0 1 T/MOD }T T{ 1 1 /MOD -> 1 1 T/MOD }T T{ 2 1 /MOD -> 2 1 T/MOD }T T{ -1 1 /MOD -> -1 1 T/MOD }T T{ -2 1 /MOD -> -2 1 T/MOD }T T{ 0 -1 /MOD -> 0 -1 T/MOD }T T{ 1 -1 /MOD -> 1 -1 T/MOD }T T{ 2 -1 /MOD -> 2 -1 T/MOD }T T{ -1 -1 /MOD -> -1 -1 T/MOD }T T{ -2 -1 /MOD -> -2 -1 T/MOD }T T{ 2 2 /MOD -> 2 2 T/MOD }T T{ -1 -1 /MOD -> -1 -1 T/MOD }T T{ -2 -2 /MOD -> -2 -2 T/MOD }T T{ 7 3 /MOD -> 7 3 T/MOD }T T{ 7 -3 /MOD -> 7 -3 T/MOD }T T{ -7 3 /MOD -> -7 3 T/MOD }T T{ -7 -3 /MOD -> -7 -3 T/MOD }T T{ MAX-INT 1 /MOD -> MAX-INT 1 T/MOD }T T{ MIN-INT 1 /MOD -> MIN-INT 1 T/MOD }T T{ MAX-INT MAX-INT /MOD -> MAX-INT MAX-INT T/MOD }T T{ MIN-INT MIN-INT /MOD -> MIN-INT MIN-INT T/MOD }T T{ 0 1 / -> 0 1 T/ }T T{ 1 1 / -> 1 1 T/ }T T{ 2 1 / -> 2 1 T/ }T T{ -1 1 / -> -1 1 T/ }T T{ -2 1 / -> -2 1 T/ }T T{ 0 -1 / -> 0 -1 T/ }T T{ 1 -1 / -> 1 -1 T/ }T T{ 2 -1 / -> 2 -1 T/ }T T{ -1 -1 / -> -1 -1 T/ }T T{ -2 -1 / -> -2 -1 T/ }T T{ 2 2 / -> 2 2 T/ }T T{ -1 -1 / -> -1 -1 T/ }T T{ -2 -2 / -> -2 -2 T/ }T T{ 7 3 / -> 7 3 T/ }T T{ 7 -3 / -> 7 -3 T/ }T T{ -7 3 / -> -7 3 T/ }T T{ -7 -3 / -> -7 -3 T/ }T T{ MAX-INT 1 / -> MAX-INT 1 T/ }T T{ MIN-INT 1 / -> MIN-INT 1 T/ }T T{ MAX-INT MAX-INT / -> MAX-INT MAX-INT T/ }T T{ MIN-INT MIN-INT / -> MIN-INT MIN-INT T/ }T T{ 0 1 MOD -> 0 1 TMOD }T T{ 1 1 MOD -> 1 1 TMOD }T T{ 2 1 MOD -> 2 1 TMOD }T T{ -1 1 MOD -> -1 1 TMOD }T T{ -2 1 MOD -> -2 1 TMOD }T T{ 0 -1 MOD -> 0 -1 TMOD }T T{ 1 -1 MOD -> 1 -1 TMOD }T T{ 2 -1 MOD -> 2 -1 TMOD }T T{ -1 -1 MOD -> -1 -1 TMOD }T T{ -2 -1 MOD -> -2 -1 TMOD }T T{ 2 2 MOD -> 2 2 TMOD }T T{ -1 -1 MOD -> -1 -1 TMOD }T T{ -2 -2 MOD -> -2 -2 TMOD }T T{ 7 3 MOD -> 7 3 TMOD }T T{ 7 -3 MOD -> 7 -3 TMOD }T T{ -7 3 MOD -> -7 3 TMOD }T T{ -7 -3 MOD -> -7 -3 TMOD }T T{ MAX-INT 1 MOD -> MAX-INT 1 TMOD }T T{ MIN-INT 1 MOD -> MIN-INT 1 TMOD }T T{ MAX-INT MAX-INT MOD -> MAX-INT MAX-INT TMOD }T T{ MIN-INT MIN-INT MOD -> MIN-INT MIN-INT TMOD }T T{ 0 2 1 */ -> 0 2 1 T*/ }T T{ 1 2 1 */ -> 1 2 1 T*/ }T T{ 2 2 1 */ -> 2 2 1 T*/ }T T{ -1 2 1 */ -> -1 2 1 T*/ }T T{ -2 2 1 */ -> -2 2 1 T*/ }T T{ 0 2 -1 */ -> 0 2 -1 T*/ }T T{ 1 2 -1 */ -> 1 2 -1 T*/ }T T{ 2 2 -1 */ -> 2 2 -1 T*/ }T T{ -1 2 -1 */ -> -1 2 -1 T*/ }T T{ -2 2 -1 */ -> -2 2 -1 T*/ }T T{ 2 2 2 */ -> 2 2 2 T*/ }T T{ -1 2 -1 */ -> -1 2 -1 T*/ }T T{ -2 2 -2 */ -> -2 2 -2 T*/ }T T{ 7 2 3 */ -> 7 2 3 T*/ }T T{ 7 2 -3 */ -> 7 2 -3 T*/ }T T{ -7 2 3 */ -> -7 2 3 T*/ }T T{ -7 2 -3 */ -> -7 2 -3 T*/ }T T{ MAX-INT 2 MAX-INT */ -> MAX-INT 2 MAX-INT T*/ }T T{ MIN-INT 2 MIN-INT */ -> MIN-INT 2 MIN-INT T*/ }T T{ 0 2 1 */MOD -> 0 2 1 T*/MOD }T T{ 1 2 1 */MOD -> 1 2 1 T*/MOD }T T{ 2 2 1 */MOD -> 2 2 1 T*/MOD }T T{ -1 2 1 */MOD -> -1 2 1 T*/MOD }T T{ -2 2 1 */MOD -> -2 2 1 T*/MOD }T T{ 0 2 -1 */MOD -> 0 2 -1 T*/MOD }T T{ 1 2 -1 */MOD -> 1 2 -1 T*/MOD }T T{ 2 2 -1 */MOD -> 2 2 -1 T*/MOD }T T{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }T T{ -2 2 -1 */MOD -> -2 2 -1 T*/MOD }T T{ 2 2 2 */MOD -> 2 2 2 T*/MOD }T T{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }T T{ -2 2 -2 */MOD -> -2 2 -2 T*/MOD }T T{ 7 2 3 */MOD -> 7 2 3 T*/MOD }T T{ 7 2 -3 */MOD -> 7 2 -3 T*/MOD }T T{ -7 2 3 */MOD -> -7 2 3 T*/MOD }T T{ -7 2 -3 */MOD -> -7 2 -3 T*/MOD }T T{ MAX-INT 2 MAX-INT */MOD -> MAX-INT 2 MAX-INT T*/MOD }T T{ MIN-INT 2 MIN-INT */MOD -> MIN-INT 2 MIN-INT T*/MOD }T \ ------------------------------------------------------------------------ TESTING HERE , @ ! CELL+ CELLS C, C@ C! CHARS 2@ 2! ALIGN ALIGNED +! ALLOT HERE 1 ALLOT HERE CONSTANT 2NDA CONSTANT 1STA T{ 1STA 2NDA U< -> }T \ HERE MUST GROW WITH ALLOT T{ 1STA 1+ -> 2NDA }T \ ... BY ONE ADDRESS UNIT ( MISSING TEST: NEGATIVE ALLOT ) \ Added by GWJ so that ALIGN can be used before , (comma) is tested 1 ALIGNED CONSTANT ALMNT \ -- 1|2|4|8 for 8|16|32|64 bit alignment ALIGN T{ HERE 1 ALLOT ALIGN HERE SWAP - ALMNT = -> }T \ End of extra test HERE 1 , HERE 2 , CONSTANT 2ND CONSTANT 1ST T{ 1ST 2ND U< -> }T \ HERE MUST GROW WITH ALLOT T{ 1ST CELL+ -> 2ND }T \ ... BY ONE CELL T{ 1ST 1 CELLS + -> 2ND }T T{ 1ST @ 2ND @ -> 1 2 }T T{ 5 1ST ! -> }T T{ 1ST @ 2ND @ -> 5 2 }T T{ 6 2ND ! -> }T T{ 1ST @ 2ND @ -> 5 6 }T T{ 1ST 2@ -> 6 5 }T T{ 2 1 1ST 2! -> }T T{ 1ST 2@ -> 2 1 }T T{ 1S 1ST ! 1ST @ -> 1S }T \ CAN STORE CELL-WIDE VALUE HERE 1 C, HERE 2 C, CONSTANT 2NDC CONSTANT 1STC T{ 1STC 2NDC U< -> }T \ HERE MUST GROW WITH ALLOT T{ 1STC CHAR+ -> 2NDC }T \ ... BY ONE CHAR T{ 1STC 1 CHARS + -> 2NDC }T T{ 1STC C@ 2NDC C@ -> 1 2 }T T{ 3 1STC C! -> }T T{ 1STC C@ 2NDC C@ -> 3 2 }T T{ 4 2NDC C! -> }T T{ 1STC C@ 2NDC C@ -> 3 4 }T ALIGN 1 ALLOT HERE ALIGN HERE 3 CELLS ALLOT CONSTANT A-ADDR CONSTANT UA-ADDR T{ UA-ADDR ALIGNED -> A-ADDR }T T{ 1 A-ADDR C! A-ADDR C@ -> 1 }T T{ 1234 A-ADDR ! A-ADDR @ -> 1234 }T T{ 123 456 A-ADDR 2! A-ADDR 2@ -> 123 456 }T T{ 2 A-ADDR CHAR+ C! A-ADDR CHAR+ C@ -> 2 }T T{ 3 A-ADDR CELL+ C! A-ADDR CELL+ C@ -> 3 }T T{ 1234 A-ADDR CELL+ ! A-ADDR CELL+ @ -> 1234 }T T{ 123 456 A-ADDR CELL+ 2! A-ADDR CELL+ 2@ -> 123 456 }T : BITS ( X -- U ) 0 SWAP BEGIN DUP WHILE DUP MSB AND IF >R 1+ R> THEN 2* REPEAT DROP ; ( CHARACTERS >= 1 AU, <= SIZE OF CELL, >= 8 BITS ) T{ 1 CHARS 1 < -> }T T{ 1 CHARS 1 CELLS > -> }T ( TBD: HOW TO FIND NUMBER OF BITS? ) ( CELLS >= 1 AU, INTEGRAL MULTIPLE OF CHAR SIZE, >= 16 BITS ) T{ 1 CELLS 1 < -> }T T{ 1 CELLS 1 CHARS MOD -> 0 }T T{ 1S BITS 10 < -> }T T{ 0 1ST ! -> }T T{ 1 1ST +! -> }T T{ 1ST @ -> 1 }T T{ -1 1ST +! 1ST @ -> 0 }T \ ------------------------------------------------------------------------ TESTING CHAR [CHAR] [ ] BL S" T{ BL -> 20 }T T{ CHAR X -> 58 }T T{ CHAR HELLO -> 48 }T T{ : GC1 [CHAR] X ; -> }T T{ : GC2 [CHAR] HELLO ; -> }T T{ GC1 -> 58 }T T{ GC2 -> 48 }T T{ : GC3 [ GC1 ] LITERAL ; -> }T T{ GC3 -> 58 }T T{ : GC4 S" XY" ; -> }T T{ GC4 SWAP DROP -> 2 }T T{ GC4 DROP DUP C@ SWAP CHAR+ C@ -> 58 59 }T \ ------------------------------------------------------------------------ TESTING ' ['] FIND EXECUTE IMMEDIATE COUNT LITERAL POSTPONE STATE T{ : GT1 123 ; -> }T T{ ' GT1 EXECUTE -> 123 }T T{ : GT2 ['] GT1 ; IMMEDIATE -> }T T{ GT2 EXECUTE -> 123 }T HERE 3 C, CHAR G C, CHAR T C, CHAR 1 C, CONSTANT GT1STRING HERE 3 C, CHAR G C, CHAR T C, CHAR 2 C, CONSTANT GT2STRING T{ GT1STRING FIND -> ' GT1 -1 }T T{ GT2STRING FIND -> ' GT2 1 }T ( HOW TO SEARCH FOR NON-EXISTENT WORD? ) T{ : GT3 GT2 LITERAL ; -> }T T{ GT3 -> ' GT1 }T T{ GT1STRING COUNT -> GT1STRING CHAR+ 3 }T T{ : GT4 POSTPONE GT1 ; IMMEDIATE -> }T T{ : GT5 GT4 ; -> }T T{ GT5 -> 123 }T T{ : GT6 345 ; IMMEDIATE -> }T T{ : GT7 POSTPONE GT6 ; -> }T T{ GT7 -> 345 }T T{ : GT8 STATE @ ; IMMEDIATE -> }T T{ GT8 -> 0 }T T{ : GT9 GT8 LITERAL ; -> }T T{ GT9 0= -> }T \ ------------------------------------------------------------------------ TESTING IF ELSE THEN BEGIN WHILE REPEAT UNTIL RECURSE T{ : GI1 IF 123 THEN ; -> }T T{ : GI2 IF 123 ELSE 234 THEN ; -> }T T{ 0 GI1 -> }T T{ 1 GI1 -> 123 }T T{ -1 GI1 -> 123 }T T{ 0 GI2 -> 234 }T T{ 1 GI2 -> 123 }T T{ -1 GI1 -> 123 }T T{ : GI3 BEGIN DUP 5 < WHILE DUP 1+ REPEAT ; -> }T T{ 0 GI3 -> 0 1 2 3 4 5 }T T{ 4 GI3 -> 4 5 }T T{ 5 GI3 -> 5 }T T{ 6 GI3 -> 6 }T T{ : GI4 BEGIN DUP 1+ DUP 5 > UNTIL ; -> }T T{ 3 GI4 -> 3 4 5 6 }T T{ 5 GI4 -> 5 6 }T T{ 6 GI4 -> 6 7 }T T{ : GI5 BEGIN DUP 2 > WHILE DUP 5 < WHILE DUP 1+ REPEAT 123 ELSE 345 THEN ; -> }T T{ 1 GI5 -> 1 345 }T T{ 2 GI5 -> 2 345 }T T{ 3 GI5 -> 3 4 5 123 }T T{ 4 GI5 -> 4 5 123 }T T{ 5 GI5 -> 5 123 }T T{ : GI6 ( N -- 0,1,..N ) DUP IF DUP >R 1- RECURSE R> THEN ; -> }T T{ 0 GI6 -> 0 }T T{ 1 GI6 -> 0 1 }T T{ 2 GI6 -> 0 1 2 }T T{ 3 GI6 -> 0 1 2 3 }T T{ 4 GI6 -> 0 1 2 3 4 }T \ ---------------------------------------------------------------------------- TESTING DO LOOP +LOOP I J UNLOOP LEAVE EXIT T{ : GD1 DO I LOOP ; -> }T T{ 4 1 GD1 -> 1 2 3 }T T{ 2 -1 GD1 -> -1 0 1 }T T{ MID-UINT+1 MID-UINT GD1 -> MID-UINT }T T{ : GD2 DO I -1 +LOOP ; -> }T T{ 1 4 GD2 -> 4 3 2 1 }T T{ -1 2 GD2 -> 2 1 0 -1 }T T{ MID-UINT MID-UINT+1 GD2 -> MID-UINT+1 MID-UINT }T T{ : GD3 DO 1 0 DO J LOOP LOOP ; -> }T T{ 4 1 GD3 -> 1 2 3 }T T{ 2 -1 GD3 -> -1 0 1 }T T{ MID-UINT+1 MID-UINT GD3 -> MID-UINT }T T{ : GD4 DO 1 0 DO J LOOP -1 +LOOP ; -> }T T{ 1 4 GD4 -> 4 3 2 1 }T T{ -1 2 GD4 -> 2 1 0 -1 }T T{ MID-UINT MID-UINT+1 GD4 -> MID-UINT+1 MID-UINT }T T{ : GD5 123 SWAP 0 DO I 4 > IF DROP 234 LEAVE THEN LOOP ; -> }T T{ 1 GD5 -> 123 }T T{ 5 GD5 -> 123 }T T{ 6 GD5 -> 234 }T T{ : GD6 ( PAT: T{0 0}T,T{0 0}TT{1 0}TT{1 1}T,T{0 0}TT{1 0}TT{1 1}TT{2 0}TT{2 1}TT{2 2}T ) 0 SWAP 0 DO I 1+ 0 DO I J + 3 = IF I UNLOOP I UNLOOP EXIT THEN 1+ LOOP LOOP ; -> }T T{ 1 GD6 -> 1 }T T{ 2 GD6 -> 3 }T T{ 3 GD6 -> 4 1 2 }T \ ------------------------------------------------------------------------ TESTING DEFINING WORDS: : ; CONSTANT VARIABLE CREATE DOES> >BODY T{ 123 CONSTANT X123 -> }T T{ X123 -> 123 }T T{ : EQU CONSTANT ; -> }T T{ X123 EQU Y123 -> }T T{ Y123 -> 123 }T T{ VARIABLE V1 -> }T T{ 123 V1 ! -> }T T{ V1 @ -> 123 }T T{ : NOP : POSTPONE ; ; -> }T T{ NOP NOP1 NOP NOP2 -> }T T{ NOP1 -> }T T{ NOP2 -> }T T{ : DOES1 DOES> @ 1 + ; -> }T T{ : DOES2 DOES> @ 2 + ; -> }T T{ CREATE CR1 -> }T T{ CR1 -> HERE }T T{ ' CR1 >BODY -> HERE }T T{ 1 , -> }T T{ CR1 @ -> 1 }T T{ DOES1 -> }T T{ CR1 -> 2 }T T{ DOES2 -> }T T{ CR1 -> 3 }T T{ : WEIRD: CREATE DOES> 1 + DOES> 2 + ; -> }T T{ WEIRD: W1 -> }T T{ ' W1 >BODY -> HERE }T T{ W1 -> HERE 1 + }T T{ W1 -> HERE 2 + }T \ ------------------------------------------------------------------------ TESTING EVALUATE : GE1 S" 123" ; IMMEDIATE : GE2 S" 123 1+" ; IMMEDIATE : GE3 S" : GE4 345 ;" ; : GE5 EVALUATE ; IMMEDIATE T{ GE1 EVALUATE -> 123 }T ( TEST EVALUATE IN INTERP. STATE ) T{ GE2 EVALUATE -> 124 }T T{ GE3 EVALUATE -> }T T{ GE4 -> 345 }T T{ : GE6 GE1 GE5 ; -> }T ( TEST EVALUATE IN COMPILE STATE ) T{ GE6 -> 123 }T T{ : GE7 GE2 GE5 ; -> }T T{ GE7 -> 124 }T \ ------------------------------------------------------------------------ TESTING SOURCE >IN WORD : GS1 S" SOURCE" 2DUP EVALUATE >R SWAP >R = R> R> = ; T{ GS1 -> }T VARIABLE SCANS : RESCAN? -1 SCANS +! SCANS @ IF 0 >IN ! THEN ; T{ 2 SCANS ! 345 RESCAN? -> 345 345 }T : GS2 5 SCANS ! S" 123 RESCAN?" EVALUATE ; T{ GS2 -> 123 123 123 123 123 }T : GS3 WORD COUNT SWAP C@ ; T{ BL GS3 HELLO -> 5 CHAR H }T T{ CHAR " GS3 GOODBYE" -> 7 CHAR G }T T{ BL GS3 DROP -> 0 }T \ BLANK LINE RETURN ZERO-LENGTH STRING : GS4 SOURCE >IN ! DROP ; T{ GS4 123 456 -> }T \ ------------------------------------------------------------------------ TESTING <# # #S #> HOLD SIGN BASE >NUMBER HEX DECIMAL : S= \ ( ADDR1 C1 ADDR2 C2 -- T/F ) COMPARE TWO STRINGS. >R SWAP R@ = IF \ MAKE SURE STRINGS HAVE SAME LENGTH R> ?DUP IF \ IF NON-EMPTY STRINGS 0 DO OVER C@ OVER C@ - IF 2DROP UNLOOP EXIT THEN SWAP CHAR+ SWAP CHAR+ LOOP THEN 2DROP \ IF WE GET HERE, STRINGS MATCH ELSE R> DROP 2DROP \ LENGTHS MISMATCH THEN ; : GP1 <# 41 HOLD 42 HOLD 0 0 #> S" BA" S= ; T{ GP1 -> }T : GP2 <# -1 SIGN 0 SIGN -1 SIGN 0 0 #> S" --" S= ; T{ GP2 -> }T : GP3 <# 1 0 # # #> S" 01" S= ; T{ GP3 -> }T : GP4 <# 1 0 #S #> S" 1" S= ; T{ GP4 -> }T 24 CONSTANT MAX-BASE \ BASE 2 .. 36 : COUNT-BITS 0 0 INVERT BEGIN DUP WHILE >R 1+ R> 2* REPEAT DROP ; COUNT-BITS 2* CONSTANT #BITS-UD \ NUMBER OF BITS IN UD : GP5 BASE @ MAX-BASE 1+ 2 DO \ FOR EACH POSSIBLE BASE I BASE ! \ TBD: ASSUMES BASE WORKS I 0 <# #S #> S" 10" S= AND LOOP SWAP BASE ! ; T{ GP5 -> }T : GP6 BASE @ >R 2 BASE ! MAX-UINT MAX-UINT <# #S #> \ MAXIMUM UD TO BINARY R> BASE ! \ S: C-ADDR U DUP #BITS-UD = SWAP 0 DO \ S: C-ADDR FLAG OVER C@ [CHAR] 1 = AND \ ALL ONES >R CHAR+ R> LOOP SWAP DROP ; T{ GP6 -> }T : GP7 BASE @ >R MAX-BASE BASE ! A 0 DO I 0 <# #S #> 1 = SWAP C@ I 30 + = AND AND LOOP MAX-BASE A DO I 0 <# #S #> 1 = SWAP C@ 41 I A - + = AND AND LOOP R> BASE ! ; T{ GP7 -> }T \ >NUMBER TESTS CREATE GN-BUF 0 C, : GN-STRING GN-BUF 1 ; : GN-CONSUMED GN-BUF CHAR+ 0 ; : GN' [CHAR] ' WORD CHAR+ C@ GN-BUF C! GN-STRING ; T{ 0 0 GN' 0' >NUMBER -> 0 0 GN-CONSUMED }T T{ 0 0 GN' 1' >NUMBER -> 1 0 GN-CONSUMED }T T{ 1 0 GN' 1' >NUMBER -> BASE @ 1+ 0 GN-CONSUMED }T \ FOLLOWING SHOULD FAIL TO CONVERT T{ 0 0 GN' -' >NUMBER -> 0 0 GN-STRING }T T{ 0 0 GN' +' >NUMBER -> 0 0 GN-STRING }T T{ 0 0 GN' .' >NUMBER -> 0 0 GN-STRING }T : >NUMBER-BASED BASE @ >R BASE ! >NUMBER R> BASE ! ; T{ 0 0 GN' 2' 10 >NUMBER-BASED -> 2 0 GN-CONSUMED }T T{ 0 0 GN' 2' 2 >NUMBER-BASED -> 0 0 GN-STRING }T T{ 0 0 GN' F' 10 >NUMBER-BASED -> F 0 GN-CONSUMED }T T{ 0 0 GN' G' 10 >NUMBER-BASED -> 0 0 GN-STRING }T T{ 0 0 GN' G' MAX-BASE >NUMBER-BASED -> 10 0 GN-CONSUMED }T T{ 0 0 GN' Z' MAX-BASE >NUMBER-BASED -> 23 0 GN-CONSUMED }T : GN1 \ ( UD BASE -- UD' LEN ) \ UD SHOULD EQUAL UD' AND LEN SHOULD BE ZERO. BASE @ >R BASE ! <# #S #> 0 0 2SWAP >NUMBER SWAP DROP \ RETURN LENGTH ONLY R> BASE ! ; T{ 0 0 2 GN1 -> 0 0 0 }T T{ MAX-UINT 0 2 GN1 -> MAX-UINT 0 0 }T T{ MAX-UINT DUP 2 GN1 -> MAX-UINT DUP 0 }T T{ 0 0 MAX-BASE GN1 -> 0 0 0 }T T{ MAX-UINT 0 MAX-BASE GN1 -> MAX-UINT 0 0 }T T{ MAX-UINT DUP MAX-BASE GN1 -> MAX-UINT DUP 0 }T : GN2 \ ( -- 16 10 ) BASE @ >R HEX BASE @ DECIMAL BASE @ R> BASE ! ; T{ GN2 -> 10 A }T \ ------------------------------------------------------------------------ TESTING FILL MOVE CREATE FBUF 00 C, 00 C, 00 C, CREATE SBUF 12 C, 34 C, 56 C, : SEEBUF FBUF C@ FBUF CHAR+ C@ FBUF CHAR+ CHAR+ C@ ; T{ FBUF 0 20 FILL -> }T T{ SEEBUF -> 00 00 00 }T T{ FBUF 1 20 FILL -> }T T{ SEEBUF -> 20 00 00 }T T{ FBUF 3 20 FILL -> }T T{ SEEBUF -> 20 20 20 }T T{ FBUF FBUF 3 CHARS MOVE -> }T \ BIZARRE SPECIAL CASE T{ SEEBUF -> 20 20 20 }T T{ SBUF FBUF 0 CHARS MOVE -> }T T{ SEEBUF -> 20 20 20 }T T{ SBUF FBUF 1 CHARS MOVE -> }T T{ SEEBUF -> 12 20 20 }T T{ SBUF FBUF 3 CHARS MOVE -> }T T{ SEEBUF -> 12 34 56 }T T{ FBUF FBUF CHAR+ 2 CHARS MOVE -> }T T{ SEEBUF -> 12 12 34 }T T{ FBUF CHAR+ FBUF 2 CHARS MOVE -> }T T{ SEEBUF -> 12 34 34 }T \ ------------------------------------------------------------------------ TESTING OUTPUT: . ." CR EMIT SPACE SPACES TYPE U. : OUTPUT-TEST ." YOU SHOULD SEE THE STANDARD GRAPHIC CHARACTERS:" CR 41 BL DO I EMIT LOOP CR 61 41 DO I EMIT LOOP CR 7F 61 DO I EMIT LOOP CR ." YOU SHOULD SEE 0-9 SEPARATED BY A SPACE:" CR 9 1+ 0 DO I . LOOP CR ." YOU SHOULD SEE 0-9 (WITH NO SPACES):" CR [CHAR] 9 1+ [CHAR] 0 DO I 0 SPACES EMIT LOOP CR ." YOU SHOULD SEE A-G SEPARATED BY A SPACE:" CR [CHAR] G 1+ [CHAR] A DO I EMIT SPACE LOOP CR ." YOU SHOULD SEE 0-5 SEPARATED BY TWO SPACES:" CR 5 1+ 0 DO I [CHAR] 0 + EMIT 2 SPACES LOOP CR ." YOU SHOULD SEE TWO SEPARATE LINES:" CR S" LINE 1" TYPE CR S" LINE 2" TYPE CR ." YOU SHOULD SEE THE NUMBER RANGES OF SIGNED AND UNSIGNED NUMBERS:" CR ." SIGNED: " MIN-INT . MAX-INT . CR ." UNSIGNED: " 0 U. MAX-UINT U. CR ; T{ OUTPUT-TEST -> }T \ ------------------------------------------------------------------------ TESTING INPUT: ACCEPT CREATE ABUF 80 CHARS ALLOT : ACCEPT-TEST CR ." PLEASE TYPE UP TO 80 CHARACTERS: " ABUF 80 ACCEPT CR ." RECEIVED: " [CHAR] " EMIT ABUF SWAP TYPE [CHAR] " EMIT CR ; T{ ACCEPT-TEST -> }T \ ZYXWVUTSRQPONMLKJIHGFEDCBAzyxwvutsrqponmlkjihgfedcba \ ------------------------------------------------------------------------ TESTING DICTIONARY SEARCH RULES T{ : GDX 123 ; : GDX GDX 234 ; -> }T T{ GDX -> 123 234 }T CR .( End of Core word set tests) \ " \ ============================================================================= \ COREPLUSTEST \ ============================================================================= \ Additional tests on the the ANS Forth Core word set \ ----------------------------------------------------------------------------- \ https://raw.githubusercontent.com/gerryjackson/forth2012-test-suite/master/src/coreplustest.fth \ This program was written by Gerry Jackson in 2007, with contributions from \ others where indicated, and is in the public domain - it can be distributed \ and/or modified in any way but please retain this notice. \ 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. \ The tests are not claimed to be comprehensive or correct \ ----------------------------------------------------------------------------- \ The tests are based on John Hayes test program for the core word set \ \ This file provides some more tests on Core words where the original Hayes \ tests are thought to be incomplete \ \ Words tested in this file are: \ DO I +LOOP RECURSE ELSE >IN IMMEDIATE FIND IF...BEGIN...REPEAT ALLOT DOES> \ and \ Parsing behaviour \ Number prefixes # $ % and 'A' character input \ Definition names \ ----------------------------------------------------------------------------- \ Assumptions and dependencies: \ - tester.fr or ttester.fs has been loaded prior to this file \ - core.fr has been loaded so that constants MAX-INT, MIN-INT and \ MAX-UINT are defined \ ----------------------------------------------------------------------------- DECIMAL TESTING DO +LOOP with run-time increment, negative increment, infinite loop \ Contributed by Reinhold Straub VARIABLE ITERATIONS VARIABLE INCREMENT : GD7 ( LIMIT START INCREMENT -- ) INCREMENT ! 0 ITERATIONS ! DO 1 ITERATIONS +! I ITERATIONS @ 6 = IF LEAVE THEN INCREMENT @ +LOOP ITERATIONS @ ; T{ 4 4 -1 GD7 -> 4 1 }T T{ 1 4 -1 GD7 -> 4 3 2 1 4 }T T{ 4 1 -1 GD7 -> 1 0 -1 -2 -3 -4 6 }T T{ 4 1 0 GD7 -> 1 1 1 1 1 1 6 }T T{ 0 0 0 GD7 -> 0 0 0 0 0 0 6 }T T{ 1 4 0 GD7 -> 4 4 4 4 4 4 6 }T T{ 1 4 1 GD7 -> 4 5 6 7 8 9 6 }T T{ 4 1 1 GD7 -> 1 2 3 3 }T T{ 4 4 1 GD7 -> 4 5 6 7 8 9 6 }T T{ 2 -1 -1 GD7 -> -1 -2 -3 -4 -5 -6 6 }T T{ -1 2 -1 GD7 -> 2 1 0 -1 4 }T T{ 2 -1 0 GD7 -> -1 -1 -1 -1 -1 -1 6 }T T{ -1 2 0 GD7 -> 2 2 2 2 2 2 6 }T T{ -1 2 1 GD7 -> 2 3 4 5 6 7 6 }T T{ 2 -1 1 GD7 -> -1 0 1 3 }T T{ -20 30 -10 GD7 -> 30 20 10 0 -10 -20 6 }T T{ -20 31 -10 GD7 -> 31 21 11 1 -9 -19 6 }T T{ -20 29 -10 GD7 -> 29 19 9 -1 -11 5 }T \ ----------------------------------------------------------------------------- TESTING DO +LOOP with large and small increments \ Contributed by Andrew Haley MAX-UINT 8 RSHIFT 1+ CONSTANT USTEP USTEP NEGATE CONSTANT -USTEP MAX-INT 7 RSHIFT 1+ CONSTANT STEP STEP NEGATE CONSTANT -STEP VARIABLE BUMP T{ : GD8 BUMP ! DO 1+ BUMP @ +LOOP ; -> }T T{ 0 MAX-UINT 0 USTEP GD8 -> 256 }T T{ 0 0 MAX-UINT -USTEP GD8 -> 256 }T T{ 0 MAX-INT MIN-INT STEP GD8 -> 256 }T T{ 0 MIN-INT MAX-INT -STEP GD8 -> 256 }T \ Two's complement arithmetic, wraps around modulo wordsize \ Only tested if the Forth system does wrap around, use of conditional \ compilation deliberately avoided MAX-INT 1+ MIN-INT = CONSTANT +WRAP? MIN-INT 1- MAX-INT = CONSTANT -WRAP? MAX-UINT 1+ 0= CONSTANT +UWRAP? 0 1- MAX-UINT = CONSTANT -UWRAP? : GD9 ( n limit start step f result -- ) >R IF GD8 ELSE 2DROP 2DROP R@ THEN -> R> }T ; T{ 0 0 0 USTEP +UWRAP? 256 GD9 T{ 0 0 0 -USTEP -UWRAP? 1 GD9 T{ 0 MIN-INT MAX-INT STEP +WRAP? 1 GD9 T{ 0 MAX-INT MIN-INT -STEP -WRAP? 1 GD9 \ ----------------------------------------------------------------------------- TESTING DO +LOOP with maximum and minimum increments : (-MI) MAX-INT DUP NEGATE + 0= IF MAX-INT NEGATE ELSE -32767 THEN ; (-MI) CONSTANT -MAX-INT T{ 0 1 0 MAX-INT GD8 -> 1 }T T{ 0 -MAX-INT NEGATE -MAX-INT OVER GD8 -> 2 }T T{ 0 MAX-INT 0 MAX-INT GD8 -> 1 }T T{ 0 MAX-INT 1 MAX-INT GD8 -> 1 }T T{ 0 MAX-INT -1 MAX-INT GD8 -> 2 }T T{ 0 MAX-INT DUP 1- MAX-INT GD8 -> 1 }T T{ 0 MIN-INT 1+ 0 MIN-INT GD8 -> 1 }T T{ 0 MIN-INT 1+ -1 MIN-INT GD8 -> 1 }T T{ 0 MIN-INT 1+ 1 MIN-INT GD8 -> 2 }T T{ 0 MIN-INT 1+ DUP MIN-INT GD8 -> 1 }T \ ----------------------------------------------------------------------------- \ TESTING +LOOP setting I to an arbitrary value \ The specification for +LOOP permits the loop index I to be set to any value \ including a value outside the range given to the corresponding DO. \ SET-I is a helper to set I in a DO ... +LOOP to a given value \ n2 is the value of I in a DO ... +LOOP \ n3 is a test value \ If n2=n3 then return n1-n2 else return 1 : SET-I ( n1 n2 n3 -- n1-n2 | 1 ) OVER = IF - ELSE 2DROP 1 THEN ; : -SET-I ( n1 n2 n3 -- n1-n2 | -1 ) SET-I DUP 1 = IF NEGATE THEN ; : PL1 20 1 DO I 18 I 3 SET-I +LOOP ; T{ PL1 -> 1 2 3 18 19 }T : PL2 20 1 DO I 20 I 2 SET-I +LOOP ; T{ PL2 -> 1 2 }T : PL3 20 5 DO I 19 I 2 SET-I DUP 1 = IF DROP 0 I 6 SET-I THEN +LOOP ; T{ PL3 -> 5 6 0 1 2 19 }T : PL4 20 1 DO I MAX-INT I 4 SET-I +LOOP ; T{ PL4 -> 1 2 3 4 }T : PL5 -20 -1 DO I -19 I -3 -SET-I +LOOP ; T{ PL5 -> -1 -2 -3 -19 -20 }T : PL6 -20 -1 DO I -21 I -4 -SET-I +LOOP ; T{ PL6 -> -1 -2 -3 -4 }T : PL7 -20 -1 DO I MIN-INT I -5 -SET-I +LOOP ; T{ PL7 -> -1 -2 -3 -4 -5 }T : PL8 -20 -5 DO I -20 I -2 -SET-I DUP -1 = IF DROP 0 I -6 -SET-I THEN +LOOP ; T{ PL8 -> -5 -6 0 -1 -2 -20 }T \ ----------------------------------------------------------------------------- TESTING multiple RECURSEs in one colon definition : ACK ( m n -- u ) \ Ackermann function, from Rosetta Code OVER 0= IF NIP 1+ EXIT THEN \ ack(0, n) = n+1 SWAP 1- SWAP ( -- m-1 n ) DUP 0= IF 1+ RECURSE EXIT THEN \ ack(m, 0) = ack(m-1, 1) 1- OVER 1+ SWAP RECURSE RECURSE \ ack(m, n) = ack(m-1, ack(m,n-1)) ; T{ 0 0 ACK -> 1 }T T{ 3 0 ACK -> 5 }T T{ 2 4 ACK -> 11 }T \ ----------------------------------------------------------------------------- TESTING multiple ELSE's in an IF statement \ Discussed on comp.lang.forth and accepted as valid ANS Forth : MELSE IF 1 ELSE 2 ELSE 3 ELSE 4 ELSE 5 THEN ; T{ 0 MELSE -> 2 4 }T T{ -1 MELSE -> 1 3 5 }T \ ----------------------------------------------------------------------------- TESTING manipulation of >IN in interpreter mode T{ 12345 DEPTH OVER 9 < 34 AND + 3 + >IN ! -> 12345 2345 345 45 5 }T T{ 14145 8115 ?DUP 0= 34 AND >IN +! TUCK MOD 14 >IN ! GCD CALCULATION -> 15 }T \ ----------------------------------------------------------------------------- TESTING IMMEDIATE with CONSTANT VARIABLE and CREATE [ ... DOES> ] T{ 123 CONSTANT IW1 IMMEDIATE IW1 -> 123 }T T{ : IW2 IW1 LITERAL ; IW2 -> 123 }T T{ VARIABLE IW3 IMMEDIATE 234 IW3 ! IW3 @ -> 234 }T T{ : IW4 IW3 [ @ ] LITERAL ; IW4 -> 234 }T T{ :NONAME [ 345 ] IW3 [ ! ] ; DROP IW3 @ -> 345 }T T{ CREATE IW5 456 , IMMEDIATE -> }T T{ :NONAME IW5 [ @ IW3 ! ] ; DROP IW3 @ -> 456 }T T{ : IW6 CREATE , IMMEDIATE DOES> @ 1+ ; -> }T T{ 111 IW6 IW7 IW7 -> 112 }T T{ : IW8 IW7 LITERAL 1+ ; IW8 -> 113 }T T{ : IW9 CREATE , DOES> @ 2 + IMMEDIATE ; -> }T : FIND-IW BL WORD FIND NIP ; ( -- 0 | 1 | -1 ) T{ 222 IW9 IW10 FIND-IW IW10 -> -1 }T \ IW10 is not immediate T{ IW10 FIND-IW IW10 -> 224 1 }T \ IW10 becomes immediate \ ----------------------------------------------------------------------------- TESTING that IMMEDIATE doesn't toggle a flag VARIABLE IT1 0 IT1 ! : IT2 1234 IT1 ! ; IMMEDIATE IMMEDIATE T{ : IT3 IT2 ; IT1 @ -> 1234 }T \ ----------------------------------------------------------------------------- TESTING parsing behaviour of S" ." and ( \ which should parse to just beyond the terminating character no space needed T{ : GC5 S" A string"2DROP ; GC5 -> }T T{ ( A comment)1234 -> 1234 }T T{ : PB1 CR ." You should see 2345: "." 2345"( A comment) CR ; PB1 -> }T \ ----------------------------------------------------------------------------- TESTING number prefixes # $ % and 'c' character input \ Adapted from the Forth 200X Draft 14.5 document VARIABLE OLD-BASE DECIMAL BASE @ OLD-BASE ! T{ #1289 -> 1289 }T T{ #-1289 -> -1289 }T T{ $12eF -> 4847 }T T{ $-12eF -> -4847 }T T{ %10010110 -> 150 }T T{ %-10010110 -> -150 }T T{ 'z' -> 122 }T T{ 'Z' -> 90 }T \ Check BASE is unchanged T{ BASE @ OLD-BASE @ = -> }T \ Repeat in Hex mode 16 OLD-BASE ! 16 BASE ! T{ #1289 -> 509 }T T{ #-1289 -> -509 }T T{ $12eF -> 12EF }T T{ $-12eF -> -12EF }T T{ %10010110 -> 96 }T T{ %-10010110 -> -96 }T T{ 'z' -> 7a }T T{ 'Z' -> 5a }T \ Check BASE is unchanged T{ BASE @ OLD-BASE @ = -> }T \ 2 DECIMAL \ Check number prefixes in compile mode T{ : nmp #8327 $-2cbe %011010111 ''' ; nmp -> 8327 -11454 215 39 }T \ ----------------------------------------------------------------------------- TESTING definition names \ should support {1..31} graphical characters : !"#$%&'()*+,-./0123456789:;<=>? 1 ; T{ !"#$%&'()*+,-./0123456789:;<=>? -> 1 }T : @ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ 2 ; T{ @ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ -> 2 }T : _`abcdefghijklmnopqrstuvwxyz{|} 3 ; T{ _`abcdefghijklmnopqrstuvwxyz{|} -> 3 }T : _`abcdefghijklmnopqrstuvwxyz{|~ 4 ; \ Last character different T{ _`abcdefghijklmnopqrstuvwxyz{|~ -> 4 }T T{ _`abcdefghijklmnopqrstuvwxyz{|} -> 3 }T \ ----------------------------------------------------------------------------- TESTING FIND with a zero length string and a non-existent word CREATE EMPTYSTRING 0 C, : EMPTYSTRING-FIND-CHECK ( c-addr 0 | xt 1 | xt -1 -- t|f ) DUP IF ." FIND returns a TRUE value for an empty string!" CR THEN 0= SWAP EMPTYSTRING = = ; T{ EMPTYSTRING FIND EMPTYSTRING-FIND-CHECK -> }T CREATE NON-EXISTENT-WORD \ Same as in exceptiontest.fth 15 C, CHAR $ C, CHAR $ C, CHAR Q C, CHAR W C, CHAR E C, CHAR Q C, CHAR W C, CHAR E C, CHAR Q C, CHAR W C, CHAR E C, CHAR R C, CHAR T C, CHAR $ C, CHAR $ C, T{ NON-EXISTENT-WORD FIND -> NON-EXISTENT-WORD 0 }T \ ----------------------------------------------------------------------------- TESTING IF ... BEGIN ... REPEAT (unstructured) T{ : UNS1 DUP 0 > IF 9 SWAP BEGIN 1+ DUP 3 > IF EXIT THEN REPEAT ; -> }T T{ -6 UNS1 -> -6 }T T{ 1 UNS1 -> 9 4 }T \ ----------------------------------------------------------------------------- TESTING DOES> doesn't cause a problem with a CREATEd address : MAKE-2CONST DOES> 2@ ; T{ CREATE 2K 3 , 2K , MAKE-2CONST 2K -> ' 2K >BODY 3 }T \ ----------------------------------------------------------------------------- TESTING ALLOT ( n -- ) where n <= 0 T{ HERE 5 ALLOT -5 ALLOT HERE = -> }T T{ HERE 0 ALLOT HERE = -> }T \ ----------------------------------------------------------------------------- CR .( End of additional Core tests) \ " \ ----------------------------------------------------------------------------- TESTING TO VALUE :NONAME IS DEFER T{ 111 VALUE v1 -> }T T{ -999 VALUE v2 -> }T T{ v1 -> 111 }T T{ v2 -> -999 }T T{ 222 TO v1 -> }T T{ v1 -> 222 }T T{ : vd1 v1 ; -> }T T{ vd1 -> 222 }T T{ : vd2 TO v2 ; -> }T T{ v2 -> -999 }T T{ -333 vd2 -> }T T{ v2 -> -333 }T T{ v1 -> 222 }T VARIABLE nn1 VARIABLE nn2 T{ :NONAME 1234 ; nn1 ! -> }T T{ :NONAME 9876 ; nn2 ! -> }T T{ nn1 @ EXECUTE -> 1234 }T T{ nn2 @ EXECUTE -> 9876 }T T{ :NONAME ( n -- 0,1,..n ) DUP IF DUP >R 1- RECURSE R> THEN ; CONSTANT RN1 -> }T T{ 0 RN1 EXECUTE -> 0 }T T{ 4 RN1 EXECUTE -> 0 1 2 3 4 }T :NONAME ( n -- n1 ) \ Multiple RECURSEs in one definition 1- DUP CASE 0 OF EXIT ENDOF 1 OF 11 SWAP RECURSE ENDOF 2 OF 22 SWAP RECURSE ENDOF 3 OF 33 SWAP RECURSE ENDOF DROP ABS RECURSE EXIT ENDCASE ; CONSTANT RN2 T{ 1 RN2 EXECUTE -> 0 }T T{ 2 RN2 EXECUTE -> 11 0 }T T{ 4 RN2 EXECUTE -> 33 22 11 0 }T T{ 25 RN2 EXECUTE -> 33 22 11 0 }T T{ DEFER defer5 -> }T T{ : is-defer5 IS defer5 ; -> }T T{ ' * IS defer5 -> }T T{ 2 3 defer5 -> 6 }T T{ ' + is-defer5 -> }T T{ 1 2 defer5 -> 3 }T \ ----------------------------------------------------------------------------- TESTING MARKER (contributed by James Bowman) T{ : MA? BL WORD FIND NIP 0<> ; -> }T T{ MARKER MA0 -> }T T{ : MA1 111 ; -> }T T{ MARKER MA2 -> }T T{ : MA1 222 ; -> }T T{ MA? MA0 MA? MA1 MA? MA2 -> TRUE TRUE TRUE }T T{ MA1 MA2 MA1 -> 222 111 }T T{ MA? MA0 MA? MA1 MA? MA2 -> TRUE TRUE FALSE }T T{ MA0 -> }T T{ MA? MA0 MA? MA1 MA? MA2 -> FALSE FALSE FALSE }T ECHO CORETESTSUCCESS