code wiki / _hdl_build / nx_archive_resolve_gate.nx

nx_archive_resolve_gate.nx

buildroot/runtime/_hdl_build/nx_archive_resolve_gate.nx

4087 B55 linesdepth 4pulls 6 transitivereach 0 importersview sourcekind gate/prooftopic archive
docsdependenciesstructsconstsfunctions

dependencies 5 imports · 0 importers

nx_gate_gn.nx nx_gate_base.nx nx_syscalls.nx nx_web_archive.nx nx_archive_resolve.nx nx_archive_resolve_gate.nx

imports: nx_gate_gn.nxnx_gate_base.nxnx_syscalls.nxnx_web_archive.nxnx_archive_resolve.nx

imported by: nobody (leaf or entry point)

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

main gw sys_write sys_mmap wa_write_resource wa_puts wa_putn sys_mmap ↻ gsl ar_build_response sys_mmap ↻ wa_resolve wa_find wa_field_num wa_slen wa_find ↻ wa_uri_matches wa_find ↻ wa_content_type wa_find ↻ ar_puts ar_putn sys_mmap ↻ ar_slen has gsl ↻ find4 memeq grow gw ↻

structs

none

consts

none

functions

11func grow(name: *u8, ok: i64) -> i64 { if ok==1 { gw(" PASS " as *u8) } else { gw(" FAIL " as *u8) } gw(name); gw("
called by 1: main calls 1: gw
13func gsl(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n }
called by 1: main calls 1: gsl
14func has(hay: *u8, hl: i64, needle: *u8) -> i64 { let nl: i64=gsl(needle); if nl>hl {return 0} 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
15func find4(hay: *u8, hl: i64, from: i64) -> i64 { var i: i64=from; while i+4<=hl { if (hay[i]&0xff)==13 { if (hay[i+1]&0xff)==10 { if (hay[i+2]&0xff)==13 { if (hay[i+3]&0xff)==10 { return i+4 } } } } i=i+1 } return 0-1 }
called by 1: main
16func memeq(a: *u8, ao: i64, b: *u8, blen: i64) -> i64 { var i: i64=0; while i<blen { if (a[ao+i]&0xff)!=(b[i]&0xff) { return 0 } i=i+1 } return 1 }
18func main() -> i64