|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
Declarations
include/llvm/Analysis/LazyCallGraph.h 114 class Node;
References
include/llvm/ADT/ArrayRef.h 108 const ArrayRef<U *> &A,
110 std::is_convertible<U *const *, T const *>::value>::type * = nullptr)
118 const SmallVectorTemplateCommon<U *, DummyT> &Vec,
120 std::is_convertible<U *const *, T const *>::value>::type * = nullptr)
include/llvm/ADT/DenseMapInfo.h 39 static inline T* getEmptyKey() {
41 Val <<= PointerLikeTypeTraits<T*>::NumLowBitsAvailable;
45 static inline T* getTombstoneKey() {
47 Val <<= PointerLikeTypeTraits<T*>::NumLowBitsAvailable;
51 static unsigned getHashValue(const T *PtrVal) {
56 static bool isEqual(const T *LHS, const T *RHS) { return LHS == RHS; }
56 static bool isEqual(const T *LHS, const T *RHS) { return LHS == RHS; }
include/llvm/ADT/SmallVector.h 641 template <typename... ArgTypes> reference emplace_back(ArgTypes &&... Args) {
include/llvm/ADT/iterator.h 68 : public std::iterator<IteratorCategoryT, T, DifferenceTypeT, PointerT,
206 : public iterator_facade_base<DerivedT, IteratorCategoryT, T,
288 pointee_iterator<WrappedIteratorT, T>, WrappedIteratorT,
290 T> {
296 T &operator*() const { return **this->I; }
include/llvm/Analysis/CGSCCPassManager.h 316 SmallDenseSet<std::pair<LazyCallGraph::Node *, LazyCallGraph::SCC *>, 4>
418 LazyCallGraph &G, LazyCallGraph::SCC &C, LazyCallGraph::Node &N,
461 SmallVector<LazyCallGraph::Node *, 4> Nodes;
462 for (LazyCallGraph::Node &N : C)
474 for (LazyCallGraph::Node *N : Nodes) {
589 for (LazyCallGraph::Node &N : C) {
754 SmallDenseSet<std::pair<LazyCallGraph::Node *, LazyCallGraph::SCC *>, 4>
include/llvm/Analysis/LazyCallGraph.h 141 explicit Edge(Node &N, Kind K);
160 Node &getNode() const;
171 PointerIntPair<Node *, 1, Kind> Value;
262 Edge &operator[](Node &N) {
269 Edge *lookup(Node &N) {
296 DenseMap<Node *, int> EdgeIndexMap;
301 void insertEdgeInternal(Node &ChildN, Edge::Kind EK);
304 void setEdgeKind(Node &ChildN, Edge::Kind EK);
307 bool removeEdgeInternal(Node &ChildN);
339 bool operator==(const Node &N) const { return this == &N; }
340 bool operator!=(const Node &N) const { return !operator==(N); }
412 friend raw_ostream &operator<<(raw_ostream &OS, const Node &N) {
436 SmallVector<Node *, 1> Nodes;
457 for (LazyCallGraph::Node &N : C) {
486 using iterator = pointee_iterator<SmallVectorImpl<Node *>::const_iterator>;
611 void handleTrivialEdgeInsertion(Node &SourceN, Node &TargetN);
611 void handleTrivialEdgeInsertion(Node &SourceN, Node &TargetN);
697 Node &SourceN, Node &TargetN,
697 Node &SourceN, Node &TargetN,
706 void switchTrivialInternalEdgeToRef(Node &SourceN, Node &TargetN);
706 void switchTrivialInternalEdgeToRef(Node &SourceN, Node &TargetN);
726 iterator_range<iterator> switchInternalEdgeToRef(Node &SourceN,
727 Node &TargetN);
733 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
733 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
739 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
739 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
753 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
753 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
761 void insertOutgoingEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
761 void insertOutgoingEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
788 SmallVector<RefSCC *, 1> insertIncomingRefEdge(Node &SourceN,
789 Node &TargetN);
801 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
801 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
841 SmallVector<RefSCC *, 1> removeInternalRefEdge(Node &SourceN,
842 ArrayRef<Node *> TargetNs);
853 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
853 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
864 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
864 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
875 void replaceNodeFunction(Node &N, Function &NewF);
964 Node *lookup(const Function &F) const { return NodeMap.lookup(&F); }
970 SCC *lookupSCC(Node &N) const { return SCCMap.lookup(&N); }
976 RefSCC *lookupRefSCC(Node &N) const {
985 Node &get(Function &F) {
986 Node *&N = NodeMap[&F];
1021 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
1021 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
1029 void removeEdge(Node &SourceN, Node &TargetN);
1029 void removeEdge(Node &SourceN, Node &TargetN);
1119 using node_stack_iterator = SmallVectorImpl<Node *>::reverse_iterator;
1123 SpecificBumpPtrAllocator<Node> BPA;
1126 DenseMap<const Function *, Node *> NodeMap;
1138 DenseMap<Node *, SCC *> SCCMap;
1159 Node &insertInto(Function &F, Node *&MappedN);
1159 Node &insertInto(Function &F, Node *&MappedN);
1212 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {}
1228 inline LazyCallGraph::Node &LazyCallGraph::Edge::getNode() const {
1240 using NodeRef = LazyCallGraph::Node *;
1248 using NodeRef = LazyCallGraph::Node *;
include/llvm/Support/Alignment.h 103 return Constant<std::alignment_of<T>::value>();
include/llvm/Support/Allocator.h 81 template <typename T> T *Allocate(size_t Num = 1) {
82 return static_cast<T *>(Allocate(Num * sizeof(T), alignof(T)));
82 return static_cast<T *>(Allocate(Num * sizeof(T), alignof(T)));
470 for (char *Ptr = Begin; Ptr + sizeof(T) <= End; Ptr += sizeof(T))
470 for (char *Ptr = Begin; Ptr + sizeof(T) <= End; Ptr += sizeof(T))
478 char *Begin = (char *)alignAddr(*I, Align::Of<T>());
488 DestroyElements((char *)alignAddr(Ptr, Align::Of<T>()),
496 T *Allocate(size_t num = 1) { return Allocator.Allocate<T>(num); }
496 T *Allocate(size_t num = 1) { return Allocator.Allocate<T>(num); }
include/llvm/Support/PointerLikeTypeTraits.h 56 static inline void *getAsVoidPointer(T *P) { return P; }
57 static inline T *getFromVoidPointer(void *P) { return static_cast<T *>(P); }
59 enum { NumLowBitsAvailable = detail::ConstantLog2<alignof(T)>::value };
91 typedef PointerLikeTypeTraits<T *> NonConst;
93 static inline const void *getAsVoidPointer(const T *P) {
96 static inline const T *getFromVoidPointer(const void *P) {
lib/Analysis/CGSCCPassManager.cpp 257 for (LazyCallGraph::Node &N : C)
269 for (LazyCallGraph::Node &N : C) {
330 for (LazyCallGraph::Node &N : C) {
367 LazyCallGraph::Node &N, LazyCallGraph::SCC *C,
427 LazyCallGraph &G, LazyCallGraph::SCC &InitialC, LazyCallGraph::Node &N,
429 using Node = LazyCallGraph::Node;
lib/Analysis/LazyCallGraph.cpp 42 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN,
48 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {
52 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) {
63 DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap,
64 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) {
236 for (Node *N : Nodes) {
254 for (Node &N : *this)
276 for (Node &N : C)
336 for (Node &N : SourceSCC)
357 for (Node &N : C)
379 for (Node &N : C)
530 Node &SourceN, Node &TargetN,
530 Node &SourceN, Node &TargetN,
574 for (Node &N : C)
603 for (Node &N : C)
658 for (Node *N : C->Nodes)
678 void LazyCallGraph::RefSCC::switchTrivialInternalEdgeToRef(Node &SourceN,
679 Node &TargetN) {
701 LazyCallGraph::RefSCC::switchInternalEdgeToRef(Node &SourceN, Node &TargetN) {
701 LazyCallGraph::RefSCC::switchInternalEdgeToRef(Node &SourceN, Node &TargetN) {
737 SmallVector<std::pair<Node *, EdgeSequence::call_iterator>, 16> DFSStack;
738 SmallVector<Node *, 16> PendingSCCStack;
742 SmallVector<Node *, 16> Worklist;
744 for (Node *N : Worklist) {
762 for (Node *RootN : Worklist) {
780 Node *N;
785 Node &ChildN = I->getNode();
813 for (Node &N : make_range(OldSCC.begin() + OldSize, OldSCC.end())) {
863 for (Node &N : *NewSCCs.back()) {
887 void LazyCallGraph::RefSCC::switchOutgoingEdgeToCall(Node &SourceN,
888 Node &TargetN) {
909 void LazyCallGraph::RefSCC::switchOutgoingEdgeToRef(Node &SourceN,
910 Node &TargetN) {
931 void LazyCallGraph::RefSCC::insertInternalRefEdge(Node &SourceN,
932 Node &TargetN) {
944 void LazyCallGraph::RefSCC::insertOutgoingEdge(Node &SourceN, Node &TargetN,
944 void LazyCallGraph::RefSCC::insertOutgoingEdge(Node &SourceN, Node &TargetN,
999 for (Node &N : C)
1024 for (Node &N : C)
1068 for (Node &N : InnerC)
1108 void LazyCallGraph::RefSCC::removeOutgoingEdge(Node &SourceN, Node &TargetN) {
1108 void LazyCallGraph::RefSCC::removeOutgoingEdge(Node &SourceN, Node &TargetN) {
1147 for (Node *TargetN : TargetNs) {
1179 SmallVector<Node *, 8> Worklist;
1181 for (Node &N : *C)
1192 SmallVector<std::pair<Node *, EdgeSequence::iterator>, 4> DFSStack;
1193 SmallVector<Node *, 4> PendingRefSCCStack;
1200 Node *RootN = Worklist.pop_back_val();
1213 Node *N;
1222 Node &ChildN = I->getNode();
1291 for (Node *N : RefSCCNodes)
1335 for (Node &N : *C) {
1364 void LazyCallGraph::RefSCC::handleTrivialEdgeInsertion(Node &SourceN,
1365 Node &TargetN) {
1381 void LazyCallGraph::RefSCC::insertTrivialCallEdge(Node &SourceN,
1382 Node &TargetN) {
1416 void LazyCallGraph::RefSCC::insertTrivialRefEdge(Node &SourceN, Node &TargetN) {
1416 void LazyCallGraph::RefSCC::insertTrivialRefEdge(Node &SourceN, Node &TargetN) {
1445 void LazyCallGraph::RefSCC::replaceNodeFunction(Node &N, Function &NewF) {
1476 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {
1476 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {
1483 void LazyCallGraph::removeEdge(Node &SourceN, Node &TargetN) {
1483 void LazyCallGraph::removeEdge(Node &SourceN, Node &TargetN) {
1508 Node &N = *NI->second;
1556 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) {
1556 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) {
1557 return *new (MappedN = BPA.Allocate()) Node(*this, F);
1575 using EdgeItT = decltype(GetBegin(std::declval<Node &>()));
1577 SmallVector<std::pair<Node *, EdgeItT>, 16> DFSStack;
1578 SmallVector<Node *, 16> PendingSCCStack;
1581 for (Node *RootN : Roots) {
1599 Node *N;
1604 Node &ChildN = GetNode(I);
1670 for (Node *N : Nodes) {
1689 for (Node &N : *RC.SCCs.back()) {
1707 SmallVector<Node *, 16> Roots;
1745 static void printNode(raw_ostream &OS, LazyCallGraph::Node &N) {
1757 for (LazyCallGraph::Node &N : C)
1790 static void printNodeDOT(raw_ostream &OS, LazyCallGraph::Node &N) {
lib/Passes/StandardInstrumentations.cpp 48 for (const LazyCallGraph::Node &N : *C) {
86 for (const LazyCallGraph::Node &N : *C) {
lib/Transforms/IPO/ArgumentPromotion.cpp 1030 for (LazyCallGraph::Node &N : C) {
lib/Transforms/IPO/FunctionAttrs.cpp 1427 for (LazyCallGraph::Node &N : C) {
lib/Transforms/IPO/Inliner.cpp 922 for (auto &N : InitialC) {
978 LazyCallGraph::Node &N = *CG.lookup(F);
1155 LazyCallGraph::Node &CalleeN = *CG.lookup(*InlinedCallee);
unittests/Analysis/CGSCCPassManagerTest.cpp 294 for (LazyCallGraph::Node &N : C) {
1165 auto &H2N = *llvm::find_if(
1214 auto &H2N = *C.begin();
unittests/Analysis/LazyCallGraphTest.cpp 236 LazyCallGraph::Node &A1 = (I++)->getNode();
238 LazyCallGraph::Node &A2 = (I++)->getNode();
240 LazyCallGraph::Node &A3 = (I++)->getNode();
242 LazyCallGraph::Node &B1 = (I++)->getNode();
244 LazyCallGraph::Node &B2 = (I++)->getNode();
246 LazyCallGraph::Node &B3 = (I++)->getNode();
248 LazyCallGraph::Node &C1 = (I++)->getNode();
250 LazyCallGraph::Node &C2 = (I++)->getNode();
252 LazyCallGraph::Node &C3 = (I++)->getNode();
254 LazyCallGraph::Node &D1 = (I++)->getNode();
256 LazyCallGraph::Node &D2 = (I++)->getNode();
258 LazyCallGraph::Node &D3 = (I++)->getNode();
325 for (LazyCallGraph::Node &N : *D.begin())
341 for (LazyCallGraph::Node &N : *C.begin())
357 for (LazyCallGraph::Node &N : *B.begin())
375 for (LazyCallGraph::Node &N : *A.begin())
420 LazyCallGraph::Node &A = CG.get(lookupFunction(*M, "a"));
421 LazyCallGraph::Node &B = CG.get(lookupFunction(*M, "b"));
427 LazyCallGraph::Node &C = CG.get(lookupFunction(*M, "c"));
460 LazyCallGraph::Node &D1 = CG.get(lookupFunction(*M, "d1"));
461 LazyCallGraph::Node &A1 = CG.get(lookupFunction(*M, "a1"));
479 for (LazyCallGraph::Node &N : D)
489 for (LazyCallGraph::Node &N : B)
499 for (LazyCallGraph::Node &N : C)
509 for (LazyCallGraph::Node &N : A)
561 LazyCallGraph::Node &N1 = *CG.lookup(lookupFunction(*M, "f1"));
562 LazyCallGraph::Node &N2 = *CG.lookup(lookupFunction(*M, "f2"));
563 LazyCallGraph::Node &N3 = *CG.lookup(lookupFunction(*M, "f3"));
564 LazyCallGraph::Node &N4 = *CG.lookup(lookupFunction(*M, "f4"));
565 LazyCallGraph::Node &N5 = *CG.lookup(lookupFunction(*M, "f4"));
611 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a"));
612 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b"));
613 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c"));
614 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d"));
757 LazyCallGraph::Node &A1 = *CG.lookup(lookupFunction(*M, "a1"));
758 LazyCallGraph::Node &A2 = *CG.lookup(lookupFunction(*M, "a2"));
759 LazyCallGraph::Node &A3 = *CG.lookup(lookupFunction(*M, "a3"));
760 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1"));
761 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2"));
762 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3"));
763 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1"));
764 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2"));
765 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3"));
766 LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1"));
767 LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2"));
768 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3"));
849 LazyCallGraph::Node &A1 = *CG.lookup(lookupFunction(*M, "a1"));
850 LazyCallGraph::Node &A2 = *CG.lookup(lookupFunction(*M, "a2"));
851 LazyCallGraph::Node &A3 = *CG.lookup(lookupFunction(*M, "a3"));
852 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1"));
853 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2"));
854 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3"));
855 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1"));
856 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2"));
857 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3"));
858 LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1"));
859 LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2"));
860 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3"));
956 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a"));
957 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b"));
958 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c"));
959 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d"));
1033 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a"));
1034 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b"));
1035 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c"));
1036 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d"));
1095 LazyCallGraph::Node &A1 = *CG.lookup(lookupFunction(*M, "a1"));
1096 LazyCallGraph::Node &A2 = *CG.lookup(lookupFunction(*M, "a2"));
1097 LazyCallGraph::Node &A3 = *CG.lookup(lookupFunction(*M, "a3"));
1098 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1"));
1099 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2"));
1100 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3"));
1101 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1"));
1102 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2"));
1103 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3"));
1104 LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1"));
1105 LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2"));
1106 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3"));
1241 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a"));
1242 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b"));
1243 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c"));
1335 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a"));
1336 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b"));
1337 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c"));
1413 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a"));
1414 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b"));
1415 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c"));
1483 LazyCallGraph::Node &AN = *CG.lookup(lookupFunction(*M, "a"));
1484 LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b"));
1485 LazyCallGraph::Node &CN = *CG.lookup(lookupFunction(*M, "c"));
1560 LazyCallGraph::Node &AN = *CG.lookup(lookupFunction(*M, "a"));
1561 LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b"));
1562 LazyCallGraph::Node &CN = *CG.lookup(lookupFunction(*M, "c"));
1650 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a"));
1651 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b"));
1652 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c"));
1653 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d"));
1762 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a"));
1763 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1"));
1764 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2"));
1765 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3"));
1766 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1"));
1767 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2"));
1768 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3"));
1769 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d"));
1892 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a"));
1893 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b"));
1894 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c"));
1895 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d"));
1896 LazyCallGraph::Node &E = *CG.lookup(lookupFunction(*M, "e"));
1897 LazyCallGraph::Node &F = *CG.lookup(lookupFunction(*M, "f"));
1898 LazyCallGraph::Node &G = *CG.lookup(lookupFunction(*M, "g"));
1975 LazyCallGraph::Node &F = *CG.lookup(lookupFunction(*M, "f"));
1976 LazyCallGraph::Node &G = *CG.lookup(lookupFunction(*M, "g"));
2003 LazyCallGraph::Node &F = *CG.lookup(lookupFunction(*M, "f"));
2004 LazyCallGraph::Node &G = *CG.lookup(lookupFunction(*M, "g"));
2057 LazyCallGraph::Node &AN = *CG.lookup(lookupFunction(*M, "a"));
2058 LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b"));
2059 LazyCallGraph::Node &CN = *CG.lookup(lookupFunction(*M, "c"));
2060 LazyCallGraph::Node &DN = *CG.lookup(lookupFunction(*M, "d"));
2125 LazyCallGraph::Node &AN = CG.get(lookupFunction(*M, "a"));
2126 LazyCallGraph::Node &BN = CG.get(lookupFunction(*M, "b"));
2127 LazyCallGraph::Node &CN = CG.get(lookupFunction(*M, "c"));
2128 LazyCallGraph::Node &DN = CG.get(lookupFunction(*M, "d"));
2129 LazyCallGraph::Node &DeadN = CG.get(lookupFunction(*M, "dead"));
usr/include/c++/7.4.0/bits/move.h 72 constexpr _Tp&&
83 constexpr _Tp&&
usr/include/c++/7.4.0/bits/stl_iterator_base_types.h 123 typedef _Tp value_type;
usr/include/c++/7.4.0/type_traits 1633 { typedef _Tp type; };
1659 { typedef _Tp&& type; };
1983 { typedef _Up type; };
utils/unittest/googletest/include/gtest/gtest-printers.h 407 T* p, ::std::ostream* os) {
416 if (IsTrue(ImplicitlyConvertible<T*, const void*>::value)) {