/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/
#include "precompiled.hpp"
#include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
#include "gc_implementation/g1/g1GCPhaseTimes.hpp"
#include "gc_implementation/g1/g1Log.hpp"
// Helper class for avoiding interleaved logging
private:
int _indent_level;
int _cur;
if (res != -1) {
} else {
}
}
public:
}
}
#ifndef PRODUCT
~LineBuffer() {
assert(_cur == _indent_level * INDENT_CHARS, "pending data in buffer - append_and_print_cr() not called?");
}
#endif
}
}
};
template <class T>
if (_length == 1) {
// No need for min, max, average and sum for only one worker
return;
}
T sum = 0;
}
}
}
if (_print_sum) {
// for things like the start and end times the sum is not
// that relevant
}
}
#ifdef ASSERT
template <class T>
_data[i] = (T)_uninitialized;
}
}
template <class T>
i, (double)_data[i], (double)_uninitialized));
}
}
#endif
{
}
assert(active_gc_threads <= _max_gc_threads, "The number of active threads must be <= the max nubmer of threads");
}
for (uint i = 0; i < _active_gc_threads; i++) {
}
}
}
}
// Subtract the root region scanning wait time. It's initialized to
// zero at the start of the pause.
// Now subtract the time taken to fix up roots in generated code
// Subtract the time taken to clean the card table from the
// current value of "other time"
return misc_time_ms;
}
if (_root_region_scan_wait_time_ms > 0.0) {
}
if (G1CollectedHeap::use_parallel_gc_threads()) {
}
}
} else {
}
}
if (_cur_verify_before_time_ms > 0.0) {
}
if (_cur_verify_after_time_ms > 0.0) {
}
}