Home
last modified time | relevance | path

Searched refs:call_iterator (Results 1 – 3 of 3) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDXILResource.h550 struct call_iterator struct
551 : iterator_adaptor_base<call_iterator, CallMapTy::iterator> {
552 call_iterator() = default;
553 call_iterator(CallMapTy::iterator Iter) in call_iterator() argument
554 : call_iterator::iterator_adaptor_base(std::move(Iter)) {} in call_iterator()
559 call_iterator call_begin() { return call_iterator(CallMap.begin()); } in call_begin()
560 call_iterator call_end() { return call_iterator(CallMap.end()); } in call_end()
561 iterator_range<call_iterator> calls() { in calls()
H A DLazyCallGraph.h221 class call_iterator
222 : public iterator_adaptor_base<call_iterator, VectorImplT::iterator,
236 call_iterator(VectorImplT::iterator BaseI, VectorImplT::iterator E) in call_iterator() function
242 call_iterator() = default;
245 call_iterator &operator++() {
270 call_iterator call_begin() { in call_begin()
271 return call_iterator(Edges.begin(), Edges.end()); in call_begin()
273 call_iterator call_end() { return call_iterator(Edges.end(), Edges.end()); } in call_end()
275 iterator_range<call_iterator> calls() { in calls()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp784 SmallVector<std::pair<Node *, EdgeSequence::call_iterator>, 16> DFSStack; in switchInternalEdgeToRef()
1921 [](EdgeSequence::call_iterator I) -> Node & { return I->getNode(); }, in buildSCCs()