Searched refs:Callees (Results 1 – 3 of 3) sorted by relevance
| /external/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 25 SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *>> &Callees, in findCallees() argument
42 CalleeIndexMap.insert(std::make_pair(F, Callees.size())).second) { in findCallees()
45 Callees.push_back(F); in findCallees()
75 findCallees(Worklist, Visited, Callees, CalleeIndexMap); in Node()
82 CalleeIndexMap.insert(std::make_pair(&Callee, Callees.size())); in insertEdgeInternal()
83 Callees.push_back(&Callee); in insertEdgeInternal()
87 CalleeIndexMap.insert(std::make_pair(&CalleeN.getFunction(), Callees.size())); in insertEdgeInternal()
88 Callees.push_back(&CalleeN); in insertEdgeInternal()
96 Callees[IndexMapI->second] = nullptr; in removeEdgeInternal()
560 for (auto &Callee : N->Callees) in updateGraphPtrs()
|
| /external/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 172 mutable NodeVectorT Callees; variable
196 return iterator(*G, Callees.begin(), Callees.end()); in begin()
198 iterator end() const { return iterator(*G, Callees.end(), Callees.end()); } in end()
|
| /external/llvm/lib/Target/X86/ |
| D | README-X86-64.txt | 60 which would often require a callee-saved register. Callees usually
|