Searched refs:range_beg (Results 1 - 2 of 2) sorted by relevance

/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DparMarkBitMap.cpp159 idx_t range_beg, idx_t range_end) const
161 DEBUG_ONLY(verify_bit(range_beg);)
163 assert(range_beg <= range_end, "live range invalid");
168 idx_t cur_beg = find_obj_beg(range_beg, search_end);
195 idx_t range_beg, idx_t range_end,
198 DEBUG_ONLY(verify_bit(range_beg);)
201 assert(range_beg <= range_end, "live range invalid");
208 idx_t cur_beg = range_beg;
209 if (range_beg < range_end && is_unmarked(range_beg)) {
193 iterate(ParMarkBitMapClosure* live_closure, ParMarkBitMapClosure* dead_closure, idx_t range_beg, idx_t range_end, idx_t dead_range_end) const argument
[all...]
H A DparMarkBitMap.hpp104 idx_t range_beg, idx_t range_end) const;
106 HeapWord* range_beg,
110 // space in the range [range_beg, dead_range_end). Note that dead_range_end
113 // This method assumes that if the first bit in the range (range_beg) is not
115 // applied. Thus callers must ensure that range_beg is not in the middle of a
119 idx_t range_beg, idx_t range_end,
123 HeapWord* range_beg,
358 HeapWord* range_beg,
361 return iterate(live_closure, addr_to_bit(range_beg), addr_to_bit(range_end));
367 HeapWord* range_beg,
[all...]

Completed in 30 milliseconds