/** {@inheritDoc} */ @Override public boolean has(int value) { return (value < Bits.getMax(bits)) && Bits.get(bits, value); }
/** * Sets a bit in the work set, but only if the instruction in question * isn't yet known to be possibly-live. * * @param offset offset to the instruction in question * @param blockStart {@code true} iff this instruction starts a * basic block */ private void addWorkIfNecessary(int offset, boolean blockStart) { if (!Bits.get(liveSet, offset)) { Bits.set(workSet, offset); } if (blockStart) { Bits.set(blockSet, offset); } }
/** {@inheritDoc} */ @Override public boolean has(int value) { return (value < Bits.getMax(bits)) && Bits.get(bits, value); }
/** * Sets a bit in the work set, but only if the instruction in question * isn't yet known to be possibly-live. * * @param offset offset to the instruction in question * @param blockStart {@code true} iff this instruction starts a * basic block */ private void addWorkIfNecessary(int offset, boolean blockStart) { if (!Bits.get(liveSet, offset)) { Bits.set(workSet, offset); } if (blockStart) { Bits.set(blockSet, offset); } }
/** @inheritDoc */ public boolean has(int value) { return (value < Bits.getMax(bits)) && Bits.get(bits, value); }
public void test1_get() { int[] bits = Bits.makeBitSet(100); for (int i = 0; i < 100; i++) { assertFalse(label(i), Bits.get(bits, i)); } }
/** @inheritDoc */ public boolean has(int value) { return (value < Bits.getMax(bits)) && Bits.get(bits, value); }
public void test2_get() { int[] bits = Bits.makeBitSet(100); for (int i = 0; i < bits.length; i++) { bits[i] = -1; } for (int i = 0; i < 100; i++) { assertTrue(label(i), Bits.get(bits, i)); } }
/** {@inheritDoc} */ public boolean has(int value) { return (value < Bits.getMax(bits)) && Bits.get(bits, value); }
public void test1_get() { int[] bits = Bits.makeBitSet(100); for (int i = 0; i < 100; i++) { assertFalse(label(i), Bits.get(bits, i)); } }
/** @inheritDoc */ public boolean has(int value) { return (value < Bits.getMax(bits)) && Bits.get(bits, value); }
public void test2_get() { int[] bits = Bits.makeBitSet(100); for (int i = 0; i < bits.length; i++) { bits[i] = -1; } for (int i = 0; i < 100; i++) { assertTrue(label(i), Bits.get(bits, i)); } }
/** @inheritDoc */ public boolean has(int value) { return (value < Bits.getMax(bits)) && Bits.get(bits, value); }
public void test3_get() { int[] bits = Bits.makeBitSet(100); for (int i = 0; i < 100; i++) { Bits.set(bits, i, (i % 5) == 0); } for (int i = 0; i < 100; i++) { boolean expect = (i % 5) == 0; assertTrue(label(i), Bits.get(bits, i) == expect); } }
/** @inheritDoc */ public boolean has(int value) { return (value < Bits.getMax(bits)) && Bits.get(bits, value); }
public void test3_get() { int[] bits = Bits.makeBitSet(100); for (int i = 0; i < 100; i++) { Bits.set(bits, i, (i % 5) == 0); } for (int i = 0; i < 100; i++) { boolean expect = (i % 5) == 0; assertTrue(label(i), Bits.get(bits, i) == expect); } }
public void test_set2() { int[] bits = Bits.makeBitSet(100); for (int i = 0; i < 100; i++) { if ((i % 11) == 0) { Bits.set(bits, i); } } for (int i = 0; i < 100; i++) { boolean expect = (i % 11) == 0; assertTrue(label(i), Bits.get(bits, i) == expect); } }
public void test_set2() { int[] bits = Bits.makeBitSet(100); for (int i = 0; i < 100; i++) { if ((i % 11) == 0) { Bits.set(bits, i); } } for (int i = 0; i < 100; i++) { boolean expect = (i % 11) == 0; assertTrue(label(i), Bits.get(bits, i) == expect); } }
public void test_clear() { int[] bits = Bits.makeBitSet(100); for (int i = 0; i < bits.length; i++) { bits[i] = -1; } for (int i = 0; i < 100; i++) { if ((i % 5) == 0) { Bits.clear(bits, i); } } for (int i = 0; i < 100; i++) { boolean expect = (i % 5) != 0; assertTrue(label(i), Bits.get(bits, i) == expect); } }
public void test_clear() { int[] bits = Bits.makeBitSet(100); for (int i = 0; i < bits.length; i++) { bits[i] = -1; } for (int i = 0; i < 100; i++) { if ((i % 5) == 0) { Bits.clear(bits, i); } } for (int i = 0; i < 100; i++) { boolean expect = (i % 5) != 0; assertTrue(label(i), Bits.get(bits, i) == expect); } }