Home
last modified time | relevance | path

Searched refs:Bits (Results 1 – 25 of 226) sorted by relevance

12345678910

/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DBitVector.h486 if (Bits[i] & RHS.Bits[i]) in anyCommon()
496 return std::equal(Bits.begin(), Bits.begin() + NumWords, RHS.Bits.begin());
507 Bits[i] &= RHS.Bits[i];
523 Bits[i] &= ~RHS.Bits[i]; in reset()
534 if ((Bits[i] & ~RHS.Bits[i]) != 0) in test()
553 Out.Bits[I] = f(Arg.Bits[I], Args.Bits[I]...); in apply()
562 Bits[I] |= RHS.Bits[I];
570 Bits[I] ^= RHS.Bits[I];
615 Bits[I] |= (Bits[I + 1] & Mask) << LSH;
674 std::swap(Bits, RHS.Bits); in swap()
[all …]
H A DPackedVector.h52 if (Bits[(Idx << (BitNum-1)) + BitNum-1]) in getValue()
78 BitVectorTy Bits; variable
92 Vec.setValue(Vec.Bits, Idx, val);
97 return Vec.getValue(Vec.Bits, Idx); in T()
104 bool empty() const { return Bits.empty(); } in empty()
108 void clear() { Bits.clear(); } in clear()
115 Bits.reset(); in reset()
129 return base::getValue(Bits, Idx);
133 return Bits == RHS.Bits;
137 return Bits != RHS.Bits;
[all …]
H A DSparseBitVector.h73 if (Bits[i] != RHS.Bits[i])
94 if (Bits[i]) in empty()
177 Bits[i] |= RHS.Bits[i]; in unionWith()
187 if (RHS.Bits[i] & Bits[i]) in intersects()
204 Bits[i] &= RHS.Bits[i]; in intersectWith()
227 Bits[i] &= ~RHS.Bits[i]; in intersectWithComplement()
247 Bits[i] = RHS1.Bits[i] & ~RHS2.Bits[i]; in intersectWithComplement()
359 while (Bits && !(Bits & 1)) { in AdvanceToNextNonZero()
365 if (!Bits) { in AdvanceToNextNonZero()
401 Bits = 0; in BitVector()
[all …]
H A DPointerEmbeddedInt.h32 template <typename IntT, int Bits = sizeof(IntT) * CHAR_BIT>
38 static_assert(Bits < sizeof(uintptr_t) * CHAR_BIT,
44 Shift = sizeof(uintptr_t) * CHAR_BIT - Bits,
47 Mask = static_cast<uintptr_t>(-1) << Bits
64 assert((std::is_signed<IntT>::value ? isInt<Bits>(I) : isUInt<Bits>(I)) &&
81 template <typename IntT, int Bits>
82 struct PointerLikeTypeTraits<PointerEmbeddedInt<IntT, Bits>> {
83 using T = PointerEmbeddedInt<IntT, Bits>;
102 template <typename IntT, int Bits>
103 struct DenseMapInfo<PointerEmbeddedInt<IntT, Bits>> {
[all …]
H A DBitfields.h94 template <typename T, unsigned Bits> struct BitPatterns {
103 static_assert(TypeBits >= Bits, "n-bit must fit in T");
123 using BP = BitPatterns<T, Bits>;
134 template <typename T, unsigned Bits> struct Compressor<T, Bits, false> {
136 using BP = BitPatterns<T, Bits>;
160 using C = Compressor<IntegerType, Bitfield::Bits>;
161 using BP = BitPatterns<StorageType, Bitfield::Bits>;
228 static constexpr unsigned Bits = Size;
230 static constexpr unsigned LastBit = Shift + Bits - 1;
231 static constexpr unsigned NextBit = Shift + Bits;
[all …]
H A DSmallBitVector.h202 uintptr_t Bits = getSmallBits(); in count() local
203 return countPopulation(Bits); in count()
232 uintptr_t Bits = getSmallBits(); in find_first() local
233 if (Bits == 0) in find_first()
235 return countTrailingZeros(Bits); in find_first()
242 uintptr_t Bits = getSmallBits(); in find_last() local
243 if (Bits == 0) in find_last()
256 uintptr_t Bits = getSmallBits(); in find_first_unset() local
257 return countTrailingOnes(Bits); in find_first_unset()
301 return countTrailingOnes(Bits); in find_next_unset()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/MC/
H A DSubtargetFeature.h49 Bits[I] = B[I]; in FeatureBitset()
60 std::fill(std::begin(Bits), std::end(Bits), -1ULL); in set()
67 Bits[I / 64] = NewBits; in set()
74 Bits[I / 64] = NewBits; in reset()
81 Bits[I / 64] = NewBits; in flip()
100 for (auto B : Bits) in count()
107 Bits[I] ^= RHS.Bits[I];
119 Bits[I] &= RHS.Bits[I];
131 Bits[I] |= RHS.Bits[I];
143 for (auto &B : Result.Bits)
[all …]
/llvm-project-15.0.7/libc/src/__support/CPP/
H A DUInt.h22 static_assert(Bits > 0 && Bits % 64 == 0,
62 UInt<Bits> &operator=(const UInt<Bits> &other) {
86 constexpr UInt<Bits> operator+(const UInt<Bits> &other) const {
92 constexpr UInt<Bits> operator+=(const UInt<Bits> &other) {
155 constexpr UInt<Bits> operator*(const UInt<Bits> &other) const {
166 constexpr UInt<Bits> &operator*=(const UInt<Bits> &other) {
231 constexpr UInt<Bits> operator&(const UInt<Bits> &other) const {
238 constexpr UInt<Bits> &operator&=(const UInt<Bits> &other) {
244 constexpr UInt<Bits> operator|(const UInt<Bits> &other) const {
251 constexpr UInt<Bits> &operator|=(const UInt<Bits> &other) {
[all …]
/llvm-project-15.0.7/llvm/test/TableGen/
H A D2010-03-24-PrematureDefaults.td6 bits<2> Bits = x;
10 // CHECK: Bits = { 0, 1 }
14 // CHECK: Bits = { 1, 0 }
17 // Here was the bug: X.Bits would get resolved to the default a1.Bits while
19 // was processed, X would be set correctly, but Bits retained the default
23 bits<2> Bits = X.Bits;
27 // CHECK: Bits = { 0, 1 }
31 // CHECK: Bits = { 1, 0 }
35 bits<2> Bits = x.Bits;
39 // CHECK: Bits = { 0, 1 }
[all …]
H A DAsmPredicateCombining.td66 // DISASS: return (Bits[arch::AsmCond1]);
69 // DISASS: return (Bits[arch::AsmCond2a] && Bits[arch::AsmCond2b])
72 // DISASS: return (Bits[arch::AsmCond3a] || Bits[arch::AsmCond3b])
75 // DISASS: return (Bits[arch::AsmCond1] && (Bits[arch::AsmCond2a] && Bits[arch::AsmCond2b]))
78 // DISASS: return (Bits[arch::AsmCond1] && (Bits[arch::AsmCond3a] || Bits[arch::AsmCond3b]))
/llvm-project-15.0.7/llvm/lib/Target/PowerPC/
H A DPPCMachineFunctionInfo.cpp100 int Bits = 0; in getVecExtParmsType() local
111 Bits += XCOFF::TracebackTable::WidthOfParamType; in getVecExtParmsType()
117 Bits += XCOFF::TracebackTable::WidthOfParamType; in getVecExtParmsType()
123 Bits += XCOFF::TracebackTable::WidthOfParamType; in getVecExtParmsType()
129 Bits += XCOFF::TracebackTable::WidthOfParamType; in getVecExtParmsType()
136 if (Bits >= 32) in getVecExtParmsType()
139 return Bits < 32 ? VectExtParamInfo << (32 - Bits) : VectExtParamInfo; in getVecExtParmsType()
146 int Bits = 0; in getParmsType() local
149 if (Bits > 31 || (Bits > 30 && (Elt != FixedType || hasVectorParms()))) in getParmsType()
163 ++Bits; in getParmsType()
[all …]
/llvm-project-15.0.7/llvm/unittests/Support/
H A DKnownBitsTest.cpp22 unsigned Bits = 4; in TEST() local
53 unsigned Bits = 4; in TestAddSubExhaustive() local
56 KnownBits Known(Bits), KnownNSW(Bits); in TestAddSubExhaustive()
101 unsigned Bits = 4; in TEST() local
159 Res = (N1.sext(2 * Bits) * N2.sext(2 * Bits)).extractBits(Bits, Bits); in TEST()
163 Res = (N1.zext(2 * Bits) * N2.zext(2 * Bits)).extractBits(Bits, Bits); in TEST()
281 unsigned Bits = 4; in TEST() local
311 unsigned Bits = 4; in TEST() local
398 unsigned Bits = 4; in TEST() local
412 unsigned Bits = 4; in TEST() local
[all …]
H A DKnownBitsTest.h22 template <typename FnTy> void ForeachKnownBits(unsigned Bits, FnTy Fn) { in ForeachKnownBits() argument
23 unsigned Max = 1 << Bits; in ForeachKnownBits()
24 KnownBits Known(Bits); in ForeachKnownBits()
39 unsigned Bits = Known.getBitWidth(); in ForeachNumInKnownBits() local
40 unsigned Max = 1 << Bits; in ForeachNumInKnownBits()
42 APInt Num(Bits, N); in ForeachNumInKnownBits()
/llvm-project-15.0.7/llvm/lib/Support/
H A DFoldingSet.cpp49 Bits.reserve(Bits.size() + NumInserts); in AddString()
51 Bits.push_back(Size); in AddString()
74 Bits.push_back(V); in AddString()
82 Bits.push_back(V); in AddString()
98 Bits.push_back(V); in AddString()
103 Bits.append(ID.Bits.begin(), ID.Bits.end()); in AddNodeID()
109 return *this == FoldingSetNodeIDRef(RHS.Bits.data(), RHS.Bits.size()); in operator ==()
115 return FoldingSetNodeIDRef(Bits.data(), Bits.size()) == RHS; in operator ==()
121 return *this < FoldingSetNodeIDRef(RHS.Bits.data(), RHS.Bits.size()); in operator <()
125 return FoldingSetNodeIDRef(Bits.data(), Bits.size()) < RHS; in operator <()
[all …]
H A DX86TargetParser.cpp59 uint32_t NewBits = Bits[I] & RHS.Bits[I]; in operator &=()
60 Bits[I] = NewBits; in operator &=()
68 uint32_t NewBits = Bits[I] | RHS.Bits[I]; in operator |=()
78 Result.Bits[I] = Bits[I] & RHS.Bits[I]; in operator &()
86 Result.Bits[I] = Bits[I] | RHS.Bits[I]; in operator |()
93 Result.Bits[I] = ~Bits[I]; in operator ~()
99 if (Bits[I] != RHS.Bits[I]) in operator !=()
623 Bits |= Implies; in getImpliedEnabledFeatures()
625 Prev = Bits; in getImpliedEnabledFeatures()
638 Bits.set(Value); in getImpliedDisabledFeatures()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/AArch64/Utils/
H A DAArch64BaseInfo.cpp143 uint32_t Bits; in parseGenericRegister() local
149 Bits = (Op0 << 14) | (Op1 << 11) | (CRn << 7) | (CRm << 3) | Op2; in parseGenericRegister()
151 return Bits; in parseGenericRegister()
154 std::string AArch64SysReg::genericRegisterString(uint32_t Bits) { in genericRegisterString() argument
155 assert(Bits < 0x10000); in genericRegisterString()
156 uint32_t Op0 = (Bits >> 14) & 0x3; in genericRegisterString()
157 uint32_t Op1 = (Bits >> 11) & 0x7; in genericRegisterString()
158 uint32_t CRn = (Bits >> 7) & 0xf; in genericRegisterString()
159 uint32_t CRm = (Bits >> 3) & 0xf; in genericRegisterString()
160 uint32_t Op2 = Bits & 0x7; in genericRegisterString()
/llvm-project-15.0.7/bolt/include/bolt/Passes/
H A DReorderUtils.h39 for (int I : Bits[C->id()].set_bits()) in forAllAdjacent()
46 Bits[A->id()] |= Bits[B->id()]; in merge()
47 Bits[A->id()][A->id()] = false; in merge()
48 Bits[A->id()][B->id()] = false; in merge()
49 Bits[B->id()][A->id()] = false; in merge()
50 for (int I : Bits[B->id()].set_bits()) { in merge()
51 Bits[I][A->id()] = true; in merge()
52 Bits[I][B->id()] = false; in merge()
61 Bits[A->id()][B->id()] = Value; in set()
62 Bits[B->id()][A->id()] = Value; in set()
[all …]
/llvm-project-15.0.7/clang/include/clang/Basic/
H A DDiagnosticOptions.h91 #define DIAGOPT(Name, Bits, Default) unsigned Name : Bits; argument
92 #define ENUM_DIAGOPT(Name, Type, Bits, Default) argument
98 #define DIAGOPT(Name, Bits, Default) argument
99 #define ENUM_DIAGOPT(Name, Type, Bits, Default) unsigned Name : Bits; argument
127 #define DIAGOPT(Name, Bits, Default) argument
128 #define ENUM_DIAGOPT(Name, Type, Bits, Default) \ argument
134 #define DIAGOPT(Name, Bits, Default) Name = Default; in DiagnosticOptions() argument
135 #define ENUM_DIAGOPT(Name, Type, Bits, Default) set##Name(Default); in DiagnosticOptions() argument
H A DDiagnosticOptions.def23 # define VALUE_DIAGOPT(Name, Bits, Default) \
24 DIAGOPT(Name, Bits, Default)
28 # define ENUM_DIAGOPT(Name, Type, Bits, Default) \
29 DIAGOPT(Name, Bits, Default)
33 # define SEMANTIC_DIAGOPT(Name, Bits, Default) DIAGOPT(Name, Bits, Default)
37 # define SEMANTIC_VALUE_DIAGOPT(Name, Bits, Default) \
38 VALUE_DIAGOPT(Name, Bits, Default)
42 # define SEMANTIC_ENUM_DIAGOPT(Name, Type, Bits, Default) \
43 ENUM_DIAGOPT(Name, Type, Bits, Default)
/llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/
H A DWholeProgramDevirt.h109 VTableBits *Bits; member
115 return Bits < other.Bits || (Bits == other.Bits && Offset < other.Offset);
155 uint64_t minAfterBytes() const { return TM->Bits->ObjectSize - TM->Offset; } in minAfterBytes()
160 return minBeforeBytes() + TM->Bits->Before.Bytes.size(); in allocatedBeforeBytes()
166 return minAfterBytes() + TM->Bits->After.Bytes.size(); in allocatedAfterBytes()
172 TM->Bits->Before.setBit(Pos - 8 * minBeforeBytes(), RetVal); in setBeforeBit()
178 TM->Bits->After.setBit(Pos - 8 * minAfterBytes(), RetVal); in setAfterBit()
187 TM->Bits->Before.setLE(Pos - 8 * minBeforeBytes(), RetVal, Size); in setBeforeBytes()
189 TM->Bits->Before.setBE(Pos - 8 * minBeforeBytes(), RetVal, Size); in setBeforeBytes()
196 TM->Bits->After.setBE(Pos - 8 * minAfterBytes(), RetVal, Size); in setAfterBytes()
[all …]
/llvm-project-15.0.7/llvm/lib/MC/
H A DMCSubtargetInfo.cpp40 Bits |= Implies; in SetImpliedBits()
43 SetImpliedBits(Bits, FE.Implies.getAsBitset(), FeatureTable); in SetImpliedBits()
48 void ClearImpliedBits(FeatureBitset &Bits, unsigned Value, in ClearImpliedBits() argument
52 Bits.reset(FE.Value); in ClearImpliedBits()
53 ClearImpliedBits(Bits, FE.Value, FeatureTable); in ClearImpliedBits()
70 Bits.set(FeatureEntry->Value); in ApplyFeatureFlag()
75 Bits.reset(FeatureEntry->Value); in ApplyFeatureFlag()
78 ClearImpliedBits(Bits, FeatureEntry->Value, FeatureTable); in ApplyFeatureFlag()
161 FeatureBitset Bits; in getFeatures() local
202 ApplyFeatureFlag(Bits, Feature, ProcFeatures); in getFeatures()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DStackLifetime.h64 BitVector Bits; variable
69 LiveRange(unsigned Size, bool Set = false) : Bits(Size, Set) {} in Bits() function
70 void addRange(unsigned Start, unsigned End) { Bits.set(Start, End); } in addRange()
73 return Bits.anyCommon(Other.Bits); in overlaps()
76 void join(const LiveRange &Other) { Bits |= Other.Bits; } in join()
78 bool test(unsigned Idx) const { return Bits.test(Idx); } in test()
180 return OS << R.Bits;
/llvm-project-15.0.7/llvm/lib/BinaryFormat/
H A DXCOFF.cpp114 int Bits = 0; in parseParmsType() local
128 while (Bits < 31 && ParsedNum < ParmsNum) { in parseParmsType()
136 ++Bits; in parseParmsType()
146 Bits += 2; in parseParmsType()
199 for (int Bits = 0; Bits < 32 && ParsedNum < ParmsNum; Bits += 2) { in parseParmsTypeWithVecInfo() local
244 for (int Bits = 0; ParsedNum < ParmsNum && Bits < 32; Bits += 2) { in parseVectorParmsType() local
/llvm-project-15.0.7/clang/lib/AST/
H A DLinkage.h66 unsigned Bits = 0; in toBits() local
67 Bits = (Bits << 1) | ExplicitKind; in toBits()
68 Bits = (Bits << 1) | IgnoreExplicitVisibility; in toBits()
69 Bits = (Bits << 1) | IgnoreAllVisibility; in toBits()
70 return Bits; in toBits()
/llvm-project-15.0.7/llvm/unittests/IR/
H A DDemandedBitsTest.cpp20 unsigned Bits = 4; in TestBinOpExhaustive() local
21 unsigned Max = 1 << Bits; in TestBinOpExhaustive()
22 ForeachKnownBits(Bits, [&](const KnownBits &Known1) { in TestBinOpExhaustive()
23 ForeachKnownBits(Bits, [&](const KnownBits &Known2) { in TestBinOpExhaustive()
25 APInt AOut(Bits, AOut_); in TestBinOpExhaustive()

12345678910