2 \ ; -------------------------------------
3 \ ; CORETEST.4TH for any FastForth target
4 \ ; -------------------------------------
6 [DEFINED] {CORETEST} [IF] {CORETEST} [THEN]
11 $0D EMIT \ return to column 1
12 POSTPONE {CORETEST} \ that remove all test words
13 ABORT" {CORE_ANS} word set not found !"
16 [UNDEFINED] {CORE_ANS} ABORT_TEST
20 $0D EMIT \ return to column 1
21 {CORETEST} \ that remove all test words
22 1 ABORT" CORE tests success!"
25 \ From: John Hayes S1I
27 \ Date: Mon, 27 Nov 95 13:10:09 PST
29 \ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
30 \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
33 \ 22/1/09 The words { and } have been changed to T{ and }T respectively to
34 \ agree with the Forth 200X file ttester.fs. This avoids clashes with
35 \ locals using { ... } and the FSL use of }
38 \ 13/05/14 jmt. added colorised error messages.
43 \ SET THE FOLLOWING FLAG TO TRUE FOR MORE VERBOSE OUTPUT; THIS MAY
44 \ ALLOW YOU TO TELL WHICH TEST CAUSED YOUR SYSTEM TO HANG.
49 \ : EMPTY-STACK ( ... -- ) \ EMPTY STACK: HANDLES UNDERFLOWED STACK TOO.
51 \ IF DUP 0< IF NEGATE 0
53 \ ELSE 0 DO DROP LOOP THEN
56 \ : ERROR \ ( C-ADDR U -- ) DISPLAY AN ERROR MESSAGE FOLLOWED BY
57 \ \ THE LINE THAT HAD THE ERROR.
58 \ TYPE SOURCE TYPE CR \ DISPLAY LINE CORRESPONDING TO ERROR
59 \ EMPTY-STACK \ THROW AWAY EVERY THING ELSE
60 \ \ QUIT \ *** Uncomment this line to QUIT on an error
63 VARIABLE ACTUAL-DEPTH \ STACK RECORD
64 CREATE ACTUAL-RESULTS 20 CELLS ALLOT
66 : T{ \ ( -- ) SYNTACTIC SUGAR.
69 : -> \ ( ... -- ) RECORD DEPTH AND CONTENT OF STACK.
70 DEPTH DUP ACTUAL-DEPTH ! \ RECORD DEPTH
71 ?DUP IF \ IF THERE IS SOMETHING ON STACK
72 0 DO ACTUAL-RESULTS I CELLS + ! LOOP \ SAVE THEM
75 : }T \ ( ... -- ) COMPARE STACK (EXPECTED) CONTENTS WITH SAVED
77 DEPTH ACTUAL-DEPTH @ = IF \ IF DEPTHS MATCH
78 DEPTH ?DUP IF \ IF THERE IS SOMETHING ON THE STACK
79 0 DO \ FOR EACH STACK ITEM
80 ACTUAL-RESULTS I CELLS + @ \ COMPARE ACTUAL WITH EXPECTED
81 \ = 0= IF S" INCORRECT RESULT: " ERROR LEAVE THEN \ jmt
82 = 0= IF TRUE ABORT" INCORRECT RESULT" THEN \ jmt : abort with colorised message
86 \ S" WRONG NUMBER OF RESULTS: " ERROR \ jmt
87 TRUE ABORT" WRONG NUMBER OF RESULTS" \ jmt : abort with colorised message
90 : TESTING \ ( -- ) TALKING COMMENT.
92 IF DUP >R TYPE CR R> >IN !
93 \ ELSE >IN ! DROP [CHAR] * EMIT
94 ELSE >IN ! DROP \ [CHAR] * EMIT
99 \ From: John Hayes S1I
101 \ Date: Mon, 27 Nov 95 13:10
103 \ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
104 \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
106 \ THIS PROGRAM TESTS THE CORE WORDS OF AN ANS FORTH SYSTEM.
107 \ THE PROGRAM ASSUMES A TWO'S COMPLEMENT IMPLEMENTATION WHERE
108 \ THE RANGE OF SIGNED NUMBERS IS -2^(N-1) ... 2^(N-1)-1 AND
109 \ THE RANGE OF UNSIGNED NUMBERS IS 0 ... 2^(N)-1.
110 \ I HAVEN'T FIGURED OUT HOW TO TEST KEY, QUIT, ABORT, OR ABORT"...
111 \ I ALSO HAVEN'T THOUGHT OF A WAY TO TEST ENVIRONMENT?...
113 \ ------------------------------------------------------------------------
114 TESTING BASIC ASSUMPTIONS
116 T{ -> }T \ START WITH CLEAN SLATE
117 ( TEST IF ANY BITS ARE SET; ANSWER IN BASE 1 )
118 T{ : BITSSET? IF 0 0 ELSE 0 THEN ; -> }T
119 T{ 0 BITSSET? -> 0 }T ( ZERO IS ALL BITS CLEAR )
120 T{ 1 BITSSET? -> 0 0 }T ( OTHER NUMBER HAVE AT LEAST ONE BIT )
121 T{ -1 BITSSET? -> 0 0 }T
123 \ ------------------------------------------------------------------------
124 TESTING BOOLEANS: INVERT AND OR XOR
131 T{ 0 INVERT 1 AND -> 1 }T
132 T{ 1 INVERT 1 AND -> 0 }T
137 T{ 0S INVERT -> 1S }T
138 T{ 1S INVERT -> 0S }T
140 T{ 0S 0S AND -> 0S }T
141 T{ 0S 1S AND -> 0S }T
142 T{ 1S 0S AND -> 0S }T
143 T{ 1S 1S AND -> 1S }T
150 T{ 0S 0S XOR -> 0S }T
151 T{ 0S 1S XOR -> 1S }T
152 T{ 1S 0S XOR -> 1S }T
153 T{ 1S 1S XOR -> 0S }T
155 \ ------------------------------------------------------------------------
156 TESTING 2* 2/ LSHIFT RSHIFT
158 ( WE TRUST 1S, INVERT, AND BITSSET?; WE WILL CONFIRM RSHIFT LATER )
159 1S 1 RSHIFT INVERT CONSTANT MSB
160 T{ MSB BITSSET? -> 0 0 }T
164 T{ 4000 2* -> 8000 }T
165 T{ 1S 2* 1 XOR -> 1S }T
170 T{ 4000 2/ -> 2000 }T
171 T{ 1S 2/ -> 1S }T \ MSB PROPOGATED
172 T{ 1S 1 XOR 2/ -> 1S }T
173 T{ MSB 2/ MSB AND -> MSB }T
175 T{ 1 0 LSHIFT -> 1 }T
176 T{ 1 1 LSHIFT -> 2 }T
177 T{ 1 2 LSHIFT -> 4 }T
178 T{ 1 F LSHIFT -> 8000 }T \ BIGGEST GUARANTEED SHIFT
179 T{ 1S 1 LSHIFT 1 XOR -> 1S }T
180 T{ MSB 1 LSHIFT -> 0 }T
182 T{ 1 0 RSHIFT -> 1 }T
183 T{ 1 1 RSHIFT -> 0 }T
184 T{ 2 1 RSHIFT -> 1 }T
185 T{ 4 2 RSHIFT -> 1 }T
186 T{ 8000 F RSHIFT -> 1 }T \ BIGGEST
187 T{ MSB 1 RSHIFT MSB AND -> 0 }T \ RSHIFT ZERO FILLS MSBS
188 T{ MSB 1 RSHIFT 2* -> MSB }T
190 \ ------------------------------------------------------------------------
191 TESTING COMPARISONS: 0= = 0< < > U< MIN MAX
192 0 INVERT CONSTANT MAX-UINT
193 0 INVERT 1 RSHIFT CONSTANT MAX-INT
194 0 INVERT 1 RSHIFT INVERT CONSTANT MIN-INT
195 0 INVERT 1 RSHIFT CONSTANT MID-UINT
196 0 INVERT 1 RSHIFT INVERT CONSTANT MID-UINT+1
202 T{ 1 0= -> <FALSE> }T
203 T{ 2 0= -> <FALSE> }T
204 T{ -1 0= -> <FALSE> }T
205 T{ MAX-UINT 0= -> <FALSE> }T
206 T{ MIN-INT 0= -> <FALSE> }T
207 T{ MAX-INT 0= -> <FALSE> }T
209 T{ 0 0 = -> <TRUE> }T
210 T{ 1 1 = -> <TRUE> }T
211 T{ -1 -1 = -> <TRUE> }T
212 T{ 1 0 = -> <FALSE> }T
213 T{ -1 0 = -> <FALSE> }T
214 T{ 0 1 = -> <FALSE> }T
215 T{ 0 -1 = -> <FALSE> }T
217 T{ 0 0< -> <FALSE> }T
218 T{ -1 0< -> <TRUE> }T
219 T{ MIN-INT 0< -> <TRUE> }T
220 T{ 1 0< -> <FALSE> }T
221 T{ MAX-INT 0< -> <FALSE> }T
223 T{ 0 1 < -> <TRUE> }T
224 T{ 1 2 < -> <TRUE> }T
225 T{ -1 0 < -> <TRUE> }T
226 T{ -1 1 < -> <TRUE> }T
227 T{ MIN-INT 0 < -> <TRUE> }T
228 T{ MIN-INT MAX-INT < -> <TRUE> }T
229 T{ 0 MAX-INT < -> <TRUE> }T
230 T{ 0 0 < -> <FALSE> }T
231 T{ 1 1 < -> <FALSE> }T
232 T{ 1 0 < -> <FALSE> }T
233 T{ 2 1 < -> <FALSE> }T
234 T{ 0 -1 < -> <FALSE> }T
235 T{ 1 -1 < -> <FALSE> }T
236 T{ 0 MIN-INT < -> <FALSE> }T
237 T{ MAX-INT MIN-INT < -> <FALSE> }T
238 T{ MAX-INT 0 < -> <FALSE> }T
240 T{ 0 1 > -> <FALSE> }T
241 T{ 1 2 > -> <FALSE> }T
242 T{ -1 0 > -> <FALSE> }T
243 T{ -1 1 > -> <FALSE> }T
244 T{ MIN-INT 0 > -> <FALSE> }T
245 T{ MIN-INT MAX-INT > -> <FALSE> }T
246 T{ 0 MAX-INT > -> <FALSE> }T
247 T{ 0 0 > -> <FALSE> }T
248 T{ 1 1 > -> <FALSE> }T
249 T{ 1 0 > -> <TRUE> }T
250 T{ 2 1 > -> <TRUE> }T
251 T{ 0 -1 > -> <TRUE> }T
252 T{ 1 -1 > -> <TRUE> }T
253 T{ 0 MIN-INT > -> <TRUE> }T
254 T{ MAX-INT MIN-INT > -> <TRUE> }T
255 T{ MAX-INT 0 > -> <TRUE> }T
257 T{ 0 1 U< -> <TRUE> }T
258 T{ 1 2 U< -> <TRUE> }T
259 T{ 0 MID-UINT U< -> <TRUE> }T
260 T{ 0 MAX-UINT U< -> <TRUE> }T
261 T{ MID-UINT MAX-UINT U< -> <TRUE> }T
262 T{ 0 0 U< -> <FALSE> }T
263 T{ 1 1 U< -> <FALSE> }T
264 T{ 1 0 U< -> <FALSE> }T
265 T{ 2 1 U< -> <FALSE> }T
266 T{ MID-UINT 0 U< -> <FALSE> }T
267 T{ MAX-UINT 0 U< -> <FALSE> }T
268 T{ MAX-UINT MID-UINT U< -> <FALSE> }T
274 T{ MIN-INT 0 MIN -> MIN-INT }T
275 T{ MIN-INT MAX-INT MIN -> MIN-INT }T
276 T{ 0 MAX-INT MIN -> 0 }T
283 T{ 0 MIN-INT MIN -> MIN-INT }T
284 T{ MAX-INT MIN-INT MIN -> MIN-INT }T
285 T{ MAX-INT 0 MIN -> 0 }T
291 T{ MIN-INT 0 MAX -> 0 }T
292 T{ MIN-INT MAX-INT MAX -> MAX-INT }T
293 T{ 0 MAX-INT MAX -> MAX-INT }T
300 T{ 0 MIN-INT MAX -> 0 }T
301 T{ MAX-INT MIN-INT MAX -> MAX-INT }T
302 T{ MAX-INT 0 MAX -> MAX-INT }T
304 \ ------------------------------------------------------------------------
305 TESTING STACK OPS: 2DROP 2DUP 2OVER 2SWAP ?DUP DEPTH DROP DUP OVER ROT SWAP
308 T{ 1 2 2DUP -> 1 2 1 2 }T
309 T{ 1 2 3 4 2OVER -> 1 2 3 4 1 2 }T
310 T{ 1 2 3 4 2SWAP -> 3 4 1 2 }T
313 T{ -1 ?DUP -> -1 -1 }T
316 T{ 0 1 DEPTH -> 0 1 2 }T
320 T{ 1 2 OVER -> 1 2 1 }T
321 T{ 1 2 3 ROT -> 2 3 1 }T
322 T{ 1 2 SWAP -> 2 1 }T
324 \ ------------------------------------------------------------------------
327 T{ : GR1 >R R> ; -> }T
328 T{ : GR2 >R R@ R> DROP ; -> }T
331 T{ 1S GR1 -> 1S }T ( RETURN STACK HOLDS CELLS )
333 \ ------------------------------------------------------------------------
334 TESTING ADD/SUBTRACT: + - 1+ 1- ABS NEGATE
345 T{ MID-UINT 1 + -> MID-UINT+1 }T
356 T{ MID-UINT+1 1 - -> MID-UINT }T
361 T{ MID-UINT 1+ -> MID-UINT+1 }T
366 T{ MID-UINT+1 1- -> MID-UINT }T
377 T{ MIN-INT ABS -> MID-UINT+1 }T
379 \ ------------------------------------------------------------------------
380 TESTING MULTIPLY: S>D * M* UM*
385 T{ -1 S>D -> -1 -1 }T
386 T{ -2 S>D -> -2 -1 }T
387 T{ MIN-INT S>D -> MIN-INT -1 }T
388 T{ MAX-INT S>D -> MAX-INT 0 }T
390 T{ 0 0 M* -> 0 S>D }T
391 T{ 0 1 M* -> 0 S>D }T
392 T{ 1 0 M* -> 0 S>D }T
393 T{ 1 2 M* -> 2 S>D }T
394 T{ 2 1 M* -> 2 S>D }T
395 T{ 3 3 M* -> 9 S>D }T
396 T{ -3 3 M* -> -9 S>D }T
397 T{ 3 -3 M* -> -9 S>D }T
398 T{ -3 -3 M* -> 9 S>D }T
399 T{ 0 MIN-INT M* -> 0 S>D }T
400 T{ 1 MIN-INT M* -> MIN-INT S>D }T
401 T{ 2 MIN-INT M* -> 0 1S }T
402 T{ 0 MAX-INT M* -> 0 S>D }T
403 T{ 1 MAX-INT M* -> MAX-INT S>D }T
404 T{ 2 MAX-INT M* -> MAX-INT 1 LSHIFT 0 }T
405 T{ MIN-INT MIN-INT M* -> 0 MSB 1 RSHIFT }T
406 T{ MAX-INT MIN-INT M* -> MSB MSB 2/ }T
407 T{ MAX-INT MAX-INT M* -> 1 MSB 2/ INVERT }T
409 T{ 0 0 * -> 0 }T \ TEST IDENTITIES
419 T{ MID-UINT+1 1 RSHIFT 2 * -> MID-UINT+1 }T
420 T{ MID-UINT+1 2 RSHIFT 4 * -> MID-UINT+1 }T
421 T{ MID-UINT+1 1 RSHIFT MID-UINT+1 OR 2 * -> MID-UINT+1 }T
430 T{ MID-UINT+1 1 RSHIFT 2 UM* -> MID-UINT+1 0 }T
431 T{ MID-UINT+1 2 UM* -> 0 1 }T
432 T{ MID-UINT+1 4 UM* -> 0 2 }T
433 T{ 1S 2 UM* -> 1S 1 LSHIFT 1 }T
434 T{ MAX-UINT MAX-UINT UM* -> 1 1 INVERT }T
436 \ ------------------------------------------------------------------------
437 TESTING DIVIDE: FM/MOD SM/REM UM/MOD */ */MOD / /MOD MOD
439 T{ 0 S>D 1 FM/MOD -> 0 0 }T
440 T{ 1 S>D 1 FM/MOD -> 0 1 }T
441 T{ 2 S>D 1 FM/MOD -> 0 2 }T
442 T{ -1 S>D 1 FM/MOD -> 0 -1 }T
443 T{ -2 S>D 1 FM/MOD -> 0 -2 }T
444 T{ 0 S>D -1 FM/MOD -> 0 0 }T
445 T{ 1 S>D -1 FM/MOD -> 0 -1 }T
446 T{ 2 S>D -1 FM/MOD -> 0 -2 }T
447 T{ -1 S>D -1 FM/MOD -> 0 1 }T
448 T{ -2 S>D -1 FM/MOD -> 0 2 }T
449 T{ 2 S>D 2 FM/MOD -> 0 1 }T
450 T{ -1 S>D -1 FM/MOD -> 0 1 }T
451 T{ -2 S>D -2 FM/MOD -> 0 1 }T
452 T{ 7 S>D 3 FM/MOD -> 1 2 }T
453 T{ 7 S>D -3 FM/MOD -> -2 -3 }T
454 T{ -7 S>D 3 FM/MOD -> 2 -3 }T
455 T{ -7 S>D -3 FM/MOD -> -1 2 }T
456 T{ MAX-INT S>D 1 FM/MOD -> 0 MAX-INT }T
457 T{ MIN-INT S>D 1 FM/MOD -> 0 MIN-INT }T
458 T{ MAX-INT S>D MAX-INT FM/MOD -> 0 1 }T
459 T{ MIN-INT S>D MIN-INT FM/MOD -> 0 1 }T
460 T{ 1S 1 4 FM/MOD -> 3 MAX-INT }T
461 T{ 1 MIN-INT M* 1 FM/MOD -> 0 MIN-INT }T
462 T{ 1 MIN-INT M* MIN-INT FM/MOD -> 0 1 }T
463 T{ 2 MIN-INT M* 2 FM/MOD -> 0 MIN-INT }T
464 T{ 2 MIN-INT M* MIN-INT FM/MOD -> 0 2 }T
465 T{ 1 MAX-INT M* 1 FM/MOD -> 0 MAX-INT }T
466 T{ 1 MAX-INT M* MAX-INT FM/MOD -> 0 1 }T
467 T{ 2 MAX-INT M* 2 FM/MOD -> 0 MAX-INT }T
468 T{ 2 MAX-INT M* MAX-INT FM/MOD -> 0 2 }T
469 T{ MIN-INT MIN-INT M* MIN-INT FM/MOD -> 0 MIN-INT }T
470 T{ MIN-INT MAX-INT M* MIN-INT FM/MOD -> 0 MAX-INT }T
471 T{ MIN-INT MAX-INT M* MAX-INT FM/MOD -> 0 MIN-INT }T
472 T{ MAX-INT MAX-INT M* MAX-INT FM/MOD -> 0 MAX-INT }T
474 T{ 0 S>D 1 SM/REM -> 0 0 }T
475 T{ 1 S>D 1 SM/REM -> 0 1 }T
476 T{ 2 S>D 1 SM/REM -> 0 2 }T
477 T{ -1 S>D 1 SM/REM -> 0 -1 }T
478 T{ -2 S>D 1 SM/REM -> 0 -2 }T
479 T{ 0 S>D -1 SM/REM -> 0 0 }T
480 T{ 1 S>D -1 SM/REM -> 0 -1 }T
481 T{ 2 S>D -1 SM/REM -> 0 -2 }T
482 T{ -1 S>D -1 SM/REM -> 0 1 }T
483 T{ -2 S>D -1 SM/REM -> 0 2 }T
484 T{ 2 S>D 2 SM/REM -> 0 1 }T
485 T{ -1 S>D -1 SM/REM -> 0 1 }T
486 T{ -2 S>D -2 SM/REM -> 0 1 }T
487 T{ 7 S>D 3 SM/REM -> 1 2 }T
488 T{ 7 S>D -3 SM/REM -> 1 -2 }T
489 T{ -7 S>D 3 SM/REM -> -1 -2 }T
490 T{ -7 S>D -3 SM/REM -> -1 2 }T
491 T{ MAX-INT S>D 1 SM/REM -> 0 MAX-INT }T
492 T{ MIN-INT S>D 1 SM/REM -> 0 MIN-INT }T
493 T{ MAX-INT S>D MAX-INT SM/REM -> 0 1 }T
494 T{ MIN-INT S>D MIN-INT SM/REM -> 0 1 }T
495 T{ 1S 1 4 SM/REM -> 3 MAX-INT }T
496 T{ 2 MIN-INT M* 2 SM/REM -> 0 MIN-INT }T
497 T{ 2 MIN-INT M* MIN-INT SM/REM -> 0 2 }T
498 T{ 2 MAX-INT M* 2 SM/REM -> 0 MAX-INT }T
499 T{ 2 MAX-INT M* MAX-INT SM/REM -> 0 2 }T
500 T{ MIN-INT MIN-INT M* MIN-INT SM/REM -> 0 MIN-INT }T
501 T{ MIN-INT MAX-INT M* MIN-INT SM/REM -> 0 MAX-INT }T
502 T{ MIN-INT MAX-INT M* MAX-INT SM/REM -> 0 MIN-INT }T
503 T{ MAX-INT MAX-INT M* MAX-INT SM/REM -> 0 MAX-INT }T
505 T{ 0 0 1 UM/MOD -> 0 0 }T
506 T{ 1 0 1 UM/MOD -> 0 1 }T
507 T{ 1 0 2 UM/MOD -> 1 0 }T
508 T{ 3 0 2 UM/MOD -> 1 1 }T
509 T{ MAX-UINT 2 UM* 2 UM/MOD -> 0 MAX-UINT }T
510 T{ MAX-UINT 2 UM* MAX-UINT UM/MOD -> 0 2 }T
511 T{ MAX-UINT MAX-UINT UM* MAX-UINT UM/MOD -> 0 MAX-UINT }T
514 [ -3 2 / -2 = INVERT ] LITERAL IF POSTPONE \ THEN ;
517 [ -3 2 / -1 = INVERT ] LITERAL IF POSTPONE \ THEN ;
519 \ THE SYSTEM MIGHT DO EITHER FLOORED OR SYMMETRIC DIVISION.
520 \ SINCE WE HAVE ALREADY TESTED M*, FM/MOD, AND SM/REM WE CAN USE THEM IN TEST.
522 IFFLOORED : T/MOD >R S>D R> FM/MOD ;
523 IFFLOORED : T/ T/MOD SWAP DROP ;
524 IFFLOORED : TMOD T/MOD DROP ;
525 IFFLOORED : T*/MOD >R M* R> FM/MOD ;
526 IFFLOORED : T*/ T*/MOD SWAP DROP ;
527 IFSYM : T/MOD >R S>D R> SM/REM ;
528 IFSYM : T/ T/MOD SWAP DROP ;
529 IFSYM : TMOD T/MOD DROP ;
530 IFSYM : T*/MOD >R M* R> SM/REM ;
531 IFSYM : T*/ T*/MOD SWAP DROP ;
533 T{ 0 1 /MOD -> 0 1 T/MOD }T
534 T{ 1 1 /MOD -> 1 1 T/MOD }T
535 T{ 2 1 /MOD -> 2 1 T/MOD }T
536 T{ -1 1 /MOD -> -1 1 T/MOD }T
537 T{ -2 1 /MOD -> -2 1 T/MOD }T
538 T{ 0 -1 /MOD -> 0 -1 T/MOD }T
539 T{ 1 -1 /MOD -> 1 -1 T/MOD }T
540 T{ 2 -1 /MOD -> 2 -1 T/MOD }T
541 T{ -1 -1 /MOD -> -1 -1 T/MOD }T
542 T{ -2 -1 /MOD -> -2 -1 T/MOD }T
543 T{ 2 2 /MOD -> 2 2 T/MOD }T
544 T{ -1 -1 /MOD -> -1 -1 T/MOD }T
545 T{ -2 -2 /MOD -> -2 -2 T/MOD }T
546 T{ 7 3 /MOD -> 7 3 T/MOD }T
547 T{ 7 -3 /MOD -> 7 -3 T/MOD }T
548 T{ -7 3 /MOD -> -7 3 T/MOD }T
549 T{ -7 -3 /MOD -> -7 -3 T/MOD }T
550 T{ MAX-INT 1 /MOD -> MAX-INT 1 T/MOD }T
551 T{ MIN-INT 1 /MOD -> MIN-INT 1 T/MOD }T
552 T{ MAX-INT MAX-INT /MOD -> MAX-INT MAX-INT T/MOD }T
553 T{ MIN-INT MIN-INT /MOD -> MIN-INT MIN-INT T/MOD }T
555 T{ 0 1 / -> 0 1 T/ }T
556 T{ 1 1 / -> 1 1 T/ }T
557 T{ 2 1 / -> 2 1 T/ }T
558 T{ -1 1 / -> -1 1 T/ }T
559 T{ -2 1 / -> -2 1 T/ }T
560 T{ 0 -1 / -> 0 -1 T/ }T
561 T{ 1 -1 / -> 1 -1 T/ }T
562 T{ 2 -1 / -> 2 -1 T/ }T
563 T{ -1 -1 / -> -1 -1 T/ }T
564 T{ -2 -1 / -> -2 -1 T/ }T
565 T{ 2 2 / -> 2 2 T/ }T
566 T{ -1 -1 / -> -1 -1 T/ }T
567 T{ -2 -2 / -> -2 -2 T/ }T
568 T{ 7 3 / -> 7 3 T/ }T
569 T{ 7 -3 / -> 7 -3 T/ }T
570 T{ -7 3 / -> -7 3 T/ }T
571 T{ -7 -3 / -> -7 -3 T/ }T
572 T{ MAX-INT 1 / -> MAX-INT 1 T/ }T
573 T{ MIN-INT 1 / -> MIN-INT 1 T/ }T
574 T{ MAX-INT MAX-INT / -> MAX-INT MAX-INT T/ }T
575 T{ MIN-INT MIN-INT / -> MIN-INT MIN-INT T/ }T
577 T{ 0 1 MOD -> 0 1 TMOD }T
578 T{ 1 1 MOD -> 1 1 TMOD }T
579 T{ 2 1 MOD -> 2 1 TMOD }T
580 T{ -1 1 MOD -> -1 1 TMOD }T
581 T{ -2 1 MOD -> -2 1 TMOD }T
582 T{ 0 -1 MOD -> 0 -1 TMOD }T
583 T{ 1 -1 MOD -> 1 -1 TMOD }T
584 T{ 2 -1 MOD -> 2 -1 TMOD }T
585 T{ -1 -1 MOD -> -1 -1 TMOD }T
586 T{ -2 -1 MOD -> -2 -1 TMOD }T
587 T{ 2 2 MOD -> 2 2 TMOD }T
588 T{ -1 -1 MOD -> -1 -1 TMOD }T
589 T{ -2 -2 MOD -> -2 -2 TMOD }T
590 T{ 7 3 MOD -> 7 3 TMOD }T
591 T{ 7 -3 MOD -> 7 -3 TMOD }T
592 T{ -7 3 MOD -> -7 3 TMOD }T
593 T{ -7 -3 MOD -> -7 -3 TMOD }T
594 T{ MAX-INT 1 MOD -> MAX-INT 1 TMOD }T
595 T{ MIN-INT 1 MOD -> MIN-INT 1 TMOD }T
596 T{ MAX-INT MAX-INT MOD -> MAX-INT MAX-INT TMOD }T
597 T{ MIN-INT MIN-INT MOD -> MIN-INT MIN-INT TMOD }T
599 T{ 0 2 1 */ -> 0 2 1 T*/ }T
600 T{ 1 2 1 */ -> 1 2 1 T*/ }T
601 T{ 2 2 1 */ -> 2 2 1 T*/ }T
602 T{ -1 2 1 */ -> -1 2 1 T*/ }T
603 T{ -2 2 1 */ -> -2 2 1 T*/ }T
604 T{ 0 2 -1 */ -> 0 2 -1 T*/ }T
605 T{ 1 2 -1 */ -> 1 2 -1 T*/ }T
606 T{ 2 2 -1 */ -> 2 2 -1 T*/ }T
607 T{ -1 2 -1 */ -> -1 2 -1 T*/ }T
608 T{ -2 2 -1 */ -> -2 2 -1 T*/ }T
609 T{ 2 2 2 */ -> 2 2 2 T*/ }T
610 T{ -1 2 -1 */ -> -1 2 -1 T*/ }T
611 T{ -2 2 -2 */ -> -2 2 -2 T*/ }T
612 T{ 7 2 3 */ -> 7 2 3 T*/ }T
613 T{ 7 2 -3 */ -> 7 2 -3 T*/ }T
614 T{ -7 2 3 */ -> -7 2 3 T*/ }T
615 T{ -7 2 -3 */ -> -7 2 -3 T*/ }T
616 T{ MAX-INT 2 MAX-INT */ -> MAX-INT 2 MAX-INT T*/ }T
617 T{ MIN-INT 2 MIN-INT */ -> MIN-INT 2 MIN-INT T*/ }T
619 T{ 0 2 1 */MOD -> 0 2 1 T*/MOD }T
620 T{ 1 2 1 */MOD -> 1 2 1 T*/MOD }T
621 T{ 2 2 1 */MOD -> 2 2 1 T*/MOD }T
622 T{ -1 2 1 */MOD -> -1 2 1 T*/MOD }T
623 T{ -2 2 1 */MOD -> -2 2 1 T*/MOD }T
624 T{ 0 2 -1 */MOD -> 0 2 -1 T*/MOD }T
625 T{ 1 2 -1 */MOD -> 1 2 -1 T*/MOD }T
626 T{ 2 2 -1 */MOD -> 2 2 -1 T*/MOD }T
627 T{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }T
628 T{ -2 2 -1 */MOD -> -2 2 -1 T*/MOD }T
629 T{ 2 2 2 */MOD -> 2 2 2 T*/MOD }T
630 T{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }T
631 T{ -2 2 -2 */MOD -> -2 2 -2 T*/MOD }T
632 T{ 7 2 3 */MOD -> 7 2 3 T*/MOD }T
633 T{ 7 2 -3 */MOD -> 7 2 -3 T*/MOD }T
634 T{ -7 2 3 */MOD -> -7 2 3 T*/MOD }T
635 T{ -7 2 -3 */MOD -> -7 2 -3 T*/MOD }T
636 T{ MAX-INT 2 MAX-INT */MOD -> MAX-INT 2 MAX-INT T*/MOD }T
637 T{ MIN-INT 2 MIN-INT */MOD -> MIN-INT 2 MIN-INT T*/MOD }T
639 \ ------------------------------------------------------------------------
640 TESTING HERE , @ ! CELL+ CELLS C, C@ C! CHARS 2@ 2! ALIGN ALIGNED +! ALLOT
646 T{ 1STA 2NDA U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
647 T{ 1STA 1+ -> 2NDA }T \ ... BY ONE ADDRESS UNIT
648 ( MISSING TEST: NEGATIVE ALLOT )
650 \ Added by GWJ so that ALIGN can be used before , (comma) is tested
651 1 ALIGNED CONSTANT ALMNT \ -- 1|2|4|8 for 8|16|32|64 bit alignment
653 T{ HERE 1 ALLOT ALIGN HERE SWAP - ALMNT = -> <TRUE> }T
660 T{ 1ST 2ND U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
661 T{ 1ST CELL+ -> 2ND }T \ ... BY ONE CELL
662 T{ 1ST 1 CELLS + -> 2ND }T
663 T{ 1ST @ 2ND @ -> 1 2 }T
665 T{ 1ST @ 2ND @ -> 5 2 }T
667 T{ 1ST @ 2ND @ -> 5 6 }T
671 T{ 1S 1ST ! 1ST @ -> 1S }T \ CAN STORE CELL-WIDE VALUE
677 T{ 1STC 2NDC U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
678 T{ 1STC CHAR+ -> 2NDC }T \ ... BY ONE CHAR
679 T{ 1STC 1 CHARS + -> 2NDC }T
680 T{ 1STC C@ 2NDC C@ -> 1 2 }T
682 T{ 1STC C@ 2NDC C@ -> 3 2 }T
684 T{ 1STC C@ 2NDC C@ -> 3 4 }T
686 ALIGN 1 ALLOT HERE ALIGN HERE 3 CELLS ALLOT
687 CONSTANT A-ADDR CONSTANT UA-ADDR
688 T{ UA-ADDR ALIGNED -> A-ADDR }T
689 T{ 1 A-ADDR C! A-ADDR C@ -> 1 }T
690 T{ 1234 A-ADDR ! A-ADDR @ -> 1234 }T
691 T{ 123 456 A-ADDR 2! A-ADDR 2@ -> 123 456 }T
692 T{ 2 A-ADDR CHAR+ C! A-ADDR CHAR+ C@ -> 2 }T
693 T{ 3 A-ADDR CELL+ C! A-ADDR CELL+ C@ -> 3 }T
694 T{ 1234 A-ADDR CELL+ ! A-ADDR CELL+ @ -> 1234 }T
695 T{ 123 456 A-ADDR CELL+ 2! A-ADDR CELL+ 2@ -> 123 456 }T
698 0 SWAP BEGIN DUP WHILE DUP MSB AND IF >R 1+ R> THEN 2* REPEAT DROP ;
699 ( CHARACTERS >= 1 AU, <= SIZE OF CELL, >= 8 BITS )
700 T{ 1 CHARS 1 < -> <FALSE> }T
701 T{ 1 CHARS 1 CELLS > -> <FALSE> }T
702 ( TBD: HOW TO FIND NUMBER OF BITS? )
704 ( CELLS >= 1 AU, INTEGRAL MULTIPLE OF CHAR SIZE, >= 16 BITS )
705 T{ 1 CELLS 1 < -> <FALSE> }T
706 T{ 1 CELLS 1 CHARS MOD -> 0 }T
707 T{ 1S BITS 10 < -> <FALSE> }T
712 T{ -1 1ST +! 1ST @ -> 0 }T
714 \ ------------------------------------------------------------------------
715 TESTING CHAR [CHAR] [ ] BL S"
719 T{ CHAR HELLO -> 48 }T
720 T{ : GC1 [CHAR] X ; -> }T
721 T{ : GC2 [CHAR] HELLO ; -> }T
724 T{ : GC3 [ GC1 ] LITERAL ; -> }T
726 T{ : GC4 S" XY" ; -> }T
727 T{ GC4 SWAP DROP -> 2 }T
728 T{ GC4 DROP DUP C@ SWAP CHAR+ C@ -> 58 59 }T
730 \ ------------------------------------------------------------------------
731 TESTING ' ['] FIND EXECUTE IMMEDIATE COUNT LITERAL POSTPONE STATE
734 T{ ' GT1 EXECUTE -> 123 }T
735 T{ : GT2 ['] GT1 ; IMMEDIATE -> }T
736 T{ GT2 EXECUTE -> 123 }T
737 HERE 3 C, CHAR G C, CHAR T C, CHAR 1 C, CONSTANT GT1STRING
738 HERE 3 C, CHAR G C, CHAR T C, CHAR 2 C, CONSTANT GT2STRING
739 T{ GT1STRING FIND -> ' GT1 -1 }T
740 T{ GT2STRING FIND -> ' GT2 1 }T
741 ( HOW TO SEARCH FOR NON-EXISTENT WORD? )
742 T{ : GT3 GT2 LITERAL ; -> }T
744 T{ GT1STRING COUNT -> GT1STRING CHAR+ 3 }T
746 T{ : GT4 POSTPONE GT1 ; IMMEDIATE -> }T
749 T{ : GT6 345 ; IMMEDIATE -> }T
750 T{ : GT7 POSTPONE GT6 ; -> }T
753 T{ : GT8 STATE @ ; IMMEDIATE -> }T
755 T{ : GT9 GT8 LITERAL ; -> }T
756 T{ GT9 0= -> <FALSE> }T
758 \ ------------------------------------------------------------------------
759 TESTING IF ELSE THEN BEGIN WHILE REPEAT UNTIL RECURSE
761 T{ : GI1 IF 123 THEN ; -> }T
762 T{ : GI2 IF 123 ELSE 234 THEN ; -> }T
770 T{ : GI3 BEGIN DUP 5 < WHILE DUP 1+ REPEAT ; -> }T
771 T{ 0 GI3 -> 0 1 2 3 4 5 }T
776 T{ : GI4 BEGIN DUP 1+ DUP 5 > UNTIL ; -> }T
777 T{ 3 GI4 -> 3 4 5 6 }T
781 T{ : GI5 BEGIN DUP 2 > WHILE DUP 5 < WHILE DUP 1+ REPEAT 123 ELSE 345 THEN ; -> }T
784 T{ 3 GI5 -> 3 4 5 123 }T
785 T{ 4 GI5 -> 4 5 123 }T
788 T{ : GI6 ( N -- 0,1,..N ) DUP IF DUP >R 1- RECURSE R> THEN ; -> }T
792 T{ 3 GI6 -> 0 1 2 3 }T
793 T{ 4 GI6 -> 0 1 2 3 4 }T
795 \ ------------------------------------------------------------------------
796 TESTING DO LOOP +LOOP I J UNLOOP LEAVE EXIT
798 T{ : GD1 DO I LOOP ; -> }T
799 T{ 4 1 GD1 -> 1 2 3 }T
800 T{ 2 -1 GD1 -> -1 0 1 }T
801 T{ MID-UINT+1 MID-UINT GD1 -> MID-UINT }T
803 T{ : GD2 DO I -1 +LOOP ; -> }T
804 T{ 1 4 GD2 -> 4 3 2 1 }T
805 T{ -1 2 GD2 -> 2 1 0 -1 }T
806 T{ MID-UINT MID-UINT+1 GD2 -> MID-UINT+1 MID-UINT }T
808 T{ : GD3 DO 1 0 DO J LOOP LOOP ; -> }T
809 T{ 4 1 GD3 -> 1 2 3 }T
810 T{ 2 -1 GD3 -> -1 0 1 }T
811 T{ MID-UINT+1 MID-UINT GD3 -> MID-UINT }T
813 T{ : GD4 DO 1 0 DO J LOOP -1 +LOOP ; -> }T
814 T{ 1 4 GD4 -> 4 3 2 1 }T
815 T{ -1 2 GD4 -> 2 1 0 -1 }T
816 T{ MID-UINT MID-UINT+1 GD4 -> MID-UINT+1 MID-UINT }T
818 T{ : GD5 123 SWAP 0 DO I 4 > IF DROP 234 LEAVE THEN LOOP ; -> }T
823 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 )
825 I 1+ 0 DO I J + 3 = IF I UNLOOP I UNLOOP EXIT THEN 1+ LOOP
831 \ ------------------------------------------------------------------------
832 TESTING DEFINING WORDS: : ; CONSTANT VARIABLE CREATE DOES> >BODY
834 T{ 123 CONSTANT X123 -> }T
836 T{ : EQU CONSTANT ; -> }T
837 T{ X123 EQU Y123 -> }T
844 T{ : NOP : POSTPONE ; ; -> }T
845 T{ NOP NOP1 NOP NOP2 -> }T
849 T{ : DOES1 DOES> @ 1 + ; -> }T
850 T{ : DOES2 DOES> @ 2 + ; -> }T
853 T{ ' CR1 >BODY -> HERE }T
861 T{ : WEIRD: CREATE DOES> 1 + DOES> 2 + ; -> }T
863 T{ ' W1 >BODY -> HERE }T
867 \ ------------------------------------------------------------------------
870 : GE1 S" 123" ; IMMEDIATE
871 : GE2 S" 123 1+" ; IMMEDIATE
872 : GE3 S" : GE4 345 ;" ;
873 : GE5 EVALUATE ; IMMEDIATE
875 T{ GE1 EVALUATE -> 123 }T ( TEST EVALUATE IN INTERP. STATE )
876 T{ GE2 EVALUATE -> 124 }T
877 T{ GE3 EVALUATE -> }T
880 T{ : GE6 GE1 GE5 ; -> }T ( TEST EVALUATE IN COMPILE STATE )
882 T{ : GE7 GE2 GE5 ; -> }T
885 \ ------------------------------------------------------------------------
886 TESTING SOURCE >IN WORD
888 : GS1 S" SOURCE" 2DUP EVALUATE
889 >R SWAP >R = R> R> = ;
890 T{ GS1 -> <TRUE> <TRUE> }T
893 : RESCAN? -1 SCANS +! SCANS @ IF 0 >IN ! THEN ;
899 : GS2 5 SCANS ! S" 123 RESCAN?" EVALUATE ;
900 T{ GS2 -> 123 123 123 123 123 }T
902 : GS3 WORD COUNT SWAP C@ ;
903 T{ BL GS3 HELLO -> 5 CHAR H }T
904 T{ CHAR " GS3 GOODBYE" -> 7 CHAR G }T
906 DROP -> 0 }T \ BLANK LINE RETURN ZERO-LENGTH STRING
908 : GS4 SOURCE >IN ! DROP ;
912 \ ------------------------------------------------------------------------
913 TESTING <# # #S #> HOLD SIGN BASE >NUMBER HEX DECIMAL
915 : S= \ ( ADDR1 C1 ADDR2 C2 -- T/F ) COMPARE TWO STRINGS.
916 >R SWAP R@ = IF \ MAKE SURE STRINGS HAVE SAME LENGTH
917 R> ?DUP IF \ IF NON-EMPTY STRINGS
920 2DROP <FALSE> UNLOOP EXIT THEN
921 SWAP CHAR+ SWAP CHAR+
924 2DROP <TRUE> \ IF WE GET HERE, STRINGS MATCH
926 R> DROP 2DROP <FALSE> \ LENGTHS MISMATCH
929 : GP1 <# 41 HOLD 42 HOLD 0 0 #> S" BA" S= ;
932 : GP2 <# -1 SIGN 0 SIGN -1 SIGN 0 0 #> S" --" S= ;
935 : GP3 <# 1 0 # # #> S" 01" S= ;
938 : GP4 <# 1 0 #S #> S" 1" S= ;
941 24 CONSTANT MAX-BASE \ BASE 2 .. 36
943 0 0 INVERT BEGIN DUP WHILE >R 1+ R> 2* REPEAT DROP ;
944 COUNT-BITS 2* CONSTANT #BITS-UD \ NUMBER OF BITS IN UD
948 MAX-BASE 1+ 2 DO \ FOR EACH POSSIBLE BASE
949 I BASE ! \ TBD: ASSUMES BASE WORKS
950 I 0 <# #S #> S" 10" S= AND
957 MAX-UINT MAX-UINT <# #S #> \ MAXIMUM UD TO BINARY
958 R> BASE ! \ S: C-ADDR U
960 0 DO \ S: C-ADDR FLAG
961 OVER C@ [CHAR] 1 = AND \ ALL ONES
967 BASE @ >R MAX-BASE BASE !
971 1 = SWAP C@ I 30 + = AND AND
975 1 = SWAP C@ 41 I A - + = AND AND
983 : GN-STRING GN-BUF 1 ;
984 : GN-CONSUMED GN-BUF CHAR+ 0 ;
985 : GN' [CHAR] ' WORD CHAR+ C@ GN-BUF C! GN-STRING ;
987 T{ 0 0 GN' 0' >NUMBER -> 0 0 GN-CONSUMED }T
988 T{ 0 0 GN' 1' >NUMBER -> 1 0 GN-CONSUMED }T
989 T{ 1 0 GN' 1' >NUMBER -> BASE @ 1+ 0 GN-CONSUMED }T
990 \ FOLLOWING SHOULD FAIL TO CONVERT
991 T{ 0 0 GN' -' >NUMBER -> 0 0 GN-STRING }T
992 T{ 0 0 GN' +' >NUMBER -> 0 0 GN-STRING }T
993 T{ 0 0 GN' .' >NUMBER -> 0 0 GN-STRING }T
996 BASE @ >R BASE ! >NUMBER R> BASE ! ;
998 T{ 0 0 GN' 2' 10 >NUMBER-BASED -> 2 0 GN-CONSUMED }T
999 T{ 0 0 GN' 2' 2 >NUMBER-BASED -> 0 0 GN-STRING }T
1000 T{ 0 0 GN' F' 10 >NUMBER-BASED -> F 0 GN-CONSUMED }T
1001 T{ 0 0 GN' G' 10 >NUMBER-BASED -> 0 0 GN-STRING }T
1002 T{ 0 0 GN' G' MAX-BASE >NUMBER-BASED -> 10 0 GN-CONSUMED }T
1003 T{ 0 0 GN' Z' MAX-BASE >NUMBER-BASED -> 23 0 GN-CONSUMED }T
1005 : GN1 \ ( UD BASE -- UD' LEN )
1006 \ UD SHOULD EQUAL UD' AND LEN SHOULD BE ZERO.
1009 0 0 2SWAP >NUMBER SWAP DROP \ RETURN LENGTH ONLY
1011 T{ 0 0 2 GN1 -> 0 0 0 }T
1012 T{ MAX-UINT 0 2 GN1 -> MAX-UINT 0 0 }T
1013 T{ MAX-UINT DUP 2 GN1 -> MAX-UINT DUP 0 }T
1014 T{ 0 0 MAX-BASE GN1 -> 0 0 0 }T
1015 T{ MAX-UINT 0 MAX-BASE GN1 -> MAX-UINT 0 0 }T
1016 T{ MAX-UINT DUP MAX-BASE GN1 -> MAX-UINT DUP 0 }T
1018 : GN2 \ ( -- 16 10 )
1019 BASE @ >R HEX BASE @ DECIMAL BASE @ R> BASE ! ;
1022 \ ------------------------------------------------------------------------
1025 CREATE FBUF 00 C, 00 C, 00 C,
1026 CREATE SBUF 12 C, 34 C, 56 C,
1027 : SEEBUF FBUF C@ FBUF CHAR+ C@ FBUF CHAR+ CHAR+ C@ ;
1029 T{ FBUF 0 20 FILL -> }T
1030 T{ SEEBUF -> 00 00 00 }T
1032 T{ FBUF 1 20 FILL -> }T
1033 T{ SEEBUF -> 20 00 00 }T
1035 T{ FBUF 3 20 FILL -> }T
1036 T{ SEEBUF -> 20 20 20 }T
1038 T{ FBUF FBUF 3 CHARS MOVE -> }T \ BIZARRE SPECIAL CASE
1039 T{ SEEBUF -> 20 20 20 }T
1041 T{ SBUF FBUF 0 CHARS MOVE -> }T
1042 T{ SEEBUF -> 20 20 20 }T
1044 T{ SBUF FBUF 1 CHARS MOVE -> }T
1045 T{ SEEBUF -> 12 20 20 }T
1047 T{ SBUF FBUF 3 CHARS MOVE -> }T
1048 T{ SEEBUF -> 12 34 56 }T
1050 T{ FBUF FBUF CHAR+ 2 CHARS MOVE -> }T
1051 T{ SEEBUF -> 12 12 34 }T
1053 T{ FBUF CHAR+ FBUF 2 CHARS MOVE -> }T
1054 T{ SEEBUF -> 12 34 34 }T
1056 \ ------------------------------------------------------------------------
1057 TESTING OUTPUT: . ." CR EMIT SPACE SPACES TYPE U.
1060 ." YOU SHOULD SEE THE STANDARD GRAPHIC CHARACTERS:" CR
1061 41 BL DO I EMIT LOOP CR
1062 61 41 DO I EMIT LOOP CR
1063 7F 61 DO I EMIT LOOP CR
1064 ." YOU SHOULD SEE 0-9 SEPARATED BY A SPACE:" CR
1065 9 1+ 0 DO I . LOOP CR
1066 ." YOU SHOULD SEE 0-9 (WITH NO SPACES):" CR
1067 [CHAR] 9 1+ [CHAR] 0 DO I 0 SPACES EMIT LOOP CR
1068 ." YOU SHOULD SEE A-G SEPARATED BY A SPACE:" CR
1069 [CHAR] G 1+ [CHAR] A DO I EMIT SPACE LOOP CR
1070 ." YOU SHOULD SEE 0-5 SEPARATED BY TWO SPACES:" CR
1071 5 1+ 0 DO I [CHAR] 0 + EMIT 2 SPACES LOOP CR
1072 ." YOU SHOULD SEE TWO SEPARATE LINES:" CR
1073 S" LINE 1" TYPE CR S" LINE 2" TYPE CR
1074 ." YOU SHOULD SEE THE NUMBER RANGES OF SIGNED AND UNSIGNED NUMBERS:" CR
1075 ." SIGNED: " MIN-INT . MAX-INT . CR
1076 ." UNSIGNED: " 0 U. MAX-UINT U. CR
1079 T{ OUTPUT-TEST -> }T
1080 \ ------------------------------------------------------------------------
1081 TESTING INPUT: ACCEPT
1083 CREATE ABUF 80 CHARS ALLOT
1086 CR ." PLEASE TYPE UP TO 80 CHARACTERS: "
1087 ABUF 80 \ ACCEPT \ JMT
1088 ['] ACCEPT >BODY \ JMT: find default part of deferred ACCEPT
1089 EXECUTE \ JMT: execute ACCEPT
1090 CR ." RECEIVED: " [CHAR] " EMIT
1091 ABUF SWAP TYPE [CHAR] " EMIT CR
1094 T{ ACCEPT-TEST -> }T
1095 \ ZYXWVUTSRQPONMLKJIHGFEDCBAzyxwvutsrqponmlkjihgfedcba
1096 \ ------------------------------------------------------------------------
1097 TESTING DICTIONARY SEARCH RULES
1099 T{ : GDX 123 ; : GDX GDX 234 ; -> }T
1101 T{ GDX -> 123 234 }T
1103 \ ------------------------------------------------------------------------
1104 TESTING TO VALUE :NONAME IS DEFER
1106 [DEFINED] VALUE [IF]
1107 T{ 111 VALUE v1 -> }T
1108 T{ -999 VALUE v2 -> }T
1115 T{ : vd2 TO v2 ; -> }T
1122 [DEFINED] :NONAME [IF]
1124 [UNDEFINED] CASE [IF]
1125 \ https://forth-standard.org/standard/core/CASE
1126 : CASE 0 ; IMMEDIATE \ -- #of-1
1128 \ https://forth-standard.org/standard/core/OF
1129 : OF \ #of-1 -- orgOF #of
1131 >R \ move off the stack in case the control-flow stack is the data stack.
1132 POSTPONE OVER POSTPONE = \ copy and test case value
1133 POSTPONE IF \ add orig to control flow stack
1134 POSTPONE DROP \ discards case value if =
1135 R> \ we can bring count back now
1138 \ https://forth-standard.org/standard/core/ENDOF
1139 : ENDOF \ orgOF #of -- orgENDOF #of
1140 >R \ move off the stack in case the control-flow stack is the data stack.
1142 R> \ we can bring count back now
1145 \ https://forth-standard.org/standard/core/ENDCASE
1146 : ENDCASE \ orgENDOF1..orgENDOFn #of --
1156 T{ :NONAME 1234 ; nn1 ! -> }T
1157 T{ :NONAME 9876 ; nn2 ! -> }T
1158 T{ nn1 @ EXECUTE -> 1234 }T
1159 T{ nn2 @ EXECUTE -> 9876 }T
1161 T{ :NONAME ( n -- 0,1,..n ) DUP IF DUP >R 1- RECURSE R> THEN ;
1163 T{ 0 RN1 EXECUTE -> 0 }T
1164 T{ 4 RN1 EXECUTE -> 0 1 2 3 4 }T
1166 :NONAME ( n -- n1 ) \ Multiple RECURSEs in one definition
1168 CASE 0 OF EXIT ENDOF
1169 1 OF 11 SWAP RECURSE ENDOF
1170 2 OF 22 SWAP RECURSE ENDOF
1171 3 OF 33 SWAP RECURSE ENDOF
1172 DROP ABS RECURSE EXIT
1176 T{ 1 RN2 EXECUTE -> 0 }T
1177 T{ 2 RN2 EXECUTE -> 11 0 }T
1178 T{ 4 RN2 EXECUTE -> 33 22 11 0 }T
1179 T{ 25 RN2 EXECUTE -> 33 22 11 0 }T
1184 T{ DEFER defer5 -> }T
1185 T{ : is-defer5 IS defer5 ; -> }T
1186 T{ ' * IS defer5 -> }T
1187 T{ 2 3 defer5 -> 6 }T
1188 T{ ' + is-defer5 -> }T
1189 T{ 1 2 defer5 -> 3 }T
1192 \ ==============================================================================
1194 \ ==============================================================================
1195 \ Additional tests on the the ANS Forth Core word set
1196 \ ------------------------------------------------------------------------------
1197 \ https://raw.githubusercontent.com/gerryjackson/forth2012-test-suite/master/src/coreplustest.fth
1199 \ This program was written by Gerry Jackson in 2007, with contributions from
1200 \ others where indicated, and is in the public domain - it can be distributed
1201 \ and/or modified in any way but please retain this notice.
1203 \ This program is distributed in the hope that it will be useful,
1204 \ but WITHOUT ANY WARRANTY; without even the implied warranty of
1205 \ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
1207 \ The tests are not claimed to be comprehensive or correct
1209 \ ------------------------------------------------------------------------------
1210 \ The tests are based on John Hayes test program for the core word set
1212 \ This file provides some more tests on Core words where the original Hayes
1213 \ tests are thought to be incomplete
1215 \ Words tested in this file are:
1216 \ DO I +LOOP RECURSE ELSE >IN IMMEDIATE FIND IF...BEGIN...REPEAT ALLOT DOES>
1219 \ Number prefixes # $ % and 'A' character input
1221 \ ------------------------------------------------------------------------------
1222 \ Assumptions and dependencies:
1223 \ - tester.fr or ttester.fs has been loaded prior to this file
1224 \ - core.fr has been loaded so that constants <TRUE> MAX-INT, MIN-INT and
1225 \ MAX-UINT are defined
1226 \ ------------------------------------------------------------------------------
1230 TESTING DO +LOOP with run-time increment, negative increment, infinite loop
1231 \ Contributed by Reinhold Straub
1235 : GD7 ( LIMIT START INCREMENT -- )
1241 ITERATIONS @ 6 = IF LEAVE THEN
1246 T{ 4 4 -1 GD7 -> 4 1 }T
1247 T{ 1 4 -1 GD7 -> 4 3 2 1 4 }T
1248 T{ 4 1 -1 GD7 -> 1 0 -1 -2 -3 -4 6 }T
1249 T{ 4 1 0 GD7 -> 1 1 1 1 1 1 6 }T
1250 T{ 0 0 0 GD7 -> 0 0 0 0 0 0 6 }T
1251 T{ 1 4 0 GD7 -> 4 4 4 4 4 4 6 }T
1252 T{ 1 4 1 GD7 -> 4 5 6 7 8 9 6 }T
1253 T{ 4 1 1 GD7 -> 1 2 3 3 }T
1254 T{ 4 4 1 GD7 -> 4 5 6 7 8 9 6 }T
1255 T{ 2 -1 -1 GD7 -> -1 -2 -3 -4 -5 -6 6 }T
1256 T{ -1 2 -1 GD7 -> 2 1 0 -1 4 }T
1257 T{ 2 -1 0 GD7 -> -1 -1 -1 -1 -1 -1 6 }T
1258 T{ -1 2 0 GD7 -> 2 2 2 2 2 2 6 }T
1259 T{ -1 2 1 GD7 -> 2 3 4 5 6 7 6 }T
1260 T{ 2 -1 1 GD7 -> -1 0 1 3 }T
1261 T{ -20 30 -10 GD7 -> 30 20 10 0 -10 -20 6 }T
1262 T{ -20 31 -10 GD7 -> 31 21 11 1 -9 -19 6 }T
1263 T{ -20 29 -10 GD7 -> 29 19 9 -1 -11 5 }T
1265 \ ------------------------------------------------------------------------------
1266 TESTING DO +LOOP with large and small increments
1268 \ Contributed by Andrew Haley
1270 MAX-UINT 8 RSHIFT 1+ CONSTANT USTEP
1271 USTEP NEGATE CONSTANT -USTEP
1272 MAX-INT 7 RSHIFT 1+ CONSTANT STEP
1273 STEP NEGATE CONSTANT -STEP
1277 T{ : GD8 BUMP ! DO 1+ BUMP @ +LOOP ; -> }T
1279 T{ 0 MAX-UINT 0 USTEP GD8 -> 256 }T
1280 T{ 0 0 MAX-UINT -USTEP GD8 -> 256 }T
1282 T{ 0 MAX-INT MIN-INT STEP GD8 -> 256 }T
1283 T{ 0 MIN-INT MAX-INT -STEP GD8 -> 256 }T
1285 \ Two's complement arithmetic, wraps around modulo wordsize
1286 \ Only tested if the Forth system does wrap around, use of conditional
1287 \ compilation deliberately avoided
1289 MAX-INT 1+ MIN-INT = CONSTANT +WRAP?
1290 MIN-INT 1- MAX-INT = CONSTANT -WRAP?
1291 MAX-UINT 1+ 0= CONSTANT +UWRAP?
1292 0 1- MAX-UINT = CONSTANT -UWRAP?
1294 : GD9 ( n limit start step f result -- )
1295 >R IF GD8 ELSE 2DROP 2DROP R@ THEN -> R> }T
1298 T{ 0 0 0 USTEP +UWRAP? 256 GD9
1299 T{ 0 0 0 -USTEP -UWRAP? 1 GD9
1300 T{ 0 MIN-INT MAX-INT STEP +WRAP? 1 GD9
1301 T{ 0 MAX-INT MIN-INT -STEP -WRAP? 1 GD9
1303 \ ------------------------------------------------------------------------------
1304 TESTING DO +LOOP with maximum and minimum increments
1306 : (-MI) MAX-INT DUP NEGATE + 0= IF MAX-INT NEGATE ELSE -32767 THEN ;
1307 (-MI) CONSTANT -MAX-INT
1309 T{ 0 1 0 MAX-INT GD8 -> 1 }T
1310 T{ 0 -MAX-INT NEGATE -MAX-INT OVER GD8 -> 2 }T
1312 T{ 0 MAX-INT 0 MAX-INT GD8 -> 1 }T
1313 T{ 0 MAX-INT 1 MAX-INT GD8 -> 1 }T
1314 T{ 0 MAX-INT -1 MAX-INT GD8 -> 2 }T
1315 T{ 0 MAX-INT DUP 1- MAX-INT GD8 -> 1 }T
1317 T{ 0 MIN-INT 1+ 0 MIN-INT GD8 -> 1 }T
1318 T{ 0 MIN-INT 1+ -1 MIN-INT GD8 -> 1 }T
1319 T{ 0 MIN-INT 1+ 1 MIN-INT GD8 -> 2 }T
1320 T{ 0 MIN-INT 1+ DUP MIN-INT GD8 -> 1 }T
1322 \ ------------------------------------------------------------------------------
1323 \ TESTING +LOOP setting I to an arbitrary value
1325 \ The specification for +LOOP permits the loop index I to be set to any value
1326 \ including a value outside the range given to the corresponding DO.
1328 \ SET-I is a helper to set I in a DO ... +LOOP to a given value
1329 \ n2 is the value of I in a DO ... +LOOP
1330 \ n3 is a test value
1331 \ If n2=n3 then return n1-n2 else return 1
1332 : SET-I ( n1 n2 n3 -- n1-n2 | 1 )
1333 OVER = IF - ELSE 2DROP 1 THEN
1336 : -SET-I ( n1 n2 n3 -- n1-n2 | -1 )
1337 SET-I DUP 1 = IF NEGATE THEN
1340 : PL1 20 1 DO I 18 I 3 SET-I +LOOP ;
1341 T{ PL1 -> 1 2 3 18 19 }T
1342 : PL2 20 1 DO I 20 I 2 SET-I +LOOP ;
1344 : PL3 20 5 DO I 19 I 2 SET-I DUP 1 = IF DROP 0 I 6 SET-I THEN +LOOP ;
1345 T{ PL3 -> 5 6 0 1 2 19 }T
1346 : PL4 20 1 DO I MAX-INT I 4 SET-I +LOOP ;
1347 T{ PL4 -> 1 2 3 4 }T
1348 : PL5 -20 -1 DO I -19 I -3 -SET-I +LOOP ;
1349 T{ PL5 -> -1 -2 -3 -19 -20 }T
1350 : PL6 -20 -1 DO I -21 I -4 -SET-I +LOOP ;
1351 T{ PL6 -> -1 -2 -3 -4 }T
1352 : PL7 -20 -1 DO I MIN-INT I -5 -SET-I +LOOP ;
1353 T{ PL7 -> -1 -2 -3 -4 -5 }T
1354 : PL8 -20 -5 DO I -20 I -2 -SET-I DUP -1 = IF DROP 0 I -6 -SET-I THEN +LOOP ;
1355 T{ PL8 -> -5 -6 0 -1 -2 -20 }T
1357 \ ------------------------------------------------------------------------------
1358 TESTING multiple RECURSEs in one colon definition
1360 : ACK ( m n -- u ) \ Ackermann function, from Rosetta Code
1361 OVER 0= IF NIP 1+ EXIT THEN \ ack(0, n) = n+1
1362 SWAP 1- SWAP ( -- m-1 n )
1363 DUP 0= IF 1+ RECURSE EXIT THEN \ ack(m, 0) = ack(m-1, 1)
1364 1- OVER 1+ SWAP RECURSE RECURSE \ ack(m, n) = ack(m-1, ack(m,n-1))
1371 \ ------------------------------------------------------------------------------
1372 TESTING multiple ELSE's in an IF statement
1373 \ Discussed on comp.lang.forth and accepted as valid ANS Forth
1375 : MELSE IF 1 ELSE 2 ELSE 3 ELSE 4 ELSE 5 THEN ;
1376 T{ 0 MELSE -> 2 4 }T
1377 T{ -1 MELSE -> 1 3 5 }T
1379 \ ------------------------------------------------------------------------------
1380 TESTING manipulation of >IN in interpreter mode
1382 T{ 12345 DEPTH OVER 9 < 34 AND + 3 + >IN ! -> 12345 2345 345 45 5 }T
1383 T{ 14145 8115 ?DUP 0= 34 AND >IN +! TUCK MOD 14 >IN ! GCD CALCULATION -> 15 }T
1385 \ ------------------------------------------------------------------------------
1386 TESTING IMMEDIATE with CONSTANT VARIABLE and CREATE [ ... DOES> ]
1388 T{ 123 CONSTANT IW1 IMMEDIATE IW1 -> 123 }T
1389 T{ : IW2 IW1 LITERAL ; IW2 -> 123 }T
1390 T{ VARIABLE IW3 IMMEDIATE 234 IW3 ! IW3 @ -> 234 }T
1391 T{ : IW4 IW3 [ @ ] LITERAL ; IW4 -> 234 }T
1392 \ T{ :NONAME [ 345 ] IW3 [ ! ] ; DROP IW3 @ -> 345 }T
1393 T{ CREATE IW5 456 , IMMEDIATE -> }T
1394 \ T{ :NONAME IW5 [ @ IW3 ! ] ; DROP IW3 @ -> 456 }T
1395 T{ : IW6 CREATE , IMMEDIATE DOES> @ 1+ ; -> }T
1396 T{ 111 IW6 IW7 IW7 -> 112 }T
1397 T{ : IW8 IW7 LITERAL 1+ ; IW8 -> 113 }T
1398 T{ : IW9 CREATE , DOES> @ 2 + IMMEDIATE ; -> }T
1399 : FIND-IW BL WORD FIND NIP ; ( -- 0 | 1 | -1 )
1400 T{ 222 IW9 IW10 FIND-IW IW10 -> -1 }T \ IW10 is not immediate
1401 T{ IW10 FIND-IW IW10 -> 224 1 }T \ IW10 becomes immediate
1403 [DEFINED] :NONAME [IF]
1404 T{ :NONAME [ 345 ] IW3 [ ! ] ; DROP IW3 @ -> 345 }T
1405 T{ :NONAME IW5 [ @ IW3 ! ] ; DROP IW3 @ -> 456 }T
1408 \ ------------------------------------------------------------------------------
1409 TESTING that IMMEDIATE doesn't toggle a flag
1411 VARIABLE IT1 0 IT1 !
1412 : IT2 1234 IT1 ! ; IMMEDIATE IMMEDIATE
1413 T{ : IT3 IT2 ; IT1 @ -> 1234 }T
1415 \ ------------------------------------------------------------------------------
1416 TESTING parsing behaviour of S" ." and (
1417 \ which should parse to just beyond the terminating character no space needed
1419 T{ : GC5 S" A string"2DROP ; GC5 -> }T
1420 T{ ( A comment)1234 -> 1234 }T
1421 T{ : PB1 CR ." You should see 2345: "." 2345"( A comment) CR ; PB1 -> }T
1423 \ ------------------------------------------------------------------------------
1424 TESTING number prefixes # $ % and 'c' character input
1425 \ Adapted from the Forth 200X Draft 14.5 document
1428 DECIMAL BASE @ OLD-BASE !
1430 T{ #-1289 -> -1289 }T
1432 T{ $-12eF -> -4847 }T
1433 T{ %10010110 -> 150 }T
1434 T{ %-10010110 -> -150 }T
1437 \ Check BASE is unchanged
1438 T{ BASE @ OLD-BASE @ = -> <TRUE> }T
1440 \ Repeat in Hex mode
1441 16 OLD-BASE ! 16 BASE !
1443 T{ #-1289 -> -509 }T
1445 T{ $-12eF -> -12EF }T
1446 T{ %10010110 -> 96 }T
1447 T{ %-10010110 -> -96 }T
1450 \ Check BASE is unchanged
1451 T{ BASE @ OLD-BASE @ = -> <TRUE> }T \ 2
1454 \ Check number prefixes in compile mode
1455 T{ : nmp #8327 $-2cbe %011010111 ''' ; nmp -> 8327 -11454 215 39 }T
1457 \ ------------------------------------------------------------------------------
1458 TESTING definition names
1459 \ should support {1..31} graphical characters
1460 : !"#$%&'()*+,-./0123456789:;<=>? 1 ;
1461 T{ !"#$%&'()*+,-./0123456789:;<=>? -> 1 }T
1462 : @ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ 2 ;
1463 T{ @ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ -> 2 }T
1464 : _`abcdefghijklmnopqrstuvwxyz{|} 3 ;
1465 T{ _`abcdefghijklmnopqrstuvwxyz{|} -> 3 }T
1466 : _`abcdefghijklmnopqrstuvwxyz{|~ 4 ; \ Last character different
1467 T{ _`abcdefghijklmnopqrstuvwxyz{|~ -> 4 }T
1468 T{ _`abcdefghijklmnopqrstuvwxyz{|} -> 3 }T
1470 \ ------------------------------------------------------------------------------
1471 TESTING FIND with a zero length string and a non-existent word
1473 CREATE EMPTYSTRING 0 C,
1474 : EMPTYSTRING-FIND-CHECK ( c-addr 0 | xt 1 | xt -1 -- t|f )
1475 DUP IF ." FIND returns a TRUE value for an empty string!" CR THEN
1476 0= SWAP EMPTYSTRING = = ;
1477 T{ EMPTYSTRING FIND EMPTYSTRING-FIND-CHECK -> <TRUE> }T
1479 CREATE NON-EXISTENT-WORD \ Same as in exceptiontest.fth
1480 15 C, CHAR $ C, CHAR $ C, CHAR Q C, CHAR W C, CHAR E C, CHAR Q C,
1481 CHAR W C, CHAR E C, CHAR Q C, CHAR W C, CHAR E C, CHAR R C, CHAR T C,
1483 T{ NON-EXISTENT-WORD FIND -> NON-EXISTENT-WORD 0 }T
1485 \ ------------------------------------------------------------------------------
1486 TESTING IF ... BEGIN ... REPEAT (unstructured)
1488 T{ : UNS1 DUP 0 > IF 9 SWAP BEGIN 1+ DUP 3 > IF EXIT THEN REPEAT ; -> }T
1492 \ ------------------------------------------------------------------------------
1493 TESTING DOES> doesn't cause a problem with a CREATEd address
1495 : MAKE-2CONST DOES> 2@ ;
1496 T{ CREATE 2K 3 , 2K , MAKE-2CONST 2K -> ' 2K >BODY 3 }T
1498 \ ------------------------------------------------------------------------------
1499 TESTING ALLOT ( n -- ) where n <= 0
1501 T{ HERE 5 ALLOT -5 ALLOT HERE = -> <TRUE> }T
1502 T{ HERE 0 ALLOT HERE = -> <TRUE> }T
1504 \ -----------------------------------------------------------------------------
1505 TESTING MARKER (contributed by James Bowman)
1507 [DEFINED] MARKER [IF]
1509 [UNDEFINED] 0<> [IF]
1512 0<> IF MOV #-1,R14 THEN
1517 T{ : MA? BL WORD FIND NIP 0<> ; -> }T
1519 T{ : MA1 111 ; -> }T
1521 T{ : MA1 222 ; -> }T
1522 T{ MA? MA0 MA? MA1 MA? MA2 -> TRUE TRUE TRUE }T
1523 T{ MA1 MA2 MA1 -> 222 111 }T
1524 T{ MA? MA0 MA? MA1 MA? MA2 -> TRUE TRUE FALSE }T
1526 T{ MA? MA0 MA? MA1 MA? MA2 -> FALSE FALSE FALSE }T
1531 CR .( End of Core word set tests)