[llvm] [Hashing] Replace CityHash mixers with xxh3 (PR #194567)
via llvm-commits
llvm-commits at lists.llvm.org
Tue Apr 28 00:54:21 PDT 2026
llvmbot wrote:
<!--LLVM PR SUMMARY COMMENT-->
@llvm/pr-subscribers-llvm-support
Author: Fangrui Song (MaskRay)
<details>
<summary>Changes</summary>
Replace the CityHash-style mixer in hash_combine and (transitively)
hash_value(std::basic_string) with a flatten-and-call into xxh3_64bits,
a modern hash superior to CityHash.
hash_value(int) / hash_value(ptr) keep the existing Murmur-style
hash_16_bytes mixer; those are the dominant DenseMap key paths and a
fully-inline 16-byte mix beats inlining xxh3's larger 0..16-byte short
path.
To break dependency cycle: xxHash64, xxh3_64bits, and xxh3_128bits
ArrayRef/StringRef overloads move from llvm/Support/xxhash.h to inline
overloads in llvm/ADT/ArrayRef.h and llvm/ADT/StringRef.h, so xxhash.h
has no ADT dependencies.
A variant that inlined xxh3's 0..16-byte fast path at every
combine_bytes call site (vs. always calling out-of-line xxh3_64bits)
showed no measurable compile-time improvement on the tracker.
llvm-compile-time-tracker.com (CTMark, instructions:u)
```
stage1-O0-g -1.64% (sqlite3 -3.42%)
stage1-aarch64-O0-g -1.41% (sqlite3 -2.71%)
stage1-ReleaseLTO-g -1.14% (tramp3d-v4 -1.64%)
stage1-O3 -0.44%
stage1-ReleaseThinLTO -0.43%
stage2-O3 -0.16%
```
DenseMap-of-pointer paths (dominant at -O3) are untouched, so higher-
optimization configs see smaller wins as expected. opt's .text shrinks
~92 KB. Subsumes the StringRef-only carve-out proposed in #<!-- -->191115.
Aided by Claude opus 4.7
---
Patch is 24.95 KiB, truncated to 20.00 KiB below, full version: https://github.com/llvm/llvm-project/pull/194567.diff
7 Files Affected:
- (modified) llvm/include/llvm/ADT/ArrayRef.h (+14)
- (modified) llvm/include/llvm/ADT/FoldingSet.h (+2-2)
- (modified) llvm/include/llvm/ADT/Hashing.h (+59-330)
- (modified) llvm/include/llvm/ADT/StableHashing.h (+2-3)
- (modified) llvm/include/llvm/ADT/StringRef.h (+12)
- (modified) llvm/include/llvm/Support/xxhash.h (+10-10)
- (modified) llvm/lib/Support/xxhash.cpp (+4-15)
``````````diff
diff --git a/llvm/include/llvm/ADT/ArrayRef.h b/llvm/include/llvm/ADT/ArrayRef.h
index eafc4330a1b1b..976eb6ee040de 100644
--- a/llvm/include/llvm/ADT/ArrayRef.h
+++ b/llvm/include/llvm/ADT/ArrayRef.h
@@ -13,6 +13,7 @@
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/Support/Compiler.h"
+#include "llvm/Support/xxhash.h"
#include <algorithm>
#include <array>
#include <cassert>
@@ -562,6 +563,19 @@ namespace llvm {
return hash_combine_range(S);
}
+ /// Inline ArrayRef overloads of the xxhash entry points declared
+ /// out-of-line in llvm/Support/xxhash.h. They live here so xxhash.h can stay
+ /// free of ADT dependencies.
+ inline uint64_t xxHash64(ArrayRef<uint8_t> data) {
+ return xxHash64(data.data(), data.size());
+ }
+ inline uint64_t xxh3_64bits(ArrayRef<uint8_t> data) {
+ return xxh3_64bits(data.data(), data.size());
+ }
+ inline XXH128_hash_t xxh3_128bits(ArrayRef<uint8_t> data) {
+ return xxh3_128bits(data.data(), data.size());
+ }
+
// Provide DenseMapInfo for ArrayRefs.
template <typename T> struct DenseMapInfo<ArrayRef<T>, void> {
static inline ArrayRef<T> getEmptyKey() {
diff --git a/llvm/include/llvm/ADT/FoldingSet.h b/llvm/include/llvm/ADT/FoldingSet.h
index 0322dc5bddfe3..590b7ca76e322 100644
--- a/llvm/include/llvm/ADT/FoldingSet.h
+++ b/llvm/include/llvm/ADT/FoldingSet.h
@@ -187,8 +187,8 @@ class FoldingSetNodeIDRef {
// Compute a deterministic hash value across processes that is suitable for
// on-disk serialization.
unsigned computeStableHash() const {
- return static_cast<unsigned>(xxh3_64bits(ArrayRef(
- reinterpret_cast<const uint8_t *>(Data), sizeof(unsigned) * Size)));
+ return static_cast<unsigned>(xxh3_64bits(
+ reinterpret_cast<const uint8_t *>(Data), sizeof(unsigned) * Size));
}
LLVM_ABI bool operator==(FoldingSetNodeIDRef) const;
diff --git a/llvm/include/llvm/ADT/Hashing.h b/llvm/include/llvm/ADT/Hashing.h
index 0f96b857bff16..937822e783b12 100644
--- a/llvm/include/llvm/ADT/Hashing.h
+++ b/llvm/include/llvm/ADT/Hashing.h
@@ -50,9 +50,11 @@
#include "llvm/Support/ErrorHandling.h"
#include "llvm/Support/SwapByteOrder.h"
#include "llvm/Support/type_traits.h"
-#include <algorithm>
+#include "llvm/Support/xxhash.h"
+#include <array>
#include <cassert>
#include <cstring>
+#include <memory>
#include <optional>
#include <string>
#include <tuple>
@@ -136,14 +138,6 @@ template <typename T> hash_code hash_value(const std::optional<T> &arg);
namespace hashing {
namespace detail {
-inline uint64_t fetch64(const char *p) {
- uint64_t result;
- std::memcpy(&result, p, sizeof(result));
- if (sys::IsBigEndianHost)
- sys::swapByteOrder(result);
- return result;
-}
-
inline uint32_t fetch32(const char *p) {
uint32_t result;
std::memcpy(&result, p, sizeof(result));
@@ -152,22 +146,6 @@ inline uint32_t fetch32(const char *p) {
return result;
}
-/// Some primes between 2^63 and 2^64 for various uses.
-static constexpr uint64_t k0 = 0xc3a5c85c97cb3127ULL;
-static constexpr uint64_t k1 = 0xb492b66fbe98f273ULL;
-static constexpr uint64_t k2 = 0x9ae16a3b2f90404fULL;
-static constexpr uint64_t k3 = 0xc949d7c7509e6557ULL;
-
-/// Bitwise right rotate.
-/// Normally this will compile to a single instruction, especially if the
-/// shift is a manifest constant.
-constexpr uint64_t rotate(uint64_t val, size_t shift) {
- // Avoid shifting by 64: doing so yields an undefined result.
- return shift == 0 ? val : ((val >> shift) | (val << (64 - shift)));
-}
-
-constexpr uint64_t shift_mix(uint64_t val) { return val ^ (val >> 47); }
-
constexpr uint64_t hash_16_bytes(uint64_t low, uint64_t high) {
// Murmur-inspired hashing.
const uint64_t kMul = 0x9ddfea08eb382d69ULL;
@@ -179,134 +157,6 @@ constexpr uint64_t hash_16_bytes(uint64_t low, uint64_t high) {
return b;
}
-constexpr uint64_t hash_1to3_bytes(const char *s, size_t len, uint64_t seed) {
- uint8_t a = s[0];
- uint8_t b = s[len >> 1];
- uint8_t c = s[len - 1];
- uint32_t y = static_cast<uint32_t>(a) + (static_cast<uint32_t>(b) << 8);
- uint32_t z = static_cast<uint32_t>(len) + (static_cast<uint32_t>(c) << 2);
- return shift_mix(y * k2 ^ z * k3 ^ seed) * k2;
-}
-
-inline uint64_t hash_4to8_bytes(const char *s, size_t len, uint64_t seed) {
- uint64_t a = fetch32(s);
- return hash_16_bytes(len + (a << 3), seed ^ fetch32(s + len - 4));
-}
-
-inline uint64_t hash_9to16_bytes(const char *s, size_t len, uint64_t seed) {
- uint64_t a = fetch64(s);
- uint64_t b = fetch64(s + len - 8);
- return hash_16_bytes(seed ^ a, rotate(b + len, len)) ^ b;
-}
-
-inline uint64_t hash_17to32_bytes(const char *s, size_t len, uint64_t seed) {
- uint64_t a = fetch64(s) * k1;
- uint64_t b = fetch64(s + 8);
- uint64_t c = fetch64(s + len - 8) * k2;
- uint64_t d = fetch64(s + len - 16) * k0;
- return hash_16_bytes(llvm::rotr<uint64_t>(a - b, 43) +
- llvm::rotr<uint64_t>(c ^ seed, 30) + d,
- a + llvm::rotr<uint64_t>(b ^ k3, 20) - c + len + seed);
-}
-
-inline uint64_t hash_33to64_bytes(const char *s, size_t len, uint64_t seed) {
- uint64_t z = fetch64(s + 24);
- uint64_t a = fetch64(s) + (len + fetch64(s + len - 16)) * k0;
- uint64_t b = llvm::rotr<uint64_t>(a + z, 52);
- uint64_t c = llvm::rotr<uint64_t>(a, 37);
- a += fetch64(s + 8);
- c += llvm::rotr<uint64_t>(a, 7);
- a += fetch64(s + 16);
- uint64_t vf = a + z;
- uint64_t vs = b + llvm::rotr<uint64_t>(a, 31) + c;
- a = fetch64(s + 16) + fetch64(s + len - 32);
- z = fetch64(s + len - 8);
- b = llvm::rotr<uint64_t>(a + z, 52);
- c = llvm::rotr<uint64_t>(a, 37);
- a += fetch64(s + len - 24);
- c += llvm::rotr<uint64_t>(a, 7);
- a += fetch64(s + len - 16);
- uint64_t wf = a + z;
- uint64_t ws = b + llvm::rotr<uint64_t>(a, 31) + c;
- uint64_t r = shift_mix((vf + ws) * k2 + (wf + vs) * k0);
- return shift_mix((seed ^ (r * k0)) + vs) * k2;
-}
-
-inline uint64_t hash_short(const char *s, size_t length, uint64_t seed) {
- if (length >= 4 && length <= 8)
- return hash_4to8_bytes(s, length, seed);
- if (length > 8 && length <= 16)
- return hash_9to16_bytes(s, length, seed);
- if (length > 16 && length <= 32)
- return hash_17to32_bytes(s, length, seed);
- if (length > 32)
- return hash_33to64_bytes(s, length, seed);
- if (length != 0)
- return hash_1to3_bytes(s, length, seed);
-
- return k2 ^ seed;
-}
-
-/// The intermediate state used during hashing.
-/// Currently, the algorithm for computing hash codes is based on CityHash and
-/// keeps 56 bytes of arbitrary state.
-struct hash_state {
- uint64_t h0 = 0, h1 = 0, h2 = 0, h3 = 0, h4 = 0, h5 = 0, h6 = 0;
-
- /// Create a new hash_state structure and initialize it based on the
- /// seed and the first 64-byte chunk.
- /// This effectively performs the initial mix.
- static hash_state create(const char *s, uint64_t seed) {
- hash_state state = {0,
- seed,
- hash_16_bytes(seed, k1),
- llvm::rotr<uint64_t>(seed ^ k1, 49),
- seed * k1,
- shift_mix(seed),
- 0};
- state.h6 = hash_16_bytes(state.h4, state.h5);
- state.mix(s);
- return state;
- }
-
- /// Mix 32-bytes from the input sequence into the 16-bytes of 'a'
- /// and 'b', including whatever is already in 'a' and 'b'.
- static void mix_32_bytes(const char *s, uint64_t &a, uint64_t &b) {
- a += fetch64(s);
- uint64_t c = fetch64(s + 24);
- b = llvm::rotr<uint64_t>(b + a + c, 21);
- uint64_t d = a;
- a += fetch64(s + 8) + fetch64(s + 16);
- b += llvm::rotr<uint64_t>(a, 44) + d;
- a += c;
- }
-
- /// Mix in a 64-byte buffer of data.
- /// We mix all 64 bytes even when the chunk length is smaller, but we
- /// record the actual length.
- void mix(const char *s) {
- h0 = llvm::rotr<uint64_t>(h0 + h1 + h3 + fetch64(s + 8), 37) * k1;
- h1 = llvm::rotr<uint64_t>(h1 + h4 + fetch64(s + 48), 42) * k1;
- h0 ^= h6;
- h1 += h3 + fetch64(s + 40);
- h2 = llvm::rotr<uint64_t>(h2 + h5, 33) * k1;
- h3 = h4 * k1;
- h4 = h0 + h5;
- mix_32_bytes(s, h3, h4);
- h5 = h2 + h6;
- h6 = h1 + fetch64(s + 16);
- mix_32_bytes(s + 32, h5, h6);
- std::swap(h2, h0);
- }
-
- /// Compute the final 64-bit hash code value based on the current
- /// state and the length of bytes hashed.
- constexpr uint64_t finalize(size_t length) {
- return hash_16_bytes(hash_16_bytes(h3, h5) + shift_mix(h1) * k1 + h2,
- hash_16_bytes(h4, h6) + shift_mix(length) * k1 + h0);
- }
-};
-
/// In LLVM_ENABLE_ABI_BREAKING_CHECKS builds, the seed is non-deterministic
/// per process (address of a function in LLVMSupport) to prevent having users
/// depend on the particular hash values. On platforms without ASLR, this is
@@ -320,6 +170,13 @@ inline uint64_t get_execution_seed() {
#endif
}
+/// Hash a contiguous byte buffer to a hash_code. The execution seed is XORed
+/// into the result (not propagated through the avalanche), so a given byte
+/// stream produces the same xxh3 output modulo the per-process seed.
+inline hash_code combine_bytes(const char *data, size_t len) {
+ return xxh3_64bits(reinterpret_cast<const uint8_t *>(data), len) ^
+ get_execution_seed();
+}
/// Trait to indicate whether a type's bits can be hashed directly.
///
@@ -362,63 +219,39 @@ template <typename T> auto get_hashable_data(const T &value) {
}
}
-/// Helper to store data from a value into a buffer and advance the
-/// pointer into that buffer.
-///
-/// This routine first checks whether there is enough space in the provided
-/// buffer, and if not immediately returns false. If there is space, it
-/// copies the underlying bytes of value into the buffer, advances the
-/// buffer_ptr past the copied bytes, and returns true.
-template <typename T>
-bool store_and_advance(char *&buffer_ptr, char *buffer_end, const T& value,
- size_t offset = 0) {
- size_t store_size = sizeof(value) - offset;
- if (buffer_ptr + store_size > buffer_end)
- return false;
- const char *value_data = reinterpret_cast<const char *>(&value);
- std::memcpy(buffer_ptr, value_data + offset, store_size);
- buffer_ptr += store_size;
- return true;
-}
-
/// Implement the combining of integral values into a hash_code.
///
/// This overload is selected when the value type of the iterator is
/// integral. Rather than computing a hash_code for each object and then
/// combining them, this (as an optimization) directly combines the integers.
+///
+/// xxh3 has no streaming entry point in libLLVMSupport, so the byte stream is
+/// flattened to a buffer and hashed in one shot. A 64-byte on-stack buffer
+/// covers the common cases; longer non-contiguous ranges (the prior chunked
+/// CityHash impl was streaming and never allocated) fall back to the heap.
template <typename InputIteratorT>
hash_code hash_combine_range_impl(InputIteratorT first, InputIteratorT last) {
- const uint64_t seed = get_execution_seed();
- char buffer[64], *buffer_ptr = buffer;
- char *const buffer_end = std::end(buffer);
- while (first != last && store_and_advance(buffer_ptr, buffer_end,
- get_hashable_data(*first)))
- ++first;
- if (first == last)
- return hash_short(buffer, buffer_ptr - buffer, seed);
- assert(buffer_ptr == buffer_end);
-
- hash_state state = state.create(buffer, seed);
- size_t length = 64;
- while (first != last) {
- // Fill up the buffer. We don't clear it, which re-mixes the last round
- // when only a partial 64-byte chunk is left.
- buffer_ptr = buffer;
- while (first != last && store_and_advance(buffer_ptr, buffer_end,
- get_hashable_data(*first)))
- ++first;
-
- // Rotate the buffer if we did a partial fill in order to simulate doing
- // a mix of the last 64-bytes. That is how the algorithm works when we
- // have a contiguous byte sequence, and we want to emulate that here.
- std::rotate(buffer, buffer_ptr, buffer_end);
-
- // Mix this chunk into the current state.
- state.mix(buffer);
- length += buffer_ptr - buffer;
- };
-
- return state.finalize(length);
+ alignas(uint64_t) char stack_buf[64];
+ std::unique_ptr<char[]> heap_buf;
+ char *buf = stack_buf;
+ size_t cap = sizeof(stack_buf);
+ size_t len = 0;
+ for (; first != last; ++first) {
+ auto data = get_hashable_data(*first);
+ if (len + sizeof(data) > cap) {
+ size_t new_cap = cap * 2;
+ while (new_cap < len + sizeof(data))
+ new_cap *= 2;
+ std::unique_ptr<char[]> new_buf(new char[new_cap]);
+ std::memcpy(new_buf.get(), buf, len);
+ heap_buf = std::move(new_buf);
+ buf = heap_buf.get();
+ cap = new_cap;
+ }
+ std::memcpy(buf + len, &data, sizeof(data));
+ len += sizeof(data);
+ }
+ return combine_bytes(buf, len);
}
/// Implement the combining of integral values into a hash_code.
@@ -432,24 +265,22 @@ hash_code hash_combine_range_impl(InputIteratorT first, InputIteratorT last) {
template <typename ValueT>
std::enable_if_t<is_hashable_data<ValueT>::value, hash_code>
hash_combine_range_impl(ValueT *first, ValueT *last) {
- const uint64_t seed = get_execution_seed();
- const char *s_begin = reinterpret_cast<const char *>(first);
- const char *s_end = reinterpret_cast<const char *>(last);
- const size_t length = std::distance(s_begin, s_end);
- if (length <= 64)
- return hash_short(s_begin, length, seed);
-
- const char *s_aligned_end = s_begin + (length & ~63);
- hash_state state = state.create(s_begin, seed);
- s_begin += 64;
- while (s_begin != s_aligned_end) {
- state.mix(s_begin);
- s_begin += 64;
- }
- if (length & 63)
- state.mix(s_end - 64);
+ return combine_bytes(reinterpret_cast<const char *>(first),
+ size_t(last - first) * sizeof(ValueT));
+}
+
+/// Sum of `sizeof(get_hashable_data(arg))` across a parameter pack.
+template <typename... Ts> constexpr size_t total_hashable_size() {
+ return (size_t(0) + ... +
+ sizeof(decltype(get_hashable_data(std::declval<Ts>()))));
+}
- return state.finalize(length);
+/// Copy `get_hashable_data(arg)` into `buf` at offset `off`, advancing `off`.
+template <typename T>
+inline void store_hashable_data(char *buf, size_t &off, const T &arg) {
+ auto data = get_hashable_data(arg);
+ std::memcpy(buf + off, &data, sizeof(data));
+ off += sizeof(data);
}
} // namespace detail
@@ -472,112 +303,6 @@ template <typename RangeT> hash_code hash_combine_range(RangeT &&R) {
return hash_combine_range(adl_begin(R), adl_end(R));
}
-// Implementation details for hash_combine.
-namespace hashing {
-namespace detail {
-
-/// Helper class to manage the recursive combining of hash_combine
-/// arguments.
-///
-/// This class exists to manage the state and various calls involved in the
-/// recursive combining of arguments used in hash_combine. It is particularly
-/// useful at minimizing the code in the recursive calls to ease the pain
-/// caused by a lack of variadic functions.
-struct hash_combine_recursive_helper {
- char buffer[64] = {};
- hash_state state;
- const uint64_t seed;
-
-public:
- /// Construct a recursive hash combining helper.
- ///
- /// This sets up the state for a recursive hash combine, including getting
- /// the seed and buffer setup.
- hash_combine_recursive_helper()
- : seed(get_execution_seed()) {}
-
- /// Combine one chunk of data into the current in-flight hash.
- ///
- /// This merges one chunk of data into the hash. First it tries to buffer
- /// the data. If the buffer is full, it hashes the buffer into its
- /// hash_state, empties it, and then merges the new chunk in. This also
- /// handles cases where the data straddles the end of the buffer.
- template <typename T>
- char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
- if (!store_and_advance(buffer_ptr, buffer_end, data)) {
- // Check for skew which prevents the buffer from being packed, and do
- // a partial store into the buffer to fill it. This is only a concern
- // with the variadic combine because that formation can have varying
- // argument types.
- size_t partial_store_size = buffer_end - buffer_ptr;
- std::memcpy(buffer_ptr, &data, partial_store_size);
-
- // If the store fails, our buffer is full and ready to hash. We have to
- // either initialize the hash state (on the first full buffer) or mix
- // this buffer into the existing hash state. Length tracks the *hashed*
- // length, not the buffered length.
- if (length == 0) {
- state = state.create(buffer, seed);
- length = 64;
- } else {
- // Mix this chunk into the current state and bump length up by 64.
- state.mix(buffer);
- length += 64;
- }
- // Reset the buffer_ptr to the head of the buffer for the next chunk of
- // data.
- buffer_ptr = buffer;
-
- // Try again to store into the buffer -- this cannot fail as we only
- // store types smaller than the buffer.
- if (!store_and_advance(buffer_ptr, buffer_end, data,
- partial_store_size))
- llvm_unreachable("buffer smaller than stored type");
- }
- return buffer_ptr;
- }
-
- /// Recursive, variadic combining method.
- ///
- /// This function recurses through each argument, combining that argument
- /// into a single hash.
- template <typename T, typename ...Ts>
- hash_code combine(size_t length, char *buffer_ptr, char *buffer_end,
- const T &arg, const Ts &...args) {
- buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
-
- // Recurse to the next argument.
- return combine(length, buffer_ptr, buffer_end, args...);
- }
-
- /// Base case for recursive, variadic combining.
- ///
- /// The base case when combining arguments recursively is reached when all
- /// arguments have been handled. It flushes the remaining buffer and
- /// constructs a hash_code.
- hash_code combine(size_t length, char *buffer_ptr, char *buffer_end) {
- // Check whether the entire set of values fit in the buffer. If so, we'll
- // use the optimized short hashing routine and skip state entirely.
- if (length == 0)
- return hash_short(buffer, buffer_ptr - buffer, seed);
-
- // Mix the final buffer, rotating it if we did a partial fill in order to
- // simulate doing a mix of the last 64-bytes. That is how the algorithm
- // works when we have a contiguous byte sequence, and we want to emulate
- // that here.
- std::rotate(buffer, buffer_ptr, buffer_end);
-
- // Mix this chunk into the current state.
- state.mix(buffer);
- length += buffer_ptr - buffer;
-
- return state.finalize(length);
- }
-};
-
-} // namespace detail
-} // namespace hashing
-
/// Combine values into a single hash_code.
///
/// This routine accepts a varying number of arguments of any type. It will
@@ -589,10 +314,14 @@ struct hash_combine_recursive_helper {
/// The result is suitable for returning from a user's hash_value
/// *implementation* for their user-defined type. Consumers of a type should
/// *not* call this routine, they should instead call 'hash_value'.
-template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
- // Recursively hash each argument using a helper class.
- ::llvm::hashing::detail::hash_combine_recursive_helper helper;
- return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
+template <typename... Ts> hash_code hash_combine(const Ts &...args) {
+ constexpr size_t Total = hashing::detail::total_hashable_size<Ts...>();
+ // Round up so `data()` is non-null when Total == 0; combine_bytes won't
+ // read the buffer in that case (len=0 short-circuits in xxh3_64bits).
+ std::array<char, Total == 0 ? 1 : Total> buf;
+ size_t off = 0;
+ (hashing::detail::store_hashable_data(buf.data(), off, args), ...);
+ return hashing::detail::combine_bytes(buf.data(), Total);
}
// Implementation details for implementations of hash_value overloads provided
diff --git a/llvm/include/llvm/ADT/StableHashing.h b/llvm/include/llvm/ADT/StableHashing.h
index 0dd83be639424..1beb5b85c9967 100644
--- a/llvm/i...
[truncated]
``````````
</details>
https://github.com/llvm/llvm-project/pull/194567
More information about the llvm-commits
mailing list