archive/jdk
1
0
Fork 0
mirror of https://github.com/openjdk/jdk.git synced 2025-08-26 14:24:46 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

8151605: Change warning() to log_warning(gc) in the GC code

Browse source 
Reviewed-by: jwilhelm, jmasa
This commit is contained in:
Bengt Rutisson 2016-03-11 11:34:22 +01:00
parent 608079eed1
commit c4916d0f05
17 changed files with 62 additions and 66 deletions
Download patch file Download diff file Expand all files Collapse all files

19
hotspot/src/share/vm/gc/cms/concurrentMarkSweepGeneration.cpp
View file

@ -502,7 +502,7 @@ CMSCollector::CMSCollector(ConcurrentMarkSweepGeneration* cmsGen,
{ {
MutexLockerEx x(_markBitMap.lock(), Mutex::_no_safepoint_check_flag); MutexLockerEx x(_markBitMap.lock(), Mutex::_no_safepoint_check_flag);
if (!_markBitMap.allocate(_span)) { if (!_markBitMap.allocate(_span)) {
warning("Failed to allocate CMS Bit Map"); log_warning(gc)("Failed to allocate CMS Bit Map");
return; return;
} }
assert(_markBitMap.covers(_span), "_markBitMap inconsistency?"); assert(_markBitMap.covers(_span), "_markBitMap inconsistency?");
@ -513,7 +513,7 @@ CMSCollector::CMSCollector(ConcurrentMarkSweepGeneration* cmsGen,
} }
if (!_markStack.allocate(MarkStackSize)) { if (!_markStack.allocate(MarkStackSize)) {
warning("Failed to allocate CMS Marking Stack"); log_warning(gc)("Failed to allocate CMS Marking Stack");
return; return;
} }
@ -527,8 +527,7 @@ CMSCollector::CMSCollector(ConcurrentMarkSweepGeneration* cmsGen,
_conc_workers = new YieldingFlexibleWorkGang("CMS Thread", _conc_workers = new YieldingFlexibleWorkGang("CMS Thread",
ConcGCThreads, true); ConcGCThreads, true);
if (_conc_workers == NULL) { if (_conc_workers == NULL) {
warning("GC/CMS: _conc_workers allocation failure: " log_warning(gc)("GC/CMS: _conc_workers allocation failure: forcing -CMSConcurrentMTEnabled");
"forcing -CMSConcurrentMTEnabled");
CMSConcurrentMTEnabled = false; CMSConcurrentMTEnabled = false;
} else { } else {
_conc_workers->initialize_workers(); _conc_workers->initialize_workers();
@ -559,7 +558,7 @@ CMSCollector::CMSCollector(ConcurrentMarkSweepGeneration* cmsGen,
&& num_queues > 0) { && num_queues > 0) {
_task_queues = new OopTaskQueueSet(num_queues); _task_queues = new OopTaskQueueSet(num_queues);
if (_task_queues == NULL) { if (_task_queues == NULL) {
warning("task_queues allocation failure."); log_warning(gc)("task_queues allocation failure.");
return; return;
} }
_hash_seed = NEW_C_HEAP_ARRAY(int, num_queues, mtGC); _hash_seed = NEW_C_HEAP_ARRAY(int, num_queues, mtGC);
@ -567,7 +566,7 @@ CMSCollector::CMSCollector(ConcurrentMarkSweepGeneration* cmsGen,
for (i = 0; i < num_queues; i++) { for (i = 0; i < num_queues; i++) {
PaddedOopTaskQueue *q = new PaddedOopTaskQueue(); PaddedOopTaskQueue *q = new PaddedOopTaskQueue();
if (q == NULL) { if (q == NULL) {
warning("work_queue allocation failure."); log_warning(gc)("work_queue allocation failure.");
return; return;
} }
_task_queues->register_queue(i, q); _task_queues->register_queue(i, q);
@ -5657,13 +5656,13 @@ bool CMSBitMap::allocate(MemRegion mr) {
ReservedSpace brs(ReservedSpace::allocation_align_size_up( ReservedSpace brs(ReservedSpace::allocation_align_size_up(
(_bmWordSize >> (_shifter + LogBitsPerByte)) + 1)); (_bmWordSize >> (_shifter + LogBitsPerByte)) + 1));
if (!brs.is_reserved()) { if (!brs.is_reserved()) {
warning("CMS bit map allocation failure"); log_warning(gc)("CMS bit map allocation failure");
return false; return false;
} }
// For now we'll just commit all of the bit map up front. // For now we'll just commit all of the bit map up front.
// Later on we'll try to be more parsimonious with swap. // Later on we'll try to be more parsimonious with swap.
if (!_virtual_space.initialize(brs, brs.size())) { if (!_virtual_space.initialize(brs, brs.size())) {
warning("CMS bit map backing store failure"); log_warning(gc)("CMS bit map backing store failure");
return false; return false;
} }
assert(_virtual_space.committed_size() == brs.size(), assert(_virtual_space.committed_size() == brs.size(),
@ -5749,11 +5748,11 @@ bool CMSMarkStack::allocate(size_t size) {
ReservedSpace rs(ReservedSpace::allocation_align_size_up( ReservedSpace rs(ReservedSpace::allocation_align_size_up(
size * sizeof(oop))); size * sizeof(oop)));
if (!rs.is_reserved()) { if (!rs.is_reserved()) {
warning("CMSMarkStack allocation failure"); log_warning(gc)("CMSMarkStack allocation failure");
return false; return false;
} }
if (!_virtual_space.initialize(rs, rs.size())) { if (!_virtual_space.initialize(rs, rs.size())) {
warning("CMSMarkStack backing store failure"); log_warning(gc)("CMSMarkStack backing store failure");
return false; return false;
} }
assert(_virtual_space.committed_size() == rs.size(), assert(_virtual_space.committed_size() == rs.size(),

6
hotspot/src/share/vm/gc/cms/concurrentMarkSweepThread.cpp
View file

@ -1,5 +1,5 @@
/* /*
* Copyright (c) 2001, 2015, Oracle and/or its affiliates. All rights reserved. * Copyright (c) 2001, 2016, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
* *
* This code is free software; you can redistribute it and/or modify it * This code is free software; you can redistribute it and/or modify it
@ -96,7 +96,7 @@ void ConcurrentMarkSweepThread::run() {
// From this time Thread::current() should be working. // From this time Thread::current() should be working.
assert(this == Thread::current(), "just checking"); assert(this == Thread::current(), "just checking");
if (BindCMSThreadToCPU && !os::bind_to_processor(CPUForCMSThread)) { if (BindCMSThreadToCPU && !os::bind_to_processor(CPUForCMSThread)) {
warning("Couldn't bind CMS thread to processor " UINTX_FORMAT, CPUForCMSThread); log_warning(gc)("Couldn't bind CMS thread to processor " UINTX_FORMAT, CPUForCMSThread);
} }
// Wait until Universe::is_fully_initialized() // Wait until Universe::is_fully_initialized()
{ {
@ -358,7 +358,7 @@ void ConcurrentMarkSweepThread::wait_on_cms_lock_for_scavenge(long t_millis) {
// Too many loops warning // Too many loops warning
if(++loop_count == 0) { if(++loop_count == 0) {
warning("wait_on_cms_lock_for_scavenge() has looped %u times", loop_count - 1); log_warning(gc)("wait_on_cms_lock_for_scavenge() has looped %u times", loop_count - 1);
} }
} }
} }

2
hotspot/src/share/vm/gc/cms/concurrentMarkSweepThread.hpp
View file

@ -170,7 +170,7 @@ class CMSLoopCountWarn: public StackObj {
inline void tick() { inline void tick() {
_ticks++; _ticks++;
if (CMSLoopWarn && _ticks % _threshold == 0) { if (CMSLoopWarn && _ticks % _threshold == 0) {
warning("%s has looped " INTX_FORMAT " times %s", _src, _ticks, _msg); log_warning(gc)("%s has looped " INTX_FORMAT " times %s", _src, _ticks, _msg);
} }
} }
}; };

6
hotspot/src/share/vm/gc/g1/g1CollectedHeap.cpp
View file

@ -567,7 +567,7 @@ G1CollectedHeap::mem_allocate(size_t word_size,
// Give a warning if we seem to be looping forever. // Give a warning if we seem to be looping forever.
if ((QueuedAllocationWarningCount > 0) && if ((QueuedAllocationWarningCount > 0) &&
(try_count % QueuedAllocationWarningCount == 0)) { (try_count % QueuedAllocationWarningCount == 0)) {
warning("G1CollectedHeap::mem_allocate retries %d times", try_count); log_warning(gc)("G1CollectedHeap::mem_allocate retries %d times", try_count);
} }
} }
@ -676,7 +676,7 @@ HeapWord* G1CollectedHeap::attempt_allocation_slow(size_t word_size,
// Give a warning if we seem to be looping forever. // Give a warning if we seem to be looping forever.
if ((QueuedAllocationWarningCount > 0) && if ((QueuedAllocationWarningCount > 0) &&
(try_count % QueuedAllocationWarningCount == 0)) { (try_count % QueuedAllocationWarningCount == 0)) {
warning("G1CollectedHeap::attempt_allocation_slow() " log_warning(gc)("G1CollectedHeap::attempt_allocation_slow() "
"retries %d times", try_count); "retries %d times", try_count);
} }
} }
@ -1092,7 +1092,7 @@ HeapWord* G1CollectedHeap::attempt_allocation_humongous(size_t word_size,
if ((QueuedAllocationWarningCount > 0) && if ((QueuedAllocationWarningCount > 0) &&
(try_count % QueuedAllocationWarningCount == 0)) { (try_count % QueuedAllocationWarningCount == 0)) {
warning("G1CollectedHeap::attempt_allocation_humongous() " log_warning(gc)("G1CollectedHeap::attempt_allocation_humongous() "
"retries %d times", try_count); "retries %d times", try_count);
} }
} }

15
hotspot/src/share/vm/gc/g1/g1ConcurrentMark.cpp
View file

@ -203,12 +203,12 @@ bool G1CMMarkStack::allocate(size_t capacity) {
// allocate a stack of the requisite depth // allocate a stack of the requisite depth
ReservedSpace rs(ReservedSpace::allocation_align_size_up(capacity * sizeof(oop))); ReservedSpace rs(ReservedSpace::allocation_align_size_up(capacity * sizeof(oop)));
if (!rs.is_reserved()) { if (!rs.is_reserved()) {
warning("ConcurrentMark MarkStack allocation failure"); log_warning(gc)("ConcurrentMark MarkStack allocation failure");
return false; return false;
} }
MemTracker::record_virtual_memory_type((address)rs.base(), mtGC); MemTracker::record_virtual_memory_type((address)rs.base(), mtGC);
if (!_virtual_space.initialize(rs, rs.size())) { if (!_virtual_space.initialize(rs, rs.size())) {
warning("ConcurrentMark MarkStack backing store failure"); log_warning(gc)("ConcurrentMark MarkStack backing store failure");
// Release the virtual memory reserved for the marking stack // Release the virtual memory reserved for the marking stack
rs.release(); rs.release();
return false; return false;
@ -478,8 +478,7 @@ G1ConcurrentMark::G1ConcurrentMark(G1CollectedHeap* g1h, G1RegionToSpaceMapper*
_root_regions.init(_g1h, this); _root_regions.init(_g1h, this);
if (ConcGCThreads > ParallelGCThreads) { if (ConcGCThreads > ParallelGCThreads) {
warning("Can't have more ConcGCThreads (%u) " log_warning(gc)("Can't have more ConcGCThreads (%u) than ParallelGCThreads (%u).",
"than ParallelGCThreads (%u).",
ConcGCThreads, ParallelGCThreads); ConcGCThreads, ParallelGCThreads);
return; return;
} }
@ -534,7 +533,7 @@ G1ConcurrentMark::G1ConcurrentMark(G1CollectedHeap* g1h, G1RegionToSpaceMapper*
// Verify that the calculated value for MarkStackSize is in range. // Verify that the calculated value for MarkStackSize is in range.
// It would be nice to use the private utility routine from Arguments. // It would be nice to use the private utility routine from Arguments.
if (!(mark_stack_size >= 1 && mark_stack_size <= MarkStackSizeMax)) { if (!(mark_stack_size >= 1 && mark_stack_size <= MarkStackSizeMax)) {
warning("Invalid value calculated for MarkStackSize (" SIZE_FORMAT "): " log_warning(gc)("Invalid value calculated for MarkStackSize (" SIZE_FORMAT "): "
"must be between 1 and " SIZE_FORMAT, "must be between 1 and " SIZE_FORMAT,
mark_stack_size, MarkStackSizeMax); mark_stack_size, MarkStackSizeMax);
return; return;
@ -545,14 +544,14 @@ G1ConcurrentMark::G1ConcurrentMark(G1CollectedHeap* g1h, G1RegionToSpaceMapper*
if (FLAG_IS_CMDLINE(MarkStackSize)) { if (FLAG_IS_CMDLINE(MarkStackSize)) {
if (FLAG_IS_DEFAULT(MarkStackSizeMax)) { if (FLAG_IS_DEFAULT(MarkStackSizeMax)) {
if (!(MarkStackSize >= 1 && MarkStackSize <= MarkStackSizeMax)) { if (!(MarkStackSize >= 1 && MarkStackSize <= MarkStackSizeMax)) {
warning("Invalid value specified for MarkStackSize (" SIZE_FORMAT "): " log_warning(gc)("Invalid value specified for MarkStackSize (" SIZE_FORMAT "): "
"must be between 1 and " SIZE_FORMAT, "must be between 1 and " SIZE_FORMAT,
MarkStackSize, MarkStackSizeMax); MarkStackSize, MarkStackSizeMax);
return; return;
} }
} else if (FLAG_IS_CMDLINE(MarkStackSizeMax)) { } else if (FLAG_IS_CMDLINE(MarkStackSizeMax)) {
if (!(MarkStackSize >= 1 && MarkStackSize <= MarkStackSizeMax)) { if (!(MarkStackSize >= 1 && MarkStackSize <= MarkStackSizeMax)) {
warning("Invalid value specified for MarkStackSize (" SIZE_FORMAT ")" log_warning(gc)("Invalid value specified for MarkStackSize (" SIZE_FORMAT ")"
" or for MarkStackSizeMax (" SIZE_FORMAT ")", " or for MarkStackSizeMax (" SIZE_FORMAT ")",
MarkStackSize, MarkStackSizeMax); MarkStackSize, MarkStackSizeMax);
return; return;
@ -562,7 +561,7 @@ G1ConcurrentMark::G1ConcurrentMark(G1CollectedHeap* g1h, G1RegionToSpaceMapper*
} }
if (!_markStack.allocate(MarkStackSize)) { if (!_markStack.allocate(MarkStackSize)) {
warning("Failed to allocate CM marking stack"); log_warning(gc)("Failed to allocate CM marking stack");
return; return;
} }

4
hotspot/src/share/vm/gc/parallel/gcTaskThread.cpp
View file

@ -1,5 +1,5 @@
/* /*
* Copyright (c) 2002, 2015, Oracle and/or its affiliates. All rights reserved. * Copyright (c) 2002, 2016, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
* *
* This code is free software; you can redistribute it and/or modify it * This code is free software; you can redistribute it and/or modify it
@ -113,7 +113,7 @@ void GCTaskThread::run() {
} }
if (!os::bind_to_processor(processor_id())) { if (!os::bind_to_processor(processor_id())) {
DEBUG_ONLY( DEBUG_ONLY(
warning("Couldn't bind GCTaskThread %u to processor %u", log_warning(gc)("Couldn't bind GCTaskThread %u to processor %u",
which(), processor_id()); which(), processor_id());
) )
} }

4
hotspot/src/share/vm/gc/parallel/parallelScavengeHeap.cpp
View file

@ -325,8 +325,8 @@ HeapWord* ParallelScavengeHeap::mem_allocate(
loop_count++; loop_count++;
if ((result == NULL) && (QueuedAllocationWarningCount > 0) && if ((result == NULL) && (QueuedAllocationWarningCount > 0) &&
(loop_count % QueuedAllocationWarningCount == 0)) { (loop_count % QueuedAllocationWarningCount == 0)) {
warning("ParallelScavengeHeap::mem_allocate retries %d times \n\t" log_warning(gc)("ParallelScavengeHeap::mem_allocate retries %d times", loop_count);
" size=" SIZE_FORMAT, loop_count, size); log_warning(gc)("\tsize=" SIZE_FORMAT, size);
} }
} }

2
hotspot/src/share/vm/gc/parallel/psMarkSweep.cpp
View file

@ -638,7 +638,7 @@ jlong PSMarkSweep::millis_since_last_gc() {
jlong ret_val = now - _time_of_last_gc; jlong ret_val = now - _time_of_last_gc;
// XXX See note in genCollectedHeap::millis_since_last_gc(). // XXX See note in genCollectedHeap::millis_since_last_gc().
if (ret_val < 0) { if (ret_val < 0) {
NOT_PRODUCT(warning("time warp: " JLONG_FORMAT, ret_val);) NOT_PRODUCT(log_warning(gc)("time warp: " JLONG_FORMAT, ret_val);)
return 0; return 0;
} }
return ret_val; return ret_val;

2
hotspot/src/share/vm/gc/parallel/psOldGen.cpp
View file

@ -309,7 +309,7 @@ bool PSOldGen::expand_to_reserved() {
const size_t remaining_bytes = virtual_space()->uncommitted_size(); const size_t remaining_bytes = virtual_space()->uncommitted_size();
if (remaining_bytes > 0) { if (remaining_bytes > 0) {
result = expand_by(remaining_bytes); result = expand_by(remaining_bytes);
DEBUG_ONLY(if (!result) warning("grow to reserve failed")); DEBUG_ONLY(if (!result) log_warning(gc)("grow to reserve failed"));
} }
return result; return result;
} }

8
hotspot/src/share/vm/gc/parallel/psParallelCompact.cpp
View file

@ -2467,8 +2467,7 @@ void PSParallelCompact::verify_complete(SpaceId space_id) {
for (cur_region = beg_region; cur_region < new_top_region; ++cur_region) { for (cur_region = beg_region; cur_region < new_top_region; ++cur_region) {
const RegionData* const c = sd.region(cur_region); const RegionData* const c = sd.region(cur_region);
if (!c->completed()) { if (!c->completed()) {
warning("region " SIZE_FORMAT " not filled: " log_warning(gc)("region " SIZE_FORMAT " not filled: destination_count=%u",
"destination_count=%u",
cur_region, c->destination_count()); cur_region, c->destination_count());
issued_a_warning = true; issued_a_warning = true;
} }
@ -2477,8 +2476,7 @@ void PSParallelCompact::verify_complete(SpaceId space_id) {
for (cur_region = new_top_region; cur_region < old_top_region; ++cur_region) { for (cur_region = new_top_region; cur_region < old_top_region; ++cur_region) {
const RegionData* const c = sd.region(cur_region); const RegionData* const c = sd.region(cur_region);
if (!c->available()) { if (!c->available()) {
warning("region " SIZE_FORMAT " not empty: " log_warning(gc)("region " SIZE_FORMAT " not empty: destination_count=%u",
"destination_count=%u",
cur_region, c->destination_count()); cur_region, c->destination_count());
issued_a_warning = true; issued_a_warning = true;
} }
@ -3013,7 +3011,7 @@ jlong PSParallelCompact::millis_since_last_gc() {
jlong ret_val = now - _time_of_last_gc; jlong ret_val = now - _time_of_last_gc;
// XXX See note in genCollectedHeap::millis_since_last_gc(). // XXX See note in genCollectedHeap::millis_since_last_gc().
if (ret_val < 0) { if (ret_val < 0) {
NOT_PRODUCT(warning("time warp: " JLONG_FORMAT, ret_val);) NOT_PRODUCT(log_warning(gc)("time warp: " JLONG_FORMAT, ret_val);)
return 0; return 0;
} }
return ret_val; return ret_val;

4
hotspot/src/share/vm/gc/shared/cardGeneration.cpp
View file

@ -1,5 +1,5 @@
/* /*
* Copyright (c) 2014, 2015, Oracle and/or its affiliates. All rights reserved. * Copyright (c) 2014, 2016, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
* *
* This code is free software; you can redistribute it and/or modify it * This code is free software; you can redistribute it and/or modify it
@ -144,7 +144,7 @@ bool CardGeneration::grow_to_reserved() {
const size_t remaining_bytes = _virtual_space.uncommitted_size(); const size_t remaining_bytes = _virtual_space.uncommitted_size();
if (remaining_bytes > 0) { if (remaining_bytes > 0) {
success = grow_by(remaining_bytes); success = grow_by(remaining_bytes);
DEBUG_ONLY(if (!success) warning("grow to reserved failed");) DEBUG_ONLY(if (!success) log_warning(gc)("grow to reserved failed");)
} }
return success; return success;
} }

8
hotspot/src/share/vm/gc/shared/cardTableRS.cpp
View file

@ -1,5 +1,5 @@
/* /*
* Copyright (c) 2001, 2015, Oracle and/or its affiliates. All rights reserved. * Copyright (c) 2001, 2016, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
* *
* This code is free software; you can redistribute it and/or modify it * This code is free software; you can redistribute it and/or modify it
@ -325,17 +325,17 @@ void CardTableRS::younger_refs_in_space_iterate(Space* sp,
// In the case of CMS+ParNew, issue a warning // In the case of CMS+ParNew, issue a warning
if (!ur.contains(urasm)) { if (!ur.contains(urasm)) {
assert(UseConcMarkSweepGC, "Tautology: see assert above"); assert(UseConcMarkSweepGC, "Tautology: see assert above");
warning("CMS+ParNew: Did you forget to call save_marks()? " log_warning(gc)("CMS+ParNew: Did you forget to call save_marks()? "
"[" PTR_FORMAT ", " PTR_FORMAT ") is not contained in " "[" PTR_FORMAT ", " PTR_FORMAT ") is not contained in "
"[" PTR_FORMAT ", " PTR_FORMAT ")", "[" PTR_FORMAT ", " PTR_FORMAT ")",
p2i(urasm.start()), p2i(urasm.end()), p2i(ur.start()), p2i(ur.end())); p2i(urasm.start()), p2i(urasm.end()), p2i(ur.start()), p2i(ur.end()));
MemRegion ur2 = sp->used_region(); MemRegion ur2 = sp->used_region();
MemRegion urasm2 = sp->used_region_at_save_marks(); MemRegion urasm2 = sp->used_region_at_save_marks();
if (!ur.equals(ur2)) { if (!ur.equals(ur2)) {
warning("CMS+ParNew: Flickering used_region()!!"); log_warning(gc)("CMS+ParNew: Flickering used_region()!!");
} }
if (!urasm.equals(urasm2)) { if (!urasm.equals(urasm2)) {
warning("CMS+ParNew: Flickering used_region_at_save_marks()!!"); log_warning(gc)("CMS+ParNew: Flickering used_region_at_save_marks()!!");
} }
ShouldNotReachHere(); ShouldNotReachHere();
} }

2
hotspot/src/share/vm/gc/shared/genCollectedHeap.cpp
View file

@ -1272,7 +1272,7 @@ jlong GenCollectedHeap::millis_since_last_gc() {
// back a time later than 'now'. // back a time later than 'now'.
jlong retVal = now - tolgc_cl.time(); jlong retVal = now - tolgc_cl.time();
if (retVal < 0) { if (retVal < 0) {
NOT_PRODUCT(warning("time warp: " JLONG_FORMAT, retVal);) NOT_PRODUCT(log_warning(gc)("time warp: " JLONG_FORMAT, retVal);)
return 0; return 0;
} }
return retVal; return retVal;

5
hotspot/src/share/vm/gc/shared/generation.hpp
View file

@ -1,5 +1,5 @@
/* /*
* Copyright (c) 1997, 2015, Oracle and/or its affiliates. All rights reserved. * Copyright (c) 1997, 2016, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
* *
* This code is free software; you can redistribute it and/or modify it * This code is free software; you can redistribute it and/or modify it
@ -27,6 +27,7 @@
#include "gc/shared/collectorCounters.hpp" #include "gc/shared/collectorCounters.hpp"
#include "gc/shared/referenceProcessor.hpp" #include "gc/shared/referenceProcessor.hpp"
#include "logging/log.hpp"
#include "memory/allocation.hpp" #include "memory/allocation.hpp"
#include "memory/memRegion.hpp" #include "memory/memRegion.hpp"
#include "memory/universe.hpp" #include "memory/universe.hpp"
@ -377,7 +378,7 @@ class Generation: public CHeapObj<mtGC> {
// have to guard against non-monotonicity. // have to guard against non-monotonicity.
NOT_PRODUCT( NOT_PRODUCT(
if (now < _time_of_last_gc) { if (now < _time_of_last_gc) {
warning("time warp: " JLONG_FORMAT " to " JLONG_FORMAT, _time_of_last_gc, now); log_warning(gc)("time warp: " JLONG_FORMAT " to " JLONG_FORMAT, _time_of_last_gc, now);
} }
) )
return _time_of_last_gc; return _time_of_last_gc;

2
hotspot/src/share/vm/gc/shared/referenceProcessor.cpp
View file

@ -161,7 +161,7 @@ void ReferenceProcessor::update_soft_ref_master_clock() {
NOT_PRODUCT( NOT_PRODUCT(
if (now < _soft_ref_timestamp_clock) { if (now < _soft_ref_timestamp_clock) {
warning("time warp: " JLONG_FORMAT " to " JLONG_FORMAT, log_warning(gc)("time warp: " JLONG_FORMAT " to " JLONG_FORMAT,
_soft_ref_timestamp_clock, now); _soft_ref_timestamp_clock, now);
} }
) )

4
hotspot/src/share/vm/gc/shared/vmGCOperations.cpp
View file

@ -1,5 +1,5 @@
/* /*
* Copyright (c) 2005, 2015, Oracle and/or its affiliates. All rights reserved. * Copyright (c) 2005, 2016, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
* *
* This code is free software; you can redistribute it and/or modify it * This code is free software; you can redistribute it and/or modify it
@ -160,7 +160,7 @@ void VM_GC_HeapInspection::doit() {
// be about to attempt holds value for us only // be about to attempt holds value for us only
// if it happens now and not if it happens in the eventual // if it happens now and not if it happens in the eventual
// future. // future.
warning("GC locker is held; pre-dump GC was skipped"); log_warning(gc)("GC locker is held; pre-dump GC was skipped");
} }
} }
HeapInspection inspect(_csv_format, _print_help, _print_class_stats, HeapInspection inspect(_csv_format, _print_help, _print_class_stats,

3
hotspot/src/share/vm/memory/universe.cpp
View file

@ -376,8 +376,7 @@ void Universe::genesis(TRAPS) {
// We can allocate directly in the permanent generation, so we do. // We can allocate directly in the permanent generation, so we do.
int size; int size;
if (UseConcMarkSweepGC) { if (UseConcMarkSweepGC) {
warning("Using +FullGCALot with concurrent mark sweep gc " log_warning(gc)("Using +FullGCALot with concurrent mark sweep gc will not force all objects to relocate");
"will not force all objects to relocate");
size = FullGCALotDummies; size = FullGCALotDummies;
} else { } else {
size = FullGCALotDummies * 2; size = FullGCALotDummies * 2;