code wiki / _hdl_build / nx_clock_gate.nx
nx_clock_gate.nx
buildroot/runtime/_hdl_build/nx_clock_gate.nx
about
nx_clock_gate.nx -- proves the ONE Nishi clock (operator: "s class exceed like how pulses work on clocks ...
dont have a million pulses and daemons"). THE key property = the DIVIDER: a single tick source drives N jobs,
each at its own interval -- so j(1) fires every tick, j(2) every other, j(3) every third, all from ONE dispatcher
loop, never N pulse loops. Plus: re-register is idempotent (no duplicate pulse), a skipped tick can't cause a
runaway (catch-up safe), and the registry (name, interval, next_due, organ) is durable. 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
| none |
functions
| 9 | 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 } |
| 10 | 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 } |
| 11 | func dun(p: *u8) -> i64 { __syscall(87, p as i64, 0, 0, 0, 0, 0); return 0 } called by 1: main |
| 13 | func main(argc: i64, argv: *i64) -> i64 |