code wiki / _hdl_build / nx_import_scan_gate.nx
nx_import_scan_gate.nx
buildroot/runtime/_hdl_build/nx_import_scan_gate.nx
about
nx_import_scan_gate.nx -- proves the canonical accurate import scanner (R0-brick-1 of the living ecosystem
graph) rejects the EXACT false positives the naive scanner hit (imports inside // comments and string
literals), with a NEG-CONTROL: the naive scanner over-counts on the same fixture => the accurate rejection
is load-bearing. license_tier: ORIGINAL expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_import_scan.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| none |
functions
| 8 | func hw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 9 | func pn(v: i64) -> i64 { let b: *u8=sys_mmap(24); var m: i64=v; if m<0{sys_write(1,"-" as *u8,1);m=0-m} let t: *u8=sys_mmap(24); 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 j: i64=0; while j<k{b[j]=t[k-1-j];j=j+1} sys_write(1,b,k); return 0 } |
| 11 | func fx_put(buf: *u8, pos: i64, s: *u8) -> i64 { var i: i64=0; while s[i]!=(0 as u8){buf[pos+i]=s[i];i=i+1} return pos+i } called by 1: main |
| 12 | func fx_q(buf: *u8, pos: i64) -> i64 { buf[pos]=34 as u8; return pos+1 } called by 1: main |
| 13 | func fx_nl(buf: *u8, pos: i64) -> i64 { buf[pos]=10 as u8; return pos+1 } called by 1: main |
| 16 | func eqstr(buf: *u8, off: i64, len: i64, s: *u8) -> i64 |
| 23 | func main() -> i64 |