Mercurial > hg > graal-jvmci-8

comparison graal/GraalCompiler/src/com/sun/c1x/util/BitMap2D.java @ 2509:16b9a8b5ad39

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Renamings Runtime=>GraalRuntime and Compiler=>GraalCompiler
author Thomas Wuerthinger <thomas@wuerthinger.net>
date Wed, 27 Apr 2011 11:50:44 +0200
parents graal/Compiler/src/com/sun/c1x/util/BitMap2D.java@9ec15d6914ca
children 2ac7b30b7290
comparison
equal deleted inserted replaced
2508:fea94949e0a2 2509:16b9a8b5ad39
1 /*
2 * Copyright (c) 2009, 2011, 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 package com.sun.c1x.util;
24
25 import com.sun.cri.ci.*;
26
27 /**
28 * This class implements a two-dimensional bitmap.
29 *
30 * @author Marcelo Cintra
31 * @author Thomas Wuerthinger
32 */
33 public final class BitMap2D {
34
35 private CiBitMap map;
36 private final int bitsPerSlot;
37
38 private int bitIndex(int slotIndex, int bitWithinSlotIndex) {
39 return slotIndex * bitsPerSlot + bitWithinSlotIndex;
40 }
41
42 private boolean verifyBitWithinSlotIndex(int index) {
43 return index < bitsPerSlot;
44 }
45
46 public BitMap2D(int sizeInSlots, int bitsPerSlot) {
47 map = new CiBitMap(sizeInSlots * bitsPerSlot);
48 this.bitsPerSlot = bitsPerSlot;
49 }
50
51 public int sizeInBits() {
52 return map.size();
53 }
54
55 // Returns number of full slots that have been allocated
56 public int sizeInSlots() {
57 return map.size() / bitsPerSlot;
58 }
59
60 public boolean isValidIndex(int slotIndex, int bitWithinSlotIndex) {
61 assert verifyBitWithinSlotIndex(bitWithinSlotIndex);
62 return (bitIndex(slotIndex, bitWithinSlotIndex) < sizeInBits());
63 }
64
65 public boolean at(int slotIndex, int bitWithinSlotIndex) {
66 assert verifyBitWithinSlotIndex(bitWithinSlotIndex);
67 return map.get(bitIndex(slotIndex, bitWithinSlotIndex));
68 }
69
70 public void setBit(int slotIndex, int bitWithinSlotIndex) {
71 assert verifyBitWithinSlotIndex(bitWithinSlotIndex);
72 map.set(bitIndex(slotIndex, bitWithinSlotIndex));
73 }
74
75 public void clearBit(int slotIndex, int bitWithinSlotIndex) {
76 assert verifyBitWithinSlotIndex(bitWithinSlotIndex);
77 map.clear(bitIndex(slotIndex, bitWithinSlotIndex));
78 }
79
80 public void atPutGrow(int slotIndex, int bitWithinSlotIndex, boolean value) {
81 int size = sizeInSlots();
82 if (size <= slotIndex) {
83 while (size <= slotIndex) {
84 size *= 2;
85 }
86 CiBitMap newBitMap = new CiBitMap(size * bitsPerSlot);
87 newBitMap.setUnion(map);
88 map = newBitMap;
89 }
90
91 if (value) {
92 setBit(slotIndex, bitWithinSlotIndex);
93 } else {
94 clearBit(slotIndex, bitWithinSlotIndex);
95 }
96 }
97
98 public void clear() {
99 map.clearAll();
100 }
101 }