59 set_offset_array_raw(index, offset); 60 } 61 62 void G1BlockOffsetTable::set_offset_array(size_t index, HeapWord* high, HeapWord* low) { 63 check_index(index, "index out of range"); 64 assert(high >= low, "addresses out of order"); 65 size_t offset = pointer_delta(high, low); 66 check_offset(offset, "offset too large"); 67 set_offset_array(index, (u_char)offset); 68 } 69 70 void G1BlockOffsetTable::set_offset_array(size_t left, size_t right, u_char offset) { 71 check_index(right, "right index out of range"); 72 assert(left <= right, "indexes out of order"); 73 size_t num_cards = right - left + 1; 74 memset_with_concurrent_readers(&_offset_array[left], offset, num_cards); 75 } 76 77 // Variant of index_for that does not check the index for validity. 78 inline size_t G1BlockOffsetTable::index_for_raw(const void* p) const { 79 return pointer_delta((char*)p, _reserved.start(), sizeof(char)) >> LogN; 80 } 81 82 inline size_t G1BlockOffsetTable::index_for(const void* p) const { 83 char* pc = (char*)p; 84 assert(pc >= (char*)_reserved.start() && 85 pc < (char*)_reserved.end(), 86 "p (" PTR_FORMAT ") not in reserved [" PTR_FORMAT ", " PTR_FORMAT ")", 87 p2i(p), p2i(_reserved.start()), p2i(_reserved.end())); 88 size_t result = index_for_raw(p); 89 check_index(result, "bad index from address"); 90 return result; 91 } 92 93 inline HeapWord* G1BlockOffsetTable::address_for_index(size_t index) const { 94 check_index(index, "index out of range"); 95 HeapWord* result = address_for_index_raw(index); 96 assert(result >= _reserved.start() && result < _reserved.end(), 97 "bad address from index result " PTR_FORMAT 98 " _reserved.start() " PTR_FORMAT " _reserved.end() " PTR_FORMAT, 99 p2i(result), p2i(_reserved.start()), p2i(_reserved.end())); 100 return result; 101 } 102 103 inline size_t G1BlockOffsetTablePart::block_size(const HeapWord* p) const { 104 return _space->block_size(p); 105 } 106 107 inline HeapWord* G1BlockOffsetTablePart::block_at_or_preceding(const void* addr, 108 bool has_max_index, 109 size_t max_index) const { 110 assert(_bot->offset_array(0) == 0, "objects can't cross covered areas"); 111 size_t index = _bot->index_for(addr); 112 // We must make sure that the offset table entry we use is valid. If 113 // "addr" is past the end, start at the last known one and go forward. 114 if (has_max_index) { 115 index = MIN2(index, max_index); 116 } 117 HeapWord* q = _bot->address_for_index(index); 118 119 uint offset = _bot->offset_array(index); // Extend u_char to uint. 120 while (offset >= N_words) { 121 // The excess of the offset from N_words indicates a power of Base 122 // to go back by. 123 size_t n_cards_back = BlockOffsetArray::entry_to_cards_back(offset); 124 q -= (N_words * n_cards_back); 125 index -= n_cards_back; 126 offset = _bot->offset_array(index); 127 } 128 assert(offset < N_words, "offset too large"); 129 q -= offset; 130 return q; 131 } 132 133 inline HeapWord* G1BlockOffsetTablePart::forward_to_block_containing_addr_const(HeapWord* q, HeapWord* n, 134 const void* addr) const { 135 if (addr >= _space->top()) return _space->top(); 136 while (n <= addr) { 137 q = n; 138 oop obj = oop(q); 139 if (obj->klass_or_null() == NULL) { 140 return q; 141 } 142 n += block_size(q); 143 } 144 assert(q <= n, "wrong order for q and addr"); 145 assert(addr < n, "wrong order for addr and n"); 146 return q; 147 } 148 | 59 set_offset_array_raw(index, offset); 60 } 61 62 void G1BlockOffsetTable::set_offset_array(size_t index, HeapWord* high, HeapWord* low) { 63 check_index(index, "index out of range"); 64 assert(high >= low, "addresses out of order"); 65 size_t offset = pointer_delta(high, low); 66 check_offset(offset, "offset too large"); 67 set_offset_array(index, (u_char)offset); 68 } 69 70 void G1BlockOffsetTable::set_offset_array(size_t left, size_t right, u_char offset) { 71 check_index(right, "right index out of range"); 72 assert(left <= right, "indexes out of order"); 73 size_t num_cards = right - left + 1; 74 memset_with_concurrent_readers(&_offset_array[left], offset, num_cards); 75 } 76 77 // Variant of index_for that does not check the index for validity. 78 inline size_t G1BlockOffsetTable::index_for_raw(const void* p) const { 79 return pointer_delta((char*)p, _reserved.start(), sizeof(char)) >> BOTConstants::LogN; 80 } 81 82 inline size_t G1BlockOffsetTable::index_for(const void* p) const { 83 char* pc = (char*)p; 84 assert(pc >= (char*)_reserved.start() && 85 pc < (char*)_reserved.end(), 86 "p (" PTR_FORMAT ") not in reserved [" PTR_FORMAT ", " PTR_FORMAT ")", 87 p2i(p), p2i(_reserved.start()), p2i(_reserved.end())); 88 size_t result = index_for_raw(p); 89 check_index(result, "bad index from address"); 90 return result; 91 } 92 93 inline HeapWord* G1BlockOffsetTable::address_for_index(size_t index) const { 94 check_index(index, "index out of range"); 95 HeapWord* result = address_for_index_raw(index); 96 assert(result >= _reserved.start() && result < _reserved.end(), 97 "bad address from index result " PTR_FORMAT 98 " _reserved.start() " PTR_FORMAT " _reserved.end() " PTR_FORMAT, 99 p2i(result), p2i(_reserved.start()), p2i(_reserved.end())); 100 return result; 101 } 102 103 inline size_t G1BlockOffsetTablePart::block_size(const HeapWord* p) const { 104 return _space->block_size(p); 105 } 106 107 inline HeapWord* G1BlockOffsetTablePart::block_at_or_preceding(const void* addr, 108 bool has_max_index, 109 size_t max_index) const { 110 assert(_bot->offset_array(0) == 0, "objects can't cross covered areas"); 111 size_t index = _bot->index_for(addr); 112 // We must make sure that the offset table entry we use is valid. If 113 // "addr" is past the end, start at the last known one and go forward. 114 if (has_max_index) { 115 index = MIN2(index, max_index); 116 } 117 HeapWord* q = _bot->address_for_index(index); 118 119 uint offset = _bot->offset_array(index); // Extend u_char to uint. 120 while (offset >= BOTConstants::N_words) { 121 // The excess of the offset from N_words indicates a power of Base 122 // to go back by. 123 size_t n_cards_back = BOTConstants::entry_to_cards_back(offset); 124 q -= (BOTConstants::N_words * n_cards_back); 125 index -= n_cards_back; 126 offset = _bot->offset_array(index); 127 } 128 assert(offset < BOTConstants::N_words, "offset too large"); 129 q -= offset; 130 return q; 131 } 132 133 inline HeapWord* G1BlockOffsetTablePart::forward_to_block_containing_addr_const(HeapWord* q, HeapWord* n, 134 const void* addr) const { 135 if (addr >= _space->top()) return _space->top(); 136 while (n <= addr) { 137 q = n; 138 oop obj = oop(q); 139 if (obj->klass_or_null() == NULL) { 140 return q; 141 } 142 n += block_size(q); 143 } 144 assert(q <= n, "wrong order for q and addr"); 145 assert(addr < n, "wrong order for addr and n"); 146 return q; 147 } 148 |