author | jcoomes |
Wed, 03 Mar 2010 14:48:26 -0800 | |
changeset 5076 | 8b74a4b60b31 |
parent 670 | ddf3e9583f2f |
child 5547 | f4b087cbb361 |
permissions | -rw-r--r-- |
1 | 1 |
/* |
670 | 2 |
* Copyright 2001-2008 Sun Microsystems, Inc. All Rights Reserved. |
1 | 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
|
20 |
* CA 95054 USA or visit www.sun.com if you need additional information or |
|
21 |
* have any questions. |
|
22 |
* |
|
23 |
*/ |
|
24 |
||
25 |
class MutableSpace; |
|
26 |
class ObjectStartArray; |
|
27 |
class PSPromotionManager; |
|
28 |
class GCTaskQueue; |
|
29 |
||
30 |
class CardTableExtension : public CardTableModRefBS { |
|
31 |
private: |
|
32 |
// Support methods for resizing the card table. |
|
33 |
void resize_commit_uncommit(int changed_region, MemRegion new_region); |
|
34 |
void resize_update_card_table_entries(int changed_region, |
|
35 |
MemRegion new_region); |
|
36 |
void resize_update_committed_table(int changed_region, MemRegion new_region); |
|
37 |
void resize_update_covered_table(int changed_region, MemRegion new_region); |
|
38 |
||
39 |
protected: |
|
40 |
||
41 |
static void verify_all_young_refs_precise_helper(MemRegion mr); |
|
42 |
||
43 |
public: |
|
44 |
enum ExtendedCardValue { |
|
45 |
youngergen_card = CardTableModRefBS::CT_MR_BS_last_reserved + 1, |
|
46 |
verify_card = CardTableModRefBS::CT_MR_BS_last_reserved + 5 |
|
47 |
}; |
|
48 |
||
49 |
CardTableExtension(MemRegion whole_heap, int max_covered_regions) : |
|
50 |
CardTableModRefBS(whole_heap, max_covered_regions) { } |
|
51 |
||
52 |
// Too risky for the 4/10/02 putback |
|
53 |
// BarrierSet::Name kind() { return BarrierSet::CardTableExtension; } |
|
54 |
||
55 |
// Scavenge support |
|
56 |
void scavenge_contents(ObjectStartArray* start_array, |
|
57 |
MutableSpace* sp, |
|
58 |
HeapWord* space_top, |
|
59 |
PSPromotionManager* pm); |
|
60 |
||
61 |
void scavenge_contents_parallel(ObjectStartArray* start_array, |
|
62 |
MutableSpace* sp, |
|
63 |
HeapWord* space_top, |
|
64 |
PSPromotionManager* pm, |
|
65 |
uint stripe_number); |
|
66 |
||
67 |
// Verification |
|
68 |
static void verify_all_young_refs_imprecise(); |
|
69 |
static void verify_all_young_refs_precise(); |
|
70 |
||
71 |
bool addr_is_marked_imprecise(void *addr); |
|
72 |
bool addr_is_marked_precise(void *addr); |
|
73 |
||
74 |
void set_card_newgen(void* addr) { jbyte* p = byte_for(addr); *p = verify_card; } |
|
75 |
||
76 |
// Testers for entries |
|
77 |
static bool card_is_dirty(int value) { return value == dirty_card; } |
|
78 |
static bool card_is_newgen(int value) { return value == youngergen_card; } |
|
79 |
static bool card_is_clean(int value) { return value == clean_card; } |
|
80 |
static bool card_is_verify(int value) { return value == verify_card; } |
|
81 |
||
82 |
// Card marking |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
83 |
void inline_write_ref_field_gc(void* field, oop new_val) { |
1 | 84 |
jbyte* byte = byte_for(field); |
85 |
*byte = youngergen_card; |
|
86 |
} |
|
87 |
||
88 |
// Adaptive size policy support |
|
89 |
// Allows adjustment of the base and size of the covered regions |
|
90 |
void resize_covered_region(MemRegion new_region); |
|
91 |
// Finds the covered region to resize based on the start address |
|
92 |
// of the covered regions. |
|
93 |
void resize_covered_region_by_start(MemRegion new_region); |
|
94 |
// Finds the covered region to resize based on the end address |
|
95 |
// of the covered regions. |
|
96 |
void resize_covered_region_by_end(int changed_region, MemRegion new_region); |
|
97 |
// Finds the lowest start address of a covered region that is |
|
98 |
// previous (i.e., lower index) to the covered region with index "ind". |
|
99 |
HeapWord* lowest_prev_committed_start(int ind) const; |
|
100 |
||
101 |
#ifdef ASSERT |
|
102 |
||
103 |
bool is_valid_card_address(jbyte* addr) { |
|
104 |
return (addr >= _byte_map) && (addr < _byte_map + _byte_map_size); |
|
105 |
} |
|
106 |
||
107 |
#endif // ASSERT |
|
108 |
}; |