< prev index next >

src/share/vm/gc/g1/heapRegion.hpp

Print this page
rev 11265 : 8142749: HeapRegion::_predicted_bytes_to_copy is unused and can be removed
Reviewed-by: ?
Contributed-by: Vsevolod Tolstopyatov <qwwdfsad@gmail.com>

*** 314,327 **** // The predicted elapsed time that was added to total value // for the collection set. double _predicted_elapsed_time_ms; - // The predicted number of bytes to copy that was added to - // the total value for the collection set. - size_t _predicted_bytes_to_copy; - public: HeapRegion(uint hrm_index, G1BlockOffsetTable* bot, MemRegion mr); --- 314,323 ----
*** 555,567 **** void note_self_forwarding_removal_start(bool during_initial_mark, bool during_conc_mark); // Notify the region that we have finished processing self-forwarded // objects during evac failure handling. ! void note_self_forwarding_removal_end(bool during_initial_mark, ! bool during_conc_mark, ! size_t marked_bytes); // Returns "false" iff no object in the region was allocated when the // last mark phase ended. bool is_marked() { return _prev_top_at_mark_start != bottom(); } --- 551,561 ---- void note_self_forwarding_removal_start(bool during_initial_mark, bool during_conc_mark); // Notify the region that we have finished processing self-forwarded // objects during evac failure handling. ! void note_self_forwarding_removal_end(size_t marked_bytes); // Returns "false" iff no object in the region was allocated when the // last mark phase ended. bool is_marked() { return _prev_top_at_mark_start != bottom(); }
*** 657,677 **** if (b) { _next_marked_bytes = 0; } } - // Requires that "mr" be entirely within the region. - // Apply "cl->do_object" to all objects that intersect with "mr". - // If the iteration encounters an unparseable portion of the region, - // or if "cl->abort()" is true after a closure application, - // terminate the iteration and return the address of the start of the - // subregion that isn't done. (The two can be distinguished by querying - // "cl->abort()".) Return of "NULL" indicates that the iteration - // completed. - HeapWord* - object_iterate_mem_careful(MemRegion mr, ObjectClosure* cl); - // filter_young: if true and the region is a young region then we // skip the iteration. // card_ptr: if not NULL, and we decide that the card is not young // and we iterate over it, we'll clean the card before we start the // iteration. --- 651,660 ----
*** 681,704 **** bool filter_young, jbyte* card_ptr); size_t recorded_rs_length() const { return _recorded_rs_length; } double predicted_elapsed_time_ms() const { return _predicted_elapsed_time_ms; } - size_t predicted_bytes_to_copy() const { return _predicted_bytes_to_copy; } void set_recorded_rs_length(size_t rs_length) { _recorded_rs_length = rs_length; } void set_predicted_elapsed_time_ms(double ms) { _predicted_elapsed_time_ms = ms; } - void set_predicted_bytes_to_copy(size_t bytes) { - _predicted_bytes_to_copy = bytes; - } - virtual CompactibleSpace* next_compaction_space() const; virtual void reset_after_compaction(); // Routines for managing a list of code roots (attached to the --- 664,682 ----
< prev index next >