code wiki / _hdl_build / nx_char_ai_gate.nx

nx_char_ai_gate.nx

buildroot/runtime/_hdl_build/nx_char_ai_gate.nx

4775 B82 linesdepth 3pulls 4 transitivereach 0 importersview sourcekind gate/prooftopic char
docsdependenciesstructsconstsfunctions

about

nx_char_ai_gate.nx -- proves G-R2 char-AI (behavior tree + FSM). NPC BT (priority selector): SEL[ SEQ[COND health_low, ACT flee], SEQ[COND enemy_visible, ACT attack], ACT patrol ] blackboard bits: 0=health_low, 1=enemy_visible. actions: flee=1, attack=2, patrol=3. FSM: IDLE--see-->ATTACK--health_low-->FLEE--healed-->IDLE (no other transitions). GREEN only if every decision + transition is correct, incl. priority and neg-controls. license_tier: ORIGINAL expect_exit: 0 2026-08-28 D001 MIGRATION: the hand-rolled pass/total counter and the sys_exit tail are replaced by gv_ctr/gv_check/gv_verdict, so /api/promote will accept it and /api/gate_run can READ the verdict from the exit code instead of a printed string nothing parses. Every tooth now PRINTS THE VALUE IT JUDGED -- the incumbent printed a value only on failure, so a passing run said nothing about what it saw.

dependencies 3 imports · 0 importers

nx_syscalls.nx nx_char_ai.nx nx_gate_verdict.nx nx_char_ai_gate.nx

imports: nx_syscalls.nxnx_char_ai.nxnx_gate_verdict.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main sys_mmap nxa_die sys_write sys_exit nxa_lock_take nxa_lock_addr sys_write ↻ nxa_lock_give nxa_lock_addr ↻ nxa_report_overrun sys_write ↻ nxa_dump_printable sys_write ↻ nxa_dump_sizes sys_write ↻ gv_ctr sys_mmap ↻ bt_action sys_mmap ↻ bt_tick bt_tick ↻ gv_check gv_puts sys_write ↻ cai_is cw sys_write ↻ cn sys_mmap ↻ sys_write ↻ fsm_step gv_verdict gv_note_bare_rate gv_bare_rate gv_at gv_obj_has_n gv_at ↻ gv_puts ↻ gv_num

structs

none

consts

none

functions

14func cw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 }
called by 1: cai_is calls 1: sys_write
15func cn(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m;sys_write(1,"-" as *u8,1)} let t: *u8=sys_mmap(28); 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; while i<k{bb[i]=t[k-1-i];i=i+1} sys_write(1,bb,k); return 0 }
called by 1: cai_is calls 2: sys_mmapsys_write
17func bt_action(ty: *i64, a0: *i64, nk: *i64, kids: *i64, bb: i64) -> i64
called by 1: main calls 2: sys_mmapbt_tick
26func cai_is(label: *u8, got: i64, want: i64) -> i64
called by 1: main calls 2: cwcn
32func main() -> i64