static Value *simplifyICmpWithConstant(CmpInst::Predicate Pred, Value *LHS,
Value *RHS) {
- // FIXME: Use m_APInt here and below to allow splat vector folds.
- ConstantInt *CI = dyn_cast<ConstantInt>(RHS);
- if (!CI)
+ const APInt *C;
+ if (!match(RHS, m_APInt(C)))
return nullptr;
// Rule out tautological comparisons (eg., ult 0 or uge 0).
- ConstantRange RHS_CR = ICmpInst::makeConstantRange(Pred, CI->getValue());
+ ConstantRange RHS_CR = ICmpInst::makeConstantRange(Pred, *C);
if (RHS_CR.isEmptySet())
- return ConstantInt::getFalse(CI->getContext());
+ return ConstantInt::getFalse(GetCompareTy(RHS));
if (RHS_CR.isFullSet())
- return ConstantInt::getTrue(CI->getContext());
+ return ConstantInt::getTrue(GetCompareTy(RHS));
+
+ // FIXME: Use m_APInt below here to allow splat vector folds.
+ ConstantInt *CI = dyn_cast<ConstantInt>(RHS);
+ if (!CI)
+ return nullptr;
// Many binary operators with constant RHS have easy to compute constant
// range. Use them to check whether the comparison is a tautology.
define <2 x i1> @tautological_ule_vec(<2 x i8> %x) {
; CHECK-LABEL: @tautological_ule_vec(
-; CHECK-NEXT: [[CMP:%.*]] = icmp ule <2 x i8> %x, <i8 -1, i8 -1>
-; CHECK-NEXT: ret <2 x i1> [[CMP]]
+; CHECK-NEXT: ret <2 x i1> <i1 true, i1 true>
;
%cmp = icmp ule <2 x i8> %x, <i8 255, i8 255>
ret <2 x i1> %cmp
define <2 x i1> @tautological_ugt_vec(<2 x i8> %x) {
; CHECK-LABEL: @tautological_ugt_vec(
-; CHECK-NEXT: [[CMP:%.*]] = icmp ugt <2 x i8> %x, <i8 -1, i8 -1>
-; CHECK-NEXT: ret <2 x i1> [[CMP]]
+; CHECK-NEXT: ret <2 x i1> zeroinitializer
;
%cmp = icmp ugt <2 x i8> %x, <i8 255, i8 255>
ret <2 x i1> %cmp