code wiki / _hdl_build / _ad_gate.nx
_ad_gate.nx
buildroot/runtime/_hdl_build/_ad_gate.nx
about
_ad_gate.nx -- LOCK for Sv39 ACCESSED/DIRTY bit tracking (X-PAGE-AD-001). NO mocks.
Proves the hardware sets the leaf PTE's A bit on any access + D bit on a store (the demand-paging
foundation). Drives nx_ad_emit (the M-mode kernel reads the leaf PTE physically + checks A/D):
T1 access : S-mode load (sets A) + store (sets D) -> kernel sees A=1 && D=1 -> "ADOK"
T2 control : NO access -> A/D stay 0 -> "ADN" (proves the bits are SET BY THE ACCESS, not pre-set)
T1 vs T2 differ ONLY in whether the page is touched. GREEN only if T1 && T2.
Evidence -> knowledge/status/paging.log (ADGATE). 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
| 10 | const AD_EMIT: *u8 = "_offc/nx_ad_emit.elf" |
| 11 | const AD_SOV: *u8 = "_offc/nx_boot_run_sov.elf" |
functions
| 13 | 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 } |
| 14 | 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 } |
| 15 | 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 } |
| 17 | func g_run(prog: *u8, a1: *u8, a2: *u8, outpath: *u8) -> i64 |
| 36 | func g_read(path: *u8, buf: *u8, cap: i64) -> i64 |
| 45 | func g_has(buf: *u8, n: i64, pat: *u8, pl: i64) -> i64 called by 1: main |
| 51 | func g_case(acc: *u8, binp: *u8, txt: *u8, buf: *u8) -> i64 |
| 56 | 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 } |
| 58 | func main() -> i64 |