code wiki / (root) / nx_supp_jurisdiction_test.nx

nx_supp_jurisdiction_test.nx

buildroot/runtime/nx_supp_jurisdiction_test.nx

7794 B137 linesdepth 4pulls 4 transitivereach 0 importersview sourcekind gate/prooftopic supp
docsdependenciesstructsconstsfunctions

about

nx_supp_jurisdiction_test.nx -- gate for the market-access rung. T3 is the one that answers the strategic question with arithmetic instead of opinion: for a botanical, the US is the LOWEST-burden market of the six. T5 is the one that closes the offshore idea for peptides: NO modelled market offers them a supplement route, computed across all six. expect_exit: 0 license_tier: ORIGINAL

dependencies 3 imports · 0 importers

nx_syscalls.nx nx_supp_ingredient.nx nx_supp_jurisdiction.nx nx_supp_jurisdiction_test.nx

imports: nx_syscalls.nxnx_supp_ingredient.nxnx_supp_jurisdiction.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main sj_markets_open sj_is_sellable sj_pathway sj_valid si_class t_puts sys_write t_putn sys_mmap nxa_die sys_write ↻ sys_exit nxa_lock_take nxa_lock_addr sys_write ↻ nxa_lock_give nxa_lock_addr ↻ nxa_report_overrun sys_write ↻ nxa_dump_printable sys_write ↻ nxa_dump_sizes sys_write ↻ sys_write ↻ sj_pathway ↻ sj_premarket_required sj_pathway ↻ sj_lowest_burden_market sj_is_sellable ↻ sj_review_days sj_review_days ↻ sj_name sj_dossier_cost_cents sj_any_peptide_supplement_ sj_is_sellable ↻ sj_parallel_launch_days sj_review_days ↻ sj_combined_dossier_cost_c sj_dossier_cost_cents ↻

structs

none

consts

none

functions

11func t_puts(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
12func t_putn(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
14func main() -> i64