code wiki / _hdl_build / nx_apistack_oidc_gate.nx

nx_apistack_oidc_gate.nx

buildroot/runtime/_hdl_build/nx_apistack_oidc_gate.nx

3200 B46 linesdepth 4pulls 5 transitivereach 0 importersview sourcekind gate/prooftopic apistack
docsdependenciesstructsconstsfunctions

dependencies 4 imports · 0 importers

nx_gate_gn.nx nx_gate_base.nx nx_syscalls.nx nx_apistack_oidc.nx nx_apistack_oidc_gate.nx

imports: nx_gate_gn.nxnx_gate_base.nxnx_syscalls.nxnx_apistack_oidc.nx

imported by: nobody (leaf or entry point)

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

main gp sys_write oidc_valid_structure sys_mmap oidc_b64url_encode oidc_b64char oidc_b64url_decode oidc_b64val g_eq gn g_slen g_app oidc_extract_claim sys_mmap ↻ oidc_b64url_decode ↻ sys_write ↻ sys_exit

structs

none

consts

none

functions

8func grow(name: *u8, ok: i64) -> i64 { if ok==1 { gw(" PASS " as *u8) } else { gw(" FAIL " as *u8) } gw(name); gw("
calls 1: gw
10func gp(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
11func g_app(buf: *u8, off: i64, s: *u8) -> i64 { var i: i64=0; while s[i]!=(0 as u8){buf[off+i]=s[i];i=i+1} return off+i }
called by 1: main
12func g_eq(a: *u8, b: *u8, n: i64) -> i64 { var i: i64=0; while i<n { if a[i]!=b[i] { return 0 } i=i+1 } return 1 }
14func main(argc: i64, argv: *i64) -> i64