code wiki / _hdl_build / nx_pm_choose.nx

nx_pm_choose.nx

buildroot/runtime/_hdl_build/nx_pm_choose.nx

5737 B68 linesdepth 3pulls 4 transitivereach 0 importersview sourcekind tooltopic pm

docs dependencies structs consts functions

about

nx_pm_choose.nx -- the PM CHOOSES the next priority (operator: "let them choose whats the priorities and work with you"). Composes nx_pm_decision_matrix over the CURRENT open backlog: WSJF = Cost-of-Delay/effort, confidence-adjusted, win-win-win (no stakeholder regression), READY-gated (blocked items can't be picked). The PM ranks + auto-picks the top READY item and routes it (TEAM-OWNED vs needs-Claude-TUTOR); Claude then partners on whatever it chose. The choice is the team's, not Claude's. license_tier: ORIGINAL

dependencies 3 imports · 0 importers

imports: nx_pm_decision_matrix.nxnx_pm_review_log.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

14	const W_HW: i64 = 2
15	const W_SW: i64 = 3
16	const W_USER: i64 = 4
17	const W_TIME: i64 = 3
18	const NI: i64 = 10

functions

10	func pc_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } called by 1: main calls 1: sys_write
11	func pc_fn(fd: i64, v: i64) -> i64 { let b: u8=sys_mmap(28); var m: i64=v; 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{b[i]=t[k-1-i];i=i+1}; sys_write(fd,b,k); return 0 } called by 1: pc_n calls 2: sys_mmap sys_write
12	func pc_n(v: i64) -> i64 { return pc_fn(1, v) } called by 1: main calls 1: pc_fn
20	func main() -> i64 calls 12: sys_mmap dm_cost_of_delay dm_wsjf dm_no_regression dm_ready pc_puts+6