caio/clang-p2996
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
cdeaf5f28c3dca7fa313bdc5657cd07fb08dec5b
clang-p2996/llvm/test/Transforms/SCCP/binaryops-constexprs.ll
Florian Hahn cdeaf5f28c Recommit "[SCCP] Use range info to prove AddInst has NUW flag." 
This reverts commit 531756b954.

The recommitted version fixes a crash when one of the operands is a
constant other than a ConstantInt. Test for that case have been added
in 5b16cd97b8.

It splits off the new logic into a separate function because setting the
flags is quite different compared to the other cases handled in replaceSignedInst
which all require replacing an existing instruction.

It also guards makeGuaranteedNoWrapRegion by `if (!Inst.hasNoUnsignedWrap())`
as discussed in the review.

Fixes #60280.
Fixes #60278.

Original message:
    This patch updates SCCP to use the value ranges of AddInst operands to
    try to prove the AddInst does not overflow in the unsigned sense and
    adds the NUW flag. The reasoning is done with
    makeGuaranteedNoWrapRegion (thanks @nikic for point it out!).

    Follow-ups will include adding NSW and extension to more
    OverflowingBinaryOperators.

    Reviewed By: nikic

    Differential Revision: https://reviews.llvm.org/D142387
2023-01-26 11:45:10 +00:00

127 lines
4.8 KiB
LLVM
Raw Blame History

; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -passes=sccp -S | FileCheck %s
declare void @use.i32(i32)
declare void @use.i1(i1)
define void @and_constexpr(i32 %a) {
; CHECK-LABEL: @and_constexpr(
; CHECK-NEXT: entry:
; CHECK-NEXT: call void @use.i32(i32 0)
; CHECK-NEXT: [[AND_2:%.*]] = and i32 20, [[A:%.*]]
; CHECK-NEXT: call void @use.i32(i32 [[AND_2]])
; CHECK-NEXT: call void @use.i1(i1 true)
; CHECK-NEXT: call void @use.i1(i1 false)
; CHECK-NEXT: [[COND_1:%.*]] = icmp eq i32 [[AND_2]], 10
; CHECK-NEXT: call void @use.i1(i1 [[COND_1]])
; CHECK-NEXT: call void @use.i32(i32 4)
; CHECK-NEXT: ret void
;
entry:
%and.1 = and i32 ptrtoint (ptr inttoptr (i32 0 to ptr) to i32), %a
call void @use.i32(i32 %and.1)
%and.2 = and i32 ptrtoint (ptr inttoptr (i32 20 to ptr) to i32), %a
call void @use.i32(i32 %and.2)
%true.1 = icmp ne i32 %and.2, 100
call void @use.i1(i1 %true.1)
%false.1 = icmp eq i32 %and.2, 100
call void @use.i1(i1 %false.1)
%cond.1 = icmp eq i32 %and.2, 10
call void @use.i1(i1 %cond.1)
%and.3 = and i32 ptrtoint (ptr inttoptr (i32 20 to ptr) to i32), ptrtoint (ptr inttoptr (i32 100 to ptr) to i32)
call void @use.i32(i32 %and.3)
ret void
}
define void @add_constexpr(i32 %a) {
; CHECK-LABEL: @add_constexpr(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[ADD_1:%.*]] = add nuw i32 0, [[A:%.*]]
; CHECK-NEXT: call void @use.i32(i32 [[ADD_1]])
; CHECK-NEXT: [[ADD_2:%.*]] = add i32 20, [[A]]
; CHECK-NEXT: call void @use.i32(i32 [[ADD_2]])
; CHECK-NEXT: [[COND_1:%.*]] = icmp ne i32 [[ADD_2]], 100
; CHECK-NEXT: call void @use.i1(i1 [[COND_1]])
; CHECK-NEXT: [[COND_2:%.*]] = icmp eq i32 [[ADD_2]], 100
; CHECK-NEXT: call void @use.i1(i1 [[COND_2]])
; CHECK-NEXT: [[COND_3:%.*]] = icmp eq i32 [[ADD_2]], 10
; CHECK-NEXT: call void @use.i1(i1 [[COND_3]])
; CHECK-NEXT: call void @use.i32(i32 120)
; CHECK-NEXT: ret void
;
entry:
%add.1 = add i32 ptrtoint (ptr inttoptr (i32 0 to ptr) to i32), %a
call void @use.i32(i32 %add.1)
%add.2 = add i32 ptrtoint (ptr inttoptr (i32 20 to ptr) to i32), %a
call void @use.i32(i32 %add.2)
%cond.1 = icmp ne i32 %add.2, 100
call void @use.i1(i1 %cond.1)
%cond.2 = icmp eq i32 %add.2, 100
call void @use.i1(i1 %cond.2)
%cond.3 = icmp eq i32 %add.2, 10
call void @use.i1(i1 %cond.3)
%add.3 = add i32 ptrtoint (ptr inttoptr (i32 20 to ptr) to i32), ptrtoint (ptr inttoptr (i32 100 to ptr) to i32)
call void @use.i32(i32 %add.3)
ret void
}
define void @mul_constexpr(i32 %a) {
; CHECK-LABEL: @mul_constexpr(
; CHECK-NEXT: entry:
; CHECK-NEXT: call void @use.i32(i32 0)
; CHECK-NEXT: [[MUL_2:%.*]] = mul i32 20, [[A:%.*]]
; CHECK-NEXT: call void @use.i32(i32 [[MUL_2]])
; CHECK-NEXT: [[COND_1:%.*]] = icmp ne i32 [[MUL_2]], 100
; CHECK-NEXT: call void @use.i1(i1 [[COND_1]])
; CHECK-NEXT: [[COND_2:%.*]] = icmp eq i32 [[MUL_2]], 100
; CHECK-NEXT: call void @use.i1(i1 [[COND_2]])
; CHECK-NEXT: [[COND_3:%.*]] = icmp eq i32 [[MUL_2]], 10
; CHECK-NEXT: call void @use.i1(i1 [[COND_3]])
; CHECK-NEXT: call void @use.i32(i32 2000)
; CHECK-NEXT: ret void
;
entry:
%mul.1 = mul i32 ptrtoint (ptr inttoptr (i32 0 to ptr) to i32), %a
call void @use.i32(i32 %mul.1)
%mul.2 = mul i32 ptrtoint (ptr inttoptr (i32 20 to ptr) to i32), %a
call void @use.i32(i32 %mul.2)
%cond.1 = icmp ne i32 %mul.2, 100
call void @use.i1(i1 %cond.1)
%cond.2 = icmp eq i32 %mul.2, 100
call void @use.i1(i1 %cond.2)
%cond.3 = icmp eq i32 %mul.2, 10
call void @use.i1(i1 %cond.3)
%mul.3 = mul i32 ptrtoint (ptr inttoptr (i32 20 to ptr) to i32), ptrtoint (ptr inttoptr (i32 100 to ptr) to i32)
call void @use.i32(i32 %mul.3)
ret void
}
define void @udiv_constexpr(i32 %a) {
; CHECK-LABEL: @udiv_constexpr(
; CHECK-NEXT: entry:
; CHECK-NEXT: call void @use.i32(i32 0)
; CHECK-NEXT: [[UDIV_2:%.*]] = udiv i32 20, [[A:%.*]]
; CHECK-NEXT: call void @use.i32(i32 [[UDIV_2]])
; CHECK-NEXT: call void @use.i1(i1 true)
; CHECK-NEXT: call void @use.i1(i1 false)
; CHECK-NEXT: [[COND_1:%.*]] = icmp eq i32 [[UDIV_2]], 10
; CHECK-NEXT: call void @use.i1(i1 [[COND_1]])
; CHECK-NEXT: call void @use.i32(i32 0)
; CHECK-NEXT: ret void
;
entry:
%udiv.1 = udiv i32 ptrtoint (ptr inttoptr (i32 0 to ptr) to i32), %a
call void @use.i32(i32 %udiv.1)
%udiv.2 = udiv i32 ptrtoint (ptr inttoptr (i32 20 to ptr) to i32), %a
call void @use.i32(i32 %udiv.2)
%true.1 = icmp ne i32 %udiv.2, 100
call void @use.i1(i1 %true.1)
%false.1 = icmp eq i32 %udiv.2, 50
call void @use.i1(i1 %false.1)
%cond.1 = icmp eq i32 %udiv.2, 10
call void @use.i1(i1 %cond.1)
%udiv.3 = udiv i32 ptrtoint (ptr inttoptr (i32 20 to ptr) to i32), ptrtoint (ptr inttoptr (i32 100 to ptr) to i32)
call void @use.i32(i32 %udiv.3)
ret void
}
Reference in New Issue View Git Blame Copy Permalink