/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
H A D | TestTopologicalSort.java | 40 g.addEdge("C", "F"); 41 g.addEdge("C", "G"); 42 g.addEdge("C", "A"); 43 g.addEdge("C", "B"); 44 g.addEdge("A", "D"); 45 g.addEdge("A", "E"); 46 g.addEdge("B", "E"); 47 g.addEdge("D", "E"); 48 g.addEdge("D", "F"); 49 g.addEdge(" [all...] |
/external/testng/src/test/java/test/ |
H A D | DynamicGraphTest.java | 25 dg.addEdge("b1", "a1"); 26 dg.addEdge("b1", "a2"); 27 dg.addEdge("b2", "a1"); 28 dg.addEdge("b2", "a2"); 29 dg.addEdge("c1", "b1"); 30 dg.addEdge("c1", "b2"); 57 dg.addEdge("b1", "a1"); 58 dg.addEdge("b1", "a2");
|
/external/compiler-rt/lib/sanitizer_common/tests/ |
H A D | sanitizer_bvgraph_test.cc | 46 bool addEdge(uptr from, uptr to) { function in class:SimpleGraph 87 EXPECT_EQ(g.addEdge(from, to), s_g.addEdge(from, to)); 132 EXPECT_EQ(g.addEdge(from, to), s_g.addEdge(from, to)); 186 g.addEdge(f0, f1); 187 g.addEdge(f1, f2); 188 g.addEdge(f2, f3); 194 g.addEdge(f1, t0); 207 g.addEdge(f [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Graph.java | 44 public void addEdge(Node n) { method in class:Graph.Node 55 public void addEdge(Object a, Object b) { method in class:Graph 59 a_node.addEdge(b_node);
|
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | PathNumbering.cpp | 250 addEdge(getExit(),getRoot(),0); 283 BallLarusEdge* exitEdge = addEdge(node, getExit(), 0); 301 addEdge(getRoot(), (*succ)->getTarget(), duplicateNumber++); 381 BallLarusEdge* callEdge = addEdge(currentNode, getExit(), 0); 391 addEdge(currentNode, getExit(),0); 424 addEdge(currentNode, succNode, duplicateCount); 438 addEdge(currentNode, childNode, duplicateCount); 497 BallLarusEdge* BallLarusDag::addEdge(BallLarusNode* source, function in class:BallLarusDag 510 BallLarusEdge* childEdge = addEdge(source, target, duplicateCount); 513 childEdge->setPhonyRoot(addEdge(getRoo [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | CFGMST.h | 90 addEdge(nullptr, BB, EntryWeight); 94 addEdge(BB, nullptr, EntryWeight); 118 addEdge(&*BB, TargetBB, Weight).IsCritical = Critical; 123 addEdge(&*BB, nullptr, BBWeight); 184 Edge &addEdge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W) { function in class:llvm::CFGMST
|
H A D | GCOVProfiling.cpp | 261 void addEdge(GCOVBlock &Successor) { function in class:__anon13437::GCOVBlock 539 Block.addEdge(Func.getBlock(TI->getSuccessor(i))); 542 Block.addEdge(Func.getReturnBlock());
|
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
H A D | Trie.h | 70 inline void addEdge(Node* N) { function in class:llvm::Trie::Node 178 nNode->addEdge(eNode); 232 nNode->addEdge(tNode); 236 cNode->addEdge(tNode);
|
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 68 AdjEdgeItr addEdge(EdgeItr e) { function in class:PBQP::Graph::NodeEntry 134 ne.setNode1AEItr(n1.addEdge(edgeItr)); 135 ne.setNode2AEItr(n2.addEdge(edgeItr)); 176 EdgeItr addEdge(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr, function in class:PBQP::Graph
|
/external/llvm/lib/Analysis/ |
H A D | CFLGraph.h | 110 void addEdge(Node From, Node To, int64_t Offset = 0) { function in class:llvm::cflaa::CFLGraph::ValueInfo 201 Graph.addEdge(InstantiatedValue{From, 0}, InstantiatedValue{To, 0}, 213 Graph.addEdge(InstantiatedValue{From, 1}, InstantiatedValue{To, 0}); 347 Graph.addEdge(IRelation->From, IRelation->To);
|
H A D | LazyCallGraph.cpp | 23 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, function 51 addEdge(Edges, EdgeIndexMap, *F, LazyCallGraph::Edge::Ref); 81 addEdge(Edges, EdgeIndexMap, *Callee, LazyCallGraph::Edge::Call);
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_bvgraph.h | 44 bool addEdge(uptr from, uptr to) { function in class:__sanitizer::BVGraph
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
H A D | PathNumbering.h | 273 BallLarusEdge* addEdge(BallLarusNode* source, BallLarusNode* target,
|
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
H A D | GCOV.h | 189 void addEdge(uint32_t N) { Edges.push_back(N); } function in class:llvm::GCOVBlock
|
/external/skia/src/gpu/ |
H A D | GrTessellator.cpp | 477 this->addEdge(edge); 484 void addEdge(Edge* edge) { function in struct:__anon18256::Poly::MonotonePoly 544 Poly* addEdge(Edge* e, Side side, SkArenaAlloc& alloc) { function in struct:__anon18256::Poly 545 LOG("addEdge (%g -> %g) to poly %d, %s side\n", 567 fTail->addEdge(e); 571 fTail->addEdge(e); 574 partner->addEdge(e, side, alloc); 1408 leftPoly = leftPoly->addEdge(v->fFirstEdgeAbove, Poly::kRight_Side, alloc); 1411 rightPoly = rightPoly->addEdge(v->fLastEdgeAbove, Poly::kLeft_Side, alloc); 1417 e->fRightPoly->addEdge( [all...] |
/external/skia/src/utils/ |
H A D | SkShadowTessellator.cpp | 345 void addEdge(const SkVector& nextPoint, const SkVector& nextNormal); 606 this->addEdge(fInitPoints[1], normal); 620 this->addEdge(p, normal); 624 void SkAmbientShadowTessellator::addEdge(const SkPoint& nextPoint, const SkVector& nextNormal) { function in class:SkAmbientShadowTessellator 626 // then on the next addEdge() we add half of the next normal to get an average of the two 648 // This is lacking 1/4 of the next inset -- we'll add it the next time we call addEdge() 756 void addEdge(const SkVector& nextPoint, const SkVector& nextNormal); 1283 this->addEdge(fInitPoints[1], fFirstOutset); 1299 this->addEdge(p, normal); 1331 void SkSpotShadowTessellator::addEdge(cons function in class:SkSpotShadowTessellator [all...] |
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | antlr3collections.h | 409 * A vector of vectors of edges, built by calling the addEdge method() 475 void (*addEdge) (struct ANTLR3_TOPO_struct * topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency); member in struct:ANTLR3_TOPO_struct
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | ReductionRules.h | 131 YZEId = G.addEdge(YNId, ZNId, Delta);
|
/external/testng/src/main/java/org/testng/internal/ |
H A D | DynamicGraph.java | 52 public void addEdge(T from, T to) { method in class:DynamicGraph
|
/external/swiftshader/third_party/LLVM/lib/VMCore/ |
H A D | GCOV.cpp | 129 Blocks[BlockNo]->addEdge(Buff.readInt());
|
/external/llvm/include/llvm/Analysis/ |
H A D | BlockFrequencyInfoImpl.h | 606 void addEdge(IrrNode &Irr, const BlockNode &Succ, 635 addEdge(Irr, I.first, OuterLoop); 1163 G.addEdge(Irr, BFI.getNode(*I), OuterLoop);
|
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
H A D | GCOVProfiling.cpp | 204 void addEdge(GCOVBlock &Successor) { function in class:__anon20201::GCOVBlock 386 Block.addEdge(Func.getBlock(TI->getSuccessor(i))); 389 Block.addEdge(Func.getReturnBlock());
|
/external/antlr/antlr-3.4/runtime/C/src/ |
H A D | antlr3collections.c | 116 static void addEdge (pANTLR3_TOPO topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency); 2277 topo->addEdge(topo, 3, 0); // Node 3 depends on node 0 2278 topo->addEdge(topo, 0, 1); // Node - depends on node 1 2306 topo->addEdge = addEdge; 2316 addEdge (pANTLR3_TOPO topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency) function
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64PBQPRegAlloc.cpp | 203 G.addEdge(node1, node2, std::move(costs));
|
/external/testng/src/main/java/org/testng/ |
H A D | TestRunner.java | 1061 result.addEdge(m, dm); 1078 result.addEdge(m, ddm); 1100 result.addEdge(dm, es.getKey()); 1112 result.addEdge(dm, es.getKey());
|