--- /dev/null	Wed May 20 19:00:39 2009
+++ new/test/sun/nio/cs/OLD/DBCS_IBM_ASCII_Decoder.java	Wed May 20 19:00:38 2009
@@ -0,0 +1,164 @@
+/*
+ * Copyright 2003-2006 Sun Microsystems, Inc.  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.  Sun designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Sun 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
+ */
+
+/*
+ */
+
+
+import java.nio.ByteBuffer;
+import java.nio.CharBuffer;
+import java.nio.charset.Charset;
+import java.nio.charset.CharsetDecoder;
+import java.nio.charset.CoderResult;
+
+/**
+ * An abstract base class for subclasses which decode
+ * IBM double byte host encodings such as ibm code
+ * pages 942,943,948, etc.
+ *
+ */
+
+abstract class DBCS_IBM_ASCII_Decoder extends CharsetDecoder
+{
+    protected static final char REPLACE_CHAR='\uFFFD';
+
+    protected String  singleByteToChar;
+    protected boolean leadByte[];
+    protected short   index1[];
+    protected String  index2;
+    protected int     mask1;
+    protected int     mask2;
+    protected int     shift;
+
+
+    protected DBCS_IBM_ASCII_Decoder(Charset cs) {
+        super(cs, 0.5f, 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 b1, b2;
+                b1 = sa[sp];
+                int inputSize = 1;
+                int v = 0;
+                char outputChar = REPLACE_CHAR;
+                if (b1 < 0)
+                    b1 += 256;
+
+                if (!leadByte[b1])
+                {
+                  outputChar = singleByteToChar.charAt(b1);
+                } else {
+                    if (sl - sp < 2)
+                        return CoderResult.UNDERFLOW;
+                    b2 = sa[sp + 1];
+                    if (b2 < 0)
+                        b2 += 256;
+
+                    inputSize++;
+
+                    // Lookup in the two level index
+                    v = b1 * 256 + b2;
+                    outputChar = index2.charAt(index1[((v & mask1) >> shift)]
+                                                + (v & mask2));
+                }
+                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()) {
+                char outputChar = REPLACE_CHAR;
+                int inputSize = 1;
+                int b1, b2;
+                int v = 0;
+                b1 = src.get();
+                if (b1 < 0)
+                    b1 += 256;
+
+                if (!leadByte[b1])
+                {
+                  outputChar = singleByteToChar.charAt(b1);
+                } else {
+                    if (src.remaining() < 1)
+                        return CoderResult.UNDERFLOW;
+                    b2 = src.get();
+                    if (b2 < 0)
+                        b2 += 256;
+                    inputSize++;
+
+                    // Lookup in the two level index
+                    v = b1 * 256 + b2;
+                    outputChar = index2.charAt(index1[((v & mask1) >> shift)]
+                                                        + (v & mask2));
+                }
+                if (outputChar == REPLACE_CHAR)
+                    return CoderResult.unmappableForLength(inputSize);
+
+                if (!dst.hasRemaining())
+                    return CoderResult.OVERFLOW;
+                mark += inputSize;
+                dst.put(outputChar);
+            }
+            return CoderResult.UNDERFLOW;
+        } finally {
+            src.position(mark);
+        }
+    }
+
+    protected CoderResult decodeLoop(ByteBuffer src, CharBuffer dst) {
+        if (src.hasArray() && dst.hasArray())
+            return decodeArrayLoop(src, dst);
+        else
+            return decodeBufferLoop(src, dst);
+    }
+}