code wiki / _hdl_build / nx_product_score.nx
nx_product_score.nx
buildroot/runtime/_hdl_build/nx_product_score.nx
about
nx_product_score.nx -- dmkt lane (atlas-product arc). The DECISION layer the design-to-market model was
missing: an HONEST product-viability scorecard. Reads the sibling foundation (dmktneeds- needs plane +
dmktcap- capability plane), matches each need to a fulfilling LIVE capability (need-id substring in a
cap's keyword note, cap status=LIVE = the same fulfilment edge nx_product_atlas_build uses), and emits a
per-need coverage + a GO/NO-GO-class verdict. ★NO FAKE NUMBERS (operator law): a need covered by a
*_research_fetch cap is DATA-PENDING (the fetch must RUN for real demand/cost figures) -- reported as
PENDING, never as a fabricated GO. Composition: fork-captures nx_store_put.elf load (no schema drift).
READ-ONLY; scorecard to stdout + atomic knowledge/status/product_score.out.
nx_product_score [needs-prefix] [caps-prefix]
ENVELOPE: 64 needs, 64 caps, declared. exit: 0 | 4 planes-unreadable | 2 usage-ok(defaults).
license_tier: ORIGINAL expect_exit: 0
dependencies 1 imports · 0 importers
imports: nx_tool_run.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
| 13 | const K_MAGIC_60000: i64 = 60000 |
| 14 | const K_MAGIC_131072: i64 = 131072 |
| 15 | const K_MAGIC_65536: i64 = 65536 |
functions
| 17 | func pc_b(rep: *u8, pos: i64, s: *u8) -> i64 { var p: i64 = pos; var i: i64 = 0; while s[i] != (0 as u8) { if p < K_MAGIC_60000 { rep[p] = s[i]; p = p + 1 } i = i + 1 } return p } called by 1: main |
| 18 | func pc_bn(rep: *u8, pos: i64, v: i64) -> i64 { var p: i64 = pos; var m: i64 = v; if m < 0 { if p < K_MAGIC_60000 { rep[p] = 45 as u8; p = p + 1 } m = 0 - m } 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 { if p < K_MAGIC_60000 { rep[p] = t[k - 1 - i]; p = p + 1 } i = i + 1 } return p } called by 1: main |
| 19 | func pc_q(rep: *u8, pos: i64) -> i64 { var p: i64 = pos; if p < K_MAGIC_60000 { rep[p] = 34 as u8; p = p + 1 } return p } called by 1: main |
| 20 | func pc_je(rep: *u8, pos: i64, src: *u8, s: i64, e: i64) -> i64 called by 1: main |
| 25 | func pc_load(prefix: *u8, out: *u8, cap: i64) -> i64 |
| 35 | func pc_field(buf: *u8, ls: i64, le: i64, idx: i64, feo: *i64) -> i64 called by 1: main |
| 49 | func pc_sub(a: *u8, na: i64, nb: i64, c: *u8, cs: i64, ce: i64) -> i64 called by 1: main |
| 61 | func pc_islive(buf: *u8, s: i64, e: i64) -> i64 { if e - s < 4 { return 0 } if buf[s] == (76 as u8) { if buf[s+1] == (73 as u8) { if buf[s+2] == (86 as u8) { if buf[s+3] == (69 as u8) { return 1 } } } } return 0 } called by 1: main |
| 63 | func pc_isfetch(buf: *u8, s: i64, e: i64) -> i64 called by 1: main |
| 68 | func main(argc: i64, argv: *i64) -> i64 |