All Downloads are FREE. Search and download functionalities are using the official Maven repository.

net.openhft.hashing.Access Maven / Gradle / Ivy

/*
 * Copyright 2014 Higher Frequency Trading http://www.higherfrequencytrading.com
 *
 * Licensed 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 net.openhft.hashing;

import java.nio.ByteBuffer;
import java.nio.ByteOrder;

import static java.nio.ByteOrder.LITTLE_ENDIAN;

/**
 * Strategy of reading bytes, defines the abstraction of {@code T} class instances as ordered byte
 * sequence. All {@code getXXX(input, offset)} should be consistent to each other in terms of
 * ordered byte sequence each {@code T} instance represents. For example, if some {@code
 * Access} implementation returns {@link ByteOrder#LITTLE_ENDIAN} on {@link #byteOrder(Object)
 * byteOrder(input)} call, the following expressions should always have the same value:
 * 
    *
  • {@code getLong(input, 0)}
  • *
  • {@code getUnsignedInt(input, 0) | (getUnsignedInt(input, 4) << 32)}
  • *
  • {@code getUnsignedInt(input, 0) |
     *    ((long) getUnsignedShort(input, 4) << 32) |
     *    ((long) getUnsignedByte(input, 6) << 48) |
     *    ((long) getUnsignedByte(input, 7) << 56)}
  • *
  • And so on
  • *
* *

{@code getXXX(input, offset)} methods could throw unchecked exceptions when requested bytes * range is outside of the bounds of the byte sequence, represented by the given {@code input}. * However, they could omit checks for better performance. * *

Only {@link #getByte(Object, long)} and {@link #byteOrder(Object)} methods are abstract in * this class, so implementing them is sufficient for valid {@code Access} instance, but for * efficiency your should override methods used by target {@link LongHashFunction} implementation. * *

{@code Access} API is designed for inputs, that actually represent byte sequences that lay * continuously in memory. Theoretically {@code Access} strategy could be implemented for * non-continuous byte sequences, or abstractions which aren't actually present in memory as they * are accessed, but this should be awkward, and hashing using such {@code Access} is expected to * be slow. * * @param the type of the object to access * @see LongHashFunction#hash(Object, Access, long, long) */ public abstract class Access { /** * Returns the {@code Access} delegating {@code getXXX(input, offset)} methods to {@code * sun.misc.Unsafe.getXXX(input, offset)}. * *

Usage example:

{@code
     * class Pair {
     *     long first, second;
     *
     *     static final long pairDataOffset =
     *         theUnsafe.objectFieldOffset(Pair.class.getDeclaredField("first"));
     *
     *     static long hashPair(Pair pair, LongHashFunction hashFunction) {
     *         return hashFunction.hash(pair, Access.unsafe(), pairDataOffset, 16L);
     *     }
     * }}
* *

{@code null} is a valid input, on accepting {@code null} {@code Unsafe} just interprets * the given offset as a wild memory address. Note that for hashing memory by address there is * a shortcut {@link LongHashFunction#hashMemory(long, long) hashMemory(address, len)} method. * * @param the type of objects to access * @return the unsafe memory {@code Access} */ @SuppressWarnings("unchecked") public static Access unsafe() { return (Access) UnsafeAccess.INSTANCE; } /** * Returns the {@code Access} to any {@link ByteBuffer}. This {@code Access} isn't useful in * the user code, because methods {@link LongHashFunction#hashBytes(ByteBuffer)} and * {@link LongHashFunction#hashBytes(ByteBuffer, int, int)} exist. This {@code Access} could be * used in new {@link LongHashFunction} implementations. * * @return the {@code Access} to {@link ByteBuffer}s */ public static Access toByteBuffer() { return ByteBufferAccess.INSTANCE; } /** * Returns the {@code Access} to {@link CharSequence}s backed by {@linkplain * ByteOrder#nativeOrder() native} {@code char} reads, typically from {@code char[]} array. * *

Usage example:

{@code
     * static long hashStringBuffer(StringBuffer buffer, LongHashFunction hashFunction) {
     *     return hashFunction.hash(buffer, Access.toNativeCharSequence(),
     *         // * 2L because length is passed in bytes, not chars
     *         0L, buffer.length() * 2L);
     * }}
* *

This method is a shortcut for {@code Access.toCharSequence(ByteOrder.nativeOrder())}. * * @param the {@code CharSequence} subtype (backed by native {@code char reads}) to access * @return the {@code Access} to {@link CharSequence}s backed by native {@code char} reads * @see #toCharSequence(ByteOrder) */ @SuppressWarnings("unchecked") public static Access toNativeCharSequence() { return (Access) CharSequenceAccess.nativeCharSequenceAccess(); } /** * Returns the {@code Access} to {@link CharSequence}s backed by {@code char} reads made in * the specified byte order. * *

Usage example:

{@code
     * static long hashCharBuffer(CharBuffer buffer, LongHashFunction hashFunction) {
     *     return hashFunction.hash(buffer, Access.toCharSequence(buffer.order()),
     *         // * 2L because length is passed in bytes, not chars
     *         0L, buffer.length() * 2L);
     * }}
* * @param backingOrder the byte order of {@code char} reads backing * {@code CharSequences} to access * @return the {@code Access} to {@link CharSequence}s backed by {@code char} reads made in * the specified byte order * @param the {@code CharSequence} subtype to access * @see #toNativeCharSequence() */ @SuppressWarnings("unchecked") public static Access toCharSequence(ByteOrder backingOrder) { return (Access) CharSequenceAccess.charSequenceAccess(backingOrder); } /** * Constructor for use in subclasses. */ protected Access() {} /** * Reads {@code [offset, offset + 7]} bytes of the byte sequence represented by the given * {@code input} as a single {@code long} value. * * @param input the object to access * @param offset offset to the first byte to read within the byte sequence represented * by the given object * @return eight bytes as a {@code long} value, in {@linkplain #byteOrder(Object) the expected * order} */ public long getLong(T input, long offset) { if (byteOrder(input) == LITTLE_ENDIAN) { return getUnsignedInt(input, offset) | (getUnsignedInt(input, offset + 4L) << 32); } else { return getUnsignedInt(input, offset + 4L) | (getUnsignedInt(input, offset) << 32); } } /** * Shortcut for {@code getInt(input, offset) & 0xFFFFFFFFL}. Could be implemented more * efficiently. * * @param input the object to access * @param offset offset to the first byte to read within the byte sequence represented * by the given object * @return four bytes as an unsigned int value, in {@linkplain #byteOrder(Object) the expected * order} */ public long getUnsignedInt(T input, long offset) { return ((long) getInt(input, offset)) & 0xFFFFFFFFL; } /** * Reads {@code [offset, offset + 3]} bytes of the byte sequence represented by the given * {@code input} as a single {@code int} value. * * @param input the object to access * @param offset offset to the first byte to read within the byte sequence represented * by the given object * @return four bytes as an {@code int} value, in {@linkplain #byteOrder(Object) the expected * order} */ public int getInt(T input, long offset) { if (byteOrder(input) == LITTLE_ENDIAN) { return getUnsignedShort(input, offset) | (getUnsignedShort(input, offset + 2L) << 16); } else { return getUnsignedShort(input, offset + 2L) | (getUnsignedShort(input, offset) << 16); } } /** * Shortcut for {@code getShort(input, offset) & 0xFFFF}. Could be implemented more * efficiently. * * @param input the object to access * @param offset offset to the first byte to read within the byte sequence represented * by the given object * @return two bytes as an unsigned short value, in {@linkplain #byteOrder(Object) the expected * order} */ public int getUnsignedShort(T input, long offset) { if (byteOrder(input) == LITTLE_ENDIAN) { return getUnsignedByte(input, offset) | (getUnsignedByte(input, offset + 1L) << 8); } else { return getUnsignedByte(input, offset + 1L) | (getUnsignedByte(input, offset) << 8); } } /** * Reads {@code [offset, offset + 1]} bytes of the byte sequence represented by the given * {@code input} as a single {@code short} value, returned widened to {@code int}. * * @param input the object to access * @param offset offset to the first byte to read within the byte sequence represented * by the given object * @return two bytes as a {@code short} value, in {@linkplain #byteOrder(Object) the expected * order}, widened to {@code int} */ public int getShort(T input, long offset) { return (int) (short) getUnsignedShort(input, offset); } /** * Shortcut for {@code getByte(input, offset) & 0xFF}. Could be implemented more efficiently. * * @param input the object to access * @param offset offset to the byte to read within the byte sequence represented * by the given object * @return a byte by the given {@code offset}, interpreted as unsigned */ public int getUnsignedByte(T input, long offset) { return getByte(input, offset) & 0xFF; } /** * Reads a single byte at the given {@code offset} in the byte sequence represented by the given * {@code input}, returned widened to {@code int}. * * @param input the object to access * @param offset offset to the byte to read within the byte sequence represented * by the given object * @return a byte by the given {@code offset}, widened to {@code int} */ public abstract int getByte(T input, long offset); /** * The byte order in which all multi-byte {@code getXXX()} reads from the given {@code input} * are performed. * * @param input the accessed object * @return the byte order of all multi-byte reads from the given {@code input} */ public abstract ByteOrder byteOrder(T input); }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy