test/compiler/gcbarriers/G1CrashTest.java

Wed, 21 May 2014 10:56:41 -0700

author
katleman
date
Wed, 21 May 2014 10:56:41 -0700
changeset 6672
fb9d124d9192
parent 0
f90c822e73f8
permissions
-rw-r--r--

Added tag jdk8u20-b15 for changeset 8c785f9bde6f

aoqi@0 1 /*
aoqi@0 2 * Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved.
aoqi@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0 4 *
aoqi@0 5 * This code is free software; you can redistribute it and/or modify it
aoqi@0 6 * under the terms of the GNU General Public License version 2 only, as
aoqi@0 7 * published by the Free Software Foundation.
aoqi@0 8 *
aoqi@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
aoqi@0 12 * version 2 for more details (a copy is included in the LICENSE file that
aoqi@0 13 * accompanied this code).
aoqi@0 14 *
aoqi@0 15 * You should have received a copy of the GNU General Public License version
aoqi@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0 18 *
aoqi@0 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0 20 * or visit www.oracle.com if you need additional information or have any
aoqi@0 21 * questions.
aoqi@0 22 *
aoqi@0 23 */
aoqi@0 24
aoqi@0 25 /**
aoqi@0 26 * @test
aoqi@0 27 * @bug 8023472
aoqi@0 28 * @summary C2 optimization breaks with G1
aoqi@0 29 *
aoqi@0 30 * @run main/othervm -Xbatch -XX:+IgnoreUnrecognizedVMOptions -XX:-TieredCompilation -Dcount=100000 G1CrashTest
aoqi@0 31 *
aoqi@0 32 * @author pbiswal@palantir.com
aoqi@0 33 */
aoqi@0 34
aoqi@0 35 public class G1CrashTest {
aoqi@0 36 static Object[] set = new Object[11];
aoqi@0 37
aoqi@0 38 public static void main(String[] args) throws InterruptedException {
aoqi@0 39 for (int j = 0; j < Integer.getInteger("count"); j++) {
aoqi@0 40 Object key = new Object();
aoqi@0 41 insertKey(key);
aoqi@0 42 if (j > set.length / 2) {
aoqi@0 43 Object[] oldKeys = set;
aoqi@0 44 set = new Object[2 * set.length - 1];
aoqi@0 45 for (Object o : oldKeys) {
aoqi@0 46 if (o != null)
aoqi@0 47 insertKey(o);
aoqi@0 48 }
aoqi@0 49 }
aoqi@0 50 }
aoqi@0 51 }
aoqi@0 52
aoqi@0 53 static void insertKey(Object key) {
aoqi@0 54 int hash = key.hashCode() & 0x7fffffff;
aoqi@0 55 int index = hash % set.length;
aoqi@0 56 Object cur = set[index];
aoqi@0 57 if (cur == null)
aoqi@0 58 set[index] = key;
aoqi@0 59 else
aoqi@0 60 insertKeyRehash(key, index, hash, cur);
aoqi@0 61 }
aoqi@0 62
aoqi@0 63 static void insertKeyRehash(Object key, int index, int hash, Object cur) {
aoqi@0 64 int loopIndex = index;
aoqi@0 65 int firstRemoved = -1;
aoqi@0 66 do {
aoqi@0 67 if (cur == "dead")
aoqi@0 68 firstRemoved = 1;
aoqi@0 69 index--;
aoqi@0 70 if (index < 0)
aoqi@0 71 index += set.length;
aoqi@0 72 cur = set[index];
aoqi@0 73 if (cur == null) {
aoqi@0 74 if (firstRemoved != -1)
aoqi@0 75 set[firstRemoved] = "dead";
aoqi@0 76 else
aoqi@0 77 set[index] = key;
aoqi@0 78 return;
aoqi@0 79 }
aoqi@0 80 } while (index != loopIndex);
aoqi@0 81 if (firstRemoved != -1)
aoqi@0 82 set[firstRemoved] = null;
aoqi@0 83 }
aoqi@0 84 }

mercurial