code wiki / _hdl_build / nx_recycler_discover.nx

nx_recycler_discover.nx

buildroot/runtime/_hdl_build/nx_recycler_discover.nx

6910 B122 linesdepth 4pulls 4 transitivereach 0 importersview sourcekind tooltopic recycler
docsdependenciesstructsconstsfunctions

about

nx_recycler_discover.nx -- Identifies and adds new CVEs from fetched data to a unique discovery queue for further assessment.

dependencies 2 imports · 0 importers

nx_gate_gn.nx nx_syscalls.nx nx_recycler_discover.nx

imports: nx_gate_gn.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 scan_file sys_mmap ↻ sys_read_file sys_openat_rd sys_lseek sys_mmap ↻ sys_read sys_close cve_len isdig uniq_add is_seed slen0 streqn_at gn sys_write ↻ cve_len ↻ sys_exit

structs

none

consts

none

functions

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 calls 1: sys_write
11func isdig(c: i64) -> i64 { if c>=48 { if c<=57 { return 1 } } return 0 }
called by 1: cve_len
13func cve_len(buf: *u8, n: i64, i: i64) -> i64
called by 2: scan_filemain calls 1: isdig
30func streqn(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 }
32func is_seed(buf: *u8, i: i64, L: i64) -> i64
called by 1: scan_file calls 2: slen0streqn_at
46func slen0(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n }
called by 1: is_seed
47func streqn_at(buf: *u8, i: i64, lit: *u8, L: i64) -> i64 { var k: i64=0; while k<L { if buf[i+k]!=lit[k]{return 0} k=k+1 } return 1 }
called by 1: is_seed
49func uniq_add(store: *u8, lens: *i64, cntp: *i64, buf: *u8, i: i64, L: i64, capn: i64) -> i64
called by 1: scan_file
63func scan_file(path: *u8, store: *u8, lens: *i64, cntp: *i64, seedp: *i64, newp: *i64, capn: i64) -> i64
80func main() -> i64