[llvm] r292529 - Revert "[InlineCost] Use TTI to check if GEP is free."
Haicheng Wu via llvm-commits
llvm-commits at lists.llvm.org
Thu Jan 19 14:51:04 PST 2017
Author: haicheng
Date: Thu Jan 19 16:51:03 2017
New Revision: 292529
URL: http://llvm.org/viewvc/llvm-project?rev=292529&view=rev
Log:
Revert "[InlineCost] Use TTI to check if GEP is free."
This reverts commit r292526. The test case has problem.
Removed:
llvm/trunk/test/Transforms/Inline/gep-cost.ll
Modified:
llvm/trunk/lib/Analysis/InlineCost.cpp
Modified: llvm/trunk/lib/Analysis/InlineCost.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Analysis/InlineCost.cpp?rev=292529&r1=292528&r2=292529&view=diff
==============================================================================
--- llvm/trunk/lib/Analysis/InlineCost.cpp (original)
+++ llvm/trunk/lib/Analysis/InlineCost.cpp Thu Jan 19 16:51:03 2017
@@ -134,7 +134,6 @@ class CallAnalyzer : public InstVisitor<
void accumulateSROACost(DenseMap<Value *, int>::iterator CostIt,
int InstructionCost);
bool isGEPOffsetConstant(GetElementPtrInst &GEP);
- bool isGEPFree(GetElementPtrInst &GEP);
bool accumulateGEPOffset(GEPOperator &GEP, APInt &Offset);
bool simplifyCallSite(Function *F, CallSite CS);
ConstantInt *stripAndComputeInBoundsConstantOffsets(Value *&V);
@@ -332,21 +331,6 @@ bool CallAnalyzer::accumulateGEPOffset(G
return true;
}
-/// \brief Use TTI to check whether a GEP is free.
-///
-/// Respects any simplified values known during the analysis of this callsite.
-bool CallAnalyzer::isGEPFree(GetElementPtrInst &GEP) {
- SmallVector<Value *, 4> Indices;
- for (User::op_iterator I = GEP.idx_begin(), E = GEP.idx_end(); I != E; ++I)
- if (Constant *SimpleOp = SimplifiedValues.lookup(*I))
- Indices.push_back(SimpleOp);
- else
- Indices.push_back(*I);
- return TargetTransformInfo::TCC_Free ==
- TTI.getGEPCost(GEP.getSourceElementType(), GEP.getPointerOperand(),
- Indices);
-}
-
bool CallAnalyzer::visitAlloca(AllocaInst &I) {
// Check whether inlining will turn a dynamic alloca into a static
// alloca and handle that case.
@@ -412,7 +396,7 @@ bool CallAnalyzer::visitGetElementPtr(Ge
// Non-constant GEPs aren't folded, and disable SROA.
if (SROACandidate)
disableSROA(CostIt);
- return isGEPFree(I);
+ return false;
}
// Add the result as a new mapping to Base + Offset.
@@ -438,7 +422,7 @@ bool CallAnalyzer::visitGetElementPtr(Ge
// Variable GEPs will require math and will disable SROA.
if (SROACandidate)
disableSROA(CostIt);
- return isGEPFree(I);
+ return false;
}
bool CallAnalyzer::visitBitCast(BitCastInst &I) {
Removed: llvm/trunk/test/Transforms/Inline/gep-cost.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/Inline/gep-cost.ll?rev=292528&view=auto
==============================================================================
--- llvm/trunk/test/Transforms/Inline/gep-cost.ll (original)
+++ llvm/trunk/test/Transforms/Inline/gep-cost.ll (removed)
@@ -1,29 +0,0 @@
-; RUN: opt -inline < %s -S -debug-only=inline-cost 2>&1 | FileCheck %s
-
-target datalayout = "e-m:e-i64:64-i128:128-n32:64-S128"
-target triple = "aarch64--linux-gnu"
-
-define void @outer([4 x i32]* %ptr, i32 %i) {
- call void @inner1([4 x i32]* %ptr, i32 %i)
- call void @inner2([4 x i32]* %ptr, i32 %i)
- ret void
-}
-; The gep in inner1() is reg+reg, which is a legal addressing mode for AArch64.
-; Thus, both the gep and ret can be simplified.
-; CHECK: Analyzing call of inner1
-; CHECK: NumInstructionsSimplified: 2
-; CHECK: NumInstructions: 2
-define void @inner1([4 x i32]* %ptr, i32 %i) {
- %G = getelementptr inbounds [4 x i32], [4 x i32]* %ptr, i32 0, i32 %i
- ret void
-}
-
-; The gep in inner2() is reg+imm+reg, which is not a legal addressing mode for
-; AArch64. Thus, only the ret can be simplified and not the gep.
-; CHECK: Analyzing call of inner2
-; CHECK: NumInstructionsSimplified: 1
-; CHECK: NumInstructions: 2
-define void @inner2([4 x i32]* %ptr, i32 %i) {
- %G = getelementptr inbounds [4 x i32], [4 x i32]* %ptr, i32 1, i32 %i
- ret void
-}
More information about the llvm-commits
mailing list