1/* 2 * Copyright (c) 2008, 2015, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24package com.sun.hotspot.igv.data; 25 26/** 27 * 28 * @author Thomas Wuerthinger 29 */ 30public class InputBlockEdge { 31 32 public enum State { 33 SAME, 34 NEW, 35 DELETED 36 } 37 38 private InputBlock from; 39 private InputBlock to; 40 private State state = State.SAME; 41 42 public InputBlockEdge(InputBlock from, InputBlock to) { 43 assert from != null; 44 assert to != null; 45 this.from = from; 46 this.to = to; 47 } 48 49 public InputBlock getFrom() { 50 return from; 51 } 52 53 public InputBlock getTo() { 54 return to; 55 } 56 57 public State getState() { 58 return state; 59 } 60 61 public void setState(State state) { 62 this.state = state; 63 } 64 65 @Override 66 public boolean equals(Object obj) { 67 if (obj != null && obj instanceof InputBlockEdge) { 68 InputBlockEdge e = (InputBlockEdge) obj; 69 return e.from.equals(from) && e.to.equals(to); 70 } 71 return false; 72 } 73 74 @Override 75 public int hashCode() { 76 int hash = from.hashCode(); 77 hash = 59 * hash + to.hashCode(); 78 return hash; 79 } 80} 81