1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-23 03:02:36 +01:00
llvm-mirror/test/Transforms/LICM/loopsink-pr39695.ll
Jamie Schmeiser c6155047c0 Reland: Expand existing loopsink testing to also test loopsinking using new pass manager and fix LICM bug.
Summary:
Expand existing loopsink testing to also test loopsinking using new pass
manager.  Enable memoryssa for loopsink with new pass manager.  This
combination exposed a bug that was previously fixed for loopsink
without memoryssa.  When sinking an instruction into a loop, the source
block may not be part of the loop but still needs to be checked for
pointer invalidation.  This is the fix for bugzilla #39695 (PR 54659)
expanded to also work with memoryssa.

Respond to review comments.  Enable Memory SSA in legacy Loop Sink pass
under EnableMSSALoopDependency option control.  Update tests accordingly.

Respond to review comments.  Add options controlling whether memoryssa is
used for loop sink, defaulting to off.  Expand testing based on these
options.

Respond to review comments.  Properly indicated preserved analyses.

This relanding addresses a compile-time performance problem by moving
test for profile data earlier to avoid unnecessary computations.

Author: Jamie Schmeiser <schmeise@ca.ibm.com>
Reviewed By: asbirlea (Alina Sbirlea)
Differential Revision: https://reviews.llvm.org/D90249
2020-11-20 10:26:33 -05:00

41 lines
1.4 KiB
LLVM

; RUN: opt -S -loop-sink < %s | FileCheck %s
; RUN: opt -S -verify-memoryssa -enable-mssa-in-legacy-loop-sink -loop-sink < %s | FileCheck %s
; RUN: opt -S -aa-pipeline=basic-aa -passes=loop-sink < %s | FileCheck %s
; RUN: opt -S -verify-memoryssa -enable-mssa-in-loop-sink -aa-pipeline=basic-aa -passes=loop-sink < %s | FileCheck %s
; The load instruction should not be sunk into following loop.
; CHECK: @foo
; CHECK-NEXT: entry
; CHECK-NEXT: %ptr = load i8*, i8** %pp, align 8
; CHECK-NEXT: store i8* null, i8** %pp, align 8
define i32 @foo(i32 %n, i8** %pp) !prof !0 {
entry:
%ptr = load i8*, i8** %pp, align 8
store i8* null, i8** %pp, align 8
br label %for.cond
for.cond: ; preds = %for.body, %entry
%i.0 = phi i32 [ 0, %entry ], [ %inc, %for.body ]
%cmp = icmp ult i32 %i.0, %n
br i1 %cmp, label %for.body, label %for.end, !prof !1
for.body: ; preds = %for.cond
%0 = sext i32 %i.0 to i64
%arrayidx = getelementptr inbounds i8, i8* %ptr, i64 %0
%1 = load i8, i8* %arrayidx, align 1
%or19 = call i8 @llvm.bitreverse.i8(i8 %1)
%v = sext i8 %or19 to i32
%inc = add i32 %i.0, %v
br label %for.cond
for.end: ; preds = %for.cond
ret i32 %i.0
}
declare i8 @llvm.bitreverse.i8(i8) #0
attributes #0 = { nounwind readnone speculatable }
!0 = !{!"function_entry_count", i64 1}
!1 = !{!"branch_weights", i32 1, i32 2000}