Mercurial > hg > graal-jvmci-8
view src/share/vm/oops/cpCacheKlass.hpp @ 1091:6aa7255741f3
6906727: UseCompressedOops: some card-marking fixes related to object arrays
Summary: Introduced a new write_ref_array(HeapWords* start, size_t count) method that does the requisite MemRegion range calculation so (some of the) clients of the erstwhile write_ref_array(MemRegion mr) do not need to worry. This removed all external uses of array_size(), which was also simplified and made private. Asserts were added to catch other possible issues. Further, less essential, fixes stemming from this investigation are deferred to CR 6904516 (to follow shortly in hs17).
Reviewed-by: kvn, coleenp, jmasa
author | ysr |
---|---|
date | Thu, 03 Dec 2009 15:01:57 -0800 |
parents | 0fbdb4381b99 |
children | 4e6abf09f540 |
line wrap: on
line source
/* * Copyright 1998-2009 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, * CA 95054 USA or visit www.sun.com if you need additional information or * have any questions. * */ class constantPoolCacheKlass: public Klass { juint _alloc_size; // allocation profiling support public: // Dispatched klass operations bool oop_is_constantPoolCache() const { return true; } int oop_size(oop obj) const; int klass_oop_size() const { return object_size(); } // Allocation DEFINE_ALLOCATE_PERMANENT(constantPoolCacheKlass); constantPoolCacheOop allocate(int length, bool is_conc_safe, TRAPS); static klassOop create_klass(TRAPS); // Casting from klassOop static constantPoolCacheKlass* cast(klassOop k) { assert(k->klass_part()->oop_is_constantPoolCache(), "cast to constantPoolCacheKlass"); return (constantPoolCacheKlass*)k->klass_part(); } // Sizing static int header_size() { return oopDesc::header_size() + sizeof(constantPoolCacheKlass)/HeapWordSize; } int object_size() const { return align_object_size(header_size()); } // Garbage collection void oop_follow_contents(oop obj); int oop_adjust_pointers(oop obj); virtual bool oop_is_conc_safe(oop obj) const; // Parallel Scavenge and Parallel Old PARALLEL_GC_DECLS // Iterators int oop_oop_iterate(oop obj, OopClosure* blk); int oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr); // Allocation profiling support juint alloc_size() const { return _alloc_size; } void set_alloc_size(juint n) { _alloc_size = n; } #ifndef PRODUCT public: // Printing void oop_print_on(oop obj, outputStream* st); #endif public: // Verification const char* internal_name() const; void oop_verify_on(oop obj, outputStream* st); };