Mercurial > hg > graal-compiler
view src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/InputBlock.java @ 1552:c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
Summary: Change all the Sun copyrights to Oracle copyright
Reviewed-by: ohair
author | trims |
---|---|
date | Thu, 27 May 2010 19:08:38 -0700 |
parents | 30369db7f5d2 |
children | 53ddfe305645 |
line wrap: on
line source
/* * Copyright (c) 2008, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. * */ package com.sun.hotspot.igv.data; import java.awt.Rectangle; import java.util.ArrayList; import java.util.Collections; import java.util.HashSet; import java.util.List; import java.util.Set; /** * * @author Thomas Wuerthinger */ public class InputBlock { private List<InputNode> nodes; private List<String> successorNames; private String name; private InputGraph graph; private Rectangle bounds; private Set<InputBlock> successors; private Set<InputBlock> predecessors; private Set<InputBlockEdge> inputs; private Set<InputBlockEdge> outputs; public InputBlock(InputGraph graph, String name) { this.graph = graph; this.name = name; nodes = new ArrayList<InputNode>(); successorNames = new ArrayList<String>(); successors = new HashSet<InputBlock>(); predecessors = new HashSet<InputBlock>(); inputs = new HashSet<InputBlockEdge>(); outputs = new HashSet<InputBlockEdge>(); } public void removeSuccessor(InputBlock b) { if (successors.contains(b)) { successors.remove(b); b.predecessors.remove(this); InputBlockEdge e = new InputBlockEdge(this, b); assert outputs.contains(e); outputs.remove(e); assert b.inputs.contains(e); b.inputs.remove(e); } } public String getName() { return name; } public void setName(String s) { name = s; } public List<InputNode> getNodes() { return Collections.unmodifiableList(nodes); } public void addNode(int id) { InputNode n = graph.getNode(id); assert n != null; graph.setBlock(n, this); addNode(graph.getNode(id)); } public void addNode(InputNode node) { assert !nodes.contains(node); nodes.add(node); } public Set<InputBlock> getPredecessors() { return Collections.unmodifiableSet(predecessors); } public Set<InputBlock> getSuccessors() { return Collections.unmodifiableSet(successors); } public Set<InputBlockEdge> getInputs() { return Collections.unmodifiableSet(inputs); } public Set<InputBlockEdge> getOutputs() { return Collections.unmodifiableSet(outputs); } // resolveBlockLinks must be called afterwards public void addSuccessor(String name) { successorNames.add(name); } public void resolveBlockLinks() { for (String s : successorNames) { InputBlock b = graph.getBlock(s); addSuccessor(b); } successorNames.clear(); } public void addSuccessor(InputBlock b) { if (!successors.contains(b)) { successors.add(b); b.predecessors.add(this); InputBlockEdge e = new InputBlockEdge(this, b); outputs.add(e); b.inputs.add(e); } } @Override public String toString() { return this.getName(); } }