| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| D | TestTopologicalSort.java | 40 g.addEdge("C", "F"); in testFairlyLargeGraph()
41 g.addEdge("C", "G"); in testFairlyLargeGraph()
42 g.addEdge("C", "A"); in testFairlyLargeGraph()
43 g.addEdge("C", "B"); in testFairlyLargeGraph()
44 g.addEdge("A", "D"); in testFairlyLargeGraph()
45 g.addEdge("A", "E"); in testFairlyLargeGraph()
46 g.addEdge("B", "E"); in testFairlyLargeGraph()
47 g.addEdge("D", "E"); in testFairlyLargeGraph()
48 g.addEdge("D", "F"); in testFairlyLargeGraph()
49 g.addEdge("F", "H"); in testFairlyLargeGraph()
[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/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/llvm/lib/Transforms/Instrumentation/ |
| D | CFGMST.h | 91 addEdge(nullptr, BB, EntryWeight); in buildEdges()
95 addEdge(BB, nullptr, EntryWeight); in buildEdges()
119 addEdge(&*BB, TargetBB, Weight).IsCritical = Critical; in buildEdges()
124 addEdge(&*BB, nullptr, BBWeight); in buildEdges()
185 Edge &addEdge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W) { in addEdge() function
|
| D | PGOInstrumentation.cpp | 484 PGOUseEdge &NewEdge = FuncInfo.MST.addEdge(SrcBB, InstrBB, 0); in setInstrumentedCounts()
487 PGOUseEdge &NewEdge1 = FuncInfo.MST.addEdge(InstrBB, DestBB, 0); in setInstrumentedCounts()
|
| D | GCOVProfiling.cpp | 253 void addEdge(GCOVBlock &Successor) { in addEdge() function in __anondd3809d80211::GCOVBlock
525 Block.addEdge(Func.getBlock(TI->getSuccessor(i))); in emitProfileNotes()
528 Block.addEdge(Func.getReturnBlock()); in emitProfileNotes()
|
| /external/opencv3/modules/cudaimgproc/src/ |
| D | mssegmentation.cpp | 93 void addEdge(int from, int to, const T& val=T());
191 inline void Graph<T>::addEdge(int from, int to, const T& val) in addEdge() function in __anonf9c17be50111::Graph
289 g.addEdge(pix(y, x, ncols), pix(y, x + 1, ncols), SegmLinkVal(dr[0], dsp[0])); in meanShiftSegmentation()
290 g.addEdge(pix(y, x, ncols), pix(y + 1, x, ncols), SegmLinkVal(dr[1], dsp[1])); in meanShiftSegmentation()
291 g.addEdge(pix(y, x, ncols), pix(y + 1, x + 1, ncols), SegmLinkVal(dr[2], dsp[2])); in meanShiftSegmentation()
292 g.addEdge(pix(y, x + 1, ncols), pix(y + 1, x, ncols), SegmLinkVal(dr[3], dsp[3])); in meanShiftSegmentation()
303 … g.addEdge(pix(y, ncols - 1, ncols), pix(y + 1, ncols - 1, ncols), SegmLinkVal(dr[0], dsp[0])); in meanShiftSegmentation()
313 … g.addEdge(pix(nrows - 1, x, ncols), pix(nrows - 1, x + 1, ncols), SegmLinkVal(dr[0], dsp[0])); in meanShiftSegmentation()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| D | Graph.java | 44 public void addEdge(Node n) { in addEdge() method in Graph.Node
55 public void addEdge(Object a, Object b) { in addEdge() method in Graph
59 a_node.addEdge(b_node); in addEdge()
|
| /external/opencv3/modules/stitching/include/opencv2/stitching/detail/ |
| D | util.hpp | 141 void addEdge(int from, int to, float weight);
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_bvgraph.h | 44 bool addEdge(uptr from, uptr to) { in addEdge() function
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| D | EscapeAnalysis.java | 172 private void addEdge(EscapeSet parentSet, EscapeSet childSet) { in addEdge() method in EscapeAnalysis
431 addEdge(parentSet, escSet); in processUse()
440 addEdge(escSet, childSet); in processUse()
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| D | antlr3collections.h | 475 …void (*addEdge) (struct ANTLR3_TOPO_struct * topo, ANTLR3_UINT32 edge, ANTLR3_… member
|
| /external/testng/src/main/java/org/testng/internal/ |
| D | DynamicGraph.java | 52 public void addEdge(T from, T to) { in addEdge() method in DynamicGraph
|
| /external/llvm/include/llvm/Analysis/ |
| D | BlockFrequencyInfoImpl.h | 600 void addEdge(IrrNode &Irr, const BlockNode &Succ,
629 addEdge(Irr, I.first, OuterLoop);
1151 G.addEdge(Irr, BFI.getNode(*I), OuterLoop);
|
| /external/opencv3/modules/stitching/src/ |
| D | util.cpp | 95 void Graph::addEdge(int from, int to, float weight) in addEdge() function in cv::detail::Graph
|
| D | motion_estimators.cpp | 826 graph.addEdge(i, j, conf); in findMaxSpanningTree()
844 span_tree.addEdge(edges[i].from, edges[i].to, edges[i].weight); in findMaxSpanningTree()
845 span_tree.addEdge(edges[i].to, edges[i].from, edges[i].weight); in findMaxSpanningTree()
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | ReductionRules.h | 131 YZEId = G.addEdge(YNId, ZNId, Delta); in applyR2()
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| D | antlr3collections.c | 116 static void addEdge (pANTLR3_TOPO topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 depe…
2306 topo->addEdge = addEdge; in antlr3TopoNew()
2316 addEdge (pANTLR3_TOPO topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency) in addEdge() function
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| D | BugReporter.cpp | 1020 void addEdge(PathDiagnosticLocation NewLoc, bool alwaysAdd = false,
1117 void EdgeBuilder::addEdge(PathDiagnosticLocation NewLoc, bool alwaysAdd, in addEdge() function in EdgeBuilder
1422 EB.addEdge(C->callReturn, /*AlwaysAdd=*/true, /*IsPostJump=*/true); in GenerateExtensivePathDiagnostic()
1438 EB.addEdge(pos); in GenerateExtensivePathDiagnostic()
1505 EB.addEdge(p->getLocation(), true); in GenerateExtensivePathDiagnostic()
1511 EB.addEdge(BL); in GenerateExtensivePathDiagnostic()
1532 EB.addEdge(PE->getLocation(), true); in GenerateExtensivePathDiagnostic()
1570 EB.addEdge(Loc, true); in GenerateExtensivePathDiagnostic()
|
| /external/testng/src/main/java/org/testng/ |
| D | TestRunner.java | 1061 result.addEdge(m, dm); in createDynamicGraph()
1078 result.addEdge(m, ddm); in createDynamicGraph()
1100 result.addEdge(dm, es.getKey()); in createDynamicGraph()
1112 result.addEdge(dm, es.getKey()); in createDynamicGraph()
|
| /external/opencv3/modules/calib3d/src/ |
| D | circlesgrid.hpp | 94 void addEdge(size_t id1, size_t id2);
|
| /external/llvm/lib/CodeGen/ |
| D | MachineScheduler.cpp | 525 bool ScheduleDAGMI::addEdge(SUnit *SuccSU, const SDep &PredDep) { in addEdge() function in ScheduleDAGMI
1338 && DAG->addEdge(SUb, SDep(SUa, SDep::Cluster))) { in clusterNeighboringLoads()
1351 DAG->addEdge(SI->getSUnit(), SDep(SUb, SDep::Artificial)); in clusterNeighboringLoads()
1451 bool Success = DAG->addEdge(&ExitSU, SDep(&SU, SDep::Cluster)); in apply()
1618 DAG->addEdge(GlobalSU, SDep(*I, SDep::Weak)); in constrainLocalCopy()
1624 DAG->addEdge(FirstLocalSU, SDep(*I, SDep::Weak)); in constrainLocalCopy()
|
| D | RegAllocPBQP.cpp | 395 PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M)); in createInterferenceEdge()
456 G.addEdge(N1Id, N2Id, std::move(Costs)); in apply()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/ |
| D | Tool.java | 570 … if ( vocabName!=null ) g.addEdge(gfile, vocabName+CodeGenerator.VOCAB_FILE_EXTENSION); in sortGrammarFiles()
572 g.addEdge(grammarName+CodeGenerator.VOCAB_FILE_EXTENSION, gfile); in sortGrammarFiles()
|
| /external/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 203 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
|