| /openjdk9/hotspot/src/share/tools/IdealGraphVisualizer/Data/test/unit/src/com/sun/hotspot/igv/data/serialization/ |
| H A D | ParserTest.java | 123 graph.addEdge(new InputEdge((char)0, (char)0, 0, 1));
126 graph.addEdge(new InputEdge((char)1, (char)1, 0, 1));
129 graph.addEdge(new InputEdge((char)0, (char)0, 1, 2));
132 graph.addEdge(new InputEdge((char)0, (char)0, 2, 3));
179 graph.addEdge(e1);
180 graph.addEdge(e2);
202 graph.addEdge(e1);
203 graph.addEdge(e2);
211 graph2.addEdge(e3);
|
| /openjdk9/hotspot/src/share/tools/IdealGraphVisualizer/Data/test/unit/src/com/sun/hotspot/igv/data/ |
| H A D | InputGraphTest.java | 81 referenceGraph.addEdge(E12);
82 referenceGraph.addEdge(E13);
83 referenceGraph.addEdge(E24);
84 referenceGraph.addEdge(E34);
85 referenceGraph.addEdge(E54);
|
| /openjdk9/langtools/src/jdk.jdeps/share/classes/com/sun/tools/jdeps/ |
| H A D | ModuleGraphBuilder.java | 97 builder.addEdge(m, v);
112 builder.addEdge(from, m);
|
| H A D | Graph.java | 84 .forEach(v -> builder.addEdge(u, v));
111 .forEach(v -> builder.addEdge(u, v));
118 .forEach(v -> builder.addEdge(u, v)));
155 .forEach(v -> builder.addEdge(v, u));
280 public void addEdge(T u, T v) { method in class:Graph.Builder
|
| H A D | DepsAnalyzer.java | 352 .forEach(v -> builder.addEdge(u, v));
370 .forEach(d -> addEdge(builder, d));
374 private void addEdge(Graph.Builder<Node> builder, Analyzer.Dep dep) { method in class:DepsAnalyzer
405 builder.addEdge(u, v);
|
| H A D | InverseDepsAnalyzer.java | 150 .forEach(v -> builder.addEdge(v.get(), m));
159 e.getValue().forEach(v -> builder.addEdge(v, u));
|
| H A D | ModuleDotGraph.java | 135 .forEach(target -> builder.addEdge(mn, target));
168 builder.addEdge(mn, d);
|
| H A D | ModuleAnalyzer.java | 171 .forEach(m -> rpBuilder.addEdge(root, m));
179 .forEach(m -> gb.addEdge(root, m));
|
| H A D | ModuleExportsAnalyzer.java | 131 .forEach(m -> builder.addEdge(root, m));
|
| /openjdk9/jdk/src/java.desktop/share/classes/javax/imageio/spi/ |
| H A D | DigraphNode.java | 89 public boolean addEdge(DigraphNode<E> node) { method in class:DigraphNode
|
| H A D | PartiallyOrderedSet.java | 135 return firstPONode.addEdge(secondPONode);
|
| /openjdk9/jdk/src/java.base/share/classes/jdk/internal/module/ |
| H A D | ModuleHashesBuilder.java | 91 builder.addEdge(rm.name(), dm.name());
201 .forEach(v -> builder.addEdge(v, u));
252 public void addEdge(T u, T v) { method in class:ModuleHashesBuilder.Graph.Builder
|
| /openjdk9/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/ |
| H A D | InputGraph.java | 152 this.addEdge(edge);
243 public void addEdge(InputEdge c) { method in class:InputGraph
|
| /openjdk9/hotspot/src/share/tools/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/ |
| H A D | Difference.java | 218 graph.addEdge(newEdge);
238 graph.addEdge(newEdge);
244 graph.addEdge(newEdge);
|
| /openjdk9/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/ir/debug/ |
| H A D | NashornTextifier.java | 574 graph.addEdge(currentBlock, to);
607 graph.addEdge(currentBlock, name);
644 graph.addEdge(currentBlock, to);
660 graph.addEdge(currentBlock, to);
665 graph.addEdge(currentBlock, to);
1034 void addEdge(final String from, final String to) { method in class:NashornTextifier.Graph
1051 addEdge(tryNode, catchNode);
|
| /openjdk9/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/serialization/ |
| H A D | Parser.java | 221 curGraph.addEdge(e);
429 getParentObject().addEdge(conn);
|
| H A D | BinaryParser.java | 852 graph.addEdge(InputEdge.createImmutable(fromIndex, toIndex, e.from, e.to, e.label, e.type));
858 graph.addEdge(InputEdge.createImmutable(fromIndex, toIndex, e.from, e.to, e.label, e.type));
|
| /openjdk9/hotspot/src/share/tools/IdealGraphVisualizer/ControlFlow/src/com/sun/hotspot/igv/controlflow/ |
| H A D | ControlFlowScene.java | 113 addEdge(e);
|