code wiki / _hdl_build / nx_orchestration2_test.nx

nx_orchestration2_test.nx

buildroot/runtime/_hdl_build/nx_orchestration2_test.nx

4067 B54 linesdepth 3pulls 4 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

about

nx_orchestration2_test.nx -- prove the research-driven upgrades: the SPECULATIVE FIFO merge queue (disjoint land in parallel, overlap drops without cascading) + the BRANCHING lineage archive (a LOW ancestor seeds a breakthrough that hill-climbing would miss). Exit 0 on 11/11. license_tier: ORIGINAL

dependencies 3 imports · 0 importers

nx_merge_queue.nx nx_lineage_archive.nx nx_syscalls.nx nx_orchestration2_test.nx

imports: nx_merge_queue.nxnx_lineage_archive.nxnx_syscalls.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main o2_puts sys_write sys_mmap mq_process mq_status_label o2_num sys_mmap ↻ sys_write ↻ la_archive la_frontier la_seeded_breakthrough la_best mq_clean la_can_branch_from la_no_deletion sys_exit

structs

none

consts

none

functions

9func o2_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 }
called by 1: main calls 1: sys_write
10func o2_num(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m}; let t: *u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=48;k=1}; while m>0{t[k]=48+(m%10);m=m/10;k=k+1}; var i: i64=0; while i<k{bb[i]=t[k-1-i];i=i+1}; sys_write(1,bb,k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
12func main() -> i64