Coverage Report

Created: 2018-09-19 20:53

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/include/llvm/ADT/Hashing.h
Line
Count
Source (jump to first uncovered line)
1
//===-- llvm/ADT/Hashing.h - Utilities for hashing --------------*- C++ -*-===//
2
//
3
//                     The LLVM Compiler Infrastructure
4
//
5
// This file is distributed under the University of Illinois Open Source
6
// License. See LICENSE.TXT for details.
7
//
8
//===----------------------------------------------------------------------===//
9
//
10
// This file implements the newly proposed standard C++ interfaces for hashing
11
// arbitrary data and building hash functions for user-defined types. This
12
// interface was originally proposed in N3333[1] and is currently under review
13
// for inclusion in a future TR and/or standard.
14
//
15
// The primary interfaces provide are comprised of one type and three functions:
16
//
17
//  -- 'hash_code' class is an opaque type representing the hash code for some
18
//     data. It is the intended product of hashing, and can be used to implement
19
//     hash tables, checksumming, and other common uses of hashes. It is not an
20
//     integer type (although it can be converted to one) because it is risky
21
//     to assume much about the internals of a hash_code. In particular, each
22
//     execution of the program has a high probability of producing a different
23
//     hash_code for a given input. Thus their values are not stable to save or
24
//     persist, and should only be used during the execution for the
25
//     construction of hashing datastructures.
26
//
27
//  -- 'hash_value' is a function designed to be overloaded for each
28
//     user-defined type which wishes to be used within a hashing context. It
29
//     should be overloaded within the user-defined type's namespace and found
30
//     via ADL. Overloads for primitive types are provided by this library.
31
//
32
//  -- 'hash_combine' and 'hash_combine_range' are functions designed to aid
33
//      programmers in easily and intuitively combining a set of data into
34
//      a single hash_code for their object. They should only logically be used
35
//      within the implementation of a 'hash_value' routine or similar context.
36
//
37
// Note that 'hash_combine_range' contains very special logic for hashing
38
// a contiguous array of integers or pointers. This logic is *extremely* fast,
39
// on a modern Intel "Gainestown" Xeon (Nehalem uarch) @2.2 GHz, these were
40
// benchmarked at over 6.5 GiB/s for large keys, and <20 cycles/hash for keys
41
// under 32-bytes.
42
//
43
//===----------------------------------------------------------------------===//
44
45
#ifndef LLVM_ADT_HASHING_H
46
#define LLVM_ADT_HASHING_H
47
48
#include "llvm/Support/DataTypes.h"
49
#include "llvm/Support/Host.h"
50
#include "llvm/Support/SwapByteOrder.h"
51
#include "llvm/Support/type_traits.h"
52
#include <algorithm>
53
#include <cassert>
54
#include <cstring>
55
#include <string>
56
#include <utility>
57
58
namespace llvm {
59
60
/// An opaque object representing a hash code.
61
///
62
/// This object represents the result of hashing some entity. It is intended to
63
/// be used to implement hashtables or other hashing-based data structures.
64
/// While it wraps and exposes a numeric value, this value should not be
65
/// trusted to be stable or predictable across processes or executions.
66
///
67
/// In order to obtain the hash_code for an object 'x':
68
/// \code
69
///   using llvm::hash_value;
70
///   llvm::hash_code code = hash_value(x);
71
/// \endcode
72
0
class hash_code {
73
  size_t value;
74
75
public:
76
  /// Default construct a hash_code.
77
  /// Note that this leaves the value uninitialized.
78
  hash_code() = default;
79
80
  /// Form a hash code directly from a numerical value.
81
1.09G
  hash_code(size_t value) : value(value) {}
82
83
  /// Convert the hash code to its numerical value for use.
84
989M
  /*explicit*/ operator size_t() const { return value; }
85
86
0
  friend bool operator==(const hash_code &lhs, const hash_code &rhs) {
87
0
    return lhs.value == rhs.value;
88
0
  }
89
11.3k
  friend bool operator!=(const hash_code &lhs, const hash_code &rhs) {
90
11.3k
    return lhs.value != rhs.value;
91
11.3k
  }
92
93
  /// Allow a hash_code to be directly run through hash_value.
94
106M
  friend size_t hash_value(const hash_code &code) { return code.value; }
95
};
96
97
/// Compute a hash_code for any integer value.
98
///
99
/// Note that this function is intended to compute the same hash_code for
100
/// a particular value without regard to the pre-promotion type. This is in
101
/// contrast to hash_combine which may produce different hash_codes for
102
/// differing argument types even if they would implicit promote to a common
103
/// type without changing the value.
104
template <typename T>
105
typename std::enable_if<is_integral_or_enum<T>::value, hash_code>::type
106
hash_value(T value);
107
108
/// Compute a hash_code for a pointer's address.
109
///
110
/// N.B.: This hashes the *address*. Not the value and not the type.
111
template <typename T> hash_code hash_value(const T *ptr);
112
113
/// Compute a hash_code for a pair of objects.
114
template <typename T, typename U>
115
hash_code hash_value(const std::pair<T, U> &arg);
116
117
/// Compute a hash_code for a standard string.
118
template <typename T>
119
hash_code hash_value(const std::basic_string<T> &arg);
120
121
122
/// Override the execution seed with a fixed value.
123
///
124
/// This hashing library uses a per-execution seed designed to change on each
125
/// run with high probability in order to ensure that the hash codes are not
126
/// attackable and to ensure that output which is intended to be stable does
127
/// not rely on the particulars of the hash codes produced.
128
///
129
/// That said, there are use cases where it is important to be able to
130
/// reproduce *exactly* a specific behavior. To that end, we provide a function
131
/// which will forcibly set the seed to a fixed value. This must be done at the
132
/// start of the program, before any hashes are computed. Also, it cannot be
133
/// undone. This makes it thread-hostile and very hard to use outside of
134
/// immediately on start of a simple program designed for reproducible
135
/// behavior.
136
void set_fixed_execution_hash_seed(uint64_t fixed_value);
137
138
139
// All of the implementation details of actually computing the various hash
140
// code values are held within this namespace. These routines are included in
141
// the header file mainly to allow inlining and constant propagation.
142
namespace hashing {
143
namespace detail {
144
145
3.57G
inline uint64_t fetch64(const char *p) {
146
3.57G
  uint64_t result;
147
3.57G
  memcpy(&result, p, sizeof(result));
148
3.57G
  if (sys::IsBigEndianHost)
149
0
    sys::swapByteOrder(result);
150
3.57G
  return result;
151
3.57G
}
152
153
597M
inline uint32_t fetch32(const char *p) {
154
597M
  uint32_t result;
155
597M
  memcpy(&result, p, sizeof(result));
156
597M
  if (sys::IsBigEndianHost)
157
0
    sys::swapByteOrder(result);
158
597M
  return result;
159
597M
}
160
161
/// Some primes between 2^63 and 2^64 for various uses.
162
static const uint64_t k0 = 0xc3a5c85c97cb3127ULL;
163
static const uint64_t k1 = 0xb492b66fbe98f273ULL;
164
static const uint64_t k2 = 0x9ae16a3b2f90404fULL;
165
static const uint64_t k3 = 0xc949d7c7509e6557ULL;
166
167
/// Bitwise right rotate.
168
/// Normally this will compile to a single instruction, especially if the
169
/// shift is a manifest constant.
170
2.47G
inline uint64_t rotate(uint64_t val, size_t shift) {
171
2.47G
  // Avoid shifting by 64: doing so yields an undefined result.
172
2.47G
  return shift == 0 ? 
val0
: ((val >> shift) | (val << (64 - shift)));
173
2.47G
}
174
175
232M
inline uint64_t shift_mix(uint64_t val) {
176
232M
  return val ^ (val >> 47);
177
232M
}
178
179
1.06G
inline uint64_t hash_16_bytes(uint64_t low, uint64_t high) {
180
1.06G
  // Murmur-inspired hashing.
181
1.06G
  const uint64_t kMul = 0x9ddfea08eb382d69ULL;
182
1.06G
  uint64_t a = (low ^ high) * kMul;
183
1.06G
  a ^= (a >> 47);
184
1.06G
  uint64_t b = (high ^ a) * kMul;
185
1.06G
  b ^= (b >> 47);
186
1.06G
  b *= kMul;
187
1.06G
  return b;
188
1.06G
}
189
190
167k
inline uint64_t hash_1to3_bytes(const char *s, size_t len, uint64_t seed) {
191
167k
  uint8_t a = s[0];
192
167k
  uint8_t b = s[len >> 1];
193
167k
  uint8_t c = s[len - 1];
194
167k
  uint32_t y = static_cast<uint32_t>(a) + (static_cast<uint32_t>(b) << 8);
195
167k
  uint32_t z = len + (static_cast<uint32_t>(c) << 2);
196
167k
  return shift_mix(y * k2 ^ z * k3 ^ seed) * k2;
197
167k
}
198
199
298M
inline uint64_t hash_4to8_bytes(const char *s, size_t len, uint64_t seed) {
200
298M
  uint64_t a = fetch32(s);
201
298M
  return hash_16_bytes(len + (a << 3), seed ^ fetch32(s + len - 4));
202
298M
}
203
204
317M
inline uint64_t hash_9to16_bytes(const char *s, size_t len, uint64_t seed) {
205
317M
  uint64_t a = fetch64(s);
206
317M
  uint64_t b = fetch64(s + len - 8);
207
317M
  return hash_16_bytes(seed ^ a, rotate(b + len, len)) ^ b;
208
317M
}
209
210
355M
inline uint64_t hash_17to32_bytes(const char *s, size_t len, uint64_t seed) {
211
355M
  uint64_t a = fetch64(s) * k1;
212
355M
  uint64_t b = fetch64(s + 8);
213
355M
  uint64_t c = fetch64(s + len - 8) * k2;
214
355M
  uint64_t d = fetch64(s + len - 16) * k0;
215
355M
  return hash_16_bytes(rotate(a - b, 43) + rotate(c ^ seed, 30) + d,
216
355M
                       a + rotate(b ^ k3, 20) - c + len + seed);
217
355M
}
218
219
87.2M
inline uint64_t hash_33to64_bytes(const char *s, size_t len, uint64_t seed) {
220
87.2M
  uint64_t z = fetch64(s + 24);
221
87.2M
  uint64_t a = fetch64(s) + (len + fetch64(s + len - 16)) * k0;
222
87.2M
  uint64_t b = rotate(a + z, 52);
223
87.2M
  uint64_t c = rotate(a, 37);
224
87.2M
  a += fetch64(s + 8);
225
87.2M
  c += rotate(a, 7);
226
87.2M
  a += fetch64(s + 16);
227
87.2M
  uint64_t vf = a + z;
228
87.2M
  uint64_t vs = b + rotate(a, 31) + c;
229
87.2M
  a = fetch64(s + 16) + fetch64(s + len - 32);
230
87.2M
  z = fetch64(s + len - 8);
231
87.2M
  b = rotate(a + z, 52);
232
87.2M
  c = rotate(a, 37);
233
87.2M
  a += fetch64(s + len - 24);
234
87.2M
  c += rotate(a, 7);
235
87.2M
  a += fetch64(s + len - 16);
236
87.2M
  uint64_t wf = a + z;
237
87.2M
  uint64_t ws = b + rotate(a, 31) + c;
238
87.2M
  uint64_t r = shift_mix((vf + ws) * k2 + (wf + vs) * k0);
239
87.2M
  return shift_mix((seed ^ (r * k0)) + vs) * k2;
240
87.2M
}
241
242
1.07G
inline uint64_t hash_short(const char *s, size_t length, uint64_t seed) {
243
1.07G
  if (length >= 4 && 
length <= 81.05G
)
244
298M
    return hash_4to8_bytes(s, length, seed);
245
778M
  if (length > 8 && 
length <= 16759M
)
246
317M
    return hash_9to16_bytes(s, length, seed);
247
460M
  if (length > 16 && 
length <= 32442M
)
248
355M
    return hash_17to32_bytes(s, length, seed);
249
105M
  if (length > 32)
250
87.2M
    return hash_33to64_bytes(s, length, seed);
251
18.3M
  if (length != 0)
252
167k
    return hash_1to3_bytes(s, length, seed);
253
18.1M
254
18.1M
  return k2 ^ seed;
255
18.1M
}
256
257
/// The intermediate state used during hashing.
258
/// Currently, the algorithm for computing hash codes is based on CityHash and
259
/// keeps 56 bytes of arbitrary state.
260
0
struct hash_state {
261
  uint64_t h0, h1, h2, h3, h4, h5, h6;
262
263
  /// Create a new hash_state structure and initialize it based on the
264
  /// seed and the first 64-byte chunk.
265
  /// This effectively performs the initial mix.
266
19.1M
  static hash_state create(const char *s, uint64_t seed) {
267
19.1M
    hash_state state = {
268
19.1M
      0, seed, hash_16_bytes(seed, k1), rotate(seed ^ k1, 49),
269
19.1M
      seed * k1, shift_mix(seed), 0 };
270
19.1M
    state.h6 = hash_16_bytes(state.h4, state.h5);
271
19.1M
    state.mix(s);
272
19.1M
    return state;
273
19.1M
  }
274
275
  /// Mix 32-bytes from the input sequence into the 16-bytes of 'a'
276
  /// and 'b', including whatever is already in 'a' and 'b'.
277
107M
  static void mix_32_bytes(const char *s, uint64_t &a, uint64_t &b) {
278
107M
    a += fetch64(s);
279
107M
    uint64_t c = fetch64(s + 24);
280
107M
    b = rotate(b + a + c, 21);
281
107M
    uint64_t d = a;
282
107M
    a += fetch64(s + 8) + fetch64(s + 16);
283
107M
    b += rotate(a, 44) + d;
284
107M
    a += c;
285
107M
  }
286
287
  /// Mix in a 64-byte buffer of data.
288
  /// We mix all 64 bytes even when the chunk length is smaller, but we
289
  /// record the actual length.
290
53.6M
  void mix(const char *s) {
291
53.6M
    h0 = rotate(h0 + h1 + h3 + fetch64(s + 8), 37) * k1;
292
53.6M
    h1 = rotate(h1 + h4 + fetch64(s + 48), 42) * k1;
293
53.6M
    h0 ^= h6;
294
53.6M
    h1 += h3 + fetch64(s + 40);
295
53.6M
    h2 = rotate(h2 + h5, 33) * k1;
296
53.6M
    h3 = h4 * k1;
297
53.6M
    h4 = h0 + h5;
298
53.6M
    mix_32_bytes(s, h3, h4);
299
53.6M
    h5 = h2 + h6;
300
53.6M
    h6 = h1 + fetch64(s + 16);
301
53.6M
    mix_32_bytes(s + 32, h5, h6);
302
53.6M
    std::swap(h2, h0);
303
53.6M
  }
304
305
  /// Compute the final 64-bit hash code value based on the current
306
  /// state and the length of bytes hashed.
307
19.1M
  uint64_t finalize(size_t length) {
308
19.1M
    return hash_16_bytes(hash_16_bytes(h3, h5) + shift_mix(h1) * k1 + h2,
309
19.1M
                         hash_16_bytes(h4, h6) + shift_mix(length) * k1 + h0);
310
19.1M
  }
311
};
312
313
314
/// A global, fixed seed-override variable.
315
///
316
/// This variable can be set using the \see llvm::set_fixed_execution_seed
317
/// function. See that function for details. Do not, under any circumstances,
318
/// set or read this variable.
319
extern uint64_t fixed_seed_override;
320
321
1.09G
inline uint64_t get_execution_seed() {
322
1.09G
  // FIXME: This needs to be a per-execution seed. This is just a placeholder
323
1.09G
  // implementation. Switching to a per-execution seed is likely to flush out
324
1.09G
  // instability bugs and so will happen as its own commit.
325
1.09G
  //
326
1.09G
  // However, if there is a fixed seed override set the first time this is
327
1.09G
  // called, return that instead of the per-execution seed.
328
1.09G
  const uint64_t seed_prime = 0xff51afd7ed558ccdULL;
329
1.09G
  static uint64_t seed = fixed_seed_override ? 
fixed_seed_override0
: seed_prime;
330
1.09G
  return seed;
331
1.09G
}
332
333
334
/// Trait to indicate whether a type's bits can be hashed directly.
335
///
336
/// A type trait which is true if we want to combine values for hashing by
337
/// reading the underlying data. It is false if values of this type must
338
/// first be passed to hash_value, and the resulting hash_codes combined.
339
//
340
// FIXME: We want to replace is_integral_or_enum and is_pointer here with
341
// a predicate which asserts that comparing the underlying storage of two
342
// values of the type for equality is equivalent to comparing the two values
343
// for equality. For all the platforms we care about, this holds for integers
344
// and pointers, but there are platforms where it doesn't and we would like to
345
// support user-defined types which happen to satisfy this property.
346
template <typename T> struct is_hashable_data
347
  : std::integral_constant<bool, ((is_integral_or_enum<T>::value ||
348
                                   std::is_pointer<T>::value) &&
349
                                  64 % sizeof(T) == 0)> {};
350
351
// Special case std::pair to detect when both types are viable and when there
352
// is no alignment-derived padding in the pair. This is a bit of a lie because
353
// std::pair isn't truly POD, but it's close enough in all reasonable
354
// implementations for our use case of hashing the underlying data.
355
template <typename T, typename U> struct is_hashable_data<std::pair<T, U> >
356
  : std::integral_constant<bool, (is_hashable_data<T>::value &&
357
                                  is_hashable_data<U>::value &&
358
                                  (sizeof(T) + sizeof(U)) ==
359
                                   sizeof(std::pair<T, U>))> {};
360
361
/// Helper to get the hashable data representation for a type.
362
/// This variant is enabled when the type itself can be used.
363
template <typename T>
364
typename std::enable_if<is_hashable_data<T>::value, T>::type
365
930M
get_hashable_data(const T &value) {
366
930M
  return value;
367
930M
}
std::__1::enable_if<is_hashable_data<unsigned int>::value, unsigned int>::type llvm::hashing::detail::get_hashable_data<unsigned int>(unsigned int const&)
Line
Count
Source
365
256M
get_hashable_data(const T &value) {
366
256M
  return value;
367
256M
}
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::coverage::CounterExpression::ExprKind>::value, llvm::coverage::CounterExpression::ExprKind>::type llvm::hashing::detail::get_hashable_data<llvm::coverage::CounterExpression::ExprKind>(llvm::coverage::CounterExpression::ExprKind const&)
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::coverage::Counter::CounterKind>::value, llvm::coverage::Counter::CounterKind>::type llvm::hashing::detail::get_hashable_data<llvm::coverage::Counter::CounterKind>(llvm::coverage::Counter::CounterKind const&)
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::Loop const*>::value, llvm::Loop const*>::type llvm::hashing::detail::get_hashable_data<llvm::Loop const*>(llvm::Loop const* const&)
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::BasicBlock*>::value, llvm::BasicBlock*>::type llvm::hashing::detail::get_hashable_data<llvm::BasicBlock*>(llvm::BasicBlock* const&)
std::__1::enable_if<is_hashable_data<bool>::value, bool>::type llvm::hashing::detail::get_hashable_data<bool>(bool const&)
Line
Count
Source
365
45.8M
get_hashable_data(const T &value) {
366
45.8M
  return value;
367
45.8M
}
std::__1::enable_if<is_hashable_data<int>::value, int>::type llvm::hashing::detail::get_hashable_data<int>(int const&)
Line
Count
Source
365
906k
get_hashable_data(const T &value) {
366
906k
  return value;
367
906k
}
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<char const*>::value, char const*>::type llvm::hashing::detail::get_hashable_data<char const*>(char const* const&)
std::__1::enable_if<is_hashable_data<llvm::GlobalValue const*>::value, llvm::GlobalValue const*>::type llvm::hashing::detail::get_hashable_data<llvm::GlobalValue const*>(llvm::GlobalValue const* const&)
Line
Count
Source
365
3.81M
get_hashable_data(const T &value) {
366
3.81M
  return value;
367
3.81M
}
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::BlockAddress const*>::value, llvm::BlockAddress const*>::type llvm::hashing::detail::get_hashable_data<llvm::BlockAddress const*>(llvm::BlockAddress const* const&)
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::MCSymbol*>::value, llvm::MCSymbol*>::type llvm::hashing::detail::get_hashable_data<llvm::MCSymbol*>(llvm::MCSymbol* const&)
std::__1::enable_if<is_hashable_data<llvm::MachineBasicBlock*>::value, llvm::MachineBasicBlock*>::type llvm::hashing::detail::get_hashable_data<llvm::MachineBasicBlock*>(llvm::MachineBasicBlock* const&)
Line
Count
Source
365
1.67M
get_hashable_data(const T &value) {
366
1.67M
  return value;
367
1.67M
}
std::__1::enable_if<is_hashable_data<llvm::MachineOperand::MachineOperandType>::value, llvm::MachineOperand::MachineOperandType>::type llvm::hashing::detail::get_hashable_data<llvm::MachineOperand::MachineOperandType>(llvm::MachineOperand::MachineOperandType const&)
Line
Count
Source
365
59.7M
get_hashable_data(const T &value) {
366
59.7M
  return value;
367
59.7M
}
std::__1::enable_if<is_hashable_data<long long>::value, long long>::type llvm::hashing::detail::get_hashable_data<long long>(long long const&)
Line
Count
Source
365
20.5M
get_hashable_data(const T &value) {
366
20.5M
  return value;
367
20.5M
}
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::ConstantInt const*>::value, llvm::ConstantInt const*>::type llvm::hashing::detail::get_hashable_data<llvm::ConstantInt const*>(llvm::ConstantInt const* const&)
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::ConstantFP const*>::value, llvm::ConstantFP const*>::type llvm::hashing::detail::get_hashable_data<llvm::ConstantFP const*>(llvm::ConstantFP const* const&)
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<unsigned int const*>::value, unsigned int const*>::type llvm::hashing::detail::get_hashable_data<unsigned int const*>(unsigned int const* const&)
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::MDNode const*>::value, llvm::MDNode const*>::type llvm::hashing::detail::get_hashable_data<llvm::MDNode const*>(llvm::MDNode const* const&)
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::Intrinsic::ID>::value, llvm::Intrinsic::ID>::type llvm::hashing::detail::get_hashable_data<llvm::Intrinsic::ID>(llvm::Intrinsic::ID const&)
std::__1::enable_if<is_hashable_data<llvm::InlineAsm::AsmDialect>::value, llvm::InlineAsm::AsmDialect>::type llvm::hashing::detail::get_hashable_data<llvm::InlineAsm::AsmDialect>(llvm::InlineAsm::AsmDialect const&)
Line
Count
Source
365
7.39k
get_hashable_data(const T &value) {
366
7.39k
  return value;
367
7.39k
}
std::__1::enable_if<is_hashable_data<llvm::FunctionType*>::value, llvm::FunctionType*>::type llvm::hashing::detail::get_hashable_data<llvm::FunctionType*>(llvm::FunctionType* const&)
Line
Count
Source
365
7.39k
get_hashable_data(const T &value) {
366
7.39k
  return value;
367
7.39k
}
std::__1::enable_if<is_hashable_data<unsigned char>::value, unsigned char>::type llvm::hashing::detail::get_hashable_data<unsigned char>(unsigned char const&)
Line
Count
Source
365
35.6M
get_hashable_data(const T &value) {
366
35.6M
  return value;
367
35.6M
}
std::__1::enable_if<is_hashable_data<unsigned short>::value, unsigned short>::type llvm::hashing::detail::get_hashable_data<unsigned short>(unsigned short const&)
Line
Count
Source
365
16.7M
get_hashable_data(const T &value) {
366
16.7M
  return value;
367
16.7M
}
std::__1::enable_if<is_hashable_data<llvm::Type const*>::value, llvm::Type const*>::type llvm::hashing::detail::get_hashable_data<llvm::Type const*>(llvm::Type const* const&)
Line
Count
Source
365
6.59M
get_hashable_data(const T &value) {
366
6.59M
  return value;
367
6.59M
}
std::__1::enable_if<is_hashable_data<llvm::Metadata*>::value, llvm::Metadata*>::type llvm::hashing::detail::get_hashable_data<llvm::Metadata*>(llvm::Metadata* const&)
Line
Count
Source
365
32.3M
get_hashable_data(const T &value) {
366
32.3M
  return value;
367
32.3M
}
std::__1::enable_if<is_hashable_data<llvm::MDString*>::value, llvm::MDString*>::type llvm::hashing::detail::get_hashable_data<llvm::MDString*>(llvm::MDString* const&)
Line
Count
Source
365
84.4k
get_hashable_data(const T &value) {
366
84.4k
  return value;
367
84.4k
}
std::__1::enable_if<is_hashable_data<unsigned long long>::value, unsigned long long>::type llvm::hashing::detail::get_hashable_data<unsigned long long>(unsigned long long const&)
Line
Count
Source
365
219M
get_hashable_data(const T &value) {
366
219M
  return value;
367
219M
}
std::__1::enable_if<is_hashable_data<llvm::ArrayType*>::value, llvm::ArrayType*>::type llvm::hashing::detail::get_hashable_data<llvm::ArrayType*>(llvm::ArrayType* const&)
Line
Count
Source
365
37.0k
get_hashable_data(const T &value) {
366
37.0k
  return value;
367
37.0k
}
std::__1::enable_if<is_hashable_data<llvm::StructType*>::value, llvm::StructType*>::type llvm::hashing::detail::get_hashable_data<llvm::StructType*>(llvm::StructType* const&)
Line
Count
Source
365
121k
get_hashable_data(const T &value) {
366
121k
  return value;
367
121k
}
std::__1::enable_if<is_hashable_data<llvm::VectorType*>::value, llvm::VectorType*>::type llvm::hashing::detail::get_hashable_data<llvm::VectorType*>(llvm::VectorType* const&)
Line
Count
Source
365
175k
get_hashable_data(const T &value) {
366
175k
  return value;
367
175k
}
std::__1::enable_if<is_hashable_data<llvm::Type*>::value, llvm::Type*>::type llvm::hashing::detail::get_hashable_data<llvm::Type*>(llvm::Type* const&)
Line
Count
Source
365
55.8M
get_hashable_data(const T &value) {
366
55.8M
  return value;
367
55.8M
}
std::__1::enable_if<is_hashable_data<llvm::PointerType*>::value, llvm::PointerType*>::type llvm::hashing::detail::get_hashable_data<llvm::PointerType*>(llvm::PointerType* const&)
Line
Count
Source
365
7.39k
get_hashable_data(const T &value) {
366
7.39k
  return value;
367
7.39k
}
std::__1::enable_if<is_hashable_data<char>::value, char>::type llvm::hashing::detail::get_hashable_data<char>(char const&)
Line
Count
Source
365
7
get_hashable_data(const T &value) {
366
7
  return value;
367
7
}
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::MemoryAccess const*>::value, llvm::MemoryAccess const*>::type llvm::hashing::detail::get_hashable_data<llvm::MemoryAccess const*>(llvm::MemoryAccess const* const&)
std::__1::enable_if<is_hashable_data<llvm::Value*>::value, llvm::Value*>::type llvm::hashing::detail::get_hashable_data<llvm::Value*>(llvm::Value* const&)
Line
Count
Source
365
129M
get_hashable_data(const T &value) {
366
129M
  return value;
367
129M
}
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::Constant*>::value, llvm::Constant*>::type llvm::hashing::detail::get_hashable_data<llvm::Constant*>(llvm::Constant* const&)
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::Instruction*>::value, llvm::Instruction*>::type llvm::hashing::detail::get_hashable_data<llvm::Instruction*>(llvm::Instruction* const&)
std::__1::enable_if<is_hashable_data<llvm::MCSymbol const*>::value, llvm::MCSymbol const*>::type llvm::hashing::detail::get_hashable_data<llvm::MCSymbol const*>(llvm::MCSymbol const* const&)
Line
Count
Source
365
30.8k
get_hashable_data(const T &value) {
366
30.8k
  return value;
367
30.8k
}
std::__1::enable_if<is_hashable_data<llvm::Instruction::BinaryOps>::value, llvm::Instruction::BinaryOps>::type llvm::hashing::detail::get_hashable_data<llvm::Instruction::BinaryOps>(llvm::Instruction::BinaryOps const&)
Line
Count
Source
365
7.28M
get_hashable_data(const T &value) {
366
7.28M
  return value;
367
7.28M
}
std::__1::enable_if<is_hashable_data<llvm::CmpInst::Predicate>::value, llvm::CmpInst::Predicate>::type llvm::hashing::detail::get_hashable_data<llvm::CmpInst::Predicate>(llvm::CmpInst::Predicate const&)
Line
Count
Source
365
12.6M
get_hashable_data(const T &value) {
366
12.6M
  return value;
367
12.6M
}
std::__1::enable_if<is_hashable_data<llvm::SelectPatternFlavor>::value, llvm::SelectPatternFlavor>::type llvm::hashing::detail::get_hashable_data<llvm::SelectPatternFlavor>(llvm::SelectPatternFlavor const&)
Line
Count
Source
365
215k
get_hashable_data(const T &value) {
366
215k
  return value;
367
215k
}
std::__1::enable_if<is_hashable_data<llvm::Instruction::CastOps>::value, llvm::Instruction::CastOps>::type llvm::hashing::detail::get_hashable_data<llvm::Instruction::CastOps>(llvm::Instruction::CastOps const&)
Line
Count
Source
365
8.13M
get_hashable_data(const T &value) {
366
8.13M
  return value;
367
8.13M
}
std::__1::enable_if<is_hashable_data<short>::value, short>::type llvm::hashing::detail::get_hashable_data<short>(short const&)
Line
Count
Source
365
925k
get_hashable_data(const T &value) {
366
925k
  return value;
367
925k
}
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::fltSemantics const*>::value, llvm::fltSemantics const*>::type llvm::hashing::detail::get_hashable_data<llvm::fltSemantics const*>(llvm::fltSemantics const* const&)
std::__1::enable_if<is_hashable_data<llvm::Value const*>::value, llvm::Value const*>::type llvm::hashing::detail::get_hashable_data<llvm::Value const*>(llvm::Value const* const&)
Line
Count
Source
365
670k
get_hashable_data(const T &value) {
366
670k
  return value;
367
670k
}
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<void*>::value, void*>::type llvm::hashing::detail::get_hashable_data<void*>(void* const&)
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<clang::NestedNameSpecifier*>::value, clang::NestedNameSpecifier*>::type llvm::hashing::detail::get_hashable_data<clang::NestedNameSpecifier*>(clang::NestedNameSpecifier* const&)
std::__1::enable_if<is_hashable_data<llvm::RegisterBankInfo::ValueMapping const*>::value, llvm::RegisterBankInfo::ValueMapping const*>::type llvm::hashing::detail::get_hashable_data<llvm::RegisterBankInfo::ValueMapping const*>(llvm::RegisterBankInfo::ValueMapping const* const&)
Line
Count
Source
365
14.3M
get_hashable_data(const T &value) {
366
14.3M
  return value;
367
14.3M
}
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<long>::value, long>::type llvm::hashing::detail::get_hashable_data<long>(long const&)
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<clang::IdentifierInfo const*>::value, clang::IdentifierInfo const*>::type llvm::hashing::detail::get_hashable_data<clang::IdentifierInfo const*>(clang::IdentifierInfo const* const&)
std::__1::enable_if<is_hashable_data<lld::DefinedAtom::ContentType>::value, lld::DefinedAtom::ContentType>::type llvm::hashing::detail::get_hashable_data<lld::DefinedAtom::ContentType>(lld::DefinedAtom::ContentType const&)
Line
Count
Source
365
54
get_hashable_data(const T &value) {
366
54
  return value;
367
54
}
368
/// Helper to get the hashable data representation for a type.
369
/// This variant is enabled when we must first call hash_value and use the
370
/// result as our data.
371
template <typename T>
372
typename std::enable_if<!is_hashable_data<T>::value, size_t>::type
373
107M
get_hashable_data(const T &value) {
374
107M
  using ::llvm::hash_value;
375
107M
  return hash_value(value);
376
107M
}
std::__1::enable_if<!(is_hashable_data<llvm::hash_code>::value), unsigned long>::type llvm::hashing::detail::get_hashable_data<llvm::hash_code>(llvm::hash_code const&)
Line
Count
Source
373
106M
get_hashable_data(const T &value) {
374
106M
  using ::llvm::hash_value;
375
106M
  return hash_value(value);
376
106M
}
std::__1::enable_if<!(is_hashable_data<llvm::MachineOperand>::value), unsigned long>::type llvm::hashing::detail::get_hashable_data<llvm::MachineOperand>(llvm::MachineOperand const&)
Line
Count
Source
373
369k
get_hashable_data(const T &value) {
374
369k
  using ::llvm::hash_value;
375
369k
  return hash_value(value);
376
369k
}
std::__1::enable_if<!(is_hashable_data<llvm::StringRef>::value), unsigned long>::type llvm::hashing::detail::get_hashable_data<llvm::StringRef>(llvm::StringRef const&)
Line
Count
Source
373
14.7k
get_hashable_data(const T &value) {
374
14.7k
  using ::llvm::hash_value;
375
14.7k
  return hash_value(value);
376
14.7k
}
Unexecuted instantiation: std::__1::enable_if<!(is_hashable_data<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::value), unsigned long>::type llvm::hashing::detail::get_hashable_data<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >(std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&)
377
378
/// Helper to store data from a value into a buffer and advance the
379
/// pointer into that buffer.
380
///
381
/// This routine first checks whether there is enough space in the provided
382
/// buffer, and if not immediately returns false. If there is space, it
383
/// copies the underlying bytes of value into the buffer, advances the
384
/// buffer_ptr past the copied bytes, and returns true.
385
template <typename T>
386
bool store_and_advance(char *&buffer_ptr, char *buffer_end, const T& value,
387
1.03G
                       size_t offset = 0) {
388
1.03G
  size_t store_size = sizeof(value) - offset;
389
1.03G
  if (buffer_ptr + store_size > buffer_end)
390
539k
    return false;
391
1.03G
  const char *value_data = reinterpret_cast<const char *>(&value);
392
1.03G
  memcpy(buffer_ptr, value_data + offset, store_size);
393
1.03G
  buffer_ptr += store_size;
394
1.03G
  return true;
395
1.03G
}
bool llvm::hashing::detail::store_and_advance<unsigned int>(char*&, char*, unsigned int const&, unsigned long)
Line
Count
Source
387
256M
                       size_t offset = 0) {
388
256M
  size_t store_size = sizeof(value) - offset;
389
256M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
256M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
256M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
256M
  buffer_ptr += store_size;
394
256M
  return true;
395
256M
}
bool llvm::hashing::detail::store_and_advance<unsigned long>(char*&, char*, unsigned long const&, unsigned long)
Line
Count
Source
387
107M
                       size_t offset = 0) {
388
107M
  size_t store_size = sizeof(value) - offset;
389
107M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
107M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
107M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
107M
  buffer_ptr += store_size;
394
107M
  return true;
395
107M
}
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::coverage::CounterExpression::ExprKind>(char*&, char*, llvm::coverage::CounterExpression::ExprKind const&, unsigned long)
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::coverage::Counter::CounterKind>(char*&, char*, llvm::coverage::Counter::CounterKind const&, unsigned long)
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::Loop const*>(char*&, char*, llvm::Loop const* const&, unsigned long)
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::BasicBlock*>(char*&, char*, llvm::BasicBlock* const&, unsigned long)
bool llvm::hashing::detail::store_and_advance<bool>(char*&, char*, bool const&, unsigned long)
Line
Count
Source
387
45.8M
                       size_t offset = 0) {
388
45.8M
  size_t store_size = sizeof(value) - offset;
389
45.8M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
45.8M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
45.8M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
45.8M
  buffer_ptr += store_size;
394
45.8M
  return true;
395
45.8M
}
bool llvm::hashing::detail::store_and_advance<int>(char*&, char*, int const&, unsigned long)
Line
Count
Source
387
906k
                       size_t offset = 0) {
388
906k
  size_t store_size = sizeof(value) - offset;
389
906k
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
906k
  const char *value_data = reinterpret_cast<const char *>(&value);
392
906k
  memcpy(buffer_ptr, value_data + offset, store_size);
393
906k
  buffer_ptr += store_size;
394
906k
  return true;
395
906k
}
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<char const*>(char*&, char*, char const* const&, unsigned long)
bool llvm::hashing::detail::store_and_advance<llvm::GlobalValue const*>(char*&, char*, llvm::GlobalValue const* const&, unsigned long)
Line
Count
Source
387
3.81M
                       size_t offset = 0) {
388
3.81M
  size_t store_size = sizeof(value) - offset;
389
3.81M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
3.81M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
3.81M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
3.81M
  buffer_ptr += store_size;
394
3.81M
  return true;
395
3.81M
}
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::BlockAddress const*>(char*&, char*, llvm::BlockAddress const* const&, unsigned long)
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::MCSymbol*>(char*&, char*, llvm::MCSymbol* const&, unsigned long)
bool llvm::hashing::detail::store_and_advance<llvm::MachineBasicBlock*>(char*&, char*, llvm::MachineBasicBlock* const&, unsigned long)
Line
Count
Source
387
1.67M
                       size_t offset = 0) {
388
1.67M
  size_t store_size = sizeof(value) - offset;
389
1.67M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
1.67M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
1.67M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
1.67M
  buffer_ptr += store_size;
394
1.67M
  return true;
395
1.67M
}
bool llvm::hashing::detail::store_and_advance<llvm::MachineOperand::MachineOperandType>(char*&, char*, llvm::MachineOperand::MachineOperandType const&, unsigned long)
Line
Count
Source
387
59.7M
                       size_t offset = 0) {
388
59.7M
  size_t store_size = sizeof(value) - offset;
389
59.7M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
59.7M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
59.7M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
59.7M
  buffer_ptr += store_size;
394
59.7M
  return true;
395
59.7M
}
bool llvm::hashing::detail::store_and_advance<long long>(char*&, char*, long long const&, unsigned long)
Line
Count
Source
387
20.5M
                       size_t offset = 0) {
388
20.5M
  size_t store_size = sizeof(value) - offset;
389
20.5M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
20.5M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
20.5M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
20.5M
  buffer_ptr += store_size;
394
20.5M
  return true;
395
20.5M
}
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::ConstantInt const*>(char*&, char*, llvm::ConstantInt const* const&, unsigned long)
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::ConstantFP const*>(char*&, char*, llvm::ConstantFP const* const&, unsigned long)
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<unsigned int const*>(char*&, char*, unsigned int const* const&, unsigned long)
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::MDNode const*>(char*&, char*, llvm::MDNode const* const&, unsigned long)
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::Intrinsic::ID>(char*&, char*, llvm::Intrinsic::ID const&, unsigned long)
bool llvm::hashing::detail::store_and_advance<llvm::InlineAsm::AsmDialect>(char*&, char*, llvm::InlineAsm::AsmDialect const&, unsigned long)
Line
Count
Source
387
7.39k
                       size_t offset = 0) {
388
7.39k
  size_t store_size = sizeof(value) - offset;
389
7.39k
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
7.39k
  const char *value_data = reinterpret_cast<const char *>(&value);
392
7.39k
  memcpy(buffer_ptr, value_data + offset, store_size);
393
7.39k
  buffer_ptr += store_size;
394
7.39k
  return true;
395
7.39k
}
bool llvm::hashing::detail::store_and_advance<llvm::FunctionType*>(char*&, char*, llvm::FunctionType* const&, unsigned long)
Line
Count
Source
387
7.39k
                       size_t offset = 0) {
388
7.39k
  size_t store_size = sizeof(value) - offset;
389
7.39k
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
7.39k
  const char *value_data = reinterpret_cast<const char *>(&value);
392
7.39k
  memcpy(buffer_ptr, value_data + offset, store_size);
393
7.39k
  buffer_ptr += store_size;
394
7.39k
  return true;
395
7.39k
}
bool llvm::hashing::detail::store_and_advance<unsigned char>(char*&, char*, unsigned char const&, unsigned long)
Line
Count
Source
387
35.6M
                       size_t offset = 0) {
388
35.6M
  size_t store_size = sizeof(value) - offset;
389
35.6M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
35.6M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
35.6M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
35.6M
  buffer_ptr += store_size;
394
35.6M
  return true;
395
35.6M
}
bool llvm::hashing::detail::store_and_advance<unsigned short>(char*&, char*, unsigned short const&, unsigned long)
Line
Count
Source
387
16.7M
                       size_t offset = 0) {
388
16.7M
  size_t store_size = sizeof(value) - offset;
389
16.7M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
16.7M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
16.7M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
16.7M
  buffer_ptr += store_size;
394
16.7M
  return true;
395
16.7M
}
bool llvm::hashing::detail::store_and_advance<llvm::Type const*>(char*&, char*, llvm::Type const* const&, unsigned long)
Line
Count
Source
387
6.59M
                       size_t offset = 0) {
388
6.59M
  size_t store_size = sizeof(value) - offset;
389
6.59M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
6.59M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
6.59M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
6.59M
  buffer_ptr += store_size;
394
6.59M
  return true;
395
6.59M
}
bool llvm::hashing::detail::store_and_advance<llvm::Metadata*>(char*&, char*, llvm::Metadata* const&, unsigned long)
Line
Count
Source
387
32.3M
                       size_t offset = 0) {
388
32.3M
  size_t store_size = sizeof(value) - offset;
389
32.3M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
32.3M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
32.3M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
32.3M
  buffer_ptr += store_size;
394
32.3M
  return true;
395
32.3M
}
bool llvm::hashing::detail::store_and_advance<llvm::MDString*>(char*&, char*, llvm::MDString* const&, unsigned long)
Line
Count
Source
387
84.4k
                       size_t offset = 0) {
388
84.4k
  size_t store_size = sizeof(value) - offset;
389
84.4k
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
84.4k
  const char *value_data = reinterpret_cast<const char *>(&value);
392
84.4k
  memcpy(buffer_ptr, value_data + offset, store_size);
393
84.4k
  buffer_ptr += store_size;
394
84.4k
  return true;
395
84.4k
}
bool llvm::hashing::detail::store_and_advance<unsigned long long>(char*&, char*, unsigned long long const&, unsigned long)
Line
Count
Source
387
219M
                       size_t offset = 0) {
388
219M
  size_t store_size = sizeof(value) - offset;
389
219M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
219M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
219M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
219M
  buffer_ptr += store_size;
394
219M
  return true;
395
219M
}
bool llvm::hashing::detail::store_and_advance<llvm::ArrayType*>(char*&, char*, llvm::ArrayType* const&, unsigned long)
Line
Count
Source
387
37.0k
                       size_t offset = 0) {
388
37.0k
  size_t store_size = sizeof(value) - offset;
389
37.0k
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
37.0k
  const char *value_data = reinterpret_cast<const char *>(&value);
392
37.0k
  memcpy(buffer_ptr, value_data + offset, store_size);
393
37.0k
  buffer_ptr += store_size;
394
37.0k
  return true;
395
37.0k
}
bool llvm::hashing::detail::store_and_advance<llvm::StructType*>(char*&, char*, llvm::StructType* const&, unsigned long)
Line
Count
Source
387
121k
                       size_t offset = 0) {
388
121k
  size_t store_size = sizeof(value) - offset;
389
121k
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
121k
  const char *value_data = reinterpret_cast<const char *>(&value);
392
121k
  memcpy(buffer_ptr, value_data + offset, store_size);
393
121k
  buffer_ptr += store_size;
394
121k
  return true;
395
121k
}
bool llvm::hashing::detail::store_and_advance<llvm::VectorType*>(char*&, char*, llvm::VectorType* const&, unsigned long)
Line
Count
Source
387
175k
                       size_t offset = 0) {
388
175k
  size_t store_size = sizeof(value) - offset;
389
175k
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
175k
  const char *value_data = reinterpret_cast<const char *>(&value);
392
175k
  memcpy(buffer_ptr, value_data + offset, store_size);
393
175k
  buffer_ptr += store_size;
394
175k
  return true;
395
175k
}
bool llvm::hashing::detail::store_and_advance<llvm::Type*>(char*&, char*, llvm::Type* const&, unsigned long)
Line
Count
Source
387
55.8M
                       size_t offset = 0) {
388
55.8M
  size_t store_size = sizeof(value) - offset;
389
55.8M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
55.8M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
55.8M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
55.8M
  buffer_ptr += store_size;
394
55.8M
  return true;
395
55.8M
}
bool llvm::hashing::detail::store_and_advance<llvm::PointerType*>(char*&, char*, llvm::PointerType* const&, unsigned long)
Line
Count
Source
387
7.39k
                       size_t offset = 0) {
388
7.39k
  size_t store_size = sizeof(value) - offset;
389
7.39k
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
7.39k
  const char *value_data = reinterpret_cast<const char *>(&value);
392
7.39k
  memcpy(buffer_ptr, value_data + offset, store_size);
393
7.39k
  buffer_ptr += store_size;
394
7.39k
  return true;
395
7.39k
}
bool llvm::hashing::detail::store_and_advance<llvm::Metadata const*>(char*&, char*, llvm::Metadata const* const&, unsigned long)
Line
Count
Source
387
330k
                       size_t offset = 0) {
388
330k
  size_t store_size = sizeof(value) - offset;
389
330k
  if (buffer_ptr + store_size > buffer_end)
390
26.2k
    return false;
391
304k
  const char *value_data = reinterpret_cast<const char *>(&value);
392
304k
  memcpy(buffer_ptr, value_data + offset, store_size);
393
304k
  buffer_ptr += store_size;
394
304k
  return true;
395
304k
}
bool llvm::hashing::detail::store_and_advance<char>(char*&, char*, char const&, unsigned long)
Line
Count
Source
387
7
                       size_t offset = 0) {
388
7
  size_t store_size = sizeof(value) - offset;
389
7
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
7
  const char *value_data = reinterpret_cast<const char *>(&value);
392
7
  memcpy(buffer_ptr, value_data + offset, store_size);
393
7
  buffer_ptr += store_size;
394
7
  return true;
395
7
}
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::MemoryAccess const*>(char*&, char*, llvm::MemoryAccess const* const&, unsigned long)
bool llvm::hashing::detail::store_and_advance<llvm::Value*>(char*&, char*, llvm::Value* const&, unsigned long)
Line
Count
Source
387
129M
                       size_t offset = 0) {
388
129M
  size_t store_size = sizeof(value) - offset;
389
129M
  if (buffer_ptr + store_size > buffer_end)
390
512k
    return false;
391
128M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
128M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
128M
  buffer_ptr += store_size;
394
128M
  return true;
395
128M
}
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::Constant*>(char*&, char*, llvm::Constant* const&, unsigned long)
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::Instruction*>(char*&, char*, llvm::Instruction* const&, unsigned long)
bool llvm::hashing::detail::store_and_advance<llvm::MCSymbol const*>(char*&, char*, llvm::MCSymbol const* const&, unsigned long)
Line
Count
Source
387
30.8k
                       size_t offset = 0) {
388
30.8k
  size_t store_size = sizeof(value) - offset;
389
30.8k
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
30.8k
  const char *value_data = reinterpret_cast<const char *>(&value);
392
30.8k
  memcpy(buffer_ptr, value_data + offset, store_size);
393
30.8k
  buffer_ptr += store_size;
394
30.8k
  return true;
395
30.8k
}
bool llvm::hashing::detail::store_and_advance<llvm::Instruction::BinaryOps>(char*&, char*, llvm::Instruction::BinaryOps const&, unsigned long)
Line
Count
Source
387
7.28M
                       size_t offset = 0) {
388
7.28M
  size_t store_size = sizeof(value) - offset;
389
7.28M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
7.28M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
7.28M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
7.28M
  buffer_ptr += store_size;
394
7.28M
  return true;
395
7.28M
}
bool llvm::hashing::detail::store_and_advance<llvm::CmpInst::Predicate>(char*&, char*, llvm::CmpInst::Predicate const&, unsigned long)
Line
Count
Source
387
12.6M
                       size_t offset = 0) {
388
12.6M
  size_t store_size = sizeof(value) - offset;
389
12.6M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
12.6M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
12.6M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
12.6M
  buffer_ptr += store_size;
394
12.6M
  return true;
395
12.6M
}
bool llvm::hashing::detail::store_and_advance<llvm::SelectPatternFlavor>(char*&, char*, llvm::SelectPatternFlavor const&, unsigned long)
Line
Count
Source
387
215k
                       size_t offset = 0) {
388
215k
  size_t store_size = sizeof(value) - offset;
389
215k
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
215k
  const char *value_data = reinterpret_cast<const char *>(&value);
392
215k
  memcpy(buffer_ptr, value_data + offset, store_size);
393
215k
  buffer_ptr += store_size;
394
215k
  return true;
395
215k
}
bool llvm::hashing::detail::store_and_advance<llvm::Instruction::CastOps>(char*&, char*, llvm::Instruction::CastOps const&, unsigned long)
Line
Count
Source
387
8.13M
                       size_t offset = 0) {
388
8.13M
  size_t store_size = sizeof(value) - offset;
389
8.13M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
8.13M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
8.13M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
8.13M
  buffer_ptr += store_size;
394
8.13M
  return true;
395
8.13M
}
bool llvm::hashing::detail::store_and_advance<short>(char*&, char*, short const&, unsigned long)
Line
Count
Source
387
925k
                       size_t offset = 0) {
388
925k
  size_t store_size = sizeof(value) - offset;
389
925k
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
925k
  const char *value_data = reinterpret_cast<const char *>(&value);
392
925k
  memcpy(buffer_ptr, value_data + offset, store_size);
393
925k
  buffer_ptr += store_size;
394
925k
  return true;
395
925k
}
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<llvm::fltSemantics const*>(char*&, char*, llvm::fltSemantics const* const&, unsigned long)
bool llvm::hashing::detail::store_and_advance<llvm::Value const*>(char*&, char*, llvm::Value const* const&, unsigned long)
Line
Count
Source
387
670k
                       size_t offset = 0) {
388
670k
  size_t store_size = sizeof(value) - offset;
389
670k
  if (buffer_ptr + store_size > buffer_end)
390
846
    return false;
391
670k
  const char *value_data = reinterpret_cast<const char *>(&value);
392
670k
  memcpy(buffer_ptr, value_data + offset, store_size);
393
670k
  buffer_ptr += store_size;
394
670k
  return true;
395
670k
}
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<void*>(char*&, char*, void* const&, unsigned long)
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<clang::NestedNameSpecifier*>(char*&, char*, clang::NestedNameSpecifier* const&, unsigned long)
bool llvm::hashing::detail::store_and_advance<llvm::RegisterBankInfo::ValueMapping const*>(char*&, char*, llvm::RegisterBankInfo::ValueMapping const* const&, unsigned long)
Line
Count
Source
387
14.3M
                       size_t offset = 0) {
388
14.3M
  size_t store_size = sizeof(value) - offset;
389
14.3M
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
14.3M
  const char *value_data = reinterpret_cast<const char *>(&value);
392
14.3M
  memcpy(buffer_ptr, value_data + offset, store_size);
393
14.3M
  buffer_ptr += store_size;
394
14.3M
  return true;
395
14.3M
}
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<long>(char*&, char*, long const&, unsigned long)
Unexecuted instantiation: bool llvm::hashing::detail::store_and_advance<clang::IdentifierInfo const*>(char*&, char*, clang::IdentifierInfo const* const&, unsigned long)
bool llvm::hashing::detail::store_and_advance<lld::DefinedAtom::ContentType>(char*&, char*, lld::DefinedAtom::ContentType const&, unsigned long)
Line
Count
Source
387
54
                       size_t offset = 0) {
388
54
  size_t store_size = sizeof(value) - offset;
389
54
  if (buffer_ptr + store_size > buffer_end)
390
0
    return false;
391
54
  const char *value_data = reinterpret_cast<const char *>(&value);
392
54
  memcpy(buffer_ptr, value_data + offset, store_size);
393
54
  buffer_ptr += store_size;
394
54
  return true;
395
54
}
396
397
/// Implement the combining of integral values into a hash_code.
398
///
399
/// This overload is selected when the value type of the iterator is
400
/// integral. Rather than computing a hash_code for each object and then
401
/// combining them, this (as an optimization) directly combines the integers.
402
template <typename InputIteratorT>
403
25.9M
hash_code hash_combine_range_impl(InputIteratorT first, InputIteratorT last) {
404
25.9M
  const uint64_t seed = get_execution_seed();
405
25.9M
  char buffer[64], *buffer_ptr = buffer;
406
25.9M
  char *const buffer_end = std::end(buffer);
407
104M
  while (first != last && store_and_advance(buffer_ptr, buffer_end,
408
78.6M
                                            get_hashable_data(*first)))
409
78.2M
    ++first;
410
25.9M
  if (first == last)
411
25.5M
    return hash_short(buffer, buffer_ptr - buffer, seed);
412
358k
  assert(buffer_ptr == buffer_end);
413
358k
414
358k
  hash_state state = state.create(buffer, seed);
415
358k
  size_t length = 64;
416
898k
  while (first != last) {
417
539k
    // Fill up the buffer. We don't clear it, which re-mixes the last round
418
539k
    // when only a partial 64-byte chunk is left.
419
539k
    buffer_ptr = buffer;
420
3.18M
    while (first != last && store_and_advance(buffer_ptr, buffer_end,
421
2.82M
                                              get_hashable_data(*first)))
422
2.64M
      ++first;
423
539k
424
539k
    // Rotate the buffer if we did a partial fill in order to simulate doing
425
539k
    // a mix of the last 64-bytes. That is how the algorithm works when we
426
539k
    // have a contiguous byte sequence, and we want to emulate that here.
427
539k
    std::rotate(buffer, buffer_ptr, buffer_end);
428
539k
429
539k
    // Mix this chunk into the current state.
430
539k
    state.mix(buffer);
431
539k
    length += buffer_ptr - buffer;
432
539k
  };
433
358k
434
358k
  return state.finalize(length);
435
358k
}
llvm::hash_code llvm::hashing::detail::hash_combine_range_impl<llvm::MDOperand const*>(llvm::MDOperand const*, llvm::MDOperand const*)
Line
Count
Source
403
23.2k
hash_code hash_combine_range_impl(InputIteratorT first, InputIteratorT last) {
404
23.2k
  const uint64_t seed = get_execution_seed();
405
23.2k
  char buffer[64], *buffer_ptr = buffer;
406
23.2k
  char *const buffer_end = std::end(buffer);
407
153k
  while (first != last && store_and_advance(buffer_ptr, buffer_end,
408
136k
                                            get_hashable_data(*first)))
409
130k
    ++first;
410
23.2k
  if (first == last)
411
16.8k
    return hash_short(buffer, buffer_ptr - buffer, seed);
412
6.47k
  assert(buffer_ptr == buffer_end);
413
6.47k
414
6.47k
  hash_state state = state.create(buffer, seed);
415
6.47k
  size_t length = 64;
416
32.7k
  while (first != last) {
417
26.2k
    // Fill up the buffer. We don't clear it, which re-mixes the last round
418
26.2k
    // when only a partial 64-byte chunk is left.
419
26.2k
    buffer_ptr = buffer;
420
200k
    while (first != last && store_and_advance(buffer_ptr, buffer_end,
421
194k
                                              get_hashable_data(*first)))
422
174k
      ++first;
423
26.2k
424
26.2k
    // Rotate the buffer if we did a partial fill in order to simulate doing
425
26.2k
    // a mix of the last 64-bytes. That is how the algorithm works when we
426
26.2k
    // have a contiguous byte sequence, and we want to emulate that here.
427
26.2k
    std::rotate(buffer, buffer_ptr, buffer_end);
428
26.2k
429
26.2k
    // Mix this chunk into the current state.
430
26.2k
    state.mix(buffer);
431
26.2k
    length += buffer_ptr - buffer;
432
26.2k
  };
433
6.47k
434
6.47k
  return state.finalize(length);
435
6.47k
}
llvm::hash_code llvm::hashing::detail::hash_combine_range_impl<std::__1::__wrap_iter<char const*> >(std::__1::__wrap_iter<char const*>, std::__1::__wrap_iter<char const*>)
Line
Count
Source
403
2
hash_code hash_combine_range_impl(InputIteratorT first, InputIteratorT last) {
404
2
  const uint64_t seed = get_execution_seed();
405
2
  char buffer[64], *buffer_ptr = buffer;
406
2
  char *const buffer_end = std::end(buffer);
407
9
  while (first != last && store_and_advance(buffer_ptr, buffer_end,
408
7
                                            get_hashable_data(*first)))
409
7
    ++first;
410
2
  if (first == last)
411
2
    return hash_short(buffer, buffer_ptr - buffer, seed);
412
0
  assert(buffer_ptr == buffer_end);
413
0
414
0
  hash_state state = state.create(buffer, seed);
415
0
  size_t length = 64;
416
0
  while (first != last) {
417
0
    // Fill up the buffer. We don't clear it, which re-mixes the last round
418
0
    // when only a partial 64-byte chunk is left.
419
0
    buffer_ptr = buffer;
420
0
    while (first != last && store_and_advance(buffer_ptr, buffer_end,
421
0
                                              get_hashable_data(*first)))
422
0
      ++first;
423
0
424
0
    // Rotate the buffer if we did a partial fill in order to simulate doing
425
0
    // a mix of the last 64-bytes. That is how the algorithm works when we
426
0
    // have a contiguous byte sequence, and we want to emulate that here.
427
0
    std::rotate(buffer, buffer_ptr, buffer_end);
428
0
429
0
    // Mix this chunk into the current state.
430
0
    state.mix(buffer);
431
0
    length += buffer_ptr - buffer;
432
0
  };
433
0
434
0
  return state.finalize(length);
435
0
}
llvm::hash_code llvm::hashing::detail::hash_combine_range_impl<llvm::User::value_op_iterator>(llvm::User::value_op_iterator, llvm::User::value_op_iterator)
Line
Count
Source
403
25.6M
hash_code hash_combine_range_impl(InputIteratorT first, InputIteratorT last) {
404
25.6M
  const uint64_t seed = get_execution_seed();
405
25.6M
  char buffer[64], *buffer_ptr = buffer;
406
25.6M
  char *const buffer_end = std::end(buffer);
407
103M
  while (first != last && store_and_advance(buffer_ptr, buffer_end,
408
77.7M
                                            get_hashable_data(*first)))
409
77.4M
    ++first;
410
25.6M
  if (first == last)
411
25.2M
    return hash_short(buffer, buffer_ptr - buffer, seed);
412
351k
  assert(buffer_ptr == buffer_end);
413
351k
414
351k
  hash_state state = state.create(buffer, seed);
415
351k
  size_t length = 64;
416
863k
  while (first != last) {
417
512k
    // Fill up the buffer. We don't clear it, which re-mixes the last round
418
512k
    // when only a partial 64-byte chunk is left.
419
512k
    buffer_ptr = buffer;
420
2.98M
    while (first != last && store_and_advance(buffer_ptr, buffer_end,
421
2.63M
                                              get_hashable_data(*first)))
422
2.47M
      ++first;
423
512k
424
512k
    // Rotate the buffer if we did a partial fill in order to simulate doing
425
512k
    // a mix of the last 64-bytes. That is how the algorithm works when we
426
512k
    // have a contiguous byte sequence, and we want to emulate that here.
427
512k
    std::rotate(buffer, buffer_ptr, buffer_end);
428
512k
429
512k
    // Mix this chunk into the current state.
430
512k
    state.mix(buffer);
431
512k
    length += buffer_ptr - buffer;
432
512k
  };
433
351k
434
351k
  return state.finalize(length);
435
351k
}
llvm::hash_code llvm::hashing::detail::hash_combine_range_impl<llvm::User::const_value_op_iterator>(llvm::User::const_value_op_iterator, llvm::User::const_value_op_iterator)
Line
Count
Source
403
259k
hash_code hash_combine_range_impl(InputIteratorT first, InputIteratorT last) {
404
259k
  const uint64_t seed = get_execution_seed();
405
259k
  char buffer[64], *buffer_ptr = buffer;
406
259k
  char *const buffer_end = std::end(buffer);
407
927k
  while (first != last && store_and_advance(buffer_ptr, buffer_end,
408
669k
                                            get_hashable_data(*first)))
409
668k
    ++first;
410
259k
  if (first == last)
411
258k
    return hash_short(buffer, buffer_ptr - buffer, seed);
412
846
  assert(buffer_ptr == buffer_end);
413
846
414
846
  hash_state state = state.create(buffer, seed);
415
846
  size_t length = 64;
416
1.69k
  while (first != last) {
417
846
    // Fill up the buffer. We don't clear it, which re-mixes the last round
418
846
    // when only a partial 64-byte chunk is left.
419
846
    buffer_ptr = buffer;
420
2.44k
    while (first != last && store_and_advance(buffer_ptr, buffer_end,
421
1.60k
                                              get_hashable_data(*first)))
422
1.60k
      ++first;
423
846
424
846
    // Rotate the buffer if we did a partial fill in order to simulate doing
425
846
    // a mix of the last 64-bytes. That is how the algorithm works when we
426
846
    // have a contiguous byte sequence, and we want to emulate that here.
427
846
    std::rotate(buffer, buffer_ptr, buffer_end);
428
846
429
846
    // Mix this chunk into the current state.
430
846
    state.mix(buffer);
431
846
    length += buffer_ptr - buffer;
432
846
  };
433
846
434
846
  return state.finalize(length);
435
846
}
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_range_impl<llvm::StringRef const*>(llvm::StringRef const*, llvm::StringRef const*)
Unexecuted instantiation: ItaniumCXXABI.cpp:llvm::hash_code llvm::hashing::detail::hash_combine_range_impl<(anonymous namespace)::DecompositionDeclName::Iterator>((anonymous namespace)::DecompositionDeclName::Iterator, (anonymous namespace)::DecompositionDeclName::Iterator)
436
437
/// Implement the combining of integral values into a hash_code.
438
///
439
/// This overload is selected when the value type of the iterator is integral
440
/// and when the input iterator is actually a pointer. Rather than computing
441
/// a hash_code for each object and then combining them, this (as an
442
/// optimization) directly combines the integers. Also, because the integers
443
/// are stored in contiguous memory, this routine avoids copying each value
444
/// and directly reads from the underlying memory.
445
template <typename ValueT>
446
typename std::enable_if<is_hashable_data<ValueT>::value, hash_code>::type
447
630M
hash_combine_range_impl(ValueT *first, ValueT *last) {
448
630M
  const uint64_t seed = get_execution_seed();
449
630M
  const char *s_begin = reinterpret_cast<const char *>(first);
450
630M
  const char *s_end = reinterpret_cast<const char *>(last);
451
630M
  const size_t length = std::distance(s_begin, s_end);
452
630M
  if (length <= 64)
453
611M
    return hash_short(s_begin, length, seed);
454
18.7M
455
18.7M
  const char *s_aligned_end = s_begin + (length & ~63);
456
18.7M
  hash_state state = state.create(s_begin, seed);
457
18.7M
  s_begin += 64;
458
34.3M
  while (s_begin != s_aligned_end) {
459
15.5M
    state.mix(s_begin);
460
15.5M
    s_begin += 64;
461
15.5M
  }
462
18.7M
  if (length & 63)
463
18.4M
    state.mix(s_end - 64);
464
18.7M
465
18.7M
  return state.finalize(length);
466
18.7M
}
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<unsigned int>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<unsigned int>(unsigned int*, unsigned int*)
std::__1::enable_if<is_hashable_data<unsigned long>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<unsigned long>(unsigned long*, unsigned long*)
Line
Count
Source
447
20.5M
hash_combine_range_impl(ValueT *first, ValueT *last) {
448
20.5M
  const uint64_t seed = get_execution_seed();
449
20.5M
  const char *s_begin = reinterpret_cast<const char *>(first);
450
20.5M
  const char *s_end = reinterpret_cast<const char *>(last);
451
20.5M
  const size_t length = std::distance(s_begin, s_end);
452
20.5M
  if (length <= 64)
453
20.0M
    return hash_short(s_begin, length, seed);
454
480k
455
480k
  const char *s_aligned_end = s_begin + (length & ~63);
456
480k
  hash_state state = state.create(s_begin, seed);
457
480k
  s_begin += 64;
458
507k
  while (s_begin != s_aligned_end) {
459
27.3k
    state.mix(s_begin);
460
27.3k
    s_begin += 64;
461
27.3k
  }
462
480k
  if (length & 63)
463
480k
    state.mix(s_end - 64);
464
480k
465
480k
  return state.finalize(length);
466
480k
}
std::__1::enable_if<is_hashable_data<llvm::Constant* const>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<llvm::Constant* const>(llvm::Constant* const*, llvm::Constant* const*)
Line
Count
Source
447
17.0M
hash_combine_range_impl(ValueT *first, ValueT *last) {
448
17.0M
  const uint64_t seed = get_execution_seed();
449
17.0M
  const char *s_begin = reinterpret_cast<const char *>(first);
450
17.0M
  const char *s_end = reinterpret_cast<const char *>(last);
451
17.0M
  const size_t length = std::distance(s_begin, s_end);
452
17.0M
  if (length <= 64)
453
17.0M
    return hash_short(s_begin, length, seed);
454
26.6k
455
26.6k
  const char *s_aligned_end = s_begin + (length & ~63);
456
26.6k
  hash_state state = state.create(s_begin, seed);
457
26.6k
  s_begin += 64;
458
44.8k
  while (s_begin != s_aligned_end) {
459
18.2k
    state.mix(s_begin);
460
18.2k
    s_begin += 64;
461
18.2k
  }
462
26.6k
  if (length & 63)
463
17.0k
    state.mix(s_end - 64);
464
26.6k
465
26.6k
  return state.finalize(length);
466
26.6k
}
std::__1::enable_if<is_hashable_data<unsigned int const>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<unsigned int const>(unsigned int const*, unsigned int const*)
Line
Count
Source
447
540M
hash_combine_range_impl(ValueT *first, ValueT *last) {
448
540M
  const uint64_t seed = get_execution_seed();
449
540M
  const char *s_begin = reinterpret_cast<const char *>(first);
450
540M
  const char *s_end = reinterpret_cast<const char *>(last);
451
540M
  const size_t length = std::distance(s_begin, s_end);
452
540M
  if (length <= 64)
453
522M
    return hash_short(s_begin, length, seed);
454
17.9M
455
17.9M
  const char *s_aligned_end = s_begin + (length & ~63);
456
17.9M
  hash_state state = state.create(s_begin, seed);
457
17.9M
  s_begin += 64;
458
33.0M
  while (s_begin != s_aligned_end) {
459
15.1M
    state.mix(s_begin);
460
15.1M
    s_begin += 64;
461
15.1M
  }
462
17.9M
  if (length & 63)
463
17.5M
    state.mix(s_end - 64);
464
17.9M
465
17.9M
  return state.finalize(length);
466
17.9M
}
std::__1::enable_if<is_hashable_data<llvm::Type* const>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<llvm::Type* const>(llvm::Type* const*, llvm::Type* const*)
Line
Count
Source
447
6.67M
hash_combine_range_impl(ValueT *first, ValueT *last) {
448
6.67M
  const uint64_t seed = get_execution_seed();
449
6.67M
  const char *s_begin = reinterpret_cast<const char *>(first);
450
6.67M
  const char *s_end = reinterpret_cast<const char *>(last);
451
6.67M
  const size_t length = std::distance(s_begin, s_end);
452
6.67M
  if (length <= 64)
453
6.65M
    return hash_short(s_begin, length, seed);
454
24.8k
455
24.8k
  const char *s_aligned_end = s_begin + (length & ~63);
456
24.8k
  hash_state state = state.create(s_begin, seed);
457
24.8k
  s_begin += 64;
458
36.6k
  while (s_begin != s_aligned_end) {
459
11.8k
    state.mix(s_begin);
460
11.8k
    s_begin += 64;
461
11.8k
  }
462
24.8k
  if (length & 63)
463
24.8k
    state.mix(s_end - 64);
464
24.8k
465
24.8k
  return state.finalize(length);
466
24.8k
}
std::__1::enable_if<is_hashable_data<unsigned long long const>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<unsigned long long const>(unsigned long long const*, unsigned long long const*)
Line
Count
Source
447
926k
hash_combine_range_impl(ValueT *first, ValueT *last) {
448
926k
  const uint64_t seed = get_execution_seed();
449
926k
  const char *s_begin = reinterpret_cast<const char *>(first);
450
926k
  const char *s_end = reinterpret_cast<const char *>(last);
451
926k
  const size_t length = std::distance(s_begin, s_end);
452
926k
  if (length <= 64)
453
926k
    return hash_short(s_begin, length, seed);
454
0
455
0
  const char *s_aligned_end = s_begin + (length & ~63);
456
0
  hash_state state = state.create(s_begin, seed);
457
0
  s_begin += 64;
458
0
  while (s_begin != s_aligned_end) {
459
0
    state.mix(s_begin);
460
0
    s_begin += 64;
461
0
  }
462
0
  if (length & 63)
463
0
    state.mix(s_end - 64);
464
0
465
0
  return state.finalize(length);
466
0
}
std::__1::enable_if<is_hashable_data<llvm::Metadata* const>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<llvm::Metadata* const>(llvm::Metadata* const*, llvm::Metadata* const*)
Line
Count
Source
447
1.25M
hash_combine_range_impl(ValueT *first, ValueT *last) {
448
1.25M
  const uint64_t seed = get_execution_seed();
449
1.25M
  const char *s_begin = reinterpret_cast<const char *>(first);
450
1.25M
  const char *s_end = reinterpret_cast<const char *>(last);
451
1.25M
  const size_t length = std::distance(s_begin, s_end);
452
1.25M
  if (length <= 64)
453
1.21M
    return hash_short(s_begin, length, seed);
454
39.0k
455
39.0k
  const char *s_aligned_end = s_begin + (length & ~63);
456
39.0k
  hash_state state = state.create(s_begin, seed);
457
39.0k
  s_begin += 64;
458
105k
  while (s_begin != s_aligned_end) {
459
66.2k
    state.mix(s_begin);
460
66.2k
    s_begin += 64;
461
66.2k
  }
462
39.0k
  if (length & 63)
463
38.7k
    state.mix(s_end - 64);
464
39.0k
465
39.0k
  return state.finalize(length);
466
39.0k
}
Unexecuted instantiation: std::__1::enable_if<is_hashable_data<llvm::Value* const>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<llvm::Value* const>(llvm::Value* const*, llvm::Value* const*)
std::__1::enable_if<is_hashable_data<llvm::SCEV const* const>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<llvm::SCEV const* const>(llvm::SCEV const* const*, llvm::SCEV const* const*)
Line
Count
Source
447
18.0M
hash_combine_range_impl(ValueT *first, ValueT *last) {
448
18.0M
  const uint64_t seed = get_execution_seed();
449
18.0M
  const char *s_begin = reinterpret_cast<const char *>(first);
450
18.0M
  const char *s_end = reinterpret_cast<const char *>(last);
451
18.0M
  const size_t length = std::distance(s_begin, s_end);
452
18.0M
  if (length <= 64)
453
18.0M
    return hash_short(s_begin, length, seed);
454
0
455
0
  const char *s_aligned_end = s_begin + (length & ~63);
456
0
  hash_state state = state.create(s_begin, seed);
457
0
  s_begin += 64;
458
0
  while (s_begin != s_aligned_end) {
459
0
    state.mix(s_begin);
460
0
    s_begin += 64;
461
0
  }
462
0
  if (length & 63)
463
0
    state.mix(s_end - 64);
464
0
465
0
  return state.finalize(length);
466
0
}
std::__1::enable_if<is_hashable_data<unsigned long long>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<unsigned long long>(unsigned long long*, unsigned long long*)
Line
Count
Source
447
3.93M
hash_combine_range_impl(ValueT *first, ValueT *last) {
448
3.93M
  const uint64_t seed = get_execution_seed();
449
3.93M
  const char *s_begin = reinterpret_cast<const char *>(first);
450
3.93M
  const char *s_end = reinterpret_cast<const char *>(last);
451
3.93M
  const size_t length = std::distance(s_begin, s_end);
452
3.93M
  if (length <= 64)
453
3.93M
    return hash_short(s_begin, length, seed);
454
88
455
88
  const char *s_aligned_end = s_begin + (length & ~63);
456
88
  hash_state state = state.create(s_begin, seed);
457
88
  s_begin += 64;
458
176
  while (s_begin != s_aligned_end) {
459
88
    state.mix(s_begin);
460
88
    s_begin += 64;
461
88
  }
462
88
  if (length & 63)
463
0
    state.mix(s_end - 64);
464
88
465
88
  return state.finalize(length);
466
88
}
std::__1::enable_if<is_hashable_data<char const>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<char const>(char const*, char const*)
Line
Count
Source
447
5.20M
hash_combine_range_impl(ValueT *first, ValueT *last) {
448
5.20M
  const uint64_t seed = get_execution_seed();
449
5.20M
  const char *s_begin = reinterpret_cast<const char *>(first);
450
5.20M
  const char *s_end = reinterpret_cast<const char *>(last);
451
5.20M
  const size_t length = std::distance(s_begin, s_end);
452
5.20M
  if (length <= 64)
453
5.11M
    return hash_short(s_begin, length, seed);
454
92.8k
455
92.8k
  const char *s_aligned_end = s_begin + (length & ~63);
456
92.8k
  hash_state state = state.create(s_begin, seed);
457
92.8k
  s_begin += 64;
458
241k
  while (s_begin != s_aligned_end) {
459
148k
    state.mix(s_begin);
460
148k
    s_begin += 64;
461
148k
  }
462
92.8k
  if (length & 63)
463
92.0k
    state.mix(s_end - 64);
464
92.8k
465
92.8k
  return state.finalize(length);
466
92.8k
}
std::__1::enable_if<is_hashable_data<llvm::BasicBlock*>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<llvm::BasicBlock*>(llvm::BasicBlock**, llvm::BasicBlock**)
Line
Count
Source
447
8.25M
hash_combine_range_impl(ValueT *first, ValueT *last) {
448
8.25M
  const uint64_t seed = get_execution_seed();
449
8.25M
  const char *s_begin = reinterpret_cast<const char *>(first);
450
8.25M
  const char *s_end = reinterpret_cast<const char *>(last);
451
8.25M
  const size_t length = std::distance(s_begin, s_end);
452
8.25M
  if (length <= 64)
453
8.08M
    return hash_short(s_begin, length, seed);
454
171k
455
171k
  const char *s_aligned_end = s_begin + (length & ~63);
456
171k
  hash_state state = state.create(s_begin, seed);
457
171k
  s_begin += 64;
458
333k
  while (s_begin != s_aligned_end) {
459
161k
    state.mix(s_begin);
460
161k
    s_begin += 64;
461
161k
  }
462
171k
  if (length & 63)
463
166k
    state.mix(s_end - 64);
464
171k
465
171k
  return state.finalize(length);
466
171k
}
std::__1::enable_if<is_hashable_data<llvm::RegisterBankInfo::ValueMapping const* const>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<llvm::RegisterBankInfo::ValueMapping const* const>(llvm::RegisterBankInfo::ValueMapping const* const*, llvm::RegisterBankInfo::ValueMapping const* const*)
Line
Count
Source
447
7.76M
hash_combine_range_impl(ValueT *first, ValueT *last) {
448
7.76M
  const uint64_t seed = get_execution_seed();
449
7.76M
  const char *s_begin = reinterpret_cast<const char *>(first);
450
7.76M
  const char *s_end = reinterpret_cast<const char *>(last);
451
7.76M
  const size_t length = std::distance(s_begin, s_end);
452
7.76M
  if (length <= 64)
453
7.76M
    return hash_short(s_begin, length, seed);
454
476
455
476
  const char *s_aligned_end = s_begin + (length & ~63);
456
476
  hash_state state = state.create(s_begin, seed);
457
476
  s_begin += 64;
458
625
  while (s_begin != s_aligned_end) {
459
149
    state.mix(s_begin);
460
149
    s_begin += 64;
461
149
  }
462
476
  if (length & 63)
463
476
    state.mix(s_end - 64);
464
476
465
476
  return state.finalize(length);
466
476
}
std::__1::enable_if<is_hashable_data<unsigned char const>::value, llvm::hash_code>::type llvm::hashing::detail::hash_combine_range_impl<unsigned char const>(unsigned char const*, unsigned char const*)
Line
Count
Source
447
1.30k
hash_combine_range_impl(ValueT *first, ValueT *last) {
448
1.30k
  const uint64_t seed = get_execution_seed();
449
1.30k
  const char *s_begin = reinterpret_cast<const char *>(first);
450
1.30k
  const char *s_end = reinterpret_cast<const char *>(last);
451
1.30k
  const size_t length = std::distance(s_begin, s_end);
452
1.30k
  if (length <= 64)
453
1.03k
    return hash_short(s_begin, length, seed);
454
272
455
272
  const char *s_aligned_end = s_begin + (length & ~63);
456
272
  hash_state state = state.create(s_begin, seed);
457
272
  s_begin += 64;
458
520
  while (s_begin != s_aligned_end) {
459
248
    state.mix(s_begin);
460
248
    s_begin += 64;
461
248
  }
462
272
  if (length & 63)
463
243
    state.mix(s_end - 64);
464
272
465
272
  return state.finalize(length);
466
272
}
467
468
} // namespace detail
469
} // namespace hashing
470
471
472
/// Compute a hash_code for a sequence of values.
473
///
474
/// This hashes a sequence of values. It produces the same hash_code as
475
/// 'hash_combine(a, b, c, ...)', but can run over arbitrary sized sequences
476
/// and is significantly faster given pointers and types which can be hashed as
477
/// a sequence of bytes.
478
template <typename InputIteratorT>
479
656M
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
656M
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
656M
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine_range<unsigned int*>(unsigned int*, unsigned int*)
llvm::hash_code llvm::hash_combine_range<unsigned long*>(unsigned long*, unsigned long*)
Line
Count
Source
479
20.5M
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
20.5M
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
20.5M
}
llvm::hash_code llvm::hash_combine_range<llvm::Constant* const*>(llvm::Constant* const*, llvm::Constant* const*)
Line
Count
Source
479
17.0M
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
17.0M
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
17.0M
}
llvm::hash_code llvm::hash_combine_range<unsigned int const*>(unsigned int const*, unsigned int const*)
Line
Count
Source
479
540M
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
540M
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
540M
}
llvm::hash_code llvm::hash_combine_range<llvm::Type* const*>(llvm::Type* const*, llvm::Type* const*)
Line
Count
Source
479
6.67M
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
6.67M
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
6.67M
}
llvm::hash_code llvm::hash_combine_range<unsigned long long const*>(unsigned long long const*, unsigned long long const*)
Line
Count
Source
479
926k
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
926k
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
926k
}
llvm::hash_code llvm::hash_combine_range<llvm::MDOperand const*>(llvm::MDOperand const*, llvm::MDOperand const*)
Line
Count
Source
479
23.2k
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
23.2k
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
23.2k
}
llvm::hash_code llvm::hash_combine_range<llvm::Metadata* const*>(llvm::Metadata* const*, llvm::Metadata* const*)
Line
Count
Source
479
1.25M
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
1.25M
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
1.25M
}
llvm::hash_code llvm::hash_combine_range<std::__1::__wrap_iter<char const*> >(std::__1::__wrap_iter<char const*>, std::__1::__wrap_iter<char const*>)
Line
Count
Source
479
2
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
2
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
2
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine_range<llvm::Value* const*>(llvm::Value* const*, llvm::Value* const*)
llvm::hash_code llvm::hash_combine_range<llvm::User::value_op_iterator>(llvm::User::value_op_iterator, llvm::User::value_op_iterator)
Line
Count
Source
479
25.6M
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
25.6M
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
25.6M
}
llvm::hash_code llvm::hash_combine_range<llvm::SCEV const* const*>(llvm::SCEV const* const*, llvm::SCEV const* const*)
Line
Count
Source
479
18.0M
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
18.0M
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
18.0M
}
llvm::hash_code llvm::hash_combine_range<unsigned long long*>(unsigned long long*, unsigned long long*)
Line
Count
Source
479
3.93M
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
3.93M
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
3.93M
}
llvm::hash_code llvm::hash_combine_range<char const*>(char const*, char const*)
Line
Count
Source
479
5.20M
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
5.20M
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
5.20M
}
llvm::hash_code llvm::hash_combine_range<llvm::BasicBlock**>(llvm::BasicBlock**, llvm::BasicBlock**)
Line
Count
Source
479
8.25M
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
8.25M
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
8.25M
}
llvm::hash_code llvm::hash_combine_range<llvm::User::const_value_op_iterator>(llvm::User::const_value_op_iterator, llvm::User::const_value_op_iterator)
Line
Count
Source
479
259k
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
259k
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
259k
}
llvm::hash_code llvm::hash_combine_range<llvm::RegisterBankInfo::ValueMapping const* const*>(llvm::RegisterBankInfo::ValueMapping const* const*, llvm::RegisterBankInfo::ValueMapping const* const*)
Line
Count
Source
479
7.76M
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
7.76M
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
7.76M
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine_range<llvm::StringRef const*>(llvm::StringRef const*, llvm::StringRef const*)
Unexecuted instantiation: ItaniumCXXABI.cpp:llvm::hash_code llvm::hash_combine_range<(anonymous namespace)::DecompositionDeclName::Iterator>((anonymous namespace)::DecompositionDeclName::Iterator, (anonymous namespace)::DecompositionDeclName::Iterator)
llvm::hash_code llvm::hash_combine_range<unsigned char const*>(unsigned char const*, unsigned char const*)
Line
Count
Source
479
1.30k
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
480
1.30k
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
481
1.30k
}
482
483
484
// Implementation details for hash_combine.
485
namespace hashing {
486
namespace detail {
487
488
/// Helper class to manage the recursive combining of hash_combine
489
/// arguments.
490
///
491
/// This class exists to manage the state and various calls involved in the
492
/// recursive combining of arguments used in hash_combine. It is particularly
493
/// useful at minimizing the code in the recursive calls to ease the pain
494
/// caused by a lack of variadic functions.
495
struct hash_combine_recursive_helper {
496
  char buffer[64];
497
  hash_state state;
498
  const uint64_t seed;
499
500
public:
501
  /// Construct a recursive hash combining helper.
502
  ///
503
  /// This sets up the state for a recursive hash combine, including getting
504
  /// the seed and buffer setup.
505
  hash_combine_recursive_helper()
506
440M
    : seed(get_execution_seed()) {}
507
508
  /// Combine one chunk of data into the current in-flight hash.
509
  ///
510
  /// This merges one chunk of data into the hash. First it tries to buffer
511
  /// the data. If the buffer is full, it hashes the buffer into its
512
  /// hash_state, empties it, and then merges the new chunk in. This also
513
  /// handles cases where the data straddles the end of the buffer.
514
  template <typename T>
515
956M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
956M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
956M
    }
546
956M
    return buffer_ptr;
547
956M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<unsigned int>(unsigned long&, char*, char*, unsigned int)
Line
Count
Source
515
256M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
256M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
256M
    }
546
256M
    return buffer_ptr;
547
256M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<unsigned long>(unsigned long&, char*, char*, unsigned long)
Line
Count
Source
515
107M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
107M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
107M
    }
