/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Bytecodes/src/com/sun/hotspot/igv/bytecodes/ |
H A D | SelectBytecodesCookie.java | 44 public Set<InputNode> getNodes() { method in class:SelectBytecodesCookie
|
H A D | SelectBytecodesAction.java | 43 p.setSelectedNodes(c.getNodes());
|
H A D | BytecodeNode.java | 57 Properties.PropertySelector<InputNode> selector = new Properties.PropertySelector<InputNode>(graph.getNodes());
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/FilterWindow/src/com/sun/hotspot/igv/filterwindow/ |
H A D | CheckNodeListModel.java | 44 return (CheckNode) rootNode.getChildren().getNodes()[index];
|
/openjdk7/hotspot/src/share/tools/LogCompilation/src/com/sun/hotspot/tools/compiler/ |
H A D | Phase.java | 42 int getNodes() { method in class:Phase
|
H A D | LogCompilation.java | 139 phaseNodes.put(phase.getName(), Integer.valueOf(v2.intValue() + phase.getNodes())); 144 out.printf("\t%s %6.4f %d %d %d %d\n", phase.getName(), phase.getElapsedTime(), phase.getStartNodes(), phase.getNodes(), phase.getStartLiveNodes(), phase.getLiveNodes());
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/ |
H A D | InputGraph.java | 69 for (InputNode n : last.getNodes()) { 85 for (InputNode n : b.getNodes()) { 91 for (InputNode n : this.getNodes()) { 98 if (noBlock.getNodes().size() != 0) { 105 for (InputNode n : this.getNodes()) { 160 public Collection<InputNode> getNodes() { method in class:InputGraph 222 for (InputNode n : b.getNodes()) {
|
H A D | InputBlock.java | 80 public List<InputNode> getNodes() { method in class:InputBlock
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | Graph.java | 82 public Collection<Node<N, E>> getNodes() { method in class:Graph 118 for (Node<N, E> n : getNodes()) { 131 for (Node<N, E> n : getNodes()) { 149 for (Node<N, E> n : getNodes()) { 198 traverseDFS(getNodes(), tv); 203 for (Node<N, E> n : getNodes()) { 240 for (Node<N, E> n : getNodes()) { 246 for (Node<N, E> n : getNodes()) { 284 for (Node<N, E> n : getNodes()) {
|
H A D | OldHierarchicalLayoutManager.java | 451 for (Node<NodeData, EdgeData> n : graph.getNodes()) { 469 for (Node<NodeData, EdgeData> n : graph.getNodes()) { 497 //for(Node<NodeData, EdgeData> n : graph.getNodes()) { 508 for (Node<NodeData, EdgeData> n : graph.getNodes()) { 539 for (Node<NodeData, EdgeData> n : graph.getNodes()) { 547 for (Node<NodeData, EdgeData> n : graph.getNodes()) { 671 List<Node<NodeData, EdgeData>> nodes = new ArrayList<Node<NodeData, EdgeData>>(graph.getNodes()); 809 for (Node<NodeData, EdgeData> n : graph.getNodes()) { 813 for (Node<NodeData, EdgeData> n : graph.getNodes()) { 1159 for (Node<NodeData, EdgeData> n : graph.getNodes()) { [all...] |
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/ |
H A D | Difference.java | 64 for (InputNode n : b.getNodes()) { 72 for (InputNode n : a.getNodes()) { 94 Set<InputNode> nodesA = new HashSet<InputNode>(a.getNodes()); 95 Set<InputNode> nodesB = new HashSet<InputNode>(b.getNodes()); 226 for (InputNode n : a.getNodes()) { 231 for (InputNode n2 : b.getNodes()) {
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/serialization/ |
H A D | Printer.java | 97 for (InputNode n : previous.getNodes()) { 114 for (InputNode n : graph.getNodes()) { 166 for (InputNode n : b.getNodes()) {
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ControlFlow/src/com/sun/hotspot/igv/controlflow/ |
H A D | ControlFlowScene.java | 100 ArrayList<InputBlock> blocks = new ArrayList<InputBlock>(this.getNodes()); 148 inputNodes.addAll(w.getBlock().getNodes()); 239 for (InputBlock b : this.getNodes()) {
|
H A D | HierarchicalGraphLayout.java | 145 for (N node : graph.getNodes()) {
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/ |
H A D | ServerCompilerScheduler.java | 190 Collection<InputNode> tmpNodes = new ArrayList<InputNode>(graph.getNodes()); 210 for (InputNode n : graph.getNodes()) { 554 for (InputNode n : graph.getNodes()) {
|
/openjdk7/jdk/test/javax/management/mxbean/ |
H A D | MerlinMXBean.java | 351 public NodeMXBean[] getNodes(); method in interface:MerlinMXBean.GraphMXBean 361 public NodeMXBean[] getNodes() { method in class:MerlinMXBean.Graph
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Graph/src/com/sun/hotspot/igv/graph/ |
H A D | Diagram.java | 128 Collection<InputNode> nodes = graph.getNodes();
|