RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-11-26 13:10:34 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Make use of simpler DSNode methods.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20702 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2005-03-20 02:39:49 +00:00
parent a4c1b5f3e6
commit 9454dda28a
2 changed files with 8 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
lib/Analysis/DataStructure/Steensgaard.cpp
View File

@ -165,21 +165,17 @@ bool Steens::runOnModule(Module &M) {
DSCallSite &CurCall = *CI++; DSCallSite &CurCall = *CI++;
// Loop over the called functions, eliminating as many as possible... // Loop over the called functions, eliminating as many as possible...
std::vector<GlobalValue*> CallTargets; std::vector<Function*> CallTargets;
if (CurCall.isDirectCall()) if (CurCall.isDirectCall())
CallTargets.push_back(CurCall.getCalleeFunc()); CallTargets.push_back(CurCall.getCalleeFunc());
else else
CallTargets = CurCall.getCalleeNode()->getGlobals(); CurCall.getCalleeNode()->addFullFunctionList(CallTargets);
for (unsigned c = 0; c != CallTargets.size(); ) { for (unsigned c = 0; c != CallTargets.size(); ) {
// If we can eliminate this function call, do so! // If we can eliminate this function call, do so!
bool Eliminated = false; Function *F = CallTargets[c];
if (Function *F = dyn_cast<Function>(CallTargets[c])) if (!F->isExternal()) {
if (!F->isExternal()) { ResolveFunctionCall(F, CurCall, RetValMap[F]);
ResolveFunctionCall(F, CurCall, RetValMap[F]);
Eliminated = true;
}
if (Eliminated) {
CallTargets[c] = CallTargets.back(); CallTargets[c] = CallTargets.back();
CallTargets.pop_back(); CallTargets.pop_back();
} else } else

8
lib/Analysis/DataStructure/TopDownClosure.cpp
View File

@ -37,11 +37,9 @@ void TDDataStructures::markReachableFunctionsExternallyAccessible(DSNode *N,
for (unsigned i = 0, e = N->getNumLinks(); i != e; ++i) { for (unsigned i = 0, e = N->getNumLinks(); i != e; ++i) {
DSNodeHandle &NH = N->getLink(i*N->getPointerSize()); DSNodeHandle &NH = N->getLink(i*N->getPointerSize());
if (DSNode *NN = NH.getNode()) { if (DSNode *NN = NH.getNode()) {
const std::vector<GlobalValue*> &Globals = NN->getGlobals(); std::vector<Function*> Functions;
for (unsigned G = 0, e = Globals.size(); G != e; ++G) NN->addFullFunctionList(Functions);
if (Function *F = dyn_cast<Function>(Globals[G])) ArgsRemainIncomplete.insert(Functions.begin(), Functions.end());
ArgsRemainIncomplete.insert(F);
markReachableFunctionsExternallyAccessible(NN, Visited); markReachableFunctionsExternallyAccessible(NN, Visited);
} }
} }