546
107M
    return buffer_ptr;
547
107M
  }
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::coverage::CounterExpression::ExprKind>(unsigned long&, char*, char*, llvm::coverage::CounterExpression::ExprKind)
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::coverage::Counter::CounterKind>(unsigned long&, char*, char*, llvm::coverage::Counter::CounterKind)
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Loop const*>(unsigned long&, char*, char*, llvm::Loop const*)
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::BasicBlock*>(unsigned long&, char*, char*, llvm::BasicBlock*)
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<bool>(unsigned long&, char*, char*, bool)
Line
Count
Source
515
45.8M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
45.8M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
45.8M
    }
546
45.8M
    return buffer_ptr;
547
45.8M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<int>(unsigned long&, char*, char*, int)
Line
Count
Source
515
906k
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
906k
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
906k
    }
546
906k
    return buffer_ptr;
547
906k
  }
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<char const*>(unsigned long&, char*, char*, char const*)
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::GlobalValue const*>(unsigned long&, char*, char*, llvm::GlobalValue const*)
Line
Count
Source
515
3.81M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
3.81M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
3.81M
    }
546
3.81M
    return buffer_ptr;
547
3.81M
  }
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::BlockAddress const*>(unsigned long&, char*, char*, llvm::BlockAddress const*)
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::MCSymbol*>(unsigned long&, char*, char*, llvm::MCSymbol*)
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::MachineBasicBlock*>(unsigned long&, char*, char*, llvm::MachineBasicBlock*)
Line
Count
Source
515
1.67M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
1.67M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
1.67M
    }
