Mercurial > hg > truffle

comparison graal/GraalCompiler/src/com/sun/c1x/util/BitMap2D.java @ 2778:2ac7b30b7290

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Enabled new block finding algorithm.
author Thomas Wuerthinger <thomas@wuerthinger.net>
date Tue, 24 May 2011 21:39:45 +0200
parents 16b9a8b5ad39
children
comparison
equal deleted inserted replaced
2777:3e4d992fd312 2778:2ac7b30b7290
38 private int bitIndex(int slotIndex, int bitWithinSlotIndex) { 38 private int bitIndex(int slotIndex, int bitWithinSlotIndex) {
39 return slotIndex * bitsPerSlot + bitWithinSlotIndex; 39 return slotIndex * bitsPerSlot + bitWithinSlotIndex;
40 } 40 }
41 41
42 private boolean verifyBitWithinSlotIndex(int index) { 42 private boolean verifyBitWithinSlotIndex(int index) {
43 return index < bitsPerSlot; 43 assert index < bitsPerSlot : "index " + index + " is out of bounds " + bitsPerSlot;
44 return true;
44 } 45 }
45 46
46 public BitMap2D(int sizeInSlots, int bitsPerSlot) { 47 public BitMap2D(int sizeInSlots, int bitsPerSlot) {
47 map = new CiBitMap(sizeInSlots * bitsPerSlot); 48 map = new CiBitMap(sizeInSlots * bitsPerSlot);
48 this.bitsPerSlot = bitsPerSlot; 49 this.bitsPerSlot = bitsPerSlot;