From: Philip Reames Date: Fri, 24 Aug 2018 16:24:48 +0000 (+0000) Subject: [LICM] Hoist an invariant_start out of loops if there are no stores executed before it X-Git-Tag: llvmorg-8.0.0-rc1~10221 X-Git-Url: http://review.tizen.org/git/?a=commitdiff_plain;h=9ec15faf20a405dffbc83162183822789a534423;p=platform%2Fupstream%2Fllvm.git [LICM] Hoist an invariant_start out of loops if there are no stores executed before it Once the invariant_start is reached, we know that no instruction *after* it can modify the memory. So, if we can prove the location isn't read *between entry into the loop and the execution of the invariant_start*, we can execute the invariant_start before entering the loop. Differential Revision: https://reviews.llvm.org/D51181 llvm-svn: 340617 --- diff --git a/llvm/lib/Transforms/Scalar/LICM.cpp b/llvm/lib/Transforms/Scalar/LICM.cpp index da750d0..a642d2e 100644 --- a/llvm/lib/Transforms/Scalar/LICM.cpp +++ b/llvm/lib/Transforms/Scalar/LICM.cpp @@ -525,7 +525,9 @@ bool llvm::hoistRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI, } using namespace PatternMatch; - if (match(&I, m_Intrinsic()) && + if (((I.use_empty() && + match(&I, m_Intrinsic())) || + match(&I, m_Intrinsic())) && IsMustExecute && IsMemoryNotModified && CurLoop->hasLoopInvariantOperands(&I)) { hoist(I, DT, CurLoop, SafetyInfo, ORE); diff --git a/llvm/test/Transforms/LICM/invariant.start.ll b/llvm/test/Transforms/LICM/invariant.start.ll index 9049e54..d5d4475 100644 --- a/llvm/test/Transforms/LICM/invariant.start.ll +++ b/llvm/test/Transforms/LICM/invariant.start.ll @@ -3,19 +3,18 @@ ; RUN: opt -aa-pipeline=basic-aa -licm-n2-threshold=0 -passes='require,require,require,require,loop(licm)' < %s -S | FileCheck %s ; RUN: opt -aa-pipeline=basic-aa -licm-n2-threshold=200 -passes='require,require,require,require,loop(licm)' < %s -S | FileCheck %s --check-prefix=ALIAS-N2 -; TODO: By default (without the -licm-n2-threshold value), we should be able to hoist both load and invariant.start define void @test1(i1 %cond, i32* %ptr) { ; CHECK-LABEL: @test1( ; CHECK-LABEL: entry: +; CHECK: call {}* @llvm.invariant.start.p0i32(i64 4, i32* %ptr) ; CHECK: %val = load i32, i32* %ptr ; CHECK-LABEL: loop: -; CHECK: call {}* @llvm.invariant.start.p0i32(i64 4, i32* %ptr) ; ALIAS-N2-LABEL: @test1( ; ALIAS-N2-LABEL: entry: -; ALIAS-N2: %val = load i32, i32* %ptr -; ALIAS-N2-LABEL: loop: ; ALIAS-N2: call {}* @llvm.invariant.start.p0i32(i64 4, i32* %ptr) +; ALIAS-N2: %val = load i32, i32* %ptr +; ALIAS-N2-LABEL: loop: entry: br label %loop @@ -57,15 +56,15 @@ loop: define void @test3(i1 %cond, i32* %ptr) { ; CHECK-LABEL: @test3( ; CHECK-LABEL: entry: +; CHECK: call {}* @llvm.invariant.start.p0i32(i64 4, i32* %ptr) ; CHECK: %val = load i32, i32* %ptr ; CHECK-LABEL: loop: -; CHECK: call {}* @llvm.invariant.start.p0i32(i64 4, i32* %ptr) ; ALIAS-N2-LABEL: @test3( ; ALIAS-N2-LABEL: entry: -; ALIAS-N2: %val = load i32, i32* %ptr +; ALIAS-N2: call {}* @llvm.invariant.start.p0i32(i64 4, i32* %ptr) +; ALIAS-N2: %val = load i32, i32* %ptr ; ALIAS-N2-LABEL: loop: -; ALIAS-N2: call {}* @llvm.invariant.start.p0i32(i64 4, i32* %ptr) entry: br label %loop