546 | 1.07G | } char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<unsigned int>(unsigned long&, char*, char*, unsigned int) Line | Count | Source | 514 | 289M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 289M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 289M | } | 545 | 289M | return buffer_ptr; | 546 | 289M | } |
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Loop const*>(unsigned long&, char*, char*, llvm::Loop const*) char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::BasicBlock*>(unsigned long&, char*, char*, llvm::BasicBlock*) Line | Count | Source | 514 | 273 | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 273 | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 273 | } | 545 | 273 | return buffer_ptr; | 546 | 273 | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<unsigned long>(unsigned long&, char*, char*, unsigned long) Line | Count | Source | 514 | 101M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 101M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 101M | } | 545 | 101M | return buffer_ptr; | 546 | 101M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<bool>(unsigned long&, char*, char*, bool) Line | Count | Source | 514 | 75.4M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 75.4M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 75.4M | } | 545 | 75.4M | return buffer_ptr; | 546 | 75.4M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<int>(unsigned long&, char*, char*, int) Line | Count | Source | 514 | 969k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 969k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 4 | // Check for skew which prevents the buffer from being packed, and do | 517 | 4 | // a partial store into the buffer to fill it. This is only a concern | 518 | 4 | // with the variadic combine because that formation can have varying | 519 | 4 | // argument types. | 520 | 4 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 4 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 4 | | 523 | 4 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 4 | // either initialize the hash state (on the first full buffer) or mix | 525 | 4 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 4 | // length, not the buffered length. | 527 | 4 | if (length == 0) { | 528 | 4 | state = state.create(buffer, seed); | 529 | 4 | length = 64; | 530 | 4 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 4 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 4 | // data. | 537 | 4 | buffer_ptr = buffer; | 538 | 4 | | 539 | 4 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 4 | // store types smaller than the buffer. | 541 | 4 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 4 | partial_store_size)) | 543 | 0 | abort(); | 544 | 969k | } | 545 | 969k | return buffer_ptr; | 546 | 969k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<char const*>(unsigned long&, char*, char*, char const*) Line | Count | Source | 514 | 3 | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 3 | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 3 | } | 545 | 3 | return buffer_ptr; | 546 | 3 | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::GlobalValue const*>(unsigned long&, char*, char*, llvm::GlobalValue const*) Line | Count | Source | 514 | 6.10M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 6.10M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 6.10M | } | 545 | 6.10M | return buffer_ptr; | 546 | 6.10M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::BlockAddress const*>(unsigned long&, char*, char*, llvm::BlockAddress const*) Line | Count | Source | 514 | 516 | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 516 | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 516 | } | 545 | 516 | return buffer_ptr; | 546 | 516 | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::MCSymbol*>(unsigned long&, char*, char*, llvm::MCSymbol*) Line | Count | Source | 514 | 301 | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 301 | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 301 | } | 545 | 301 | return buffer_ptr; | 546 | 301 | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::MachineBasicBlock*>(unsigned long&, char*, char*, llvm::MachineBasicBlock*) Line | Count | Source | 514 | 1.75M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 1.75M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 1.75M | } | 545 | 1.75M | return buffer_ptr; | 546 | 1.75M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::DILocalVariable const*>(unsigned long&, char*, char*, llvm::DILocalVariable const*) Line | Count | Source | 514 | 19.6k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 19.6k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 19.6k | } | 545 | 19.6k | return buffer_ptr; | 546 | 19.6k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::DILocation const*>(unsigned long&, char*, char*, llvm::DILocation const*) Line | Count | Source | 514 | 19.6k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 19.6k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 19.6k | } | 545 | 19.6k | return buffer_ptr; | 546 | 19.6k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::MachineOperand::MachineOperandType>(unsigned long&, char*, char*, llvm::MachineOperand::MachineOperandType) Line | Count | Source | 514 | 81.0M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 81.0M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 81.0M | } | 545 | 81.0M | return buffer_ptr; | 546 | 81.0M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<long long>(unsigned long&, char*, char*, long long) Line | Count | Source | 514 | 31.6M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 31.6M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 31.6M | } | 545 | 31.6M | return buffer_ptr; | 546 | 31.6M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::ConstantInt const*>(unsigned long&, char*, char*, llvm::ConstantInt const*) Line | Count | Source | 514 | 24 | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 24 | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 24 | } | 545 | 24 | return buffer_ptr; | 546 | 24 | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::ConstantFP const*>(unsigned long&, char*, char*, llvm::ConstantFP const*) Line | Count | Source | 514 | 1.01k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 1.01k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 1.01k | } | 545 | 1.01k | return buffer_ptr; | 546 | 1.01k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<unsigned int const*>(unsigned long&, char*, char*, unsigned int const*) Line | Count | Source | 514 | 21 | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 21 | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 21 | } | 545 | 21 | return buffer_ptr; | 546 | 21 | } |
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 | 514 | 21.0k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 21.0k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 21.0k | } | 545 | 21.0k | return buffer_ptr; | 546 | 21.0k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::FunctionType*>(unsigned long&, char*, char*, llvm::FunctionType*) Line | Count | Source | 514 | 21.0k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 21.0k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 21.0k | } | 545 | 21.0k | return buffer_ptr; | 546 | 21.0k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<unsigned char>(unsigned long&, char*, char*, unsigned char) Line | Count | Source | 514 | 37.5M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 37.5M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 37.5M | } | 545 | 37.5M | return buffer_ptr; | 546 | 37.5M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<unsigned short>(unsigned long&, char*, char*, unsigned short) Line | Count | Source | 514 | 17.5M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 17.5M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 17.5M | } | 545 | 17.5M | return buffer_ptr; | 546 | 17.5M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Type const*>(unsigned long&, char*, char*, llvm::Type const*) Line | Count | Source | 514 | 7.85M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 7.85M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 7.85M | } | 545 | 7.85M | return buffer_ptr; | 546 | 7.85M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Metadata*>(unsigned long&, char*, char*, llvm::Metadata*) Line | Count | Source | 514 | 32.9M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 32.9M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 32.9M | } | 545 | 32.9M | return buffer_ptr; | 546 | 32.9M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::MDString*>(unsigned long&, char*, char*, llvm::MDString*) Line | Count | Source | 514 | 233k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 233k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 233k | } | 545 | 233k | return buffer_ptr; | 546 | 233k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<unsigned long long>(unsigned long&, char*, char*, unsigned long long) Line | Count | Source | 514 | 240M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 240M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 2 | // Check for skew which prevents the buffer from being packed, and do | 517 | 2 | // a partial store into the buffer to fill it. This is only a concern | 518 | 2 | // with the variadic combine because that formation can have varying | 519 | 2 | // argument types. | 520 | 2 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 2 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 2 | | 523 | 2 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 2 | // either initialize the hash state (on the first full buffer) or mix | 525 | 2 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 2 | // length, not the buffered length. | 527 | 2 | if (length == 0) { | 528 | 2 | state = state.create(buffer, seed); | 529 | 2 | length = 64; | 530 | 2 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 2 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 2 | // data. | 537 | 2 | buffer_ptr = buffer; | 538 | 2 | | 539 | 2 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 2 | // store types smaller than the buffer. | 541 | 2 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 2 | partial_store_size)) | 543 | 0 | abort(); | 544 | 240M | } | 545 | 240M | return buffer_ptr; | 546 | 240M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::ArrayType*>(unsigned long&, char*, char*, llvm::ArrayType*) Line | Count | Source | 514 | 61.9k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 61.9k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 61.9k | } | 545 | 61.9k | return buffer_ptr; | 546 | 61.9k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::StructType*>(unsigned long&, char*, char*, llvm::StructType*) Line | Count | Source | 514 | 207k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 207k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 207k | } | 545 | 207k | return buffer_ptr; | 546 | 207k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::VectorType*>(unsigned long&, char*, char*, llvm::VectorType*) Line | Count | Source | 514 | 231k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 231k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 231k | } | 545 | 231k | return buffer_ptr; | 546 | 231k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Type*>(unsigned long&, char*, char*, llvm::Type*) Line | Count | Source | 514 | 47.6M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 47.6M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 47.6M | } | 545 | 47.6M | return buffer_ptr; | 546 | 47.6M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::PointerType*>(unsigned long&, char*, char*, llvm::PointerType*) Line | Count | Source | 514 | 21.0k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 21.0k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 21.0k | } | 545 | 21.0k | return buffer_ptr; | 546 | 21.0k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::MCSymbol const*>(unsigned long&, char*, char*, llvm::MCSymbol const*) Line | Count | Source | 514 | 25.5k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 25.5k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 25.5k | } | 545 | 25.5k | return buffer_ptr; | 546 | 25.5k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Instruction::BinaryOps>(unsigned long&, char*, char*, llvm::Instruction::BinaryOps) Line | Count | Source | 514 | 7.53M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 7.53M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 7.53M | } | 545 | 7.53M | return buffer_ptr; | 546 | 7.53M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Value*>(unsigned long&, char*, char*, llvm::Value*) Line | Count | Source | 514 | 51.3M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 51.3M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 51.3M | } | 545 | 51.3M | return buffer_ptr; | 546 | 51.3M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::CmpInst::Predicate>(unsigned long&, char*, char*, llvm::CmpInst::Predicate) Line | Count | Source | 514 | 12.9M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 12.9M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 12.9M | } | 545 | 12.9M | return buffer_ptr; | 546 | 12.9M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::SelectPatternFlavor>(unsigned long&, char*, char*, llvm::SelectPatternFlavor) Line | Count | Source | 514 | 233k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 233k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 233k | } | 545 | 233k | return buffer_ptr; | 546 | 233k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Instruction::CastOps>(unsigned long&, char*, char*, llvm::Instruction::CastOps) Line | Count | Source | 514 | 8.46M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 8.46M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 8.46M | } | 545 | 8.46M | return buffer_ptr; | 546 | 8.46M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::MemoryAccess const*>(unsigned long&, char*, char*, llvm::MemoryAccess const*) Line | Count | Source | 514 | 1.15k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 1.15k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 1.15k | } | 545 | 1.15k | return buffer_ptr; | 546 | 1.15k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Constant*>(unsigned long&, char*, char*, llvm::Constant*) Line | Count | Source | 514 | 485 | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 485 | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 485 | } | 545 | 485 | return buffer_ptr; | 546 | 485 | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::Instruction*>(unsigned long&, char*, char*, llvm::Instruction*) Line | Count | Source | 514 | 278 | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 278 | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 278 | } | 545 | 278 | return buffer_ptr; | 546 | 278 | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<short>(unsigned long&, char*, char*, short) Line | Count | Source | 514 | 999k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 999k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 999k | } | 545 | 999k | return buffer_ptr; | 546 | 999k | } |
Unexecuted instantiation: char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::fltSemantics const*>(unsigned long&, char*, char*, llvm::fltSemantics const*) char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<void*>(unsigned long&, char*, char*, void*) Line | Count | Source | 514 | 116k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 116k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 116k | } | 545 | 116k | return buffer_ptr; | 546 | 116k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<clang::NestedNameSpecifier*>(unsigned long&, char*, char*, clang::NestedNameSpecifier*) Line | Count | Source | 514 | 930 | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 930 | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 930 | } | 545 | 930 | return buffer_ptr; | 546 | 930 | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::coverage::CounterExpression::ExprKind>(unsigned long&, char*, char*, llvm::coverage::CounterExpression::ExprKind) Line | Count | Source | 514 | 1.76k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 1.76k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 1.76k | } | 545 | 1.76k | return buffer_ptr; | 546 | 1.76k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::coverage::Counter::CounterKind>(unsigned long&, char*, char*, llvm::coverage::Counter::CounterKind) Line | Count | Source | 514 | 3.52k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 3.52k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 3.52k | } | 545 | 3.52k | return buffer_ptr; | 546 | 3.52k | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<long>(unsigned long&, char*, char*, long) Line | Count | Source | 514 | 62.4k | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 62.4k | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 62.4k | } | 545 | 62.4k | return buffer_ptr; | 546 | 62.4k | } |
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 | 514 | 16.2M | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 16.2M | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 16.2M | } | 545 | 16.2M | return buffer_ptr; | 546 | 16.2M | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<llvm::wasm::ValType>(unsigned long&, char*, char*, llvm::wasm::ValType) Line | Count | Source | 514 | 792 | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 792 | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 792 | } | 545 | 792 | return buffer_ptr; | 546 | 792 | } |
char* llvm::hashing::detail::hash_combine_recursive_helper::combine_data<lld::DefinedAtom::ContentType>(unsigned long&, char*, char*, lld::DefinedAtom::ContentType) Line | Count | Source | 514 | 54 | char *combine_data(size_t &length, char *buffer_ptr, char *buffer_end, T data) { | 515 | 54 | if (!store_and_advance(buffer_ptr, buffer_end, data)) { | 516 | 0 | // Check for skew which prevents the buffer from being packed, and do | 517 | 0 | // a partial store into the buffer to fill it. This is only a concern | 518 | 0 | // with the variadic combine because that formation can have varying | 519 | 0 | // argument types. | 520 | 0 | size_t partial_store_size = buffer_end - buffer_ptr; | 521 | 0 | memcpy(buffer_ptr, &data, partial_store_size); | 522 | 0 |
| 523 | 0 | // If the store fails, our buffer is full and ready to hash. We have to | 524 | 0 | // either initialize the hash state (on the first full buffer) or mix | 525 | 0 | // this buffer into the existing hash state. Length tracks the *hashed* | 526 | 0 | // length, not the buffered length. | 527 | 0 | if (length == 0) { | 528 | 0 | state = state.create(buffer, seed); | 529 | 0 | length = 64; | 530 | 0 | } else { | 531 | 0 | // Mix this chunk into the current state and bump length up by 64. | 532 | 0 | state.mix(buffer); | 533 | 0 | length += 64; | 534 | 0 | } | 535 | 0 | // Reset the buffer_ptr to the head of the buffer for the next chunk of | 536 | 0 | // data. | 537 | 0 | buffer_ptr = buffer; | 538 | 0 |
| 539 | 0 | // Try again to store into the buffer -- this cannot fail as we only | 540 | 0 | // store types smaller than the buffer. | 541 | 0 | if (!store_and_advance(buffer_ptr, buffer_end, data, | 542 | 0 | partial_store_size)) | 543 | 0 | abort(); | 544 | 54 | } | 545 | 54 | return buffer_ptr; | 546 | 54 | } |
|
559 | 1.07G | } 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 | 554 | 1.07M | const T &arg, const Ts &...args) { | 555 | 1.07M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.07M | | 557 | 1.07M | // Recurse to the next argument. | 558 | 1.07M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.07M | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int>(unsigned long, char*, char*, unsigned int const&) Line | Count | Source | 554 | 39.7M | const T &arg, const Ts &...args) { | 555 | 39.7M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 39.7M | | 557 | 39.7M | // Recurse to the next argument. | 558 | 39.7M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 39.7M | } |
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&) llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::BasicBlock*>(unsigned long, char*, char*, llvm::BasicBlock* const&) Line | Count | Source | 554 | 273 | const T &arg, const Ts &...args) { | 555 | 273 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 273 | | 557 | 273 | // Recurse to the next argument. | 558 | 273 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 273 | } |
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 | 554 | 8.08M | const T &arg, const Ts &...args) { | 555 | 8.08M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 8.08M | | 557 | 8.08M | // Recurse to the next argument. | 558 | 8.08M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 8.08M | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<bool>(unsigned long, char*, char*, bool const&) Line | Count | Source | 554 | 71.6M | const T &arg, const Ts &...args) { | 555 | 71.6M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 71.6M | | 557 | 71.6M | // Recurse to the next argument. | 558 | 71.6M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 71.6M | } |
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&) Line | Count | Source | 554 | 199 | const T &arg, const Ts &...args) { | 555 | 199 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 199 | | 557 | 199 | // Recurse to the next argument. | 558 | 199 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 199 | } |
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 | 554 | 17.8M | const T &arg, const Ts &...args) { | 555 | 17.8M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 17.8M | | 557 | 17.8M | // Recurse to the next argument. | 558 | 17.8M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 17.8M | } |
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 | 554 | 66.8M | const T &arg, const Ts &...args) { | 555 | 66.8M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 66.8M | | 557 | 66.8M | // Recurse to the next argument. | 558 | 66.8M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 66.8M | } |
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 | 554 | 84.3k | const T &arg, const Ts &...args) { | 555 | 84.3k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 84.3k | | 557 | 84.3k | // Recurse to the next argument. | 558 | 84.3k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 84.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 | 554 | 84.3k | const T &arg, const Ts &...args) { | 555 | 84.3k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 84.3k | | 557 | 84.3k | // Recurse to the next argument. | 558 | 84.3k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 84.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 | 554 | 84.3k | const T &arg, const Ts &...args) { | 555 | 84.3k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 84.3k | | 557 | 84.3k | // Recurse to the next argument. | 558 | 84.3k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 84.3k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand>(unsigned long, char*, char*, llvm::MachineOperand const&) Line | Count | Source | 554 | 84.3k | const T &arg, const Ts &...args) { | 555 | 84.3k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 84.3k | | 557 | 84.3k | // Recurse to the next argument. | 558 | 84.3k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 84.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 | 554 | 214 | const T &arg, const Ts &...args) { | 555 | 214 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 214 | | 557 | 214 | // Recurse to the next argument. | 558 | 214 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 214 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<int>(unsigned long, char*, char*, int const&) Line | Count | Source | 554 | 546k | const T &arg, const Ts &...args) { | 555 | 546k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 546k | | 557 | 546k | // Recurse to the next argument. | 558 | 546k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 546k | } |
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&) Line | Count | Source | 554 | 3 | const T &arg, const Ts &...args) { | 555 | 3 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3 | | 557 | 3 | // Recurse to the next argument. | 558 | 3 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<char const*>(unsigned long, char*, char*, char const* const&) Line | Count | Source | 554 | 3 | const T &arg, const Ts &...args) { | 555 | 3 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3 | | 557 | 3 | // Recurse to the next argument. | 558 | 3 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3 | } |
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 | 554 | 46.8k | const T &arg, const Ts &...args) { | 555 | 46.8k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 46.8k | | 557 | 46.8k | // Recurse to the next argument. | 558 | 46.8k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 46.8k | } |
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 | 554 | 46.8k | const T &arg, const Ts &...args) { | 555 | 46.8k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 46.8k | | 557 | 46.8k | // Recurse to the next argument. | 558 | 46.8k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 46.8k | } |
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&) Line | Count | Source | 554 | 12 | const T &arg, const Ts &...args) { | 555 | 12 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 12 | | 557 | 12 | // Recurse to the next argument. | 558 | 12 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 12 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::BlockAddress const*>(unsigned long, char*, char*, llvm::BlockAddress const* const&) Line | Count | Source | 554 | 12 | const T &arg, const Ts &...args) { | 555 | 12 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 12 | | 557 | 12 | // Recurse to the next argument. | 558 | 12 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 12 | } |
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&) Line | Count | Source | 554 | 14 | const T &arg, const Ts &...args) { | 555 | 14 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 14 | | 557 | 14 | // Recurse to the next argument. | 558 | 14 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 14 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MCSymbol*>(unsigned long, char*, char*, llvm::MCSymbol* const&) Line | Count | Source | 554 | 301 | const T &arg, const Ts &...args) { | 555 | 301 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 301 | | 557 | 301 | // Recurse to the next argument. | 558 | 301 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 301 | } |
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&) Line | Count | Source | 554 | 8 | const T &arg, const Ts &...args) { | 555 | 8 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 8 | | 557 | 8 | // Recurse to the next argument. | 558 | 8 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 8 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineBasicBlock*>(unsigned long, char*, char*, llvm::MachineBasicBlock* const&) Line | Count | Source | 554 | 1.75M | const T &arg, const Ts &...args) { | 555 | 1.75M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.75M | | 557 | 1.75M | // Recurse to the next argument. | 558 | 1.75M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.75M | } |
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 | 554 | 3.72M | const T &arg, const Ts &...args) { | 555 | 3.72M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3.72M | | 557 | 3.72M | // Recurse to the next argument. | 558 | 3.72M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3.72M | } |
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 | 554 | 456k | const T &arg, const Ts &...args) { | 555 | 456k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 456k | | 557 | 456k | // Recurse to the next argument. | 558 | 456k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 456k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::DILocalVariable const*, unsigned int, llvm::DILocation const*>(unsigned long, char*, char*, llvm::DILocalVariable const* const&, unsigned int const&, llvm::DILocation const* const&) Line | Count | Source | 554 | 19.6k | const T &arg, const Ts &...args) { | 555 | 19.6k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 19.6k | | 557 | 19.6k | // Recurse to the next argument. | 558 | 19.6k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 19.6k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::DILocation const*>(unsigned long, char*, char*, unsigned int const&, llvm::DILocation const* const&) Line | Count | Source | 554 | 19.6k | const T &arg, const Ts &...args) { | 555 | 19.6k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 19.6k | | 557 | 19.6k | // Recurse to the next argument. | 558 | 19.6k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 19.6k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::DILocation const*>(unsigned long, char*, char*, llvm::DILocation const* const&) Line | Count | Source | 554 | 19.6k | const T &arg, const Ts &...args) { | 555 | 19.6k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 19.6k | | 557 | 19.6k | // Recurse to the next argument. | 558 | 19.6k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 19.6k | } |
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 | 554 | 47.2M | const T &arg, const Ts &...args) { | 555 | 47.2M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 47.2M | | 557 | 47.2M | // Recurse to the next argument. | 558 | 47.2M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 47.2M | } |
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 | 554 | 47.2M | const T &arg, const Ts &...args) { | 555 | 47.2M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 47.2M | | 557 | 47.2M | // Recurse to the next argument. | 558 | 47.2M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 47.2M | } |
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 | 554 | 47.2M | const T &arg, const Ts &...args) { | 555 | 47.2M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 47.2M | | 557 | 47.2M | // Recurse to the next argument. | 558 | 47.2M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 47.2M | } |
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 | 554 | 25.0M | const T &arg, const Ts &...args) { | 555 | 25.0M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 25.0M | | 557 | 25.0M | // Recurse to the next argument. | 558 | 25.0M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 25.0M | } |
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 | 554 | 25.0M | const T &arg, const Ts &...args) { | 555 | 25.0M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 25.0M | | 557 | 25.0M | // Recurse to the next argument. | 558 | 25.0M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 25.0M | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<long long>(unsigned long, char*, char*, long long const&) Line | Count | Source | 554 | 31.5M | const T &arg, const Ts &...args) { | 555 | 31.5M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 31.5M | | 557 | 31.5M | // Recurse to the next argument. | 558 | 31.5M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 31.5M | } |
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&) Line | Count | Source | 554 | 24 | const T &arg, const Ts &...args) { | 555 | 24 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 24 | | 557 | 24 | // Recurse to the next argument. | 558 | 24 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 24 | } |
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&) Line | Count | Source | 554 | 24 | const T &arg, const Ts &...args) { | 555 | 24 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 24 | | 557 | 24 | // Recurse to the next argument. | 558 | 24 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 24 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::ConstantInt const*>(unsigned long, char*, char*, llvm::ConstantInt const* const&) Line | Count | Source | 554 | 24 | const T &arg, const Ts &...args) { | 555 | 24 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 24 | | 557 | 24 | // Recurse to the next argument. | 558 | 24 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 24 | } |
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&) Line | Count | Source | 554 | 1.01k | const T &arg, const Ts &...args) { | 555 | 1.01k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.01k | | 557 | 1.01k | // Recurse to the next argument. | 558 | 1.01k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.01k | } |
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&) Line | Count | Source | 554 | 1.01k | const T &arg, const Ts &...args) { | 555 | 1.01k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.01k | | 557 | 1.01k | // Recurse to the next argument. | 558 | 1.01k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.01k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::ConstantFP const*>(unsigned long, char*, char*, llvm::ConstantFP const* const&) Line | Count | Source | 554 | 1.01k | const T &arg, const Ts &...args) { | 555 | 1.01k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.01k | | 557 | 1.01k | // Recurse to the next argument. | 558 | 1.01k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.01k | } |
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 | 554 | 1.75M | const T &arg, const Ts &...args) { | 555 | 1.75M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.75M | | 557 | 1.75M | // Recurse to the next argument. | 558 | 1.75M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.75M | } |
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 | 554 | 1.75M | const T &arg, const Ts &...args) { | 555 | 1.75M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.75M | | 557 | 1.75M | // Recurse to the next argument. | 558 | 1.75M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.75M | } |
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 | 554 | 545k | const T &arg, const Ts &...args) { | 555 | 545k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 545k | | 557 | 545k | // Recurse to the next argument. | 558 | 545k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 545k | } |
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 | 554 | 545k | const T &arg, const Ts &...args) { | 555 | 545k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 545k | | 557 | 545k | // Recurse to the next argument. | 558 | 545k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 545k | } |
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 | 554 | 394k | const T &arg, const Ts &...args) { | 555 | 394k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 394k | | 557 | 394k | // Recurse to the next argument. | 558 | 394k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 394k | } |
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 | 554 | 394k | const T &arg, const Ts &...args) { | 555 | 394k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 394k | | 557 | 394k | // Recurse to the next argument. | 558 | 394k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 394k | } |
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 | 554 | 394k | const T &arg, const Ts &...args) { | 555 | 394k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 394k | | 557 | 394k | // Recurse to the next argument. | 558 | 394k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 394k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MachineOperand::MachineOperandType, unsigned int, long long, llvm::StringRef>(unsigned long, char*, char*, llvm::MachineOperand::MachineOperandType const&, unsigned int const&, long long const&, llvm::StringRef const&) Line | Count | Source | 554 | 6.92k | const T &arg, const Ts &...args) { | 555 | 6.92k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 6.92k | | 557 | 6.92k | // Recurse to the next argument. | 558 | 6.92k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 6.92k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, long long, llvm::StringRef>(unsigned long, char*, char*, unsigned int const&, long long const&, llvm::StringRef const&) Line | Count | Source | 554 | 6.92k | const T &arg, const Ts &...args) { | 555 | 6.92k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 6.92k | | 557 | 6.92k | // Recurse to the next argument. | 558 | 6.92k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 6.92k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<long long, llvm::StringRef>(unsigned long, char*, char*, long long const&, llvm::StringRef const&) Line | Count | Source | 554 | 6.92k | const T &arg, const Ts &...args) { | 555 | 6.92k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 6.92k | | 557 | 6.92k | // Recurse to the next argument. | 558 | 6.92k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 6.92k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::StringRef>(unsigned long, char*, char*, llvm::StringRef const&) Line | Count | Source | 554 | 7.11k | const T &arg, const Ts &...args) { | 555 | 7.11k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 7.11k | | 557 | 7.11k | // Recurse to the next argument. | 558 | 7.11k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 7.11k | } |
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 | 554 | 6.06M | const T &arg, const Ts &...args) { | 555 | 6.06M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 6.06M | | 557 | 6.06M | // Recurse to the next argument. | 558 | 6.06M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 6.06M | } |
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 | 554 | 6.06M | const T &arg, const Ts &...args) { | 555 | 6.06M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 6.06M | | 557 | 6.06M | // Recurse to the next argument. | 558 | 6.06M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 6.06M | } |
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 | 554 | 6.06M | const T &arg, const Ts &...args) { | 555 | 6.06M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 6.06M | | 557 | 6.06M | // Recurse to the next argument. | 558 | 6.06M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 6.06M | } |
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&) Line | Count | Source | 554 | 504 | const T &arg, const Ts &...args) { | 555 | 504 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 504 | | 557 | 504 | // Recurse to the next argument. | 558 | 504 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 504 | } |
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&) Line | Count | Source | 554 | 504 | const T &arg, const Ts &...args) { | 555 | 504 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 504 | | 557 | 504 | // Recurse to the next argument. | 558 | 504 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 504 | } |
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&) Line | Count | Source | 554 | 504 | const T &arg, const Ts &...args) { | 555 | 504 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 504 | | 557 | 504 | // Recurse to the next argument. | 558 | 504 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 504 | } |
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&) Line | Count | Source | 554 | 21 | const T &arg, const Ts &...args) { | 555 | 21 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 21 | | 557 | 21 | // Recurse to the next argument. | 558 | 21 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 21 | } |
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&) Line | Count | Source | 554 | 21 | const T &arg, const Ts &...args) { | 555 | 21 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 21 | | 557 | 21 | // Recurse to the next argument. | 558 | 21 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 21 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int const*>(unsigned long, char*, char*, unsigned int const* const&) Line | Count | Source | 554 | 21 | const T &arg, const Ts &...args) { | 555 | 21 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 21 | | 557 | 21 | // Recurse to the next argument. | 558 | 21 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 21 | } |
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&) 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&) Line | Count | Source | 554 | 287 | const T &arg, const Ts &...args) { | 555 | 287 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 287 | | 557 | 287 | // Recurse to the next argument. | 558 | 287 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 287 | } |
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&) Line | Count | Source | 554 | 287 | const T &arg, const Ts &...args) { | 555 | 287 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 287 | | 557 | 287 | // Recurse to the next argument. | 558 | 287 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 287 | } |
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 | 554 | 21.0k | const T &arg, const Ts &...args) { | 555 | 21.0k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 21.0k | | 557 | 21.0k | // Recurse to the next argument. | 558 | 21.0k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 21.0k | } |
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 | 554 | 21.0k | const T &arg, const Ts &...args) { | 555 | 21.0k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 21.0k | | 557 | 21.0k | // Recurse to the next argument. | 558 | 21.0k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 21.0k | } |
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 | 554 | 21.0k | const T &arg, const Ts &...args) { | 555 | 21.0k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 21.0k | | 557 | 21.0k | // Recurse to the next argument. | 558 | 21.0k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 21.0k | } |
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 | 554 | 21.0k | const T &arg, const Ts &...args) { | 555 | 21.0k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 21.0k | | 557 | 21.0k | // Recurse to the next argument. | 558 | 21.0k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 21.0k | } |
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 | 554 | 21.0k | const T &arg, const Ts &...args) { | 555 | 21.0k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 21.0k | | 557 | 21.0k | // Recurse to the next argument. | 558 | 21.0k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 21.0k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::FunctionType*>(unsigned long, char*, char*, llvm::FunctionType* const&) Line | Count | Source | 554 | 21.0k | const T &arg, const Ts &...args) { | 555 | 21.0k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 21.0k | | 557 | 21.0k | // Recurse to the next argument. | 558 | 21.0k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 21.0k | } |
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 | 554 | 17.5M | const T &arg, const Ts &...args) { | 555 | 17.5M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 17.5M | | 557 | 17.5M | // Recurse to the next argument. | 558 | 17.5M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 17.5M | } |
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 | 554 | 17.5M | const T &arg, const Ts &...args) { | 555 | 17.5M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 17.5M | | 557 | 17.5M | // Recurse to the next argument. | 558 | 17.5M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 17.5M | } |
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 | 554 | 17.5M | const T &arg, const Ts &...args) { | 555 | 17.5M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 17.5M | | 557 | 17.5M | // Recurse to the next argument. | 558 | 17.5M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 17.5M | } |
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 | 554 | 25.8M | const T &arg, const Ts &...args) { | 555 | 25.8M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 25.8M | | 557 | 25.8M | // Recurse to the next argument. | 558 | 25.8M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 25.8M | } |
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 | 554 | 7.85M | const T &arg, const Ts &...args) { | 555 | 7.85M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 7.85M | | 557 | 7.85M | // Recurse to the next argument. | 558 | 7.85M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 7.85M | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int, llvm::Metadata*, llvm::Metadata*, bool>(unsigned long, char*, char*, unsigned int const&, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, bool const&) Line | Count | Source | 554 | 16.2M | const T &arg, const Ts &...args) { | 555 | 16.2M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 16.2M | | 557 | 16.2M | // Recurse to the next argument. | 558 | 16.2M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 16.2M | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Metadata*, llvm::Metadata*, bool>(unsigned long, char*, char*, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, bool const&) Line | Count | Source | 554 | 16.2M | const T &arg, const Ts &...args) { | 555 | 16.2M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 16.2M | | 557 | 16.2M | // Recurse to the next argument. | 558 | 16.2M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 16.2M | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::Metadata*, bool>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::Metadata* const&, bool const&) Line | Count | Source | 554 | 16.2M | const T &arg, const Ts &...args) { | 555 | 16.2M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 16.2M | | 557 | 16.2M | // Recurse to the next argument. | 558 | 16.2M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 16.2M | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, bool>(unsigned long, char*, char*, llvm::Metadata* const&, bool const&) Line | Count | Source | 554 | 16.2M | const T &arg, const Ts &...args) { | 555 | 16.2M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 16.2M | | 557 | 16.2M | // Recurse to the next argument. | 558 | 16.2M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 16.2M | } |
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&) Line | Count | Source | 554 | 114 | const T &arg, const Ts &...args) { | 555 | 114 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 114 | | 557 | 114 | // Recurse to the next argument. | 558 | 114 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 114 | } |
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&) Line | Count | Source | 554 | 1.94k | const T &arg, const Ts &...args) { | 555 | 1.94k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.94k | | 557 | 1.94k | // Recurse to the next argument. | 558 | 1.94k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.94k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*>(unsigned long, char*, char*, llvm::MDString* const&) Line | Count | Source | 554 | 71.9k | const T &arg, const Ts &...args) { | 555 | 71.9k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 71.9k | | 557 | 71.9k | // Recurse to the next argument. | 558 | 71.9k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 71.9k | } |
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 | 554 | 829 | const T &arg, const Ts &...args) { | 555 | 829 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 829 | | 557 | 829 | // Recurse to the next argument. | 558 | 829 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 829 | } |
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&) Line | Count | Source | 554 | 84 | const T &arg, const Ts &...args) { | 555 | 84 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 84 | | 557 | 84 | // Recurse to the next argument. | 558 | 84 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 84 | } |
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&) Line | Count | Source | 554 | 36.5k | const T &arg, const Ts &...args) { | 555 | 36.5k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 36.5k | | 557 | 36.5k | // Recurse to the next argument. | 558 | 36.5k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 36.5k | } |
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 | 554 | 4.49k | const T &arg, const Ts &...args) { | 555 | 4.49k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 4.49k | | 557 | 4.49k | // Recurse to the next argument. | 558 | 4.49k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 4.49k | } |
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 | 554 | 4.49k | const T &arg, const Ts &...args) { | 555 | 4.49k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 4.49k | | 557 | 4.49k | // Recurse to the next argument. | 558 | 4.49k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 4.49k | } |
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 | 554 | 4.49k | const T &arg, const Ts &...args) { | 555 | 4.49k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 4.49k | | 557 | 4.49k | // Recurse to the next argument. | 558 | 4.49k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 4.49k | } |
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&) Line | Count | Source | 554 | 4.08k | const T &arg, const Ts &...args) { | 555 | 4.08k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 4.08k | | 557 | 4.08k | // Recurse to the next argument. | 558 | 4.08k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 4.08k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*>(unsigned long, char*, char*, llvm::Metadata* const&) Line | Count | Source | 554 | 152k | const T &arg, const Ts &...args) { | 555 | 152k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 152k | | 557 | 152k | // Recurse to the next argument. | 558 | 152k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 152k | } |
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 | 554 | 20.1k | const T &arg, const Ts &...args) { | 555 | 20.1k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 20.1k | | 557 | 20.1k | // Recurse to the next argument. | 558 | 20.1k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 20.1k | } |
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 | 554 | 20.1k | const T &arg, const Ts &...args) { | 555 | 20.1k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 20.1k | | 557 | 20.1k | // Recurse to the next argument. | 558 | 20.1k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 20.1k | } |
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 | 554 | 20.1k | const T &arg, const Ts &...args) { | 555 | 20.1k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 20.1k | | 557 | 20.1k | // Recurse to the next argument. | 558 | 20.1k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 20.1k | } |
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 | 554 | 20.1k | const T &arg, const Ts &...args) { | 555 | 20.1k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 20.1k | | 557 | 20.1k | // Recurse to the next argument. | 558 | 20.1k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 20.1k | } |
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 | 554 | 27.1k | const T &arg, const Ts &...args) { | 555 | 27.1k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 27.1k | | 557 | 27.1k | // Recurse to the next argument. | 558 | 27.1k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 27.1k | } |
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 | 554 | 27.1k | const T &arg, const Ts &...args) { | 555 | 27.1k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 27.1k | | 557 | 27.1k | // Recurse to the next argument. | 558 | 27.1k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 27.1k | } |
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 | 554 | 6.03k | const T &arg, const Ts &...args) { | 555 | 6.03k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 6.03k | | 557 | 6.03k | // Recurse to the next argument. | 558 | 6.03k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 6.03k | } |
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 | 554 | 6.03k | const T &arg, const Ts &...args) { | 555 | 6.03k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 6.03k | | 557 | 6.03k | // Recurse to the next argument. | 558 | 6.03k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 6.03k | } |
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 | 554 | 6.03k | const T &arg, const Ts &...args) { | 555 | 6.03k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 6.03k | | 557 | 6.03k | // Recurse to the next argument. | 558 | 6.03k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 6.03k | } |
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 | 554 | 6.03k | const T &arg, const Ts &...args) { | 555 | 6.03k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 6.03k | | 557 | 6.03k | // Recurse to the next argument. | 558 | 6.03k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 6.03k | } |
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 | 554 | 6.03k | const T &arg, const Ts &...args) { | 555 | 6.03k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 6.03k | | 557 | 6.03k | // Recurse to the next argument. | 558 | 6.03k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 6.03k | } |
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 | 554 | 14.3k | const T &arg, const Ts &...args) { | 555 | 14.3k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 14.3k | | 557 | 14.3k | // Recurse to the next argument. | 558 | 14.3k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 14.3k | } |
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 | 554 | 130k | const T &arg, const Ts &...args) { | 555 | 130k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 130k | | 557 | 130k | // Recurse to the next argument. | 558 | 130k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 130k | } |
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 | 554 | 130k | const T &arg, const Ts &...args) { | 555 | 130k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 130k | | 557 | 130k | // Recurse to the next argument. | 558 | 130k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 130k | } |
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 | 554 | 28.6k | const T &arg, const Ts &...args) { | 555 | 28.6k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 28.6k | | 557 | 28.6k | // Recurse to the next argument. | 558 | 28.6k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 28.6k | } |
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 | 554 | 28.6k | const T &arg, const Ts &...args) { | 555 | 28.6k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 28.6k | | 557 | 28.6k | // Recurse to the next argument. | 558 | 28.6k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 28.6k | } |
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 | 554 | 28.6k | const T &arg, const Ts &...args) { | 555 | 28.6k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 28.6k | | 557 | 28.6k | // Recurse to the next argument. | 558 | 28.6k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 28.6k | } |
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 | 554 | 32.9k | const T &arg, const Ts &...args) { | 555 | 32.9k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 32.9k | | 557 | 32.9k | // Recurse to the next argument. | 558 | 32.9k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 32.9k | } |
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&) Line | Count | Source | 554 | 4.56k | const T &arg, const Ts &...args) { | 555 | 4.56k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 4.56k | | 557 | 4.56k | // Recurse to the next argument. | 558 | 4.56k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 4.56k | } |
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&) Line | Count | Source | 554 | 4.56k | const T &arg, const Ts &...args) { | 555 | 4.56k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 4.56k | | 557 | 4.56k | // Recurse to the next argument. | 558 | 4.56k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 4.56k | } |
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&) Line | Count | Source | 554 | 65 | const T &arg, const Ts &...args) { | 555 | 65 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 65 | | 557 | 65 | // Recurse to the next argument. | 558 | 65 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 65 | } |
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 | 554 | 23.8k | const T &arg, const Ts &...args) { | 555 | 23.8k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 23.8k | | 557 | 23.8k | // Recurse to the next argument. | 558 | 23.8k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 23.8k | } |
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 | 554 | 524 | const T &arg, const Ts &...args) { | 555 | 524 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 524 | | 557 | 524 | // Recurse to the next argument. | 558 | 524 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 524 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::Metadata*, llvm::MDString*, llvm::Metadata*, unsigned int>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::Metadata* const&, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&) Line | Count | Source | 554 | 17 | const T &arg, const Ts &...args) { | 555 | 17 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 17 | | 557 | 17 | // Recurse to the next argument. | 558 | 17 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 17 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Metadata*, llvm::MDString*, llvm::Metadata*, unsigned int>(unsigned long, char*, char*, llvm::Metadata* const&, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&) Line | Count | Source | 554 | 17 | const T &arg, const Ts &...args) { | 555 | 17 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 17 | | 557 | 17 | // Recurse to the next argument. | 558 | 17 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 17 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MDString*, llvm::Metadata*, unsigned int>(unsigned long, char*, char*, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&) Line | Count | Source | 554 | 17 | const T &arg, const Ts &...args) { | 555 | 17 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 17 | | 557 | 17 | // Recurse to the next argument. | 558 | 17 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 17 | } |
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&) Line | Count | Source | 554 | 138 | const T &arg, const Ts &...args) { | 555 | 138 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 138 | | 557 | 138 | // Recurse to the next argument. | 558 | 138 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 138 | } |
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&) Line | Count | Source | 554 | 138 | const T &arg, const Ts &...args) { | 555 | 138 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 138 | | 557 | 138 | // Recurse to the next argument. | 558 | 138 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 138 | } |
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&) Line | Count | Source | 554 | 138 | const T &arg, const Ts &...args) { | 555 | 138 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 138 | | 557 | 138 | // Recurse to the next argument. | 558 | 138 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 138 | } |
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&) Line | Count | Source | 554 | 1.22k | const T &arg, const Ts &...args) { | 555 | 1.22k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.22k | | 557 | 1.22k | // Recurse to the next argument. | 558 | 1.22k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.22k | } |
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&) Line | Count | Source | 554 | 1.22k | const T &arg, const Ts &...args) { | 555 | 1.22k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.22k | | 557 | 1.22k | // Recurse to the next argument. | 558 | 1.22k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.22k | } |
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 | 554 | 3.00k | const T &arg, const Ts &...args) { | 555 | 3.00k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3.00k | | 557 | 3.00k | // Recurse to the next argument. | 558 | 3.00k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3.00k | } |
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 | 554 | 3.00k | const T &arg, const Ts &...args) { | 555 | 3.00k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3.00k | | 557 | 3.00k | // Recurse to the next argument. | 558 | 3.00k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3.00k | } |
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 | 554 | 3.00k | const T &arg, const Ts &...args) { | 555 | 3.00k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3.00k | | 557 | 3.00k | // Recurse to the next argument. | 558 | 3.00k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3.00k | } |
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 | 554 | 3.00k | const T &arg, const Ts &...args) { | 555 | 3.00k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3.00k | | 557 | 3.00k | // Recurse to the next argument. | 558 | 3.00k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3.00k | } |
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 | 554 | 3.00k | const T &arg, const Ts &...args) { | 555 | 3.00k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3.00k | | 557 | 3.00k | // Recurse to the next argument. | 558 | 3.00k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3.00k | } |
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 | 554 | 3.00k | const T &arg, const Ts &...args) { | 555 | 3.00k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3.00k | | 557 | 3.00k | // Recurse to the next argument. | 558 | 3.00k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3.00k | } |
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 | 554 | 3.00k | const T &arg, const Ts &...args) { | 555 | 3.00k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3.00k | | 557 | 3.00k | // Recurse to the next argument. | 558 | 3.00k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3.00k | } |
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 | 554 | 3.00k | const T &arg, const Ts &...args) { | 555 | 3.00k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3.00k | | 557 | 3.00k | // Recurse to the next argument. | 558 | 3.00k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3.00k | } |
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 | 554 | 23.7k | const T &arg, const Ts &...args) { | 555 | 23.7k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 23.7k | | 557 | 23.7k | // Recurse to the next argument. | 558 | 23.7k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 23.7k | } |
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 | 554 | 23.7k | const T &arg, const Ts &...args) { | 555 | 23.7k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 23.7k | | 557 | 23.7k | // Recurse to the next argument. | 558 | 23.7k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 23.7k | } |
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 | 554 | 23.7k | const T &arg, const Ts &...args) { | 555 | 23.7k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 23.7k | | 557 | 23.7k | // Recurse to the next argument. | 558 | 23.7k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 23.7k | } |
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 | 554 | 23.7k | const T &arg, const Ts &...args) { | 555 | 23.7k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 23.7k | | 557 | 23.7k | // Recurse to the next argument. | 558 | 23.7k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 23.7k | } |
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&) Line | Count | Source | 554 | 72 | const T &arg, const Ts &...args) { | 555 | 72 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 72 | | 557 | 72 | // Recurse to the next argument. | 558 | 72 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 72 | } |
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&) Line | Count | Source | 554 | 72 | const T &arg, const Ts &...args) { | 555 | 72 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 72 | | 557 | 72 | // Recurse to the next argument. | 558 | 72 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 72 | } |
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&) Line | Count | Source | 554 | 167 | const T &arg, const Ts &...args) { | 555 | 167 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 167 | | 557 | 167 | // Recurse to the next argument. | 558 | 167 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 167 | } |
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&) Line | Count | Source | 554 | 167 | const T &arg, const Ts &...args) { | 555 | 167 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 167 | | 557 | 167 | // Recurse to the next argument. | 558 | 167 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 167 | } |
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&) Line | Count | Source | 554 | 167 | const T &arg, const Ts &...args) { | 555 | 167 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 167 | | 557 | 167 | // Recurse to the next argument. | 558 | 167 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 167 | } |
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&) Line | Count | Source | 554 | 167 | const T &arg, const Ts &...args) { | 555 | 167 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 167 | | 557 | 167 | // Recurse to the next argument. | 558 | 167 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 167 | } |
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&) Line | Count | Source | 554 | 167 | const T &arg, const Ts &...args) { | 555 | 167 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 167 | | 557 | 167 | // Recurse to the next argument. | 558 | 167 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 167 | } |
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&) Line | Count | Source | 554 | 167 | const T &arg, const Ts &...args) { | 555 | 167 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 167 | | 557 | 167 | // Recurse to the next argument. | 558 | 167 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 167 | } |
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&) Line | Count | Source | 554 | 1.82k | const T &arg, const Ts &...args) { | 555 | 1.82k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.82k | | 557 | 1.82k | // Recurse to the next argument. | 558 | 1.82k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.82k | } |
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&) Line | Count | Source | 554 | 1.82k | const T &arg, const Ts &...args) { | 555 | 1.82k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.82k | | 557 | 1.82k | // Recurse to the next argument. | 558 | 1.82k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.82k | } |
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&) Line | Count | Source | 554 | 1.82k | const T &arg, const Ts &...args) { | 555 | 1.82k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.82k | | 557 | 1.82k | // Recurse to the next argument. | 558 | 1.82k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.82k | } |
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&) Line | Count | Source | 554 | 1.82k | const T &arg, const Ts &...args) { | 555 | 1.82k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.82k | | 557 | 1.82k | // Recurse to the next argument. | 558 | 1.82k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.82k | } |
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&) Line | Count | Source | 554 | 4.19k | const T &arg, const Ts &...args) { | 555 | 4.19k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 4.19k | | 557 | 4.19k | // Recurse to the next argument. | 558 | 4.19k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 4.19k | } |
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&) Line | Count | Source | 554 | 4.19k | const T &arg, const Ts &...args) { | 555 | 4.19k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 4.19k | | 557 | 4.19k | // Recurse to the next argument. | 558 | 4.19k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 4.19k | } |
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 | 554 | 143 | const T &arg, const Ts &...args) { | 555 | 143 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 143 | | 557 | 143 | // Recurse to the next argument. | 558 | 143 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 143 | } |
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 | 554 | 143 | const T &arg, const Ts &...args) { | 555 | 143 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 143 | | 557 | 143 | // Recurse to the next argument. | 558 | 143 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 143 | } |
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 | 554 | 61.9k | const T &arg, const Ts &...args) { | 555 | 61.9k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 61.9k | | 557 | 61.9k | // Recurse to the next argument. | 558 | 61.9k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 61.9k | } |
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 | 554 | 207k | const T &arg, const Ts &...args) { | 555 | 207k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 207k | | 557 | 207k | // Recurse to the next argument. | 558 | 207k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 207k | } |
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 | 554 | 231k | const T &arg, const Ts &...args) { | 555 | 231k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 231k | | 557 | 231k | // Recurse to the next argument. | 558 | 231k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 231k | } |
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 | 554 | 17.5M | const T &arg, const Ts &...args) { | 555 | 17.5M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 17.5M | | 557 | 17.5M | // Recurse to the next argument. | 558 | 17.5M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 17.5M | } |
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 | 554 | 21.0k | const T &arg, const Ts &...args) { | 555 | 21.0k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 21.0k | | 557 | 21.0k | // Recurse to the next argument. | 558 | 21.0k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 21.0k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MCSymbol const*, unsigned int, unsigned int, bool, bool, unsigned int, bool>(unsigned long, char*, char*, llvm::MCSymbol const* const&, unsigned int const&, unsigned int const&, bool const&, bool const&, unsigned int const&, bool const&) Line | Count | Source | 554 | 25.5k | const T &arg, const Ts &...args) { | 555 | 25.5k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 25.5k | | 557 | 25.5k | // Recurse to the next argument. | 558 | 25.5k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 25.5k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, unsigned int, bool, bool, unsigned int, bool>(unsigned long, char*, char*, unsigned int const&, unsigned int const&, bool const&, bool const&, unsigned int const&, bool const&) Line | Count | Source | 554 | 25.5k | const T &arg, const Ts &...args) { | 555 | 25.5k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 25.5k | | 557 | 25.5k | // Recurse to the next argument. | 558 | 25.5k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 25.5k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, bool, bool, unsigned int, bool>(unsigned long, char*, char*, unsigned int const&, bool const&, bool const&, unsigned int const&, bool const&) Line | Count | Source | 554 | 25.5k | const T &arg, const Ts &...args) { | 555 | 25.5k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 25.5k | | 557 | 25.5k | // Recurse to the next argument. | 558 | 25.5k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 25.5k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<bool, bool, unsigned int, bool>(unsigned long, char*, char*, bool const&, bool const&, unsigned int const&, bool const&) Line | Count | Source | 554 | 25.5k | const T &arg, const Ts &...args) { | 555 | 25.5k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 25.5k | | 557 | 25.5k | // Recurse to the next argument. | 558 | 25.5k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 25.5k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<bool, unsigned int, bool>(unsigned long, char*, char*, bool const&, unsigned int const&, bool const&) Line | Count | Source | 554 | 25.5k | const T &arg, const Ts &...args) { | 555 | 25.5k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 25.5k | | 557 | 25.5k | // Recurse to the next argument. | 558 | 25.5k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 25.5k | } |
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 | 554 | 7.53M | const T &arg, const Ts &...args) { | 555 | 7.53M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 7.53M | | 557 | 7.53M | // Recurse to the next argument. | 558 | 7.53M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 7.53M | } |
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 | 554 | 20.7M | const T &arg, const Ts &...args) { | 555 | 20.7M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 20.7M | | 557 | 20.7M | // Recurse to the next argument. | 558 | 20.7M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 20.7M | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Value*>(unsigned long, char*, char*, llvm::Value* const&) Line | Count | Source | 554 | 29.2M | const T &arg, const Ts &...args) { | 555 | 29.2M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 29.2M | | 557 | 29.2M | // Recurse to the next argument. | 558 | 29.2M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 29.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 | 554 | 12.6M | const T &arg, const Ts &...args) { | 555 | 12.6M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 12.6M | | 557 | 12.6M | // Recurse to the next argument. | 558 | 12.6M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 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 | 554 | 12.6M | const T &arg, const Ts &...args) { | 555 | 12.6M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 12.6M | | 557 | 12.6M | // Recurse to the next argument. | 558 | 12.6M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 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 | 554 | 233k | const T &arg, const Ts &...args) { | 555 | 233k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 233k | | 557 | 233k | // Recurse to the next argument. | 558 | 233k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 233k | } |
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 | 554 | 233k | const T &arg, const Ts &...args) { | 555 | 233k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 233k | | 557 | 233k | // Recurse to the next argument. | 558 | 233k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 233k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::Value*, llvm::Value*, llvm::Value*>(unsigned long, char*, char*, unsigned int const&, llvm::Value* const&, llvm::Value* const&, llvm::Value* const&) Line | Count | Source | 554 | 59.6k | const T &arg, const Ts &...args) { | 555 | 59.6k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 59.6k | | 557 | 59.6k | // Recurse to the next argument. | 558 | 59.6k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 59.6k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Value*, llvm::Value*, llvm::Value*>(unsigned long, char*, char*, llvm::Value* const&, llvm::Value* const&, llvm::Value* const&) Line | Count | Source | 554 | 370k | const T &arg, const Ts &...args) { | 555 | 370k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 370k | | 557 | 370k | // Recurse to the next argument. | 558 | 370k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 370k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned int, llvm::CmpInst::Predicate, llvm::Value*, llvm::Value*, llvm::Value*, llvm::Value*>(unsigned long, char*, char*, unsigned int const&, llvm::CmpInst::Predicate const&, llvm::Value* const&, llvm::Value* const&, llvm::Value* const&, llvm::Value* const&) Line | Count | Source | 554 | 310k | const T &arg, const Ts &...args) { | 555 | 310k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 310k | | 557 | 310k | // Recurse to the next argument. | 558 | 310k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 310k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::CmpInst::Predicate, llvm::Value*, llvm::Value*, llvm::Value*, llvm::Value*>(unsigned long, char*, char*, llvm::CmpInst::Predicate const&, llvm::Value* const&, llvm::Value* const&, llvm::Value* const&, llvm::Value* const&) Line | Count | Source | 554 | 310k | const T &arg, const Ts &...args) { | 555 | 310k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 310k | | 557 | 310k | // Recurse to the next argument. | 558 | 310k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 310k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Value*, llvm::Value*, llvm::Value*, llvm::Value*>(unsigned long, char*, char*, llvm::Value* const&, llvm::Value* const&, llvm::Value* const&, llvm::Value* const&) Line | Count | Source | 554 | 310k | const T &arg, const Ts &...args) { | 555 | 310k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 310k | | 557 | 310k | // Recurse to the next argument. | 558 | 310k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 310k | } |
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 | 554 | 8.46M | const T &arg, const Ts &...args) { | 555 | 8.46M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 8.46M | | 557 | 8.46M | // Recurse to the next argument. | 558 | 8.46M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 8.46M | } |
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 | 554 | 8.46M | const T &arg, const Ts &...args) { | 555 | 8.46M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 8.46M | | 557 | 8.46M | // Recurse to the next argument. | 558 | 8.46M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 8.46M | } |
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 | 554 | 376k | const T &arg, const Ts &...args) { | 555 | 376k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 376k | | 557 | 376k | // Recurse to the next argument. | 558 | 376k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 376k | } |
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 | 554 | 502k | const T &arg, const Ts &...args) { | 555 | 502k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 502k | | 557 | 502k | // Recurse to the next argument. | 558 | 502k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 502k | } |
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 | 554 | 125k | const T &arg, const Ts &...args) { | 555 | 125k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 125k | | 557 | 125k | // Recurse to the next argument. | 558 | 125k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 125k | } |
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 | 554 | 125k | const T &arg, const Ts &...args) { | 555 | 125k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 125k | | 557 | 125k | // Recurse to the next argument. | 558 | 125k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 125k | } |
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 | 554 | 21.6M | const T &arg, const Ts &...args) { | 555 | 21.6M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 21.6M | | 557 | 21.6M | // Recurse to the next argument. | 558 | 21.6M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 21.6M | } |
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 | 554 | 21.6M | const T &arg, const Ts &...args) { | 555 | 21.6M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 21.6M | | 557 | 21.6M | // Recurse to the next argument. | 558 | 21.6M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 21.6M | } |
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&) 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&) Line | Count | Source | 554 | 2.44k | const T &arg, const Ts &...args) { | 555 | 2.44k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 2.44k | | 557 | 2.44k | // Recurse to the next argument. | 558 | 2.44k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 2.44k | } |
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&) Line | Count | Source | 554 | 148 | const T &arg, const Ts &...args) { | 555 | 148 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 148 | | 557 | 148 | // Recurse to the next argument. | 558 | 148 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 148 | } |
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&) Line | Count | Source | 554 | 148 | const T &arg, const Ts &...args) { | 555 | 148 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 148 | | 557 | 148 | // Recurse to the next argument. | 558 | 148 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 148 | } |
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&) Line | Count | Source | 554 | 1.15k | const T &arg, const Ts &...args) { | 555 | 1.15k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.15k | | 557 | 1.15k | // Recurse to the next argument. | 558 | 1.15k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.15k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::MemoryAccess const*>(unsigned long, char*, char*, llvm::MemoryAccess const* const&) Line | Count | Source | 554 | 1.15k | const T &arg, const Ts &...args) { | 555 | 1.15k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.15k | | 557 | 1.15k | // Recurse to the next argument. | 558 | 1.15k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.15k | } |
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&) Line | Count | Source | 554 | 273 | const T &arg, const Ts &...args) { | 555 | 273 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 273 | | 557 | 273 | // Recurse to the next argument. | 558 | 273 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 273 | } |
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&) Line | Count | Source | 554 | 54 | const T &arg, const Ts &...args) { | 555 | 54 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 54 | | 557 | 54 | // Recurse to the next argument. | 558 | 54 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 54 | } |
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&) Line | Count | Source | 554 | 485 | const T &arg, const Ts &...args) { | 555 | 485 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 485 | | 557 | 485 | // Recurse to the next argument. | 558 | 485 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 485 | } |
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&) Line | Count | Source | 554 | 485 | const T &arg, const Ts &...args) { | 555 | 485 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 485 | | 557 | 485 | // Recurse to the next argument. | 558 | 485 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 485 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Constant*>(unsigned long, char*, char*, llvm::Constant* const&) Line | Count | Source | 554 | 485 | const T &arg, const Ts &...args) { | 555 | 485 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 485 | | 557 | 485 | // Recurse to the next argument. | 558 | 485 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 485 | } |
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&) Line | Count | Source | 554 | 278 | const T &arg, const Ts &...args) { | 555 | 278 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 278 | | 557 | 278 | // Recurse to the next argument. | 558 | 278 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 278 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::Instruction*>(unsigned long, char*, char*, llvm::Instruction* const&) Line | Count | Source | 554 | 278 | const T &arg, const Ts &...args) { | 555 | 278 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 278 | | 557 | 278 | // Recurse to the next argument. | 558 | 278 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 278 | } |
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 | 554 | 150k | const T &arg, const Ts &...args) { | 555 | 150k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 150k | | 557 | 150k | // Recurse to the next argument. | 558 | 150k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 150k | } |
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 | 554 | 150k | const T &arg, const Ts &...args) { | 555 | 150k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 150k | | 557 | 150k | // Recurse to the next argument. | 558 | 150k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 150k | } |
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 | 554 | 999k | const T &arg, const Ts &...args) { | 555 | 999k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 999k | | 557 | 999k | // Recurse to the next argument. | 558 | 999k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 999k | } |
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 | 554 | 999k | const T &arg, const Ts &...args) { | 555 | 999k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 999k | | 557 | 999k | // Recurse to the next argument. | 558 | 999k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 999k | } |
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 | 554 | 999k | const T &arg, const Ts &...args) { | 555 | 999k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 999k | | 557 | 999k | // Recurse to the next argument. | 558 | 999k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 999k | } |
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 | 554 | 999k | const T &arg, const Ts &...args) { | 555 | 999k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 999k | | 557 | 999k | // Recurse to the next argument. | 558 | 999k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 999k | } |
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 | 554 | 240M | const T &arg, const Ts &...args) { | 555 | 240M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 240M | | 557 | 240M | // Recurse to the next argument. | 558 | 240M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 240M | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<void*, void*>(unsigned long, char*, char*, void* const&, void* const&) Line | Count | Source | 554 | 23.0k | const T &arg, const Ts &...args) { | 555 | 23.0k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 23.0k | | 557 | 23.0k | // Recurse to the next argument. | 558 | 23.0k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 23.0k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<void*>(unsigned long, char*, char*, void* const&) Line | Count | Source | 554 | 23.9k | const T &arg, const Ts &...args) { | 555 | 23.9k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 23.9k | | 557 | 23.9k | // Recurse to the next argument. | 558 | 23.9k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 23.9k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<clang::NestedNameSpecifier*, void*>(unsigned long, char*, char*, clang::NestedNameSpecifier* const&, void* const&) Line | Count | Source | 554 | 930 | const T &arg, const Ts &...args) { | 555 | 930 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 930 | | 557 | 930 | // Recurse to the next argument. | 558 | 930 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 930 | } |
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&) Line | Count | Source | 554 | 1.76k | const T &arg, const Ts &...args) { | 555 | 1.76k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.76k | | 557 | 1.76k | // Recurse to the next argument. | 558 | 1.76k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.76k | } |
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&) Line | Count | Source | 554 | 1.76k | const T &arg, const Ts &...args) { | 555 | 1.76k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.76k | | 557 | 1.76k | // Recurse to the next argument. | 558 | 1.76k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.76k | } |
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&) Line | Count | Source | 554 | 1.76k | const T &arg, const Ts &...args) { | 555 | 1.76k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.76k | | 557 | 1.76k | // Recurse to the next argument. | 558 | 1.76k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.76k | } |
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&) Line | Count | Source | 554 | 1.76k | const T &arg, const Ts &...args) { | 555 | 1.76k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.76k | | 557 | 1.76k | // Recurse to the next argument. | 558 | 1.76k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.76k | } |
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&) Line | Count | Source | 554 | 14 | const T &arg, const Ts &...args) { | 555 | 14 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 14 | | 557 | 14 | // Recurse to the next argument. | 558 | 14 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 14 | } |
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&) Line | Count | Source | 554 | 2.04k | const T &arg, const Ts &...args) { | 555 | 2.04k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 2.04k | | 557 | 2.04k | // Recurse to the next argument. | 558 | 2.04k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 2.04k | } |
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&) Line | Count | Source | 554 | 2.04k | const T &arg, const Ts &...args) { | 555 | 2.04k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 2.04k | | 557 | 2.04k | // Recurse to the next argument. | 558 | 2.04k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 2.04k | } |
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&) Line | Count | Source | 554 | 3.59k | const T &arg, const Ts &...args) { | 555 | 3.59k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3.59k | | 557 | 3.59k | // Recurse to the next argument. | 558 | 3.59k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3.59k | } |
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&) Line | Count | Source | 554 | 7.71k | const T &arg, const Ts &...args) { | 555 | 7.71k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 7.71k | | 557 | 7.71k | // Recurse to the next argument. | 558 | 7.71k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 7.71k | } |
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&) Line | Count | Source | 554 | 4.11k | const T &arg, const Ts &...args) { | 555 | 4.11k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 4.11k | | 557 | 4.11k | // Recurse to the next argument. | 558 | 4.11k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 4.11k | } |
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&) Line | Count | Source | 554 | 2.04k | const T &arg, const Ts &...args) { | 555 | 2.04k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 2.04k | | 557 | 2.04k | // Recurse to the next argument. | 558 | 2.04k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 2.04k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<bool, bool>(unsigned long, char*, char*, bool const&, bool const&) Line | Count | Source | 554 | 2.04k | const T &arg, const Ts &...args) { | 555 | 2.04k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 2.04k | | 557 | 2.04k | // Recurse to the next argument. | 558 | 2.04k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 2.04k | } |
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&) Line | Count | Source | 554 | 1.28k | const T &arg, const Ts &...args) { | 555 | 1.28k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.28k | | 557 | 1.28k | // Recurse to the next argument. | 558 | 1.28k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.28k | } |
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&) Line | Count | Source | 554 | 1.28k | const T &arg, const Ts &...args) { | 555 | 1.28k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 1.28k | | 557 | 1.28k | // Recurse to the next argument. | 558 | 1.28k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 1.28k | } |
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&) Line | Count | Source | 554 | 2.04k | const T &arg, const Ts &...args) { | 555 | 2.04k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 2.04k | | 557 | 2.04k | // Recurse to the next argument. | 558 | 2.04k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 2.04k | } |
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&) Line | Count | Source | 554 | 2.04k | const T &arg, const Ts &...args) { | 555 | 2.04k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 2.04k | | 557 | 2.04k | // Recurse to the next argument. | 558 | 2.04k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 2.04k | } |
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&) Line | Count | Source | 554 | 2.04k | const T &arg, const Ts &...args) { | 555 | 2.04k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 2.04k | | 557 | 2.04k | // Recurse to the next argument. | 558 | 2.04k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 2.04k | } |
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&) Line | Count | Source | 554 | 2.04k | const T &arg, const Ts &...args) { | 555 | 2.04k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 2.04k | | 557 | 2.04k | // Recurse to the next argument. | 558 | 2.04k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 2.04k | } |
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&) Line | Count | Source | 554 | 2.04k | const T &arg, const Ts &...args) { | 555 | 2.04k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 2.04k | | 557 | 2.04k | // Recurse to the next argument. | 558 | 2.04k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 2.04k | } |
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&) Line | Count | Source | 554 | 2.04k | const T &arg, const Ts &...args) { | 555 | 2.04k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 2.04k | | 557 | 2.04k | // Recurse to the next argument. | 558 | 2.04k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 2.04k | } |
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 | 554 | 976k | const T &arg, const Ts &...args) { | 555 | 976k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 976k | | 557 | 976k | // Recurse to the next argument. | 558 | 976k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 976k | } |
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 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&) llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::hash_code, clang::SanitizerMask>(unsigned long, char*, char*, llvm::hash_code const&, clang::SanitizerMask const&) Line | Count | Source | 554 | 3 | const T &arg, const Ts &...args) { | 555 | 3 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3 | | 557 | 3 | // Recurse to the next argument. | 558 | 3 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<clang::SanitizerMask>(unsigned long, char*, char*, clang::SanitizerMask const&) Line | Count | Source | 554 | 3 | const T &arg, const Ts &...args) { | 555 | 3 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 3 | | 557 | 3 | // Recurse to the next argument. | 558 | 3 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 3 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<long long, long>(unsigned long, char*, char*, long long const&, long const&) Line | Count | Source | 554 | 62.4k | const T &arg, const Ts &...args) { | 555 | 62.4k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 62.4k | | 557 | 62.4k | // Recurse to the next argument. | 558 | 62.4k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 62.4k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<long>(unsigned long, char*, char*, long const&) Line | Count | Source | 554 | 62.4k | const T &arg, const Ts &...args) { | 555 | 62.4k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 62.4k | | 557 | 62.4k | // Recurse to the next argument. | 558 | 62.4k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 62.4k | } |
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 | 554 | 16.2M | const T &arg, const Ts &...args) { | 555 | 16.2M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 16.2M | | 557 | 16.2M | // Recurse to the next argument. | 558 | 16.2M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 16.2M | } |
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 | 554 | 16.2M | const T &arg, const Ts &...args) { | 555 | 16.2M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 16.2M | | 557 | 16.2M | // Recurse to the next argument. | 558 | 16.2M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 16.2M | } |
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 | 554 | 16.2M | const T &arg, const Ts &...args) { | 555 | 16.2M | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 16.2M | | 557 | 16.2M | // Recurse to the next argument. | 558 | 16.2M | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 16.2M | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<void*, unsigned int, unsigned int>(unsigned long, char*, char*, void* const&, unsigned int const&, unsigned int const&) Line | Count | Source | 554 | 69.6k | const T &arg, const Ts &...args) { | 555 | 69.6k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 69.6k | | 557 | 69.6k | // Recurse to the next argument. | 558 | 69.6k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 69.6k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<clang::APValue::LValueBase, llvm::ArrayRef<clang::APValue::LValuePathEntry> >(unsigned long, char*, char*, clang::APValue::LValueBase const&, llvm::ArrayRef<clang::APValue::LValuePathEntry> const&) Line | Count | Source | 554 | 69.6k | const T &arg, const Ts &...args) { | 555 | 69.6k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 69.6k | | 557 | 69.6k | // Recurse to the next argument. | 558 | 69.6k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 69.6k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::ArrayRef<clang::APValue::LValuePathEntry> >(unsigned long, char*, char*, llvm::ArrayRef<clang::APValue::LValuePathEntry> const&) Line | Count | Source | 554 | 69.6k | const T &arg, const Ts &...args) { | 555 | 69.6k | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 69.6k | | 557 | 69.6k | // Recurse to the next argument. | 558 | 69.6k | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 69.6k | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<unsigned long, llvm::wasm::ValType>(unsigned long, char*, char*, unsigned long const&, llvm::wasm::ValType const&) Line | Count | Source | 554 | 792 | const T &arg, const Ts &...args) { | 555 | 792 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 792 | | 557 | 792 | // Recurse to the next argument. | 558 | 792 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 792 | } |
llvm::hash_code llvm::hashing::detail::hash_combine_recursive_helper::combine<llvm::wasm::ValType>(unsigned long, char*, char*, llvm::wasm::ValType const&) Line | Count | Source | 554 | 792 | const T &arg, const Ts &...args) { | 555 | 792 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 792 | | 557 | 792 | // Recurse to the next argument. | 558 | 792 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 792 | } |
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 | 554 | 54 | const T &arg, const Ts &...args) { | 555 | 54 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 54 | | 557 | 54 | // Recurse to the next argument. | 558 | 54 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 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 | 554 | 54 | const T &arg, const Ts &...args) { | 555 | 54 | buffer_ptr = combine_data(length, buffer_ptr, buffer_end, get_hashable_data(arg)); | 556 | 54 | | 557 | 54 | // Recurse to the next argument. | 558 | 54 | return combine(length, buffer_ptr, buffer_end, args...); | 559 | 54 | } |
|
604 | 482M | } llvm::hash_code llvm::hash_combine<unsigned int, unsigned int>(unsigned int const&, unsigned int const&) Line | Count | Source | 600 | 3.18k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 3.18k | // Recursively hash each argument using a helper class. | 602 | 3.18k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 3.18k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 3.18k | } |
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 | 600 | 235k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 235k | // Recursively hash each argument using a helper class. | 602 | 235k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 235k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 235k | } |
llvm::hash_code llvm::hash_combine<unsigned int, unsigned int, llvm::hash_code>(unsigned int const&, unsigned int const&, llvm::hash_code const&) Line | Count | Source | 600 | 199 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 199 | // Recursively hash each argument using a helper class. | 602 | 199 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 199 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 199 | } |
llvm::hash_code llvm::hash_combine<unsigned int, llvm::hash_code>(unsigned int const&, llvm::hash_code const&) Line | Count | Source | 600 | 17.8M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 17.8M | // Recursively hash each argument using a helper class. | 602 | 17.8M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 17.8M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 17.8M | } |
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 | 600 | 84.3k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 84.3k | // Recursively hash each argument using a helper class. | 602 | 84.3k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 84.3k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 84.3k | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, int>(llvm::hash_code const&, int const&) Line | Count | Source | 600 | 214 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 214 | // Recursively hash each argument using a helper class. | 602 | 214 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 214 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 214 | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, char const*>(llvm::hash_code const&, char const* const&) Line | Count | Source | 600 | 3 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 3 | // Recursively hash each argument using a helper class. | 602 | 3 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 3 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 3 | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::GlobalValue const*>(llvm::hash_code const&, llvm::GlobalValue const* const&) Line | Count | Source | 600 | 46.8k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 46.8k | // Recursively hash each argument using a helper class. | 602 | 46.8k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 46.8k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 46.8k | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::BlockAddress const*>(llvm::hash_code const&, llvm::BlockAddress const* const&) Line | Count | Source | 600 | 12 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 12 | // Recursively hash each argument using a helper class. | 602 | 12 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 12 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 12 | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::MCSymbol*>(llvm::hash_code const&, llvm::MCSymbol* const&) Line | Count | Source | 600 | 14 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 14 | // Recursively hash each argument using a helper class. | 602 | 14 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 14 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 14 | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::MachineBasicBlock*>(llvm::hash_code const&, llvm::MachineBasicBlock* const&) Line | Count | Source | 600 | 8 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 8 | // Recursively hash each argument using a helper class. | 602 | 8 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 8 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 8 | } |
llvm::hash_code llvm::hash_combine<bool, unsigned int>(bool const&, unsigned int const&) Line | Count | Source | 600 | 3.72M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 3.72M | // Recursively hash each argument using a helper class. | 602 | 3.72M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 3.72M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 3.72M | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, unsigned int>(llvm::hash_code const&, unsigned int const&) Line | Count | Source | 600 | 456k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 456k | // Recursively hash each argument using a helper class. | 602 | 456k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 456k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 456k | } |
llvm::hash_code llvm::hash_combine<llvm::DILocalVariable const*, unsigned int, llvm::DILocation const*>(llvm::DILocalVariable const* const&, unsigned int const&, llvm::DILocation const* const&) Line | Count | Source | 600 | 19.6k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 19.6k | // Recursively hash each argument using a helper class. | 602 | 19.6k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 19.6k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 19.6k | } |
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 | 600 | 47.2M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 47.2M | // Recursively hash each argument using a helper class. | 602 | 47.2M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 47.2M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 47.2M | } |
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 | 600 | 25.0M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 25.0M | // Recursively hash each argument using a helper class. | 602 | 25.0M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 25.0M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 25.0M | } |
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&) Line | Count | Source | 600 | 24 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 24 | // Recursively hash each argument using a helper class. | 602 | 24 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 24 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 24 | } |
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&) Line | Count | Source | 600 | 1.01k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 1.01k | // Recursively hash each argument using a helper class. | 602 | 1.01k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 1.01k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 1.01k | } |
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 | 600 | 1.75M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 1.75M | // Recursively hash each argument using a helper class. | 602 | 1.75M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 1.75M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 1.75M | } |
llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, int>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, int const&) Line | Count | Source | 600 | 545k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 545k | // Recursively hash each argument using a helper class. | 602 | 545k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 545k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 545k | } |
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 | 600 | 394k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 394k | // Recursively hash each argument using a helper class. | 602 | 394k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 394k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 394k | } |
llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, long long, llvm::StringRef>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, long long const&, llvm::StringRef const&) Line | Count | Source | 600 | 6.92k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 6.92k | // Recursively hash each argument using a helper class. | 602 | 6.92k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 6.92k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 6.92k | } |
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 | 600 | 6.06M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 6.06M | // Recursively hash each argument using a helper class. | 602 | 6.06M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 6.06M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 6.06M | } |
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&) Line | Count | Source | 600 | 504 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 504 | // Recursively hash each argument using a helper class. | 602 | 504 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 504 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 504 | } |
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&) Line | Count | Source | 600 | 21 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 21 | // Recursively hash each argument using a helper class. | 602 | 21 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 21 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 21 | } |
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&) llvm::hash_code llvm::hash_combine<llvm::MachineOperand::MachineOperandType, unsigned int, llvm::MCSymbol*>(llvm::MachineOperand::MachineOperandType const&, unsigned int const&, llvm::MCSymbol* const&) Line | Count | Source | 600 | 287 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 287 | // Recursively hash each argument using a helper class. | 602 | 287 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 287 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 287 | } |
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 | 600 | 21.0k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 21.0k | // Recursively hash each argument using a helper class. | 602 | 21.0k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 21.0k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 21.0k | } |
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 | 600 | 17.5M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 17.5M | // Recursively hash each argument using a helper class. | 602 | 17.5M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 17.5M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 17.5M | } |
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 | 600 | 7.85M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 7.85M | // Recursively hash each argument using a helper class. | 602 | 7.85M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 7.85M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 7.85M | } |
llvm::hash_code llvm::hash_combine<unsigned int, unsigned int, llvm::Metadata*, llvm::Metadata*, bool>(unsigned int const&, unsigned int const&, llvm::Metadata* const&, llvm::Metadata* const&, bool const&) Line | Count | Source | 600 | 16.2M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 16.2M | // Recursively hash each argument using a helper class. | 602 | 16.2M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 16.2M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 16.2M | } |
llvm::hash_code llvm::hash_combine<unsigned int, unsigned int, llvm::MDString*>(unsigned int const&, unsigned int const&, llvm::MDString* const&) Line | Count | Source | 600 | 114 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 114 | // Recursively hash each argument using a helper class. | 602 | 114 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 114 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 114 | } |
llvm::hash_code llvm::hash_combine<long long, long long>(long long const&, long long const&) Line | Count | Source | 600 | 829 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 829 | // Recursively hash each argument using a helper class. | 602 | 829 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 829 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 829 | } |
llvm::hash_code llvm::hash_combine<llvm::Metadata*, long long>(llvm::Metadata* const&, long long const&) Line | Count | Source | 600 | 84 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 84 | // Recursively hash each argument using a helper class. | 602 | 84 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 84 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 84 | } |
llvm::hash_code llvm::hash_combine<long long, llvm::MDString*>(long long const&, llvm::MDString* const&) Line | Count | Source | 600 | 36.5k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 36.5k | // Recursively hash each argument using a helper class. | 602 | 36.5k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 36.5k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 36.5k | } |
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 | 600 | 4.49k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 4.49k | // Recursively hash each argument using a helper class. | 602 | 4.49k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 4.49k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 4.49k | } |
llvm::hash_code llvm::hash_combine<llvm::MDString*, llvm::Metadata*>(llvm::MDString* const&, llvm::Metadata* const&) Line | Count | Source | 600 | 4.08k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 4.08k | // Recursively hash each argument using a helper class. | 602 | 4.08k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 4.08k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 4.08k | } |
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 | 600 | 20.1k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 20.1k | // Recursively hash each argument using a helper class. | 602 | 20.1k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 20.1k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 20.1k | } |
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 | 600 | 6.03k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 6.03k | // Recursively hash each argument using a helper class. | 602 | 6.03k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 6.03k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 6.03k | } |
llvm::hash_code llvm::hash_combine<unsigned int, unsigned char, llvm::Metadata*>(unsigned int const&, unsigned char const&, llvm::Metadata* const&) Line | Count | Source | 600 | 130k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 130k | // Recursively hash each argument using a helper class. | 602 | 130k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 130k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 130k | } |
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 | 600 | 28.6k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 28.6k | // Recursively hash each argument using a helper class. | 602 | 28.6k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 28.6k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 28.6k | } |
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&) Line | Count | Source | 600 | 4.56k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 4.56k | // Recursively hash each argument using a helper class. | 602 | 4.56k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 4.56k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 4.56k | } |
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&) Line | Count | Source | 600 | 65 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 65 | // Recursively hash each argument using a helper class. | 602 | 65 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 65 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 65 | } |
llvm::hash_code llvm::hash_combine<llvm::Metadata*, llvm::Metadata*, unsigned int>(llvm::Metadata* const&, llvm::Metadata* const&, unsigned int const&) Line | Count | Source | 600 | 2.47k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 2.47k | // Recursively hash each argument using a helper class. | 602 | 2.47k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 2.47k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 2.47k | } |
llvm::hash_code llvm::hash_combine<llvm::Metadata*, llvm::MDString*>(llvm::Metadata* const&, llvm::MDString* const&) Line | Count | Source | 600 | 524 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 524 | // Recursively hash each argument using a helper class. | 602 | 524 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 524 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 524 | } |
llvm::hash_code llvm::hash_combine<llvm::Metadata*, llvm::Metadata*, llvm::MDString*, llvm::Metadata*, unsigned int>(llvm::Metadata* const&, llvm::Metadata* const&, llvm::MDString* const&, llvm::Metadata* const&, unsigned int const&) Line | Count | Source | 600 | 17 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 17 | // Recursively hash each argument using a helper class. | 602 | 17 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 17 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 17 | } |
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&) Line | Count | Source | 600 | 138 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 138 | // Recursively hash each argument using a helper class. | 602 | 138 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 138 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 138 | } |
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&) Line | Count | Source | 600 | 1.22k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 1.22k | // Recursively hash each argument using a helper class. | 602 | 1.22k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 1.22k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 1.22k | } |
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 | 600 | 3.00k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 3.00k | // Recursively hash each argument using a helper class. | 602 | 3.00k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 3.00k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 3.00k | } |
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 | 600 | 23.7k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 23.7k | // Recursively hash each argument using a helper class. | 602 | 23.7k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 23.7k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 23.7k | } |
llvm::hash_code llvm::hash_combine<llvm::Metadata*, llvm::MDString*, unsigned int>(llvm::Metadata* const&, llvm::MDString* const&, unsigned int const&) Line | Count | Source | 600 | 72 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 72 | // Recursively hash each argument using a helper class. | 602 | 72 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 72 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 72 | } |
llvm::hash_code llvm::hash_combine<llvm::Metadata*, llvm::Metadata*>(llvm::Metadata* const&, llvm::Metadata* const&) Line | Count | Source | 600 | 6.96k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 6.96k | // Recursively hash each argument using a helper class. | 602 | 6.96k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 6.96k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 6.96k | } |
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&) Line | Count | Source | 600 | 167 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 167 | // Recursively hash each argument using a helper class. | 602 | 167 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 167 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 167 | } |
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&) Line | Count | Source | 600 | 1.82k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 1.82k | // Recursively hash each argument using a helper class. | 602 | 1.82k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 1.82k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 1.82k | } |
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&) Line | Count | Source | 600 | 4.19k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 4.19k | // Recursively hash each argument using a helper class. | 602 | 4.19k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 4.19k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 4.19k | } |
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 | 600 | 143 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 143 | // Recursively hash each argument using a helper class. | 602 | 143 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 143 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 143 | } |
llvm::hash_code llvm::hash_combine<llvm::ArrayType*, unsigned int>(llvm::ArrayType* const&, unsigned int const&) Line | Count | Source | 600 | 61.9k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 61.9k | // Recursively hash each argument using a helper class. | 602 | 61.9k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 61.9k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 61.9k | } |
llvm::hash_code llvm::hash_combine<llvm::StructType*, unsigned int>(llvm::StructType* const&, unsigned int const&) Line | Count | Source | 600 | 207k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 207k | // Recursively hash each argument using a helper class. | 602 | 207k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 207k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 207k | } |
llvm::hash_code llvm::hash_combine<llvm::VectorType*, unsigned int>(llvm::VectorType* const&, unsigned int const&) Line | Count | Source | 600 | 231k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 231k | // Recursively hash each argument using a helper class. | 602 | 231k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 231k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 231k | } |
llvm::hash_code llvm::hash_combine<llvm::Type*, unsigned int>(llvm::Type* const&, unsigned int const&) Line | Count | Source | 600 | 17.5M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 17.5M | // Recursively hash each argument using a helper class. | 602 | 17.5M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 17.5M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 17.5M | } |
llvm::hash_code llvm::hash_combine<llvm::PointerType*, unsigned int>(llvm::PointerType* const&, unsigned int const&) Line | Count | Source | 600 | 21.0k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 21.0k | // Recursively hash each argument using a helper class. | 602 | 21.0k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 21.0k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 21.0k | } |
llvm::hash_code llvm::hash_combine<llvm::MCSymbol const*, unsigned int, unsigned int, bool, bool, unsigned int, bool>(llvm::MCSymbol const* const&, unsigned int const&, unsigned int const&, bool const&, bool const&, unsigned int const&, bool const&) Line | Count | Source | 600 | 25.5k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 25.5k | // Recursively hash each argument using a helper class. | 602 | 25.5k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 25.5k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 25.5k | } |
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 | 600 | 7.53M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 7.53M | // Recursively hash each argument using a helper class. | 602 | 7.53M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 7.53M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 7.53M | } |
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 | 600 | 12.6M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 12.6M | // Recursively hash each argument using a helper class. | 602 | 12.6M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 12.6M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 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 | 600 | 233k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 233k | // Recursively hash each argument using a helper class. | 602 | 233k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 233k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 233k | } |
llvm::hash_code llvm::hash_combine<unsigned int, llvm::Value*, llvm::Value*, llvm::Value*>(unsigned int const&, llvm::Value* const&, llvm::Value* const&, llvm::Value* const&) Line | Count | Source | 600 | 59.6k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 59.6k | // Recursively hash each argument using a helper class. | 602 | 59.6k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 59.6k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 59.6k | } |
llvm::hash_code llvm::hash_combine<unsigned int, llvm::CmpInst::Predicate, llvm::Value*, llvm::Value*, llvm::Value*, llvm::Value*>(unsigned int const&, llvm::CmpInst::Predicate const&, llvm::Value* const&, llvm::Value* const&, llvm::Value* const&, llvm::Value* const&) Line | Count | Source | 600 | 310k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 310k | // Recursively hash each argument using a helper class. | 602 | 310k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 310k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 310k | } |
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 | 600 | 8.46M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 8.46M | // Recursively hash each argument using a helper class. | 602 | 8.46M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 8.46M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 8.46M | } |
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 | 600 | 376k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 376k | // Recursively hash each argument using a helper class. | 602 | 376k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 376k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 376k | } |
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 | 600 | 125k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 125k | // Recursively hash each argument using a helper class. | 602 | 125k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 125k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 125k | } |
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 | 600 | 21.6M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 21.6M | // Recursively hash each argument using a helper class. | 602 | 21.6M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 21.6M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 21.6M | } |
Unexecuted instantiation: llvm::hash_code llvm::hash_combine<llvm::hash_code, unsigned int, bool>(llvm::hash_code const&, unsigned int const&, bool const&) 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&) Line | Count | Source | 600 | 2.44k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 2.44k | // Recursively hash each argument using a helper class. | 602 | 2.44k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 2.44k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 2.44k | } |
llvm::hash_code llvm::hash_combine<unsigned int, llvm::Type*, unsigned int, bool>(unsigned int const&, llvm::Type* const&, unsigned int const&, bool const&) Line | Count | Source | 600 | 148 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 148 | // Recursively hash each argument using a helper class. | 602 | 148 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 148 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 148 | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::MemoryAccess const*>(llvm::hash_code const&, llvm::MemoryAccess const* const&) Line | Count | Source | 600 | 1.15k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 1.15k | // Recursively hash each argument using a helper class. | 602 | 1.15k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 1.15k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 1.15k | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::hash_code>(llvm::hash_code const&, llvm::hash_code const&) Line | Count | Source | 600 | 8.33M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 8.33M | // Recursively hash each argument using a helper class. | 602 | 8.33M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 8.33M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 8.33M | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::BasicBlock*>(llvm::hash_code const&, llvm::BasicBlock* const&) Line | Count | Source | 600 | 273 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 273 | // Recursively hash each argument using a helper class. | 602 | 273 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 273 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 273 | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::Type*, llvm::Value*>(llvm::hash_code const&, llvm::Type* const&, llvm::Value* const&) Line | Count | Source | 600 | 54 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 54 | // Recursively hash each argument using a helper class. | 602 | 54 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 54 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 54 | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::Type*, llvm::Constant*>(llvm::hash_code const&, llvm::Type* const&, llvm::Constant* const&) Line | Count | Source | 600 | 485 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 485 | // Recursively hash each argument using a helper class. | 602 | 485 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 485 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 485 | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::Instruction*>(llvm::hash_code const&, llvm::Instruction* const&) Line | Count | Source | 600 | 278 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 278 | // Recursively hash each argument using a helper class. | 602 | 278 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 278 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 278 | } |
llvm::hash_code llvm::hash_combine<unsigned char, unsigned char, unsigned int>(unsigned char const&, unsigned char const&, unsigned int const&) Line | Count | Source | 600 | 150k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 150k | // Recursively hash each argument using a helper class. | 602 | 150k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 150k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 150k | } |
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 | 600 | 999k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 999k | // Recursively hash each argument using a helper class. | 602 | 999k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 999k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 999k | } |
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 | 600 | 240M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 240M | // Recursively hash each argument using a helper class. | 602 | 240M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 240M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 240M | } |
llvm::hash_code llvm::hash_combine<void*, void*>(void* const&, void* const&) Line | Count | Source | 600 | 23.0k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 23.0k | // Recursively hash each argument using a helper class. | 602 | 23.0k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 23.0k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 23.0k | } |
llvm::hash_code llvm::hash_combine<clang::NestedNameSpecifier*, void*>(clang::NestedNameSpecifier* const&, void* const&) Line | Count | Source | 600 | 930 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 930 | // Recursively hash each argument using a helper class. | 602 | 930 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 930 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 930 | } |
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&) Line | Count | Source | 600 | 1.76k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 1.76k | // Recursively hash each argument using a helper class. | 602 | 1.76k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 1.76k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 1.76k | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, llvm::StringRef>(llvm::hash_code const&, llvm::StringRef const&) Line | Count | Source | 600 | 14 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 14 | // Recursively hash each argument using a helper class. | 602 | 14 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 14 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 14 | } |
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&) Line | Count | Source | 600 | 2.04k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 2.04k | // Recursively hash each argument using a helper class. | 602 | 2.04k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 2.04k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 2.04k | } |
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&) Line | Count | Source | 600 | 4.11k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 4.11k | // Recursively hash each argument using a helper class. | 602 | 4.11k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 4.11k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 4.11k | } |
llvm::hash_code llvm::hash_combine<llvm::hash_code, bool, bool>(llvm::hash_code const&, bool const&, bool const&) Line | Count | Source | 600 | 2.04k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 2.04k | // Recursively hash each argument using a helper class. | 602 | 2.04k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 2.04k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 2.04k | } |
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&) Line | Count | Source | 600 | 1.28k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 1.28k | // Recursively hash each argument using a helper class. | 602 | 1.28k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 1.28k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 1.28k | } |
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&) Line | Count | Source | 600 | 2.04k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 2.04k | // Recursively hash each argument using a helper class. | 602 | 2.04k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 2.04k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 2.04k | } |
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> > >(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&) llvm::hash_code llvm::hash_combine<llvm::hash_code, clang::SanitizerMask>(llvm::hash_code const&, clang::SanitizerMask const&) Line | Count | Source | 600 | 3 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 3 | // Recursively hash each argument using a helper class. | 602 | 3 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 3 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 3 | } |
llvm::hash_code llvm::hash_combine<long long, long>(long long const&, long const&) Line | Count | Source | 600 | 62.4k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 62.4k | // Recursively hash each argument using a helper class. | 602 | 62.4k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 62.4k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 62.4k | } |
llvm::hash_code llvm::hash_combine<unsigned int, unsigned int, unsigned int>(unsigned int const&, unsigned int const&, unsigned int const&) Line | Count | Source | 600 | 974k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 974k | // Recursively hash each argument using a helper class. | 602 | 974k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 974k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 974k | } |
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 | 600 | 16.2M | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 16.2M | // Recursively hash each argument using a helper class. | 602 | 16.2M | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 16.2M | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 16.2M | } |
llvm::hash_code llvm::hash_combine<void*, unsigned int, unsigned int>(void* const&, unsigned int const&, unsigned int const&) Line | Count | Source | 600 | 69.6k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 69.6k | // Recursively hash each argument using a helper class. | 602 | 69.6k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 69.6k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 69.6k | } |
llvm::hash_code llvm::hash_combine<clang::APValue::LValueBase, llvm::ArrayRef<clang::APValue::LValuePathEntry> >(clang::APValue::LValueBase const&, llvm::ArrayRef<clang::APValue::LValuePathEntry> const&) Line | Count | Source | 600 | 69.6k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 69.6k | // Recursively hash each argument using a helper class. | 602 | 69.6k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 69.6k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 69.6k | } |
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&) Line | Count | Source | 600 | 1.54k | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 1.54k | // Recursively hash each argument using a helper class. | 602 | 1.54k | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 1.54k | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 1.54k | } |
llvm::hash_code llvm::hash_combine<unsigned long, llvm::wasm::ValType>(unsigned long const&, llvm::wasm::ValType const&) Line | Count | Source | 600 | 792 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 792 | // Recursively hash each argument using a helper class. | 602 | 792 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 792 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 792 | } |
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 | 600 | 54 | template <typename ...Ts> hash_code hash_combine(const Ts &...args) { | 601 | 54 | // Recursively hash each argument using a helper class. | 602 | 54 | ::llvm::hashing::detail::hash_combine_recursive_helper helper; | 603 | 54 | return helper.combine(0, helper.buffer, helper.buffer + 64, args...); | 604 | 54 | } |
|