mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-29 13:29:28 +00:00
3ef1aae2b5
This change teaches LazyValueInfo to use the @llvm.assume intrinsic. Like with
the known-bits change (r217342), this requires feeding a "context" instruction
pointer through many functions. Aside from a little refactoring to reuse the
logic that turns predicates into constant ranges in LVI, the only new code is
that which can 'merge' the range from an assumption into that otherwise
computed. There is also a small addition to JumpThreading so that it can have
LVI use assumptions in the same block as the comparison feeding a conditional
branch.
With this patch, we can now simplify this as expected:
int foo(int a) {
__builtin_assume(a > 5);
if (a > 3) {
bar();
return 1;
}
return 0;
}
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@217345 91177308-0d34-0410-b5e6-96231b3b80d8
69 lines
1.8 KiB
LLVM
69 lines
1.8 KiB
LLVM
; RUN: opt -S -jump-threading -dce < %s | FileCheck %s
|
|
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
|
|
target triple = "x86_64-unknown-linux-gnu"
|
|
|
|
; Function Attrs: nounwind uwtable
|
|
define i32 @test1(i32 %a, i32 %b) #0 {
|
|
entry:
|
|
%cmp = icmp sgt i32 %a, 5
|
|
tail call void @llvm.assume(i1 %cmp)
|
|
%cmp1 = icmp sgt i32 %b, 1234
|
|
br i1 %cmp1, label %if.then, label %if.else
|
|
|
|
; CHECK-LABEL: @test1
|
|
; CHECK: icmp sgt i32 %a, 5
|
|
; CHECK: call void @llvm.assume
|
|
; CHECK-NOT: icmp sgt i32 %a, 3
|
|
; CHECK: ret i32
|
|
|
|
if.then: ; preds = %entry
|
|
%cmp2 = icmp sgt i32 %a, 3
|
|
br i1 %cmp2, label %if.then3, label %return
|
|
|
|
if.then3: ; preds = %if.then
|
|
tail call void (...)* @bar() #1
|
|
br label %return
|
|
|
|
if.else: ; preds = %entry
|
|
tail call void (...)* @car() #1
|
|
br label %return
|
|
|
|
return: ; preds = %if.else, %if.then, %if.then3
|
|
%retval.0 = phi i32 [ 1, %if.then3 ], [ 0, %if.then ], [ 0, %if.else ]
|
|
ret i32 %retval.0
|
|
}
|
|
|
|
define i32 @test2(i32 %a) #0 {
|
|
entry:
|
|
%cmp = icmp sgt i32 %a, 5
|
|
tail call void @llvm.assume(i1 %cmp)
|
|
%cmp1 = icmp sgt i32 %a, 3
|
|
br i1 %cmp1, label %if.then, label %return
|
|
|
|
; CHECK-LABEL: @test2
|
|
; CHECK: icmp sgt i32 %a, 5
|
|
; CHECK: tail call void @llvm.assume
|
|
; CHECK: tail call void (...)* @bar()
|
|
; CHECK: ret i32 1
|
|
|
|
|
|
if.then: ; preds = %entry
|
|
tail call void (...)* @bar() #1
|
|
br label %return
|
|
|
|
return: ; preds = %entry, %if.then
|
|
%retval.0 = phi i32 [ 1, %if.then ], [ 0, %entry ]
|
|
ret i32 %retval.0
|
|
}
|
|
|
|
; Function Attrs: nounwind
|
|
declare void @llvm.assume(i1) #1
|
|
|
|
declare void @bar(...)
|
|
|
|
declare void @car(...)
|
|
|
|
attributes #0 = { nounwind uwtable }
|
|
attributes #1 = { nounwind }
|
|
|