Searched refs:BitMap (Results 1 - 25 of 45) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/compiler/
H A DmethodLiveness.hpp33 class MethodLivenessResult : public BitMap {
38 MethodLivenessResult(BitMap::bm_word_t* map, idx_t size_in_bits)
39 : BitMap(map, size_in_bits)
44 : BitMap(size_in_bits)
69 BitMap _entry;
73 BitMap _normal_exit;
77 BitMap _exception_exit;
83 BitMap _gen;
84 BitMap _kill;
103 bool merge_normal(BitMap othe
[all...]
/openjdk7/hotspot/src/share/vm/utilities/
H A DbitMap.inline.hpp32 inline void BitMap::verify_index(idx_t index) const {
33 assert(index < _size, "BitMap index out of bounds");
36 inline void BitMap::verify_range(idx_t beg_index, idx_t end_index) const {
37 assert(beg_index <= end_index, "BitMap range error");
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) {
74 inline bool BitMap::par_clear_bit(idx_t bit) {
95 inline void BitMap::set_range(idx_t beg, idx_t end, RangeSizeHint hint) {
107 inline void BitMap
[all...]
H A DbitMap.cpp43 BitMap::BitMap(bm_word_t* map, idx_t size_in_bits) : function in class:BitMap
51 BitMap::BitMap(idx_t size_in_bits, bool in_resource_area) : function in class:BitMap
58 void BitMap::resize(idx_t size_in_bits, bool in_resource_area) {
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 beg, idx_t end, bool value) {
116 void BitMap::set_range(idx_t beg, idx_t end) {
135 void BitMap
[all...]
H A DbitMap.hpp37 class BitMap VALUE_OBJ_CLASS_SPEC {
117 BitMap() : _map(NULL), _size(0), _map_allocator(false) {} function in class:VALUE_OBJ_CLASS_SPEC
120 BitMap(bm_word_t* map, idx_t size_in_bits);
125 BitMap(idx_t size_in_bits, bool in_resource_area = true);
136 // (Note that this assumes that all calls to "resize" on the same BitMap
235 void set_union(BitMap bits);
236 void set_difference(BitMap bits);
237 void set_intersection(BitMap bits);
239 bool contains(const BitMap bits) const;
241 bool intersects(const BitMap bit
[all...]
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/interpreter/
H A DMaskFillerForNative.java34 MaskFillerForNative(Method method, BitMap mask, int maskSize) {
53 private BitMap mask;
H A DOopMapCacheEntry.java95 private BitMap mask; // may be null if mask is empty
107 mask = new BitMap(maskSize);
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/utilities/
H A DBitMap.java30 public class BitMap { class
31 public BitMap(int sizeInBits) { method in class:BitMap
44 Assert.that(offset>=0 && offset < size(), "BitMap index out of bounds");
96 public boolean setUnion(BitMap other) {
111 public void setIntersection(BitMap other) {
122 public void setFrom(BitMap other) {
135 public boolean setDifference(BitMap other) {
149 public boolean isSame(BitMap other) {
H A DMarkBits.java45 bits = new BitMap((int) numOopHandles);
90 private BitMap bits;
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/memory/
H A DCMSBitMap.java80 public BitMap bm() {
81 BitMap bitMap = new BitMap((int) (bmWordSize() >> shifter() ));
106 BitMap bm = bm();
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A Dg1RemSet.hpp110 void scrub(BitMap* region_bm, BitMap* card_bm);
115 void scrub_par(BitMap* region_bm, BitMap* card_bm,
H A DconcurrentMark.inline.hpp33 inline void ConcurrentMark::set_card_bitmap_range(BitMap* card_bm,
34 BitMap::idx_t start_idx,
35 BitMap::idx_t end_idx,
50 for (BitMap::idx_t i = start_idx; i < end_idx; i += 1) {
58 // Note BitMap::par_at_put_range() and BitMap::set_range() are exclusive.
69 inline BitMap::idx_t ConcurrentMark::card_bitmap_index_for(HeapWord* addr) {
82 BitMap* task_card_bm) {
100 BitMap::idx_t start_idx = card_bitmap_index_for(start);
101 BitMap
[all...]
H A DheapRegionRemSet.hpp78 BitMap _coarse_map;
141 void scrub(CardTableModRefBS* ctbs, BitMap* region_bm, BitMap* card_bm);
253 void scrub(CardTableModRefBS* ctbs, BitMap* region_bm, BitMap* card_bm);
354 const BitMap* _coarse_map;
H A DconcurrentMark.hpp53 // A generic CM bit map. This is essentially a wrapper around the BitMap
62 BitMap _bm; // the bit map itself
385 BitMap _region_bm;
386 BitMap _card_bm;
583 BitMap* _count_card_bitmaps;
828 inline void set_card_bitmap_range(BitMap* card_bm,
829 BitMap::idx_t start_idx,
830 BitMap::idx_t end_idx,
840 BitMap* count_card_bitmap_for(uint worker_id) {
843 BitMap* task_card_b
[all...]
H A DconcurrentMark.cpp423 _region_bm((BitMap::idx_t) max_regions, false /* in_resource_area*/),
492 _count_card_bitmaps = NEW_C_HEAP_ARRAY(BitMap, _max_task_num, mtGC);
495 BitMap::idx_t card_bm_size = _card_bm.size();
504 _count_card_bitmaps[i] = BitMap(card_bm_size, false);
1242 BitMap* _region_bm;
1243 BitMap* _card_bm;
1253 BitMap::idx_t index = (BitMap::idx_t) hr->hrs_index();
1260 BitMap::idx_t end_index = (BitMap
[all...]
H A Dg1RemSet.cpp468 BitMap* _region_bm;
469 BitMap* _card_bm;
472 ScrubRSClosure(BitMap* region_bm, BitMap* card_bm) :
490 void G1RemSet::scrub(BitMap* region_bm, BitMap* card_bm) {
495 void G1RemSet::scrub_par(BitMap* region_bm, BitMap* card_bm,
H A DheapRegionRemSet.cpp42 BitMap _bm;
59 BitMap* bm() { return &_bm; }
145 void scrub(CardTableModRefBS* ctbs, BitMap* card_bm) {
162 void union_bitmap_into(BitMap* bm) {
608 BitMap* region_bm, BitMap* card_bm) {
925 BitMap* region_bm, BitMap* card_bm) {
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DparMarkBitMap.cpp120 const idx_t range_end = BitMap::word_align_up(end_bit);
145 const idx_t range_end = BitMap::word_align_up(end_bit);
166 const idx_t search_end = BitMap::word_align_up(range_end);
205 const idx_t live_search_end = BitMap::word_align_up(range_end);
206 const idx_t dead_search_end = BitMap::word_align_up(dead_range_end);
H A DparMarkBitMap.hpp38 typedef BitMap::idx_t idx_t;
193 BitMap _beg_bits;
194 BitMap _end_bits;
382 inline BitMap::idx_t
413 const idx_t search_end = BitMap::word_align_up(end_bit);
423 const idx_t search_end = BitMap::word_align_up(end_bit);
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DconcurrentMarkSweepGeneration.inline.hpp80 BitMap::small_range);
87 BitMap::small_range);
94 BitMap::small_range);
101 BitMap::small_range);
108 BitMap::large_range);
115 BitMap::large_range);
122 BitMap::large_range);
129 BitMap::large_range);
H A DvmStructs_cms.hpp38 nonstatic_field(CMSBitMap, _bm, BitMap) \
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_ValueSet.hpp32 // A ValueSet is a simple abstraction on top of a BitMap representing
39 BitMap _map;
H A Dc1_Instruction.hpp1533 BitMap _stores_to_locals; // bit is set when a local variable is stored in the block
1549 BitMap _live_in; // set of live LIR_Opr registers at entry to this block
1550 BitMap _live_out; // set of live LIR_Opr registers at exit from this block
1551 BitMap _live_gen; // set of registers used before any redefinition in this block
1552 BitMap _live_kill; // set of registers defined in this block
1554 BitMap _fpu_register_usage;
1623 BitMap& live_in() { return _live_in; }
1624 BitMap& live_out() { return _live_out; }
1625 BitMap& live_gen() { return _live_gen; }
1626 BitMap
[all...]
/openjdk7/hotspot/src/share/vm/ci/
H A DciMethod.hpp38 class BitMap;
216 BitMap live_local_oops_at_bci(int bci);
219 const BitMap bci_block_start();
/openjdk7/hotspot/src/cpu/x86/vm/
H A Dc1_LinearScan_x86.hpp181 void merge_cleanup_fpu_stack(LIR_List* instrs, FpuStackSim* cur_sim, BitMap& live_fpu_regs);
/openjdk7/hotspot/src/share/vm/prims/
H A DjvmtiRedefineClasses.hpp412 // Pool) in the emcp_methods BitMap and returns the number of
416 void check_methods_and_mark_as_obsolete(BitMap *emcp_methods,

Completed in 74 milliseconds

12