jdk 源码 保护 sun com.sum nio misc 等 rc.jar 中的源码

/* * Copyright (c) 2003, 2010, 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 sun.nio.cs.ext; import java.nio.CharBuffer; import java.nio.ByteBuffer; import java.nio.charset.Charset; import java.nio.charset.CharsetDecoder; import java.nio.charset.CharsetEncoder; import java.nio.charset.CoderResult; import sun.nio.cs.HistoricallyNamedCharset; public class IBM964 extends Charset implements HistoricallyNamedCharset { public IBM964() { super("x-IBM964", ExtendedCharsets.aliasesFor("x-IBM964")); } public String historicalName() { return "Cp964"; } public boolean contains(Charset cs) { return (cs instanceof IBM964); } public CharsetDecoder newDecoder() { return new Decoder(this); } public CharsetEncoder newEncoder() { return new Encoder(this); } /** * These accessors are temporarily supplied while sun.io * converters co-exist with the sun.nio.cs.{ext} charset coders * These facilitate sharing of conversion tables between the * two co-existing implementations. When sun.io converters * are made extinct these will be unncessary and should be removed */ public String getDecoderSingleByteMappings() { return Decoder.byteToCharTable; } public String getDecoderMappingTableG1() { return Decoder.mappingTableG1; } public String getDecoderMappingTableG2a2() { return Decoder.mappingTableG2a2; } public String getDecoderMappingTableG2ac() { return Decoder.mappingTableG2ac; } public String getDecoderMappingTableG2ad() { return Decoder.mappingTableG2ad; } public short[] getEncoderIndex1() { return Encoder.index1; } public String getEncoderIndex2() { return Encoder.index2; } public String getEncoderIndex2a() { return Encoder.index2a; } public String getEncoderIndex2b() { return Encoder.index2b; } public String getEncoderIndex2c() { return Encoder.index2c; } protected static class Decoder extends CharsetDecoder { private final int SS2 = 0x8E; private final int SS3 = 0x8F; private String mappingTableG2; public Decoder(Charset cs) { super(cs, 1.0f, 1.0f); } private CoderResult decodeArrayLoop(ByteBuffer src, CharBuffer dst) { byte[] sa = src.array(); int sp = src.arrayOffset() + src.position(); int sl = src.arrayOffset() + src.limit(); assert (sp <= sl); sp = (sp <= sl ? sp : sl); char[] da = dst.array(); int dp = dst.arrayOffset() + dst.position(); int dl = dst.arrayOffset() + dst.limit(); assert (dp <= dl); dp = (dp <= dl ? dp : dl); try { while (sp < sl) { int byte1, byte2; int inputSize = 1; char outputChar = '\uFFFD'; byte1 = sa[sp] & 0xff; if (byte1 == SS2) { if (sl - sp < 4) { return CoderResult.UNDERFLOW; } byte1 = sa[sp + 1] & 0xff; inputSize = 2; if ( byte1 == 0xa2) mappingTableG2 = mappingTableG2a2; else if ( byte1 == 0xac) mappingTableG2 = mappingTableG2ac; else if ( byte1 == 0xad) mappingTableG2 = mappingTableG2ad; else return CoderResult.malformedForLength(2); byte1 = sa[sp + 2] & 0xff; if ( byte1 < 0xa1 || byte1 > 0xfe) { return CoderResult.malformedForLength(3); } byte2 = sa[sp + 3] & 0xff; if ( byte2 < 0xa1 || byte2 > 0xfe) { return CoderResult.malformedForLength(4); } inputSize = 4; outputChar = mappingTableG2.charAt(((byte1 - 0xa1) * 94) + byte2 - 0xa1); } else if(byte1 == SS3 ) { return CoderResult.malformedForLength(1); } else if ( byte1 <= 0x9f ) { // valid single byte outputChar = byteToCharTable.charAt(byte1); } else if (byte1 < 0xa1 || byte1 > 0xfe) { // invalid range? return CoderResult.malformedForLength(1); } else { // G1 if (sl - sp < 2) { return CoderResult.UNDERFLOW; } byte2 = sa[sp + 1] & 0xff; inputSize = 2; if ( byte2 < 0xa1 || byte2 > 0xfe) { return CoderResult.malformedForLength(2); } outputChar = mappingTableG1.charAt(((byte1 - 0xa1) * 94) + byte2 - 0xa1); } if (outputChar == '\uFFFD') return CoderResult.unmappableForLength(inputSize); if (dl - dp < 1) return CoderResult.OVERFLOW; da[dp++] = outputChar; sp += inputSize; } return CoderResult.UNDERFLOW; } finally { src.position(sp - src.arrayOffset()); dst.position(dp - dst.arrayOffset()); } } private CoderResult decodeBufferLoop(ByteBuffer src, CharBuffer dst) { int mark = src.position(); try { while (src.hasRemaining()) { int byte1, byte2; int inputSize = 1; char outputChar = '\uFFFD'; byte1 = src.get() & 0xff; if (byte1 == SS2) { if (src.remaining() < 3) return CoderResult.UNDERFLOW; byte1 = src.get() & 0xff; inputSize = 2; if ( byte1 == 0xa2) mappingTableG2 = mappingTableG2a2; else if ( byte1 == 0xac) mappingTableG2 = mappingTableG2ac; else if ( byte1 == 0xad) mappingTableG2 = mappingTableG2ad; else return CoderResult.malformedForLength(2); byte1 = src.get() & 0xff; if ( byte1 < 0xa1 || byte1 > 0xfe) return CoderResult.malformedForLength(3); byte2 = src.get() & 0xff;