HomeSort by relevance Sort by last modified time
    Searched refs:DFSStack (Results 1 - 4 of 4) sorted by null

  /external/llvm/lib/Analysis/
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.empty() && "We shouldn't have an empty stack!")
    [all...]
  /external/llvm/include/llvm/Analysis/
LoopInfoImpl.h 414 std::vector<std::pair<BlockT*, SuccIterTy> > DFSStack;
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();
LazyCallGraph.h 223 internalDFS(SmallVectorImpl<std::pair<Node *, Node::iterator>> &DFSStack,
488 SmallVector<std::pair<Node *, iterator>, 4> DFSStack;
506 /// \brief Helper to form a new SCC out of the top of a DFSStack-like
  /external/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp     [all...]

Completed in 346 milliseconds