File: FindASCIICodingBugs.java

package info (click to toggle)
openjdk-21 21.0.8%2B9-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 823,976 kB
  • sloc: java: 5,613,338; xml: 1,643,607; cpp: 1,296,296; ansic: 420,291; asm: 404,850; objc: 20,994; sh: 15,271; javascript: 11,245; python: 6,895; makefile: 2,362; perl: 357; awk: 351; sed: 172; jsp: 24; csh: 3
file content (90 lines) | stat: -rw-r--r-- 3,016 bytes parent folder | download | duplicates (17)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
/*
 * Copyright (c) 2008, 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.
 *
 * 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.
 */

/* @test
 * @bug 6196991
 * @summary Roundtrip Encoding/Decoding of just one ASCII char
 * @author Martin Buchholz
 */

import java.util.*;
import java.nio.*;
import java.nio.charset.*;

public class FindASCIICodingBugs {
    private static int failures = 0;

    private static void check(boolean condition) {
        if (! condition) {
            new Error("test failed").printStackTrace();
            failures++;
        }
    }

    private static boolean equals(byte[] ba, ByteBuffer bb) {
        if (ba.length != bb.limit())
            return false;
        for (int i = 0; i < ba.length; i++)
            if (ba[i] != bb.get(i))
                return false;
        return true;
    }

    public static void main(String[] args) throws Exception {
        for (Map.Entry<String,Charset> e
                 : Charset.availableCharsets().entrySet()) {
            String csn = e.getKey();
            Charset cs = e.getValue();

            // Delete the following lines when these charsets are fixed!
            if (csn.equals("x-JIS0208"))      continue; // MalformedInput
            if (csn.equals("JIS_X0212-1990")) continue; // MalformedInput

            if (! cs.canEncode()) continue;

            CharsetEncoder enc = cs.newEncoder();
            CharsetDecoder dec = cs.newDecoder();

            if (! enc.canEncode('A')) continue;

            System.out.println(csn);

            try {
                byte[] bytes1 = "A".getBytes(csn);
                ByteBuffer bb = enc.encode(CharBuffer.wrap(new char[]{'A'}));

                check(equals(bytes1, bb));
                check(new String(bytes1, csn).equals("A"));

                CharBuffer cb = dec.decode(bb);
                check(cb.toString().equals("A"));
            } catch (Throwable t) {
                t.printStackTrace();
                failures++;
            }
        }

        if (failures > 0)
            throw new Exception(failures + "tests failed");
    }
}