1 /*
   2  * Copyright (c) 2001, 2020, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "classfile/classLoaderDataGraph.hpp"
  27 #include "classfile/metadataOnStackMark.hpp"
  28 #include "classfile/stringTable.hpp"
  29 #include "code/codeCache.hpp"
  30 #include "code/icBuffer.hpp"
  31 #include "gc/g1/g1Allocator.inline.hpp"
  32 #include "gc/g1/g1Arguments.hpp"
  33 #include "gc/g1/g1BarrierSet.hpp"
  34 #include "gc/g1/g1CardTableEntryClosure.hpp"
  35 #include "gc/g1/g1CollectedHeap.inline.hpp"
  36 #include "gc/g1/g1CollectionSet.hpp"
  37 #include "gc/g1/g1CollectorState.hpp"
  38 #include "gc/g1/g1ConcurrentRefine.hpp"
  39 #include "gc/g1/g1ConcurrentRefineThread.hpp"
  40 #include "gc/g1/g1ConcurrentMarkThread.inline.hpp"
  41 #include "gc/g1/g1DirtyCardQueue.hpp"
  42 #include "gc/g1/g1EvacStats.inline.hpp"
  43 #include "gc/g1/g1FullCollector.hpp"
  44 #include "gc/g1/g1GCParPhaseTimesTracker.hpp"
  45 #include "gc/g1/g1GCPhaseTimes.hpp"
  46 #include "gc/g1/g1HeapSizingPolicy.hpp"
  47 #include "gc/g1/g1HeapTransition.hpp"
  48 #include "gc/g1/g1HeapVerifier.hpp"
  49 #include "gc/g1/g1HotCardCache.hpp"
  50 #include "gc/g1/g1InitLogger.hpp"
  51 #include "gc/g1/g1MemoryPool.hpp"
  52 #include "gc/g1/g1OopClosures.inline.hpp"
  53 #include "gc/g1/g1ParallelCleaning.hpp"
  54 #include "gc/g1/g1ParScanThreadState.inline.hpp"
  55 #include "gc/g1/g1Policy.hpp"
  56 #include "gc/g1/g1RedirtyCardsQueue.hpp"
  57 #include "gc/g1/g1RegionToSpaceMapper.hpp"
  58 #include "gc/g1/g1RemSet.hpp"
  59 #include "gc/g1/g1RootClosures.hpp"
  60 #include "gc/g1/g1RootProcessor.hpp"
  61 #include "gc/g1/g1SATBMarkQueueSet.hpp"
  62 #include "gc/g1/g1StringDedup.hpp"
  63 #include "gc/g1/g1ThreadLocalData.hpp"
  64 #include "gc/g1/g1Trace.hpp"
  65 #include "gc/g1/g1YCTypes.hpp"
  66 #include "gc/g1/g1YoungRemSetSamplingThread.hpp"
  67 #include "gc/g1/g1VMOperations.hpp"
  68 #include "gc/g1/heapRegion.inline.hpp"
  69 #include "gc/g1/heapRegionRemSet.hpp"
  70 #include "gc/g1/heapRegionSet.inline.hpp"
  71 #include "gc/shared/concurrentGCBreakpoints.hpp"
  72 #include "gc/shared/gcBehaviours.hpp"
  73 #include "gc/shared/gcHeapSummary.hpp"
  74 #include "gc/shared/gcId.hpp"
  75 #include "gc/shared/gcLocker.hpp"
  76 #include "gc/shared/gcTimer.hpp"
  77 #include "gc/shared/gcTraceTime.inline.hpp"
  78 #include "gc/shared/generationSpec.hpp"
  79 #include "gc/shared/isGCActiveMark.hpp"
  80 #include "gc/shared/locationPrinter.inline.hpp"
  81 #include "gc/shared/oopStorageParState.hpp"
  82 #include "gc/shared/preservedMarks.inline.hpp"
  83 #include "gc/shared/suspendibleThreadSet.hpp"
  84 #include "gc/shared/referenceProcessor.inline.hpp"
  85 #include "gc/shared/taskTerminator.hpp"
  86 #include "gc/shared/taskqueue.inline.hpp"
  87 #include "gc/shared/weakProcessor.inline.hpp"
  88 #include "gc/shared/workerPolicy.hpp"
  89 #include "logging/log.hpp"
  90 #include "memory/allocation.hpp"
  91 #include "memory/iterator.hpp"
  92 #include "memory/heapInspection.hpp"
  93 #include "memory/resourceArea.hpp"
  94 #include "memory/universe.hpp"
  95 #include "oops/access.inline.hpp"
  96 #include "oops/compressedOops.inline.hpp"
  97 #include "oops/oop.inline.hpp"
  98 #include "runtime/atomic.hpp"
  99 #include "runtime/handles.inline.hpp"
 100 #include "runtime/init.hpp"
 101 #include "runtime/orderAccess.hpp"
 102 #include "runtime/threadSMR.hpp"
 103 #include "runtime/vmThread.hpp"
 104 #include "utilities/align.hpp"
 105 #include "utilities/autoRestore.hpp"
 106 #include "utilities/bitMap.inline.hpp"
 107 #include "utilities/globalDefinitions.hpp"
 108 #include "utilities/stack.inline.hpp"
 109 
 110 size_t G1CollectedHeap::_humongous_object_threshold_in_words = 0;
 111 
 112 // INVARIANTS/NOTES
 113 //
 114 // All allocation activity covered by the G1CollectedHeap interface is
 115 // serialized by acquiring the HeapLock.  This happens in mem_allocate
 116 // and allocate_new_tlab, which are the "entry" points to the
 117 // allocation code from the rest of the JVM.  (Note that this does not
 118 // apply to TLAB allocation, which is not part of this interface: it
 119 // is done by clients of this interface.)
 120 
 121 class RedirtyLoggedCardTableEntryClosure : public G1CardTableEntryClosure {
 122  private:
 123   size_t _num_dirtied;
 124   G1CollectedHeap* _g1h;
 125   G1CardTable* _g1_ct;
 126 
 127   HeapRegion* region_for_card(CardValue* card_ptr) const {
 128     return _g1h->heap_region_containing(_g1_ct->addr_for(card_ptr));
 129   }
 130 
 131   bool will_become_free(HeapRegion* hr) const {
 132     // A region will be freed by free_collection_set if the region is in the
 133     // collection set and has not had an evacuation failure.
 134     return _g1h->is_in_cset(hr) && !hr->evacuation_failed();
 135   }
 136 
 137  public:
 138   RedirtyLoggedCardTableEntryClosure(G1CollectedHeap* g1h) : G1CardTableEntryClosure(),
 139     _num_dirtied(0), _g1h(g1h), _g1_ct(g1h->card_table()) { }
 140 
 141   void do_card_ptr(CardValue* card_ptr, uint worker_id) {
 142     HeapRegion* hr = region_for_card(card_ptr);
 143 
 144     // Should only dirty cards in regions that won't be freed.
 145     if (!will_become_free(hr)) {
 146       *card_ptr = G1CardTable::dirty_card_val();
 147       _num_dirtied++;
 148     }
 149   }
 150 
 151   size_t num_dirtied()   const { return _num_dirtied; }
 152 };
 153 
 154 
 155 void G1RegionMappingChangedListener::reset_from_card_cache(uint start_idx, size_t num_regions) {
 156   HeapRegionRemSet::invalidate_from_card_cache(start_idx, num_regions);
 157 }
 158 
 159 void G1RegionMappingChangedListener::on_commit(uint start_idx, size_t num_regions, bool zero_filled) {
 160   // The from card cache is not the memory that is actually committed. So we cannot
 161   // take advantage of the zero_filled parameter.
 162   reset_from_card_cache(start_idx, num_regions);
 163 }
 164 
 165 void G1CollectedHeap::run_task(AbstractGangTask* task) {
 166   workers()->run_task(task, workers()->active_workers());
 167 }
 168 
 169 Tickspan G1CollectedHeap::run_task_timed(AbstractGangTask* task) {
 170   Ticks start = Ticks::now();
 171   run_task(task);
 172   return Ticks::now() - start;
 173 }
 174 
 175 HeapRegion* G1CollectedHeap::new_heap_region(uint hrs_index,
 176                                              MemRegion mr) {
 177   return new HeapRegion(hrs_index, bot(), mr);
 178 }
 179 
 180 // Private methods.
 181 
 182 HeapRegion* G1CollectedHeap::new_region(size_t word_size,
 183                                         HeapRegionType type,
 184                                         bool do_expand,
 185                                         uint node_index) {
 186   assert(!is_humongous(word_size) || word_size <= HeapRegion::GrainWords,
 187          "the only time we use this to allocate a humongous region is "
 188          "when we are allocating a single humongous region");
 189 
 190   HeapRegion* res = _hrm->allocate_free_region(type, node_index);
 191 
 192   if (res == NULL && do_expand && _expand_heap_after_alloc_failure) {
 193     // Currently, only attempts to allocate GC alloc regions set
 194     // do_expand to true. So, we should only reach here during a
 195     // safepoint. If this assumption changes we might have to
 196     // reconsider the use of _expand_heap_after_alloc_failure.
 197     assert(SafepointSynchronize::is_at_safepoint(), "invariant");
 198 
 199     log_debug(gc, ergo, heap)("Attempt heap expansion (region allocation request failed). Allocation request: " SIZE_FORMAT "B",
 200                               word_size * HeapWordSize);
 201 
 202     assert(word_size * HeapWordSize < HeapRegion::GrainBytes,
 203            "This kind of expansion should never be more than one region. Size: " SIZE_FORMAT,
 204            word_size * HeapWordSize);
 205     if (expand_single_region(node_index)) {
 206       // Given that expand_single_region() succeeded in expanding the heap, and we
 207       // always expand the heap by an amount aligned to the heap
 208       // region size, the free list should in theory not be empty.
 209       // In either case allocate_free_region() will check for NULL.
 210       res = _hrm->allocate_free_region(type, node_index);
 211     } else {
 212       _expand_heap_after_alloc_failure = false;
 213     }
 214   }
 215   return res;
 216 }
 217 
 218 HeapWord*
 219 G1CollectedHeap::humongous_obj_allocate_initialize_regions(HeapRegion* first_hr,
 220                                                            uint num_regions,
 221                                                            size_t word_size) {
 222   assert(first_hr != NULL, "pre-condition");
 223   assert(is_humongous(word_size), "word_size should be humongous");
 224   assert(num_regions * HeapRegion::GrainWords >= word_size, "pre-condition");
 225 
 226   // Index of last region in the series.
 227   uint first = first_hr->hrm_index();
 228   uint last = first + num_regions - 1;
 229 
 230   // We need to initialize the region(s) we just discovered. This is
 231   // a bit tricky given that it can happen concurrently with
 232   // refinement threads refining cards on these regions and
 233   // potentially wanting to refine the BOT as they are scanning
 234   // those cards (this can happen shortly after a cleanup; see CR
 235   // 6991377). So we have to set up the region(s) carefully and in
 236   // a specific order.
 237 
 238   // The word size sum of all the regions we will allocate.
 239   size_t word_size_sum = (size_t) num_regions * HeapRegion::GrainWords;
 240   assert(word_size <= word_size_sum, "sanity");
 241 
 242   // The passed in hr will be the "starts humongous" region. The header
 243   // of the new object will be placed at the bottom of this region.
 244   HeapWord* new_obj = first_hr->bottom();
 245   // This will be the new top of the new object.
 246   HeapWord* obj_top = new_obj + word_size;
 247 
 248   // First, we need to zero the header of the space that we will be
 249   // allocating. When we update top further down, some refinement
 250   // threads might try to scan the region. By zeroing the header we
 251   // ensure that any thread that will try to scan the region will
 252   // come across the zero klass word and bail out.
 253   //
 254   // NOTE: It would not have been correct to have used
 255   // CollectedHeap::fill_with_object() and make the space look like
 256   // an int array. The thread that is doing the allocation will
 257   // later update the object header to a potentially different array
 258   // type and, for a very short period of time, the klass and length
 259   // fields will be inconsistent. This could cause a refinement
 260   // thread to calculate the object size incorrectly.
 261   Copy::fill_to_words(new_obj, oopDesc::header_size(), 0);
 262 
 263   // Next, pad out the unused tail of the last region with filler
 264   // objects, for improved usage accounting.
 265   // How many words we use for filler objects.
 266   size_t word_fill_size = word_size_sum - word_size;
 267 
 268   // How many words memory we "waste" which cannot hold a filler object.
 269   size_t words_not_fillable = 0;
 270 
 271   if (word_fill_size >= min_fill_size()) {
 272     fill_with_objects(obj_top, word_fill_size);
 273   } else if (word_fill_size > 0) {
 274     // We have space to fill, but we cannot fit an object there.
 275     words_not_fillable = word_fill_size;
 276     word_fill_size = 0;
 277   }
 278 
 279   // We will set up the first region as "starts humongous". This
 280   // will also update the BOT covering all the regions to reflect
 281   // that there is a single object that starts at the bottom of the
 282   // first region.
 283   first_hr->set_starts_humongous(obj_top, word_fill_size);
 284   _policy->remset_tracker()->update_at_allocate(first_hr);
 285   // Then, if there are any, we will set up the "continues
 286   // humongous" regions.
 287   HeapRegion* hr = NULL;
 288   for (uint i = first + 1; i <= last; ++i) {
 289     hr = region_at(i);
 290     hr->set_continues_humongous(first_hr);
 291     _policy->remset_tracker()->update_at_allocate(hr);
 292   }
 293 
 294   // Up to this point no concurrent thread would have been able to
 295   // do any scanning on any region in this series. All the top
 296   // fields still point to bottom, so the intersection between
 297   // [bottom,top] and [card_start,card_end] will be empty. Before we
 298   // update the top fields, we'll do a storestore to make sure that
 299   // no thread sees the update to top before the zeroing of the
 300   // object header and the BOT initialization.
 301   OrderAccess::storestore();
 302 
 303   // Now, we will update the top fields of the "continues humongous"
 304   // regions except the last one.
 305   for (uint i = first; i < last; ++i) {
 306     hr = region_at(i);
 307     hr->set_top(hr->end());
 308   }
 309 
 310   hr = region_at(last);
 311   // If we cannot fit a filler object, we must set top to the end
 312   // of the humongous object, otherwise we cannot iterate the heap
 313   // and the BOT will not be complete.
 314   hr->set_top(hr->end() - words_not_fillable);
 315 
 316   assert(hr->bottom() < obj_top && obj_top <= hr->end(),
 317          "obj_top should be in last region");
 318 
 319   _verifier->check_bitmaps("Humongous Region Allocation", first_hr);
 320 
 321   assert(words_not_fillable == 0 ||
 322          first_hr->bottom() + word_size_sum - words_not_fillable == hr->top(),
 323          "Miscalculation in humongous allocation");
 324 
 325   increase_used((word_size_sum - words_not_fillable) * HeapWordSize);
 326 
 327   for (uint i = first; i <= last; ++i) {
 328     hr = region_at(i);
 329     _humongous_set.add(hr);
 330     _hr_printer.alloc(hr);
 331   }
 332 
 333   return new_obj;
 334 }
 335 
 336 size_t G1CollectedHeap::humongous_obj_size_in_regions(size_t word_size) {
 337   assert(is_humongous(word_size), "Object of size " SIZE_FORMAT " must be humongous here", word_size);
 338   return align_up(word_size, HeapRegion::GrainWords) / HeapRegion::GrainWords;
 339 }
 340 
 341 // If could fit into free regions w/o expansion, try.
 342 // Otherwise, if can expand, do so.
 343 // Otherwise, if using ex regions might help, try with ex given back.
 344 HeapWord* G1CollectedHeap::humongous_obj_allocate(size_t word_size) {
 345   assert_heap_locked_or_at_safepoint(true /* should_be_vm_thread */);
 346 
 347   _verifier->verify_region_sets_optional();
 348 
 349   uint obj_regions = (uint) humongous_obj_size_in_regions(word_size);
 350 
 351   // Policy: First try to allocate a humongous object in the free list.
 352   HeapRegion* humongous_start = _hrm->allocate_humongous(obj_regions);
 353   if (humongous_start == NULL) {
 354     // Policy: We could not find enough regions for the humongous object in the
 355     // free list. Look through the heap to find a mix of free and uncommitted regions.
 356     // If so, expand the heap and allocate the humongous object.
 357     humongous_start = _hrm->expand_and_allocate_humongous(obj_regions);
 358     if (humongous_start != NULL) {
 359       // We managed to find a region by expanding the heap.
 360       log_debug(gc, ergo, heap)("Heap expansion (humongous allocation request). Allocation request: " SIZE_FORMAT "B",
 361                                 word_size * HeapWordSize);
 362       policy()->record_new_heap_size(num_regions());
 363     } else {
 364       // Policy: Potentially trigger a defragmentation GC.
 365     }
 366   }
 367 
 368   HeapWord* result = NULL;
 369   if (humongous_start != NULL) {
 370     result = humongous_obj_allocate_initialize_regions(humongous_start, obj_regions, word_size);
 371     assert(result != NULL, "it should always return a valid result");
 372 
 373     // A successful humongous object allocation changes the used space
 374     // information of the old generation so we need to recalculate the
 375     // sizes and update the jstat counters here.
 376     g1mm()->update_sizes();
 377   }
 378 
 379   _verifier->verify_region_sets_optional();
 380 
 381   return result;
 382 }
 383 
 384 HeapWord* G1CollectedHeap::allocate_new_tlab(size_t min_size,
 385                                              size_t requested_size,
 386                                              size_t* actual_size) {
 387   assert_heap_not_locked_and_not_at_safepoint();
 388   assert(!is_humongous(requested_size), "we do not allow humongous TLABs");
 389 
 390   return attempt_allocation(min_size, requested_size, actual_size);
 391 }
 392 
 393 HeapWord*
 394 G1CollectedHeap::mem_allocate(size_t word_size,
 395                               bool*  gc_overhead_limit_was_exceeded) {
 396   assert_heap_not_locked_and_not_at_safepoint();
 397 
 398   if (is_humongous(word_size)) {
 399     return attempt_allocation_humongous(word_size);
 400   }
 401   size_t dummy = 0;
 402   return attempt_allocation(word_size, word_size, &dummy);
 403 }
 404 
 405 HeapWord* G1CollectedHeap::attempt_allocation_slow(size_t word_size) {
 406   ResourceMark rm; // For retrieving the thread names in log messages.
 407 
 408   // Make sure you read the note in attempt_allocation_humongous().
 409 
 410   assert_heap_not_locked_and_not_at_safepoint();
 411   assert(!is_humongous(word_size), "attempt_allocation_slow() should not "
 412          "be called for humongous allocation requests");
 413 
 414   // We should only get here after the first-level allocation attempt
 415   // (attempt_allocation()) failed to allocate.
 416 
 417   // We will loop until a) we manage to successfully perform the
 418   // allocation or b) we successfully schedule a collection which
 419   // fails to perform the allocation. b) is the only case when we'll
 420   // return NULL.
 421   HeapWord* result = NULL;
 422   for (uint try_count = 1, gclocker_retry_count = 0; /* we'll return */; try_count += 1) {
 423     bool should_try_gc;
 424     uint gc_count_before;
 425 
 426     {
 427       MutexLocker x(Heap_lock);
 428       result = _allocator->attempt_allocation_locked(word_size);
 429       if (result != NULL) {
 430         return result;
 431       }
 432 
 433       // If the GCLocker is active and we are bound for a GC, try expanding young gen.
 434       // This is different to when only GCLocker::needs_gc() is set: try to avoid
 435       // waiting because the GCLocker is active to not wait too long.
 436       if (GCLocker::is_active_and_needs_gc() && policy()->can_expand_young_list()) {
 437         // No need for an ergo message here, can_expand_young_list() does this when
 438         // it returns true.
 439         result = _allocator->attempt_allocation_force(word_size);
 440         if (result != NULL) {
 441           return result;
 442         }
 443       }
 444       // Only try a GC if the GCLocker does not signal the need for a GC. Wait until
 445       // the GCLocker initiated GC has been performed and then retry. This includes
 446       // the case when the GC Locker is not active but has not been performed.
 447       should_try_gc = !GCLocker::needs_gc();
 448       // Read the GC count while still holding the Heap_lock.
 449       gc_count_before = total_collections();
 450     }
 451 
 452     if (should_try_gc) {
 453       bool succeeded;
 454       result = do_collection_pause(word_size, gc_count_before, &succeeded,
 455                                    GCCause::_g1_inc_collection_pause);
 456       if (result != NULL) {
 457         assert(succeeded, "only way to get back a non-NULL result");
 458         log_trace(gc, alloc)("%s: Successfully scheduled collection returning " PTR_FORMAT,
 459                              Thread::current()->name(), p2i(result));
 460         return result;
 461       }
 462 
 463       if (succeeded) {
 464         // We successfully scheduled a collection which failed to allocate. No
 465         // point in trying to allocate further. We'll just return NULL.
 466         log_trace(gc, alloc)("%s: Successfully scheduled collection failing to allocate "
 467                              SIZE_FORMAT " words", Thread::current()->name(), word_size);
 468         return NULL;
 469       }
 470       log_trace(gc, alloc)("%s: Unsuccessfully scheduled collection allocating " SIZE_FORMAT " words",
 471                            Thread::current()->name(), word_size);
 472     } else {
 473       // Failed to schedule a collection.
 474       if (gclocker_retry_count > GCLockerRetryAllocationCount) {
 475         log_warning(gc, alloc)("%s: Retried waiting for GCLocker too often allocating "
 476                                SIZE_FORMAT " words", Thread::current()->name(), word_size);
 477         return NULL;
 478       }
 479       log_trace(gc, alloc)("%s: Stall until clear", Thread::current()->name());
 480       // The GCLocker is either active or the GCLocker initiated
 481       // GC has not yet been performed. Stall until it is and
 482       // then retry the allocation.
 483       GCLocker::stall_until_clear();
 484       gclocker_retry_count += 1;
 485     }
 486 
 487     // We can reach here if we were unsuccessful in scheduling a
 488     // collection (because another thread beat us to it) or if we were
 489     // stalled due to the GC locker. In either can we should retry the
 490     // allocation attempt in case another thread successfully
 491     // performed a collection and reclaimed enough space. We do the
 492     // first attempt (without holding the Heap_lock) here and the
 493     // follow-on attempt will be at the start of the next loop
 494     // iteration (after taking the Heap_lock).
 495     size_t dummy = 0;
 496     result = _allocator->attempt_allocation(word_size, word_size, &dummy);
 497     if (result != NULL) {
 498       return result;
 499     }
 500 
 501     // Give a warning if we seem to be looping forever.
 502     if ((QueuedAllocationWarningCount > 0) &&
 503         (try_count % QueuedAllocationWarningCount == 0)) {
 504       log_warning(gc, alloc)("%s:  Retried allocation %u times for " SIZE_FORMAT " words",
 505                              Thread::current()->name(), try_count, word_size);
 506     }
 507   }
 508 
 509   ShouldNotReachHere();
 510   return NULL;
 511 }
 512 
 513 void G1CollectedHeap::begin_archive_alloc_range(bool open) {
 514   assert_at_safepoint_on_vm_thread();
 515   if (_archive_allocator == NULL) {
 516     _archive_allocator = G1ArchiveAllocator::create_allocator(this, open);
 517   }
 518 }
 519 
 520 bool G1CollectedHeap::is_archive_alloc_too_large(size_t word_size) {
 521   // Allocations in archive regions cannot be of a size that would be considered
 522   // humongous even for a minimum-sized region, because G1 region sizes/boundaries
 523   // may be different at archive-restore time.
 524   return word_size >= humongous_threshold_for(HeapRegion::min_region_size_in_words());
 525 }
 526 
 527 HeapWord* G1CollectedHeap::archive_mem_allocate(size_t word_size) {
 528   assert_at_safepoint_on_vm_thread();
 529   assert(_archive_allocator != NULL, "_archive_allocator not initialized");
 530   if (is_archive_alloc_too_large(word_size)) {
 531     return NULL;
 532   }
 533   return _archive_allocator->archive_mem_allocate(word_size);
 534 }
 535 
 536 void G1CollectedHeap::end_archive_alloc_range(GrowableArray<MemRegion>* ranges,
 537                                               size_t end_alignment_in_bytes) {
 538   assert_at_safepoint_on_vm_thread();
 539   assert(_archive_allocator != NULL, "_archive_allocator not initialized");
 540 
 541   // Call complete_archive to do the real work, filling in the MemRegion
 542   // array with the archive regions.
 543   _archive_allocator->complete_archive(ranges, end_alignment_in_bytes);
 544   delete _archive_allocator;
 545   _archive_allocator = NULL;
 546 }
 547 
 548 bool G1CollectedHeap::check_archive_addresses(MemRegion* ranges, size_t count) {
 549   assert(ranges != NULL, "MemRegion array NULL");
 550   assert(count != 0, "No MemRegions provided");
 551   MemRegion reserved = _hrm->reserved();
 552   for (size_t i = 0; i < count; i++) {
 553     if (!reserved.contains(ranges[i].start()) || !reserved.contains(ranges[i].last())) {
 554       return false;
 555     }
 556   }
 557   return true;
 558 }
 559 
 560 bool G1CollectedHeap::alloc_archive_regions(MemRegion* ranges,
 561                                             size_t count,
 562                                             bool open) {
 563   assert(!is_init_completed(), "Expect to be called at JVM init time");
 564   assert(ranges != NULL, "MemRegion array NULL");
 565   assert(count != 0, "No MemRegions provided");
 566   MutexLocker x(Heap_lock);
 567 
 568   MemRegion reserved = _hrm->reserved();
 569   HeapWord* prev_last_addr = NULL;
 570   HeapRegion* prev_last_region = NULL;
 571 
 572   // Temporarily disable pretouching of heap pages. This interface is used
 573   // when mmap'ing archived heap data in, so pre-touching is wasted.
 574   FlagSetting fs(AlwaysPreTouch, false);
 575 
 576   // Enable archive object checking used by G1MarkSweep. We have to let it know
 577   // about each archive range, so that objects in those ranges aren't marked.
 578   G1ArchiveAllocator::enable_archive_object_check();
 579 
 580   // For each specified MemRegion range, allocate the corresponding G1
 581   // regions and mark them as archive regions. We expect the ranges
 582   // in ascending starting address order, without overlap.
 583   for (size_t i = 0; i < count; i++) {
 584     MemRegion curr_range = ranges[i];
 585     HeapWord* start_address = curr_range.start();
 586     size_t word_size = curr_range.word_size();
 587     HeapWord* last_address = curr_range.last();
 588     size_t commits = 0;
 589 
 590     guarantee(reserved.contains(start_address) && reserved.contains(last_address),
 591               "MemRegion outside of heap [" PTR_FORMAT ", " PTR_FORMAT "]",
 592               p2i(start_address), p2i(last_address));
 593     guarantee(start_address > prev_last_addr,
 594               "Ranges not in ascending order: " PTR_FORMAT " <= " PTR_FORMAT ,
 595               p2i(start_address), p2i(prev_last_addr));
 596     prev_last_addr = last_address;
 597 
 598     // Check for ranges that start in the same G1 region in which the previous
 599     // range ended, and adjust the start address so we don't try to allocate
 600     // the same region again. If the current range is entirely within that
 601     // region, skip it, just adjusting the recorded top.
 602     HeapRegion* start_region = _hrm->addr_to_region(start_address);
 603     if ((prev_last_region != NULL) && (start_region == prev_last_region)) {
 604       start_address = start_region->end();
 605       if (start_address > last_address) {
 606         increase_used(word_size * HeapWordSize);
 607         start_region->set_top(last_address + 1);
 608         continue;
 609       }
 610       start_region->set_top(start_address);
 611       curr_range = MemRegion(start_address, last_address + 1);
 612       start_region = _hrm->addr_to_region(start_address);
 613     }
 614 
 615     // Perform the actual region allocation, exiting if it fails.
 616     // Then note how much new space we have allocated.
 617     if (!_hrm->allocate_containing_regions(curr_range, &commits, workers())) {
 618       return false;
 619     }
 620     increase_used(word_size * HeapWordSize);
 621     if (commits != 0) {
 622       log_debug(gc, ergo, heap)("Attempt heap expansion (allocate archive regions). Total size: " SIZE_FORMAT "B",
 623                                 HeapRegion::GrainWords * HeapWordSize * commits);
 624 
 625     }
 626 
 627     // Mark each G1 region touched by the range as archive, add it to
 628     // the old set, and set top.
 629     HeapRegion* curr_region = _hrm->addr_to_region(start_address);
 630     HeapRegion* last_region = _hrm->addr_to_region(last_address);
 631     prev_last_region = last_region;
 632 
 633     while (curr_region != NULL) {
 634       assert(curr_region->is_empty() && !curr_region->is_pinned(),
 635              "Region already in use (index %u)", curr_region->hrm_index());
 636       if (open) {
 637         curr_region->set_open_archive();
 638       } else {
 639         curr_region->set_closed_archive();
 640       }
 641       _hr_printer.alloc(curr_region);
 642       _archive_set.add(curr_region);
 643       HeapWord* top;
 644       HeapRegion* next_region;
 645       if (curr_region != last_region) {
 646         top = curr_region->end();
 647         next_region = _hrm->next_region_in_heap(curr_region);
 648       } else {
 649         top = last_address + 1;
 650         next_region = NULL;
 651       }
 652       curr_region->set_top(top);
 653       curr_region = next_region;
 654     }
 655 
 656     // Notify mark-sweep of the archive
 657     G1ArchiveAllocator::set_range_archive(curr_range, open);
 658   }
 659   return true;
 660 }
 661 
 662 void G1CollectedHeap::fill_archive_regions(MemRegion* ranges, size_t count) {
 663   assert(!is_init_completed(), "Expect to be called at JVM init time");
 664   assert(ranges != NULL, "MemRegion array NULL");
 665   assert(count != 0, "No MemRegions provided");
 666   MemRegion reserved = _hrm->reserved();
 667   HeapWord *prev_last_addr = NULL;
 668   HeapRegion* prev_last_region = NULL;
 669 
 670   // For each MemRegion, create filler objects, if needed, in the G1 regions
 671   // that contain the address range. The address range actually within the
 672   // MemRegion will not be modified. That is assumed to have been initialized
 673   // elsewhere, probably via an mmap of archived heap data.
 674   MutexLocker x(Heap_lock);
 675   for (size_t i = 0; i < count; i++) {
 676     HeapWord* start_address = ranges[i].start();
 677     HeapWord* last_address = ranges[i].last();
 678 
 679     assert(reserved.contains(start_address) && reserved.contains(last_address),
 680            "MemRegion outside of heap [" PTR_FORMAT ", " PTR_FORMAT "]",
 681            p2i(start_address), p2i(last_address));
 682     assert(start_address > prev_last_addr,
 683            "Ranges not in ascending order: " PTR_FORMAT " <= " PTR_FORMAT ,
 684            p2i(start_address), p2i(prev_last_addr));
 685 
 686     HeapRegion* start_region = _hrm->addr_to_region(start_address);
 687     HeapRegion* last_region = _hrm->addr_to_region(last_address);
 688     HeapWord* bottom_address = start_region->bottom();
 689 
 690     // Check for a range beginning in the same region in which the
 691     // previous one ended.
 692     if (start_region == prev_last_region) {
 693       bottom_address = prev_last_addr + 1;
 694     }
 695 
 696     // Verify that the regions were all marked as archive regions by
 697     // alloc_archive_regions.
 698     HeapRegion* curr_region = start_region;
 699     while (curr_region != NULL) {
 700       guarantee(curr_region->is_archive(),
 701                 "Expected archive region at index %u", curr_region->hrm_index());
 702       if (curr_region != last_region) {
 703         curr_region = _hrm->next_region_in_heap(curr_region);
 704       } else {
 705         curr_region = NULL;
 706       }
 707     }
 708 
 709     prev_last_addr = last_address;
 710     prev_last_region = last_region;
 711 
 712     // Fill the memory below the allocated range with dummy object(s),
 713     // if the region bottom does not match the range start, or if the previous
 714     // range ended within the same G1 region, and there is a gap.
 715     if (start_address != bottom_address) {
 716       size_t fill_size = pointer_delta(start_address, bottom_address);
 717       G1CollectedHeap::fill_with_objects(bottom_address, fill_size);
 718       increase_used(fill_size * HeapWordSize);
 719     }
 720   }
 721 }
 722 
 723 inline HeapWord* G1CollectedHeap::attempt_allocation(size_t min_word_size,
 724                                                      size_t desired_word_size,
 725                                                      size_t* actual_word_size) {
 726   assert_heap_not_locked_and_not_at_safepoint();
 727   assert(!is_humongous(desired_word_size), "attempt_allocation() should not "
 728          "be called for humongous allocation requests");
 729 
 730   HeapWord* result = _allocator->attempt_allocation(min_word_size, desired_word_size, actual_word_size);
 731 
 732   if (result == NULL) {
 733     *actual_word_size = desired_word_size;
 734     result = attempt_allocation_slow(desired_word_size);
 735   }
 736 
 737   assert_heap_not_locked();
 738   if (result != NULL) {
 739     assert(*actual_word_size != 0, "Actual size must have been set here");
 740     dirty_young_block(result, *actual_word_size);
 741   } else {
 742     *actual_word_size = 0;
 743   }
 744 
 745   return result;
 746 }
 747 
 748 void G1CollectedHeap::dealloc_archive_regions(MemRegion* ranges, size_t count) {
 749   assert(!is_init_completed(), "Expect to be called at JVM init time");
 750   assert(ranges != NULL, "MemRegion array NULL");
 751   assert(count != 0, "No MemRegions provided");
 752   MemRegion reserved = _hrm->reserved();
 753   HeapWord* prev_last_addr = NULL;
 754   HeapRegion* prev_last_region = NULL;
 755   size_t size_used = 0;
 756   size_t uncommitted_regions = 0;
 757 
 758   // For each Memregion, free the G1 regions that constitute it, and
 759   // notify mark-sweep that the range is no longer to be considered 'archive.'
 760   MutexLocker x(Heap_lock);
 761   for (size_t i = 0; i < count; i++) {
 762     HeapWord* start_address = ranges[i].start();
 763     HeapWord* last_address = ranges[i].last();
 764 
 765     assert(reserved.contains(start_address) && reserved.contains(last_address),
 766            "MemRegion outside of heap [" PTR_FORMAT ", " PTR_FORMAT "]",
 767            p2i(start_address), p2i(last_address));
 768     assert(start_address > prev_last_addr,
 769            "Ranges not in ascending order: " PTR_FORMAT " <= " PTR_FORMAT ,
 770            p2i(start_address), p2i(prev_last_addr));
 771     size_used += ranges[i].byte_size();
 772     prev_last_addr = last_address;
 773 
 774     HeapRegion* start_region = _hrm->addr_to_region(start_address);
 775     HeapRegion* last_region = _hrm->addr_to_region(last_address);
 776 
 777     // Check for ranges that start in the same G1 region in which the previous
 778     // range ended, and adjust the start address so we don't try to free
 779     // the same region again. If the current range is entirely within that
 780     // region, skip it.
 781     if (start_region == prev_last_region) {
 782       start_address = start_region->end();
 783       if (start_address > last_address) {
 784         continue;
 785       }
 786       start_region = _hrm->addr_to_region(start_address);
 787     }
 788     prev_last_region = last_region;
 789 
 790     // After verifying that each region was marked as an archive region by
 791     // alloc_archive_regions, set it free and empty and uncommit it.
 792     HeapRegion* curr_region = start_region;
 793     while (curr_region != NULL) {
 794       guarantee(curr_region->is_archive(),
 795                 "Expected archive region at index %u", curr_region->hrm_index());
 796       uint curr_index = curr_region->hrm_index();
 797       _archive_set.remove(curr_region);
 798       curr_region->set_free();
 799       curr_region->set_top(curr_region->bottom());
 800       if (curr_region != last_region) {
 801         curr_region = _hrm->next_region_in_heap(curr_region);
 802       } else {
 803         curr_region = NULL;
 804       }
 805       _hrm->shrink_at(curr_index, 1);
 806       uncommitted_regions++;
 807     }
 808 
 809     // Notify mark-sweep that this is no longer an archive range.
 810     G1ArchiveAllocator::clear_range_archive(ranges[i]);
 811   }
 812 
 813   if (uncommitted_regions != 0) {
 814     log_debug(gc, ergo, heap)("Attempt heap shrinking (uncommitted archive regions). Total size: " SIZE_FORMAT "B",
 815                               HeapRegion::GrainWords * HeapWordSize * uncommitted_regions);
 816   }
 817   decrease_used(size_used);
 818 }
 819 
 820 oop G1CollectedHeap::materialize_archived_object(oop obj) {
 821   assert(obj != NULL, "archived obj is NULL");
 822   assert(G1ArchiveAllocator::is_archived_object(obj), "must be archived object");
 823 
 824   // Loading an archived object makes it strongly reachable. If it is
 825   // loaded during concurrent marking, it must be enqueued to the SATB
 826   // queue, shading the previously white object gray.
 827   G1BarrierSet::enqueue(obj);
 828 
 829   return obj;
 830 }
 831 
 832 HeapWord* G1CollectedHeap::attempt_allocation_humongous(size_t word_size) {
 833   ResourceMark rm; // For retrieving the thread names in log messages.
 834 
 835   // The structure of this method has a lot of similarities to
 836   // attempt_allocation_slow(). The reason these two were not merged
 837   // into a single one is that such a method would require several "if
 838   // allocation is not humongous do this, otherwise do that"
 839   // conditional paths which would obscure its flow. In fact, an early
 840   // version of this code did use a unified method which was harder to
 841   // follow and, as a result, it had subtle bugs that were hard to
 842   // track down. So keeping these two methods separate allows each to
 843   // be more readable. It will be good to keep these two in sync as
 844   // much as possible.
 845 
 846   assert_heap_not_locked_and_not_at_safepoint();
 847   assert(is_humongous(word_size), "attempt_allocation_humongous() "
 848          "should only be called for humongous allocations");
 849 
 850   // Humongous objects can exhaust the heap quickly, so we should check if we
 851   // need to start a marking cycle at each humongous object allocation. We do
 852   // the check before we do the actual allocation. The reason for doing it
 853   // before the allocation is that we avoid having to keep track of the newly
 854   // allocated memory while we do a GC.
 855   if (policy()->need_to_start_conc_mark("concurrent humongous allocation",
 856                                            word_size)) {
 857     collect(GCCause::_g1_humongous_allocation);
 858   }
 859 
 860   // We will loop until a) we manage to successfully perform the
 861   // allocation or b) we successfully schedule a collection which
 862   // fails to perform the allocation. b) is the only case when we'll
 863   // return NULL.
 864   HeapWord* result = NULL;
 865   for (uint try_count = 1, gclocker_retry_count = 0; /* we'll return */; try_count += 1) {
 866     bool should_try_gc;
 867     uint gc_count_before;
 868 
 869 
 870     {
 871       MutexLocker x(Heap_lock);
 872 
 873       // Given that humongous objects are not allocated in young
 874       // regions, we'll first try to do the allocation without doing a
 875       // collection hoping that there's enough space in the heap.
 876       result = humongous_obj_allocate(word_size);
 877       if (result != NULL) {
 878         size_t size_in_regions = humongous_obj_size_in_regions(word_size);
 879         policy()->old_gen_alloc_tracker()->
 880           add_allocated_bytes_since_last_gc(size_in_regions * HeapRegion::GrainBytes);
 881         return result;
 882       }
 883 
 884       // Only try a GC if the GCLocker does not signal the need for a GC. Wait until
 885       // the GCLocker initiated GC has been performed and then retry. This includes
 886       // the case when the GC Locker is not active but has not been performed.
 887       should_try_gc = !GCLocker::needs_gc();
 888       // Read the GC count while still holding the Heap_lock.
 889       gc_count_before = total_collections();
 890     }
 891 
 892     if (should_try_gc) {
 893       bool succeeded;
 894       result = do_collection_pause(word_size, gc_count_before, &succeeded,
 895                                    GCCause::_g1_humongous_allocation);
 896       if (result != NULL) {
 897         assert(succeeded, "only way to get back a non-NULL result");
 898         log_trace(gc, alloc)("%s: Successfully scheduled collection returning " PTR_FORMAT,
 899                              Thread::current()->name(), p2i(result));
 900         return result;
 901       }
 902 
 903       if (succeeded) {
 904         // We successfully scheduled a collection which failed to allocate. No
 905         // point in trying to allocate further. We'll just return NULL.
 906         log_trace(gc, alloc)("%s: Successfully scheduled collection failing to allocate "
 907                              SIZE_FORMAT " words", Thread::current()->name(), word_size);
 908         return NULL;
 909       }
 910       log_trace(gc, alloc)("%s: Unsuccessfully scheduled collection allocating " SIZE_FORMAT "",
 911                            Thread::current()->name(), word_size);
 912     } else {
 913       // Failed to schedule a collection.
 914       if (gclocker_retry_count > GCLockerRetryAllocationCount) {
 915         log_warning(gc, alloc)("%s: Retried waiting for GCLocker too often allocating "
 916                                SIZE_FORMAT " words", Thread::current()->name(), word_size);
 917         return NULL;
 918       }
 919       log_trace(gc, alloc)("%s: Stall until clear", Thread::current()->name());
 920       // The GCLocker is either active or the GCLocker initiated
 921       // GC has not yet been performed. Stall until it is and
 922       // then retry the allocation.
 923       GCLocker::stall_until_clear();
 924       gclocker_retry_count += 1;
 925     }
 926 
 927 
 928     // We can reach here if we were unsuccessful in scheduling a
 929     // collection (because another thread beat us to it) or if we were
 930     // stalled due to the GC locker. In either can we should retry the
 931     // allocation attempt in case another thread successfully
 932     // performed a collection and reclaimed enough space.
 933     // Humongous object allocation always needs a lock, so we wait for the retry
 934     // in the next iteration of the loop, unlike for the regular iteration case.
 935     // Give a warning if we seem to be looping forever.
 936 
 937     if ((QueuedAllocationWarningCount > 0) &&
 938         (try_count % QueuedAllocationWarningCount == 0)) {
 939       log_warning(gc, alloc)("%s: Retried allocation %u times for " SIZE_FORMAT " words",
 940                              Thread::current()->name(), try_count, word_size);
 941     }
 942   }
 943 
 944   ShouldNotReachHere();
 945   return NULL;
 946 }
 947 
 948 HeapWord* G1CollectedHeap::attempt_allocation_at_safepoint(size_t word_size,
 949                                                            bool expect_null_mutator_alloc_region) {
 950   assert_at_safepoint_on_vm_thread();
 951   assert(!_allocator->has_mutator_alloc_region() || !expect_null_mutator_alloc_region,
 952          "the current alloc region was unexpectedly found to be non-NULL");
 953 
 954   if (!is_humongous(word_size)) {
 955     return _allocator->attempt_allocation_locked(word_size);
 956   } else {
 957     HeapWord* result = humongous_obj_allocate(word_size);
 958     if (result != NULL && policy()->need_to_start_conc_mark("STW humongous allocation")) {
 959       collector_state()->set_initiate_conc_mark_if_possible(true);
 960     }
 961     return result;
 962   }
 963 
 964   ShouldNotReachHere();
 965 }
 966 
 967 class PostCompactionPrinterClosure: public HeapRegionClosure {
 968 private:
 969   G1HRPrinter* _hr_printer;
 970 public:
 971   bool do_heap_region(HeapRegion* hr) {
 972     assert(!hr->is_young(), "not expecting to find young regions");
 973     _hr_printer->post_compaction(hr);
 974     return false;
 975   }
 976 
 977   PostCompactionPrinterClosure(G1HRPrinter* hr_printer)
 978     : _hr_printer(hr_printer) { }
 979 };
 980 
 981 void G1CollectedHeap::print_hrm_post_compaction() {
 982   if (_hr_printer.is_active()) {
 983     PostCompactionPrinterClosure cl(hr_printer());
 984     heap_region_iterate(&cl);
 985   }
 986 }
 987 
 988 void G1CollectedHeap::abort_concurrent_cycle() {
 989   // If we start the compaction before the CM threads finish
 990   // scanning the root regions we might trip them over as we'll
 991   // be moving objects / updating references. So let's wait until
 992   // they are done. By telling them to abort, they should complete
 993   // early.
 994   _cm->root_regions()->abort();
 995   _cm->root_regions()->wait_until_scan_finished();
 996 
 997   // Disable discovery and empty the discovered lists
 998   // for the CM ref processor.
 999   _ref_processor_cm->disable_discovery();
1000   _ref_processor_cm->abandon_partial_discovery();
1001   _ref_processor_cm->verify_no_references_recorded();
1002 
1003   // Abandon current iterations of concurrent marking and concurrent
1004   // refinement, if any are in progress.
1005   concurrent_mark()->concurrent_cycle_abort();
1006 }
1007 
1008 void G1CollectedHeap::prepare_heap_for_full_collection() {
1009   // Make sure we'll choose a new allocation region afterwards.
1010   _allocator->release_mutator_alloc_regions();
1011   _allocator->abandon_gc_alloc_regions();
1012 
1013   // We may have added regions to the current incremental collection
1014   // set between the last GC or pause and now. We need to clear the
1015   // incremental collection set and then start rebuilding it afresh
1016   // after this full GC.
1017   abandon_collection_set(collection_set());
1018 
1019   tear_down_region_sets(false /* free_list_only */);
1020 
1021   hrm()->prepare_for_full_collection_start();
1022 }
1023 
1024 void G1CollectedHeap::verify_before_full_collection(bool explicit_gc) {
1025   assert(!GCCause::is_user_requested_gc(gc_cause()) || explicit_gc, "invariant");
1026   assert_used_and_recalculate_used_equal(this);
1027   _verifier->verify_region_sets_optional();
1028   _verifier->verify_before_gc(G1HeapVerifier::G1VerifyFull);
1029   _verifier->check_bitmaps("Full GC Start");
1030 }
1031 
1032 void G1CollectedHeap::prepare_heap_for_mutators() {
1033   hrm()->prepare_for_full_collection_end();
1034 
1035   // Delete metaspaces for unloaded class loaders and clean up loader_data graph
1036   ClassLoaderDataGraph::purge();
1037   MetaspaceUtils::verify_metrics();
1038 
1039   // Prepare heap for normal collections.
1040   assert(num_free_regions() == 0, "we should not have added any free regions");
1041   rebuild_region_sets(false /* free_list_only */);
1042   abort_refinement();
1043   resize_heap_if_necessary();
1044 
1045   // Rebuild the strong code root lists for each region
1046   rebuild_strong_code_roots();
1047 
1048   // Purge code root memory
1049   purge_code_root_memory();
1050 
1051   // Start a new incremental collection set for the next pause
1052   start_new_collection_set();
1053 
1054   _allocator->init_mutator_alloc_regions();
1055 
1056   // Post collection state updates.
1057   MetaspaceGC::compute_new_size();
1058 }
1059 
1060 void G1CollectedHeap::abort_refinement() {
1061   if (_hot_card_cache->use_cache()) {
1062     _hot_card_cache->reset_hot_cache();
1063   }
1064 
1065   // Discard all remembered set updates and reset refinement statistics.
1066   G1BarrierSet::dirty_card_queue_set().abandon_logs();
1067   assert(G1BarrierSet::dirty_card_queue_set().num_cards() == 0,
1068          "DCQS should be empty");
1069   concurrent_refine()->get_and_reset_refinement_stats();
1070 }
1071 
1072 void G1CollectedHeap::verify_after_full_collection() {
1073   _hrm->verify_optional();
1074   _verifier->verify_region_sets_optional();
1075   _verifier->verify_after_gc(G1HeapVerifier::G1VerifyFull);
1076   // Clear the previous marking bitmap, if needed for bitmap verification.
1077   // Note we cannot do this when we clear the next marking bitmap in
1078   // G1ConcurrentMark::abort() above since VerifyDuringGC verifies the
1079   // objects marked during a full GC against the previous bitmap.
1080   // But we need to clear it before calling check_bitmaps below since
1081   // the full GC has compacted objects and updated TAMS but not updated
1082   // the prev bitmap.
1083   if (G1VerifyBitmaps) {
1084     GCTraceTime(Debug, gc) tm("Clear Prev Bitmap for Verification");
1085     _cm->clear_prev_bitmap(workers());
1086   }
1087   // This call implicitly verifies that the next bitmap is clear after Full GC.
1088   _verifier->check_bitmaps("Full GC End");
1089 
1090   // At this point there should be no regions in the
1091   // entire heap tagged as young.
1092   assert(check_young_list_empty(), "young list should be empty at this point");
1093 
1094   // Note: since we've just done a full GC, concurrent
1095   // marking is no longer active. Therefore we need not
1096   // re-enable reference discovery for the CM ref processor.
1097   // That will be done at the start of the next marking cycle.
1098   // We also know that the STW processor should no longer
1099   // discover any new references.
1100   assert(!_ref_processor_stw->discovery_enabled(), "Postcondition");
1101   assert(!_ref_processor_cm->discovery_enabled(), "Postcondition");
1102   _ref_processor_stw->verify_no_references_recorded();
1103   _ref_processor_cm->verify_no_references_recorded();
1104 }
1105 
1106 void G1CollectedHeap::print_heap_after_full_collection(G1HeapTransition* heap_transition) {
1107   // Post collection logging.
1108   // We should do this after we potentially resize the heap so
1109   // that all the COMMIT / UNCOMMIT events are generated before
1110   // the compaction events.
1111   print_hrm_post_compaction();
1112   heap_transition->print();
1113   print_heap_after_gc();
1114   print_heap_regions();
1115 }
1116 
1117 bool G1CollectedHeap::do_full_collection(bool explicit_gc,
1118                                          bool clear_all_soft_refs) {
1119   assert_at_safepoint_on_vm_thread();
1120 
1121   if (GCLocker::check_active_before_gc()) {
1122     // Full GC was not completed.
1123     return false;
1124   }
1125 
1126   const bool do_clear_all_soft_refs = clear_all_soft_refs ||
1127       soft_ref_policy()->should_clear_all_soft_refs();
1128 
1129   G1FullCollector collector(this, explicit_gc, do_clear_all_soft_refs);
1130   GCTraceTime(Info, gc) tm("Pause Full", NULL, gc_cause(), true);
1131 
1132   collector.prepare_collection();
1133   collector.collect();
1134   collector.complete_collection();
1135 
1136   // Full collection was successfully completed.
1137   return true;
1138 }
1139 
1140 void G1CollectedHeap::do_full_collection(bool clear_all_soft_refs) {
1141   // Currently, there is no facility in the do_full_collection(bool) API to notify
1142   // the caller that the collection did not succeed (e.g., because it was locked
1143   // out by the GC locker). So, right now, we'll ignore the return value.
1144   bool dummy = do_full_collection(true,                /* explicit_gc */
1145                                   clear_all_soft_refs);
1146 }
1147 
1148 void G1CollectedHeap::resize_heap_if_necessary() {
1149   assert_at_safepoint_on_vm_thread();
1150 
1151   bool should_expand;
1152   size_t resize_amount = _heap_sizing_policy->full_collection_resize_amount(should_expand);
1153 
1154   if (resize_amount == 0) {
1155     return;
1156   } else if (should_expand) {
1157     expand(resize_amount, _workers);
1158   } else {
1159     shrink(resize_amount);
1160   }
1161 }
1162 
1163 HeapWord* G1CollectedHeap::satisfy_failed_allocation_helper(size_t word_size,
1164                                                             bool do_gc,
1165                                                             bool clear_all_soft_refs,
1166                                                             bool expect_null_mutator_alloc_region,
1167                                                             bool* gc_succeeded) {
1168   *gc_succeeded = true;
1169   // Let's attempt the allocation first.
1170   HeapWord* result =
1171     attempt_allocation_at_safepoint(word_size,
1172                                     expect_null_mutator_alloc_region);
1173   if (result != NULL) {
1174     return result;
1175   }
1176 
1177   // In a G1 heap, we're supposed to keep allocation from failing by
1178   // incremental pauses.  Therefore, at least for now, we'll favor
1179   // expansion over collection.  (This might change in the future if we can
1180   // do something smarter than full collection to satisfy a failed alloc.)
1181   result = expand_and_allocate(word_size);
1182   if (result != NULL) {
1183     return result;
1184   }
1185 
1186   if (do_gc) {
1187     // Expansion didn't work, we'll try to do a Full GC.
1188     *gc_succeeded = do_full_collection(false, /* explicit_gc */
1189                                        clear_all_soft_refs);
1190   }
1191 
1192   return NULL;
1193 }
1194 
1195 HeapWord* G1CollectedHeap::satisfy_failed_allocation(size_t word_size,
1196                                                      bool* succeeded) {
1197   assert_at_safepoint_on_vm_thread();
1198 
1199   // Attempts to allocate followed by Full GC.
1200   HeapWord* result =
1201     satisfy_failed_allocation_helper(word_size,
1202                                      true,  /* do_gc */
1203                                      false, /* clear_all_soft_refs */
1204                                      false, /* expect_null_mutator_alloc_region */
1205                                      succeeded);
1206 
1207   if (result != NULL || !*succeeded) {
1208     return result;
1209   }
1210 
1211   // Attempts to allocate followed by Full GC that will collect all soft references.
1212   result = satisfy_failed_allocation_helper(word_size,
1213                                             true, /* do_gc */
1214                                             true, /* clear_all_soft_refs */
1215                                             true, /* expect_null_mutator_alloc_region */
1216                                             succeeded);
1217 
1218   if (result != NULL || !*succeeded) {
1219     return result;
1220   }
1221 
1222   // Attempts to allocate, no GC
1223   result = satisfy_failed_allocation_helper(word_size,
1224                                             false, /* do_gc */
1225                                             false, /* clear_all_soft_refs */
1226                                             true,  /* expect_null_mutator_alloc_region */
1227                                             succeeded);
1228 
1229   if (result != NULL) {
1230     return result;
1231   }
1232 
1233   assert(!soft_ref_policy()->should_clear_all_soft_refs(),
1234          "Flag should have been handled and cleared prior to this point");
1235 
1236   // What else?  We might try synchronous finalization later.  If the total
1237   // space available is large enough for the allocation, then a more
1238   // complete compaction phase than we've tried so far might be
1239   // appropriate.
1240   return NULL;
1241 }
1242 
1243 // Attempting to expand the heap sufficiently
1244 // to support an allocation of the given "word_size".  If
1245 // successful, perform the allocation and return the address of the
1246 // allocated block, or else "NULL".
1247 
1248 HeapWord* G1CollectedHeap::expand_and_allocate(size_t word_size) {
1249   assert_at_safepoint_on_vm_thread();
1250 
1251   _verifier->verify_region_sets_optional();
1252 
1253   size_t expand_bytes = MAX2(word_size * HeapWordSize, MinHeapDeltaBytes);
1254   log_debug(gc, ergo, heap)("Attempt heap expansion (allocation request failed). Allocation request: " SIZE_FORMAT "B",
1255                             word_size * HeapWordSize);
1256 
1257 
1258   if (expand(expand_bytes, _workers)) {
1259     _hrm->verify_optional();
1260     _verifier->verify_region_sets_optional();
1261     return attempt_allocation_at_safepoint(word_size,
1262                                            false /* expect_null_mutator_alloc_region */);
1263   }
1264   return NULL;
1265 }
1266 
1267 bool G1CollectedHeap::expand(size_t expand_bytes, WorkGang* pretouch_workers, double* expand_time_ms) {
1268   size_t aligned_expand_bytes = ReservedSpace::page_align_size_up(expand_bytes);
1269   aligned_expand_bytes = align_up(aligned_expand_bytes,
1270                                        HeapRegion::GrainBytes);
1271 
1272   log_debug(gc, ergo, heap)("Expand the heap. requested expansion amount: " SIZE_FORMAT "B expansion amount: " SIZE_FORMAT "B",
1273                             expand_bytes, aligned_expand_bytes);
1274 
1275   if (is_maximal_no_gc()) {
1276     log_debug(gc, ergo, heap)("Did not expand the heap (heap already fully expanded)");
1277     return false;
1278   }
1279 
1280   double expand_heap_start_time_sec = os::elapsedTime();
1281   uint regions_to_expand = (uint)(aligned_expand_bytes / HeapRegion::GrainBytes);
1282   assert(regions_to_expand > 0, "Must expand by at least one region");
1283 
1284   uint expanded_by = _hrm->expand_by(regions_to_expand, pretouch_workers);
1285   if (expand_time_ms != NULL) {
1286     *expand_time_ms = (os::elapsedTime() - expand_heap_start_time_sec) * MILLIUNITS;
1287   }
1288 
1289   if (expanded_by > 0) {
1290     size_t actual_expand_bytes = expanded_by * HeapRegion::GrainBytes;
1291     assert(actual_expand_bytes <= aligned_expand_bytes, "post-condition");
1292     policy()->record_new_heap_size(num_regions());
1293   } else {
1294     log_debug(gc, ergo, heap)("Did not expand the heap (heap expansion operation failed)");
1295 
1296     // The expansion of the virtual storage space was unsuccessful.
1297     // Let's see if it was because we ran out of swap.
1298     if (G1ExitOnExpansionFailure &&
1299         _hrm->available() >= regions_to_expand) {
1300       // We had head room...
1301       vm_exit_out_of_memory(aligned_expand_bytes, OOM_MMAP_ERROR, "G1 heap expansion");
1302     }
1303   }
1304   return regions_to_expand > 0;
1305 }
1306 
1307 bool G1CollectedHeap::expand_single_region(uint node_index) {
1308   uint expanded_by = _hrm->expand_on_preferred_node(node_index);
1309 
1310   if (expanded_by == 0) {
1311     assert(is_maximal_no_gc(), "Should be no regions left, available: %u", _hrm->available());
1312     log_debug(gc, ergo, heap)("Did not expand the heap (heap already fully expanded)");
1313     return false;
1314   }
1315 
1316   policy()->record_new_heap_size(num_regions());
1317   return true;
1318 }
1319 
1320 void G1CollectedHeap::shrink_helper(size_t shrink_bytes) {
1321   size_t aligned_shrink_bytes =
1322     ReservedSpace::page_align_size_down(shrink_bytes);
1323   aligned_shrink_bytes = align_down(aligned_shrink_bytes,
1324                                          HeapRegion::GrainBytes);
1325   uint num_regions_to_remove = (uint)(shrink_bytes / HeapRegion::GrainBytes);
1326 
1327   uint num_regions_removed = _hrm->shrink_by(num_regions_to_remove);
1328   size_t shrunk_bytes = num_regions_removed * HeapRegion::GrainBytes;
1329 
1330   log_debug(gc, ergo, heap)("Shrink the heap. requested shrinking amount: " SIZE_FORMAT "B aligned shrinking amount: " SIZE_FORMAT "B attempted shrinking amount: " SIZE_FORMAT "B",
1331                             shrink_bytes, aligned_shrink_bytes, shrunk_bytes);
1332   if (num_regions_removed > 0) {
1333     policy()->record_new_heap_size(num_regions());
1334   } else {
1335     log_debug(gc, ergo, heap)("Did not expand the heap (heap shrinking operation failed)");
1336   }
1337 }
1338 
1339 void G1CollectedHeap::shrink(size_t shrink_bytes) {
1340   _verifier->verify_region_sets_optional();
1341 
1342   // We should only reach here at the end of a Full GC or during Remark which
1343   // means we should not not be holding to any GC alloc regions. The method
1344   // below will make sure of that and do any remaining clean up.
1345   _allocator->abandon_gc_alloc_regions();
1346 
1347   // Instead of tearing down / rebuilding the free lists here, we
1348   // could instead use the remove_all_pending() method on free_list to
1349   // remove only the ones that we need to remove.
1350   tear_down_region_sets(true /* free_list_only */);
1351   shrink_helper(shrink_bytes);
1352   rebuild_region_sets(true /* free_list_only */);
1353 
1354   _hrm->verify_optional();
1355   _verifier->verify_region_sets_optional();
1356 }
1357 
1358 class OldRegionSetChecker : public HeapRegionSetChecker {
1359 public:
1360   void check_mt_safety() {
1361     // Master Old Set MT safety protocol:
1362     // (a) If we're at a safepoint, operations on the master old set
1363     // should be invoked:
1364     // - by the VM thread (which will serialize them), or
1365     // - by the GC workers while holding the FreeList_lock, if we're
1366     //   at a safepoint for an evacuation pause (this lock is taken
1367     //   anyway when an GC alloc region is retired so that a new one
1368     //   is allocated from the free list), or
1369     // - by the GC workers while holding the OldSets_lock, if we're at a
1370     //   safepoint for a cleanup pause.
1371     // (b) If we're not at a safepoint, operations on the master old set
1372     // should be invoked while holding the Heap_lock.
1373 
1374     if (SafepointSynchronize::is_at_safepoint()) {
1375       guarantee(Thread::current()->is_VM_thread() ||
1376                 FreeList_lock->owned_by_self() || OldSets_lock->owned_by_self(),
1377                 "master old set MT safety protocol at a safepoint");
1378     } else {
1379       guarantee(Heap_lock->owned_by_self(), "master old set MT safety protocol outside a safepoint");
1380     }
1381   }
1382   bool is_correct_type(HeapRegion* hr) { return hr->is_old(); }
1383   const char* get_description() { return "Old Regions"; }
1384 };
1385 
1386 class ArchiveRegionSetChecker : public HeapRegionSetChecker {
1387 public:
1388   void check_mt_safety() {
1389     guarantee(!Universe::is_fully_initialized() || SafepointSynchronize::is_at_safepoint(),
1390               "May only change archive regions during initialization or safepoint.");
1391   }
1392   bool is_correct_type(HeapRegion* hr) { return hr->is_archive(); }
1393   const char* get_description() { return "Archive Regions"; }
1394 };
1395 
1396 class HumongousRegionSetChecker : public HeapRegionSetChecker {
1397 public:
1398   void check_mt_safety() {
1399     // Humongous Set MT safety protocol:
1400     // (a) If we're at a safepoint, operations on the master humongous
1401     // set should be invoked by either the VM thread (which will
1402     // serialize them) or by the GC workers while holding the
1403     // OldSets_lock.
1404     // (b) If we're not at a safepoint, operations on the master
1405     // humongous set should be invoked while holding the Heap_lock.
1406 
1407     if (SafepointSynchronize::is_at_safepoint()) {
1408       guarantee(Thread::current()->is_VM_thread() ||
1409                 OldSets_lock->owned_by_self(),
1410                 "master humongous set MT safety protocol at a safepoint");
1411     } else {
1412       guarantee(Heap_lock->owned_by_self(),
1413                 "master humongous set MT safety protocol outside a safepoint");
1414     }
1415   }
1416   bool is_correct_type(HeapRegion* hr) { return hr->is_humongous(); }
1417   const char* get_description() { return "Humongous Regions"; }
1418 };
1419 
1420 G1CollectedHeap::G1CollectedHeap() :
1421   CollectedHeap(),
1422   _young_gen_sampling_thread(NULL),
1423   _workers(NULL),
1424   _card_table(NULL),
1425   _soft_ref_policy(),
1426   _old_set("Old Region Set", new OldRegionSetChecker()),
1427   _archive_set("Archive Region Set", new ArchiveRegionSetChecker()),
1428   _humongous_set("Humongous Region Set", new HumongousRegionSetChecker()),
1429   _bot(NULL),
1430   _listener(),
1431   _numa(G1NUMA::create()),
1432   _hrm(NULL),
1433   _allocator(NULL),
1434   _verifier(NULL),
1435   _summary_bytes_used(0),
1436   _bytes_used_during_gc(0),
1437   _archive_allocator(NULL),
1438   _survivor_evac_stats("Young", YoungPLABSize, PLABWeight),
1439   _old_evac_stats("Old", OldPLABSize, PLABWeight),
1440   _expand_heap_after_alloc_failure(true),
1441   _g1mm(NULL),
1442   _humongous_reclaim_candidates(),
1443   _has_humongous_reclaim_candidates(false),
1444   _hr_printer(),
1445   _collector_state(),
1446   _old_marking_cycles_started(0),
1447   _old_marking_cycles_completed(0),
1448   _eden(),
1449   _survivor(),
1450   _gc_timer_stw(new (ResourceObj::C_HEAP, mtGC) STWGCTimer()),
1451   _gc_tracer_stw(new (ResourceObj::C_HEAP, mtGC) G1NewTracer()),
1452   _policy(G1Policy::create_policy(_gc_timer_stw)),
1453   _heap_sizing_policy(NULL),
1454   _collection_set(this, _policy),
1455   _hot_card_cache(NULL),
1456   _rem_set(NULL),
1457   _cm(NULL),
1458   _cm_thread(NULL),
1459   _cr(NULL),
1460   _task_queues(NULL),
1461   _evacuation_failed(false),
1462   _evacuation_failed_info_array(NULL),
1463   _preserved_marks_set(true /* in_c_heap */),
1464 #ifndef PRODUCT
1465   _evacuation_failure_alot_for_current_gc(false),
1466   _evacuation_failure_alot_gc_number(0),
1467   _evacuation_failure_alot_count(0),
1468 #endif
1469   _ref_processor_stw(NULL),
1470   _is_alive_closure_stw(this),
1471   _is_subject_to_discovery_stw(this),
1472   _ref_processor_cm(NULL),
1473   _is_alive_closure_cm(this),
1474   _is_subject_to_discovery_cm(this),
1475   _region_attr() {
1476 
1477   _verifier = new G1HeapVerifier(this);
1478 
1479   _allocator = new G1Allocator(this);
1480 
1481   _heap_sizing_policy = G1HeapSizingPolicy::create(this, _policy->analytics());
1482 
1483   _humongous_object_threshold_in_words = humongous_threshold_for(HeapRegion::GrainWords);
1484 
1485   // Override the default _filler_array_max_size so that no humongous filler
1486   // objects are created.
1487   _filler_array_max_size = _humongous_object_threshold_in_words;
1488 
1489   uint n_queues = ParallelGCThreads;
1490   _task_queues = new G1ScannerTasksQueueSet(n_queues);
1491 
1492   _evacuation_failed_info_array = NEW_C_HEAP_ARRAY(EvacuationFailedInfo, n_queues, mtGC);
1493 
1494   for (uint i = 0; i < n_queues; i++) {
1495     G1ScannerTasksQueue* q = new G1ScannerTasksQueue();
1496     q->initialize();
1497     _task_queues->register_queue(i, q);
1498     ::new (&_evacuation_failed_info_array[i]) EvacuationFailedInfo();
1499   }
1500 
1501   // Initialize the G1EvacuationFailureALot counters and flags.
1502   NOT_PRODUCT(reset_evacuation_should_fail();)
1503   _gc_tracer_stw->initialize();
1504 
1505   guarantee(_task_queues != NULL, "task_queues allocation failure.");
1506 }
1507 
1508 static size_t actual_reserved_page_size(ReservedSpace rs) {
1509   size_t page_size = os::vm_page_size();
1510   if (UseLargePages) {
1511     // There are two ways to manage large page memory.
1512     // 1. OS supports committing large page memory.
1513     // 2. OS doesn't support committing large page memory so ReservedSpace manages it.
1514     //    And ReservedSpace calls it 'special'. If we failed to set 'special',
1515     //    we reserved memory without large page.
1516     if (os::can_commit_large_page_memory() || rs.special()) {
1517       // An alignment at ReservedSpace comes from preferred page size or
1518       // heap alignment, and if the alignment came from heap alignment, it could be
1519       // larger than large pages size. So need to cap with the large page size.
1520       page_size = MIN2(rs.alignment(), os::large_page_size());
1521     }
1522   }
1523 
1524   return page_size;
1525 }
1526 
1527 G1RegionToSpaceMapper* G1CollectedHeap::create_aux_memory_mapper(const char* description,
1528                                                                  size_t size,
1529                                                                  size_t translation_factor) {
1530   size_t preferred_page_size = os::page_size_for_region_unaligned(size, 1);
1531   // Allocate a new reserved space, preferring to use large pages.
1532   ReservedSpace rs(size, preferred_page_size);
1533   size_t page_size = actual_reserved_page_size(rs);
1534   G1RegionToSpaceMapper* result  =
1535     G1RegionToSpaceMapper::create_mapper(rs,
1536                                          size,
1537                                          page_size,
1538                                          HeapRegion::GrainBytes,
1539                                          translation_factor,
1540                                          mtGC);
1541 
1542   os::trace_page_sizes_for_requested_size(description,
1543                                           size,
1544                                           preferred_page_size,
1545                                           page_size,
1546                                           rs.base(),
1547                                           rs.size());
1548 
1549   return result;
1550 }
1551 
1552 jint G1CollectedHeap::initialize_concurrent_refinement() {
1553   jint ecode = JNI_OK;
1554   _cr = G1ConcurrentRefine::create(&ecode);
1555   return ecode;
1556 }
1557 
1558 jint G1CollectedHeap::initialize_young_gen_sampling_thread() {
1559   _young_gen_sampling_thread = new G1YoungRemSetSamplingThread();
1560   if (_young_gen_sampling_thread->osthread() == NULL) {
1561     vm_shutdown_during_initialization("Could not create G1YoungRemSetSamplingThread");
1562     return JNI_ENOMEM;
1563   }
1564   return JNI_OK;
1565 }
1566 
1567 jint G1CollectedHeap::initialize() {
1568 
1569   // Necessary to satisfy locking discipline assertions.
1570 
1571   MutexLocker x(Heap_lock);
1572 
1573   // While there are no constraints in the GC code that HeapWordSize
1574   // be any particular value, there are multiple other areas in the
1575   // system which believe this to be true (e.g. oop->object_size in some
1576   // cases incorrectly returns the size in wordSize units rather than
1577   // HeapWordSize).
1578   guarantee(HeapWordSize == wordSize, "HeapWordSize must equal wordSize");
1579 
1580   size_t init_byte_size = InitialHeapSize;
1581   size_t reserved_byte_size = G1Arguments::heap_reserved_size_bytes();
1582 
1583   // Ensure that the sizes are properly aligned.
1584   Universe::check_alignment(init_byte_size, HeapRegion::GrainBytes, "g1 heap");
1585   Universe::check_alignment(reserved_byte_size, HeapRegion::GrainBytes, "g1 heap");
1586   Universe::check_alignment(reserved_byte_size, HeapAlignment, "g1 heap");
1587 
1588   // Reserve the maximum.
1589 
1590   // When compressed oops are enabled, the preferred heap base
1591   // is calculated by subtracting the requested size from the
1592   // 32Gb boundary and using the result as the base address for
1593   // heap reservation. If the requested size is not aligned to
1594   // HeapRegion::GrainBytes (i.e. the alignment that is passed
1595   // into the ReservedHeapSpace constructor) then the actual
1596   // base of the reserved heap may end up differing from the
1597   // address that was requested (i.e. the preferred heap base).
1598   // If this happens then we could end up using a non-optimal
1599   // compressed oops mode.
1600 
1601   ReservedHeapSpace heap_rs = Universe::reserve_heap(reserved_byte_size,
1602                                                      HeapAlignment);
1603 
1604   initialize_reserved_region(heap_rs);
1605 
1606   // Create the barrier set for the entire reserved region.
1607   G1CardTable* ct = new G1CardTable(heap_rs.region());
1608   ct->initialize();
1609   G1BarrierSet* bs = new G1BarrierSet(ct);
1610   bs->initialize();
1611   assert(bs->is_a(BarrierSet::G1BarrierSet), "sanity");
1612   BarrierSet::set_barrier_set(bs);
1613   _card_table = ct;
1614 
1615   {
1616     G1SATBMarkQueueSet& satbqs = bs->satb_mark_queue_set();
1617     satbqs.set_process_completed_buffers_threshold(G1SATBProcessCompletedThreshold);
1618     satbqs.set_buffer_enqueue_threshold_percentage(G1SATBBufferEnqueueingThresholdPercent);
1619   }
1620 
1621   // Create the hot card cache.
1622   _hot_card_cache = new G1HotCardCache(this);
1623 
1624   // Carve out the G1 part of the heap.
1625   ReservedSpace g1_rs = heap_rs.first_part(reserved_byte_size);
1626   size_t page_size = actual_reserved_page_size(heap_rs);
1627   G1RegionToSpaceMapper* heap_storage =
1628     G1RegionToSpaceMapper::create_heap_mapper(g1_rs,
1629                                               g1_rs.size(),
1630                                               page_size,
1631                                               HeapRegion::GrainBytes,
1632                                               1,
1633                                               mtJavaHeap);
1634   if(heap_storage == NULL) {
1635     vm_shutdown_during_initialization("Could not initialize G1 heap");
1636     return JNI_ERR;
1637   }
1638 
1639   os::trace_page_sizes("Heap",
1640                        MinHeapSize,
1641                        reserved_byte_size,
1642                        page_size,
1643                        heap_rs.base(),
1644                        heap_rs.size());
1645   heap_storage->set_mapping_changed_listener(&_listener);
1646 
1647   // Create storage for the BOT, card table, card counts table (hot card cache) and the bitmaps.
1648   G1RegionToSpaceMapper* bot_storage =
1649     create_aux_memory_mapper("Block Offset Table",
1650                              G1BlockOffsetTable::compute_size(g1_rs.size() / HeapWordSize),
1651                              G1BlockOffsetTable::heap_map_factor());
1652 
1653   G1RegionToSpaceMapper* cardtable_storage =
1654     create_aux_memory_mapper("Card Table",
1655                              G1CardTable::compute_size(g1_rs.size() / HeapWordSize),
1656                              G1CardTable::heap_map_factor());
1657 
1658   G1RegionToSpaceMapper* card_counts_storage =
1659     create_aux_memory_mapper("Card Counts Table",
1660                              G1CardCounts::compute_size(g1_rs.size() / HeapWordSize),
1661                              G1CardCounts::heap_map_factor());
1662 
1663   size_t bitmap_size = G1CMBitMap::compute_size(g1_rs.size());
1664   G1RegionToSpaceMapper* prev_bitmap_storage =
1665     create_aux_memory_mapper("Prev Bitmap", bitmap_size, G1CMBitMap::heap_map_factor());
1666   G1RegionToSpaceMapper* next_bitmap_storage =
1667     create_aux_memory_mapper("Next Bitmap", bitmap_size, G1CMBitMap::heap_map_factor());
1668 
1669   _hrm = HeapRegionManager::create_manager(this);
1670 
1671   _hrm->initialize(heap_storage, prev_bitmap_storage, next_bitmap_storage, bot_storage, cardtable_storage, card_counts_storage);
1672   _card_table->initialize(cardtable_storage);
1673 
1674   // Do later initialization work for concurrent refinement.
1675   _hot_card_cache->initialize(card_counts_storage);
1676 
1677   // 6843694 - ensure that the maximum region index can fit
1678   // in the remembered set structures.
1679   const uint max_region_idx = (1U << (sizeof(RegionIdx_t)*BitsPerByte-1)) - 1;
1680   guarantee((max_regions() - 1) <= max_region_idx, "too many regions");
1681 
1682   // The G1FromCardCache reserves card with value 0 as "invalid", so the heap must not
1683   // start within the first card.
1684   guarantee(g1_rs.base() >= (char*)G1CardTable::card_size, "Java heap must not start within the first card.");
1685   // Also create a G1 rem set.
1686   _rem_set = new G1RemSet(this, _card_table, _hot_card_cache);
1687   _rem_set->initialize(max_reserved_capacity(), max_regions());
1688 
1689   size_t max_cards_per_region = ((size_t)1 << (sizeof(CardIdx_t)*BitsPerByte-1)) - 1;
1690   guarantee(HeapRegion::CardsPerRegion > 0, "make sure it's initialized");
1691   guarantee(HeapRegion::CardsPerRegion < max_cards_per_region,
1692             "too many cards per region");
1693 
1694   FreeRegionList::set_unrealistically_long_length(max_expandable_regions() + 1);
1695 
1696   _bot = new G1BlockOffsetTable(reserved_region(), bot_storage);
1697 
1698   {
1699     HeapWord* start = _hrm->reserved().start();
1700     HeapWord* end = _hrm->reserved().end();
1701     size_t granularity = HeapRegion::GrainBytes;
1702 
1703     _region_attr.initialize(start, end, granularity);
1704     _humongous_reclaim_candidates.initialize(start, end, granularity);
1705   }
1706 
1707   _workers = new WorkGang("GC Thread", ParallelGCThreads,
1708                           true /* are_GC_task_threads */,
1709                           false /* are_ConcurrentGC_threads */);
1710   if (_workers == NULL) {
1711     return JNI_ENOMEM;
1712   }
1713   _workers->initialize_workers();
1714 
1715   _numa->set_region_info(HeapRegion::GrainBytes, page_size);
1716 
1717   // Create the G1ConcurrentMark data structure and thread.
1718   // (Must do this late, so that "max_regions" is defined.)
1719   _cm = new G1ConcurrentMark(this, prev_bitmap_storage, next_bitmap_storage);
1720   _cm_thread = _cm->cm_thread();
1721 
1722   // Now expand into the initial heap size.
1723   if (!expand(init_byte_size, _workers)) {
1724     vm_shutdown_during_initialization("Failed to allocate initial heap.");
1725     return JNI_ENOMEM;
1726   }
1727 
1728   // Perform any initialization actions delegated to the policy.
1729   policy()->init(this, &_collection_set);
1730 
1731   jint ecode = initialize_concurrent_refinement();
1732   if (ecode != JNI_OK) {
1733     return ecode;
1734   }
1735 
1736   ecode = initialize_young_gen_sampling_thread();
1737   if (ecode != JNI_OK) {
1738     return ecode;
1739   }
1740 
1741   {
1742     G1DirtyCardQueueSet& dcqs = G1BarrierSet::dirty_card_queue_set();
1743     dcqs.set_process_cards_threshold(concurrent_refine()->yellow_zone());
1744     dcqs.set_max_cards(concurrent_refine()->red_zone());
1745   }
1746 
1747   // Here we allocate the dummy HeapRegion that is required by the
1748   // G1AllocRegion class.
1749   HeapRegion* dummy_region = _hrm->get_dummy_region();
1750 
1751   // We'll re-use the same region whether the alloc region will
1752   // require BOT updates or not and, if it doesn't, then a non-young
1753   // region will complain that it cannot support allocations without
1754   // BOT updates. So we'll tag the dummy region as eden to avoid that.
1755   dummy_region->set_eden();
1756   // Make sure it's full.
1757   dummy_region->set_top(dummy_region->end());
1758   G1AllocRegion::setup(this, dummy_region);
1759 
1760   _allocator->init_mutator_alloc_regions();
1761 
1762   // Do create of the monitoring and management support so that
1763   // values in the heap have been properly initialized.
1764   _g1mm = new G1MonitoringSupport(this);
1765 
1766   G1StringDedup::initialize();
1767 
1768   _preserved_marks_set.init(ParallelGCThreads);
1769 
1770   _collection_set.initialize(max_regions());
1771 
1772   G1InitLogger::print();
1773 
1774   return JNI_OK;
1775 }
1776 
1777 void G1CollectedHeap::stop() {
1778   // Stop all concurrent threads. We do this to make sure these threads
1779   // do not continue to execute and access resources (e.g. logging)
1780   // that are destroyed during shutdown.
1781   _cr->stop();
1782   _young_gen_sampling_thread->stop();
1783   _cm_thread->stop();
1784   if (G1StringDedup::is_enabled()) {
1785     G1StringDedup::stop();
1786   }
1787 }
1788 
1789 void G1CollectedHeap::safepoint_synchronize_begin() {
1790   SuspendibleThreadSet::synchronize();
1791 }
1792 
1793 void G1CollectedHeap::safepoint_synchronize_end() {
1794   SuspendibleThreadSet::desynchronize();
1795 }
1796 
1797 void G1CollectedHeap::post_initialize() {
1798   CollectedHeap::post_initialize();
1799   ref_processing_init();
1800 }
1801 
1802 void G1CollectedHeap::ref_processing_init() {
1803   // Reference processing in G1 currently works as follows:
1804   //
1805   // * There are two reference processor instances. One is
1806   //   used to record and process discovered references
1807   //   during concurrent marking; the other is used to
1808   //   record and process references during STW pauses
1809   //   (both full and incremental).
1810   // * Both ref processors need to 'span' the entire heap as
1811   //   the regions in the collection set may be dotted around.
1812   //
1813   // * For the concurrent marking ref processor:
1814   //   * Reference discovery is enabled at concurrent start.
1815   //   * Reference discovery is disabled and the discovered
1816   //     references processed etc during remarking.
1817   //   * Reference discovery is MT (see below).
1818   //   * Reference discovery requires a barrier (see below).
1819   //   * Reference processing may or may not be MT
1820   //     (depending on the value of ParallelRefProcEnabled
1821   //     and ParallelGCThreads).
1822   //   * A full GC disables reference discovery by the CM
1823   //     ref processor and abandons any entries on it's
1824   //     discovered lists.
1825   //
1826   // * For the STW processor:
1827   //   * Non MT discovery is enabled at the start of a full GC.
1828   //   * Processing and enqueueing during a full GC is non-MT.
1829   //   * During a full GC, references are processed after marking.
1830   //
1831   //   * Discovery (may or may not be MT) is enabled at the start
1832   //     of an incremental evacuation pause.
1833   //   * References are processed near the end of a STW evacuation pause.
1834   //   * For both types of GC:
1835   //     * Discovery is atomic - i.e. not concurrent.
1836   //     * Reference discovery will not need a barrier.
1837 
1838   bool mt_processing = ParallelRefProcEnabled && (ParallelGCThreads > 1);
1839 
1840   // Concurrent Mark ref processor
1841   _ref_processor_cm =
1842     new ReferenceProcessor(&_is_subject_to_discovery_cm,
1843                            mt_processing,                                  // mt processing
1844                            ParallelGCThreads,                              // degree of mt processing
1845                            (ParallelGCThreads > 1) || (ConcGCThreads > 1), // mt discovery
1846                            MAX2(ParallelGCThreads, ConcGCThreads),         // degree of mt discovery
1847                            false,                                          // Reference discovery is not atomic
1848                            &_is_alive_closure_cm,                          // is alive closure
1849                            true);                                          // allow changes to number of processing threads
1850 
1851   // STW ref processor
1852   _ref_processor_stw =
1853     new ReferenceProcessor(&_is_subject_to_discovery_stw,
1854                            mt_processing,                        // mt processing
1855                            ParallelGCThreads,                    // degree of mt processing
1856                            (ParallelGCThreads > 1),              // mt discovery
1857                            ParallelGCThreads,                    // degree of mt discovery
1858                            true,                                 // Reference discovery is atomic
1859                            &_is_alive_closure_stw,               // is alive closure
1860                            true);                                // allow changes to number of processing threads
1861 }
1862 
1863 SoftRefPolicy* G1CollectedHeap::soft_ref_policy() {
1864   return &_soft_ref_policy;
1865 }
1866 
1867 size_t G1CollectedHeap::capacity() const {
1868   return _hrm->length() * HeapRegion::GrainBytes;
1869 }
1870 
1871 size_t G1CollectedHeap::unused_committed_regions_in_bytes() const {
1872   return _hrm->total_free_bytes();
1873 }
1874 
1875 void G1CollectedHeap::iterate_hcc_closure(G1CardTableEntryClosure* cl, uint worker_id) {
1876   _hot_card_cache->drain(cl, worker_id);
1877 }
1878 
1879 // Computes the sum of the storage used by the various regions.
1880 size_t G1CollectedHeap::used() const {
1881   size_t result = _summary_bytes_used + _allocator->used_in_alloc_regions();
1882   if (_archive_allocator != NULL) {
1883     result += _archive_allocator->used();
1884   }
1885   return result;
1886 }
1887 
1888 size_t G1CollectedHeap::used_unlocked() const {
1889   return _summary_bytes_used;
1890 }
1891 
1892 class SumUsedClosure: public HeapRegionClosure {
1893   size_t _used;
1894 public:
1895   SumUsedClosure() : _used(0) {}
1896   bool do_heap_region(HeapRegion* r) {
1897     _used += r->used();
1898     return false;
1899   }
1900   size_t result() { return _used; }
1901 };
1902 
1903 size_t G1CollectedHeap::recalculate_used() const {
1904   SumUsedClosure blk;
1905   heap_region_iterate(&blk);
1906   return blk.result();
1907 }
1908 
1909 bool  G1CollectedHeap::is_user_requested_concurrent_full_gc(GCCause::Cause cause) {
1910   switch (cause) {
1911     case GCCause::_java_lang_system_gc:                 return ExplicitGCInvokesConcurrent;
1912     case GCCause::_dcmd_gc_run:                         return ExplicitGCInvokesConcurrent;
1913     case GCCause::_wb_conc_mark:                        return true;
1914     default :                                           return false;
1915   }
1916 }
1917 
1918 bool G1CollectedHeap::should_do_concurrent_full_gc(GCCause::Cause cause) {
1919   switch (cause) {
1920     case GCCause::_g1_humongous_allocation: return true;
1921     case GCCause::_g1_periodic_collection:  return G1PeriodicGCInvokesConcurrent;
1922     case GCCause::_wb_breakpoint:           return true;
1923     default:                                return is_user_requested_concurrent_full_gc(cause);
1924   }
1925 }
1926 
1927 bool G1CollectedHeap::should_upgrade_to_full_gc(GCCause::Cause cause) {
1928   if (policy()->force_upgrade_to_full()) {
1929     return true;
1930   } else if (should_do_concurrent_full_gc(_gc_cause)) {
1931     return false;
1932   } else if (has_regions_left_for_allocation()) {
1933     return false;
1934   } else {
1935     return true;
1936   }
1937 }
1938 
1939 #ifndef PRODUCT
1940 void G1CollectedHeap::allocate_dummy_regions() {
1941   // Let's fill up most of the region
1942   size_t word_size = HeapRegion::GrainWords - 1024;
1943   // And as a result the region we'll allocate will be humongous.
1944   guarantee(is_humongous(word_size), "sanity");
1945 
1946   // _filler_array_max_size is set to humongous object threshold
1947   // but temporarily change it to use CollectedHeap::fill_with_object().
1948   AutoModifyRestore<size_t> temporarily(_filler_array_max_size, word_size);
1949 
1950   for (uintx i = 0; i < G1DummyRegionsPerGC; ++i) {
1951     // Let's use the existing mechanism for the allocation
1952     HeapWord* dummy_obj = humongous_obj_allocate(word_size);
1953     if (dummy_obj != NULL) {
1954       MemRegion mr(dummy_obj, word_size);
1955       CollectedHeap::fill_with_object(mr);
1956     } else {
1957       // If we can't allocate once, we probably cannot allocate
1958       // again. Let's get out of the loop.
1959       break;
1960     }
1961   }
1962 }
1963 #endif // !PRODUCT
1964 
1965 void G1CollectedHeap::increment_old_marking_cycles_started() {
1966   assert(_old_marking_cycles_started == _old_marking_cycles_completed ||
1967          _old_marking_cycles_started == _old_marking_cycles_completed + 1,
1968          "Wrong marking cycle count (started: %d, completed: %d)",
1969          _old_marking_cycles_started, _old_marking_cycles_completed);
1970 
1971   _old_marking_cycles_started++;
1972 }
1973 
1974 void G1CollectedHeap::increment_old_marking_cycles_completed(bool concurrent) {
1975   MonitorLocker ml(G1OldGCCount_lock, Mutex::_no_safepoint_check_flag);
1976 
1977   // We assume that if concurrent == true, then the caller is a
1978   // concurrent thread that was joined the Suspendible Thread
1979   // Set. If there's ever a cheap way to check this, we should add an
1980   // assert here.
1981 
1982   // Given that this method is called at the end of a Full GC or of a
1983   // concurrent cycle, and those can be nested (i.e., a Full GC can
1984   // interrupt a concurrent cycle), the number of full collections
1985   // completed should be either one (in the case where there was no
1986   // nesting) or two (when a Full GC interrupted a concurrent cycle)
1987   // behind the number of full collections started.
1988 
1989   // This is the case for the inner caller, i.e. a Full GC.
1990   assert(concurrent ||
1991          (_old_marking_cycles_started == _old_marking_cycles_completed + 1) ||
1992          (_old_marking_cycles_started == _old_marking_cycles_completed + 2),
1993          "for inner caller (Full GC): _old_marking_cycles_started = %u "
1994          "is inconsistent with _old_marking_cycles_completed = %u",
1995          _old_marking_cycles_started, _old_marking_cycles_completed);
1996 
1997   // This is the case for the outer caller, i.e. the concurrent cycle.
1998   assert(!concurrent ||
1999          (_old_marking_cycles_started == _old_marking_cycles_completed + 1),
2000          "for outer caller (concurrent cycle): "
2001          "_old_marking_cycles_started = %u "
2002          "is inconsistent with _old_marking_cycles_completed = %u",
2003          _old_marking_cycles_started, _old_marking_cycles_completed);
2004 
2005   _old_marking_cycles_completed += 1;
2006 
2007   // We need to clear the "in_progress" flag in the CM thread before
2008   // we wake up any waiters (especially when ExplicitInvokesConcurrent
2009   // is set) so that if a waiter requests another System.gc() it doesn't
2010   // incorrectly see that a marking cycle is still in progress.
2011   if (concurrent) {
2012     _cm_thread->set_idle();
2013   }
2014 
2015   // Notify threads waiting in System.gc() (with ExplicitGCInvokesConcurrent)
2016   // for a full GC to finish that their wait is over.
2017   ml.notify_all();
2018 }
2019 
2020 void G1CollectedHeap::collect(GCCause::Cause cause) {
2021   try_collect(cause);
2022 }
2023 
2024 // Return true if (x < y) with allowance for wraparound.
2025 static bool gc_counter_less_than(uint x, uint y) {
2026   return (x - y) > (UINT_MAX/2);
2027 }
2028 
2029 // LOG_COLLECT_CONCURRENTLY(cause, msg, args...)
2030 // Macro so msg printing is format-checked.
2031 #define LOG_COLLECT_CONCURRENTLY(cause, ...)                            \
2032   do {                                                                  \
2033     LogTarget(Trace, gc) LOG_COLLECT_CONCURRENTLY_lt;                   \
2034     if (LOG_COLLECT_CONCURRENTLY_lt.is_enabled()) {                     \
2035       ResourceMark rm; /* For thread name. */                           \
2036       LogStream LOG_COLLECT_CONCURRENTLY_s(&LOG_COLLECT_CONCURRENTLY_lt); \
2037       LOG_COLLECT_CONCURRENTLY_s.print("%s: Try Collect Concurrently (%s): ", \
2038                                        Thread::current()->name(),       \
2039                                        GCCause::to_string(cause));      \
2040       LOG_COLLECT_CONCURRENTLY_s.print(__VA_ARGS__);                    \
2041     }                                                                   \
2042   } while (0)
2043 
2044 #define LOG_COLLECT_CONCURRENTLY_COMPLETE(cause, result) \
2045   LOG_COLLECT_CONCURRENTLY(cause, "complete %s", BOOL_TO_STR(result))
2046 
2047 bool G1CollectedHeap::try_collect_concurrently(GCCause::Cause cause,
2048                                                uint gc_counter,
2049                                                uint old_marking_started_before) {
2050   assert_heap_not_locked();
2051   assert(should_do_concurrent_full_gc(cause),
2052          "Non-concurrent cause %s", GCCause::to_string(cause));
2053 
2054   for (uint i = 1; true; ++i) {
2055     // Try to schedule concurrent start evacuation pause that will
2056     // start a concurrent cycle.
2057     LOG_COLLECT_CONCURRENTLY(cause, "attempt %u", i);
2058     VM_G1TryInitiateConcMark op(gc_counter,
2059                                 cause,
2060                                 policy()->max_pause_time_ms());
2061     VMThread::execute(&op);
2062 
2063     // Request is trivially finished.
2064     if (cause == GCCause::_g1_periodic_collection) {
2065       LOG_COLLECT_CONCURRENTLY_COMPLETE(cause, op.gc_succeeded());
2066       return op.gc_succeeded();
2067     }
2068 
2069     // If VMOp skipped initiating concurrent marking cycle because
2070     // we're terminating, then we're done.
2071     if (op.terminating()) {
2072       LOG_COLLECT_CONCURRENTLY(cause, "skipped: terminating");
2073       return false;
2074     }
2075 
2076     // Lock to get consistent set of values.
2077     uint old_marking_started_after;
2078     uint old_marking_completed_after;
2079     {
2080       MutexLocker ml(Heap_lock);
2081       // Update gc_counter for retrying VMOp if needed. Captured here to be
2082       // consistent with the values we use below for termination tests.  If
2083       // a retry is needed after a possible wait, and another collection
2084       // occurs in the meantime, it will cause our retry to be skipped and
2085       // we'll recheck for termination with updated conditions from that
2086       // more recent collection.  That's what we want, rather than having
2087       // our retry possibly perform an unnecessary collection.
2088       gc_counter = total_collections();
2089       old_marking_started_after = _old_marking_cycles_started;
2090       old_marking_completed_after = _old_marking_cycles_completed;
2091     }
2092 
2093     if (cause == GCCause::_wb_breakpoint) {
2094       if (op.gc_succeeded()) {
2095         LOG_COLLECT_CONCURRENTLY_COMPLETE(cause, true);
2096         return true;
2097       }
2098       // When _wb_breakpoint there can't be another cycle or deferred.
2099       assert(!op.cycle_already_in_progress(), "invariant");
2100       assert(!op.whitebox_attached(), "invariant");
2101       // Concurrent cycle attempt might have been cancelled by some other
2102       // collection, so retry.  Unlike other cases below, we want to retry
2103       // even if cancelled by a STW full collection, because we really want
2104       // to start a concurrent cycle.
2105       if (old_marking_started_before != old_marking_started_after) {
2106         LOG_COLLECT_CONCURRENTLY(cause, "ignoring STW full GC");
2107         old_marking_started_before = old_marking_started_after;
2108       }
2109     } else if (!GCCause::is_user_requested_gc(cause)) {
2110       // For an "automatic" (not user-requested) collection, we just need to
2111       // ensure that progress is made.
2112       //
2113       // Request is finished if any of
2114       // (1) the VMOp successfully performed a GC,
2115       // (2) a concurrent cycle was already in progress,
2116       // (3) whitebox is controlling concurrent cycles,
2117       // (4) a new cycle was started (by this thread or some other), or
2118       // (5) a Full GC was performed.
2119       // Cases (4) and (5) are detected together by a change to
2120       // _old_marking_cycles_started.
2121       //
2122       // Note that (1) does not imply (4).  If we're still in the mixed
2123       // phase of an earlier concurrent collection, the request to make the
2124       // collection a concurrent start won't be honored.  If we don't check for
2125       // both conditions we'll spin doing back-to-back collections.
2126       if (op.gc_succeeded() ||
2127           op.cycle_already_in_progress() ||
2128           op.whitebox_attached() ||
2129           (old_marking_started_before != old_marking_started_after)) {
2130         LOG_COLLECT_CONCURRENTLY_COMPLETE(cause, true);
2131         return true;
2132       }
2133     } else {                    // User-requested GC.
2134       // For a user-requested collection, we want to ensure that a complete
2135       // full collection has been performed before returning, but without
2136       // waiting for more than needed.
2137 
2138       // For user-requested GCs (unlike non-UR), a successful VMOp implies a
2139       // new cycle was started.  That's good, because it's not clear what we
2140       // should do otherwise.  Trying again just does back to back GCs.
2141       // Can't wait for someone else to start a cycle.  And returning fails
2142       // to meet the goal of ensuring a full collection was performed.
2143       assert(!op.gc_succeeded() ||
2144              (old_marking_started_before != old_marking_started_after),
2145              "invariant: succeeded %s, started before %u, started after %u",
2146              BOOL_TO_STR(op.gc_succeeded()),
2147              old_marking_started_before, old_marking_started_after);
2148 
2149       // Request is finished if a full collection (concurrent or stw)
2150       // was started after this request and has completed, e.g.
2151       // started_before < completed_after.
2152       if (gc_counter_less_than(old_marking_started_before,
2153                                old_marking_completed_after)) {
2154         LOG_COLLECT_CONCURRENTLY_COMPLETE(cause, true);
2155         return true;
2156       }
2157 
2158       if (old_marking_started_after != old_marking_completed_after) {
2159         // If there is an in-progress cycle (possibly started by us), then
2160         // wait for that cycle to complete, e.g.
2161         // while completed_now < started_after.
2162         LOG_COLLECT_CONCURRENTLY(cause, "wait");
2163         MonitorLocker ml(G1OldGCCount_lock);
2164         while (gc_counter_less_than(_old_marking_cycles_completed,
2165                                     old_marking_started_after)) {
2166           ml.wait();
2167         }
2168         // Request is finished if the collection we just waited for was
2169         // started after this request.
2170         if (old_marking_started_before != old_marking_started_after) {
2171           LOG_COLLECT_CONCURRENTLY(cause, "complete after wait");
2172           return true;
2173         }
2174       }
2175 
2176       // If VMOp was successful then it started a new cycle that the above
2177       // wait &etc should have recognized as finishing this request.  This
2178       // differs from a non-user-request, where gc_succeeded does not imply
2179       // a new cycle was started.
2180       assert(!op.gc_succeeded(), "invariant");
2181 
2182       if (op.cycle_already_in_progress()) {
2183         // If VMOp failed because a cycle was already in progress, it
2184         // is now complete.  But it didn't finish this user-requested
2185         // GC, so try again.
2186         LOG_COLLECT_CONCURRENTLY(cause, "retry after in-progress");
2187         continue;
2188       } else if (op.whitebox_attached()) {
2189         // If WhiteBox wants control, wait for notification of a state
2190         // change in the controller, then try again.  Don't wait for
2191         // release of control, since collections may complete while in
2192         // control.  Note: This won't recognize a STW full collection
2193         // while waiting; we can't wait on multiple monitors.
2194         LOG_COLLECT_CONCURRENTLY(cause, "whitebox control stall");
2195         MonitorLocker ml(ConcurrentGCBreakpoints::monitor());
2196         if (ConcurrentGCBreakpoints::is_controlled()) {
2197           ml.wait();
2198         }
2199         continue;
2200       }
2201     }
2202 
2203     // Collection failed and should be retried.
2204     assert(op.transient_failure(), "invariant");
2205 
2206     if (GCLocker::is_active_and_needs_gc()) {
2207       // If GCLocker is active, wait until clear before retrying.
2208       LOG_COLLECT_CONCURRENTLY(cause, "gc-locker stall");
2209       GCLocker::stall_until_clear();
2210     }
2211 
2212     LOG_COLLECT_CONCURRENTLY(cause, "retry");
2213   }
2214 }
2215 
2216 bool G1CollectedHeap::try_collect(GCCause::Cause cause) {
2217   assert_heap_not_locked();
2218 
2219   // Lock to get consistent set of values.
2220   uint gc_count_before;
2221   uint full_gc_count_before;
2222   uint old_marking_started_before;
2223   {
2224     MutexLocker ml(Heap_lock);
2225     gc_count_before = total_collections();
2226     full_gc_count_before = total_full_collections();
2227     old_marking_started_before = _old_marking_cycles_started;
2228   }
2229 
2230   if (should_do_concurrent_full_gc(cause)) {
2231     return try_collect_concurrently(cause,
2232                                     gc_count_before,
2233                                     old_marking_started_before);
2234   } else if (GCLocker::should_discard(cause, gc_count_before)) {
2235     // Indicate failure to be consistent with VMOp failure due to
2236     // another collection slipping in after our gc_count but before
2237     // our request is processed.
2238     return false;
2239   } else if (cause == GCCause::_gc_locker || cause == GCCause::_wb_young_gc
2240              DEBUG_ONLY(|| cause == GCCause::_scavenge_alot)) {
2241 
2242     // Schedule a standard evacuation pause. We're setting word_size
2243     // to 0 which means that we are not requesting a post-GC allocation.
2244     VM_G1CollectForAllocation op(0,     /* word_size */
2245                                  gc_count_before,
2246                                  cause,
2247                                  policy()->max_pause_time_ms());
2248     VMThread::execute(&op);
2249     return op.gc_succeeded();
2250   } else {
2251     // Schedule a Full GC.
2252     VM_G1CollectFull op(gc_count_before, full_gc_count_before, cause);
2253     VMThread::execute(&op);
2254     return op.gc_succeeded();
2255   }
2256 }
2257 
2258 bool G1CollectedHeap::is_in(const void* p) const {
2259   if (_hrm->reserved().contains(p)) {
2260     // Given that we know that p is in the reserved space,
2261     // heap_region_containing() should successfully
2262     // return the containing region.
2263     HeapRegion* hr = heap_region_containing(p);
2264     return hr->is_in(p);
2265   } else {
2266     return false;
2267   }
2268 }
2269 
2270 #ifdef ASSERT
2271 bool G1CollectedHeap::is_in_exact(const void* p) const {
2272   bool contains = reserved_region().contains(p);
2273   bool available = _hrm->is_available(addr_to_region((HeapWord*)p));
2274   if (contains && available) {
2275     return true;
2276   } else {
2277     return false;
2278   }
2279 }
2280 #endif
2281 
2282 // Iteration functions.
2283 
2284 // Iterates an ObjectClosure over all objects within a HeapRegion.
2285 
2286 class IterateObjectClosureRegionClosure: public HeapRegionClosure {
2287   ObjectClosure* _cl;
2288 public:
2289   IterateObjectClosureRegionClosure(ObjectClosure* cl) : _cl(cl) {}
2290   bool do_heap_region(HeapRegion* r) {
2291     if (!r->is_continues_humongous()) {
2292       r->object_iterate(_cl);
2293     }
2294     return false;
2295   }
2296 };
2297 
2298 void G1CollectedHeap::object_iterate(ObjectClosure* cl) {
2299   IterateObjectClosureRegionClosure blk(cl);
2300   heap_region_iterate(&blk);
2301 }
2302 
2303 class G1ParallelObjectIterator : public ParallelObjectIterator {
2304 private:
2305   G1CollectedHeap*  _heap;
2306   HeapRegionClaimer _claimer;
2307 
2308 public:
2309   G1ParallelObjectIterator(uint thread_num) :
2310       _heap(G1CollectedHeap::heap()),
2311       _claimer(thread_num == 0 ? G1CollectedHeap::heap()->workers()->active_workers() : thread_num) {}
2312 
2313   virtual void object_iterate(ObjectClosure* cl, uint worker_id) {
2314     _heap->object_iterate_parallel(cl, worker_id, &_claimer);
2315   }
2316 };
2317 
2318 ParallelObjectIterator* G1CollectedHeap::parallel_object_iterator(uint thread_num) {
2319   return new G1ParallelObjectIterator(thread_num);
2320 }
2321 
2322 void G1CollectedHeap::object_iterate_parallel(ObjectClosure* cl, uint worker_id, HeapRegionClaimer* claimer) {
2323   IterateObjectClosureRegionClosure blk(cl);
2324   heap_region_par_iterate_from_worker_offset(&blk, claimer, worker_id);
2325 }
2326 
2327 void G1CollectedHeap::keep_alive(oop obj) {
2328   G1BarrierSet::enqueue(obj);
2329 }
2330 
2331 void G1CollectedHeap::heap_region_iterate(HeapRegionClosure* cl) const {
2332   _hrm->iterate(cl);
2333 }
2334 
2335 void G1CollectedHeap::heap_region_par_iterate_from_worker_offset(HeapRegionClosure* cl,
2336                                                                  HeapRegionClaimer *hrclaimer,
2337                                                                  uint worker_id) const {
2338   _hrm->par_iterate(cl, hrclaimer, hrclaimer->offset_for_worker(worker_id));
2339 }
2340 
2341 void G1CollectedHeap::heap_region_par_iterate_from_start(HeapRegionClosure* cl,
2342                                                          HeapRegionClaimer *hrclaimer) const {
2343   _hrm->par_iterate(cl, hrclaimer, 0);
2344 }
2345 
2346 void G1CollectedHeap::collection_set_iterate_all(HeapRegionClosure* cl) {
2347   _collection_set.iterate(cl);
2348 }
2349 
2350 void G1CollectedHeap::collection_set_par_iterate_all(HeapRegionClosure* cl, HeapRegionClaimer* hr_claimer, uint worker_id) {
2351   _collection_set.par_iterate(cl, hr_claimer, worker_id, workers()->active_workers());
2352 }
2353 
2354 void G1CollectedHeap::collection_set_iterate_increment_from(HeapRegionClosure *cl, HeapRegionClaimer* hr_claimer, uint worker_id) {
2355   _collection_set.iterate_incremental_part_from(cl, hr_claimer, worker_id, workers()->active_workers());
2356 }
2357 
2358 HeapWord* G1CollectedHeap::block_start(const void* addr) const {
2359   HeapRegion* hr = heap_region_containing(addr);
2360   return hr->block_start(addr);
2361 }
2362 
2363 bool G1CollectedHeap::block_is_obj(const HeapWord* addr) const {
2364   HeapRegion* hr = heap_region_containing(addr);
2365   return hr->block_is_obj(addr);
2366 }
2367 
2368 bool G1CollectedHeap::supports_tlab_allocation() const {
2369   return true;
2370 }
2371 
2372 size_t G1CollectedHeap::tlab_capacity(Thread* ignored) const {
2373   return (_policy->young_list_target_length() - _survivor.length()) * HeapRegion::GrainBytes;
2374 }
2375 
2376 size_t G1CollectedHeap::tlab_used(Thread* ignored) const {
2377   return _eden.length() * HeapRegion::GrainBytes;
2378 }
2379 
2380 // For G1 TLABs should not contain humongous objects, so the maximum TLAB size
2381 // must be equal to the humongous object limit.
2382 size_t G1CollectedHeap::max_tlab_size() const {
2383   return align_down(_humongous_object_threshold_in_words, MinObjAlignment);
2384 }
2385 
2386 size_t G1CollectedHeap::unsafe_max_tlab_alloc(Thread* ignored) const {
2387   return _allocator->unsafe_max_tlab_alloc();
2388 }
2389 
2390 size_t G1CollectedHeap::max_capacity() const {
2391   return _hrm->max_expandable_length() * HeapRegion::GrainBytes;
2392 }
2393 
2394 size_t G1CollectedHeap::max_reserved_capacity() const {
2395   return _hrm->max_length() * HeapRegion::GrainBytes;
2396 }
2397 
2398 jlong G1CollectedHeap::millis_since_last_gc() {
2399   // See the notes in GenCollectedHeap::millis_since_last_gc()
2400   // for more information about the implementation.
2401   jlong ret_val = (os::javaTimeNanos() / NANOSECS_PER_MILLISEC) -
2402                   _policy->collection_pause_end_millis();
2403   if (ret_val < 0) {
2404     log_warning(gc)("millis_since_last_gc() would return : " JLONG_FORMAT
2405       ". returning zero instead.", ret_val);
2406     return 0;
2407   }
2408   return ret_val;
2409 }
2410 
2411 void G1CollectedHeap::deduplicate_string(oop str) {
2412   assert(java_lang_String::is_instance(str), "invariant");
2413 
2414   if (G1StringDedup::is_enabled()) {
2415     G1StringDedup::deduplicate(str);
2416   }
2417 }
2418 
2419 void G1CollectedHeap::prepare_for_verify() {
2420   _verifier->prepare_for_verify();
2421 }
2422 
2423 void G1CollectedHeap::verify(VerifyOption vo) {
2424   _verifier->verify(vo);
2425 }
2426 
2427 bool G1CollectedHeap::supports_concurrent_gc_breakpoints() const {
2428   return true;
2429 }
2430 
2431 bool G1CollectedHeap::is_heterogeneous_heap() const {
2432   return G1Arguments::is_heterogeneous_heap();
2433 }
2434 
2435 class PrintRegionClosure: public HeapRegionClosure {
2436   outputStream* _st;
2437 public:
2438   PrintRegionClosure(outputStream* st) : _st(st) {}
2439   bool do_heap_region(HeapRegion* r) {
2440     r->print_on(_st);
2441     return false;
2442   }
2443 };
2444 
2445 bool G1CollectedHeap::is_obj_dead_cond(const oop obj,
2446                                        const HeapRegion* hr,
2447                                        const VerifyOption vo) const {
2448   switch (vo) {
2449   case VerifyOption_G1UsePrevMarking: return is_obj_dead(obj, hr);
2450   case VerifyOption_G1UseNextMarking: return is_obj_ill(obj, hr);
2451   case VerifyOption_G1UseFullMarking: return is_obj_dead_full(obj, hr);
2452   default:                            ShouldNotReachHere();
2453   }
2454   return false; // keep some compilers happy
2455 }
2456 
2457 bool G1CollectedHeap::is_obj_dead_cond(const oop obj,
2458                                        const VerifyOption vo) const {
2459   switch (vo) {
2460   case VerifyOption_G1UsePrevMarking: return is_obj_dead(obj);
2461   case VerifyOption_G1UseNextMarking: return is_obj_ill(obj);
2462   case VerifyOption_G1UseFullMarking: return is_obj_dead_full(obj);
2463   default:                            ShouldNotReachHere();
2464   }
2465   return false; // keep some compilers happy
2466 }
2467 
2468 void G1CollectedHeap::print_heap_regions() const {
2469   LogTarget(Trace, gc, heap, region) lt;
2470   if (lt.is_enabled()) {
2471     LogStream ls(lt);
2472     print_regions_on(&ls);
2473   }
2474 }
2475 
2476 void G1CollectedHeap::print_on(outputStream* st) const {
2477   st->print(" %-20s", "garbage-first heap");
2478   if (_hrm != NULL) {
2479     st->print(" total " SIZE_FORMAT "K, used " SIZE_FORMAT "K",
2480               capacity()/K, used_unlocked()/K);
2481     st->print(" [" PTR_FORMAT ", " PTR_FORMAT ")",
2482               p2i(_hrm->reserved().start()),
2483               p2i(_hrm->reserved().end()));
2484   }
2485   st->cr();
2486   st->print("  region size " SIZE_FORMAT "K, ", HeapRegion::GrainBytes / K);
2487   uint young_regions = young_regions_count();
2488   st->print("%u young (" SIZE_FORMAT "K), ", young_regions,
2489             (size_t) young_regions * HeapRegion::GrainBytes / K);
2490   uint survivor_regions = survivor_regions_count();
2491   st->print("%u survivors (" SIZE_FORMAT "K)", survivor_regions,
2492             (size_t) survivor_regions * HeapRegion::GrainBytes / K);
2493   st->cr();
2494   if (_numa->is_enabled()) {
2495     uint num_nodes = _numa->num_active_nodes();
2496     st->print("  remaining free region(s) on each NUMA node: ");
2497     const int* node_ids = _numa->node_ids();
2498     for (uint node_index = 0; node_index < num_nodes; node_index++) {
2499       uint num_free_regions = (_hrm != NULL ? _hrm->num_free_regions(node_index) : 0);
2500       st->print("%d=%u ", node_ids[node_index], num_free_regions);
2501     }
2502     st->cr();
2503   }
2504   MetaspaceUtils::print_on(st);
2505 }
2506 
2507 void G1CollectedHeap::print_regions_on(outputStream* st) const {
2508   if (_hrm == NULL) {
2509     return;
2510   }
2511 
2512   st->print_cr("Heap Regions: E=young(eden), S=young(survivor), O=old, "
2513                "HS=humongous(starts), HC=humongous(continues), "
2514                "CS=collection set, F=free, "
2515                "OA=open archive, CA=closed archive, "
2516                "TAMS=top-at-mark-start (previous, next)");
2517   PrintRegionClosure blk(st);
2518   heap_region_iterate(&blk);
2519 }
2520 
2521 void G1CollectedHeap::print_extended_on(outputStream* st) const {
2522   print_on(st);
2523 
2524   // Print the per-region information.
2525   if (_hrm != NULL) {
2526     st->cr();
2527     print_regions_on(st);
2528   }
2529 }
2530 
2531 void G1CollectedHeap::print_on_error(outputStream* st) const {
2532   this->CollectedHeap::print_on_error(st);
2533 
2534   if (_cm != NULL) {
2535     st->cr();
2536     _cm->print_on_error(st);
2537   }
2538 }
2539 
2540 void G1CollectedHeap::gc_threads_do(ThreadClosure* tc) const {
2541   workers()->threads_do(tc);
2542   tc->do_thread(_cm_thread);
2543   _cm->threads_do(tc);
2544   _cr->threads_do(tc);
2545   tc->do_thread(_young_gen_sampling_thread);
2546   if (G1StringDedup::is_enabled()) {
2547     G1StringDedup::threads_do(tc);
2548   }
2549 }
2550 
2551 void G1CollectedHeap::print_tracing_info() const {
2552   rem_set()->print_summary_info();
2553   concurrent_mark()->print_summary_info();
2554 }
2555 
2556 #ifndef PRODUCT
2557 // Helpful for debugging RSet issues.
2558 
2559 class PrintRSetsClosure : public HeapRegionClosure {
2560 private:
2561   const char* _msg;
2562   size_t _occupied_sum;
2563 
2564 public:
2565   bool do_heap_region(HeapRegion* r) {
2566     HeapRegionRemSet* hrrs = r->rem_set();
2567     size_t occupied = hrrs->occupied();
2568     _occupied_sum += occupied;
2569 
2570     tty->print_cr("Printing RSet for region " HR_FORMAT, HR_FORMAT_PARAMS(r));
2571     if (occupied == 0) {
2572       tty->print_cr("  RSet is empty");
2573     } else {
2574       hrrs->print();
2575     }
2576     tty->print_cr("----------");
2577     return false;
2578   }
2579 
2580   PrintRSetsClosure(const char* msg) : _msg(msg), _occupied_sum(0) {
2581     tty->cr();
2582     tty->print_cr("========================================");
2583     tty->print_cr("%s", msg);
2584     tty->cr();
2585   }
2586 
2587   ~PrintRSetsClosure() {
2588     tty->print_cr("Occupied Sum: " SIZE_FORMAT, _occupied_sum);
2589     tty->print_cr("========================================");
2590     tty->cr();
2591   }
2592 };
2593 
2594 void G1CollectedHeap::print_cset_rsets() {
2595   PrintRSetsClosure cl("Printing CSet RSets");
2596   collection_set_iterate_all(&cl);
2597 }
2598 
2599 void G1CollectedHeap::print_all_rsets() {
2600   PrintRSetsClosure cl("Printing All RSets");;
2601   heap_region_iterate(&cl);
2602 }
2603 #endif // PRODUCT
2604 
2605 bool G1CollectedHeap::print_location(outputStream* st, void* addr) const {
2606   return BlockLocationPrinter<G1CollectedHeap>::print_location(st, addr);
2607 }
2608 
2609 G1HeapSummary G1CollectedHeap::create_g1_heap_summary() {
2610 
2611   size_t eden_used_bytes = _eden.used_bytes();
2612   size_t survivor_used_bytes = _survivor.used_bytes();
2613   size_t heap_used = Heap_lock->owned_by_self() ? used() : used_unlocked();
2614 
2615   size_t eden_capacity_bytes =
2616     (policy()->young_list_target_length() * HeapRegion::GrainBytes) - survivor_used_bytes;
2617 
2618   VirtualSpaceSummary heap_summary = create_heap_space_summary();
2619   return G1HeapSummary(heap_summary, heap_used, eden_used_bytes,
2620                        eden_capacity_bytes, survivor_used_bytes, num_regions());
2621 }
2622 
2623 G1EvacSummary G1CollectedHeap::create_g1_evac_summary(G1EvacStats* stats) {
2624   return G1EvacSummary(stats->allocated(), stats->wasted(), stats->undo_wasted(),
2625                        stats->unused(), stats->used(), stats->region_end_waste(),
2626                        stats->regions_filled(), stats->direct_allocated(),
2627                        stats->failure_used(), stats->failure_waste());
2628 }
2629 
2630 void G1CollectedHeap::trace_heap(GCWhen::Type when, const GCTracer* gc_tracer) {
2631   const G1HeapSummary& heap_summary = create_g1_heap_summary();
2632   gc_tracer->report_gc_heap_summary(when, heap_summary);
2633 
2634   const MetaspaceSummary& metaspace_summary = create_metaspace_summary();
2635   gc_tracer->report_metaspace_summary(when, metaspace_summary);
2636 }
2637 
2638 void G1CollectedHeap::gc_prologue(bool full) {
2639   assert(InlineCacheBuffer::is_empty(), "should have cleaned up ICBuffer");
2640 
2641   // This summary needs to be printed before incrementing total collections.
2642   rem_set()->print_periodic_summary_info("Before GC RS summary", total_collections());
2643 
2644   // Update common counters.
2645   increment_total_collections(full /* full gc */);
2646   if (full || collector_state()->in_concurrent_start_gc()) {
2647     increment_old_marking_cycles_started();
2648   }
2649 
2650   // Fill TLAB's and such
2651   {
2652     Ticks start = Ticks::now();
2653     ensure_parsability(true);
2654     Tickspan dt = Ticks::now() - start;
2655     phase_times()->record_prepare_tlab_time_ms(dt.seconds() * MILLIUNITS);
2656   }
2657 
2658   if (!full) {
2659     // Flush dirty card queues to qset, so later phases don't need to account
2660     // for partially filled per-thread queues and such.  Not needed for full
2661     // collections, which ignore those logs.
2662     Ticks start = Ticks::now();
2663     G1BarrierSet::dirty_card_queue_set().concatenate_logs();
2664     Tickspan dt = Ticks::now() - start;
2665     phase_times()->record_concatenate_dirty_card_logs_time_ms(dt.seconds() * MILLIUNITS);
2666   }
2667 }
2668 
2669 void G1CollectedHeap::gc_epilogue(bool full) {
2670   // Update common counters.
2671   if (full) {
2672     // Update the number of full collections that have been completed.
2673     increment_old_marking_cycles_completed(false /* concurrent */);
2674   }
2675 
2676   // We are at the end of the GC. Total collections has already been increased.
2677   rem_set()->print_periodic_summary_info("After GC RS summary", total_collections() - 1);
2678 
2679   // FIXME: what is this about?
2680   // I'm ignoring the "fill_newgen()" call if "alloc_event_enabled"
2681   // is set.
2682 #if COMPILER2_OR_JVMCI
2683   assert(DerivedPointerTable::is_empty(), "derived pointer present");
2684 #endif
2685 
2686   double start = os::elapsedTime();
2687   resize_all_tlabs();
2688   phase_times()->record_resize_tlab_time_ms((os::elapsedTime() - start) * 1000.0);
2689 
2690   MemoryService::track_memory_usage();
2691   // We have just completed a GC. Update the soft reference
2692   // policy with the new heap occupancy
2693   Universe::update_heap_info_at_gc();
2694 
2695   // Print NUMA statistics.
2696   _numa->print_statistics();
2697 }
2698 
2699 void G1CollectedHeap::verify_numa_regions(const char* desc) {
2700   LogTarget(Trace, gc, heap, verify) lt;
2701 
2702   if (lt.is_enabled()) {
2703     LogStream ls(lt);
2704     // Iterate all heap regions to print matching between preferred numa id and actual numa id.
2705     G1NodeIndexCheckClosure cl(desc, _numa, &ls);
2706     heap_region_iterate(&cl);
2707   }
2708 }
2709 
2710 HeapWord* G1CollectedHeap::do_collection_pause(size_t word_size,
2711                                                uint gc_count_before,
2712                                                bool* succeeded,
2713                                                GCCause::Cause gc_cause) {
2714   assert_heap_not_locked_and_not_at_safepoint();
2715   VM_G1CollectForAllocation op(word_size,
2716                                gc_count_before,
2717                                gc_cause,
2718                                policy()->max_pause_time_ms());
2719   VMThread::execute(&op);
2720 
2721   HeapWord* result = op.result();
2722   bool ret_succeeded = op.prologue_succeeded() && op.gc_succeeded();
2723   assert(result == NULL || ret_succeeded,
2724          "the result should be NULL if the VM did not succeed");
2725   *succeeded = ret_succeeded;
2726 
2727   assert_heap_not_locked();
2728   return result;
2729 }
2730 
2731 void G1CollectedHeap::do_concurrent_mark() {
2732   MutexLocker x(CGC_lock, Mutex::_no_safepoint_check_flag);
2733   if (!_cm_thread->in_progress()) {
2734     _cm_thread->set_started();
2735     CGC_lock->notify();
2736   }
2737 }
2738 
2739 bool G1CollectedHeap::is_potential_eager_reclaim_candidate(HeapRegion* r) const {
2740   // We don't nominate objects with many remembered set entries, on
2741   // the assumption that such objects are likely still live.
2742   HeapRegionRemSet* rem_set = r->rem_set();
2743 
2744   return G1EagerReclaimHumongousObjectsWithStaleRefs ?
2745          rem_set->occupancy_less_or_equal_than(G1RSetSparseRegionEntries) :
2746          G1EagerReclaimHumongousObjects && rem_set->is_empty();
2747 }
2748 
2749 #ifndef PRODUCT
2750 void G1CollectedHeap::verify_region_attr_remset_update() {
2751   class VerifyRegionAttrRemSet : public HeapRegionClosure {
2752   public:
2753     virtual bool do_heap_region(HeapRegion* r) {
2754       G1CollectedHeap* g1h = G1CollectedHeap::heap();
2755       bool const needs_remset_update = g1h->region_attr(r->bottom()).needs_remset_update();
2756       assert(r->rem_set()->is_tracked() == needs_remset_update,
2757              "Region %u remset tracking status (%s) different to region attribute (%s)",
2758              r->hrm_index(), BOOL_TO_STR(r->rem_set()->is_tracked()), BOOL_TO_STR(needs_remset_update));
2759       return false;
2760     }
2761   } cl;
2762   heap_region_iterate(&cl);
2763 }
2764 #endif
2765 
2766 class VerifyRegionRemSetClosure : public HeapRegionClosure {
2767   public:
2768     bool do_heap_region(HeapRegion* hr) {
2769       if (!hr->is_archive() && !hr->is_continues_humongous()) {
2770         hr->verify_rem_set();
2771       }
2772       return false;
2773     }
2774 };
2775 
2776 uint G1CollectedHeap::num_task_queues() const {
2777   return _task_queues->size();
2778 }
2779 
2780 #if TASKQUEUE_STATS
2781 void G1CollectedHeap::print_taskqueue_stats_hdr(outputStream* const st) {
2782   st->print_raw_cr("GC Task Stats");
2783   st->print_raw("thr "); TaskQueueStats::print_header(1, st); st->cr();
2784   st->print_raw("--- "); TaskQueueStats::print_header(2, st); st->cr();
2785 }
2786 
2787 void G1CollectedHeap::print_taskqueue_stats() const {
2788   if (!log_is_enabled(Trace, gc, task, stats)) {
2789     return;
2790   }
2791   Log(gc, task, stats) log;
2792   ResourceMark rm;
2793   LogStream ls(log.trace());
2794   outputStream* st = &ls;
2795 
2796   print_taskqueue_stats_hdr(st);
2797 
2798   TaskQueueStats totals;
2799   const uint n = num_task_queues();
2800   for (uint i = 0; i < n; ++i) {
2801     st->print("%3u ", i); task_queue(i)->stats.print(st); st->cr();
2802     totals += task_queue(i)->stats;
2803   }
2804   st->print_raw("tot "); totals.print(st); st->cr();
2805 
2806   DEBUG_ONLY(totals.verify());
2807 }
2808 
2809 void G1CollectedHeap::reset_taskqueue_stats() {
2810   const uint n = num_task_queues();
2811   for (uint i = 0; i < n; ++i) {
2812     task_queue(i)->stats.reset();
2813   }
2814 }
2815 #endif // TASKQUEUE_STATS
2816 
2817 void G1CollectedHeap::wait_for_root_region_scanning() {
2818   double scan_wait_start = os::elapsedTime();
2819   // We have to wait until the CM threads finish scanning the
2820   // root regions as it's the only way to ensure that all the
2821   // objects on them have been correctly scanned before we start
2822   // moving them during the GC.
2823   bool waited = _cm->root_regions()->wait_until_scan_finished();
2824   double wait_time_ms = 0.0;
2825   if (waited) {
2826     double scan_wait_end = os::elapsedTime();
2827     wait_time_ms = (scan_wait_end - scan_wait_start) * 1000.0;
2828   }
2829   phase_times()->record_root_region_scan_wait_time(wait_time_ms);
2830 }
2831 
2832 class G1PrintCollectionSetClosure : public HeapRegionClosure {
2833 private:
2834   G1HRPrinter* _hr_printer;
2835 public:
2836   G1PrintCollectionSetClosure(G1HRPrinter* hr_printer) : HeapRegionClosure(), _hr_printer(hr_printer) { }
2837 
2838   virtual bool do_heap_region(HeapRegion* r) {
2839     _hr_printer->cset(r);
2840     return false;
2841   }
2842 };
2843 
2844 void G1CollectedHeap::start_new_collection_set() {
2845   double start = os::elapsedTime();
2846 
2847   collection_set()->start_incremental_building();
2848 
2849   clear_region_attr();
2850 
2851   guarantee(_eden.length() == 0, "eden should have been cleared");
2852   policy()->transfer_survivors_to_cset(survivor());
2853 
2854   // We redo the verification but now wrt to the new CSet which
2855   // has just got initialized after the previous CSet was freed.
2856   _cm->verify_no_collection_set_oops();
2857 
2858   phase_times()->record_start_new_cset_time_ms((os::elapsedTime() - start) * 1000.0);
2859 }
2860 
2861 void G1CollectedHeap::calculate_collection_set(G1EvacuationInfo& evacuation_info, double target_pause_time_ms) {
2862 
2863   _collection_set.finalize_initial_collection_set(target_pause_time_ms, &_survivor);
2864   evacuation_info.set_collectionset_regions(collection_set()->region_length() +
2865                                             collection_set()->optional_region_length());
2866 
2867   _cm->verify_no_collection_set_oops();
2868 
2869   if (_hr_printer.is_active()) {
2870     G1PrintCollectionSetClosure cl(&_hr_printer);
2871     _collection_set.iterate(&cl);
2872     _collection_set.iterate_optional(&cl);
2873   }
2874 }
2875 
2876 G1HeapVerifier::G1VerifyType G1CollectedHeap::young_collection_verify_type() const {
2877   if (collector_state()->in_concurrent_start_gc()) {
2878     return G1HeapVerifier::G1VerifyConcurrentStart;
2879   } else if (collector_state()->in_young_only_phase()) {
2880     return G1HeapVerifier::G1VerifyYoungNormal;
2881   } else {
2882     return G1HeapVerifier::G1VerifyMixed;
2883   }
2884 }
2885 
2886 void G1CollectedHeap::verify_before_young_collection(G1HeapVerifier::G1VerifyType type) {
2887   if (VerifyRememberedSets) {
2888     log_info(gc, verify)("[Verifying RemSets before GC]");
2889     VerifyRegionRemSetClosure v_cl;
2890     heap_region_iterate(&v_cl);
2891   }
2892   _verifier->verify_before_gc(type);
2893   _verifier->check_bitmaps("GC Start");
2894   verify_numa_regions("GC Start");
2895 }
2896 
2897 void G1CollectedHeap::verify_after_young_collection(G1HeapVerifier::G1VerifyType type) {
2898   if (VerifyRememberedSets) {
2899     log_info(gc, verify)("[Verifying RemSets after GC]");
2900     VerifyRegionRemSetClosure v_cl;
2901     heap_region_iterate(&v_cl);
2902   }
2903   _verifier->verify_after_gc(type);
2904   _verifier->check_bitmaps("GC End");
2905   verify_numa_regions("GC End");
2906 }
2907 
2908 void G1CollectedHeap::expand_heap_after_young_collection(){
2909   size_t expand_bytes = _heap_sizing_policy->young_collection_expansion_amount();
2910   if (expand_bytes > 0) {
2911     // No need for an ergo logging here,
2912     // expansion_amount() does this when it returns a value > 0.
2913     double expand_ms;
2914     if (!expand(expand_bytes, _workers, &expand_ms)) {
2915       // We failed to expand the heap. Cannot do anything about it.
2916     }
2917     phase_times()->record_expand_heap_time(expand_ms);
2918   }
2919 }
2920 
2921 const char* G1CollectedHeap::young_gc_name() const {
2922   if (collector_state()->in_concurrent_start_gc()) {
2923     return "Pause Young (Concurrent Start)";
2924   } else if (collector_state()->in_young_only_phase()) {
2925     if (collector_state()->in_young_gc_before_mixed()) {
2926       return "Pause Young (Prepare Mixed)";
2927     } else {
2928       return "Pause Young (Normal)";
2929     }
2930   } else {
2931     return "Pause Young (Mixed)";
2932   }
2933 }
2934 
2935 bool G1CollectedHeap::do_collection_pause_at_safepoint(double target_pause_time_ms) {
2936   assert_at_safepoint_on_vm_thread();
2937   guarantee(!is_gc_active(), "collection is not reentrant");
2938 
2939   if (GCLocker::check_active_before_gc()) {
2940     return false;
2941   }
2942 
2943   do_collection_pause_at_safepoint_helper(target_pause_time_ms);
2944   if (should_upgrade_to_full_gc(gc_cause())) {
2945     log_info(gc, ergo)("Attempting maximally compacting collection");
2946     bool result = do_full_collection(false /* explicit gc */,
2947                                      true /* clear_all_soft_refs */);
2948     // do_full_collection only fails if blocked by GC locker, but
2949     // we've already checked for that above.
2950     assert(result, "invariant");
2951   }
2952   return true;
2953 }
2954 
2955 void G1CollectedHeap::do_collection_pause_at_safepoint_helper(double target_pause_time_ms) {
2956   GCIdMark gc_id_mark;
2957 
2958   SvcGCMarker sgcm(SvcGCMarker::MINOR);
2959   ResourceMark rm;
2960 
2961   policy()->note_gc_start();
2962 
2963   _gc_timer_stw->register_gc_start();
2964   _gc_tracer_stw->report_gc_start(gc_cause(), _gc_timer_stw->gc_start());
2965 
2966   wait_for_root_region_scanning();
2967 
2968   print_heap_before_gc();
2969   print_heap_regions();
2970   trace_heap_before_gc(_gc_tracer_stw);
2971 
2972   _verifier->verify_region_sets_optional();
2973   _verifier->verify_dirty_young_regions();
2974 
2975   // We should not be doing concurrent start unless the concurrent mark thread is running
2976   if (!_cm_thread->should_terminate()) {
2977     // This call will decide whether this pause is a concurrent start
2978     // pause. If it is, in_concurrent_start_gc() will return true
2979     // for the duration of this pause.
2980     policy()->decide_on_conc_mark_initiation();
2981   }
2982 
2983   // We do not allow concurrent start to be piggy-backed on a mixed GC.
2984   assert(!collector_state()->in_concurrent_start_gc() ||
2985          collector_state()->in_young_only_phase(), "sanity");
2986   // We also do not allow mixed GCs during marking.
2987   assert(!collector_state()->mark_or_rebuild_in_progress() || collector_state()->in_young_only_phase(), "sanity");
2988 
2989   // Record whether this pause is a concurrent start. When the current
2990   // thread has completed its logging output and it's safe to signal
2991   // the CM thread, the flag's value in the policy has been reset.
2992   bool should_start_conc_mark = collector_state()->in_concurrent_start_gc();
2993   if (should_start_conc_mark) {
2994     _cm->gc_tracer_cm()->set_gc_cause(gc_cause());
2995   }
2996 
2997   // Inner scope for scope based logging, timers, and stats collection
2998   {
2999     G1EvacuationInfo evacuation_info;
3000 
3001     _gc_tracer_stw->report_yc_type(collector_state()->yc_type());
3002 
3003     GCTraceCPUTime tcpu;
3004 
3005     GCTraceTime(Info, gc) tm(young_gc_name(), NULL, gc_cause(), true);
3006 
3007     uint active_workers = WorkerPolicy::calc_active_workers(workers()->total_workers(),
3008                                                             workers()->active_workers(),
3009                                                             Threads::number_of_non_daemon_threads());
3010     active_workers = workers()->update_active_workers(active_workers);
3011     log_info(gc,task)("Using %u workers of %u for evacuation", active_workers, workers()->total_workers());
3012 
3013     G1MonitoringScope ms(g1mm(),
3014                          false /* full_gc */,
3015                          collector_state()->yc_type() == Mixed /* all_memory_pools_affected */);
3016 
3017     G1HeapTransition heap_transition(this);
3018 
3019     {
3020       IsGCActiveMark x;
3021 
3022       gc_prologue(false);
3023 
3024       G1HeapVerifier::G1VerifyType verify_type = young_collection_verify_type();
3025       verify_before_young_collection(verify_type);
3026 
3027       {
3028         // The elapsed time induced by the start time below deliberately elides
3029         // the possible verification above.
3030         double sample_start_time_sec = os::elapsedTime();
3031 
3032         // Please see comment in g1CollectedHeap.hpp and
3033         // G1CollectedHeap::ref_processing_init() to see how
3034         // reference processing currently works in G1.
3035         _ref_processor_stw->enable_discovery();
3036 
3037         // We want to temporarily turn off discovery by the
3038         // CM ref processor, if necessary, and turn it back on
3039         // on again later if we do. Using a scoped
3040         // NoRefDiscovery object will do this.
3041         NoRefDiscovery no_cm_discovery(_ref_processor_cm);
3042 
3043         policy()->record_collection_pause_start(sample_start_time_sec);
3044 
3045         // Forget the current allocation region (we might even choose it to be part
3046         // of the collection set!).
3047         _allocator->release_mutator_alloc_regions();
3048 
3049         calculate_collection_set(evacuation_info, target_pause_time_ms);
3050 
3051         G1RedirtyCardsQueueSet rdcqs(G1BarrierSet::dirty_card_queue_set().allocator());
3052         G1ParScanThreadStateSet per_thread_states(this,
3053                                                   &rdcqs,
3054                                                   workers()->active_workers(),
3055                                                   collection_set()->young_region_length(),
3056                                                   collection_set()->optional_region_length());
3057         pre_evacuate_collection_set(evacuation_info, &per_thread_states);
3058 
3059         // Actually do the work...
3060         evacuate_initial_collection_set(&per_thread_states);
3061 
3062         if (_collection_set.optional_region_length() != 0) {
3063           evacuate_optional_collection_set(&per_thread_states);
3064         }
3065         post_evacuate_collection_set(evacuation_info, &rdcqs, &per_thread_states);
3066 
3067         start_new_collection_set();
3068 
3069         _survivor_evac_stats.adjust_desired_plab_sz();
3070         _old_evac_stats.adjust_desired_plab_sz();
3071 
3072         if (should_start_conc_mark) {
3073           // We have to do this before we notify the CM threads that
3074           // they can start working to make sure that all the
3075           // appropriate initialization is done on the CM object.
3076           concurrent_mark()->post_concurrent_start();
3077           // Note that we don't actually trigger the CM thread at
3078           // this point. We do that later when we're sure that
3079           // the current thread has completed its logging output.
3080         }
3081 
3082         allocate_dummy_regions();
3083 
3084         _allocator->init_mutator_alloc_regions();
3085 
3086         expand_heap_after_young_collection();
3087 
3088         double sample_end_time_sec = os::elapsedTime();
3089         double pause_time_ms = (sample_end_time_sec - sample_start_time_sec) * MILLIUNITS;
3090         policy()->record_collection_pause_end(pause_time_ms);
3091       }
3092 
3093       verify_after_young_collection(verify_type);
3094 
3095       gc_epilogue(false);
3096     }
3097 
3098     // Print the remainder of the GC log output.
3099     if (evacuation_failed()) {
3100       log_info(gc)("To-space exhausted");
3101     }
3102 
3103     policy()->print_phases();
3104     heap_transition.print();
3105 
3106     _hrm->verify_optional();
3107     _verifier->verify_region_sets_optional();
3108 
3109     TASKQUEUE_STATS_ONLY(print_taskqueue_stats());
3110     TASKQUEUE_STATS_ONLY(reset_taskqueue_stats());
3111 
3112     print_heap_after_gc();
3113     print_heap_regions();
3114     trace_heap_after_gc(_gc_tracer_stw);
3115 
3116     // We must call G1MonitoringSupport::update_sizes() in the same scoping level
3117     // as an active TraceMemoryManagerStats object (i.e. before the destructor for the
3118     // TraceMemoryManagerStats is called) so that the G1 memory pools are updated
3119     // before any GC notifications are raised.
3120     g1mm()->update_sizes();
3121 
3122     _gc_tracer_stw->report_evacuation_info(&evacuation_info);
3123     _gc_tracer_stw->report_tenuring_threshold(_policy->tenuring_threshold());
3124     _gc_timer_stw->register_gc_end();
3125     _gc_tracer_stw->report_gc_end(_gc_timer_stw->gc_end(), _gc_timer_stw->time_partitions());
3126   }
3127   // It should now be safe to tell the concurrent mark thread to start
3128   // without its logging output interfering with the logging output
3129   // that came from the pause.
3130 
3131   if (should_start_conc_mark) {
3132     // CAUTION: after the doConcurrentMark() call below, the concurrent marking
3133     // thread(s) could be running concurrently with us. Make sure that anything
3134     // after this point does not assume that we are the only GC thread running.
3135     // Note: of course, the actual marking work will not start until the safepoint
3136     // itself is released in SuspendibleThreadSet::desynchronize().
3137     do_concurrent_mark();
3138     ConcurrentGCBreakpoints::notify_idle_to_active();
3139   }
3140 }
3141 
3142 void G1CollectedHeap::remove_self_forwarding_pointers(G1RedirtyCardsQueueSet* rdcqs) {
3143   G1ParRemoveSelfForwardPtrsTask rsfp_task(rdcqs);
3144   workers()->run_task(&rsfp_task);
3145 }
3146 
3147 void G1CollectedHeap::restore_after_evac_failure(G1RedirtyCardsQueueSet* rdcqs) {
3148   double remove_self_forwards_start = os::elapsedTime();
3149 
3150   remove_self_forwarding_pointers(rdcqs);
3151   _preserved_marks_set.restore(workers());
3152 
3153   phase_times()->record_evac_fail_remove_self_forwards((os::elapsedTime() - remove_self_forwards_start) * 1000.0);
3154 }
3155 
3156 void G1CollectedHeap::preserve_mark_during_evac_failure(uint worker_id, oop obj, markWord m) {
3157   if (!_evacuation_failed) {
3158     _evacuation_failed = true;
3159   }
3160 
3161   _evacuation_failed_info_array[worker_id].register_copy_failure(obj->size());
3162   _preserved_marks_set.get(worker_id)->push_if_necessary(obj, m);
3163 }
3164 
3165 bool G1ParEvacuateFollowersClosure::offer_termination() {
3166   EventGCPhaseParallel event;
3167   G1ParScanThreadState* const pss = par_scan_state();
3168   start_term_time();
3169   const bool res = terminator()->offer_termination();
3170   end_term_time();
3171   event.commit(GCId::current(), pss->worker_id(), G1GCPhaseTimes::phase_name(G1GCPhaseTimes::Termination));
3172   return res;
3173 }
3174 
3175 void G1ParEvacuateFollowersClosure::do_void() {
3176   EventGCPhaseParallel event;
3177   G1ParScanThreadState* const pss = par_scan_state();
3178   pss->trim_queue();
3179   event.commit(GCId::current(), pss->worker_id(), G1GCPhaseTimes::phase_name(_phase));
3180   do {
3181     EventGCPhaseParallel event;
3182     pss->steal_and_trim_queue(queues());
3183     event.commit(GCId::current(), pss->worker_id(), G1GCPhaseTimes::phase_name(_phase));
3184   } while (!offer_termination());
3185 }
3186 
3187 void G1CollectedHeap::complete_cleaning(BoolObjectClosure* is_alive,
3188                                         bool class_unloading_occurred) {
3189   uint num_workers = workers()->active_workers();
3190   G1ParallelCleaningTask unlink_task(is_alive, num_workers, class_unloading_occurred, false);
3191   workers()->run_task(&unlink_task);
3192 }
3193 
3194 // Clean string dedup data structures.
3195 // Ideally we would prefer to use a StringDedupCleaningTask here, but we want to
3196 // record the durations of the phases. Hence the almost-copy.
3197 class G1StringDedupCleaningTask : public AbstractGangTask {
3198   BoolObjectClosure* _is_alive;
3199   OopClosure* _keep_alive;
3200   G1GCPhaseTimes* _phase_times;
3201 
3202 public:
3203   G1StringDedupCleaningTask(BoolObjectClosure* is_alive,
3204                             OopClosure* keep_alive,
3205                             G1GCPhaseTimes* phase_times) :
3206     AbstractGangTask("Partial Cleaning Task"),
3207     _is_alive(is_alive),
3208     _keep_alive(keep_alive),
3209     _phase_times(phase_times)
3210   {
3211     assert(G1StringDedup::is_enabled(), "String deduplication disabled.");
3212     StringDedup::gc_prologue(true);
3213   }
3214 
3215   ~G1StringDedupCleaningTask() {
3216     StringDedup::gc_epilogue();
3217   }
3218 
3219   void work(uint worker_id) {
3220     StringDedupUnlinkOrOopsDoClosure cl(_is_alive, _keep_alive);
3221     {
3222       G1GCParPhaseTimesTracker x(_phase_times, G1GCPhaseTimes::StringDedupQueueFixup, worker_id);
3223       StringDedupQueue::unlink_or_oops_do(&cl);
3224     }
3225     {
3226       G1GCParPhaseTimesTracker x(_phase_times, G1GCPhaseTimes::StringDedupTableFixup, worker_id);
3227       StringDedupTable::unlink_or_oops_do(&cl, worker_id);
3228     }
3229   }
3230 };
3231 
3232 void G1CollectedHeap::string_dedup_cleaning(BoolObjectClosure* is_alive,
3233                                             OopClosure* keep_alive,
3234                                             G1GCPhaseTimes* phase_times) {
3235   G1StringDedupCleaningTask cl(is_alive, keep_alive, phase_times);
3236   workers()->run_task(&cl);
3237 }
3238 
3239 class G1RedirtyLoggedCardsTask : public AbstractGangTask {
3240  private:
3241   G1RedirtyCardsQueueSet* _qset;
3242   G1CollectedHeap* _g1h;
3243   BufferNode* volatile _nodes;
3244 
3245   void par_apply(RedirtyLoggedCardTableEntryClosure* cl, uint worker_id) {
3246     size_t buffer_size = _qset->buffer_size();
3247     BufferNode* next = Atomic::load(&_nodes);
3248     while (next != NULL) {
3249       BufferNode* node = next;
3250       next = Atomic::cmpxchg(&_nodes, node, node->next());
3251       if (next == node) {
3252         cl->apply_to_buffer(node, buffer_size, worker_id);
3253         next = node->next();
3254       }
3255     }
3256   }
3257 
3258  public:
3259   G1RedirtyLoggedCardsTask(G1RedirtyCardsQueueSet* qset, G1CollectedHeap* g1h) :
3260     AbstractGangTask("Redirty Cards"),
3261     _qset(qset), _g1h(g1h), _nodes(qset->all_completed_buffers()) { }
3262 
3263   virtual void work(uint worker_id) {
3264     G1GCPhaseTimes* p = _g1h->phase_times();
3265     G1GCParPhaseTimesTracker x(p, G1GCPhaseTimes::RedirtyCards, worker_id);
3266 
3267     RedirtyLoggedCardTableEntryClosure cl(_g1h);
3268     par_apply(&cl, worker_id);
3269 
3270     p->record_thread_work_item(G1GCPhaseTimes::RedirtyCards, worker_id, cl.num_dirtied());
3271   }
3272 };
3273 
3274 void G1CollectedHeap::redirty_logged_cards(G1RedirtyCardsQueueSet* rdcqs) {
3275   double redirty_logged_cards_start = os::elapsedTime();
3276 
3277   G1RedirtyLoggedCardsTask redirty_task(rdcqs, this);
3278   workers()->run_task(&redirty_task);
3279 
3280   G1DirtyCardQueueSet& dcq = G1BarrierSet::dirty_card_queue_set();
3281   dcq.merge_bufferlists(rdcqs);
3282 
3283   phase_times()->record_redirty_logged_cards_time_ms((os::elapsedTime() - redirty_logged_cards_start) * 1000.0);
3284 }
3285 
3286 // Weak Reference Processing support
3287 
3288 bool G1STWIsAliveClosure::do_object_b(oop p) {
3289   // An object is reachable if it is outside the collection set,
3290   // or is inside and copied.
3291   return !_g1h->is_in_cset(p) || p->is_forwarded();
3292 }
3293 
3294 bool G1STWSubjectToDiscoveryClosure::do_object_b(oop obj) {
3295   assert(obj != NULL, "must not be NULL");
3296   assert(_g1h->is_in_reserved(obj), "Trying to discover obj " PTR_FORMAT " not in heap", p2i(obj));
3297   // The areas the CM and STW ref processor manage must be disjoint. The is_in_cset() below
3298   // may falsely indicate that this is not the case here: however the collection set only
3299   // contains old regions when concurrent mark is not running.
3300   return _g1h->is_in_cset(obj) || _g1h->heap_region_containing(obj)->is_survivor();
3301 }
3302 
3303 // Non Copying Keep Alive closure
3304 class G1KeepAliveClosure: public OopClosure {
3305   G1CollectedHeap*_g1h;
3306 public:
3307   G1KeepAliveClosure(G1CollectedHeap* g1h) :_g1h(g1h) {}
3308   void do_oop(narrowOop* p) { guarantee(false, "Not needed"); }
3309   void do_oop(oop* p) {
3310     oop obj = *p;
3311     assert(obj != NULL, "the caller should have filtered out NULL values");
3312 
3313     const G1HeapRegionAttr region_attr =_g1h->region_attr(obj);
3314     if (!region_attr.is_in_cset_or_humongous()) {
3315       return;
3316     }
3317     if (region_attr.is_in_cset()) {
3318       assert( obj->is_forwarded(), "invariant" );
3319       *p = obj->forwardee();
3320     } else {
3321       assert(!obj->is_forwarded(), "invariant" );
3322       assert(region_attr.is_humongous(),
3323              "Only allowed G1HeapRegionAttr state is IsHumongous, but is %d", region_attr.type());
3324      _g1h->set_humongous_is_live(obj);
3325     }
3326   }
3327 };
3328 
3329 // Copying Keep Alive closure - can be called from both
3330 // serial and parallel code as long as different worker
3331 // threads utilize different G1ParScanThreadState instances
3332 // and different queues.
3333 
3334 class G1CopyingKeepAliveClosure: public OopClosure {
3335   G1CollectedHeap*         _g1h;
3336   G1ParScanThreadState*    _par_scan_state;
3337 
3338 public:
3339   G1CopyingKeepAliveClosure(G1CollectedHeap* g1h,
3340                             G1ParScanThreadState* pss):
3341     _g1h(g1h),
3342     _par_scan_state(pss)
3343   {}
3344 
3345   virtual void do_oop(narrowOop* p) { do_oop_work(p); }
3346   virtual void do_oop(      oop* p) { do_oop_work(p); }
3347 
3348   template <class T> void do_oop_work(T* p) {
3349     oop obj = RawAccess<>::oop_load(p);
3350 
3351     if (_g1h->is_in_cset_or_humongous(obj)) {
3352       // If the referent object has been forwarded (either copied
3353       // to a new location or to itself in the event of an
3354       // evacuation failure) then we need to update the reference
3355       // field and, if both reference and referent are in the G1
3356       // heap, update the RSet for the referent.
3357       //
3358       // If the referent has not been forwarded then we have to keep
3359       // it alive by policy. Therefore we have copy the referent.
3360       //
3361       // When the queue is drained (after each phase of reference processing)
3362       // the object and it's followers will be copied, the reference field set
3363       // to point to the new location, and the RSet updated.
3364       _par_scan_state->push_on_queue(ScannerTask(p));
3365     }
3366   }
3367 };
3368 
3369 // Serial drain queue closure. Called as the 'complete_gc'
3370 // closure for each discovered list in some of the
3371 // reference processing phases.
3372 
3373 class G1STWDrainQueueClosure: public VoidClosure {
3374 protected:
3375   G1CollectedHeap* _g1h;
3376   G1ParScanThreadState* _par_scan_state;
3377 
3378   G1ParScanThreadState*   par_scan_state() { return _par_scan_state; }
3379 
3380 public:
3381   G1STWDrainQueueClosure(G1CollectedHeap* g1h, G1ParScanThreadState* pss) :
3382     _g1h(g1h),
3383     _par_scan_state(pss)
3384   { }
3385 
3386   void do_void() {
3387     G1ParScanThreadState* const pss = par_scan_state();
3388     pss->trim_queue();
3389   }
3390 };
3391 
3392 // Parallel Reference Processing closures
3393 
3394 // Implementation of AbstractRefProcTaskExecutor for parallel reference
3395 // processing during G1 evacuation pauses.
3396 
3397 class G1STWRefProcTaskExecutor: public AbstractRefProcTaskExecutor {
3398 private:
3399   G1CollectedHeap*          _g1h;
3400   G1ParScanThreadStateSet*  _pss;
3401   G1ScannerTasksQueueSet*   _queues;
3402   WorkGang*                 _workers;
3403 
3404 public:
3405   G1STWRefProcTaskExecutor(G1CollectedHeap* g1h,
3406                            G1ParScanThreadStateSet* per_thread_states,
3407                            WorkGang* workers,
3408                            G1ScannerTasksQueueSet *task_queues) :
3409     _g1h(g1h),
3410     _pss(per_thread_states),
3411     _queues(task_queues),
3412     _workers(workers)
3413   {
3414     g1h->ref_processor_stw()->set_active_mt_degree(workers->active_workers());
3415   }
3416 
3417   // Executes the given task using concurrent marking worker threads.
3418   virtual void execute(ProcessTask& task, uint ergo_workers);
3419 };
3420 
3421 // Gang task for possibly parallel reference processing
3422 
3423 class G1STWRefProcTaskProxy: public AbstractGangTask {
3424   typedef AbstractRefProcTaskExecutor::ProcessTask ProcessTask;
3425   ProcessTask&     _proc_task;
3426   G1CollectedHeap* _g1h;
3427   G1ParScanThreadStateSet* _pss;
3428   G1ScannerTasksQueueSet* _task_queues;
3429   TaskTerminator* _terminator;
3430 
3431 public:
3432   G1STWRefProcTaskProxy(ProcessTask& proc_task,
3433                         G1CollectedHeap* g1h,
3434                         G1ParScanThreadStateSet* per_thread_states,
3435                         G1ScannerTasksQueueSet *task_queues,
3436                         TaskTerminator* terminator) :
3437     AbstractGangTask("Process reference objects in parallel"),
3438     _proc_task(proc_task),
3439     _g1h(g1h),
3440     _pss(per_thread_states),
3441     _task_queues(task_queues),
3442     _terminator(terminator)
3443   {}
3444 
3445   virtual void work(uint worker_id) {
3446     // The reference processing task executed by a single worker.
3447     ResourceMark rm;
3448 
3449     G1STWIsAliveClosure is_alive(_g1h);
3450 
3451     G1ParScanThreadState* pss = _pss->state_for_worker(worker_id);
3452     pss->set_ref_discoverer(NULL);
3453 
3454     // Keep alive closure.
3455     G1CopyingKeepAliveClosure keep_alive(_g1h, pss);
3456 
3457     // Complete GC closure
3458     G1ParEvacuateFollowersClosure drain_queue(_g1h, pss, _task_queues, _terminator, G1GCPhaseTimes::ObjCopy);
3459 
3460     // Call the reference processing task's work routine.
3461     _proc_task.work(worker_id, is_alive, keep_alive, drain_queue);
3462 
3463     // Note we cannot assert that the refs array is empty here as not all
3464     // of the processing tasks (specifically phase2 - pp2_work) execute
3465     // the complete_gc closure (which ordinarily would drain the queue) so
3466     // the queue may not be empty.
3467   }
3468 };
3469 
3470 // Driver routine for parallel reference processing.
3471 // Creates an instance of the ref processing gang
3472 // task and has the worker threads execute it.
3473 void G1STWRefProcTaskExecutor::execute(ProcessTask& proc_task, uint ergo_workers) {
3474   assert(_workers != NULL, "Need parallel worker threads.");
3475 
3476   assert(_workers->active_workers() >= ergo_workers,
3477          "Ergonomically chosen workers (%u) should be less than or equal to active workers (%u)",
3478          ergo_workers, _workers->active_workers());
3479   TaskTerminator terminator(ergo_workers, _queues);
3480   G1STWRefProcTaskProxy proc_task_proxy(proc_task, _g1h, _pss, _queues, &terminator);
3481 
3482   _workers->run_task(&proc_task_proxy, ergo_workers);
3483 }
3484 
3485 // End of weak reference support closures
3486 
3487 void G1CollectedHeap::process_discovered_references(G1ParScanThreadStateSet* per_thread_states) {
3488   double ref_proc_start = os::elapsedTime();
3489 
3490   ReferenceProcessor* rp = _ref_processor_stw;
3491   assert(rp->discovery_enabled(), "should have been enabled");
3492 
3493   // Closure to test whether a referent is alive.
3494   G1STWIsAliveClosure is_alive(this);
3495 
3496   // Even when parallel reference processing is enabled, the processing
3497   // of JNI refs is serial and performed serially by the current thread
3498   // rather than by a worker. The following PSS will be used for processing
3499   // JNI refs.
3500 
3501   // Use only a single queue for this PSS.
3502   G1ParScanThreadState*          pss = per_thread_states->state_for_worker(0);
3503   pss->set_ref_discoverer(NULL);
3504   assert(pss->queue_is_empty(), "pre-condition");
3505 
3506   // Keep alive closure.
3507   G1CopyingKeepAliveClosure keep_alive(this, pss);
3508 
3509   // Serial Complete GC closure
3510   G1STWDrainQueueClosure drain_queue(this, pss);
3511 
3512   // Setup the soft refs policy...
3513   rp->setup_policy(false);
3514 
3515   ReferenceProcessorPhaseTimes* pt = phase_times()->ref_phase_times();
3516 
3517   ReferenceProcessorStats stats;
3518   if (!rp->processing_is_mt()) {
3519     // Serial reference processing...
3520     stats = rp->process_discovered_references(&is_alive,
3521                                               &keep_alive,
3522                                               &drain_queue,
3523                                               NULL,
3524                                               pt);
3525   } else {
3526     uint no_of_gc_workers = workers()->active_workers();
3527 
3528     // Parallel reference processing
3529     assert(no_of_gc_workers <= rp->max_num_queues(),
3530            "Mismatch between the number of GC workers %u and the maximum number of Reference process queues %u",
3531            no_of_gc_workers,  rp->max_num_queues());
3532 
3533     G1STWRefProcTaskExecutor par_task_executor(this, per_thread_states, workers(), _task_queues);
3534     stats = rp->process_discovered_references(&is_alive,
3535                                               &keep_alive,
3536                                               &drain_queue,
3537                                               &par_task_executor,
3538                                               pt);
3539   }
3540 
3541   _gc_tracer_stw->report_gc_reference_stats(stats);
3542 
3543   // We have completed copying any necessary live referent objects.
3544   assert(pss->queue_is_empty(), "both queue and overflow should be empty");
3545 
3546   make_pending_list_reachable();
3547 
3548   assert(!rp->discovery_enabled(), "Postcondition");
3549   rp->verify_no_references_recorded();
3550 
3551   double ref_proc_time = os::elapsedTime() - ref_proc_start;
3552   phase_times()->record_ref_proc_time(ref_proc_time * 1000.0);
3553 }
3554 
3555 void G1CollectedHeap::make_pending_list_reachable() {
3556   if (collector_state()->in_concurrent_start_gc()) {
3557     oop pll_head = Universe::reference_pending_list();
3558     if (pll_head != NULL) {
3559       // Any valid worker id is fine here as we are in the VM thread and single-threaded.
3560       _cm->mark_in_next_bitmap(0 /* worker_id */, pll_head);
3561     }
3562   }
3563 }
3564 
3565 void G1CollectedHeap::merge_per_thread_state_info(G1ParScanThreadStateSet* per_thread_states) {
3566   Ticks start = Ticks::now();
3567   per_thread_states->flush();
3568   phase_times()->record_or_add_time_secs(G1GCPhaseTimes::MergePSS, 0 /* worker_id */, (Ticks::now() - start).seconds());
3569 }
3570 
3571 class G1PrepareEvacuationTask : public AbstractGangTask {
3572   class G1PrepareRegionsClosure : public HeapRegionClosure {
3573     G1CollectedHeap* _g1h;
3574     G1PrepareEvacuationTask* _parent_task;
3575     size_t _worker_humongous_total;
3576     size_t _worker_humongous_candidates;
3577 
3578     bool humongous_region_is_candidate(HeapRegion* region) const {
3579       assert(region->is_starts_humongous(), "Must start a humongous object");
3580 
3581       oop obj = oop(region->bottom());
3582 
3583       // Dead objects cannot be eager reclaim candidates. Due to class
3584       // unloading it is unsafe to query their classes so we return early.
3585       if (_g1h->is_obj_dead(obj, region)) {
3586         return false;
3587       }
3588 
3589       // If we do not have a complete remembered set for the region, then we can
3590       // not be sure that we have all references to it.
3591       if (!region->rem_set()->is_complete()) {
3592         return false;
3593       }
3594       // Candidate selection must satisfy the following constraints
3595       // while concurrent marking is in progress:
3596       //
3597       // * In order to maintain SATB invariants, an object must not be
3598       // reclaimed if it was allocated before the start of marking and
3599       // has not had its references scanned.  Such an object must have
3600       // its references (including type metadata) scanned to ensure no
3601       // live objects are missed by the marking process.  Objects
3602       // allocated after the start of concurrent marking don't need to
3603       // be scanned.
3604       //
3605       // * An object must not be reclaimed if it is on the concurrent
3606       // mark stack.  Objects allocated after the start of concurrent
3607       // marking are never pushed on the mark stack.
3608       //
3609       // Nominating only objects allocated after the start of concurrent
3610       // marking is sufficient to meet both constraints.  This may miss
3611       // some objects that satisfy the constraints, but the marking data
3612       // structures don't support efficiently performing the needed
3613       // additional tests or scrubbing of the mark stack.
3614       //
3615       // However, we presently only nominate is_typeArray() objects.
3616       // A humongous object containing references induces remembered
3617       // set entries on other regions.  In order to reclaim such an
3618       // object, those remembered sets would need to be cleaned up.
3619       //
3620       // We also treat is_typeArray() objects specially, allowing them
3621       // to be reclaimed even if allocated before the start of
3622       // concurrent mark.  For this we rely on mark stack insertion to
3623       // exclude is_typeArray() objects, preventing reclaiming an object
3624       // that is in the mark stack.  We also rely on the metadata for
3625       // such objects to be built-in and so ensured to be kept live.
3626       // Frequent allocation and drop of large binary blobs is an
3627       // important use case for eager reclaim, and this special handling
3628       // may reduce needed headroom.
3629 
3630       return obj->is_typeArray() &&
3631              _g1h->is_potential_eager_reclaim_candidate(region);
3632     }
3633 
3634   public:
3635     G1PrepareRegionsClosure(G1CollectedHeap* g1h, G1PrepareEvacuationTask* parent_task) :
3636       _g1h(g1h),
3637       _parent_task(parent_task),
3638       _worker_humongous_total(0),
3639       _worker_humongous_candidates(0) { }
3640 
3641     ~G1PrepareRegionsClosure() {
3642       _parent_task->add_humongous_candidates(_worker_humongous_candidates);
3643       _parent_task->add_humongous_total(_worker_humongous_total);
3644     }
3645 
3646     virtual bool do_heap_region(HeapRegion* hr) {
3647       // First prepare the region for scanning
3648       _g1h->rem_set()->prepare_region_for_scan(hr);
3649 
3650       // Now check if region is a humongous candidate
3651       if (!hr->is_starts_humongous()) {
3652         _g1h->register_region_with_region_attr(hr);
3653         return false;
3654       }
3655 
3656       uint index = hr->hrm_index();
3657       if (humongous_region_is_candidate(hr)) {
3658         _g1h->set_humongous_reclaim_candidate(index, true);
3659         _g1h->register_humongous_region_with_region_attr(index);
3660         _worker_humongous_candidates++;
3661         // We will later handle the remembered sets of these regions.
3662       } else {
3663         _g1h->set_humongous_reclaim_candidate(index, false);
3664         _g1h->register_region_with_region_attr(hr);
3665       }
3666       _worker_humongous_total++;
3667 
3668       return false;
3669     }
3670   };
3671 
3672   G1CollectedHeap* _g1h;
3673   HeapRegionClaimer _claimer;
3674   volatile size_t _humongous_total;
3675   volatile size_t _humongous_candidates;
3676 public:
3677   G1PrepareEvacuationTask(G1CollectedHeap* g1h) :
3678     AbstractGangTask("Prepare Evacuation"),
3679     _g1h(g1h),
3680     _claimer(_g1h->workers()->active_workers()),
3681     _humongous_total(0),
3682     _humongous_candidates(0) { }
3683 
3684   ~G1PrepareEvacuationTask() {
3685     _g1h->set_has_humongous_reclaim_candidate(_humongous_candidates > 0);
3686   }
3687 
3688   void work(uint worker_id) {
3689     G1PrepareRegionsClosure cl(_g1h, this);
3690     _g1h->heap_region_par_iterate_from_worker_offset(&cl, &_claimer, worker_id);
3691   }
3692 
3693   void add_humongous_candidates(size_t candidates) {
3694     Atomic::add(&_humongous_candidates, candidates);
3695   }
3696 
3697   void add_humongous_total(size_t total) {
3698     Atomic::add(&_humongous_total, total);
3699   }
3700 
3701   size_t humongous_candidates() {
3702     return _humongous_candidates;
3703   }
3704 
3705   size_t humongous_total() {
3706     return _humongous_total;
3707   }
3708 };
3709 
3710 void G1CollectedHeap::pre_evacuate_collection_set(G1EvacuationInfo& evacuation_info, G1ParScanThreadStateSet* per_thread_states) {
3711   _bytes_used_during_gc = 0;
3712 
3713   _expand_heap_after_alloc_failure = true;
3714   _evacuation_failed = false;
3715 
3716   // Disable the hot card cache.
3717   _hot_card_cache->reset_hot_cache_claimed_index();
3718   _hot_card_cache->set_use_cache(false);
3719 
3720   // Initialize the GC alloc regions.
3721   _allocator->init_gc_alloc_regions(evacuation_info);
3722 
3723   {
3724     Ticks start = Ticks::now();
3725     rem_set()->prepare_for_scan_heap_roots();
3726     phase_times()->record_prepare_heap_roots_time_ms((Ticks::now() - start).seconds() * 1000.0);
3727   }
3728 
3729   {
3730     G1PrepareEvacuationTask g1_prep_task(this);
3731     Tickspan task_time = run_task_timed(&g1_prep_task);
3732 
3733     phase_times()->record_register_regions(task_time.seconds() * 1000.0,
3734                                            g1_prep_task.humongous_total(),
3735                                            g1_prep_task.humongous_candidates());
3736   }
3737 
3738   assert(_verifier->check_region_attr_table(), "Inconsistency in the region attributes table.");
3739   _preserved_marks_set.assert_empty();
3740 
3741 #if COMPILER2_OR_JVMCI
3742   DerivedPointerTable::clear();
3743 #endif
3744 
3745   // Concurrent start needs claim bits to keep track of the marked-through CLDs.
3746   if (collector_state()->in_concurrent_start_gc()) {
3747     concurrent_mark()->pre_concurrent_start();
3748 
3749     double start_clear_claimed_marks = os::elapsedTime();
3750 
3751     ClassLoaderDataGraph::clear_claimed_marks();
3752 
3753     double recorded_clear_claimed_marks_time_ms = (os::elapsedTime() - start_clear_claimed_marks) * 1000.0;
3754     phase_times()->record_clear_claimed_marks_time_ms(recorded_clear_claimed_marks_time_ms);
3755   }
3756 
3757   // Should G1EvacuationFailureALot be in effect for this GC?
3758   NOT_PRODUCT(set_evacuation_failure_alot_for_current_gc();)
3759 }
3760 
3761 class G1EvacuateRegionsBaseTask : public AbstractGangTask {
3762 protected:
3763   G1CollectedHeap* _g1h;
3764   G1ParScanThreadStateSet* _per_thread_states;
3765   G1ScannerTasksQueueSet* _task_queues;
3766   TaskTerminator _terminator;
3767   uint _num_workers;
3768 
3769   void evacuate_live_objects(G1ParScanThreadState* pss,
3770                              uint worker_id,
3771                              G1GCPhaseTimes::GCParPhases objcopy_phase,
3772                              G1GCPhaseTimes::GCParPhases termination_phase) {
3773     G1GCPhaseTimes* p = _g1h->phase_times();
3774 
3775     Ticks start = Ticks::now();
3776     G1ParEvacuateFollowersClosure cl(_g1h, pss, _task_queues, &_terminator, objcopy_phase);
3777     cl.do_void();
3778 
3779     assert(pss->queue_is_empty(), "should be empty");
3780 
3781     Tickspan evac_time = (Ticks::now() - start);
3782     p->record_or_add_time_secs(objcopy_phase, worker_id, evac_time.seconds() - cl.term_time());
3783 
3784     if (termination_phase == G1GCPhaseTimes::Termination) {
3785       p->record_time_secs(termination_phase, worker_id, cl.term_time());
3786       p->record_thread_work_item(termination_phase, worker_id, cl.term_attempts());
3787     } else {
3788       p->record_or_add_time_secs(termination_phase, worker_id, cl.term_time());
3789       p->record_or_add_thread_work_item(termination_phase, worker_id, cl.term_attempts());
3790     }
3791     assert(pss->trim_ticks().seconds() == 0.0, "Unexpected partial trimming during evacuation");
3792   }
3793 
3794   virtual void start_work(uint worker_id) { }
3795 
3796   virtual void end_work(uint worker_id) { }
3797 
3798   virtual void scan_roots(G1ParScanThreadState* pss, uint worker_id) = 0;
3799 
3800   virtual void evacuate_live_objects(G1ParScanThreadState* pss, uint worker_id) = 0;
3801 
3802 public:
3803   G1EvacuateRegionsBaseTask(const char* name,
3804                             G1ParScanThreadStateSet* per_thread_states,
3805                             G1ScannerTasksQueueSet* task_queues,
3806                             uint num_workers) :
3807     AbstractGangTask(name),
3808     _g1h(G1CollectedHeap::heap()),
3809     _per_thread_states(per_thread_states),
3810     _task_queues(task_queues),
3811     _terminator(num_workers, _task_queues),
3812     _num_workers(num_workers)
3813   { }
3814 
3815   void work(uint worker_id) {
3816     start_work(worker_id);
3817 
3818     {
3819       ResourceMark rm;
3820 
3821       G1ParScanThreadState* pss = _per_thread_states->state_for_worker(worker_id);
3822       pss->set_ref_discoverer(_g1h->ref_processor_stw());
3823 
3824       scan_roots(pss, worker_id);
3825       evacuate_live_objects(pss, worker_id);
3826     }
3827 
3828     end_work(worker_id);
3829   }
3830 };
3831 
3832 class G1EvacuateRegionsTask : public G1EvacuateRegionsBaseTask {
3833   G1RootProcessor* _root_processor;
3834 
3835   void scan_roots(G1ParScanThreadState* pss, uint worker_id) {
3836     _root_processor->evacuate_roots(pss, worker_id);
3837     _g1h->rem_set()->scan_heap_roots(pss, worker_id, G1GCPhaseTimes::ScanHR, G1GCPhaseTimes::ObjCopy);
3838     _g1h->rem_set()->scan_collection_set_regions(pss, worker_id, G1GCPhaseTimes::ScanHR, G1GCPhaseTimes::CodeRoots, G1GCPhaseTimes::ObjCopy);
3839   }
3840 
3841   void evacuate_live_objects(G1ParScanThreadState* pss, uint worker_id) {
3842     G1EvacuateRegionsBaseTask::evacuate_live_objects(pss, worker_id, G1GCPhaseTimes::ObjCopy, G1GCPhaseTimes::Termination);
3843   }
3844 
3845   void start_work(uint worker_id) {
3846     _g1h->phase_times()->record_time_secs(G1GCPhaseTimes::GCWorkerStart, worker_id, Ticks::now().seconds());
3847   }
3848 
3849   void end_work(uint worker_id) {
3850     _g1h->phase_times()->record_time_secs(G1GCPhaseTimes::GCWorkerEnd, worker_id, Ticks::now().seconds());
3851   }
3852 
3853 public:
3854   G1EvacuateRegionsTask(G1CollectedHeap* g1h,
3855                         G1ParScanThreadStateSet* per_thread_states,
3856                         G1ScannerTasksQueueSet* task_queues,
3857                         G1RootProcessor* root_processor,
3858                         uint num_workers) :
3859     G1EvacuateRegionsBaseTask("G1 Evacuate Regions", per_thread_states, task_queues, num_workers),
3860     _root_processor(root_processor)
3861   { }
3862 };
3863 
3864 void G1CollectedHeap::evacuate_initial_collection_set(G1ParScanThreadStateSet* per_thread_states) {
3865   G1GCPhaseTimes* p = phase_times();
3866 
3867   {
3868     Ticks start = Ticks::now();
3869     rem_set()->merge_heap_roots(true /* initial_evacuation */);
3870     p->record_merge_heap_roots_time((Ticks::now() - start).seconds() * 1000.0);
3871   }
3872 
3873   Tickspan task_time;
3874   const uint num_workers = workers()->active_workers();
3875 
3876   Ticks start_processing = Ticks::now();
3877   {
3878     G1RootProcessor root_processor(this, num_workers);
3879     G1EvacuateRegionsTask g1_par_task(this, per_thread_states, _task_queues, &root_processor, num_workers);
3880     task_time = run_task_timed(&g1_par_task);
3881     // Closing the inner scope will execute the destructor for the G1RootProcessor object.
3882     // To extract its code root fixup time we measure total time of this scope and
3883     // subtract from the time the WorkGang task took.
3884   }
3885   Tickspan total_processing = Ticks::now() - start_processing;
3886 
3887   p->record_initial_evac_time(task_time.seconds() * 1000.0);
3888   p->record_or_add_code_root_fixup_time((total_processing - task_time).seconds() * 1000.0);
3889 }
3890 
3891 class G1EvacuateOptionalRegionsTask : public G1EvacuateRegionsBaseTask {
3892 
3893   void scan_roots(G1ParScanThreadState* pss, uint worker_id) {
3894     _g1h->rem_set()->scan_heap_roots(pss, worker_id, G1GCPhaseTimes::OptScanHR, G1GCPhaseTimes::OptObjCopy);
3895     _g1h->rem_set()->scan_collection_set_regions(pss, worker_id, G1GCPhaseTimes::OptScanHR, G1GCPhaseTimes::OptCodeRoots, G1GCPhaseTimes::OptObjCopy);
3896   }
3897 
3898   void evacuate_live_objects(G1ParScanThreadState* pss, uint worker_id) {
3899     G1EvacuateRegionsBaseTask::evacuate_live_objects(pss, worker_id, G1GCPhaseTimes::OptObjCopy, G1GCPhaseTimes::OptTermination);
3900   }
3901 
3902 public:
3903   G1EvacuateOptionalRegionsTask(G1ParScanThreadStateSet* per_thread_states,
3904                                 G1ScannerTasksQueueSet* queues,
3905                                 uint num_workers) :
3906     G1EvacuateRegionsBaseTask("G1 Evacuate Optional Regions", per_thread_states, queues, num_workers) {
3907   }
3908 };
3909 
3910 void G1CollectedHeap::evacuate_next_optional_regions(G1ParScanThreadStateSet* per_thread_states) {
3911   class G1MarkScope : public MarkScope { };
3912 
3913   Tickspan task_time;
3914 
3915   Ticks start_processing = Ticks::now();
3916   {
3917     G1MarkScope code_mark_scope;
3918     G1EvacuateOptionalRegionsTask task(per_thread_states, _task_queues, workers()->active_workers());
3919     task_time = run_task_timed(&task);
3920     // See comment in evacuate_collection_set() for the reason of the scope.
3921   }
3922   Tickspan total_processing = Ticks::now() - start_processing;
3923 
3924   G1GCPhaseTimes* p = phase_times();
3925   p->record_or_add_code_root_fixup_time((total_processing - task_time).seconds() * 1000.0);
3926 }
3927 
3928 void G1CollectedHeap::evacuate_optional_collection_set(G1ParScanThreadStateSet* per_thread_states) {
3929   const double gc_start_time_ms = phase_times()->cur_collection_start_sec() * 1000.0;
3930 
3931   while (!evacuation_failed() && _collection_set.optional_region_length() > 0) {
3932 
3933     double time_used_ms = os::elapsedTime() * 1000.0 - gc_start_time_ms;
3934     double time_left_ms = MaxGCPauseMillis - time_used_ms;
3935 
3936     if (time_left_ms < 0 ||
3937         !_collection_set.finalize_optional_for_evacuation(time_left_ms * policy()->optional_evacuation_fraction())) {
3938       log_trace(gc, ergo, cset)("Skipping evacuation of %u optional regions, no more regions can be evacuated in %.3fms",
3939                                 _collection_set.optional_region_length(), time_left_ms);
3940       break;
3941     }
3942 
3943     {
3944       Ticks start = Ticks::now();
3945       rem_set()->merge_heap_roots(false /* initial_evacuation */);
3946       phase_times()->record_or_add_optional_merge_heap_roots_time((Ticks::now() - start).seconds() * 1000.0);
3947     }
3948 
3949     {
3950       Ticks start = Ticks::now();
3951       evacuate_next_optional_regions(per_thread_states);
3952       phase_times()->record_or_add_optional_evac_time((Ticks::now() - start).seconds() * 1000.0);
3953     }
3954   }
3955 
3956   _collection_set.abandon_optional_collection_set(per_thread_states);
3957 }
3958 
3959 void G1CollectedHeap::post_evacuate_collection_set(G1EvacuationInfo& evacuation_info,
3960                                                    G1RedirtyCardsQueueSet* rdcqs,
3961                                                    G1ParScanThreadStateSet* per_thread_states) {
3962   G1GCPhaseTimes* p = phase_times();
3963 
3964   rem_set()->cleanup_after_scan_heap_roots();
3965 
3966   // Process any discovered reference objects - we have
3967   // to do this _before_ we retire the GC alloc regions
3968   // as we may have to copy some 'reachable' referent
3969   // objects (and their reachable sub-graphs) that were
3970   // not copied during the pause.
3971   process_discovered_references(per_thread_states);
3972 
3973   G1STWIsAliveClosure is_alive(this);
3974   G1KeepAliveClosure keep_alive(this);
3975 
3976   WeakProcessor::weak_oops_do(workers(), &is_alive, &keep_alive, p->weak_phase_times());
3977 
3978   if (G1StringDedup::is_enabled()) {
3979     double string_dedup_time_ms = os::elapsedTime();
3980 
3981     string_dedup_cleaning(&is_alive, &keep_alive, p);
3982 
3983     double string_cleanup_time_ms = (os::elapsedTime() - string_dedup_time_ms) * 1000.0;
3984     p->record_string_deduplication_time(string_cleanup_time_ms);
3985   }
3986 
3987   _allocator->release_gc_alloc_regions(evacuation_info);
3988 
3989   if (evacuation_failed()) {
3990     restore_after_evac_failure(rdcqs);
3991 
3992     // Reset the G1EvacuationFailureALot counters and flags
3993     NOT_PRODUCT(reset_evacuation_should_fail();)
3994 
3995     double recalculate_used_start = os::elapsedTime();
3996     set_used(recalculate_used());
3997     p->record_evac_fail_recalc_used_time((os::elapsedTime() - recalculate_used_start) * 1000.0);
3998 
3999     if (_archive_allocator != NULL) {
4000       _archive_allocator->clear_used();
4001     }
4002     for (uint i = 0; i < ParallelGCThreads; i++) {
4003       if (_evacuation_failed_info_array[i].has_failed()) {
4004         _gc_tracer_stw->report_evacuation_failed(_evacuation_failed_info_array[i]);
4005       }
4006     }
4007   } else {
4008     // The "used" of the the collection set have already been subtracted
4009     // when they were freed.  Add in the bytes used.
4010     increase_used(_bytes_used_during_gc);
4011   }
4012 
4013   _preserved_marks_set.assert_empty();
4014 
4015   merge_per_thread_state_info(per_thread_states);
4016 
4017   // Reset and re-enable the hot card cache.
4018   // Note the counts for the cards in the regions in the
4019   // collection set are reset when the collection set is freed.
4020   _hot_card_cache->reset_hot_cache();
4021   _hot_card_cache->set_use_cache(true);
4022 
4023   purge_code_root_memory();
4024 
4025   redirty_logged_cards(rdcqs);
4026 
4027   free_collection_set(&_collection_set, evacuation_info, per_thread_states->surviving_young_words());
4028 
4029   eagerly_reclaim_humongous_regions();
4030 
4031   record_obj_copy_mem_stats();
4032 
4033   evacuation_info.set_collectionset_used_before(collection_set()->bytes_used_before());
4034   evacuation_info.set_bytes_used(_bytes_used_during_gc);
4035 
4036 #if COMPILER2_OR_JVMCI
4037   double start = os::elapsedTime();
4038   DerivedPointerTable::update_pointers();
4039   phase_times()->record_derived_pointer_table_update_time((os::elapsedTime() - start) * 1000.0);
4040 #endif
4041   policy()->print_age_table();
4042 }
4043 
4044 void G1CollectedHeap::record_obj_copy_mem_stats() {
4045   policy()->old_gen_alloc_tracker()->
4046     add_allocated_bytes_since_last_gc(_old_evac_stats.allocated() * HeapWordSize);
4047 
4048   _gc_tracer_stw->report_evacuation_statistics(create_g1_evac_summary(&_survivor_evac_stats),
4049                                                create_g1_evac_summary(&_old_evac_stats));
4050 }
4051 
4052 void G1CollectedHeap::free_region(HeapRegion* hr, FreeRegionList* free_list) {
4053   assert(!hr->is_free(), "the region should not be free");
4054   assert(!hr->is_empty(), "the region should not be empty");
4055   assert(_hrm->is_available(hr->hrm_index()), "region should be committed");
4056 
4057   if (G1VerifyBitmaps) {
4058     MemRegion mr(hr->bottom(), hr->end());
4059     concurrent_mark()->clear_range_in_prev_bitmap(mr);
4060   }
4061 
4062   // Clear the card counts for this region.
4063   // Note: we only need to do this if the region is not young
4064   // (since we don't refine cards in young regions).
4065   if (!hr->is_young()) {
4066     _hot_card_cache->reset_card_counts(hr);
4067   }
4068 
4069   // Reset region metadata to allow reuse.
4070   hr->hr_clear(true /* clear_space */);
4071   _policy->remset_tracker()->update_at_free(hr);
4072 
4073   if (free_list != NULL) {
4074     free_list->add_ordered(hr);
4075   }
4076 }
4077 
4078 void G1CollectedHeap::free_humongous_region(HeapRegion* hr,
4079                                             FreeRegionList* free_list) {
4080   assert(hr->is_humongous(), "this is only for humongous regions");
4081   assert(free_list != NULL, "pre-condition");
4082   hr->clear_humongous();
4083   free_region(hr, free_list);
4084 }
4085 
4086 void G1CollectedHeap::remove_from_old_sets(const uint old_regions_removed,
4087                                            const uint humongous_regions_removed) {
4088   if (old_regions_removed > 0 || humongous_regions_removed > 0) {
4089     MutexLocker x(OldSets_lock, Mutex::_no_safepoint_check_flag);
4090     _old_set.bulk_remove(old_regions_removed);
4091     _humongous_set.bulk_remove(humongous_regions_removed);
4092   }
4093 
4094 }
4095 
4096 void G1CollectedHeap::prepend_to_freelist(FreeRegionList* list) {
4097   assert(list != NULL, "list can't be null");
4098   if (!list->is_empty()) {
4099     MutexLocker x(FreeList_lock, Mutex::_no_safepoint_check_flag);
4100     _hrm->insert_list_into_free_list(list);
4101   }
4102 }
4103 
4104 void G1CollectedHeap::decrement_summary_bytes(size_t bytes) {
4105   decrease_used(bytes);
4106 }
4107 
4108 class G1FreeCollectionSetTask : public AbstractGangTask {
4109   // Helper class to keep statistics for the collection set freeing
4110   class FreeCSetStats {
4111     size_t _before_used_bytes;   // Usage in regions successfully evacutate
4112     size_t _after_used_bytes;    // Usage in regions failing evacuation
4113     size_t _bytes_allocated_in_old_since_last_gc; // Size of young regions turned into old
4114     size_t _failure_used_words;  // Live size in failed regions
4115     size_t _failure_waste_words; // Wasted size in failed regions
4116     size_t _rs_length;           // Remembered set size
4117     uint _regions_freed;         // Number of regions freed
4118   public:
4119     FreeCSetStats() :
4120         _before_used_bytes(0),
4121         _after_used_bytes(0),
4122         _bytes_allocated_in_old_since_last_gc(0),
4123         _failure_used_words(0),
4124         _failure_waste_words(0),
4125         _rs_length(0),
4126         _regions_freed(0) { }
4127 
4128     void merge_stats(FreeCSetStats* other) {
4129       assert(other != NULL, "invariant");
4130       _before_used_bytes += other->_before_used_bytes;
4131       _after_used_bytes += other->_after_used_bytes;
4132       _bytes_allocated_in_old_since_last_gc += other->_bytes_allocated_in_old_since_last_gc;
4133       _failure_used_words += other->_failure_used_words;
4134       _failure_waste_words += other->_failure_waste_words;
4135       _rs_length += other->_rs_length;
4136       _regions_freed += other->_regions_freed;
4137     }
4138 
4139     void report(G1CollectedHeap* g1h, G1EvacuationInfo* evacuation_info) {
4140       evacuation_info->set_regions_freed(_regions_freed);
4141       evacuation_info->increment_collectionset_used_after(_after_used_bytes);
4142 
4143       g1h->decrement_summary_bytes(_before_used_bytes);
4144       g1h->alloc_buffer_stats(G1HeapRegionAttr::Old)->add_failure_used_and_waste(_failure_used_words, _failure_waste_words);
4145 
4146       G1Policy *policy = g1h->policy();
4147       policy->old_gen_alloc_tracker()->add_allocated_bytes_since_last_gc(_bytes_allocated_in_old_since_last_gc);
4148       policy->record_rs_length(_rs_length);
4149       policy->cset_regions_freed();
4150     }
4151 
4152     void account_failed_region(HeapRegion* r) {
4153       size_t used_words = r->marked_bytes() / HeapWordSize;
4154       _failure_used_words += used_words;
4155       _failure_waste_words += HeapRegion::GrainWords - used_words;
4156       _after_used_bytes += r->used();
4157 
4158       // When moving a young gen region to old gen, we "allocate" that whole
4159       // region there. This is in addition to any already evacuated objects.
4160       // Notify the policy about that. Old gen regions do not cause an
4161       // additional allocation: both the objects still in the region and the
4162       // ones already moved are accounted for elsewhere.
4163       if (r->is_young()) {
4164         _bytes_allocated_in_old_since_last_gc += HeapRegion::GrainBytes;
4165       }
4166     }
4167 
4168     void account_evacuated_region(HeapRegion* r) {
4169       _before_used_bytes += r->used();
4170       _regions_freed += 1;
4171     }
4172 
4173     void account_rs_length(HeapRegion* r) {
4174       _rs_length += r->rem_set()->occupied();
4175     }
4176   };
4177 
4178   // Closure applied to all regions in the collection set.
4179   class FreeCSetClosure : public HeapRegionClosure {
4180     // Helper to send JFR events for regions.
4181     class JFREventForRegion {
4182       EventGCPhaseParallel _event;
4183     public:
4184       JFREventForRegion(HeapRegion* region, uint worker_id) : _event() {
4185         _event.set_gcId(GCId::current());
4186         _event.set_gcWorkerId(worker_id);
4187         if (region->is_young()) {
4188           _event.set_name(G1GCPhaseTimes::phase_name(G1GCPhaseTimes::YoungFreeCSet));
4189         } else {
4190           _event.set_name(G1GCPhaseTimes::phase_name(G1GCPhaseTimes::NonYoungFreeCSet));
4191         }
4192       }
4193 
4194       ~JFREventForRegion() {
4195         _event.commit();
4196       }
4197     };
4198 
4199     // Helper to do timing for region work.
4200     class TimerForRegion {
4201       Tickspan& _time;
4202       Ticks     _start_time;
4203     public:
4204       TimerForRegion(Tickspan& time) : _time(time), _start_time(Ticks::now()) { }
4205       ~TimerForRegion() {
4206         _time += Ticks::now() - _start_time;
4207       }
4208     };
4209 
4210     // FreeCSetClosure members
4211     G1CollectedHeap* _g1h;
4212     const size_t*    _surviving_young_words;
4213     uint             _worker_id;
4214     Tickspan         _young_time;
4215     Tickspan         _non_young_time;
4216     FreeCSetStats*   _stats;
4217 
4218     void assert_in_cset(HeapRegion* r) {
4219       assert(r->young_index_in_cset() != 0 &&
4220              (uint)r->young_index_in_cset() <= _g1h->collection_set()->young_region_length(),
4221              "Young index %u is wrong for region %u of type %s with %u young regions",
4222              r->young_index_in_cset(), r->hrm_index(), r->get_type_str(), _g1h->collection_set()->young_region_length());
4223     }
4224 
4225     void handle_evacuated_region(HeapRegion* r) {
4226       assert(!r->is_empty(), "Region %u is an empty region in the collection set.", r->hrm_index());
4227       stats()->account_evacuated_region(r);
4228 
4229       // Free the region and and its remembered set.
4230       _g1h->free_region(r, NULL);
4231     }
4232 
4233     void handle_failed_region(HeapRegion* r) {
4234       // Do some allocation statistics accounting. Regions that failed evacuation
4235       // are always made old, so there is no need to update anything in the young
4236       // gen statistics, but we need to update old gen statistics.
4237       stats()->account_failed_region(r);
4238 
4239       // Update the region state due to the failed evacuation.
4240       r->handle_evacuation_failure();
4241 
4242       // Add region to old set, need to hold lock.
4243       MutexLocker x(OldSets_lock, Mutex::_no_safepoint_check_flag);
4244       _g1h->old_set_add(r);
4245     }
4246 
4247     Tickspan& timer_for_region(HeapRegion* r) {
4248       return r->is_young() ? _young_time : _non_young_time;
4249     }
4250 
4251     FreeCSetStats* stats() {
4252       return _stats;
4253     }
4254   public:
4255     FreeCSetClosure(const size_t* surviving_young_words,
4256                     uint worker_id,
4257                     FreeCSetStats* stats) :
4258         HeapRegionClosure(),
4259         _g1h(G1CollectedHeap::heap()),
4260         _surviving_young_words(surviving_young_words),
4261         _worker_id(worker_id),
4262         _young_time(),
4263         _non_young_time(),
4264         _stats(stats) { }
4265 
4266     virtual bool do_heap_region(HeapRegion* r) {
4267       assert(r->in_collection_set(), "Invariant: %u missing from CSet", r->hrm_index());
4268       JFREventForRegion event(r, _worker_id);
4269       TimerForRegion timer(timer_for_region(r));
4270 
4271       _g1h->clear_region_attr(r);
4272       stats()->account_rs_length(r);
4273 
4274       if (r->is_young()) {
4275         assert_in_cset(r);
4276         r->record_surv_words_in_group(_surviving_young_words[r->young_index_in_cset()]);
4277       }
4278 
4279       if (r->evacuation_failed()) {
4280         handle_failed_region(r);
4281       } else {
4282         handle_evacuated_region(r);
4283       }
4284       assert(!_g1h->is_on_master_free_list(r), "sanity");
4285 
4286       return false;
4287     }
4288 
4289     void report_timing(Tickspan parallel_time) {
4290       G1GCPhaseTimes* pt = _g1h->phase_times();
4291       pt->record_time_secs(G1GCPhaseTimes::ParFreeCSet, _worker_id, parallel_time.seconds());
4292       if (_young_time.value() > 0) {
4293         pt->record_time_secs(G1GCPhaseTimes::YoungFreeCSet, _worker_id, _young_time.seconds());
4294       }
4295       if (_non_young_time.value() > 0) {
4296         pt->record_time_secs(G1GCPhaseTimes::NonYoungFreeCSet, _worker_id, _non_young_time.seconds());
4297       }
4298     }
4299   };
4300 
4301   // G1FreeCollectionSetTask members
4302   G1CollectedHeap*  _g1h;
4303   G1EvacuationInfo* _evacuation_info;
4304   FreeCSetStats*    _worker_stats;
4305   HeapRegionClaimer _claimer;
4306   const size_t*     _surviving_young_words;
4307   uint              _active_workers;
4308 
4309   FreeCSetStats* worker_stats(uint worker) {
4310     return &_worker_stats[worker];
4311   }
4312 
4313   void report_statistics() {
4314     // Merge the accounting
4315     FreeCSetStats total_stats;
4316     for (uint worker = 0; worker < _active_workers; worker++) {
4317       total_stats.merge_stats(worker_stats(worker));
4318     }
4319     total_stats.report(_g1h, _evacuation_info);
4320   }
4321 
4322 public:
4323   G1FreeCollectionSetTask(G1EvacuationInfo* evacuation_info, const size_t* surviving_young_words, uint active_workers) :
4324       AbstractGangTask("G1 Free Collection Set"),
4325       _g1h(G1CollectedHeap::heap()),
4326       _evacuation_info(evacuation_info),
4327       _worker_stats(NEW_C_HEAP_ARRAY(FreeCSetStats, active_workers, mtGC)),
4328       _claimer(active_workers),
4329       _surviving_young_words(surviving_young_words),
4330       _active_workers(active_workers) {
4331     for (uint worker = 0; worker < active_workers; worker++) {
4332       ::new (&_worker_stats[worker]) FreeCSetStats();
4333     }
4334   }
4335 
4336   ~G1FreeCollectionSetTask() {
4337     Ticks serial_time = Ticks::now();
4338     report_statistics();
4339     for (uint worker = 0; worker < _active_workers; worker++) {
4340       _worker_stats[worker].~FreeCSetStats();
4341     }
4342     FREE_C_HEAP_ARRAY(FreeCSetStats, _worker_stats);
4343     _g1h->phase_times()->record_serial_free_cset_time_ms((Ticks::now() - serial_time).seconds() * 1000.0);
4344   }
4345 
4346   virtual void work(uint worker_id) {
4347     EventGCPhaseParallel event;
4348     Ticks start = Ticks::now();
4349     FreeCSetClosure cl(_surviving_young_words, worker_id, worker_stats(worker_id));
4350     _g1h->collection_set_par_iterate_all(&cl, &_claimer, worker_id);
4351 
4352     // Report the total parallel time along with some more detailed metrics.
4353     cl.report_timing(Ticks::now() - start);
4354     event.commit(GCId::current(), worker_id, G1GCPhaseTimes::phase_name(G1GCPhaseTimes::ParFreeCSet));
4355   }
4356 };
4357 
4358 void G1CollectedHeap::free_collection_set(G1CollectionSet* collection_set, G1EvacuationInfo& evacuation_info, const size_t* surviving_young_words) {
4359   _eden.clear();
4360 
4361   // The free collections set is split up in two tasks, the first
4362   // frees the collection set and records what regions are free,
4363   // and the second one rebuilds the free list. This proved to be
4364   // more efficient than adding a sorted list to another.
4365 
4366   Ticks free_cset_start_time = Ticks::now();
4367   {
4368     uint const num_cs_regions = _collection_set.region_length();
4369     uint const num_workers = clamp(num_cs_regions, 1u, workers()->active_workers());
4370     G1FreeCollectionSetTask cl(&evacuation_info, surviving_young_words, num_workers);
4371 
4372     log_debug(gc, ergo)("Running %s using %u workers for collection set length %u (%u)",
4373                         cl.name(), num_workers, num_cs_regions, num_regions());
4374     workers()->run_task(&cl, num_workers);
4375   }
4376 
4377   Ticks free_cset_end_time = Ticks::now();
4378   phase_times()->record_total_free_cset_time_ms((free_cset_end_time - free_cset_start_time).seconds() * 1000.0);
4379 
4380   // Now rebuild the free region list.
4381   hrm()->rebuild_free_list(workers());
4382   phase_times()->record_total_rebuild_freelist_time_ms((Ticks::now() - free_cset_end_time).seconds() * 1000.0);
4383 
4384   collection_set->clear();
4385 }
4386 
4387 class G1FreeHumongousRegionClosure : public HeapRegionClosure {
4388  private:
4389   FreeRegionList* _free_region_list;
4390   HeapRegionSet* _proxy_set;
4391   uint _humongous_objects_reclaimed;
4392   uint _humongous_regions_reclaimed;
4393   size_t _freed_bytes;
4394  public:
4395 
4396   G1FreeHumongousRegionClosure(FreeRegionList* free_region_list) :
4397     _free_region_list(free_region_list), _proxy_set(NULL), _humongous_objects_reclaimed(0), _humongous_regions_reclaimed(0), _freed_bytes(0) {
4398   }
4399 
4400   virtual bool do_heap_region(HeapRegion* r) {
4401     if (!r->is_starts_humongous()) {
4402       return false;
4403     }
4404 
4405     G1CollectedHeap* g1h = G1CollectedHeap::heap();
4406 
4407     oop obj = (oop)r->bottom();
4408     G1CMBitMap* next_bitmap = g1h->concurrent_mark()->next_mark_bitmap();
4409 
4410     // The following checks whether the humongous object is live are sufficient.
4411     // The main additional check (in addition to having a reference from the roots
4412     // or the young gen) is whether the humongous object has a remembered set entry.
4413     //
4414     // A humongous object cannot be live if there is no remembered set for it
4415     // because:
4416     // - there can be no references from within humongous starts regions referencing
4417     // the object because we never allocate other objects into them.
4418     // (I.e. there are no intra-region references that may be missed by the
4419     // remembered set)
4420     // - as soon there is a remembered set entry to the humongous starts region
4421     // (i.e. it has "escaped" to an old object) this remembered set entry will stay
4422     // until the end of a concurrent mark.
4423     //
4424     // It is not required to check whether the object has been found dead by marking
4425     // or not, in fact it would prevent reclamation within a concurrent cycle, as
4426     // all objects allocated during that time are considered live.
4427     // SATB marking is even more conservative than the remembered set.
4428     // So if at this point in the collection there is no remembered set entry,
4429     // nobody has a reference to it.
4430     // At the start of collection we flush all refinement logs, and remembered sets
4431     // are completely up-to-date wrt to references to the humongous object.
4432     //
4433     // Other implementation considerations:
4434     // - never consider object arrays at this time because they would pose
4435     // considerable effort for cleaning up the the remembered sets. This is
4436     // required because stale remembered sets might reference locations that
4437     // are currently allocated into.
4438     uint region_idx = r->hrm_index();
4439     if (!g1h->is_humongous_reclaim_candidate(region_idx) ||
4440         !r->rem_set()->is_empty()) {
4441       log_debug(gc, humongous)("Live humongous region %u object size " SIZE_FORMAT " start " PTR_FORMAT "  with remset " SIZE_FORMAT " code roots " SIZE_FORMAT " is marked %d reclaim candidate %d type array %d",
4442                                region_idx,
4443                                (size_t)obj->size() * HeapWordSize,
4444                                p2i(r->bottom()),
4445                                r->rem_set()->occupied(),
4446                                r->rem_set()->strong_code_roots_list_length(),
4447                                next_bitmap->is_marked(r->bottom()),
4448                                g1h->is_humongous_reclaim_candidate(region_idx),
4449                                obj->is_typeArray()
4450                               );
4451       return false;
4452     }
4453 
4454     guarantee(obj->is_typeArray(),
4455               "Only eagerly reclaiming type arrays is supported, but the object "
4456               PTR_FORMAT " is not.", p2i(r->bottom()));
4457 
4458     log_debug(gc, humongous)("Dead humongous region %u object size " SIZE_FORMAT " start " PTR_FORMAT " with remset " SIZE_FORMAT " code roots " SIZE_FORMAT " is marked %d reclaim candidate %d type array %d",
4459                              region_idx,
4460                              (size_t)obj->size() * HeapWordSize,
4461                              p2i(r->bottom()),
4462                              r->rem_set()->occupied(),
4463                              r->rem_set()->strong_code_roots_list_length(),
4464                              next_bitmap->is_marked(r->bottom()),
4465                              g1h->is_humongous_reclaim_candidate(region_idx),
4466                              obj->is_typeArray()
4467                             );
4468 
4469     G1ConcurrentMark* const cm = g1h->concurrent_mark();
4470     cm->humongous_object_eagerly_reclaimed(r);
4471     assert(!cm->is_marked_in_prev_bitmap(obj) && !cm->is_marked_in_next_bitmap(obj),
4472            "Eagerly reclaimed humongous region %u should not be marked at all but is in prev %s next %s",
4473            region_idx,
4474            BOOL_TO_STR(cm->is_marked_in_prev_bitmap(obj)),
4475            BOOL_TO_STR(cm->is_marked_in_next_bitmap(obj)));
4476     _humongous_objects_reclaimed++;
4477     do {
4478       HeapRegion* next = g1h->next_region_in_humongous(r);
4479       _freed_bytes += r->used();
4480       r->set_containing_set(NULL);
4481       _humongous_regions_reclaimed++;
4482       g1h->free_humongous_region(r, _free_region_list);
4483       r = next;
4484     } while (r != NULL);
4485 
4486     return false;
4487   }
4488 
4489   uint humongous_objects_reclaimed() {
4490     return _humongous_objects_reclaimed;
4491   }
4492 
4493   uint humongous_regions_reclaimed() {
4494     return _humongous_regions_reclaimed;
4495   }
4496 
4497   size_t bytes_freed() const {
4498     return _freed_bytes;
4499   }
4500 };
4501 
4502 void G1CollectedHeap::eagerly_reclaim_humongous_regions() {
4503   assert_at_safepoint_on_vm_thread();
4504 
4505   if (!G1EagerReclaimHumongousObjects ||
4506       (!_has_humongous_reclaim_candidates && !log_is_enabled(Debug, gc, humongous))) {
4507     phase_times()->record_fast_reclaim_humongous_time_ms(0.0, 0);
4508     return;
4509   }
4510 
4511   double start_time = os::elapsedTime();
4512 
4513   FreeRegionList local_cleanup_list("Local Humongous Cleanup List");
4514 
4515   G1FreeHumongousRegionClosure cl(&local_cleanup_list);
4516   heap_region_iterate(&cl);
4517 
4518   remove_from_old_sets(0, cl.humongous_regions_reclaimed());
4519 
4520   G1HRPrinter* hrp = hr_printer();
4521   if (hrp->is_active()) {
4522     FreeRegionListIterator iter(&local_cleanup_list);
4523     while (iter.more_available()) {
4524       HeapRegion* hr = iter.get_next();
4525       hrp->cleanup(hr);
4526     }
4527   }
4528 
4529   prepend_to_freelist(&local_cleanup_list);
4530   decrement_summary_bytes(cl.bytes_freed());
4531 
4532   phase_times()->record_fast_reclaim_humongous_time_ms((os::elapsedTime() - start_time) * 1000.0,
4533                                                        cl.humongous_objects_reclaimed());
4534 }
4535 
4536 class G1AbandonCollectionSetClosure : public HeapRegionClosure {
4537 public:
4538   virtual bool do_heap_region(HeapRegion* r) {
4539     assert(r->in_collection_set(), "Region %u must have been in collection set", r->hrm_index());
4540     G1CollectedHeap::heap()->clear_region_attr(r);
4541     r->clear_young_index_in_cset();
4542     return false;
4543   }
4544 };
4545 
4546 void G1CollectedHeap::abandon_collection_set(G1CollectionSet* collection_set) {
4547   G1AbandonCollectionSetClosure cl;
4548   collection_set_iterate_all(&cl);
4549 
4550   collection_set->clear();
4551   collection_set->stop_incremental_building();
4552 }
4553 
4554 bool G1CollectedHeap::is_old_gc_alloc_region(HeapRegion* hr) {
4555   return _allocator->is_retained_old_region(hr);
4556 }
4557 
4558 void G1CollectedHeap::set_region_short_lived_locked(HeapRegion* hr) {
4559   _eden.add(hr);
4560   _policy->set_region_eden(hr);
4561 }
4562 
4563 #ifdef ASSERT
4564 
4565 class NoYoungRegionsClosure: public HeapRegionClosure {
4566 private:
4567   bool _success;
4568 public:
4569   NoYoungRegionsClosure() : _success(true) { }
4570   bool do_heap_region(HeapRegion* r) {
4571     if (r->is_young()) {
4572       log_error(gc, verify)("Region [" PTR_FORMAT ", " PTR_FORMAT ") tagged as young",
4573                             p2i(r->bottom()), p2i(r->end()));
4574       _success = false;
4575     }
4576     return false;
4577   }
4578   bool success() { return _success; }
4579 };
4580 
4581 bool G1CollectedHeap::check_young_list_empty() {
4582   bool ret = (young_regions_count() == 0);
4583 
4584   NoYoungRegionsClosure closure;
4585   heap_region_iterate(&closure);
4586   ret = ret && closure.success();
4587 
4588   return ret;
4589 }
4590 
4591 #endif // ASSERT
4592 
4593 class TearDownRegionSetsClosure : public HeapRegionClosure {
4594   HeapRegionSet *_old_set;
4595 
4596 public:
4597   TearDownRegionSetsClosure(HeapRegionSet* old_set) : _old_set(old_set) { }
4598 
4599   bool do_heap_region(HeapRegion* r) {
4600     if (r->is_old()) {
4601       _old_set->remove(r);
4602     } else if(r->is_young()) {
4603       r->uninstall_surv_rate_group();
4604     } else {
4605       // We ignore free regions, we'll empty the free list afterwards.
4606       // We ignore humongous and archive regions, we're not tearing down these
4607       // sets.
4608       assert(r->is_archive() || r->is_free() || r->is_humongous(),
4609              "it cannot be another type");
4610     }
4611     return false;
4612   }
4613 
4614   ~TearDownRegionSetsClosure() {
4615     assert(_old_set->is_empty(), "post-condition");
4616   }
4617 };
4618 
4619 void G1CollectedHeap::tear_down_region_sets(bool free_list_only) {
4620   assert_at_safepoint_on_vm_thread();
4621 
4622   if (!free_list_only) {
4623     TearDownRegionSetsClosure cl(&_old_set);
4624     heap_region_iterate(&cl);
4625 
4626     // Note that emptying the _young_list is postponed and instead done as
4627     // the first step when rebuilding the regions sets again. The reason for
4628     // this is that during a full GC string deduplication needs to know if
4629     // a collected region was young or old when the full GC was initiated.
4630   }
4631   _hrm->remove_all_free_regions();
4632 }
4633 
4634 void G1CollectedHeap::increase_used(size_t bytes) {
4635   _summary_bytes_used += bytes;
4636 }
4637 
4638 void G1CollectedHeap::decrease_used(size_t bytes) {
4639   assert(_summary_bytes_used >= bytes,
4640          "invariant: _summary_bytes_used: " SIZE_FORMAT " should be >= bytes: " SIZE_FORMAT,
4641          _summary_bytes_used, bytes);
4642   _summary_bytes_used -= bytes;
4643 }
4644 
4645 void G1CollectedHeap::set_used(size_t bytes) {
4646   _summary_bytes_used = bytes;
4647 }
4648 
4649 class RebuildRegionSetsClosure : public HeapRegionClosure {
4650 private:
4651   bool _free_list_only;
4652 
4653   HeapRegionSet* _old_set;
4654   HeapRegionManager* _hrm;
4655 
4656   size_t _total_used;
4657 
4658 public:
4659   RebuildRegionSetsClosure(bool free_list_only,
4660                            HeapRegionSet* old_set,
4661                            HeapRegionManager* hrm) :
4662     _free_list_only(free_list_only),
4663     _old_set(old_set), _hrm(hrm), _total_used(0) {
4664     assert(_hrm->num_free_regions() == 0, "pre-condition");
4665     if (!free_list_only) {
4666       assert(_old_set->is_empty(), "pre-condition");
4667     }
4668   }
4669 
4670   bool do_heap_region(HeapRegion* r) {
4671     if (r->is_empty()) {
4672       assert(r->rem_set()->is_empty(), "Empty regions should have empty remembered sets.");
4673       // Add free regions to the free list
4674       r->set_free();
4675       _hrm->insert_into_free_list(r);
4676     } else if (!_free_list_only) {
4677       assert(r->rem_set()->is_empty(), "At this point remembered sets must have been cleared.");
4678 
4679       if (r->is_archive() || r->is_humongous()) {
4680         // We ignore archive and humongous regions. We left these sets unchanged.
4681       } else {
4682         assert(r->is_young() || r->is_free() || r->is_old(), "invariant");
4683         // We now move all (non-humongous, non-old, non-archive) regions to old gen, and register them as such.
4684         r->move_to_old();
4685         _old_set->add(r);
4686       }
4687       _total_used += r->used();
4688     }
4689 
4690     return false;
4691   }
4692 
4693   size_t total_used() {
4694     return _total_used;
4695   }
4696 };
4697 
4698 void G1CollectedHeap::rebuild_region_sets(bool free_list_only) {
4699   assert_at_safepoint_on_vm_thread();
4700 
4701   if (!free_list_only) {
4702     _eden.clear();
4703     _survivor.clear();
4704   }
4705 
4706   RebuildRegionSetsClosure cl(free_list_only, &_old_set, _hrm);
4707   heap_region_iterate(&cl);
4708 
4709   if (!free_list_only) {
4710     set_used(cl.total_used());
4711     if (_archive_allocator != NULL) {
4712       _archive_allocator->clear_used();
4713     }
4714   }
4715   assert_used_and_recalculate_used_equal(this);
4716 }
4717 
4718 // Methods for the mutator alloc region
4719 
4720 HeapRegion* G1CollectedHeap::new_mutator_alloc_region(size_t word_size,
4721                                                       bool force,
4722                                                       uint node_index) {
4723   assert_heap_locked_or_at_safepoint(true /* should_be_vm_thread */);
4724   bool should_allocate = policy()->should_allocate_mutator_region();
4725   if (force || should_allocate) {
4726     HeapRegion* new_alloc_region = new_region(word_size,
4727                                               HeapRegionType::Eden,
4728                                               false /* do_expand */,
4729                                               node_index);
4730     if (new_alloc_region != NULL) {
4731       set_region_short_lived_locked(new_alloc_region);
4732       _hr_printer.alloc(new_alloc_region, !should_allocate);
4733       _verifier->check_bitmaps("Mutator Region Allocation", new_alloc_region);
4734       _policy->remset_tracker()->update_at_allocate(new_alloc_region);
4735       return new_alloc_region;
4736     }
4737   }
4738   return NULL;
4739 }
4740 
4741 void G1CollectedHeap::retire_mutator_alloc_region(HeapRegion* alloc_region,
4742                                                   size_t allocated_bytes) {
4743   assert_heap_locked_or_at_safepoint(true /* should_be_vm_thread */);
4744   assert(alloc_region->is_eden(), "all mutator alloc regions should be eden");
4745 
4746   collection_set()->add_eden_region(alloc_region);
4747   increase_used(allocated_bytes);
4748   _eden.add_used_bytes(allocated_bytes);
4749   _hr_printer.retire(alloc_region);
4750 
4751   // We update the eden sizes here, when the region is retired,
4752   // instead of when it's allocated, since this is the point that its
4753   // used space has been recorded in _summary_bytes_used.
4754   g1mm()->update_eden_size();
4755 }
4756 
4757 // Methods for the GC alloc regions
4758 
4759 bool G1CollectedHeap::has_more_regions(G1HeapRegionAttr dest) {
4760   if (dest.is_old()) {
4761     return true;
4762   } else {
4763     return survivor_regions_count() < policy()->max_survivor_regions();
4764   }
4765 }
4766 
4767 HeapRegion* G1CollectedHeap::new_gc_alloc_region(size_t word_size, G1HeapRegionAttr dest, uint node_index) {
4768   assert(FreeList_lock->owned_by_self(), "pre-condition");
4769 
4770   if (!has_more_regions(dest)) {
4771     return NULL;
4772   }
4773 
4774   HeapRegionType type;
4775   if (dest.is_young()) {
4776     type = HeapRegionType::Survivor;
4777   } else {
4778     type = HeapRegionType::Old;
4779   }
4780 
4781   HeapRegion* new_alloc_region = new_region(word_size,
4782                                             type,
4783                                             true /* do_expand */,
4784                                             node_index);
4785 
4786   if (new_alloc_region != NULL) {
4787     if (type.is_survivor()) {
4788       new_alloc_region->set_survivor();
4789       _survivor.add(new_alloc_region);
4790       _verifier->check_bitmaps("Survivor Region Allocation", new_alloc_region);
4791     } else {
4792       new_alloc_region->set_old();
4793       _verifier->check_bitmaps("Old Region Allocation", new_alloc_region);
4794     }
4795     _policy->remset_tracker()->update_at_allocate(new_alloc_region);
4796     register_region_with_region_attr(new_alloc_region);
4797     _hr_printer.alloc(new_alloc_region);
4798     return new_alloc_region;
4799   }
4800   return NULL;
4801 }
4802 
4803 void G1CollectedHeap::retire_gc_alloc_region(HeapRegion* alloc_region,
4804                                              size_t allocated_bytes,
4805                                              G1HeapRegionAttr dest) {
4806   _bytes_used_during_gc += allocated_bytes;
4807   if (dest.is_old()) {
4808     old_set_add(alloc_region);
4809   } else {
4810     assert(dest.is_young(), "Retiring alloc region should be young (%d)", dest.type());
4811     _survivor.add_used_bytes(allocated_bytes);
4812   }
4813 
4814   bool const during_im = collector_state()->in_concurrent_start_gc();
4815   if (during_im && allocated_bytes > 0) {
4816     _cm->root_regions()->add(alloc_region->next_top_at_mark_start(), alloc_region->top());
4817   }
4818   _hr_printer.retire(alloc_region);
4819 }
4820 
4821 HeapRegion* G1CollectedHeap::alloc_highest_free_region() {
4822   bool expanded = false;
4823   uint index = _hrm->find_highest_free(&expanded);
4824 
4825   if (index != G1_NO_HRM_INDEX) {
4826     if (expanded) {
4827       log_debug(gc, ergo, heap)("Attempt heap expansion (requested address range outside heap bounds). region size: " SIZE_FORMAT "B",
4828                                 HeapRegion::GrainWords * HeapWordSize);
4829     }
4830     return _hrm->allocate_free_regions_starting_at(index, 1);
4831   }
4832   return NULL;
4833 }
4834 
4835 // Optimized nmethod scanning
4836 
4837 class RegisterNMethodOopClosure: public OopClosure {
4838   G1CollectedHeap* _g1h;
4839   nmethod* _nm;
4840 
4841   template <class T> void do_oop_work(T* p) {
4842     T heap_oop = RawAccess<>::oop_load(p);
4843     if (!CompressedOops::is_null(heap_oop)) {
4844       oop obj = CompressedOops::decode_not_null(heap_oop);
4845       HeapRegion* hr = _g1h->heap_region_containing(obj);
4846       assert(!hr->is_continues_humongous(),
4847              "trying to add code root " PTR_FORMAT " in continuation of humongous region " HR_FORMAT
4848              " starting at " HR_FORMAT,
4849              p2i(_nm), HR_FORMAT_PARAMS(hr), HR_FORMAT_PARAMS(hr->humongous_start_region()));
4850 
4851       // HeapRegion::add_strong_code_root_locked() avoids adding duplicate entries.
4852       hr->add_strong_code_root_locked(_nm);
4853     }
4854   }
4855 
4856 public:
4857   RegisterNMethodOopClosure(G1CollectedHeap* g1h, nmethod* nm) :
4858     _g1h(g1h), _nm(nm) {}
4859 
4860   void do_oop(oop* p)       { do_oop_work(p); }
4861   void do_oop(narrowOop* p) { do_oop_work(p); }
4862 };
4863 
4864 class UnregisterNMethodOopClosure: public OopClosure {
4865   G1CollectedHeap* _g1h;
4866   nmethod* _nm;
4867 
4868   template <class T> void do_oop_work(T* p) {
4869     T heap_oop = RawAccess<>::oop_load(p);
4870     if (!CompressedOops::is_null(heap_oop)) {
4871       oop obj = CompressedOops::decode_not_null(heap_oop);
4872       HeapRegion* hr = _g1h->heap_region_containing(obj);
4873       assert(!hr->is_continues_humongous(),
4874              "trying to remove code root " PTR_FORMAT " in continuation of humongous region " HR_FORMAT
4875              " starting at " HR_FORMAT,
4876              p2i(_nm), HR_FORMAT_PARAMS(hr), HR_FORMAT_PARAMS(hr->humongous_start_region()));
4877 
4878       hr->remove_strong_code_root(_nm);
4879     }
4880   }
4881 
4882 public:
4883   UnregisterNMethodOopClosure(G1CollectedHeap* g1h, nmethod* nm) :
4884     _g1h(g1h), _nm(nm) {}
4885 
4886   void do_oop(oop* p)       { do_oop_work(p); }
4887   void do_oop(narrowOop* p) { do_oop_work(p); }
4888 };
4889 
4890 void G1CollectedHeap::register_nmethod(nmethod* nm) {
4891   guarantee(nm != NULL, "sanity");
4892   RegisterNMethodOopClosure reg_cl(this, nm);
4893   nm->oops_do(&reg_cl);
4894 }
4895 
4896 void G1CollectedHeap::unregister_nmethod(nmethod* nm) {
4897   guarantee(nm != NULL, "sanity");
4898   UnregisterNMethodOopClosure reg_cl(this, nm);
4899   nm->oops_do(&reg_cl, true);
4900 }
4901 
4902 void G1CollectedHeap::purge_code_root_memory() {
4903   double purge_start = os::elapsedTime();
4904   G1CodeRootSet::purge();
4905   double purge_time_ms = (os::elapsedTime() - purge_start) * 1000.0;
4906   phase_times()->record_strong_code_root_purge_time(purge_time_ms);
4907 }
4908 
4909 class RebuildStrongCodeRootClosure: public CodeBlobClosure {
4910   G1CollectedHeap* _g1h;
4911 
4912 public:
4913   RebuildStrongCodeRootClosure(G1CollectedHeap* g1h) :
4914     _g1h(g1h) {}
4915 
4916   void do_code_blob(CodeBlob* cb) {
4917     nmethod* nm = (cb != NULL) ? cb->as_nmethod_or_null() : NULL;
4918     if (nm == NULL) {
4919       return;
4920     }
4921 
4922     _g1h->register_nmethod(nm);
4923   }
4924 };
4925 
4926 void G1CollectedHeap::rebuild_strong_code_roots() {
4927   RebuildStrongCodeRootClosure blob_cl(this);
4928   CodeCache::blobs_do(&blob_cl);
4929 }
4930 
4931 void G1CollectedHeap::initialize_serviceability() {
4932   _g1mm->initialize_serviceability();
4933 }
4934 
4935 MemoryUsage G1CollectedHeap::memory_usage() {
4936   return _g1mm->memory_usage();
4937 }
4938 
4939 GrowableArray<GCMemoryManager*> G1CollectedHeap::memory_managers() {
4940   return _g1mm->memory_managers();
4941 }
4942 
4943 GrowableArray<MemoryPool*> G1CollectedHeap::memory_pools() {
4944   return _g1mm->memory_pools();
4945 }