v8/test/bigint
Jakob Kummerow 485c15c1ca [bigint] Barrett-Newton division
Dividing by first computing a multiplicative inverse is faster than
Burnikel-Ziegler division for very large inputs.

Bug: v8:11515
Change-Id: Ice45690c3fa4eef7102d418cdd3d82a942a076c5
Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/3015573
Commit-Queue: Jakob Kummerow <jkummerow@chromium.org>
Reviewed-by: Maya Lekova <mslekova@chromium.org>
Cr-Commit-Position: refs/heads/master@{#75743}
2021-07-15 16:59:44 +00:00
..
bigint-shell.cc [bigint] Barrett-Newton division 2021-07-15 16:59:44 +00:00
bigint.status Reland^2 "[bigint] Karatsuba multiplication" 2021-06-07 11:01:14 +00:00
BUILD.gn [bigint] Toom-Cook multiplication 2021-07-07 10:12:26 +00:00
DEPS Reland^2 "[bigint] Karatsuba multiplication" 2021-06-07 11:01:14 +00:00
testcfg.py Reland^2 "[bigint] Karatsuba multiplication" 2021-06-07 11:01:14 +00:00