1 /*
2  * Copyright (c) 2015, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20  * or visit www.oracle.com if you need additional information or have any
21  * questions.
22  */
23 
24 /*
25  * @test
26  * @bug 8134468
27  * @summary test that checks whether an array load falls into the range of an arraycopy is incorrect on 32bits
28  *
29  * @run main/othervm -XX:-BackgroundCompilation -XX:-UseOnStackReplacement
30  *                    compiler.arraycopy.TestArrayCopyOverflowInBoundChecks
31  */
32 
33 package compiler.arraycopy;
34 
35 public class TestArrayCopyOverflowInBoundChecks {
36 
37     static byte[] src_array = { 'a', 'b', 'c', 'd', 'e' };
38 
test(int copy_len)39     static byte test(int copy_len) {
40         byte[] dst_array = new byte[10];
41         System.arraycopy(src_array, 0, dst_array, 1, copy_len);
42         return dst_array[1];
43     }
44 
main(String[] args)45     static public void main(String[] args) {
46         for (int i = 0; i < 20000; i++) {
47             if (test(src_array.length - 1) != src_array[0]) {
48                 throw new RuntimeException("Test failed");
49             }
50         }
51     }
52 }
53