Searched refs:get_next_one_offset (Results 1 - 7 of 7) sorted by relevance

/openjdk7/hotspot/src/share/vm/utilities/
H A DbitMap.hpp221 idx_t get_next_one_offset (idx_t l_index, idx_t r_index) const;
224 idx_t get_next_one_offset(idx_t offset) const { function in class:VALUE_OBJ_CLASS_SPEC
225 return get_next_one_offset(offset, size());
H A DbitMap.inline.hpp337 inline BitMap::idx_t BitMap::get_next_one_offset(idx_t l_offset,
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DconcurrentMark.inline.hpp253 start_offset = _bm.get_next_one_offset(start_offset, end_offset);
262 start_offset = _bm.get_next_one_offset(next_offset, end_offset);
H A DheapRegionRemSet.cpp971 (int) _coarse_map->get_next_one_offset(_coarse_cur_region_index + 1);
1000 _fine_cur_prt->_bm.get_next_one_offset(_cur_region_cur_card + 1);
1016 _cur_region_cur_card = _fine_cur_prt->_bm.get_next_one_offset(0);
H A DconcurrentMark.cpp85 size_t nextOffset = _bm.get_next_one_offset(addrOffset, limitOffset);
2999 BitMap::idx_t scan_idx = task_card_bm->get_next_one_offset(start_idx, limit_idx);
3006 // BitMap::get_next_one_offset() can handle the case when
3012 scan_idx = task_card_bm->get_next_one_offset(next_idx, limit_idx);
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DconcurrentMarkSweepGeneration.inline.hpp188 size_t nextOffset = _bm.get_next_one_offset(
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_LinearScan.cpp1333 for (int number = (int)live.get_next_one_offset(0, size); number < size; number = (int)live.get_next_one_offset(number + 1, size)) {
1704 for (int r = (int)live_at_edge.get_next_one_offset(0, size); r < size; r = (int)live_at_edge.get_next_one_offset(r + 1, size)) {
1876 for (int r = (int)block->live_in().get_next_one_offset(0, size); r < size; r = (int)block->live_in().get_next_one_offset(r + 1, size)) {
1950 for (int r = (int)block->live_in().get_next_one_offset(0, size); r < size; r = (int)block->live_in().get_next_one_offset(r + 1, size)) {
3373 for (int r = (int)live_at_edge.get_next_one_offset(0, size); r < size; r = (int)live_at_edge.get_next_one_offset(
[all...]

Completed in 136 milliseconds