code wiki / _hdl_build / nx_coopsched_emit.nx
nx_coopsched_emit.nx source
↩ module page · 121 lines · 7449 B
1// nx_coopsched_emit.nx -- COOPERATIVE (yield-syscall) SCHEDULER: the K-R1 syscall surface now
2// DRIVES the scheduler. Two tasks each { emit marker; ecall(YIELD) }; the trap handler treats the
3// ecall as yield -- advances mepc PAST the ecall (mepc+4, the exception convention) then ROUND-ROBINS
4// with the csrrw-mepc-swap trick. Deterministic (one switch per yield) -> byte-exact golden "ABAB...".
5// Distinct from the preemptive scheduler (voluntary, syscall-driven, deterministic vs timer-driven);
6// proves syscalls + scheduler integrated. Reuses the proven encoder; NO new forms.
7// AUTHOR=ORGAN, table-computed image + golden. Sovereign, no gcc/.sh. license_tier: ORIGINAL
8import "nx_syscalls.nx"
9const CS_MAGIC_4096: i64 = 4096
10
11const CS_OUT: *u8 = "runtime/_hdl_build/_coopsched_virt.bin"
12const CS_GOLD: *u8 = "runtime/_hdl_build/_coopsched_virt.bin.gold"
13const CS_LOG: *u8 = "knowledge/status/coopsched.log"
14
15const CS_UART: i64 = 0x10000000
16const CS_FIN: i64 = 0x100000
17const CS_PASS: i64 = 0x5555
18const CS_K: i64 = 12 // yields then halt (golden = 12 chars "ABABABABABAB")
19const CS_MTVEC: i64 = 0x305
20const CS_MEPC: i64 = 0x341
21const CS_CH_A: i64 = 65
22const CS_CH_B: i64 = 66
23// section byte offsets (table-computed layout)
24const CS_HANDLER: i64 = 32
25const CS_HALT: i64 = 64
26const CS_TASKA: i64 = 84
27const CS_TASKB: i64 = 100
28const RV_X0: i64 = 0
29const RV_T0: i64 = 5
30const RV_T1: i64 = 6
31const RV_T2: i64 = 7
32const RV_T3: i64 = 28
33const RV_T4: i64 = 29
34const RV_T5: i64 = 30
35const RV_T6: i64 = 31
36
37func cs_lui(rd: i64, imm20: i64) -> i64 { return ((imm20 & 0xFFFFF) << 12) | (rd << 7) | 0x37 }
38func cs_auipc(rd: i64, imm20: i64) -> i64 { return ((imm20 & 0xFFFFF) << 12) | (rd << 7) | 0x17 }
39func cs_addi(rd: i64, rs1: i64, imm: i64) -> i64 { return ((imm & 0xFFF) << 20) | (rs1 << 15) | (rd << 7) | 0x13 }
40func cs_store(rs2: i64, rs1: i64, f3: i64, imm: i64) -> i64 {
41 let hi: i64 = ((imm >> 5) & 0x7f) << 25
42 let lo: i64 = (imm & 0x1f) << 7
43 return hi | (rs2 << 20) | (rs1 << 15) | (f3 << 12) | lo | 0x23
44}
45func cs_branch(rs1: i64, rs2: i64, f3: i64, imm: i64) -> i64 {
46 let b12: i64 = ((imm >> 12) & 0x1) << 31
47 let b11: i64 = ((imm >> 11) & 0x1) << 7
48 let b10_5: i64 = ((imm >> 5) & 0x3f) << 25
49 let b4_1: i64 = ((imm >> 1) & 0xf) << 8
50 return b12 | b10_5 | (rs2 << 20) | (rs1 << 15) | (f3 << 12) | b4_1 | b11 | 0x63
51}
52func cs_jal(rd: i64, imm: i64) -> i64 {
53 let b20: i64 = ((imm >> 20) & 0x1) << 31
54 let b19_12: i64 = ((imm >> 12) & 0xff) << 12
55 let b11: i64 = ((imm >> 11) & 0x1) << 20
56 let b10_1: i64 = ((imm >> 1) & 0x3ff) << 21
57 return b20 | b10_1 | b11 | b19_12 | (rd << 7) | 0x6f
58}
59func cs_csrrw(rd: i64, csr: i64, rs1: i64) -> i64 { return ((csr & 0xFFF) << 20) | (rs1 << 15) | (1 << 12) | (rd << 7) | 0x73 }
60func cs_csrrs(rd: i64, csr: i64, rs1: i64) -> i64 { return ((csr & 0xFFF) << 20) | (rs1 << 15) | (2 << 12) | (rd << 7) | 0x73 }
61func cs_w32(buf: *u8, off: i64, w: i64) -> i64 {
62 buf[off]=(w & 0xff) as u8; buf[off+1]=((w>>8)&0xff) as u8; buf[off+2]=((w>>16)&0xff) as u8; buf[off+3]=((w>>24)&0xff) as u8
63 return off + 4
64}
65func cs_p(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 }
66func cs_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 }
67func cs_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 }
68
69func main() -> i64 {
70 let buf: *u8 = sys_mmap(CS_MAGIC_4096)
71 var o: i64 = 0
72 // BOOT (0..28)
73 o = cs_w32(buf, o, cs_auipc(RV_T3, 0)) // 0 auipc t3,0
74 o = cs_w32(buf, o, cs_addi(RV_T3, RV_T3, CS_HANDLER)) // 4 addi t3,t3,32
75 o = cs_w32(buf, o, cs_csrrw(RV_X0, CS_MTVEC, RV_T3)) // 8 csrrw mtvec,t3
76 o = cs_w32(buf, o, cs_lui(RV_T0, CS_UART >> 12)) // 12 lui t0,UART
77 o = cs_w32(buf, o, cs_auipc(RV_T6, 0)) // 16 auipc t6,0 -> t6=16
78 o = cs_w32(buf, o, cs_addi(RV_T6, RV_T6, CS_TASKB - 16)) // 20 addi t6,t6,(100-16) -> t6=TASK_B
79 o = cs_w32(buf, o, cs_addi(RV_T5, RV_X0, 0)) // 24 addi t5,0 (yield counter)
80 o = cs_w32(buf, o, cs_jal(RV_X0, CS_TASKA - 28)) // 28 jal TASK_A
81 // HANDLER = yield scheduler (32..60)
82 o = cs_w32(buf, o, cs_addi(RV_T5, RV_T5, 1)) // 32 t5++ (yield count)
83 o = cs_w32(buf, o, cs_addi(RV_T1, RV_X0, CS_K)) // 36 addi t1,K
84 o = cs_w32(buf, o, cs_branch(RV_T5, RV_T1, 0, CS_HALT - 40)) // 40 beq t5,t1,HALT
85 o = cs_w32(buf, o, cs_csrrs(RV_T1, CS_MEPC, RV_X0)) // 44 csrrs t1,mepc,x0 (ecall pc)
86 o = cs_w32(buf, o, cs_addi(RV_T1, RV_T1, 4)) // 48 addi t1,t1,4 (skip ecall)
87 o = cs_w32(buf, o, cs_csrrw(RV_T4, CS_MEPC, RV_T6)) // 52 csrrw t4,mepc,t6 (mepc=other task; t4=old discard)
88 o = cs_w32(buf, o, cs_addi(RV_T6, RV_T1, 0)) // 56 addi t6,t1,0 (save this task resume)
89 o = cs_w32(buf, o, 0x30200073) // 60 mret
90 // HALT (64..80)
91 o = cs_w32(buf, o, cs_lui(RV_T1, CS_PASS >> 12)) // 64 lui t1,0x5
92 o = cs_w32(buf, o, cs_addi(RV_T1, RV_T1, CS_PASS & 0xFFF)) // 68 addi t1,t1,0x555
93 o = cs_w32(buf, o, cs_lui(RV_T2, CS_FIN >> 12)) // 72 lui t2,0x100
94 o = cs_w32(buf, o, cs_store(RV_T1, RV_T2, 2, 0)) // 76 sw t1,0(t2) finisher
95 o = cs_w32(buf, o, cs_jal(RV_X0, 0)) // 80 jal x0,0 guard
96 // TASK_A (84..96): emit 'A'; ecall(yield); loop
97 o = cs_w32(buf, o, cs_addi(RV_T1, RV_X0, CS_CH_A)) // 84 addi t1,'A'
98 o = cs_w32(buf, o, cs_store(RV_T1, RV_T0, 0, 0)) // 88 sb t1,0(t0)
99 o = cs_w32(buf, o, 0x00000073) // 92 ecall (yield)
100 o = cs_w32(buf, o, cs_jal(RV_X0, CS_TASKA - 96)) // 96 jal TASK_A
101 // TASK_B (100..112): emit 'B'; ecall(yield); loop
102 o = cs_w32(buf, o, cs_addi(RV_T1, RV_X0, CS_CH_B)) // 100 addi t1,'B'
103 o = cs_w32(buf, o, cs_store(RV_T1, RV_T0, 0, 0)) // 104 sb t1,0(t0)
104 o = cs_w32(buf, o, 0x00000073) // 108 ecall (yield)
105 o = cs_w32(buf, o, cs_jal(RV_X0, CS_TASKB - 112)) // 112 jal TASK_B
106
107 let fd: i64 = sys_openat_wr(CS_OUT, 420)
108 if fd < 0 { cs_p("COOPEMIT verdict=RED reason=out-unwritable\n" as *u8); return 1 }
109 sys_write(fd, buf, o)
110 sys_close(fd)
111 // TABLE-COMPUTED golden: K chars alternating A,B.
112 let gold: *u8 = sys_mmap(64)
113 var gi: i64 = 0
114 while gi < CS_K { if (gi % 2) == 0 { gold[gi] = CS_CH_A as u8 } else { gold[gi] = CS_CH_B as u8 } gi = gi + 1 }
115 let gfd: i64 = sys_openat_wr(CS_GOLD, 420)
116 if gfd >= 0 { sys_write(gfd, gold, CS_K); sys_close(gfd) }
117 cs_p("COOPEMIT name=" as *u8); cs_p(CS_OUT); cs_p(" machine=virt bytes=" as *u8); cs_fn(1, o); cs_p(" yields=12 golden=ABAB... sched=cooperative-yield-ecall\n" as *u8)
118 let lf: i64 = sys_openat_append(CS_LOG, 420)
119 if lf >= 0 { cs_fp(lf, "COOPEMIT name=" as *u8); cs_fp(lf, CS_OUT); cs_fp(lf, " machine=virt bytes=" as *u8); cs_fn(lf, o); cs_fp(lf, " sched=cooperative-yield epoch=" as *u8); cs_fn(lf, sys_now_realtime_sec()); cs_fp(lf, "\n" as *u8); sys_close(lf) }
120 return 0
121}