001: /*
002: * Copyright 1994-2003 Sun Microsystems, Inc. All Rights Reserved.
003: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
004: *
005: * This code is free software; you can redistribute it and/or modify it
006: * under the terms of the GNU General Public License version 2 only, as
007: * published by the Free Software Foundation. Sun designates this
008: * particular file as subject to the "Classpath" exception as provided
009: * by Sun in the LICENSE file that accompanied this code.
010: *
011: * This code is distributed in the hope that it will be useful, but WITHOUT
012: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
013: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
014: * version 2 for more details (a copy is included in the LICENSE file that
015: * accompanied this code).
016: *
017: * You should have received a copy of the GNU General Public License version
018: * 2 along with this work; if not, write to the Free Software Foundation,
019: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
020: *
021: * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
022: * CA 95054 USA or visit www.sun.com if you need additional information or
023: * have any questions.
024: */
025:
026: package sun.tools.asm;
027:
028: import sun.tools.java.*;
029: import java.util.Hashtable;
030: import java.util.Enumeration;
031: import java.util.Arrays;
032:
033: /**
034: * WARNING: The contents of this source file are not part of any
035: * supported API. Code that depends on them does so at its own risk:
036: * they are subject to change or removal without notice.
037: */
038: public final class SwitchData {
039: int minValue, maxValue;
040: Label defaultLabel = new Label();
041: Hashtable tab = new Hashtable();
042: // JCOV
043: Hashtable whereCaseTab = null;
044:
045: // end JCOV
046:
047: /**
048: * Get a label
049: */
050: public Label get(int n) {
051: return (Label) tab.get(new Integer(n));
052: }
053:
054: /**
055: * Get a label
056: */
057: public Label get(Integer n) {
058: return (Label) tab.get(n);
059: }
060:
061: /**
062: * Add a label
063: */
064: public void add(int n, Label lbl) {
065: if (tab.size() == 0) {
066: minValue = n;
067: maxValue = n;
068: } else {
069: if (n < minValue) {
070: minValue = n;
071: }
072: if (n > maxValue) {
073: maxValue = n;
074: }
075: }
076: tab.put(new Integer(n), lbl);
077: }
078:
079: /**
080: * Get the default label
081: */
082: public Label getDefaultLabel() {
083: return defaultLabel;
084: }
085:
086: /**
087: * Return the keys of this enumaration sorted in ascending order
088: */
089: public synchronized Enumeration sortedKeys() {
090: return new SwitchDataEnumeration(tab);
091: }
092:
093: // JCOV
094: public void initTableCase() {
095: whereCaseTab = new Hashtable();
096: }
097:
098: public void addTableCase(int index, long where) {
099: if (whereCaseTab != null)
100: whereCaseTab.put(new Integer(index), new Long(where));
101: }
102:
103: public void addTableDefault(long where) {
104: if (whereCaseTab != null)
105: whereCaseTab.put("default", new Long(where));
106: }
107:
108: public long whereCase(Object key) {
109: Long i = (Long) whereCaseTab.get(key);
110: return (i == null) ? 0 : i.longValue();
111: }
112:
113: public boolean getDefault() {
114: return (whereCase("default") != 0);
115: }
116: // end JCOV
117: }
118:
119: class SwitchDataEnumeration implements Enumeration {
120: private Integer table[];
121: private int current_index = 0;
122:
123: /**
124: * Create a new enumeration from the hashtable. Each key in the
125: * hash table will be an Integer, with the value being a label. The
126: * enumeration returns the keys in sorted order.
127: */
128: SwitchDataEnumeration(Hashtable tab) {
129: table = new Integer[tab.size()];
130: int i = 0;
131: for (Enumeration e = tab.keys(); e.hasMoreElements();) {
132: table[i++] = (Integer) e.nextElement();
133: }
134: Arrays.sort(table);
135: current_index = 0;
136: }
137:
138: /**
139: * Are there more keys to return?
140: */
141: public boolean hasMoreElements() {
142: return current_index < table.length;
143: }
144:
145: /**
146: * Return the next key.
147: */
148: public Object nextElement() {
149: return table[current_index++];
150: }
151: }
|