/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/orbutil/graph/ |
H A D | Graph.java | 26 package com.sun.corba.se.impl.orbutil.graph ;
|
H A D | Node.java | 26 package com.sun.corba.se.impl.orbutil.graph ; 30 /** Node in a graph.
|
H A D | GraphImpl.java | 26 package com.sun.corba.se.impl.orbutil.graph ; 104 void visit( Graph graph, Node node, NodeData nd ) ; argument 107 // This visits every node in the graph exactly once. A 108 // visitor is allowed to modify the graph during the 121 // problem with iterator if the visitor is updating the graph. 125 // Visit each node in the graph that has not already been visited. 147 public void visit( Graph graph, Node node, NodeData nd ) 153 // Make sure the child is in the graph so it can be 155 graph.add( child ) ; 158 NodeData cnd = graph [all...] |
H A D | NodeData.java | 26 package com.sun.corba.se.impl.orbutil.graph ; 28 /** Data about a node in a graph.
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/services/ |
H A D | GraphViewer.java | 34 public void view(InputGraph graph); argument
|
H A D | Scheduler.java | 37 public Collection<InputBlock> schedule(InputGraph graph); argument
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Graph/src/com/sun/hotspot/igv/graph/ |
H A D | InvertSelector.java | 24 package com.sun.hotspot.igv.graph;
|
H A D | MatcherSelector.java | 24 package com.sun.hotspot.igv.graph;
|
H A D | PredecessorSelector.java | 24 package com.sun.hotspot.igv.graph;
|
H A D | Selector.java | 24 package com.sun.hotspot.igv.graph;
|
H A D | SuccessorSelector.java | 24 package com.sun.hotspot.igv.graph;
|
H A D | AndSelector.java | 24 package com.sun.hotspot.igv.graph;
|
H A D | InputSlot.java | 24 package com.sun.hotspot.igv.graph;
|
H A D | OrSelector.java | 24 package com.sun.hotspot.igv.graph;
|
H A D | OutputSlot.java | 24 package com.sun.hotspot.igv.graph;
|
H A D | Diagram.java | 24 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...] |
H A D | Block.java | 24 package com.sun.hotspot.igv.graph;
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/ |
H A D | GraphViewerImplementation.java | 28 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/Layout/src/com/sun/hotspot/igv/layout/ |
H A D | LayoutManager.java | 34 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 D | BytecodeNode.java | 49 public BytecodeNode(InputBytecode bytecode, InputGraph graph, String bciValue) { argument 57 Properties.PropertySelector<InputNode> selector = new Properties.PropertySelector<InputNode>(graph.getNodes());
|
H A D | MethodNode.java | 44 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/hotspot/src/share/tools/IdealGraphVisualizer/Coordinator/src/com/sun/hotspot/igv/coordinator/ |
H A D | GraphNode.java | 52 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/serialization/ |
H A D | Printer.java | 79 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...] |
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | Edge.java | 36 protected Edge(Graph<N, E> graph, Node<N, E> source, Node<N, E> dest, E data) { argument
|
H A D | HierarchicalClusterLayoutManager.java | 56 public void doLayout(LayoutGraph graph) { argument 57 doLayout(graph, new HashSet<Vertex>(), new HashSet<Vertex>(), new HashSet<Link>()); 68 public void doLayout(LayoutGraph graph, Set<? extends Vertex> firstLayerHint, Set<? extends Vertex> lastLayerHint, Set<? extends Link> importantLinks) { argument 70 assert graph.verify(); 87 Set<Cluster> cluster = graph.getClusters(); 117 for (Vertex v : graph.getVertices()) { 123 for (Link l : graph.getLinks()) { 223 for (Link l : graph.getLinks()) { 245 public void doRouting(LayoutGraph graph) { argument
|