Searched refs:BitNum (Results 1 – 3 of 3) sorted by relevance
28 class PackedVectorBase<T, BitNum, BitVectorTy, false> {32 for (unsigned i = 0; i != BitNum; ++i) in getValue()38 assert((val >> BitNum) == 0 && "value is too big"); in setValue()39 for (unsigned i = 0; i != BitNum; ++i) in setValue()40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i); in setValue()45 class PackedVectorBase<T, BitNum, BitVectorTy, true> {49 for (unsigned i = 0; i != BitNum-1; ++i) in getValue()51 if (Bits[(Idx << (BitNum-1)) + BitNum-1]) in getValue()59 Bits.set((Idx << (BitNum-1)) + BitNum-1); in setValue()62 for (unsigned i = 0; i != BitNum-1; ++i) in setValue()[all …]
1063 uint16_t BitNum; in evaluateLoad() local1109 BitNum = 8; in evaluateLoad()1123 BitNum = 8; in evaluateLoad()1137 BitNum = 16; in evaluateLoad()1151 BitNum = 16; in evaluateLoad()1167 BitNum = 32; in evaluateLoad()1182 BitNum = 64; in evaluateLoad()1192 assert(W >= BitNum && BitNum > 0); in evaluateLoad()1195 for (uint16_t i = 0; i < BitNum; ++i) in evaluateLoad()1200 for (uint16_t i = BitNum; i < W; ++i) in evaluateLoad()[all …]
2683 unsigned BitNum = findFirstSet(x); in isShiftedUIntAtAnyPosition() local2685 return (x == x >> BitNum << BitNum) && isUInt<N>(x >> BitNum); in isShiftedUIntAtAnyPosition()2839 for (int BitNum = 16; BitNum >= 0; BitNum -= 16) { in loadImmediate() local2840 uint16_t ImmChunk = (ImmValue >> BitNum) & 0xffff; in loadImmediate()