mirror of
https://github.com/RPCS3/llvm.git
synced 2025-05-23 05:46:05 +00:00
32054b584b
Scalar Evolution asserts when not all the operands of an Add Recurrence Expression are loop invariants. Loop Strength Reduction should only create affine Add Recurrences, so that both the start and the step of the expression are loop invariants. Differential Revision: https://reviews.llvm.org/D26185 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@286347 91177308-0d34-0410-b5e6-96231b3b80d8
36 lines
849 B
LLVM
36 lines
849 B
LLVM
; RUN: llc -mtriple=armv8-eabi -verify-machineinstrs %s -o /dev/null
|
|
|
|
; This test ensures that Loop Strength Reduction will
|
|
; not create an Add Reccurence Expression if not all
|
|
; its operands are loop invariants.
|
|
|
|
define void @add_rec_expr() {
|
|
entry:
|
|
br label %loop0
|
|
|
|
loop0:
|
|
%c.0 = phi i32 [ 0, %entry ], [ %inc.0, %loop0 ]
|
|
%inc.0 = add nuw i32 %c.0, 1
|
|
br i1 undef, label %loop0, label %bb1
|
|
|
|
bb1:
|
|
%mul.0 = mul i32 %c.0, %c.0
|
|
%gelptr.0 = getelementptr inbounds i16, i16* undef, i32 %mul.0
|
|
br label %loop1
|
|
|
|
loop1:
|
|
%inc.1 = phi i32 [ %inc.2, %bb4 ], [ 0, %bb1 ]
|
|
%mul.1 = mul i32 %inc.1, %c.0
|
|
br label %bb3
|
|
|
|
bb3:
|
|
%add.0 = add i32 undef, %mul.1
|
|
%gelptr.1 = getelementptr inbounds i16, i16* %gelptr.0, i32 %add.0
|
|
store i16 undef, i16* %gelptr.1, align 2
|
|
br label %bb4
|
|
|
|
bb4:
|
|
%inc.2 = add nuw i32 %inc.1, 1
|
|
br label %loop1
|
|
}
|