secret
Last active

Source code to "High-speed, multi-threaded virtual memory in Java" on JAXenter.com http://jaxenter.com/high-speed-multi-threaded-virtual-memory-in-java.1-46188.html

  • Download Gist
gistfile1.java
Java
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159
/*
 
Full source code to article on JAXenter.com:
http://jaxenter.com/high-speed-multi-threaded-virtual-memory-in-java.1-46188.html
 
===============
 
Copyright (c) 2013, Dr Alexander J Turner
All rights reserved.
 
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
 
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
 
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
The views and conclusions contained in the software and documentation are those
of the authors and should not be interpreted as representing official policies,
either expressed or implied, of Dr Turner.
*/
 
public class MapperCore {
 
private static AtomicInteger ider=new AtomicInteger();
private List<ByteBuffer> chunks= new ArrayList<>();
private final static long TWOGIG = Integer.MAX_VALUE;
private long length;
private File coreFile;
private RandomAccessFile coreFileAccessor;
private static int getUniqueId() {
return ider.incrementAndGet();
}
 
public MapperCore(String prefix,long size) throws IOException {
coreFile=new File(prefix+getUniqueId() + ".mem");
// This is a for testing - to avoid the disk filling up
coreFile.deleteOnExit();
// Now create the actual file
coreFileAccessor = new RandomAccessFile(coreFile, "rw");
FileChannel channelMapper=coreFileAccessor.getChannel();
long nChunks=size/TWOGIG;
if(nChunks>Integer.MAX_VALUE)throw new ArithmeticException("Requested File Size Too Large");
length=size;
long countDown=size;
long from=0;
while(countDown>0) {
long len=Math.min(TWOGIG, countDown);
ByteBuffer chunk=channelMapper.map(MapMode.READ_WRITE, from, len);
chunks.add(chunk);
from+=len;
countDown-=len;
}
}
public byte[] get(long offSet,int size) throws IOException {
// Quick and dirty but will go wrong for massive numbers
double a=offSet;
double b=TWOGIG;
byte[] dst=new byte[size];
long whichChunk=(long) Math.floor(a/b);
long withinChunk=offSet-whichChunk*TWOGIG;
// Data does not straddle two chunks
try {
if(TWOGIG-withinChunk>dst.length) {
ByteBuffer chunk=chunks.get((int) whichChunk);
// Allows free threading
ByteBuffer readBuffer = chunk.asReadOnlyBuffer();
readBuffer.position((int) withinChunk);
readBuffer.get(dst, 0, dst.length);
}else {
int l1=(int) (TWOGIG-withinChunk);
int l2=(int) dst.length - l1;
ByteBuffer chunk=chunks.get((int) whichChunk);
// Allows free threading
ByteBuffer readBuffer = chunk.asReadOnlyBuffer();
readBuffer.position((int) withinChunk);
readBuffer.get(dst, 0, l1);
 
chunk=chunks.get((int) whichChunk+1);
readBuffer = chunk.asReadOnlyBuffer();
readBuffer.position(0);
try {
readBuffer.get(dst, l1, l2);
}catch(java.nio.BufferUnderflowException e){
throw e;
}
}
}catch(IndexOutOfBoundsException i) {
throw new IOException("Out of bounds");
}
return dst;
}
 
public void put(long offSet,byte[] src) throws IOException {
// Quick and dirty but will go wrong for massive numbers
double a=offSet;
double b=TWOGIG;
long whichChunk=(long) Math.floor(a/b);
long withinChunk=offSet-whichChunk*TWOGIG;
// Data does not straddle two chunks
try {
if(TWOGIG-withinChunk>src.length) {
ByteBuffer chunk=chunks.get((int) whichChunk);
// Allows free threading
ByteBuffer writeBuffer = chunk.duplicate();
writeBuffer.position((int) withinChunk);
writeBuffer.put(src, 0, src.length);
}else {
int l1=(int) (TWOGIG-withinChunk);
int l2=(int) src.length - l1;
ByteBuffer chunk=chunks.get((int) whichChunk);
// Allows free threading
ByteBuffer writeBuffer = chunk.duplicate();
writeBuffer.position((int) withinChunk);
writeBuffer.put(src, 0, l1);
 
chunk=chunks.get((int) whichChunk+1);
writeBuffer = chunk.duplicate();
writeBuffer.position(0);
writeBuffer.put(src, l1, l2);
 
}
}catch(IndexOutOfBoundsException i) {
throw new IOException("Out of bounds");
}
}
public void purge() {
if(coreFileAccessor!=null) {
try {
coreFileAccessor.close();
} catch (IOException e) {
e.printStackTrace();
}finally {
coreFile.delete();
}
}
}
public long getSize() {
return length;
}

Please sign in to comment on this gist.

Something went wrong with that request. Please try again.