| /external/antlr/tool/src/test/java/org/antlr/test/ |
| D | TestTopologicalSort.java | 42 g.addEdge("C", "F"); in testFairlyLargeGraph()
43 g.addEdge("C", "G"); in testFairlyLargeGraph()
44 g.addEdge("C", "A"); in testFairlyLargeGraph()
45 g.addEdge("C", "B"); in testFairlyLargeGraph()
46 g.addEdge("A", "D"); in testFairlyLargeGraph()
47 g.addEdge("A", "E"); in testFairlyLargeGraph()
48 g.addEdge("B", "E"); in testFairlyLargeGraph()
49 g.addEdge("D", "E"); in testFairlyLargeGraph()
50 g.addEdge("D", "F"); in testFairlyLargeGraph()
51 g.addEdge("F", "H"); in testFairlyLargeGraph()
[all …]
|
| /external/skqp/tests/ |
| D | IncrTopoSortTest.cpp | 103 void addEdge(Node* dependedOn, Node* dependent) { in addEdge() function in Graph
334 g.addEdge(nodeD, nodeR); in test_1()
335 g.addEdge(nodeZ, nodeW); in test_1()
336 g.addEdge(nodeA, nodeB); in test_1()
337 g.addEdge(nodeY, nodeZ); in test_1()
338 g.addEdge(nodeQ, nodeA); in test_1()
348 g.addEdge(nodeX, nodeY); in test_1()
374 g.addEdge(nodeU, nodeX); in test_2()
375 g.addEdge(nodeW, nodeU); in test_2()
376 g.addEdge(nodeW, nodeZ); in test_2()
[all …]
|
| /external/skia/tests/ |
| D | IncrTopoSortTest.cpp | 103 void addEdge(Node* dependedOn, Node* dependent) { in addEdge() function in Graph
334 g.addEdge(nodeD, nodeR); in test_1()
335 g.addEdge(nodeZ, nodeW); in test_1()
336 g.addEdge(nodeA, nodeB); in test_1()
337 g.addEdge(nodeY, nodeZ); in test_1()
338 g.addEdge(nodeQ, nodeA); in test_1()
348 g.addEdge(nodeX, nodeY); in test_1()
374 g.addEdge(nodeU, nodeX); in test_2()
375 g.addEdge(nodeW, nodeU); in test_2()
376 g.addEdge(nodeW, nodeZ); in test_2()
[all …]
|
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| D | sanitizer_bvgraph_test.cc | 46 bool addEdge(uptr from, uptr to) { in addEdge() function in SimpleGraph
87 EXPECT_EQ(g.addEdge(from, to), s_g.addEdge(from, to)); in BasicTest()
132 EXPECT_EQ(g.addEdge(from, to), s_g.addEdge(from, to)); in RemoveEdges()
186 g.addEdge(f0, f1); in Test_isReachable()
187 g.addEdge(f1, f2); in Test_isReachable()
188 g.addEdge(f2, f3); in Test_isReachable()
194 g.addEdge(f1, t0); in Test_isReachable()
207 g.addEdge(f3, t1); in Test_isReachable()
229 g.addEdge(i, i + 1); in LongCycle()
231 g.addEdge(i, j); in LongCycle()
[all …]
|
| /external/testng/src/test/java/test/ |
| D | DynamicGraphTest.java | 25 dg.addEdge("b1", "a1"); in test8()
26 dg.addEdge("b1", "a2"); in test8()
27 dg.addEdge("b2", "a1"); in test8()
28 dg.addEdge("b2", "a2"); in test8()
29 dg.addEdge("c1", "b1"); in test8()
30 dg.addEdge("c1", "b2"); in test8()
57 dg.addEdge("b1", "a1"); in test2()
58 dg.addEdge("b1", "a2"); in test2()
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| D | PathNumbering.cpp | 250 addEdge(getExit(),getRoot(),0); in init()
283 BallLarusEdge* exitEdge = addEdge(node, getExit(), 0); in calculatePathNumbers()
301 addEdge(getRoot(), (*succ)->getTarget(), duplicateNumber++); in calculatePathNumbers()
381 BallLarusEdge* callEdge = addEdge(currentNode, getExit(), 0); in buildNode()
391 addEdge(currentNode, getExit(),0); in buildNode()
424 addEdge(currentNode, succNode, duplicateCount); in buildEdge()
438 addEdge(currentNode, childNode, duplicateCount); in buildEdge()
497 BallLarusEdge* BallLarusDag::addEdge(BallLarusNode* source, in addEdge() function in BallLarusDag
510 BallLarusEdge* childEdge = addEdge(source, target, duplicateCount); in addBackedge()
513 childEdge->setPhonyRoot(addEdge(getRoot(), target,0)); in addBackedge()
[all …]
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | CFGMST.h | 90 addEdge(nullptr, BB, EntryWeight); in buildEdges()
94 addEdge(BB, nullptr, EntryWeight); in buildEdges()
118 addEdge(&*BB, TargetBB, Weight).IsCritical = Critical; in buildEdges()
123 addEdge(&*BB, nullptr, BBWeight); in buildEdges()
184 Edge &addEdge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W) { in addEdge() function
|
| /external/antlr/tool/src/main/java/org/antlr/misc/ |
| D | Graph.java | 44 public void addEdge(Node<T> n) { in addEdge() method in Graph.Node
56 public void addEdge(T a, T b) { in addEdge() method in Graph
60 a_node.addEdge(b_node); in addEdge()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | MacroFusion.cpp | 57 if (!DAG.addEdge(&SecondSU, SDep(&FirstSU, SDep::Cluster))) in fuseInstructionPair()
85 DAG.addEdge(SU, SDep(&SecondSU, SDep::Artificial)); in fuseInstructionPair()
97 DAG.addEdge(&FirstSU, SDep(SU, SDep::Artificial)); in fuseInstructionPair()
105 DAG.addEdge(&FirstSU, SDep(&SU, SDep::Artificial)); in fuseInstructionPair()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Instrumentation/ |
| D | CFGMST.h | 109 EntryIncoming = &addEdge(nullptr, Entry, EntryWeight); in buildEdges()
115 addEdge(Entry, nullptr, EntryWeight); in buildEdges()
139 auto *E = &addEdge(&*BB, TargetBB, Weight); in buildEdges()
162 Edge *ExitO = &addEdge(&*BB, nullptr, BBWeight); in buildEdges()
255 Edge &addEdge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W) { in addEdge() function
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 68 AdjEdgeItr addEdge(EdgeItr e) { in addEdge() function
134 ne.setNode1AEItr(n1.addEdge(edgeItr)); in addConstructedEdge()
135 ne.setNode2AEItr(n2.addEdge(edgeItr)); in addConstructedEdge()
176 EdgeItr addEdge(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr, in addEdge() function
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | Trie.h | 70 inline void addEdge(Node* N) { in addEdge() function
178 nNode->addEdge(eNode); in splitEdge()
232 nNode->addEdge(tNode); in addString()
236 cNode->addEdge(tNode); in addString()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| D | CFLGraph.h | 128 void addEdge(Node From, Node To, int64_t Offset = 0) {
229 Graph.addEdge(InstantiatedValue{From, 0}, InstantiatedValue{To, 0},
247 Graph.addEdge(InstantiatedValue{From, 1}, InstantiatedValue{To, 0}); in addDerefEdge()
250 Graph.addEdge(InstantiatedValue{From, 0}, InstantiatedValue{To, 1}); in addDerefEdge()
400 Graph.addEdge(IRelation->From, IRelation->To); in tryInterproceduralAnalysis()
|
| D | LazyCallGraph.cpp | 63 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge() function
108 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee), in populateSlow()
122 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F), in populateSlow()
130 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F), in populateSlow()
173 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref); in LazyCallGraph()
188 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), in LazyCallGraph()
|
| /external/llvm/lib/Analysis/ |
| D | CFLGraph.h | 110 void addEdge(Node From, Node To, int64_t Offset = 0) {
201 Graph.addEdge(InstantiatedValue{From, 0}, InstantiatedValue{To, 0},
213 Graph.addEdge(InstantiatedValue{From, 1}, InstantiatedValue{To, 0}); in addDerefEdge()
347 Graph.addEdge(IRelation->From, IRelation->To); in tryInterproceduralAnalysis()
|
| /external/antlr/runtime/Cpp/include/ |
| D | antlr3collections.hpp | 245 void addEdge(ANTLR_UINT32 edge, ANTLR_UINT32 dependency);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/ |
| D | HexagonSubtarget.cpp | 212 DAG->addEdge(&DAG->SUnits[su], SDep(LastSequentialCall, SDep::Barrier)); in apply()
216 DAG->addEdge(&DAG->SUnits[su], SDep(&DAG->SUnits[su-1], SDep::Barrier)); in apply()
254 DAG->addEdge(&DAG->SUnits[su], SDep(LastVRegUse[*AI], SDep::Barrier)); in apply()
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
| D | GCOVProfiling.cpp | 204 void addEdge(GCOVBlock &Successor) { in addEdge() function in __anon5586b7410211::GCOVBlock
386 Block.addEdge(Func.getBlock(TI->getSuccessor(i))); in emitGCNO()
389 Block.addEdge(Func.getReturnBlock()); in emitGCNO()
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_bvgraph.h | 44 bool addEdge(uptr from, uptr to) { in addEdge() function
|
| /external/skia/src/gpu/ |
| D | GrTessellator.cpp | 527 this->addEdge(edge); in MonotonePoly()
534 void addEdge(Edge* edge) { in addEdge() function
594 Poly* addEdge(Edge* e, Side side, SkArenaAlloc& alloc) { in addEdge() function
617 fTail->addEdge(e); in addEdge()
621 fTail->addEdge(e); in addEdge()
624 partner->addEdge(e, side, alloc); in addEdge()
1567 leftPoly = leftPoly->addEdge(v->fFirstEdgeAbove, Poly::kRight_Side, alloc); in tessellate()
1570 rightPoly = rightPoly->addEdge(v->fLastEdgeAbove, Poly::kLeft_Side, alloc); in tessellate()
1576 e->fRightPoly->addEdge(e, Poly::kLeft_Side, alloc); in tessellate()
1579 rightEdge->fLeftPoly->addEdge(e, Poly::kRight_Side, alloc); in tessellate()
[all …]
|
| /external/skqp/src/gpu/ |
| D | GrTessellator.cpp | 527 this->addEdge(edge); in MonotonePoly()
534 void addEdge(Edge* edge) { in addEdge() function
594 Poly* addEdge(Edge* e, Side side, SkArenaAlloc& alloc) { in addEdge() function
617 fTail->addEdge(e); in addEdge()
621 fTail->addEdge(e); in addEdge()
624 partner->addEdge(e, side, alloc); in addEdge()
1567 leftPoly = leftPoly->addEdge(v->fFirstEdgeAbove, Poly::kRight_Side, alloc); in tessellate()
1570 rightPoly = rightPoly->addEdge(v->fLastEdgeAbove, Poly::kLeft_Side, alloc); in tessellate()
1576 e->fRightPoly->addEdge(e, Poly::kLeft_Side, alloc); in tessellate()
1579 rightEdge->fLeftPoly->addEdge(e, Poly::kRight_Side, alloc); in tessellate()
[all …]
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| D | PathNumbering.h | 273 BallLarusEdge* addEdge(BallLarusNode* source, BallLarusNode* target,
|
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| D | GCOV.h | 189 void addEdge(uint32_t N) { Edges.push_back(N); } in addEdge() function
|
| /external/skia/src/utils/ |
| D | SkShadowTessellator.cpp | 57 void addEdge(const SkVector& nextPoint, const SkVector& nextNormal, SkColor umbraColor,
334 this->addEdge(fPathPolygon[0], fFirstOutset, umbraColor, umbraPolygon, false, doClip); in computeConvexShadow()
343 this->addEdge(fPathPolygon[i], normal, umbraColor, umbraPolygon, in computeConvexShadow()
399 void SkBaseShadowTessellator::addEdge(const SkPoint& nextPoint, const SkVector& nextNormal, in addEdge() function in SkBaseShadowTessellator
|
| /external/skqp/src/utils/ |
| D | SkShadowTessellator.cpp | 57 void addEdge(const SkVector& nextPoint, const SkVector& nextNormal, SkColor umbraColor,
334 this->addEdge(fPathPolygon[0], fFirstOutset, umbraColor, umbraPolygon, false, doClip); in computeConvexShadow()
343 this->addEdge(fPathPolygon[i], normal, umbraColor, umbraPolygon, in computeConvexShadow()
399 void SkBaseShadowTessellator::addEdge(const SkPoint& nextPoint, const SkVector& nextNormal, in addEdge() function in SkBaseShadowTessellator
|