code wiki / _hdl_build / nx_conductor_notes.nx
nx_conductor_notes.nx
buildroot/runtime/_hdl_build/nx_conductor_notes.nx
about
nx_conductor_notes.nx -- X-REH-004: CONDUCTOR'S NOTES (operator rehearsal law: after
each run-through the conductor names the WEAKEST section and calls its next drill).
The self-direction organ: it reads the team's OWN evidence -- examiner_arcs.log (which
arcs are RED) cross-referenced with sections.tsv (which section owns each arc's
chain) -- and names the weakest section + files a SECTIONAL drill row for it, hands
off. No tutor points at the weak spot; the team finds its own. When all green, it
names the readiness (green-streak) instead. Durable: NOTES row -> knowledge/status/
conductor_notes.log + a CN-DRILL channel-style row routed to the queue when red.
Exit 0 always (notes are observation, never failure). license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_framed_append.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
| 16 | const CN_MAGIC_1048576: i64 = 1048576 |
| 17 | const CN_MAGIC_1048560: i64 = 1048560 |
| 18 | const CN_MAGIC_262144: i64 = 262144 |
| 19 | const CN_MAGIC_262128: i64 = 262128 |
| 20 | const CN_REC_CAP: i64 = 256 // bounded NOTES record size (no magic number) |
functions
| 21 | func _p(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 22 | func _fp(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 } calls 1: sys_write |
| 23 | func _fn(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 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{bb[i]=t[k-1-i];i=i+1}; sys_write(fd,bb,k); return 0 } |
| 30 | func cn_emit_red(path: *u8, epoch: i64, arc: *u8) -> i64 |
| 42 | func cn_emit_green(path: *u8, epoch: i64, streak: i64) -> i64 |
| 52 | func cn_len(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } called by 1: cn_slice_has |
| 53 | func cn_read(path: *u8, buf: *u8, cap: i64) -> i64 |
| 62 | func cn_slice_has(hay: *u8, a: i64, b: i64, pat: *u8) -> i64 |
| 77 | func cn_last_red(buf: *u8, n: i64, out: *u8) -> i64 |
| 106 | func main() -> i64 |