nx_epic_rollup.nx source

1// nx_epic_rollup.nx -- EPIC/UMBRELLA CLOSURE capability (operator 2026-06-13: build the 2// team's capabilities self-sufficient, no gaps). nx_reconcile closes only TODO/WIP rows 3// that carry a ||MARK= log-evidence pointer; dep-only EPIC rows (umbrellas decomposed into 4// child rows, e.g. K-R2-001 = a+b+c) have NO gate of their own and so could never close 5// without a tutor hand-flip = a no-cheat hole. This organ closes them MECHANICALLY: 6// 7// gate cell suffix ...||ROLLUP=child1,child2,... (the row's OWN declared closure) 8// -> flip status TODO->DONE iff EVERY listed child row is already DONE (its own gate 9// already proved it). Aggregation of verified children, NOT self-grading. 10// 11// Fixpoint loop closes nested umbrellas (a parent whose child is itself an umbrella). 12// SELF-VALIDATING (no false-green): a baked pos control (child DONE -> parent flips) and 13// neg control (child TODO -> parent must NOT flip) run on synthetic in-memory rows BEFORE 14// the real queue is touched; controls fail -> RED, queue untouched. Backs up the queue 15// (original bytes) before mutating. Only ever overwrites TODO(4)->DONE(4) in place, so 16// length is preserved. Evidence -> knowledge/status/epic_rollup.log. license_tier: ORIGINAL 17import "nx_syscalls.nx" 18import "nx_itoa_lib.nx" // shared MSB-first emitter (zero-alloc) 19const ER_MAGIC_4096: i64 = 4096 20const ER_MAGIC_2097152: i64 = 2097152 21 22const ER_QUEUE: *u8 = "knowledge/registry/assignment_queue.tsv" 23const ER_BAK: *u8 = "knowledge/registry/assignment_queue.tsv.bak.preRollup" 24const ER_LOG: *u8 = "knowledge/status/epic_rollup.log" 25 26func rr_w(fd: i64, s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(fd, s, n); return 0 } 27// MIGRATED to the shared emitter (debt 1785563586). The old body mmapped a scratch buffer 28// per call and never freed it. At PAGE granularity that is 4096B leaked PER CALL -- the 29// defect that took 28.5GB of a 36GB host in nx_ts_lumadiff (2MB input, ~3.66M calls). 30// nxi_* is MSB-first, allocates NOTHING, and emits identical bytes including the sign. 31func rr_wn(fd: i64, v: i64) -> i64 { nxi_fd(fd, v); return 0 } 32 33func rr_read(path: *u8, buf: *u8, cap: i64) -> i64 { 34 let fd: i64 = sys_openat_rd(path) 35 if fd < 0 { return 0 } 36 var n: i64 = 0 37 var r: i64 = sys_read(fd, buf, cap - 1) 38 while r > 0 { n = n + r; if n >= cap - 1 { r = 0 } else { r = sys_read(fd, buf + n, cap - 1 - n) } } 39 sys_close(fd) 40 return n 41} 42 43func rr_at(buf: *u8, n: i64, i: i64, pat: *u8, pl: i64) -> i64 { 44 if i + pl > n { return 0 } 45 var k: i64 = 0 46 while k < pl { if buf[i + k] != pat[k] { return 0 } k = k + 1 } 47 return 1 48} 49 50// copy NUL-terminated literal s into dst; return length (for synthetic self-test buffers). 51func rr_setup(dst: *u8, s: *u8) -> i64 { var i: i64 = 0; while s[i] != (0 as u8) { dst[i] = s[i]; i = i + 1 } return i } 52 53// line at ls: does field 0 (up to the first tab) equal target[0..tlen)? 54func rr_field0_eq(buf: *u8, n: i64, ls: i64, target: *u8, tlen: i64) -> i64 { 55 if ls + tlen >= n { return 0 } 56 var m: i64 = 0 57 while m < tlen { if buf[ls + m] != target[m] { return 0 } m = m + 1 } 58 if buf[ls + tlen] != (9 as u8) { return 0 } 59 return 1 60} 61 62// find the row whose id == target[0..tlen); 1 if its line contains "\tDONE\t", 0 if found-not-done, -1 if absent. 63func rr_id_done(buf: *u8, n: i64, target: *u8, tlen: i64) -> i64 { 64 var ls: i64 = 0 65 var i: i64 = 0 66 while i <= n { 67 var eol: i64 = 0 68 if i == n { eol = 1 } else { if buf[i] == (10 as u8) { eol = 1 } } 69 if eol == 1 { 70 if rr_field0_eq(buf, n, ls, target, tlen) == 1 { 71 var done: i64 = 0 72 var k: i64 = ls 73 while k < i { if rr_at(buf, n, k, "\tDONE\t" as *u8, 6) == 1 { done = 1 } k = k + 1 } 74 return done 75 } 76 ls = i + 1 77 } 78 i = i + 1 79 } 80 return 0 - 1 81} 82 83// one scan: every TODO row with ||ROLLUP=children flips to DONE iff all children DONE. returns flip count. 84func rr_pass(buf: *u8, n: i64) -> i64 { 85 var flips: i64 = 0 86 var ls: i64 = 0 87 var i: i64 = 0 88 while i <= n { 89 var eol: i64 = 0 90 if i == n { eol = 1 } else { if buf[i] == (10 as u8) { eol = 1 } } 91 if eol == 1 { 92 var stp: i64 = 0 - 1 93 var rp: i64 = 0 - 1 94 var j: i64 = ls 95 while j < i { 96 if rr_at(buf, n, j, "\tTODO\t" as *u8, 6) == 1 { if stp < 0 { stp = j } } 97 if rr_at(buf, n, j, "||ROLLUP=" as *u8, 9) == 1 { rp = j + 9 } 98 j = j + 1 99 } 100 if stp >= 0 { if rp >= 0 { 101 var all: i64 = 1 102 var any: i64 = 0 103 var p: i64 = rp 104 var go: i64 = 1 105 while go == 1 { 106 if p >= i { go = 0 } else { 107 if buf[p] == (9 as u8) { go = 0 } else { 108 let cs: i64 = p 109 var tg: i64 = 1 110 while tg == 1 { 111 if p >= i { tg = 0 } else { 112 if buf[p] == (9 as u8) { tg = 0 } else { 113 if buf[p] == (44 as u8) { tg = 0 } else { p = p + 1 } 114 } 115 } 116 } 117 let clen: i64 = p - cs 118 if clen > 0 { 119 any = 1 120 let st: i64 = rr_id_done(buf, n, buf + cs, clen) 121 if st != 1 { all = 0 } 122 } 123 if p < i { if buf[p] == (44 as u8) { p = p + 1 } } 124 } 125 } 126 } 127 if any == 1 { if all == 1 { 128 buf[stp + 1] = 68 as u8 129 buf[stp + 2] = 79 as u8 130 buf[stp + 3] = 78 as u8 131 buf[stp + 4] = 69 as u8 132 flips = flips + 1 133 } } 134 } } 135 ls = i + 1 136 } 137 i = i + 1 138 } 139 return flips 140} 141 142func rr_emit(fd: i64, cpos: i64, cneg: i64, flipped: i64, epoch: i64, ok: i64) -> i64 { 143 rr_w(fd, "ROLLUPGATE authored=organ control_pos=" as *u8); rr_wn(fd, cpos) 144 rr_w(fd, " control_neg=" as *u8); rr_wn(fd, cneg) 145 rr_w(fd, " epics_flipped=" as *u8); rr_wn(fd, flipped) 146 rr_w(fd, " epoch=" as *u8); rr_wn(fd, epoch) 147 if ok == 1 { rr_w(fd, " verdict=GREEN\n" as *u8) } else { rr_w(fd, " verdict=RED\n" as *u8) } 148 return 0 149} 150 151func main() -> i64 { 152 // baked self-test: pos control (child DONE -> parent flips), neg control (child TODO -> no flip). 153 let tb: *u8 = sys_mmap(ER_MAGIC_4096) 154 let np: i64 = rr_setup(tb, "P1\tr\t1\tM\tB\tTODO\t-\tg||ROLLUP=C1\tt\nC1\tr\t1\tM\tB\tDONE\t-\tg\tt\n" as *u8) 155 let cpos: i64 = rr_pass(tb, np) 156 let tb2: *u8 = sys_mmap(ER_MAGIC_4096) 157 let nn: i64 = rr_setup(tb2, "P1\tr\t1\tM\tB\tTODO\t-\tg||ROLLUP=C1\tt\nC1\tr\t1\tM\tB\tTODO\t-\tg\tt\n" as *u8) 158 let cneg: i64 = rr_pass(tb2, nn) 159 160 var ok: i64 = 1 161 if cpos != 1 { ok = 0 } 162 if cneg != 0 { ok = 0 } 163 let epoch: i64 = sys_now_realtime_sec() 164 165 if ok == 0 { 166 rr_emit(1, cpos, cneg, 0, epoch, 0) 167 let lf0: i64 = sys_openat_append(ER_LOG, 420) 168 if lf0 >= 0 { rr_emit(lf0, cpos, cneg, 0, epoch, 0); sys_close(lf0) } 169 return 1 170 } 171 172 let buf: *u8 = sys_mmap(ER_MAGIC_2097152) 173 let qn: i64 = rr_read(ER_QUEUE, buf, ER_MAGIC_2097152) 174 if qn <= 0 { rr_w(1, "ROLLUPGATE verdict=RED reason=queue-missing\n" as *u8); return 1 } 175 176 let bfd: i64 = sys_openat_wr(ER_BAK, 420) 177 if bfd >= 0 { sys_write(bfd, buf, qn); sys_close(bfd) } 178 179 var total: i64 = 0 180 var go: i64 = 1 181 while go == 1 { 182 let f: i64 = rr_pass(buf, qn) 183 total = total + f 184 if f == 0 { go = 0 } 185 } 186 187 let wfd: i64 = sys_openat_wr(ER_QUEUE, 420) 188 if wfd < 0 { rr_w(1, "ROLLUPGATE verdict=RED reason=queue-unwritable\n" as *u8); return 1 } 189 sys_write(wfd, buf, qn) 190 sys_close(wfd) 191 192 rr_emit(1, cpos, cneg, total, epoch, 1) 193 let lf: i64 = sys_openat_append(ER_LOG, 420) 194 if lf >= 0 { rr_emit(lf, cpos, cneg, total, epoch, 1); sys_close(lf) } 195 return 0 196}