code wiki / _hdl_build / nx_regex_bench.nx
nx_regex_bench.nx
buildroot/runtime/_hdl_build/nx_regex_bench.nx
about
nx_regex_bench.nx -- HONEST benchmark: nx_regex vs the backtracking incumbents (PCRE/Perl/Python), grounded on
rx_*.raw, asterisk-disciplined. The exceed is REAL + principled (the RE2/Go-regexp design): a Thompson-style NFA
runs in GUARANTEED LINEAR TIME and is IMMUNE TO ReDoS; backtrackers are more featureful but exponential on
pathological inputs (a documented DoS class). We trade exotic features for the safety guarantee -- and honestly
admit the features we lack. expect_exit: 0 Sovereign: nx_syscalls.
dependencies 2 imports · 0 importers
imports: nx_syscalls.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
structs
| none |
consts
| 8 | const K_MAGIC_65536: i64 = 65536 |
functions
| 10 | func g_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 15 | func g_pn(v: i64) -> i64 { nxi_out(v); return 0 } |
| 16 | func ck(name: *u8, c: i64) -> i64 { if c==1 { g_puts(" PASS " as *u8) } else { g_puts(" FAIL " as *u8) } g_puts(name); g_puts("\n" as *u8); return c } |
| 17 | func have(path: *u8) -> i64 { let fd: i64=sys_openat_rd(path); if fd<0 { return 0 } sys_close(fd); return 1 } |
| 18 | func exceed_row(tag: *u8, src: *u8) -> i64 { let g: i64=have(src); if g==1 { g_puts(" [EXCEED] ") } else { g_puts(" [UNGROUNDED] ") } g_puts(tag); g_puts(" <= "); g_puts(src); g_puts("\n" as *u8); return g } |
| 20 | func main() -> i64 |