2 ; -------------------------------------
3 ; CORETEST.4TH for any FastForth target
4 ; -------------------------------------
9 $0D EMIT \ return to column 1, no 'LF'
10 ABORT" {CORE_ANS} word set not found !"
11 POSTPONE {CORETEST} \ remove all test words
14 [UNDEFINED] {CORE_ANS} ABORT_TEST
17 $0D DUP EMIT \ return to column 1, set true flag for ABORT"
18 $0A BASE ! \ set decimal
19 {CORETEST} \ remove all coretest definitionss
20 ABORT" CORETEST + COREPLUSTEST success!" \ true_flag --
23 [UNDEFINED] SM/REM [IF]
24 \ https://forth-standard.org/standard/core/SMDivREM
25 \ SM/REM d1 n1 -- r q symmetric signed div'n
61 [UNDEFINED] FM/MOD [IF]
62 \ https://forth-standard.org/standard/core/FMDivMOD
63 \ FM/MOD d1 n1 -- r q floored signed div'n
66 HI2LO \ -- remainder quotient S=divisor
67 CMP #0,0(R15) \ remainder <> 0 ?
69 CMP #1,R14 \ quotient < 1 ?
71 ADD R12,0(R15) \ add divisor to remainder
72 SUB #1,R14 \ decrement quotient
80 \ From: John Hayes S1I
82 \ Date: Mon, 27 Nov 95 13:10:09 PST
84 \ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
85 \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
88 \ 22/1/09 The words { and } have been changed to T{ and }T respectively to
89 \ agree with the Forth 200X file ttester.fs. This avoids clashes with
90 \ locals using { ... } and the FSL use of }
93 \ 13/05/14 jmt. added colorised error messages.
98 \ SET THE FOLLOWING FLAG TO TRUE FOR MORE VERBOSE OUTPUT; THIS MAY
99 \ ALLOW YOU TO TELL WHICH TEST CAUSED YOUR SYSTEM TO HANG.
104 : EMPTY-STACK ( ... -- ) \ EMPTY STACK: HANDLES UNDERFLOWED STACK TOO.
106 IF DUP 0< IF NEGATE 0
108 ELSE 0 DO DROP LOOP THEN
111 : ERROR \ ( C-ADDR U -- ) DISPLAY AN ERROR MESSAGE FOLLOWED BY
112 \ THE LINE THAT HAD THE ERROR.
113 TYPE SOURCE TYPE CR \ DISPLAY LINE CORRESPONDING TO ERROR
114 EMPTY-STACK \ THROW AWAY EVERY THING ELSE
115 QUIT \ *** Uncomment this line to QUIT on an error
118 VARIABLE ACTUAL-DEPTH \ STACK RECORD
119 CREATE ACTUAL-RESULTS 20 CELLS ALLOT
121 : T{ \ ( -- ) SYNTACTIC SUGAR.
124 : -> \ ( ... -- ) RECORD DEPTH AND CONTENT OF STACK.
125 DEPTH DUP ACTUAL-DEPTH ! \ RECORD DEPTH
126 ?DUP IF \ IF THERE IS SOMETHING ON STACK
127 0 DO ACTUAL-RESULTS I CELLS + ! LOOP \ SAVE THEM
130 : }T \ ( ... -- ) COMPARE STACK (EXPECTED) CONTENTS WITH SAVED
132 DEPTH ACTUAL-DEPTH @ = IF \ IF DEPTHS MATCH
133 DEPTH ?DUP IF \ IF THERE IS SOMETHING ON THE STACK
134 0 DO \ FOR EACH STACK ITEM
135 ACTUAL-RESULTS I CELLS + @ \ COMPARE ACTUAL WITH EXPECTED
136 \ = 0= IF S" INCORRECT RESULT: " ERROR LEAVE THEN \ jmt
137 = 0= ABORT" INCORRECT RESULT" \ jmt : abort with colorised message
140 ELSE \ DEPTH MISMATCH
141 \ S" WRONG NUMBER OF RESULTS: " ERROR \ jmt
142 TRUE ABORT" WRONG NUMBER OF RESULTS" \ jmt : abort with colorised message
145 : TESTING \ ( -- ) TALKING COMMENT.
147 IF DUP >R TYPE CR R> >IN !
148 ELSE >IN ! DROP [CHAR] * EMIT
153 \ From: John Hayes S1I
155 \ Date: Mon, 27 Nov 95 13:10
157 \ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
158 \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
160 \ THIS PROGRAM TESTS THE CORE WORDS OF AN ANS FORTH SYSTEM.
161 \ THE PROGRAM ASSUMES A TWO'S COMPLEMENT IMPLEMENTATION WHERE
162 \ THE RANGE OF SIGNED NUMBERS IS -2^(N-1) ... 2^(N-1)-1 AND
163 \ THE RANGE OF UNSIGNED NUMBERS IS 0 ... 2^(N)-1.
164 \ I HAVEN'T FIGURED OUT HOW TO TEST KEY, QUIT, ABORT, OR ABORT"...
165 \ I ALSO HAVEN'T THOUGHT OF A WAY TO TEST ENVIRONMENT?...
167 \ ------------------------------------------------------------------------
168 TESTING BASIC ASSUMPTIONS
170 T{ -> }T \ START WITH CLEAN SLATE
171 ( TEST IF ANY BITS ARE SET; ANSWER IN BASE 1 )
172 T{ : BITSSET? IF 0 0 ELSE 0 THEN ; -> }T
173 T{ 0 BITSSET? -> 0 }T ( ZERO IS ALL BITS CLEAR )
174 T{ 1 BITSSET? -> 0 0 }T ( OTHER NUMBER HAVE AT LEAST ONE BIT )
175 T{ -1 BITSSET? -> 0 0 }T
177 \ ------------------------------------------------------------------------
178 TESTING BOOLEANS: INVERT AND OR XOR
185 T{ 0 INVERT 1 AND -> 1 }T
186 T{ 1 INVERT 1 AND -> 0 }T
191 T{ 0S INVERT -> 1S }T
192 T{ 1S INVERT -> 0S }T
194 T{ 0S 0S AND -> 0S }T
195 T{ 0S 1S AND -> 0S }T
196 T{ 1S 0S AND -> 0S }T
197 T{ 1S 1S AND -> 1S }T
204 T{ 0S 0S XOR -> 0S }T
205 T{ 0S 1S XOR -> 1S }T
206 T{ 1S 0S XOR -> 1S }T
207 T{ 1S 1S XOR -> 0S }T
209 \ ------------------------------------------------------------------------
210 TESTING 2* 2/ LSHIFT RSHIFT
212 ( WE TRUST 1S, INVERT, AND BITSSET?; WE WILL CONFIRM RSHIFT LATER )
213 1S 1 RSHIFT INVERT CONSTANT MSB
214 T{ MSB BITSSET? -> 0 0 }T
218 T{ 4000 2* -> 8000 }T
219 T{ 1S 2* 1 XOR -> 1S }T
224 T{ 4000 2/ -> 2000 }T
225 T{ 1S 2/ -> 1S }T \ MSB PROPOGATED
226 T{ 1S 1 XOR 2/ -> 1S }T
227 T{ MSB 2/ MSB AND -> MSB }T
229 T{ 1 0 LSHIFT -> 1 }T
230 T{ 1 1 LSHIFT -> 2 }T
231 T{ 1 2 LSHIFT -> 4 }T
232 T{ 1 F LSHIFT -> 8000 }T \ BIGGEST GUARANTEED SHIFT
233 T{ 1S 1 LSHIFT 1 XOR -> 1S }T
234 T{ MSB 1 LSHIFT -> 0 }T
236 T{ 1 0 RSHIFT -> 1 }T
237 T{ 1 1 RSHIFT -> 0 }T
238 T{ 2 1 RSHIFT -> 1 }T
239 T{ 4 2 RSHIFT -> 1 }T
240 T{ 8000 F RSHIFT -> 1 }T \ BIGGEST
241 T{ MSB 1 RSHIFT MSB AND -> 0 }T \ RSHIFT ZERO FILLS MSBS
242 T{ MSB 1 RSHIFT 2* -> MSB }T
244 \ ------------------------------------------------------------------------
245 TESTING COMPARISONS: 0= = 0< < > U< MIN MAX
246 0 INVERT CONSTANT MAX-UINT
247 0 INVERT 1 RSHIFT CONSTANT MAX-INT
248 0 INVERT 1 RSHIFT INVERT CONSTANT MIN-INT
249 0 INVERT 1 RSHIFT CONSTANT MID-UINT
250 0 INVERT 1 RSHIFT INVERT CONSTANT MID-UINT+1
256 T{ 1 0= -> <FALSE> }T
257 T{ 2 0= -> <FALSE> }T
258 T{ -1 0= -> <FALSE> }T
259 T{ MAX-UINT 0= -> <FALSE> }T
260 T{ MIN-INT 0= -> <FALSE> }T
261 T{ MAX-INT 0= -> <FALSE> }T
263 T{ 0 0 = -> <TRUE> }T
264 T{ 1 1 = -> <TRUE> }T
265 T{ -1 -1 = -> <TRUE> }T
266 T{ 1 0 = -> <FALSE> }T
267 T{ -1 0 = -> <FALSE> }T
268 T{ 0 1 = -> <FALSE> }T
269 T{ 0 -1 = -> <FALSE> }T
271 T{ 0 0< -> <FALSE> }T
272 T{ -1 0< -> <TRUE> }T
273 T{ MIN-INT 0< -> <TRUE> }T
274 T{ 1 0< -> <FALSE> }T
275 T{ MAX-INT 0< -> <FALSE> }T
277 T{ 0 1 < -> <TRUE> }T
278 T{ 1 2 < -> <TRUE> }T
279 T{ -1 0 < -> <TRUE> }T
280 T{ -1 1 < -> <TRUE> }T
281 T{ MIN-INT 0 < -> <TRUE> }T
282 T{ MIN-INT MAX-INT < -> <TRUE> }T
283 T{ 0 MAX-INT < -> <TRUE> }T
284 T{ 0 0 < -> <FALSE> }T
285 T{ 1 1 < -> <FALSE> }T
286 T{ 1 0 < -> <FALSE> }T
287 T{ 2 1 < -> <FALSE> }T
288 T{ 0 -1 < -> <FALSE> }T
289 T{ 1 -1 < -> <FALSE> }T
290 T{ 0 MIN-INT < -> <FALSE> }T
291 T{ MAX-INT MIN-INT < -> <FALSE> }T
292 T{ MAX-INT 0 < -> <FALSE> }T
294 T{ 0 1 > -> <FALSE> }T
295 T{ 1 2 > -> <FALSE> }T
296 T{ -1 0 > -> <FALSE> }T
297 T{ -1 1 > -> <FALSE> }T
298 T{ MIN-INT 0 > -> <FALSE> }T
299 T{ MIN-INT MAX-INT > -> <FALSE> }T
300 T{ 0 MAX-INT > -> <FALSE> }T
301 T{ 0 0 > -> <FALSE> }T
302 T{ 1 1 > -> <FALSE> }T
303 T{ 1 0 > -> <TRUE> }T
304 T{ 2 1 > -> <TRUE> }T
305 T{ 0 -1 > -> <TRUE> }T
306 T{ 1 -1 > -> <TRUE> }T
307 T{ 0 MIN-INT > -> <TRUE> }T
308 T{ MAX-INT MIN-INT > -> <TRUE> }T
309 T{ MAX-INT 0 > -> <TRUE> }T
311 T{ 0 1 U< -> <TRUE> }T
312 T{ 1 2 U< -> <TRUE> }T
313 T{ 0 MID-UINT U< -> <TRUE> }T
314 T{ 0 MAX-UINT U< -> <TRUE> }T
315 T{ MID-UINT MAX-UINT U< -> <TRUE> }T
316 T{ 0 0 U< -> <FALSE> }T
317 T{ 1 1 U< -> <FALSE> }T
318 T{ 1 0 U< -> <FALSE> }T
319 T{ 2 1 U< -> <FALSE> }T
320 T{ MID-UINT 0 U< -> <FALSE> }T
321 T{ MAX-UINT 0 U< -> <FALSE> }T
322 T{ MAX-UINT MID-UINT U< -> <FALSE> }T
328 T{ MIN-INT 0 MIN -> MIN-INT }T
329 T{ MIN-INT MAX-INT MIN -> MIN-INT }T
330 T{ 0 MAX-INT MIN -> 0 }T
337 T{ 0 MIN-INT MIN -> MIN-INT }T
338 T{ MAX-INT MIN-INT MIN -> MIN-INT }T
339 T{ MAX-INT 0 MIN -> 0 }T
345 T{ MIN-INT 0 MAX -> 0 }T
346 T{ MIN-INT MAX-INT MAX -> MAX-INT }T
347 T{ 0 MAX-INT MAX -> MAX-INT }T
354 T{ 0 MIN-INT MAX -> 0 }T
355 T{ MAX-INT MIN-INT MAX -> MAX-INT }T
356 T{ MAX-INT 0 MAX -> MAX-INT }T
358 \ ------------------------------------------------------------------------
359 TESTING STACK OPS: 2DROP 2DUP 2OVER 2SWAP ?DUP DEPTH DROP DUP OVER ROT SWAP
362 T{ 1 2 2DUP -> 1 2 1 2 }T
363 T{ 1 2 3 4 2OVER -> 1 2 3 4 1 2 }T
364 T{ 1 2 3 4 2SWAP -> 3 4 1 2 }T
367 T{ -1 ?DUP -> -1 -1 }T
370 T{ 0 1 DEPTH -> 0 1 2 }T
374 T{ 1 2 OVER -> 1 2 1 }T
375 T{ 1 2 3 ROT -> 2 3 1 }T
376 T{ 1 2 SWAP -> 2 1 }T
378 \ ------------------------------------------------------------------------
381 T{ : GR1 >R R> ; -> }T
382 T{ : GR2 >R R@ R> DROP ; -> }T
385 T{ 1S GR1 -> 1S }T ( RETURN STACK HOLDS CELLS )
387 \ ------------------------------------------------------------------------
388 TESTING ADD/SUBTRACT: + - 1+ 1- ABS NEGATE
399 T{ MID-UINT 1 + -> MID-UINT+1 }T
410 T{ MID-UINT+1 1 - -> MID-UINT }T
415 T{ MID-UINT 1+ -> MID-UINT+1 }T
420 T{ MID-UINT+1 1- -> MID-UINT }T
431 T{ MIN-INT ABS -> MID-UINT+1 }T
433 \ ------------------------------------------------------------------------
434 TESTING MULTIPLY: S>D * M* UM*
439 T{ -1 S>D -> -1 -1 }T
440 T{ -2 S>D -> -2 -1 }T
441 T{ MIN-INT S>D -> MIN-INT -1 }T
442 T{ MAX-INT S>D -> MAX-INT 0 }T
444 T{ 0 0 M* -> 0 S>D }T
445 T{ 0 1 M* -> 0 S>D }T
446 T{ 1 0 M* -> 0 S>D }T
447 T{ 1 2 M* -> 2 S>D }T
448 T{ 2 1 M* -> 2 S>D }T
449 T{ 3 3 M* -> 9 S>D }T
450 T{ -3 3 M* -> -9 S>D }T
451 T{ 3 -3 M* -> -9 S>D }T
452 T{ -3 -3 M* -> 9 S>D }T
453 T{ 0 MIN-INT M* -> 0 S>D }T
454 T{ 1 MIN-INT M* -> MIN-INT S>D }T
455 T{ 2 MIN-INT M* -> 0 1S }T
456 T{ 0 MAX-INT M* -> 0 S>D }T
457 T{ 1 MAX-INT M* -> MAX-INT S>D }T
458 T{ 2 MAX-INT M* -> MAX-INT 1 LSHIFT 0 }T
459 T{ MIN-INT MIN-INT M* -> 0 MSB 1 RSHIFT }T
460 T{ MAX-INT MIN-INT M* -> MSB MSB 2/ }T
461 T{ MAX-INT MAX-INT M* -> 1 MSB 2/ INVERT }T
463 T{ 0 0 * -> 0 }T \ TEST IDENTITIES
473 T{ MID-UINT+1 1 RSHIFT 2 * -> MID-UINT+1 }T
474 T{ MID-UINT+1 2 RSHIFT 4 * -> MID-UINT+1 }T
475 T{ MID-UINT+1 1 RSHIFT MID-UINT+1 OR 2 * -> MID-UINT+1 }T
484 T{ MID-UINT+1 1 RSHIFT 2 UM* -> MID-UINT+1 0 }T
485 T{ MID-UINT+1 2 UM* -> 0 1 }T
486 T{ MID-UINT+1 4 UM* -> 0 2 }T
487 T{ 1S 2 UM* -> 1S 1 LSHIFT 1 }T
488 T{ MAX-UINT MAX-UINT UM* -> 1 1 INVERT }T
490 \ ------------------------------------------------------------------------
491 TESTING DIVIDE: FM/MOD SM/REM UM/MOD */ */MOD / /MOD MOD
493 T{ 0 S>D 1 FM/MOD -> 0 0 }T
494 T{ 1 S>D 1 FM/MOD -> 0 1 }T
495 T{ 2 S>D 1 FM/MOD -> 0 2 }T
496 T{ -1 S>D 1 FM/MOD -> 0 -1 }T
497 T{ -2 S>D 1 FM/MOD -> 0 -2 }T
498 T{ 0 S>D -1 FM/MOD -> 0 0 }T
499 T{ 1 S>D -1 FM/MOD -> 0 -1 }T
500 T{ 2 S>D -1 FM/MOD -> 0 -2 }T
501 T{ -1 S>D -1 FM/MOD -> 0 1 }T
502 T{ -2 S>D -1 FM/MOD -> 0 2 }T
503 T{ 2 S>D 2 FM/MOD -> 0 1 }T
504 T{ -1 S>D -1 FM/MOD -> 0 1 }T
505 T{ -2 S>D -2 FM/MOD -> 0 1 }T
506 T{ 7 S>D 3 FM/MOD -> 1 2 }T
507 T{ 7 S>D -3 FM/MOD -> -2 -3 }T
508 T{ -7 S>D 3 FM/MOD -> 2 -3 }T
509 T{ -7 S>D -3 FM/MOD -> -1 2 }T
510 T{ MAX-INT S>D 1 FM/MOD -> 0 MAX-INT }T
511 T{ MIN-INT S>D 1 FM/MOD -> 0 MIN-INT }T
512 T{ MAX-INT S>D MAX-INT FM/MOD -> 0 1 }T
513 T{ MIN-INT S>D MIN-INT FM/MOD -> 0 1 }T
514 T{ 1S 1 4 FM/MOD -> 3 MAX-INT }T
515 T{ 1 MIN-INT M* 1 FM/MOD -> 0 MIN-INT }T
516 T{ 1 MIN-INT M* MIN-INT FM/MOD -> 0 1 }T
517 T{ 2 MIN-INT M* 2 FM/MOD -> 0 MIN-INT }T
518 T{ 2 MIN-INT M* MIN-INT FM/MOD -> 0 2 }T
519 T{ 1 MAX-INT M* 1 FM/MOD -> 0 MAX-INT }T
520 T{ 1 MAX-INT M* MAX-INT FM/MOD -> 0 1 }T
521 T{ 2 MAX-INT M* 2 FM/MOD -> 0 MAX-INT }T
522 T{ 2 MAX-INT M* MAX-INT FM/MOD -> 0 2 }T
523 T{ MIN-INT MIN-INT M* MIN-INT FM/MOD -> 0 MIN-INT }T
524 T{ MIN-INT MAX-INT M* MIN-INT FM/MOD -> 0 MAX-INT }T
525 T{ MIN-INT MAX-INT M* MAX-INT FM/MOD -> 0 MIN-INT }T
526 T{ MAX-INT MAX-INT M* MAX-INT FM/MOD -> 0 MAX-INT }T
528 T{ 0 S>D 1 SM/REM -> 0 0 }T
529 T{ 1 S>D 1 SM/REM -> 0 1 }T
530 T{ 2 S>D 1 SM/REM -> 0 2 }T
531 T{ -1 S>D 1 SM/REM -> 0 -1 }T
532 T{ -2 S>D 1 SM/REM -> 0 -2 }T
533 T{ 0 S>D -1 SM/REM -> 0 0 }T
534 T{ 1 S>D -1 SM/REM -> 0 -1 }T
535 T{ 2 S>D -1 SM/REM -> 0 -2 }T
536 T{ -1 S>D -1 SM/REM -> 0 1 }T
537 T{ -2 S>D -1 SM/REM -> 0 2 }T
538 T{ 2 S>D 2 SM/REM -> 0 1 }T
539 T{ -1 S>D -1 SM/REM -> 0 1 }T
540 T{ -2 S>D -2 SM/REM -> 0 1 }T
541 T{ 7 S>D 3 SM/REM -> 1 2 }T
542 T{ 7 S>D -3 SM/REM -> 1 -2 }T
543 T{ -7 S>D 3 SM/REM -> -1 -2 }T
544 T{ -7 S>D -3 SM/REM -> -1 2 }T
545 T{ MAX-INT S>D 1 SM/REM -> 0 MAX-INT }T
546 T{ MIN-INT S>D 1 SM/REM -> 0 MIN-INT }T
547 T{ MAX-INT S>D MAX-INT SM/REM -> 0 1 }T
548 T{ MIN-INT S>D MIN-INT SM/REM -> 0 1 }T
549 T{ 1S 1 4 SM/REM -> 3 MAX-INT }T
550 T{ 2 MIN-INT M* 2 SM/REM -> 0 MIN-INT }T
551 T{ 2 MIN-INT M* MIN-INT SM/REM -> 0 2 }T
552 T{ 2 MAX-INT M* 2 SM/REM -> 0 MAX-INT }T
553 T{ 2 MAX-INT M* MAX-INT SM/REM -> 0 2 }T
554 T{ MIN-INT MIN-INT M* MIN-INT SM/REM -> 0 MIN-INT }T
555 T{ MIN-INT MAX-INT M* MIN-INT SM/REM -> 0 MAX-INT }T
556 T{ MIN-INT MAX-INT M* MAX-INT SM/REM -> 0 MIN-INT }T
557 T{ MAX-INT MAX-INT M* MAX-INT SM/REM -> 0 MAX-INT }T
559 T{ 0 0 1 UM/MOD -> 0 0 }T
560 T{ 1 0 1 UM/MOD -> 0 1 }T
561 T{ 1 0 2 UM/MOD -> 1 0 }T
562 T{ 3 0 2 UM/MOD -> 1 1 }T
563 T{ MAX-UINT 2 UM* 2 UM/MOD -> 0 MAX-UINT }T
564 T{ MAX-UINT 2 UM* MAX-UINT UM/MOD -> 0 2 }T
565 T{ MAX-UINT MAX-UINT UM* MAX-UINT UM/MOD -> 0 MAX-UINT }T
568 [ -3 2 / -2 = INVERT ] LITERAL IF POSTPONE \ THEN ;
571 [ -3 2 / -1 = INVERT ] LITERAL IF POSTPONE \ THEN ;
573 \ THE SYSTEM MIGHT DO EITHER FLOORED OR SYMMETRIC DIVISION.
574 \ SINCE WE HAVE ALREADY TESTED M*, FM/MOD, AND SM/REM WE CAN USE THEM IN TEST.
576 IFFLOORED : T/MOD >R S>D R> FM/MOD ;
577 IFFLOORED : T/ T/MOD SWAP DROP ;
578 IFFLOORED : TMOD T/MOD DROP ;
579 IFFLOORED : T*/MOD >R M* R> FM/MOD ;
580 IFFLOORED : T*/ T*/MOD SWAP DROP ;
581 IFSYM : T/MOD >R S>D R> SM/REM ;
582 IFSYM : T/ T/MOD SWAP DROP ;
583 IFSYM : TMOD T/MOD DROP ;
584 IFSYM : T*/MOD >R M* R> SM/REM ;
585 IFSYM : T*/ T*/MOD SWAP DROP ;
587 T{ 0 1 /MOD -> 0 1 T/MOD }T
588 T{ 1 1 /MOD -> 1 1 T/MOD }T
589 T{ 2 1 /MOD -> 2 1 T/MOD }T
590 T{ -1 1 /MOD -> -1 1 T/MOD }T
591 T{ -2 1 /MOD -> -2 1 T/MOD }T
592 T{ 0 -1 /MOD -> 0 -1 T/MOD }T
593 T{ 1 -1 /MOD -> 1 -1 T/MOD }T
594 T{ 2 -1 /MOD -> 2 -1 T/MOD }T
595 T{ -1 -1 /MOD -> -1 -1 T/MOD }T
596 T{ -2 -1 /MOD -> -2 -1 T/MOD }T
597 T{ 2 2 /MOD -> 2 2 T/MOD }T
598 T{ -1 -1 /MOD -> -1 -1 T/MOD }T
599 T{ -2 -2 /MOD -> -2 -2 T/MOD }T
600 T{ 7 3 /MOD -> 7 3 T/MOD }T
601 T{ 7 -3 /MOD -> 7 -3 T/MOD }T
602 T{ -7 3 /MOD -> -7 3 T/MOD }T
603 T{ -7 -3 /MOD -> -7 -3 T/MOD }T
604 T{ MAX-INT 1 /MOD -> MAX-INT 1 T/MOD }T
605 T{ MIN-INT 1 /MOD -> MIN-INT 1 T/MOD }T
606 T{ MAX-INT MAX-INT /MOD -> MAX-INT MAX-INT T/MOD }T
607 T{ MIN-INT MIN-INT /MOD -> MIN-INT MIN-INT T/MOD }T
609 T{ 0 1 / -> 0 1 T/ }T
610 T{ 1 1 / -> 1 1 T/ }T
611 T{ 2 1 / -> 2 1 T/ }T
612 T{ -1 1 / -> -1 1 T/ }T
613 T{ -2 1 / -> -2 1 T/ }T
614 T{ 0 -1 / -> 0 -1 T/ }T
615 T{ 1 -1 / -> 1 -1 T/ }T
616 T{ 2 -1 / -> 2 -1 T/ }T
617 T{ -1 -1 / -> -1 -1 T/ }T
618 T{ -2 -1 / -> -2 -1 T/ }T
619 T{ 2 2 / -> 2 2 T/ }T
620 T{ -1 -1 / -> -1 -1 T/ }T
621 T{ -2 -2 / -> -2 -2 T/ }T
622 T{ 7 3 / -> 7 3 T/ }T
623 T{ 7 -3 / -> 7 -3 T/ }T
624 T{ -7 3 / -> -7 3 T/ }T
625 T{ -7 -3 / -> -7 -3 T/ }T
626 T{ MAX-INT 1 / -> MAX-INT 1 T/ }T
627 T{ MIN-INT 1 / -> MIN-INT 1 T/ }T
628 T{ MAX-INT MAX-INT / -> MAX-INT MAX-INT T/ }T
629 T{ MIN-INT MIN-INT / -> MIN-INT MIN-INT T/ }T
631 T{ 0 1 MOD -> 0 1 TMOD }T
632 T{ 1 1 MOD -> 1 1 TMOD }T
633 T{ 2 1 MOD -> 2 1 TMOD }T
634 T{ -1 1 MOD -> -1 1 TMOD }T
635 T{ -2 1 MOD -> -2 1 TMOD }T
636 T{ 0 -1 MOD -> 0 -1 TMOD }T
637 T{ 1 -1 MOD -> 1 -1 TMOD }T
638 T{ 2 -1 MOD -> 2 -1 TMOD }T
639 T{ -1 -1 MOD -> -1 -1 TMOD }T
640 T{ -2 -1 MOD -> -2 -1 TMOD }T
641 T{ 2 2 MOD -> 2 2 TMOD }T
642 T{ -1 -1 MOD -> -1 -1 TMOD }T
643 T{ -2 -2 MOD -> -2 -2 TMOD }T
644 T{ 7 3 MOD -> 7 3 TMOD }T
645 T{ 7 -3 MOD -> 7 -3 TMOD }T
646 T{ -7 3 MOD -> -7 3 TMOD }T
647 T{ -7 -3 MOD -> -7 -3 TMOD }T
648 T{ MAX-INT 1 MOD -> MAX-INT 1 TMOD }T
649 T{ MIN-INT 1 MOD -> MIN-INT 1 TMOD }T
650 T{ MAX-INT MAX-INT MOD -> MAX-INT MAX-INT TMOD }T
651 T{ MIN-INT MIN-INT MOD -> MIN-INT MIN-INT TMOD }T
653 T{ 0 2 1 */ -> 0 2 1 T*/ }T
654 T{ 1 2 1 */ -> 1 2 1 T*/ }T
655 T{ 2 2 1 */ -> 2 2 1 T*/ }T
656 T{ -1 2 1 */ -> -1 2 1 T*/ }T
657 T{ -2 2 1 */ -> -2 2 1 T*/ }T
658 T{ 0 2 -1 */ -> 0 2 -1 T*/ }T
659 T{ 1 2 -1 */ -> 1 2 -1 T*/ }T
660 T{ 2 2 -1 */ -> 2 2 -1 T*/ }T
661 T{ -1 2 -1 */ -> -1 2 -1 T*/ }T
662 T{ -2 2 -1 */ -> -2 2 -1 T*/ }T
663 T{ 2 2 2 */ -> 2 2 2 T*/ }T
664 T{ -1 2 -1 */ -> -1 2 -1 T*/ }T
665 T{ -2 2 -2 */ -> -2 2 -2 T*/ }T
666 T{ 7 2 3 */ -> 7 2 3 T*/ }T
667 T{ 7 2 -3 */ -> 7 2 -3 T*/ }T
668 T{ -7 2 3 */ -> -7 2 3 T*/ }T
669 T{ -7 2 -3 */ -> -7 2 -3 T*/ }T
670 T{ MAX-INT 2 MAX-INT */ -> MAX-INT 2 MAX-INT T*/ }T
671 T{ MIN-INT 2 MIN-INT */ -> MIN-INT 2 MIN-INT T*/ }T
673 T{ 0 2 1 */MOD -> 0 2 1 T*/MOD }T
674 T{ 1 2 1 */MOD -> 1 2 1 T*/MOD }T
675 T{ 2 2 1 */MOD -> 2 2 1 T*/MOD }T
676 T{ -1 2 1 */MOD -> -1 2 1 T*/MOD }T
677 T{ -2 2 1 */MOD -> -2 2 1 T*/MOD }T
678 T{ 0 2 -1 */MOD -> 0 2 -1 T*/MOD }T
679 T{ 1 2 -1 */MOD -> 1 2 -1 T*/MOD }T
680 T{ 2 2 -1 */MOD -> 2 2 -1 T*/MOD }T
681 T{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }T
682 T{ -2 2 -1 */MOD -> -2 2 -1 T*/MOD }T
683 T{ 2 2 2 */MOD -> 2 2 2 T*/MOD }T
684 T{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }T
685 T{ -2 2 -2 */MOD -> -2 2 -2 T*/MOD }T
686 T{ 7 2 3 */MOD -> 7 2 3 T*/MOD }T
687 T{ 7 2 -3 */MOD -> 7 2 -3 T*/MOD }T
688 T{ -7 2 3 */MOD -> -7 2 3 T*/MOD }T
689 T{ -7 2 -3 */MOD -> -7 2 -3 T*/MOD }T
690 T{ MAX-INT 2 MAX-INT */MOD -> MAX-INT 2 MAX-INT T*/MOD }T
691 T{ MIN-INT 2 MIN-INT */MOD -> MIN-INT 2 MIN-INT T*/MOD }T
693 \ ------------------------------------------------------------------------
694 TESTING HERE , @ ! CELL+ CELLS C, C@ C! CHARS 2@ 2! ALIGN ALIGNED +! ALLOT
700 T{ 1STA 2NDA U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
701 T{ 1STA 1+ -> 2NDA }T \ ... BY ONE ADDRESS UNIT
702 ( MISSING TEST: NEGATIVE ALLOT )
704 \ Added by GWJ so that ALIGN can be used before , (comma) is tested
705 1 ALIGNED CONSTANT ALMNT \ -- 1|2|4|8 for 8|16|32|64 bit alignment
707 T{ HERE 1 ALLOT ALIGN HERE SWAP - ALMNT = -> <TRUE> }T
714 T{ 1ST 2ND U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
715 T{ 1ST CELL+ -> 2ND }T \ ... BY ONE CELL
716 T{ 1ST 1 CELLS + -> 2ND }T
717 T{ 1ST @ 2ND @ -> 1 2 }T
719 T{ 1ST @ 2ND @ -> 5 2 }T
721 T{ 1ST @ 2ND @ -> 5 6 }T
725 T{ 1S 1ST ! 1ST @ -> 1S }T \ CAN STORE CELL-WIDE VALUE
731 T{ 1STC 2NDC U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
732 T{ 1STC CHAR+ -> 2NDC }T \ ... BY ONE CHAR
733 T{ 1STC 1 CHARS + -> 2NDC }T
734 T{ 1STC C@ 2NDC C@ -> 1 2 }T
736 T{ 1STC C@ 2NDC C@ -> 3 2 }T
738 T{ 1STC C@ 2NDC C@ -> 3 4 }T
740 ALIGN 1 ALLOT HERE ALIGN HERE 3 CELLS ALLOT
741 CONSTANT A-ADDR CONSTANT UA-ADDR
742 T{ UA-ADDR ALIGNED -> A-ADDR }T
743 T{ 1 A-ADDR C! A-ADDR C@ -> 1 }T
744 T{ 1234 A-ADDR ! A-ADDR @ -> 1234 }T
745 T{ 123 456 A-ADDR 2! A-ADDR 2@ -> 123 456 }T
746 T{ 2 A-ADDR CHAR+ C! A-ADDR CHAR+ C@ -> 2 }T
747 T{ 3 A-ADDR CELL+ C! A-ADDR CELL+ C@ -> 3 }T
748 T{ 1234 A-ADDR CELL+ ! A-ADDR CELL+ @ -> 1234 }T
749 T{ 123 456 A-ADDR CELL+ 2! A-ADDR CELL+ 2@ -> 123 456 }T
752 0 SWAP BEGIN DUP WHILE DUP MSB AND IF >R 1+ R> THEN 2* REPEAT DROP ;
753 ( CHARACTERS >= 1 AU, <= SIZE OF CELL, >= 8 BITS )
754 T{ 1 CHARS 1 < -> <FALSE> }T
755 T{ 1 CHARS 1 CELLS > -> <FALSE> }T
756 ( TBD: HOW TO FIND NUMBER OF BITS? )
758 ( CELLS >= 1 AU, INTEGRAL MULTIPLE OF CHAR SIZE, >= 16 BITS )
759 T{ 1 CELLS 1 < -> <FALSE> }T
760 T{ 1 CELLS 1 CHARS MOD -> 0 }T
761 T{ 1S BITS 10 < -> <FALSE> }T
766 T{ -1 1ST +! 1ST @ -> 0 }T
768 \ ------------------------------------------------------------------------
769 TESTING CHAR [CHAR] [ ] BL S"
773 T{ CHAR HELLO -> 48 }T
774 T{ : GC1 [CHAR] X ; -> }T
775 T{ : GC2 [CHAR] HELLO ; -> }T
778 T{ : GC3 [ GC1 ] LITERAL ; -> }T
780 T{ : GC4 S" XY" ; -> }T
781 T{ GC4 SWAP DROP -> 2 }T
782 T{ GC4 DROP DUP C@ SWAP CHAR+ C@ -> 58 59 }T
784 \ ------------------------------------------------------------------------
785 TESTING ' ['] FIND EXECUTE IMMEDIATE COUNT LITERAL POSTPONE STATE
788 T{ ' GT1 EXECUTE -> 123 }T
789 T{ : GT2 ['] GT1 ; IMMEDIATE -> }T
790 T{ GT2 EXECUTE -> 123 }T
791 HERE 3 C, CHAR G C, CHAR T C, CHAR 1 C, CONSTANT GT1STRING
792 HERE 3 C, CHAR G C, CHAR T C, CHAR 2 C, CONSTANT GT2STRING
793 T{ GT1STRING FIND -> ' GT1 -1 }T
794 T{ GT2STRING FIND -> ' GT2 1 }T
795 ( HOW TO SEARCH FOR NON-EXISTENT WORD? )
796 T{ : GT3 GT2 LITERAL ; -> }T
798 T{ GT1STRING COUNT -> GT1STRING CHAR+ 3 }T
800 T{ : GT4 POSTPONE GT1 ; IMMEDIATE -> }T
803 T{ : GT6 345 ; IMMEDIATE -> }T
804 T{ : GT7 POSTPONE GT6 ; -> }T
807 T{ : GT8 STATE @ ; IMMEDIATE -> }T
809 T{ : GT9 GT8 LITERAL ; -> }T
810 T{ GT9 0= -> <FALSE> }T
812 \ ------------------------------------------------------------------------
813 TESTING IF ELSE THEN BEGIN WHILE REPEAT UNTIL RECURSE
815 T{ : GI1 IF 123 THEN ; -> }T
816 T{ : GI2 IF 123 ELSE 234 THEN ; -> }T
824 T{ : GI3 BEGIN DUP 5 < WHILE DUP 1+ REPEAT ; -> }T
825 T{ 0 GI3 -> 0 1 2 3 4 5 }T
830 T{ : GI4 BEGIN DUP 1+ DUP 5 > UNTIL ; -> }T
831 T{ 3 GI4 -> 3 4 5 6 }T
835 T{ : GI5 BEGIN DUP 2 > WHILE DUP 5 < WHILE DUP 1+ REPEAT 123 ELSE 345 THEN ; -> }T
838 T{ 3 GI5 -> 3 4 5 123 }T
839 T{ 4 GI5 -> 4 5 123 }T
842 T{ : GI6 ( N -- 0,1,..N ) DUP IF DUP >R 1- RECURSE R> THEN ; -> }T
846 T{ 3 GI6 -> 0 1 2 3 }T
847 T{ 4 GI6 -> 0 1 2 3 4 }T
849 \ ----------------------------------------------------------------------------
850 TESTING DO LOOP +LOOP I J UNLOOP LEAVE EXIT
852 T{ : GD1 DO I LOOP ; -> }T
853 T{ 4 1 GD1 -> 1 2 3 }T
854 T{ 2 -1 GD1 -> -1 0 1 }T
855 T{ MID-UINT+1 MID-UINT GD1 -> MID-UINT }T
857 T{ : GD2 DO I -1 +LOOP ; -> }T
858 T{ 1 4 GD2 -> 4 3 2 1 }T
859 T{ -1 2 GD2 -> 2 1 0 -1 }T
860 T{ MID-UINT MID-UINT+1 GD2 -> MID-UINT+1 MID-UINT }T
862 T{ : GD3 DO 1 0 DO J LOOP LOOP ; -> }T
863 T{ 4 1 GD3 -> 1 2 3 }T
864 T{ 2 -1 GD3 -> -1 0 1 }T
865 T{ MID-UINT+1 MID-UINT GD3 -> MID-UINT }T
867 T{ : GD4 DO 1 0 DO J LOOP -1 +LOOP ; -> }T
868 T{ 1 4 GD4 -> 4 3 2 1 }T
869 T{ -1 2 GD4 -> 2 1 0 -1 }T
870 T{ MID-UINT MID-UINT+1 GD4 -> MID-UINT+1 MID-UINT }T
872 T{ : GD5 123 SWAP 0 DO I 4 > IF DROP 234 LEAVE THEN LOOP ; -> }T
877 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 )
879 I 1+ 0 DO I J + 3 = IF I UNLOOP I UNLOOP EXIT THEN 1+ LOOP
885 \ ------------------------------------------------------------------------
886 TESTING DEFINING WORDS: : ; CONSTANT VARIABLE CREATE DOES> >BODY
888 T{ 123 CONSTANT X123 -> }T
890 T{ : EQU CONSTANT ; -> }T
891 T{ X123 EQU Y123 -> }T
898 T{ : NOP : POSTPONE ; ; -> }T
899 T{ NOP NOP1 NOP NOP2 -> }T
903 T{ : DOES1 DOES> @ 1 + ; -> }T
904 T{ : DOES2 DOES> @ 2 + ; -> }T
907 T{ ' CR1 >BODY -> HERE }T
915 T{ : WEIRD: CREATE DOES> 1 + DOES> 2 + ; -> }T
917 T{ ' W1 >BODY -> HERE }T
921 \ ------------------------------------------------------------------------
924 : GE1 S" 123" ; IMMEDIATE
925 : GE2 S" 123 1+" ; IMMEDIATE
926 : GE3 S" : GE4 345 ;" ;
927 : GE5 EVALUATE ; IMMEDIATE
929 T{ GE1 EVALUATE -> 123 }T ( TEST EVALUATE IN INTERP. STATE )
930 T{ GE2 EVALUATE -> 124 }T
931 T{ GE3 EVALUATE -> }T
934 T{ : GE6 GE1 GE5 ; -> }T ( TEST EVALUATE IN COMPILE STATE )
936 T{ : GE7 GE2 GE5 ; -> }T
939 \ ------------------------------------------------------------------------
940 TESTING SOURCE >IN WORD
942 : GS1 S" SOURCE" 2DUP EVALUATE
943 >R SWAP >R = R> R> = ;
944 T{ GS1 -> <TRUE> <TRUE> }T
947 : RESCAN? -1 SCANS +! SCANS @ IF 0 >IN ! THEN ;
953 : GS2 5 SCANS ! S" 123 RESCAN?" EVALUATE ;
954 T{ GS2 -> 123 123 123 123 123 }T
956 : GS3 WORD COUNT SWAP C@ ;
957 T{ BL GS3 HELLO -> 5 CHAR H }T
958 T{ CHAR " GS3 GOODBYE" -> 7 CHAR G }T
960 DROP -> 0 }T \ BLANK LINE RETURN ZERO-LENGTH STRING
962 : GS4 SOURCE >IN ! DROP ;
966 \ ------------------------------------------------------------------------
967 TESTING <# # #S #> HOLD SIGN BASE >NUMBER HEX DECIMAL
969 : S= \ ( ADDR1 C1 ADDR2 C2 -- T/F ) COMPARE TWO STRINGS.
970 >R SWAP R@ = IF \ MAKE SURE STRINGS HAVE SAME LENGTH
971 R> ?DUP IF \ IF NON-EMPTY STRINGS
974 2DROP <FALSE> UNLOOP EXIT THEN
975 SWAP CHAR+ SWAP CHAR+
978 2DROP <TRUE> \ IF WE GET HERE, STRINGS MATCH
980 R> DROP 2DROP <FALSE> \ LENGTHS MISMATCH
983 : GP1 <# 41 HOLD 42 HOLD 0 0 #> S" BA" S= ;
986 : GP2 <# -1 SIGN 0 SIGN -1 SIGN 0 0 #> S" --" S= ;
989 : GP3 <# 1 0 # # #> S" 01" S= ;
992 : GP4 <# 1 0 #S #> S" 1" S= ;
995 24 CONSTANT MAX-BASE \ BASE 2 .. 36
997 0 0 INVERT BEGIN DUP WHILE >R 1+ R> 2* REPEAT DROP ;
998 COUNT-BITS 2* CONSTANT #BITS-UD \ NUMBER OF BITS IN UD
1002 MAX-BASE 1+ 2 DO \ FOR EACH POSSIBLE BASE
1003 I BASE ! \ TBD: ASSUMES BASE WORKS
1004 I 0 <# #S #> S" 10" S= AND
1011 MAX-UINT MAX-UINT <# #S #> \ MAXIMUM UD TO BINARY
1012 R> BASE ! \ S: C-ADDR U
1014 0 DO \ S: C-ADDR FLAG
1015 OVER C@ [CHAR] 1 = AND \ ALL ONES
1021 BASE @ >R MAX-BASE BASE !
1025 1 = SWAP C@ I 30 + = AND AND
1029 1 = SWAP C@ 41 I A - + = AND AND
1037 : GN-STRING GN-BUF 1 ;
1038 : GN-CONSUMED GN-BUF CHAR+ 0 ;
1039 : GN' [CHAR] ' WORD CHAR+ C@ GN-BUF C! GN-STRING ;
1041 T{ 0 0 GN' 0' >NUMBER -> 0 0 GN-CONSUMED }T
1042 T{ 0 0 GN' 1' >NUMBER -> 1 0 GN-CONSUMED }T
1043 T{ 1 0 GN' 1' >NUMBER -> BASE @ 1+ 0 GN-CONSUMED }T
1044 \ FOLLOWING SHOULD FAIL TO CONVERT
1045 T{ 0 0 GN' -' >NUMBER -> 0 0 GN-STRING }T
1046 T{ 0 0 GN' +' >NUMBER -> 0 0 GN-STRING }T
1047 T{ 0 0 GN' .' >NUMBER -> 0 0 GN-STRING }T
1050 BASE @ >R BASE ! >NUMBER R> BASE ! ;
1052 T{ 0 0 GN' 2' 10 >NUMBER-BASED -> 2 0 GN-CONSUMED }T
1053 T{ 0 0 GN' 2' 2 >NUMBER-BASED -> 0 0 GN-STRING }T
1054 T{ 0 0 GN' F' 10 >NUMBER-BASED -> F 0 GN-CONSUMED }T
1055 T{ 0 0 GN' G' 10 >NUMBER-BASED -> 0 0 GN-STRING }T
1056 T{ 0 0 GN' G' MAX-BASE >NUMBER-BASED -> 10 0 GN-CONSUMED }T
1057 T{ 0 0 GN' Z' MAX-BASE >NUMBER-BASED -> 23 0 GN-CONSUMED }T
1059 : GN1 \ ( UD BASE -- UD' LEN )
1060 \ UD SHOULD EQUAL UD' AND LEN SHOULD BE ZERO.
1063 0 0 2SWAP >NUMBER SWAP DROP \ RETURN LENGTH ONLY
1065 T{ 0 0 2 GN1 -> 0 0 0 }T
1066 T{ MAX-UINT 0 2 GN1 -> MAX-UINT 0 0 }T
1067 T{ MAX-UINT DUP 2 GN1 -> MAX-UINT DUP 0 }T
1068 T{ 0 0 MAX-BASE GN1 -> 0 0 0 }T
1069 T{ MAX-UINT 0 MAX-BASE GN1 -> MAX-UINT 0 0 }T
1070 T{ MAX-UINT DUP MAX-BASE GN1 -> MAX-UINT DUP 0 }T
1072 : GN2 \ ( -- 16 10 )
1073 BASE @ >R HEX BASE @ DECIMAL BASE @ R> BASE ! ;
1076 \ ------------------------------------------------------------------------
1079 CREATE FBUF 00 C, 00 C, 00 C,
1080 CREATE SBUF 12 C, 34 C, 56 C,
1081 : SEEBUF FBUF C@ FBUF CHAR+ C@ FBUF CHAR+ CHAR+ C@ ;
1083 T{ FBUF 0 20 FILL -> }T
1084 T{ SEEBUF -> 00 00 00 }T
1086 T{ FBUF 1 20 FILL -> }T
1087 T{ SEEBUF -> 20 00 00 }T
1089 T{ FBUF 3 20 FILL -> }T
1090 T{ SEEBUF -> 20 20 20 }T
1092 T{ FBUF FBUF 3 CHARS MOVE -> }T \ BIZARRE SPECIAL CASE
1093 T{ SEEBUF -> 20 20 20 }T
1095 T{ SBUF FBUF 0 CHARS MOVE -> }T
1096 T{ SEEBUF -> 20 20 20 }T
1098 T{ SBUF FBUF 1 CHARS MOVE -> }T
1099 T{ SEEBUF -> 12 20 20 }T
1101 T{ SBUF FBUF 3 CHARS MOVE -> }T
1102 T{ SEEBUF -> 12 34 56 }T
1104 T{ FBUF FBUF CHAR+ 2 CHARS MOVE -> }T
1105 T{ SEEBUF -> 12 12 34 }T
1107 T{ FBUF CHAR+ FBUF 2 CHARS MOVE -> }T
1108 T{ SEEBUF -> 12 34 34 }T
1110 \ ------------------------------------------------------------------------
1111 TESTING OUTPUT: . ." CR EMIT SPACE SPACES TYPE U.
1114 ." YOU SHOULD SEE THE STANDARD GRAPHIC CHARACTERS:" CR
1115 41 BL DO I EMIT LOOP CR
1116 61 41 DO I EMIT LOOP CR
1117 7F 61 DO I EMIT LOOP CR
1118 ." YOU SHOULD SEE 0-9 SEPARATED BY A SPACE:" CR
1119 9 1+ 0 DO I . LOOP CR
1120 ." YOU SHOULD SEE 0-9 (WITH NO SPACES):" CR
1121 [CHAR] 9 1+ [CHAR] 0 DO I 0 SPACES EMIT LOOP CR
1122 ." YOU SHOULD SEE A-G SEPARATED BY A SPACE:" CR
1123 [CHAR] G 1+ [CHAR] A DO I EMIT SPACE LOOP CR
1124 ." YOU SHOULD SEE 0-5 SEPARATED BY TWO SPACES:" CR
1125 5 1+ 0 DO I [CHAR] 0 + EMIT 2 SPACES LOOP CR
1126 ." YOU SHOULD SEE TWO SEPARATE LINES:" CR
1127 S" LINE 1" TYPE CR S" LINE 2" TYPE CR
1128 ." YOU SHOULD SEE THE NUMBER RANGES OF SIGNED AND UNSIGNED NUMBERS:" CR
1129 ." SIGNED: " MIN-INT . MAX-INT . CR
1130 ." UNSIGNED: " 0 U. MAX-UINT U. CR
1133 T{ OUTPUT-TEST -> }T
1134 \ ------------------------------------------------------------------------
1135 TESTING INPUT: ACCEPT
1137 CREATE ABUF 80 CHARS ALLOT
1140 CR ." PLEASE TYPE UP TO 80 CHARACTERS: "
1142 CR ." RECEIVED: " [CHAR] " EMIT
1143 ABUF SWAP TYPE [CHAR] " EMIT CR
1146 T{ ACCEPT-TEST -> }T
1147 \ ZYXWVUTSRQPONMLKJIHGFEDCBAzyxwvutsrqponmlkjihgfedcba
1148 \ ------------------------------------------------------------------------
1149 TESTING DICTIONARY SEARCH RULES
1151 T{ : GDX 123 ; : GDX GDX 234 ; -> }T
1153 T{ GDX -> 123 234 }T
1155 CR .( End of Core word set tests) \ "
1157 \ =============================================================================
1159 \ =============================================================================
1160 \ Additional tests on the the ANS Forth Core word set
1161 \ -----------------------------------------------------------------------------
1162 \ https://raw.githubusercontent.com/gerryjackson/forth2012-test-suite/master/src/coreplustest.fth
1164 \ This program was written by Gerry Jackson in 2007, with contributions from
1165 \ others where indicated, and is in the public domain - it can be distributed
1166 \ and/or modified in any way but please retain this notice.
1168 \ This program is distributed in the hope that it will be useful,
1169 \ but WITHOUT ANY WARRANTY; without even the implied warranty of
1170 \ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
1172 \ The tests are not claimed to be comprehensive or correct
1174 \ -----------------------------------------------------------------------------
1175 \ The tests are based on John Hayes test program for the core word set
1177 \ This file provides some more tests on Core words where the original Hayes
1178 \ tests are thought to be incomplete
1180 \ Words tested in this file are:
1181 \ DO I +LOOP RECURSE ELSE >IN IMMEDIATE FIND IF...BEGIN...REPEAT ALLOT DOES>
1184 \ Number prefixes # $ % and 'A' character input
1186 \ -----------------------------------------------------------------------------
1187 \ Assumptions and dependencies:
1188 \ - tester.fr or ttester.fs has been loaded prior to this file
1189 \ - core.fr has been loaded so that constants <TRUE> MAX-INT, MIN-INT and
1190 \ MAX-UINT are defined
1191 \ -----------------------------------------------------------------------------
1195 TESTING DO +LOOP with run-time increment, negative increment, infinite loop
1196 \ Contributed by Reinhold Straub
1200 : GD7 ( LIMIT START INCREMENT -- )
1206 ITERATIONS @ 6 = IF LEAVE THEN
1211 T{ 4 4 -1 GD7 -> 4 1 }T
1212 T{ 1 4 -1 GD7 -> 4 3 2 1 4 }T
1213 T{ 4 1 -1 GD7 -> 1 0 -1 -2 -3 -4 6 }T
1214 T{ 4 1 0 GD7 -> 1 1 1 1 1 1 6 }T
1215 T{ 0 0 0 GD7 -> 0 0 0 0 0 0 6 }T
1216 T{ 1 4 0 GD7 -> 4 4 4 4 4 4 6 }T
1217 T{ 1 4 1 GD7 -> 4 5 6 7 8 9 6 }T
1218 T{ 4 1 1 GD7 -> 1 2 3 3 }T
1219 T{ 4 4 1 GD7 -> 4 5 6 7 8 9 6 }T
1220 T{ 2 -1 -1 GD7 -> -1 -2 -3 -4 -5 -6 6 }T
1221 T{ -1 2 -1 GD7 -> 2 1 0 -1 4 }T
1222 T{ 2 -1 0 GD7 -> -1 -1 -1 -1 -1 -1 6 }T
1223 T{ -1 2 0 GD7 -> 2 2 2 2 2 2 6 }T
1224 T{ -1 2 1 GD7 -> 2 3 4 5 6 7 6 }T
1225 T{ 2 -1 1 GD7 -> -1 0 1 3 }T
1226 T{ -20 30 -10 GD7 -> 30 20 10 0 -10 -20 6 }T
1227 T{ -20 31 -10 GD7 -> 31 21 11 1 -9 -19 6 }T
1228 T{ -20 29 -10 GD7 -> 29 19 9 -1 -11 5 }T
1230 \ -----------------------------------------------------------------------------
1231 TESTING DO +LOOP with large and small increments
1233 \ Contributed by Andrew Haley
1235 MAX-UINT 8 RSHIFT 1+ CONSTANT USTEP
1236 USTEP NEGATE CONSTANT -USTEP
1237 MAX-INT 7 RSHIFT 1+ CONSTANT STEP
1238 STEP NEGATE CONSTANT -STEP
1242 T{ : GD8 BUMP ! DO 1+ BUMP @ +LOOP ; -> }T
1244 T{ 0 MAX-UINT 0 USTEP GD8 -> 256 }T
1245 T{ 0 0 MAX-UINT -USTEP GD8 -> 256 }T
1247 T{ 0 MAX-INT MIN-INT STEP GD8 -> 256 }T
1248 T{ 0 MIN-INT MAX-INT -STEP GD8 -> 256 }T
1250 \ Two's complement arithmetic, wraps around modulo wordsize
1251 \ Only tested if the Forth system does wrap around, use of conditional
1252 \ compilation deliberately avoided
1254 MAX-INT 1+ MIN-INT = CONSTANT +WRAP?
1255 MIN-INT 1- MAX-INT = CONSTANT -WRAP?
1256 MAX-UINT 1+ 0= CONSTANT +UWRAP?
1257 0 1- MAX-UINT = CONSTANT -UWRAP?
1259 : GD9 ( n limit start step f result -- )
1260 >R IF GD8 ELSE 2DROP 2DROP R@ THEN -> R> }T
1263 T{ 0 0 0 USTEP +UWRAP? 256 GD9
1264 T{ 0 0 0 -USTEP -UWRAP? 1 GD9
1265 T{ 0 MIN-INT MAX-INT STEP +WRAP? 1 GD9
1266 T{ 0 MAX-INT MIN-INT -STEP -WRAP? 1 GD9
1268 \ -----------------------------------------------------------------------------
1269 TESTING DO +LOOP with maximum and minimum increments
1271 : (-MI) MAX-INT DUP NEGATE + 0= IF MAX-INT NEGATE ELSE -32767 THEN ;
1272 (-MI) CONSTANT -MAX-INT
1274 T{ 0 1 0 MAX-INT GD8 -> 1 }T
1275 T{ 0 -MAX-INT NEGATE -MAX-INT OVER GD8 -> 2 }T
1277 T{ 0 MAX-INT 0 MAX-INT GD8 -> 1 }T
1278 T{ 0 MAX-INT 1 MAX-INT GD8 -> 1 }T
1279 T{ 0 MAX-INT -1 MAX-INT GD8 -> 2 }T
1280 T{ 0 MAX-INT DUP 1- MAX-INT GD8 -> 1 }T
1282 T{ 0 MIN-INT 1+ 0 MIN-INT GD8 -> 1 }T
1283 T{ 0 MIN-INT 1+ -1 MIN-INT GD8 -> 1 }T
1284 T{ 0 MIN-INT 1+ 1 MIN-INT GD8 -> 2 }T
1285 T{ 0 MIN-INT 1+ DUP MIN-INT GD8 -> 1 }T
1287 \ -----------------------------------------------------------------------------
1288 \ TESTING +LOOP setting I to an arbitrary value
1290 \ The specification for +LOOP permits the loop index I to be set to any value
1291 \ including a value outside the range given to the corresponding DO.
1293 \ SET-I is a helper to set I in a DO ... +LOOP to a given value
1294 \ n2 is the value of I in a DO ... +LOOP
1295 \ n3 is a test value
1296 \ If n2=n3 then return n1-n2 else return 1
1297 : SET-I ( n1 n2 n3 -- n1-n2 | 1 )
1298 OVER = IF - ELSE 2DROP 1 THEN
1301 : -SET-I ( n1 n2 n3 -- n1-n2 | -1 )
1302 SET-I DUP 1 = IF NEGATE THEN
1305 : PL1 20 1 DO I 18 I 3 SET-I +LOOP ;
1306 T{ PL1 -> 1 2 3 18 19 }T
1307 : PL2 20 1 DO I 20 I 2 SET-I +LOOP ;
1309 : PL3 20 5 DO I 19 I 2 SET-I DUP 1 = IF DROP 0 I 6 SET-I THEN +LOOP ;
1310 T{ PL3 -> 5 6 0 1 2 19 }T
1311 : PL4 20 1 DO I MAX-INT I 4 SET-I +LOOP ;
1312 T{ PL4 -> 1 2 3 4 }T
1313 : PL5 -20 -1 DO I -19 I -3 -SET-I +LOOP ;
1314 T{ PL5 -> -1 -2 -3 -19 -20 }T
1315 : PL6 -20 -1 DO I -21 I -4 -SET-I +LOOP ;
1316 T{ PL6 -> -1 -2 -3 -4 }T
1317 : PL7 -20 -1 DO I MIN-INT I -5 -SET-I +LOOP ;
1318 T{ PL7 -> -1 -2 -3 -4 -5 }T
1319 : PL8 -20 -5 DO I -20 I -2 -SET-I DUP -1 = IF DROP 0 I -6 -SET-I THEN +LOOP ;
1320 T{ PL8 -> -5 -6 0 -1 -2 -20 }T
1322 \ -----------------------------------------------------------------------------
1323 TESTING multiple RECURSEs in one colon definition
1325 : ACK ( m n -- u ) \ Ackermann function, from Rosetta Code
1326 OVER 0= IF NIP 1+ EXIT THEN \ ack(0, n) = n+1
1327 SWAP 1- SWAP ( -- m-1 n )
1328 DUP 0= IF 1+ RECURSE EXIT THEN \ ack(m, 0) = ack(m-1, 1)
1329 1- OVER 1+ SWAP RECURSE RECURSE \ ack(m, n) = ack(m-1, ack(m,n-1))
1336 \ -----------------------------------------------------------------------------
1337 TESTING multiple ELSE's in an IF statement
1338 \ Discussed on comp.lang.forth and accepted as valid ANS Forth
1340 : MELSE IF 1 ELSE 2 ELSE 3 ELSE 4 ELSE 5 THEN ;
1341 T{ 0 MELSE -> 2 4 }T
1342 T{ -1 MELSE -> 1 3 5 }T
1344 \ -----------------------------------------------------------------------------
1345 TESTING manipulation of >IN in interpreter mode
1347 T{ 12345 DEPTH OVER 9 < 34 AND + 3 + >IN ! -> 12345 2345 345 45 5 }T
1348 T{ 14145 8115 ?DUP 0= 34 AND >IN +! TUCK MOD 14 >IN ! GCD CALCULATION -> 15 }T
1350 \ -----------------------------------------------------------------------------
1351 TESTING IMMEDIATE with CONSTANT VARIABLE and CREATE [ ... DOES> ]
1353 T{ 123 CONSTANT IW1 IMMEDIATE IW1 -> 123 }T
1354 T{ : IW2 IW1 LITERAL ; IW2 -> 123 }T
1355 T{ VARIABLE IW3 IMMEDIATE 234 IW3 ! IW3 @ -> 234 }T
1356 T{ : IW4 IW3 [ @ ] LITERAL ; IW4 -> 234 }T
1357 T{ :NONAME [ 345 ] IW3 [ ! ] ; DROP IW3 @ -> 345 }T
1358 T{ CREATE IW5 456 , IMMEDIATE -> }T
1359 T{ :NONAME IW5 [ @ IW3 ! ] ; DROP IW3 @ -> 456 }T
1360 T{ : IW6 CREATE , IMMEDIATE DOES> @ 1+ ; -> }T
1361 T{ 111 IW6 IW7 IW7 -> 112 }T
1362 T{ : IW8 IW7 LITERAL 1+ ; IW8 -> 113 }T
1363 T{ : IW9 CREATE , DOES> @ 2 + IMMEDIATE ; -> }T
1364 : FIND-IW BL WORD FIND NIP ; ( -- 0 | 1 | -1 )
1365 T{ 222 IW9 IW10 FIND-IW IW10 -> -1 }T \ IW10 is not immediate
1366 T{ IW10 FIND-IW IW10 -> 224 1 }T \ IW10 becomes immediate
1368 \ -----------------------------------------------------------------------------
1369 TESTING that IMMEDIATE doesn't toggle a flag
1371 VARIABLE IT1 0 IT1 !
1372 : IT2 1234 IT1 ! ; IMMEDIATE IMMEDIATE
1373 T{ : IT3 IT2 ; IT1 @ -> 1234 }T
1375 \ -----------------------------------------------------------------------------
1376 TESTING parsing behaviour of S" ." and (
1377 \ which should parse to just beyond the terminating character no space needed
1379 T{ : GC5 S" A string"2DROP ; GC5 -> }T
1380 T{ ( A comment)1234 -> 1234 }T
1381 T{ : PB1 CR ." You should see 2345: "." 2345"( A comment) CR ; PB1 -> }T
1383 \ -----------------------------------------------------------------------------
1384 TESTING number prefixes # $ % and 'c' character input
1385 \ Adapted from the Forth 200X Draft 14.5 document
1388 DECIMAL BASE @ OLD-BASE !
1390 T{ #-1289 -> -1289 }T
1392 T{ $-12eF -> -4847 }T
1393 T{ %10010110 -> 150 }T
1394 T{ %-10010110 -> -150 }T
1397 \ Check BASE is unchanged
1398 T{ BASE @ OLD-BASE @ = -> <TRUE> }T
1400 \ Repeat in Hex mode
1401 16 OLD-BASE ! 16 BASE !
1403 T{ #-1289 -> -509 }T
1405 T{ $-12eF -> -12EF }T
1406 T{ %10010110 -> 96 }T
1407 T{ %-10010110 -> -96 }T
1410 \ Check BASE is unchanged
1411 T{ BASE @ OLD-BASE @ = -> <TRUE> }T \ 2
1414 \ Check number prefixes in compile mode
1415 T{ : nmp #8327 $-2cbe %011010111 ''' ; nmp -> 8327 -11454 215 39 }T
1417 \ -----------------------------------------------------------------------------
1418 TESTING definition names
1419 \ should support {1..31} graphical characters
1420 : !"#$%&'()*+,-./0123456789:;<=>? 1 ;
1421 T{ !"#$%&'()*+,-./0123456789:;<=>? -> 1 }T
1422 : @ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ 2 ;
1423 T{ @ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ -> 2 }T
1424 : _`abcdefghijklmnopqrstuvwxyz{|} 3 ;
1425 T{ _`abcdefghijklmnopqrstuvwxyz{|} -> 3 }T
1426 : _`abcdefghijklmnopqrstuvwxyz{|~ 4 ; \ Last character different
1427 T{ _`abcdefghijklmnopqrstuvwxyz{|~ -> 4 }T
1428 T{ _`abcdefghijklmnopqrstuvwxyz{|} -> 3 }T
1430 \ -----------------------------------------------------------------------------
1431 TESTING FIND with a zero length string and a non-existent word
1433 CREATE EMPTYSTRING 0 C,
1434 : EMPTYSTRING-FIND-CHECK ( c-addr 0 | xt 1 | xt -1 -- t|f )
1435 DUP IF ." FIND returns a TRUE value for an empty string!" CR THEN
1436 0= SWAP EMPTYSTRING = = ;
1437 T{ EMPTYSTRING FIND EMPTYSTRING-FIND-CHECK -> <TRUE> }T
1439 CREATE NON-EXISTENT-WORD \ Same as in exceptiontest.fth
1440 15 C, CHAR $ C, CHAR $ C, CHAR Q C, CHAR W C, CHAR E C, CHAR Q C,
1441 CHAR W C, CHAR E C, CHAR Q C, CHAR W C, CHAR E C, CHAR R C, CHAR T C,
1443 T{ NON-EXISTENT-WORD FIND -> NON-EXISTENT-WORD 0 }T
1445 \ -----------------------------------------------------------------------------
1446 TESTING IF ... BEGIN ... REPEAT (unstructured)
1448 T{ : UNS1 DUP 0 > IF 9 SWAP BEGIN 1+ DUP 3 > IF EXIT THEN REPEAT ; -> }T
1452 \ -----------------------------------------------------------------------------
1453 TESTING DOES> doesn't cause a problem with a CREATEd address
1455 : MAKE-2CONST DOES> 2@ ;
1456 T{ CREATE 2K 3 , 2K , MAKE-2CONST 2K -> ' 2K >BODY 3 }T
1458 \ -----------------------------------------------------------------------------
1459 TESTING ALLOT ( n -- ) where n <= 0
1461 T{ HERE 5 ALLOT -5 ALLOT HERE = -> <TRUE> }T
1462 T{ HERE 0 ALLOT HERE = -> <TRUE> }T
1464 \ -----------------------------------------------------------------------------
1466 CR .( End of additional Core tests) \ "
1468 \ -----------------------------------------------------------------------------
1469 TESTING TO VALUE :NONAME IS DEFER
1471 T{ 111 VALUE v1 -> }T
1472 T{ -999 VALUE v2 -> }T
1479 T{ : vd2 TO v2 ; -> }T
1487 T{ :NONAME 1234 ; nn1 ! -> }T
1488 T{ :NONAME 9876 ; nn2 ! -> }T
1489 T{ nn1 @ EXECUTE -> 1234 }T
1490 T{ nn2 @ EXECUTE -> 9876 }T
1492 T{ :NONAME ( n -- 0,1,..n ) DUP IF DUP >R 1- RECURSE R> THEN ;
1494 T{ 0 RN1 EXECUTE -> 0 }T
1495 T{ 4 RN1 EXECUTE -> 0 1 2 3 4 }T
1497 :NONAME ( n -- n1 ) \ Multiple RECURSEs in one definition
1499 CASE 0 OF EXIT ENDOF
1500 1 OF 11 SWAP RECURSE ENDOF
1501 2 OF 22 SWAP RECURSE ENDOF
1502 3 OF 33 SWAP RECURSE ENDOF
1503 DROP ABS RECURSE EXIT
1507 T{ 1 RN2 EXECUTE -> 0 }T
1508 T{ 2 RN2 EXECUTE -> 11 0 }T
1509 T{ 4 RN2 EXECUTE -> 33 22 11 0 }T
1510 T{ 25 RN2 EXECUTE -> 33 22 11 0 }T
1513 T{ DEFER defer5 -> }T
1514 T{ : is-defer5 IS defer5 ; -> }T
1515 T{ ' * IS defer5 -> }T
1516 T{ 2 3 defer5 -> 6 }T
1517 T{ ' + is-defer5 -> }T
1518 T{ 1 2 defer5 -> 3 }T
1520 \ -----------------------------------------------------------------------------
1521 TESTING MARKER (contributed by James Bowman)
1523 T{ : MA? BL WORD FIND NIP 0<> ; -> }T
1525 T{ : MA1 111 ; -> }T
1527 T{ : MA1 222 ; -> }T
1528 T{ MA? MA0 MA? MA1 MA? MA2 -> TRUE TRUE TRUE }T
1529 T{ MA1 MA2 MA1 -> 222 111 }T
1530 T{ MA? MA0 MA? MA1 MA? MA2 -> TRUE TRUE FALSE }T
1532 T{ MA? MA0 MA? MA1 MA? MA2 -> FALSE FALSE FALSE }T