code wiki / _hdl_build / nx_opportunity_loop_test.nx

nx_opportunity_loop_test.nx

buildroot/runtime/_hdl_build/nx_opportunity_loop_test.nx

4513 B61 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

about

nx_opportunity_loop_test.nx -- RUN the self-running opportunity loop on the team's REAL current frontier, and report its state: which opportunity the loop picks next, and how autonomous the cycle is. Opportunities are scored value x feasibility; the loop is autonomous on 5/6 stages for existing search spaces (6/6 when no novel module is needed). Exit 0 on 7/7. license_tier: ORIGINAL

dependencies 2 imports · 0 importers

nx_opportunity_loop.nx nx_syscalls.nx nx_opportunity_loop_test.nx

imports: nx_opportunity_loop.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 op_puts sys_write ol_autonomous_stages ol_stage_owner op_num sys_mmap sys_write ↻ sys_mmap ↻ ol_pick_top ol_score ol_score ↻ ol_runs_autonomously ol_stage_owner ↻ sys_exit

structs

none

consts

none

functions

9func op_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 op_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