-
Jakob Kummerow authored
Combining parts in a balanced-binary-tree like order allows us to use fast multiplication algorithms. Bug: v8:11515 Change-Id: I6829929671770f009f10f6f3b383501fede476ab Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/3049079Reviewed-by:
Maya Lekova <mslekova@chromium.org> Commit-Queue: Jakob Kummerow <jkummerow@chromium.org> Cr-Commit-Position: refs/heads/main@{#76404}
dd5e5535
| Name |
Last commit
|
Last update |
|---|---|---|
| .. | ||
| DEPS | Loading commit data... | |
| OWNERS | ||
| bigint-internal.cc | ||
| bigint-internal.h | ||
| bigint.h | ||
| digit-arithmetic.h | ||
| div-barrett.cc | ||
| div-burnikel.cc | ||
| div-helpers.cc | ||
| div-helpers.h | ||
| div-schoolbook.cc | ||
| fromstring.cc | ||
| mul-fft.cc | ||
| mul-karatsuba.cc | ||
| mul-schoolbook.cc | ||
| mul-toom.cc | ||
| tostring.cc | ||
| util.h | ||
| vector-arithmetic.cc | ||
| vector-arithmetic.h |