337 338 // Printing 339 virtual const char* name() const; 340 virtual const char* short_name() const { return "DefNew"; } 341 342 void print_on(outputStream* st) const; 343 344 void verify(); 345 346 bool promo_failure_scan_is_complete() const { 347 return _promo_failure_scan_stack.is_empty(); 348 } 349 350 protected: 351 // If clear_space is true, clear the survivor spaces. Eden is 352 // cleared if the minimum size of eden is 0. If mangle_space 353 // is true, also mangle the space in debug mode. 354 void compute_space_boundaries(uintx minimum_eden_size, 355 bool clear_space, 356 bool mangle_space); 357 // Scavenge support 358 void swap_spaces(); 359 }; 360 361 #endif // SHARE_VM_GC_SERIAL_DEFNEWGENERATION_HPP | 337 338 // Printing 339 virtual const char* name() const; 340 virtual const char* short_name() const { return "DefNew"; } 341 342 void print_on(outputStream* st) const; 343 344 void verify(); 345 346 bool promo_failure_scan_is_complete() const { 347 return _promo_failure_scan_stack.is_empty(); 348 } 349 350 protected: 351 // If clear_space is true, clear the survivor spaces. Eden is 352 // cleared if the minimum size of eden is 0. If mangle_space 353 // is true, also mangle the space in debug mode. 354 void compute_space_boundaries(uintx minimum_eden_size, 355 bool clear_space, 356 bool mangle_space); 357 358 // Return adjusted new size for NewSizeThreadIncrease. 359 // If any overflow happens, revert to previous new size. 360 size_t adjust_for_thread_increase(size_t new_size_candidate, 361 size_t new_size_before, 362 size_t alignment) const; 363 364 365 // Scavenge support 366 void swap_spaces(); 367 }; 368 369 #endif // SHARE_VM_GC_SERIAL_DEFNEWGENERATION_HPP |