code wiki / _hdl_build / _perm_gate.nx
_perm_gate.nx
buildroot/runtime/_hdl_build/_perm_gate.nx
about
_perm_gate.nx -- LOCK for Sv39 PAGE-PERMISSION enforcement (X-PAGE-PERM-001). NO mocks.
Proves the CPU enforces the leaf PTE permission bits PER ACCESS TYPE (riscv-priv-spec): a fetch needs
X (the NX-bit / W^X foundation: a data page is NOT executable), a load needs R. Each axis is proven
with a SINGLE-BIT-DIFFERENCE control so the gate shows the *specific* bit is enforced, not just "any
fault". Drives the already-param-able emits (nx_ifetch_emit code-PTE arg, nx_paging_emit data-PTE arg)
on the sovereign emu -- no new image emitter needed.
T1 fetch-needs-X : code page V|R|W (0x..07, NO X) -> the FETCH of the virtual PC raises an
instruction-page-fault -> handler "IPF", and "IOK" never prints.
T2 fetch-X-control: code page V|R|W|X (0x..0F) -> fetch succeeds -> "IOK". (only the X bit differs)
T3 load-needs-R : data page V|W|X (0x..0D, NO R) -> the LOAD faults -> "VOK" never prints.
T4 load-R-control: data page V|R|W|X (0x..0F) -> load succeeds -> "VOK". (only the R bit differs)
GREEN only if T1..T4 hold. Evidence -> knowledge/status/paging.log (PERMGATE). 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
| 15 | const PM_IFEMIT: *u8 = "_offc/nx_ifetch_emit.elf" |
| 16 | const PM_PGEMIT: *u8 = "_offc/nx_paging_emit.elf" |
| 17 | const PM_SOV: *u8 = "_offc/nx_boot_run_sov.elf" |
functions
| 19 | func g_p(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 20 | func g_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 } |
| 21 | func g_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 } |
| 23 | func g_run(prog: *u8, a1: *u8, a2: *u8, outpath: *u8) -> i64 |
| 42 | func g_read(path: *u8, buf: *u8, cap: i64) -> i64 |
| 51 | func g_has(buf: *u8, n: i64, pat: *u8, pl: i64) -> i64 called by 1: main |
| 58 | func g_emit_run(emit: *u8, val: *u8, binp: *u8, txt: *u8, buf: *u8) -> i64 |
| 63 | func g_row(name: *u8, pass: i64) -> i64 { g_p(" " as *u8); g_p(name); if pass==1 { g_p(" PASS\n" as *u8) } else { g_p(" FAIL\n" as *u8) } return 0 } |
| 65 | func main() -> i64 |