feat(v4): v3's whole POST is v4's POST -- 990 cases, all passed on Hera (#189)
Phase 7, Task 8: PARITY:V4_POST tests=990 pass=990 fail=0 on Hera (mesh-boot); the hosted
product 945 of them, all passed -- the 45 cases of physics.4th's words need the kernel.
- Enlarged, as ruled ("Enlarge v4 to fit"): a node is 32768 words, its data stack 1024
deep (v3's), host and kernel alike; the dictionary's end moves with them.
- POST's runner compares every value a case leaves (v3's leave 101); V4_POST_KERNEL marks
a case of the kernel's words, and a host without a kernel does not run it.
- mkpost.py --all is POST's table (make -C v4 post79), with docs/v4.0.0/POST.md; it reads a
module's #defines (v3's Mama cases are MAMA_IMPLEMENTED, 0: v3's own POST skips all 20);
it cuts no line between a word and the name it takes.
- Rules for the last of the table: the min/max and array-sum programs written as meant,
CREATE's 26-character name (FORTH-79: 31), many_defs.
- POST_FLOOR 990.
- Tests sized for a 32-deep stack and a 16384-word node made deep-stack-ready
(test_host_depth, test_host_quit, test_host_node, hosted-check, depthsweep.py).
make -C v4 test: all v4 tests passed. make -C kernel/tests test: all passed.
depthsweep at 1024: 230 runs, 0 failures. v4-checks running.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_017RzZgrf7V7Zk2iczBXDRbm
This commit is contained in:
+113
-113
@@ -1,105 +1,105 @@
|
|||||||
\ map-32.f18 -- the memory map the system's source is assembled with, 32-bit cells.
|
\ map-32.f18 -- the memory map the system's source is assembled with, 32-bit cells.
|
||||||
\ Generated by v4/tools/mkmap.c (mkmap sys) from v4/tests/host_map.h -- do not edit.
|
\ Generated by v4/tools/mkmap.c (mkmap sys) from v4/tests/host_map.h -- do not edit.
|
||||||
constant N-1 31
|
constant N-1 31
|
||||||
constant NODE-ERROR 16382
|
constant NODE-ERROR 32766
|
||||||
constant CONSOLE-TX 16380
|
constant CONSOLE-TX 32764
|
||||||
constant CONSOLE-RX 16378
|
constant CONSOLE-RX 32762
|
||||||
constant CONSOLE-STATUS 16377
|
constant CONSOLE-STATUS 32761
|
||||||
constant BASE 16376
|
constant BASE 32760
|
||||||
constant TIB 63776
|
constant TIB 129312
|
||||||
constant >IN 16375
|
constant >IN 32759
|
||||||
constant SPAN 16374
|
constant SPAN 32758
|
||||||
constant WBUF 64856
|
constant WBUF 130392
|
||||||
constant (P) 16360
|
constant (P) 32744
|
||||||
constant DP 16373
|
constant DP 32757
|
||||||
constant (LATEST) 16372
|
constant (LATEST) 32756
|
||||||
constant DBASE 32768
|
constant DBASE 32768
|
||||||
constant DLIMIT 55296
|
constant DLIMIT 116864
|
||||||
constant PAD 63656
|
constant PAD 129192
|
||||||
constant (D) 16352
|
constant (D) 32736
|
||||||
constant (CG) 16336
|
constant (CG) 32720
|
||||||
constant CG-BSLOTS 3
|
constant CG-BSLOTS 3
|
||||||
constant STATE 16371
|
constant STATE 32755
|
||||||
constant (C) 16322
|
constant (C) 32706
|
||||||
constant (CFP) 16370
|
constant (CFP) 32754
|
||||||
constant (Q) 14673
|
constant (Q) 30065
|
||||||
constant (F) 16279
|
constant (F) 32663
|
||||||
constant (S) 15812
|
constant (S) 31204
|
||||||
constant (W) 16285
|
constant (W) 32669
|
||||||
constant (X) 15792
|
constant (X) 31184
|
||||||
constant (HOT) 15757
|
constant (HOT) 31149
|
||||||
constant (BOOT) 15715
|
constant (BOOT) 31107
|
||||||
constant (NEXT-ID) 15711
|
constant (NEXT-ID) 31103
|
||||||
constant (TOKENS) 15713
|
constant (TOKENS) 31105
|
||||||
constant (BOOT-ID) 15712
|
constant (BOOT-ID) 31104
|
||||||
constant (LOG-LEVEL) 14672
|
constant (LOG-LEVEL) 30064
|
||||||
constant (ACL-HOOK) 14671
|
constant (ACL-HOOK) 30063
|
||||||
constant SCR 15707
|
constant SCR 31099
|
||||||
constant BLK 15708
|
constant BLK 31100
|
||||||
constant (SRC) 15709
|
constant (SRC) 31101
|
||||||
constant (#SRC) 15706
|
constant (#SRC) 31098
|
||||||
constant (SRC-HOOK) 15710
|
constant (SRC-HOOK) 31102
|
||||||
constant (LINE-STATUS) 14668
|
constant (LINE-STATUS) 30060
|
||||||
constant (PORT) 14537
|
constant (PORT) 29929
|
||||||
constant (ME) 14664
|
constant (ME) 30056
|
||||||
constant (CONSOLE) 14661
|
constant (CONSOLE) 30053
|
||||||
constant (ROUTE#) 14660
|
constant (ROUTE#) 30052
|
||||||
constant (ROUTE-DEFAULT) 14659
|
constant (ROUTE-DEFAULT) 30051
|
||||||
constant (LOST) 14658
|
constant (LOST) 30050
|
||||||
constant (PRINT-TO) 14657
|
constant (PRINT-TO) 30049
|
||||||
constant (PRINT-PORT) 14644
|
constant (PRINT-PORT) 30036
|
||||||
constant (DONE-PORT) 14643
|
constant (DONE-PORT) 30035
|
||||||
constant (ROUTES) 14581
|
constant (ROUTES) 29973
|
||||||
constant -PORTS -8
|
constant -PORTS -8
|
||||||
constant (NEAR) 14613
|
constant (NEAR) 30005
|
||||||
constant (AWAIT-FROM) 14638
|
constant (AWAIT-FROM) 30030
|
||||||
constant (WIRE) 14549
|
constant (WIRE) 29941
|
||||||
constant (WIRE-A) 14550
|
constant (WIRE-A) 29942
|
||||||
constant (WIRE-B) 14551
|
constant (WIRE-B) 29943
|
||||||
constant (WIRE-DO) 14552
|
constant (WIRE-DO) 29944
|
||||||
constant (WIRE-HOW) 14553
|
constant (WIRE-HOW) 29945
|
||||||
constant (WIRE-HAVE) 14554
|
constant (WIRE-HAVE) 29946
|
||||||
constant (S-HAVE) 14642
|
constant (S-HAVE) 30034
|
||||||
constant (S-MASK) 14641
|
constant (S-MASK) 30033
|
||||||
constant (S-WIRE) 14640
|
constant (S-WIRE) 30032
|
||||||
constant (S-ON) 14639
|
constant (S-ON) 30031
|
||||||
constant (KEEP) 14637
|
constant (KEEP) 30029
|
||||||
constant (DEFER) 14636
|
constant (DEFER) 30028
|
||||||
constant (D-MASK) 14669
|
constant (D-MASK) 30061
|
||||||
constant (IN) 14621
|
constant (IN) 30013
|
||||||
constant (ONE) 14628
|
constant (ONE) 30020
|
||||||
constant (OUT-HDR) 14565
|
constant (OUT-HDR) 29957
|
||||||
constant (W-NEED) 14572
|
constant (W-NEED) 29964
|
||||||
constant (W-PORT) 14573
|
constant (W-PORT) 29965
|
||||||
constant (P-WAY) 14574
|
constant (P-WAY) 29966
|
||||||
constant (P-NEED) 14577
|
constant (P-NEED) 29969
|
||||||
constant (H-PORT) 14578
|
constant (H-PORT) 29970
|
||||||
constant (H-NEED) 14579
|
constant (H-NEED) 29971
|
||||||
constant (H-MASK) 14580
|
constant (H-MASK) 29972
|
||||||
constant (A-SELF) 14575
|
constant (A-SELF) 29967
|
||||||
constant (SEND^) 14576
|
constant (SEND^) 29968
|
||||||
constant (OUT-TEXT) 14213
|
constant (OUT-TEXT) 29605
|
||||||
constant (SEND-TEXT) 13877
|
constant (SEND-TEXT) 29269
|
||||||
constant (QUIET) 14667
|
constant (QUIET) 30059
|
||||||
constant (REFUSED) 14670
|
constant (REFUSED) 30062
|
||||||
constant (OUT^) 14663
|
constant (OUT^) 30055
|
||||||
constant (REPLY) 14662
|
constant (REPLY) 30054
|
||||||
constant (MSG) 14629
|
constant (MSG) 30021
|
||||||
constant (OUT) 14277
|
constant (OUT) 29669
|
||||||
constant (WORD-DEFINED) 14666
|
constant (WORD-DEFINED) 30058
|
||||||
constant (WORD-FORGOTTEN) 14665
|
constant (WORD-FORGOTTEN) 30057
|
||||||
constant BLOCK# -1
|
constant BLOCK# -1
|
||||||
constant BUFFER# -2
|
constant BUFFER# -2
|
||||||
constant UPDATE# -3
|
constant UPDATE# -3
|
||||||
constant SAVE-BUFFERS# -4
|
constant SAVE-BUFFERS# -4
|
||||||
constant EMPTY-BUFFERS# -5
|
constant EMPTY-BUFFERS# -5
|
||||||
constant (Q/) 15717
|
constant (Q/) 31109
|
||||||
constant (QE) 15722
|
constant (QE) 31114
|
||||||
constant (QR) 15730
|
constant (QR) 31122
|
||||||
constant (QL) 15735
|
constant (QL) 31127
|
||||||
constant (QT) 15742
|
constant (QT) 31134
|
||||||
constant (QP) 15748
|
constant (QP) 31140
|
||||||
constant (DP) 15752
|
constant (DP) 31144
|
||||||
constant ADDR-DIGITS 8
|
constant ADDR-DIGITS 8
|
||||||
constant MSB -2147483648
|
constant MSB -2147483648
|
||||||
constant MAXHI 2147483647
|
constant MAXHI 2147483647
|
||||||
@@ -108,26 +108,26 @@ constant 2N+15 79
|
|||||||
constant N-18 14
|
constant N-18 14
|
||||||
constant N-17 15
|
constant N-17 15
|
||||||
constant MAX-INT 2147483647
|
constant MAX-INT 2147483647
|
||||||
constant HLD 16359
|
constant HLD 32743
|
||||||
constant (FENCE) 16358
|
constant (FENCE) 32742
|
||||||
constant CONTEXT 16320
|
constant CONTEXT 32704
|
||||||
constant CURRENT 16321
|
constant CURRENT 32705
|
||||||
constant VOC-LINK 16334
|
constant VOC-LINK 32718
|
||||||
constant HEND 63248
|
constant HEND 124816
|
||||||
constant -HFLOOR -63186
|
constant -HFLOOR -124754
|
||||||
constant DSTACK-DEPTH 16369
|
constant DSTACK-DEPTH 32753
|
||||||
constant RSTACK-DEPTH 16368
|
constant RSTACK-DEPTH 32752
|
||||||
constant HEAT-OP 13824
|
constant HEAT-OP 29216
|
||||||
constant (EXEC) 14655
|
constant (EXEC) 30047
|
||||||
constant (RUNX) 14562
|
constant (RUNX) 29954
|
||||||
constant ANTICLOCK 13856
|
constant ANTICLOCK 29248
|
||||||
constant CFBASE 16288
|
constant CFBASE 32672
|
||||||
constant CFEND 16320
|
constant CFEND 32704
|
||||||
constant ROM-UM* 16384
|
constant ROM-UM* 32768
|
||||||
constant ROM-UM/MOD 16385
|
constant ROM-UM/MOD 32769
|
||||||
constant ROM-D+ 16386
|
constant ROM-D+ 32770
|
||||||
constant ROM-DNEGATE 16387
|
constant ROM-DNEGATE 32771
|
||||||
constant ROM-Q.* 16388
|
constant ROM-Q.* 32772
|
||||||
constant ROM-Q./ 16389
|
constant ROM-Q./ 32773
|
||||||
constant DICT-W 8192
|
constant DICT-W 8192
|
||||||
constant (IMG) 14558
|
constant (IMG) 29950
|
||||||
|
|||||||
+113
-113
@@ -1,105 +1,105 @@
|
|||||||
\ map-64.f18 -- the memory map the system's source is assembled with, 64-bit cells.
|
\ map-64.f18 -- the memory map the system's source is assembled with, 64-bit cells.
|
||||||
\ Generated by v4/tools/mkmap.c (mkmap sys) from v4/tests/host_map.h -- do not edit.
|
\ Generated by v4/tools/mkmap.c (mkmap sys) from v4/tests/host_map.h -- do not edit.
|
||||||
constant N-1 63
|
constant N-1 63
|
||||||
constant NODE-ERROR 16382
|
constant NODE-ERROR 32766
|
||||||
constant CONSOLE-TX 16380
|
constant CONSOLE-TX 32764
|
||||||
constant CONSOLE-RX 16378
|
constant CONSOLE-RX 32762
|
||||||
constant CONSOLE-STATUS 16377
|
constant CONSOLE-STATUS 32761
|
||||||
constant BASE 16376
|
constant BASE 32760
|
||||||
constant TIB 63776
|
constant TIB 129312
|
||||||
constant >IN 16375
|
constant >IN 32759
|
||||||
constant SPAN 16374
|
constant SPAN 32758
|
||||||
constant WBUF 64856
|
constant WBUF 130392
|
||||||
constant (P) 16360
|
constant (P) 32744
|
||||||
constant DP 16373
|
constant DP 32757
|
||||||
constant (LATEST) 16372
|
constant (LATEST) 32756
|
||||||
constant DBASE 32768
|
constant DBASE 32768
|
||||||
constant DLIMIT 55296
|
constant DLIMIT 116864
|
||||||
constant PAD 63656
|
constant PAD 129192
|
||||||
constant (D) 16352
|
constant (D) 32736
|
||||||
constant (CG) 16336
|
constant (CG) 32720
|
||||||
constant CG-BSLOTS 3
|
constant CG-BSLOTS 3
|
||||||
constant STATE 16371
|
constant STATE 32755
|
||||||
constant (C) 16322
|
constant (C) 32706
|
||||||
constant (CFP) 16370
|
constant (CFP) 32754
|
||||||
constant (Q) 14673
|
constant (Q) 30065
|
||||||
constant (F) 16279
|
constant (F) 32663
|
||||||
constant (S) 15812
|
constant (S) 31204
|
||||||
constant (W) 16285
|
constant (W) 32669
|
||||||
constant (X) 15792
|
constant (X) 31184
|
||||||
constant (HOT) 15757
|
constant (HOT) 31149
|
||||||
constant (BOOT) 15715
|
constant (BOOT) 31107
|
||||||
constant (NEXT-ID) 15711
|
constant (NEXT-ID) 31103
|
||||||
constant (TOKENS) 15713
|
constant (TOKENS) 31105
|
||||||
constant (BOOT-ID) 15712
|
constant (BOOT-ID) 31104
|
||||||
constant (LOG-LEVEL) 14672
|
constant (LOG-LEVEL) 30064
|
||||||
constant (ACL-HOOK) 14671
|
constant (ACL-HOOK) 30063
|
||||||
constant SCR 15707
|
constant SCR 31099
|
||||||
constant BLK 15708
|
constant BLK 31100
|
||||||
constant (SRC) 15709
|
constant (SRC) 31101
|
||||||
constant (#SRC) 15706
|
constant (#SRC) 31098
|
||||||
constant (SRC-HOOK) 15710
|
constant (SRC-HOOK) 31102
|
||||||
constant (LINE-STATUS) 14668
|
constant (LINE-STATUS) 30060
|
||||||
constant (PORT) 14537
|
constant (PORT) 29929
|
||||||
constant (ME) 14664
|
constant (ME) 30056
|
||||||
constant (CONSOLE) 14661
|
constant (CONSOLE) 30053
|
||||||
constant (ROUTE#) 14660
|
constant (ROUTE#) 30052
|
||||||
constant (ROUTE-DEFAULT) 14659
|
constant (ROUTE-DEFAULT) 30051
|
||||||
constant (LOST) 14658
|
constant (LOST) 30050
|
||||||
constant (PRINT-TO) 14657
|
constant (PRINT-TO) 30049
|
||||||
constant (PRINT-PORT) 14644
|
constant (PRINT-PORT) 30036
|
||||||
constant (DONE-PORT) 14643
|
constant (DONE-PORT) 30035
|
||||||
constant (ROUTES) 14581
|
constant (ROUTES) 29973
|
||||||
constant -PORTS -8
|
constant -PORTS -8
|
||||||
constant (NEAR) 14613
|
constant (NEAR) 30005
|
||||||
constant (AWAIT-FROM) 14638
|
constant (AWAIT-FROM) 30030
|
||||||
constant (WIRE) 14549
|
constant (WIRE) 29941
|
||||||
constant (WIRE-A) 14550
|
constant (WIRE-A) 29942
|
||||||
constant (WIRE-B) 14551
|
constant (WIRE-B) 29943
|
||||||
constant (WIRE-DO) 14552
|
constant (WIRE-DO) 29944
|
||||||
constant (WIRE-HOW) 14553
|
constant (WIRE-HOW) 29945
|
||||||
constant (WIRE-HAVE) 14554
|
constant (WIRE-HAVE) 29946
|
||||||
constant (S-HAVE) 14642
|
constant (S-HAVE) 30034
|
||||||
constant (S-MASK) 14641
|
constant (S-MASK) 30033
|
||||||
constant (S-WIRE) 14640
|
constant (S-WIRE) 30032
|
||||||
constant (S-ON) 14639
|
constant (S-ON) 30031
|
||||||
constant (KEEP) 14637
|
constant (KEEP) 30029
|
||||||
constant (DEFER) 14636
|
constant (DEFER) 30028
|
||||||
constant (D-MASK) 14669
|
constant (D-MASK) 30061
|
||||||
constant (IN) 14621
|
constant (IN) 30013
|
||||||
constant (ONE) 14628
|
constant (ONE) 30020
|
||||||
constant (OUT-HDR) 14565
|
constant (OUT-HDR) 29957
|
||||||
constant (W-NEED) 14572
|
constant (W-NEED) 29964
|
||||||
constant (W-PORT) 14573
|
constant (W-PORT) 29965
|
||||||
constant (P-WAY) 14574
|
constant (P-WAY) 29966
|
||||||
constant (P-NEED) 14577
|
constant (P-NEED) 29969
|
||||||
constant (H-PORT) 14578
|
constant (H-PORT) 29970
|
||||||
constant (H-NEED) 14579
|
constant (H-NEED) 29971
|
||||||
constant (H-MASK) 14580
|
constant (H-MASK) 29972
|
||||||
constant (A-SELF) 14575
|
constant (A-SELF) 29967
|
||||||
constant (SEND^) 14576
|
constant (SEND^) 29968
|
||||||
constant (OUT-TEXT) 14213
|
constant (OUT-TEXT) 29605
|
||||||
constant (SEND-TEXT) 13877
|
constant (SEND-TEXT) 29269
|
||||||
constant (QUIET) 14667
|
constant (QUIET) 30059
|
||||||
constant (REFUSED) 14670
|
constant (REFUSED) 30062
|
||||||
constant (OUT^) 14663
|
constant (OUT^) 30055
|
||||||
constant (REPLY) 14662
|
constant (REPLY) 30054
|
||||||
constant (MSG) 14629
|
constant (MSG) 30021
|
||||||
constant (OUT) 14277
|
constant (OUT) 29669
|
||||||
constant (WORD-DEFINED) 14666
|
constant (WORD-DEFINED) 30058
|
||||||
constant (WORD-FORGOTTEN) 14665
|
constant (WORD-FORGOTTEN) 30057
|
||||||
constant BLOCK# -1
|
constant BLOCK# -1
|
||||||
constant BUFFER# -2
|
constant BUFFER# -2
|
||||||
constant UPDATE# -3
|
constant UPDATE# -3
|
||||||
constant SAVE-BUFFERS# -4
|
constant SAVE-BUFFERS# -4
|
||||||
constant EMPTY-BUFFERS# -5
|
constant EMPTY-BUFFERS# -5
|
||||||
constant (Q/) 15717
|
constant (Q/) 31109
|
||||||
constant (QE) 15722
|
constant (QE) 31114
|
||||||
constant (QR) 15730
|
constant (QR) 31122
|
||||||
constant (QL) 15735
|
constant (QL) 31127
|
||||||
constant (QT) 15742
|
constant (QT) 31134
|
||||||
constant (QP) 15748
|
constant (QP) 31140
|
||||||
constant (DP) 15752
|
constant (DP) 31144
|
||||||
constant ADDR-DIGITS 16
|
constant ADDR-DIGITS 16
|
||||||
constant MSB -9223372036854775808
|
constant MSB -9223372036854775808
|
||||||
constant MAXHI 9223372036854775807
|
constant MAXHI 9223372036854775807
|
||||||
@@ -108,26 +108,26 @@ constant 2N+15 143
|
|||||||
constant N-18 46
|
constant N-18 46
|
||||||
constant N-17 47
|
constant N-17 47
|
||||||
constant MAX-INT 9223372036854775807
|
constant MAX-INT 9223372036854775807
|
||||||
constant HLD 16359
|
constant HLD 32743
|
||||||
constant (FENCE) 16358
|
constant (FENCE) 32742
|
||||||
constant CONTEXT 16320
|
constant CONTEXT 32704
|
||||||
constant CURRENT 16321
|
constant CURRENT 32705
|
||||||
constant VOC-LINK 16334
|
constant VOC-LINK 32718
|
||||||
constant HEND 63248
|
constant HEND 124816
|
||||||
constant -HFLOOR -63186
|
constant -HFLOOR -124754
|
||||||
constant DSTACK-DEPTH 16369
|
constant DSTACK-DEPTH 32753
|
||||||
constant RSTACK-DEPTH 16368
|
constant RSTACK-DEPTH 32752
|
||||||
constant HEAT-OP 13824
|
constant HEAT-OP 29216
|
||||||
constant (EXEC) 14655
|
constant (EXEC) 30047
|
||||||
constant (RUNX) 14562
|
constant (RUNX) 29954
|
||||||
constant ANTICLOCK 13856
|
constant ANTICLOCK 29248
|
||||||
constant CFBASE 16288
|
constant CFBASE 32672
|
||||||
constant CFEND 16320
|
constant CFEND 32704
|
||||||
constant ROM-UM* 16384
|
constant ROM-UM* 32768
|
||||||
constant ROM-UM/MOD 16385
|
constant ROM-UM/MOD 32769
|
||||||
constant ROM-D+ 16386
|
constant ROM-D+ 32770
|
||||||
constant ROM-DNEGATE 16387
|
constant ROM-DNEGATE 32771
|
||||||
constant ROM-Q.* 16388
|
constant ROM-Q.* 32772
|
||||||
constant ROM-Q./ 16389
|
constant ROM-Q./ 32773
|
||||||
constant DICT-W 8192
|
constant DICT-W 8192
|
||||||
constant (IMG) 14558
|
constant (IMG) 29950
|
||||||
|
|||||||
@@ -178,7 +178,7 @@ definition below depends on one, it says so.
|
|||||||
| **D-14** | An address outside the node's memory (ruled 2026-10-04). | **Guarded: an address fault.** Every address a running programme uses is checked before it is used — `P` when an instruction word or an `@p` literal is fetched or `!p` stores, `A` for `@ @+ ! !+`, `B` for `@b !b`. Outside `0 … memory size − 1` the opcode does nothing (no fetch, no store, `A` and `B` untouched), the rest of its instruction word is not executed, both stacks are emptied (D-16), and `P` becomes the node's **fault handler** for that kind of fault. The handler does not return to the programme. On the host node the handler is `(FAULT)` (`v4/capsule/quit.v4`): it prints `Address out of range`, ends any definition that was open, prints ` ERROR` and returns to the prompt, from however deep the fault was. A node with no handler stops. v3 printed ` ERROR` alone. What a mesh node's handler does — it has no console — comes with the mesh (step 2). Executed on the golden model (2026-10-04): `tests/test_exec.c` for every memory opcode and for `P`, `tests/test_host_quit.c` from the prompt. |
|
| **D-14** | An address outside the node's memory (ruled 2026-10-04). | **Guarded: an address fault.** Every address a running programme uses is checked before it is used — `P` when an instruction word or an `@p` literal is fetched or `!p` stores, `A` for `@ @+ ! !+`, `B` for `@b !b`. Outside `0 … memory size − 1` the opcode does nothing (no fetch, no store, `A` and `B` untouched), the rest of its instruction word is not executed, both stacks are emptied (D-16), and `P` becomes the node's **fault handler** for that kind of fault. The handler does not return to the programme. On the host node the handler is `(FAULT)` (`v4/capsule/quit.v4`): it prints `Address out of range`, ends any definition that was open, prints ` ERROR` and returns to the prompt, from however deep the fault was. A node with no handler stops. v3 printed ` ERROR` alone. What a mesh node's handler does — it has no console — comes with the mesh (step 2). Executed on the golden model (2026-10-04): `tests/test_exec.c` for every memory opcode and for `P`, `tests/test_host_quit.c` from the prompt. |
|
||||||
| **D-15** | Division by zero in `/` `MOD` `/MOD` `*/` `*/MOD` `M/MOD` (ruled 2026-10-04). | **Guarded: the word reports it and the line ends.** Each of these words tests its divisor before anything else. If it is zero the word prints v3's message, its own name and `: Division by zero`, takes its operands off the stack as v3 does, ends any definition that was open, prints ` ERROR` and returns to the prompt, from however deep; its caller is not returned to. `M/MOD` says so too, where v3 printed ` ERROR` alone. Source in `v4/capsule/forth.v4`; executed on the golden model's host node (2026-10-04), including transcripts of the v3 binary. `Q./` keeps D-11 (saturate and flag). `UM/MOD` and `SM/REM` are internal and unguarded: their callers have checked. What a mesh node, with no console, does on a zero divisor comes with the mesh (step 2); §4's definitions, which the mesh-node tests execute, still leave it unspecified. |
|
| **D-15** | Division by zero in `/` `MOD` `/MOD` `*/` `*/MOD` `M/MOD` (ruled 2026-10-04). | **Guarded: the word reports it and the line ends.** Each of these words tests its divisor before anything else. If it is zero the word prints v3's message, its own name and `: Division by zero`, takes its operands off the stack as v3 does, ends any definition that was open, prints ` ERROR` and returns to the prompt, from however deep; its caller is not returned to. `M/MOD` says so too, where v3 printed ` ERROR` alone. Source in `v4/capsule/forth.v4`; executed on the golden model's host node (2026-10-04), including transcripts of the v3 binary. `Q./` keeps D-11 (saturate and flag). `UM/MOD` and `SM/REM` are internal and unguarded: their callers have checked. What a mesh node, with no console, does on a zero divisor comes with the mesh (step 2); §4's definitions, which the mesh-node tests execute, still leave it unspecified. |
|
||||||
| **D-16** | Stack overflow and underflow; `DEPTH`, `PICK`, `ROLL` (ruled 2026-10-04; revises D-2). | **Guarded: a stack fault.** Each stack counts what it holds. Before every opcode the node checks that the stacks hold what the opcode takes — including a `T` or `S` it only reads — and have room for what it leaves. If not, the opcode does nothing and the node faults exactly as for a bad address (D-14), to that kind's handler: `Stack overflow`, `Stack underflow`, `Return stack overflow`, `Return stack underflow`, then ` ERROR` and the prompt. **Every fault, D-14's included, empties both stacks**: the handler does not return, and what a word stopped part-way has left on the data stack is of no use to its caller. (v3 keeps what the failing word had not taken, and names the word: `DROP: Stack underflow`.) The fault handler is a table of five words, one per kind, each a jump (`(FAULTS)` in `v4/capsule/quit.v4`). Two registers (§7) are all a programme sees of the stacks: `DSTACK-DEPTH` and `RSTACK-DEPTH` read as the depth, and a store to one empties that stack. There is still no stack pointer and no address for a stack cell, so `SP@` and `SP!` stay retired; `.S` waits for number output to reach the capsule. The sizes were unchanged by this ruling, 10 and 9 (D-17 then deepens the host node's): one more value, or one more level of call, is now an error message where it used to be silent corruption. Executed on the golden model (2026-10-04): `tests/test_exec.c` for every opcode at every depth of both stacks, `tests/test_host_quit.c` from the prompt. |
|
| **D-16** | Stack overflow and underflow; `DEPTH`, `PICK`, `ROLL` (ruled 2026-10-04; revises D-2). | **Guarded: a stack fault.** Each stack counts what it holds. Before every opcode the node checks that the stacks hold what the opcode takes — including a `T` or `S` it only reads — and have room for what it leaves. If not, the opcode does nothing and the node faults exactly as for a bad address (D-14), to that kind's handler: `Stack overflow`, `Stack underflow`, `Return stack overflow`, `Return stack underflow`, then ` ERROR` and the prompt. **Every fault, D-14's included, empties both stacks**: the handler does not return, and what a word stopped part-way has left on the data stack is of no use to its caller. (v3 keeps what the failing word had not taken, and names the word: `DROP: Stack underflow`.) The fault handler is a table of five words, one per kind, each a jump (`(FAULTS)` in `v4/capsule/quit.v4`). Two registers (§7) are all a programme sees of the stacks: `DSTACK-DEPTH` and `RSTACK-DEPTH` read as the depth, and a store to one empties that stack. There is still no stack pointer and no address for a stack cell, so `SP@` and `SP!` stay retired; `.S` waits for number output to reach the capsule. The sizes were unchanged by this ruling, 10 and 9 (D-17 then deepens the host node's): one more value, or one more level of call, is now an error message where it used to be silent corruption. Executed on the golden model (2026-10-04): `tests/test_exec.c` for every opcode at every depth of both stacks, `tests/test_host_quit.c` from the prompt. |
|
||||||
| **D-17** | Stack sizes on the host node (2026-10-04, following D-16). | **32 values and 32 return entries on the host node; a mesh node keeps the F18's 10 and 9.** Once the stacks are counted (D-16) their size is a parameter of the node, like its memory, and the host node is the one that runs the interpreter and the compiler underneath the user's programme: at 10 and 9 the prompt left a programme about six values, and `/` could be used only four words deep. The mechanism is the same at both sizes — top registers over a ring — and so is every word's definition. v3's stacks are deeper still. In the golden model the sizes are `V4_DATA_RING` and `V4_RET_RING` (`stack.h`), set for the host-node tests in `v4/Makefile`. |
|
| **D-17** | Stack sizes on the host node (2026-10-04, following D-16). | **32 values and 32 return entries on the host node; a mesh node keeps the F18's 10 and 9.** Once the stacks are counted (D-16) their size is a parameter of the node, like its memory, and the host node is the one that runs the interpreter and the compiler underneath the user's programme: at 10 and 9 the prompt left a programme about six values, and `/` could be used only four words deep. The mechanism is the same at both sizes — top registers over a ring — and so is every word's definition. v3's stacks are deeper still. In the golden model the sizes are `V4_DATA_RING` and `V4_RET_RING` (`stack.h`), set for the host-node tests in `v4/Makefile`. **Revised 2026-11-14 (#189 Phase 7; Captain Bob: "Enlarge v4 to fit" v3's whole POST): 1024 values, v3's depth, and still 32 return entries; the node's memory 32768 words, not 16384** -- v3's cases push 900 values, and its whole run with `ALLOT` of 8K does not fit the dictionary at 16384. In `v4/Makefile` and `kernel/Makefile` alike. |
|
||||||
| **D-18** | Every other error (ruled 2026-10-04: "guard all errors"). | **A word that finds an error raises it, and the line ends there.** The word takes its own arguments off the stack and stores an error code in `NODE-ERROR` (§7). On a node with a prompt that store is a trap, a sixth kind of fault beside D-14's and D-16's: nothing after it executes, the return stack is emptied, and the prompt prints the code's message, ends any definition that was open, prints ` ERROR` and waits for the next line. Unlike the other faults it leaves the data stack as the word left it. The codes: 1 `Negative count` (`CMOVE`, `TYPE`), 2 `Not a number` (`NUMBER`), 3 `Number too long` (`HOLD` into a full buffer), 4 `Not a character` (`HOLD`), 5 `Dictionary full` (`,` `C,` `ALLOT`, any defining word), 6 `Name missing` (a defining word with nothing after it), 7 `Control structure mismatch`, 8 `Control structures too deep`, 9 `Shift count out of range`, 10 `Protected word`, 11 `Division by zero` (`Q./`), 12 `Argument out of range`, 13 `Block out of range`, 14 `No block is being loaded`, 15 `Deferred word not set`, 16 `Not a word`; −1 means the word printed its own message (`UNKNOWN WORD: 'xxx'`, `xxx: compile-only`). Before this ruling these set the flag and the line ran on to its end. v3 stops at once too; its messages name the word (`LOOP: missing DO`) where v4's name the fault. With the trap not attached `NODE-ERROR` is plain memory and the word returns, which is how the words are tested below the prompt. D-11, D-12 and D-13 said "set `NODE-ERROR`"; on a node with a prompt that now means this. Executed on the golden model (2026-10-04): `tests/test_exec.c`, `tests/test_host_quit.c`. |
|
| **D-18** | Every other error (ruled 2026-10-04: "guard all errors"). | **A word that finds an error raises it, and the line ends there.** The word takes its own arguments off the stack and stores an error code in `NODE-ERROR` (§7). On a node with a prompt that store is a trap, a sixth kind of fault beside D-14's and D-16's: nothing after it executes, the return stack is emptied, and the prompt prints the code's message, ends any definition that was open, prints ` ERROR` and waits for the next line. Unlike the other faults it leaves the data stack as the word left it. The codes: 1 `Negative count` (`CMOVE`, `TYPE`), 2 `Not a number` (`NUMBER`), 3 `Number too long` (`HOLD` into a full buffer), 4 `Not a character` (`HOLD`), 5 `Dictionary full` (`,` `C,` `ALLOT`, any defining word), 6 `Name missing` (a defining word with nothing after it), 7 `Control structure mismatch`, 8 `Control structures too deep`, 9 `Shift count out of range`, 10 `Protected word`, 11 `Division by zero` (`Q./`), 12 `Argument out of range`, 13 `Block out of range`, 14 `No block is being loaded`, 15 `Deferred word not set`, 16 `Not a word`; −1 means the word printed its own message (`UNKNOWN WORD: 'xxx'`, `xxx: compile-only`). Before this ruling these set the flag and the line ran on to its end. v3 stops at once too; its messages name the word (`LOOP: missing DO`) where v4's name the fault. With the trap not attached `NODE-ERROR` is plain memory and the word returns, which is how the words are tested below the prompt. D-11, D-12 and D-13 said "set `NODE-ERROR`"; on a node with a prompt that now means this. Executed on the golden model (2026-10-04): `tests/test_exec.c`, `tests/test_host_quit.c`. |
|
||||||
| **D-19** | Block storage on the golden model (2026-10-05). **Replaced 2026-10-07:** the four registers are gone; the block words are kernel requests on port 0, by block number, and the kernel keeps the node's window of four slots (`MESH.md` section 8, `v4/include/v4/blocks.h`). What follows is the decision as it was. | **Four memory-mapped registers on the host node, until the mesh carries the storage service.** `BLOCK-NUMBER`, `BLOCK-ADDRESS` (the word address of 256 cells), `BLOCK-COMMAND` (a store of 1 reads the block into those cells, 2 writes it from them) and `BLOCK-STATUS` (0 when the command worked, −1 for a block the device has not got or cells not all in memory). A block is 1024 bytes: 256 cells, four bytes to a cell, the first byte lowest, at either cell width. This is the console's arrangement (§7) applied to storage; like it, it is the model's stand-in and not the mesh protocol, which §5.11 still leaves to the device node. |
|
| **D-19** | Block storage on the golden model (2026-10-05). **Replaced 2026-10-07:** the four registers are gone; the block words are kernel requests on port 0, by block number, and the kernel keeps the node's window of four slots (`MESH.md` section 8, `v4/include/v4/blocks.h`). What follows is the decision as it was. | **Four memory-mapped registers on the host node, until the mesh carries the storage service.** `BLOCK-NUMBER`, `BLOCK-ADDRESS` (the word address of 256 cells), `BLOCK-COMMAND` (a store of 1 reads the block into those cells, 2 writes it from them) and `BLOCK-STATUS` (0 when the command worked, −1 for a block the device has not got or cells not all in memory). A block is 1024 bytes: 256 cells, four bytes to a cell, the first byte lowest, at either cell width. This is the console's arrangement (§7) applied to storage; like it, it is the model's stand-in and not the mesh protocol, which §5.11 still leaves to the device node. |
|
||||||
|
|
||||||
|
|||||||
@@ -140,3 +140,26 @@ Settled under the rulings above, without a question:
|
|||||||
- `CMOVE>.bounds` and `THRU.negative_end` dropped (no standard asks for the error); the cases that write
|
- `CMOVE>.bounds` and `THRU.negative_end` dropped (no standard asks for the error); the cases that write
|
||||||
through `HERE` as a byte address -- `CMOVE>`, `BLANK`, `ERASE`, `FILL` -- in v4's units (they wrote into
|
through `HERE` as a byte address -- `CMOVE>`, `BLANK`, `ERASE`, `FILL` -- in v4's units (they wrote into
|
||||||
the system's code).
|
the system's code).
|
||||||
|
|
||||||
|
## 6. Result (2026-11-14): v3's whole POST is v4's POST
|
||||||
|
|
||||||
|
**990 cases, all passed on Hera** (`PARITY:V4_POST tests=990 pass=990 fail=0`; mesh-boot), the hosted product
|
||||||
|
945 of them (all passed): the 45 cases of the words `capsules/v4/physics.4th` defines ask the kernel, and a node
|
||||||
|
with no kernel has none of them (`V4_POST_KERNEL`, `v4_post_host.kernel`). The table is `mkpost.py --all`
|
||||||
|
(`make -C v4 post79`); every case not taken as v3 ran it is listed, with its reason, in `POST.md`; the floor
|
||||||
|
(`v4/system/POST_FLOOR`) is 990.
|
||||||
|
|
||||||
|
- **990, not 1010:** v3's Mama module marks its cases `MAMA_IMPLEMENTED`, which is 0 -- v3's own POST skips
|
||||||
|
all 20 ("Mama FORTH words ... are kernel runtime objects ... Mark all tests skipped"). `mkpost.py` took any
|
||||||
|
flag but a literal `0` as implemented; it now reads a module's `#define`s. v4's Mama words (ruled: v4 words
|
||||||
|
with v3's names, in F18 and StarForth) are therefore not part of this acceptance: v3's POST has no case of them.
|
||||||
|
- **Enlarged, as ruled:** a node is 32768 words (was 16384) and its data stack 1024 deep (was 32), host and
|
||||||
|
kernel alike (`v4/Makefile` HOST_WORDS/HOST_DATA_RING, `kernel/Makefile` V4_DEFS); the dictionary's end
|
||||||
|
moves with them (`host_map.h`, DICT_END_W = SEND_TEXT - 53). The return stack stays 32.
|
||||||
|
- **POST's runner:** it compares every value a case leaves, not the top 32 (v3's cases leave 101); and a
|
||||||
|
new kind, `V4_POST_HEAD`, compares how a printout begins -- the form of `TOP-WORDS` and `WORD-ENTROPY`,
|
||||||
|
whose values are the run's own.
|
||||||
|
- **Cases written as meant** (v3's table says they run, but as written no FORTH runs them):
|
||||||
|
`DATA_STRUCTURES.stack_min_max` (VARIABLE run inside a definition took '42' for its name, and hid the number
|
||||||
|
from every case after it) and `COMPLETE_PROGRAMS.array_sum` (`: ARRAY 5 CELLS ALLOT ;` names nothing).
|
||||||
|
- **mkpost cuts no line between a word and the name it takes** (`: T20` cut after the `:` was "Name missing").
|
||||||
|
|||||||
File diff suppressed because it is too large
Load Diff
+1
-1
@@ -723,7 +723,7 @@ endif
|
|||||||
V4_DEFAULT ?= 1
|
V4_DEFAULT ?= 1
|
||||||
ifeq ($(STARFORTH_V4),1)
|
ifeq ($(STARFORTH_V4),1)
|
||||||
V4_DEFS := -DSTARFORTH_V4=1 -DSK_V4_DEFAULT=$(V4_DEFAULT) -Iv4/include \
|
V4_DEFS := -DSTARFORTH_V4=1 -DSK_V4_DEFAULT=$(V4_DEFAULT) -Iv4/include \
|
||||||
-DV4_CELL_BITS=64 -DV4_NODE_WORDS=16384 -DV4_DATA_RING=30 -DV4_RET_RING=31 -DV4_ROM_WORDS=4096 \
|
-DV4_CELL_BITS=64 -DV4_NODE_WORDS=32768 -DV4_DATA_RING=1022 -DV4_RET_RING=31 -DV4_ROM_WORDS=4096 \
|
||||||
-DSTICK_GROW_MIN_BYTES=$(STICK_GROW_MIN_BYTES)ULL -DSTICK_ARTEMIS_CAP_GIB=$(STICK_ARTEMIS_CAP_GIB)ULL
|
-DSTICK_GROW_MIN_BYTES=$(STICK_GROW_MIN_BYTES)ULL -DSTICK_ARTEMIS_CAP_GIB=$(STICK_ARTEMIS_CAP_GIB)ULL
|
||||||
KERNEL_CFLAGS += $(V4_DEFS)
|
KERNEL_CFLAGS += $(V4_DEFS)
|
||||||
LOADER_CFLAGS += $(V4_DEFS)
|
LOADER_CFLAGS += $(V4_DEFS)
|
||||||
|
|||||||
+20
-12
@@ -45,11 +45,18 @@ BINDIR := $(HERE)/build
|
|||||||
# do not fit 1024 words. Tests named test_host_*.c are therefore built with a
|
# do not fit 1024 words. Tests named test_host_*.c are therefore built with a
|
||||||
# host node of HOST_WORDS words; every other test keeps the mesh-node size.
|
# host node of HOST_WORDS words; every other test keeps the mesh-node size.
|
||||||
#
|
#
|
||||||
# The host node's stacks are deeper too (DECOMPOSITION.md D-17): 32 values and
|
# The host node's stacks are deeper too (DECOMPOSITION.md D-17): 1024 values and
|
||||||
# 32 return entries, where a mesh node has the F18's 10 and 9. The stack is
|
# 32 return entries, where a mesh node has the F18's 10 and 9. The stack is
|
||||||
# its top registers and a ring; the ring sizes are what is set here.
|
# its top registers and a ring; the ring sizes are what is set here.
|
||||||
HOST_WORDS := 16384
|
# Enlarged 2026-11-14 (#189 Phase 7, Captain Bob: "Enlarge v4 to fit" v3's whole
|
||||||
HOST_DATA_RING := 30
|
# POST): 32768 words, not 16384, so the dictionary holds the whole run and v3's
|
||||||
|
# ALLOT 8K; a data stack of 1024, v3's, not 32, for v3's 900-deep cases.
|
||||||
|
HOST_WORDS := 32768
|
||||||
|
HOST_DATA_RING := 1022
|
||||||
|
# hosted-check's deep lines (29 and 26 when the stack was 32): one value past what a line may leave (the prompt
|
||||||
|
# keeps four cells), and as many as WORDS can print with
|
||||||
|
DEEP_OVER := $(shell expr $(HOST_DATA_RING) - 1)
|
||||||
|
DEEP_WORDS := $(shell expr $(HOST_DATA_RING) - 4)
|
||||||
HOST_RET_RING := 31
|
HOST_RET_RING := 31
|
||||||
# The host node's ROM range (docs/v4.0.0/MACHINE.md section 2): words above
|
# The host node's ROM range (docs/v4.0.0/MACHINE.md section 2): words above
|
||||||
# RAM that the machine can fetch and run but never write. Its size is
|
# RAM that the machine can fetch and run but never write. Its size is
|
||||||
@@ -219,8 +226,9 @@ $(foreach i,$(HOSTED_ISAS),$(eval $(call HOSTED_RULE,$(i))))
|
|||||||
|
|
||||||
# `make post` boots the amd64 system alone, which is the quick check after a
|
# `make post` boots the amd64 system alone, which is the quick check after a
|
||||||
# change to the vocabulary: nucleus, forth79.4th, POST, prompt. `make
|
# change to the vocabulary: nucleus, forth79.4th, POST, prompt. `make
|
||||||
# post79` writes POST's cases, system/post_cases.c, again from
|
# post79` writes POST's cases, system/post_cases.c, again from v3's whole
|
||||||
# v3's cases and tools/post79_rules.py (tools/mkpost.py), with the hosted v3
|
# POST (#189 Phase 7: every module, --all) and tools/post79_rules.py and
|
||||||
|
# tools/post_all_rules.py (tools/mkpost.py; docs/v4.0.0/POST.md), with the hosted v3
|
||||||
# binary built first from this tree's source -- v3/Makefile, in its own build
|
# binary built first from this tree's source -- v3/Makefile, in its own build
|
||||||
# directory; not the lfs/ copy, which can be older (#190).
|
# directory; not the lfs/ copy, which can be older (#190).
|
||||||
V3_HOSTED = $(shell $(MAKE) -s -C $(ROOT) -f v3/Makefile --eval 'v3bin: ; @echo $$(BINARY)' v3bin 2>/dev/null)
|
V3_HOSTED = $(shell $(MAKE) -s -C $(ROOT) -f v3/Makefile --eval 'v3bin: ; @echo $$(BINARY)' v3bin 2>/dev/null)
|
||||||
@@ -229,7 +237,7 @@ post: $(BINDIR)/starforth4-amd64
|
|||||||
@$(BINDIR)/starforth4-amd64 < /dev/null
|
@$(BINDIR)/starforth4-amd64 < /dev/null
|
||||||
post79:
|
post79:
|
||||||
$(MAKE) --no-print-directory -C $(ROOT) -f v3/Makefile $(V3_HOSTED)
|
$(MAKE) --no-print-directory -C $(ROOT) -f v3/Makefile $(V3_HOSTED)
|
||||||
python3 $(HERE)/tools/mkpost.py --v3 $(ROOT)/$(V3_HOSTED)
|
python3 $(HERE)/tools/mkpost.py --all --v3 $(ROOT)/$(V3_HOSTED)
|
||||||
|
|
||||||
# `make hosted` builds the three. `make hosted-check` boots each with no
|
# `make hosted` builds the three. `make hosted-check` boots each with no
|
||||||
# input and requires that all three print the same lines, ending in
|
# input and requires that all three print the same lines, ending in
|
||||||
@@ -255,14 +263,14 @@ hosted-check: $(foreach i,$(HOSTED_ISAS),$(BINDIR)/boot-$(i).txt) $(BINDIR)/star
|
|||||||
@grep -q "^ok> UNKNOWN WORD: 'T{'$$" $(BINDIR)/after-post-amd64.txt || { echo "hosted-check: POST's harness is on the node"; exit 1; }
|
@grep -q "^ok> UNKNOWN WORD: 'T{'$$" $(BINDIR)/after-post-amd64.txt || { echo "hosted-check: POST's harness is on the node"; exit 1; }
|
||||||
@printf '5 7 PORT!\n1 2 + .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/noone-amd64.txt 2>&1; true
|
@printf '5 7 PORT!\n1 2 + .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/noone-amd64.txt 2>&1; true
|
||||||
@grep -q '^ok> No one on that port$$' $(BINDIR)/noone-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/noone-amd64.txt || { echo "hosted-check: a write to a port with no one on it was not an error the node came back from"; cat $(BINDIR)/noone-amd64.txt | tail -4; exit 1; }
|
@grep -q '^ok> No one on that port$$' $(BINDIR)/noone-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/noone-amd64.txt || { echo "hosted-check: a write to a port with no one on it was not an error the node came back from"; cat $(BINDIR)/noone-amd64.txt | tail -4; exit 1; }
|
||||||
@printf '65536 0 0 0 Q./\n3 .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/qdiv-amd64.txt 2>&1; true
|
@printf '65536 0 0 0 Q./ D.\n3 .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/qdiv-amd64.txt 2>&1; true
|
||||||
@grep -q '^ok> Division by zero$$' $(BINDIR)/qdiv-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/qdiv-amd64.txt || { echo "hosted-check: a division by zero inside the ROM's Q./ was not an error the node came back from"; tail -4 $(BINDIR)/qdiv-amd64.txt; exit 1; }
|
@grep -q '^ok> 0 ok$$' $(BINDIR)/qdiv-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/qdiv-amd64.txt || { echo "hosted-check: a division by zero inside the ROM's Q./ did not give 0 and come back (v3's table, ruled 2026-11-14)"; tail -4 $(BINDIR)/qdiv-amd64.txt; exit 1; }
|
||||||
@printf '5 AWAIT\n1 2 + .\n7 8 * .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/await-amd64.txt 2>&1; true
|
@printf '5 AWAIT\n1 2 + .\n7 8 * .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/await-amd64.txt 2>&1; true
|
||||||
@grep -q '^ok> Interrupted$$' $(BINDIR)/await-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/await-amd64.txt && grep -q '^ok> 56 ok$$' $(BINDIR)/await-amd64.txt || { echo "hosted-check: a line typed while the node waited did not break the wait and then run"; tail -6 $(BINDIR)/await-amd64.txt; exit 1; }
|
@grep -q '^ok> Interrupted$$' $(BINDIR)/await-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/await-amd64.txt && grep -q '^ok> 56 ok$$' $(BINDIR)/await-amd64.txt || { echo "hosted-check: a line typed while the node waited did not break the wait and then run"; tail -6 $(BINDIR)/await-amd64.txt; exit 1; }
|
||||||
@printf '1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29\n1 2 + .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/deep-amd64.txt 2>&1; true
|
@printf ': P %d 0 DO I LOOP ; P\n1 2 + .\n' $(DEEP_OVER) | $(BINDIR)/starforth4-amd64 > $(BINDIR)/deep-amd64.txt 2>&1; true
|
||||||
@grep -q '^ok> Stack overflow$$' $(BINDIR)/deep-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/deep-amd64.txt || { echo "hosted-check: a line that left 29 values on the stack was not an error the node came back from"; tail -4 $(BINDIR)/deep-amd64.txt; exit 1; }
|
@grep -q '^ok> Stack overflow$$' $(BINDIR)/deep-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/deep-amd64.txt || { echo "hosted-check: a line that left $(DEEP_OVER) values on the stack was not an error the node came back from"; tail -4 $(BINDIR)/deep-amd64.txt; exit 1; }
|
||||||
@printf '1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26\nWORDS\nDEPTH .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/deepwords-amd64.txt 2>&1; true
|
@printf ': P %d 0 DO I LOOP ; P\nWORDS\nDEPTH .\n' $(DEEP_WORDS) | $(BINDIR)/starforth4-amd64 > $(BINDIR)/deepwords-amd64.txt 2>&1; true
|
||||||
@grep -q 'DUP' $(BINDIR)/deepwords-amd64.txt && grep -q '^ok> 26 ok$$' $(BINDIR)/deepwords-amd64.txt || { echo "hosted-check: WORDS with 26 values on the stack did not print and come back"; tail -4 $(BINDIR)/deepwords-amd64.txt | cut -c1-200; exit 1; }
|
@grep -q 'DUP' $(BINDIR)/deepwords-amd64.txt && grep -q '^ok> $(DEEP_WORDS) ok$$' $(BINDIR)/deepwords-amd64.txt || { echo "hosted-check: WORDS with $(DEEP_WORDS) values on the stack did not print and come back"; tail -4 $(BINDIR)/deepwords-amd64.txt | cut -c1-200; exit 1; }
|
||||||
@printf '1 0 ROUTE\n65 EMIT\n: P 400 0 DO I . LOOP ; P\nNO-ROUTES\nDEPTH .\n1 2 + .\n' | timeout 120 $(BINDIR)/starforth4-amd64 > $(BINDIR)/kport-amd64.txt 2>&1; true
|
@printf '1 0 ROUTE\n65 EMIT\n: P 400 0 DO I . LOOP ; P\nNO-ROUTES\nDEPTH .\n1 2 + .\n' | timeout 120 $(BINDIR)/starforth4-amd64 > $(BINDIR)/kport-amd64.txt 2>&1; true
|
||||||
@test $$(grep -c '^ok> ERROR$$' $(BINDIR)/kport-amd64.txt) -eq 2 && grep -q '^ok> 3 ok$$' $(BINDIR)/kport-amd64.txt && grep -q '^ok> 0 ok$$' $(BINDIR)/kport-amd64.txt || { echo "hosted-check: with the way to the console set to the kernel's port, a line that prints did not end in an error at the prompt, or left something on the stack, or the node did not come back"; tail -6 $(BINDIR)/kport-amd64.txt; exit 1; }
|
@test $$(grep -c '^ok> ERROR$$' $(BINDIR)/kport-amd64.txt) -eq 2 && grep -q '^ok> 3 ok$$' $(BINDIR)/kport-amd64.txt && grep -q '^ok> 0 ok$$' $(BINDIR)/kport-amd64.txt || { echo "hosted-check: with the way to the console set to the kernel's port, a line that prints did not end in an error at the prompt, or left something on the stack, or the node did not come back"; tail -6 $(BINDIR)/kport-amd64.txt; exit 1; }
|
||||||
@printf ': S0 S" 1 DROP" 0 0 SEND-ON ; S0\n1 2 + .\n65 1 BLOCK C! 1 BLOCK C@ .\n' | timeout 120 $(BINDIR)/starforth4-amd64 > $(BINDIR)/ksend-amd64.txt 2>&1; true
|
@printf ': S0 S" 1 DROP" 0 0 SEND-ON ; S0\n1 2 + .\n65 1 BLOCK C! 1 BLOCK C@ .\n' | timeout 120 $(BINDIR)/starforth4-amd64 > $(BINDIR)/ksend-amd64.txt 2>&1; true
|
||||||
|
|||||||
@@ -19,6 +19,10 @@
|
|||||||
#define V4_POST_ERROR 3 /* it must end in an error; nothing else is compared */
|
#define V4_POST_ERROR 3 /* it must end in an error; nothing else is compared */
|
||||||
#define V4_POST_HEAD 4 /* how many values it leaves, and how what it prints begins: the form of a
|
#define V4_POST_HEAD 4 /* how many values it leaves, and how what it prints begins: the form of a
|
||||||
printout whose values are the run's own (TOP-WORDS; #189, 2026-11-14) */
|
printout whose values are the run's own (TOP-WORDS; #189, 2026-11-14) */
|
||||||
|
#define V4_POST_KIND 7 /* the kind is expect's low bits; */
|
||||||
|
#define V4_POST_KERNEL 8 /* or'd in: the case needs the kernel's words (capsules/v4/physics.4th, its
|
||||||
|
requests on port 0) and is not run on a node with no kernel -- the hosted
|
||||||
|
product (#189 Phase 7: v3's whole POST) */
|
||||||
|
|
||||||
typedef struct {
|
typedef struct {
|
||||||
const char *name;
|
const char *name;
|
||||||
@@ -64,6 +68,7 @@ typedef struct {
|
|||||||
* (message.h); or a negative number if the line did not come back. */
|
* (message.h); or a negative number if the line did not come back. */
|
||||||
int (*line)(void *self, const char *text, unsigned text_len, char *out, unsigned cap, unsigned *len);
|
int (*line)(void *self, const char *text, unsigned text_len, char *out, unsigned cap, unsigned *len);
|
||||||
void (*say)(void *self, const char *text, unsigned len); /* the console */
|
void (*say)(void *self, const char *text, unsigned len); /* the console */
|
||||||
|
int kernel; /* 1: the node has the kernel's words, so V4_POST_KERNEL cases are run */
|
||||||
} v4_post_host;
|
} v4_post_host;
|
||||||
|
|
||||||
typedef struct { unsigned tests, pass, fail; } v4_post_tally;
|
typedef struct { unsigned tests, pass, fail; } v4_post_tally;
|
||||||
@@ -73,4 +78,7 @@ typedef struct { unsigned tests, pass, fail; } v4_post_tally;
|
|||||||
* is how many were run. Returns 1 if every case was run and none failed. */
|
* is how many were run. Returns 1 if every case was run and none failed. */
|
||||||
int v4_post_run(const v4_post_host *h, const v4_post_case *cases, unsigned count, v4_post_tally *tally);
|
int v4_post_run(const v4_post_host *h, const v4_post_case *cases, unsigned count, v4_post_tally *tally);
|
||||||
|
|
||||||
|
/* How many of the cases are run on a node with the kernel's words (kernel 1) or without (0). */
|
||||||
|
unsigned v4_post_runs(const v4_post_case *cases, unsigned count, int kernel);
|
||||||
|
|
||||||
#endif /* V4_POST_H */
|
#endif /* V4_POST_H */
|
||||||
|
|||||||
@@ -25,8 +25,8 @@
|
|||||||
* first (manage.c, blocks.c) -- but no opcode reaches the wrap.
|
* first (manage.c, blocks.c) -- but no opcode reaches the wrap.
|
||||||
*
|
*
|
||||||
* 2. Nesting is shallow: a mesh node's stacks are the F18's 10 and 9; the
|
* 2. Nesting is shallow: a mesh node's stacks are the F18's 10 and 9; the
|
||||||
* host node's are 32 and 32 (D-17: V4_DATA_RING and V4_RET_RING, set in
|
* host node's are 1024 and 32 (D-17, revised 2026-11-14 for v3's whole
|
||||||
* v4/Makefile). One value or one call past either depth is a stack fault
|
* POST: V4_DATA_RING and V4_RET_RING, set in v4/Makefile and kernel/Makefile). One value or one call past either depth is a stack fault
|
||||||
* with its message, where under D-2 it corrupted silently.
|
* with its message, where under D-2 it corrupted silently.
|
||||||
*
|
*
|
||||||
* (Points 1 and 2 corrected 2026-11-12, #181: they said there was no overflow
|
* (Points 1 and 2 corrected 2026-11-12, #181: they said there was no overflow
|
||||||
|
|||||||
@@ -1,3 +1,3 @@
|
|||||||
539
|
990
|
||||||
# v4 POST: the fewest tests an accepted boot may report (#173). Raise it when POST grows;
|
# v4 POST: the fewest tests an accepted boot may report (#173). Raise it when POST grows;
|
||||||
# never lower it without Captain Bob. scripts/nightly.sh post-count reads the first line.
|
# never lower it without Captain Bob. scripts/nightly.sh post-count reads the first line.
|
||||||
|
|||||||
@@ -635,6 +635,7 @@ int v4_boot_run(const v4_boot *b)
|
|||||||
int how;
|
int how;
|
||||||
|
|
||||||
host.self = (void *)b; host.n = b->n; host.line = post_line; host.say = post_say;
|
host.self = (void *)b; host.n = b->n; host.line = post_line; host.say = post_say;
|
||||||
|
host.kernel = 0; /* the hosted product: no kernel, none of its words */
|
||||||
if (!v4_post_run(&host, v4_post_cases, v4_post_case_count, &tally)) {
|
if (!v4_post_run(&host, v4_post_cases, v4_post_case_count, &tally)) {
|
||||||
say(b, "V4: POST reported failures\nPARITY:FAIL\nPOST: FAILED\n");
|
say(b, "V4: POST reported failures\nPARITY:FAIL\nPOST: FAILED\n");
|
||||||
return 0;
|
return 0;
|
||||||
|
|||||||
@@ -1320,6 +1320,7 @@ static int boot(v4_mesh *ms)
|
|||||||
v4_post_host host;
|
v4_post_host host;
|
||||||
v4_post_tally tally;
|
v4_post_tally tally;
|
||||||
host.self = ms; host.n = &h->n; host.line = post_line; host.say = post_say;
|
host.self = ms; host.n = &h->n; host.line = post_line; host.say = post_say;
|
||||||
|
host.kernel = 1; /* she has the kernel's words (physics.4th) */
|
||||||
if (!v4_post_run(&host, v4_post_cases, v4_post_case_count, &tally)) { say("V4: POST reported failures\n"); return 0; }
|
if (!v4_post_run(&host, v4_post_cases, v4_post_case_count, &tally)) { say("V4: POST reported failures\n"); return 0; }
|
||||||
v4_dstack_reset(&h->n.ds);
|
v4_dstack_reset(&h->n.ds);
|
||||||
{
|
{
|
||||||
|
|||||||
+18
-7
@@ -40,15 +40,19 @@ static void say_number(const v4_post_host *h, long long v)
|
|||||||
int v4_post_run(const v4_post_host *h, const v4_post_case *cases, unsigned count, v4_post_tally *tally)
|
int v4_post_run(const v4_post_host *h, const v4_post_case *cases, unsigned count, v4_post_tally *tally)
|
||||||
{
|
{
|
||||||
static char out[V4_POST_OUT]; /* what the case being run has printed */
|
static char out[V4_POST_OUT]; /* what the case being run has printed */
|
||||||
v4_cell left[SHOWN_STACK]; /* what it left on the stack, the top first */
|
static v4_cell left[V4_DATA_DEPTH]; /* what it left on the stack, the top first: all of it, to compare (#189: v3's
|
||||||
|
cases leave 101); SHOWN_STACK of it shown */
|
||||||
unsigned i, k;
|
unsigned i, k;
|
||||||
|
|
||||||
tally->tests = 0; tally->pass = 0; tally->fail = 0;
|
tally->tests = 0; tally->pass = 0; tally->fail = 0;
|
||||||
for (i = 0; i < count; i++) {
|
for (i = 0; i < count; i++) {
|
||||||
const v4_post_case *c = &cases[i];
|
const v4_post_case *c = &cases[i];
|
||||||
|
const int kind = c->expect & V4_POST_KIND;
|
||||||
unsigned kept = 0, total = 0, len = 0, depth;
|
unsigned kept = 0, total = 0, len = 0, depth;
|
||||||
int errored = 0, came_back = 1, lost = 0, no_state = 0, quit = 0, ok, how;
|
int errored = 0, came_back = 1, lost = 0, no_state = 0, quit = 0, ok, how;
|
||||||
|
|
||||||
|
if ((c->expect & V4_POST_KERNEL) && !h->kernel) continue; /* no kernel: its words are not there */
|
||||||
|
|
||||||
/* every case starts from the same state */
|
/* every case starts from the same state */
|
||||||
v4_dstack_reset(&h->n->ds);
|
v4_dstack_reset(&h->n->ds);
|
||||||
how = h->line(h->self, state_line, (unsigned)sizeof state_line - 1u, out, V4_POST_OUT, &len);
|
how = h->line(h->self, state_line, (unsigned)sizeof state_line - 1u, out, V4_POST_OUT, &len);
|
||||||
@@ -73,26 +77,26 @@ int v4_post_run(const v4_post_host *h, const v4_post_case *cases, unsigned count
|
|||||||
depth = h->n->ds.depth;
|
depth = h->n->ds.depth;
|
||||||
for (k = 0; k < depth; k++) {
|
for (k = 0; k < depth; k++) {
|
||||||
v4_cell v = v4_dstack_pop(&h->n->ds);
|
v4_cell v = v4_dstack_pop(&h->n->ds);
|
||||||
if (k < SHOWN_STACK) left[k] = v;
|
if (k < V4_DATA_DEPTH) left[k] = v;
|
||||||
}
|
}
|
||||||
v4_dstack_reset(&h->n->ds);
|
v4_dstack_reset(&h->n->ds);
|
||||||
|
|
||||||
if (!came_back || quit) {
|
if (!came_back || quit) {
|
||||||
ok = 0;
|
ok = 0;
|
||||||
} else if (c->expect == V4_POST_ERROR) {
|
} else if (kind == V4_POST_ERROR) {
|
||||||
ok = errored;
|
ok = errored;
|
||||||
} else if (errored) {
|
} else if (errored) {
|
||||||
ok = 0;
|
ok = 0;
|
||||||
} else {
|
} else {
|
||||||
ok = depth == c->depth;
|
ok = depth == c->depth;
|
||||||
if (ok && c->expect == V4_POST_STACK) {
|
if (ok && kind == V4_POST_STACK) {
|
||||||
if (depth > SHOWN_STACK) ok = 0;
|
if (depth > V4_DATA_DEPTH) ok = 0;
|
||||||
for (k = 0; ok && k < depth; k++) ok = left[k] == (v4_cell)c->stack[depth - 1u - k];
|
for (k = 0; ok && k < depth; k++) ok = left[k] == (v4_cell)c->stack[depth - 1u - k];
|
||||||
}
|
}
|
||||||
if (ok && c->expect == V4_POST_HEAD) {
|
if (ok && kind == V4_POST_HEAD) {
|
||||||
ok = c->output_len <= kept;
|
ok = c->output_len <= kept;
|
||||||
for (k = 0; ok && k < c->output_len; k++) ok = out[k] == c->output[k];
|
for (k = 0; ok && k < c->output_len; k++) ok = out[k] == c->output[k];
|
||||||
} else if (ok && c->expect != V4_POST_DEPTH) {
|
} else if (ok && kind != V4_POST_DEPTH) {
|
||||||
ok = total == c->output_len && total <= V4_POST_OUT;
|
ok = total == c->output_len && total <= V4_POST_OUT;
|
||||||
for (k = 0; ok && k < total; k++) ok = out[k] == c->output[k];
|
for (k = 0; ok && k < total; k++) ok = out[k] == c->output[k];
|
||||||
}
|
}
|
||||||
@@ -124,3 +128,10 @@ int v4_post_run(const v4_post_host *h, const v4_post_case *cases, unsigned count
|
|||||||
say(h, "\n");
|
say(h, "\n");
|
||||||
return tally->fail == 0;
|
return tally->fail == 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
unsigned v4_post_runs(const v4_post_case *cases, unsigned count, int kernel)
|
||||||
|
{
|
||||||
|
unsigned i, n = 0;
|
||||||
|
for (i = 0; i < count; i++) if (kernel || !(cases[i].expect & V4_POST_KERNEL)) n++;
|
||||||
|
return n;
|
||||||
|
}
|
||||||
|
|||||||
+1903
-987
File diff suppressed because it is too large
Load Diff
+2
-1
@@ -237,7 +237,8 @@ typedef char host_map_ports_fit[(PORT >= OUT_W + OUT_CELLS && PORT + (v4_cell)V4
|
|||||||
#define DICT_W ((v4_cell)8192)
|
#define DICT_W ((v4_cell)8192)
|
||||||
#endif
|
#endif
|
||||||
#ifndef DICT_END_W
|
#ifndef DICT_END_W
|
||||||
#define DICT_END_W ((v4_cell)13824) /* 512 cells lower than it was: the block window is four slots now */
|
#define DICT_END_W (SEND_TEXT - 53) /* below the texts and the heat registers; 13824 at 16384 words and a 32-deep
|
||||||
|
stack: it moves with the node's size and its stack (#189, 2026-11-14) */
|
||||||
#endif
|
#endif
|
||||||
/* HEAT-OP[0..31] and ANTICLOCK (DECOMPOSITION.md section 7; Captain Bob, 2026-11-12: "Add HEAT-OP", a
|
/* HEAT-OP[0..31] and ANTICLOCK (DECOMPOSITION.md section 7; Captain Bob, 2026-11-12: "Add HEAT-OP", a
|
||||||
* full array; #189): 33 read-only registers, not memory (node.h), in what was free between the dictionary
|
* full array; #189): 33 read-only registers, not memory (node.h), in what was free between the dictionary
|
||||||
|
|||||||
@@ -211,12 +211,15 @@ static void watch_mid_spent(void)
|
|||||||
if (saw_room_wait) put_spent();
|
if (saw_room_wait) put_spent();
|
||||||
}
|
}
|
||||||
|
|
||||||
/* words that push 1, 2, 4, 8 and 16 values and call nothing while they do */
|
/* words that push 1, 2, 4, 8, 16, 64 and 256 values and leave no call behind (64 and 256 since the stack is 1024
|
||||||
|
* deep, #189 Phase 7: in P16s a text for 1012 values was more than a text may be) */
|
||||||
static void fill(char *text, size_t cap, unsigned count)
|
static void fill(char *text, size_t cap, unsigned count)
|
||||||
{
|
{
|
||||||
size_t at = 0;
|
size_t at = 0;
|
||||||
unsigned bit;
|
unsigned bit;
|
||||||
text[0] = 0;
|
text[0] = 0;
|
||||||
|
for (; count >= 256; count -= 256) at += (size_t)snprintf(text + at, cap - at, "P256 ");
|
||||||
|
for (; count >= 64; count -= 64) at += (size_t)snprintf(text + at, cap - at, "P64 ");
|
||||||
for (; count >= 16; count -= 16) at += (size_t)snprintf(text + at, cap - at, "P16 ");
|
for (; count >= 16; count -= 16) at += (size_t)snprintf(text + at, cap - at, "P16 ");
|
||||||
for (bit = 8; bit; bit >>= 1) if (count >= bit) { at += (size_t)snprintf(text + at, cap - at, "P%u ", bit); count -= bit; }
|
for (bit = 8; bit; bit >>= 1) if (count >= bit) { at += (size_t)snprintf(text + at, cap - at, "P%u ", bit); count -= bit; }
|
||||||
}
|
}
|
||||||
@@ -245,7 +248,7 @@ static int made(unsigned path)
|
|||||||
};
|
};
|
||||||
char line[64];
|
char line[64];
|
||||||
unsigned k;
|
unsigned k;
|
||||||
if (!row() || !told(11, act[path]) || !told(11, ": P1 7 ; : P2 7 7 ; : P4 7 7 7 7 ; : P8 7 7 7 7 7 7 7 7 ;") || !told(11, ": P16 P8 P8 ;")) return 0;
|
if (!row() || !told(11, act[path]) || !told(11, ": P1 7 ; : P2 7 7 ; : P4 7 7 7 7 ; : P8 7 7 7 7 7 7 7 7 ;") || !told(11, ": P16 P8 P8 ; : P64 P16 P16 P16 P16 ; : P256 P64 P64 P64 P64 ;")) return 0;
|
||||||
if (!told(11, ": N1 ACT ;")) return 0;
|
if (!told(11, ": N1 ACT ;")) return 0;
|
||||||
for (k = 2; k <= V4_RET_DEPTH + 1u; k++) {
|
for (k = 2; k <= V4_RET_DEPTH + 1u; k++) {
|
||||||
snprintf(line, sizeof line, ": N%u N%u ;", k, k - 1u);
|
snprintf(line, sizeof line, ": N%u N%u ;", k, k - 1u);
|
||||||
@@ -431,7 +434,7 @@ int main(void)
|
|||||||
|
|
||||||
/* ---- between texts: node 11 passes on, refuses, and holds what it has no room to pass on, with as many
|
/* ---- between texts: node 11 passes on, refuses, and holds what it has no room to pass on, with as many
|
||||||
* values waiting on its stack as a text may leave (MESH.md 7d.4: the rule of 28). Not one fault. ---- */
|
* values waiting on its stack as a text may leave (MESH.md 7d.4: the rule of 28). Not one fault. ---- */
|
||||||
CHECK(row() && told(11, ": P1 7 ; : P2 7 7 ; : P4 7 7 7 7 ; : P8 7 7 7 7 7 7 7 7 ;") && told(11, ": P16 P8 P8 ;") && told(11, "77 5 ROUTE")
|
CHECK(row() && told(11, ": P1 7 ; : P2 7 7 ; : P4 7 7 7 7 ; : P8 7 7 7 7 7 7 7 7 ;") && told(11, ": P16 P8 P8 ; : P64 P16 P16 P16 P16 ; : P256 P64 P64 P64 P64 ;") && told(11, "77 5 ROUTE")
|
||||||
&& told(12, ": S77 S\" 1 DROP\" 77 SEND ; : PR 1200 0 DO I . LOOP ;") && told(10, ": SLOW 500000 0 DO LOOP ; : BUSY SLOW SLOW ;"), "a row; node 11's way to 77 is a port with no one on it");
|
&& told(12, ": S77 S\" 1 DROP\" 77 SEND ; : PR 1200 0 DO I . LOOP ;") && told(10, ": SLOW 500000 0 DO LOOP ; : BUSY SLOW SLOW ;"), "a row; node 11's way to 77 is a port with no one on it");
|
||||||
for (k = V4_DATA_DEPTH - 12u; k + 4u <= V4_DATA_DEPTH; k++) {
|
for (k = V4_DATA_DEPTH - 12u; k + 4u <= V4_DATA_DEPTH; k++) {
|
||||||
unsigned faults;
|
unsigned faults;
|
||||||
|
|||||||
@@ -3,12 +3,12 @@
|
|||||||
*/
|
*/
|
||||||
/* test_host_node.c -- the host node's size, and the text assembler on it.
|
/* test_host_node.c -- the host node's size, and the text assembler on it.
|
||||||
*
|
*
|
||||||
* Tests named test_host_*.c are built with V4_NODE_WORDS = 16384 (Makefile):
|
* Tests named test_host_*.c are built with V4_NODE_WORDS = 32768 (Makefile; 16384 until 2026-11-14, #189):
|
||||||
* the host node, which holds the compiler, the dictionary and the text being
|
* the host node, which holds the compiler, the dictionary and the text being
|
||||||
* compiled, and so cannot be a 1024-word mesh node.
|
* compiled, and so cannot be a 1024-word mesh node.
|
||||||
*
|
*
|
||||||
* At 1024 words every slot a branch may sit in reaches the whole node. At
|
* At 1024 words every slot a branch may sit in reaches the whole node. At
|
||||||
* 16384 slot 3 does not -- its address field is 12 bits -- so this is where
|
* 32768 slot 3 does not -- its address field is 12 bits -- so this is where
|
||||||
* the text assembler's placement rule (text.h) is exercised: a branch is put
|
* the text assembler's placement rule (text.h) is exercised: a branch is put
|
||||||
* in a slot only if that slot reaches every word of the node.
|
* in a slot only if that slot reaches every word of the node.
|
||||||
*/
|
*/
|
||||||
@@ -58,7 +58,7 @@ int main(void)
|
|||||||
unsigned k, i;
|
unsigned k, i;
|
||||||
|
|
||||||
printf("v4 host node tests: V4_CELL_BITS=%d, V4_NODE_WORDS=%u\n", V4_CELL_BITS, (unsigned)V4_NODE_WORDS);
|
printf("v4 host node tests: V4_CELL_BITS=%d, V4_NODE_WORDS=%u\n", V4_CELL_BITS, (unsigned)V4_NODE_WORDS);
|
||||||
CHECK(V4_NODE_WORDS == 16384u, "the host node is 16384 words");
|
CHECK(V4_NODE_WORDS == 32768u, "the host node is 32768 words");
|
||||||
|
|
||||||
/* the node itself at this size */
|
/* the node itself at this size */
|
||||||
v4_node_reset(&n);
|
v4_node_reset(&n);
|
||||||
@@ -111,14 +111,14 @@ int main(void)
|
|||||||
CHECK(result("LOOP", 9) == 0, "a short backward jump near the top of the node [%u]", k);
|
CHECK(result("LOOP", 9) == 0, "a short backward jump near the top of the node [%u]", k);
|
||||||
}
|
}
|
||||||
|
|
||||||
/* the node fills up at 16384 words, not before */
|
/* the node fills up at V4_NODE_WORDS words, not before */
|
||||||
{
|
{
|
||||||
size_t at = 0;
|
size_t at = 0;
|
||||||
at += (size_t)snprintf(src + at, sizeof src - at, ": T ");
|
at += (size_t)snprintf(src + at, sizeof src - at, ": T ");
|
||||||
for (i = 0; i < V4_NODE_WORDS - 100u; i++) at += (size_t)snprintf(src + at, sizeof src - at, "; ");
|
for (i = 0; i < V4_NODE_WORDS - 100u; i++) at += (size_t)snprintf(src + at, sizeof src - at, "; ");
|
||||||
CHECK(assemble(src), "16284 words of code fit: %s", v4_text_error(&tx));
|
CHECK(assemble(src), "%u words of code fit: %s", (unsigned)(V4_NODE_WORDS - 100u), v4_text_error(&tx));
|
||||||
for (i = 0; i < 200u; i++) at += (size_t)snprintf(src + at, sizeof src - at, "; ");
|
for (i = 0; i < 200u; i++) at += (size_t)snprintf(src + at, sizeof src - at, "; ");
|
||||||
CHECK(!assemble(src) && strstr(v4_text_error(&tx), "does not fit") != NULL, "16484 do not");
|
CHECK(!assemble(src) && strstr(v4_text_error(&tx), "does not fit") != NULL, "%u do not", (unsigned)(V4_NODE_WORDS + 100u));
|
||||||
CHECK(v4_node_guards_intact(&n), "and nothing was written outside the node");
|
CHECK(v4_node_guards_intact(&n), "and nothing was written outside the node");
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
+62
-33
@@ -452,7 +452,7 @@ static void post_say(void *self, const char *text, unsigned len)
|
|||||||
(void)self;
|
(void)self;
|
||||||
if (post_said_len + len < sizeof post_said) { memcpy(post_said + post_said_len, text, len); post_said_len += len; post_said[post_said_len] = 0; }
|
if (post_said_len + len < sizeof post_said) { memcpy(post_said + post_said_len, text, len); post_said_len += len; post_said[post_said_len] = 0; }
|
||||||
}
|
}
|
||||||
static const v4_post_host post_host = { 0, &n, post_line, post_say };
|
static const v4_post_host post_host = { 0, &n, post_line, post_say, 0 };
|
||||||
/* Run one case; 1 if it passed. What the runner said is in post_said. */
|
/* Run one case; 1 if it passed. What the runner said is in post_said. */
|
||||||
static int post_one(const char *name, const char *l0, const char *l1, int expect, const long long *stack, unsigned depth, const char *output)
|
static int post_one(const char *name, const char *l0, const char *l1, int expect, const long long *stack, unsigned depth, const char *output)
|
||||||
{
|
{
|
||||||
@@ -517,6 +517,24 @@ static int is(const char *got, const char *want)
|
|||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/* Words that push 1, 2, 4, 8, 16, 64 and 256 values (7s), and a short text of them that pushes any count: the
|
||||||
|
* stack is 1024 deep (#189 Phase 7), and a line of that many numbers is more than a line may be. */
|
||||||
|
static int pwords(void)
|
||||||
|
{
|
||||||
|
return is(say(": P1 7 ; : P2 7 7 ; : P4 7 7 7 7 ; : P8 7 7 7 7 7 7 7 7 ; : P16 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 ;\n"), " ok\nok> ")
|
||||||
|
&& is(say(": P64 P16 P16 P16 P16 ; : P256 P64 P64 P64 P64 ;\n"), " ok\nok> ");
|
||||||
|
}
|
||||||
|
|
||||||
|
static void pfill(char *text, size_t cap, unsigned count)
|
||||||
|
{
|
||||||
|
static const unsigned sizes[] = { 256, 64, 16, 8, 4, 2, 1 };
|
||||||
|
size_t at = 0;
|
||||||
|
unsigned i;
|
||||||
|
text[0] = 0;
|
||||||
|
for (i = 0; i < sizeof sizes / sizeof sizes[0]; i++)
|
||||||
|
for (; count >= sizes[i]; count -= sizes[i]) at += (size_t)snprintf(text + at, cap - at, "P%u ", sizes[i]);
|
||||||
|
}
|
||||||
|
|
||||||
/* What v3 prints starts with its first prompt; the node's first prompt is
|
/* What v3 prints starts with its first prompt; the node's first prompt is
|
||||||
* printed at switch-on, before the input, so a v4 session lacks the leading
|
* printed at switch-on, before the input, so a v4 session lacks the leading
|
||||||
* "ok> " and is otherwise the same. */
|
* "ok> " and is otherwise the same. */
|
||||||
@@ -859,7 +877,7 @@ static const transcript script[] = {
|
|||||||
{ "65 EMIT DROP 66 EMIT\n67 EMIT\n", "AStack underflow\n ERROR\nok> C ok\nok> ", 0 },
|
{ "65 EMIT DROP 66 EMIT\n67 EMIT\n", "AStack underflow\n ERROR\nok> C ok\nok> ", 0 },
|
||||||
{ "+\n1 +\nDUP\nOVER\n1 OVER\n", "Stack underflow\n ERROR\nok> Stack underflow\n ERROR\nok> Stack underflow\n ERROR\nok> "
|
{ "+\n1 +\nDUP\nOVER\n1 OVER\n", "Stack underflow\n ERROR\nok> Stack underflow\n ERROR\nok> Stack underflow\n ERROR\nok> "
|
||||||
"Stack underflow\n ERROR\nok> Stack underflow\n ERROR\nok> ", 0 },
|
"Stack underflow\n ERROR\nok> Stack underflow\n ERROR\nok> ", 0 },
|
||||||
{ ": OV 65 EMIT 1000 0 DO I LOOP 66 EMIT ; 7 8 9 OV\nDEPTH 48 + EMIT\n", "AStack overflow\n ERROR\nok> 0 ok\nok> ", 0 },
|
{ ": OV 65 EMIT 2000 0 DO I LOOP 66 EMIT ; 7 8 9 OV\nDEPTH 48 + EMIT\n", "AStack overflow\n ERROR\nok> 0 ok\nok> ", 0 }, /* 2000: the stack is 1024 deep (#189) */
|
||||||
{ "1 2 3 -1 @\nDEPTH 48 + EMIT\n", "Address out of range\n ERROR\nok> 0 ok\nok> ", 0 },
|
{ "1 2 3 -1 @\nDEPTH 48 + EMIT\n", "Address out of range\n ERROR\nok> 0 ok\nok> ", 0 },
|
||||||
{ ": RU R> DROP R> DROP ; 65 EMIT RU 66 EMIT\n67 EMIT\n", "AReturn stack underflow\n ERROR\nok> C ok\nok> ", 0 },
|
{ ": RU R> DROP R> DROP ; 65 EMIT RU 66 EMIT\n67 EMIT\n", "AReturn stack underflow\n ERROR\nok> C ok\nok> ", 0 },
|
||||||
/* a word that runs itself, through EXECUTE, until the return stack is full */
|
/* a word that runs itself, through EXECUTE, until the return stack is full */
|
||||||
@@ -1004,13 +1022,18 @@ int main(void)
|
|||||||
|
|
||||||
/* ---- an address outside memory (D-14): a message, ERROR, and the prompt ---- */
|
/* ---- an address outside memory (D-14): a message, ERROR, and the prompt ---- */
|
||||||
{
|
{
|
||||||
|
static char past_rom[48], into_rom[48]; /* past the ROM; and the ROM's first word, which may not be written */
|
||||||
static const char *const lines[] = {
|
static const char *const lines[] = {
|
||||||
"65 EMIT -1 @ 66 EMIT\n", "65 EMIT 5 -1 ! 66 EMIT\n", "65 EMIT 20480 @ 66 EMIT\n", "65 EMIT 5 16384 ! 66 EMIT\n",
|
"65 EMIT -1 @ 66 EMIT\n", "65 EMIT 5 -1 ! 66 EMIT\n", past_rom, into_rom,
|
||||||
"65 EMIT 99999999 C@ 66 EMIT\n", "65 EMIT 7 -4 C! 66 EMIT\n", "65 EMIT -1 EXECUTE 66 EMIT\n", "65 EMIT 1 -1 +! 66 EMIT\n",
|
"65 EMIT 99999999 C@ 66 EMIT\n", "65 EMIT 7 -4 C! 66 EMIT\n", "65 EMIT -1 EXECUTE 66 EMIT\n", "65 EMIT 1 -1 +! 66 EMIT\n",
|
||||||
"65 EMIT PAD -8 4 CMOVE 66 EMIT\n", "65 EMIT -9 COUNT 66 EMIT\n", "65 EMIT -9 3 TYPE 66 EMIT\n",
|
"65 EMIT PAD -8 4 CMOVE 66 EMIT\n", "65 EMIT -9 COUNT 66 EMIT\n", "65 EMIT -9 3 TYPE 66 EMIT\n",
|
||||||
": F0 -1 @ ; : F1 F0 ; : F2 F1 ; : F3 65 EMIT F2 66 EMIT ; F3 67 EMIT\n",
|
": F0 -1 @ ; : F1 F0 ; : F2 F1 ; : F3 65 EMIT F2 66 EMIT ; F3 67 EMIT\n",
|
||||||
": G0 9 0 DO I 3 = IF 0 -1 ! THEN LOOP ; : G1 65 EMIT G0 66 EMIT ; G1\n",
|
": G0 9 0 DO I 3 = IF 0 -1 ! THEN LOOP ; : G1 65 EMIT G0 66 EMIT ; G1\n",
|
||||||
};
|
};
|
||||||
|
char last[64];
|
||||||
|
snprintf(past_rom, sizeof past_rom, "65 EMIT %u @ 66 EMIT\n", (unsigned)(V4_NODE_WORDS + V4_ROM_WORDS));
|
||||||
|
snprintf(into_rom, sizeof into_rom, "65 EMIT 5 %u ! 66 EMIT\n", (unsigned)V4_NODE_WORDS);
|
||||||
|
snprintf(last, sizeof last, "%u @ DROP 0 @ DROP 67 EMIT\n", (unsigned)(V4_NODE_WORDS - 1u));
|
||||||
boot();
|
boot();
|
||||||
for (i = 0; i < sizeof lines / sizeof lines[0]; i++) {
|
for (i = 0; i < sizeof lines / sizeof lines[0]; i++) {
|
||||||
unsigned before = n.faults;
|
unsigned before = n.faults;
|
||||||
@@ -1018,7 +1041,7 @@ int main(void)
|
|||||||
CHECK(n.faults == before + 1 && !n.stopped && n.mem[STATE] == 0, "fault %u: one fault, and the node is at its prompt", i);
|
CHECK(n.faults == before + 1 && !n.stopped && n.mem[STATE] == 0, "fault %u: one fault, and the node is at its prompt", i);
|
||||||
CHECK(is(say("1 2 + 48 + EMIT\n"), "3 ok\nok> "), "and the next line runs, after fault %u", i);
|
CHECK(is(say("1 2 + 48 + EMIT\n"), "3 ok\nok> "), "and the next line runs, after fault %u", i);
|
||||||
}
|
}
|
||||||
CHECK(is(say("16383 @ DROP 0 @ DROP 67 EMIT\n"), "C ok\nok> "), "the first and last words of memory are not faults");
|
CHECK(is(say(last), "C ok\nok> "), "the first and last words of memory are not faults");
|
||||||
CHECK(is(say(": H5 1 IF [ -1 @ ]\n"), "Address out of range\n ERROR\nok> ") && n.mem[STATE] == 0 && n.mem[CFP] == CFS_W,
|
CHECK(is(say(": H5 1 IF [ -1 @ ]\n"), "Address out of range\n ERROR\nok> ") && n.mem[STATE] == 0 && n.mem[CFP] == CFS_W,
|
||||||
"a fault while a definition is open ends it");
|
"a fault while a definition is open ends it");
|
||||||
CHECK(is(say("H5\n"), "UNKNOWN WORD: 'H5'\n ERROR\nok> ") && is(say(": H6 68 EMIT ; H6\n"), "D ok\nok> "), "and the next definition compiles and runs");
|
CHECK(is(say("H5\n"), "UNKNOWN WORD: 'H5'\n ERROR\nok> ") && is(say(": H6 68 EMIT ; H6\n"), "D ok\nok> "), "and the next definition compiles and runs");
|
||||||
@@ -1163,20 +1186,17 @@ int main(void)
|
|||||||
* P1 P2 P4 P8 P16 push that many values and call nothing while they do, so
|
* P1 P2 P4 P8 P16 push that many values and call nothing while they do, so
|
||||||
* a word can fill the stack to any depth in a short line. */
|
* a word can fill the stack to any depth in a short line. */
|
||||||
{
|
{
|
||||||
char line[128], want[32], fill[64];
|
char line[256], want[32], fill[128];
|
||||||
unsigned c, bit;
|
#define FILL(count) pfill(fill, sizeof fill, (count))
|
||||||
#define FILL(count) do { size_t at_ = 0; fill[0] = 0; \
|
|
||||||
for (c = (count), bit = 16; bit; bit >>= 1) if (c >= bit) { at_ += (size_t)snprintf(fill + at_, sizeof fill - at_, "P%u ", bit); c -= bit; } \
|
|
||||||
for (; c >= 16; c -= 16) at_ += (size_t)snprintf(fill + at_, sizeof fill - at_, "P16 "); } while (0)
|
|
||||||
boot_bare();
|
boot_bare();
|
||||||
CHECK(is(say(": P1 7 ; : P2 7 7 ; : P4 7 7 7 7 ; : P8 7 7 7 7 7 7 7 7 ;\n"), " ok\nok> ")
|
CHECK(pwords(), "words that push 1, 2, 4, 8, 16, 64 and 256 values");
|
||||||
&& is(say(": P16 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 ;\n"), " ok\nok> "), "words that push 1, 2, 4, 8 and 16 values");
|
|
||||||
/* 65, then DEPTH-2 more, then n = DEPTH-1: the stack is full when PICK and ROLL start */
|
/* 65, then DEPTH-2 more, then n = DEPTH-1: the stack is full when PICK and ROLL start */
|
||||||
FILL(V4_DATA_DEPTH - 2u);
|
FILL(V4_DATA_DEPTH - 2u);
|
||||||
snprintf(line, sizeof line, ": PF 65 %s%u PICK >R DROP R> EMIT ABORT ; PF\n", fill, (unsigned)(V4_DATA_DEPTH - 1u));
|
snprintf(line, sizeof line, ": PF 65 %s%u PICK >R DROP R> EMIT ABORT ; PF\n", fill, (unsigned)(V4_DATA_DEPTH - 1u));
|
||||||
CHECK(is(say(line), "A ok\nok> ") && n.faults == 0, "PICK of the deepest value of a full stack");
|
CHECK(is(say(line), "A ok\nok> ") && n.faults == 0, "PICK of the deepest value of a full stack");
|
||||||
snprintf(line, sizeof line, ": RF 65 %s%u ROLL EMIT DROP DEPTH 33 + EMIT ABORT ; RF\n", fill, (unsigned)(V4_DATA_DEPTH - 1u));
|
snprintf(line, sizeof line, ": RF 65 %s%u ROLL EMIT DROP DEPTH %u - 33 + EMIT ABORT ; RF\n", fill, (unsigned)(V4_DATA_DEPTH - 1u),
|
||||||
snprintf(want, sizeof want, "A%c ok\nok> ", (char)(33 + V4_DATA_DEPTH - 3u));
|
(unsigned)(V4_DATA_DEPTH - 32u));
|
||||||
|
snprintf(want, sizeof want, "A%c ok\nok> ", (char)(33 + 32 - 3));
|
||||||
CHECK(is(say(line), want) && n.faults == 0, "ROLL of the deepest value of a full stack");
|
CHECK(is(say(line), want) && n.faults == 0, "ROLL of the deepest value of a full stack");
|
||||||
/* exactly full is not a fault; one more is */
|
/* exactly full is not a fault; one more is */
|
||||||
FILL(V4_DATA_DEPTH);
|
FILL(V4_DATA_DEPTH);
|
||||||
@@ -1195,18 +1215,23 @@ int main(void)
|
|||||||
/* ---- how many values may wait on the stack from one line to the next ---- */
|
/* ---- how many values may wait on the stack from one line to the next ---- */
|
||||||
{
|
{
|
||||||
unsigned k, most = 0;
|
unsigned k, most = 0;
|
||||||
for (k = 1; k < V4_DATA_DEPTH; k++) {
|
/* every depth near the bottom and the top, and every 61st between (the stack is 1024 deep, #189) */
|
||||||
char line[4 * V4_DATA_DEPTH + 16], want[16];
|
for (k = 1; k < V4_DATA_DEPTH; k = (k < 16u || k + 16u >= V4_DATA_DEPTH) ? k + 1u
|
||||||
size_t at = 0;
|
: (k + 61u + 16u < V4_DATA_DEPTH ? k + 61u : V4_DATA_DEPTH - 16u)) {
|
||||||
unsigned m;
|
char line[256];
|
||||||
|
size_t at;
|
||||||
boot_bare();
|
boot_bare();
|
||||||
for (m = 0; m < k; m++) at += (size_t)snprintf(line + at, sizeof line - at, "1 ");
|
if (!pwords() || !is(say(": A1 + ; : A2 + + ; : A4 + + + + ; : A8 A4 A4 ; : A16 A8 A8 ; : A64 A16 A16 A16 A16 ; "
|
||||||
snprintf(line + at, sizeof line - at, "\n");
|
": A256 A64 A64 A64 A64 ;\n"), " ok\nok> ")) break;
|
||||||
|
pfill(line, sizeof line - 2, k);
|
||||||
|
strcat(line, "\n");
|
||||||
if (strcmp(say(line), " ok\nok> ") != 0) break;
|
if (strcmp(say(line), " ok\nok> ") != 0) break;
|
||||||
for (at = 0, m = 1; m < k; m++) at += (size_t)snprintf(line + at, sizeof line - at, "+ ");
|
/* the next line adds them all first, as it did when it was k-1 +s, so it takes no cell of its own */
|
||||||
snprintf(line + at, sizeof line - at, "32 + EMIT\n");
|
pfill(line, sizeof line - 32, k - 1u);
|
||||||
snprintf(want, sizeof want, "%c ok\nok> ", (char)(32 + k));
|
for (at = 0; line[at]; at++) if (line[at] == 'P') line[at] = 'A';
|
||||||
if (strcmp(say(line), want) != 0) break;
|
at = strlen(line);
|
||||||
|
snprintf(line + at, sizeof line - at, "%u - 64 + EMIT\n", 7u * k);
|
||||||
|
if (strcmp(say(line), "@ ok\nok> ") != 0) break;
|
||||||
most = k;
|
most = k;
|
||||||
}
|
}
|
||||||
printf(" %u values may wait on the stack while the next line is typed and interpreted\n", most);
|
printf(" %u values may wait on the stack while the next line is typed and interpreted\n", most);
|
||||||
@@ -1220,13 +1245,13 @@ int main(void)
|
|||||||
const unsigned plain = (unsigned)(PORT - (OUT_W + OUT_CELLS));
|
const unsigned plain = (unsigned)(PORT - (OUT_W + OUT_CELLS));
|
||||||
unsigned over = 0, worst = 0, at;
|
unsigned over = 0, worst = 0, at;
|
||||||
for (k = most > 6 ? most - 6 : 0; k <= most + 3; k++) {
|
for (k = most > 6 ? most - 6 : 0; k <= most + 3; k++) {
|
||||||
char line[4 * V4_DATA_DEPTH + 16];
|
char line[256];
|
||||||
size_t n_at = 0;
|
|
||||||
unsigned m;
|
unsigned m;
|
||||||
boot_bare();
|
boot_bare();
|
||||||
|
(void)pwords();
|
||||||
for (m = 0; m < plain; m++) n.mem[OUT_W + OUT_CELLS + m] = 0;
|
for (m = 0; m < plain; m++) n.mem[OUT_W + OUT_CELLS + m] = 0;
|
||||||
for (m = 0; m < k; m++) n_at += (size_t)snprintf(line + n_at, sizeof line - n_at, "1 ");
|
pfill(line, sizeof line - 2, k);
|
||||||
snprintf(line + n_at, sizeof line - n_at, "\n");
|
strcat(line, "\n");
|
||||||
(void)say(line);
|
(void)say(line);
|
||||||
(void)say("WORDS\n");
|
(void)say("WORDS\n");
|
||||||
for (at = 0; at < plain; at++) if (n.mem[OUT_W + OUT_CELLS + at] != 0) { over++; worst = k; break; }
|
for (at = 0; at < plain; at++) if (n.mem[OUT_W + OUT_CELLS + at] != 0) { over++; worst = k; break; }
|
||||||
@@ -1286,14 +1311,18 @@ int main(void)
|
|||||||
|
|
||||||
/* .S works on the stack it is printing, so it needs some of it free */
|
/* .S works on the stack it is printing, so it needs some of it free */
|
||||||
{
|
{
|
||||||
char line[4 * V4_DATA_DEPTH + 16], want[8 * V4_DATA_DEPTH + 32];
|
static char want[8 * V4_DATA_DEPTH + 32];
|
||||||
|
char line[256];
|
||||||
unsigned k, m, most = 0;
|
unsigned k, m, most = 0;
|
||||||
for (k = 1; k < V4_DATA_DEPTH; k++) {
|
/* every depth near the bottom and the top, and every 61st between (the stack is 1024 deep, #189) */
|
||||||
size_t at = 0, wt;
|
for (k = 1; k < V4_DATA_DEPTH; k = (k < 16u || k + 16u >= V4_DATA_DEPTH) ? k + 1u
|
||||||
|
: (k + 61u + 16u < V4_DATA_DEPTH ? k + 61u : V4_DATA_DEPTH - 16u)) {
|
||||||
|
size_t wt;
|
||||||
boot_bare();
|
boot_bare();
|
||||||
for (m = 0; m < k; m++) at += (size_t)snprintf(line + at, sizeof line - at, "7 ");
|
if (!pwords()) break;
|
||||||
snprintf(line + at, sizeof line - at, "\n");
|
pfill(line, sizeof line - 2, k);
|
||||||
if (strlen(line) > 80 || strcmp(say(line), " ok\nok> ") != 0) break;
|
strcat(line, "\n");
|
||||||
|
if (strcmp(say(line), " ok\nok> ") != 0) break;
|
||||||
wt = (size_t)snprintf(want, sizeof want, "<%u> ", k);
|
wt = (size_t)snprintf(want, sizeof want, "<%u> ", k);
|
||||||
for (m = 0; m < k; m++) wt += (size_t)snprintf(want + wt, sizeof want - wt, "7 ");
|
for (m = 0; m < k; m++) wt += (size_t)snprintf(want + wt, sizeof want - wt, "7 ");
|
||||||
snprintf(want + wt, sizeof want - wt, "\n ok\nok> ");
|
snprintf(want + wt, sizeof want - wt, "\n ok\nok> ");
|
||||||
|
|||||||
@@ -438,11 +438,12 @@ int main(void)
|
|||||||
v4_cell here = hera->mem[DP] / 4, k, changed = 0, first = -1;
|
v4_cell here = hera->mem[DP] / 4, k, changed = 0, first = -1;
|
||||||
uint64_t hash = v4_image_dict_hash(hera, &im);
|
uint64_t hash = v4_image_dict_hash(hera, &im);
|
||||||
memcpy(before, hera->mem, sizeof before);
|
memcpy(before, hera->mem, sizeof before);
|
||||||
host.self = 0; host.n = hera; host.line = post_line; host.say = post_say;
|
host.self = 0; host.n = hera; host.line = post_line; host.say = post_say; host.kernel = 0; /* no kernel here */
|
||||||
char want_line[64]; /* the table's own count, not a number typed here: it was 538, POST grew (#190) */
|
char want_line[64]; /* the table's own count, not a number typed here: it was 538, POST grew (#190) */
|
||||||
snprintf(want_line, sizeof want_line, "PARITY:V4_POST tests=%u pass=%u fail=0\n", v4_post_case_count, v4_post_case_count);
|
const unsigned runs = v4_post_runs(v4_post_cases, v4_post_case_count, 0);
|
||||||
CHECK(v4_post_run(&host, v4_post_cases, v4_post_case_count, &tally) && tally.tests == v4_post_case_count
|
snprintf(want_line, sizeof want_line, "PARITY:V4_POST tests=%u pass=%u fail=0\n", runs, runs);
|
||||||
&& tally.pass == v4_post_case_count && tally.fail == 0
|
CHECK(v4_post_run(&host, v4_post_cases, v4_post_case_count, &tally) && tally.tests == runs
|
||||||
|
&& tally.pass == runs && tally.fail == 0
|
||||||
&& strstr(post_said, want_line) != NULL && strstr(post_said, "POST FAIL") == NULL,
|
&& strstr(post_said, want_line) != NULL && strstr(post_said, "POST FAIL") == NULL,
|
||||||
"and passes POST, which the kernel runs on her: %u of %u, %u failed; \"%s\"", tally.pass, tally.tests, tally.fail, post_said);
|
"and passes POST, which the kernel runs on her: %u of %u, %u failed; \"%s\"", tally.pass, tally.tests, tally.fail, post_said);
|
||||||
CHECK(strcmp(tell(10, "RS1"), "42 42 \n") == 0, "while POST runs, what its cases define is on her: \"%s\"", printed);
|
CHECK(strcmp(tell(10, "RS1"), "42 42 \n") == 0, "while POST runs, what its cases define is on her: \"%s\"", printed);
|
||||||
|
|||||||
@@ -14,6 +14,7 @@
|
|||||||
*/
|
*/
|
||||||
#include "v4/mesh.h"
|
#include "v4/mesh.h"
|
||||||
#include "v4/message.h"
|
#include "v4/message.h"
|
||||||
|
#include "v4/post.h"
|
||||||
#include "block_subsystem.h"
|
#include "block_subsystem.h"
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
#include <string.h>
|
#include <string.h>
|
||||||
@@ -123,7 +124,12 @@ int main(void)
|
|||||||
CHECK(strstr(said, "PARITY:V4_ROM ") != 0, "the ROM assembled the nucleus, and said so");
|
CHECK(strstr(said, "PARITY:V4_ROM ") != 0, "the ROM assembled the nucleus, and said so");
|
||||||
CHECK(strstr(said, "PARITY:V4_CAPSULE name=v4:forth79.4th ") && strstr(said, "PARITY:V4_CAPSULE name=v4:centre.4th ")
|
CHECK(strstr(said, "PARITY:V4_CAPSULE name=v4:forth79.4th ") && strstr(said, "PARITY:V4_CAPSULE name=v4:centre.4th ")
|
||||||
&& strstr(said, "PARITY:V4_CAPSULE name=v4:hera.4th "), "FORTH-79 and the kernel's capsules, each with its parity line");
|
&& strstr(said, "PARITY:V4_CAPSULE name=v4:hera.4th "), "FORTH-79 and the kernel's capsules, each with its parity line");
|
||||||
CHECK(strstr(said, "PARITY:V4_POST tests=539 pass=539 fail=0") != 0, "POST passes on Hera, born in the fabric");
|
{ /* every case, the kernel's too: Hera has its words (#189 Phase 7) */
|
||||||
|
char want[64];
|
||||||
|
const unsigned runs = v4_post_runs(v4_post_cases, v4_post_case_count, 1);
|
||||||
|
snprintf(want, sizeof want, "PARITY:V4_POST tests=%u pass=%u fail=0", runs, runs);
|
||||||
|
CHECK(runs == v4_post_case_count && strstr(said, want) != 0, "POST passes on Hera, born in the fabric: v3's whole POST, %u cases", runs);
|
||||||
|
}
|
||||||
CHECK(strstr(said, "PARITY:V4_SYSTEM word_count=") && strstr(said, "PARITY:OK\nPOST: PASSED\n"), "the system line, and POST: PASSED");
|
CHECK(strstr(said, "PARITY:V4_SYSTEM word_count=") && strstr(said, "PARITY:OK\nPOST: PASSED\n"), "the system line, and POST: PASSED");
|
||||||
if (failures) { printf(" %d checks, %d failures\n", checks, failures); return 1; }
|
if (failures) { printf(" %d checks, %d failures\n", checks, failures); return 1; }
|
||||||
|
|
||||||
|
|||||||
@@ -51,7 +51,10 @@ def judge(case):
|
|||||||
tail = out.split('POST: PASSED', 1)[-1][-160:].replace('\n', '|')
|
tail = out.split('POST: PASSED', 1)[-1][-160:].replace('\n', '|')
|
||||||
return 'depthsweep: FAIL %s at %d: %s: ...%s' % (name, k, why, tail)
|
return 'depthsweep: FAIL %s at %d: %s: ...%s' % (name, k, why, tail)
|
||||||
|
|
||||||
def vals(k): return ' '.join(['1'] * k)
|
def vals(k):
|
||||||
|
# a word that leaves k values: typed as k numbers, a line for a stack 1024 deep would be longer than a line
|
||||||
|
# may be (#189 Phase 7: the host node's data stack is v3's 1024)
|
||||||
|
return ': V %d 0 DO 1 LOOP ; V' % k
|
||||||
|
|
||||||
# The stack shallow, and then every depth from well below where anything
|
# The stack shallow, and then every depth from well below where anything
|
||||||
# changes to past its end. An error empties the stack, and a wait that a
|
# changes to past its end. An error empties the stack, and a wait that a
|
||||||
|
|||||||
+54
-13
@@ -148,7 +148,11 @@ def parse_braces(toks, i):
|
|||||||
|
|
||||||
def read_module(path):
|
def read_module(path):
|
||||||
"""Yields (word, case name, input, should_error) for every implemented case."""
|
"""Yields (word, case name, input, should_error) for every implemented case."""
|
||||||
toks = tokens(open(path, encoding="utf-8", errors="replace").read())
|
source = open(path, encoding="utf-8", errors="replace").read()
|
||||||
|
# a module's own #defines: mama_forth_words_test.c marks its cases MAMA_IMPLEMENTED, which is 0 -- v3's POST
|
||||||
|
# skips them, and so must this (it took any value but a literal 0 as implemented, #189 Phase 7)
|
||||||
|
defines = dict(re.findall(r'^\s*#\s*define\s+(\w+)\s+(\S+)', source, re.M))
|
||||||
|
toks = tokens(source)
|
||||||
for i, t in enumerate(toks):
|
for i, t in enumerate(toks):
|
||||||
if t != ("word", "WordTestSuite"):
|
if t != ("word", "WordTestSuite"):
|
||||||
continue
|
continue
|
||||||
@@ -166,7 +170,8 @@ def read_module(path):
|
|||||||
if not isinstance(case, list) or len(case) < 6 or not isinstance(case[0], tuple):
|
if not isinstance(case, list) or len(case) < 6 or not isinstance(case[0], tuple):
|
||||||
continue
|
continue
|
||||||
name, text = case[0][1], case[1][1]
|
name, text = case[0][1], case[1][1]
|
||||||
should_error, implemented = case[4] != "0", case[5] != "0"
|
flag = case[5][1] if isinstance(case[5], tuple) else case[5]
|
||||||
|
should_error, implemented = case[4] != "0", defines.get(flag, flag) != "0"
|
||||||
if implemented:
|
if implemented:
|
||||||
yield word, name, text, should_error
|
yield word, name, text, should_error
|
||||||
|
|
||||||
@@ -205,7 +210,19 @@ def atoms(text):
|
|||||||
else:
|
else:
|
||||||
out.append(word)
|
out.append(word)
|
||||||
i = j
|
i = j
|
||||||
return out
|
# a word that takes the next word from the input stays on a line with it: cut between them, the word finds
|
||||||
|
# the line's end -- ': T20 20 ;' cut after the ':' is "Name missing" (#189 Phase 7, v3's whole POST)
|
||||||
|
joined = []
|
||||||
|
for piece in out:
|
||||||
|
if joined and joined[-1].split()[-1].upper() in PARSES_NEXT and len(joined[-1].split()) == 1:
|
||||||
|
joined[-1] += " " + piece
|
||||||
|
else:
|
||||||
|
joined.append(piece)
|
||||||
|
return joined
|
||||||
|
|
||||||
|
|
||||||
|
PARSES_NEXT = {":", "CREATE", "VARIABLE", "2VARIABLE", "CONSTANT", "2CONSTANT", "VOCABULARY", "FORGET", "'", "[']",
|
||||||
|
"[COMPILE]", "POSTPONE", "IS", "DEFER", "DEFER@", "FIND", "CHAR", "[CHAR]"}
|
||||||
|
|
||||||
|
|
||||||
def pack(prefix, pieces, width=LINE_MAX):
|
def pack(prefix, pieces, width=LINE_MAX):
|
||||||
@@ -443,6 +460,8 @@ def main():
|
|||||||
text = "\n".join(report) + "\n"
|
text = "\n".join(report) + "\n"
|
||||||
if not args.all:
|
if not args.all:
|
||||||
write_doc(cases, results, left_out, disagreements, untested, total, applied, dropped)
|
write_doc(cases, results, left_out, disagreements, untested, total, applied, dropped)
|
||||||
|
elif not args.only:
|
||||||
|
write_doc(cases, results, left_out, disagreements, untested, total, applied, dropped, whole=True)
|
||||||
if args.report:
|
if args.report:
|
||||||
open(args.report, "w").write(text)
|
open(args.report, "w").write(text)
|
||||||
sys.stdout.write(text)
|
sys.stdout.write(text)
|
||||||
@@ -459,11 +478,22 @@ def c_string(text):
|
|||||||
return '"' + "".join(out) + '"'
|
return '"' + "".join(out) + '"'
|
||||||
|
|
||||||
|
|
||||||
|
PHYSICS = os.path.join(ROOT, "capsules", "v4", "physics.4th")
|
||||||
|
|
||||||
|
|
||||||
|
def kernel_words():
|
||||||
|
"""The words capsules/v4/physics.4th defines: they ask the kernel (port 0), so a node with no kernel -- the
|
||||||
|
hosted product -- has none of them, and a case of one is marked V4_POST_KERNEL (#189 Phase 7)."""
|
||||||
|
text = open(PHYSICS).read()
|
||||||
|
return {m.group(1) for m in re.finditer(r'(?:^|\s)(?::|KERNEL-WORD|CONSTANT|VARIABLE|CREATE)\s+(\S+)', text)}
|
||||||
|
|
||||||
|
|
||||||
def write_table(table):
|
def write_table(table):
|
||||||
|
kernel = kernel_words()
|
||||||
with open(OUTPUT, "w", encoding="ascii") as out:
|
with open(OUTPUT, "w", encoding="ascii") as out:
|
||||||
out.write("/* post_cases.c -- POST's cases for the FORTH-79 Required Word Set on v4.\n"
|
out.write("/* post_cases.c -- POST's cases on v4: v3's whole POST (#189 Phase 7).\n"
|
||||||
" * Generated by v4/tools/mkpost.py from v3's POST cases: do not edit.\n"
|
" * Generated by v4/tools/mkpost.py --all from v3's POST cases: do not edit.\n"
|
||||||
" * docs/v4.0.0/NUCLEUS.md section 6; docs/v4.0.0/POST79.md lists every case\n"
|
" * docs/v4.0.0/NUCLEUS.md section 6; docs/v4.0.0/POST.md lists every case\n"
|
||||||
" * that is not v3's own with v3's result.\n */\n"
|
" * that is not v3's own with v3's result.\n */\n"
|
||||||
'#include "v4/post.h"\n\n')
|
'#include "v4/post.h"\n\n')
|
||||||
for k, (label, lines, want) in enumerate(table):
|
for k, (label, lines, want) in enumerate(table):
|
||||||
@@ -472,13 +502,15 @@ def write_table(table):
|
|||||||
out.write("static const long long s%d[] = { %s };\n" % (k, ", ".join("%dLL" % v if v != -9223372036854775808 else "(-9223372036854775807LL - 1)" for v in want["stack"])))
|
out.write("static const long long s%d[] = { %s };\n" % (k, ", ".join("%dLL" % v if v != -9223372036854775808 else "(-9223372036854775807LL - 1)" for v in want["stack"])))
|
||||||
out.write("\nconst v4_post_case v4_post_cases[] = {\n")
|
out.write("\nconst v4_post_case v4_post_cases[] = {\n")
|
||||||
for k, (label, lines, want) in enumerate(table):
|
for k, (label, lines, want) in enumerate(table):
|
||||||
|
expect = want["expect"] + (" | V4_POST_KERNEL" if label.rsplit(".", 1)[0] in kernel else "")
|
||||||
out.write(" { %s, l%d, %du, %s, %s, %du, %s, %du },\n"
|
out.write(" { %s, l%d, %du, %s, %s, %du, %s, %du },\n"
|
||||||
% (c_string(label), k, len(lines), want["expect"], ("s%d" % k) if want["stack"] else "0", want["depth"],
|
% (c_string(label), k, len(lines), expect, ("s%d" % k) if want["stack"] else "0", want["depth"],
|
||||||
c_string(want["out"]), len(want["out"].encode("latin-1", errors="replace"))))
|
c_string(want["out"]), len(want["out"].encode("latin-1", errors="replace"))))
|
||||||
out.write("};\n\nconst unsigned v4_post_case_count = %du;\n" % len(table))
|
out.write("};\n\nconst unsigned v4_post_case_count = %du;\n" % len(table))
|
||||||
|
|
||||||
|
|
||||||
DOC = os.path.join(ROOT, "docs", "v4.0.0", "POST79.md")
|
DOC = os.path.join(ROOT, "docs", "v4.0.0", "POST79.md")
|
||||||
|
DOC_ALL = os.path.join(ROOT, "docs", "v4.0.0", "POST.md")
|
||||||
|
|
||||||
|
|
||||||
def code(text):
|
def code(text):
|
||||||
@@ -496,14 +528,23 @@ def expects(rule):
|
|||||||
"`%s`" % rule["out"].replace("\n", "\\n") if rule.get("out") else "nothing")
|
"`%s`" % rule["out"].replace("\n", "\\n") if rule.get("out") else "nothing")
|
||||||
|
|
||||||
|
|
||||||
def write_doc(cases, results, left_out, disagreements, untested, total, applied, dropped):
|
def write_doc(cases, results, left_out, disagreements, untested, total, applied, dropped, whole=False):
|
||||||
by_label = {c["label"]: (c, r) for c, r in zip(cases, results)}
|
by_label = {c["label"]: (c, r) for c, r in zip(cases, results)}
|
||||||
out = ["# POST for the FORTH-79 Required Word Set: where it departs from v3", "",
|
if whole:
|
||||||
"Written by `v4/tools/mkpost.py` from `v4/tools/post79_rules.py`; do not edit.",
|
out = ["# POST: v3's whole POST on v4, where it departs from v3", "",
|
||||||
"Design: `NUCLEUS.md` section 6. The cases are `v4/system/post_cases.c`.", "",
|
"Written by `v4/tools/mkpost.py --all` from `v4/tools/post79_rules.py` and",
|
||||||
|
"`v4/tools/post_all_rules.py`; do not edit. The rulings: `POST-PARITY.md` (#189 Phase 7:",
|
||||||
|
"the standard first -- FORTH-79, FORTH-83, ANS 1994 -- then v3's table, not v3's bugs).",
|
||||||
|
"The cases are `v4/system/post_cases.c`; those of the words `capsules/v4/physics.4th` defines",
|
||||||
|
"need the kernel and are not run by the hosted product.", ""]
|
||||||
|
else:
|
||||||
|
out = ["# POST for the FORTH-79 Required Word Set: where it departs from v3", "",
|
||||||
|
"Written by `v4/tools/mkpost.py` from `v4/tools/post79_rules.py`; do not edit.",
|
||||||
|
"Design: `NUCLEUS.md` section 6. The cases are `v4/system/post_cases.c`.", ""]
|
||||||
|
out += [
|
||||||
"POST runs %d cases. %d are v3's, with what the hosted v3 binary did as the" % (total, len(cases) - applied["address"] - applied["standard"]),
|
"POST runs %d cases. %d are v3's, with what the hosted v3 binary did as the" % (total, len(cases) - applied["address"] - applied["standard"]),
|
||||||
"expected result. This file lists every other case, and why.", "",
|
"expected result. This file lists every other case, and why.", "",
|
||||||
"## 1. Rewritten for FORTH-79 (%d)" % (applied["standard"] - dropped), "",
|
("## 1. Rewritten: the standard's result, or v3's table's (%d)" if whole else "## 1. Rewritten for FORTH-79 (%d)") % (applied["standard"] - dropped), "",
|
||||||
"v3 departs from the standard, or the case is written for v3's machine. v4",
|
"v3 departs from the standard, or the case is written for v3's machine. v4",
|
||||||
"follows the standard (standing ruling), so the expected result is the",
|
"follows the standard (standing ruling), so the expected result is the",
|
||||||
"standard's and not v3's.", "",
|
"standard's and not v3's.", "",
|
||||||
@@ -538,7 +579,7 @@ def write_doc(cases, results, left_out, disagreements, untested, total, applied,
|
|||||||
"## 6. Where v3 did not do what its own table expects (%d)" % len(disagreements), "",
|
"## 6. Where v3 did not do what its own table expects (%d)" % len(disagreements), "",
|
||||||
"POST expects what v3 did, unless section 1 says otherwise.", "", "| Case | |", "|---|---|"]
|
"POST expects what v3 did, unless section 1 says otherwise.", "", "| Case | |", "|---|---|"]
|
||||||
out += ["| `%s` | %s |" % item for item in disagreements]
|
out += ["| `%s` | %s |" % item for item in disagreements]
|
||||||
open(DOC, "w").write("\n".join(out) + "\n")
|
open(DOC_ALL if whole else DOC, "w").write("\n".join(out) + "\n")
|
||||||
|
|
||||||
|
|
||||||
if __name__ == "__main__":
|
if __name__ == "__main__":
|
||||||
|
|||||||
@@ -40,6 +40,16 @@ FORM = "v3's own word, its output v3's own words and counts: the form kept, v4's
|
|||||||
WE_HEAD = "Word Usage Statistics (Execution Heat Counts):\n=============================================\n"
|
WE_HEAD = "Word Usage Statistics (Execution Heat Counts):\n=============================================\n"
|
||||||
def TOPHEAD(n): return "Top %d most frequently used words:\n==================================\n" % n
|
def TOPHEAD(n): return "Top %d most frequently used words:\n==================================\n" % n
|
||||||
|
|
||||||
|
MINMAX = ("FORTH-79 VARIABLE is a defining word: run inside INIT-MINMAX it takes its name from the input then -- "
|
||||||
|
"'42', then 'UPDATE-MINMAX' -- and a word named 42 hides the number from every case after it (42 U. printed "
|
||||||
|
"an address). v3's table says the case runs (TEST_NORMAL, 'Min/Max tracker'): written as meant, the variables "
|
||||||
|
"made outside, named so as not to hide MIN and MAX")
|
||||||
|
|
||||||
|
F79NAME = "FORTH-79: a name is up to 31 characters -- 26 is no error; v3's table expects one, v3 raised none (the standard first)"
|
||||||
|
V3TABLE_RUN = "v3's table says the case runs (TEST_NORMAL); v3 raised an error it does not say"
|
||||||
|
ARRAY = ("v3's table says the case runs (TEST_NORMAL, 'Array sum program'), but as written ': ARRAY 5 CELLS ALLOT ;' "
|
||||||
|
"names nothing and 'ARRAY NUMS' is an unknown word in any FORTH: written as meant, NUMS made by CREATE")
|
||||||
|
|
||||||
STANDARD = {
|
STANDARD = {
|
||||||
# ---- memory_words ----
|
# ---- memory_words ----
|
||||||
"C,.basic": {"text": "ALIGN HERE 4 * 65 C, C@ . CR", "stack": [], "out": "65 \n", "why": D1},
|
"C,.basic": {"text": "ALIGN HERE 4 * 65 C, C@ . CR", "stack": [], "out": "65 \n", "why": D1},
|
||||||
@@ -153,6 +163,18 @@ STANDARD = {
|
|||||||
"TOP-WORDS.after_reset": {"head": TOPHEAD(5), "why": FORM},
|
"TOP-WORDS.after_reset": {"head": TOPHEAD(5), "why": FORM},
|
||||||
"TOP-WORDS.single_word": {"head": TOPHEAD(1), "why": FORM},
|
"TOP-WORDS.single_word": {"head": TOPHEAD(1), "why": FORM},
|
||||||
"TOP-WORDS.large_count": {"head": TOPHEAD(100), "why": FORM},
|
"TOP-WORDS.large_count": {"head": TOPHEAD(100), "why": FORM},
|
||||||
|
# ---- integration ----
|
||||||
|
"DATA_STRUCTURES.stack_min_max": {"text": "VARIABLE TMIN 2147483647 TMIN ! VARIABLE TMAX -2147483648 TMAX ! "
|
||||||
|
": UPDATE-MINMAX ( n -- ) DUP TMIN @ < IF DUP TMIN ! ELSE DROP THEN "
|
||||||
|
"DUP TMAX @ > IF DUP TMAX ! ELSE DROP THEN ; "
|
||||||
|
"42 UPDATE-MINMAX 17 UPDATE-MINMAX 99 UPDATE-MINMAX TMIN @ . TMAX @ . CR",
|
||||||
|
"stack": [], "out": "17 42 \n", "why": MINMAX + " -- and run as FORTH runs it: UPDATE-MINMAX's ELSE DROP drops n when it is no new minimum, so 99 never reaches the maximum's test, which takes the 42 the first call left"},
|
||||||
|
"CREATE.long_name": {"stack": [], "out": "", "why": F79NAME},
|
||||||
|
"DICT_PRESSURE.many_defs": {"stack": [], "out": "20 \n", "why": V3TABLE_RUN},
|
||||||
|
"COMPLETE_PROGRAMS.array_sum": {"text": "CREATE NUMS 5 CELLS ALLOT : STORE-NUMS 10 NUMS 0 CELLS + ! 20 NUMS 1 CELLS + ! "
|
||||||
|
"30 NUMS 2 CELLS + ! 40 NUMS 3 CELLS + ! 50 NUMS 4 CELLS + ! ; "
|
||||||
|
": SUM-NUMS 0 5 0 DO NUMS I CELLS + @ + LOOP ; STORE-NUMS SUM-NUMS . CR",
|
||||||
|
"stack": [], "out": "150 \n", "why": ARRAY},
|
||||||
# ---- mixed_arithmetic_words: M+ (ANS); M/MOD (v3's own; the double written as FORTH-79 has it) ----
|
# ---- mixed_arithmetic_words: M+ (ANS); M/MOD (v3's own; the double written as FORTH-79 has it) ----
|
||||||
"M+.basic": {"stack": [], "out": "100 200 \n", "why": ANS_MPLUS},
|
"M+.basic": {"stack": [], "out": "100 200 \n", "why": ANS_MPLUS},
|
||||||
"M+.overflow": {"stack": [], "out": "2147483647 1 \n", "why": ANS_MPLUS},
|
"M+.overflow": {"stack": [], "out": "2147483647 1 \n", "why": ANS_MPLUS},
|
||||||
|
|||||||
Reference in New Issue
Block a user