code wiki / _hdl_build / nx_connect_func_census.nx

nx_connect_func_census.nx

buildroot/runtime/_hdl_build/nx_connect_func_census.nx

16220 B159 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind tooltopic connect
docsdependenciesstructsconstsfunctions

about

nx_connect_func_census.nx -- CONNECT FUNCTIONALITY & CAPABILITY census, benchmarked head-to-head against the functionality giants: TELEGRAM + FACEBOOK/MESSENGER + WeChat/QQ (Chinese chat). This is the "actual functionality" scorecard (messaging / media / calls / multi-device sync / security / social-super-app), NOT the strategy-pillar census (that lives in nx_connect_census). Grades ABSENT->PRESENT->PARITY->EXCEEDS, EARNED from EVIDENCE. The liar-kill REFUSES any PARITY/EXCEEDS without a measured gate/head-to-head -- so "true S-class exceed" can only be CLAIMED once MEASURED vs a named incumbent, never self-scored. Negative control proves it fires. HONEST 2026-06-20: CONNECT has its matching/safety spine (4 cells PRESENT) but NONE of the core chat functionality yet -> the vast majority is ABSENT. That is the truthful starting picture and exactly why the next rungs build real functionality. {vs ...} names the incumbent yardstick. Mirrors the proven census idiom. 100% sovereign. license_tier: ORIGINAL expect_exit: 0

dependencies 1 imports · 0 importers

nx_syscalls.nx nx_connect_func_census.nx

imports: nx_syscalls.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 sw sys_write row sw ↻ grade_name sw ↻ cap_valid sn sys_mmap ↻ sys_write ↻ cap_valid ↻ sys_exit

structs

none

consts

15const G_ABSENT: i64 = 0
16const G_PRESENT: i64 = 1
17const G_PARITY: i64 = 2
18const G_EXCEEDS: i64 = 3

functions

20func sw(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 3: grade_namerowmain calls 1: sys_write
21func sn(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: main calls 2: sys_mmapsys_write
23func grade_name(g: i64) -> i64
called by 1: row calls 1: sw
30func cap_valid(grade: i64, has_ev: i64) -> i64 { if grade >= G_PARITY { if has_ev == 0 { return 0 } } return 1 }
called by 2: rowmain
32func row(dom: *u8, cap: *u8, grade: i64, base: *u8, evidence: *u8, has_ev: i64, tot: *i64) -> i64
called by 1: main calls 3: swgrade_namecap_valid
41func main() -> i64
calls 6: sys_mmapswrowsncap_validsys_exit