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
47
48
49
50
51
52
53
54
55
|
//===- llvm/unittest/Support/KnownBitsTest.h - KnownBits tests ------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// This file implements helpers for KnownBits and DemandedBits unit tests.
//
//===----------------------------------------------------------------------===//
#ifndef LLVM_UNITTESTS_SUPPORT_KNOWNBITSTEST_H
#define LLVM_UNITTESTS_SUPPORT_KNOWNBITSTEST_H
#include "llvm/Support/KnownBits.h"
namespace {
using namespace llvm;
template <typename FnTy> void ForeachKnownBits(unsigned Bits, FnTy Fn) {
unsigned Max = 1 << Bits;
KnownBits Known(Bits);
for (unsigned Zero = 0; Zero < Max; ++Zero) {
for (unsigned One = 0; One < Max; ++One) {
Known.Zero = Zero;
Known.One = One;
Fn(Known);
}
}
}
template <typename FnTy>
void ForeachNumInKnownBits(const KnownBits &Known, FnTy Fn) {
unsigned Bits = Known.getBitWidth();
assert(Bits < 32);
unsigned Max = 1u << Bits;
unsigned Zero = Known.Zero.getZExtValue();
unsigned One = Known.One.getZExtValue();
if (Zero & One) {
// Known has a conflict. No values will satisfy it.
return;
}
for (unsigned N = 0; N < Max; ++N) {
if ((N & Zero) == 0 && (~N & One) == 0)
Fn(APInt(Bits, N));
}
}
} // end anonymous namespace
#endif
|
