mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-28 22:29:56 +00:00
and generalize it so that it can be used by IndVarSimplify. Implement the base IndVarSimplify transformation code using IVUsers. This removes TestOrigIVForWrap and associated code, as ScalarEvolution now has enough builtin overflow detection and folding logic to handle all the same cases, and more. Run "opt -iv-users -analyze -disable-output" on your favorite loop for an example of what IVUsers does. This lets IndVarSimplify eliminate IV casts and compute trip counts in more cases. Also, this happens to finally fix the remaining testcases in PR1301. Now that IndVarSimplify is being more aggressive, it occasionally runs into the problem where ScalarEvolutionExpander's code for avoiding duplicate expansions makes it difficult to ensure that all expanded instructions dominate all the instructions that will use them. As a temporary measure, IndVarSimplify now uses a FixUsesBeforeDefs function to fix up instructions inserted by SCEVExpander. Fortunately, this code is contained, and can be easily removed once a more comprehensive solution is available. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@71535 91177308-0d34-0410-b5e6-96231b3b80d8
44 lines
1.8 KiB
LLVM
44 lines
1.8 KiB
LLVM
; RUN: llvm-as < %s | opt -loop-reduce | llvm-dis | grep {mul.*%lsr.iv} | count 2
|
|
; The multiply in bb2 must not be reduced to an add, as the sext causes the
|
|
; %1 argument to become negative after a while.
|
|
; ModuleID = '<stdin>'
|
|
target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:128:128"
|
|
target triple = "i386-apple-darwin9.6"
|
|
@table = common global [32 x [256 x i32]] zeroinitializer, align 32 ; <[32 x [256 x i32]]*> [#uses=2]
|
|
|
|
define i32 @main() nounwind {
|
|
bb4.thread:
|
|
br label %bb2
|
|
|
|
bb2: ; preds = %bb4, %bb2, %bb4.thread
|
|
%i.0.reg2mem.0.ph = phi i32 [ 0, %bb4.thread ], [ %i.0.reg2mem.0.ph, %bb2 ], [ %indvar.next9, %bb4 ] ; <i32> [#uses=4]
|
|
%j.0.reg2mem.0 = phi i32 [ 0, %bb4.thread ], [ %indvar.next, %bb2 ], [ 0, %bb4 ] ; <i32> [#uses=3]
|
|
%0 = trunc i32 %j.0.reg2mem.0 to i8 ; <i8> [#uses=1]
|
|
%1 = sext i8 %0 to i32 ; <i32> [#uses=1]
|
|
%2 = mul i32 %1, %i.0.reg2mem.0.ph ; <i32> [#uses=1]
|
|
%3 = getelementptr [32 x [256 x i32]]* @table, i32 0, i32 %i.0.reg2mem.0.ph, i32 %j.0.reg2mem.0 ; <i32*> [#uses=1]
|
|
store i32 %2, i32* %3, align 4
|
|
%indvar.next = add i32 %j.0.reg2mem.0, 1 ; <i32> [#uses=2]
|
|
%exitcond = icmp eq i32 %indvar.next, 256 ; <i1> [#uses=1]
|
|
br i1 %exitcond, label %bb4, label %bb2
|
|
|
|
bb4: ; preds = %bb2
|
|
%indvar.next9 = add i32 %i.0.reg2mem.0.ph, 1 ; <i32> [#uses=2]
|
|
%exitcond10 = icmp eq i32 %indvar.next9, 32 ; <i1> [#uses=1]
|
|
br i1 %exitcond10, label %bb5, label %bb2
|
|
|
|
bb5: ; preds = %bb4
|
|
%4 = load i32* getelementptr ([32 x [256 x i32]]* @table, i32 0, i32 9, i32 132), align 16 ; <i32> [#uses=1]
|
|
%5 = icmp eq i32 %4, -1116 ; <i1> [#uses=1]
|
|
br i1 %5, label %bb7, label %bb6
|
|
|
|
bb6: ; preds = %bb5
|
|
tail call void @abort() noreturn nounwind
|
|
unreachable
|
|
|
|
bb7: ; preds = %bb5
|
|
ret i32 0
|
|
}
|
|
|
|
declare void @abort() noreturn nounwind
|