\ planckforth - \ Copyright (C) 2021 nineties \ test/tester.fs and test codes are base on \ https://github.com/gerryjackson/forth2012-test-suite testing core words hex \ ------------------------------------------------------------------------ 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 0 constant 1 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* skip T{ 0 s>d -> 0 0 }T skip T{ 1 s>d -> 1 0 }T skip T{ 2 s>d -> 2 0 }T skip T{ -1 s>d -> -1 -1 }T skip T{ -2 s>d -> -2 -1 }T skip T{ min-int s>d -> min-int -1 }T skip T{ max-int s>d -> max-int 0 }T skip T{ 0 0 m* -> 0 s>d }T skip T{ 0 1 m* -> 0 s>d }T skip T{ 1 0 m* -> 0 s>d }T skip T{ 1 2 m* -> 2 s>d }T skip T{ 2 1 m* -> 2 s>d }T skip T{ 3 3 m* -> 9 s>d }T skip T{ -3 3 m* -> -9 s>d }T skip T{ 3 -3 m* -> -9 s>d }T skip T{ -3 -3 m* -> 9 s>d }T skip T{ 0 min-int m* -> 0 s>d }T skip T{ 1 min-int m* -> min-int s>d }T skip T{ 2 min-int m* -> 0 1s }T skip T{ 0 max-int m* -> 0 s>d }T skip T{ 1 max-int m* -> max-int s>d }T skip T{ 2 max-int m* -> max-int 1 lshift 0 }T skip T{ min-int min-int m* -> 0 msb 1 rshift }T skip T{ max-int min-int m* -> msb msb 2/ }T skip 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 skip T{ 0 0 um* -> 0 0 }T skip T{ 0 1 um* -> 0 0 }T skip T{ 1 0 um* -> 0 0 }T skip T{ 1 2 um* -> 2 0 }T skip T{ 2 1 um* -> 2 0 }T skip T{ 3 3 um* -> 9 0 }T skip T{ mid-uint+1 1 rshift 2 um* -> mid-uint+1 0 }T skip T{ mid-uint+1 2 um* -> 0 1 }T skip T{ mid-uint+1 4 um* -> 0 2 }T skip T{ 1s 2 um* -> 1s 1 lshift 1 }T skip T{ max-uint max-uint um* -> 1 1 invert }T \ ------------------------------------------------------------------------ \ testing divide: fm/mod sm/rem um/mod */ */mod / /mod mod skip T{ 0 s>d 1 fm/mod -> 0 0 }T skip T{ 1 s>d 1 fm/mod -> 0 1 }T skip T{ 2 s>d 1 fm/mod -> 0 2 }T skip T{ -1 s>d 1 fm/mod -> 0 -1 }T skip T{ -2 s>d 1 fm/mod -> 0 -2 }T skip T{ 0 s>d -1 fm/mod -> 0 0 }T skip T{ 1 s>d -1 fm/mod -> 0 -1 }T skip T{ 2 s>d -1 fm/mod -> 0 -2 }T skip T{ -1 s>d -1 fm/mod -> 0 1 }T skip T{ -2 s>d -1 fm/mod -> 0 2 }T skip T{ 2 s>d 2 fm/mod -> 0 1 }T skip T{ -1 s>d -1 fm/mod -> 0 1 }T skip T{ -2 s>d -2 fm/mod -> 0 1 }T skip T{ 7 s>d 3 fm/mod -> 1 2 }T skip T{ 7 s>d -3 fm/mod -> -2 -3 }T skip T{ -7 s>d 3 fm/mod -> 2 -3 }T skip T{ -7 s>d -3 fm/mod -> -1 2 }T skip T{ max-int s>d 1 fm/mod -> 0 max-int }T skip T{ min-int s>d 1 fm/mod -> 0 min-int }T skip T{ max-int s>d max-int fm/mod -> 0 1 }T skip T{ min-int s>d min-int fm/mod -> 0 1 }T skip T{ 1s 1 4 fm/mod -> 3 max-int }T skip T{ 1 min-int m* 1 fm/mod -> 0 min-int }T skip T{ 1 min-int m* min-int fm/mod -> 0 1 }T skip T{ 2 min-int m* 2 fm/mod -> 0 min-int }T skip T{ 2 min-int m* min-int fm/mod -> 0 2 }T skip T{ 1 max-int m* 1 fm/mod -> 0 max-int }T skip T{ 1 max-int m* max-int fm/mod -> 0 1 }T skip T{ 2 max-int m* 2 fm/mod -> 0 max-int }T skip T{ 2 max-int m* max-int fm/mod -> 0 2 }T skip T{ min-int min-int m* min-int fm/mod -> 0 min-int }T skip T{ min-int max-int m* min-int fm/mod -> 0 max-int }T skip T{ min-int max-int m* max-int fm/mod -> 0 min-int }T skip T{ max-int max-int m* max-int fm/mod -> 0 max-int }T skip T{ 0 s>d 1 sm/rem -> 0 0 }T skip T{ 1 s>d 1 sm/rem -> 0 1 }T skip T{ 2 s>d 1 sm/rem -> 0 2 }T skip T{ -1 s>d 1 sm/rem -> 0 -1 }T skip T{ -2 s>d 1 sm/rem -> 0 -2 }T skip T{ 0 s>d -1 sm/rem -> 0 0 }T skip T{ 1 s>d -1 sm/rem -> 0 -1 }T skip T{ 2 s>d -1 sm/rem -> 0 -2 }T skip T{ -1 s>d -1 sm/rem -> 0 1 }T skip T{ -2 s>d -1 sm/rem -> 0 2 }T skip T{ 2 s>d 2 sm/rem -> 0 1 }T skip T{ -1 s>d -1 sm/rem -> 0 1 }T skip T{ -2 s>d -2 sm/rem -> 0 1 }T skip T{ 7 s>d 3 sm/rem -> 1 2 }T skip T{ 7 s>d -3 sm/rem -> 1 -2 }T skip T{ -7 s>d 3 sm/rem -> -1 -2 }T skip T{ -7 s>d -3 sm/rem -> -1 2 }T skip T{ max-int s>d 1 sm/rem -> 0 max-int }T skip T{ min-int s>d 1 sm/rem -> 0 min-int }T skip T{ max-int s>d max-int sm/rem -> 0 1 }T skip T{ min-int s>d min-int sm/rem -> 0 1 }T skip T{ 1s 1 4 sm/rem -> 3 max-int }T skip T{ 2 min-int m* 2 sm/rem -> 0 min-int }T skip T{ 2 min-int m* min-int sm/rem -> 0 2 }T skip T{ 2 max-int m* 2 sm/rem -> 0 max-int }T skip T{ 2 max-int m* max-int sm/rem -> 0 2 }T skip T{ min-int min-int m* min-int sm/rem -> 0 min-int }T skip T{ min-int max-int m* min-int sm/rem -> 0 max-int }T skip T{ min-int max-int m* max-int sm/rem -> 0 min-int }T skip T{ max-int max-int m* max-int sm/rem -> 0 max-int }T skip T{ 0 0 1 um/mod -> 0 0 }T skip T{ 1 0 1 um/mod -> 0 1 }T skip T{ 1 0 2 um/mod -> 1 0 }T skip T{ 3 0 2 um/mod -> 1 1 }T skip T{ max-uint 2 um* 2 um/mod -> 0 max-uint }T skip T{ max-uint 2 um* max-uint um/mod -> 0 2 }T skip 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. skip iffloored : t/mod >r s>d r> fm/mod ; skip iffloored : t/ t/mod swap drop ; skip iffloored : tmod t/mod drop ; skip iffloored : t*/mod >r m* r> fm/mod ; skip iffloored : t*/ t*/mod swap drop ; skip ifsym : t/mod >r s>d r> sm/rem ; skip ifsym : t/ t/mod swap drop ; skip ifsym : tmod t/mod drop ; skip ifsym : t*/mod >r m* r> sm/rem ; skip ifsym : t*/ t*/mod swap drop ; skip T{ 0 1 /mod -> 0 1 t/mod }T skip T{ 1 1 /mod -> 1 1 t/mod }T skip T{ 2 1 /mod -> 2 1 t/mod }T skip T{ -1 1 /mod -> -1 1 t/mod }T skip T{ -2 1 /mod -> -2 1 t/mod }T skip T{ 0 -1 /mod -> 0 -1 t/mod }T skip T{ 1 -1 /mod -> 1 -1 t/mod }T skip T{ 2 -1 /mod -> 2 -1 t/mod }T skip T{ -1 -1 /mod -> -1 -1 t/mod }T skip T{ -2 -1 /mod -> -2 -1 t/mod }T skip T{ 2 2 /mod -> 2 2 t/mod }T skip T{ -1 -1 /mod -> -1 -1 t/mod }T skip T{ -2 -2 /mod -> -2 -2 t/mod }T skip T{ 7 3 /mod -> 7 3 t/mod }T skip T{ 7 -3 /mod -> 7 -3 t/mod }T skip T{ -7 3 /mod -> -7 3 t/mod }T skip T{ -7 -3 /mod -> -7 -3 t/mod }T skip T{ max-int 1 /mod -> max-int 1 t/mod }T skip T{ min-int 1 /mod -> min-int 1 t/mod }T skip T{ max-int max-int /mod -> max-int max-int t/mod }T skip T{ min-int min-int /mod -> min-int min-int t/mod }T skip T{ 0 1 / -> 0 1 t/ }T skip T{ 1 1 / -> 1 1 t/ }T skip T{ 2 1 / -> 2 1 t/ }T skip T{ -1 1 / -> -1 1 t/ }T skip T{ -2 1 / -> -2 1 t/ }T skip T{ 0 -1 / -> 0 -1 t/ }T skip T{ 1 -1 / -> 1 -1 t/ }T skip T{ 2 -1 / -> 2 -1 t/ }T skip T{ -1 -1 / -> -1 -1 t/ }T skip T{ -2 -1 / -> -2 -1 t/ }T skip T{ 2 2 / -> 2 2 t/ }T skip T{ -1 -1 / -> -1 -1 t/ }T skip T{ -2 -2 / -> -2 -2 t/ }T skip T{ 7 3 / -> 7 3 t/ }T skip T{ 7 -3 / -> 7 -3 t/ }T skip T{ -7 3 / -> -7 3 t/ }T skip T{ -7 -3 / -> -7 -3 t/ }T skip T{ max-int 1 / -> max-int 1 t/ }T skip T{ min-int 1 / -> min-int 1 t/ }T skip T{ max-int max-int / -> max-int max-int t/ }T skip T{ min-int min-int / -> min-int min-int t/ }T skip T{ 0 1 mod -> 0 1 tmod }T skip T{ 1 1 mod -> 1 1 tmod }T skip T{ 2 1 mod -> 2 1 tmod }T skip T{ -1 1 mod -> -1 1 tmod }T skip T{ -2 1 mod -> -2 1 tmod }T skip T{ 0 -1 mod -> 0 -1 tmod }T skip T{ 1 -1 mod -> 1 -1 tmod }T skip T{ 2 -1 mod -> 2 -1 tmod }T skip T{ -1 -1 mod -> -1 -1 tmod }T skip T{ -2 -1 mod -> -2 -1 tmod }T skip T{ 2 2 mod -> 2 2 tmod }T skip T{ -1 -1 mod -> -1 -1 tmod }T skip T{ -2 -2 mod -> -2 -2 tmod }T skip T{ 7 3 mod -> 7 3 tmod }T skip T{ 7 -3 mod -> 7 -3 tmod }T skip T{ -7 3 mod -> -7 3 tmod }T skip T{ -7 -3 mod -> -7 -3 tmod }T skip T{ max-int 1 mod -> max-int 1 tmod }T skip T{ min-int 1 mod -> min-int 1 tmod }T skip T{ max-int max-int mod -> max-int max-int tmod }T skip T{ min-int min-int mod -> min-int min-int tmod }T skip T{ 0 2 1 */ -> 0 2 1 t*/ }T skip T{ 1 2 1 */ -> 1 2 1 t*/ }T skip T{ 2 2 1 */ -> 2 2 1 t*/ }T skip T{ -1 2 1 */ -> -1 2 1 t*/ }T skip T{ -2 2 1 */ -> -2 2 1 t*/ }T skip T{ 0 2 -1 */ -> 0 2 -1 t*/ }T skip T{ 1 2 -1 */ -> 1 2 -1 t*/ }T skip T{ 2 2 -1 */ -> 2 2 -1 t*/ }T skip T{ -1 2 -1 */ -> -1 2 -1 t*/ }T skip T{ -2 2 -1 */ -> -2 2 -1 t*/ }T skip T{ 2 2 2 */ -> 2 2 2 t*/ }T skip T{ -1 2 -1 */ -> -1 2 -1 t*/ }T skip T{ -2 2 -2 */ -> -2 2 -2 t*/ }T skip T{ 7 2 3 */ -> 7 2 3 t*/ }T skip T{ 7 2 -3 */ -> 7 2 -3 t*/ }T skip T{ -7 2 3 */ -> -7 2 3 t*/ }T skip T{ -7 2 -3 */ -> -7 2 -3 t*/ }T skip T{ max-int 2 max-int */ -> max-int 2 max-int t*/ }T skip T{ min-int 2 min-int */ -> min-int 2 min-int t*/ }T skip T{ 0 2 1 */mod -> 0 2 1 t*/mod }T skip T{ 1 2 1 */mod -> 1 2 1 t*/mod }T skip T{ 2 2 1 */mod -> 2 2 1 t*/mod }T skip T{ -1 2 1 */mod -> -1 2 1 t*/mod }T skip T{ -2 2 1 */mod -> -2 2 1 t*/mod }T skip T{ 0 2 -1 */mod -> 0 2 -1 t*/mod }T skip T{ 1 2 -1 */mod -> 1 2 -1 t*/mod }T skip T{ 2 2 -1 */mod -> 2 2 -1 t*/mod }T skip T{ -1 2 -1 */mod -> -1 2 -1 t*/mod }T skip T{ -2 2 -1 */mod -> -2 2 -1 t*/mod }T skip T{ 2 2 2 */mod -> 2 2 2 t*/mod }T skip T{ -1 2 -1 */mod -> -1 2 -1 t*/mod }T skip T{ -2 2 -2 */mod -> -2 2 -2 t*/mod }T skip T{ 7 2 3 */mod -> 7 2 3 t*/mod }T skip T{ 7 2 -3 */mod -> 7 2 -3 t*/mod }T skip T{ -7 2 3 */mod -> -7 2 3 t*/mod }T skip T{ -7 2 -3 */mod -> -7 2 -3 t*/mod }T skip T{ max-int 2 max-int */mod -> max-int 2 max-int t*/mod }T skip 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 skip T{ 1st 2@ -> 6 5 }T skip T{ 2 1 1st 2! -> }T skip 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 skip 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 skip 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{ '\n' -> 0xa }T T{ '\0' -> 0 }T T{ 'a' -> 61 }T T{ '"' -> 22 }T T{ '\"' -> 22 }T T{ '\'' -> 27 }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 strlen -> 2 }T T{ gc4 dup c@ swap char+ c@ -> 58 59 }T skip T{ gc4 swap drop -> 2 }T skip 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 char g c, char t c, char 1 c, 0 c, constant gt1string here char g c, char t c, char 2 c, 0 c, constant gt2string skip here 3 c, char g c, char t c, char 1 c, constant gt1string skip here 3 c, char g c, char t c, char 2 c, constant gt2string T{ gt1string find >cfa -> ' gt1 }T T{ gt2string find >cfa -> ' gt2 }T ( how to search for non-existent word? ) T{ : gt3 gt2 literal ; -> }T T{ gt3 -> ' gt1 }T skip T{ gt1string count -> gt1string char+ 3 }T skip T{ : gt4 postpone gt1 ; immediate -> }T skip T{ : gt5 gt4 ; -> }T skip T{ gt5 -> 123 }T skip T{ : gt6 345 ; immediate -> }T skip T{ : gt7 postpone gt6 ; -> }T skip 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},{0 0}{1 0}{1 1},{0 0}{1 0}{1 1}{2 0}{2 1}{2 2} ) 0 swap 0 do i 1+ 0 do i j + 3 = if i unloop i unloop exit then 1+ loop loop ; -> }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 skip T{ : nop : postpone ; ; -> }T skip T{ nop nop1 nop nop2 -> }T skip T{ nop1 -> }T skip 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 skip T{ ge1 evaluate -> 123 }T ( test evaluate in interp. state ) skip T{ ge2 evaluate -> 124 }T skip T{ ge3 evaluate -> }T skip T{ ge4 -> 345 }T skip T{ : ge6 ge1 ge5 ; -> }T ( test evaluate in compile state ) skip T{ ge6 -> 123 }T skip T{ : ge7 ge2 ge5 ; -> }T skip T{ ge7 -> 124 }T \ ------------------------------------------------------------------------ testing source >in word \ : gs1 s" source" 2dup evaluate \ >r swap >r = r> r> = ; skip 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 ; skip T{ gs2 -> 123 123 123 123 123 }T \ : gs3 word count swap c@ ; skip T{ bl gs3 hello -> 5 char h }T skip T{ char " gs3 goodbye" -> 7 char g }T skip T{ bl gs3 drop -> 0 }T \ blank line return zero-length string \ : gs4 source >in ! drop ; \ T{ gs4 123 456 \ -> }T testing sourcefilename T{ sourcefilename s" test/core.fs" streq -> }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= ; skip T{ gp1 -> }T \ : gp2 <# -1 sign 0 sign -1 sign 0 0 #> s" --" s= ; skip T{ gp2 -> }T \ : gp3 <# 1 0 # # #> s" 01" s= ; skip T{ gp3 -> }T \ : gp4 <# 1 0 #s #> s" 1" s= ; skip 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 ! ; skip 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 ; skip 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 ! ; skip 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 ; skip T{ 0 0 gn' 0' >number -> 0 0 gn-consumed }T skip T{ 0 0 gn' 1' >number -> 1 0 gn-consumed }T skip T{ 1 0 gn' 1' >number -> base @ 1+ 0 gn-consumed }T skip T{ 0 0 gn' -' >number -> 0 0 gn-string }T \ should fail to convert these skip T{ 0 0 gn' +' >number -> 0 0 gn-string }T skip T{ 0 0 gn' .' >number -> 0 0 gn-string }T \ : >number-based \ base @ >r base ! >number r> base ! ; skip T{ 0 0 gn' 2' 10 >number-based -> 2 0 gn-consumed }T skip T{ 0 0 gn' 2' 2 >number-based -> 0 0 gn-string }T skip T{ 0 0 gn' f' 10 >number-based -> f 0 gn-consumed }T skip T{ 0 0 gn' g' 10 >number-based -> 0 0 gn-string }T skip T{ 0 0 gn' g' max-base >number-based -> 10 0 gn-consumed }T skip 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 ! ; skip T{ 0 0 2 gn1 -> 0 0 0 }T skip T{ max-uint 0 2 gn1 -> max-uint 0 0 }T skip T{ max-uint dup 2 gn1 -> max-uint dup 0 }T skip T{ 0 0 max-base gn1 -> 0 0 0 }T skip T{ max-uint 0 max-base gn1 -> max-uint 0 0 }T skip T{ max-uint dup max-base gn1 -> max-uint dup 0 }T \ : gn2 \ ( -- 16 10 ) \ base @ >r hex base @ decimal base @ r> base ! ; skip 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@ ; skip T{ fbuf 0 20 fill -> }T skip T{ seebuf -> 00 00 00 }T skip T{ fbuf 1 20 fill -> }T skip T{ seebuf -> 20 00 00 }T skip T{ fbuf 3 20 fill -> }T skip T{ seebuf -> 20 20 20 }T skip T{ fbuf fbuf 3 chars move -> }T \ bizarre special case skip T{ seebuf -> 20 20 20 }T skip T{ sbuf fbuf 0 chars move -> }T skip T{ seebuf -> 20 20 20 }T skip T{ sbuf fbuf 1 chars move -> }T skip T{ seebuf -> 12 20 20 }T skip T{ sbuf fbuf 3 chars move -> }T skip T{ seebuf -> 12 34 56 }T skip T{ fbuf fbuf char+ 2 chars move -> }T skip T{ seebuf -> 12 12 34 }T skip T{ fbuf char+ fbuf 2 chars move -> }T skip T{ seebuf -> 12 34 34 }T \ ------------------------------------------------------------------------ testing output: . ." cr emit space spaces type u. : output-test cr ." 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 50 chars allot \ : accept-test \ cr ." please type up to 80 characters:" cr \ abuf 50 accept \ cr ." received: " [char] " emit \ abuf swap type [char] " emit cr \ ; skip T{ accept-test -> }T \ ------------------------------------------------------------------------ testing dictionary search rules T{ : gdx 123 ; : gdx gdx 234 ; -> }T T{ gdx -> 123 234 }T cr ." End of Core word set tests" cr \ ------------------------------------------------------------------------ testing cons, car and cdr 0 1 cons constant cons0 T{ cons0 car -> 0 }T T{ cons0 cdr -> 1 }T cons0 free \ ------------------------------------------------------------------------ testing enum T{ 0 enum e0 enum e1 enum e2 drop -> }T T{ e0 -> 0 }T T{ e1 -> 1 }T T{ e2 -> 2 }T