code wiki / _hdl_build / nx_alu_divider_r4_test.nx
nx_alu_divider_r4_test.nx
buildroot/runtime/_hdl_build/nx_alu_divider_r4_test.nx
about
nx_alu_divider_r4_test.nx -- the divider's FULL qual+quant exceed proof.
QUAL: radix-4 divider exhaustively correct over the whole 8-bit space.
QUANT: radix-4 has FEWER subtract-stages than radix-2 (measured from the
netlist by counting SUB cells = the sequential remainder-update depth).
A full S-class exceed = BOTH (faster AND still 100%-correct). Honest scope:
this is the STAGE-COUNT (iteration-latency) quant win; the further SRT
carry-save (no carry-propagate add in the loop) win is a later step.
Known answer (FAIL LOUD): "65280 65280 4 8 " = ok, total, r4_subtract_stages,
r2_subtract_stages. exit 0 iff 100%-correct AND r4_subs < r2_subs.
dependencies 1 imports · 0 importers
imports: nx_alu_divider_r4.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
| 14 | func _emit_num(v: i64) -> i64 called by 1: main |
| 22 | func _nl() -> i64 { let z: *u8 = sys_mmap(2); z[0] = 10; sys_write(1, z, 1); return 0 } called by 1: main |
| 24 | func count_kind(g: *NxGsim, kind: i64) -> i64 called by 1: main |
| 31 | func main() -> i64 |