code wiki / _hdl_build / nx_layer_campaign.nx

nx_layer_campaign.nx

buildroot/runtime/_hdl_build/nx_layer_campaign.nx

6021 B88 linesdepth 4pulls 8 transitivereach 0 importersview sourcekind tool

docs dependencies structs consts functions

about

nx_layer_campaign.nx -- the TEAM drives its own S-class campaign, level 8 up to level 0. It walks every layer; where it already HAS a search space it RUNS the find-minimal-verify loop and confirms its exceed; where it does NOT, it FLAGS the search space it must build next. The output is the team's own bottom-up roadmap -- it tells YOU what's next at each layer, and the engine to pursue it (sweep -> synthesize -> verify -> race -> parallel-ingest) already exists. The team plans + executes; no human authors the path. license_tier: ORIGINAL

dependencies 5 imports · 0 importers

imports: nx_mulchain.nxnx_itoa_lib.nxnx_superopt_emit.nxnx_engineer_crash.nxnx_boolsynth.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_8192: i64 = 8192

functions

15	func lc_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 2: lc_row lc_main
20	func lc_num(v: i64) -> i64 { nxi_out(v); return 0 } called by 1: lc_row calls 1: nxi_out
21	func lc_booleval(op: i64, a: i64, b: *i64, L: i64) -> i64 called by 1: lc_have_gates calls 1: bl_eval
27	func lc_have_gates() -> i64 { // L7 called by 1: lc_main calls 2: bl_find lc_booleval
32	func lc_have_alu() -> i64 { // L6 called by 1: lc_main calls 1: bl_find
37	func lc_have_codegen() -> i64 { // L5 called by 1: lc_main calls 5: mulchain_find se_emit_full sys_openat_wr eng_link eng_run
49	func lc_row(lv: i64, name: u8, status: i64, ok: i64, evidence: u8, next: *u8) -> i64 called by 1: lc_main calls 2: lc_puts lc_num
58	func lc_main(r: *i64) -> i64 called by 1: main calls 5: lc_puts lc_have_gates lc_have_alu lc_have_codegen lc_row
82	func main() -> i64 calls 1: lc_main