Searched refs:bm_word_t (Results 1 - 6 of 6) sorted by relevance

/openjdk7/hotspot/src/share/vm/utilities/
H A DbitMap.cpp43 BitMap::BitMap(bm_word_t* map, idx_t size_in_bits) :
46 assert(sizeof(bm_word_t) == BytesPerWord, "Implementation assumption.");
54 assert(sizeof(bm_word_t) == BytesPerWord, "Implementation assumption.");
61 bm_word_t* old_map = map();
66 _map = NEW_RESOURCE_ARRAY(bm_word_t, new_size_in_words);
84 bm_word_t mask = inverted_bit_mask_for_range(beg, end);
93 bm_word_t mask = inverted_bit_mask_for_range(beg, end);
279 bm_word_t* dest_map = map();
280 bm_word_t* other_map = other.map();
283 bm_word_t word_unio
[all...]
H A DbitMap.hpp42 typedef uintptr_t bm_word_t; // Element type of array that represents typedef in class:VALUE_OBJ_CLASS_SPEC
51 ArrayAllocator<bm_word_t, mtInternal> _map_allocator;
52 bm_word_t* _map; // First word in bitmap
66 static bm_word_t bit_mask(idx_t bit) { return (bm_word_t)1 << bit_in_word(bit); }
75 bm_word_t* map() const { return _map; }
76 bm_word_t map(idx_t word) const { return _map[word]; }
79 bm_word_t* word_addr(idx_t bit) const { return map() + word_index(bit); }
82 void set_word (idx_t word, bm_word_t val) { _map[word] = val; }
89 bm_word_t inverted_bit_mask_for_rang
278 typedef BitMap::bm_word_t bm_word_t; // Element type of array that typedef in class:VALUE_OBJ_CLASS_SPEC
[all...]
H A DbitMap.inline.hpp132 bm_word_t* map = _map;
138 bm_word_t* map = _map;
311 inline BitMap::bm_word_t
316 bm_word_t mask = bit_mask(beg) - 1; // low (right) bits
/openjdk7/hotspot/src/share/vm/compiler/
H A DmethodLiveness.hpp38 MethodLivenessResult(BitMap::bm_word_t* map, idx_t size_in_bits)
/openjdk7/hotspot/src/share/vm/oops/
H A DgenerateOopMap.cpp1039 BitMap::bm_word_t* new_bb_hdr_bits =
1040 NEW_RESOURCE_ARRAY(BitMap::bm_word_t,
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DconcurrentMarkSweepGeneration.cpp6531 _bm.set_map((BitMap::bm_word_t*)_virtual_space.low());

Completed in 210 milliseconds