code wiki / _hdl_build / nx_story_quest_gate.nx
nx_story_quest_gate.nx
buildroot/runtime/_hdl_build/nx_story_quest_gate.nx
about
nx_story_quest_gate.nx -- S-R2: proves DIALOGUE TREES + a multi-step QUEST run on the same sovereign
story VM (nx_story_vm) using multi-flag masks. Quest: collect ITEM_A(bit0) + ITEM_B(bit1) from two
NPCs, then TURN IN at the hub (requires mask 3 = both). Dialogue tree = the NPC nodes have branching
accept/decline choices with different effects. GREEN only if: full quest completes, early/partial
turn-in is BLOCKED (neg-controls), and a dialogue branch changes state. license_tier: ORIGINAL expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_story_vm.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 qw(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 qn(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 } |
| 12 | func main() -> i64 |