RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-04-03 22:01:56 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

[LCG] Ran clang-format over this too and it pointed out some fixes.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@203435 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chandler Carruth 2014-03-10 02:14:14 +00:00
parent 1b497a9fc4
commit b53becf6c8
1 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
lib/Analysis/LazyCallGraph.cpp
View File

@ -19,7 +19,7 @@ using namespace llvm;
static void findCallees( static void findCallees(
SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited, SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited,
SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *> > &Callees, SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *>> &Callees,
SmallPtrSetImpl<Function *> &CalleeSet) { SmallPtrSetImpl<Function *> &CalleeSet) {
while (!Worklist.empty()) { while (!Worklist.empty()) {
Constant *C = Worklist.pop_back_val(); Constant *C = Worklist.pop_back_val();
@ -36,7 +36,7 @@ static void findCallees(
// strong definition's address would be an effective way to determine the // strong definition's address would be an effective way to determine the
// safety of optimizing a direct call edge. // safety of optimizing a direct call edge.
if (!F->isDeclaration() && CalleeSet.insert(F)) if (!F->isDeclaration() && CalleeSet.insert(F))
Callees.push_back(F); Callees.push_back(F);
continue; continue;
} }
@ -165,10 +165,12 @@ static void printNodes(raw_ostream &OS, LazyCallGraph::Node &N,
OS << "\n"; OS << "\n";
} }
PreservedAnalyses LazyCallGraphPrinterPass::run(Module *M, ModuleAnalysisManager *AM) { PreservedAnalyses LazyCallGraphPrinterPass::run(Module *M,
ModuleAnalysisManager *AM) {
LazyCallGraph &G = AM->getResult<LazyCallGraphAnalysis>(M); LazyCallGraph &G = AM->getResult<LazyCallGraphAnalysis>(M);
OS << "Printing the call graph for module: " << M->getModuleIdentifier() << "\n\n"; OS << "Printing the call graph for module: " << M->getModuleIdentifier()
<< "\n\n";
SmallPtrSet<LazyCallGraph::Node *, 16> Printed; SmallPtrSet<LazyCallGraph::Node *, 16> Printed;
for (LazyCallGraph::Node *N : G) for (LazyCallGraph::Node *N : G)