v8/test/bigint
Jakob Kummerow afa6126921 Reland "[bigint] FFT-based multiplication"
The Schönhage-Strassen method for *very* large inputs.

This is a reland of 347ba35716,
with added zero-initialization to pacify MSan (spurious report).

Originally:
> Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/3000742
> Commit-Queue: Jakob Kummerow <jkummerow@chromium.org>
> Reviewed-by: Maya Lekova <mslekova@chromium.org>
> Cr-Commit-Position: refs/heads/master@{#75659}

Bug: v8:11515
Change-Id: Ieac6e174bde6eb09af0a9a9a49969feabca79e81
Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/3018081
Reviewed-by: Maya Lekova <mslekova@chromium.org>
Commit-Queue: Jakob Kummerow <jkummerow@chromium.org>
Cr-Commit-Position: refs/heads/master@{#75663}
2021-07-09 14:22:33 +00:00
..
bigint-shell.cc Reland "[bigint] FFT-based multiplication" 2021-07-09 14:22:33 +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