Searched refs:BitIdx (Results 1 – 4 of 4) sorted by relevance
36 uintptr_t BitIdx = Idx % kBitsInWord; in AddValue() local38 uintptr_t New = Old | (1ULL << BitIdx); in AddValue()51 uintptr_t BitIdx = Idx % kBitsInWord; in Get() local52 return Map[WordIdx] & (1ULL << BitIdx); in Get()
2960 for (unsigned BitIdx = 0; BitIdx < BitWidth; ++BitIdx) { in collectBitParts() local3023 for (unsigned BitIdx = 0; BitIdx < BitWidth; ++BitIdx) in collectBitParts() local3039 for (unsigned BitIdx = 0; BitIdx < NarrowBitWidth; ++BitIdx) in collectBitParts() local3041 for (unsigned BitIdx = NarrowBitWidth; BitIdx < BitWidth; ++BitIdx) in collectBitParts() local3054 for (unsigned BitIdx = 0; BitIdx < BitWidth; ++BitIdx) in collectBitParts() local3068 for (unsigned BitIdx = 0; BitIdx < BitWidth; ++BitIdx) in collectBitParts() local3084 for (unsigned BitIdx = 0; BitIdx < 8; ++BitIdx) in collectBitParts() local3119 for (unsigned BitIdx = 0; BitIdx < StartBitRHS; ++BitIdx) in collectBitParts() local3121 for (unsigned BitIdx = 0; BitIdx < ModAmt; ++BitIdx) in collectBitParts() local3136 for (unsigned BitIdx = 0; BitIdx < BitWidth; ++BitIdx) in collectBitParts() local[all …]
148 uint8_t BitIdx = I % 32; in readGSIHashBuckets() local149 bool IsSet = HashBitmap[WordIdx] & (1U << BitIdx); in readGSIHashBuckets()
7665 int BitIdx = N->getConstantOperandVal(2); in getTargetShuffleMask() local7676 int BitIdx = N->getConstantOperandVal(3); in getTargetShuffleMask() local11911 ZeroMask.setBit(BitIdx); in isTargetShuffleEquivalent()13785 BitIdx = (Idx * VT.getScalarSizeInBits()) & 0x3f; in matchShuffleAsEXTRQ()13795 uint64_t &BitIdx) { in matchShuffleAsINSERTQ() argument13848 BitIdx = (Idx * VT.getScalarSizeInBits()) & 0x3f; in matchShuffleAsINSERTQ()13862 uint64_t BitLen, BitIdx; in lowerShuffleWithSSE4A() local13868 if (matchShuffleAsINSERTQ(VT, V1, V2, Mask, BitLen, BitIdx)) in lowerShuffleWithSSE4A()38278 uint64_t BitLen, BitIdx; in combineX86ShuffleChain() local44138 int BitIdx = (i % EltSizeInBits); in combineToExtendBoolVectorInReg() local[all …]