code wiki / _hdl_build / nx_assign_next.nx
nx_assign_next.nx
buildroot/runtime/_hdl_build/nx_assign_next.nx
about
nx_assign_next.nx -- the CONDUCTOR's SEQUENCER over the assignment queue
(RACI-clean: this organ does NOT own prioritization -- the PM does).
PRIORITY (the w column) is PM-OWNED DATA: seeded advisory 2026-06-11,
re-scored by the PM's existing decision organs (nx_pm_decision_matrix
WSJF via the PM-RESCORE queue card) -- this organ only READS it.
SEQUENCING (this organ, Conductor verb): of the PM-ranked rows, which is
RUNNABLE NOW (status TODO + every dep DONE)? That readiness gate is
nx_pm_choose's READY rule applied to the durable queue file.
DRIFT DETECT (Auditor view): STRUCTVIEW = the dep graph's own largest
blocker; VIEWPOINT-DISCREPANCY suffix when structure outranks the PM
column (>=3 dependents, w <= 7) -- surfaced for PM re-score, not acted on.
TUTOR ROUTE: RAISEDHANDS = NOVEL rows (nx_pm_choose's TUTOR route over the
queue; the only rows that cost Claude tokens -- batching them is the
token-efficiency lever).
Composes-not-duplicates: nx_pm_decision_matrix/nx_pm_choose (priority),
nx_work_dispatcher (the attempt loop, Q3). Every beat appends ASSIGNNEXT /
STRUCTVIEW / RAISEDHANDS rows to knowledge/status/assign_next.log.
argv[1] = queue path override (gates use a scratch queue).
license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_assign_core.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
| 24 | func anx_p(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 25 | func anx_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 } |
| 26 | func anx_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 } |
| 28 | func anx_both(lfd: i64, s: *u8) -> i64 |
| 34 | func anx_bothn(lfd: i64, v: i64) -> i64 |
| 40 | func main(argc: i64, argv: *i64) -> i64 |