code wiki / _hdl_build / nx_eco_graph_pedigree.nx
nx_eco_graph_pedigree.nx
buildroot/runtime/_hdl_build/nx_eco_graph_pedigree.nx
about
nx_eco_graph_pedigree.nx -- the FAMILY-TREE OVERVIEW of the whole ecosystem: generational from god,
SIMPLE (operator 2026-07-16: "a billion lines crossing over each other isn't useful -- it's the
generational from god, then deeper dives via cards"). One band per generation: how many organs live
there + the top hubs as linked chips into their CARDS. Zero edges drawn, zero JS -- counts + names +
links carry the story; the chaos lives in NO frame. Prints the chosen hub names to stdout so the
publisher can generate exactly those cards. Usage: nx_eco_graph_pedigree <store> <out.html> [topN]
license_tier: ORIGINAL expect_exit:0
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_eco_graph.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
| 11 | func pslen2(s: *u8) -> i64 { var n:i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: pw2 |
| 12 | func pw2(fd: i64, s: *u8) -> i64 { sys_write(fd, s, pslen2(s)); return 0 } |
| 13 | func pn2(fd: i64, v: i64) -> i64 { let b:*u8=sys_mmap(24); var m:i64=v; if m<0{sys_write(fd,"-" as *u8,1);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 j:i64=0; while j<k{b[j]=t[k-1-j];j=j+1} sys_write(fd,b,k); return 0 } |
| 14 | func pname(fd: i64, g: *EcoGraph, idx: i64) -> i64 |
| 21 | func pshort(fd: i64, g: *EcoGraph, idx: i64) -> i64 |
| 31 | func p_eq(a: *u8, b: *u8) -> i64 called by 1: main |
| 41 | func main(argc: i64, argv: *i64) -> i64 |