1//===- FuzzerValueBitMap.h - INTERNAL - Bit map -----------------*- C++ -* ===//
2//
| 1//===- FuzzerValueBitMap.h - INTERNAL - Bit map -----------------*- C++ -* ===//
2//
|
3// The LLVM Compiler Infrastructure
| 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
|
4//
| 6//
|
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
| |
8//===----------------------------------------------------------------------===//
9// ValueBitMap.
10//===----------------------------------------------------------------------===//
11
12#ifndef LLVM_FUZZER_VALUE_BIT_MAP_H
13#define LLVM_FUZZER_VALUE_BIT_MAP_H
14
15#include "FuzzerDefs.h"
16
17namespace fuzzer {
18
19// A bit map containing kMapSizeInWords bits.
20struct ValueBitMap {
21 static const size_t kMapSizeInBits = 1 << 16;
22 static const size_t kMapPrimeMod = 65371; // Largest Prime < kMapSizeInBits;
23 static const size_t kBitsInWord = (sizeof(uintptr_t) * 8);
24 static const size_t kMapSizeInWords = kMapSizeInBits / kBitsInWord;
25 public:
26
27 // Clears all bits.
28 void Reset() { memset(Map, 0, sizeof(Map)); }
29
30 // Computes a hash function of Value and sets the corresponding bit.
31 // Returns true if the bit was changed from 0 to 1.
32 ATTRIBUTE_NO_SANITIZE_ALL
33 inline bool AddValue(uintptr_t Value) {
34 uintptr_t Idx = Value % kMapSizeInBits;
35 uintptr_t WordIdx = Idx / kBitsInWord;
36 uintptr_t BitIdx = Idx % kBitsInWord;
37 uintptr_t Old = Map[WordIdx];
| 7//===----------------------------------------------------------------------===//
8// ValueBitMap.
9//===----------------------------------------------------------------------===//
10
11#ifndef LLVM_FUZZER_VALUE_BIT_MAP_H
12#define LLVM_FUZZER_VALUE_BIT_MAP_H
13
14#include "FuzzerDefs.h"
15
16namespace fuzzer {
17
18// A bit map containing kMapSizeInWords bits.
19struct ValueBitMap {
20 static const size_t kMapSizeInBits = 1 << 16;
21 static const size_t kMapPrimeMod = 65371; // Largest Prime < kMapSizeInBits;
22 static const size_t kBitsInWord = (sizeof(uintptr_t) * 8);
23 static const size_t kMapSizeInWords = kMapSizeInBits / kBitsInWord;
24 public:
25
26 // Clears all bits.
27 void Reset() { memset(Map, 0, sizeof(Map)); }
28
29 // Computes a hash function of Value and sets the corresponding bit.
30 // Returns true if the bit was changed from 0 to 1.
31 ATTRIBUTE_NO_SANITIZE_ALL
32 inline bool AddValue(uintptr_t Value) {
33 uintptr_t Idx = Value % kMapSizeInBits;
34 uintptr_t WordIdx = Idx / kBitsInWord;
35 uintptr_t BitIdx = Idx % kBitsInWord;
36 uintptr_t Old = Map[WordIdx];
|
38 uintptr_t New = Old | (1UL << BitIdx);
| 37 uintptr_t New = Old | (1ULL << BitIdx);
|
39 Map[WordIdx] = New;
40 return New != Old;
41 }
42
43 ATTRIBUTE_NO_SANITIZE_ALL
44 inline bool AddValueModPrime(uintptr_t Value) {
45 return AddValue(Value % kMapPrimeMod);
46 }
47
48 inline bool Get(uintptr_t Idx) {
49 assert(Idx < kMapSizeInBits);
50 uintptr_t WordIdx = Idx / kBitsInWord;
51 uintptr_t BitIdx = Idx % kBitsInWord;
| 38 Map[WordIdx] = New;
39 return New != Old;
40 }
41
42 ATTRIBUTE_NO_SANITIZE_ALL
43 inline bool AddValueModPrime(uintptr_t Value) {
44 return AddValue(Value % kMapPrimeMod);
45 }
46
47 inline bool Get(uintptr_t Idx) {
48 assert(Idx < kMapSizeInBits);
49 uintptr_t WordIdx = Idx / kBitsInWord;
50 uintptr_t BitIdx = Idx % kBitsInWord;
|
52 return Map[WordIdx] & (1UL << BitIdx);
| 51 return Map[WordIdx] & (1ULL << BitIdx);
|
53 }
54
55 size_t SizeInBits() const { return kMapSizeInBits; }
56
57 template <class Callback>
58 ATTRIBUTE_NO_SANITIZE_ALL
59 void ForEach(Callback CB) const {
60 for (size_t i = 0; i < kMapSizeInWords; i++)
61 if (uintptr_t M = Map[i])
62 for (size_t j = 0; j < sizeof(M) * 8; j++)
63 if (M & ((uintptr_t)1 << j))
64 CB(i * sizeof(M) * 8 + j);
65 }
66
67 private:
| 52 }
53
54 size_t SizeInBits() const { return kMapSizeInBits; }
55
56 template <class Callback>
57 ATTRIBUTE_NO_SANITIZE_ALL
58 void ForEach(Callback CB) const {
59 for (size_t i = 0; i < kMapSizeInWords; i++)
60 if (uintptr_t M = Map[i])
61 for (size_t j = 0; j < sizeof(M) * 8; j++)
62 if (M & ((uintptr_t)1 << j))
63 CB(i * sizeof(M) * 8 + j);
64 }
65
66 private:
|
68 uintptr_t Map[kMapSizeInWords] __attribute__((aligned(512)));
| 67 ATTRIBUTE_ALIGNED(512) uintptr_t Map[kMapSizeInWords];
|
69};
70
71} // namespace fuzzer
72
73#endif // LLVM_FUZZER_VALUE_BIT_MAP_H
| 68};
69
70} // namespace fuzzer
71
72#endif // LLVM_FUZZER_VALUE_BIT_MAP_H
|