code wiki / _hdl_build / nx_eco_graph_pedigree.nx
nx_eco_graph_pedigree.nx source
↩ module page · 276 lines · 17186 B
1// nx_eco_graph_pedigree.nx -- the FAMILY-TREE OVERVIEW of the whole ecosystem: generational from god,
2// SIMPLE (operator 2026-07-16: "a billion lines crossing over each other isn't useful -- it's the
3// generational from god, then deeper dives via cards"). One band per generation: how many organs live
4// there + the top hubs as linked chips into their CARDS. Zero edges drawn, zero JS -- counts + names +
5// links carry the story; the chaos lives in NO frame. Prints the chosen hub names to stdout so the
6// publisher can generate exactly those cards. Usage: nx_eco_graph_pedigree <store> <out.html> [topN]
7// license_tier: ORIGINAL expect_exit:0
8import "nx_syscalls.nx"
9import "nx_eco_graph.nx"
10
11func pslen2(s: *u8) -> i64 { var n:i64=0; while s[n]!=(0 as u8){n=n+1} return n }
12func pw2(fd: i64, s: *u8) -> i64 { sys_write(fd, s, pslen2(s)); return 0 }
13func 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 }
14func pname(fd: i64, g: *EcoGraph, idx: i64) -> i64 {
15 let off: i64 = g.node_off[idx]
16 var n: i64 = 0
17 while g.arena[off+n] != (0 as u8) { n = n + 1 }
18 sys_write(fd, ((g.arena as i64)+off) as *u8, n)
19 return 0
20}
21func pshort(fd: i64, g: *EcoGraph, idx: i64) -> i64 {
22 let off: i64 = g.node_off[idx]
23 var n: i64 = 0
24 while g.arena[off+n] != (0 as u8) { n = n + 1 }
25 var e: i64 = n
26 if n > 3 { if g.arena[off+n-3]==(46 as u8) { if g.arena[off+n-2]==(110 as u8) { if g.arena[off+n-1]==(120 as u8) { e = n - 3 } } } }
27 sys_write(fd, ((g.arena as i64)+off) as *u8, e)
28 return 0
29}
30
31func p_eq(a: *u8, b: *u8) -> i64 {
32 var i: i64 = 0
33 while 1 == 1 {
34 if a[i] != b[i] { return 0 }
35 if a[i] == (0 as u8) { return 1 }
36 i = i + 1
37 }
38 return 0
39}
40
41func main(argc: i64, argv: *i64) -> i64 {
42 if argc < 2 { pw2(1, "usage: nx_eco_graph_pedigree <store> <out.html> [topN] [instfile] | --live (MCP: pinned paths)\n" as *u8); return 2 }
43 var storep: *u8 = 0 as *u8
44 var outp: *u8 = 0 as *u8
45 var instp: *u8 = 0 as *u8
46 var topn: i64 = 12
47 if p_eq(argv[1] as *u8, "--live\x00" as *u8) == 1 {
48 // SOVEREIGN ONE-CALL MODE (MCP, CWD=nishihost): regenerate the live family-tree page in place
49 storep = "knowledge/store/ecograph_full\x00" as *u8
50 outp = "sites/nishifamily/compare/atlas/tree/index.html\x00" as *u8
51 instp = "knowledge/status/installed_twins.txt\x00" as *u8
52 } else {
53 if argc < 3 { pw2(1, "usage: nx_eco_graph_pedigree <store> <out.html> [topN] [instfile] | --live\n" as *u8); return 2 }
54 storep = argv[1] as *u8
55 outp = argv[2] as *u8
56 if argc >= 4 {
57 let ts: *u8 = argv[3] as *u8
58 var tv: i64 = 0
59 var ti: i64 = 0
60 while ts[ti] != (0 as u8) { tv = tv*10 + ((ts[ti] as i64) - 48); ti = ti + 1 }
61 if tv >= 3 { if tv <= 40 { topn = tv } }
62 }
63 if argc >= 5 { instp = argv[4] as *u8 }
64 }
65 let g: *EcoGraph = eg_load(storep)
66 if (g as i64) == 0 { pw2(1, "ERROR store not found\n" as *u8); return 3 }
67 let n: i64 = g.node_count
68
69 // BFS generations from true roots (cycle-safe shortest hops)
70 let gen: *i64 = sys_mmap((n+2)*8) as *i64
71 let work: *i64 = sys_mmap((n+2)*8) as *i64
72 var i: i64 = 0
73 while i < n { gen[i] = 0 - 1; i = i + 1 }
74 var wt: i64 = 0
75 i = 0
76 while i < n {
77 if g.out_head[i] == g.out_head[i+1] { gen[i] = 0; work[wt] = i; wt = wt + 1 }
78 i = i + 1
79 }
80 var wh: i64 = 0
81 while wh < wt {
82 let v: i64 = work[wh]
83 var p: i64 = g.in_head[v]; let e: i64 = g.in_head[v+1]
84 while p < e {
85 let u: i64 = g.in_list[p]
86 if gen[u] < 0 { gen[u] = gen[v] + 1; work[wt] = u; wt = wt + 1 }
87 p = p + 1
88 }
89 wh = wh + 1
90 }
91 var maxgen: i64 = 0
92 i = 0
93 while i < n { if gen[i] < 0 { gen[i] = 0 } if gen[i] > maxgen { maxgen = gen[i] } i = i + 1 }
94
95 // per-gen counts
96 let gcount: *i64 = sys_mmap((maxgen+3)*8) as *i64
97 var l: i64 = 0
98 while l <= maxgen { gcount[l] = 0; l = l + 1 }
99 i = 0; while i < n { gcount[gen[i]] = gcount[gen[i]] + 1; i = i + 1 }
100 var edges: i64 = g.out_head[n]
101
102 // ---- INTELLIGENCE: real tree vs paperwork vs one-offs ----
103 // validation artifact = name ends _test/_gate/_bench/_demo/_probe/_smoke .nx
104 let iste: *u8 = sys_mmap(n + 2)
105 i = 0
106 while i < n {
107 let off: i64 = g.node_off[i]
108 var ln: i64 = 0
109 while g.arena[off+ln] != (0 as u8) { ln = ln + 1 }
110 var t: i64 = 0
111 if ln > 8 {
112 // check the 6 suffixes byte-wise against arena tail (before ".nx")
113 let tail: i64 = off + ln - 8
114 if g.arena[tail]==(95 as u8) { if g.arena[tail+1]==(116 as u8) { if g.arena[tail+2]==(101 as u8) { if g.arena[tail+3]==(115 as u8) { if g.arena[tail+4]==(116 as u8) { t = 1 } } } } } // _test.nx
115 if g.arena[tail]==(95 as u8) { if g.arena[tail+1]==(103 as u8) { if g.arena[tail+2]==(97 as u8) { if g.arena[tail+3]==(116 as u8) { if g.arena[tail+4]==(101 as u8) { t = 1 } } } } } // _gate.nx
116 if g.arena[tail]==(95 as u8) { if g.arena[tail+1]==(100 as u8) { if g.arena[tail+2]==(101 as u8) { if g.arena[tail+3]==(109 as u8) { if g.arena[tail+4]==(111 as u8) { t = 1 } } } } } // _demo.nx (5)
117 }
118 if ln > 9 {
119 let t9: i64 = off + ln - 9
120 if g.arena[t9]==(95 as u8) { if g.arena[t9+1]==(98 as u8) { if g.arena[t9+2]==(101 as u8) { if g.arena[t9+3]==(110 as u8) { if g.arena[t9+4]==(99 as u8) { if g.arena[t9+5]==(104 as u8) { t = 1 } } } } } } // _bench.nx
121 if g.arena[t9]==(95 as u8) { if g.arena[t9+1]==(112 as u8) { if g.arena[t9+2]==(114 as u8) { if g.arena[t9+3]==(111 as u8) { if g.arena[t9+4]==(98 as u8) { if g.arena[t9+5]==(101 as u8) { t = 1 } } } } } } // _probe.nx
122 if g.arena[t9]==(95 as u8) { if g.arena[t9+1]==(115 as u8) { if g.arena[t9+2]==(109 as u8) { if g.arena[t9+3]==(111 as u8) { if g.arena[t9+4]==(107 as u8) { if g.arena[t9+5]==(101 as u8) { t = 1 } } } } } } // _smoke.nx
123 }
124 iste[i] = t as u8
125 i = i + 1
126 }
127 // real-children count per node (children that are NOT validation)
128 let rc: *i64 = sys_mmap((n+2)*8) as *i64
129 i = 0; while i < n { rc[i] = 0; i = i + 1 }
130 i = 0
131 while i < n {
132 if iste[i] == (0 as u8) {
133 var p2: i64 = g.out_head[i]
134 while p2 < g.out_head[i+1] { rc[g.out_list[p2]] = rc[g.out_list[p2]] + 1; p2 = p2 + 1 }
135 }
136 i = i + 1
137 }
138 // installed set from argv[4] (names with an installed elf twin)
139 let inst: *u8 = sys_mmap(n + 2)
140 i = 0; while i < n { inst[i] = 0 as u8; i = i + 1 }
141 if (instp as i64) != 0 {
142 let ilen: *i64 = sys_mmap(16) as *i64
143 let ibuf: *u8 = sys_read_file(instp, ilen)
144 if ilen[0] > 0 {
145 var s0: i64 = 0
146 var q0: i64 = 0
147 while q0 <= ilen[0] {
148 var iend: i64 = 0
149 if q0 == ilen[0] { iend = 1 } else { if ibuf[q0] == (10 as u8) { iend = 1 } }
150 if iend == 1 {
151 var e0: i64 = q0
152 if e0 > s0 { if ibuf[e0-1] == (13 as u8) { e0 = e0 - 1 } }
153 if e0 > s0 {
154 let ix0: i64 = eg_find(g, ((ibuf as i64)+s0) as *u8, e0 - s0)
155 if ix0 >= 0 { inst[ix0] = 1 as u8 }
156 }
157 s0 = q0 + 1
158 }
159 q0 = q0 + 1
160 }
161 }
162 }
163 // global class tallies: 0 trunk / 1 shipped-leaf / 2 validation / 3 tested-only / 4 orphan
164 var ctrunk: i64 = 0
165 var cship: i64 = 0
166 var cval: i64 = 0
167 var ctest: i64 = 0
168 var corph: i64 = 0
169 let stat: *u8 = sys_mmap(n + 2)
170 i = 0
171 while i < n {
172 var st: i64 = 4
173 if iste[i] == (1 as u8) { st = 2 } else {
174 if rc[i] > 0 { st = 0 } else {
175 if inst[i] == (1 as u8) { st = 1 } else {
176 // any test children?
177 var tc: i64 = 0
178 var p3: i64 = g.in_head[i]
179 while p3 < g.in_head[i+1] { if iste[g.in_list[p3]] == (1 as u8) { tc = tc + 1 } p3 = p3 + 1 }
180 if tc > 0 { st = 3 }
181 }
182 }
183 }
184 stat[i] = st as u8
185 if st == 0 { ctrunk = ctrunk + 1 }
186 if st == 1 { cship = cship + 1 }
187 if st == 2 { cval = cval + 1 }
188 if st == 3 { ctest = ctest + 1 }
189 if st == 4 { corph = corph + 1 }
190 i = i + 1
191 }
192
193 let fd: i64 = sys_openat_wr(outp, 0x1a4)
194 if fd < 0 { pw2(1, "ERROR cannot open out\n" as *u8); return 5 }
195
196 pw2(fd, "<!doctype html><html lang=en><head><meta charset=utf-8><meta name=viewport content=\"width=device-width,initial-scale=1\"><title>The Family Tree — Nishi Ecosystem</title><style>body{margin:0;background:#0b0e16;color:#e8ecf6;font:15px/1.6 -apple-system,Segoe UI,system-ui,sans-serif}.wrap{max-width:980px;margin:0 auto;padding:24px 18px 70px}.crumb{font-size:.8rem;color:#8a97ad;margin-bottom:10px}a{color:#c9a0ff;text-decoration:none}a:hover{text-decoration:underline}h1{font-size:28px;margin:0 0 4px}.sub{color:#8a97ad;margin:0 0 18px}.genband{background:#11172a;border:1px solid #222c44;border-radius:14px;padding:14px 18px;margin:10px 0}.genband.alt{background:#0d1220}.ghead{display:flex;align-items:baseline;gap:14px;margin-bottom:6px}.gname{font-size:17px;font-weight:700;color:#ffd479}.gcount{color:#8a97ad;font-size:.85rem}.chip{display:inline-block;background:#141a26;border:1px solid #26304a;border-radius:9px;padding:4px 10px;margin:3px 5px 3px 0;color:#cdd6e6;font-size:.86rem}.chip:hover{border-color:#c9a0ff}.gnote{color:#5c6b85;font-size:.8rem;margin-top:4px}.down{ text-align:center;color:#3c4a66;font-size:18px;margin:2px 0}</style></head><body><div class=wrap>" as *u8)
197 pw2(fd, "<p class=crumb><a href=/>Nishi Family</a> › <a href=/compare/atlas>Atlas</a> › Family Tree</p>" as *u8)
198 pw2(fd, "<h1>The Family Tree — generational from god</h1>" as *u8)
199 pw2(fd, "<p style=\"margin:6px 0 14px\"><a href=\"/compare/atlas/explore/\" style=\"display:inline-block;background:#1a2136;border:1.5px solid #c9a0ff;border-radius:11px;padding:10px 18px;font-weight:700\">✥ OPEN THE TREE EXPLORER — interactive: click any organ, walk parents/children, pan & zoom</a></p>" as *u8)
200 pw2(fd, "<p class=sub>" as *u8); pn2(fd, n); pw2(fd, " organs · " as *u8); pn2(fd, edges); pw2(fd, " import edges · " as *u8); pn2(fd, maxgen+1); pw2(fd, " generations. Gen 0 = the god primitives; each generation builds on the ones above. Every name is a <b>card</b>: parents, children, partners, siblings, lineage.</p>" as *u8)
201 // the honest split: living tree vs paperwork vs one-offs
202 pw2(fd, "<div style=\"display:flex;gap:10px;flex-wrap:wrap;margin:0 0 18px\">" as *u8)
203 pw2(fd, "<div style=\"background:#1b2a14;border:1px solid #4a6a2e;border-radius:12px;padding:10px 16px\"><b style=\"font-size:20px;color:#a5e07a\">" as *u8); pn2(fd, ctrunk); pw2(fd, "</b><br><span style=\"color:#8a97ad;font-size:.78rem\">TRUNK — the living tree (real children)</span></div>" as *u8)
204 pw2(fd, "<div style=\"background:#14222e;border:1px solid #2e5a7a;border-radius:12px;padding:10px 16px\"><b style=\"font-size:20px;color:#7fd1ff\">" as *u8); pn2(fd, cship); pw2(fd, "</b><br><span style=\"color:#8a97ad;font-size:.78rem\">SHIPPED LEAVES — installed products</span></div>" as *u8)
205 pw2(fd, "<div style=\"background:#181d2c;border:1px solid #3a4a6a;border-radius:12px;padding:10px 16px\"><b style=\"font-size:20px;color:#8a97ad\">" as *u8); pn2(fd, cval); pw2(fd, "</b><br><span style=\"color:#8a97ad;font-size:.78rem\">VALIDATION — tests/gates (paperwork)</span></div>" as *u8)
206 pw2(fd, "<div style=\"background:#2a2416;border:1px solid #6a5a2e;border-radius:12px;padding:10px 16px\"><b style=\"font-size:20px;color:#e6c86a\">" as *u8); pn2(fd, ctest); pw2(fd, "</b><br><span style=\"color:#8a97ad;font-size:.78rem\">TESTED-ONLY — validated, unadopted</span></div>" as *u8)
207 pw2(fd, "<div style=\"background:#2a161c;border:1px solid #6a2e3a;border-radius:12px;padding:10px 16px\"><b style=\"font-size:20px;color:#e08a9a\">" as *u8); pn2(fd, corph); pw2(fd, "</b><br><span style=\"color:#8a97ad;font-size:.78rem\">ORPHANS — one-offs, nothing built on them</span></div>" as *u8)
208 pw2(fd, "</div>" as *u8)
209 pw2(fd, "<p class=sub>The bands below show the <b style=\"color:#a5e07a\">LIVING TREE ONLY</b> (trunk + shipped leaves) — validation paperwork and one-off orphans are counted, quarantined at the bottom, and never mixed into the family.</p>" as *u8)
210
211 // bands: gen 0 (god) first, downward
212 l = 0
213 while l <= maxgen {
214 pw2(fd, "<div class=\"genband" as *u8)
215 if l % 2 == 1 { pw2(fd, " alt" as *u8) }
216 // living-tree members of this gen (trunk or shipped)
217 var glive: i64 = 0
218 i = 0
219 while i < n { if gen[i] == l { if (stat[i] as i64) <= 1 { glive = glive + 1 } } i = i + 1 }
220 pw2(fd, "\"><div class=ghead><span class=gname>gen " as *u8); pn2(fd, l); pw2(fd, "</span><span class=gcount>" as *u8); pn2(fd, glive); pw2(fd, " living-tree organs (of " as *u8); pn2(fd, gcount[l]); pw2(fd, " total here)" as *u8)
221 if l == 0 { pw2(fd, " — the roots: import nothing, everything descends from them" as *u8) }
222 pw2(fd, "</span></div><div>" as *u8)
223 // top-N LIVING-TREE members of this gen by Ca (selection sort into small arrays)
224 let bi: *i64 = sys_mmap((topn+2)*8) as *i64
225 let bc: *i64 = sys_mmap((topn+2)*8) as *i64
226 var bn: i64 = 0
227 i = 0
228 while i < n {
229 if gen[i] == l { if (stat[i] as i64) <= 1 {
230 let ca: i64 = eg_ca(g, i)
231 if bn < topn {
232 bi[bn] = i; bc[bn] = ca; bn = bn + 1
233 } else {
234 // find min slot
235 var mn: i64 = 0
236 var k: i64 = 1
237 while k < bn { if bc[k] < bc[mn] { mn = k } k = k + 1 }
238 if ca > bc[mn] { bi[mn] = i; bc[mn] = ca }
239 }
240 } }
241 i = i + 1
242 }
243 // emit sorted desc (simple selection)
244 var emitted: i64 = 0
245 while emitted < bn {
246 var best: i64 = 0
247 var k2: i64 = 1
248 while k2 < bn { if bc[k2] > bc[best] { best = k2 } k2 = k2 + 1 }
249 if bc[best] >= 0 {
250 let idx: i64 = bi[best]
251 pw2(fd, "<a class=chip href=\"/compare/atlas/card/" as *u8); pname(fd, g, idx); pw2(fd, ".html\">" as *u8); pshort(fd, g, idx)
252 pw2(fd, " · " as *u8); pn2(fd, bc[best]); pw2(fd, "</a>" as *u8)
253 // stdout: the chosen name for the card publisher
254 pname(1, g, idx); sys_write(1, "\n" as *u8, 1)
255 bc[best] = 0 - 1
256 }
257 emitted = emitted + 1
258 }
259 if glive > topn { pw2(fd, "<span class=gnote>top " as *u8); pn2(fd, topn); pw2(fd, " living-tree by descendants-reach — <a href=\"/compare/atlas/card/index.html\">all " as *u8); pn2(fd, glive); pw2(fd, " are in the directory</a> (every organ has a card)</span>" as *u8) }
260 pw2(fd, "</div></div>" as *u8)
261 if l < maxgen { pw2(fd, "<div class=down>↓</div>" as *u8) }
262 l = l + 1
263 }
264 // ---- quarantine: the NOT-tree, honestly counted, never mixed in ----
265 pw2(fd, "<div class=genband style=\"border-color:#6a2e3a;margin-top:22px\"><div class=ghead><span class=gname style=\"color:#e08a9a\">Not part of the living tree</span><span class=gcount>" as *u8)
266 pn2(fd, cval); pw2(fd, " validation artifacts (tests/gates — paperwork attached to their subjects) · " as *u8)
267 pn2(fd, ctest); pw2(fd, " tested-only (validated but unadopted) · " as *u8)
268 pn2(fd, corph); pw2(fd, " one-off orphans (nothing builds on them, not installed, untested)</span></div>" as *u8)
269 pw2(fd, "<div class=gnote>Every one still has a card (status badge on it) via the <a href=\"/compare/atlas/card/index.html\">directory</a> — separated here so the FAMILY view stays the family, and the janitor workstream gets an honest worklist of " as *u8)
270 pn2(fd, corph); pw2(fd, " orphans + " as *u8); pn2(fd, ctest); pw2(fd, " unadopted candidates.</div></div>" as *u8)
271 pw2(fd, "<p class=sub style=\"margin-top:24px\"><b><a href=/compare/atlas/card/index.html>☶ THE FULL DIRECTORY — every organ has a card</a></b> · any card renders its lineage via one MCP call (<code>nx_eco_graph_png [seed]</code>) · <a href=/compare/atlas/graph>☰ walkable graph</a> · <a href=/compare/atlas>← Atlas home</a></p>" as *u8)
272 pw2(fd, "</div></body></html>" as *u8)
273 sys_close(fd)
274 pw2(2, "wrote pedigree\n" as *u8)
275 return 0
276}