aboutsummaryrefslogtreecommitdiff
path: root/clang/lib/CodeGen/ModuleBuilder.cpp
diff options
context:
space:
mode:
authorRamkumar Ramachandra <ramkumar.ramachandra@codasip.com>2025-06-02 09:25:50 +0200
committerGitHub <noreply@github.com>2025-06-02 08:25:50 +0100
commitaf2f8a8c14e3bf8c4af8f814c58913e2798b05ef (patch)
tree3f05453dbf1027197fe7c4e4b919afe6f44ec74f /clang/lib/CodeGen/ModuleBuilder.cpp
parentf2582c95febbbee1de31cb5ebfe863f36aedec58 (diff)
downloadllvm-af2f8a8c14e3bf8c4af8f814c58913e2798b05ef.zip
llvm-af2f8a8c14e3bf8c4af8f814c58913e2798b05ef.tar.gz
llvm-af2f8a8c14e3bf8c4af8f814c58913e2798b05ef.tar.bz2
[HashRecognize] Introduce new analysis (#139120)
Introduce a fresh analysis for recognizing polynomial hashes, with the rationale that several targets have specific instructions to optimize things like CRC and GHASH (eg. X86 and RISC-V crypto extension). We limit the scope to polynomial hashes computed in a Galois field of characteristic 2, since this class of operations can also be optimized in the absence of target-specific instructions to use a lookup table. At the moment, we only recognize the CRC algorithm. RFC: https://discourse.llvm.org/t/rfc-new-analysis-for-polynomial-hash-recognition/86268
Diffstat (limited to 'clang/lib/CodeGen/ModuleBuilder.cpp')
0 files changed, 0 insertions, 0 deletions