code wiki / _hdl_build / nx_research_backlog_test.nx

nx_research_backlog_test.nx

buildroot/runtime/_hdl_build/nx_research_backlog_test.nx

3998 B75 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/prooftopic research
docsdependenciesstructsconstsfunctions

about

nx_research_backlog_test.nx -- ACCEPTANCE GATE for the Researcher's gap-prioritized topic backlog.

dependencies 2 imports · 0 importers

nx_research_backlog.nx nx_syscalls.nx nx_research_backlog_test.nx

imports: nx_research_backlog.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 sys_mmap rb_coverage_permil rb_gap_score rb_coverage_permil ↻ bt_puts sys_write rb_next rb_gap_score ↻ bt_putn sys_mmap ↻ sys_write ↻ rb_mark_done rb_progress_permil rb_library_coverage_permil rb_coverage_permil ↻ rb_all_done sys_exit

structs

none

consts

none

functions

5func bt_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
6func bt_putn(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m;sys_write(1,"-" as *u8,1)} let t: *u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=48 as u8;k=1} while m>0{t[k]=(48+(m%10)) as u8;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
8func main() -> i64
calls 11: sys_mmaprb_coverage_permilrb_gap_scorebt_putsrb_nextbt_putn+5