code wiki / _hdl_build / nx_capability_ladder.nx

nx_capability_ladder.nx source

↩ module page · 349 lines · 15008 B

1// nx_capability_ladder.nx -- THE BUILD-UP MAP, hardware rung up (operator 2026-06-13: 2// "we need mapping on how we build from the hardware rung up ... so we never have floating 3// capabilities but each layer below acts as the foundation for the one above"). 4// 5// Organ-AUTHORED (not hand-drawn): composes nx_assign_core to read the REAL queue and 6// COMPUTE, from the deps graph + DONE status, a layered map: 7// layer(row) = 0 if deps "-" ; else 1 + max(layer(dep)) (topological depth, fixpoint) 8// layer 0 = the foundations with no dependency = the hardware/toolchain rung. 9// FLOATING = a DONE capability whose foundation (a dep) is NOT DONE / is unknown 10// -- a capability standing on nothing. The no-floating LAW: zero floating. 11// Emits the map to knowledge/registry/capability_ladder.tsv (layer-ascending = bottom-up) 12// and a CAPLADDER evidence line. Navigation: the lowest ABSENT foundation is what to build 13// next; never build a row whose foundation is ABSENT (that would float). 14// 15// SELF-VALIDATING (no false-green): a baked pos control (DONE row on a DONE foundation -> 16// NOT floating) and neg control (DONE row on a TODO foundation -> floating) run on a 17// synthetic in-memory context BEFORE the real queue; controls wrong -> RED. Reuses 18// an_deps_done as the grounding primitive (DRY). license_tier: ORIGINAL 19import "nx_assign_core.nx" 20 21const CL_QUEUE: *u8 = "knowledge/registry/assignment_queue.tsv" 22const CL_MAP: *u8 = "knowledge/registry/capability_ladder.tsv" 23const CL_LOG: *u8 = "knowledge/status/capability_ladder.log" 24 25func cl_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 } 26func cl_wn(fd: i64, v: i64) -> i64 { let bb: *u8 = sys_mmap(28); var m: i64=v; if m<0 {m=0-m; sys_write(fd,"-" as *u8,1)}; let t: *u8 = sys_mmap(28); var k: i64=0; if m==0 {t[0]=48;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 {bb[i]=t[k-1-i]; i=i+1}; sys_write(fd, bb, k); return 0 } 27 28func cl_status_str(b: i64) -> *u8 { 29 if b == 68 { return "DONE" as *u8 } 30 if b == 84 { return "TODO" as *u8 } 31 if b == 78 { return "NOVEL" as *u8 } 32 if b == 87 { return "WIP" as *u8 } 33 if b == 71 { return "GEN" as *u8 } 34 if b == 82 { return "RED" as *u8 } 35 return "?" as *u8 36} 37 38// a dep token can name a built ORGAN (a capability foundation), not only a queue row. 39// try runtime/_hdl_build/<name>.nx then runtime/<name>.nx; exists -> 1. 40func cl_try_open(prefix: *u8, name: *u8) -> i64 { 41 let p: *u8 = sys_mmap(256) 42 var k: i64 = 0 43 var i: i64 = 0 44 while prefix[i] != (0 as u8) { p[k] = prefix[i]; k = k + 1; i = i + 1 } 45 i = 0 46 while name[i] != (0 as u8) { p[k] = name[i]; k = k + 1; i = i + 1 } 47 p[k] = 46 as u8; k = k + 1 48 p[k] = 110 as u8; k = k + 1 49 p[k] = 120 as u8; k = k + 1 50 p[k] = 0 as u8 51 let fd: i64 = sys_openat_rd(p) 52 if fd >= 0 { sys_close(fd); return 1 } 53 return 0 54} 55func cl_organ_exists(name: *u8) -> i64 { 56 if cl_try_open("runtime/_hdl_build/" as *u8, name) == 1 { return 1 } 57 if cl_try_open("runtime/" as *u8, name) == 1 { return 1 } 58 return 0 59} 60 61// all deps satisfied? a dep is satisfied iff it is a DONE queue row OR (not a row but) a built organ. 62// a non-DONE row dep (TODO/NOVEL) or a dep that is neither row nor organ (true dangling) -> NOT satisfied. 63// Grounds legitimate ORGAN foundations (the no-floating law: each built layer below IS a foundation) 64// while keeping genuine dangling/unbuilt deps flagged. LOCAL to the ladder -- does NOT alter the shared 65// an_deps_done (the dispatcher/reconcile sequencing is unchanged); only the FLOATING facet gains organ-awareness. 66func cl_deps_grounded(cx: *i64, r: i64) -> i64 { 67 let dd: *u8 = an_deps_at(cx, r) 68 if dd[0] == (45 as u8) { if dd[1] == (0 as u8) { return 1 } } 69 let st: *i64 = cx[4] as *i64 70 let tok: *u8 = sys_mmap(64) 71 var i: i64 = 0 72 var k: i64 = 0 73 var go: i64 = 1 74 var allok: i64 = 1 75 while go == 1 { 76 let ch: i64 = dd[i] as i64 77 var fin: i64 = 0 78 if ch == 0 { fin = 1 } 79 if ch == 44 { fin = 1 } 80 if fin == 1 { 81 if k > 0 { 82 tok[k] = 0 as u8 83 let dr: i64 = an_find(cx, tok) 84 var sat: i64 = 0 85 if dr >= 0 { if st[dr] == 68 { sat = 1 } } 86 if dr < 0 { if cl_organ_exists(tok) == 1 { sat = 1 } } 87 if sat == 0 { allok = 0 } 88 k = 0 89 } 90 if ch == 0 { go = 0 } 91 } else { 92 if k < 63 { tok[k] = ch as u8; k = k + 1 } 93 } 94 i = i + 1 95 } 96 return allok 97} 98 99// a DONE row whose foundation (deps) is not all grounded is FLOATING; pending rows are not floating. 100func cl_is_floating(cx: *i64, r: i64) -> i64 { 101 let st: *i64 = cx[4] as *i64 102 if st[r] != 68 { return 0 } 103 if cl_deps_grounded(cx, r) == 1 { return 0 } 104 return 1 105} 106 107// max layer over row r's deps (-1 = no resolvable deps). tok is a caller-owned scratch buffer. 108func cl_max_dep_layer(cx: *i64, r: i64, lay: *i64, tok: *u8) -> i64 { 109 let dd: *u8 = an_deps_at(cx, r) 110 if dd[0] == (45 as u8) { if dd[1] == (0 as u8) { return 0 - 1 } } 111 var maxl: i64 = 0 - 1 112 var i: i64 = 0 113 var k: i64 = 0 114 var go: i64 = 1 115 while go == 1 { 116 let ch: i64 = dd[i] as i64 117 var fin: i64 = 0 118 if ch == 0 { fin = 1 } 119 if ch == 44 { fin = 1 } 120 if fin == 1 { 121 if k > 0 { 122 tok[k] = 0 as u8 123 let dr: i64 = an_find(cx, tok) 124 if dr >= 0 { if lay[dr] > maxl { maxl = lay[dr] } } 125 k = 0 126 } 127 if ch == 0 { go = 0 } 128 } else { 129 if k < 63 { tok[k] = ch as u8; k = k + 1 } 130 } 131 i = i + 1 132 } 133 return maxl 134} 135 136func cl_emit_row(fd: i64, L: i64, cx: *i64, r: i64, stx: *i64, flt: *i64) -> i64 { 137 cl_wn(fd, L); cl_w(fd, "\t" as *u8) 138 cl_w(fd, an_id_at(cx, r)); cl_w(fd, "\t" as *u8) 139 cl_w(fd, cl_status_str(stx[r])); cl_w(fd, "\t" as *u8) 140 if flt[r] == 1 { cl_w(fd, "FLOATING" as *u8) } else { cl_w(fd, "grounded" as *u8) } 141 cl_w(fd, "\t" as *u8) 142 cl_w(fd, an_deps_at(cx, r)) 143 cl_w(fd, "\n" as *u8) 144 return 0 145} 146 147// PHANTOM vs MISSING refinement for a dangling dep (not-row, not-organ): PHANTOM if its arc 148// (token up to its LAST '-') has OTHER real rows = a planned-but-uncreated foundation id 149// (repoint the dep to a real sibling in that arc); else MISSING = truly dangling (typo/deleted 150// arc, no siblings). Deterministic -- compares id prefixes, no heuristic target-guessing. 151func cl_arc_sibling(cx: *i64, tok: *u8) -> i64 { 152 var n: i64 = 0 153 while tok[n] != (0 as u8) { n = n + 1 } 154 var last: i64 = 0 - 1 155 var i: i64 = 0 156 while i < n { if tok[i] == (45 as u8) { last = i } i = i + 1 } 157 if last <= 0 { return 0 } 158 var r2: i64 = 0 159 while r2 < cx[0] { 160 let id2: *u8 = an_id_at(cx, r2) 161 var j: i64 = 0 162 var pre: i64 = 1 163 while j < last { 164 if id2[j] != tok[j] { pre = 0; j = last } else { j = j + 1 } 165 } 166 if pre == 1 { if id2[last] == (45 as u8) { return 1 } } 167 r2 = r2 + 1 168 } 169 return 0 170} 171 172// for each dep of row r, print " <id>=<status|PHANTOM|MISSING>" -- the triage classifier: 173// PHANTOM = planned arc-foundation never created (repoint); MISSING = truly dangling dep (correct it); 174// NOVEL/TODO = real unbuilt foundation (build it); ORGAN = grounded on a built organ (not floating). 175func cl_dep_blockers(fd: i64, cx: *i64, r: i64, tok: *u8) -> i64 { 176 let dd: *u8 = an_deps_at(cx, r) 177 let st: *i64 = cx[4] as *i64 178 var i: i64 = 0 179 var k: i64 = 0 180 var go: i64 = 1 181 while go == 1 { 182 let ch: i64 = dd[i] as i64 183 var fin: i64 = 0 184 if ch == 0 { fin = 1 } 185 if ch == 44 { fin = 1 } 186 if fin == 1 { 187 if k > 0 { 188 tok[k] = 0 as u8 189 let dr: i64 = an_find(cx, tok) 190 cl_w(fd, " " as *u8); cl_w(fd, tok); cl_w(fd, "=" as *u8) 191 if dr < 0 { if cl_organ_exists(tok) == 1 { cl_w(fd, "ORGAN" as *u8) } else { if cl_arc_sibling(cx, tok) == 1 { cl_w(fd, "PHANTOM" as *u8) } else { cl_w(fd, "MISSING" as *u8) } } } else { cl_w(fd, cl_status_str(st[dr])) } 192 k = 0 193 } 194 if ch == 0 { go = 0 } 195 } else { 196 if k < 63 { tok[k] = ch as u8; k = k + 1 } 197 } 198 i = i + 1 199 } 200 return 0 201} 202 203// name one floating capability + classify its blocking foundation (organ-surfaced triage). 204func cl_float_line(fd: i64, cx: *i64, r: i64, lay: *i64, stx: *i64, tok: *u8) -> i64 { 205 cl_w(fd, "CAPFLOAT layer=" as *u8); cl_wn(fd, lay[r]) 206 cl_w(fd, " id=" as *u8); cl_w(fd, an_id_at(cx, r)) 207 cl_w(fd, " status=" as *u8); cl_w(fd, cl_status_str(stx[r])) 208 cl_w(fd, " blocking-foundation:" as *u8) 209 cl_dep_blockers(fd, cx, r, tok) 210 cl_w(fd, "\n" as *u8) 211 return 0 212} 213 214func cl_gate(fd: i64, cpos: i64, cneg: i64, corgpos: i64, corgneg: i64, caps: i64, layers: i64, present: i64, floating: i64, epoch: i64, ok: i64) -> i64 { 215 cl_w(fd, "CAPLADDER authored=organ control_pos=" as *u8); cl_wn(fd, cpos) 216 cl_w(fd, " control_neg=" as *u8); cl_wn(fd, cneg) 217 cl_w(fd, " control_org_pos=" as *u8); cl_wn(fd, corgpos) 218 cl_w(fd, " control_org_neg=" as *u8); cl_wn(fd, corgneg) 219 cl_w(fd, " capabilities=" as *u8); cl_wn(fd, caps) 220 cl_w(fd, " layers=" as *u8); cl_wn(fd, layers) 221 cl_w(fd, " present=" as *u8); cl_wn(fd, present) 222 cl_w(fd, " floating=" as *u8); cl_wn(fd, floating) 223 if floating == 0 { cl_w(fd, " ladder_coherent=YES" as *u8) } else { cl_w(fd, " ladder_coherent=NO" as *u8) } 224 cl_w(fd, " epoch=" as *u8); cl_wn(fd, epoch) 225 if ok == 1 { cl_w(fd, " verdict=GREEN\n" as *u8) } else { cl_w(fd, " verdict=RED\n" as *u8) } 226 return 0 227} 228 229// build a 2-row synthetic context: B (done) depends on A; caller sets A's status to test grounding. 230func cl_make_test(a_status: i64) -> i64 { 231 let tcx: *i64 = an_newcx() 232 tcx[0] = 2 233 let a0: *u8 = an_id_at(tcx, 0); a0[0] = 65 as u8; a0[1] = 0 as u8 // "A" 234 let d0: *u8 = an_deps_at(tcx, 0); d0[0] = 45 as u8; d0[1] = 0 as u8 // "-" 235 let a1: *u8 = an_id_at(tcx, 1); a1[0] = 66 as u8; a1[1] = 0 as u8 // "B" 236 let d1: *u8 = an_deps_at(tcx, 1); d1[0] = 65 as u8; d1[1] = 0 as u8 // "A" 237 let st: *i64 = tcx[4] as *i64 238 st[0] = a_status 239 st[1] = 68 // B is DONE 240 return cl_is_floating(tcx, 1) // does B float? 241} 242 243// organ-foundation control: a 1-row DONE context whose single dep is <dep>. dep names a built organ -> 244// grounded (0); dep names nothing (no row, no organ) -> floating (1). Validates the organ-dep path. 245func cl_make_test_org(dep: *u8) -> i64 { 246 let tcx: *i64 = an_newcx() 247 tcx[0] = 1 248 let a1: *u8 = an_id_at(tcx, 0); a1[0] = 66 as u8; a1[1] = 0 as u8 // "B" 249 let d1: *u8 = an_deps_at(tcx, 0) 250 var i: i64 = 0 251 while dep[i] != (0 as u8) { d1[i] = dep[i]; i = i + 1 } 252 d1[i] = 0 as u8 253 let st: *i64 = tcx[4] as *i64 254 st[0] = 68 // B is DONE 255 return cl_is_floating(tcx, 0) // does B float? 256} 257 258func main() -> i64 { 259 // baked self-test: foundation DONE -> B not floating (0); foundation TODO -> B floating (1). 260 // organ controls: a dep naming a BUILT organ -> grounded (0); a dep naming nothing -> floating (1). 261 let cpos: i64 = cl_make_test(68) // A DONE -> expect 0 262 let cneg: i64 = cl_make_test(84) // A TODO -> expect 1 263 let corgpos: i64 = cl_make_test_org("nx_assign_core" as *u8) // real organ -> expect 0 264 let corgneg: i64 = cl_make_test_org("ZZ_NOEXIST_FOUNDATION" as *u8) // nothing -> expect 1 265 var ok: i64 = 1 266 if cpos != 0 { ok = 0 } 267 if cneg != 1 { ok = 0 } 268 if corgpos != 0 { ok = 0 } 269 if corgneg != 1 { ok = 0 } 270 let epoch: i64 = sys_now_realtime_sec() 271 272 if ok == 0 { 273 cl_gate(1, cpos, cneg, corgpos, corgneg, 0, 0, 0, 0, epoch, 0) 274 let lf0: i64 = sys_openat_append(CL_LOG, 420) 275 if lf0 >= 0 { cl_gate(lf0, cpos, cneg, corgpos, corgneg, 0, 0, 0, 0, epoch, 0); sys_close(lf0) } 276 return 1 277 } 278 279 let cx: *i64 = an_newcx() 280 let nrows: i64 = an_load(CL_QUEUE, cx) 281 if nrows <= 0 { cl_w(1, "CAPLADDER verdict=RED reason=queue-missing\n" as *u8); return 1 } 282 283 // layer fixpoint (topological depth from the no-deps foundations) 284 let lay: *i64 = sys_mmap(nrows * 8) as *i64 285 var r: i64 = 0 286 while r < nrows { lay[r] = 0; r = r + 1 } 287 let tok: *u8 = sys_mmap(64) 288 var pass: i64 = 0 289 var go: i64 = 1 290 while go == 1 { 291 var changed: i64 = 0 292 var r2: i64 = 0 293 while r2 < nrows { 294 let md: i64 = cl_max_dep_layer(cx, r2, lay, tok) 295 var nl: i64 = 0 296 if md >= 0 { nl = md + 1 } 297 if nl > lay[r2] { lay[r2] = nl; changed = 1 } 298 r2 = r2 + 1 299 } 300 pass = pass + 1 301 if changed == 0 { go = 0 } 302 if pass >= 64 { go = 0 } 303 } 304 305 // floating + counts 306 let flt: *i64 = sys_mmap(nrows * 8) as *i64 307 let stx: *i64 = cx[4] as *i64 308 var present: i64 = 0 309 var floating: i64 = 0 310 var maxlayer: i64 = 0 311 r = 0 312 while r < nrows { 313 if stx[r] == 68 { present = present + 1 } 314 let fl: i64 = cl_is_floating(cx, r) 315 flt[r] = fl 316 if fl == 1 { floating = floating + 1 } 317 if lay[r] > maxlayer { maxlayer = lay[r] } 318 r = r + 1 319 } 320 321 // emit the map, layer-ascending (hardware rung up) 322 let mfd: i64 = sys_openat_wr(CL_MAP, 420) 323 if mfd >= 0 { 324 cl_w(mfd, "# AUTHORED BY nx_capability_ladder -- build-up map from the hardware rung up (layer 0 = no-deps foundations). Layer + grounding COMPUTED from assignment_queue.tsv deps+DONE status, NOT asserted. FLOATING = a DONE capability resting on a non-DONE foundation (no-floating law).\n" as *u8) 325 cl_w(mfd, "# columns: layer\tid\tstatus\tgrounding\tdeps\n" as *u8) 326 var L: i64 = 0 327 while L <= maxlayer { 328 var r3: i64 = 0 329 while r3 < nrows { 330 if lay[r3] == L { cl_emit_row(mfd, L, cx, r3, stx, flt) } 331 r3 = r3 + 1 332 } 333 L = L + 1 334 } 335 sys_close(mfd) 336 } 337 338 cl_gate(1, cpos, cneg, corgpos, corgneg, nrows, maxlayer + 1, present, floating, epoch, 1) 339 var rf: i64 = 0 340 while rf < nrows { if flt[rf] == 1 { cl_float_line(1, cx, rf, lay, stx, tok) } rf = rf + 1 } 341 let lf: i64 = sys_openat_append(CL_LOG, 420) 342 if lf >= 0 { 343 cl_gate(lf, cpos, cneg, corgpos, corgneg, nrows, maxlayer + 1, present, floating, epoch, 1) 344 rf = 0 345 while rf < nrows { if flt[rf] == 1 { cl_float_line(lf, cx, rf, lay, stx, tok) } rf = rf + 1 } 346 sys_close(lf) 347 } 348 return 0 349}