src/share/vm/gc_implementation/parallelScavenge/psAdaptiveSizePolicy.cpp

rev 5732 : [mq]: comments2

*** 480,490 ****
    //   adjust one generation at a time.
    // else
    //   adjust down the total heap size.  Adjust down the larger of the
    //   generations.
  
!   // Add some checks for a threshhold for a change.  For example,
    // a change less than the necessary alignment is probably not worth
    // attempting.
  
    if ((_avg_minor_pause->padded_average() > gc_pause_goal_sec()) ||
        (_avg_major_pause->padded_average() > gc_pause_goal_sec())) {
--- 480,490 ----
    //   adjust one generation at a time.
    // else
    //   adjust down the total heap size.  Adjust down the larger of the
    //   generations.
  
!   // Add some checks for a threshold for a change.  For example,
    // a change less than the necessary alignment is probably not worth
    // attempting.
  
    if ((_avg_minor_pause->padded_average() > gc_pause_goal_sec()) ||
        (_avg_major_pause->padded_average() > gc_pause_goal_sec())) {
*** 1159,1169 ****
      // Keep running averages on how much survived
  
      // We use the tenuring threshold to equalize the cost of major
      // and minor collections.
      // ThresholdTolerance is used to indicate how sensitive the
!     // tenuring threshold is to differences in cost betweent the
      // collection types.
  
      // Get the times of interest. This involves a little work, so
      // we cache the values here.
      const double major_cost = major_gc_cost();
--- 1159,1169 ----
      // Keep running averages on how much survived
  
      // We use the tenuring threshold to equalize the cost of major
      // and minor collections.
      // ThresholdTolerance is used to indicate how sensitive the
!     // tenuring threshold is to differences in cost between the
      // collection types.
  
      // Get the times of interest. This involves a little work, so
      // we cache the values here.
      const double major_cost = major_gc_cost();