duke@435: /* dcubed@4967: * Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: stefank@2314: #ifndef SHARE_VM_MEMORY_CARDTABLERS_HPP stefank@2314: #define SHARE_VM_MEMORY_CARDTABLERS_HPP stefank@2314: stefank@2314: #include "memory/cardTableModRefBS.hpp" stefank@2314: #include "memory/genRemSet.hpp" stefank@2314: #include "memory/memRegion.hpp" stefank@2314: duke@435: class Space; duke@435: class OopsInGenClosure; duke@435: duke@435: // This kind of "GenRemSet" uses a card table both as shared data structure duke@435: // for a mod ref barrier set and for the rem set information. duke@435: duke@435: class CardTableRS: public GenRemSet { duke@435: friend class VMStructs; duke@435: // Below are private classes used in impl. duke@435: friend class VerifyCTSpaceClosure; duke@435: friend class ClearNoncleanCardWrapper; duke@435: duke@435: static jbyte clean_card_val() { duke@435: return CardTableModRefBS::clean_card; duke@435: } duke@435: brutisso@3642: static intptr_t clean_card_row() { brutisso@3642: return CardTableModRefBS::clean_card_row; brutisso@3642: } brutisso@3642: duke@435: static bool duke@435: card_is_dirty_wrt_gen_iter(jbyte cv) { duke@435: return CardTableModRefBS::card_is_dirty_wrt_gen_iter(cv); duke@435: } duke@435: ysr@777: CardTableModRefBSForCTRS* _ct_bs; duke@435: duke@435: virtual void younger_refs_in_space_iterate(Space* sp, OopsInGenClosure* cl); duke@435: duke@435: void verify_space(Space* s, HeapWord* gen_start); duke@435: duke@435: enum ExtendedCardValue { duke@435: youngergen_card = CardTableModRefBS::CT_MR_BS_last_reserved + 1, duke@435: // These are for parallel collection. duke@435: // There are three P (parallel) youngergen card values. In general, this duke@435: // needs to be more than the number of generations (including the perm duke@435: // gen) that might have younger_refs_do invoked on them separately. So duke@435: // if we add more gens, we have to add more values. duke@435: youngergenP1_card = CardTableModRefBS::CT_MR_BS_last_reserved + 2, duke@435: youngergenP2_card = CardTableModRefBS::CT_MR_BS_last_reserved + 3, duke@435: youngergenP3_card = CardTableModRefBS::CT_MR_BS_last_reserved + 4, duke@435: cur_youngergen_and_prev_nonclean_card = duke@435: CardTableModRefBS::CT_MR_BS_last_reserved + 5 duke@435: }; duke@435: duke@435: // An array that contains, for each generation, the card table value last duke@435: // used as the current value for a younger_refs_do iteration of that duke@435: // portion of the table. (The perm gen is index 0; other gens are at duke@435: // their level plus 1. They youngest gen is in the table, but will duke@435: // always have the value "clean_card".) duke@435: jbyte* _last_cur_val_in_gen; duke@435: duke@435: jbyte _cur_youngergen_card_val; duke@435: ysr@777: int _regions_to_iterate; ysr@777: duke@435: jbyte cur_youngergen_card_val() { duke@435: return _cur_youngergen_card_val; duke@435: } duke@435: void set_cur_youngergen_card_val(jbyte v) { duke@435: _cur_youngergen_card_val = v; duke@435: } duke@435: bool is_prev_youngergen_card_val(jbyte v) { duke@435: return duke@435: youngergen_card <= v && duke@435: v < cur_youngergen_and_prev_nonclean_card && duke@435: v != _cur_youngergen_card_val; duke@435: } duke@435: // Return a youngergen_card_value that is not currently in use. duke@435: jbyte find_unused_youngergenP_card_value(); duke@435: duke@435: public: duke@435: CardTableRS(MemRegion whole_heap, int max_covered_regions); duke@435: duke@435: // *** GenRemSet functions. duke@435: GenRemSet::Name rs_kind() { return GenRemSet::CardTable; } duke@435: duke@435: CardTableRS* as_CardTableRS() { return this; } duke@435: ysr@777: CardTableModRefBS* ct_bs() { return _ct_bs; } duke@435: duke@435: // Override. duke@435: void prepare_for_younger_refs_iterate(bool parallel); duke@435: duke@435: // Card table entries are cleared before application; "blk" is duke@435: // responsible for dirtying if the oop is still older-to-younger after duke@435: // closure application. duke@435: void younger_refs_iterate(Generation* g, OopsInGenClosure* blk); duke@435: coleenp@548: void inline_write_ref_field_gc(void* field, oop new_val) { ysr@777: jbyte* byte = _ct_bs->byte_for(field); duke@435: *byte = youngergen_card; duke@435: } coleenp@548: void write_ref_field_gc_work(void* field, oop new_val) { duke@435: inline_write_ref_field_gc(field, new_val); duke@435: } duke@435: duke@435: // Override. Might want to devirtualize this in the same fashion as duke@435: // above. Ensures that the value of the card for field says that it's duke@435: // a younger card in the current collection. coleenp@548: virtual void write_ref_field_gc_par(void* field, oop new_val); duke@435: duke@435: void resize_covered_region(MemRegion new_region); duke@435: duke@435: bool is_aligned(HeapWord* addr) { ysr@777: return _ct_bs->is_card_aligned(addr); duke@435: } duke@435: duke@435: void verify(); jmasa@441: void verify_aligned_region_empty(MemRegion mr); duke@435: ysr@777: void clear(MemRegion mr) { _ct_bs->clear(mr); } coleenp@4037: void clear_into_younger(Generation* gen); duke@435: ysr@777: void invalidate(MemRegion mr, bool whole_heap = false) { ysr@777: _ct_bs->invalidate(mr, whole_heap); ysr@777: } coleenp@4037: void invalidate_or_clear(Generation* gen, bool younger); duke@435: duke@435: static uintx ct_max_alignment_constraint() { duke@435: return CardTableModRefBS::ct_max_alignment_constraint(); duke@435: } duke@435: ysr@777: jbyte* byte_for(void* p) { return _ct_bs->byte_for(p); } ysr@777: jbyte* byte_after(void* p) { return _ct_bs->byte_after(p); } ysr@777: HeapWord* addr_for(jbyte* p) { return _ct_bs->addr_for(p); } duke@435: duke@435: bool is_prev_nonclean_card_val(jbyte v) { duke@435: return duke@435: youngergen_card <= v && duke@435: v <= cur_youngergen_and_prev_nonclean_card && duke@435: v != _cur_youngergen_card_val; duke@435: } duke@435: duke@435: static bool youngergen_may_have_been_dirty(jbyte cv) { duke@435: return cv == CardTableRS::cur_youngergen_and_prev_nonclean_card; duke@435: } duke@435: duke@435: }; stefank@2314: ysr@2819: class ClearNoncleanCardWrapper: public MemRegionClosure { ysr@2889: DirtyCardToOopClosure* _dirty_card_closure; ysr@2819: CardTableRS* _ct; ysr@2819: bool _is_par; ysr@2819: private: ysr@2819: // Clears the given card, return true if the corresponding card should be ysr@2819: // processed. ysr@2819: inline bool clear_card(jbyte* entry); ysr@2819: // Work methods called by the clear_card() ysr@2819: inline bool clear_card_serial(jbyte* entry); ysr@2819: inline bool clear_card_parallel(jbyte* entry); brutisso@3642: // check alignment of pointer brutisso@3642: bool is_word_aligned(jbyte* entry); ysr@2819: ysr@2819: public: ysr@2889: ClearNoncleanCardWrapper(DirtyCardToOopClosure* dirty_card_closure, CardTableRS* ct); ysr@2819: void do_MemRegion(MemRegion mr); ysr@2819: }; ysr@2819: stefank@2314: #endif // SHARE_VM_MEMORY_CARDTABLERS_HPP