Searched refs:graph (Results 1 - 25 of 72) sorted by relevance

123

/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Layout/src/com/sun/hotspot/igv/layout/
H A DLayoutManager.java34 public void doLayout(LayoutGraph graph); argument
36 public void doLayout(LayoutGraph graph, Set<? extends Vertex> firstLayerHint, Set<? extends Vertex> lastLayerHint, Set<? extends Link> importantLinks); argument
38 public void doRouting(LayoutGraph graph); argument
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Bytecodes/src/com/sun/hotspot/igv/bytecodes/
H A DMethodNode.java44 private InputGraph graph; field in class:MethodNode.MethodNodeChildren
47 public MethodNodeChildren(InputMethod method, InputGraph graph, String bciString) { argument
50 this.graph = graph;
57 return new Node[]{new BytecodeNode(bc, graph, bciString)};
59 return new Node[]{new BytecodeNode(bc, graph, bciString), new MethodNode(bc.getInlined(), graph, bc.getBci() + " " + bciString)};
70 public void setMethod(InputMethod method, InputGraph graph) { argument
72 this.graph = graph;
78 MethodNode(InputMethod method, InputGraph graph, String bciString) argument
95 update(InputGraph graph, InputMethod method) argument
[all...]
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/orbutil/graph/
H A DNode.java26 package com.sun.corba.se.impl.orbutil.graph ;
30 /** Node in a graph.
H A DGraph.java26 package com.sun.corba.se.impl.orbutil.graph ;
H A DNodeData.java26 package com.sun.corba.se.impl.orbutil.graph ;
28 /** Data about a node in a graph.
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Graph/src/com/sun/hotspot/igv/graph/
H A DSelector.java24 package com.sun.hotspot.igv.graph;
H A DDiagram.java24 package com.sun.hotspot.igv.graph;
51 private InputGraph graph; field in class:Diagram
76 graph.schedule(newBlocks);
82 for (InputBlock b : graph.getBlocks()) {
89 return Diagram.createDiagram(graph.getNext(), nodeText);
97 return Diagram.createDiagram(graph.getPrev(), nodeText);
117 public static Diagram createDiagram(InputGraph graph, String nodeText) { argument
118 if (graph == null) {
123 d.graph = graph;
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/
H A DGraphViewerImplementation.java28 import com.sun.hotspot.igv.graph.Diagram;
37 public void view(InputGraph graph) { argument
38 Diagram diagram = Diagram.createDiagram(graph, Settings.get().get(Settings.NODE_TEXT, Settings.NODE_TEXT_DEFAULT));
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ControlFlow/src/com/sun/hotspot/igv/controlflow/
H A DHierarchicalGraphLayout.java41 import org.netbeans.api.visual.graph.layout.GraphLayout;
42 import org.netbeans.api.visual.graph.layout.UniversalGraph;
84 private UniversalGraph<N, E> graph; field in class:HierarchicalGraphLayout.VertexWrapper
88 public VertexWrapper(N node, UniversalGraph<N, E> graph) { argument
90 this.graph = graph;
103 Widget w = graph.getScene().findWidget(node);
112 Widget w = graph.getScene().findWidget(node);
121 HierarchicalGraphLayout.this.setResolvedNodeLocation(graph, node, p);
139 protected void performGraphLayout(UniversalGraph<N, E> graph) { argument
164 performNodesLayout(UniversalGraph<N, E> graph, Collection<N> nodes) argument
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/services/
H A DGraphViewer.java34 public void view(InputGraph graph); argument
H A DScheduler.java37 public Collection<InputBlock> schedule(InputGraph graph); argument
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Filter/src/com/sun/hotspot/igv/filter/
H A DScriptEngineAbstraction.java27 import com.sun.hotspot.igv.graph.Diagram;
H A DSplitFilter.java26 import com.sun.hotspot.igv.graph.Connection;
27 import com.sun.hotspot.igv.graph.Diagram;
28 import com.sun.hotspot.igv.graph.Figure;
29 import com.sun.hotspot.igv.graph.InputSlot;
30 import com.sun.hotspot.igv.graph.OutputSlot;
31 import com.sun.hotspot.igv.graph.Selector;
H A DRemoveSelfLoopsFilter.java26 import com.sun.hotspot.igv.graph.Connection;
27 import com.sun.hotspot.igv.graph.Diagram;
28 import com.sun.hotspot.igv.graph.Figure;
29 import com.sun.hotspot.igv.graph.InputSlot;
30 import com.sun.hotspot.igv.graph.OutputSlot;
H A DNullScriptEngine.java26 import com.sun.hotspot.igv.graph.Diagram;
H A DConnectionFilter.java26 import com.sun.hotspot.igv.graph.Connection;
27 import com.sun.hotspot.igv.graph.Diagram;
28 import com.sun.hotspot.igv.graph.Figure;
29 import com.sun.hotspot.igv.graph.OutputSlot;
30 import com.sun.hotspot.igv.graph.Selector;
H A DColorFilter.java26 import com.sun.hotspot.igv.graph.Connection;
27 import com.sun.hotspot.igv.graph.Connection.ConnectionStyle;
28 import com.sun.hotspot.igv.graph.Diagram;
29 import com.sun.hotspot.igv.graph.Figure;
30 import com.sun.hotspot.igv.graph.OutputSlot;
31 import com.sun.hotspot.igv.graph.Selector;
H A Dhelper.js33 f.apply(graph);
39 f.apply(graph);
44 f.apply(graph);
56 f.apply(graph);
H A DRemoveInputsFilter.java26 import com.sun.hotspot.igv.graph.Connection;
27 import com.sun.hotspot.igv.graph.Diagram;
28 import com.sun.hotspot.igv.graph.Figure;
29 import com.sun.hotspot.igv.graph.InputSlot;
30 import com.sun.hotspot.igv.graph.OutputSlot;
31 import com.sun.hotspot.igv.graph.Selector;
H A DFilter.java29 import com.sun.hotspot.igv.graph.Diagram;
H A DRemoveFilter.java26 import com.sun.hotspot.igv.graph.Diagram;
27 import com.sun.hotspot.igv.graph.Figure;
28 import com.sun.hotspot.igv.graph.InputSlot;
29 import com.sun.hotspot.igv.graph.Selector;
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Coordinator/src/com/sun/hotspot/igv/coordinator/
H A DGraphNode.java52 private InputGraph graph; field in class:GraphNode
55 public GraphNode(InputGraph graph) { argument
56 this(graph, new InstanceContent());
59 private GraphNode(final InputGraph graph, InstanceContent content) { argument
61 this.graph = graph;
62 this.setDisplayName(graph.getName());
63 content.add(graph);
68 // Action for opening the graph
72 viewer.view(graph);
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/
H A DInputBlock.java42 private InputGraph graph; field in class:InputBlock
49 public InputBlock(InputGraph graph, String name) { argument
50 this.graph = graph;
85 InputNode n = graph.getNode(id);
87 graph.setBlock(n, this);
88 addNode(graph.getNode(id));
119 InputBlock b = graph.getBlock(s);
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DNode.java42 private Graph<N, E> graph; field in class:Node
90 protected Node(Graph<N, E> graph, N data) { argument
92 this.graph = graph;
102 return graph;
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/serialization/
H A DPrinter.java79 for (InputGraph graph : g.getGraphs()) {
80 export(writer, graph, previous, true);
81 previous = graph;
87 public void export(XMLWriter writer, InputGraph graph, InputGraph previous, boolean difference) throws IOException { argument
90 writer.writeProperties(graph.getProperties());
99 InputNode n2 = graph.getNode(id);
114 for (InputNode n : graph.getNodes()) {
130 if (graph.getEdges().contains(e)) {
144 for (InputEdge e : graph.getEdges()) {
155 for (InputBlock b : graph
[all...]

Completed in 3621 milliseconds

123