zig/lib at 4fa465fc8f3b6140e635186b4f0e5acae924adcc - zig

mirror of https://codeberg.org/ziglang/zig.git synced 2026-04-27 19:09:47 +03:00

Files

T

Koko Bhadra 4fa465fc8f compiler_rt: optimize udivmod large-divisor case with trial quotient

Replace the O(n) shift-subtract loop with a constant-time trial
quotient approach (Knuth Algorithm D, TAOCP Vol 2 Section 4.3.1).

The old code iterates clz(b_hi)-clz(a_hi)+1 times (up to 64
iterations of 128-bit arithmetic). The new code uses a single
divwide call to get a trial quotient, then verifies with two
native-width widening multiplies.

Benchmark (Apple M1, ReleaseFast):
- Large divisor, large shift: 87ns -> 7.5ns (11.5x faster)
- Small divisor / uniform: unchanged

2026-03-05 20:22:19 +01:00

build-web

std.Io.{Writer|Duration}: move duration formatting to a format method

2026-02-28 02:46:04 +01:00

libc malloc: introduce a canary

2026-02-14 09:25:41 +01:00

compiler

Merge pull request 'rework fuzz testing to be smith based' (#31205 ) from gooncreeper/zig:integrated-smith into master

2026-02-25 20:23:36 +01:00

compiler_rt

compiler_rt: optimize udivmod large-divisor case with trial quotient

2026-03-05 20:22:19 +01:00