Lines Matching defs:beg
550 ParallelCompactData::summarize_dense_prefix(HeapWord* beg, HeapWord* end)
552 assert(region_offset(beg) == 0, "not RegionSize aligned");
555 size_t cur_region = addr_to_region_idx(beg);
557 HeapWord* addr = beg;
813 const size_t* const beg = (const size_t*)vspace->committed_low_addr();
815 for (const size_t* p = beg; p < end; ++p) {
1244 PSParallelCompact::first_dead_space_region(const RegionData* beg,
1249 size_t left = sd.region(beg);
1250 size_t right = end > beg ? sd.region(end) - 1 : left;
1274 PSParallelCompact::dead_wood_limit_region(const RegionData* beg,
1279 size_t left = sd.region(beg);
1280 size_t right = end > beg ? sd.region(end) - 1 : left;
2388 const rd_t* const beg = sd.addr_to_region_ptr(spc->bottom());
2394 const size_t region_cnt = pointer_delta(end, beg, sizeof(rd_t));
2396 for (const rd_t* cur = beg; cur < end; ++cur) {
2602 // Skip over count live words starting from beg, and return the address of the
2603 // next live word. Unless marked, the word corresponding to beg is assumed to
2604 // be dead. Callers must either ensure beg does not correspond to the middle of
2606 // also ensure that there are enough live words in the range [beg, end) to skip.
2608 PSParallelCompact::skip_live_words(HeapWord* beg, HeapWord* end, size_t count)
2614 idx_t cur_beg = m->addr_to_bit(beg);
2716 RegionData* const beg = sd.region(beg_region);
2724 for (RegionData* cur = beg; cur < end; ++cur) {