HomeSort by: relevance | last modified time | path
    Searched refs:NUW (Results 1 - 8 of 8) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
CorrelatedValuePropagation.cpp 526 bool NUW = !WO->isSigned();
530 setDeducedOverflowingFlags(NewOp, Opcode, NSW, NUW);
551 bool NUW = !SI->isSigned();
555 setDeducedOverflowingFlags(BinOp, Opcode, NSW, NUW);
937 bool NUW = BinOp->hasNoUnsignedWrap();
938 if (NSW && NUW)
950 if (!NUW) {
Reassociate.cpp 337 // TODO: Reduce the weight by exploiting nsw/nuw?
352 // TODO: Reduce the weight by exploiting nsw/nuw? (Could do much better than
1086 // We can safely preserve the nuw flag in all cases. It's also safe to turn a
1087 // nuw nsw shl into a nuw nsw mul. However, nsw in isolation requires special
1091 bool NUW = cast<BinaryOperator>(Shl)->hasNoUnsignedWrap();
1093 if (NSW && (NUW || SA->getValue().ult(BitWidth - 1)))
1095 Mul->setHasNoUnsignedWrap(NUW);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
BasicAliasAnalysis.cpp 274 bool canDistributeOver(bool NUW, bool NSW) const {
275 // zext(x op<nuw> y) == zext(x) op<nuw> zext(y)
277 return (!ZExtBits || NUW) && (!SExtBits || NSW);
316 // case where it is both nuw and nsw.
317 bool NUW = true, NSW = true;
319 NUW &= BOp->hasNoUnsignedWrap();
322 if (!Val.canDistributeOver(NUW, NSW))
InstructionSimplify.cpp 643 // add nsw/nuw (xor Y, signmask), signmask --> Y
650 // add nuw %x, -1 -> -1, because %x can only be 0.
751 // 0 - X -> 0 if the sub is NUW.
1334 // undef << X -> undef if (if it's NSW/NUW)
1344 // shl nuw i8 C, %x -> C iff C has sign bit set.
2782 // (mul nuw/nsw X, MulC) != C --> true (if C is not a multiple of MulC)
2783 // (mul nuw/nsw X, MulC) == C --> false (if C is not a multiple of MulC)
3052 // - The shift is nuw. We can't shift out the one bit.
3105 bool NUW = Q.IIQ.hasNoUnsignedWrap(LBO) && Q.IIQ.hasNoUnsignedWrap(RBO);
3107 if (!NUW && !NSW
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
InstrTypes.h 358 DEFINE_HELPERS(Add, NUW) // CreateNUWAdd
360 DEFINE_HELPERS(Sub, NUW) // CreateNUWSub
362 DEFINE_HELPERS(Mul, NUW) // CreateNUWMul
364 DEFINE_HELPERS(Shl, NUW) // CreateNUWShl
  /src/external/apache2/llvm/dist/llvm/lib/AsmParser/
LLParser.cpp 3751 bool NUW = false;
3760 NUW = true;
3764 NUW = true;
3805 if (NUW) Flags |= OverflowingBinaryOperator::NoUnsignedWrap;
6201 bool NUW = EatIfPresent(lltok::kw_nuw);
6203 if (!NUW) NUW = EatIfPresent(lltok::kw_nuw);
6208 if (NUW) cast<BinaryOperator>(Inst)->setHasNoUnsignedWrap(true);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombineCompares.cpp 1974 // (mul nuw X, MulC) == C --> X == C /u MulC
2098 // NUW guarantees that we are only shifting out zero bits from the high bits,
2103 // icmp Pred (shl nuw X, ShiftAmt), C --> icmp Pred X, (C >>u ShiftAmt)
2556 // (icmp P (sub nuw|nsw C2, Y), C) -> (icmp swap(P) Y, C2-C)
3894 // canonicalization from (X -nuw 1) to (X + -1) means that the combinations
4113 bool NUW = BO0->hasNoUnsignedWrap() && BO1->hasNoUnsignedWrap();
4115 if (!NUW && !NSW)
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86ISelLowering.cpp     [all...]

Completed in 86 milliseconds