code wiki / _hdl_build / nx_depcycle_gate.nx
nx_depcycle_gate.nx
buildroot/runtime/_hdl_build/nx_depcycle_gate.nx
about
nx_depcycle_gate.nx -- GATE for the Acyclic Dependencies checker (5 teeth incl neg-controls +
determinism + MUTATION). PREREQ: stage _offc/nx_depcycle.elf. Run from nxc2 root. One fork/tooth.
T1 ACYCLIC (a->b->c) | T2 CYCLIC-2 (a<->b) names both CYCLENODEs | T3 3-cycle CYCLIC-3 | T4
determinism | T5 MUTATION break the 2-cycle -> ACYCLIC (the detector genuinely tracks the edge).
license_tier: ORIGINAL No hw writes (Rule 26).
dependencies 4 imports · 0 importers
imports: nx_seat_drive_lib.nxnx_seg_store.nxnx_deploy_lib.nxnx_syscalls.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| none |
functions
| 11 | func dg_atoi(s: *u8) -> i64 { var v: i64 = 0; var i: i64 = 0; while s[i] != (0 as u8) { let c: i64 = s[i] as i64; if c >= 48 { if c <= 57 { v = v * 10 + (c - 48) } } i = i + 1 } return v } called by 1: main |
| 12 | func dg_itoa(dst: *u8, v: i64) -> i64 { var m: i64 = v; 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 { dst[i] = t[k - 1 - i]; i = i + 1 } dst[k] = 0 as u8; return k } |
| 13 | func dg_len(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } called by 1: main |
| 15 | func dg_run(dir: *u8, outp: *u8) -> i64 |
| 21 | func main(argc: i64, argv: *i64) -> i64 |