code wiki / _hdl_build / nx_kvs_gate.nx

nx_kvs_gate.nx

buildroot/runtime/_hdl_build/nx_kvs_gate.nx

8160 B100 linesdepth 3pulls 4 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

dependencies 3 imports · 0 importers

nx_gate_base.nx nx_syscalls.nx nx_kvs.nx nx_kvs_gate.nx

imports: nx_gate_base.nxnx_syscalls.nxnx_kvs.nx

imported by: nobody (leaf or entry point)

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

main pw sys_write sys_mmap kvs_license_token sys_mmap ↻ chk pw ↻ pn sys_mmap ↻ pw ↻ sys_write ↻ g_has g_slen g_slen ↻ sys_exit

structs

none

consts

none

functions

7func grow(name: *u8, ok: i64) -> i64 { if ok==1 { gw(" PASS " as *u8) } else { gw(" FAIL " as *u8) } gw(name); gw("
calls 1: gw
9func pw(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 3: sys_mmappwsys_write
10func pn(v: i64) -> i64 { let b: *u8=sys_mmap(24); var m: i64=v; if m<0{pw("-" as *u8);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 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 1: g_slen
11func g_has(hay: *u8, hl: i64, needle: *u8) -> i64 { let nl: i64=g_slen(needle); if nl==0 {return 1} var i: i64=0; let last: i64=hl-nl; while i<=last { var j: i64=0; var m: i64=1; while j<nl { if (hay[i+j]&0xff)!=(needle[j]&0xff){m=0;j=nl} else {j=j+1} } if m==1 {return 1} i=i+1 } return 0 }
called by 1: main calls 1: pw
12func chk(label: *u8, ok: i64) -> i64 { if ok==1 { pw(" ok " as *u8) } else { pw(" FAIL " as *u8) } pw(label); pw("\n" as *u8); return ok }
14func main(argc: i64, argv: *i64) -> i64