code wiki / _hdl_build / _coopsched_gate.nx
_coopsched_gate.nx
buildroot/runtime/_hdl_build/_coopsched_gate.nx
about
_coopsched_gate.nx -- gate for the COOPERATIVE (yield-syscall) scheduler.
NO mocks: runs the REAL nx_coopsched_emit, RUNS the image on the SOVEREIGN rv64 emu, asserts the
serial CONTAINS the table-computed byte-exact golden "ABABABABABAB" (each task emitted then yielded
via ecall -> deterministic alternation) + clean finisher halt. TAMPER: corrupt task B's emit char
-> the alternation breaks ("ARAR.." not "ABAB..") -> golden absent -> RED (proves the yield really
switched to task B). Evidence -> knowledge/status/coopsched.log. 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
| 9 | 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 } |
| 10 | 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 } |
| 11 | 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 } |
| 13 | func g_run1(prog: *u8, arg1: *u8, outpath: *u8) -> i64 |
| 31 | func g_read(path: *u8, buf: *u8, cap: i64) -> i64 |
| 41 | func g_buf_has(buf: *u8, n: i64, pat: *u8, pl: i64) -> i64 called by 1: main |
| 54 | func main() -> i64 |