blob: 21fcdd7e7f88fb877b1a888a3c3f5f2352597160 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
//===-- llvm/ADT/Hashing.cpp - Utilities for hashing ------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#include "llvm/ADT/Hashing.h"
namespace llvm {
// Add a possibly unaligned sequence of bytes.
void GeneralHash::addUnaligned(const uint8_t *I, const uint8_t *E) {
ptrdiff_t Length = E - I;
if ((uintptr_t(I) & 3) == 0) {
while (Length > 3) {
mix(*reinterpret_cast<const uint32_t *>(I));
I += 4;
Length -= 4;
}
} else {
while (Length > 3) {
mix(
uint32_t(I[0]) +
(uint32_t(I[1]) << 8) +
(uint32_t(I[2]) << 16) +
(uint32_t(I[3]) << 24));
I += 4;
Length -= 4;
}
}
if (Length & 3) {
uint32_t Data = 0;
switch (Length & 3) {
case 3: Data |= uint32_t(I[2]) << 16; // fall through
case 2: Data |= uint32_t(I[1]) << 8; // fall through
case 1: Data |= uint32_t(I[0]); break;
}
mix(Data);
}
}
}
|
