Searched refs:BitNum (Results 1 – 3 of 3) sorted by relevance
29 class PackedVectorBase<T, BitNum, BitVectorTy, false> {33 for (unsigned i = 0; i != BitNum; ++i) in getValue()39 assert((val >> BitNum) == 0 && "value is too big"); in setValue()40 for (unsigned i = 0; i != BitNum; ++i) in setValue()41 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i); in setValue()46 class PackedVectorBase<T, BitNum, BitVectorTy, true> {50 for (unsigned i = 0; i != BitNum-1; ++i) in getValue()52 if (Bits[(Idx << (BitNum-1)) + BitNum-1]) in getValue()60 Bits.set((Idx << (BitNum-1)) + BitNum-1); in setValue()63 for (unsigned i = 0; i != BitNum-1; ++i) in setValue()[all …]
1066 uint16_t BitNum; in evaluateLoad() local1112 BitNum = 8; in evaluateLoad()1126 BitNum = 8; in evaluateLoad()1140 BitNum = 16; in evaluateLoad()1154 BitNum = 16; in evaluateLoad()1170 BitNum = 32; in evaluateLoad()1185 BitNum = 64; in evaluateLoad()1195 assert(W >= BitNum && BitNum > 0); in evaluateLoad()1198 for (uint16_t i = 0; i < BitNum; ++i) in evaluateLoad()1203 for (uint16_t i = BitNum; i < W; ++i) in evaluateLoad()[all …]
2618 unsigned BitNum = findFirstSet(x); in isShiftedUIntAtAnyPosition() local2620 return (x == x >> BitNum << BitNum) && isUInt<N>(x >> BitNum); in isShiftedUIntAtAnyPosition()2774 for (int BitNum = 16; BitNum >= 0; BitNum -= 16) { in loadImmediate() local2775 uint16_t ImmChunk = (ImmValue >> BitNum) & 0xffff; in loadImmediate()