/*
* 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.cassandra.io.util;
import sun.misc.Unsafe;
import org.apache.cassandra.config.DatabaseDescriptor;
/**
* An off-heap region of memory that must be manually free'd when no longer needed.
*/
public class Memory
{
private static final Unsafe unsafe = NativeAllocator.unsafe;
private static final IAllocator allocator = DatabaseDescriptor.getoffHeapMemoryAllocator();
private static final long BYTE_ARRAY_BASE_OFFSET = unsafe.arrayBaseOffset(byte[].class);
protected long peer;
// size of the memory region
private final long size;
protected Memory(long bytes)
{
size = bytes;
peer = allocator.allocate(size);
}
public static Memory allocate(long bytes)
{
if (bytes < 0)
throw new IllegalArgumentException();
return new Memory(bytes);
}
public void setByte(long offset, byte b)
{
checkPosition(offset);
unsafe.putByte(peer + offset, b);
}
public void setMemory(long offset, long bytes, byte b)
{
// check if the last element will fit into the memory
checkPosition(offset + bytes - 1);
unsafe.setMemory(peer + offset, bytes, b);
}
public void setLong(long offset, long l)
{
checkPosition(offset);
unsafe.putLong(peer + offset, l);
}
public void setInt(long offset, int l)
{
checkPosition(offset);
unsafe.putInt(peer + offset, l);
}
/**
* Transfers count bytes from buffer to Memory
*
* @param memoryOffset start offset in the memory
* @param buffer the data buffer
* @param bufferOffset start offset of the buffer
* @param count number of bytes to transfer
*/
public void setBytes(long memoryOffset, byte[] buffer, int bufferOffset, int count)
{
if (buffer == null)
throw new NullPointerException();
else if (bufferOffset < 0
|| count < 0
|| bufferOffset + count > buffer.length)
throw new IndexOutOfBoundsException();
else if (count == 0)
return;
checkPosition(memoryOffset);
long end = memoryOffset + count;
checkPosition(end - 1);
unsafe.copyMemory(buffer, BYTE_ARRAY_BASE_OFFSET + bufferOffset, null, peer + memoryOffset, count);
}
public byte getByte(long offset)
{
checkPosition(offset);
return unsafe.getByte(peer + offset);
}
public long getLong(long offset)
{
checkPosition(offset);
return unsafe.getLong(peer + offset);
}
public int getInt(long offset)
{
checkPosition(offset);
return unsafe.getInt(peer + offset);
}
/**
* Transfers count bytes from Memory starting at memoryOffset to buffer starting at bufferOffset
*
* @param memoryOffset start offset in the memory
* @param buffer the data buffer
* @param bufferOffset start offset of the buffer
* @param count number of bytes to transfer
*/
public void getBytes(long memoryOffset, byte[] buffer, int bufferOffset, int count)
{
if (buffer == null)
throw new NullPointerException();
else if (bufferOffset < 0 || count < 0 || count > buffer.length - bufferOffset)
throw new IndexOutOfBoundsException();
else if (count == 0)
return;
checkPosition(memoryOffset);
long end = memoryOffset + count;
checkPosition(end - 1);
unsafe.copyMemory(null, peer + memoryOffset, buffer, BYTE_ARRAY_BASE_OFFSET + bufferOffset, count);
}
private void checkPosition(long offset)
{
assert peer != 0 : "Memory was freed";
assert offset >= 0 && offset < size : "Illegal offset: " + offset + ", size: " + size;
}
public void free()
{
assert peer != 0;
allocator.free(peer);
peer = 0;
}
public long size()
{
return size;
}
@Override
public boolean equals(Object o)
{
if (this == o)
return true;
if (!(o instanceof Memory))
return false;
Memory b = (Memory) o;
if (peer == b.peer && size == b.size)
return true;
return false;
}
}