| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 44 public void addEdge(Node n) {
55 public void addEdge(Object a, Object b) {
59 a_node.addEdge(b_node);
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_bvgraph.h | 44 bool addEdge(uptr from, uptr to) {
|
| /external/llvm/lib/Analysis/ |
| LazyCallGraph.cpp | 23 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,
51 addEdge(Edges, EdgeIndexMap, *F, LazyCallGraph::Edge::Ref);
81 addEdge(Edges, EdgeIndexMap, *Callee, LazyCallGraph::Edge::Call);
[all...] |
| BlockFrequencyInfoImpl.cpp | 608 void IrreducibleGraph::addEdge(IrrNode &Irr, const BlockNode &Succ,
|
| /prebuilts/go/darwin-x86/src/cmd/vendor/github.com/google/pprof/internal/graph/ |
| dotgraph.go | 96 builder.addEdge(e, nodeIDMap[e.Src], nodeIDMap[e.Dest], hasNodelets[e.Src])
284 // addEdge generates a graph edge in DOT format.
285 func (b *builder) addEdge(edge *Edge, from, to int, hasNodelets bool) {
|
| /prebuilts/go/linux-x86/src/cmd/vendor/github.com/google/pprof/internal/graph/ |
| dotgraph.go | 96 builder.addEdge(e, nodeIDMap[e.Src], nodeIDMap[e.Dest], hasNodelets[e.Src])
284 // addEdge generates a graph edge in DOT format.
285 func (b *builder) addEdge(edge *Edge, from, to int, hasNodelets bool) {
|
| /tools/tradefederation/core/src/com/android/tradefed/util/ |
| DirectedGraph.java | 67 public void addEdge(V from, V to) {
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| 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) {
|
| /frameworks/support/coordinatorlayout/src/androidTest/java/androidx/coordinatorlayout/widget/ |
| DirectedAcyclicGraphTest.java | 68 mGraph.addEdge(node, edge);
80 mGraph.addEdge(node, edge);
89 mGraph.addEdge(node, edge);
103 mGraph.addEdge(node, edge);
121 mGraph.addEdge(node1, edge);
122 mGraph.addEdge(node2, edge);
142 mGraph.addEdge(node, edge);
180 mGraph.addEdge(node4, node2);
181 mGraph.addEdge(node2, node3);
182 mGraph.addEdge(node3, node1)
[all...] |
| /frameworks/support/coordinatorlayout/src/main/java/androidx/coordinatorlayout/widget/ |
| DirectedAcyclicGraph.java | 75 public void addEdge(@NonNull T node, @NonNull T incomingEdge) {
|
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| sanitizer_bvgraph_test.cc | 46 bool addEdge(uptr from, uptr to) {
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(f3, t1)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| GCOV.h | 189 void addEdge(uint32_t N) { Edges.push_back(N); }
|
| /external/testng/src/main/java/org/testng/internal/ |
| DynamicGraph.java | 52 public void addEdge(T from, T to) {
|
| /tools/tradefederation/core/src/com/android/tradefed/testtype/suite/ |
| TfSuiteRunner.java | 224 graph.addEdge(parentConfig, configName);
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| Trie.h | 70 inline void addEdge(Node* N) {
178 nNode->addEdge(eNode);
232 nNode->addEdge(tNode);
236 cNode->addEdge(tNode);
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| Graph.h | 68 AdjEdgeItr addEdge(EdgeItr e) {
134 ne.setNode1AEItr(n1.addEdge(edgeItr));
135 ne.setNode2AEItr(n2.addEdge(edgeItr));
176 EdgeItr addEdge(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr,
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| 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,
510 BallLarusEdge* childEdge = addEdge(source, target, duplicateCount);
513 childEdge->setPhonyRoot(addEdge(getRoot(), target,0))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/PBQP/ |
| Graph.h | 410 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) {
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/PBQP/ |
| Graph.h | 410 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) {
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/PBQP/ |
| Graph.h | 410 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) {
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/PBQP/ |
| Graph.h | 410 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) {
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/CodeGen/PBQP/ |
| Graph.h | 410 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) {
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/PBQP/ |
| Graph.h | 410 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) {
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/CodeGen/PBQP/ |
| Graph.h | 410 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) {
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/PBQP/ |
| Graph.h | 410 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) {
|
