Mercurial > hg > truffle

comparison test/compiler/6769124/TestArrayCopy6769124.java @ 1060:323bd24c6520

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6769124: various 64-bit fixes for c1 Reviewed-by: never
author roland
date Mon, 02 Nov 2009 11:17:55 +0100
parents
children c18cbe5936b8
comparison
equal deleted inserted replaced
1059:389049f3f393 1060:323bd24c6520
1 /*
2 * Copyright 2009 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 /**
26 * @test
27 * @bug 6769124
28 * @summary arraycopy may crash the VM with c1 on 64 bit
29 */
30
31 public class TestArrayCopy6769124 {
32
33 public static void main(String[] args) {
34
35 int k = 1 << 31;
36
37
38 for(int j = 0; j <1000000; j++) {
39 int i = -1;
40 while(i < 10) {
41 i++;
42 }
43
44 int m = k * i;
45
46 int[] O1 = new int[20];
47 int[] O2 = new int[20];
48
49 System.arraycopy(O1, i, O2, i, 1); //will crash on amd64
50 System.arraycopy(O1, m, O2, m, 1); //will crash on sparcv9
51 }
52 }
53 }