code wiki / _hdl_build / nx_game_sclass_census.nx
nx_game_sclass_census.nx
buildroot/runtime/_hdl_build/nx_game_sclass_census.nx
about
nx_game_sclass_census.nx -- THE S-CLASS GAME-EMISSION FOUNDATION CENSUS. Mechanizes the hardware-rung-up
roadmap (Nishi researcher corpus + the research team's synthesis) toward AUTONOMOUSLY EMITTING S-class games
across all 17 open-source-games genres INCLUDING MMOs. For each foundational RUNG it grades coverage from
on-disk FACTS, never self-scored:
EXCEEDS = a measured gate organ for that rung opens on disk
PRESENT = an implementing organ opens on disk
RESEARCHED = the sovereign corpus (knowledge/fetched/gr_*.raw) corroborates it (>=2 sources), not yet built
NOTED = 1 corpus source (hearsay, not enough)
ABSENT = nothing yet
Then it emits the PRIORITIZED GAP ROADMAP: the not-yet-built rungs in build-order (the research team's step
sequence), so the team knows exactly what to build next to make the most genres emittable. LIAR-KILL: a
fabricated rung mapped to a fabricated organ must NEVER grade PRESENT/EXCEEDS. Print-only, sovereign, no tsv.
census-subject: product-surface
INSTRUMENT-UPGRADED 2026-07-10 (operator liar-kill "toy level / censuses avoid UI"): + UI/PRODUCT AXES
section scoring OUR EMITTED GAMES vs NAMED DATED bars -- Godot 4.x / Luanti / Veloren (banked 2026-07-09/10:
pb_* layer/feature/release + rh_* repo-health evidence; axes cross-corroborated by nx_axis_discover 782-term
field vocabulary). Foundation grading kept (additive, not reductive).
license_tier: ORIGINAL expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_game_synth.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
| 21 | const K_MAGIC_2097152: i64 = 2097152 |
functions
| 23 | func w(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 24 | func wn(v: i64) -> i64 { var m: i64=v; if m<0{w("-" as *u8);m=0-m} let t:*u8=sys_mmap(24); 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; let o:*u8=sys_mmap(24); while i<k{o[i]=t[k-1-i];i=i+1} sys_write(1,o,k); return 0 } |
| 25 | func slen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: cell |
| 26 | func gstr(g: i64) -> *u8 { if g==4 { return "EXCEEDS " as *u8 } if g==3 { return "PRESENT " as *u8 } if g==2 { return "RESEARCHED" as *u8 } if g==1 { return "NOTED " as *u8 } return "ABSENT " } |
| 29 | func cell(tier: *u8, id: *u8, name: *u8, key: *u8, organ: *u8, exceed: *u8, prio: i64, ctx: *i64, isneg: i64) -> i64 |
| 48 | func ub(nm: *u8, us: i64, bar: i64, ev: *u8, ut: *i64) -> i64 |
| 57 | func main(argc: i64, argv: *i64) -> i64 |