hotspot/src/share/vm/gc_implementation/parallelScavenge/parMarkBitMap.cpp
author duke
Sat, 01 Dec 2007 00:00:00 +0000
changeset 1 489c9b5090e2
child 252 050143a0dbfb
permissions -rw-r--r--
Initial load
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
489c9b5090e2 Initial load
duke
parents:
diff changeset
     2
 * Copyright 2005-2006 Sun Microsystems, Inc.  All Rights Reserved.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     3
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     4
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     5
 * This code is free software; you can redistribute it and/or modify it
489c9b5090e2 Initial load
duke
parents:
diff changeset
     6
 * under the terms of the GNU General Public License version 2 only, as
489c9b5090e2 Initial load
duke
parents:
diff changeset
     7
 * published by the Free Software Foundation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     8
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     9
 * This code is distributed in the hope that it will be useful, but WITHOUT
489c9b5090e2 Initial load
duke
parents:
diff changeset
    10
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
489c9b5090e2 Initial load
duke
parents:
diff changeset
    11
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
489c9b5090e2 Initial load
duke
parents:
diff changeset
    12
 * version 2 for more details (a copy is included in the LICENSE file that
489c9b5090e2 Initial load
duke
parents:
diff changeset
    13
 * accompanied this code).
489c9b5090e2 Initial load
duke
parents:
diff changeset
    14
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    15
 * You should have received a copy of the GNU General Public License version
489c9b5090e2 Initial load
duke
parents:
diff changeset
    16
 * 2 along with this work; if not, write to the Free Software Foundation,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    17
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    18
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    19
 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    20
 * CA 95054 USA or visit www.sun.com if you need additional information or
489c9b5090e2 Initial load
duke
parents:
diff changeset
    21
 * have any questions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    22
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    23
 */
489c9b5090e2 Initial load
duke
parents:
diff changeset
    24
489c9b5090e2 Initial load
duke
parents:
diff changeset
    25
# include "incls/_precompiled.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    26
# include "incls/_parMarkBitMap.cpp.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    27
489c9b5090e2 Initial load
duke
parents:
diff changeset
    28
bool
489c9b5090e2 Initial load
duke
parents:
diff changeset
    29
