Mercurial > hg > truffle
view test/compiler/7009231/Test7009231.java @ 3293:1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
Summary: In G1 heap verification, we no longer scan perm to G1-collected heap refs as part of process_strong_roots() but rather in a separate explicit oop iteration over the perm gen. This preserves the original perm card-marks. Added a new assertion in younger_refs_iterate() to catch a simple subcase where the user may have forgotten a prior save_marks() call, as happened in the case of G1's attempt to iterate perm to G1 refs when verifying the heap before exit. The assert was deliberately weakened for ParNew+CMS and will be fixed for that combination in a future CR. Also made some (non-G1) cleanups related to code and comments obsoleted by the migration of Symbols to the native heap.
Reviewed-by: iveresov, jmasa, tonyp
author | ysr |
---|---|
date | Tue, 26 Apr 2011 21:17:24 -0700 |
parents | 037c727f35fb |
children |
line wrap: on
line source
/* * Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. * */ /** * @test * @bug 7009231 * @summary C1: Incorrect CAS code for longs on SPARC 32bit * * @run main/othervm -Xbatch Test7009231 * */ import java.util.Random; import java.util.concurrent.atomic.AtomicLong; public class Test7009231 { public static void main(String[] args) throws InterruptedException { doTest(8); } private static void doTest(int nThreads) throws InterruptedException { Thread[] aThreads = new Thread[nThreads]; final AtomicLong atl = new AtomicLong(); for (int i = 0; i < nThreads; i++) { aThreads[i] = new RunnerThread(atl, 1L << (8 * i)); } for (int i = 0; i < nThreads; i++) { aThreads[i].start(); } for (int i = 0; i < nThreads; i++) { aThreads[i].join(); } } public static class RunnerThread extends Thread { public RunnerThread(AtomicLong atomic, long lMask) { m_lMask = lMask; m_atomic = atomic; } public void run() { AtomicLong atomic = m_atomic; long lMask = m_lMask; for (int i = 0; i < 100000; i++) { setBit(atomic, lMask); clearBit(atomic, lMask); } } protected void setBit(AtomicLong atomic, long lMask) { long lWord; do { lWord = atomic.get(); } while (!atomic.compareAndSet(lWord, lWord | lMask)); if ((atomic.get() & lMask) == 0L) { throw new InternalError(); } } protected void clearBit(AtomicLong atomic, long lMask) { long lWord; do { lWord = atomic.get(); } while (!atomic.compareAndSet(lWord, lWord & ~lMask)); if ((atomic.get() & lMask) != 0L) { throw new InternalError(); } } private long m_lMask; private AtomicLong m_atomic; } }