Mercurial > hg > graal-compiler
view graal/GraalCompiler/src/com/sun/c1x/util/BitMap2D.java @ 2616:3558ca7088c0
FrameState and Graphviz changes:
* removed popx, pushx methods from GraphBuilder
* FrameState subclass of Value
* added String shortName() to Node
* added GraphvizPrinter option to use short names
* small hack in GraphvizPrinter: omit FrameState->Local connections
* added GraalGraphviz to implicit classpatch (read from GRAAL env var)
author | Lukas Stadler <lukas.stadler@jku.at> |
---|---|
date | Mon, 09 May 2011 17:00:25 +0200 |
parents | 16b9a8b5ad39 |
children | 2ac7b30b7290 |
line wrap: on
line source
/* * Copyright (c) 2009, 2011, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.sun.c1x.util; import com.sun.cri.ci.*; /** * This class implements a two-dimensional bitmap. * * @author Marcelo Cintra * @author Thomas Wuerthinger */ public final class BitMap2D { private CiBitMap map; private final int bitsPerSlot; private int bitIndex(int slotIndex, int bitWithinSlotIndex) { return slotIndex * bitsPerSlot + bitWithinSlotIndex; } private boolean verifyBitWithinSlotIndex(int index) { return index < bitsPerSlot; } public BitMap2D(int sizeInSlots, int bitsPerSlot) { map = new CiBitMap(sizeInSlots * bitsPerSlot); this.bitsPerSlot = bitsPerSlot; } public int sizeInBits() { return map.size(); } // Returns number of full slots that have been allocated public int sizeInSlots() { return map.size() / bitsPerSlot; } public boolean isValidIndex(int slotIndex, int bitWithinSlotIndex) { assert verifyBitWithinSlotIndex(bitWithinSlotIndex); return (bitIndex(slotIndex, bitWithinSlotIndex) < sizeInBits()); } public boolean at(int slotIndex, int bitWithinSlotIndex) { assert verifyBitWithinSlotIndex(bitWithinSlotIndex); return map.get(bitIndex(slotIndex, bitWithinSlotIndex)); } public void setBit(int slotIndex, int bitWithinSlotIndex) { assert verifyBitWithinSlotIndex(bitWithinSlotIndex); map.set(bitIndex(slotIndex, bitWithinSlotIndex)); } public void clearBit(int slotIndex, int bitWithinSlotIndex) { assert verifyBitWithinSlotIndex(bitWithinSlotIndex); map.clear(bitIndex(slotIndex, bitWithinSlotIndex)); } public void atPutGrow(int slotIndex, int bitWithinSlotIndex, boolean value) { int size = sizeInSlots(); if (size <= slotIndex) { while (size <= slotIndex) { size *= 2; } CiBitMap newBitMap = new CiBitMap(size * bitsPerSlot); newBitMap.setUnion(map); map = newBitMap; } if (value) { setBit(slotIndex, bitWithinSlotIndex); } else { clearBit(slotIndex, bitWithinSlotIndex); } } public void clear() { map.clearAll(); } }