src/share/vm/gc_implementation/shared/adaptiveSizePolicy.cpp

rev 5732 : [mq]: comments2

*** 119,129 ****
      MAX2((uintx) GCWorkersPerJavaThread * application_workers,
           min_workers);
  
    // Choose a number of GC threads based on the current size
    // of the heap.  This may be complicated because the size of
!   // the heap depends on factors such as the thoughput goal.
    // Still a large heap should be collected by more GC threads.
    active_workers_by_heap_size =
        MAX2((size_t) 2U, Universe::heap()->capacity() / HeapSizePerGCThread);
  
    uintx max_active_workers =
--- 119,129 ----
      MAX2((uintx) GCWorkersPerJavaThread * application_workers,
           min_workers);
  
    // Choose a number of GC threads based on the current size
    // of the heap.  This may be complicated because the size of
!   // the heap depends on factors such as the throughput goal.
    // Still a large heap should be collected by more GC threads.
    active_workers_by_heap_size =
        MAX2((size_t) 2U, Universe::heap()->capacity() / HeapSizePerGCThread);
  
    uintx max_active_workers =
*** 443,453 ****
    // young gen or the average of the live in the young gen.
    // If the current value drops quickly, that should be taken
    // into account (i.e., don't trigger if the amount of free
    // space has suddenly jumped up).  If the current is much
    // higher than the average, use the average since it represents
!   // the longer term behavor.
    const size_t live_in_eden =
      MIN2(eden_live, (size_t) avg_eden_live()->average());
    const size_t free_in_eden = max_eden_size > live_in_eden ?
      max_eden_size - live_in_eden : 0;
    const size_t free_in_old_gen = (size_t)(max_old_gen_size - avg_old_live()->average());
--- 443,453 ----
    // young gen or the average of the live in the young gen.
    // If the current value drops quickly, that should be taken
    // into account (i.e., don't trigger if the amount of free
    // space has suddenly jumped up).  If the current is much
    // higher than the average, use the average since it represents
!   // the longer term behavior.
    const size_t live_in_eden =
      MIN2(eden_live, (size_t) avg_eden_live()->average());
    const size_t free_in_eden = max_eden_size > live_in_eden ?
      max_eden_size - live_in_eden : 0;
    const size_t free_in_old_gen = (size_t)(max_old_gen_size - avg_old_live()->average());