001: /***
002: * ASM: a very small and fast Java bytecode manipulation framework
003: * Copyright (c) 2000-2005 INRIA, France Telecom
004: * All rights reserved.
005: *
006: * Redistribution and use in source and binary forms, with or without
007: * modification, are permitted provided that the following conditions
008: * are met:
009: * 1. Redistributions of source code must retain the above copyright
010: * notice, this list of conditions and the following disclaimer.
011: * 2. Redistributions in binary form must reproduce the above copyright
012: * notice, this list of conditions and the following disclaimer in the
013: * documentation and/or other materials provided with the distribution.
014: * 3. Neither the name of the copyright holders nor the names of its
015: * contributors may be used to endorse or promote products derived from
016: * this software without specific prior written permission.
017: *
018: * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
019: * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
020: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
021: * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
022: * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
023: * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
024: * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
025: * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
026: * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
027: * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
028: * THE POSSIBILITY OF SUCH DAMAGE.
029: */package com.tc.asm.tree.analysis;
030:
031: import com.tc.asm.Type;
032:
033: /**
034: * A {@link Value} that is represented by its type in a seven types type system.
035: * This type system distinguishes the UNINITIALZED, INT, FLOAT, LONG, DOUBLE,
036: * REFERENCE and RETURNADDRESS types.
037: *
038: * @author Eric Bruneton
039: */
040: public class BasicValue implements Value {
041:
042: public final static Value UNINITIALIZED_VALUE = new BasicValue(null);
043:
044: public final static Value INT_VALUE = new BasicValue(Type.INT_TYPE);
045:
046: public final static Value FLOAT_VALUE = new BasicValue(
047: Type.FLOAT_TYPE);
048:
049: public final static Value LONG_VALUE = new BasicValue(
050: Type.LONG_TYPE);
051:
052: public final static Value DOUBLE_VALUE = new BasicValue(
053: Type.DOUBLE_TYPE);
054:
055: public final static Value REFERENCE_VALUE = new BasicValue(Type
056: .getObjectType("java/lang/Object"));
057:
058: public final static Value RETURNADDRESS_VALUE = new BasicValue(null);
059:
060: private Type type;
061:
062: public BasicValue(final Type type) {
063: this .type = type;
064: }
065:
066: public Type getType() {
067: return type;
068: }
069:
070: public int getSize() {
071: return type == Type.LONG_TYPE || type == Type.DOUBLE_TYPE ? 2
072: : 1;
073: }
074:
075: public boolean isReference() {
076: return type != null
077: && (type.getSort() == Type.OBJECT || type.getSort() == Type.ARRAY);
078: }
079:
080: public boolean equals(final Object value) {
081: if (value == this ) {
082: return true;
083: } else if (value instanceof BasicValue) {
084: if (type == null) {
085: return ((BasicValue) value).type == null;
086: } else {
087: return type.equals(((BasicValue) value).type);
088: }
089: } else {
090: return false;
091: }
092: }
093:
094: public int hashCode() {
095: return type == null ? 0 : type.hashCode();
096: }
097:
098: public String toString() {
099: if (this == UNINITIALIZED_VALUE) {
100: return ".";
101: } else if (this == RETURNADDRESS_VALUE) {
102: return "A";
103: } else if (this == REFERENCE_VALUE) {
104: return "R";
105: } else {
106: return type.getDescriptor();
107: }
108: }
109: }
|