code wiki / _hdl_build / nx_landmine_harvest.nx

nx_landmine_harvest.nx

buildroot/runtime/_hdl_build/nx_landmine_harvest.nx

8766 B155 linesdepth 4pulls 6 transitivereach 0 importersview sourcekind tool
docsdependenciesstructsconstsfunctions

about

nx_landmine_harvest.nx -- Ingests the landmine registry into the sovereign knowledge base, adding new documented bugs while skipping duplicates and retired entries.

dependencies 4 imports · 0 importers

nx_gate_gn.nx nx_known_issue_store.nx nx_seg_store.nx nx_syscalls.nx nx_landmine_harvest.nx

imports: nx_gate_gn.nxnx_known_issue_store.nxnx_seg_store.nxnx_syscalls.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 sys_mmap sys_read_file sys_openat_rd sys_lseek sys_mmap ↻ sys_read sys_close sys_exit ki_get ss_get sys_mmap ↻ ss_scan sys_mmap ↻ ss_manifest_dyn ss_manifest_file_dyn sys_mmap ↻ ss_cat ss_readall sys_munmap ss_scan_seglist ss_len sys_mmap ↻ ss_cat ↻ ss_readall ↻ ss_r32 idx_has tok_end is_tok line_end process_line find_tab streq_lit sys_mmap ↻ idx_has ↻ bputs bcatn ucase

structs

none

consts

16const K_MAGIC_4096: i64 = 4096
17const K_MAGIC_1800: i64 = 1800
18const K_MAGIC_16384: i64 = 16384
19const K_MAGIC_2048: i64 = 2048

functions

21func 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 calls 1: sys_write
22func tlen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n }
called by 1: main
23func bputs(dst: *u8, off: i64, s: *u8) -> i64 { var o: i64=off; var i: i64=0; while s[i]!=(0 as u8){ dst[o]=s[i]; o=o+1; i=i+1 } return o }
called by 1: process_line
24func bcatn(dst: *u8, off: i64, src: *u8, from: i64, n: i64) -> i64 { var o: i64=off; var i: i64=0; while i<n { dst[o]=src[from+i]; o=o+1; i=i+1 } return o }
called by 1: process_line
25func ucase(dst: *u8, off: i64, src: *u8, from: i64, n: i64) -> i64 { var o: i64=off; var i: i64=0; while i<n { var c: i64=src[from+i] as i64; if c>=97 { if c<=122 { c=c-32 } } dst[o]=c as u8; o=o+1; i=i+1 } return o }
called by 1: process_line
26func find_tab(buf: *u8, from: i64, end: i64) -> i64 { var i: i64=from; while i<end { if buf[i]==(9 as u8){return i} i=i+1 } return 0-1 }
called by 1: process_line
27func line_end(buf: *u8, from: i64, blen: i64) -> i64 { var e: i64=from; while e<blen { if buf[e]==(10 as u8){return e} e=e+1 } return blen }
called by 1: main
28func streq_lit(buf: *u8, from: i64, n: i64, lit: *u8) -> i64
called by 1: process_line
34func tok_end(idx: *u8, ilen: i64, from: i64) -> i64 { var e: i64=from; while e<ilen { if idx[e]==(9 as u8){return e} e=e+1 } return ilen }
called by 1: idx_has
36func is_tok(idx: *u8, from: i64, to: i64, id: *u8, idl: i64) -> i64
called by 1: idx_has
41func idx_has(idx: *u8, ilen: i64, id: *u8, idl: i64) -> i64
called by 2: process_linemain calls 2: tok_endis_tok
52func process_line(buf: *u8, ls: i64, e: i64, idx: *u8, ilenp: *i64, keys: *i64, vals: *i64, nrecp: *i64) -> i64
92func main() -> i64