code wiki / _hdl_build / nx_serp_census.nx

nx_serp_census.nx

buildroot/runtime/_hdl_build/nx_serp_census.nx

7482 B116 linesdepth 5pulls 9 transitivereach 0 importersview sourcekind tool
docsdependenciesstructsconstsfunctions

about

nx_serp_census.nx -- MEASURED census of the NISHI SERP vs the banked rival result-page bar (operator 2026-07-03: "a page thats s class exceed ... beat bing and google and all the others for search result displays"). Grounding = nx_serp_research's 8 sources (SERP canon: featured snippets / knowledge panels + Google/Bing/DuckDuckGo/Kagi). Every HAVE/AHEAD row is proven by RENDERING the live serve handler in-process against the gate fixtures (never asserted); GAPs are conceded with the rival that holds the bar. Negative control must fire. license_tier: ORIGINAL

dependencies 2 imports · 0 importers

nx_docportal_search_serve.nx nx_itoa_lib.nx nx_serp_census.nx

imports: nx_docportal_search_serve.nxnx_itoa_lib.nx

imported by: nobody (leaf or entry point)

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

main c_puts c_exists c_row c_puts ↻ c_render dss_serve dsv_now_us sys_clock_gettime_mono sys_munmap dsv_qparam dsv_urldecode dsv_hexval dsv_scope dsv_qparam ↻ dsv_atoin dss_search_off dss_search_off_div dss_prefix dss_open_maybe_cached dsc_web_prefix_is ss_open dsc_manifest_sig sys_munmap ↻ ss_close ss_open2 ss_tok_table ss_tok_next2 ss_u8cp ss_fold_cp ss_fold_word_cp ss_is_cjk dss_streq dss_stem_expand nx_stem dss_tlen ss_term_count ss_term_at dss_streq ↻ sys_munmap ↻

structs

none

consts

9const K_MAGIC_2048: i64 = 2048
10const K_MAGIC_8192: i64 = 8192
11const K_MAGIC_16384: i64 = 16384

functions

13func c_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 2: c_rowmain
14func c_len(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n }
called by 1: c_has
19func c_num(v: i64) -> i64 { nxi_out(v); return 0 }
called by 1: main calls 1: nxi_out
20func c_exists(path: *u8) -> i64 { let fd: i64 = sys_openat_rd(path); if fd < 0 { return 0 } sys_close(fd); return 1 }
called by 1: main
21func c_has(hay: *u8, hn: i64, ndl: *u8) -> i64
called by 1: main calls 1: c_len
34func c_render(dom: *u8, path: *u8, out: *u8) -> i64
called by 1: main calls 1: dss_serve
47func c_row(name: *u8, verdict: *u8, ok: i64, have: *i64, total: *i64) -> i64
called by 1: main calls 1: c_puts
56func main() -> i64