RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-01 08:23:21 +01:00
Code Issues Projects Releases Wiki Activity
55c2150f36
llvm-mirror/test/Transforms/CodeGenPrepare/basic.ll

30 lines
869 B
LLVM
Raw Normal View History

Now that instruction optzns can update the iterator as they go, we can have objectsize folding recursively simplify away their result when it folds. It is important to catch this here, because otherwise we won't eliminate the cross-block values at isel and other times. llvm-svn: 123524
2011-01-15 08:25:29 +01:00
; RUN: opt -codegenprepare %s -S -o - | FileCheck %s
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64"
target triple = "x86_64-apple-darwin10.0.0"
; CHECK: @test1
fix rdar://8785296 - -fcatch-undefined-behavior generates inefficient code The basic issue is that isel (very reasonably!) expects conditional branches to be folded, so CGP leaving around a bunch dead computation feeding conditional branches isn't such a good idea. Just fold branches on constants into unconditional branches. llvm-svn: 123526
2011-01-15 08:36:13 +01:00
; objectsize should fold to a constant, which causes the branch to fold to an
; uncond branch.
; rdar://8785296
Now that instruction optzns can update the iterator as they go, we can have objectsize folding recursively simplify away their result when it folds. It is important to catch this here, because otherwise we won't eliminate the cross-block values at isel and other times. llvm-svn: 123524
2011-01-15 08:25:29 +01:00
define i32 @test1(i8* %ptr) nounwind ssp noredzone align 2 {
entry:
%0 = tail call i64 @llvm.objectsize.i64(i8* %ptr, i1 false)
%1 = icmp ugt i64 %0, 3
br i1 %1, label %T, label %trap
temporarily revert r123526. While working on a follow-on patch I realize that ConstantFoldTerminator doesn't preserve dominfo. llvm-svn: 123527
2011-01-15 08:51:19 +01:00
; CHECK: entry:
; HECK-NEXT: ret i32 4
Now that instruction optzns can update the iterator as they go, we can have objectsize folding recursively simplify away their result when it folds. It is important to catch this here, because otherwise we won't eliminate the cross-block values at isel and other times. llvm-svn: 123524
2011-01-15 08:25:29 +01:00
trap: ; preds = %0, %entry
tail call void @llvm.trap() noreturn nounwind
unreachable
T:
ret i32 4
}
declare i64 @llvm.objectsize.i64(i8*, i1) nounwind readonly
declare void @llvm.trap() nounwind
Reference in New Issue Copy Permalink