Mercurial > hg > graal-compiler
view src/share/vm/oops/objArrayKlass.hpp @ 2149:7e37af9d69ef
7011379: G1: overly long concurrent marking cycles
Summary: This changeset introduces filtering of SATB buffers at the point when they are about to be enqueued. If this filtering clears enough entries on each buffer, the buffer can then be re-used and not enqueued. This cuts down the number of SATB buffers that need to be processed by the concurrent marking threads.
Reviewed-by: johnc, ysr
author | tonyp |
---|---|
date | Wed, 19 Jan 2011 09:35:17 -0500 |
parents | f95d63e2154a |
children | 069ab3f976d3 |
line wrap: on
line source
/* * Copyright (c) 1997, 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. * */ #ifndef SHARE_VM_OOPS_OBJARRAYKLASS_HPP #define SHARE_VM_OOPS_OBJARRAYKLASS_HPP #include "memory/specialized_oop_closures.hpp" #include "oops/arrayKlass.hpp" #include "oops/instanceKlass.hpp" // objArrayKlass is the klass for objArrays class objArrayKlass : public arrayKlass { friend class VMStructs; private: klassOop _element_klass; // The klass of the elements of this array type klassOop _bottom_klass; // The one-dimensional type (instanceKlass or typeArrayKlass) public: // Instance variables klassOop element_klass() const { return _element_klass; } void set_element_klass(klassOop k) { oop_store_without_check((oop*) &_element_klass, (oop) k); } oop* element_klass_addr() { return (oop*)&_element_klass; } klassOop bottom_klass() const { return _bottom_klass; } void set_bottom_klass(klassOop k) { oop_store_without_check((oop*) &_bottom_klass, (oop) k); } oop* bottom_klass_addr() { return (oop*)&_bottom_klass; } // Compiler/Interpreter offset static int element_klass_offset_in_bytes() { return offset_of(objArrayKlass, _element_klass); } // Dispatched operation bool can_be_primary_super_slow() const; objArrayOop compute_secondary_supers(int num_extra_slots, TRAPS); bool compute_is_subtype_of(klassOop k); bool oop_is_objArray_slow() const { return true; } int oop_size(oop obj) const; int klass_oop_size() const { return object_size(); } // Allocation DEFINE_ALLOCATE_PERMANENT(objArrayKlass); objArrayOop allocate(int length, TRAPS); oop multi_allocate(int rank, jint* sizes, TRAPS); // Copying void copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS); // Compute protection domain oop protection_domain() { return Klass::cast(bottom_klass())->protection_domain(); } // Compute class loader oop class_loader() const { return Klass::cast(bottom_klass())->class_loader(); } private: // Either oop or narrowOop depending on UseCompressedOops. // must be called from within objArrayKlass.cpp template <class T> void do_copy(arrayOop s, T* src, arrayOop d, T* dst, int length, TRAPS); protected: // Returns the objArrayKlass for n'th dimension. virtual klassOop array_klass_impl(bool or_null, int n, TRAPS); // Returns the array class with this class as element type. virtual klassOop array_klass_impl(bool or_null, TRAPS); public: // Casting from klassOop static objArrayKlass* cast(klassOop k) { assert(k->klass_part()->oop_is_objArray_slow(), "cast to objArrayKlass"); return (objArrayKlass*) k->klass_part(); } // Sizing static int header_size() { return oopDesc::header_size() + sizeof(objArrayKlass)/HeapWordSize; } int object_size() const { return arrayKlass::object_size(header_size()); } // Initialization (virtual from Klass) void initialize(TRAPS); // Garbage collection void oop_follow_contents(oop obj); inline void oop_follow_contents(oop obj, int index); template <class T> inline void objarray_follow_contents(oop obj, int index); int oop_adjust_pointers(oop obj); // Parallel Scavenge and Parallel Old PARALLEL_GC_DECLS #ifndef SERIALGC inline void oop_follow_contents(ParCompactionManager* cm, oop obj, int index); template <class T> inline void objarray_follow_contents(ParCompactionManager* cm, oop obj, int index); #endif // !SERIALGC // Iterators int oop_oop_iterate(oop obj, OopClosure* blk) { return oop_oop_iterate_v(obj, blk); } int oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) { return oop_oop_iterate_v_m(obj, blk, mr); } #define ObjArrayKlass_OOP_OOP_ITERATE_DECL(OopClosureType, nv_suffix) \ int oop_oop_iterate##nv_suffix(oop obj, OopClosureType* blk); \ int oop_oop_iterate##nv_suffix##_m(oop obj, OopClosureType* blk, \ MemRegion mr); \ int oop_oop_iterate_range##nv_suffix(oop obj, OopClosureType* blk, \ int start, int end); ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DECL) ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DECL) // JVM support jint compute_modifier_flags(TRAPS) const; private: static klassOop array_klass_impl (objArrayKlassHandle this_oop, bool or_null, int n, TRAPS); public: // Printing void oop_print_value_on(oop obj, outputStream* st); #ifndef PRODUCT void oop_print_on (oop obj, outputStream* st); #endif //PRODUCT // Verification const char* internal_name() const; void oop_verify_on(oop obj, outputStream* st); void oop_verify_old_oop(oop obj, oop* p, bool allow_dirty); void oop_verify_old_oop(oop obj, narrowOop* p, bool allow_dirty); }; #endif // SHARE_VM_OOPS_OBJARRAYKLASS_HPP