Searched refs:Callees (Results 1 - 2 of 2) sorted by relevance
/external/llvm/include/llvm/Analysis/ |
H A D | LazyCallGraph.h | 172 mutable NodeVectorT Callees; member in class:llvm::LazyCallGraph::Node 175 /// \brief Basic constructor implements the scanning of F into Callees and 196 return iterator(*G, Callees.begin(), Callees.end()); 198 iterator end() const { return iterator(*G, Callees.end(), Callees.end()); }
|
/external/llvm/lib/Analysis/ |
H A D | LazyCallGraph.cpp | 25 SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *>> &Callees, 42 CalleeIndexMap.insert(std::make_pair(F, Callees.size())).second) { 45 Callees.push_back(F); 75 findCallees(Worklist, Visited, Callees, CalleeIndexMap); 82 CalleeIndexMap.insert(std::make_pair(&Callee, Callees.size())); 83 Callees.push_back(&Callee); 87 CalleeIndexMap.insert(std::make_pair(&CalleeN.getFunction(), Callees.size())); 88 Callees.push_back(&CalleeN); 96 Callees[IndexMapI->second] = nullptr; 560 for (auto &Callee : N->Callees) 23 findCallees( SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited, SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *>> &Callees, DenseMap<Function *, size_t> &CalleeIndexMap) argument [all...] |
Completed in 250 milliseconds