aboutsummaryrefslogtreecommitdiff
path: root/clang/lib/CodeGen/CodeGenAction.cpp
diff options
context:
space:
mode:
authorserge-sans-paille <sguelton@mozilla.com>2024-05-08 14:21:31 +0000
committerGitHub <noreply@github.com>2024-05-08 14:21:31 +0000
commit27a062e9ca7c92e89ed4084c3c3affb9fa39aabb (patch)
tree28da7ada9c77aa525c776a0644a47e3d7e6e950f /clang/lib/CodeGen/CodeGenAction.cpp
parentb5afda8d760998641cf08a6d229252924b0ad146 (diff)
downloadllvm-27a062e9ca7c92e89ed4084c3c3affb9fa39aabb.zip
llvm-27a062e9ca7c92e89ed4084c3c3affb9fa39aabb.tar.gz
llvm-27a062e9ca7c92e89ed4084c3c3affb9fa39aabb.tar.bz2
[libc++] Implement std::gcd using the binary version (#77747)
The binary version is four times faster than current implementation in my setup, and generally considered a better implementation. Code inspired by https://en.algorithmica.org/hpc/algorithms/gcd/ which itself is inspired by https://lemire.me/blog/2013/12/26/fastest-way-to-compute-the-greatest-common-divisor/ Fix #77648
Diffstat (limited to 'clang/lib/CodeGen/CodeGenAction.cpp')
0 files changed, 0 insertions, 0 deletions