Searched refs:N_words (Results 1 - 7 of 7) sorted by relevance
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | blockOffsetTable.cpp | 124 set_remainder_to_point_to_start(mr.start() + N_words, mr.end()); 159 // 0 corresponds to logarithmic value N_words + 0 and 2**(3 * 0) = 1 161 // 1 corresponds to logarithmic value N_words + 1 and 2**(3 * 1) = 8 163 // 2 corresponds to logarithmic value N_words + 2 and 2**(3 * 2) = 64 173 // back slip = 2**(3*(0x81 - N_words)) = 2**3) = 8 180 assert(end ==_array->address_for_index(end_card)+N_words, "Precondition"); 196 assert(_array->offset_array(start_card-1) <= N_words, 205 offset = N_words + i; 226 guarantee(_array->offset_array(start_card) == N_words, "Wrong value in second card"); 227 u_char last_entry = N_words; [all...] |
H A D | blockOffsetTable.hpp | 114 N_words = 1 << LogN_words enumerator in enum:BlockOffsetSharedArray::SomePrivateConstants 151 assert(pointer_delta(high, low) <= N_words, "offset too large"); 205 assert(pointer_delta(high, low) <= N_words, "offset too large"); 220 size_t number_of_slots = (mem_region_words / N_words) + 1; 260 HeapWord* inc_by_region_size(HeapWord* p) const { return p + N_words; } 282 N_words = BlockOffsetSharedArray::N_words, 284 // entries "e" of at least N_words mean "go back by Base^(e-N_words)." 285 // All entries are less than "N_words [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | g1BlockOffsetTable.cpp | 113 set_remainder_to_point_to_start(mr.start() + N_words, mr.end()); 150 // 0 corresponds to logarithmic value N_words + 0 and 2**(3 * 0) = 1 152 // 1 corresponds to logarithmic value N_words + 1 and 2**(3 * 1) = 8 154 // 2 corresponds to logarithmic value N_words + 2 and 2**(3 * 2) = 64 164 // back slip = 2**(3*(0x81 - N_words)) = 2**3) = 8 171 assert(end ==_array->address_for_index(end_card)+N_words, "Precondition"); 184 assert(_array->offset_array(start_card-1) <= N_words, 193 offset = N_words + i; 257 boundary += N_words; 274 HeapWord* rem_st = _array->address_for_index(start_index) + N_words; [all...] |
H A D | g1BlockOffsetTable.inline.hpp | 83 while (offset >= N_words) { 84 // The excess of the offset from N_words indicates a power of Base 87 q -= (N_words * n_cards_back); 92 assert(offset < N_words, "offset too large");
|
H A D | g1BlockOffsetTable.hpp | 147 assert(offset <= N_words, 149 "offset: " UINT32_FORMAT", N_words: " UINT32_FORMAT, 150 msg, offset, N_words)); 220 size_t number_of_slots = (mem_region_words / N_words) + 1; 229 N_words = 1 << LogN_words 267 N_words = G1BlockOffsetSharedArray::N_words,
|
H A D | g1RemSet.cpp | 135 HeapWord* card_end = card_start + G1BlockOffsetSharedArray::N_words; 157 card_start, card_start + G1BlockOffsetSharedArray::N_words);
|
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | vmStructs.cpp | 2178 declare_constant(BlockOffsetSharedArray::N_words) \ 2180 declare_constant(BlockOffsetArray::N_words) \
|
Completed in 1955 milliseconds