/* * Copyright (c) 2019, 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. *
*/
TestG1FreeIdSetThread* threads[nthreads] = {}; for (uint i = 0; i < nthreads; ++i) {
threads[i] = new TestG1FreeIdSetThread(i,
&post,
&set,
&total_allocations,
&continue_running);
threads[i]->doit();
}
JavaThread* this_thread = JavaThread::current();
tty->print_cr("Stressing G1FreeIdSet for %u ms", milliseconds_to_run);
{
ThreadInVMfromNative invm(this_thread);
this_thread->sleep(milliseconds_to_run);
}
Atomic::release_store(&continue_running, false); for (uint i = 0; i < nthreads; ++i) {
ThreadInVMfromNative invm(this_thread);
post.wait_with_safepoint_check(this_thread);
}
tty->print_cr("total allocations: " SIZE_FORMAT, total_allocations);
tty->print_cr("final free list: ");
uint ids[size] = {}; for (uint i = 0; i < size; ++i) {
uint id = set.claim_par_id();
uint index = id - TestSupport::start(set);
ASSERT_LT(index, TestSupport::size(set));
tty->print_cr(" %u: %u", i, index);
}
ASSERT_EQ(size, TestSupport::head_index(set, TestSupport::head(set)));
}
Messung V0.5 in Prozent
¤ Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.0.11Bemerkung:
(vorverarbeitet am 2026-04-27)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.