1.1 --- a/src/share/vm/memory/cardTableModRefBS.hpp Fri Sep 27 13:41:07 2013 +0200
1.2 +++ b/src/share/vm/memory/cardTableModRefBS.hpp Tue Sep 24 14:46:29 2013 +0200
1.3 @@ -339,34 +339,10 @@
1.4 _byte_map[card_index] = dirty_card_val();
1.5 }
1.6
1.7 - bool is_card_claimed(size_t card_index) {
1.8 - jbyte val = _byte_map[card_index];
1.9 - return (val & (clean_card_mask_val() | claimed_card_val())) == claimed_card_val();
1.10 - }
1.11 -
1.12 - void set_card_claimed(size_t card_index) {
1.13 - jbyte val = _byte_map[card_index];
1.14 - if (val == clean_card_val()) {
1.15 - val = (jbyte)claimed_card_val();
1.16 - } else {
1.17 - val |= (jbyte)claimed_card_val();
1.18 - }
1.19 - _byte_map[card_index] = val;
1.20 - }
1.21 -
1.22 - bool claim_card(size_t card_index);
1.23 -
1.24 bool is_card_clean(size_t card_index) {
1.25 return _byte_map[card_index] == clean_card_val();
1.26 }
1.27
1.28 - bool is_card_deferred(size_t card_index) {
1.29 - jbyte val = _byte_map[card_index];
1.30 - return (val & (clean_card_mask_val() | deferred_card_val())) == deferred_card_val();
1.31 - }
1.32 -
1.33 - bool mark_card_deferred(size_t card_index);
1.34 -
1.35 // Card marking array base (adjusted for heap low boundary)
1.36 // This would be the 0th element of _byte_map, if the heap started at 0x0.
1.37 // But since the heap starts at some higher address, this points to somewhere
