Java char jdk_LearningJDK/DirectCharBufferS.java at master · chenhahahahaha/LearningJDK · GitHub

/*

* Copyright (c) 2000, 2018, Oracle and/or its affiliates. All rights reserved.

* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

*

* This code is free software; you can redistribute it and/or modify it

* under the terms of the GNU General Public License version 2 only, as

* published by the Free Software Foundation. Oracle designates this

* particular file as subject to the "Classpath" exception as provided

* by Oracle in the LICENSE file that accompanied this code.

*

* This code is distributed in the hope that it will be useful, but WITHOUT

* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License

* version 2 for more details (a copy is included in the LICENSE file that

* accompanied this code).

*

* You should have received a copy of the GNU General Public License version

* 2 along with this work; if not, write to the Free Software Foundation,

* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

*

* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

* or visit www.oracle.com if you need additional information or have any

* questions.

*/

package java.nio;

import jdk.internal.ref.Cleaner;

import sun.nio.ch.DirectBuffer;

import java.lang.ref.Reference;

// 可读写、直接缓冲区,采用与平台字节顺序不同的字节序,其他部分与DirectCharBufferU相同

class DirectCharBufferS extends CharBuffer implements DirectBuffer {

// Cached unaligned-access capability

protected static final boolean UNALIGNED = Bits.unaligned();

// Cached array base offset

private static final long ARRAY_BASE_OFFSET = UNSAFE.arrayBaseOffset(char[].class);

// Base address, used in all indexing calculations

// NOTE: moved up to Buffer.java for speed in JNI GetDirectBufferAddress protected long address;

// An object attached to this buffer.

// If this buffer is a view of another buffer then we use this field to keep a reference to that buffer to ensure that its memory isn't freed before we are done with it.

private final Object att;

/*▼ 构造方法 ████████████████████████████████████████████████████████████████████████████████┓ */

// 用于#duplicates和#slices

DirectCharBufferS(DirectBuffer db, int mark, int pos, int lim, int cap, int off) {

super(mark, pos, lim, cap);

address = db.address() + off;

att = db;

}

/*▲ 构造方法 ████████████████████████████████████████████████████████████████████████████████┛ */

/*▼ 可读写/直接 ████████████████████████████████████████████████████████████████████████████████┓ */

public boolean isReadOnly() {

return false;

}

public boolean isDirect() {

return true;

}

/*▲ 可读写/直接 ████████████████████████████████████████████████████████████████████████████████┛ */

/*▼ 创建新缓冲区,新旧缓冲区共享内部的存储容器 ████████████████████████████████████████████████████████████████████████████████┓ */

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);

assert (off >= 0);

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 CharBuffer subSequence(int start, int end) {

int pos = position();

int lim = limit();

assert (pos <= lim);

pos = (pos <= lim ? pos : lim);

int len = lim - pos;

if((start < 0) || (end > len) || (start > end))

throw new IndexOutOfBoundsException();

return new DirectCharBufferS(this, -1, pos + start, pos + end, capacity(), offset);

}

/*▲ 创建新缓冲区,新旧缓冲区共享内部的存储容器 ████████████████████████████████████████████████████████████████████████████████┛ */

/*▼ get/读取 ████████████████████████████████████████████████████████████████████████████████┓ */

public char get() {

try {

// 转换字节顺序(大小端转换)

return (Bits.swap(UNSAFE.getChar(ix(nextGetIndex()))));

} finally {

Reference.reachabilityFence(this);

}

}

public char get(int i) {

try {

// 转换了字节顺序

return (Bits.swap(UNSAFE.getChar(ix(checkIndex(i)))));

} finally {

Reference.reachabilityFence(this);

}

}

char getUnchecked(int i) {

try {

return (Bits.swap(UNSAFE.getChar(ix(i))));

} finally {

Reference.reachabilityFence(this);

}

}

