Apache
/
hbase
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

HBASE-13761 Optimize FuzzyRowFilter (Vladimir Rodionov)

This commit is contained in:
Nick Dimiduk 2015-05-28 10:17:46 -07:00
parent c9217ba1b5
commit 2f9851af26
5 changed files with 828 additions and 209 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
dev-support/test-patch.properties
View File

@ -20,7 +20,8 @@ MAVEN_OPTS="-Xmx3100M"
OK_RELEASEAUDIT_WARNINGS=0
OK_FINDBUGS_WARNINGS=89
# Allow two warnings. Javadoc complains about sun.misc.Unsafe use. See HBASE-7457
OK_JAVADOC_WARNINGS=2
# Allow three warnings. Javadoc complains about sun.misc.Unsafe use.
# See HBASE-7457, HBASE-13761
OK_JAVADOC_WARNINGS=3
MAX_LINE_LENGTH=100

392
hbase-client/src/main/java/org/apache/hadoop/hbase/filter/FuzzyRowFilter.java
View File

@ -19,52 +19,42 @@ package org.apache.hadoop.hbase.filter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import com.google.common.annotations.VisibleForTesting;
import com.google.protobuf.InvalidProtocolBufferException;
import org.apache.hadoop.hbase.classification.InterfaceAudience;
import org.apache.hadoop.hbase.classification.InterfaceStability;
import org.apache.hadoop.hbase.Cell;
import org.apache.hadoop.hbase.KeyValueUtil;
import org.apache.hadoop.hbase.classification.InterfaceAudience;
import org.apache.hadoop.hbase.classification.InterfaceStability;
import org.apache.hadoop.hbase.exceptions.DeserializationException;
import org.apache.hadoop.hbase.protobuf.generated.FilterProtos;
import org.apache.hadoop.hbase.protobuf.generated.HBaseProtos.BytesBytesPair;
import org.apache.hadoop.hbase.util.ByteStringer;
import org.apache.hadoop.hbase.util.Bytes;
import org.apache.hadoop.hbase.util.Pair;
import org.apache.hadoop.hbase.util.UnsafeAccess;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import com.google.common.annotations.VisibleForTesting;
import com.google.protobuf.InvalidProtocolBufferException;
/**
* Filters data based on fuzzy row key. Performs fast-forwards during scanning.
* It takes pairs (row key, fuzzy info) to match row keys. Where fuzzy info is
* a byte array with 0 or 1 as its values:
* This is optimized version of a standard FuzzyRowFilter Filters data based on fuzzy row key.
* Performs fast-forwards during scanning. It takes pairs (row key, fuzzy info) to match row keys.
* Where fuzzy info is a byte array with 0 or 1 as its values:
* <ul>
* <li>
* 0 - means that this byte in provided row key is fixed, i.e. row key's byte at same position
* must match
* </li>
* <li>
* 1 - means that this byte in provided row key is NOT fixed, i.e. row key's byte at this
* position can be different from the one in provided row key
* </li>
* <li>0 - means that this byte in provided row key is fixed, i.e. row key's byte at same position
* must match</li>
* <li>1 - means that this byte in provided row key is NOT fixed, i.e. row key's byte at this
* position can be different from the one in provided row key</li>
* </ul>
*
*
* Example:
* Let's assume row key format is userId_actionId_year_month. Length of userId is fixed
* and is 4, length of actionId is 2 and year and month are 4 and 2 bytes long respectively.
*
* Let's assume that we need to fetch all users that performed certain action (encoded as "99")
* in Jan of any year. Then the pair (row key, fuzzy info) would be the following:
* row key = "????_99_????_01" (one can use any value instead of "?")
* fuzzy info = "\x01\x01\x01\x01\x00\x00\x00\x00\x01\x01\x01\x01\x00\x00\x00"
*
* I.e. fuzzy info tells the matching mask is "????_99_????_01", where at ? can be any value.
*
* Example: Let's assume row key format is userId_actionId_year_month. Length of userId is fixed and
* is 4, length of actionId is 2 and year and month are 4 and 2 bytes long respectively. Let's
* assume that we need to fetch all users that performed certain action (encoded as "99") in Jan of
* any year. Then the pair (row key, fuzzy info) would be the following: row key = "????_99_????_01"
* (one can use any value instead of "?") fuzzy info =
* "\x01\x01\x01\x01\x00\x00\x00\x00\x01\x01\x01\x01\x00\x00\x00" I.e. fuzzy info tells the matching
* mask is "????_99_????_01", where at ? can be any value.
*/
@InterfaceAudience.Public
@InterfaceStability.Evolving
@ -72,83 +62,180 @@ public class FuzzyRowFilter extends FilterBase {
private List<Pair<byte[], byte[]>> fuzzyKeysData;
private boolean done = false;
/**
* The index of a last successfully found matching fuzzy string (in fuzzyKeysData). We will start
* matching next KV with this one. If they do not match then we will return back to the one-by-one
* iteration over fuzzyKeysData.
*/
private int lastFoundIndex = -1;
/**
* Row tracker (keeps all next rows after SEEK_NEXT_USING_HINT was returned)
*/
private RowTracker tracker;
public FuzzyRowFilter(List<Pair<byte[], byte[]>> fuzzyKeysData) {
Pair<byte[], byte[]> p;
for (int i = 0; i < fuzzyKeysData.size(); i++) {
p = fuzzyKeysData.get(i);
if (p.getFirst().length != p.getSecond().length) {
Pair<String, String> readable = new Pair<String, String>(
Bytes.toStringBinary(p.getFirst()),
Bytes.toStringBinary(p.getSecond()));
Pair<String, String> readable =
new Pair<String, String>(Bytes.toStringBinary(p.getFirst()), Bytes.toStringBinary(p
.getSecond()));
throw new IllegalArgumentException("Fuzzy pair lengths do not match: " + readable);
}
// update mask ( 0 -> -1 (0xff), 1 -> 0)
p.setSecond(preprocessMask(p.getSecond()));
preprocessSearchKey(p);
}
this.fuzzyKeysData = fuzzyKeysData;
this.tracker = new RowTracker();
}
private void preprocessSearchKey(Pair<byte[], byte[]> p) {
if (UnsafeAccess.isAvailable() == false) {
return;
}
byte[] key = p.getFirst();
byte[] mask = p.getSecond();
for (int i = 0; i < mask.length; i++) {
// set non-fixed part of a search key to 0.
if (mask[i] == 0) key[i] = 0;
}
}
/**
* We need to preprocess mask array, as since we treat 0's as unfixed positions and -1 (0xff) as
* fixed positions
* @param mask
* @return mask array
*/
private byte[] preprocessMask(byte[] mask) {
if (UnsafeAccess.isAvailable() == false) {
return mask;
}
if (isPreprocessedMask(mask)) return mask;
for (int i = 0; i < mask.length; i++) {
if (mask[i] == 0) {
mask[i] = -1; // 0 -> -1
} else if (mask[i] == 1) {
mask[i] = 0;// 1 -> 0
}
}
return mask;
}
private boolean isPreprocessedMask(byte[] mask) {
for (int i = 0; i < mask.length; i++) {
if (mask[i] != -1 && mask[i] != 0) {
return false;
}
}
return true;
}
// TODO: possible improvement: save which fuzzy row key to use when providing a hint
@Override
public ReturnCode filterKeyValue(Cell cell) {
// assigning "worst" result first and looking for better options
SatisfiesCode bestOption = SatisfiesCode.NO_NEXT;
for (Pair<byte[], byte[]> fuzzyData : fuzzyKeysData) {
SatisfiesCode satisfiesCode = satisfies(isReversed(), cell.getRowArray(),
cell.getRowOffset(), cell.getRowLength(), fuzzyData.getFirst(), fuzzyData.getSecond());
public ReturnCode filterKeyValue(Cell c) {
final int startIndex = lastFoundIndex >= 0 ? lastFoundIndex : 0;
final int size = fuzzyKeysData.size();
for (int i = startIndex; i < size + startIndex; i++) {
final int index = i % size;
Pair<byte[], byte[]> fuzzyData = fuzzyKeysData.get(index);
SatisfiesCode satisfiesCode =
satisfies(isReversed(), c.getRowArray(), c.getRowOffset(), c.getRowLength(),
fuzzyData.getFirst(), fuzzyData.getSecond());
if (satisfiesCode == SatisfiesCode.YES) {
lastFoundIndex = index;
return ReturnCode.INCLUDE;
}
if (satisfiesCode == SatisfiesCode.NEXT_EXISTS) {
bestOption = SatisfiesCode.NEXT_EXISTS;
}
}
// NOT FOUND -> seek next using hint
lastFoundIndex = -1;
return ReturnCode.SEEK_NEXT_USING_HINT;
if (bestOption == SatisfiesCode.NEXT_EXISTS) {
return ReturnCode.SEEK_NEXT_USING_HINT;
}
// the only unhandled SatisfiesCode is NO_NEXT, i.e. we are done
done = true;
return ReturnCode.NEXT_ROW;
}
// Override here explicitly as the method in super class FilterBase might do a KeyValue recreate.
// See HBASE-12068
@Override
public Cell transformCell(Cell v) {
return v;
}
@Override
public Cell getNextCellHint(Cell curCell) {
byte[] nextRowKey = null;
// Searching for the "smallest" row key that satisfies at least one fuzzy row key
for (Pair<byte[], byte[]> fuzzyData : fuzzyKeysData) {
byte[] nextRowKeyCandidate = getNextForFuzzyRule(isReversed(), curCell.getRowArray(),
curCell.getRowOffset(), curCell.getRowLength(), fuzzyData.getFirst(),
fuzzyData.getSecond());
if (nextRowKeyCandidate == null) {
continue;
}
if (nextRowKey == null ||
(reversed && Bytes.compareTo(nextRowKeyCandidate, nextRowKey) > 0) ||
(!reversed && Bytes.compareTo(nextRowKeyCandidate, nextRowKey) < 0)) {
nextRowKey = nextRowKeyCandidate;
public Cell getNextCellHint(Cell currentCell) {
boolean result = true;
if (tracker.needsUpdate()) {
result = tracker.updateTracker(currentCell);
}
if (result == false) {
done = true;
return null;
}
byte[] nextRowKey = tracker.nextRow();
// We need to compare nextRowKey with currentCell
int compareResult =
Bytes.compareTo(nextRowKey, 0, nextRowKey.length, currentCell.getRowArray(),
currentCell.getRowOffset(), currentCell.getRowLength());
if ((reversed && compareResult > 0) || (!reversed && compareResult < 0)) {
// This can happen when we have multilpe filters and some other filter
// returns next row with hint which is larger (smaller for reverse)
// than the current (really?)
result = tracker.updateTracker(currentCell);
if (result == false) {
done = true;
return null;
} else {
nextRowKey = tracker.nextRow();
}
}
return KeyValueUtil.createFirstOnRow(nextRowKey);
}
if (!reversed && nextRowKey == null) {
// Should never happen for forward scanners; logic in filterKeyValue should return NO_NEXT.
// Can happen in reversed scanner when currentKV is just before the next possible match; in
// this case, fall back on scanner simply calling KeyValueHeap.next()
// TODO: is there a better way than throw exception? (stop the scanner?)
throw new IllegalStateException("No next row key that satisfies fuzzy exists when" +
" getNextKeyHint() is invoked." +
" Filter: " + this.toString() +
" currentKV: " + curCell);
/**
* If we have multiple fuzzy keys, row tracker should improve overall performance It calculates
* all next rows (one per every fuzzy key), sort them accordingly (ascending for regular and
* descending for reverse). Next time getNextCellHint is called we check row tracker first and
* return next row from the tracker if it exists, if there are no rows in the tracker we update
* tracker with a current cell and return first row.
*/
private class RowTracker {
private final List<byte[]> nextRows;
private int next = -1;
RowTracker() {
nextRows = new ArrayList<byte[]>();
}
boolean needsUpdate() {
return next == -1 || next == nextRows.size();
}
byte[] nextRow() {
if (next < 0 || next == nextRows.size()) return null;
return nextRows.get(next++);
}
boolean updateTracker(Cell currentCell) {
nextRows.clear();
for (Pair<byte[], byte[]> fuzzyData : fuzzyKeysData) {
byte[] nextRowKeyCandidate =
getNextForFuzzyRule(isReversed(), currentCell.getRowArray(),
currentCell.getRowOffset(), currentCell.getRowLength(), fuzzyData.getFirst(),
fuzzyData.getSecond());
if (nextRowKeyCandidate == null) {
continue;
}
nextRows.add(nextRowKeyCandidate);
}
// Sort all next row candidates
Collections.sort(nextRows, new Comparator<byte[]>() {
@Override
public int compare(byte[] o1, byte[] o2) {
if (reversed) {
return -Bytes.compareTo(o1, o2);
} else {
return Bytes.compareTo(o1, o2);
}
}
});
next = 0;
return nextRows.size() > 0;
}
return nextRowKey == null ? null : KeyValueUtil.createFirstOnRow(nextRowKey);
}
@Override
@ -159,9 +246,8 @@ public class FuzzyRowFilter extends FilterBase {
/**
* @return The filter serialized using pb
*/
public byte [] toByteArray() {
FilterProtos.FuzzyRowFilter.Builder builder =
FilterProtos.FuzzyRowFilter.newBuilder();
public byte[] toByteArray() {
FilterProtos.FuzzyRowFilter.Builder builder = FilterProtos.FuzzyRowFilter.newBuilder();
for (Pair<byte[], byte[]> fuzzyData : fuzzyKeysData) {
BytesBytesPair.Builder bbpBuilder = BytesBytesPair.newBuilder();
bbpBuilder.setFirst(ByteStringer.wrap(fuzzyData.getFirst()));
@ -177,8 +263,7 @@ public class FuzzyRowFilter extends FilterBase {
* @throws DeserializationException
* @see #toByteArray
*/
public static FuzzyRowFilter parseFrom(final byte [] pbBytes)
throws DeserializationException {
public static FuzzyRowFilter parseFrom(final byte[] pbBytes) throws DeserializationException {
FilterProtos.FuzzyRowFilter proto;
try {
proto = FilterProtos.FuzzyRowFilter.parseFrom(pbBytes);
@ -186,7 +271,7 @@ public class FuzzyRowFilter extends FilterBase {
throw new DeserializationException(e);
}
int count = proto.getFuzzyKeysDataCount();
ArrayList<Pair<byte[], byte[]>> fuzzyKeysData= new ArrayList<Pair<byte[], byte[]>>(count);
ArrayList<Pair<byte[], byte[]>> fuzzyKeysData = new ArrayList<Pair<byte[], byte[]>>(count);
for (int i = 0; i < count; ++i) {
BytesBytesPair current = proto.getFuzzyKeysData(i);
byte[] keyBytes = current.getFirst().toByteArray();
@ -227,12 +312,90 @@ public class FuzzyRowFilter extends FilterBase {
@VisibleForTesting
static SatisfiesCode satisfies(boolean reverse, byte[] row, byte[] fuzzyKeyBytes,
byte[] fuzzyKeyMeta) {
byte[] fuzzyKeyMeta) {
return satisfies(reverse, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);
}
private static SatisfiesCode satisfies(boolean reverse, byte[] row, int offset, int length,
byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {
static SatisfiesCode satisfies(boolean reverse, byte[] row, int offset, int length,
byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {
if (UnsafeAccess.isAvailable() == false) {
return satisfiesNoUnsafe(reverse, row, offset, length, fuzzyKeyBytes, fuzzyKeyMeta);
}
if (row == null) {
// do nothing, let scan to proceed
return SatisfiesCode.YES;
}
length = Math.min(length, fuzzyKeyBytes.length);
int numWords = length / Bytes.SIZEOF_LONG;
int offsetAdj = offset + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;
int j = numWords << 3; // numWords * SIZEOF_LONG;
for (int i = 0; i < j; i += Bytes.SIZEOF_LONG) {
long fuzzyBytes =
UnsafeAccess.theUnsafe.getLong(fuzzyKeyBytes, UnsafeAccess.BYTE_ARRAY_BASE_OFFSET
+ (long) i);
long fuzzyMeta =
UnsafeAccess.theUnsafe.getLong(fuzzyKeyMeta, UnsafeAccess.BYTE_ARRAY_BASE_OFFSET
+ (long) i);
long rowValue = UnsafeAccess.theUnsafe.getLong(row, offsetAdj + (long) i);
if ((rowValue & fuzzyMeta) != (fuzzyBytes)) {
// We always return NEXT_EXISTS
return SatisfiesCode.NEXT_EXISTS;
}
}
int off = j;
if (length - off >= Bytes.SIZEOF_INT) {
int fuzzyBytes =
UnsafeAccess.theUnsafe.getInt(fuzzyKeyBytes, UnsafeAccess.BYTE_ARRAY_BASE_OFFSET
+ (long) off);
int fuzzyMeta =
UnsafeAccess.theUnsafe.getInt(fuzzyKeyMeta, UnsafeAccess.BYTE_ARRAY_BASE_OFFSET
+ (long) off);
int rowValue = UnsafeAccess.theUnsafe.getInt(row, offsetAdj + (long) off);
if ((rowValue & fuzzyMeta) != (fuzzyBytes)) {
// We always return NEXT_EXISTS
return SatisfiesCode.NEXT_EXISTS;
}
off += Bytes.SIZEOF_INT;
}
if (length - off >= Bytes.SIZEOF_SHORT) {
short fuzzyBytes =
UnsafeAccess.theUnsafe.getShort(fuzzyKeyBytes, UnsafeAccess.BYTE_ARRAY_BASE_OFFSET
+ (long) off);
short fuzzyMeta =
UnsafeAccess.theUnsafe.getShort(fuzzyKeyMeta, UnsafeAccess.BYTE_ARRAY_BASE_OFFSET
+ (long) off);
short rowValue = UnsafeAccess.theUnsafe.getShort(row, offsetAdj + (long) off);
if ((rowValue & fuzzyMeta) != (fuzzyBytes)) {
// We always return NEXT_EXISTS
// even if it does not (in this case getNextForFuzzyRule
// will return null)
return SatisfiesCode.NEXT_EXISTS;
}
off += Bytes.SIZEOF_SHORT;
}
if (length - off >= Bytes.SIZEOF_BYTE) {
int fuzzyBytes = fuzzyKeyBytes[off] & 0xff;
int fuzzyMeta = fuzzyKeyMeta[off] & 0xff;
int rowValue = row[offset + off] & 0xff;
if ((rowValue & fuzzyMeta) != (fuzzyBytes)) {
// We always return NEXT_EXISTS
return SatisfiesCode.NEXT_EXISTS;
}
}
return SatisfiesCode.YES;
}
static SatisfiesCode satisfiesNoUnsafe(boolean reverse, byte[] row, int offset,
int length, byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {
if (row == null) {
// do nothing, let scan to proceed
return SatisfiesCode.YES;
@ -269,12 +432,11 @@ public class FuzzyRowFilter extends FilterBase {
// bigger byte array that satisfies the rule we need to just increase this byte
// (see the code of getNextForFuzzyRule below) by one.
// Note: if non-fixed byte is already at biggest value, this doesn't allow us to say there's
// bigger one that satisfies the rule as it can't be increased.
// bigger one that satisfies the rule as it can't be increased.
if (fuzzyKeyMeta[i] == 1 && !order.isMax(fuzzyKeyBytes[i])) {
nextRowKeyCandidateExists = true;
}
}
return SatisfiesCode.YES;
}
@ -285,7 +447,7 @@ public class FuzzyRowFilter extends FilterBase {
@VisibleForTesting
static byte[] getNextForFuzzyRule(boolean reverse, byte[] row, byte[] fuzzyKeyBytes,
byte[] fuzzyKeyMeta) {
byte[] fuzzyKeyMeta) {
return getNextForFuzzyRule(reverse, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);
}
@ -295,16 +457,20 @@ public class FuzzyRowFilter extends FilterBase {
public boolean lt(int lhs, int rhs) {
return lhs < rhs;
}
public boolean gt(int lhs, int rhs) {
return lhs > rhs;
}
public byte inc(byte val) {
// TODO: what about over/underflow?
return (byte) (val + 1);
}
public boolean isMax(byte val) {
return val == (byte) 0xff;
}
public byte min() {
return 0;
}
@ -313,16 +479,20 @@ public class FuzzyRowFilter extends FilterBase {
public boolean lt(int lhs, int rhs) {
return lhs > rhs;
}
public boolean gt(int lhs, int rhs) {
return lhs < rhs;
}
public byte inc(byte val) {
// TODO: what about over/underflow?
return (byte) (val - 1);
}
public boolean isMax(byte val) {
return val == 0;
}
public byte min() {
return (byte) 0xFF;
}
@ -334,33 +504,37 @@ public class FuzzyRowFilter extends FilterBase {
/** Returns true when {@code lhs < rhs}. */
public abstract boolean lt(int lhs, int rhs);
/** Returns true when {@code lhs > rhs}. */
public abstract boolean gt(int lhs, int rhs);
/** Returns {@code val} incremented by 1. */
public abstract byte inc(byte val);
/** Return true when {@code val} is the maximum value */
public abstract boolean isMax(byte val);
/** Return the minimum value according to this ordering scheme. */
public abstract byte min();
}
/**
* @return greater byte array than given (row) which satisfies the fuzzy rule if it exists,
* null otherwise
* @return greater byte array than given (row) which satisfies the fuzzy rule if it exists, null
* otherwise
*/
@VisibleForTesting
static byte[] getNextForFuzzyRule(boolean reverse, byte[] row, int offset, int length,
byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {
byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {
// To find out the next "smallest" byte array that satisfies fuzzy rule and "greater" than
// the given one we do the following:
// 1. setting values on all "fixed" positions to the values from fuzzyKeyBytes
// 2. if during the first step given row did not increase, then we increase the value at
// the first "non-fixed" position (where it is not maximum already)
// the first "non-fixed" position (where it is not maximum already)
// It is easier to perform this by using fuzzyKeyBytes copy and setting "non-fixed" position
// values than otherwise.
byte[] result = Arrays.copyOf(fuzzyKeyBytes,
length > fuzzyKeyBytes.length ? length : fuzzyKeyBytes.length);
byte[] result =
Arrays.copyOf(fuzzyKeyBytes, length > fuzzyKeyBytes.length ? length : fuzzyKeyBytes.length);
if (reverse && length > fuzzyKeyBytes.length) {
// we need trailing 0xff's instead of trailing 0x00's
for (int i = fuzzyKeyBytes.length; i < result.length; i++) {
@ -372,13 +546,13 @@ public class FuzzyRowFilter extends FilterBase {
boolean increased = false;
for (int i = 0; i < result.length; i++) {
if (i >= fuzzyKeyMeta.length || fuzzyKeyMeta[i] == 1) {
if (i >= fuzzyKeyMeta.length || fuzzyKeyMeta[i] == 0 /* non-fixed */) {
result[i] = row[offset + i];
if (!order.isMax(row[offset + i])) {
// this is "non-fixed" position and is not at max value, hence we can increase it
toInc = i;
}
} else if (i < fuzzyKeyMeta.length && fuzzyKeyMeta[i] == 0) {
} else if (i < fuzzyKeyMeta.length && fuzzyKeyMeta[i] == -1 /* fixed */) {
if (order.lt((row[i + offset] & 0xFF), (fuzzyKeyBytes[i] & 0xFF))) {
// if setting value for any fixed position increased the original array,
// we are OK
@ -404,7 +578,7 @@ public class FuzzyRowFilter extends FilterBase {
// Setting all "non-fixed" positions to zeroes to the right of the one we increased so
// that found "next" row key is the smallest possible
for (int i = toInc + 1; i < result.length; i++) {
if (i >= fuzzyKeyMeta.length || fuzzyKeyMeta[i] == 1) {
if (i >= fuzzyKeyMeta.length || fuzzyKeyMeta[i] == 0 /* non-fixed */) {
result[i] = order.min();
}
}
@ -414,20 +588,20 @@ public class FuzzyRowFilter extends FilterBase {
}
/**
* @return true if and only if the fields of the filter that are serialized
* are equal to the corresponding fields in other. Used for testing.
* @return true if and only if the fields of the filter that are serialized are equal to the
* corresponding fields in other. Used for testing.
*/
boolean areSerializedFieldsEqual(Filter o) {
if (o == this) return true;
if (!(o instanceof FuzzyRowFilter)) return false;
FuzzyRowFilter other = (FuzzyRowFilter)o;
FuzzyRowFilter other = (FuzzyRowFilter) o;
if (this.fuzzyKeysData.size() != other.fuzzyKeysData.size()) return false;
for (int i = 0; i < fuzzyKeysData.size(); ++i) {
Pair<byte[], byte[]> thisData = this.fuzzyKeysData.get(i);
Pair<byte[], byte[]> otherData = other.fuzzyKeysData.get(i);
if (!(Bytes.equals(thisData.getFirst(), otherData.getFirst())
&& Bytes.equals(thisData.getSecond(), otherData.getSecond()))) {
if (!(Bytes.equals(thisData.getFirst(), otherData.getFirst()) && Bytes.equals(
thisData.getSecond(), otherData.getSecond()))) {
return false;
}
}

73
hbase-common/src/main/java/org/apache/hadoop/hbase/util/UnsafeAccess.java Normal file
View File

@ -0,0 +1,73 @@
/**
* 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.util;
import java.lang.reflect.Field;
import java.nio.ByteOrder;
import java.security.AccessController;
import java.security.PrivilegedAction;
import org.apache.commons.logging.Log;
import org.apache.commons.logging.LogFactory;
import org.apache.hadoop.hbase.classification.InterfaceAudience;
import org.apache.hadoop.hbase.classification.InterfaceStability;
import sun.misc.Unsafe;
@InterfaceAudience.Private
@InterfaceStability.Evolving
public final class UnsafeAccess {
private static final Log LOG = LogFactory.getLog(UnsafeAccess.class);
public static final Unsafe theUnsafe;
/** The offset to the first element in a byte array. */
public static final int BYTE_ARRAY_BASE_OFFSET;
static {
theUnsafe = (Unsafe) AccessController.doPrivileged(new PrivilegedAction<Object>() {
@Override
public Object run() {
try {
Field f = Unsafe.class.getDeclaredField("theUnsafe");
f.setAccessible(true);
return f.get(null);
} catch (Throwable e) {
LOG.warn("sun.misc.Unsafe is not accessible", e);
}
return null;
}
});
if(theUnsafe != null){
BYTE_ARRAY_BASE_OFFSET = theUnsafe.arrayBaseOffset(byte[].class);
} else{
BYTE_ARRAY_BASE_OFFSET = -1;
}
}
private UnsafeAccess(){}
public static boolean isAvailable() {
return theUnsafe != null;
}
public static final boolean littleEndian = ByteOrder.nativeOrder()
.equals(ByteOrder.LITTLE_ENDIAN);
}

255
hbase-server/src/test/java/org/apache/hadoop/hbase/filter/TestFuzzyRowFilter.java
View File

@ -28,232 +28,291 @@ import org.junit.experimental.categories.Category;
@Category(SmallTests.class)
public class TestFuzzyRowFilter {
@Test
public void testSatisfiesForward() {
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(false,
new byte[]{1, (byte) -128, 0, 0, 1}, // row to check
new byte[]{1, 0, 1}, // fuzzy row
new byte[]{0, 1, 0})); // mask
public void testSatisfiesNoUnsafeForward() {
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.YES,
FuzzyRowFilter.satisfies(false,
FuzzyRowFilter.satisfiesNoUnsafe(false,
new byte[]{1, (byte) -128, 1, 0, 1},
0, 5,
new byte[]{1, 0, 1},
new byte[]{0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(false,
FuzzyRowFilter.satisfiesNoUnsafe(false,
new byte[]{1, (byte) -128, 2, 0, 1},
0, 5,
new byte[]{1, 0, 1},
new byte[]{0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NO_NEXT,
FuzzyRowFilter.satisfies(false,
new byte[]{2, 3, 1, 1, 1},
new byte[]{1, 0, 1},
new byte[]{0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.YES,
FuzzyRowFilter.satisfies(false,
FuzzyRowFilter.satisfiesNoUnsafe(false,
new byte[]{1, 2, 1, 3, 3},
0, 5,
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(false,
FuzzyRowFilter.satisfiesNoUnsafe(false,
new byte[]{1, 1, 1, 3, 0}, // row to check
0, 5,
new byte[]{1, 2, 0, 3}, // fuzzy row
new byte[]{0, 0, 1, 0})); // mask
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(false,
FuzzyRowFilter.satisfiesNoUnsafe(false,
new byte[]{1, 1, 1, 3, 0},
0, 5,
new byte[]{1, (byte) 245, 0, 3},
new byte[]{0, 0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NO_NEXT,
FuzzyRowFilter.satisfies(false,
new byte[]{1, (byte) 245, 1, 3, 0},
new byte[]{1, 1, 0, 3},
new byte[]{0, 0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NO_NEXT,
FuzzyRowFilter.satisfies(false,
new byte[]{1, 3, 1, 3, 0},
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NO_NEXT,
FuzzyRowFilter.satisfies(false,
new byte[]{2, 1, 1, 1, 0},
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(false,
FuzzyRowFilter.satisfiesNoUnsafe(false,
new byte[]{1, 2, 1, 0, 1},
0, 5,
new byte[]{0, 1, 2},
new byte[]{1, 0, 0}));
}
@Test
public void testSatisfiesReverse() {
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NO_NEXT,
FuzzyRowFilter.satisfies(true,
new byte[]{1, (byte) -128, 0, 0, 1}, // row to check
new byte[]{1, 0, 1}, // fuzzy row
new byte[]{0, 1, 0})); // mask
public void testSatisfiesForward() {
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.YES,
FuzzyRowFilter.satisfies(false,
new byte[]{1, (byte) -128, 1, 0, 1},
new byte[]{1, 0, 1},
new byte[]{-1, 0, -1}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(false,
new byte[]{1, (byte) -128, 2, 0, 1},
new byte[]{1, 0, 1},
new byte[]{-1, 0, -1}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.YES,
FuzzyRowFilter.satisfies(false,
new byte[]{1, 2, 1, 3, 3},
new byte[]{1, 2, 0, 3},
new byte[]{-1, -1, 0, -1}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(false,
new byte[]{1, 1, 1, 3, 0}, // row to check
new byte[]{1, 2, 0, 3}, // fuzzy row
new byte[]{-1, -1, 0, -1})); // mask
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(false,
new byte[]{1, 1, 1, 3, 0},
new byte[]{1, (byte) 245, 0, 3},
new byte[]{-1, -1, 0, -1}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(false,
new byte[]{1, 2, 1, 0, 1},
new byte[]{0, 1, 2},
new byte[]{0, -1, -1}));
}
@Test
public void testSatisfiesReverse() {
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.YES,
FuzzyRowFilter.satisfies(true,
new byte[]{1, (byte) -128, 1, 0, 1},
new byte[]{1, 0, 1},
new byte[]{0, 1, 0}));
new byte[]{-1, 0, -1}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(true,
new byte[]{1, (byte) -128, 2, 0, 1},
new byte[]{1, 0, 1},
new byte[]{0, 1, 0}));
new byte[]{-1, 0, -1}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(true,
new byte[]{2, 3, 1, 1, 1},
new byte[]{1, 0, 1},
new byte[]{0, 1, 0}));
new byte[]{-1, 0, -1}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.YES,
FuzzyRowFilter.satisfies(true,
new byte[]{1, 2, 1, 3, 3},
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NO_NEXT,
FuzzyRowFilter.satisfies(true,
new byte[]{1, 1, 1, 3, 0}, // row to check
new byte[]{1, 2, 0, 3}, // fuzzy row
new byte[]{0, 0, 1, 0})); // mask
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NO_NEXT,
FuzzyRowFilter.satisfies(true,
new byte[]{1, 1, 1, 3, 0},
new byte[]{1, (byte) 245, 0, 3},
new byte[]{0, 0, 1, 0}));
new byte[]{-1, -1, 0, -1}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(true,
new byte[]{1, (byte) 245, 1, 3, 0},
new byte[]{1, 1, 0, 3},
new byte[]{0, 0, 1, 0}));
new byte[]{-1, -1, 0, -1}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(true,
new byte[]{1, 3, 1, 3, 0},
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0}));
new byte[]{-1, -1, 0, -1}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(true,
new byte[]{2, 1, 1, 1, 0},
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0}));
new byte[]{-1, -1, 0, -1}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfies(true,
new byte[]{1, 2, 1, 0, 1},
new byte[]{0, 1, 2},
new byte[]{1, 0, 0}));
new byte[]{0, -1, -1}));
}
@Test
public void testSatisfiesNoUnsafeReverse() {
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.YES,
FuzzyRowFilter.satisfiesNoUnsafe(true,
new byte[]{1, (byte) -128, 1, 0, 1},
0, 5,
new byte[]{1, 0, 1},
new byte[]{0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfiesNoUnsafe(true,
new byte[]{1, (byte) -128, 2, 0, 1},
0, 5,
new byte[]{1, 0, 1},
new byte[]{0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfiesNoUnsafe(true,
new byte[]{2, 3, 1, 1, 1},
0, 5,
new byte[]{1, 0, 1},
new byte[]{0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.YES,
FuzzyRowFilter.satisfiesNoUnsafe(true,
new byte[]{1, 2, 1, 3, 3},
0, 5,
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfiesNoUnsafe(true,
new byte[]{1, (byte) 245, 1, 3, 0},
0, 5,
new byte[]{1, 1, 0, 3},
new byte[]{0, 0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfiesNoUnsafe(true,
new byte[]{1, 3, 1, 3, 0},
0, 5,
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfiesNoUnsafe(true,
new byte[]{2, 1, 1, 1, 0},
0, 5,
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0}));
Assert.assertEquals(FuzzyRowFilter.SatisfiesCode.NEXT_EXISTS,
FuzzyRowFilter.satisfiesNoUnsafe(true,
new byte[]{1, 2, 1, 0, 1},
0, 5,
new byte[]{0, 1, 2},
new byte[]{1, 0, 0}));
}
@Test
public void testGetNextForFuzzyRuleForward() {
assertNext(false,
new byte[]{0, 1, 2}, // fuzzy row
new byte[]{1, 0, 0}, // mask
new byte[]{0, -1, -1}, // mask
new byte[]{1, 2, 1, 0, 1}, // current
new byte[]{2, 1, 2, 0, 0}); // expected next
assertNext(false,
new byte[]{0, 1, 2}, // fuzzy row
new byte[]{1, 0, 0}, // mask
new byte[]{0, -1, -1}, // mask
new byte[]{1, 1, 2, 0, 1}, // current
new byte[]{1, 1, 2, 0, 2}); // expected next
assertNext(false,
new byte[]{0, 1, 0, 2, 0}, // fuzzy row
new byte[]{1, 0, 1, 0, 1}, // mask
new byte[]{0, -1, 0, -1, 0}, // mask
new byte[]{1, 0, 2, 0, 1}, // current
new byte[]{1, 1, 0, 2, 0}); // expected next
assertNext(false,
new byte[]{1, 0, 1},
new byte[]{0, 1, 0},
new byte[]{-1, 0, -1},
new byte[]{1, (byte) 128, 2, 0, 1},
new byte[]{1, (byte) 129, 1, 0, 0});
assertNext(false,
new byte[]{0, 1, 0, 1},
new byte[]{1, 0, 1, 0},
new byte[]{0, -1, 0, -1},
new byte[]{5, 1, 0, 1},
new byte[]{5, 1, 1, 1});
assertNext(false,
new byte[]{0, 1, 0, 1},
new byte[]{1, 0, 1, 0},
new byte[]{0, -1, 0, -1},
new byte[]{5, 1, 0, 1, 1},
new byte[]{5, 1, 0, 1, 2});
assertNext(false,
new byte[]{0, 1, 0, 0}, // fuzzy row
new byte[]{1, 0, 1, 1}, // mask
new byte[]{0, -1, 0, 0}, // mask
new byte[]{5, 1, (byte) 255, 1}, // current
new byte[]{5, 1, (byte) 255, 2}); // expected next
assertNext(false,
new byte[]{0, 1, 0, 1}, // fuzzy row
new byte[]{1, 0, 1, 0}, // mask
new byte[]{0, -1, 0, -1}, // mask
new byte[]{5, 1, (byte) 255, 1}, // current
new byte[]{6, 1, 0, 1}); // expected next
assertNext(false,
new byte[]{0, 1, 0, 1}, // fuzzy row
new byte[]{1, 0, 1, 0}, // mask
new byte[]{0, -1, 0, -1}, // mask
new byte[]{5, 1, (byte) 255, 0}, // current
new byte[]{5, 1, (byte) 255, 1}); // expected next
assertNext(false,
new byte[]{5, 1, 1, 0},
new byte[]{0, 0, 1, 1},
new byte[]{-1, -1, 0, 0},
new byte[]{5, 1, (byte) 255, 1},
new byte[]{5, 1, (byte) 255, 2});
assertNext(false,
new byte[]{1, 1, 1, 1},
new byte[]{0, 0, 1, 1},
new byte[]{-1, -1, 0, 0},
new byte[]{1, 1, 2, 2},
new byte[]{1, 1, 2, 3});
assertNext(false,
new byte[]{1, 1, 1, 1},
new byte[]{0, 0, 1, 1},
new byte[]{-1, -1, 0, 0},
new byte[]{1, 1, 3, 2},
new byte[]{1, 1, 3, 3});
assertNext(false,
new byte[]{1, 1, 1, 1},
new byte[]{1, 1, 1, 1},
new byte[]{0, 0, 0, 0},
new byte[]{1, 1, 2, 3},
new byte[]{1, 1, 2, 4});
assertNext(false,
new byte[]{1, 1, 1, 1},
new byte[]{1, 1, 1, 1},
new byte[]{0, 0, 0, 0},
new byte[]{1, 1, 3, 2},
new byte[]{1, 1, 3, 3});
assertNext(false,
new byte[]{1, 1, 0, 0},
new byte[]{0, 0, 1, 1},
new byte[]{-1, -1, 0, 0},
new byte[]{0, 1, 3, 2},
new byte[]{1, 1, 0, 0});
@ -261,100 +320,100 @@ public class TestFuzzyRowFilter {
Assert.assertNull(FuzzyRowFilter.getNextForFuzzyRule(
new byte[]{2, 3, 1, 1, 1}, // row to check
new byte[]{1, 0, 1}, // fuzzy row
new byte[]{0, 1, 0})); // mask
new byte[]{-1, 0, -1})); // mask
Assert.assertNull(FuzzyRowFilter.getNextForFuzzyRule(
new byte[]{1, (byte) 245, 1, 3, 0},
new byte[]{1, 1, 0, 3},
new byte[]{0, 0, 1, 0}));
new byte[]{-1, -1, 0, -1}));
Assert.assertNull(FuzzyRowFilter.getNextForFuzzyRule(
new byte[]{1, 3, 1, 3, 0},
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0}));
new byte[]{-1, -1, 0, -1}));
Assert.assertNull(FuzzyRowFilter.getNextForFuzzyRule(
new byte[]{2, 1, 1, 1, 0},
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0}));
new byte[]{-1, -1, 0, -1}));
}
@Test
public void testGetNextForFuzzyRuleReverse() {
assertNext(true,
new byte[]{0, 1, 2}, // fuzzy row
new byte[]{1, 0, 0}, // mask
new byte[]{0, -1, -1}, // mask
new byte[]{1, 2, 1, 0, 1}, // current
// TODO: should be {1, 1, 3} ?
new byte[]{1, 1, 2, (byte) 0xFF, (byte) 0xFF}); // expected next
assertNext(true,
new byte[]{0, 1, 0, 2, 0}, // fuzzy row
new byte[]{1, 0, 1, 0, 1}, // mask
new byte[]{0, -1, 0, -1, 0}, // mask
new byte[]{1, 2, 1, 3, 1}, // current
// TODO: should be {1, 1, 1, 3} ?
new byte[]{1, 1, 0, 2, 0}); // expected next
assertNext(true,
new byte[]{1, 0, 1},
new byte[]{0, 1, 0},
new byte[]{-1, 0, -1},
new byte[]{1, (byte) 128, 2, 0, 1},
// TODO: should be {1, (byte) 128, 2} ?
new byte[]{1, (byte) 128, 1, (byte) 0xFF, (byte) 0xFF});
assertNext(true,
new byte[]{0, 1, 0, 1},
new byte[]{1, 0, 1, 0},
new byte[]{0, -1, 0, -1},
new byte[]{5, 1, 0, 2, 1},
// TODO: should be {5, 1, 0, 2} ?
new byte[]{5, 1, 0, 1, (byte) 0xFF});
assertNext(true,
new byte[]{0, 1, 0, 0}, // fuzzy row
new byte[]{1, 0, 1, 1}, // mask
new byte[]{0, -1, 0, 0}, // mask
new byte[]{5, 1, (byte) 255, 1}, // current
new byte[]{5, 1, (byte) 255, 0}); // expected next
assertNext(true,
new byte[]{0, 1, 0, 1}, // fuzzy row
new byte[]{1, 0, 1, 0}, // mask
new byte[]{0, -1, 0, -1}, // mask
new byte[]{5, 1, 0, 1}, // current
new byte[]{4, 1, (byte) 255, 1}); // expected next
assertNext(true,
new byte[]{0, 1, 0, 1}, // fuzzy row
new byte[]{1, 0, 1, 0}, // mask
new byte[]{0, -1, 0, -1}, // mask
new byte[]{5, 1, (byte) 255, 0}, // current
new byte[]{5, 1, (byte) 254, 1}); // expected next
assertNext(true,
new byte[]{1, 1, 0, 0},
new byte[]{0, 0, 1, 1},
new byte[]{-1, -1, 0, 0},
new byte[]{2, 1, 3, 2},
// TODO: should be {1, 0} ?
new byte[]{1, 1, 0, 0});
assertNext(true,
new byte[]{1, 0, 1}, // fuzzy row
new byte[]{0, 1, 0}, // mask
new byte[]{-1, 0, -1}, // mask
new byte[]{2, 3, 1, 1, 1}, // row to check
// TODO: should be {1, (byte) 0xFF, 2} ?
new byte[]{1, 0, 1, (byte) 0xFF, (byte) 0xFF});
assertNext(true,
new byte[]{1, 1, 0, 3},
new byte[]{0, 0, 1, 0},
new byte[]{-1, -1, 0, -1},
new byte[]{1, (byte) 245, 1, 3, 0},
// TODO: should be {1, 1, (byte) 255, 4} ?
new byte[]{1, 1, 0, 3, (byte) 0xFF});
assertNext(true,
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0},
new byte[]{-1, -1, 0, -1},
new byte[]{1, 3, 1, 3, 0},
// TODO: should be 1, 2, (byte) 255, 4 ?
new byte[]{1, 2, 0, 3, (byte) 0xFF});
assertNext(true,
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0},
new byte[]{-1, -1, 0, -1},
new byte[]{2, 1, 1, 1, 0},
// TODO: should be {1, 2, (byte) 255, 4} ?
new byte[]{1, 2, 0, 3, (byte) 0xFF});
@ -362,42 +421,42 @@ public class TestFuzzyRowFilter {
assertNext(true,
// TODO: should be null?
new byte[]{1, 0, 1},
new byte[]{0, 1, 0},
new byte[]{-1, 0, -1},
new byte[]{1, (byte) 128, 2},
new byte[]{1, (byte) 128, 1});
assertNext(true,
// TODO: should be null?
new byte[]{0, 1, 0, 1},
new byte[]{1, 0, 1, 0},
new byte[]{0, -1, 0, -1},
new byte[]{5, 1, 0, 2},
new byte[]{5, 1, 0, 1});
assertNext(true,
// TODO: should be null?
new byte[]{5, 1, 1, 0},
new byte[]{0, 0, 1, 1},
new byte[]{-1, -1, 0, 0},
new byte[]{5, 1, (byte) 0xFF, 1},
new byte[]{5, 1, (byte) 0xFF, 0});
assertNext(true,
// TODO: should be null?
new byte[]{1, 1, 1, 1},
new byte[]{0, 0, 1, 1},
new byte[]{-1, -1, 0, 0},
new byte[]{1, 1, 2, 2},
new byte[]{1, 1, 2, 1});
assertNext(true,
// TODO: should be null?
new byte[]{1, 1, 1, 1},
new byte[]{1, 1, 1, 1},
new byte[]{0, 0, 0, 0},
new byte[]{1, 1, 2, 3},
new byte[]{1, 1, 2, 2});
Assert.assertNull(FuzzyRowFilter.getNextForFuzzyRule(true,
new byte[]{1, 1, 1, 3, 0},
new byte[]{1, 2, 0, 3},
new byte[]{0, 0, 1, 0}));
new byte[]{-1, -1, 0, -1}));
}
private static void assertNext(boolean reverse, byte[] fuzzyRow, byte[] mask, byte[] current,

312
hbase-server/src/test/java/org/apache/hadoop/hbase/filter/TestFuzzyRowFilterEndToEnd.java Normal file
View File

@ -0,0 +1,312 @@
/**
* 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.filter;
import static org.junit.Assert.assertEquals;
import java.io.IOException;
import java.nio.ByteBuffer;
import java.util.ArrayList;
import java.util.List;
import org.apache.commons.logging.Log;
import org.apache.commons.logging.LogFactory;
import org.apache.hadoop.conf.Configuration;
import org.apache.hadoop.hbase.Cell;
import org.apache.hadoop.hbase.CellUtil;
import org.apache.hadoop.hbase.HBaseTestingUtility;
import org.apache.hadoop.hbase.HConstants;
import org.apache.hadoop.hbase.TableName;
import org.apache.hadoop.hbase.client.Durability;
import org.apache.hadoop.hbase.client.Put;
import org.apache.hadoop.hbase.client.Result;
import org.apache.hadoop.hbase.client.ResultScanner;
import org.apache.hadoop.hbase.client.Scan;
import org.apache.hadoop.hbase.client.HTable;
import org.apache.hadoop.hbase.filter.FilterList.Operator;
import org.apache.hadoop.hbase.regionserver.ConstantSizeRegionSplitPolicy;
import org.apache.hadoop.hbase.regionserver.HRegion;
import org.apache.hadoop.hbase.regionserver.RegionScanner;
import org.apache.hadoop.hbase.testclassification.MediumTests;
import org.apache.hadoop.hbase.util.Bytes;
import org.apache.hadoop.hbase.util.Pair;
import org.junit.After;
import org.junit.AfterClass;
import org.junit.Before;
import org.junit.BeforeClass;
import org.junit.Test;
import org.junit.experimental.categories.Category;
import com.google.common.collect.Lists;
/**
*/
@Category(MediumTests.class)
public class TestFuzzyRowFilterEndToEnd {
private final static HBaseTestingUtility TEST_UTIL = new HBaseTestingUtility();
private static final Log LOG = LogFactory.getLog(TestFuzzyRowFilterEndToEnd.class);
private static int firstPartCardinality = 50;
private static int secondPartCardinality = 40;
private static int colQualifiersTotal = 50;
private static int totalFuzzyKeys = secondPartCardinality / 2;
private static String table = "TestFuzzyRowFilterEndToEnd";
/**
* @throws java.lang.Exception
*/
@BeforeClass
public static void setUpBeforeClass() throws Exception {
Configuration conf = TEST_UTIL.getConfiguration();
conf.setInt("hbase.client.scanner.caching", 1000);
conf.set(HConstants.HBASE_REGION_SPLIT_POLICY_KEY,
ConstantSizeRegionSplitPolicy.class.getName());
// set no splits
conf.setLong(HConstants.HREGION_MAX_FILESIZE, ((long) 1024) * 1024 * 1024 * 10);
TEST_UTIL.startMiniCluster();
}
/**
* @throws java.lang.Exception
*/
@AfterClass
public static void tearDownAfterClass() throws Exception {
TEST_UTIL.shutdownMiniCluster();
}
/**
* @throws java.lang.Exception
*/
@Before
public void setUp() throws Exception {
// Nothing to do.
}
/**
* @throws java.lang.Exception
*/
@After
public void tearDown() throws Exception {
// Nothing to do.
}
@Test
public void testEndToEnd() throws Exception {
String cf = "f";
HTable ht =
TEST_UTIL.createTable(TableName.valueOf(table), Bytes.toBytes(cf), Integer.MAX_VALUE);
// 10 byte row key - (2 bytes 4 bytes 4 bytes)
// 4 byte qualifier
// 4 byte value
for (int i1 = 0; i1 < firstPartCardinality; i1++) {
if ((i1 % 1000) == 0) LOG.info("put " + i1);
for (int i2 = 0; i2 < secondPartCardinality; i2++) {
byte[] rk = new byte[10];
ByteBuffer buf = ByteBuffer.wrap(rk);
buf.clear();
buf.putShort((short) 2);
buf.putInt(i1);
buf.putInt(i2);
for (int c = 0; c < colQualifiersTotal; c++) {
byte[] cq = new byte[4];
Bytes.putBytes(cq, 0, Bytes.toBytes(c), 0, 4);
Put p = new Put(rk);
p.setDurability(Durability.SKIP_WAL);
p.add(cf.getBytes(), cq, Bytes.toBytes(c));
ht.put(p);
}
}
}
TEST_UTIL.flush();
// test passes
runTest(ht);
}
private void runTest(HTable hTable) throws IOException {
// [0, 2, ?, ?, ?, ?, 0, 0, 0, 1]
byte[] mask = new byte[] { 0, 0, 1, 1, 1, 1, 0, 0, 0, 0 };
List<Pair<byte[], byte[]>> list = new ArrayList<Pair<byte[], byte[]>>();
for (int i = 0; i < totalFuzzyKeys; i++) {
byte[] fuzzyKey = new byte[10];
ByteBuffer buf = ByteBuffer.wrap(fuzzyKey);
buf.clear();
buf.putShort((short) 2);
for (int j = 0; j < 4; j++) {
buf.put((byte) 63);
}
buf.putInt(i);
Pair<byte[], byte[]> pair = new Pair<byte[], byte[]>(fuzzyKey, mask);
list.add(pair);
}
int expectedSize = firstPartCardinality * totalFuzzyKeys * colQualifiersTotal;
FuzzyRowFilter fuzzyRowFilter0 = new FuzzyRowFilter(list);
// Filters are not stateless - we can't reuse them
FuzzyRowFilter fuzzyRowFilter1 = new FuzzyRowFilter(list);
// regular test
runScanner(hTable, expectedSize, fuzzyRowFilter0);
// optimized from block cache
runScanner(hTable, expectedSize, fuzzyRowFilter1);
}
private void runScanner(HTable hTable, int expectedSize, Filter filter) throws IOException {
String cf = "f";
Scan scan = new Scan();
scan.addFamily(cf.getBytes());
scan.setFilter(filter);
List<HRegion> regions = TEST_UTIL.getHBaseCluster().getRegions(table.getBytes());
HRegion first = regions.get(0);
first.getScanner(scan);
RegionScanner scanner = first.getScanner(scan);
List<Cell> results = new ArrayList<Cell>();
// Result result;
long timeBeforeScan = System.currentTimeMillis();
int found = 0;
while (scanner.next(results)) {
found += results.size();
results.clear();
}
found += results.size();
long scanTime = System.currentTimeMillis() - timeBeforeScan;
scanner.close();
LOG.info("\nscan time = " + scanTime + "ms");
LOG.info("found " + found + " results\n");
assertEquals(expectedSize, found);
}
@SuppressWarnings("deprecation")
@Test
public void testFilterList() throws Exception {
String cf = "f";
String table = "TestFuzzyRowFiltersInFilterList";
HTable ht =
TEST_UTIL.createTable(TableName.valueOf(table), Bytes.toBytes(cf), Integer.MAX_VALUE);
// 10 byte row key - (2 bytes 4 bytes 4 bytes)
// 4 byte qualifier
// 4 byte value
for (int i1 = 0; i1 < 5; i1++) {
for (int i2 = 0; i2 < 5; i2++) {
byte[] rk = new byte[10];
ByteBuffer buf = ByteBuffer.wrap(rk);
buf.clear();
buf.putShort((short) 2);
buf.putInt(i1);
buf.putInt(i2);
// Each row contains 5 columns
for (int c = 0; c < 5; c++) {
byte[] cq = new byte[4];
Bytes.putBytes(cq, 0, Bytes.toBytes(c), 0, 4);
Put p = new Put(rk);
p.setDurability(Durability.SKIP_WAL);
p.add(cf.getBytes(), cq, Bytes.toBytes(c));
ht.put(p);
LOG.info("Inserting: rk: " + Bytes.toStringBinary(rk) + " cq: "
+ Bytes.toStringBinary(cq));
}
}
}
TEST_UTIL.flush();
// test passes if we get back 5 KV's (1 row)
runTest(ht, 5);
}
@SuppressWarnings("unchecked")
private void runTest(HTable hTable, int expectedSize) throws IOException {
// [0, 2, ?, ?, ?, ?, 0, 0, 0, 1]
byte[] fuzzyKey1 = new byte[10];
ByteBuffer buf = ByteBuffer.wrap(fuzzyKey1);
buf.clear();
buf.putShort((short) 2);
for (int i = 0; i < 4; i++)
buf.put((byte) 63);
buf.putInt((short) 1);
byte[] mask1 = new byte[] { 0, 0, 1, 1, 1, 1, 0, 0, 0, 0 };
byte[] fuzzyKey2 = new byte[10];
buf = ByteBuffer.wrap(fuzzyKey2);
buf.clear();
buf.putShort((short) 2);
buf.putInt((short) 2);
for (int i = 0; i < 4; i++)
buf.put((byte) 63);
byte[] mask2 = new byte[] { 0, 0, 0, 0, 0, 0, 1, 1, 1, 1 };
Pair<byte[], byte[]> pair1 = new Pair<byte[], byte[]>(fuzzyKey1, mask1);
Pair<byte[], byte[]> pair2 = new Pair<byte[], byte[]>(fuzzyKey2, mask2);
FuzzyRowFilter fuzzyRowFilter1 = new FuzzyRowFilter(Lists.newArrayList(pair1));
FuzzyRowFilter fuzzyRowFilter2 = new FuzzyRowFilter(Lists.newArrayList(pair2));
// regular test - we expect 1 row back (5 KVs)
runScanner(hTable, expectedSize, fuzzyRowFilter1, fuzzyRowFilter2);
}
private void runScanner(HTable hTable, int expectedSize, Filter filter1, Filter filter2) throws IOException {
String cf = "f";
Scan scan = new Scan();
scan.addFamily(cf.getBytes());
FilterList filterList = new FilterList(Operator.MUST_PASS_ALL, filter1, filter2);
scan.setFilter(filterList);
ResultScanner scanner = hTable.getScanner(scan);
List<Cell> results = new ArrayList<Cell>();
Result result;
long timeBeforeScan = System.currentTimeMillis();
while ((result = scanner.next()) != null) {
for (Cell kv : result.listCells()) {
LOG.info("Got rk: " + Bytes.toStringBinary(CellUtil.cloneRow(kv)) + " cq: "
+ Bytes.toStringBinary(CellUtil.cloneQualifier(kv)));
results.add(kv);
}
}
long scanTime = System.currentTimeMillis() - timeBeforeScan;
scanner.close();
LOG.info("scan time = " + scanTime + "ms");
LOG.info("found " + results.size() + " results");
assertEquals(expectedSize, results.size());
}
}