/Applications/util/fforth_tests.fth

https://github.com/EtchedPixels/FUZIX · Forth · 1055 lines · 898 code · 150 blank · 7 comment · 0 complexity · 1f40e0c02fcbded54602c9de63db9d55 MD5 · raw file

  1. \ From: John Hayes S1I
  2. \ Subject: tester.fr
  3. \ Date: Mon, 27 Nov 95 13:10:09 PST
  4. \ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
  5. \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
  6. \ VERSION 1.1
  7. HEX
  8. \ COMMENT WITH PRECEDING SPACE
  9. \ SET THE FOLLOWING FLAG TO TRUE FOR MORE VERBOSE OUTPUT; THIS MAY
  10. \ ALLOW YOU TO TELL WHICH TEST CAUSED YOUR SYSTEM TO HANG.
  11. VARIABLE VERBOSE
  12. TRUE VERBOSE !
  13. : EMPTY-STACK \ ( ... -- ) EMPTY STACK: HANDLES UNDERFLOWED STACK TOO.
  14. DEPTH ?DUP IF DUP 0< IF NEGATE 0 DO 0 LOOP ELSE 0 DO DROP LOOP THEN THEN ;
  15. : ERROR \ ( C-ADDR U -- ) DISPLAY AN ERROR MESSAGE FOLLOWED BY
  16. \ THE LINE THAT HAD THE ERROR.
  17. TYPE SOURCE TYPE CR \ DISPLAY LINE CORRESPONDING TO ERROR
  18. EMPTY-STACK \ THROW AWAY EVERY THING ELSE
  19. ;
  20. VARIABLE ACTUAL-DEPTH \ STACK RECORD
  21. CREATE ACTUAL-RESULTS 20 CELLS ALLOT
  22. : { \ ( -- ) SYNTACTIC SUGAR.
  23. ;
  24. : -> \ ( ... -- ) RECORD DEPTH AND CONTENT OF STACK.
  25. DEPTH DUP ACTUAL-DEPTH ! \ RECORD DEPTH
  26. ?DUP IF \ IF THERE IS SOMETHING ON STACK
  27. 0 DO ACTUAL-RESULTS I CELLS + ! LOOP \ SAVE THEM
  28. THEN ;
  29. : } \ ( ... -- ) COMPARE STACK (EXPECTED) CONTENTS WITH SAVED
  30. \ (ACTUAL) CONTENTS.
  31. DEPTH ACTUAL-DEPTH @ = IF \ IF DEPTHS MATCH
  32. DEPTH ?DUP IF \ IF THERE IS SOMETHING ON THE STACK
  33. 0 DO \ FOR EACH STACK ITEM
  34. ACTUAL-RESULTS I CELLS + @ \ COMPARE ACTUAL WITH EXPECTED
  35. <> IF S" INCORRECT RESULT: " ERROR LEAVE THEN
  36. LOOP
  37. THEN
  38. ELSE \ DEPTH MISMATCH
  39. S" WRONG NUMBER OF RESULTS: " ERROR
  40. THEN ;
  41. : TESTING \ ( -- ) TALKING COMMENT.
  42. SOURCE VERBOSE @
  43. IF DUP >R TYPE CR R> >IN !
  44. ELSE >IN ! DROP
  45. THEN ;
  46. \ From: John Hayes S1I
  47. \ Subject: core.fr
  48. \ Date: Mon, 27 Nov 95 13:10
  49. \ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
  50. \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
  51. \ VERSION 1.2
  52. \ THIS PROGRAM TESTS THE CORE WORDS OF AN ANS FORTH SYSTEM.
  53. \ THE PROGRAM ASSUMES A TWO'S COMPLEMENT IMPLEMENTATION WHERE
  54. \ THE RANGE OF SIGNED NUMBERS IS -2^(N-1) ... 2^(N-1)-1 AND
  55. \ THE RANGE OF UNSIGNED NUMBERS IS 0 ... 2^(N)-1.
  56. \ I HAVEN'T FIGURED OUT HOW TO TEST KEY, QUIT, ABORT, OR ABORT"...
  57. \ I ALSO HAVEN'T THOUGHT OF A WAY TO TEST ENVIRONMENT?...
  58. TESTING CORE WORDS
  59. HEX
  60. \ ------------------------------------------------------------------------
  61. TESTING BASIC ASSUMPTIONS
  62. { -> } \ START WITH CLEAN SLATE
  63. ( TEST IF ANY BITS ARE SET; ANSWER IN BASE 1 )
  64. { : BITSSET? IF 0 0 ELSE 0 THEN ; -> }
  65. { 0 BITSSET? -> 0 } ( ZERO IS ALL BITS CLEAR )
  66. { 1 BITSSET? -> 0 0 } ( OTHER NUMBER HAVE AT LEAST ONE BIT )
  67. { -1 BITSSET? -> 0 0 }
  68. \ ------------------------------------------------------------------------
  69. TESTING BOOLEANS: INVERT AND OR XOR
  70. { 0 0 AND -> 0 }
  71. { 0 1 AND -> 0 }
  72. { 1 0 AND -> 0 }
  73. { 1 1 AND -> 1 }
  74. { 0 INVERT 1 AND -> 1 }
  75. { 1 INVERT 1 AND -> 0 }
  76. 0 CONSTANT 0S
  77. 0 INVERT CONSTANT 1S
  78. { 0S INVERT -> 1S }
  79. { 1S INVERT -> 0S }
  80. { 0S 0S AND -> 0S }
  81. { 0S 1S AND -> 0S }
  82. { 1S 0S AND -> 0S }
  83. { 1S 1S AND -> 1S }
  84. { 0S 0S OR -> 0S }
  85. { 0S 1S OR -> 1S }
  86. { 1S 0S OR -> 1S }
  87. { 1S 1S OR -> 1S }
  88. { 0S 0S XOR -> 0S }
  89. { 0S 1S XOR -> 1S }
  90. { 1S 0S XOR -> 1S }
  91. { 1S 1S XOR -> 0S }
  92. \ ------------------------------------------------------------------------
  93. TESTING 2* 2/ LSHIFT RSHIFT
  94. ( WE TRUST 1S, INVERT, AND BITSSET?; WE WILL CONFIRM RSHIFT LATER )
  95. 1S 1 RSHIFT INVERT CONSTANT MSB
  96. { MSB BITSSET? -> 0 0 }
  97. { 0S 2* -> 0S }
  98. { 1 2* -> 2 }
  99. { 4000 2* -> 8000 }
  100. { 1S 2* 1 XOR -> 1S }
  101. { MSB 2* -> 0S }
  102. { 0S 2/ -> 0S }
  103. { 1 2/ -> 0 }
  104. { 4000 2/ -> 2000 }
  105. { 1S 2/ -> 1S } \ MSB PROPOGATED
  106. { 1S 1 XOR 2/ -> 1S }
  107. { MSB 2/ MSB AND -> MSB }
  108. { 1 0 LSHIFT -> 1 }
  109. { 1 1 LSHIFT -> 2 }
  110. { 1 2 LSHIFT -> 4 }
  111. { 1 F LSHIFT -> 8000 } \ BIGGEST GUARANTEED SHIFT
  112. { 1S 1 LSHIFT 1 XOR -> 1S }
  113. { MSB 1 LSHIFT -> 0 }
  114. { 1 0 RSHIFT -> 1 }
  115. { 1 1 RSHIFT -> 0 }
  116. { 2 1 RSHIFT -> 1 }
  117. { 4 2 RSHIFT -> 1 }
  118. { 8000 F RSHIFT -> 1 } \ BIGGEST
  119. { MSB 1 RSHIFT MSB AND -> 0 } \ RSHIFT ZERO FILLS MSBS
  120. { MSB 1 RSHIFT 2* -> MSB }
  121. \ ------------------------------------------------------------------------
  122. TESTING COMPARISONS: 0= = 0< < > U< MIN MAX
  123. 0 INVERT CONSTANT MAX-UINT
  124. 0 INVERT 1 RSHIFT CONSTANT MAX-INT
  125. 0 INVERT 1 RSHIFT INVERT CONSTANT MIN-INT
  126. 0 INVERT 1 RSHIFT CONSTANT MID-UINT
  127. 0 INVERT 1 RSHIFT INVERT CONSTANT MID-UINT+1
  128. 0S CONSTANT <FALSE>
  129. 1S CONSTANT <TRUE>
  130. { 0 0= -> <TRUE> }
  131. { 1 0= -> <FALSE> }
  132. { 2 0= -> <FALSE> }
  133. { -1 0= -> <FALSE> }
  134. { MAX-UINT 0= -> <FALSE> }
  135. { MIN-INT 0= -> <FALSE> }
  136. { MAX-INT 0= -> <FALSE> }
  137. { 0 0 = -> <TRUE> }
  138. { 1 1 = -> <TRUE> }
  139. { -1 -1 = -> <TRUE> }
  140. { 1 0 = -> <FALSE> }
  141. { -1 0 = -> <FALSE> }
  142. { 0 1 = -> <FALSE> }
  143. { 0 -1 = -> <FALSE> }
  144. { 0 0< -> <FALSE> }
  145. { -1 0< -> <TRUE> }
  146. { MIN-INT 0< -> <TRUE> }
  147. { 1 0< -> <FALSE> }
  148. { MAX-INT 0< -> <FALSE> }
  149. { 0 1 < -> <TRUE> }
  150. { 1 2 < -> <TRUE> }
  151. { -1 0 < -> <TRUE> }
  152. { -1 1 < -> <TRUE> }
  153. { MIN-INT 0 < -> <TRUE> }
  154. { MIN-INT MAX-INT < -> <TRUE> }
  155. { 0 MAX-INT < -> <TRUE> }
  156. { 0 0 < -> <FALSE> }
  157. { 1 1 < -> <FALSE> }
  158. { 1 0 < -> <FALSE> }
  159. { 2 1 < -> <FALSE> }
  160. { 0 -1 < -> <FALSE> }
  161. { 1 -1 < -> <FALSE> }
  162. { 0 MIN-INT < -> <FALSE> }
  163. { MAX-INT MIN-INT < -> <FALSE> }
  164. { MAX-INT 0 < -> <FALSE> }
  165. { 0 1 > -> <FALSE> }
  166. { 1 2 > -> <FALSE> }
  167. { -1 0 > -> <FALSE> }
  168. { -1 1 > -> <FALSE> }
  169. { MIN-INT 0 > -> <FALSE> }
  170. { MIN-INT MAX-INT > -> <FALSE> }
  171. { 0 MAX-INT > -> <FALSE> }
  172. { 0 0 > -> <FALSE> }
  173. { 1 1 > -> <FALSE> }
  174. { 1 0 > -> <TRUE> }
  175. { 2 1 > -> <TRUE> }
  176. { 0 -1 > -> <TRUE> }
  177. { 1 -1 > -> <TRUE> }
  178. { 0 MIN-INT > -> <TRUE> }
  179. { MAX-INT MIN-INT > -> <TRUE> }
  180. { MAX-INT 0 > -> <TRUE> }
  181. { 0 1 U< -> <TRUE> }
  182. { 1 2 U< -> <TRUE> }
  183. { 0 MID-UINT U< -> <TRUE> }
  184. { 0 MAX-UINT U< -> <TRUE> }
  185. { MID-UINT MAX-UINT U< -> <TRUE> }
  186. { 0 0 U< -> <FALSE> }
  187. { 1 1 U< -> <FALSE> }
  188. { 1 0 U< -> <FALSE> }
  189. { 2 1 U< -> <FALSE> }
  190. { MID-UINT 0 U< -> <FALSE> }
  191. { MAX-UINT 0 U< -> <FALSE> }
  192. { MAX-UINT MID-UINT U< -> <FALSE> }
  193. { 0 1 MIN -> 0 }
  194. { 1 2 MIN -> 1 }
  195. { -1 0 MIN -> -1 }
  196. { -1 1 MIN -> -1 }
  197. { MIN-INT 0 MIN -> MIN-INT }
  198. { MIN-INT MAX-INT MIN -> MIN-INT }
  199. { 0 MAX-INT MIN -> 0 }
  200. { 0 0 MIN -> 0 }
  201. { 1 1 MIN -> 1 }
  202. { 1 0 MIN -> 0 }
  203. { 2 1 MIN -> 1 }
  204. { 0 -1 MIN -> -1 }
  205. { 1 -1 MIN -> -1 }
  206. { 0 MIN-INT MIN -> MIN-INT }
  207. { MAX-INT MIN-INT MIN -> MIN-INT }
  208. { MAX-INT 0 MIN -> 0 }
  209. { 0 1 MAX -> 1 }
  210. { 1 2 MAX -> 2 }
  211. { -1 0 MAX -> 0 }
  212. { -1 1 MAX -> 1 }
  213. { MIN-INT 0 MAX -> 0 }
  214. { MIN-INT MAX-INT MAX -> MAX-INT }
  215. { 0 MAX-INT MAX -> MAX-INT }
  216. { 0 0 MAX -> 0 }
  217. { 1 1 MAX -> 1 }
  218. { 1 0 MAX -> 1 }
  219. { 2 1 MAX -> 2 }
  220. { 0 -1 MAX -> 0 }
  221. { 1 -1 MAX -> 1 }
  222. { 0 MIN-INT MAX -> 0 }
  223. { MAX-INT MIN-INT MAX -> MAX-INT }
  224. { MAX-INT 0 MAX -> MAX-INT }
  225. \ ------------------------------------------------------------------------
  226. TESTING STACK OPS: 2DROP 2DUP 2OVER 2SWAP ?DUP DEPTH DROP DUP OVER ROT SWAP
  227. { 1 2 2DROP -> }
  228. { 1 2 2DUP -> 1 2 1 2 }
  229. { 1 2 3 4 2OVER -> 1 2 3 4 1 2 }
  230. { 1 2 3 4 2SWAP -> 3 4 1 2 }
  231. { 0 ?DUP -> 0 }
  232. { 1 ?DUP -> 1 1 }
  233. { -1 ?DUP -> -1 -1 }
  234. { DEPTH -> 0 }
  235. { 0 DEPTH -> 0 1 }
  236. { 0 1 DEPTH -> 0 1 2 }
  237. { 0 DROP -> }
  238. { 1 2 DROP -> 1 }
  239. { 1 DUP -> 1 1 }
  240. { 1 2 OVER -> 1 2 1 }
  241. { 1 2 3 ROT -> 2 3 1 }
  242. { 1 2 SWAP -> 2 1 }
  243. \ ------------------------------------------------------------------------
  244. TESTING >R R> R@
  245. { : GR1 >R R> ; -> }
  246. { : GR2 >R R@ R> DROP ; -> }
  247. { 123 GR1 -> 123 }
  248. { 123 GR2 -> 123 }
  249. { 1S GR1 -> 1S } ( RETURN STACK HOLDS CELLS )
  250. \ ------------------------------------------------------------------------
  251. TESTING ADD/SUBTRACT: + - 1+ 1- ABS NEGATE
  252. { 0 5 + -> 5 }
  253. { 5 0 + -> 5 }
  254. { 0 -5 + -> -5 }
  255. { -5 0 + -> -5 }
  256. { 1 2 + -> 3 }
  257. { 1 -2 + -> -1 }
  258. { -1 2 + -> 1 }
  259. { -1 -2 + -> -3 }
  260. { -1 1 + -> 0 }
  261. { MID-UINT 1 + -> MID-UINT+1 }
  262. { 0 5 - -> -5 }
  263. { 5 0 - -> 5 }
  264. { 0 -5 - -> 5 }
  265. { -5 0 - -> -5 }
  266. { 1 2 - -> -1 }
  267. { 1 -2 - -> 3 }
  268. { -1 2 - -> -3 }
  269. { -1 -2 - -> 1 }
  270. { 0 1 - -> -1 }
  271. { MID-UINT+1 1 - -> MID-UINT }
  272. { 0 1+ -> 1 }
  273. { -1 1+ -> 0 }
  274. { 1 1+ -> 2 }
  275. { MID-UINT 1+ -> MID-UINT+1 }
  276. { 2 1- -> 1 }
  277. { 1 1- -> 0 }
  278. { 0 1- -> -1 }
  279. { MID-UINT+1 1- -> MID-UINT }
  280. { 0 NEGATE -> 0 }
  281. { 1 NEGATE -> -1 }
  282. { -1 NEGATE -> 1 }
  283. { 2 NEGATE -> -2 }
  284. { -2 NEGATE -> 2 }
  285. { 0 ABS -> 0 }
  286. { 1 ABS -> 1 }
  287. { -1 ABS -> 1 }
  288. { MIN-INT ABS -> MID-UINT+1 }
  289. \ ------------------------------------------------------------------------
  290. TESTING MULTIPLY: S>D * M* UM*
  291. { 0 S>D -> 0 0 }
  292. { 1 S>D -> 1 0 }
  293. { 2 S>D -> 2 0 }
  294. { -1 S>D -> -1 -1 }
  295. { -2 S>D -> -2 -1 }
  296. { MIN-INT S>D -> MIN-INT -1 }
  297. { MAX-INT S>D -> MAX-INT 0 }
  298. { 0 0 M* -> 0 S>D }
  299. { 0 1 M* -> 0 S>D }
  300. { 1 0 M* -> 0 S>D }
  301. { 1 2 M* -> 2 S>D }
  302. { 2 1 M* -> 2 S>D }
  303. { 3 3 M* -> 9 S>D }
  304. { -3 3 M* -> -9 S>D }
  305. { 3 -3 M* -> -9 S>D }
  306. { -3 -3 M* -> 9 S>D }
  307. { 0 MIN-INT M* -> 0 S>D }
  308. { 1 MIN-INT M* -> MIN-INT S>D }
  309. { 2 MIN-INT M* -> 0 1S }
  310. { 0 MAX-INT M* -> 0 S>D }
  311. { 1 MAX-INT M* -> MAX-INT S>D }
  312. { 2 MAX-INT M* -> MAX-INT 1 LSHIFT 0 }
  313. { MIN-INT MIN-INT M* -> 0 MSB 1 RSHIFT }
  314. { MAX-INT MIN-INT M* -> MSB MSB 2/ }
  315. { MAX-INT MAX-INT M* -> 1 MSB 2/ INVERT }
  316. { 0 0 * -> 0 } \ TEST IDENTITIES
  317. { 0 1 * -> 0 }
  318. { 1 0 * -> 0 }
  319. { 1 2 * -> 2 }
  320. { 2 1 * -> 2 }
  321. { 3 3 * -> 9 }
  322. { -3 3 * -> -9 }
  323. { 3 -3 * -> -9 }
  324. { -3 -3 * -> 9 }
  325. { MID-UINT+1 1 RSHIFT 2 * -> MID-UINT+1 }
  326. { MID-UINT+1 2 RSHIFT 4 * -> MID-UINT+1 }
  327. { MID-UINT+1 1 RSHIFT MID-UINT+1 OR 2 * -> MID-UINT+1 }
  328. { 0 0 UM* -> 0 0 }
  329. { 0 1 UM* -> 0 0 }
  330. { 1 0 UM* -> 0 0 }
  331. { 1 2 UM* -> 2 0 }
  332. { 2 1 UM* -> 2 0 }
  333. { 3 3 UM* -> 9 0 }
  334. { MID-UINT+1 1 RSHIFT 2 UM* -> MID-UINT+1 0 }
  335. { MID-UINT+1 2 UM* -> 0 1 }
  336. { MID-UINT+1 4 UM* -> 0 2 }
  337. { 1S 2 UM* -> 1S 1 LSHIFT 1 }
  338. { MAX-UINT MAX-UINT UM* -> 1 1 INVERT }
  339. \ ------------------------------------------------------------------------
  340. TESTING DIVIDE: FM/MOD SM/REM UM/MOD */ */MOD / /MOD MOD
  341. { 0 S>D 1 FM/MOD -> 0 0 }
  342. { 1 S>D 1 FM/MOD -> 0 1 }
  343. { 2 S>D 1 FM/MOD -> 0 2 }
  344. { -1 S>D 1 FM/MOD -> 0 -1 }
  345. { -2 S>D 1 FM/MOD -> 0 -2 }
  346. { 0 S>D -1 FM/MOD -> 0 0 }
  347. { 1 S>D -1 FM/MOD -> 0 -1 }
  348. { 2 S>D -1 FM/MOD -> 0 -2 }
  349. { -1 S>D -1 FM/MOD -> 0 1 }
  350. { -2 S>D -1 FM/MOD -> 0 2 }
  351. { 2 S>D 2 FM/MOD -> 0 1 }
  352. { -1 S>D -1 FM/MOD -> 0 1 }
  353. { -2 S>D -2 FM/MOD -> 0 1 }
  354. { 7 S>D 3 FM/MOD -> 1 2 }
  355. { 7 S>D -3 FM/MOD -> -2 -3 }
  356. { -7 S>D 3 FM/MOD -> 2 -3 }
  357. { -7 S>D -3 FM/MOD -> -1 2 }
  358. { MAX-INT S>D 1 FM/MOD -> 0 MAX-INT }
  359. { MIN-INT S>D 1 FM/MOD -> 0 MIN-INT }
  360. { MAX-INT S>D MAX-INT FM/MOD -> 0 1 }
  361. { MIN-INT S>D MIN-INT FM/MOD -> 0 1 }
  362. { 1S 1 4 FM/MOD -> 3 MAX-INT }
  363. { 1 MIN-INT M* 1 FM/MOD -> 0 MIN-INT }
  364. { 1 MIN-INT M* MIN-INT FM/MOD -> 0 1 }
  365. { 2 MIN-INT M* 2 FM/MOD -> 0 MIN-INT }
  366. { 2 MIN-INT M* MIN-INT FM/MOD -> 0 2 }
  367. { 1 MAX-INT M* 1 FM/MOD -> 0 MAX-INT }
  368. { 1 MAX-INT M* MAX-INT FM/MOD -> 0 1 }
  369. { 2 MAX-INT M* 2 FM/MOD -> 0 MAX-INT }
  370. { 2 MAX-INT M* MAX-INT FM/MOD -> 0 2 }
  371. { MIN-INT MIN-INT M* MIN-INT FM/MOD -> 0 MIN-INT }
  372. { MIN-INT MAX-INT M* MIN-INT FM/MOD -> 0 MAX-INT }
  373. { MIN-INT MAX-INT M* MAX-INT FM/MOD -> 0 MIN-INT }
  374. { MAX-INT MAX-INT M* MAX-INT FM/MOD -> 0 MAX-INT }
  375. { 0 S>D 1 SM/REM -> 0 0 }
  376. { 1 S>D 1 SM/REM -> 0 1 }
  377. { 2 S>D 1 SM/REM -> 0 2 }
  378. { -1 S>D 1 SM/REM -> 0 -1 }
  379. { -2 S>D 1 SM/REM -> 0 -2 }
  380. { 0 S>D -1 SM/REM -> 0 0 }
  381. { 1 S>D -1 SM/REM -> 0 -1 }
  382. { 2 S>D -1 SM/REM -> 0 -2 }
  383. { -1 S>D -1 SM/REM -> 0 1 }
  384. { -2 S>D -1 SM/REM -> 0 2 }
  385. { 2 S>D 2 SM/REM -> 0 1 }
  386. { -1 S>D -1 SM/REM -> 0 1 }
  387. { -2 S>D -2 SM/REM -> 0 1 }
  388. { 7 S>D 3 SM/REM -> 1 2 }
  389. { 7 S>D -3 SM/REM -> 1 -2 }
  390. { -7 S>D 3 SM/REM -> -1 -2 }
  391. { -7 S>D -3 SM/REM -> -1 2 }
  392. { MAX-INT S>D 1 SM/REM -> 0 MAX-INT }
  393. { MIN-INT S>D 1 SM/REM -> 0 MIN-INT }
  394. { MAX-INT S>D MAX-INT SM/REM -> 0 1 }
  395. { MIN-INT S>D MIN-INT SM/REM -> 0 1 }
  396. { 1S 1 4 SM/REM -> 3 MAX-INT }
  397. { 2 MIN-INT M* 2 SM/REM -> 0 MIN-INT }
  398. { 2 MIN-INT M* MIN-INT SM/REM -> 0 2 }
  399. { 2 MAX-INT M* 2 SM/REM -> 0 MAX-INT }
  400. { 2 MAX-INT M* MAX-INT SM/REM -> 0 2 }
  401. { MIN-INT MIN-INT M* MIN-INT SM/REM -> 0 MIN-INT }
  402. { MIN-INT MAX-INT M* MIN-INT SM/REM -> 0 MAX-INT }
  403. { MIN-INT MAX-INT M* MAX-INT SM/REM -> 0 MIN-INT }
  404. { MAX-INT MAX-INT M* MAX-INT SM/REM -> 0 MAX-INT }
  405. { 0 0 1 UM/MOD -> 0 0 }
  406. { 1 0 1 UM/MOD -> 0 1 }
  407. { 1 0 2 UM/MOD -> 1 0 }
  408. { 3 0 2 UM/MOD -> 1 1 }
  409. { MAX-UINT 2 UM* 2 UM/MOD -> 0 MAX-UINT }
  410. { MAX-UINT 2 UM* MAX-UINT UM/MOD -> 0 2 }
  411. { MAX-UINT MAX-UINT UM* MAX-UINT UM/MOD -> 0 MAX-UINT }
  412. : IFFLOORED
  413. [ -3 2 / -2 = INVERT ] LITERAL IF POSTPONE \ THEN ;
  414. : IFSYM
  415. [ -3 2 / -1 = INVERT ] LITERAL IF POSTPONE \ THEN ;
  416. \ THE SYSTEM MIGHT DO EITHER FLOORED OR SYMMETRIC DIVISION.
  417. \ SINCE WE HAVE ALREADY TESTED M*, FM/MOD, AND SM/REM WE CAN USE THEM IN TEST.
  418. IFFLOORED : T/MOD >R S>D R> FM/MOD ;
  419. IFFLOORED : T/ T/MOD SWAP DROP ;
  420. IFFLOORED : TMOD T/MOD DROP ;
  421. IFFLOORED : T*/MOD >R M* R> FM/MOD ;
  422. IFFLOORED : T*/ T*/MOD SWAP DROP ;
  423. IFSYM : T/MOD >R S>D R> SM/REM ;
  424. IFSYM : T/ T/MOD SWAP DROP ;
  425. IFSYM : TMOD T/MOD DROP ;
  426. IFSYM : T*/MOD >R M* R> SM/REM ;
  427. IFSYM : T*/ T*/MOD SWAP DROP ;
  428. { 0 1 /MOD -> 0 1 T/MOD }
  429. { 1 1 /MOD -> 1 1 T/MOD }
  430. { 2 1 /MOD -> 2 1 T/MOD }
  431. { -1 1 /MOD -> -1 1 T/MOD }
  432. { -2 1 /MOD -> -2 1 T/MOD }
  433. { 0 -1 /MOD -> 0 -1 T/MOD }
  434. { 1 -1 /MOD -> 1 -1 T/MOD }
  435. { 2 -1 /MOD -> 2 -1 T/MOD }
  436. { -1 -1 /MOD -> -1 -1 T/MOD }
  437. { -2 -1 /MOD -> -2 -1 T/MOD }
  438. { 2 2 /MOD -> 2 2 T/MOD }
  439. { -1 -1 /MOD -> -1 -1 T/MOD }
  440. { -2 -2 /MOD -> -2 -2 T/MOD }
  441. { 7 3 /MOD -> 7 3 T/MOD }
  442. { 7 -3 /MOD -> 7 -3 T/MOD }
  443. { -7 3 /MOD -> -7 3 T/MOD }
  444. { -7 -3 /MOD -> -7 -3 T/MOD }
  445. { MAX-INT 1 /MOD -> MAX-INT 1 T/MOD }
  446. { MIN-INT 1 /MOD -> MIN-INT 1 T/MOD }
  447. { MAX-INT MAX-INT /MOD -> MAX-INT MAX-INT T/MOD }
  448. { MIN-INT MIN-INT /MOD -> MIN-INT MIN-INT T/MOD }
  449. { 0 1 / -> 0 1 T/ }
  450. { 1 1 / -> 1 1 T/ }
  451. { 2 1 / -> 2 1 T/ }
  452. { -1 1 / -> -1 1 T/ }
  453. { -2 1 / -> -2 1 T/ }
  454. { 0 -1 / -> 0 -1 T/ }
  455. { 1 -1 / -> 1 -1 T/ }
  456. { 2 -1 / -> 2 -1 T/ }
  457. { -1 -1 / -> -1 -1 T/ }
  458. { -2 -1 / -> -2 -1 T/ }
  459. { 2 2 / -> 2 2 T/ }
  460. { -1 -1 / -> -1 -1 T/ }
  461. { -2 -2 / -> -2 -2 T/ }
  462. { 7 3 / -> 7 3 T/ }
  463. { 7 -3 / -> 7 -3 T/ }
  464. { -7 3 / -> -7 3 T/ }
  465. { -7 -3 / -> -7 -3 T/ }
  466. { MAX-INT 1 / -> MAX-INT 1 T/ }
  467. { MIN-INT 1 / -> MIN-INT 1 T/ }
  468. { MAX-INT MAX-INT / -> MAX-INT MAX-INT T/ }
  469. { MIN-INT MIN-INT / -> MIN-INT MIN-INT T/ }
  470. { 0 1 MOD -> 0 1 TMOD }
  471. { 1 1 MOD -> 1 1 TMOD }
  472. { 2 1 MOD -> 2 1 TMOD }
  473. { -1 1 MOD -> -1 1 TMOD }
  474. { -2 1 MOD -> -2 1 TMOD }
  475. { 0 -1 MOD -> 0 -1 TMOD }
  476. { 1 -1 MOD -> 1 -1 TMOD }
  477. { 2 -1 MOD -> 2 -1 TMOD }
  478. { -1 -1 MOD -> -1 -1 TMOD }
  479. { -2 -1 MOD -> -2 -1 TMOD }
  480. { 2 2 MOD -> 2 2 TMOD }
  481. { -1 -1 MOD -> -1 -1 TMOD }
  482. { -2 -2 MOD -> -2 -2 TMOD }
  483. { 7 3 MOD -> 7 3 TMOD }
  484. { 7 -3 MOD -> 7 -3 TMOD }
  485. { -7 3 MOD -> -7 3 TMOD }
  486. { -7 -3 MOD -> -7 -3 TMOD }
  487. { MAX-INT 1 MOD -> MAX-INT 1 TMOD }
  488. { MIN-INT 1 MOD -> MIN-INT 1 TMOD }
  489. { MAX-INT MAX-INT MOD -> MAX-INT MAX-INT TMOD }
  490. { MIN-INT MIN-INT MOD -> MIN-INT MIN-INT TMOD }
  491. { 0 2 1 */ -> 0 2 1 T*/ }
  492. { 1 2 1 */ -> 1 2 1 T*/ }
  493. { 2 2 1 */ -> 2 2 1 T*/ }
  494. { -1 2 1 */ -> -1 2 1 T*/ }
  495. { -2 2 1 */ -> -2 2 1 T*/ }
  496. { 0 2 -1 */ -> 0 2 -1 T*/ }
  497. { 1 2 -1 */ -> 1 2 -1 T*/ }
  498. { 2 2 -1 */ -> 2 2 -1 T*/ }
  499. { -1 2 -1 */ -> -1 2 -1 T*/ }
  500. { -2 2 -1 */ -> -2 2 -1 T*/ }
  501. { 2 2 2 */ -> 2 2 2 T*/ }
  502. { -1 2 -1 */ -> -1 2 -1 T*/ }
  503. { -2 2 -2 */ -> -2 2 -2 T*/ }
  504. { 7 2 3 */ -> 7 2 3 T*/ }
  505. { 7 2 -3 */ -> 7 2 -3 T*/ }
  506. { -7 2 3 */ -> -7 2 3 T*/ }
  507. { -7 2 -3 */ -> -7 2 -3 T*/ }
  508. { MAX-INT 2 MAX-INT */ -> MAX-INT 2 MAX-INT T*/ }
  509. { MIN-INT 2 MIN-INT */ -> MIN-INT 2 MIN-INT T*/ }
  510. { 0 2 1 */MOD -> 0 2 1 T*/MOD }
  511. { 1 2 1 */MOD -> 1 2 1 T*/MOD }
  512. { 2 2 1 */MOD -> 2 2 1 T*/MOD }
  513. { -1 2 1 */MOD -> -1 2 1 T*/MOD }
  514. { -2 2 1 */MOD -> -2 2 1 T*/MOD }
  515. { 0 2 -1 */MOD -> 0 2 -1 T*/MOD }
  516. { 1 2 -1 */MOD -> 1 2 -1 T*/MOD }
  517. { 2 2 -1 */MOD -> 2 2 -1 T*/MOD }
  518. { -1 2 -1 */MOD -> -1 2 -1 T*/MOD }
  519. { -2 2 -1 */MOD -> -2 2 -1 T*/MOD }
  520. { 2 2 2 */MOD -> 2 2 2 T*/MOD }
  521. { -1 2 -1 */MOD -> -1 2 -1 T*/MOD }
  522. { -2 2 -2 */MOD -> -2 2 -2 T*/MOD }
  523. { 7 2 3 */MOD -> 7 2 3 T*/MOD }
  524. { 7 2 -3 */MOD -> 7 2 -3 T*/MOD }
  525. { -7 2 3 */MOD -> -7 2 3 T*/MOD }
  526. { -7 2 -3 */MOD -> -7 2 -3 T*/MOD }
  527. { MAX-INT 2 MAX-INT */MOD -> MAX-INT 2 MAX-INT T*/MOD }
  528. { MIN-INT 2 MIN-INT */MOD -> MIN-INT 2 MIN-INT T*/MOD }
  529. \ ------------------------------------------------------------------------
  530. TESTING HERE , @ ! CELL+ CELLS C, C@ C! CHARS 2@ 2! ALIGN ALIGNED +! ALLOT
  531. HERE 1 ALLOT
  532. HERE
  533. CONSTANT 2NDA
  534. CONSTANT 1STA
  535. { 1STA 2NDA U< -> <TRUE> } \ HERE MUST GROW WITH ALLOT
  536. { 1STA 1+ -> 2NDA } \ ... BY ONE ADDRESS UNIT
  537. ( MISSING TEST: NEGATIVE ALLOT )
  538. HERE 1 ,
  539. HERE 2 ,
  540. CONSTANT 2ND
  541. CONSTANT 1ST
  542. { 1ST 2ND U< -> <TRUE> } \ HERE MUST GROW WITH ALLOT
  543. { 1ST CELL+ -> 2ND } \ ... BY ONE CELL
  544. { 1ST 1 CELLS + -> 2ND }
  545. { 1ST @ 2ND @ -> 1 2 }
  546. { 5 1ST ! -> }
  547. { 1ST @ 2ND @ -> 5 2 }
  548. { 6 2ND ! -> }
  549. { 1ST @ 2ND @ -> 5 6 }
  550. { 1ST 2@ -> 6 5 }
  551. { 2 1 1ST 2! -> }
  552. { 1ST 2@ -> 2 1 }
  553. { 1S 1ST ! 1ST @ -> 1S } \ CAN STORE CELL-WIDE VALUE
  554. HERE 1 C,
  555. HERE 2 C,
  556. CONSTANT 2NDC
  557. CONSTANT 1STC
  558. { 1STC 2NDC U< -> <TRUE> } \ HERE MUST GROW WITH ALLOT
  559. { 1STC CHAR+ -> 2NDC } \ ... BY ONE CHAR
  560. { 1STC 1 CHARS + -> 2NDC }
  561. { 1STC C@ 2NDC C@ -> 1 2 }
  562. { 3 1STC C! -> }
  563. { 1STC C@ 2NDC C@ -> 3 2 }
  564. { 4 2NDC C! -> }
  565. { 1STC C@ 2NDC C@ -> 3 4 }
  566. ALIGN 1 ALLOT HERE ALIGN HERE 3 CELLS ALLOT
  567. CONSTANT A-ADDR CONSTANT UA-ADDR
  568. { UA-ADDR ALIGNED -> A-ADDR }
  569. { 1 A-ADDR C! A-ADDR C@ -> 1 }
  570. { 1234 A-ADDR ! A-ADDR @ -> 1234 }
  571. { 123 456 A-ADDR 2! A-ADDR 2@ -> 123 456 }
  572. { 2 A-ADDR CHAR+ C! A-ADDR CHAR+ C@ -> 2 }
  573. { 3 A-ADDR CELL+ C! A-ADDR CELL+ C@ -> 3 }
  574. { 1234 A-ADDR CELL+ ! A-ADDR CELL+ @ -> 1234 }
  575. { 123 456 A-ADDR CELL+ 2! A-ADDR CELL+ 2@ -> 123 456 }
  576. : BITS ( X -- U )
  577. 0 SWAP BEGIN DUP WHILE DUP MSB AND IF >R 1+ R> THEN 2* REPEAT DROP ;
  578. ( CHARACTERS >= 1 AU, <= SIZE OF CELL, >= 8 BITS )
  579. { 1 CHARS 1 < -> <FALSE> }
  580. { 1 CHARS 1 CELLS > -> <FALSE> }
  581. ( TBD: HOW TO FIND NUMBER OF BITS? )
  582. ( CELLS >= 1 AU, INTEGRAL MULTIPLE OF CHAR SIZE, >= 16 BITS )
  583. { 1 CELLS 1 < -> <FALSE> }
  584. { 1 CELLS 1 CHARS MOD -> 0 }
  585. { 1S BITS 10 < -> <FALSE> }
  586. { 0 1ST ! -> }
  587. { 1 1ST +! -> }
  588. { 1ST @ -> 1 }
  589. { -1 1ST +! 1ST @ -> 0 }
  590. \ ------------------------------------------------------------------------
  591. TESTING CHAR [CHAR] [ ] BL S"
  592. { BL -> 20 }
  593. { CHAR X -> 58 }
  594. { CHAR HELLO -> 48 }
  595. { : GC1 [CHAR] X ; -> }
  596. { : GC2 [CHAR] HELLO ; -> }
  597. { GC1 -> 58 }
  598. { GC2 -> 48 }
  599. { : GC3 [ GC1 ] LITERAL ; -> }
  600. { GC3 -> 58 }
  601. { : GC4 S" XY" ; -> }
  602. { GC4 SWAP DROP -> 2 }
  603. { GC4 DROP DUP C@ SWAP CHAR+ C@ -> 58 59 }
  604. \ ------------------------------------------------------------------------
  605. TESTING ' ['] FIND EXECUTE IMMEDIATE COUNT LITERAL POSTPONE STATE
  606. { : GT1 123 ; -> }
  607. { ' GT1 EXECUTE -> 123 }
  608. { : GT2 ['] GT1 ; IMMEDIATE -> }
  609. { GT2 EXECUTE -> 123 }
  610. HERE 3 C, CHAR G C, CHAR T C, CHAR 1 C, CONSTANT GT1STRING
  611. HERE 3 C, CHAR G C, CHAR T C, CHAR 2 C, CONSTANT GT2STRING
  612. { GT1STRING FIND -> ' GT1 -1 }
  613. { GT2STRING FIND -> ' GT2 1 }
  614. ( HOW TO SEARCH FOR NON-EXISTENT WORD? )
  615. { : GT3 GT2 LITERAL ; -> }
  616. { GT3 -> ' GT1 }
  617. { GT1STRING COUNT -> GT1STRING CHAR+ 3 }
  618. { : GT4 POSTPONE GT1 ; IMMEDIATE -> }
  619. { : GT5 GT4 ; -> }
  620. { GT5 -> 123 }
  621. { : GT6 345 ; IMMEDIATE -> }
  622. { : GT7 POSTPONE GT6 ; -> }
  623. { GT7 -> 345 }
  624. { : GT8 STATE @ ; IMMEDIATE -> }
  625. { GT8 -> 0 }
  626. { : GT9 GT8 LITERAL ; -> }
  627. { GT9 0= -> <FALSE> }
  628. \ ------------------------------------------------------------------------
  629. TESTING IF ELSE THEN BEGIN WHILE REPEAT UNTIL RECURSE
  630. { : GI1 IF 123 THEN ; -> }
  631. { : GI2 IF 123 ELSE 234 THEN ; -> }
  632. { 0 GI1 -> }
  633. { 1 GI1 -> 123 }
  634. { -1 GI1 -> 123 }
  635. { 0 GI2 -> 234 }
  636. { 1 GI2 -> 123 }
  637. { -1 GI1 -> 123 }
  638. { : GI3 BEGIN DUP 5 < WHILE DUP 1+ REPEAT ; -> }
  639. { 0 GI3 -> 0 1 2 3 4 5 }
  640. { 4 GI3 -> 4 5 }
  641. { 5 GI3 -> 5 }
  642. { 6 GI3 -> 6 }
  643. { : GI4 BEGIN DUP 1+ DUP 5 > UNTIL ; -> }
  644. { 3 GI4 -> 3 4 5 6 }
  645. { 5 GI4 -> 5 6 }
  646. { 6 GI4 -> 6 7 }
  647. { : GI5 BEGIN DUP 2 > WHILE DUP 5 < WHILE DUP 1+ REPEAT 123 ELSE 345 THEN ; -> }
  648. { 1 GI5 -> 1 345 }
  649. { 2 GI5 -> 2 345 }
  650. { 3 GI5 -> 3 4 5 123 }
  651. { 4 GI5 -> 4 5 123 }
  652. { 5 GI5 -> 5 123 }
  653. { : GI6 ( N -- 0,1,..N ) DUP IF DUP >R 1- RECURSE R> THEN ; -> }
  654. { 0 GI6 -> 0 }
  655. { 1 GI6 -> 0 1 }
  656. { 2 GI6 -> 0 1 2 }
  657. { 3 GI6 -> 0 1 2 3 }
  658. { 4 GI6 -> 0 1 2 3 4 }
  659. \ ------------------------------------------------------------------------
  660. TESTING DO LOOP +LOOP I J UNLOOP LEAVE EXIT
  661. { : GD1 DO I LOOP ; -> }
  662. { 4 1 GD1 -> 1 2 3 }
  663. { 2 -1 GD1 -> -1 0 1 }
  664. { MID-UINT+1 MID-UINT GD1 -> MID-UINT }
  665. { : GD2 DO I -1 +LOOP ; -> }
  666. { 1 4 GD2 -> 4 3 2 1 }
  667. { -1 2 GD2 -> 2 1 0 -1 }
  668. { MID-UINT MID-UINT+1 GD2 -> MID-UINT+1 MID-UINT }
  669. { : GD3 DO 1 0 DO J LOOP LOOP ; -> }
  670. { 4 1 GD3 -> 1 2 3 }
  671. { 2 -1 GD3 -> -1 0 1 }
  672. { MID-UINT+1 MID-UINT GD3 -> MID-UINT }
  673. { : GD4 DO 1 0 DO J LOOP -1 +LOOP ; -> }
  674. { 1 4 GD4 -> 4 3 2 1 }
  675. { -1 2 GD4 -> 2 1 0 -1 }
  676. { MID-UINT MID-UINT+1 GD4 -> MID-UINT+1 MID-UINT }
  677. { : GD5 123 SWAP 0 DO I 4 > IF DROP 234 LEAVE THEN LOOP ; -> }
  678. { 1 GD5 -> 123 }
  679. { 5 GD5 -> 123 }
  680. { 6 GD5 -> 234 }
  681. { : GD6 ( PAT: {0 0},{0 0}{1 0}{1 1},{0 0}{1 0}{1 1}{2 0}{2 1}{2 2} )
  682. 0 SWAP 0 DO
  683. I 1+ 0 DO I J + 3 = IF I UNLOOP I UNLOOP EXIT THEN 1+ LOOP
  684. LOOP ; -> }
  685. { 1 GD6 -> 1 }
  686. { 2 GD6 -> 3 }
  687. { 3 GD6 -> 4 1 2 }
  688. \ ------------------------------------------------------------------------
  689. TESTING DEFINING WORDS: : ; CONSTANT VARIABLE CREATE DOES> >BODY
  690. { 123 CONSTANT X123 -> }
  691. { X123 -> 123 }
  692. { : EQU CONSTANT ; -> }
  693. { X123 EQU Y123 -> }
  694. { Y123 -> 123 }
  695. { VARIABLE V1 -> }
  696. { 123 V1 ! -> }
  697. { V1 @ -> 123 }
  698. { : NOP : POSTPONE ; ; -> }
  699. { NOP NOP1 NOP NOP2 -> }
  700. { NOP1 -> }
  701. { NOP2 -> }
  702. { : DOES1 DOES> @ 1 + ; -> }
  703. { : DOES2 DOES> @ 2 + ; -> }
  704. { CREATE CR1 -> }
  705. { CR1 -> HERE }
  706. { ' CR1 >BODY -> HERE }
  707. { 1 , -> }
  708. { CR1 @ -> 1 }
  709. { DOES1 -> }
  710. { CR1 -> 2 }
  711. { DOES2 -> }
  712. { CR1 -> 3 }
  713. { : WEIRD: CREATE DOES> 1 + DOES> 2 + ; -> }
  714. { WEIRD: W1 -> }
  715. { ' W1 >BODY -> HERE }
  716. { W1 -> HERE 1 + }
  717. { W1 -> HERE 2 + }
  718. \ ------------------------------------------------------------------------
  719. TESTING EVALUATE
  720. : GE1 S" 123" ; IMMEDIATE
  721. : GE2 S" 123 1+" ; IMMEDIATE
  722. : GE3 S" : GE4 345 ;" ;
  723. : GE5 EVALUATE ; IMMEDIATE
  724. { GE1 EVALUATE -> 123 } ( TEST EVALUATE IN INTERP. STATE )
  725. { GE2 EVALUATE -> 124 }
  726. { GE3 EVALUATE -> }
  727. { GE4 -> 345 }
  728. { : GE6 GE1 GE5 ; -> } ( TEST EVALUATE IN COMPILE STATE )
  729. { GE6 -> 123 }
  730. { : GE7 GE2 GE5 ; -> }
  731. { GE7 -> 124 }
  732. \ ------------------------------------------------------------------------
  733. TESTING SOURCE >IN WORD
  734. : GS1 S" SOURCE" 2DUP EVALUATE
  735. >R SWAP >R = R> R> = ;
  736. { GS1 -> <TRUE> <TRUE> }
  737. VARIABLE SCANS
  738. : RESCAN? -1 SCANS +! SCANS @ IF 0 >IN ! THEN ;
  739. { 2 SCANS !
  740. 345 RESCAN?
  741. -> 345 345 }
  742. : GS2 5 SCANS ! S" 123 RESCAN?" EVALUATE ;
  743. { GS2 -> 123 123 123 123 123 }
  744. : GS3 WORD COUNT SWAP C@ ;
  745. { BL GS3 HELLO -> 5 CHAR H }
  746. { CHAR " GS3 GOODBYE" -> 7 CHAR G }
  747. { BL GS3
  748. DROP -> 0 } \ BLANK LINE RETURN ZERO-LENGTH STRING
  749. : GS4 SOURCE >IN ! DROP ;
  750. { GS4 123 456
  751. -> }
  752. \ ------------------------------------------------------------------------
  753. TESTING <# # #S #> HOLD SIGN BASE >NUMBER HEX DECIMAL
  754. : S= \ ( ADDR1 C1 ADDR2 C2 -- T/F ) COMPARE TWO STRINGS.
  755. >R SWAP R@ = IF \ MAKE SURE STRINGS HAVE SAME LENGTH
  756. R> ?DUP IF \ IF NON-EMPTY STRINGS
  757. 0 DO
  758. OVER C@ OVER C@ - IF 2DROP <FALSE> UNLOOP EXIT THEN
  759. SWAP CHAR+ SWAP CHAR+
  760. LOOP
  761. THEN
  762. 2DROP <TRUE> \ IF WE GET HERE, STRINGS MATCH
  763. ELSE
  764. R> DROP 2DROP <FALSE> \ LENGTHS MISMATCH
  765. THEN ;
  766. : GP1 <# 41 HOLD 42 HOLD 0 0 #> S" BA" S= ;
  767. { GP1 -> <TRUE> }
  768. : GP2 <# -1 SIGN 0 SIGN -1 SIGN 0 0 #> S" --" S= ;
  769. { GP2 -> <TRUE> }
  770. : GP3 <# 1 0 # # #> S" 01" S= ;
  771. { GP3 -> <TRUE> }
  772. : GP4 <# 1 0 #S #> S" 1" S= ;
  773. { GP4 -> <TRUE> }
  774. 24 CONSTANT MAX-BASE \ BASE 2 .. 36
  775. : COUNT-BITS
  776. 0 0 INVERT BEGIN DUP WHILE >R 1+ R> 2* REPEAT DROP ;
  777. COUNT-BITS 2* CONSTANT #BITS-UD \ NUMBER OF BITS IN UD
  778. : GP5
  779. BASE @ <TRUE>
  780. MAX-BASE 1+ 2 DO \ FOR EACH POSSIBLE BASE
  781. I BASE ! \ TBD: ASSUMES BASE WORKS
  782. I 0 <# #S #> S" 10" S= AND
  783. LOOP
  784. SWAP BASE ! ;
  785. { GP5 -> <TRUE> }
  786. : GP6
  787. BASE @ >R 2 BASE !
  788. MAX-UINT MAX-UINT <# #S #> \ MAXIMUM UD TO BINARY
  789. R> BASE ! \ S: C-ADDR U
  790. DUP #BITS-UD = SWAP
  791. 0 DO \ S: C-ADDR FLAG
  792. OVER C@ [CHAR] 1 = AND \ ALL ONES
  793. >R CHAR+ R>
  794. LOOP SWAP DROP ;
  795. { GP6 -> <TRUE> }
  796. : GP7
  797. BASE @ >R MAX-BASE BASE !
  798. <TRUE>
  799. A 0 DO
  800. I 0 <# #S #>
  801. 1 = SWAP C@ I 30 + = AND AND
  802. LOOP
  803. MAX-BASE A DO
  804. I 0 <# #S #>
  805. 1 = SWAP C@ 41 I A - + = AND AND
  806. LOOP
  807. R> BASE ! ;
  808. { GP7 -> <TRUE> }
  809. \ >NUMBER TESTS
  810. CREATE GN-BUF 0 C,
  811. : GN-STRING GN-BUF 1 ;
  812. : GN-CONSUMED GN-BUF CHAR+ 0 ;
  813. : GN' [CHAR] ' WORD CHAR+ C@ GN-BUF C! GN-STRING ;
  814. { 0 0 GN' 0' >NUMBER -> 0 0 GN-CONSUMED }
  815. { 0 0 GN' 1' >NUMBER -> 1 0 GN-CONSUMED }
  816. { 1 0 GN' 1' >NUMBER -> BASE @ 1+ 0 GN-CONSUMED }
  817. { 0 0 GN' -' >NUMBER -> 0 0 GN-STRING } \ SHOULD FAIL TO CONVERT THESE
  818. { 0 0 GN' +' >NUMBER -> 0 0 GN-STRING }
  819. { 0 0 GN' .' >NUMBER -> 0 0 GN-STRING }
  820. : >NUMBER-BASED
  821. BASE @ >R BASE ! >NUMBER R> BASE ! ;
  822. { 0 0 GN' 2' 10 >NUMBER-BASED -> 2 0 GN-CONSUMED }
  823. { 0 0 GN' 2' 2 >NUMBER-BASED -> 0 0 GN-STRING }
  824. { 0 0 GN' F' 10 >NUMBER-BASED -> F 0 GN-CONSUMED }
  825. { 0 0 GN' G' 10 >NUMBER-BASED -> 0 0 GN-STRING }
  826. { 0 0 GN' G' MAX-BASE >NUMBER-BASED -> 10 0 GN-CONSUMED }
  827. { 0 0 GN' Z' MAX-BASE >NUMBER-BASED -> 23 0 GN-CONSUMED }
  828. : GN1 \ ( UD BASE -- UD' LEN ) UD SHOULD EQUAL UD' AND LEN SHOULD BE ZERO.
  829. BASE @ >R BASE !
  830. <# #S #>
  831. 0 0 2SWAP >NUMBER SWAP DROP \ RETURN LENGTH ONLY
  832. R> BASE ! ;
  833. { 0 0 2 GN1 -> 0 0 0 }
  834. { MAX-UINT 0 2 GN1 -> MAX-UINT 0 0 }
  835. { MAX-UINT DUP 2 GN1 -> MAX-UINT DUP 0 }
  836. { 0 0 MAX-BASE GN1 -> 0 0 0 }
  837. { MAX-UINT 0 MAX-BASE GN1 -> MAX-UINT 0 0 }
  838. { MAX-UINT DUP MAX-BASE GN1 -> MAX-UINT DUP 0 }
  839. : GN2 \ ( -- 16 10 )
  840. BASE @ >R HEX BASE @ DECIMAL BASE @ R> BASE ! ;
  841. { GN2 -> 10 A }
  842. \ ------------------------------------------------------------------------
  843. TESTING FILL MOVE
  844. CREATE FBUF 00 C, 00 C, 00 C,
  845. CREATE SBUF 12 C, 34 C, 56 C,
  846. : SEEBUF FBUF C@ FBUF CHAR+ C@ FBUF CHAR+ CHAR+ C@ ;
  847. { FBUF 0 20 FILL -> }
  848. { SEEBUF -> 00 00 00 }
  849. { FBUF 1 20 FILL -> }
  850. { SEEBUF -> 20 00 00 }
  851. { FBUF 3 20 FILL -> }
  852. { SEEBUF -> 20 20 20 }
  853. { FBUF FBUF 3 CHARS MOVE -> } \ BIZARRE SPECIAL CASE
  854. { SEEBUF -> 20 20 20 }
  855. { SBUF FBUF 0 CHARS MOVE -> }
  856. { SEEBUF -> 20 20 20 }
  857. { SBUF FBUF 1 CHARS MOVE -> }
  858. { SEEBUF -> 12 20 20 }
  859. { SBUF FBUF 3 CHARS MOVE -> }
  860. { SEEBUF -> 12 34 56 }
  861. \ dtrg: disabled. These expect MOVE to behave like CMOVE, which the modern
  862. \ spec doesn't insist on.
  863. \ { FBUF FBUF CHAR+ 2 CHARS MOVE -> }
  864. \ { SEEBUF -> 12 12 34 }
  865. \
  866. \ { FBUF CHAR+ FBUF 2 CHARS MOVE -> }
  867. \ { SEEBUF -> 12 34 34 }
  868. \ ------------------------------------------------------------------------
  869. TESTING OUTPUT: . ." CR EMIT SPACE SPACES TYPE U.
  870. : OUTPUT-TEST
  871. ." YOU SHOULD SEE THE STANDARD GRAPHIC CHARACTERS:" CR
  872. 41 BL DO I EMIT LOOP CR
  873. 61 41 DO I EMIT LOOP CR
  874. 7F 61 DO I EMIT LOOP CR
  875. ." YOU SHOULD SEE 0-9 SEPARATED BY A SPACE:" CR
  876. 9 1+ 0 DO I . LOOP CR
  877. ." YOU SHOULD SEE 0-9 (WITH NO SPACES):" CR
  878. [CHAR] 9 1+ [CHAR] 0 DO I 0 SPACES EMIT LOOP CR
  879. ." YOU SHOULD SEE A-G SEPARATED BY A SPACE:" CR
  880. [CHAR] G 1+ [CHAR] A DO I EMIT SPACE LOOP CR
  881. ." YOU SHOULD SEE 0-5 SEPARATED BY TWO SPACES:" CR
  882. 5 1+ 0 DO I [CHAR] 0 + EMIT 2 SPACES LOOP CR
  883. ." YOU SHOULD SEE TWO SEPARATE LINES:" CR
  884. S" LINE 1" TYPE CR S" LINE 2" TYPE CR
  885. ." YOU SHOULD SEE THE NUMBER RANGES OF SIGNED AND UNSIGNED NUMBERS:" CR
  886. ." SIGNED: " MIN-INT . MAX-INT . CR
  887. ." UNSIGNED: " 0 U. MAX-UINT U. CR
  888. ;
  889. { OUTPUT-TEST -> }
  890. \ ------------------------------------------------------------------------
  891. TESTING INPUT: ACCEPT
  892. CREATE ABUF 80 CHARS ALLOT
  893. \ dtrg: interactive, so disabled.
  894. \ : ACCEPT-TEST
  895. \ CR ." PLEASE TYPE UP TO 80 CHARACTERS:" CR
  896. \ ABUF 80 ACCEPT
  897. \ CR ." RECEIVED: " [CHAR] " EMIT
  898. \ ABUF SWAP TYPE [CHAR] " EMIT CR
  899. \ ;
  900. \
  901. \ { ACCEPT-TEST -> }
  902. \ ------------------------------------------------------------------------
  903. TESTING DICTIONARY SEARCH RULES
  904. { : GDX 123 ; : GDX GDX 234 ; -> }
  905. { GDX -> 123 234 }