|
| 1 | +//===--- StableHash.cpp - An ABI-stable string hash -----------------------===// |
| 2 | +// |
| 3 | +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| 4 | +// See https://llvm.org/LICENSE.txt for license information. |
| 5 | +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| 6 | +// |
| 7 | +//===----------------------------------------------------------------------===// |
| 8 | +// |
| 9 | +// This file implements an ABI-stable string hash based on SipHash, used to |
| 10 | +// compute ptrauth discriminators. |
| 11 | +// |
| 12 | +//===----------------------------------------------------------------------===// |
| 13 | + |
| 14 | +#include "llvm/Support/SipHash.h" |
| 15 | +#include "llvm/ADT/StringExtras.h" |
| 16 | +#include "llvm/ADT/StringRef.h" |
| 17 | +#include "llvm/Support/Debug.h" |
| 18 | +#include <cstdint> |
| 19 | +#include <cstring> |
| 20 | + |
| 21 | +using namespace llvm; |
| 22 | + |
| 23 | +#define DEBUG_TYPE "llvm-siphash" |
| 24 | + |
| 25 | +// Lightly adapted from the SipHash reference C implementation by |
| 26 | +// Jean-Philippe Aumasson and Daniel J. Bernstein. |
| 27 | + |
| 28 | +#define SIPHASH_ROTL(x, b) (uint64_t)(((x) << (b)) | ((x) >> (64 - (b)))) |
| 29 | + |
| 30 | +#define SIPHASH_U8TO64_LE(p) \ |
| 31 | + (((uint64_t)((p)[0])) | ((uint64_t)((p)[1]) << 8) | \ |
| 32 | + ((uint64_t)((p)[2]) << 16) | ((uint64_t)((p)[3]) << 24) | \ |
| 33 | + ((uint64_t)((p)[4]) << 32) | ((uint64_t)((p)[5]) << 40) | \ |
| 34 | + ((uint64_t)((p)[6]) << 48) | ((uint64_t)((p)[7]) << 56)) |
| 35 | + |
| 36 | +#define SIPHASH_SIPROUND \ |
| 37 | + do { \ |
| 38 | + v0 += v1; \ |
| 39 | + v1 = SIPHASH_ROTL(v1, 13); \ |
| 40 | + v1 ^= v0; \ |
| 41 | + v0 = SIPHASH_ROTL(v0, 32); \ |
| 42 | + v2 += v3; \ |
| 43 | + v3 = SIPHASH_ROTL(v3, 16); \ |
| 44 | + v3 ^= v2; \ |
| 45 | + v0 += v3; \ |
| 46 | + v3 = SIPHASH_ROTL(v3, 21); \ |
| 47 | + v3 ^= v0; \ |
| 48 | + v2 += v1; \ |
| 49 | + v1 = SIPHASH_ROTL(v1, 17); \ |
| 50 | + v1 ^= v2; \ |
| 51 | + v2 = SIPHASH_ROTL(v2, 32); \ |
| 52 | + } while (0) |
| 53 | + |
| 54 | +template <int cROUNDS, int dROUNDS, class ResultTy> |
| 55 | +static inline ResultTy siphash(const uint8_t *in, uint64_t inlen, |
| 56 | + const uint8_t (&k)[16]) { |
| 57 | + static_assert(sizeof(ResultTy) == 8 || sizeof(ResultTy) == 16, |
| 58 | + "result type should be uint64_t or uint128_t"); |
| 59 | + uint64_t v0 = 0x736f6d6570736575ULL; |
| 60 | + uint64_t v1 = 0x646f72616e646f6dULL; |
| 61 | + uint64_t v2 = 0x6c7967656e657261ULL; |
| 62 | + uint64_t v3 = 0x7465646279746573ULL; |
| 63 | + uint64_t b; |
| 64 | + uint64_t k0 = SIPHASH_U8TO64_LE(k); |
| 65 | + uint64_t k1 = SIPHASH_U8TO64_LE(k + 8); |
| 66 | + uint64_t m; |
| 67 | + int i; |
| 68 | + const uint8_t *end = in + inlen - (inlen % sizeof(uint64_t)); |
| 69 | + const int left = inlen & 7; |
| 70 | + b = ((uint64_t)inlen) << 56; |
| 71 | + v3 ^= k1; |
| 72 | + v2 ^= k0; |
| 73 | + v1 ^= k1; |
| 74 | + v0 ^= k0; |
| 75 | + |
| 76 | + if (sizeof(ResultTy) == 16) { |
| 77 | + v1 ^= 0xee; |
| 78 | + } |
| 79 | + |
| 80 | + for (; in != end; in += 8) { |
| 81 | + m = SIPHASH_U8TO64_LE(in); |
| 82 | + v3 ^= m; |
| 83 | + |
| 84 | + for (i = 0; i < cROUNDS; ++i) |
| 85 | + SIPHASH_SIPROUND; |
| 86 | + |
| 87 | + v0 ^= m; |
| 88 | + } |
| 89 | + |
| 90 | + switch (left) { |
| 91 | + case 7: |
| 92 | + b |= ((uint64_t)in[6]) << 48; |
| 93 | + LLVM_FALLTHROUGH; |
| 94 | + case 6: |
| 95 | + b |= ((uint64_t)in[5]) << 40; |
| 96 | + LLVM_FALLTHROUGH; |
| 97 | + case 5: |
| 98 | + b |= ((uint64_t)in[4]) << 32; |
| 99 | + LLVM_FALLTHROUGH; |
| 100 | + case 4: |
| 101 | + b |= ((uint64_t)in[3]) << 24; |
| 102 | + LLVM_FALLTHROUGH; |
| 103 | + case 3: |
| 104 | + b |= ((uint64_t)in[2]) << 16; |
| 105 | + LLVM_FALLTHROUGH; |
| 106 | + case 2: |
| 107 | + b |= ((uint64_t)in[1]) << 8; |
| 108 | + LLVM_FALLTHROUGH; |
| 109 | + case 1: |
| 110 | + b |= ((uint64_t)in[0]); |
| 111 | + break; |
| 112 | + case 0: |
| 113 | + break; |
| 114 | + } |
| 115 | + |
| 116 | + v3 ^= b; |
| 117 | + |
| 118 | + for (i = 0; i < cROUNDS; ++i) |
| 119 | + SIPHASH_SIPROUND; |
| 120 | + |
| 121 | + v0 ^= b; |
| 122 | + |
| 123 | + if (sizeof(ResultTy) == 8) { |
| 124 | + v2 ^= 0xff; |
| 125 | + } else { |
| 126 | + v2 ^= 0xee; |
| 127 | + } |
| 128 | + |
| 129 | + for (i = 0; i < dROUNDS; ++i) |
| 130 | + SIPHASH_SIPROUND; |
| 131 | + |
| 132 | + b = v0 ^ v1 ^ v2 ^ v3; |
| 133 | + |
| 134 | + // This mess with the result type would be easier with 'if constexpr'. |
| 135 | + |
| 136 | + uint64_t firstHalf = b; |
| 137 | + if (sizeof(ResultTy) == 8) |
| 138 | + return firstHalf; |
| 139 | + |
| 140 | + v1 ^= 0xdd; |
| 141 | + |
| 142 | + for (i = 0; i < dROUNDS; ++i) |
| 143 | + SIPHASH_SIPROUND; |
| 144 | + |
| 145 | + b = v0 ^ v1 ^ v2 ^ v3; |
| 146 | + uint64_t secondHalf = b; |
| 147 | + |
| 148 | + return firstHalf | (ResultTy(secondHalf) << (sizeof(ResultTy) == 8 ? 0 : 64)); |
| 149 | +} |
| 150 | + |
| 151 | +//===--- LLVM-specific wrappers around siphash. |
| 152 | + |
| 153 | +/// Compute an ABI-stable 64-bit hash of the given string. |
| 154 | +uint64_t llvm::getPointerAuthStableSipHash64(StringRef Str) { |
| 155 | + static const uint8_t K[16] = {0xb5, 0xd4, 0xc9, 0xeb, 0x79, 0x10, 0x4a, 0x79, |
| 156 | + 0x6f, 0xec, 0x8b, 0x1b, 0x42, 0x87, 0x81, 0xd4}; |
| 157 | + |
| 158 | + // The aliasing is fine here because of omnipotent char. |
| 159 | + auto *Data = reinterpret_cast<const uint8_t *>(Str.data()); |
| 160 | + return siphash<2, 4, uint64_t>(Data, Str.size(), K); |
| 161 | +} |
| 162 | + |
| 163 | +/// Compute an ABI-stable 16-bit hash of the given string. |
| 164 | +uint64_t llvm::getPointerAuthStableSipHash16(StringRef Str) { |
| 165 | + uint64_t RawHash = getPointerAuthStableSipHash64(Str); |
| 166 | + |
| 167 | + // Produce a non-zero 16-bit discriminator. |
| 168 | + uint64_t Discriminator = (RawHash % 0xFFFF) + 1; |
| 169 | + LLVM_DEBUG(dbgs() << "ptrauth stable hash 16-bit discriminator: " |
| 170 | + << utostr(Discriminator) << " (0x" |
| 171 | + << utohexstr(Discriminator) << ")" |
| 172 | + << " of: " << Str << "\n"); |
| 173 | + return Discriminator; |
| 174 | +} |
0 commit comments