public CharBuffer get(char[] dst, int offset, int length) {

if(((long) 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();

long dstOffset = ARRAY_BASE_OFFSET + ((long) offset << 1);

try {

if(order() != ByteOrder.nativeOrder()) {

UNSAFE.copySwapMemory(null, ix(pos), dst, dstOffset, (long) length << 1, (long) 1 << 1);

} else {

UNSAFE.copyMemory(null, ix(pos), dst, dstOffset, (long) length << 1);

}

} finally {

Reference.reachabilityFence(this);

}

// 更新当前缓冲区的position

position(pos + length);

} else {

super.get(dst, offset, length);

}

return this;

}

/*▲ get/读取 ████████████████████████████████████████████████████████████████████████████████┛ */

/*▼ put/写入 ████████████████████████████████████████████████████████████████████████████████┓ */

public CharBuffer put(char x) {

try {

// 转换了字节顺序

UNSAFE.putChar(ix(nextPutIndex()), Bits.swap((x)));

} finally {

Reference.reachabilityFence(this);

}

return this;

}

public CharBuffer put(int i, char x) {

try {

// 转换了字节顺序

UNSAFE.putChar(ix(checkIndex(i)), Bits.swap((x)));

} finally {

Reference.reachabilityFence(this);

}

return this;

}

public CharBuffer put(CharBuffer src) {

if(src instanceof DirectCharBufferS) {

if(src == this)

throw createSameBufferException();

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();

try {

UNSAFE.copyMemory(sb.ix(spos), ix(pos), (long) srem << 1);

} finally {

Reference.reachabilityFence(sb);

Reference.reachabilityFence(this);

}

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 CharBuffer put(char[] src, int offset, int length) {

if(((long) 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();

long srcOffset = ARRAY_BASE_OFFSET + ((long) offset << 1);

try {

if(order() != ByteOrder.nativeOrder()) {

UNSAFE.copySwapMemory(src, srcOffset, null, ix(pos), (long) length << 1, (long) 1 << 1);

} else {

UNSAFE.copyMemory(src, srcOffset, null, ix(pos), (long) length << 1);

}

} finally {

Reference.reachabilityFence(this);

}

position(pos + length);

} else {

super.put(src, offset, length);

}

return this;

}

/*▲ put/写入 ████████████████████████████████████████████████████████████████████████████████┛ */

/*▼ 压缩 ████████████████████████████████████████████████████████████████████████████████┓ */

public CharBuffer compact() {

int pos = position();

int lim = limit();

assert (pos <= lim);

int rem = (pos <= lim ? lim - pos : 0);

try {

UNSAFE.copyMemory(ix(pos), ix(0), (long) rem << 1);

} finally {

Reference.reachabilityFence(this);

}

position(rem);

limit(capacity());

discardMark();

return this;

}

/*▲ 压缩 ████████████████████████████████████████████████████████████████████████████████┛ */

/*▼ 字节顺序 ████████████████████████████████████████████████████████████████████████████████┓ */

// 返回与平台字节顺序相反的字节序

public ByteOrder order() {

return ((ByteOrder.nativeOrder() == ByteOrder.BIG_ENDIAN) ? ByteOrder.LITTLE_ENDIAN : ByteOrder.BIG_ENDIAN);

}

// 返回该缓冲区的字节序(本类的字节序与机器字平台相反)

ByteOrder charRegionOrder() {

return order();

}

/*▲ 字节顺序 ████████████████████████████████████████████████████████████████████████████████┛ */

@Override

Object base() {

return null;

}

private long ix(int i) {

return address + ((long) i << 1);

}

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();

}

}

/*▼ 实现DirectBuffer接口 ████████████████████████████████████████████████████████████████████████████████┓ */

public long address() {

return address;

}

public Object attachment() {

return att;

}

public Cleaner cleaner() {

return null;

}

/*▲ 实现DirectBuffer接口 ████████████████████████████████████████████████████████████████████████████████┛ */

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值