class DirectCharBufferS extends CharBuffer implements DirectBuffer {
// Cached unsafe-access object
protected static final Unsafe unsafe = Bits.unsafe();
// Cached unaligned-access capability
protected static final boolean unaligned = Bits.unaligned();
// Base address, used in all indexing calculations
// NOTE: moved up to Buffer.java for speed in JNI GetDirectBufferAddress
// protected long address;
// If this buffer is a view of another buffer then we keep a reference to
// that buffer so that its memory isn't freed before we're done with it
protected Object viewedBuffer = null;
public Object viewedBuffer() {
return viewedBuffer;
}
public Cleaner cleaner() {
return null;
}
// For duplicates and slices
//
DirectCharBufferS(
DirectBuffer db, // package-private
int mark,
int pos,
int lim,
int cap,
int off) {
super(mark, pos, lim, cap);
address = db.address() + off;
viewedBuffer = db;
}
public CharBuffer slice() {
int pos = this.position();
int lim = this.limit();
assert (pos <= lim);
int rem = (pos <= lim ? lim - pos : 0);
int off = (pos << 1);
return new DirectCharBufferS(this, -1, 0, rem, rem, off);
}
public CharBuffer duplicate() {
return new DirectCharBufferS(
this, this.markValue(), this.position(), this.limit(), this.capacity(), 0);
}
public CharBuffer asReadOnlyBuffer() {
return new DirectCharBufferRS(
this, this.markValue(), this.position(), this.limit(), this.capacity(), 0);
}
public long address() {
return address;
}
private long ix(int i) {
return address + (i << 1);
}
public char get() {
return (Bits.swap(unsafe.getChar(ix(nextGetIndex()))));
}
public char get(int i) {
return (Bits.swap(unsafe.getChar(ix(checkIndex(i)))));
}
public CharBuffer get(char[] dst, int offset, int length) {
if ((length << 1) > Bits.JNI_COPY_TO_ARRAY_THRESHOLD) {
checkBounds(offset, length, dst.length);
int pos = position();
int lim = limit();
assert (pos <= lim);
int rem = (pos <= lim ? lim - pos : 0);
if (length > rem) throw new BufferUnderflowException();
if (order() != ByteOrder.nativeOrder())
Bits.copyToCharArray(ix(pos), dst, offset << 1, length << 1);
else Bits.copyToByteArray(ix(pos), dst, offset << 1, length << 1);
position(pos + length);
} else {
super.get(dst, offset, length);
}
return this;
}
public CharBuffer put(char x) {
unsafe.putChar(ix(nextPutIndex()), Bits.swap((x)));
return this;
}
public CharBuffer put(int i, char x) {
unsafe.putChar(ix(checkIndex(i)), Bits.swap((x)));
return this;
}
public CharBuffer put(CharBuffer src) {
if (src instanceof DirectCharBufferS) {
if (src == this) throw new IllegalArgumentException();
DirectCharBufferS sb = (DirectCharBufferS) src;
int spos = sb.position();
int slim = sb.limit();
assert (spos <= slim);
int srem = (spos <= slim ? slim - spos : 0);
int pos = position();
int lim = limit();
assert (pos <= lim);
int rem = (pos <= lim ? lim - pos : 0);
if (srem > rem) throw new BufferOverflowException();
unsafe.copyMemory(sb.ix(spos), ix(pos), srem << 1);
sb.position(spos + srem);
position(pos + srem);
} else if (!src.isDirect()) {
int spos = src.position();
int slim = src.limit();
assert (spos <= slim);
int srem = (spos <= slim ? slim - spos : 0);
put(src.hb, src.offset + spos, srem);
src.position(spos + srem);
} else {
super.put(src);
}
return this;
}
public CharBuffer put(char[] src, int offset, int length) {
if ((length << 1) > Bits.JNI_COPY_FROM_ARRAY_THRESHOLD) {
checkBounds(offset, length, src.length);
int pos = position();
int lim = limit();
assert (pos <= lim);
int rem = (pos <= lim ? lim - pos : 0);
if (length > rem) throw new BufferOverflowException();
if (order() != ByteOrder.nativeOrder())
Bits.copyFromCharArray(src, offset << 1, ix(pos), length << 1);
else Bits.copyFromByteArray(src, offset << 1, ix(pos), length << 1);
position(pos + length);
} else {
super.put(src, offset, length);
}
return this;
}
public CharBuffer compact() {
int pos = position();
int lim = limit();
assert (pos <= lim);
int rem = (pos <= lim ? lim - pos : 0);
unsafe.copyMemory(ix(pos), ix(0), rem << 1);
position(rem);
limit(capacity());
return this;
}
public boolean isDirect() {
return true;
}
public boolean isReadOnly() {
return false;
}
public String toString(int start, int end) {
if ((end > limit()) || (start > end)) throw new IndexOutOfBoundsException();
try {
int len = end - start;
char[] ca = new char[len];
CharBuffer cb = CharBuffer.wrap(ca);
CharBuffer db = this.duplicate();
db.position(start);
db.limit(end);
cb.put(db);
return new String(ca);
} catch (StringIndexOutOfBoundsException x) {
throw new IndexOutOfBoundsException();
}
}
// --- Methods to support CharSequence ---
public CharSequence subSequence(int start, int end) {
int len = length();
int pos = position();
assert (pos <= len);
pos = (pos <= len ? pos : len);
if ((start < 0) || (end > len) || (start > end)) throw new IndexOutOfBoundsException();
int sublen = end - start;
int off = (pos + start) << 1;
return new DirectCharBufferS(this, -1, 0, sublen, sublen, off);
}
public ByteOrder order() {
return ((ByteOrder.nativeOrder() == ByteOrder.BIG_ENDIAN)
? ByteOrder.LITTLE_ENDIAN
: ByteOrder.BIG_ENDIAN);
}
}
class DirectShortBufferS extends ShortBuffer implements DirectBuffer {
// Cached unsafe-access object
protected static final Unsafe unsafe = Bits.unsafe();
// Cached array base offset
private static final long arrayBaseOffset = (long) unsafe.arrayBaseOffset(short[].class);
// Cached unaligned-access capability
protected static final boolean unaligned = Bits.unaligned();
// Base address, used in all indexing calculations
// NOTE: moved up to Buffer.java for speed in JNI GetDirectBufferAddress
// protected long address;
// If this buffer is a view of another buffer then we keep a reference to
// that buffer so that its memory isn't freed before we're done with it
protected Object viewedBuffer = null;
public Object viewedBuffer() {
return viewedBuffer;
}
public Cleaner cleaner() {
return null;
}
// For duplicates and slices
//
DirectShortBufferS(
DirectBuffer db, // package-private
int mark,
int pos,
int lim,
int cap,
int off) {
super(mark, pos, lim, cap);
address = db.address() + off;
viewedBuffer = db;
}
public ShortBuffer slice() {
int pos = this.position();
int lim = this.limit();
assert (pos <= lim);
int rem = (pos <= lim ? lim - pos : 0);
int off = (pos << 1);
assert (off >= 0);
return new DirectShortBufferS(this, -1, 0, rem, rem, off);
}
public ShortBuffer duplicate() {
return new DirectShortBufferS(
this, this.markValue(), this.position(), this.limit(), this.capacity(), 0);
}
public ShortBuffer asReadOnlyBuffer() {
return new DirectShortBufferRS(
this, this.markValue(), this.position(), this.limit(), this.capacity(), 0);
}
public long address() {
return address;
}
private long ix(int i) {
return address + (i << 1);
}
public short get() {
return (Bits.swap(unsafe.getShort(ix(nextGetIndex()))));
}
public short get(int i) {
return (Bits.swap(unsafe.getShort(ix(checkIndex(i)))));
}
public ShortBuffer get(short[] dst, int offset, int length) {
if ((length << 1) > Bits.JNI_COPY_TO_ARRAY_THRESHOLD) {
checkBounds(offset, length, dst.length);
int pos = position();
int lim = limit();
assert (pos <= lim);
int rem = (pos <= lim ? lim - pos : 0);
if (length > rem) throw new BufferUnderflowException();
if (order() != ByteOrder.nativeOrder())
Bits.copyToShortArray(ix(pos), dst, offset << 1, length << 1);
else Bits.copyToArray(ix(pos), dst, arrayBaseOffset, offset << 1, length << 1);
position(pos + length);
} else {
super.get(dst, offset, length);
}
return this;
}
public ShortBuffer put(short x) {
unsafe.putShort(ix(nextPutIndex()), Bits.swap((x)));
return this;
}
public ShortBuffer put(int i, short x) {
unsafe.putShort(ix(checkIndex(i)), Bits.swap((x)));
return this;
}
public ShortBuffer put(ShortBuffer src) {
if (src instanceof DirectShortBufferS) {
if (src == this) throw new IllegalArgumentException();
DirectShortBufferS sb = (DirectShortBufferS) src;
int spos = sb.position();
int slim = sb.limit();
assert (spos <= slim);
int srem = (spos <= slim ? slim - spos : 0);
int pos = position();
int lim = limit();
assert (pos <= lim);
int rem = (pos <= lim ? lim - pos : 0);
if (srem > rem) throw new BufferOverflowException();
unsafe.copyMemory(sb.ix(spos), ix(pos), srem << 1);
sb.position(spos + srem);
position(pos + srem);
} else if (src.hb != null) {
int spos = src.position();
int slim = src.limit();
assert (spos <= slim);
int srem = (spos <= slim ? slim - spos : 0);
put(src.hb, src.offset + spos, srem);
src.position(spos + srem);
} else {
super.put(src);
}
return this;
}
public ShortBuffer put(short[] src, int offset, int length) {
if ((length << 1) > Bits.JNI_COPY_FROM_ARRAY_THRESHOLD) {
checkBounds(offset, length, src.length);
int pos = position();
int lim = limit();
assert (pos <= lim);
int rem = (pos <= lim ? lim - pos : 0);
if (length > rem) throw new BufferOverflowException();
if (order() != ByteOrder.nativeOrder())
Bits.copyFromShortArray(src, offset << 1, ix(pos), length << 1);
else Bits.copyFromArray(src, arrayBaseOffset, offset << 1, ix(pos), length << 1);
position(pos + length);
} else {
super.put(src, offset, length);
}
return this;
}
public ShortBuffer compact() {
int pos = position();
int lim = limit();
assert (pos <= lim);
int rem = (pos <= lim ? lim - pos : 0);
unsafe.copyMemory(ix(pos), ix(0), rem << 1);
position(rem);
limit(capacity());
return this;
}
public boolean isDirect() {
return true;
}
public boolean isReadOnly() {
return false;
}
public ByteOrder order() {
return ((ByteOrder.nativeOrder() == ByteOrder.BIG_ENDIAN)
? ByteOrder.LITTLE_ENDIAN
: ByteOrder.BIG_ENDIAN);
}
}
