Searched refs:idx_t (Results 1 - 12 of 12) sorted by relevance

/openjdk7/hotspot/src/share/vm/utilities/
H A DbitMap.hpp41 typedef size_t idx_t; // Type used for bit and word indices. typedef in class:VALUE_OBJ_CLASS_SPEC
53 idx_t _size; // Size of bitmap (in bits)
57 void at_put_grow(idx_t index, bool value);
62 static idx_t bit_in_word(idx_t bit) { return bit & (BitsPerWord - 1); }
66 static bm_word_t bit_mask(idx_t bit) { return (bm_word_t)1 << bit_in_word(bit); }
69 static idx_t word_index(idx_t bit) { return bit >> LogBitsPerWord; }
72 static idx_t bit_index(idx_t wor
277 typedef BitMap::idx_t idx_t; // Type used for bit and word indices. typedef in class:VALUE_OBJ_CLASS_SPEC
[all...]
H A DbitMap.inline.hpp32 inline void BitMap::verify_index(idx_t index) const {
36 inline void BitMap::verify_range(idx_t beg_index, idx_t end_index) const {
43 inline void BitMap::set_bit(idx_t bit) {
48 inline void BitMap::clear_bit(idx_t bit) {
53 inline bool BitMap::par_set_bit(idx_t bit) {
55 volatile idx_t* const addr = word_addr(bit);
56 const idx_t mask = bit_mask(bit);
57 idx_t old_val = *addr;
60 const idx_t new_va
[all...]
H A DbitMap.cpp43 BitMap::BitMap(bm_word_t* map, idx_t size_in_bits) :
51 BitMap::BitMap(idx_t size_in_bits, bool in_resource_area) :
58 void BitMap::resize(idx_t size_in_bits, bool in_resource_area) {
60 idx_t old_size_in_words = size_in_words();
64 idx_t new_size_in_words = size_in_words();
80 void BitMap::set_range_within_word(idx_t beg, idx_t end) {
89 void BitMap::clear_range_within_word(idx_t beg, idx_t end) {
98 void BitMap::par_put_range_within_word(idx_t be
[all...]
H A Dtaskqueue.hpp139 typedef NOT_LP64(uint16_t) LP64_ONLY(uint32_t) idx_t; typedef in class:TaskQueueSuper
150 Age(idx_t top, idx_t tag) { _fields._top = top; _fields._tag = tag; }
155 idx_t top() const volatile { return _fields._top; }
156 idx_t tag() const volatile { return _fields._tag; }
174 idx_t _top;
175 idx_t _tag;
259 typedef typename TaskQueueSuper<N, F>::idx_t idx_t; typedef in class:GenericTaskQueue
369 Age newAge((idx_t)localBo
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DparMarkBitMap.hpp38 typedef BitMap::idx_t idx_t; typedef in class:ParMarkBitMap
53 inline bool is_obj_beg(idx_t bit) const;
54 inline bool is_obj_end(idx_t bit) const;
58 inline bool is_marked(idx_t bit) const;
62 inline bool is_unmarked(idx_t bit) const;
69 inline static size_t bits_to_words(idx_t bits);
70 inline static idx_t words_to_bits(size_t words);
74 inline size_t obj_size(idx_t beg_bit, idx_t end_bi
[all...]
H A DparMarkBitMap.cpp49 const idx_t bits = bits_required(covered_region);
55 const size_t raw_bytes = words * sizeof(idx_t);
72 idx_t* map = (idx_t*)_virtual_space->reserved_low_addr();
99 const idx_t beg_bit = addr_to_bit(addr);
101 const idx_t end_bit = addr_to_bit(addr + size - 1);
116 idx_t live_bits = 0;
119 const idx_t end_bit = addr_to_bit(end_addr);
120 const idx_t range_end = BitMap::word_align_up(end_bit);
122 idx_t beg_bi
[all...]
H A DpsParallelCompact.hpp761 typedef ParMarkBitMap::idx_t idx_t;
923 typedef ParMarkBitMap::idx_t idx_t;
1096 idx_t bit);
1257 idx_t exiting_object_offset,
1258 idx_t region_offset_start,
1259 idx_t region_offset_end);
1466 idx_t bit)
H A DpsParallelCompact.cpp987 const idx_t beg_bit = _mark_bitmap.addr_to_bit(bot);
988 const idx_t end_bit = BitMap::word_align_up(_mark_bitmap.addr_to_bit(top));
1722 const idx_t dense_prefix_bit = _mark_bitmap.addr_to_bit(dense_prefix_end);
3135 idx_t bits_to_skip = m->words_to_bits(count);
3136 idx_t cur_beg = m->addr_to_bit(beg);
3137 const idx_t search_end = BitMap::word_align_up(m->addr_to_bit(end));
3141 idx_t cur_end = m->find_obj_end(cur_beg, search_end);
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DconcurrentMark.inline.hpp34 BitMap::idx_t start_idx,
35 BitMap::idx_t end_idx,
50 for (BitMap::idx_t i = start_idx; i < end_idx; i += 1) {
69 inline BitMap::idx_t ConcurrentMark::card_bitmap_index_for(HeapWord* addr) {
100 BitMap::idx_t start_idx = card_bitmap_index_for(start);
101 BitMap::idx_t end_idx = card_bitmap_index_for(end);
250 BitMap::idx_t start_offset = heapWordToOffset(start_addr);
251 BitMap::idx_t end_offset = heapWordToOffset(end_addr);
261 BitMap::idx_t next_offset = heapWordToOffset(next_addr);
H A DconcurrentMark.cpp423 _region_bm((BitMap::idx_t) max_regions, false /* in_resource_area*/),
495 BitMap::idx_t card_bm_size = _card_bm.size();
1253 BitMap::idx_t index = (BitMap::idx_t) hr->hrs_index();
1260 BitMap::idx_t end_index = (BitMap::idx_t) hr->last_hc_index();
1316 BitMap::idx_t start_idx = _cm->card_bitmap_index_for(start);
1317 BitMap::idx_t end_idx = _cm->card_bitmap_index_for(obj_end);
1342 BitMap::idx_t start_idx = _cm->card_bitmap_index_for(ntams);
1343 BitMap::idx_t end_id
[all...]
H A DconcurrentMark.hpp829 BitMap::idx_t start_idx,
830 BitMap::idx_t end_idx,
860 inline BitMap::idx_t card_bitmap_index_for(HeapWord* addr);
/openjdk7/hotspot/src/share/vm/compiler/
H A DmethodLiveness.hpp38 MethodLivenessResult(BitMap::bm_word_t* map, idx_t size_in_bits)
43 MethodLivenessResult(idx_t size_in_bits)

Completed in 81 milliseconds