HomeSort by relevance Sort by last modified time
    Searched defs:addEdges (Results 1 - 6 of 6) sorted by null

  /external/compiler-rt/lib/sanitizer_common/
sanitizer_bvgraph.h 50 uptr addEdges(const BV &from, uptr to, uptr added_edges[],
sanitizer_deadlock_detector.h 244 uptr addEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk,
249 uptr n_added_edges = g_.addEdges(dtls->getLocks(current_epoch_), cur_idx,
284 addEdges(dtls, cur_node, stk, 0);
  /external/skia/tests/
IncrTopoSortTest.cpp 80 bool fVisited; // only used in addEdges()
105 // addEdges but, when used in MDB sorting, this entry point will never be used.
107 this->addEdges(&tmp, dependent);
125 void addEdges(SkTDArray<Node*>* dependedOn, Node* dependent) {
313 SkTArray<StackInfo> fStack; // only used in addEdges()
430 g.addEdges(&dependedOn, nodeD); // nodes B and C must come before node D
  /external/skqp/tests/
IncrTopoSortTest.cpp 80 bool fVisited; // only used in addEdges()
105 // addEdges but, when used in MDB sorting, this entry point will never be used.
107 this->addEdges(&tmp, dependent);
125 void addEdges(SkTDArray<Node*>* dependedOn, Node* dependent) {
313 SkTArray<StackInfo> fStack; // only used in addEdges()
430 g.addEdges(&dependedOn, nodeD); // nodes B and C must come before node D
  /external/llvm/include/llvm/Analysis/
BlockFrequencyInfoImpl.h 604 void addEdges(const BlockNode &Node, const BFIBase::LoopData *OuterLoop,
615 addEdges(N, OuterLoop, addBlockEdges);
619 addEdges(Index, OuterLoop, addBlockEdges);
624 void IrreducibleGraph::addEdges(const BlockNode &Node,
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
BlockFrequencyInfoImpl.h 650 void addEdges(const BlockNode &Node, const BFIBase::LoopData *OuterLoop,
662 addEdges(N, OuterLoop, addBlockEdges);
666 addEdges(Index, OuterLoop, addBlockEdges);
672 void IrreducibleGraph::addEdges(const BlockNode &Node,
    [all...]

Completed in 1525 milliseconds