code wiki / (root) / nx_award_page_probe.nx

nx_award_page_probe.nx

buildroot/runtime/nx_award_page_probe.nx

3257 B44 linesdepth 3pulls 4 transitivereach 0 importersview sourcekind probetopic award
docsdependenciesstructsconstsfunctions

about

nx_award_page_probe.nx -- MEASURED evidence that web_assets/lds_award.html demonstrates the award-winning TECHNIQUES the nx_award_ui_census marked ABSENT. Byte-scans the page for each technique marker (composes nx_uxcx_grade's pure uxg_has_lit). HONEST: this proves the TECHNIQUE is present (byte-detectable), NOT that it is beautiful -- award-quality is human-judged (the operator). Moves census cells ABSENT->PRESENT, never ->EXCEEDS. license_tier: ORIGINAL expect_exit: 0

dependencies 2 imports · 0 importers

nx_syscalls_x86_64.nx nx_uxcx_grade.nx nx_award_page_probe.nx

imports: nx_syscalls_x86_64.nxnx_uxcx_grade.nx

imported by: nobody (leaf or entry point)

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

main pw chk uxg_has_lit uxg_has uxg_len pw ↻ pn

structs

none

consts

none

functions

9func pw(s: *u8) -> i64 { var n: i64=0; while s[n]!=0 { n=n+1 } sys_write(1,s,n); return 0 }
called by 2: chkmain
10func pn(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-(m/10)*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: main
11func chk(h: *u8, n: i64, lit: *u8, cell: *u8, tot: *i64) -> i64
called by 1: main calls 2: uxg_has_litpw
19func main() -> i64
calls 3: pwchkpn