tonyp@2968: /*
drchase@6680:  * Copyright (c) 2001, 2014, Oracle and/or its affiliates. All rights reserved.
tonyp@2968:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
tonyp@2968:  *
tonyp@2968:  * This code is free software; you can redistribute it and/or modify it
tonyp@2968:  * under the terms of the GNU General Public License version 2 only, as
tonyp@2968:  * published by the Free Software Foundation.
tonyp@2968:  *
tonyp@2968:  * This code is distributed in the hope that it will be useful, but WITHOUT
tonyp@2968:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
tonyp@2968:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
tonyp@2968:  * version 2 for more details (a copy is included in the LICENSE file that
tonyp@2968:  * accompanied this code).
tonyp@2968:  *
tonyp@2968:  * You should have received a copy of the GNU General Public License version
tonyp@2968:  * 2 along with this work; if not, write to the Free Software Foundation,
tonyp@2968:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
tonyp@2968:  *
tonyp@2968:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
tonyp@2968:  * or visit www.oracle.com if you need additional information or have any
tonyp@2968:  * questions.
tonyp@2968:  *
tonyp@2968:  */
tonyp@2968: 
tonyp@2968: #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_CONCURRENTMARK_INLINE_HPP
tonyp@2968: #define SHARE_VM_GC_IMPLEMENTATION_G1_CONCURRENTMARK_INLINE_HPP
tonyp@2968: 
tonyp@2968: #include "gc_implementation/g1/concurrentMark.hpp"
tonyp@2968: #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
tonyp@2968: 
johnc@4123: // Utility routine to set an exclusive range of cards on the given
johnc@4123: // card liveness bitmap
johnc@4123: inline void ConcurrentMark::set_card_bitmap_range(BitMap* card_bm,
johnc@4123:                                                   BitMap::idx_t start_idx,
johnc@4123:                                                   BitMap::idx_t end_idx,
johnc@4123:                                                   bool is_par) {
johnc@4123: 
johnc@4123:   // Set the exclusive bit range [start_idx, end_idx).
johnc@4123:   assert((end_idx - start_idx) > 0, "at least one card");
johnc@4123:   assert(end_idx <= card_bm->size(), "sanity");
johnc@4123: 
johnc@4123:   // Silently clip the end index
johnc@4123:   end_idx = MIN2(end_idx, card_bm->size());
johnc@4123: 
johnc@4123:   // For small ranges use a simple loop; otherwise use set_range or
johnc@4123:   // use par_at_put_range (if parallel). The range is made up of the
johnc@4123:   // cards that are spanned by an object/mem region so 8 cards will
johnc@4123:   // allow up to object sizes up to 4K to be handled using the loop.
johnc@4123:   if ((end_idx - start_idx) <= 8) {
johnc@4123:     for (BitMap::idx_t i = start_idx; i < end_idx; i += 1) {
johnc@4123:       if (is_par) {
johnc@4123:         card_bm->par_set_bit(i);
johnc@4123:       } else {
johnc@4123:         card_bm->set_bit(i);
johnc@4123:       }
johnc@4123:     }
johnc@4123:   } else {
johnc@4123:     // Note BitMap::par_at_put_range() and BitMap::set_range() are exclusive.
johnc@4123:     if (is_par) {
johnc@4123:       card_bm->par_at_put_range(start_idx, end_idx, true);
johnc@4123:     } else {
johnc@4123:       card_bm->set_range(start_idx, end_idx);
johnc@4123:     }
johnc@4123:   }
johnc@4123: }
johnc@4123: 
johnc@3463: // Returns the index in the liveness accounting card bitmap
johnc@3463: // for the given address
johnc@3463: inline BitMap::idx_t ConcurrentMark::card_bitmap_index_for(HeapWord* addr) {
johnc@3463:   // Below, the term "card num" means the result of shifting an address
johnc@3463:   // by the card shift -- address 0 corresponds to card number 0.  One
johnc@3463:   // must subtract the card num of the bottom of the heap to obtain a
johnc@3463:   // card table index.
johnc@3463:   intptr_t card_num = intptr_t(uintptr_t(addr) >> CardTableModRefBS::card_shift);
johnc@3463:   return card_num - heap_bottom_card_num();
johnc@3463: }
johnc@3463: 
johnc@3463: // Counts the given memory region in the given task/worker
johnc@3463: // counting data structures.
johnc@3463: inline void ConcurrentMark::count_region(MemRegion mr, HeapRegion* hr,
johnc@3463:                                          size_t* marked_bytes_array,
johnc@3463:                                          BitMap* task_card_bm) {
johnc@3463:   G1CollectedHeap* g1h = _g1h;
mgerdin@5811:   CardTableModRefBS* ct_bs = g1h->g1_barrier_set();
johnc@4123: 
johnc@3463:   HeapWord* start = mr.start();
johnc@4123:   HeapWord* end = mr.end();
johnc@3463:   size_t region_size_bytes = mr.byte_size();
tonyp@3713:   uint index = hr->hrs_index();
johnc@3463: 
johnc@3463:   assert(!hr->continuesHumongous(), "should not be HC region");
johnc@3463:   assert(hr == g1h->heap_region_containing(start), "sanity");
johnc@3463:   assert(hr == g1h->heap_region_containing(mr.last()), "sanity");
johnc@3463:   assert(marked_bytes_array != NULL, "pre-condition");
johnc@3463:   assert(task_card_bm != NULL, "pre-condition");
johnc@3463: 
johnc@3463:   // Add to the task local marked bytes for this region.
johnc@3463:   marked_bytes_array[index] += region_size_bytes;
johnc@3463: 
johnc@3463:   BitMap::idx_t start_idx = card_bitmap_index_for(start);
johnc@4123:   BitMap::idx_t end_idx = card_bitmap_index_for(end);
johnc@3463: 
johnc@4123:   // Note: if we're looking at the last region in heap - end
johnc@4123:   // could be actually just beyond the end of the heap; end_idx
johnc@4123:   // will then correspond to a (non-existent) card that is also
johnc@4123:   // just beyond the heap.
johnc@4123:   if (g1h->is_in_g1_reserved(end) && !ct_bs->is_card_aligned(end)) {
johnc@4123:     // end of region is not card aligned - incremement to cover
johnc@4123:     // all the cards spanned by the region.
johnc@4123:     end_idx += 1;
johnc@3463:   }
johnc@4123:   // The card bitmap is task/worker specific => no need to use
johnc@4123:   // the 'par' BitMap routines.
johnc@4123:   // Set bits in the exclusive bit range [start_idx, end_idx).
johnc@4123:   set_card_bitmap_range(task_card_bm, start_idx, end_idx, false /* is_par */);
johnc@3463: }
johnc@3463: 
tonyp@3464: // Counts the given memory region in the task/worker counting
tonyp@3464: // data structures for the given worker id.
tonyp@3464: inline void ConcurrentMark::count_region(MemRegion mr,
tonyp@3464:                                          HeapRegion* hr,
tonyp@3464:                                          uint worker_id) {
tonyp@3464:   size_t* marked_bytes_array = count_marked_bytes_array_for(worker_id);
tonyp@3464:   BitMap* task_card_bm = count_card_bitmap_for(worker_id);
tonyp@3464:   count_region(mr, hr, marked_bytes_array, task_card_bm);
tonyp@3464: }
tonyp@3464: 
johnc@3463: // Counts the given memory region, which may be a single object, in the
johnc@3463: // task/worker counting data structures for the given worker id.
johnc@3463: inline void ConcurrentMark::count_region(MemRegion mr, uint worker_id) {
johnc@3463:   HeapWord* addr = mr.start();
johnc@3463:   HeapRegion* hr = _g1h->heap_region_containing_raw(addr);
tonyp@3464:   count_region(mr, hr, worker_id);
johnc@3463: }
johnc@3463: 
johnc@3463: // Counts the given object in the given task/worker counting data structures.
johnc@3463: inline void ConcurrentMark::count_object(oop obj,
johnc@3463:                                          HeapRegion* hr,
johnc@3463:                                          size_t* marked_bytes_array,
johnc@3463:                                          BitMap* task_card_bm) {
johnc@3463:   MemRegion mr((HeapWord*)obj, obj->size());
johnc@3463:   count_region(mr, hr, marked_bytes_array, task_card_bm);
johnc@3463: }
johnc@3463: 
johnc@3463: // Counts the given object in the task/worker counting data
johnc@3463: // structures for the given worker id.
tonyp@3464: inline void ConcurrentMark::count_object(oop obj,
tonyp@3464:                                          HeapRegion* hr,
tonyp@3464:                                          uint worker_id) {
johnc@3463:   size_t* marked_bytes_array = count_marked_bytes_array_for(worker_id);
johnc@3463:   BitMap* task_card_bm = count_card_bitmap_for(worker_id);
johnc@3463:   HeapWord* addr = (HeapWord*) obj;
johnc@3463:   count_object(obj, hr, marked_bytes_array, task_card_bm);
johnc@3463: }
johnc@3463: 
johnc@3463: // Attempts to mark the given object and, if successful, counts
johnc@3463: // the object in the given task/worker counting structures.
johnc@3463: inline bool ConcurrentMark::par_mark_and_count(oop obj,
johnc@3463:                                                HeapRegion* hr,
johnc@3463:                                                size_t* marked_bytes_array,
johnc@3463:                                                BitMap* task_card_bm) {
johnc@3463:   HeapWord* addr = (HeapWord*)obj;
johnc@3463:   if (_nextMarkBitMap->parMark(addr)) {
johnc@3463:     // Update the task specific count data for the object.
johnc@3463:     count_object(obj, hr, marked_bytes_array, task_card_bm);
johnc@3463:     return true;
johnc@3463:   }
johnc@3463:   return false;
johnc@3463: }
johnc@3463: 
johnc@3463: // Attempts to mark the given object and, if successful, counts
johnc@3463: // the object in the task/worker counting structures for the
johnc@3463: // given worker id.
johnc@3463: inline bool ConcurrentMark::par_mark_and_count(oop obj,
tonyp@3464:                                                size_t word_size,
tonyp@3464:                                                HeapRegion* hr,
tonyp@3464:                                                uint worker_id) {
tonyp@3464:   HeapWord* addr = (HeapWord*)obj;
tonyp@3464:   if (_nextMarkBitMap->parMark(addr)) {
tonyp@3464:     MemRegion mr(addr, word_size);
tonyp@3464:     count_region(mr, hr, worker_id);
tonyp@3464:     return true;
tonyp@3464:   }
tonyp@3464:   return false;
tonyp@3464: }
tonyp@3464: 
tonyp@3464: // Attempts to mark the given object and, if successful, counts
tonyp@3464: // the object in the task/worker counting structures for the
tonyp@3464: // given worker id.
tonyp@3464: inline bool ConcurrentMark::par_mark_and_count(oop obj,
johnc@3463:                                                HeapRegion* hr,
johnc@3463:                                                uint worker_id) {
johnc@3463:   HeapWord* addr = (HeapWord*)obj;
johnc@3463:   if (_nextMarkBitMap->parMark(addr)) {
johnc@3463:     // Update the task specific count data for the object.
johnc@3463:     count_object(obj, hr, worker_id);
johnc@3463:     return true;
johnc@3463:   }
johnc@3463:   return false;
johnc@3463: }
johnc@3463: 
johnc@3463: // As above - but we don't know the heap region containing the
johnc@3463: // object and so have to supply it.
johnc@3463: inline bool ConcurrentMark::par_mark_and_count(oop obj, uint worker_id) {
johnc@3463:   HeapWord* addr = (HeapWord*)obj;
johnc@3463:   HeapRegion* hr = _g1h->heap_region_containing_raw(addr);
johnc@3463:   return par_mark_and_count(obj, hr, worker_id);
johnc@3463: }
johnc@3463: 
johnc@3463: // Similar to the above routine but we already know the size, in words, of
johnc@3463: // the object that we wish to mark/count
johnc@3463: inline bool ConcurrentMark::par_mark_and_count(oop obj,
johnc@3463:                                                size_t word_size,
johnc@3463:                                                uint worker_id) {
johnc@3463:   HeapWord* addr = (HeapWord*)obj;
johnc@3463:   if (_nextMarkBitMap->parMark(addr)) {
johnc@3463:     // Update the task specific count data for the object.
johnc@3463:     MemRegion mr(addr, word_size);
johnc@3463:     count_region(mr, worker_id);
johnc@3463:     return true;
johnc@3463:   }
johnc@3463:   return false;
johnc@3463: }
johnc@3463: 
johnc@3463: // Unconditionally mark the given object, and unconditinally count
johnc@3463: // the object in the counting structures for worker id 0.
johnc@3463: // Should *not* be called from parallel code.
johnc@3463: inline bool ConcurrentMark::mark_and_count(oop obj, HeapRegion* hr) {
johnc@3463:   HeapWord* addr = (HeapWord*)obj;
johnc@3463:   _nextMarkBitMap->mark(addr);
johnc@3463:   // Update the task specific count data for the object.
johnc@3463:   count_object(obj, hr, 0 /* worker_id */);
johnc@3463:   return true;
johnc@3463: }
johnc@3463: 
johnc@3463: // As above - but we don't have the heap region containing the
johnc@3463: // object, so we have to supply it.
johnc@3463: inline bool ConcurrentMark::mark_and_count(oop obj) {
johnc@3463:   HeapWord* addr = (HeapWord*)obj;
johnc@3463:   HeapRegion* hr = _g1h->heap_region_containing_raw(addr);
johnc@3463:   return mark_and_count(obj, hr);
johnc@3463: }
johnc@3463: 
johnc@3454: inline bool CMBitMapRO::iterate(BitMapClosure* cl, MemRegion mr) {
johnc@3454:   HeapWord* start_addr = MAX2(startWord(), mr.start());
johnc@3454:   HeapWord* end_addr = MIN2(endWord(), mr.end());
johnc@3454: 
johnc@3454:   if (end_addr > start_addr) {
johnc@3454:     // Right-open interval [start-offset, end-offset).
johnc@3454:     BitMap::idx_t start_offset = heapWordToOffset(start_addr);
johnc@3454:     BitMap::idx_t end_offset = heapWordToOffset(end_addr);
johnc@3454: 
johnc@3454:     start_offset = _bm.get_next_one_offset(start_offset, end_offset);
johnc@3454:     while (start_offset < end_offset) {
johnc@3454:       if (!cl->do_bit(start_offset)) {
johnc@3454:         return false;
johnc@3454:       }
tamao@4733:       HeapWord* next_addr = MIN2(nextObject(offsetToHeapWord(start_offset)), end_addr);
johnc@3454:       BitMap::idx_t next_offset = heapWordToOffset(next_addr);
johnc@3454:       start_offset = _bm.get_next_one_offset(next_offset, end_offset);
johnc@3454:     }
johnc@3454:   }
johnc@3454:   return true;
johnc@3454: }
johnc@3454: 
johnc@3454: inline bool CMBitMapRO::iterate(BitMapClosure* cl) {
johnc@3454:   MemRegion mr(startWord(), sizeInWords());
johnc@3454:   return iterate(cl, mr);
johnc@3454: }
johnc@3454: 
tonyp@2968: inline void CMTask::push(oop obj) {
tonyp@2968:   HeapWord* objAddr = (HeapWord*) obj;
tonyp@2968:   assert(_g1h->is_in_g1_reserved(objAddr), "invariant");
tonyp@2968:   assert(!_g1h->is_on_master_free_list(
tonyp@2968:               _g1h->heap_region_containing((HeapWord*) objAddr)), "invariant");
tonyp@2968:   assert(!_g1h->is_obj_ill(obj), "invariant");
tonyp@2968:   assert(_nextMarkBitMap->isMarked(objAddr), "invariant");
tonyp@2968: 
tonyp@2968:   if (_cm->verbose_high()) {
drchase@6680:     gclog_or_tty->print_cr("[%u] pushing " PTR_FORMAT, _worker_id, p2i((void*) obj));
tonyp@2968:   }
tonyp@2968: 
tonyp@2968:   if (!_task_queue->push(obj)) {
tonyp@2968:     // The local task queue looks full. We need to push some entries
tonyp@2968:     // to the global stack.
tonyp@2968: 
tonyp@2968:     if (_cm->verbose_medium()) {
johnc@4173:       gclog_or_tty->print_cr("[%u] task queue overflow, "
tonyp@2968:                              "moving entries to the global stack",
johnc@4173:                              _worker_id);
tonyp@2968:     }
tonyp@2968:     move_entries_to_global_stack();
tonyp@2968: 
tonyp@2968:     // this should succeed since, even if we overflow the global
tonyp@2968:     // stack, we should have definitely removed some entries from the
tonyp@2968:     // local queue. So, there must be space on it.
tonyp@2968:     bool success = _task_queue->push(obj);
tonyp@2968:     assert(success, "invariant");
tonyp@2968:   }
tonyp@2968: 
tonyp@2968:   statsOnly( int tmp_size = _task_queue->size();
tonyp@2973:              if (tmp_size > _local_max_size) {
tonyp@2968:                _local_max_size = tmp_size;
tonyp@2973:              }
tonyp@2968:              ++_local_pushes );
tonyp@2968: }
tonyp@2968: 
tonyp@2968: // This determines whether the method below will check both the local
tonyp@2968: // and global fingers when determining whether to push on the stack a
tonyp@2968: // gray object (value 1) or whether it will only check the global one
tonyp@2968: // (value 0). The tradeoffs are that the former will be a bit more
tonyp@2968: // accurate and possibly push less on the stack, but it might also be
tonyp@2968: // a little bit slower.
tonyp@2968: 
tonyp@2968: #define _CHECK_BOTH_FINGERS_      1
tonyp@2968: 
tonyp@2968: inline void CMTask::deal_with_reference(oop obj) {
tonyp@2968:   if (_cm->verbose_high()) {
johnc@4173:     gclog_or_tty->print_cr("[%u] we're dealing with reference = "PTR_FORMAT,
drchase@6680:                            _worker_id, p2i((void*) obj));
tonyp@2968:   }
tonyp@2968: 
tonyp@2968:   ++_refs_reached;
tonyp@2968: 
tonyp@2968:   HeapWord* objAddr = (HeapWord*) obj;
tonyp@2968:   assert(obj->is_oop_or_null(true /* ignore mark word */), "Error");
johnc@3463:   if (_g1h->is_in_g1_reserved(objAddr)) {
tonyp@2968:     assert(obj != NULL, "null check is implicit");
tonyp@2968:     if (!_nextMarkBitMap->isMarked(objAddr)) {
tonyp@2968:       // Only get the containing region if the object is not marked on the
tonyp@2968:       // bitmap (otherwise, it's a waste of time since we won't do
tonyp@2968:       // anything with it).
tonyp@2968:       HeapRegion* hr = _g1h->heap_region_containing_raw(obj);
tonyp@2968:       if (!hr->obj_allocated_since_next_marking(obj)) {
tonyp@2968:         if (_cm->verbose_high()) {
johnc@4173:           gclog_or_tty->print_cr("[%u] "PTR_FORMAT" is not considered marked",
drchase@6680:                                  _worker_id, p2i((void*) obj));
tonyp@2968:         }
tonyp@2968: 
tonyp@2968:         // we need to mark it first
johnc@3463:         if (_cm->par_mark_and_count(obj, hr, _marked_bytes_array, _card_bm)) {
tonyp@2968:           // No OrderAccess:store_load() is needed. It is implicit in the
johnc@3463:           // CAS done in CMBitMap::parMark() call in the routine above.
tonyp@2968:           HeapWord* global_finger = _cm->finger();
tonyp@2968: 
tonyp@2968: #if _CHECK_BOTH_FINGERS_
tonyp@2968:           // we will check both the local and global fingers
tonyp@2968: 
tonyp@2968:           if (_finger != NULL && objAddr < _finger) {
tonyp@2968:             if (_cm->verbose_high()) {
johnc@4173:               gclog_or_tty->print_cr("[%u] below the local finger ("PTR_FORMAT"), "
drchase@6680:                                      "pushing it", _worker_id, p2i(_finger));
tonyp@2968:             }
tonyp@2968:             push(obj);
tonyp@2968:           } else if (_curr_region != NULL && objAddr < _region_limit) {
tonyp@2968:             // do nothing
tonyp@2968:           } else if (objAddr < global_finger) {
tonyp@2968:             // Notice that the global finger might be moving forward
tonyp@2968:             // concurrently. This is not a problem. In the worst case, we
tonyp@2968:             // mark the object while it is above the global finger and, by
tonyp@2968:             // the time we read the global finger, it has moved forward
tonyp@2968:             // passed this object. In this case, the object will probably
tonyp@2968:             // be visited when a task is scanning the region and will also
tonyp@2968:             // be pushed on the stack. So, some duplicate work, but no
tonyp@2968:             // correctness problems.
tonyp@2968: 
tonyp@2968:             if (_cm->verbose_high()) {
johnc@4173:               gclog_or_tty->print_cr("[%u] below the global finger "
tonyp@2968:                                      "("PTR_FORMAT"), pushing it",
drchase@6680:                                      _worker_id, p2i(global_finger));
tonyp@2968:             }
tonyp@2968:             push(obj);
tonyp@2968:           } else {
tonyp@2968:             // do nothing
tonyp@2968:           }
tonyp@2968: #else // _CHECK_BOTH_FINGERS_
tonyp@2968:           // we will only check the global finger
tonyp@2968: 
tonyp@2968:           if (objAddr < global_finger) {
tonyp@2968:             // see long comment above
tonyp@2968: 
tonyp@2968:             if (_cm->verbose_high()) {
johnc@4173:               gclog_or_tty->print_cr("[%u] below the global finger "
tonyp@2968:                                      "("PTR_FORMAT"), pushing it",
drchase@6680:                                      _worker_id, p2i(global_finger));
tonyp@2968:             }
tonyp@2968:             push(obj);
tonyp@2968:           }
tonyp@2968: #endif // _CHECK_BOTH_FINGERS_
tonyp@2968:         }
tonyp@2968:       }
tonyp@2968:     }
tonyp@2968:   }
tonyp@2968: }
tonyp@2968: 
tonyp@3416: inline void ConcurrentMark::markPrev(oop p) {
tonyp@3416:   assert(!_prevMarkBitMap->isMarked((HeapWord*) p), "sanity");
tonyp@3416:   // Note we are overriding the read-only view of the prev map here, via
tonyp@3416:   // the cast.
tonyp@3416:   ((CMBitMap*)_prevMarkBitMap)->mark((HeapWord*) p);
tonyp@3416: }
tonyp@3416: 
tonyp@3464: inline void ConcurrentMark::grayRoot(oop obj, size_t word_size,
tonyp@3464:                                      uint worker_id, HeapRegion* hr) {
tonyp@3464:   assert(obj != NULL, "pre-condition");
tonyp@3416:   HeapWord* addr = (HeapWord*) obj;
tonyp@3464:   if (hr == NULL) {
tonyp@3464:     hr = _g1h->heap_region_containing_raw(addr);
tonyp@3464:   } else {
tonyp@3464:     assert(hr->is_in(addr), "pre-condition");
tonyp@3464:   }
tonyp@3464:   assert(hr != NULL, "sanity");
tonyp@3464:   // Given that we're looking for a region that contains an object
tonyp@3464:   // header it's impossible to get back a HC region.
tonyp@3464:   assert(!hr->continuesHumongous(), "sanity");
tonyp@3416: 
tonyp@3416:   // We cannot assert that word_size == obj->size() given that obj
tonyp@3416:   // might not be in a consistent state (another thread might be in
tonyp@3416:   // the process of copying it). So the best thing we can do is to
tonyp@3416:   // assert that word_size is under an upper bound which is its
tonyp@3416:   // containing region's capacity.
tonyp@3416:   assert(word_size * HeapWordSize <= hr->capacity(),
tonyp@3416:          err_msg("size: "SIZE_FORMAT" capacity: "SIZE_FORMAT" "HR_FORMAT,
tonyp@3416:                  word_size * HeapWordSize, hr->capacity(),
tonyp@3416:                  HR_FORMAT_PARAMS(hr)));
tonyp@3416: 
tonyp@3464:   if (addr < hr->next_top_at_mark_start()) {
tonyp@3464:     if (!_nextMarkBitMap->isMarked(addr)) {
tonyp@3464:       par_mark_and_count(obj, word_size, hr, worker_id);
tonyp@3464:     }
tonyp@3416:   }
tonyp@3416: }
tonyp@3416: 
tonyp@2968: #endif // SHARE_VM_GC_IMPLEMENTATION_G1_CONCURRENTMARK_INLINE_HPP