Lines Matching defs:Result
44 static bool HasAddOverflow(ConstantInt *Result,
48 return Result->getValue().ult(In1->getValue());
51 return Result->getValue().sgt(In1->getValue());
52 return Result->getValue().slt(In1->getValue());
55 /// AddWithOverflow - Compute Result = In1+In2, returning true if the result
57 static bool AddWithOverflow(Constant *&Result, Constant *In1,
59 Result = ConstantExpr::getAdd(In1, In2);
64 if (HasAddOverflow(ExtractElement(Result, Idx),
73 return HasAddOverflow(cast<ConstantInt>(Result),
78 static bool HasSubOverflow(ConstantInt *Result,
82 return Result->getValue().ugt(In1->getValue());
85 return Result->getValue().slt(In1->getValue());
87 return Result->getValue().sgt(In1->getValue());
90 /// SubWithOverflow - Compute Result = In1-In2, returning true if the result
92 static bool SubWithOverflow(Constant *&Result, Constant *In1,
94 Result = ConstantExpr::getSub(In1, In2);
99 if (HasSubOverflow(ExtractElement(Result, Idx),
108 return HasSubOverflow(cast<ConstantInt>(Result),
115 /// TrueIfSigned if the result of the comparison is true when the input value is
294 // If the result is undef for this element, ignore it.
305 // If we can't compute the result for any of the elements, we have to give
577 // and would change the result of the icmp.
693 // the result to fold to a constant!
783 // (x /u C1) <u C2. Simply casting the operands and result won't
834 // to the same result value.
1185 // result is always true or false now.
1644 Value *Result = Builder->CreateICmpSGT(LHSCIOp, NegOne, ICI.getName());
1648 return ReplaceInstUsesWith(ICI, Result);
1651 return BinaryOperator::CreateNot(Result);
1716 // result and the overflow bit.
1732 Value *Add = Builder->CreateExtractValue(Call, 0, "sadd.result");
1735 // The inner add was the result of the narrow add, zero extended to the
1736 // wider type. Replace it with the result computed by the intrinsic.
2018 // If the LHS is 1 << x, and we know the result is a power of 2 like 8,
2027 // If the LHS is 8 >>u x, and we know the result is a power of 2 like 1,
2055 // If the LHS is 1 << x, and we know the result is a power of 2 like 8,
2064 // If the LHS is 8 >>u x, and we know the result is a power of 2 like 1,