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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
//===- CallGraphUpdater.cpp - A (lazy) call graph update helper -----------===//
//
// 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
//
//===----------------------------------------------------------------------===//
/// \file
///
/// This file provides interfaces used to manipulate a call graph, regardless
/// if it is a "old style" CallGraph or an "new style" LazyCallGraph.
///
//===----------------------------------------------------------------------===//
#include "llvm/Transforms/Utils/CallGraphUpdater.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/Transforms/Utils/ModuleUtils.h"
using namespace llvm;
bool CallGraphUpdater::finalize() {
if (!DeadFunctionsInComdats.empty()) {
filterDeadComdatFunctions(*DeadFunctionsInComdats.front()->getParent(),
DeadFunctionsInComdats);
DeadFunctions.append(DeadFunctionsInComdats.begin(),
DeadFunctionsInComdats.end());
}
for (Function *DeadFn : DeadFunctions) {
DeadFn->removeDeadConstantUsers();
if (CG) {
CallGraphNode *OldCGN = CG->getOrInsertFunction(DeadFn);
CG->getExternalCallingNode()->removeAnyCallEdgeTo(OldCGN);
OldCGN->removeAllCalledFunctions();
DeadFn->replaceAllUsesWith(UndefValue::get(DeadFn->getType()));
assert(OldCGN->getNumReferences() == 0);
delete CG->removeFunctionFromModule(OldCGN);
continue;
}
// The old style call graph (CG) has a value handle we do not want to
// replace with undef so we do this here.
DeadFn->replaceAllUsesWith(UndefValue::get(DeadFn->getType()));
if (LCG && !ReplacedFunctions.count(DeadFn)) {
// Taken mostly from the inliner:
LazyCallGraph::Node &N = LCG->get(*DeadFn);
auto *DeadSCC = LCG->lookupSCC(N);
assert(DeadSCC && DeadSCC->size() == 1 &&
&DeadSCC->begin()->getFunction() == DeadFn);
auto &DeadRC = DeadSCC->getOuterRefSCC();
FunctionAnalysisManager &FAM =
AM->getResult<FunctionAnalysisManagerCGSCCProxy>(*DeadSCC, *LCG)
.getManager();
FAM.clear(*DeadFn, DeadFn->getName());
AM->clear(*DeadSCC, DeadSCC->getName());
LCG->removeDeadFunction(*DeadFn);
// Mark the relevant parts of the call graph as invalid so we don't visit
// them.
UR->InvalidatedSCCs.insert(DeadSCC);
UR->InvalidatedRefSCCs.insert(&DeadRC);
}
// The function is now really dead and de-attached from everything.
DeadFn->eraseFromParent();
}
bool Changed = !DeadFunctions.empty();
DeadFunctionsInComdats.clear();
DeadFunctions.clear();
return Changed;
}
void CallGraphUpdater::reanalyzeFunction(Function &Fn) {
if (CG) {
CallGraphNode *OldCGN = CG->getOrInsertFunction(&Fn);
OldCGN->removeAllCalledFunctions();
CG->populateCallGraphNode(OldCGN);
} else if (LCG) {
LazyCallGraph::Node &N = LCG->get(Fn);
LazyCallGraph::SCC *C = LCG->lookupSCC(N);
updateCGAndAnalysisManagerForCGSCCPass(*LCG, *C, N, *AM, *UR);
}
}
void CallGraphUpdater::registerOutlinedFunction(Function &NewFn) {
if (CG)
CG->addToCallGraph(&NewFn);
else if (LCG)
LCG->addNewFunctionIntoSCC(NewFn, *SCC);
}
void CallGraphUpdater::removeFunction(Function &DeadFn) {
DeadFn.deleteBody();
DeadFn.setLinkage(GlobalValue::ExternalLinkage);
if (DeadFn.hasComdat())
DeadFunctionsInComdats.push_back(&DeadFn);
else
DeadFunctions.push_back(&DeadFn);
}
void CallGraphUpdater::replaceFunctionWith(Function &OldFn, Function &NewFn) {
OldFn.removeDeadConstantUsers();
ReplacedFunctions.insert(&OldFn);
if (CG) {
// Update the call graph for the newly promoted function.
// CG->spliceFunction(&OldFn, &NewFn);
CallGraphNode *OldCGN = (*CG)[&OldFn];
CallGraphNode *NewCGN = CG->getOrInsertFunction(&NewFn);
NewCGN->stealCalledFunctionsFrom(OldCGN);
// And update the SCC we're iterating as well.
CGSCC->ReplaceNode(OldCGN, NewCGN);
} else if (LCG) {
// Directly substitute the functions in the call graph.
LazyCallGraph::Node &OldLCGN = LCG->get(OldFn);
SCC->getOuterRefSCC().replaceNodeFunction(OldLCGN, NewFn);
}
removeFunction(OldFn);
}
bool CallGraphUpdater::replaceCallSite(CallBase &OldCS, CallBase &NewCS) {
// This is only necessary in the (old) CG.
if (!CG)
return true;
Function *Caller = OldCS.getCaller();
CallGraphNode *NewCalleeNode =
CG->getOrInsertFunction(NewCS.getCalledFunction());
CallGraphNode *CallerNode = (*CG)[Caller];
if (llvm::none_of(*CallerNode, [&OldCS](const CallGraphNode::CallRecord &CR) {
return CR.first == &OldCS;
}))
return false;
CallerNode->replaceCallEdge(OldCS, NewCS, NewCalleeNode);
return true;
}
void CallGraphUpdater::removeCallSite(CallBase &CS) {
// This is only necessary in the (old) CG.
if (!CG)
return;
Function *Caller = CS.getCaller();
CallGraphNode *CallerNode = (*CG)[Caller];
CallerNode->removeCallEdgeFor(CS);
}
|
