RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-02-22 19:50:55 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Make Escape Analysis work for any pointer.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@57412 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Owen Anderson 2008-10-12 07:33:29 +00:00
parent 36b708a318
commit 4b089929b4
2 changed files with 13 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
include/llvm/Analysis/EscapeAnalysis.h
View File

@ -50,8 +50,9 @@ public:
//===--------------------------------------------------------------------- //===---------------------------------------------------------------------
// Client API // Client API
/// escapes - returns true if the AllocationInst can escape. /// escapes - returns true if the value, which must have a pointer type,
bool escapes(AllocationInst* A); /// can escape.
bool escapes(Value* A);
}; };
} // end llvm namespace } // end llvm namespace

16
lib/Analysis/EscapeAnalysis.cpp
View File

@ -98,18 +98,22 @@ bool EscapeAnalysis::runOnFunction(Function& F) {
/// escape point. /// escape point.
/// FIXME: Once we've discovered a path, it would be a good idea to memoize it, /// FIXME: Once we've discovered a path, it would be a good idea to memoize it,
/// and all of its subpaths, to amortize the cost of future queries. /// and all of its subpaths, to amortize the cost of future queries.
bool EscapeAnalysis::escapes(AllocationInst* A) { bool EscapeAnalysis::escapes(Value* A) {
std::vector<Instruction*> worklist; assert(isa<PointerType>(A->getType()) &&
"Can't do escape analysis on non-pointer types!");
std::vector<Value*> worklist;
worklist.push_back(A); worklist.push_back(A);
SmallPtrSet<Instruction*, 8> visited; SmallPtrSet<Value*, 8> visited;
visited.insert(A); visited.insert(A);
while (!worklist.empty()) { while (!worklist.empty()) {
Instruction* curr = worklist.back(); Value* curr = worklist.back();
worklist.pop_back(); worklist.pop_back();
if (EscapePoints.count(curr)) if (Instruction* I = dyn_cast<Instruction>(curr))
return true; if (EscapePoints.count(I))
return true;
if (StoreInst* S = dyn_cast<StoreInst>(curr)) { if (StoreInst* S = dyn_cast<StoreInst>(curr)) {
// We know this must be an instruction, because constant gep's would // We know this must be an instruction, because constant gep's would