| /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/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/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/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/llvm/include/llvm/CodeGen/PBQP/ |
| D | ReductionRules.h | 130 YZEId = G.addEdge(YNId, ZNId, Delta); in applyR2()
|
| D | Graph.h | 371 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { in addEdge() function
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 276 g.addEdge(p->getNodeForVReg(vr1), p->getNodeForVReg(vr2), in build()
371 g.addEdge(node1, node2, costs); in build()
|
| D | MachineScheduler.cpp | 503 bool ScheduleDAGMI::addEdge(SUnit *SuccSU, const SDep &PredDep) { in addEdge() function in ScheduleDAGMI
1270 && DAG->addEdge(SUb, SDep(SUa, SDep::Cluster))) { in clusterNeighboringLoads()
1283 DAG->addEdge(SI->getSUnit(), SDep(SUb, SDep::Artificial)); in clusterNeighboringLoads()
1359 bool Success = DAG->addEdge(&DAG->ExitSU, SDep(SU, SDep::Cluster)); in apply()
1523 DAG->addEdge(GlobalSU, SDep(*I, SDep::Weak)); in constrainLocalCopy()
1529 DAG->addEdge(FirstLocalSU, SDep(*I, SDep::Weak)); in constrainLocalCopy()
|
| /external/llvm/include/llvm/Analysis/ |
| D | BlockFrequencyInfoImpl.h | 587 void addEdge(IrrNode &Irr, const BlockNode &Succ,
616 addEdge(Irr, I.first, OuterLoop);
1117 G.addEdge(Irr, BFI.getNode(*I), OuterLoop);
|
| /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 | 1026 void addEdge(PathDiagnosticLocation NewLoc, bool alwaysAdd = false,
1123 void EdgeBuilder::addEdge(PathDiagnosticLocation NewLoc, bool alwaysAdd, in addEdge() function in EdgeBuilder
1431 EB.addEdge(C->callReturn, /*AlwaysAdd=*/true, /*IsPostJump=*/true); in GenerateExtensivePathDiagnostic()
1447 EB.addEdge(pos); in GenerateExtensivePathDiagnostic()
1514 EB.addEdge(p->getLocation(), true); in GenerateExtensivePathDiagnostic()
1520 EB.addEdge(BL); in GenerateExtensivePathDiagnostic()
1541 EB.addEdge(PE->getLocation(), true); in GenerateExtensivePathDiagnostic()
1581 EB.addEdge(Loc, true); in GenerateExtensivePathDiagnostic()
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | GCOVProfiling.cpp | 254 void addEdge(GCOVBlock &Successor) { in addEdge() function in __anon6c247a230211::GCOVBlock
517 Block.addEdge(Func.getBlock(TI->getSuccessor(i))); in emitProfileNotes()
520 Block.addEdge(Func.getReturnBlock()); in emitProfileNotes()
|
| /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/include/llvm/CodeGen/ |
| D | MachineScheduler.h | 286 bool addEdge(SUnit *SuccSU, const SDep &PredDep);
|
| /external/llvm/lib/Analysis/ |
| D | BlockFrequencyInfoImpl.cpp | 561 void IrreducibleGraph::addEdge(IrrNode &Irr, const BlockNode &Succ, in addEdge() function in IrreducibleGraph
|
| /external/skia/experimental/Intersection/ |
| D | EdgeWalker.cpp | 1200 void addEdge() { in addEdge() function in InEdgeBuilder
1296 addEdge(); in walk()
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | EdgeWalker.cpp | 1200 void addEdge() { in addEdge() function in InEdgeBuilder
1296 addEdge(); in walk()
|