1 /*

     2  * Copyright 2003 Sun Microsystems, Inc.  All Rights Reserved.

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

     4  *

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

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

     7  * published by the Free Software Foundation.

     8  *

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

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

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

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

    13  * accompanied this code).

    14  *

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

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

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

    18  *

    19  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,

    20  * CA 95054 USA or visit www.sun.com if you need additional information or

    21  * have any questions.

    22  */

    23 

    24 /**

    25  * @test

    26  * @bug 4856966

    27  * @summary Test the MessageDigest.update(ByteBuffer) method

    28  * @author Andreas Sterbenz

    29  * @library ..

    30  */

    31 

    32 import java.util.*;

    33 import java.nio.*;

    34 

    35 import java.security.*;

    36 

    37 public class ByteBuffers extends PKCS11Test {

    38 

    39     public static void main(String[] args) throws Exception {

    40         main(new ByteBuffers());

    41     }

    42 

    43     public void main(Provider p) throws Exception {

    44         if (p.getService("MessageDigest", "MD5") == null) {

    45             System.out.println("Provider does not support MD5, skipping");

    46             return;

    47         }

    48 

    49         Random random = new Random();

    50         int n = 10 * 1024;

    51         byte[] t = new byte[n];

    52         random.nextBytes(t);

    53 

    54         MessageDigest md = MessageDigest.getInstance("MD5", p);

    55         byte[] d1 = md.digest(t);

    56 

    57         // test 1: ByteBuffer with an accessible backing array

    58         ByteBuffer b1 = ByteBuffer.allocate(n + 256);

    59         b1.position(random.nextInt(256));

    60         b1.limit(b1.position() + n);

    61         ByteBuffer b2 = b1.slice();

    62         b2.put(t);

    63         b2.clear();

    64         byte[] d2 = digest(md, b2, random);

    65         if (Arrays.equals(d1, d2) == false) {

    66             throw new Exception("Test 1 failed");

    67         }

    68 

    69         // test 2: direct ByteBuffer

    70         ByteBuffer b3 = ByteBuffer.allocateDirect(t.length);

    71         b3.put(t);

    72         b3.clear();

    73         byte[] d3 = digest(md, b3, random);

    74         if (Arrays.equals(d1, d2) == false) {

    75             throw new Exception("Test 2 failed");

    76         }

    77 

    78         // test 3: ByteBuffer without an accessible backing array

    79         b2.clear();

    80         ByteBuffer b4 = b2.asReadOnlyBuffer();

    81         byte[] d4 = digest(md, b4, random);

    82         if (Arrays.equals(d1, d2) == false) {

    83             throw new Exception("Test 3 failed");

    84         }

    85         System.out.println("All tests passed");

    86     }

    87 

    88     private static byte[] digest(MessageDigest md, ByteBuffer b, Random random) throws Exception {

    89         int lim = b.limit();

    90         b.limit(random.nextInt(lim));

    91         md.update(b);

    92         if (b.hasRemaining()) {

    93             throw new Exception("Buffer not consumed");

    94         }

    95         b.limit(lim);

    96         md.update(b);

    97         if (b.hasRemaining()) {

    98             throw new Exception("Buffer not consumed");

    99         }

   100         return md.digest();

   101     }

   102 }