546
1.67M
    return buffer_ptr;
547
1.67M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::MachineOperand::MachineOperandType>(unsigned long&, char*, char*, llvm::MachineOperand::MachineOperandType)
Line
Count
Source
515
59.7M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
59.7M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
59.7M
    }
546
59.7M
    return buffer_ptr;
547
59.7M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<long long>(unsigned long&, char*, char*, long long)
Line
Count
Source
515
20.5M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
20.5M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
20.5M
    }
546
20.5M
    return buffer_ptr;
547
20.5M
  }
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::ConstantInt const*>(unsigned long&, char*, char*, llvm::ConstantInt const*)
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::ConstantFP const*>(unsigned long&, char*, char*, llvm::ConstantFP const*)
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<unsigned int const*>(unsigned long&, char*, char*, unsigned int const*)
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::MDNode const*>(unsigned long&, char*, char*, llvm::MDNode const*)
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Intrinsic::ID>(unsigned long&, char*, char*, llvm::Intrinsic::ID)
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::InlineAsm::AsmDialect>(unsigned long&, char*, char*, llvm::InlineAsm::AsmDialect)
Line
Count
Source
515
7.39k
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
7.39k
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
7.39k
    }
546
7.39k
    return buffer_ptr;
547
7.39k
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::FunctionType*>(unsigned long&, char*, char*, llvm::FunctionType*)
Line
Count
Source
515
7.39k
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
7.39k
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
7.39k
    }