ParMarkBitMap::initialize(MemRegion covered_region)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    30
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
    31
  const idx_t bits = bits_required(covered_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    32
  // The bits will be divided evenly between two bitmaps; each of them should be
489c9b5090e2 Initial load
duke
parents:
diff changeset
    33
  // an integral number of words.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    34
  assert(bits % (BitsPerWord * 2) == 0, "region size unaligned");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    35
489c9b5090e2 Initial load
duke
parents:
diff changeset
    36
  const size_t words = bits / BitsPerWord;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    37
  const size_t raw_bytes = words * sizeof(idx_t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    38
  const size_t page_sz = os::page_size_for_region(raw_bytes, raw_bytes, 10);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    39
  const size_t granularity = os::vm_allocation_granularity();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    40
  const size_t bytes = align_size_up(raw_bytes, MAX2(page_sz, granularity));
489c9b5090e2 Initial load
duke
parents:
diff changeset
    41
489c9b5090e2 Initial load
duke
parents:
diff changeset
    42
  const size_t rs_align = page_sz == (size_t) os::vm_page_size() ? 0 :
489c9b5090e2 Initial load
duke
parents:
diff changeset
    43
    MAX2(page_sz, granularity);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    44
  ReservedSpace rs(bytes, rs_align, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
  os::trace_page_sizes("par bitmap", raw_bytes, raw_bytes, page_sz,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
                       rs.base(), rs.size());
489c9b5090e2 Initial load
duke
parents:
diff changeset
    47
  _virtual_space = new PSVirtualSpace(rs, page_sz);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
  if (_virtual_space != NULL && _virtual_space->expand_by(bytes)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    49
    _region_start = covered_region.start();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    50
    _region_size = covered_region.word_size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    51
    idx_t* map = (idx_t*)_virtual_space->reserved_low_addr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    52
    _beg_bits.set_map(map);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    53
    _beg_bits.set_size(bits / 2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    54
    _end_bits.set_map(map + words / 2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    55
    _end_bits.set_size(bits / 2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    56
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    58
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
  _region_start = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
  _region_size = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    61
  if (_virtual_space != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    62
    delete _virtual_space;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    63
    _virtual_space = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    64
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    67
489c9b5090e2 Initial load
duke
parents:
diff changeset
    68
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
    69
extern size_t mark_bitmap_count;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    70
extern size_t mark_bitmap_size;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    71
#endif  // #ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
    72
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
bool
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
ParMarkBitMap::mark_obj(HeapWord* addr, size_t size)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
  const idx_t beg_bit = addr_to_bit(addr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
  if (_beg_bits.par_set_bit(beg_bit)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
    const idx_t end_bit = addr_to_bit(addr + size - 1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
    bool end_bit_ok = _end_bits.par_set_bit(end_bit);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
    assert(end_bit_ok, "concurrency problem");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
    DEBUG_ONLY(Atomic::inc_ptr(&mark_bitmap_count));
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
    DEBUG_ONLY(Atomic::add_ptr(size, &mark_bitmap_size));
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    87
489c9b5090e2 Initial load
duke
parents:
diff changeset
    88
size_t
489c9b5090e2 Initial load
duke
parents:
diff changeset
    89
ParMarkBitMap::live_words_in_range(HeapWord* beg_addr, HeapWord* end_addr) const
489c9b5090e2 Initial load
duke
parents:
diff changeset
    90
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
    91
  assert(beg_addr <= end_addr, "bad range");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    92
489c9b5090e2 Initial load
duke
parents:
diff changeset
    93
  idx_t live_bits = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
  // The bitmap routines require the right boundary to be word-aligned.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
  const idx_t end_bit = addr_to_bit(end_addr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
  const idx_t range_end = BitMap::word_align_up(end_bit);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
  idx_t beg_bit = find_obj_beg(addr_to_bit(beg_addr), range_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
  while (beg_bit < end_bit) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
    idx_t tmp_end = find_obj_end(beg_bit, range_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
    if (tmp_end < end_bit) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
      live_bits += tmp_end - beg_bit + 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
      beg_bit = find_obj_beg(tmp_end + 1, range_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   105
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
      live_bits += end_bit - beg_bit;  // No + 1 here; end_bit is not counted.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
      return bits_to_words(live_bits);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
  return bits_to_words(live_bits);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
size_t ParMarkBitMap::live_words_in_range(HeapWord* beg_addr, oop end_obj) const
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
  assert(beg_addr <= (HeapWord*)end_obj, "bad range");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
  assert(is_marked(end_obj), "end_obj must be live");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
  idx_t live_bits = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
  // The bitmap routines require the right boundary to be word-aligned.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
  const idx_t end_bit = addr_to_bit((HeapWord*)end_obj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
  const idx_t range_end = BitMap::word_align_up(end_bit);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
  idx_t beg_bit = find_obj_beg(addr_to_bit(beg_addr), range_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
  while (beg_bit < end_bit) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
    idx_t tmp_end = find_obj_end(beg_bit, range_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
    assert(tmp_end < end_bit, "missing end bit");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
    live_bits += tmp_end - beg_bit + 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
    beg_bit = find_obj_beg(tmp_end + 1, range_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
  return bits_to_words(live_bits);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   132
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   133
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
ParMarkBitMap::IterationStatus
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
ParMarkBitMap::iterate(ParMarkBitMapClosure* live_closure,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
                       idx_t range_beg, idx_t range_end) const
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
  DEBUG_ONLY(verify_bit(range_beg);)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
  DEBUG_ONLY(verify_bit(range_end);)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   140
  assert(range_beg <= range_end, "live range invalid");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   141
489c9b5090e2 Initial load
duke
parents:
diff changeset
   142
  // The bitmap routines require the right boundary to be word-aligned.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   143
  const idx_t search_end = BitMap::word_align_up(range_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
489c9b5090e2 Initial load
duke
parents:
diff changeset
   145
  idx_t cur_beg = find_obj_beg(range_beg, search_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
  while (cur_beg < range_end) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
    const idx_t cur_end = find_obj_end(cur_beg, search_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
    if (cur_end >= range_end) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
      // The obj ends outside the range.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   150
      live_closure->set_source(bit_to_addr(cur_beg));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   151
      return incomplete;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   152
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   153
489c9b5090e2 Initial load
duke
parents:
diff changeset
   154
    const size_t size = obj_size(cur_beg, cur_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   155
    IterationStatus status = live_closure->do_addr(bit_to_addr(cur_beg), size);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   156
    if (status != incomplete) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   157
      assert(status == would_overflow || status == full, "sanity");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   158
      return status;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   159
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   160
489c9b5090e2 Initial load
duke
parents:
diff changeset
   161
    // Successfully processed the object; look for the next object.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
    cur_beg = find_obj_beg(cur_end + 1, search_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   163
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   164
489c9b5090e2 Initial load
duke
parents:
diff changeset
   165
  live_closure->set_source(bit_to_addr(range_end));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   166
  return complete;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   167
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   168
489c9b5090e2 Initial load
duke
parents:
diff changeset
   169
ParMarkBitMap::IterationStatus
489c9b5090e2 Initial load
duke
parents:
diff changeset
   170
ParMarkBitMap::iterate(ParMarkBitMapClosure* live_closure,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   171
                       ParMarkBitMapClosure* dead_closure,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   172
                       idx_t range_beg, idx_t range_end,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   173
                       idx_t dead_range_end) const
489c9b5090e2 Initial load
duke
parents:
diff changeset
   174
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   175
  DEBUG_ONLY(verify_bit(range_beg);)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   176
  DEBUG_ONLY(verify_bit(range_end);)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   177
  DEBUG_ONLY(verify_bit(dead_range_end);)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   178
  assert(range_beg <= range_end, "live range invalid");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   179
  assert(range_end <= dead_range_end, "dead range invalid");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   180
489c9b5090e2 Initial load
duke
parents:
diff changeset
   181
  // The bitmap routines require the right boundary to be word-aligned.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   182
  const idx_t live_search_end = BitMap::word_align_up(range_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   183
  const idx_t dead_search_end = BitMap::word_align_up(dead_range_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   184
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
  idx_t cur_beg = range_beg;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
  if (range_beg < range_end && is_unmarked(range_beg)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
    // The range starts with dead space.  Look for the next object, then fill.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
    cur_beg = find_obj_beg(range_beg + 1, dead_search_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   189
    const idx_t dead_space_end = MIN2(cur_beg - 1, dead_range_end - 1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   190
    const size_t size = obj_size(range_beg, dead_space_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   191
    dead_closure->do_addr(bit_to_addr(range_beg), size);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   192
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   193
489c9b5090e2 Initial load
duke
parents:
diff changeset
   194
  while (cur_beg < range_end) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   195
    const idx_t cur_end = find_obj_end(cur_beg, live_search_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   196
    if (cur_end >= range_end) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   197
      // The obj ends outside the range.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   198
      live_closure->set_source(bit_to_addr(cur_beg));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   199
      return incomplete;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   200
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
489c9b5090e2 Initial load
duke
parents:
diff changeset
   202
    const size_t size = obj_size(cur_beg, cur_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   203
    IterationStatus status = live_closure->do_addr(bit_to_addr(cur_beg), size);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
    if (status != incomplete) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   205
      assert(status == would_overflow || status == full, "sanity");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   206
      return status;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   207
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   208
489c9b5090e2 Initial load
duke
parents:
diff changeset
   209
    // Look for the start of the next object.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   210
    const idx_t dead_space_beg = cur_end + 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
    cur_beg = find_obj_beg(dead_space_beg, dead_search_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
    if (cur_beg > dead_space_beg) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   213
      // Found dead space; compute the size and invoke the dead closure.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   214
      const idx_t dead_space_end = MIN2(cur_beg - 1, dead_range_end - 1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
      const size_t size = obj_size(dead_space_beg, dead_space_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
      dead_closure->do_addr(bit_to_addr(dead_space_beg), size);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   219
489c9b5090e2 Initial load
duke
parents:
diff changeset
   220
  live_closure->set_source(bit_to_addr(range_end));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   221
  return complete;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
489c9b5090e2 Initial load
duke
parents:
diff changeset
   224
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   225
void ParMarkBitMap::reset_counters()
489c9b5090e2 Initial load
duke
parents:
diff changeset
   226
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   227
  _cas_tries = _cas_retries = _cas_by_another = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   228
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   229
#endif  // #ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   230
489c9b5090e2 Initial load
duke
parents:
diff changeset
   231
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   232
void ParMarkBitMap::verify_clear() const
489c9b5090e2 Initial load
duke
parents:
diff changeset
   233
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
   234
  const idx_t* const beg = (const idx_t*)_virtual_space->committed_low_addr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   235
  const idx_t* const end = (const idx_t*)_virtual_space->committed_high_addr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   236
  for (const idx_t* p = beg; p < end; ++p) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   237
    assert(*p == 0, "bitmap not clear");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   238
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   239
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   240
#endif  // #ifdef ASSERT