nx_nofloat_qwen_encode_prep_gate.nx
buildroot/runtime/nx_nofloat_qwen_encode_prep_gate.nx
about
nx_nofloat_qwen_encode_prep_gate.nx -- ENCODE foundation: the BPE merges + the reverse (string -> id) lookup.
BPE encode (text -> ids) needs (a) the merge rules (tokenizer.ggml.merges, an ARRAY of STRING ranked by
priority) and (b) a token-string -> id map (the reverse of decode). This gate proves both: merges present +
counted, and string->id round-trips decode ("!"->0, double-quote->1) with a negative control. Pure
metadata + byte-compare (nx_gguf_meta; no LLM-helper dup). The full merge-apply loop is the next rung.
No hw writes (Rule 26). expect_exit: 0 license_tier: ORIGINAL
dependencies 8 imports · 0 importers
imports: nx_syscalls.nxnx_tier.nxnx_le.nxnx_tensor.nxnx_gguf.nxnx_gguf_meta.nxnx_gate_verdict.nxnx_stage_path.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
| 16 | func ep_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 17 | func ep_num(v: i64) -> i64 { let b: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m;sys_write(1,"-" as *u8,1)} 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(1,b,k); return 0 } |
| 18 | func ep_slen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: main |
| 19 | func bytes_eq(a: *u8, b: *u8, n: i64) -> i64 { var i: i64=0; while i<n { if a[i]!=b[i] { return 0 } i=i+1 } return 1 } called by 1: find_token_id |
| 21 | func find_token_id(buf: *u8, first: i64, vocab: i64, target: *u8, tlen: i64) -> i64 |
| 31 | func main() -> i64 |