546
7.39k
    return buffer_ptr;
547
7.39k
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<unsigned char>(unsigned long&, char*, char*, unsigned char)
Line
Count
Source
515
35.6M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
35.6M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
35.6M
    }
546
35.6M
    return buffer_ptr;
547
35.6M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<unsigned short>(unsigned long&, char*, char*, unsigned short)
Line
Count
Source
515
16.7M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
16.7M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
16.7M
    }
546
16.7M
    return buffer_ptr;
547
16.7M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Type const*>(unsigned long&, char*, char*, llvm::Type const*)
Line
Count
Source
515
6.59M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
6.59M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
6.59M
    }
546
6.59M
    return buffer_ptr;
547
6.59M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Metadata*>(unsigned long&, char*, char*, llvm::Metadata*)
Line
Count
Source
515
32.3M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
32.3M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
32.3M
    }
546
32.3M
    return buffer_ptr;
547
32.3M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::MDString*>(unsigned long&, char*, char*, llvm::MDString*)
Line
Count
Source
515
84.4k
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
84.4k
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
84.4k
    }
546
84.4k
    return buffer_ptr;
547
84.4k
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<unsigned long long>(unsigned long&, char*, char*, unsigned long long)
Line
Count
Source
515
219M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
219M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
219M
    }
546
219M
    return buffer_ptr;
