RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2025-02-26 16:05:54 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Add a stat to show how often the limit to decompose GEPs in BasicAA is reached.

Browse Source 
Differential Revision: http://reviews.llvm.org/D9689



git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@244174 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Wei Mi 2015-08-05 23:40:30 +00:00
parent e04f789f46
commit 9a461c756e
1 changed files with 11 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
lib/Analysis/BasicAliasAnalysis.cpp
View File

@ -16,6 +16,7 @@
#include "llvm/Analysis/Passes.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/Analysis/AliasAnalysis.h"
#include "llvm/Analysis/AssumptionCache.h"
#include "llvm/Analysis/CFG.h"
@ -46,6 +47,14 @@ using namespace llvm;
static cl::opt<bool> EnableRecPhiAnalysis("basicaa-recphi",
cl::Hidden, cl::init(false));
/// SearchLimitReached / SearchTimes shows how often the limit of
/// to decompose GEPs is reached. It will affect the precision
/// of basic alias analysis.
#define DEBUG_TYPE "basicaa"
STATISTIC(SearchLimitReached, "Number of times the limit to "
"decompose GEPs is reached");
STATISTIC(SearchTimes, "Number of times a GEP is decomposed");
/// Cutoff after which to stop analysing a set of phi nodes potentially involved
/// in a cycle. Because we are analysing 'through' phi nodes we need to be
/// careful with value equivalence. We use reachability to make sure a value
@ -301,6 +310,7 @@ DecomposeGEPExpression(const Value *V, int64_t &BaseOffs,
// Limit recursion depth to limit compile time in crazy cases.
unsigned MaxLookup = MaxLookupSearchDepth;
MaxLookupReached = false;
SearchTimes++;
BaseOffs = 0;
do {
@ -420,6 +430,7 @@ DecomposeGEPExpression(const Value *V, int64_t &BaseOffs,
// If the chain of expressions is too deep, just return early.
MaxLookupReached = true;
SearchLimitReached++;
return V;
}