code wiki / _hdl_build / nx_mobi_huffreal_gate.nx
nx_mobi_huffreal_gate.nx
buildroot/runtime/_hdl_build/nx_mobi_huffreal_gate.nx
about
nx_mobi_huffreal_gate.nx -- REAL-FILE validation of the sovereign HUFF/CDIC decoder against a genuine
kindlegen-produced HUFF/CDIC MOBI (the libmobi LGPL test sample, durably registered as the benchmark reference
libmobi-sample-huffdic.ref). Unlike nx_mobi_huff_gate (the synthetic minimal codelen-1 case), this exercises the
REAL multi-codelen Huffman tables + the mincode-walk + recursive non-terminal phrases on 28 real text records.
nx_mobi_book (17480 path) -> reader/real_huffdic/ -> nx_nmz_pack -> .nmz @kind=book.
Asserts: decode succeeds; the decompressed length == the declared textLen (the strong correctness signal);
the prose is genuinely READABLE (distinctive phrases, not right-length garbage); EXTH metadata; and the .nmz.
Depends on the durable reference at knowledge/benchmarks/refs/ (re-fetch via nx_benchmark_ref if absent).
expect_exit: 0 license_tier: ORIGINAL
dependencies 1 imports · 0 importers
imports: nx_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
| none |
functions
| 12 | func gp(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 13 | func gnum(v0: i64) -> i64 { var v: i64=v0; if v<0 { sys_write(1,"-" as *u8,1); v=0-v } let b: *u8=sys_mmap(24); var k: i64=0; if v==0 {b[0]=48 as u8;k=1} while v>0 {b[k]=(48+(v%10)) as u8; v=v/10; k=k+1} let o: *u8=sys_mmap(24); var j: i64=0; while j<k {o[j]=b[k-1-j];j=j+1} sys_write(1,o,k); return 0 } |
| 14 | func ghas(hay: *u8, hl: i64, needle: *u8) -> i64 called by 1: main |
| 21 | func rd(path: *u8, lenp: *i64) -> *u8 { lenp[0]=0; return sys_read_file(path, lenp) } |
| 23 | func spawn(path: *u8, a0: *u8, a1: *u8, redir: *u8) -> i64 |
| 44 | func main() -> i64 |