547
219M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::ArrayType*>(unsigned long&, char*, char*, llvm::ArrayType*)
Line
Count
Source
515
37.0k
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
37.0k
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
37.0k
    }
546
37.0k
    return buffer_ptr;
547
37.0k
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::StructType*>(unsigned long&, char*, char*, llvm::StructType*)
Line
Count
Source
515
121k
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
121k
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
121k
    }
546
121k
    return buffer_ptr;
547
121k
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::VectorType*>(unsigned long&, char*, char*, llvm::VectorType*)
Line
Count
Source
515
175k
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
175k
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
175k
    }
546
175k
    return buffer_ptr;
547
175k
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Type*>(unsigned long&, char*, char*, llvm::Type*)
Line
Count
Source
515
55.8M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
55.8M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
55.8M
    }
546
55.8M
    return buffer_ptr;
547
55.8M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::PointerType*>(unsigned long&, char*, char*, llvm::PointerType*)
Line
Count
Source
515
7.39k
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
7.39k
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
7.39k
    }
546
7.39k
    return buffer_ptr;
547
7.39k
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::MCSymbol const*>(unsigned long&, char*, char*, llvm::MCSymbol const*)
Line
Count
Source
515
30.8k
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
30.8k
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
30.8k
    }
546
30.8k
    return buffer_ptr;
547
30.8k
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Instruction::BinaryOps>(unsigned long&, char*, char*, llvm::Instruction::BinaryOps)
Line
Count
Source
515
7.28M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
7.28M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
7.28M
    }
546
7.28M
    return buffer_ptr;
547
7.28M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Value*>(unsigned long&, char*, char*, llvm::Value*)
Line
Count
Source
515
49.0M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
49.0M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
49.0M
    }
546
49.0M
    return buffer_ptr;
547
49.0M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::CmpInst::Predicate>(unsigned long&, char*, char*, llvm::CmpInst::Predicate)
Line
Count
Source
515
12.6M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
12.6M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
12.6M
    }
546
12.6M
    return buffer_ptr;
547
12.6M
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::SelectPatternFlavor>(unsigned long&, char*, char*, llvm::SelectPatternFlavor)
Line
Count
Source
515
215k
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
215k
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
215k
    }
546
215k
    return buffer_ptr;
547
215k
  }
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Instruction::CastOps>(unsigned long&, char*, char*, llvm::Instruction::CastOps)
Line
Count
Source
515
8.13M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
8.13M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
8.13M
    }
546
8.13M
    return buffer_ptr;
547
8.13M
  }
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::MemoryAccess const*>(unsigned long&, char*, char*, llvm::MemoryAccess const*)
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Constant*>(unsigned long&, char*, char*, llvm::Constant*)
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Instruction*>(unsigned long&, char*, char*, llvm::Instruction*)
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<short>(unsigned long&, char*, char*, short)
Line
Count
Source
515
925k
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
925k
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
925k
    }
546
925k
    return buffer_ptr;
547
925k
  }
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::fltSemantics const*>(unsigned long&, char*, char*, llvm::fltSemantics const*)
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<void*>(unsigned long&, char*, char*, void*)
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<clang::NestedNameSpecifier*>(unsigned long&, char*, char*, clang::NestedNameSpecifier*)
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::RegisterBankInfo::ValueMapping const*>(unsigned long&, char*, char*, llvm::RegisterBankInfo::ValueMapping const*)
Line
Count
Source
515
14.3M
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
14.3M
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
14.3M
    }
546
14.3M
    return buffer_ptr;
547
14.3M
  }
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<long>(unsigned long&, char*, char*, long)
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<lld::DefinedAtom::ContentType>(unsigned long&, char*, char*, lld::DefinedAtom::ContentType)
Line
Count
Source
515
54
  char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) {
516
54
    if (!store_and_advance(buffer_ptr, buffer_end, data)) {
517
0
      // Check for skew which prevents the buffer from being packed, and do
518
0
      // a partial store into the buffer to fill it. This is only a concern
519
0
      // with the variadic combine because that formation can have varying
520
0
      // argument types.
521
0
      size_t partial_store_size = buffer_end - buffer_ptr;
522
0
      memcpy(buffer_ptr, &data, partial_store_size);
523
0
524
0
      // If the store fails, our buffer is full and ready to hash. We have to
525
0
      // either initialize the hash state (on the first full buffer) or mix
526
0
      // this buffer into the existing hash state. Length tracks the *hashed*
527
0
      // length, not the buffered length.
528
0
      if (length == 0) {
529
0
        state = state.create(buffer, seed);
530
0
        length = 64;
531
0
      } else {
532
0
        // Mix this chunk into the current state and bump length up by 64.
533
0
        state.mix(buffer);
534
0
        length += 64;
535
0
      }
536
0
      // Reset the buffer_ptr to the head of the buffer for the next chunk of
537
0
      // data.
538
0
      buffer_ptr = buffer;
539
0
540
0
      // Try again to store into the buffer -- this cannot fail as we only
541
0
      // store types smaller than the buffer.
542
0
      if (!store_and_advance(buffer_ptr, buffer_end, data,
543
0
                             partial_store_size))
544
0
        abort();
545
54
    }
546
54
    return buffer_ptr;
547
54
  }
548
549
  /// Recursive, variadic combining method.
550
  ///
551
  /// This function recurses through each argument, combining that argument
552
  /// into a single hash.
553
  template <typename T, typename ...Ts>
