code wiki / _hdl_build / nx_memalloc_emit.nx
nx_memalloc_emit.nx
buildroot/runtime/_hdl_build/nx_memalloc_emit.nx
about
nx_memalloc_emit.nx -- KERNEL MEMORY ALLOCATOR (bump) + store/load round-trip, the foundational
memory-management rung (toward census kernel-memory-allocator; foundation for K-R3 self-host:
organs need a heap). AUTHOR=ORGAN: table-computes a bare-metal rv64 image (zero hand-written
machine code) that runs a KAT: alloc a1 + a2 from a bump heap, store distinct values, LOAD them
back, and verify (a) each byte round-trips and (b) a2 == a1 + size (distinct allocations). Emits
'M' iff every check passes, else 'X'. The GOLDEN ("M") is TABLE-COMPUTED, byte-reproducible.
Adds the LOAD encoder (lbu) the kernel emitter family lacked -- needed for all real kernel state.
nx_memalloc_emit -> runtime/_hdl_build/_memalloc_virt.bin + .gold
Sovereign, no gcc/.sh. 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
| 11 | const MA_MAGIC_4096: i64 = 4096 |
| 13 | const MA_OUT: *u8 = "runtime/_hdl_build/_memalloc_virt.bin" |
| 14 | const MA_GOLD: *u8 = "runtime/_hdl_build/_memalloc_virt.bin.gold" |
| 15 | const MA_LOG: *u8 = "knowledge/status/memalloc.log" |
| 17 | const MA_UART: i64 = 0x10000000 |
| 18 | const MA_FIN: i64 = 0x100000 |
| 19 | const MA_PASS: i64 = 0x5555 |
| 20 | const MA_HEAP: i64 = 0x80002000 // bump-heap base (valid guest RAM on the emu) |
| 21 | const MA_SZ: i64 = 0x10 // allocation size |
| 22 | const MA_VAL_A: i64 = 0xAA |
| 23 | const MA_VAL_B: i64 = 0xBB |
| 24 | const MA_CH_M: i64 = 77 // 'M' success |
| 25 | const MA_CH_K: i64 = 75 // 'K' (success marker "MK", distinct from runner's "EMU") |
| 26 | const MA_CH_X: i64 = 88 // 'X' fail |
| 28 | const MA_FAIL: i64 = 92 |
| 29 | const MA_HALT: i64 = 104 |
| 31 | const RV_X0: i64 = 0 |
| 32 | const RV_T0: i64 = 5 |
| 33 | const RV_T1: i64 = 6 |
| 34 | const RV_T2: i64 = 7 |
| 35 | const RV_T3: i64 = 28 |
| 36 | const RV_T4: i64 = 29 |
| 37 | const RV_T5: i64 = 30 |
functions
| 39 | func ma_lui(rd: i64, imm20: i64) -> i64 { return ((imm20 & 0xFFFFF) << 12) | (rd << 7) | 0x37 } called by 1: main |
| 40 | func ma_addi(rd: i64, rs1: i64, imm: i64) -> i64 { return ((imm & 0xFFF) << 20) | (rs1 << 15) | (rd << 7) | 0x13 } called by 1: main |
| 41 | func ma_store(rs2: i64, rs1: i64, f3: i64, imm: i64) -> i64 called by 1: main |
| 47 | func ma_load(rd: i64, rs1: i64, f3: i64, imm: i64) -> i64 { return ((imm & 0xFFF) << 20) | (rs1 << 15) | (f3 << 12) | (rd << 7) | 0x03 } called by 1: main |
| 48 | func ma_branch(rs1: i64, rs2: i64, f3: i64, imm: i64) -> i64 called by 1: main |
| 55 | func ma_jal(rd: i64, imm: i64) -> i64 called by 1: main |
| 62 | func ma_w32(buf: *u8, off: i64, w: i64) -> i64 called by 1: main |
| 66 | func ma_p(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 67 | func ma_fp(fd: i64, s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(fd,s,n); return 0 } |
| 68 | func ma_fn(fd: i64, v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m}; let t: *u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=48;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{bb[i]=t[k-1-i];i=i+1}; sys_write(fd,bb,k); return 0 } |
| 70 | func main() -> i64 |