code wiki / _hdl_build / nx_eco_graph_ortho_gate.nx

nx_eco_graph_ortho_gate.nx

buildroot/runtime/_hdl_build/nx_eco_graph_ortho_gate.nx

3291 B52 linesdepth 5pulls 5 transitivereach 0 importersview sourcekind gate/prooftopic eco
docsdependenciesstructsconstsfunctions

about

nx_eco_graph_ortho_gate.nx -- R4-core: proves the ORTHOGONALITY metrics on the graph. A layered DAG has NO import cycle; adding a back-edge (a tangle) is DETECTED (neg-control = the detector is real, not always-0). + coupling-distribution stats (max Ca, hubs, leaves). license_tier: ORIGINAL expect_exit: 0

dependencies 2 imports · 0 importers

nx_syscalls.nx nx_eco_graph.nx nx_eco_graph_ortho_gate.nx

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

main hw sys_write eg_new sys_mmap gi eg_intern eg_hash eg_name_eq slen eg_add_edge eg_finalize sys_mmap ↻ eg_has_cycle sys_mmap ↻ eg_dfs_cycle eg_dfs_cycle ↻ sys_mmap ↻ eg_coupling_stats eg_ca pn sys_mmap ↻ sys_write ↻ sys_exit

structs

none

consts

none

functions

7func hw(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 1: main calls 1: sys_write
8func pn(v: i64) -> i64 { let b: *u8=sys_mmap(24); var m: i64=v; if m<0{sys_write(1,"-" 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(1,b,k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
9func slen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n }
called by 1: gi
10func gi(g: *EcoGraph, s: *u8) -> i64 { return eg_intern(g, s, slen(s)) }
called by 1: main calls 2: eg_internslen
12func main() -> i64
calls 10: hweg_newgieg_add_edgeeg_finalizeeg_has_cycle+4