RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-31 16:02:52 +01:00
Code Issues Projects Releases Wiki Activity
2891b0c61c
llvm-mirror/test/Transforms/GVN/2007-07-26-InterlockingLoops.ll

39 lines
965 B
LLVM
Raw Normal View History

Teach InstructionSimplify about phi nodes. I chose to have it simply offload the work to hasConstantValue rather than do something more complicated (such handling mutually recursive phis) because (1) it is not clear it is worth it; and (2) if it is worth it, maybe such logic would be better placed in hasConstantValue. Adjust some GVN tests which are now cleaned up much further (eg: all phi nodes are removed). llvm-svn: 119043
2010-11-14 14:30:18 +01:00
; RUN: opt < %s -basicaa -gvn -S | FileCheck %s
Fix a couple more bugs in the phi construction by pulling in code that does almost the same things from LCSSA. llvm-svn: 40540
2007-07-26 20:26:51 +02:00
Teach InstructionSimplify about phi nodes. I chose to have it simply offload the work to hasConstantValue rather than do something more complicated (such handling mutually recursive phis) because (1) it is not clear it is worth it; and (2) if it is worth it, maybe such logic would be better placed in hasConstantValue. Adjust some GVN tests which are now cleaned up much further (eg: all phi nodes are removed). llvm-svn: 119043
2010-11-14 14:30:18 +01:00
@last = external global [65 x i32*]
Fix a couple more bugs in the phi construction by pulling in code that does almost the same things from LCSSA. llvm-svn: 40540
2007-07-26 20:26:51 +02:00
define i32 @NextRootMove(i32 %wtm) {
Teach InstructionSimplify about phi nodes. I chose to have it simply offload the work to hasConstantValue rather than do something more complicated (such handling mutually recursive phis) because (1) it is not clear it is worth it; and (2) if it is worth it, maybe such logic would be better placed in hasConstantValue. Adjust some GVN tests which are now cleaned up much further (eg: all phi nodes are removed). llvm-svn: 119043
2010-11-14 14:30:18 +01:00
entry:
remove a trivial test, make some other tests less trivial. llvm-svn: 131846
2011-05-22 09:02:43 +02:00
%A = alloca i32*
Teach InstructionSimplify about phi nodes. I chose to have it simply offload the work to hasConstantValue rather than do something more complicated (such handling mutually recursive phis) because (1) it is not clear it is worth it; and (2) if it is worth it, maybe such logic would be better placed in hasConstantValue. Adjust some GVN tests which are now cleaned up much further (eg: all phi nodes are removed). llvm-svn: 119043
2010-11-14 14:30:18 +01:00
%tmp17618 = load i32** getelementptr ([65 x i32*]* @last, i32 0, i32 1), align 4
remove a trivial test, make some other tests less trivial. llvm-svn: 131846
2011-05-22 09:02:43 +02:00
store i32* %tmp17618, i32** %A
Teach InstructionSimplify about phi nodes. I chose to have it simply offload the work to hasConstantValue rather than do something more complicated (such handling mutually recursive phis) because (1) it is not clear it is worth it; and (2) if it is worth it, maybe such logic would be better placed in hasConstantValue. Adjust some GVN tests which are now cleaned up much further (eg: all phi nodes are removed). llvm-svn: 119043
2010-11-14 14:30:18 +01:00
; CHECK: entry:
remove a trivial test, make some other tests less trivial. llvm-svn: 131846
2011-05-22 09:02:43 +02:00
; CHECK-NEXT: alloca i32
Teach InstructionSimplify about phi nodes. I chose to have it simply offload the work to hasConstantValue rather than do something more complicated (such handling mutually recursive phis) because (1) it is not clear it is worth it; and (2) if it is worth it, maybe such logic would be better placed in hasConstantValue. Adjust some GVN tests which are now cleaned up much further (eg: all phi nodes are removed). llvm-svn: 119043
2010-11-14 14:30:18 +01:00
; CHECK-NEXT: %tmp17618 = load
; CHECK-NOT: load
; CHECK-NOT: phi
Fix a couple more bugs in the phi construction by pulling in code that does almost the same things from LCSSA. llvm-svn: 40540
2007-07-26 20:26:51 +02:00
br label %cond_true116
Teach InstructionSimplify about phi nodes. I chose to have it simply offload the work to hasConstantValue rather than do something more complicated (such handling mutually recursive phis) because (1) it is not clear it is worth it; and (2) if it is worth it, maybe such logic would be better placed in hasConstantValue. Adjust some GVN tests which are now cleaned up much further (eg: all phi nodes are removed). llvm-svn: 119043
2010-11-14 14:30:18 +01:00
cond_true116:
Fix a couple more bugs in the phi construction by pulling in code that does almost the same things from LCSSA. llvm-svn: 40540
2007-07-26 20:26:51 +02:00
br i1 false, label %cond_true128, label %cond_true145
Teach InstructionSimplify about phi nodes. I chose to have it simply offload the work to hasConstantValue rather than do something more complicated (such handling mutually recursive phis) because (1) it is not clear it is worth it; and (2) if it is worth it, maybe such logic would be better placed in hasConstantValue. Adjust some GVN tests which are now cleaned up much further (eg: all phi nodes are removed). llvm-svn: 119043
2010-11-14 14:30:18 +01:00
cond_true128:
%tmp17625 = load i32** getelementptr ([65 x i32*]* @last, i32 0, i32 1), align 4
remove a trivial test, make some other tests less trivial. llvm-svn: 131846
2011-05-22 09:02:43 +02:00
store i32* %tmp17625, i32** %A
Fix a couple more bugs in the phi construction by pulling in code that does almost the same things from LCSSA. llvm-svn: 40540
2007-07-26 20:26:51 +02:00
br i1 false, label %bb98.backedge, label %return.loopexit
Teach InstructionSimplify about phi nodes. I chose to have it simply offload the work to hasConstantValue rather than do something more complicated (such handling mutually recursive phis) because (1) it is not clear it is worth it; and (2) if it is worth it, maybe such logic would be better placed in hasConstantValue. Adjust some GVN tests which are now cleaned up much further (eg: all phi nodes are removed). llvm-svn: 119043
2010-11-14 14:30:18 +01:00
bb98.backedge:
Fix a couple more bugs in the phi construction by pulling in code that does almost the same things from LCSSA. llvm-svn: 40540
2007-07-26 20:26:51 +02:00
br label %cond_true116
Teach InstructionSimplify about phi nodes. I chose to have it simply offload the work to hasConstantValue rather than do something more complicated (such handling mutually recursive phis) because (1) it is not clear it is worth it; and (2) if it is worth it, maybe such logic would be better placed in hasConstantValue. Adjust some GVN tests which are now cleaned up much further (eg: all phi nodes are removed). llvm-svn: 119043
2010-11-14 14:30:18 +01:00
cond_true145:
%tmp17631 = load i32** getelementptr ([65 x i32*]* @last, i32 0, i32 1), align 4
remove a trivial test, make some other tests less trivial. llvm-svn: 131846
2011-05-22 09:02:43 +02:00
store i32* %tmp17631, i32** %A
Fix a couple more bugs in the phi construction by pulling in code that does almost the same things from LCSSA. llvm-svn: 40540
2007-07-26 20:26:51 +02:00
br i1 false, label %bb98.backedge, label %return.loopexit
Teach InstructionSimplify about phi nodes. I chose to have it simply offload the work to hasConstantValue rather than do something more complicated (such handling mutually recursive phis) because (1) it is not clear it is worth it; and (2) if it is worth it, maybe such logic would be better placed in hasConstantValue. Adjust some GVN tests which are now cleaned up much further (eg: all phi nodes are removed). llvm-svn: 119043
2010-11-14 14:30:18 +01:00
return.loopexit:
Fix a couple more bugs in the phi construction by pulling in code that does almost the same things from LCSSA. llvm-svn: 40540
2007-07-26 20:26:51 +02:00
br label %return
Teach InstructionSimplify about phi nodes. I chose to have it simply offload the work to hasConstantValue rather than do something more complicated (such handling mutually recursive phis) because (1) it is not clear it is worth it; and (2) if it is worth it, maybe such logic would be better placed in hasConstantValue. Adjust some GVN tests which are now cleaned up much further (eg: all phi nodes are removed). llvm-svn: 119043
2010-11-14 14:30:18 +01:00
return:
Fix a couple more bugs in the phi construction by pulling in code that does almost the same things from LCSSA. llvm-svn: 40540
2007-07-26 20:26:51 +02:00
ret i32 0
}
Reference in New Issue Copy Permalink