Coverage Report

Created: 2019-01-21 03:01

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/include/llvm/Analysis/CallGraph.h
Line
Count
Source (jump to first uncovered line)
1
//===- CallGraph.h - Build a Module's call graph ----------------*- C++ -*-===//
2
//
3
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4
// See https://llvm.org/LICENSE.txt for license information.
5
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6
//
7
//===----------------------------------------------------------------------===//
8
/// \file
9
///
10
/// This file provides interfaces used to build and manipulate a call graph,
11
/// which is a very useful tool for interprocedural optimization.
12
///
13
/// Every function in a module is represented as a node in the call graph.  The
14
/// callgraph node keeps track of which functions are called by the function
15
/// corresponding to the node.
16
///
17
/// A call graph may contain nodes where the function that they correspond to
18
/// is null.  These 'external' nodes are used to represent control flow that is
19
/// not represented (or analyzable) in the module.  In particular, this
20
/// analysis builds one external node such that:
21
///   1. All functions in the module without internal linkage will have edges
22
///      from this external node, indicating that they could be called by
23
///      functions outside of the module.
24
///   2. All functions whose address is used for something more than a direct
25
///      call, for example being stored into a memory location will also have
26
///      an edge from this external node.  Since they may be called by an
27
///      unknown caller later, they must be tracked as such.
28
///
29
/// There is a second external node added for calls that leave this module.
30
/// Functions have a call edge to the external node iff:
31
///   1. The function is external, reflecting the fact that they could call
32
///      anything without internal linkage or that has its address taken.
33
///   2. The function contains an indirect function call.
34
///
35
/// As an extension in the future, there may be multiple nodes with a null
36
/// function.  These will be used when we can prove (through pointer analysis)
37
/// that an indirect call site can call only a specific set of functions.
38
///
39
/// Because of these properties, the CallGraph captures a conservative superset
40
/// of all of the caller-callee relationships, which is useful for
41
/// transformations.
42
///
43
//===----------------------------------------------------------------------===//
44
45
#ifndef LLVM_ANALYSIS_CALLGRAPH_H
46
#define LLVM_ANALYSIS_CALLGRAPH_H
47
48
#include "llvm/ADT/GraphTraits.h"
49
#include "llvm/ADT/STLExtras.h"
50
#include "llvm/IR/CallSite.h"
51
#include "llvm/IR/Function.h"
52
#include "llvm/IR/Intrinsics.h"
53
#include "llvm/IR/PassManager.h"
54
#include "llvm/IR/ValueHandle.h"
55
#include "llvm/Pass.h"
56
#include <cassert>
57
#include <map>
58
#include <memory>
59
#include <utility>
60
#include <vector>
61
62
namespace llvm {
63
64
class CallGraphNode;
65
class Module;
66
class raw_ostream;
67
68
/// The basic data container for the call graph of a \c Module of IR.
69
///
70
/// This class exposes both the interface to the call graph for a module of IR.
71
///
72
/// The core call graph itself can also be updated to reflect changes to the IR.
73
class CallGraph {
74
  Module &M;
75
76
  using FunctionMapTy =
77
      std::map<const Function *, std::unique_ptr<CallGraphNode>>;
78
79
  /// A map from \c Function* to \c CallGraphNode*.
80
  FunctionMapTy FunctionMap;
81
82
  /// This node has edges to all external functions and those internal
83
  /// functions that have their address taken.
84
  CallGraphNode *ExternalCallingNode;
85
86
  /// This node has edges to it from all functions making indirect calls
87
  /// or calling an external function.
88
  std::unique_ptr<CallGraphNode> CallsExternalNode;
89
90
  /// Replace the function represented by this node by another.
91
  ///
92
  /// This does not rescan the body of the function, so it is suitable when
93
  /// splicing the body of one function to another while also updating all
94
  /// callers from the old function to the new.
95
  void spliceFunction(const Function *From, const Function *To);
96
97
  /// Add a function to the call graph, and link the node to all of the
98
  /// functions that it calls.
99
  void addToCallGraph(Function *F);
100
101
public:
102
  explicit CallGraph(Module &M);
103
  CallGraph(CallGraph &&Arg);
104
  ~CallGraph();
105
106
  void print(raw_ostream &OS) const;
107
  void dump() const;
108
109
  using iterator = FunctionMapTy::iterator;
110
  using const_iterator = FunctionMapTy::const_iterator;
111
112
  /// Returns the module the call graph corresponds to.
113
6.00M
  Module &getModule() const { return M; }
114
115
24.1k
  inline iterator begin() { return FunctionMap.begin(); }
116
24.1k
  inline iterator end() { return FunctionMap.end(); }
117
7
  inline const_iterator begin() const { return FunctionMap.begin(); }
118
7
  inline const_iterator end() const { return FunctionMap.end(); }
119
120
  /// Returns the call graph node for the provided function.
121
0
  inline const CallGraphNode *operator[](const Function *F) const {
122
0
    const_iterator I = FunctionMap.find(F);
123
0
    assert(I != FunctionMap.end() && "Function not in callgraph!");
124
0
    return I->second.get();
125
0
  }
126
127
  /// Returns the call graph node for the provided function.
128
1.24M
  inline CallGraphNode *operator[](const Function *F) {
129
1.24M
    const_iterator I = FunctionMap.find(F);
130
1.24M
    assert(I != FunctionMap.end() && "Function not in callgraph!");
131
1.24M
    return I->second.get();
132
1.24M
  }
133
134
  /// Returns the \c CallGraphNode which is used to represent
135
  /// undetermined calls into the callgraph.
136
243k
  CallGraphNode *getExternalCallingNode() const { return ExternalCallingNode; }
137
138
5.30k
  CallGraphNode *getCallsExternalNode() const {
139
5.30k
    return CallsExternalNode.get();
140
5.30k
  }
141
142
  //===---------------------------------------------------------------------
143
  // Functions to keep a call graph up to date with a function that has been
144
  // modified.
145
  //
146
147
  /// Unlink the function from this module, returning it.
148
  ///
149
  /// Because this removes the function from the module, the call graph node is
150
  /// destroyed.  This is only valid if the function does not call any other
151
  /// functions (ie, there are no edges in it's CGN).  The easiest way to do
152
  /// this is to dropAllReferences before calling this.
153
  Function *removeFunctionFromModule(CallGraphNode *CGN);
154
155
  /// Similar to operator[], but this will insert a new CallGraphNode for
156
  /// \c F if one does not already exist.
157
  CallGraphNode *getOrInsertFunction(const Function *F);
158
};
159
160
/// A node in the call graph for a module.
161
///
162
/// Typically represents a function in the call graph. There are also special
163
/// "null" nodes used to represent theoretical entries in the call graph.
164
class CallGraphNode {
165
public:
166
  /// A pair of the calling instruction (a call or invoke)
167
  /// and the call graph node being called.
168
  using CallRecord = std::pair<WeakTrackingVH, CallGraphNode *>;
169
170
public:
171
  using CalledFunctionsVector = std::vector<CallRecord>;
172
173
  /// Creates a node for the specified function.
174
1.78M
  inline CallGraphNode(Function *F) : F(F) {}
175
176
  CallGraphNode(const CallGraphNode &) = delete;
177
  CallGraphNode &operator=(const CallGraphNode &) = delete;
178
179
1.78M
  ~CallGraphNode() {
180
1.78M
    assert(NumReferences == 0 && "Node deleted while references remain");
181
1.78M
  }
182
183
  using iterator = std::vector<CallRecord>::iterator;
184
  using const_iterator = std::vector<CallRecord>::const_iterator;
185
186
  /// Returns the function that this call graph node represents.
187
12.5M
  Function *getFunction() const { return F; }
188
189
4.41M
  inline iterator begin() { return CalledFunctions.begin(); }
190
18.3M
  inline iterator end() { return CalledFunctions.end(); }
191
58
  inline const_iterator begin() const { return CalledFunctions.begin(); }
192
80
  inline const_iterator end() const { return CalledFunctions.end(); }
193
  inline bool empty() const { return CalledFunctions.empty(); }
194
  inline unsigned size() const { return (unsigned)CalledFunctions.size(); }
195
196
  /// Returns the number of other CallGraphNodes in this CallGraph that
197
  /// reference this node in their callee list.
198
41.8k
  unsigned getNumReferences() const { return NumReferences; }
199
200
  /// Returns the i'th called function.
201
  CallGraphNode *operator[](unsigned i) const {
202
    assert(i < CalledFunctions.size() && "Invalid index");
203
    return CalledFunctions[i].second;
204
  }
205
206
  /// Print out this call graph node.
207
  void dump() const;
208
  void print(raw_ostream &OS) const;
209
210
  //===---------------------------------------------------------------------
211
  // Methods to keep a call graph up to date with a function that has been
212
  // modified
213
  //
214
215
  /// Removes all edges from this CallGraphNode to any functions it
216
  /// calls.
217
191k
  void removeAllCalledFunctions() {
218
327k
    while (!CalledFunctions.empty()) {
219
136k
      CalledFunctions.back().second->DropRef();
220
136k
      CalledFunctions.pop_back();
221
136k
    }
222
191k
  }
223
224
  /// Moves all the callee information from N to this node.
225
1.79k
  void stealCalledFunctionsFrom(CallGraphNode *N) {
226
1.79k
    assert(CalledFunctions.empty() &&
227
1.79k
           "Cannot steal callsite information if I already have some");
228
1.79k
    std::swap(CalledFunctions, N->CalledFunctions);
229
1.79k
  }
230
231
  /// Adds a function to the list of functions called by this one.
232
7.29M
  void addCalledFunction(CallSite CS, CallGraphNode *M) {
233
7.29M
    assert(!CS.getInstruction() || !CS.getCalledFunction() ||
234
7.29M
           !CS.getCalledFunction()->isIntrinsic() ||
235
7.29M
           !Intrinsic::isLeaf(CS.getCalledFunction()->getIntrinsicID()));
236
7.29M
    CalledFunctions.emplace_back(CS.getInstruction(), M);
237
7.29M
    M->AddRef();
238
7.29M
  }
239
240
38.2k
  void removeCallEdge(iterator I) {
241
38.2k
    I->second->DropRef();
242
38.2k
    *I = CalledFunctions.back();
243
38.2k
    CalledFunctions.pop_back();
244
38.2k
  }
245
246
  /// Removes the edge in the node for the specified call site.
247
  ///
248
  /// Note that this method takes linear time, so it should be used sparingly.
249
  void removeCallEdgeFor(CallSite CS);
250
251
  /// Removes all call edges from this node to the specified callee
252
  /// function.
253
  ///
254
  /// This takes more time to execute than removeCallEdgeTo, so it should not
255
  /// be used unless necessary.
256
  void removeAnyCallEdgeTo(CallGraphNode *Callee);
257
258
  /// Removes one edge associated with a null callsite from this node to
259
  /// the specified callee function.
260
  void removeOneAbstractEdgeTo(CallGraphNode *Callee);
261
262
  /// Replaces the edge in the node for the specified call site with a
263
  /// new one.
264
  ///
265
  /// Note that this method takes linear time, so it should be used sparingly.
266
  void replaceCallEdge(CallSite CS, CallSite NewCS, CallGraphNode *NewNode);
267
268
private:
269
  friend class CallGraph;
270
271
  Function *F;
272
273
  std::vector<CallRecord> CalledFunctions;
274
275
  /// The number of times that this CallGraphNode occurs in the
276
  /// CalledFunctions array of this or other CallGraphNodes.
277
  unsigned NumReferences = 0;
278
279
855k
  void DropRef() { --NumReferences; }
280
7.30M
  void AddRef() { ++NumReferences; }
281
282
  /// A special function that should only be used by the CallGraph class.
283
53.1k
  void allReferencesDropped() { NumReferences = 0; }
284
};
285
286
/// An analysis pass to compute the \c CallGraph for a \c Module.
287
///
288
/// This class implements the concept of an analysis pass used by the \c
289
/// ModuleAnalysisManager to run an analysis over a module and cache the
290
/// resulting data.
291
class CallGraphAnalysis : public AnalysisInfoMixin<CallGraphAnalysis> {
292
  friend AnalysisInfoMixin<CallGraphAnalysis>;
293
294
  static AnalysisKey Key;
295
296
public:
297
  /// A formulaic type to inform clients of the result type.
298
  using Result = CallGraph;
299
300
  /// Compute the \c CallGraph for the module \c M.
301
  ///
302
  /// The real work here is done in the \c CallGraph constructor.
303
137
  CallGraph run(Module &M, ModuleAnalysisManager &) { return CallGraph(M); }
304
};
305
306
/// Printer pass for the \c CallGraphAnalysis results.
307
class CallGraphPrinterPass : public PassInfoMixin<CallGraphPrinterPass> {
308
  raw_ostream &OS;
309
310
public:
311
1
  explicit CallGraphPrinterPass(raw_ostream &OS) : OS(OS) {}
312
313
  PreservedAnalyses run(Module &M, ModuleAnalysisManager &AM);
314
};
315
316
/// The \c ModulePass which wraps up a \c CallGraph and the logic to
317
/// build it.
318
///
319
/// This class exposes both the interface to the call graph container and the
320
/// module pass which runs over a module of IR and produces the call graph. The
321
/// call graph interface is entirelly a wrapper around a \c CallGraph object
322
/// which is stored internally for each module.
323
class CallGraphWrapperPass : public ModulePass {
324
  std::unique_ptr<CallGraph> G;
325
326
public:
327
  static char ID; // Class identification, replacement for typeinfo
328
329
  CallGraphWrapperPass();
330
  ~CallGraphWrapperPass() override;
331
332
  /// The internal \c CallGraph around which the rest of this interface
333
  /// is wrapped.
334
0
  const CallGraph &getCallGraph() const { return *G; }
335
2.12M
  CallGraph &getCallGraph() { return *G; }
336
337
  using iterator = CallGraph::iterator;
338
  using const_iterator = CallGraph::const_iterator;
339
340
  /// Returns the module the call graph corresponds to.
341
0
  Module &getModule() const { return G->getModule(); }
342
343
0
  inline iterator begin() { return G->begin(); }
344
0
  inline iterator end() { return G->end(); }
345
0
  inline const_iterator begin() const { return G->begin(); }
346
0
  inline const_iterator end() const { return G->end(); }
347
348
  /// Returns the call graph node for the provided function.
349
0
  inline const CallGraphNode *operator[](const Function *F) const {
350
0
    return (*G)[F];
351
0
  }
352
353
  /// Returns the call graph node for the provided function.
354
0
  inline CallGraphNode *operator[](const Function *F) { return (*G)[F]; }
355
356
  /// Returns the \c CallGraphNode which is used to represent
357
  /// undetermined calls into the callgraph.
358
0
  CallGraphNode *getExternalCallingNode() const {
359
0
    return G->getExternalCallingNode();
360
0
  }
361
362
0
  CallGraphNode *getCallsExternalNode() const {
363
0
    return G->getCallsExternalNode();
364
0
  }
365
366
  //===---------------------------------------------------------------------
367
  // Functions to keep a call graph up to date with a function that has been
368
  // modified.
369
  //
370
371
  /// Unlink the function from this module, returning it.
372
  ///
373
  /// Because this removes the function from the module, the call graph node is
374
  /// destroyed.  This is only valid if the function does not call any other
375
  /// functions (ie, there are no edges in it's CGN).  The easiest way to do
376
  /// this is to dropAllReferences before calling this.
377
0
  Function *removeFunctionFromModule(CallGraphNode *CGN) {
378
0
    return G->removeFunctionFromModule(CGN);
379
0
  }
380
381
  /// Similar to operator[], but this will insert a new CallGraphNode for
382
  /// \c F if one does not already exist.
383
0
  CallGraphNode *getOrInsertFunction(const Function *F) {
384
0
    return G->getOrInsertFunction(F);
385
0
  }
386
387
  //===---------------------------------------------------------------------
388
  // Implementation of the ModulePass interface needed here.
389
  //
390
391
  void getAnalysisUsage(AnalysisUsage &AU) const override;
392
  bool runOnModule(Module &M) override;
393
  void releaseMemory() override;
394
395
  void print(raw_ostream &o, const Module *) const override;
396
  void dump() const;
397
};
398
399
//===----------------------------------------------------------------------===//
400
// GraphTraits specializations for call graphs so that they can be treated as
401
// graphs by the generic graph algorithms.
402
//
403
404
// Provide graph traits for tranversing call graphs using standard graph
405
// traversals.
406
template <> struct GraphTraits<CallGraphNode *> {
407
  using NodeRef = CallGraphNode *;
408
  using CGNPairTy = CallGraphNode::CallRecord;
409
410
  static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
411
13.9M
  static CallGraphNode *CGNGetValue(CGNPairTy P) { return P.second; }
412
413
  using ChildIteratorType =
414
      mapped_iterator<CallGraphNode::iterator, decltype(&CGNGetValue)>;
415
416
3.46M
  static ChildIteratorType child_begin(NodeRef N) {
417
3.46M
    return ChildIteratorType(N->begin(), &CGNGetValue);
418
3.46M
  }
419
420
17.3M
  static ChildIteratorType child_end(NodeRef N) {
421
17.3M
    return ChildIteratorType(N->end(), &CGNGetValue);
422
17.3M
  }
423
};
424
425
template <> struct GraphTraits<const CallGraphNode *> {
426
  using NodeRef = const CallGraphNode *;
427
  using CGNPairTy = CallGraphNode::CallRecord;
428
  using EdgeRef = const CallGraphNode::CallRecord &;
429
430
  static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
431
22
  static const CallGraphNode *CGNGetValue(CGNPairTy P) { return P.second; }
432
433
  using ChildIteratorType =
434
      mapped_iterator<CallGraphNode::const_iterator, decltype(&CGNGetValue)>;
435
  using ChildEdgeIteratorType = CallGraphNode::const_iterator;
436
437
20
  static ChildIteratorType child_begin(NodeRef N) {
438
20
    return ChildIteratorType(N->begin(), &CGNGetValue);
439
20
  }
440
441
42
  static ChildIteratorType child_end(NodeRef N) {
442
42
    return ChildIteratorType(N->end(), &CGNGetValue);
443
42
  }
444
445
19
  static ChildEdgeIteratorType child_edge_begin(NodeRef N) {
446
19
    return N->begin();
447
19
  }
448
19
  static ChildEdgeIteratorType child_edge_end(NodeRef N) { return N->end(); }
449
450
29
  static NodeRef edge_dest(EdgeRef E) { return E.second; }
451
};
452
453
template <>
454
struct GraphTraits<CallGraph *> : public GraphTraits<CallGraphNode *> {
455
  using PairTy =
456
      std::pair<const Function *const, std::unique_ptr<CallGraphNode>>;
457
458
92.6k
  static NodeRef getEntryNode(CallGraph *CGN) {
459
92.6k
    return CGN->getExternalCallingNode(); // Start at the external node!
460
92.6k
  }
461
462
0
  static CallGraphNode *CGGetValuePtr(const PairTy &P) {
463
0
    return P.second.get();
464
0
  }
465
466
  // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
467
  using nodes_iterator =
468
      mapped_iterator<CallGraph::iterator, decltype(&CGGetValuePtr)>;
469
470
1
  static nodes_iterator nodes_begin(CallGraph *CG) {
471
1
    return nodes_iterator(CG->begin(), &CGGetValuePtr);
472
1
  }
473
474
1
  static nodes_iterator nodes_end(CallGraph *CG) {
475
1
    return nodes_iterator(CG->end(), &CGGetValuePtr);
476
1
  }
477
};
478
479
template <>
480
struct GraphTraits<const CallGraph *> : public GraphTraits<
481
                                            const CallGraphNode *> {
482
  using PairTy =
483
      std::pair<const Function *const, std::unique_ptr<CallGraphNode>>;
484
485
4
  static NodeRef getEntryNode(const CallGraph *CGN) {
486
4
    return CGN->getExternalCallingNode(); // Start at the external node!
487
4
  }
488
489
  static const CallGraphNode *CGGetValuePtr(const PairTy &P) {
490
    return P.second.get();
491
  }
492
493
  // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
494
  using nodes_iterator =
495
      mapped_iterator<CallGraph::const_iterator, decltype(&CGGetValuePtr)>;
496
497
  static nodes_iterator nodes_begin(const CallGraph *CG) {
498
    return nodes_iterator(CG->begin(), &CGGetValuePtr);
499
  }
500
501
  static nodes_iterator nodes_end(const CallGraph *CG) {
502
    return nodes_iterator(CG->end(), &CGGetValuePtr);
503
  }
504
};
505
506
} // end namespace llvm
507
508
#endif // LLVM_ANALYSIS_CALLGRAPH_H