code wiki / _hdl_build / nx_clock_tickless_gate.nx
nx_clock_tickless_gate.nx
buildroot/runtime/_hdl_build/nx_clock_tickless_gate.nx
about
nx_clock_tickless_gate.nx -- proves the TICKLESS driver (sched_tickless.raw lesson) entirely IN the nishi
ecosystem (a harness-run gate, no shell hand-driving). Two sparse jobs (intervals 3 and 5, no interval-1) are
registered via clk_register; the tickless loop wakes ONLY at the minimum next_due, skipping every idle tick. It
reaches tick 12 in just 6 wakes (skipping 6 idle ticks), and each wake fork+execs the real blessed marker organ
(_offc/nx_clock_marker.elf) which increments a counter -> proven REAL execution, not a constant tick.
license_tier: ORIGINAL expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_clock_sched.nxnx_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 TLG_MAXBEATS: i64 = 6 |
| 11 | const TLG_TICK_MS: i64 = 20 |
functions
| 13 | func w(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 wn(v: i64) -> i64 { var m: i64=v; if m<0{w("-" as *u8);m=0-m} let t:*u8=sys_mmap(24); var k:i64=0; if m==0{t[0]=48 as u8;k=1} while m>0{t[k]=(48+(m%10)) as u8;m=m/10;k=k+1} var i:i64=0; let o:*u8=sys_mmap(24); while i<k{o[i]=t[k-1-i];i=i+1} sys_write(1,o,k); return 0 } |
| 15 | func dun(p: *u8) -> i64 { __syscall(87, p as i64, 0, 0, 0, 0, 0); return 0 } called by 1: main |
| 16 | func readnum(p: *u8) -> i64 { let lp: *i64 = sys_mmap(8) as *i64; let d: *u8 = sys_read_file(p, lp); if (d as i64)==0 { return 0 } var c: i64=0; var i: i64=0; while i<lp[0] { if d[i]>=(48 as u8) { if d[i]<=(57 as u8) { c=c*10+(d[i]-(48 as u8)) as i64 } } i=i+1 } return c } |
| 18 | func main(argc: i64, argv: *i64) -> i64 |