1 /*** 2 * ASM: a very small and fast Java bytecode manipulation framework 3 * Copyright (c) 2000-2005 INRIA, France Telecom 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions 8 * are met: 9 * 1. Redistributions of source code must retain the above copyright 10 * notice, this list of conditions and the following disclaimer. 11 * 2. Redistributions in binary form must reproduce the above copyright 12 * notice, this list of conditions and the following disclaimer in the 13 * documentation and/or other materials provided with the distribution. 14 * 3. Neither the name of the copyright holders nor the names of its 15 * contributors may be used to endorse or promote products derived from 16 * this software without specific prior written permission. 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 19 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 22 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 23 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 24 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 25 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 26 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 27 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF 28 * THE POSSIBILITY OF SUCH DAMAGE. 29 */ 30 package org.objectweb.asm.tree.analysis; 31 32 /** 33 * A fixed size map of integer values. 34 * 35 * @author Eric Bruneton 36 */ 37 class IntMap { 38 39 private int size; 40 41 private Object[] keys; 42 43 private int[] values; 44 IntMap(final int size)45 public IntMap(final int size) { 46 this.size = size; 47 this.keys = new Object[size]; 48 this.values = new int[size]; 49 } 50 get(final Object key)51 public int get(final Object key) { 52 int n = size; 53 int h = (key.hashCode() & 0x7FFFFFFF) % n; 54 int i = h; 55 while (keys[i] != key) { 56 i = (i + 1) % n; 57 if (i == h) { 58 throw new RuntimeException("Cannot find index of " + key); 59 } 60 } 61 return values[i]; 62 } 63 put(final Object key, final int value)64 public void put(final Object key, final int value) { 65 int n = size; 66 int i = (key.hashCode() & 0x7FFFFFFF) % n; 67 while (keys[i] != null) { 68 i = (i + 1) % n; 69 } 70 keys[i] = key; 71 values[i] = value; 72 } 73 }