/**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.hadoop.hbase.procedure2.store;
import java.util.Random;
import org.apache.commons.logging.Log;
import org.apache.commons.logging.LogFactory;
import org.apache.hadoop.hbase.testclassification.SmallTests;
import org.apache.hadoop.hbase.testclassification.MasterTests;
import org.junit.Test;
import org.junit.experimental.categories.Category;
import static org.apache.hadoop.hbase.procedure2.store.ProcedureStoreTracker.BitSetNode;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
@Category({MasterTests.class, SmallTests.class})
public class TestProcedureStoreTracker {
private static final Log LOG = LogFactory.getLog(TestProcedureStoreTracker.class);
@Test
public void testSeqInsertAndDelete() {
ProcedureStoreTracker tracker = new ProcedureStoreTracker();
assertTrue(tracker.isEmpty());
final int MIN_PROC = 1;
final int MAX_PROC = 1 << 10;
// sequential insert
for (int i = MIN_PROC; i < MAX_PROC; ++i) {
tracker.insert(i);
// All the proc that we inserted should not be deleted
for (int j = MIN_PROC; j <= i; ++j) {
assertEquals(ProcedureStoreTracker.DeleteState.NO, tracker.isDeleted(j));
}
// All the proc that are not yet inserted should be result as deleted
for (int j = i + 1; j < MAX_PROC; ++j) {
assertTrue(tracker.isDeleted(j) != ProcedureStoreTracker.DeleteState.NO);
}
}
// sequential delete
for (int i = MIN_PROC; i < MAX_PROC; ++i) {
tracker.delete(i);
// All the proc that we deleted should be deleted
for (int j = MIN_PROC; j <= i; ++j) {
assertEquals(ProcedureStoreTracker.DeleteState.YES, tracker.isDeleted(j));
}
// All the proc that are not yet deleted should be result as not deleted
for (int j = i + 1; j < MAX_PROC; ++j) {
assertEquals(ProcedureStoreTracker.DeleteState.NO, tracker.isDeleted(j));
}
}
assertTrue(tracker.isEmpty());
}
@Test
public void testPartialTracker() {
ProcedureStoreTracker tracker = new ProcedureStoreTracker();
tracker.setPartialFlag(true);
// nothing in the tracker, the state is unknown
assertTrue(tracker.isEmpty());
assertEquals(ProcedureStoreTracker.DeleteState.MAYBE, tracker.isDeleted(1));
assertEquals(ProcedureStoreTracker.DeleteState.MAYBE, tracker.isDeleted(579));
// Mark 1 as deleted, now that is a known state
tracker.setDeleted(1, true);
tracker.dump();
assertEquals(ProcedureStoreTracker.DeleteState.YES, tracker.isDeleted(1));
assertEquals(ProcedureStoreTracker.DeleteState.MAYBE, tracker.isDeleted(2));
assertEquals(ProcedureStoreTracker.DeleteState.MAYBE, tracker.isDeleted(579));
// Mark 579 as non-deleted, now that is a known state
tracker.setDeleted(579, false);
assertEquals(ProcedureStoreTracker.DeleteState.YES, tracker.isDeleted(1));
assertEquals(ProcedureStoreTracker.DeleteState.MAYBE, tracker.isDeleted(2));
assertEquals(ProcedureStoreTracker.DeleteState.NO, tracker.isDeleted(579));
assertEquals(ProcedureStoreTracker.DeleteState.MAYBE, tracker.isDeleted(577));
assertEquals(ProcedureStoreTracker.DeleteState.MAYBE, tracker.isDeleted(580));
tracker.setDeleted(579, true);
tracker.setPartialFlag(false);
assertTrue(tracker.isEmpty());
}
@Test
public void testBasicCRUD() {
ProcedureStoreTracker tracker = new ProcedureStoreTracker();
assertTrue(tracker.isEmpty());
long[] procs = new long[] { 1, 2, 3, 4, 5, 6 };
tracker.insert(procs[0]);
tracker.insert(procs[1], new long[] { procs[2], procs[3], procs[4] });
assertFalse(tracker.isEmpty());
assertTrue(tracker.isUpdated());
tracker.resetUpdates();
assertFalse(tracker.isUpdated());
for (int i = 0; i < 4; ++i) {
tracker.update(procs[i]);
assertFalse(tracker.isEmpty());
assertFalse(tracker.isUpdated());
}
tracker.update(procs[4]);
assertFalse(tracker.isEmpty());
assertTrue(tracker.isUpdated());
tracker.update(procs[5]);
assertFalse(tracker.isEmpty());
assertTrue(tracker.isUpdated());
for (int i = 0; i < 5; ++i) {
tracker.delete(procs[i]);
assertFalse(tracker.isEmpty());
assertTrue(tracker.isUpdated());
}
tracker.delete(procs[5]);
assertTrue(tracker.isEmpty());
}
@Test
public void testRandLoad() {
final int NPROCEDURES = 2500;
final int NRUNS = 5000;
final ProcedureStoreTracker tracker = new ProcedureStoreTracker();
Random rand = new Random(1);
for (int i = 0; i < NRUNS; ++i) {
assertTrue(tracker.isEmpty());
int count = 0;
while (count < NPROCEDURES) {
long procId = rand.nextLong();
if (procId < 1) continue;
tracker.setDeleted(procId, i % 2 == 0);
count++;
}
tracker.reset();
}
}
@Test
public void testLoad() {
final int MAX_PROCS = 1000;
final ProcedureStoreTracker tracker = new ProcedureStoreTracker();
for (int numProcs = 1; numProcs < MAX_PROCS; ++numProcs) {
for (int start = 1; start <= numProcs; ++start) {
assertTrue(tracker.isEmpty());
LOG.debug("loading " + numProcs + " procs from start=" + start);
for (int i = start; i <= numProcs; ++i) {
tracker.setDeleted(i, false);
}
for (int i = 1; i < start; ++i) {
tracker.setDeleted(i, false);
}
tracker.reset();
}
}
}
@Test
public void testDelete() {
final ProcedureStoreTracker tracker = new ProcedureStoreTracker();
long[] procIds = new long[] { 65, 1, 193 };
for (int i = 0; i < procIds.length; ++i) {
tracker.insert(procIds[i]);
tracker.dump();
}
for (int i = 0; i < (64 * 4); ++i) {
boolean hasProc = false;
for (int j = 0; j < procIds.length; ++j) {
if (procIds[j] == i) {
hasProc = true;
break;
}
}
if (hasProc) {
assertEquals(ProcedureStoreTracker.DeleteState.NO, tracker.isDeleted(i));
} else {
assertEquals("procId=" + i, ProcedureStoreTracker.DeleteState.YES, tracker.isDeleted(i));
}
}
}
boolean isDeleted(ProcedureStoreTracker n, long procId) {
return n.isDeleted(procId) == ProcedureStoreTracker.DeleteState.YES;
}
boolean isDeleted(BitSetNode n, long procId) {
return n.isDeleted(procId) == ProcedureStoreTracker.DeleteState.YES;
}
/**
* @param active list of active proc ids. To mark them as non-deleted, since by default a proc
* id is always marked deleted.
*/
ProcedureStoreTracker buildTracker(long[] active, long[] updated, long[] deleted) {
ProcedureStoreTracker tracker = new ProcedureStoreTracker();
for (long i : active) {
tracker.insert(i);
}
tracker.resetUpdates();
for (long i : updated) {
tracker.update(i);
}
for (long i : deleted) {
tracker.delete(i);
}
return tracker;
}
/**
* @param active list of active proc ids. To mark them as non-deleted, since by default a proc
* id is always marked deleted.
*/
BitSetNode buildBitSetNode(long[] active, long[] updated, long[] deleted) {
BitSetNode bitSetNode = new BitSetNode(0L, false);
for (long i : active) {
bitSetNode.update(i);
}
bitSetNode.resetUpdates();
for (long i : updated) {
bitSetNode.update(i);
}
for (long i : deleted) {
bitSetNode.delete(i);
}
return bitSetNode;
}
@Test
public void testSetDeletedIfSet() {
final ProcedureStoreTracker tracker = new ProcedureStoreTracker();
final long[] procIds = new long[] { 1, 3, 7, 152, 512, 1024, 1025 };
// test single proc
for (int i = 0; i < procIds.length; ++i) {
tracker.insert(procIds[i]);
}
assertEquals(false, tracker.isEmpty());
for (int i = 0; i < procIds.length; ++i) {
tracker.setDeletedIfSet(procIds[i] - 1);
tracker.setDeletedIfSet(procIds[i]);
tracker.setDeletedIfSet(procIds[i] + 1);
}
assertEquals(true, tracker.isEmpty());
// test batch
tracker.reset();
for (int i = 0; i < procIds.length; ++i) {
tracker.insert(procIds[i]);
}
assertEquals(false, tracker.isEmpty());
tracker.setDeletedIfSet(procIds);
assertEquals(true, tracker.isEmpty());
}
}