HomeSort by relevance Sort by last modified time
    Searched defs: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/v8/src/compiler/
control-equivalence.h 78 typedef ZoneStack<DFSStackEntry> DFSStack;
152 void DFSPush(DFSStack& stack, Node* node, Node* from, DFSDirection dir);
155 void DFSPop(DFSStack& stack, Node* node);
  /external/llvm/include/llvm/Analysis/
LazyCallGraph.h 223 internalDFS(SmallVectorImpl<std::pair<Node *, Node::iterator>> &DFSStack,
493 SmallVector<std::pair<Node *, iterator>, 4> DFSStack;
511 /// \brief Helper to form a new SCC out of the top of a DFSStack-like
  /external/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp     [all...]

Completed in 165 milliseconds