code wiki / _hdl_build / nx_sharpgrade_gate.nx
nx_sharpgrade_gate.nx
buildroot/runtime/_hdl_build/nx_sharpgrade_gate.nx
about
nx_sharpgrade_gate.nx -- GATE for the small-sharp MATH grader (6 teeth incl neg-controls +
determinism + a MUTATION proof that linking two families flips SPLIT->SHARP). PREREQ: stage
_offc/nx_sharpgrade.elf. Run from nxc2 root. One grader fork per tooth (self-exec chain).
T1 SHARP: main->a->b (one component) | T2 SPLIT-2: two disjoint families {aa_*},{bb_*} distinct
prefixes | T3 SHARP-LIB: two components but ONE prefix family (sd_*) = cohesive utilities |
T4 SPLIT names the component count | T5 determinism (two runs identical) | T6 MUTATION: link the
two families (bb_p calls aa_x) -> 1 component -> SHARP (the connectivity math genuinely discriminates).
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
| 14 | func rg_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 |
| 15 | func rg_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 } |
| 16 | func rg_len(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } called by 1: main |
| 18 | func rg_run(src: *u8, outp: *u8) -> i64 |
| 24 | func main(argc: i64, argv: *i64) -> i64 |