Mercurial > hg > graal-jvmci-8
view src/share/vm/gc_implementation/concurrentMarkSweep/freeChunk.cpp @ 2226:c5a923563727
6912621: iCMS: Error: assert(_markBitMap.isMarked(addr + 1),"Missing Printezis bit?")
Summary: Fix block_size_if_printezis_bits() so it does not expect the bits, only uses them when available. Fix block_size_no_stall() so it does not stall when the bits are missing such cases, letting the caller deal with zero size returns. Constant pool cache oops do not need to be unparsable or conc_unsafe after their klass pointer is installed. Some cosmetic clean-ups and some assertion checking for conc-usafety which, in the presence of class file redefinition, has no a-priori time boundedness, so all GCs must be able to safely deal with putatively conc-unsafe objects in a stop-world pause.
Reviewed-by: jmasa, johnc
author | ysr |
---|---|
date | Mon, 07 Feb 2011 22:19:57 -0800 |
parents | f95d63e2154a |
children | 9f059abe8cf2 |
line wrap: on
line source
/* * Copyright (c) 2001, 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. * */ #include "precompiled.hpp" #include "gc_implementation/concurrentMarkSweep/freeBlockDictionary.hpp" #include "utilities/copy.hpp" #ifndef PRODUCT #define baadbabeHeapWord badHeapWordVal #define deadbeefHeapWord 0xdeadbeef size_t const FreeChunk::header_size() { return sizeof(FreeChunk)/HeapWordSize; } void FreeChunk::mangleAllocated(size_t size) { // mangle all but the header of a just-allocated block // of storage assert(size >= MinChunkSize, "smallest size of object"); // we can't assert that _size == size because this may be an // allocation out of a linear allocation block assert(sizeof(FreeChunk) % HeapWordSize == 0, "shouldn't write beyond chunk"); HeapWord* addr = (HeapWord*)this; size_t hdr = header_size(); Copy::fill_to_words(addr + hdr, size - hdr, baadbabeHeapWord); } void FreeChunk::mangleFreed(size_t sz) { assert(baadbabeHeapWord != deadbeefHeapWord, "Need distinct patterns"); // mangle all but the header of a just-freed block of storage // just prior to passing it to the storage dictionary assert(sz >= MinChunkSize, "smallest size of object"); assert(sz == size(), "just checking"); HeapWord* addr = (HeapWord*)this; size_t hdr = header_size(); Copy::fill_to_words(addr + hdr, sz - hdr, deadbeefHeapWord); } void FreeChunk::verifyList() const { FreeChunk* nextFC = next(); if (nextFC != NULL) { assert(this == nextFC->prev(), "broken chain"); assert(size() == nextFC->size(), "wrong size"); nextFC->verifyList(); } } #endif void FreeChunk::print_on(outputStream* st) { st->print_cr("Next: " PTR_FORMAT " Prev: " PTR_FORMAT " %s", next(), prev(), cantCoalesce() ? "[can't coalesce]" : ""); }