1 /* 2 * Copyright (c) 2001, 2015, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_CARDTABLEEXTENSION_HPP 26 #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_CARDTABLEEXTENSION_HPP 27 28 #include "memory/cardTableModRefBS.hpp" 29 30 class MutableSpace; 31 class ObjectStartArray; 32 class PSPromotionManager; 33 class GCTaskQueue; 34 35 class CardTableExtension : public CardTableModRefBS { 36 private: 37 // Support methods for resizing the card table. 38 // resize_commit_uncommit() returns true if the pages were committed or 39 // uncommitted 40 bool resize_commit_uncommit(int changed_region, MemRegion new_region); 41 void resize_update_card_table_entries(int changed_region, 42 MemRegion new_region); 43 void resize_update_committed_table(int changed_region, MemRegion new_region); 44 void resize_update_covered_table(int changed_region, MemRegion new_region); 45 46 protected: 47 48 static void verify_all_young_refs_precise_helper(MemRegion mr); 49 50 public: 51 enum ExtendedCardValue { 52 youngergen_card = CardTableModRefBS::CT_MR_BS_last_reserved + 1, 53 verify_card = CardTableModRefBS::CT_MR_BS_last_reserved + 5 54 }; 55 56 CardTableExtension(MemRegion whole_heap) : 57 CardTableModRefBS( 58 whole_heap, 59 // Concrete tag should be BarrierSet::CardTableExtension. 60 // That will presently break things in a bunch of places though. 61 // The concrete tag is used as a dispatch key in many places, and 62 // CardTableExtension does not correctly dispatch in some of those 63 // uses. This will be addressed as part of a reorganization of the 64 // BarrierSet hierarchy. 65 BarrierSet::FakeRtti(BarrierSet::CardTableModRef, 0).add_tag(BarrierSet::CardTableExtension)) 66 { } 67 68 // Scavenge support 69 void scavenge_contents_parallel(ObjectStartArray* start_array, 70 MutableSpace* sp, 71 HeapWord* space_top, 72 PSPromotionManager* pm, 73 uint stripe_number, 74 uint stripe_total); 75 76 // Verification 77 static void verify_all_young_refs_imprecise(); 78 static void verify_all_young_refs_precise(); 79 80 bool addr_is_marked_imprecise(void *addr); 81 bool addr_is_marked_precise(void *addr); 82 83 void set_card_newgen(void* addr) { jbyte* p = byte_for(addr); *p = verify_card; } 84 85 // Testers for entries 86 static bool card_is_dirty(int value) { return value == dirty_card; } 87 static bool card_is_newgen(int value) { return value == youngergen_card; } 88 static bool card_is_clean(int value) { return value == clean_card; } 89 static bool card_is_verify(int value) { return value == verify_card; } 90 91 // Card marking 92 void inline_write_ref_field_gc(void* field, oop new_val) { 93 jbyte* byte = byte_for(field); 94 *byte = youngergen_card; 95 } 96 97 // Adaptive size policy support 98 // Allows adjustment of the base and size of the covered regions 99 void resize_covered_region(MemRegion new_region); 100 // Finds the covered region to resize based on the start address 101 // of the covered regions. 102 void resize_covered_region_by_start(MemRegion new_region); 103 // Finds the covered region to resize based on the end address 104 // of the covered regions. 105 void resize_covered_region_by_end(int changed_region, MemRegion new_region); 106 // Finds the lowest start address of a covered region that is 107 // previous (i.e., lower index) to the covered region with index "ind". 108 HeapWord* lowest_prev_committed_start(int ind) const; 109 110 #ifdef ASSERT 111 112 bool is_valid_card_address(jbyte* addr) { 113 return (addr >= _byte_map) && (addr < _byte_map + _byte_map_size); 114 } 115 116 #endif // ASSERT 117 }; 118 119 template<> 120 struct BarrierSet::GetName<CardTableExtension> { 121 static const BarrierSet::Name value = BarrierSet::CardTableExtension; 122 }; 123 124 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_CARDTABLEEXTENSION_HPP