1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
//===- bolt/Passes/CallGraphWalker.cpp ------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// This file implements the CallGraphWalker class.
//
//===----------------------------------------------------------------------===//
#include "bolt/Passes/CallGraphWalker.h"
#include "bolt/Passes/BinaryFunctionCallGraph.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/Timer.h"
#include <queue>
#include <set>
namespace opts {
extern llvm::cl::opt<bool> TimeOpts;
}
namespace llvm {
namespace bolt {
void CallGraphWalker::traverseCG() {
NamedRegionTimer T1("CG Traversal", "CG Traversal", "CG breakdown",
"CG breakdown", opts::TimeOpts);
std::queue<BinaryFunction *> Queue;
std::set<BinaryFunction *> InQueue;
for (BinaryFunction *Func : TopologicalCGOrder) {
Queue.push(Func);
InQueue.insert(Func);
}
while (!Queue.empty()) {
BinaryFunction *Func = Queue.front();
Queue.pop();
InQueue.erase(Func);
bool Changed = false;
for (CallbackTy Visitor : Visitors) {
bool CurVisit = Visitor(Func);
Changed = Changed || CurVisit;
}
if (Changed) {
for (CallGraph::NodeId CallerID : CG.predecessors(CG.getNodeId(Func))) {
BinaryFunction *CallerFunc = CG.nodeIdToFunc(CallerID);
if (InQueue.count(CallerFunc))
continue;
Queue.push(CallerFunc);
InQueue.insert(CallerFunc);
}
}
}
}
void CallGraphWalker::walk() {
TopologicalCGOrder = CG.buildTraversalOrder();
traverseCG();
}
} // namespace bolt
} // namespace llvm
|
