code wiki / _hdl_build / nx_adnet_crm_gate.nx
nx_adnet_crm_gate.nx
buildroot/runtime/_hdl_build/nx_adnet_crm_gate.nx
about
nx_adnet_crm_gate.nx -- GATE for the advertiser record (nx_adnet_crm, Data Vault 2.0 shape).
The teeth that matter are the ones protecting a PAYING CLIENT'S RECORD, not the row formatting:
* THE HASH KEY IS DERIVED AND STABLE -- same business key always yields the same hub key, or a
re-registration silently forks one client into two and their spend splits across both.
* ADDITIVE-ONLY IS STRUCTURAL -- closing a relationship must ADD a row, never shorten the journal.
Asserted by BYTE COUNT, because "we don't delete" is a promise and a byte count is a measurement.
* SPLIT-BRAIN IS DETECTED, NOT RECONCILED -- two is_current=1 rows for one (hk, aspect) must be
COUNTABLE so a gate can fail. A plane that quietly picks a winner bills the wrong terms.
expect_exit: 0 license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_adnet_crm.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
| 13 | func tm_slen(s: *u8) -> i64 { var i: i64 = 0; while s[i] != (0 as u8) { i = i + 1 } return i } |
| 14 | func tm_puts(s: *u8) -> i64 { sys_write(1, s, tm_slen(s)); return 0 } |
| 15 | func tm_pn(v: i64) -> i64 |
| 27 | func tm_has(buf: *u8, n: i64, pat: *u8) -> i64 |
| 41 | func tm_check(name: *u8, cond: i64) -> i64 |
| 47 | func main() -> i64 |