Searched refs:BitNum (Results 1 - 3 of 3) sorted by relevance
| /freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | PackedVector.h | 22 template <typename T, unsigned BitNum, typename BitVectorTy, bool isSigned>
27 template <typename T, unsigned BitNum, typename BitVectorTy>
28 class PackedVectorBase<T, BitNum, BitVectorTy, false> {
32 for (unsigned i = 0; i != BitNum; ++i)
33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
38 assert((val >> BitNum) == 0 && "value is too big");
39 for (unsigned i = 0; i != BitNum; ++i)
40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i);
44 template <typename T, unsigned BitNum, typename BitVectorTy>
45 class PackedVectorBase<T, BitNum, BitVectorT
[all...] |
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonBitTracker.cpp | 1065 uint16_t BitNum;
1111 BitNum = 8;
1125 BitNum = 8;
1139 BitNum = 16;
1153 BitNum = 16;
1169 BitNum = 32;
1184 BitNum = 64;
1194 assert(W >= BitNum && BitNum > 0);
1197 for (uint16_t i = 0; i < BitNum;
[all...] |
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Mips/AsmParser/ |
| H A D | MipsAsmParser.cpp | 2683 unsigned BitNum = findFirstSet(x); local
2685 return (x == x >> BitNum << BitNum) && isUInt<N>(x >> BitNum);
2839 for (int BitNum = 16; BitNum >= 0; BitNum -= 16) {
2840 uint16_t ImmChunk = (ImmValue >> BitNum) & 0xffff;
|
Completed in 142 milliseconds