Searched refs:DFSStack (Results 1 - 4 of 4) sorted by relevance
/external/llvm/lib/Analysis/ |
H A D | LazyCallGraph.cpp | 138 DFSStack(std::move(G.DFSStack)), 152 DFSStack = std::move(G.DFSStack); 378 SmallVectorImpl<std::pair<Node *, Node::iterator>> &DFSStack, 400 while (!DFSStack.empty()) 401 insert(*DFSStack.pop_back_val().first); 416 DFSStack.push_back(std::make_pair(N, I)); 437 if (DFSStack.empty()) 447 assert(!DFSStack 377 internalDFS( SmallVectorImpl<std::pair<Node *, Node::iterator>> &DFSStack, SmallVectorImpl<Node *> &PendingSCCStack, Node *N, SmallVectorImpl<SCC *> &ResultSCCs) argument 490 SmallVector<std::pair<Node *, Node::iterator>, 4> DFSStack; local [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | LoopInfoImpl.h | 414 std::vector<std::pair<BlockT*, SuccIterTy> > DFSStack; member in class:llvm::__anon25478::PopulateLoopsDFS 425 BlockT *dfsSource() { return DFSStack.back().first; } 426 SuccIterTy &dfsSucc() { return DFSStack.back().second; } 430 DFSStack.push_back(std::make_pair(Block, BlockTraits::child_begin(Block))); 440 while (!DFSStack.empty()) { 453 DFSStack.pop_back();
|
H A D | LazyCallGraph.h | 223 internalDFS(SmallVectorImpl<std::pair<Node *, Node::iterator>> &DFSStack, 488 SmallVector<std::pair<Node *, iterator>, 4> DFSStack; member in class:llvm::LazyCallGraph 506 /// \brief Helper to form a new SCC out of the top of a DFSStack-like
|
/external/llvm/lib/CodeGen/ |
H A D | ScheduleDAGInstrs.cpp | 1417 std::vector<std::pair<const SUnit*, SUnit::const_pred_iterator> > DFSStack; member in class:__anon25797::SchedDAGReverseDFS 1419 bool isComplete() const { return DFSStack.empty(); } 1422 DFSStack.push_back(std::make_pair(SU, SU->Preds.begin())); 1424 void advance() { ++DFSStack.back().second; } 1427 DFSStack.pop_back(); 1428 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second); 1431 const SUnit *getCurr() const { return DFSStack.back().first; } 1433 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; }
|
Completed in 553 milliseconds