6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-15 04:30:12 +00:00
Code Issues Projects Releases Wiki Activity

Put a threshold on the number of users PointerMayBeCaptured

Browse Source 
examines; fall back to a conservative answer if there are
more. This works around some several compile time problems
resulting from BasicAliasAnalysis calling PointerMayBeCaptured.

The value has been chosen arbitrarily.

This fixes rdar://7438917 and may partially address PR5708.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@90905 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman 2009-12-08 23:59:12 +00:00
parent 43678f41a3
commit 8456d60bec
1 changed files with 16 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
lib/Analysis/CaptureTracking.cpp
View File

@ -25,6 +25,16 @@
#include "llvm/Support/CallSite.h" #include "llvm/Support/CallSite.h"
using namespace llvm; using namespace llvm;
/// As its comment mentions, PointerMayBeCaptured can be expensive.
/// However, it's not easy for BasicAA to cache the result, because
/// it's an ImmutablePass. To work around this, bound queries at a
/// fixed number of uses.
///
/// TODO: Write a new FunctionPass AliasAnalysis so that it can keep
/// a cache. Then we can move the code from BasicAliasAnalysis into
/// that path, and remove this threshold.
static int const Threshold = 20;
/// PointerMayBeCaptured - Return true if this pointer value may be captured /// PointerMayBeCaptured - Return true if this pointer value may be captured
/// by the enclosing function (which is required to exist). This routine can /// by the enclosing function (which is required to exist). This routine can
/// be expensive, so consider caching the results. The boolean ReturnCaptures /// be expensive, so consider caching the results. The boolean ReturnCaptures
@ -37,12 +47,18 @@ bool llvm::PointerMayBeCaptured(const Value *V,
assert(isa<PointerType>(V->getType()) && "Capture is for pointers only!"); assert(isa<PointerType>(V->getType()) && "Capture is for pointers only!");
SmallVector<Use*, 16> Worklist; SmallVector<Use*, 16> Worklist;
SmallSet<Use*, 16> Visited; SmallSet<Use*, 16> Visited;
int Count = 0;
for (Value::use_const_iterator UI = V->use_begin(), UE = V->use_end(); for (Value::use_const_iterator UI = V->use_begin(), UE = V->use_end();
UI != UE; ++UI) { UI != UE; ++UI) {
Use *U = &UI.getUse(); Use *U = &UI.getUse();
Visited.insert(U); Visited.insert(U);
Worklist.push_back(U); Worklist.push_back(U);
// If there are lots of uses, conservativelty say that the value
// is captured to avoid taking too much compile time.
if (Count++ >= Threshold)
return true;
} }
while (!Worklist.empty()) { while (!Worklist.empty()) {