0N/A/*
2362N/A * Copyright (c) 2006, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/A/**
0N/A * @test
0N/A * @bug 6429510
0N/A * @summary Verify that our digests work correctly irrespective of input alignment
0N/A * @author Andreas Sterbenz
0N/A */
0N/A
0N/Aimport java.util.*;
0N/A
0N/Aimport java.security.*;
0N/A
0N/Apublic class Offsets {
0N/A
0N/A private static void outOfBounds(MessageDigest md, int arrayLen, int ofs, int len) throws Exception {
0N/A try {
0N/A md.reset();
0N/A md.update(new byte[arrayLen], ofs, len);
0N/A throw new Exception("invalid call succeeded");
0N/A } catch (RuntimeException e) {
0N/A // ignore
0N/A //System.out.println(e);
0N/A }
0N/A }
0N/A
0N/A private static void test(String algorithm, int minOfs, int maxOfs, int minLen, int maxLen) throws Exception {
0N/A Random random = new Random();
0N/A MessageDigest md = MessageDigest.getInstance(algorithm, "SUN");
0N/A System.out.println("Testing " + algorithm + "...");
0N/A outOfBounds(md, 16, 0, 32);
0N/A outOfBounds(md, 16, -8, 16);
0N/A outOfBounds(md, 16, 8, -8);
0N/A outOfBounds(md, 16, Integer.MAX_VALUE, 8);
0N/A for (int n = minLen; n <= maxLen; n++) {
0N/A System.out.print(n + " ");
0N/A byte[] data = new byte[n];
0N/A random.nextBytes(data);
0N/A byte[] digest = null;
0N/A for (int ofs = minOfs; ofs <= maxOfs; ofs++) {
0N/A byte[] ofsData = new byte[n + maxOfs];
0N/A random.nextBytes(ofsData);
0N/A System.arraycopy(data, 0, ofsData, ofs, n);
0N/A md.update(ofsData, ofs, n);
0N/A byte[] ofsDigest = md.digest();
0N/A if (digest == null) {
0N/A digest = ofsDigest;
0N/A } else {
0N/A if (Arrays.equals(digest, ofsDigest) == false) {
0N/A throw new Exception("Digest mismatch " + algorithm + ", ofs: " + ofs + ", len: " + n);
0N/A }
0N/A }
0N/A }
0N/A }
0N/A System.out.println();
0N/A }
0N/A
0N/A public static void main(String[] args) throws Exception {
0N/A test("MD2", 0, 64, 0, 128);
0N/A test("MD5", 0, 64, 0, 128);
0N/A test("SHA1", 0, 64, 0, 128);
0N/A test("SHA-256", 0, 64, 0, 128);
0N/A test("SHA-384", 0, 128, 0, 256);
0N/A test("SHA-512", 0, 128, 0, 256);
0N/A }
0N/A
0N/A}