/external/llvm/lib/Analysis/ |
ValueTracking.cpp | 47 APInt &KnownZero, APInt &KnownOne, 56 unsigned BitWidth = KnownZero.getBitWidth(); 68 KnownZero = APInt::getHighBitsSet(BitWidth, NLZ2); 74 unsigned BitWidth = KnownZero.getBitWidth(); 95 KnownZero |= KnownZero2 & Mask; 100 KnownZero |= APInt::getLowBitsSet(BitWidth, 106 KnownZero |= LHSKnownZero & Mask; 111 if (!KnownZero.isNegative() && !KnownOne.isNegative()) { 116 KnownZero |= APInt::getSignBit(BitWidth); 123 KnownZero |= APInt::getSignBit(BitWidth) [all...] |
Lint.cpp | 512 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0); 513 ComputeMaskedBits(V, KnownZero, KnownOne, TD); 514 return KnownZero.isAllOnesValue();
|
ConstantFolding.cpp | 567 APInt KnownZero = KnownZero0 | KnownZero1; 569 if ((KnownZero | KnownOne).isAllOnesValue()) { [all...] |
/external/llvm/include/llvm/CodeGen/ |
FunctionLoweringInfo.h | 103 APInt KnownOne, KnownZero; 105 KnownZero(1, 0) {} 168 const APInt &KnownZero, const APInt &KnownOne) { 170 if (NumSignBits == 1 && KnownZero == 0 && KnownOne == 0) 177 LOI.KnownZero = KnownZero;
|
/external/llvm/lib/Transforms/InstCombine/ |
InstCombineSimplifyDemanded.cpp | 55 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0); 59 KnownZero, KnownOne, 0); 70 APInt &KnownZero, APInt &KnownOne, 73 KnownZero, KnownOne, Depth); 87 /// to be one in the expression. KnownZero contains all the bits that are known 90 /// the expression. KnownOne and KnownZero always follow the invariant that 91 /// KnownOne & KnownZero == 0. That is, a bit can't be both 1 and 0. Note that 92 /// the bits in KnownOne and KnownZero may only be accurate for those bits set 93 /// in DemandedMask. Note also that the bitwidth of V, DemandedMask, KnownZero 102 APInt &KnownZero, APInt &KnownOne [all...] |
InstCombine.h | 300 void ComputeMaskedBits(Value *V, APInt &KnownZero, 302 return llvm::ComputeMaskedBits(V, KnownZero, KnownOne, TD, Depth); 329 APInt& KnownZero, APInt& KnownOne, 332 APInt& KnownZero, APInt& KnownOne, 337 APInt DemandedMask, APInt &KnownZero,
|
InstCombineCalls.cpp | 321 APInt KnownZero(BitWidth, 0); 323 ComputeMaskedBits(II->getArgOperand(0), KnownZero, KnownOne); 326 if ((Mask & KnownZero) == Mask) 339 APInt KnownZero(BitWidth, 0); 341 ComputeMaskedBits(II->getArgOperand(0), KnownZero, KnownOne); 344 if ((Mask & KnownZero) == Mask) [all...] |
InstCombineCasts.cpp | 552 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0); 553 ComputeMaskedBits(ICI->getOperand(0), KnownZero, KnownOne); 555 APInt KnownZeroMask(~KnownZero); [all...] |
InstCombineCompares.cpp | 152 static void ComputeSignedMinMaxValuesFromKnownBits(const APInt& KnownZero, 155 assert(KnownZero.getBitWidth() == KnownOne.getBitWidth() && 156 KnownZero.getBitWidth() == Min.getBitWidth() && 157 KnownZero.getBitWidth() == Max.getBitWidth() && 158 "KnownZero, KnownOne and Min, Max must have equal bitwidth."); 159 APInt UnknownBits = ~(KnownZero|KnownOne); 176 static void ComputeUnsignedMinMaxValuesFromKnownBits(const APInt &KnownZero, 179 assert(KnownZero.getBitWidth() == KnownOne.getBitWidth() && 180 KnownZero.getBitWidth() == Min.getBitWidth() && 181 KnownZero.getBitWidth() == Max.getBitWidth() & [all...] |
/external/llvm/include/llvm/Analysis/ |
ValueTracking.h | 30 /// known to be either zero or one and return them in the KnownZero/KnownOne 39 void ComputeMaskedBits(Value *V, APInt &KnownZero, APInt &KnownOne, 41 void computeMaskedBitsLoad(const MDNode &Ranges, APInt &KnownZero); 45 void ComputeSignBit(Value *V, bool &KnownZero, bool &KnownOne,
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
TargetLowering.cpp | 346 /// analyze the expression and return a mask of KnownOne and KnownZero bits for 347 /// the expression (used to simplify the caller). The KnownZero/One bits may 351 APInt &KnownZero, 362 KnownZero = KnownOne = APInt(BitWidth, 0); 367 // If not at the root, Just compute the KnownZero/KnownOne bits to 369 TLO.DAG.ComputeMaskedBits(Op, KnownZero, KnownOne, Depth); 389 KnownZero = ~KnownOne; 409 if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero, 412 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 413 if (SimplifyDemandedBits(Op.getOperand(0), ~KnownZero & NewMask [all...] |
SelectionDAG.cpp | [all...] |
FunctionLoweringInfo.cpp | 253 if (BitWidth > LOI->KnownZero.getBitWidth()) { 255 LOI->KnownZero = LOI->KnownZero.zextOrTrunc(BitWidth); 290 DestLOI.KnownZero = Zero; 298 DestLOI.KnownZero = ~Val; 316 assert(DestLOI.KnownZero.getBitWidth() == BitWidth && 325 DestLOI.KnownZero = Zero; 333 DestLOI.KnownZero &= ~Val; 351 DestLOI.KnownZero &= SrcLOI->KnownZero; [all...] |
SelectionDAGISel.cpp | 530 APInt KnownZero; 560 CurDAG->ComputeMaskedBits(Src, KnownZero, KnownOne); 561 FuncInfo->AddLiveOutRegInfo(DestReg, NumSignBits, KnownZero, KnownOne); [all...] |
/external/llvm/lib/Target/Sparc/ |
SparcISelLowering.h | 51 /// KnownZero/KnownOne bitsets. 53 APInt &KnownZero,
|
SparcISelLowering.cpp | [all...] |
/external/llvm/lib/Target/R600/ |
AMDGPUISelLowering.h | 73 /// either zero or one and return them in the \p KnownZero and \p KnownOne 76 APInt &KnownZero,
|
AMDILISelLowering.cpp | 259 APInt &KnownZero, 265 KnownZero = KnownOne = APInt(KnownOne.getBitWidth(), 0); // Don't know anything 271 KnownZero, 280 assert((KnownZero & KnownOne) == 0 286 KnownZero &= KnownZero2;
|
/external/llvm/lib/Target/XCore/ |
XCoreISelLowering.cpp | [all...] |
XCoreISelLowering.h | 167 APInt &KnownZero,
|
/external/llvm/lib/Transforms/Utils/ |
Local.cpp | 811 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0); 812 ComputeMaskedBits(V, KnownZero, KnownOne, TD); 813 unsigned TrailZ = KnownZero.countTrailingOnes(); [all...] |
/external/llvm/lib/Target/ARM/ |
ARMISelLowering.h | 335 APInt &KnownZero,
|
/external/llvm/lib/Target/PowerPC/ |
PPCISelLowering.h | 383 APInt &KnownZero,
|
/external/llvm/lib/Target/X86/ |
X86ISelLowering.h | 563 /// KnownZero/KnownOne bitsets. 565 APInt &KnownZero, [all...] |
/external/llvm/include/llvm/Target/ |
TargetLowering.h | [all...] |