554
  hash_code combine(size_t length, char *buffer_ptr, char *buffer_end,
555
956M
                    const T &arg, const Ts &...args) {
556
956M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
956M
558
956M
    // Recurse to the next argument.
559
956M
    return combine(length, buffer_ptr, buffer_end, args...);
560
956M
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int, llvm::hash_code>(unsigned long, char*, char*, unsigned int const&, unsigned int const&, llvm::hash_code const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::hash_code>(unsigned long, char*, char*, unsigned int const&, llvm::hash_code const&)
Line
Count
Source
555
17.6M
                    const T &arg, const Ts &...args) {
556
17.6M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
17.6M
558
17.6M
    // Recurse to the next argument.
559
17.6M
    return combine(length, buffer_ptr, buffer_end, args...);
560
17.6M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code>(unsigned long, char*, char*, llvm::hash_code const&)
Line
Count
Source
555
75.0M
                    const T &arg, const Ts &...args) {
556
75.0M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
75.0M
558
75.0M
    // Recurse to the next argument.
559
75.0M
    return combine(length, buffer_ptr, buffer_end, args...);
560
75.0M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int>(unsigned long, char*, char*, unsigned int const&, unsigned int const&)
Line
Count
Source
555
742k
                    const T &arg, const Ts &...args) {
556
742k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
742k
558
742k
    // Recurse to the next argument.
559
742k
    return combine(length, buffer_ptr, buffer_end, args...);
560
742k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int>(unsigned long, char*, char*, unsigned int const&)
Line
Count
Source
555
34.5M
                    const T &arg, const Ts &...args) {
556
34.5M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
34.5M
558
34.5M
    // Recurse to the next argument.
559
34.5M
    return combine(length, buffer_ptr, buffer_end, args...);
560
34.5M
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::coverage::CounterExpression::ExprKind, llvm::coverage::Counter::CounterKind, unsigned int, llvm::coverage::Counter::CounterKind, unsigned int>(unsigned long, char*, char*, llvm::coverage::CounterExpression::ExprKind const&, llvm::coverage::Counter::CounterKind const&, unsigned int const&, llvm::coverage::Counter::CounterKind const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::coverage::Counter::CounterKind, unsigned int, llvm::coverage::Counter::CounterKind, unsigned int>(unsigned long, char*, char*, llvm::coverage::Counter::CounterKind const&, unsigned int const&, llvm::coverage::Counter::CounterKind const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::coverage::Counter::CounterKind, unsigned int>(unsigned long, char*, char*, unsigned int const&, llvm::coverage::Counter::CounterKind const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::coverage::Counter::CounterKind, unsigned int>(unsigned long, char*, char*, llvm::coverage::Counter::CounterKind const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Loop const*, llvm::BasicBlock*>(unsigned long, char*, char*, llvm::Loop const* const&, llvm::BasicBlock* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::BasicBlock*>(unsigned long, char*, char*, llvm::BasicBlock* const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, bool>(unsigned long, char*, char*, llvm::hash_code const&, bool const&)
Line
Count
Source
555
6.67M
                    const T &arg, const Ts &...args) {
556
6.67M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
6.67M
558
6.67M
    // Recurse to the next argument.
559
6.67M
    return combine(length, buffer_ptr, buffer_end, args...);
560
6.67M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<bool>(unsigned long, char*, char*, bool const&)
Line
Count
Source
555
43.6M
                    const T &arg, const Ts &...args) {
556
43.6M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
43.6M
558
43.6M
    // Recurse to the next argument.
559
43.6M
    return combine(length, buffer_ptr, buffer_end, args...);
560
43.6M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand, llvm::MachineOperand, llvm::MachineOperand, llvm::MachineOperand>(unsigned long, char*, char*, llvm::MachineOperand const&, llvm::MachineOperand const&, llvm::MachineOperand const&, llvm::MachineOperand const&)
Line
Count
Source
555
92.3k
                    const T &arg, const Ts &...args) {
556
92.3k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
92.3k
558
92.3k
    // Recurse to the next argument.
559
92.3k
    return combine(length, buffer_ptr, buffer_end, args...);
560
92.3k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand, llvm::MachineOperand, llvm::MachineOperand>(unsigned long, char*, char*, llvm::MachineOperand const&, llvm::MachineOperand const&, llvm::MachineOperand const&)
Line
Count
Source
555
92.3k
                    const T &arg, const Ts &...args) {
556
92.3k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
92.3k
558
92.3k
    // Recurse to the next argument.
559
92.3k
    return combine(length, buffer_ptr, buffer_end, args...);
560
92.3k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand, llvm::MachineOperand>(unsigned long, char*, char*, llvm::MachineOperand const&, llvm::MachineOperand const&)
Line
Count
Source
555
92.3k
                    const T &arg, const Ts &...args) {
556
92.3k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
92.3k
558
92.3k
    // Recurse to the next argument.
559
92.3k
    return combine(length, buffer_ptr, buffer_end, args...);
560
92.3k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand>(unsigned long, char*, char*, llvm::MachineOperand const&)
Line
Count
Source
555
92.3k
                    const T &arg, const Ts &...args) {
556
92.3k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
92.3k
558
92.3k
    // Recurse to the next argument.
559
92.3k
    return combine(length, buffer_ptr, buffer_end, args...);
560
92.3k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, int>(unsigned long, char*, char*, llvm::hash_code const&, int const&)
Line
Count
Source
555
146
                    const T &arg, const Ts &...args) {
556
146
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
146
558
146
    // Recurse to the next argument.
559
146
    return combine(length, buffer_ptr, buffer_end, args...);
560
146
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<int>(unsigned long, char*, char*, int const&)
Line
Count
Source
555
533k
                    const T &arg, const Ts &...args) {
556
533k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
533k
558
533k
    // Recurse to the next argument.
559
533k
    return combine(length, buffer_ptr, buffer_end, args...);
560
533k
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, char const*>(unsigned long, char*, char*, llvm::hash_code const&, char const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<char const*>(unsigned long, char*, char*, char const* const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, llvm::GlobalValue const*>(unsigned long, char*, char*, llvm::hash_code const&, llvm::GlobalValue const* const&)
Line
Count
Source
555
51.7k
                    const T &arg, const Ts &...args) {
556
51.7k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
51.7k
558
51.7k
    // Recurse to the next argument.
559
51.7k
    return combine(length, buffer_ptr, buffer_end, args...);
560
51.7k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::GlobalValue const*>(unsigned long, char*, char*, llvm::GlobalValue const* const&)
Line
Count
Source
555
51.7k
                    const T &arg, const Ts &...args) {
556
51.7k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
51.7k
558
51.7k
    // Recurse to the next argument.
559
51.7k
    return combine(length, buffer_ptr, buffer_end, args...);
560
51.7k
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, llvm::BlockAddress const*>(unsigned long, char*, char*, llvm::hash_code const&, llvm::BlockAddress const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::BlockAddress const*>(unsigned long, char*, char*, llvm::BlockAddress const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, llvm::MCSymbol*>(unsigned long, char*, char*, llvm::hash_code const&, llvm::MCSymbol* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MCSymbol*>(unsigned long, char*, char*, llvm::MCSymbol* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, llvm::MachineBasicBlock*>(unsigned long, char*, char*, llvm::hash_code const&, llvm::MachineBasicBlock* const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineBasicBlock*>(unsigned long, char*, char*, llvm::MachineBasicBlock* const&)
Line
Count
Source
555
1.67M
                    const T &arg, const Ts &...args) {
556
1.67M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
1.67M
558
1.67M
    // Recurse to the next argument.
559
1.67M
    return combine(length, buffer_ptr, buffer_end, args...);
560
1.67M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<bool, unsigned int>(unsigned long, char*, char*, bool const&, unsigned int const&)
Line
Count
Source
555
2.13M
                    const T &arg, const Ts &...args) {
556
2.13M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
2.13M
558
2.13M
    // Recurse to the next argument.
559
2.13M
    return combine(length, buffer_ptr, buffer_end, args...);
560
2.13M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, unsigned int>(unsigned long, char*, char*, llvm::hash_code const&, unsigned int const&)
Line
Count
Source
555
77.0k
                    const T &arg, const Ts &...args) {
556
77.0k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
77.0k
558
77.0k
    // Recurse to the next argument.
559
77.0k
    return combine(length, buffer_ptr, buffer_end, args...);
560
77.0k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, unsigned int, bool>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, unsigned int const&, bool const&)
Line
Count
Source
555
36.9M
                    const T &arg, const Ts &...args) {
556
36.9M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
36.9M
558
36.9M
    // Recurse to the next argument.
559
36.9M
    return combine(length, buffer_ptr, buffer_end, args...);
560
36.9M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int, bool>(unsigned long, char*, char*, unsigned int const&, unsigned int const&, bool const&)
Line
Count
Source
555
36.9M
                    const T &arg, const Ts &...args) {
556
36.9M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
36.9M
558
36.9M
    // Recurse to the next argument.
559
36.9M
    return combine(length, buffer_ptr, buffer_end, args...);
560
36.9M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, bool>(unsigned long, char*, char*, unsigned int const&, bool const&)
Line
Count
Source
555
36.9M
                    const T &arg, const Ts &...args) {
556
36.9M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
36.9M
558
36.9M
    // Recurse to the next argument.
559
36.9M
    return combine(length, buffer_ptr, buffer_end, args...);
560
36.9M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, long long>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, long long const&)
Line
Count
Source
555
16.4M
                    const T &arg, const Ts &...args) {
556
16.4M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
16.4M
558
16.4M
    // Recurse to the next argument.
559
16.4M
    return combine(length, buffer_ptr, buffer_end, args...);
560
16.4M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, long long>(unsigned long, char*, char*, unsigned int const&, long long const&)
Line
Count
Source
555
16.4M
                    const T &arg, const Ts &...args) {
556
16.4M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
16.4M
558
16.4M
    // Recurse to the next argument.
559
16.4M
    return combine(length, buffer_ptr, buffer_end, args...);
560
16.4M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<long long>(unsigned long, char*, char*, long long const&)
Line
Count
Source
555
20.5M
                    const T &arg, const Ts &...args) {
556
20.5M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
20.5M
558
20.5M
    // Recurse to the next argument.
559
20.5M
    return combine(length, buffer_ptr, buffer_end, args...);
560
20.5M
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::ConstantInt const*>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::ConstantInt const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::ConstantInt const*>(unsigned long, char*, char*, unsigned int const&, llvm::ConstantInt const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::ConstantInt const*>(unsigned long, char*, char*, llvm::ConstantInt const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::ConstantFP const*>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::ConstantFP const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::ConstantFP const*>(unsigned long, char*, char*, unsigned int const&, llvm::ConstantFP const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::ConstantFP const*>(unsigned long, char*, char*, llvm::ConstantFP const* const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::MachineBasicBlock*>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::MachineBasicBlock* const&)
Line
Count
Source
555
1.67M
                    const T &arg, const Ts &...args) {
556
1.67M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
1.67M
558
1.67M
    // Recurse to the next argument.
559
1.67M
    return combine(length, buffer_ptr, buffer_end, args...);
560
1.67M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::MachineBasicBlock*>(unsigned long, char*, char*, unsigned int const&, llvm::MachineBasicBlock* const&)
Line
Count
Source
555
1.67M
                    const T &arg, const Ts &...args) {
556
1.67M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
1.67M
558
1.67M
    // Recurse to the next argument.
559
1.67M
    return combine(length, buffer_ptr, buffer_end, args...);
560
1.67M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, int>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, int const&)
Line
Count
Source
555
533k
                    const T &arg, const Ts &...args) {
556
533k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
533k
558
533k
    // Recurse to the next argument.
559
533k
    return combine(length, buffer_ptr, buffer_end, args...);
560
533k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, int>(unsigned long, char*, char*, unsigned int const&, int const&)
Line
Count
Source
555
533k
                    const T &arg, const Ts &...args) {
556
533k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
533k
558
533k
    // Recurse to the next argument.
559
533k
    return combine(length, buffer_ptr, buffer_end, args...);
560
533k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, int, long long>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, int const&, long long const&)
Line
Count
Source
555
351k
                    const T &arg, const Ts &...args) {
556
351k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
351k
558
351k
    // Recurse to the next argument.
559
351k
    return combine(length, buffer_ptr, buffer_end, args...);
560
351k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, int, long long>(unsigned long, char*, char*, unsigned int const&, int const&, long long const&)
Line
Count
Source
555
351k
                    const T &arg, const Ts &...args) {
556
351k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
351k
558
351k
    // Recurse to the next argument.
559
351k
    return combine(length, buffer_ptr, buffer_end, args...);
560
351k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<int, long long>(unsigned long, char*, char*, int const&, long long const&)
Line
Count
Source
555
351k
                    const T &arg, const Ts &...args) {
556
351k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
351k
558
351k
    // Recurse to the next argument.
559
351k
    return combine(length, buffer_ptr, buffer_end, args...);
560
351k
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, long long, char const*>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, long long const&, char const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, long long, char const*>(unsigned long, char*, char*, unsigned int const&, long long const&, char const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<long long, char const*>(unsigned long, char*, char*, long long const&, char const* const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::GlobalValue const*, long long>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::GlobalValue const* const&, long long const&)
Line
Count
Source
555
3.76M
                    const T &arg, const Ts &...args) {
556
3.76M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
3.76M
558
3.76M
    // Recurse to the next argument.
559
3.76M
    return combine(length, buffer_ptr, buffer_end, args...);
560
3.76M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::GlobalValue const*, long long>(unsigned long, char*, char*, unsigned int const&, llvm::GlobalValue const* const&, long long const&)
Line
Count
Source
555
3.76M
                    const T &arg, const Ts &...args) {
556
3.76M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
3.76M
558
3.76M
    // Recurse to the next argument.
559
3.76M
    return combine(length, buffer_ptr, buffer_end, args...);
560
3.76M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::GlobalValue const*, long long>(unsigned long, char*, char*, llvm::GlobalValue const* const&, long long const&)
Line
Count
Source
555
3.76M
                    const T &arg, const Ts &...args) {
556
3.76M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
3.76M
558
3.76M
    // Recurse to the next argument.
559
3.76M
    return combine(length, buffer_ptr, buffer_end, args...);
560
3.76M
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::BlockAddress const*, long long>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::BlockAddress const* const&, long long const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::BlockAddress const*, long long>(unsigned long, char*, char*, unsigned int const&, llvm::BlockAddress const* const&, long long const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::BlockAddress const*, long long>(unsigned long, char*, char*, llvm::BlockAddress const* const&, long long const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, unsigned int const*>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, unsigned int const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int const*>(unsigned long, char*, char*, unsigned int const&, unsigned int const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int const*>(unsigned long, char*, char*, unsigned int const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::MDNode const*>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::MDNode const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::MDNode const*>(unsigned long, char*, char*, unsigned int const&, llvm::MDNode const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDNode const*>(unsigned long, char*, char*, llvm::MDNode const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::MCSymbol*>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::MCSymbol* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::MCSymbol*>(unsigned long, char*, char*, unsigned int const&, llvm::MCSymbol* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, unsigned int>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::Intrinsic::ID>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::Intrinsic::ID const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Intrinsic::ID>(unsigned long, char*, char*, unsigned int const&, llvm::Intrinsic::ID const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Intrinsic::ID>(unsigned long, char*, char*, llvm::Intrinsic::ID const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::StringRef, llvm::StringRef, bool, bool, llvm::InlineAsm::AsmDialect, llvm::FunctionType*>(unsigned long, char*, char*, llvm::StringRef const&, llvm::StringRef const&, bool const&, bool const&, llvm::InlineAsm::AsmDialect const&, llvm::FunctionType* const&)
Line
Count
Source
555
7.39k
                    const T &arg, const Ts &...args) {
556
7.39k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
7.39k
558
7.39k
    // Recurse to the next argument.
559
7.39k
    return combine(length, buffer_ptr, buffer_end, args...);
560
7.39k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::StringRef, bool, bool, llvm::InlineAsm::AsmDialect, llvm::FunctionType*>(unsigned long, char*, char*, llvm::StringRef const&, bool const&, bool const&, llvm::InlineAsm::AsmDialect const&, llvm::FunctionType* const&)
Line
Count
Source
555
7.39k
                    const T &arg, const Ts &...args) {
556
7.39k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
7.39k
558
7.39k
    // Recurse to the next argument.
559
7.39k
    return combine(length, buffer_ptr, buffer_end, args...);
560
7.39k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<bool, bool, llvm::InlineAsm::AsmDialect, llvm::FunctionType*>(unsigned long, char*, char*, bool const&, bool const&, llvm::InlineAsm::AsmDialect const&, llvm::FunctionType* const&)
Line
Count
Source
555
7.39k
                    const T &arg, const Ts &...args) {
556
7.39k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
7.39k
558
7.39k
    // Recurse to the next argument.
559
7.39k
    return combine(length, buffer_ptr, buffer_end, args...);
560
7.39k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<bool, llvm::InlineAsm::AsmDialect, llvm::FunctionType*>(unsigned long, char*, char*, bool const&, llvm::InlineAsm::AsmDialect const&, llvm::FunctionType* const&)
Line
Count
Source
555
7.39k
                    const T &arg, const Ts &...args) {
556
7.39k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
7.39k
558
7.39k
    // Recurse to the next argument.
559
7.39k
    return combine(length, buffer_ptr, buffer_end, args...);
560
7.39k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::InlineAsm::AsmDialect, llvm::FunctionType*>(unsigned long, char*, char*, llvm::InlineAsm::AsmDialect const&, llvm::FunctionType* const&)
Line
Count
Source
555
7.39k
                    const T &arg, const Ts &...args) {
556
7.39k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
7.39k
558
7.39k
    // Recurse to the next argument.
559
7.39k
    return combine(length, buffer_ptr, buffer_end, args...);
560
7.39k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::FunctionType*>(unsigned long, char*, char*, llvm::FunctionType* const&)
Line
Count
Source
555
7.39k
                    const T &arg, const Ts &...args) {
556
7.39k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
7.39k
558
7.39k
    // Recurse to the next argument.
559
7.39k
    return combine(length, buffer_ptr, buffer_end, args...);
560
7.39k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned char, unsigned char, unsigned short, llvm::hash_code, llvm::hash_code>(unsigned long, char*, char*, unsigned char const&, unsigned char const&, unsigned short const&, llvm::hash_code const&, llvm::hash_code const&)
Line
Count
Source
555
16.7M
                    const T &arg, const Ts &...args) {
556
16.7M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
16.7M
558
16.7M
    // Recurse to the next argument.
559
16.7M
    return combine(length, buffer_ptr, buffer_end, args...);
560
16.7M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned char, unsigned short, llvm::hash_code, llvm::hash_code>(unsigned long, char*, char*, unsigned char const&, unsigned short const&, llvm::hash_code const&, llvm::hash_code const&)
Line
Count
Source
555
16.7M
                    const T &arg, const Ts &...args) {
556
16.7M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
16.7M
558
16.7M
    // Recurse to the next argument.
559
16.7M
    return combine(length, buffer_ptr, buffer_end, args...);
560
16.7M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned short, llvm::hash_code, llvm::hash_code>(unsigned long, char*, char*, unsigned short const&, llvm::hash_code const&, llvm::hash_code const&)
Line
Count
Source
555
16.7M
                    const T &arg, const Ts &...args) {
556
16.7M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
16.7M
558
16.7M
    // Recurse to the next argument.
559
16.7M
    return combine(length, buffer_ptr, buffer_end, args...);
560
16.7M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, llvm::hash_code>(unsigned long, char*, char*, llvm::hash_code const&, llvm::hash_code const&)
Line
Count
Source
555
25.0M
                    const T &arg, const Ts &...args) {
556
25.0M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
25.0M
558
25.0M
    // Recurse to the next argument.
559
25.0M
    return combine(length, buffer_ptr, buffer_end, args...);
560
25.0M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Type const*, llvm::hash_code, bool>(unsigned long, char*, char*, llvm::Type const* const&, llvm::hash_code const&, bool const&)
Line
Count
Source
555
6.59M
                    const T &arg, const Ts &...args) {
556
6.59M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
6.59M
558
6.59M
    // Recurse to the next argument.
559
6.59M
    return combine(length, buffer_ptr, buffer_end, args...);
560
6.59M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int, llvm::Metadata*, llvm::Metadata*>(unsigned long, char*, char*, unsigned int const&, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&)
Line
Count
Source
555
16.1M
                    const T &arg, const Ts &...args) {
556
16.1M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
16.1M
558
16.1M
    // Recurse to the next argument.
559
16.1M
    return combine(length, buffer_ptr, buffer_end, args...);
560
16.1M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Metadata*, llvm::Metadata*>(unsigned long, char*, char*, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&)
Line
Count
Source
555
16.1M
                    const T &arg, const Ts &...args) {
556
16.1M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
16.1M
558
16.1M
    // Recurse to the next argument.
559
16.1M
    return combine(length, buffer_ptr, buffer_end, args...);
560
16.1M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::Metadata*>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::Metadata* const&)
Line
Count
Source
555
16.1M
                    const T &arg, const Ts &...args) {
556
16.1M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
16.1M
558
16.1M
    // Recurse to the next argument.
559
16.1M
    return combine(length, buffer_ptr, buffer_end, args...);
560
16.1M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*>(unsigned long, char*, char*, llvm::Metadata* const&)
Line
Count
Source
555
16.2M
                    const T &arg, const Ts &...args) {
556
16.2M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
16.2M
558
16.2M
    // Recurse to the next argument.
559
16.2M
    return combine(length, buffer_ptr, buffer_end, args...);
560
16.2M
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int, llvm::MDString*>(unsigned long, char*, char*, unsigned int const&, unsigned int const&, llvm::MDString* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::MDString*>(unsigned long, char*, char*, unsigned int const&, llvm::MDString* const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*>(unsigned long, char*, char*, llvm::MDString* const&)
Line
Count
Source
555
21.0k
                    const T &arg, const Ts &...args) {
556
21.0k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
21.0k
558
21.0k
    // Recurse to the next argument.
559
21.0k
    return combine(length, buffer_ptr, buffer_end, args...);
560
21.0k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<long long, long long>(unsigned long, char*, char*, long long const&, long long const&)
Line
Count
Source
555
1
                    const T &arg, const Ts &...args) {
556
1
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
1
558
1
    // Recurse to the next argument.
559
1
    return combine(length, buffer_ptr, buffer_end, args...);
560
1
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, long long>(unsigned long, char*, char*, llvm::Metadata* const&, long long const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<long long, llvm::MDString*>(unsigned long, char*, char*, long long const&, llvm::MDString* const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::MDString*, unsigned long long, unsigned int, unsigned int>(unsigned long, char*, char*, unsigned int const&, llvm::MDString* const&, unsigned long long const&, unsigned int const&, unsigned int const&)
Line
Count
Source
555
30
                    const T &arg, const Ts &...args) {
556
30
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
30
558
30
    // Recurse to the next argument.
559
30
    return combine(length, buffer_ptr, buffer_end, args...);
560
30
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, unsigned long long, unsigned int, unsigned int>(unsigned long, char*, char*, llvm::MDString* const&, unsigned long long const&, unsigned int const&, unsigned int const&)
Line
Count
Source
555
30
                    const T &arg, const Ts &...args) {
556
30
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
30
558
30
    // Recurse to the next argument.
559
30
    return combine(length, buffer_ptr, buffer_end, args...);
560
30
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned long long, unsigned int, unsigned int>(unsigned long, char*, char*, unsigned long long const&, unsigned int const&, unsigned int const&)
Line
Count
Source
555
30
                    const T &arg, const Ts &...args) {
556
30
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
30
558
30
    // Recurse to the next argument.
559
30
    return combine(length, buffer_ptr, buffer_end, args...);
560
30
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::Metadata*>(unsigned long, char*, char*, llvm::MDString* const&, llvm::Metadata* const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::MDString*, llvm::Metadata*, unsigned int, llvm::Metadata*, llvm::Metadata*, unsigned int>(unsigned long, char*, char*, unsigned int const&, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&)
Line
Count
Source
555
73
                    const T &arg, const Ts &...args) {
556
73
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
73
558
73
    // Recurse to the next argument.
559
73
    return combine(length, buffer_ptr, buffer_end, args...);
560
73
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::Metadata*, unsigned int, llvm::Metadata*, llvm::Metadata*, unsigned int>(unsigned long, char*, char*, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&)
Line
Count
Source
555
73
                    const T &arg, const Ts &...args) {
556
73
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
73
558
73
    // Recurse to the next argument.
559
73
    return combine(length, buffer_ptr, buffer_end, args...);
560
73
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, unsigned int, llvm::Metadata*, llvm::Metadata*, unsigned int>(unsigned long, char*, char*, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&)
Line
Count
Source
555
73
                    const T &arg, const Ts &...args) {
556
73
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
73
558
73
    // Recurse to the next argument.
559
73
    return combine(length, buffer_ptr, buffer_end, args...);
560
73
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Metadata*, llvm::Metadata*, unsigned int>(unsigned long, char*, char*, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&)
Line
Count
Source
555
73
                    const T &arg, const Ts &...args) {
556
73
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
73
558
73
    // Recurse to the next argument.
559
73
    return combine(length, buffer_ptr, buffer_end, args...);
560
73
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::Metadata*, unsigned int>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&)
Line
Count
Source
555
1.21k
                    const T &arg, const Ts &...args) {
556
1.21k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
1.21k
558
1.21k
    // Recurse to the next argument.
559
1.21k
    return combine(length, buffer_ptr, buffer_end, args...);
560
1.21k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, unsigned int>(unsigned long, char*, char*, llvm::Metadata* const&, unsigned int const&)
Line
Count
Source
555
1.21k
                    const T &arg, const Ts &...args) {
556
1.21k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
1.21k
558
1.21k
    // Recurse to the next argument.
559
1.21k
    return combine(length, buffer_ptr, buffer_end, args...);
560
1.21k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::Metadata*, unsigned int, llvm::Metadata*, llvm::Metadata*, llvm::Metadata*, llvm::Metadata*>(unsigned long, char*, char*, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&)
Line
Count
Source
555
8
                    const T &arg, const Ts &...args) {
556
8
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
8
558
8
    // Recurse to the next argument.
559
8
    return combine(length, buffer_ptr, buffer_end, args...);
560
8
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, unsigned int, llvm::Metadata*, llvm::Metadata*, llvm::Metadata*, llvm::Metadata*>(unsigned long, char*, char*, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&)
Line
Count
Source
555
8
                    const T &arg, const Ts &...args) {
556
8
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
8
558
8
    // Recurse to the next argument.
559
8
    return combine(length, buffer_ptr, buffer_end, args...);
560
8
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Metadata*, llvm::Metadata*, llvm::Metadata*, llvm::Metadata*>(unsigned long, char*, char*, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&)
Line
Count
Source
555
8
                    const T &arg, const Ts &...args) {
556
8
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
8
558
8
    // Recurse to the next argument.
559
8
    return combine(length, buffer_ptr, buffer_end, args...);
560
8
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::Metadata*, llvm::Metadata*, llvm::Metadata*>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&)
Line
Count
Source
555
8
                    const T &arg, const Ts &...args) {
556
8
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
8
558
8
    // Recurse to the next argument.
559
8
    return combine(length, buffer_ptr, buffer_end, args...);
560
8
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::Metadata*, llvm::Metadata*>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&)
Line
Count
Source
555
8
                    const T &arg, const Ts &...args) {
556
8
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
8
558
8
    // Recurse to the next argument.
559
8
    return combine(length, buffer_ptr, buffer_end, args...);
560
8
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned char, llvm::Metadata*>(unsigned long, char*, char*, unsigned int const&, unsigned char const&, llvm::Metadata* const&)
Line
Count
Source
555
108k
                    const T &arg, const Ts &...args) {
556
108k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
108k
558
108k
    // Recurse to the next argument.
559
108k
    return combine(length, buffer_ptr, buffer_end, args...);
560
108k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned char, llvm::Metadata*>(unsigned long, char*, char*, unsigned char const&, llvm::Metadata* const&)
Line
Count
Source
555
108k
                    const T &arg, const Ts &...args) {
556
108k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
108k
558
108k
    // Recurse to the next argument.
559
108k
    return combine(length, buffer_ptr, buffer_end, args...);
560
108k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::MDString*, int, llvm::MDString*, llvm::MDString*>(unsigned long, char*, char*, llvm::MDString* const&, llvm::MDString* const&, int const&, llvm::MDString* const&, llvm::MDString* const&)
Line
Count
Source
555
21.0k
                    const T &arg, const Ts &...args) {
556
21.0k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
21.0k
558
21.0k
    // Recurse to the next argument.
559
21.0k
    return combine(length, buffer_ptr, buffer_end, args...);
560
21.0k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, int, llvm::MDString*, llvm::MDString*>(unsigned long, char*, char*, llvm::MDString* const&, int const&, llvm::MDString* const&, llvm::MDString* const&)
Line
Count
Source
555
21.0k
                    const T &arg, const Ts &...args) {
556
21.0k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
21.0k
558
21.0k
    // Recurse to the next argument.
559
21.0k
    return combine(length, buffer_ptr, buffer_end, args...);
560
21.0k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<int, llvm::MDString*, llvm::MDString*>(unsigned long, char*, char*, int const&, llvm::MDString* const&, llvm::MDString* const&)
Line
Count
Source
555
21.0k
                    const T &arg, const Ts &...args) {
556
21.0k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
21.0k
558
21.0k
    // Recurse to the next argument.
559
21.0k
    return combine(length, buffer_ptr, buffer_end, args...);
560
21.0k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::MDString*>(unsigned long, char*, char*, llvm::MDString* const&, llvm::MDString* const&)
Line
Count
Source
555
21.0k
                    const T &arg, const Ts &...args) {
556
21.0k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
21.0k
558
21.0k
    // Recurse to the next argument.
559
21.0k
    return combine(length, buffer_ptr, buffer_end, args...);
560
21.0k
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::Metadata*, llvm::Metadata*, llvm::Metadata*, unsigned int>(unsigned long, char*, char*, llvm::MDString* const&, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::Metadata*, llvm::Metadata*, unsigned int>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::Metadata*, unsigned int, unsigned int>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&, unsigned int const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, unsigned int, unsigned int>(unsigned long, char*, char*, llvm::Metadata* const&, unsigned int const&, unsigned int const&)
Line
Count
Source
555
171
                    const T &arg, const Ts &...args) {
556
171
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
171
558
171
    // Recurse to the next argument.
559
171
    return combine(length, buffer_ptr, buffer_end, args...);
560
171
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::MDString*>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::MDString* const&)
Line
Count
Source
555
3
                    const T &arg, const Ts &...args) {
556
3
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
3
558
3
    // Recurse to the next argument.
559
3
    return combine(length, buffer_ptr, buffer_end, args...);
560
3
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::MDString*, llvm::MDString*, llvm::MDString*, llvm::MDString*>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::MDString* const&, llvm::MDString* const&, llvm::MDString* const&, llvm::MDString* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::MDString*, llvm::MDString*, llvm::MDString*>(unsigned long, char*, char*, llvm::MDString* const&, llvm::MDString* const&, llvm::MDString* const&, llvm::MDString* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::MDString*, llvm::MDString*>(unsigned long, char*, char*, llvm::MDString* const&, llvm::MDString* const&, llvm::MDString* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::MDString*, llvm::Metadata*, llvm::Metadata*>(unsigned long, char*, char*, unsigned int const&, llvm::MDString* const&, llvm::Metadata* const&, llvm::Metadata* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::Metadata*, llvm::Metadata*>(unsigned long, char*, char*, llvm::MDString* const&, llvm::Metadata* const&, llvm::Metadata* const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::MDString*, llvm::MDString*, llvm::Metadata*, unsigned int, llvm::Metadata*, bool, bool, llvm::Metadata*>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::MDString* const&, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, bool const&, bool const&, llvm::Metadata* const&)
Line
Count
Source
555
4
                    const T &arg, const Ts &...args) {
556
4
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
4
558
4
    // Recurse to the next argument.
559
4
    return combine(length, buffer_ptr, buffer_end, args...);
560
4
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::MDString*, llvm::Metadata*, unsigned int, llvm::Metadata*, bool, bool, llvm::Metadata*>(unsigned long, char*, char*, llvm::MDString* const&, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, bool const&, bool const&, llvm::Metadata* const&)
Line
Count
Source
555
4
                    const T &arg, const Ts &...args) {
556
4
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
4
558
4
    // Recurse to the next argument.
559
4
    return combine(length, buffer_ptr, buffer_end, args...);
560
4
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::Metadata*, unsigned int, llvm::Metadata*, bool, bool, llvm::Metadata*>(unsigned long, char*, char*, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, bool const&, bool const&, llvm::Metadata* const&)
Line
Count
Source
555
4
                    const T &arg, const Ts &...args) {
556
4
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
4
558
4
    // Recurse to the next argument.
559
4
    return combine(length, buffer_ptr, buffer_end, args...);
560
4
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, unsigned int, llvm::Metadata*, bool, bool, llvm::Metadata*>(unsigned long, char*, char*, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, bool const&, bool const&, llvm::Metadata* const&)
Line
Count
Source
555
4
                    const T &arg, const Ts &...args) {
556
4
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
4
558
4
    // Recurse to the next argument.
559
4
    return combine(length, buffer_ptr, buffer_end, args...);
560
4
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Metadata*, bool, bool, llvm::Metadata*>(unsigned long, char*, char*, unsigned int const&, llvm::Metadata* const&, bool const&, bool const&, llvm::Metadata* const&)
Line
Count
Source
555
4
                    const T &arg, const Ts &...args) {
556
4
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
4
558
4
    // Recurse to the next argument.
559
4
    return combine(length, buffer_ptr, buffer_end, args...);
560
4
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, bool, bool, llvm::Metadata*>(unsigned long, char*, char*, llvm::Metadata* const&, bool const&, bool const&, llvm::Metadata* const&)
Line
Count
Source
555
4
                    const T &arg, const Ts &...args) {
556
4
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
4
558
4
    // Recurse to the next argument.
559
4
    return combine(length, buffer_ptr, buffer_end, args...);
560
4
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<bool, bool, llvm::Metadata*>(unsigned long, char*, char*, bool const&, bool const&, llvm::Metadata* const&)
Line
Count
Source
555
4
                    const T &arg, const Ts &...args) {
556
4
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
4
558
4
    // Recurse to the next argument.
559
4
    return combine(length, buffer_ptr, buffer_end, args...);
560
4
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<bool, llvm::Metadata*>(unsigned long, char*, char*, bool const&, llvm::Metadata* const&)
Line
Count
Source
555
4
                    const T &arg, const Ts &...args) {
556
4
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
4
558
4
    // Recurse to the next argument.
559
4
    return combine(length, buffer_ptr, buffer_end, args...);
560
4
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::MDString*, llvm::Metadata*, unsigned int, llvm::Metadata*, unsigned int, unsigned int>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, unsigned int const&, unsigned int const&)
Line
Count
Source
555
171
                    const T &arg, const Ts &...args) {
556
171
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
171
558
171
    // Recurse to the next argument.
559
171
    return combine(length, buffer_ptr, buffer_end, args...);
560
171
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::Metadata*, unsigned int, llvm::Metadata*, unsigned int, unsigned int>(unsigned long, char*, char*, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, unsigned int const&, unsigned int const&)
Line
Count
Source
555
171
                    const T &arg, const Ts &...args) {
556
171
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
171
558
171
    // Recurse to the next argument.
559
171
    return combine(length, buffer_ptr, buffer_end, args...);
560
171
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, unsigned int, llvm::Metadata*, unsigned int, unsigned int>(unsigned long, char*, char*, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, unsigned int const&, unsigned int const&)
Line
Count
Source
555
171
                    const T &arg, const Ts &...args) {
556
171
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
171
558
171
    // Recurse to the next argument.
559
171
    return combine(length, buffer_ptr, buffer_end, args...);
560
171
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Metadata*, unsigned int, unsigned int>(unsigned long, char*, char*, unsigned int const&, llvm::Metadata* const&, unsigned int const&, unsigned int const&)
Line
Count
Source
555
171
                    const T &arg, const Ts &...args) {
556
171
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
171
558
171
    // Recurse to the next argument.
559
171
    return combine(length, buffer_ptr, buffer_end, args...);
560
171
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::MDString*, unsigned int>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::MDString* const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, unsigned int>(unsigned long, char*, char*, llvm::MDString* const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::Metadata*, unsigned int, llvm::MDString*, llvm::MDString*, unsigned int, llvm::Metadata*>(unsigned long, char*, char*, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::MDString* const&, llvm::MDString* const&, unsigned int const&, llvm::Metadata* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, unsigned int, llvm::MDString*, llvm::MDString*, unsigned int, llvm::Metadata*>(unsigned long, char*, char*, llvm::Metadata* const&, unsigned int const&, llvm::MDString* const&, llvm::MDString* const&, unsigned int const&, llvm::Metadata* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::MDString*, llvm::MDString*, unsigned int, llvm::Metadata*>(unsigned long, char*, char*, unsigned int const&, llvm::MDString* const&, llvm::MDString* const&, unsigned int const&, llvm::Metadata* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::MDString*, unsigned int, llvm::Metadata*>(unsigned long, char*, char*, llvm::MDString* const&, llvm::MDString* const&, unsigned int const&, llvm::Metadata* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, unsigned int, llvm::Metadata*>(unsigned long, char*, char*, llvm::MDString* const&, unsigned int const&, llvm::Metadata* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Metadata*>(unsigned long, char*, char*, unsigned int const&, llvm::Metadata* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Metadata*, llvm::Metadata*, llvm::Metadata*, unsigned int, llvm::MDString*>(unsigned long, char*, char*, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&, llvm::MDString* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::Metadata*, llvm::Metadata*, unsigned int, llvm::MDString*>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&, llvm::MDString* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::Metadata*, unsigned int, llvm::MDString*>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&, llvm::MDString* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, unsigned int, llvm::MDString*>(unsigned long, char*, char*, llvm::Metadata* const&, unsigned int const&, llvm::MDString* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int, llvm::MDString*, llvm::MDString*>(unsigned long, char*, char*, unsigned int const&, unsigned int const&, llvm::MDString* const&, llvm::MDString* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::MDString*, llvm::MDString*>(unsigned long, char*, char*, unsigned int const&, llvm::MDString* const&, llvm::MDString* const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::ArrayType*, unsigned int>(unsigned long, char*, char*, llvm::ArrayType* const&, unsigned int const&)
Line
Count
Source
555
37.0k
                    const T &arg, const Ts &...args) {
556
37.0k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
37.0k
558
37.0k
    // Recurse to the next argument.
559
37.0k
    return combine(length, buffer_ptr, buffer_end, args...);
560
37.0k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::StructType*, unsigned int>(unsigned long, char*, char*, llvm::StructType* const&, unsigned int const&)
Line
Count
Source
555
121k
                    const T &arg, const Ts &...args) {
556
121k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
121k
558
121k
    // Recurse to the next argument.
559
121k
    return combine(length, buffer_ptr, buffer_end, args...);
560
121k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::VectorType*, unsigned int>(unsigned long, char*, char*, llvm::VectorType* const&, unsigned int const&)
Line
Count
Source
555
175k
                    const T &arg, const Ts &...args) {
556
175k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
175k
558
175k
    // Recurse to the next argument.
559
175k
    return combine(length, buffer_ptr, buffer_end, args...);
560
175k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Type*, unsigned int>(unsigned long, char*, char*, llvm::Type* const&, unsigned int const&)
Line
Count
Source
555
16.7M
                    const T &arg, const Ts &...args) {
556
16.7M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
16.7M
558
16.7M
    // Recurse to the next argument.
559
16.7M
    return combine(length, buffer_ptr, buffer_end, args...);
560
16.7M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::PointerType*, unsigned int>(unsigned long, char*, char*, llvm::PointerType* const&, unsigned int const&)
Line
Count
Source
555
7.39k
                    const T &arg, const Ts &...args) {
556
7.39k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
7.39k
558
7.39k
    // Recurse to the next argument.
559
7.39k
    return combine(length, buffer_ptr, buffer_end, args...);
560
7.39k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MCSymbol const*, unsigned int, unsigned int, bool, bool, unsigned int>(unsigned long, char*, char*, llvm::MCSymbol const* const&, unsigned int const&, unsigned int const&, bool const&, bool const&, unsigned int const&)
Line
Count
Source
555
30.8k
                    const T &arg, const Ts &...args) {
556
30.8k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
30.8k
558
30.8k
    // Recurse to the next argument.
559
30.8k
    return combine(length, buffer_ptr, buffer_end, args...);
560
30.8k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int, bool, bool, unsigned int>(unsigned long, char*, char*, unsigned int const&, unsigned int const&, bool const&, bool const&, unsigned int const&)
Line
Count
Source
555
30.8k
                    const T &arg, const Ts &...args) {
556
30.8k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
30.8k
558
30.8k
    // Recurse to the next argument.
559
30.8k
    return combine(length, buffer_ptr, buffer_end, args...);
560
30.8k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, bool, bool, unsigned int>(unsigned long, char*, char*, unsigned int const&, bool const&, bool const&, unsigned int const&)
Line
Count
Source
555
30.8k
                    const T &arg, const Ts &...args) {
556
30.8k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
30.8k
558
30.8k
    // Recurse to the next argument.
559
30.8k
    return combine(length, buffer_ptr, buffer_end, args...);
560
30.8k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<bool, bool, unsigned int>(unsigned long, char*, char*, bool const&, bool const&, unsigned int const&)
Line
Count
Source
555
30.8k
                    const T &arg, const Ts &...args) {
556
30.8k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
30.8k
558
30.8k
    // Recurse to the next argument.
559
30.8k
    return combine(length, buffer_ptr, buffer_end, args...);
560
30.8k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Instruction::BinaryOps, llvm::Value*, llvm::Value*>(unsigned long, char*, char*, llvm::Instruction::BinaryOps const&, llvm::Value* const&, llvm::Value* const&)
Line
Count
Source
555
7.28M
                    const T &arg, const Ts &...args) {
556
7.28M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
7.28M
558
7.28M
    // Recurse to the next argument.
559
7.28M
    return combine(length, buffer_ptr, buffer_end, args...);
560
7.28M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Value*, llvm::Value*>(unsigned long, char*, char*, llvm::Value* const&, llvm::Value* const&)
Line
Count
Source
555
20.1M
                    const T &arg, const Ts &...args) {
556
20.1M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
20.1M
558
20.1M
    // Recurse to the next argument.
559
20.1M
    return combine(length, buffer_ptr, buffer_end, args...);
560
20.1M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Value*>(unsigned long, char*, char*, llvm::Value* const&)
Line
Count
Source
555
28.2M
                    const T &arg, const Ts &...args) {
556
28.2M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
28.2M
558
28.2M
    // Recurse to the next argument.
559
28.2M
    return combine(length, buffer_ptr, buffer_end, args...);
560
28.2M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::CmpInst::Predicate, llvm::Value*, llvm::Value*>(unsigned long, char*, char*, unsigned int const&, llvm::CmpInst::Predicate const&, llvm::Value* const&, llvm::Value* const&)
Line
Count
Source
555
12.6M
                    const T &arg, const Ts &...args) {
556
12.6M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
12.6M
558
12.6M
    // Recurse to the next argument.
559
12.6M
    return combine(length, buffer_ptr, buffer_end, args...);
560
12.6M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::CmpInst::Predicate, llvm::Value*, llvm::Value*>(unsigned long, char*, char*, llvm::CmpInst::Predicate const&, llvm::Value* const&, llvm::Value* const&)
Line
Count
Source
555
12.6M
                    const T &arg, const Ts &...args) {
556
12.6M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
12.6M
558
12.6M
    // Recurse to the next argument.
559
12.6M
    return combine(length, buffer_ptr, buffer_end, args...);
560
12.6M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::SelectPatternFlavor, llvm::Value*, llvm::Value*>(unsigned long, char*, char*, unsigned int const&, llvm::SelectPatternFlavor const&, llvm::Value* const&, llvm::Value* const&)
Line
Count
Source
555
215k
                    const T &arg, const Ts &...args) {
556
215k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
215k
558
215k
    // Recurse to the next argument.
559
215k
    return combine(length, buffer_ptr, buffer_end, args...);
560
215k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::SelectPatternFlavor, llvm::Value*, llvm::Value*>(unsigned long, char*, char*, llvm::SelectPatternFlavor const&, llvm::Value* const&, llvm::Value* const&)
Line
Count
Source
555
215k
                    const T &arg, const Ts &...args) {
556
215k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
215k
558
215k
    // Recurse to the next argument.
559
215k
    return combine(length, buffer_ptr, buffer_end, args...);
560
215k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Instruction::CastOps, llvm::Type*, llvm::Value*>(unsigned long, char*, char*, llvm::Instruction::CastOps const&, llvm::Type* const&, llvm::Value* const&)
Line
Count
Source
555
8.13M
                    const T &arg, const Ts &...args) {
556
8.13M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
8.13M
558
8.13M
    // Recurse to the next argument.
559
8.13M
    return combine(length, buffer_ptr, buffer_end, args...);
560
8.13M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Type*, llvm::Value*>(unsigned long, char*, char*, llvm::Type* const&, llvm::Value* const&)
Line
Count
Source
555
8.13M
                    const T &arg, const Ts &...args) {
556
8.13M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
8.13M
558
8.13M
    // Recurse to the next argument.
559
8.13M
    return combine(length, buffer_ptr, buffer_end, args...);
560
8.13M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Value*, llvm::hash_code>(unsigned long, char*, char*, unsigned int const&, llvm::Value* const&, llvm::hash_code const&)
Line
Count
Source
555
346k
                    const T &arg, const Ts &...args) {
556
346k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
346k
558
346k
    // Recurse to the next argument.
559
346k
    return combine(length, buffer_ptr, buffer_end, args...);
560
346k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Value*, llvm::hash_code>(unsigned long, char*, char*, llvm::Value* const&, llvm::hash_code const&)
Line
Count
Source
555
465k
                    const T &arg, const Ts &...args) {
556
465k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
465k
558
465k
    // Recurse to the next argument.
559
465k
    return combine(length, buffer_ptr, buffer_end, args...);
560
465k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Value*, llvm::Value*, llvm::hash_code>(unsigned long, char*, char*, unsigned int const&, llvm::Value* const&, llvm::Value* const&, llvm::hash_code const&)
Line
Count
Source
555
118k
                    const T &arg, const Ts &...args) {
556
118k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
118k
558
118k
    // Recurse to the next argument.
559
118k
    return combine(length, buffer_ptr, buffer_end, args...);
560
118k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Value*, llvm::Value*, llvm::hash_code>(unsigned long, char*, char*, llvm::Value* const&, llvm::Value* const&, llvm::hash_code const&)
Line
Count
Source
555
118k
                    const T &arg, const Ts &...args) {
556
118k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
118k
558
118k
    // Recurse to the next argument.
559
118k
    return combine(length, buffer_ptr, buffer_end, args...);
560
118k
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, llvm::Type*, llvm::hash_code>(unsigned long, char*, char*, llvm::hash_code const&, llvm::Type* const&, llvm::hash_code const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Type*, llvm::hash_code>(unsigned long, char*, char*, llvm::Type* const&, llvm::hash_code const&)
Line
Count
Source
555
31.0M
                    const T &arg, const Ts &...args) {
556
31.0M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
31.0M
558
31.0M
    // Recurse to the next argument.
559
31.0M
    return combine(length, buffer_ptr, buffer_end, args...);
560
31.0M
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, llvm::MemoryAccess const*>(unsigned long, char*, char*, llvm::hash_code const&, llvm::MemoryAccess const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MemoryAccess const*>(unsigned long, char*, char*, llvm::MemoryAccess const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, llvm::BasicBlock*>(unsigned long, char*, char*, llvm::hash_code const&, llvm::BasicBlock* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, llvm::Type*, llvm::Value*>(unsigned long, char*, char*, llvm::hash_code const&, llvm::Type* const&, llvm::Value* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, llvm::Type*, llvm::Constant*>(unsigned long, char*, char*, llvm::hash_code const&, llvm::Type* const&, llvm::Constant* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Type*, llvm::Constant*>(unsigned long, char*, char*, llvm::Type* const&, llvm::Constant* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Constant*>(unsigned long, char*, char*, llvm::Constant* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, llvm::Instruction*>(unsigned long, char*, char*, llvm::hash_code const&, llvm::Instruction* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Instruction*>(unsigned long, char*, char*, llvm::Instruction* const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Type*, llvm::hash_code>(unsigned long, char*, char*, unsigned int const&, llvm::Type* const&, llvm::hash_code const&)
Line
Count
Source
555
31.0M
                    const T &arg, const Ts &...args) {
556
31.0M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
31.0M
558
31.0M
    // Recurse to the next argument.
559
31.0M
    return combine(length, buffer_ptr, buffer_end, args...);
560
31.0M
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, unsigned int, bool>(unsigned long, char*, char*, llvm::hash_code const&, unsigned int const&, bool const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Type*, unsigned int, bool>(unsigned long, char*, char*, unsigned int const&, llvm::Type* const&, unsigned int const&, bool const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Type*, unsigned int, bool>(unsigned long, char*, char*, llvm::Type* const&, unsigned int const&, bool const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned char, unsigned char, unsigned int>(unsigned long, char*, char*, unsigned char const&, unsigned char const&, unsigned int const&)
Line
Count
Source
555
77.2k
                    const T &arg, const Ts &...args) {
556
77.2k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
77.2k
558
77.2k
    // Recurse to the next argument.
559
77.2k
    return combine(length, buffer_ptr, buffer_end, args...);
560
77.2k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned char, unsigned int>(unsigned long, char*, char*, unsigned char const&, unsigned int const&)
Line
Count
Source
555
77.2k
                    const T &arg, const Ts &...args) {
556
77.2k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
77.2k
558
77.2k
    // Recurse to the next argument.
559
77.2k
    return combine(length, buffer_ptr, buffer_end, args...);
560
77.2k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned char, unsigned char, unsigned int, short, llvm::hash_code>(unsigned long, char*, char*, unsigned char const&, unsigned char const&, unsigned int const&, short const&, llvm::hash_code const&)
Line
Count
Source
555
925k
                    const T &arg, const Ts &...args) {
556
925k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
925k
558
925k
    // Recurse to the next argument.
559
925k
    return combine(length, buffer_ptr, buffer_end, args...);
560
925k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned char, unsigned int, short, llvm::hash_code>(unsigned long, char*, char*, unsigned char const&, unsigned int const&, short const&, llvm::hash_code const&)
Line
Count
Source
555
925k
                    const T &arg, const Ts &...args) {
556
925k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
925k
558
925k
    // Recurse to the next argument.
559
925k
    return combine(length, buffer_ptr, buffer_end, args...);
560
925k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, short, llvm::hash_code>(unsigned long, char*, char*, unsigned int const&, short const&, llvm::hash_code const&)
Line
Count
Source
555
925k
                    const T &arg, const Ts &...args) {
556
925k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
925k
558
925k
    // Recurse to the next argument.
559
925k
    return combine(length, buffer_ptr, buffer_end, args...);
560
925k
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<short, llvm::hash_code>(unsigned long, char*, char*, short const&, llvm::hash_code const&)
Line
Count
Source
555
925k
                    const T &arg, const Ts &...args) {
556
925k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
925k
558
925k
    // Recurse to the next argument.
559
925k
    return combine(length, buffer_ptr, buffer_end, args...);
560
925k
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::fltSemantics const*>(unsigned long, char*, char*, llvm::fltSemantics const* const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned long long>(unsigned long, char*, char*, unsigned long long const&)
Line
Count
Source
555
219M
                    const T &arg, const Ts &...args) {
556
219M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
219M
558
219M
    // Recurse to the next argument.
559
219M
    return combine(length, buffer_ptr, buffer_end, args...);
560
219M
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, llvm::StringRef>(unsigned long, char*, char*, llvm::hash_code const&, llvm::StringRef const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::StringRef>(unsigned long, char*, char*, llvm::StringRef const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >(unsigned long, char*, char*, llvm::hash_code const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >(unsigned long, char*, char*, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >(unsigned long, char*, char*, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >(unsigned long, char*, char*, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >(unsigned long, char*, char*, llvm::hash_code const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, bool, bool>(unsigned long, char*, char*, llvm::hash_code const&, bool const&, bool const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<bool, bool>(unsigned long, char*, char*, bool const&, bool const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, bool>(unsigned long, char*, char*, llvm::hash_code const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, bool const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, bool>(unsigned long, char*, char*, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, bool const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, unsigned int, unsigned int, unsigned int, unsigned int, unsigned int, unsigned int>(unsigned long, char*, char*, llvm::hash_code const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, unsigned int, unsigned int, unsigned int, unsigned int, unsigned int, unsigned int>(unsigned long, char*, char*, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, unsigned int, unsigned int, unsigned int, unsigned int, unsigned int, unsigned int>(unsigned long, char*, char*, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int, unsigned int, unsigned int, unsigned int, unsigned int>(unsigned long, char*, char*, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int, unsigned int, unsigned int, unsigned int>(unsigned long, char*, char*, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int, unsigned int, unsigned int>(unsigned long, char*, char*, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int, unsigned int>(unsigned long, char*, char*, unsigned int const&, unsigned int const&, unsigned int const&)
Line
Count
Source
555
742k
                    const T &arg, const Ts &...args) {
556
742k
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
742k
558
742k
    // Recurse to the next argument.
559
742k
    return combine(length, buffer_ptr, buffer_end, args...);
560
742k
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, unsigned long long>(unsigned long, char*, char*, llvm::hash_code const&, unsigned long long const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<void*, void*>(unsigned long, char*, char*, void* const&, void* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<void*>(unsigned long, char*, char*, void* const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<clang::NestedNameSpecifier*, void*>(unsigned long, char*, char*, clang::NestedNameSpecifier* const&, void* const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int, llvm::RegisterBankInfo::ValueMapping const*, unsigned int>(unsigned long, char*, char*, unsigned int const&, unsigned int const&, llvm::RegisterBankInfo::ValueMapping const* const&, unsigned int const&)
Line
Count
Source
555
14.3M
                    const T &arg, const Ts &...args) {
556
14.3M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
14.3M
558
14.3M
    // Recurse to the next argument.
559
14.3M
    return combine(length, buffer_ptr, buffer_end, args...);
560
14.3M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::RegisterBankInfo::ValueMapping const*, unsigned int>(unsigned long, char*, char*, unsigned int const&, llvm::RegisterBankInfo::ValueMapping const* const&, unsigned int const&)
Line
Count
Source
555
14.3M
                    const T &arg, const Ts &...args) {
556
14.3M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
14.3M
558
14.3M
    // Recurse to the next argument.
559
14.3M
    return combine(length, buffer_ptr, buffer_end, args...);
560
14.3M
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::RegisterBankInfo::ValueMapping const*, unsigned int>(unsigned long, char*, char*, llvm::RegisterBankInfo::ValueMapping const* const&, unsigned int const&)
Line
Count
Source
555
14.3M
                    const T &arg, const Ts &...args) {
556
14.3M
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
14.3M
558
14.3M
    // Recurse to the next argument.
559
14.3M
    return combine(length, buffer_ptr, buffer_end, args...);
560
14.3M
  }
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<long long, long>(unsigned long, char*, char*, long long const&, long const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<long>(unsigned long, char*, char*, long const&)
Unexecuted instantiation: llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned char, bool>(unsigned long, char*, char*, unsigned char const&, bool const&)
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned long long, lld::DefinedAtom::ContentType, llvm::hash_code>(unsigned long, char*, char*, unsigned long long const&, lld::DefinedAtom::ContentType const&, llvm::hash_code const&)
Line
Count
Source
555
54
                    const T &arg, const Ts &...args) {
556
54
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
54
558
54
    // Recurse to the next argument.
559
54
    return combine(length, buffer_ptr, buffer_end, args...);
560
54
  }
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<lld::DefinedAtom::ContentType, llvm::hash_code>(unsigned long, char*, char*, lld::DefinedAtom::ContentType const&, llvm::hash_code const&)
Line
Count
Source
555
54
                    const T &arg, const Ts &...args) {
556
54
    buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg));
557
54
558
54
    // Recurse to the next argument.
559
54
    return combine(length, buffer_ptr, buffer_end, args...);
560
54
  }
561
562
  /// Base case for recursive, variadic combining.
563
  ///
564
  /// The base case when combining arguments recursively is reached when all
565
  /// arguments have been handled. It flushes the remaining buffer and
566
  /// constructs a hash_code.
567
440M
  hash_code combine(size_t length, char *buffer_ptr, char *buffer_end) {
568
440M
    // Check whether the entire set of values fit in the buffer. If so, we'll
569
440M
    // use the optimized short hashing routine and skip state entirely.
570
440M
    if (length == 0)
571
440M
      return hash_short(buffer, buffer_ptr - buffer, seed);
572
18.4E
573
18.4E
    // Mix the final buffer, rotating it if we did a partial fill in order to
574
18.4E
    // simulate doing a mix of the last 64-bytes. That is how the algorithm
575
18.4E
    // works when we have a contiguous byte sequence, and we want to emulate
576
18.4E
    // that here.
577
18.4E
    std::rotate(buffer, buffer_ptr, buffer_end);
578
18.4E
579
18.4E
    // Mix this chunk into the current state.
580
18.4E
    state.mix(buffer);
581
18.4E
    length += buffer_ptr - buffer;
582
18.4E
583
18.4E
    return state.finalize(length);
584
18.4E
  }
585
};
586
587
} // namespace detail
588
} // namespace hashing
589
590
/// Combine values into a single hash_code.
591
///
592
/// This routine accepts a varying number of arguments of any type. It will
593
/// attempt to combine them into a single hash_code. For user-defined types it
594
/// attempts to call a \see hash_value overload (via ADL) for the type. For
595
/// integer and pointer types it directly combines their data into the
596
/// resulting hash_code.
597
///
598
/// The result is suitable for returning from a user's hash_value
599
/// *implementation* for their user-defined type. Consumers of a type should
600
/// *not* call this routine, they should instead call 'hash_value'.
601
440M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
440M
  // Recursively hash each argument using a helper class.
603
440M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
440M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
440M
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<unsigned int, unsigned int, llvm::hash_code>(unsigned int const&, unsigned int const&, llvm::hash_code const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<unsigned int, unsigned int>(unsigned int const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::coverage::CounterExpression::ExprKind, llvm::coverage::Counter::CounterKind, unsigned int, llvm::coverage::Counter::CounterKind, unsigned int>(llvm::coverage::CounterExpression::ExprKind const&, llvm::coverage::Counter::CounterKind const&, unsigned int const&, llvm::coverage::Counter::CounterKind const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::Loop const*, llvm::BasicBlock*>(llvm::Loop const* const&, llvm::BasicBlock* const&)
llvm::hash_code llvm::hash_combine<llvm::hash_code, bool>(llvm::hash_code const&, bool const&)
Line
Count
Source
601
84.0k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
84.0k
  // Recursively hash each argument using a helper class.
603
84.0k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
84.0k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
84.0k
}
llvm::hash_code llvm::hash_combine<unsigned int, llvm::hash_code>(unsigned int const&, llvm::hash_code const&)
Line
Count
Source
601
17.6M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
17.6M
  // Recursively hash each argument using a helper class.
603
17.6M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
17.6M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
17.6M
}
llvm::hash_code llvm::hash_combine<llvm::MachineOperand, llvm::MachineOperand, llvm::MachineOperand, llvm::MachineOperand>(llvm::MachineOperand const&, llvm::MachineOperand const&, llvm::MachineOperand const&, llvm::MachineOperand const&)
Line
Count
Source
601
92.3k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
92.3k
  // Recursively hash each argument using a helper class.
603
92.3k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
92.3k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
92.3k
}
llvm::hash_code llvm::hash_combine<llvm::hash_code, int>(llvm::hash_code const&, int const&)
Line
Count
Source
601
146
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
146
  // Recursively hash each argument using a helper class.
603
146
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
146
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
146
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, char const*>(llvm::hash_code const&, char const* const&)
llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::GlobalValue const*>(llvm::hash_code const&, llvm::GlobalValue const* const&)
Line
Count
Source
601
51.7k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
51.7k
  // Recursively hash each argument using a helper class.
603
51.7k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
51.7k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
51.7k
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::BlockAddress const*>(llvm::hash_code const&, llvm::BlockAddress const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::MCSymbol*>(llvm::hash_code const&, llvm::MCSymbol* const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::MachineBasicBlock*>(llvm::hash_code const&, llvm::MachineBasicBlock* const&)
llvm::hash_code llvm::hash_combine<bool, unsigned int>(bool const&, unsigned int const&)
Line
Count
Source
601
2.10M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
2.10M
  // Recursively hash each argument using a helper class.
603
2.10M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
2.10M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
2.10M
}
llvm::hash_code llvm::hash_combine<llvm::hash_code, unsigned int>(llvm::hash_code const&, unsigned int const&)
Line
Count
Source
601
77.0k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
77.0k
  // Recursively hash each argument using a helper class.
603
77.0k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
77.0k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
77.0k
}
llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, unsigned int, bool>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, unsigned int const&, bool const&)
Line
Count
Source
601
36.9M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
36.9M
  // Recursively hash each argument using a helper class.
603
36.9M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
36.9M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
36.9M
}
llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, long long>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, long long const&)
Line
Count
Source
601
16.4M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
16.4M
  // Recursively hash each argument using a helper class.
603
16.4M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
16.4M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
16.4M
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::ConstantInt const*>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::ConstantInt const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::ConstantFP const*>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::ConstantFP const* const&)
llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::MachineBasicBlock*>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::MachineBasicBlock* const&)
Line
Count
Source
601
1.67M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
1.67M
  // Recursively hash each argument using a helper class.
603
1.67M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
1.67M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
1.67M
}
llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, int>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, int const&)
Line
Count
Source
601
533k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
533k
  // Recursively hash each argument using a helper class.
603
533k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
533k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
533k
}
llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, int, long long>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, int const&, long long const&)
Line
Count
Source
601
351k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
351k
  // Recursively hash each argument using a helper class.
603
351k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
351k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
351k
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, long long, char const*>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, long long const&, char const* const&)
llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::GlobalValue const*, long long>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::GlobalValue const* const&, long long const&)
Line
Count
Source
601
3.76M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
3.76M
  // Recursively hash each argument using a helper class.
603
3.76M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
3.76M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
3.76M
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::BlockAddress const*, long long>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::BlockAddress const* const&, long long const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, unsigned int const*>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, unsigned int const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::MDNode const*>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::MDNode const* const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::MCSymbol*>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::MCSymbol* const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, unsigned int>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::Intrinsic::ID>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::Intrinsic::ID const&)
llvm::hash_code llvm::hash_combine<llvm::StringRef, llvm::StringRef, bool, bool, llvm::InlineAsm::AsmDialect, llvm::FunctionType*>(llvm::StringRef const&, llvm::StringRef const&, bool const&, bool const&, llvm::InlineAsm::AsmDialect const&, llvm::FunctionType* const&)
Line
Count
Source
601
7.39k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
7.39k
  // Recursively hash each argument using a helper class.
603
7.39k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
7.39k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
7.39k
}
llvm::hash_code llvm::hash_combine<unsigned char, unsigned char, unsigned short, llvm::hash_code, llvm::hash_code>(unsigned char const&, unsigned char const&, unsigned short const&, llvm::hash_code const&, llvm::hash_code const&)
Line
Count
Source
601
16.7M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
16.7M
  // Recursively hash each argument using a helper class.
603
16.7M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
16.7M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
16.7M
}
llvm::hash_code llvm::hash_combine<llvm::Type const*, llvm::hash_code, bool>(llvm::Type const* const&, llvm::hash_code const&, bool const&)
Line
Count
Source
601
6.59M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
6.59M
  // Recursively hash each argument using a helper class.
603
6.59M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
6.59M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
6.59M
}
llvm::hash_code llvm::hash_combine<unsigned int, unsigned int, llvm::Metadata*, llvm::Metadata*>(unsigned int const&, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&)
Line
Count
Source
601
16.1M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
16.1M
  // Recursively hash each argument using a helper class.
603
16.1M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
16.1M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
16.1M
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<unsigned int, unsigned int, llvm::MDString*>(unsigned int const&, unsigned int const&, llvm::MDString* const&)
llvm::hash_code llvm::hash_combine<long long, long long>(long long const&, long long const&)
Line
Count
Source
601
1
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
1
  // Recursively hash each argument using a helper class.
603
1
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
1
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
1
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::Metadata*, long long>(llvm::Metadata* const&, long long const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<long long, llvm::MDString*>(long long const&, llvm::MDString* const&)
llvm::hash_code llvm::hash_combine<unsigned int, llvm::MDString*, unsigned long long, unsigned int, unsigned int>(unsigned int const&, llvm::MDString* const&, unsigned long long const&, unsigned int const&, unsigned int const&)
Line
Count
Source
601
30
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
30
  // Recursively hash each argument using a helper class.
603
30
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
30
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
30
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::MDString*, llvm::Metadata*>(llvm::MDString* const&, llvm::Metadata* const&)
llvm::hash_code llvm::hash_combine<unsigned int, llvm::MDString*, llvm::Metadata*, unsigned int, llvm::Metadata*, llvm::Metadata*, unsigned int>(unsigned int const&, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&)
Line
Count
Source
601
73
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
73
  // Recursively hash each argument using a helper class.
603
73
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
73
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
73
}
llvm::hash_code llvm::hash_combine<llvm::MDString*, llvm::Metadata*, unsigned int, llvm::Metadata*, llvm::Metadata*, llvm::Metadata*, llvm::Metadata*>(llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&)
Line
Count
Source
601
8
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
8
  // Recursively hash each argument using a helper class.
603
8
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
8
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
8
}
llvm::hash_code llvm::hash_combine<unsigned int, unsigned char, llvm::Metadata*>(unsigned int const&, unsigned char const&, llvm::Metadata* const&)
Line
Count
Source
601
108k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
108k
  // Recursively hash each argument using a helper class.
603
108k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
108k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
108k
}
llvm::hash_code llvm::hash_combine<llvm::MDString*, llvm::MDString*, int, llvm::MDString*, llvm::MDString*>(llvm::MDString* const&, llvm::MDString* const&, int const&, llvm::MDString* const&, llvm::MDString* const&)
Line
Count
Source
601
21.0k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
21.0k
  // Recursively hash each argument using a helper class.
603
21.0k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
21.0k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
21.0k
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::MDString*, llvm::Metadata*, llvm::Metadata*, llvm::Metadata*, unsigned int>(llvm::MDString* const&, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::Metadata*, llvm::Metadata*, unsigned int, unsigned int>(llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&, unsigned int const&)
llvm::hash_code llvm::hash_combine<llvm::Metadata*, llvm::Metadata*, unsigned int>(llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&)
Line
Count
Source
601
1.14k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
1.14k
  // Recursively hash each argument using a helper class.
603
1.14k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
1.14k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
1.14k
}
llvm::hash_code llvm::hash_combine<llvm::Metadata*, llvm::MDString*>(llvm::Metadata* const&, llvm::MDString* const&)
Line
Count
Source
601
3
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
3
  // Recursively hash each argument using a helper class.
603
3
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
3
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
3
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::Metadata*, llvm::MDString*, llvm::MDString*, llvm::MDString*, llvm::MDString*>(llvm::Metadata* const&, llvm::MDString* const&, llvm::MDString* const&, llvm::MDString* const&, llvm::MDString* const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<unsigned int, llvm::MDString*, llvm::Metadata*, llvm::Metadata*>(unsigned int const&, llvm::MDString* const&, llvm::Metadata* const&, llvm::Metadata* const&)
llvm::hash_code llvm::hash_combine<llvm::Metadata*, llvm::MDString*, llvm::MDString*, llvm::Metadata*, unsigned int, llvm::Metadata*, bool, bool, llvm::Metadata*>(llvm::Metadata* const&, llvm::MDString* const&, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, bool const&, bool const&, llvm::Metadata* const&)
Line
Count
Source
601
4
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
4
  // Recursively hash each argument using a helper class.
603
4
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
4
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
4
}
llvm::hash_code llvm::hash_combine<llvm::Metadata*, llvm::MDString*, llvm::Metadata*, unsigned int, llvm::Metadata*, unsigned int, unsigned int>(llvm::Metadata* const&, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::Metadata* const&, unsigned int const&, unsigned int const&)
Line
Count
Source
601
171
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
171
  // Recursively hash each argument using a helper class.
603
171
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
171
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
171
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::Metadata*, llvm::MDString*, unsigned int>(llvm::Metadata* const&, llvm::MDString* const&, unsigned int const&)
llvm::hash_code llvm::hash_combine<llvm::Metadata*, llvm::Metadata*>(llvm::Metadata* const&, llvm::Metadata* const&)
Line
Count
Source
601
7
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
7
  // Recursively hash each argument using a helper class.
603
7
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
7
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
7
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::MDString*, llvm::Metadata*, unsigned int, llvm::MDString*, llvm::MDString*, unsigned int, llvm::Metadata*>(llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&, llvm::MDString* const&, llvm::MDString* const&, unsigned int const&, llvm::Metadata* const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<unsigned int, llvm::Metadata*, llvm::Metadata*, llvm::Metadata*, unsigned int, llvm::MDString*>(unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&, llvm::MDString* const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<unsigned int, unsigned int, llvm::MDString*, llvm::MDString*>(unsigned int const&, unsigned int const&, llvm::MDString* const&, llvm::MDString* const&)
llvm::hash_code llvm::hash_combine<llvm::ArrayType*, unsigned int>(llvm::ArrayType* const&, unsigned int const&)
Line
Count
Source
601
37.0k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
37.0k
  // Recursively hash each argument using a helper class.
603
37.0k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
37.0k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
37.0k
}
llvm::hash_code llvm::hash_combine<llvm::StructType*, unsigned int>(llvm::StructType* const&, unsigned int const&)
Line
Count
Source
601
121k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
121k
  // Recursively hash each argument using a helper class.
603
121k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
121k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
121k
}
llvm::hash_code llvm::hash_combine<llvm::VectorType*, unsigned int>(llvm::VectorType* const&, unsigned int const&)
Line
Count
Source
601
175k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
175k
  // Recursively hash each argument using a helper class.
603
175k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
175k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
175k
}
llvm::hash_code llvm::hash_combine<llvm::Type*, unsigned int>(llvm::Type* const&, unsigned int const&)
Line
Count
Source
601
16.7M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
16.7M
  // Recursively hash each argument using a helper class.
603
16.7M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
16.7M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
16.7M
}
llvm::hash_code llvm::hash_combine<llvm::PointerType*, unsigned int>(llvm::PointerType* const&, unsigned int const&)
Line
Count
Source
601
7.39k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
7.39k
  // Recursively hash each argument using a helper class.
603
7.39k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
7.39k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
7.39k
}
llvm::hash_code llvm::hash_combine<llvm::MCSymbol const*, unsigned int, unsigned int, bool, bool, unsigned int>(llvm::MCSymbol const* const&, unsigned int const&, unsigned int const&, bool const&, bool const&, unsigned int const&)
Line
Count
Source
601
30.8k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
30.8k
  // Recursively hash each argument using a helper class.
603
30.8k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
30.8k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
30.8k
}
llvm::hash_code llvm::hash_combine<llvm::Instruction::BinaryOps, llvm::Value*, llvm::Value*>(llvm::Instruction::BinaryOps const&, llvm::Value* const&, llvm::Value* const&)
Line
Count
Source
601
7.28M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
7.28M
  // Recursively hash each argument using a helper class.
603
7.28M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
7.28M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
7.28M
}
llvm::hash_code llvm::hash_combine<unsigned int, llvm::CmpInst::Predicate, llvm::Value*, llvm::Value*>(unsigned int const&, llvm::CmpInst::Predicate const&, llvm::Value* const&, llvm::Value* const&)
Line
Count
Source
601
12.6M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
12.6M
  // Recursively hash each argument using a helper class.
603
12.6M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
12.6M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
12.6M
}
llvm::hash_code llvm::hash_combine<unsigned int, llvm::SelectPatternFlavor, llvm::Value*, llvm::Value*>(unsigned int const&, llvm::SelectPatternFlavor const&, llvm::Value* const&, llvm::Value* const&)
Line
Count
Source
601
215k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
215k
  // Recursively hash each argument using a helper class.
603
215k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
215k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
215k
}
llvm::hash_code llvm::hash_combine<llvm::Instruction::CastOps, llvm::Type*, llvm::Value*>(llvm::Instruction::CastOps const&, llvm::Type* const&, llvm::Value* const&)
Line
Count
Source
601
8.13M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
8.13M
  // Recursively hash each argument using a helper class.
603
8.13M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
8.13M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
8.13M
}
llvm::hash_code llvm::hash_combine<unsigned int, llvm::Value*, llvm::hash_code>(unsigned int const&, llvm::Value* const&, llvm::hash_code const&)
Line
Count
Source
601
346k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
346k
  // Recursively hash each argument using a helper class.
603
346k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
346k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
346k
}
llvm::hash_code llvm::hash_combine<unsigned int, llvm::Value*, llvm::Value*, llvm::hash_code>(unsigned int const&, llvm::Value* const&, llvm::Value* const&, llvm::hash_code const&)
Line
Count
Source
601
118k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
118k
  // Recursively hash each argument using a helper class.
603
118k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
118k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
118k
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::Type*, llvm::hash_code>(llvm::hash_code const&, llvm::Type* const&, llvm::hash_code const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::MemoryAccess const*>(llvm::hash_code const&, llvm::MemoryAccess const* const&)
llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::hash_code>(llvm::hash_code const&, llvm::hash_code const&)
Line
Count
Source
601
8.25M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
8.25M
  // Recursively hash each argument using a helper class.
603
8.25M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
8.25M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
8.25M
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::BasicBlock*>(llvm::hash_code const&, llvm::BasicBlock* const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::Type*, llvm::Value*>(llvm::hash_code const&, llvm::Type* const&, llvm::Value* const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::Type*, llvm::Constant*>(llvm::hash_code const&, llvm::Type* const&, llvm::Constant* const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::Instruction*>(llvm::hash_code const&, llvm::Instruction* const&)
llvm::hash_code llvm::hash_combine<unsigned int, llvm::Type*, llvm::hash_code>(unsigned int const&, llvm::Type* const&, llvm::hash_code const&)
Line
Count
Source
601
31.0M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
31.0M
  // Recursively hash each argument using a helper class.
603
31.0M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
31.0M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
31.0M
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, unsigned int, bool>(llvm::hash_code const&, unsigned int const&, bool const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<unsigned int, llvm::Type*, unsigned int, bool>(unsigned int const&, llvm::Type* const&, unsigned int const&, bool const&)
llvm::hash_code llvm::hash_combine<unsigned char, unsigned char, unsigned int>(unsigned char const&, unsigned char const&, unsigned int const&)
Line
Count
Source
601
77.2k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
77.2k
  // Recursively hash each argument using a helper class.
603
77.2k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
77.2k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
77.2k
}
llvm::hash_code llvm::hash_combine<unsigned char, unsigned char, unsigned int, short, llvm::hash_code>(unsigned char const&, unsigned char const&, unsigned int const&, short const&, llvm::hash_code const&)
Line
Count
Source
601
925k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
925k
  // Recursively hash each argument using a helper class.
603
925k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
925k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
925k
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::fltSemantics const*>(llvm::fltSemantics const* const&)
llvm::hash_code llvm::hash_combine<unsigned long long>(unsigned long long const&)
Line
Count
Source
601
219M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
219M
  // Recursively hash each argument using a helper class.
603
219M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
219M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
219M
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::StringRef>(llvm::hash_code const&, llvm::StringRef const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >(llvm::hash_code const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >(llvm::hash_code const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, bool, bool>(llvm::hash_code const&, bool const&, bool const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, bool>(llvm::hash_code const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, bool const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, unsigned int, unsigned int, unsigned int, unsigned int, unsigned int, unsigned int>(llvm::hash_code const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&, unsigned int const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, unsigned long long>(llvm::hash_code const&, unsigned long long const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<void*, void*>(void* const&, void* const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<clang::NestedNameSpecifier*, void*>(clang::NestedNameSpecifier* const&, void* const&)
llvm::hash_code llvm::hash_combine<unsigned int, unsigned int, unsigned int>(unsigned int const&, unsigned int const&, unsigned int const&)
Line
Count
Source
601
742k
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
742k
  // Recursively hash each argument using a helper class.
603
742k
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
742k
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
742k
}
llvm::hash_code llvm::hash_combine<unsigned int, unsigned int, llvm::RegisterBankInfo::ValueMapping const*, unsigned int>(unsigned int const&, unsigned int const&, llvm::RegisterBankInfo::ValueMapping const* const&, unsigned int const&)
Line
Count
Source
601
14.3M
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
14.3M
  // Recursively hash each argument using a helper class.
603
14.3M
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
14.3M
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
14.3M
}
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<long long, long>(long long const&, long const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >(std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<unsigned int, int>(unsigned int const&, int const&)
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<unsigned char, bool>(unsigned char const&, bool const&)
llvm::hash_code llvm::hash_combine<unsigned long long, lld::DefinedAtom::ContentType, llvm::hash_code>(unsigned long long const&, lld::DefinedAtom::ContentType const&, llvm::hash_code const&)
Line
Count
Source
601
54
template <typename ...Ts> hash_code hash_combine(const Ts &...args) {
602
54
  // Recursively hash each argument using a helper class.
603
54
  ::llvm::hashing::detail::hash_combine_recursive_helper helper;
604
54
  return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
605
54
}
606
607
// Implementation details for implementations of hash_value overloads provided
608
// here.
609
namespace hashing {
610
namespace detail {
611
612
/// Helper to hash the value of a single integer.
613
///
614
/// Overloads for smaller integer types are not provided to ensure consistent
615
/// behavior in the presence of integral promotions. Essentially,
616
/// "hash_value('4')" and "hash_value('0' + 4)" should be the same.
617
0
inline hash_code hash_integer_value(uint64_t value) {
618
0
  // Similar to hash_4to8_bytes but using a seed instead of length.
619
0
  const uint64_t seed = get_execution_seed();
620
0
  const char *s = reinterpret_cast<const char *>(&value);
621
0
  const uint64_t a = fetch32(s);
622
0
  return hash_16_bytes(seed + (a << 3), fetch32(s + 4));
623
0
}
624
625
} // namespace detail
626
} // namespace hashing
627
628
// Declared and documented above, but defined here so that any of the hashing
629
// infrastructure is available.
630
template <typename T>
631
typename std::enable_if<is_integral_or_enum<T>::value, hash_code>::type
632
0
hash_value(T value) {
633
0
  return ::llvm::hashing::detail::hash_integer_value(
634
0
      static_cast<uint64_t>(value));
635
0
}
636
637
// Declared and documented above, but defined here so that any of the hashing
638
// infrastructure is available.
639
0
template <typename T> hash_code hash_value(const T *ptr) {
640
0
  return ::llvm::hashing::detail::hash_integer_value(
641
0
    reinterpret_cast<uintptr_t>(ptr));
642
0
}
643
644
// Declared and documented above, but defined here so that any of the hashing
645
// infrastructure is available.
646
template <typename T, typename U>
647
hash_code hash_value(const std::pair<T, U> &arg) {
648
  return hash_combine(arg.first, arg.second);
649
}
650
651
// Declared and documented above, but defined here so that any of the hashing
652
// infrastructure is available.
653
template <typename T>
654
2
hash_code hash_value(const std::basic_string<T> &arg) {
655
2
  return hash_combine_range(arg.begin(), arg.end());
656
2
}
657
658
} // namespace llvm
659
660
#endif