HBASE-14940 Make our unsafe based ops more safe.

This commit is contained in:
anoopsjohn 2015-12-24 07:54:13 +05:30
parent 04de427e57
commit 6fc2596ab3
5 changed files with 79 additions and 37 deletions

View File

@ -94,7 +94,7 @@ public class FuzzyRowFilter extends FilterBase {
} }
private void preprocessSearchKey(Pair<byte[], byte[]> p) { private void preprocessSearchKey(Pair<byte[], byte[]> p) {
if (UnsafeAccess.isAvailable() == false) { if (UnsafeAccess.unaligned() == false) {
// do nothing // do nothing
return; return;
} }
@ -113,7 +113,7 @@ public class FuzzyRowFilter extends FilterBase {
* @return mask array * @return mask array
*/ */
private byte[] preprocessMask(byte[] mask) { private byte[] preprocessMask(byte[] mask) {
if (UnsafeAccess.isAvailable() == false) { if (UnsafeAccess.unaligned() == false) {
// do nothing // do nothing
return mask; return mask;
} }
@ -322,7 +322,7 @@ public class FuzzyRowFilter extends FilterBase {
static SatisfiesCode satisfies(boolean reverse, byte[] row, int offset, int length, static SatisfiesCode satisfies(boolean reverse, byte[] row, int offset, int length,
byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) { byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {
if (UnsafeAccess.isAvailable() == false) { if (UnsafeAccess.unaligned() == false) {
return satisfiesNoUnsafe(reverse, row, offset, length, fuzzyKeyBytes, fuzzyKeyMeta); return satisfiesNoUnsafe(reverse, row, offset, length, fuzzyKeyBytes, fuzzyKeyMeta);
} }

View File

@ -34,6 +34,7 @@ import sun.nio.ch.DirectBuffer;
public class SingleByteBuff extends ByteBuff { public class SingleByteBuff extends ByteBuff {
private static final boolean UNSAFE_AVAIL = UnsafeAccess.isAvailable(); private static final boolean UNSAFE_AVAIL = UnsafeAccess.isAvailable();
private static final boolean UNSAFE_UNALIGNED = UnsafeAccess.unaligned();
// Underlying BB // Underlying BB
private final ByteBuffer buf; private final ByteBuffer buf;
@ -237,7 +238,7 @@ public class SingleByteBuff extends ByteBuff {
@Override @Override
public short getShort(int index) { public short getShort(int index) {
if (UNSAFE_AVAIL) { if (UNSAFE_UNALIGNED) {
return UnsafeAccess.toShort(unsafeRef, unsafeOffset + index); return UnsafeAccess.toShort(unsafeRef, unsafeOffset + index);
} }
return this.buf.getShort(index); return this.buf.getShort(index);
@ -261,7 +262,7 @@ public class SingleByteBuff extends ByteBuff {
@Override @Override
public int getInt(int index) { public int getInt(int index) {
if (UNSAFE_AVAIL) { if (UNSAFE_UNALIGNED) {
return UnsafeAccess.toInt(unsafeRef, unsafeOffset + index); return UnsafeAccess.toInt(unsafeRef, unsafeOffset + index);
} }
return this.buf.getInt(index); return this.buf.getInt(index);
@ -285,7 +286,7 @@ public class SingleByteBuff extends ByteBuff {
@Override @Override
public long getLong(int index) { public long getLong(int index) {
if (UNSAFE_AVAIL) { if (UNSAFE_UNALIGNED) {
return UnsafeAccess.toLong(unsafeRef, unsafeOffset + index); return UnsafeAccess.toLong(unsafeRef, unsafeOffset + index);
} }
return this.buf.getLong(index); return this.buf.getLong(index);

View File

@ -47,6 +47,7 @@ public final class ByteBufferUtils {
public final static int NEXT_BIT_SHIFT = 7; public final static int NEXT_BIT_SHIFT = 7;
public final static int NEXT_BIT_MASK = 1 << 7; public final static int NEXT_BIT_MASK = 1 << 7;
private static final boolean UNSAFE_AVAIL = UnsafeAccess.isAvailable(); private static final boolean UNSAFE_AVAIL = UnsafeAccess.isAvailable();
private static final boolean UNSAFE_UNALIGNED = UnsafeAccess.unaligned();
private ByteBufferUtils() { private ByteBufferUtils() {
} }
@ -392,9 +393,12 @@ public final class ByteBufferUtils {
} else if (UNSAFE_AVAIL) { } else if (UNSAFE_AVAIL) {
UnsafeAccess.copy(in, sourceOffset, out, destinationOffset, length); UnsafeAccess.copy(in, sourceOffset, out, destinationOffset, length);
} else { } else {
for (int i = 0; i < length; ++i) { int outOldPos = out.position();
putByte(out, destinationOffset + i, toByte(in, sourceOffset + i)); out.position(destinationOffset);
} ByteBuffer inDup = in.duplicate();
inDup.position(sourceOffset).limit(sourceOffset + length);
out.put(inDup);
out.position(outOldPos);
} }
return destinationOffset + length; return destinationOffset + length;
} }
@ -414,15 +418,15 @@ public final class ByteBufferUtils {
if (in.hasArray() && out.hasArray()) { if (in.hasArray() && out.hasArray()) {
System.arraycopy(in.array(), sourceOffset + in.arrayOffset(), out.array(), out.position() System.arraycopy(in.array(), sourceOffset + in.arrayOffset(), out.array(), out.position()
+ out.arrayOffset(), length); + out.arrayOffset(), length);
skip(out, length);
} else if (UNSAFE_AVAIL) { } else if (UNSAFE_AVAIL) {
UnsafeAccess.copy(in, sourceOffset, out, out.position(), length); UnsafeAccess.copy(in, sourceOffset, out, out.position(), length);
skip(out, length);
} else { } else {
int destOffset = out.position(); ByteBuffer inDup = in.duplicate();
for (int i = 0; i < length; ++i) { inDup.position(sourceOffset).limit(sourceOffset + length);
putByte(out, destOffset + i, toByte(in, sourceOffset + i)); out.put(inDup);
}
} }
skip(out, length);
} }
/** /**
@ -574,7 +578,7 @@ public final class ByteBufferUtils {
} }
public static int compareTo(ByteBuffer buf1, int o1, int l1, ByteBuffer buf2, int o2, int l2) { public static int compareTo(ByteBuffer buf1, int o1, int l1, ByteBuffer buf2, int o2, int l2) {
if (UNSAFE_AVAIL) { if (UNSAFE_UNALIGNED) {
long offset1Adj, offset2Adj; long offset1Adj, offset2Adj;
Object refObj1 = null, refObj2 = null; Object refObj1 = null, refObj2 = null;
if (buf1.isDirect()) { if (buf1.isDirect()) {
@ -612,7 +616,7 @@ public final class ByteBufferUtils {
} }
public static int compareTo(ByteBuffer buf1, int o1, int l1, byte[] buf2, int o2, int l2) { public static int compareTo(ByteBuffer buf1, int o1, int l1, byte[] buf2, int o2, int l2) {
if (UNSAFE_AVAIL) { if (UNSAFE_UNALIGNED) {
long offset1Adj; long offset1Adj;
Object refObj1 = null; Object refObj1 = null;
if (buf1.isDirect()) { if (buf1.isDirect()) {
@ -725,7 +729,7 @@ public final class ByteBufferUtils {
* @return short value at offset * @return short value at offset
*/ */
public static short toShort(ByteBuffer buffer, int offset) { public static short toShort(ByteBuffer buffer, int offset) {
if (UNSAFE_AVAIL) { if (UNSAFE_UNALIGNED) {
return UnsafeAccess.toShort(buffer, offset); return UnsafeAccess.toShort(buffer, offset);
} else { } else {
return buffer.getShort(offset); return buffer.getShort(offset);
@ -739,7 +743,7 @@ public final class ByteBufferUtils {
* @return int value at offset * @return int value at offset
*/ */
public static int toInt(ByteBuffer buffer, int offset) { public static int toInt(ByteBuffer buffer, int offset) {
if (UNSAFE_AVAIL) { if (UNSAFE_UNALIGNED) {
return UnsafeAccess.toInt(buffer, offset); return UnsafeAccess.toInt(buffer, offset);
} else { } else {
return buffer.getInt(offset); return buffer.getInt(offset);
@ -753,7 +757,7 @@ public final class ByteBufferUtils {
* @return long value at offset * @return long value at offset
*/ */
public static long toLong(ByteBuffer buffer, int offset) { public static long toLong(ByteBuffer buffer, int offset) {
if (UNSAFE_AVAIL) { if (UNSAFE_UNALIGNED) {
return UnsafeAccess.toLong(buffer, offset); return UnsafeAccess.toLong(buffer, offset);
} else { } else {
return buffer.getLong(offset); return buffer.getLong(offset);
@ -767,7 +771,7 @@ public final class ByteBufferUtils {
* @param val int to write out * @param val int to write out
*/ */
public static void putInt(ByteBuffer buffer, int val) { public static void putInt(ByteBuffer buffer, int val) {
if (UNSAFE_AVAIL) { if (UNSAFE_UNALIGNED) {
int newPos = UnsafeAccess.putInt(buffer, buffer.position(), val); int newPos = UnsafeAccess.putInt(buffer, buffer.position(), val);
buffer.position(newPos); buffer.position(newPos);
} else { } else {
@ -810,7 +814,7 @@ public final class ByteBufferUtils {
* @param val short to write out * @param val short to write out
*/ */
public static void putShort(ByteBuffer buffer, short val) { public static void putShort(ByteBuffer buffer, short val) {
if (UNSAFE_AVAIL) { if (UNSAFE_UNALIGNED) {
int newPos = UnsafeAccess.putShort(buffer, buffer.position(), val); int newPos = UnsafeAccess.putShort(buffer, buffer.position(), val);
buffer.position(newPos); buffer.position(newPos);
} else { } else {
@ -825,7 +829,7 @@ public final class ByteBufferUtils {
* @param val long to write out * @param val long to write out
*/ */
public static void putLong(ByteBuffer buffer, long val) { public static void putLong(ByteBuffer buffer, long val) {
if (UNSAFE_AVAIL) { if (UNSAFE_UNALIGNED) {
int newPos = UnsafeAccess.putLong(buffer, buffer.position(), val); int newPos = UnsafeAccess.putLong(buffer, buffer.position(), val);
buffer.position(newPos); buffer.position(newPos);
} else { } else {
@ -870,9 +874,10 @@ public final class ByteBufferUtils {
} else if (UNSAFE_AVAIL) { } else if (UNSAFE_AVAIL) {
UnsafeAccess.copy(in, sourceOffset, out, destinationOffset, length); UnsafeAccess.copy(in, sourceOffset, out, destinationOffset, length);
} else { } else {
for (int i = 0; i < length; i++) { int oldPos = in.position();
out[destinationOffset + i] = in.get(sourceOffset + i); in.position(sourceOffset);
} in.get(out, destinationOffset, length);
in.position(oldPos);
} }
} }

View File

@ -789,7 +789,7 @@ public class Bytes implements Comparable<Bytes> {
if (length != SIZEOF_LONG || offset + length > bytes.length) { if (length != SIZEOF_LONG || offset + length > bytes.length) {
throw explainWrongLengthOrOffset(bytes, offset, length, SIZEOF_LONG); throw explainWrongLengthOrOffset(bytes, offset, length, SIZEOF_LONG);
} }
if (UnsafeAccess.isAvailable()) { if (UnsafeAccess.unaligned()) {
return UnsafeAccess.toLong(bytes, offset); return UnsafeAccess.toLong(bytes, offset);
} else { } else {
long l = 0; long l = 0;
@ -830,7 +830,7 @@ public class Bytes implements Comparable<Bytes> {
throw new IllegalArgumentException("Not enough room to put a long at" throw new IllegalArgumentException("Not enough room to put a long at"
+ " offset " + offset + " in a " + bytes.length + " byte array"); + " offset " + offset + " in a " + bytes.length + " byte array");
} }
if (UnsafeAccess.isAvailable()) { if (UnsafeAccess.unaligned()) {
return UnsafeAccess.putLong(bytes, offset, val); return UnsafeAccess.putLong(bytes, offset, val);
} else { } else {
for(int i = offset + 7; i > offset; i--) { for(int i = offset + 7; i > offset; i--) {
@ -981,7 +981,7 @@ public class Bytes implements Comparable<Bytes> {
if (length != SIZEOF_INT || offset + length > bytes.length) { if (length != SIZEOF_INT || offset + length > bytes.length) {
throw explainWrongLengthOrOffset(bytes, offset, length, SIZEOF_INT); throw explainWrongLengthOrOffset(bytes, offset, length, SIZEOF_INT);
} }
if (UnsafeAccess.isAvailable()) { if (UnsafeAccess.unaligned()) {
return UnsafeAccess.toInt(bytes, offset); return UnsafeAccess.toInt(bytes, offset);
} else { } else {
int n = 0; int n = 0;
@ -1065,7 +1065,7 @@ public class Bytes implements Comparable<Bytes> {
throw new IllegalArgumentException("Not enough room to put an int at" throw new IllegalArgumentException("Not enough room to put an int at"
+ " offset " + offset + " in a " + bytes.length + " byte array"); + " offset " + offset + " in a " + bytes.length + " byte array");
} }
if (UnsafeAccess.isAvailable()) { if (UnsafeAccess.unaligned()) {
return UnsafeAccess.putInt(bytes, offset, val); return UnsafeAccess.putInt(bytes, offset, val);
} else { } else {
for(int i= offset + 3; i > offset; i--) { for(int i= offset + 3; i > offset; i--) {
@ -1135,7 +1135,7 @@ public class Bytes implements Comparable<Bytes> {
if (length != SIZEOF_SHORT || offset + length > bytes.length) { if (length != SIZEOF_SHORT || offset + length > bytes.length) {
throw explainWrongLengthOrOffset(bytes, offset, length, SIZEOF_SHORT); throw explainWrongLengthOrOffset(bytes, offset, length, SIZEOF_SHORT);
} }
if (UnsafeAccess.isAvailable()) { if (UnsafeAccess.unaligned()) {
return UnsafeAccess.toShort(bytes, offset); return UnsafeAccess.toShort(bytes, offset);
} else { } else {
short n = 0; short n = 0;
@ -1173,7 +1173,7 @@ public class Bytes implements Comparable<Bytes> {
throw new IllegalArgumentException("Not enough room to put a short at" throw new IllegalArgumentException("Not enough room to put a short at"
+ " offset " + offset + " in a " + bytes.length + " byte array"); + " offset " + offset + " in a " + bytes.length + " byte array");
} }
if (UnsafeAccess.isAvailable()) { if (UnsafeAccess.unaligned()) {
return UnsafeAccess.putShort(bytes, offset, val); return UnsafeAccess.putShort(bytes, offset, val);
} else { } else {
bytes[offset+1] = (byte) val; bytes[offset+1] = (byte) val;
@ -1477,7 +1477,7 @@ public class Bytes implements Comparable<Bytes> {
static final Unsafe theUnsafe; static final Unsafe theUnsafe;
static { static {
if (UnsafeAccess.isAvailable()) { if (UnsafeAccess.unaligned()) {
theUnsafe = UnsafeAccess.theUnsafe; theUnsafe = UnsafeAccess.theUnsafe;
} else { } else {
// It doesn't matter what we throw; // It doesn't matter what we throw;

View File

@ -18,6 +18,7 @@
package org.apache.hadoop.hbase.util; package org.apache.hadoop.hbase.util;
import java.lang.reflect.Field; import java.lang.reflect.Field;
import java.lang.reflect.Method;
import java.nio.ByteBuffer; import java.nio.ByteBuffer;
import java.nio.ByteOrder; import java.nio.ByteOrder;
import java.security.AccessController; import java.security.AccessController;
@ -38,6 +39,7 @@ public final class UnsafeAccess {
private static final Log LOG = LogFactory.getLog(UnsafeAccess.class); private static final Log LOG = LogFactory.getLog(UnsafeAccess.class);
static final Unsafe theUnsafe; static final Unsafe theUnsafe;
private static boolean unaligned;
/** The offset to the first element in a byte array. */ /** The offset to the first element in a byte array. */
public static final long BYTE_ARRAY_BASE_OFFSET; public static final long BYTE_ARRAY_BASE_OFFSET;
@ -45,6 +47,11 @@ public final class UnsafeAccess {
static final boolean littleEndian = ByteOrder.nativeOrder() static final boolean littleEndian = ByteOrder.nativeOrder()
.equals(ByteOrder.LITTLE_ENDIAN); .equals(ByteOrder.LITTLE_ENDIAN);
// This number limits the number of bytes to copy per call to Unsafe's
// copyMemory method. A limit is imposed to allow for safepoint polling
// during a large copy
static final long UNSAFE_COPY_THRESHOLD = 1024L * 1024L;
static { static {
theUnsafe = (Unsafe) AccessController.doPrivileged(new PrivilegedAction<Object>() { theUnsafe = (Unsafe) AccessController.doPrivileged(new PrivilegedAction<Object>() {
@Override @Override
@ -60,22 +67,40 @@ public final class UnsafeAccess {
} }
}); });
if(theUnsafe != null){ if (theUnsafe != null) {
BYTE_ARRAY_BASE_OFFSET = theUnsafe.arrayBaseOffset(byte[].class); BYTE_ARRAY_BASE_OFFSET = theUnsafe.arrayBaseOffset(byte[].class);
try {
// Using java.nio.Bits#unaligned() to check for unaligned-access capability
Class<?> clazz = Class.forName("java.nio.Bits");
Method m = clazz.getDeclaredMethod("unaligned");
m.setAccessible(true);
unaligned = (boolean) m.invoke(null);
} catch (Exception e) {
unaligned = false;
}
} else{ } else{
BYTE_ARRAY_BASE_OFFSET = -1; BYTE_ARRAY_BASE_OFFSET = -1;
unaligned = false;
} }
} }
private UnsafeAccess(){} private UnsafeAccess(){}
/** /**
* @return true when the running JVM is having sun's Unsafe package available in it. * @return true when running JVM is having sun's Unsafe package available in it.
*/ */
public static boolean isAvailable() { public static boolean isAvailable() {
return theUnsafe != null; return theUnsafe != null;
} }
/**
* @return true when running JVM is having sun's Unsafe package available in it and underlying
* system having unaligned-access capability.
*/
public static boolean unaligned() {
return unaligned;
}
// APIs to read primitive data from a byte[] using Unsafe way // APIs to read primitive data from a byte[] using Unsafe way
/** /**
* Converts a byte array to a short value considering it was written in big-endian format. * Converts a byte array to a short value considering it was written in big-endian format.
@ -330,7 +355,17 @@ public final class UnsafeAccess {
destBase = dest.array(); destBase = dest.array();
} }
long srcAddress = srcOffset + BYTE_ARRAY_BASE_OFFSET; long srcAddress = srcOffset + BYTE_ARRAY_BASE_OFFSET;
theUnsafe.copyMemory(src, srcAddress, destBase, destAddress, length); unsafeCopy(src, srcAddress, destBase, destAddress, length);
}
private static void unsafeCopy(Object src, long srcAddr, Object dst, long destAddr, long len) {
while (len > 0) {
long size = (len > UNSAFE_COPY_THRESHOLD) ? UNSAFE_COPY_THRESHOLD : len;
theUnsafe.copyMemory(src, srcAddr, dst, destAddr, len);
len -= size;
srcAddr += size;
destAddr += size;
}
} }
/** /**
@ -354,7 +389,7 @@ public final class UnsafeAccess {
srcBase = src.array(); srcBase = src.array();
} }
long destAddress = destOffset + BYTE_ARRAY_BASE_OFFSET; long destAddress = destOffset + BYTE_ARRAY_BASE_OFFSET;
theUnsafe.copyMemory(srcBase, srcAddress, dest, destAddress, length); unsafeCopy(srcBase, srcAddress, dest, destAddress, length);
} }
/** /**
@ -383,8 +418,9 @@ public final class UnsafeAccess {
destAddress = destOffset + BYTE_ARRAY_BASE_OFFSET + dest.arrayOffset(); destAddress = destOffset + BYTE_ARRAY_BASE_OFFSET + dest.arrayOffset();
destBase = dest.array(); destBase = dest.array();
} }
theUnsafe.copyMemory(srcBase, srcAddress, destBase, destAddress, length); unsafeCopy(srcBase, srcAddress, destBase, destAddress, length);
} }
// APIs to add primitives to BBs // APIs to add primitives to BBs
/** /**
* Put a short value out to the specified BB position in big-endian format. * Put a short value out to the specified BB position in big-endian format.