203 lines
7.2 KiB
Java
203 lines
7.2 KiB
Java
// Copyright (c) 2013-2014 Sandstorm Development Group, Inc. and contributors
|
|
// Licensed under the MIT License:
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
// of this software and associated documentation files (the "Software"), to deal
|
|
// in the Software without restriction, including without limitation the rights
|
|
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
// copies of the Software, and to permit persons to whom the Software is
|
|
// furnished to do so, subject to the following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included in
|
|
// all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
// THE SOFTWARE.
|
|
|
|
package org.capnproto;
|
|
|
|
import java.io.IOException;
|
|
import java.nio.channels.ReadableByteChannel;
|
|
import java.nio.channels.WritableByteChannel;
|
|
import java.nio.ByteBuffer;
|
|
import java.nio.ByteOrder;
|
|
import java.util.ArrayList;
|
|
|
|
public final class Serialize {
|
|
|
|
static ByteBuffer makeByteBuffer(int bytes) {
|
|
ByteBuffer result = ByteBuffer.allocate(bytes);
|
|
result.order(ByteOrder.LITTLE_ENDIAN);
|
|
result.mark();
|
|
return result;
|
|
}
|
|
|
|
public static void fillBuffer(ByteBuffer buffer, ReadableByteChannel bc) throws IOException {
|
|
while(buffer.hasRemaining()) {
|
|
int r = bc.read(buffer);
|
|
if (r < 0) {
|
|
throw new IOException("premature EOF");
|
|
}
|
|
// TODO check for r == 0 ?.
|
|
}
|
|
}
|
|
|
|
public static MessageReader read(ReadableByteChannel bc) throws IOException {
|
|
return read(bc, ReaderOptions.DEFAULT_READER_OPTIONS);
|
|
}
|
|
|
|
public static MessageReader read(ReadableByteChannel bc, ReaderOptions options) throws IOException {
|
|
ByteBuffer firstWord = makeByteBuffer(Constants.BYTES_PER_WORD);
|
|
fillBuffer(firstWord, bc);
|
|
|
|
int segmentCount = 1 + firstWord.getInt(0);
|
|
|
|
int segment0Size = 0;
|
|
if (segmentCount > 0) {
|
|
segment0Size = firstWord.getInt(4);
|
|
}
|
|
|
|
int totalWords = segment0Size;
|
|
|
|
if (segmentCount > 512) {
|
|
throw new IOException("too many segments");
|
|
}
|
|
|
|
// in words
|
|
ArrayList<Integer> moreSizes = new ArrayList<Integer>();
|
|
|
|
if (segmentCount > 1) {
|
|
ByteBuffer moreSizesRaw = makeByteBuffer(4 * (segmentCount & ~1));
|
|
fillBuffer(moreSizesRaw, bc);
|
|
for (int ii = 0; ii < segmentCount - 1; ++ii) {
|
|
int size = moreSizesRaw.getInt(ii * 4);
|
|
moreSizes.add(size);
|
|
totalWords += size;
|
|
}
|
|
}
|
|
|
|
if (totalWords > options.traversalLimitInWords) {
|
|
throw new DecodeException("Message size exceeds traversal limit.");
|
|
}
|
|
|
|
ByteBuffer allSegments = makeByteBuffer(totalWords * Constants.BYTES_PER_WORD);
|
|
fillBuffer(allSegments, bc);
|
|
|
|
ByteBuffer[] segmentSlices = new ByteBuffer[segmentCount];
|
|
|
|
allSegments.rewind();
|
|
segmentSlices[0] = allSegments.slice();
|
|
segmentSlices[0].limit(segment0Size * Constants.BYTES_PER_WORD);
|
|
segmentSlices[0].order(ByteOrder.LITTLE_ENDIAN);
|
|
|
|
int offset = segment0Size;
|
|
for (int ii = 1; ii < segmentCount; ++ii) {
|
|
allSegments.position(offset * Constants.BYTES_PER_WORD);
|
|
segmentSlices[ii] = allSegments.slice();
|
|
segmentSlices[ii].limit(moreSizes.get(ii - 1) * Constants.BYTES_PER_WORD);
|
|
segmentSlices[ii].order(ByteOrder.LITTLE_ENDIAN);
|
|
offset += moreSizes.get(ii - 1);
|
|
}
|
|
|
|
return new MessageReader(segmentSlices, options);
|
|
}
|
|
|
|
public static MessageReader read(ByteBuffer bb) throws IOException {
|
|
return read(bb, ReaderOptions.DEFAULT_READER_OPTIONS);
|
|
}
|
|
|
|
/*
|
|
* Upon return, `bb.position()` will be at the end of the message.
|
|
*/
|
|
public static MessageReader read(ByteBuffer bb, ReaderOptions options) throws IOException {
|
|
bb.order(ByteOrder.LITTLE_ENDIAN);
|
|
|
|
int segmentCount = 1 + bb.getInt();
|
|
if (segmentCount > 512) {
|
|
throw new IOException("too many segments");
|
|
}
|
|
|
|
ByteBuffer[] segmentSlices = new ByteBuffer[segmentCount];
|
|
|
|
int segmentSizesBase = bb.position();
|
|
int segmentSizesSize = segmentCount * 4;
|
|
|
|
int align = Constants.BYTES_PER_WORD - 1;
|
|
int segmentBase = (segmentSizesBase + segmentSizesSize + align) & ~align;
|
|
|
|
int totalWords = 0;
|
|
|
|
for (int ii = 0; ii < segmentCount; ++ii) {
|
|
int segmentSize = bb.getInt(segmentSizesBase + ii * 4);
|
|
|
|
bb.position(segmentBase + totalWords * Constants.BYTES_PER_WORD);
|
|
segmentSlices[ii] = bb.slice();
|
|
segmentSlices[ii].limit(segmentSize * Constants.BYTES_PER_WORD);
|
|
segmentSlices[ii].order(ByteOrder.LITTLE_ENDIAN);
|
|
|
|
totalWords += segmentSize;
|
|
}
|
|
bb.position(segmentBase + totalWords * Constants.BYTES_PER_WORD);
|
|
|
|
if (totalWords > options.traversalLimitInWords) {
|
|
throw new DecodeException("Message size exceeds traversal limit.");
|
|
}
|
|
|
|
return new MessageReader(segmentSlices, options);
|
|
}
|
|
|
|
public static long computeSerializedSizeInWords(MessageBuilder message) {
|
|
final ByteBuffer[] segments = message.getSegmentsForOutput();
|
|
|
|
// From the capnproto documentation:
|
|
// "When transmitting over a stream, the following should be sent..."
|
|
long bytes = 0;
|
|
// "(4 bytes) The number of segments, minus one..."
|
|
bytes += 4;
|
|
// "(N * 4 bytes) The size of each segment, in words."
|
|
bytes += segments.length * 4;
|
|
// "(0 or 4 bytes) Padding up to the next word boundary."
|
|
if (bytes % 8 != 0) {
|
|
bytes += 4;
|
|
}
|
|
|
|
// The content of each segment, in order.
|
|
for (int i = 0; i < segments.length; ++i) {
|
|
final ByteBuffer s = segments[i];
|
|
bytes += s.limit();
|
|
}
|
|
|
|
return bytes / Constants.BYTES_PER_WORD;
|
|
}
|
|
|
|
public static void write(WritableByteChannel outputChannel,
|
|
MessageBuilder message) throws IOException {
|
|
ByteBuffer[] segments = message.getSegmentsForOutput();
|
|
int tableSize = (segments.length + 2) & (~1);
|
|
|
|
ByteBuffer table = ByteBuffer.allocate(4 * tableSize);
|
|
table.order(ByteOrder.LITTLE_ENDIAN);
|
|
|
|
table.putInt(0, segments.length - 1);
|
|
|
|
for (int i = 0; i < segments.length; ++i) {
|
|
table.putInt(4 * (i + 1), segments[i].limit() / 8);
|
|
}
|
|
|
|
// Any padding is already zeroed.
|
|
while (table.hasRemaining()) {
|
|
outputChannel.write(table);
|
|
}
|
|
|
|
for (ByteBuffer buffer : segments) {
|
|
while(buffer.hasRemaining()) {
|
|
outputChannel.write(buffer);
|
|
}
|
|
}
|
|
}
|
|
}
|