mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-11-03 14:21:30 +00:00
4f3052403c
The right way to check for a binary operation is cast<BinaryOperator>. The original check: cast<Instruction> && numOperands() == 2 would match phi "instructions", leading to an infinite loop in extreme corner case: a useless phi with operands [self, constant] that prior optimization passes failed to remove, being used in the loop by another useless phi, in turn being used by an lshr or udiv. Fixes PR11350: runaway iteration assertion. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@144935 91177308-0d34-0410-b5e6-96231b3b80d8
30 lines
920 B
LLVM
30 lines
920 B
LLVM
; RUN: opt < %s -indvars -S | FileCheck %s
|
|
; PR11350: Check that SimplifyIndvar handles a cycle of useless self-phis.
|
|
|
|
; CHECK: @test
|
|
; CHECK-NOT: lcssa = phi
|
|
define void @test() nounwind {
|
|
entry:
|
|
br label %for.cond.preheader
|
|
|
|
for.cond.preheader: ; preds = %entry
|
|
br label %for.cond.outer
|
|
|
|
for.cond.outer: ; preds = %for.cond.preheader, %for.end
|
|
%p_41.addr.0.ph = phi i32 [ %p_41.addr.1.lcssa, %for.end ], [ 1, %for.cond.preheader ]
|
|
br label %for.cond
|
|
|
|
for.cond:
|
|
br i1 true, label %for.end, label %for.ph
|
|
|
|
for.ph: ; preds = %for.cond4.preheader
|
|
br label %for.end
|
|
|
|
for.end:
|
|
%p_41.addr.1.lcssa = phi i32 [ undef, %for.ph ], [ %p_41.addr.0.ph, %for.cond ]
|
|
%p_68.lobit.i = lshr i32 %p_41.addr.1.lcssa, 31
|
|
%cmp7 = icmp eq i32 %p_41.addr.1.lcssa, 0
|
|
%conv8 = zext i1 %cmp7 to i32
|
|
br label %for.cond.outer
|
|
}
|