code wiki / _hdl_build / nx_fwdcall_probe.nx

nx_fwdcall_probe.nx

buildroot/runtime/_hdl_build/nx_fwdcall_probe.nx

1055 B24 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind probe
docsdependenciesstructsconstsfunctions

about

nx_fwdcall_probe.nx -- DIAGNOSTIC: does nx_cc support FORWARD calls / mutual recursion (needed for a recursive-descent formula parser: factor -> expr for parens)? Prints A/B chain result; expect 10. license_tier: ORIGINAL

dependencies 1 imports · 0 importers

nx_syscalls.nx nx_fwdcall_probe.nx

imports: nx_syscalls.nx

imported by: nobody (leaf or entry point)

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

main fp_a fp_b fp_a ↻ fp_puts sys_write fp_num sys_mmap sys_write ↻

structs

none

consts

none

functions

6func fp_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
7func fp_num(v: i64) -> i64 { let b: *u8=sys_mmap(28); var m: i64=v; 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{b[i]=t[k-1-i];i=i+1} sys_write(1,b,k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
10func fp_a(n: i64) -> i64
called by 2: fp_bmain calls 1: fp_b
14func fp_b(n: i64) -> i64
called by 1: fp_a calls 1: fp_a
19func main() -> i64
calls 3: fp_afp_putsfp_num