jmasa@2821: /* mikael@6198: * Copyright (c) 2011, 2013, Oracle and/or its affiliates. All rights reserved. jmasa@2821: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. jmasa@2821: * jmasa@2821: * This code is free software; you can redistribute it and/or modify it jmasa@2821: * under the terms of the GNU General Public License version 2 only, as jmasa@2821: * published by the Free Software Foundation. jmasa@2821: * jmasa@2821: * This code is distributed in the hope that it will be useful, but WITHOUT jmasa@2821: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or jmasa@2821: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License jmasa@2821: * version 2 for more details (a copy is included in the LICENSE file that jmasa@2821: * accompanied this code). jmasa@2821: * jmasa@2821: * You should have received a copy of the GNU General Public License version jmasa@2821: * 2 along with this work; if not, write to the Free Software Foundation, jmasa@2821: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. jmasa@2821: * jmasa@2821: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA jmasa@2821: * or visit www.oracle.com if you need additional information or have any jmasa@2821: * questions. jmasa@2821: * jmasa@2821: */ jmasa@2821: jmasa@2821: #include "precompiled.hpp" jmasa@2821: #include "gc_implementation/g1/g1MonitoringSupport.hpp" jmasa@2821: #include "gc_implementation/g1/g1CollectedHeap.inline.hpp" jmasa@2821: #include "gc_implementation/g1/g1CollectorPolicy.hpp" jmasa@2821: tonyp@3176: G1GenerationCounters::G1GenerationCounters(G1MonitoringSupport* g1mm, tonyp@3176: const char* name, tonyp@3176: int ordinal, int spaces, tonyp@3176: size_t min_capacity, tonyp@3176: size_t max_capacity, tonyp@3176: size_t curr_capacity) tonyp@3176: : GenerationCounters(name, ordinal, spaces, min_capacity, tonyp@3176: max_capacity, curr_capacity), _g1mm(g1mm) { } tonyp@3176: tonyp@3176: // We pad the capacity three times given that the young generation tonyp@3176: // contains three spaces (eden and two survivors). tonyp@3176: G1YoungGenerationCounters::G1YoungGenerationCounters(G1MonitoringSupport* g1mm, tonyp@3176: const char* name) tonyp@3176: : G1GenerationCounters(g1mm, name, 0 /* ordinal */, 3 /* spaces */, tonyp@3176: G1MonitoringSupport::pad_capacity(0, 3) /* min_capacity */, tonyp@3176: G1MonitoringSupport::pad_capacity(g1mm->young_gen_max(), 3), tonyp@3176: G1MonitoringSupport::pad_capacity(0, 3) /* curr_capacity */) { johnc@3620: if (UsePerfData) { johnc@3620: update_all(); johnc@3620: } tonyp@3176: } tonyp@3176: tonyp@3176: G1OldGenerationCounters::G1OldGenerationCounters(G1MonitoringSupport* g1mm, tonyp@3176: const char* name) tonyp@3176: : G1GenerationCounters(g1mm, name, 1 /* ordinal */, 1 /* spaces */, tonyp@3176: G1MonitoringSupport::pad_capacity(0) /* min_capacity */, tonyp@3176: G1MonitoringSupport::pad_capacity(g1mm->old_gen_max()), tonyp@3176: G1MonitoringSupport::pad_capacity(0) /* curr_capacity */) { johnc@3620: if (UsePerfData) { johnc@3620: update_all(); johnc@3620: } tonyp@3176: } tonyp@3176: tonyp@3176: void G1YoungGenerationCounters::update_all() { tonyp@3176: size_t committed = tonyp@3176: G1MonitoringSupport::pad_capacity(_g1mm->young_gen_committed(), 3); tonyp@3176: _current_size->set_value(committed); tonyp@3176: } tonyp@3176: tonyp@3176: void G1OldGenerationCounters::update_all() { tonyp@3176: size_t committed = tonyp@3176: G1MonitoringSupport::pad_capacity(_g1mm->old_gen_committed()); tonyp@3176: _current_size->set_value(committed); tonyp@3176: } tonyp@3176: tonyp@3176: G1MonitoringSupport::G1MonitoringSupport(G1CollectedHeap* g1h) : jmasa@2821: _g1h(g1h), jmasa@2821: _incremental_collection_counters(NULL), jmasa@2821: _full_collection_counters(NULL), tonyp@3176: _old_collection_counters(NULL), jmasa@2821: _old_space_counters(NULL), jmasa@2821: _young_collection_counters(NULL), jmasa@2821: _eden_counters(NULL), jmasa@2821: _from_counters(NULL), jmasa@2821: _to_counters(NULL), tonyp@3176: tonyp@3176: _overall_reserved(0), tonyp@3176: _overall_committed(0), _overall_used(0), tonyp@3176: _young_region_num(0), tonyp@3176: _young_gen_committed(0), tonyp@3176: _eden_committed(0), _eden_used(0), tonyp@3176: _survivor_committed(0), _survivor_used(0), tonyp@3176: _old_committed(0), _old_used(0) { tonyp@3176: tonyp@3176: _overall_reserved = g1h->max_capacity(); tonyp@3176: recalculate_sizes(); tonyp@3176: jmasa@2821: // Counters for GC collections jmasa@2821: // jmasa@2821: // name "collector.0". In a generational collector this would be the jmasa@2821: // young generation collection. jmasa@2821: _incremental_collection_counters = jmasa@2821: new CollectorCounters("G1 incremental collections", 0); jmasa@2821: // name "collector.1". In a generational collector this would be the jmasa@2821: // old generation collection. jmasa@2821: _full_collection_counters = jmasa@2821: new CollectorCounters("G1 stop-the-world full collections", 1); jmasa@2821: jmasa@2821: // timer sampling for all counters supporting sampling only update the jmasa@2821: // used value. See the take_sample() method. G1 requires both used and jmasa@2821: // capacity updated so sampling is not currently used. It might jmasa@2821: // be sufficient to update all counters in take_sample() even though jmasa@2821: // take_sample() only returns "used". When sampling was used, there jmasa@2821: // were some anomolous values emitted which may have been the consequence jmasa@2821: // of not updating all values simultaneously (i.e., see the calculation done jmasa@2821: // in eden_space_used(), is it possbile that the values used to jmasa@2821: // calculate either eden_used or survivor_used are being updated by jmasa@2821: // the collector when the sample is being done?). jmasa@2821: const bool sampled = false; jmasa@2821: jmasa@2821: // "Generation" and "Space" counters. jmasa@2821: // jmasa@2821: // name "generation.1" This is logically the old generation in jmasa@2821: // generational GC terms. The "1, 1" parameters are for jmasa@2821: // the n-th generation (=1) with 1 space. jmasa@2821: // Counters are created from minCapacity, maxCapacity, and capacity tonyp@3176: _old_collection_counters = new G1OldGenerationCounters(this, "old"); jmasa@2821: jmasa@2821: // name "generation.1.space.0" jmasa@2821: // Counters are created from maxCapacity, capacity, initCapacity, jmasa@2821: // and used. tonyp@3176: _old_space_counters = new HSpaceCounters("space", 0 /* ordinal */, tonyp@3176: pad_capacity(overall_reserved()) /* max_capacity */, tonyp@3176: pad_capacity(old_space_committed()) /* init_capacity */, tonyp@3176: _old_collection_counters); jmasa@2821: jmasa@2821: // Young collection set jmasa@2821: // name "generation.0". This is logically the young generation. jmasa@2821: // The "0, 3" are paremeters for the n-th genertaion (=0) with 3 spaces. tonyp@3176: // See _old_collection_counters for additional counters tonyp@3176: _young_collection_counters = new G1YoungGenerationCounters(this, "young"); jmasa@2821: jmasa@2821: // name "generation.0.space.0" jmasa@2821: // See _old_space_counters for additional counters tonyp@3176: _eden_counters = new HSpaceCounters("eden", 0 /* ordinal */, tonyp@3176: pad_capacity(overall_reserved()) /* max_capacity */, tonyp@3176: pad_capacity(eden_space_committed()) /* init_capacity */, jmasa@2821: _young_collection_counters); jmasa@2821: jmasa@2821: // name "generation.0.space.1" jmasa@2821: // See _old_space_counters for additional counters jmasa@2821: // Set the arguments to indicate that this survivor space is not used. tonyp@3176: _from_counters = new HSpaceCounters("s0", 1 /* ordinal */, tonyp@3176: pad_capacity(0) /* max_capacity */, tonyp@3176: pad_capacity(0) /* init_capacity */, jmasa@2821: _young_collection_counters); jmasa@2821: jmasa@2821: // name "generation.0.space.2" jmasa@2821: // See _old_space_counters for additional counters tonyp@3176: _to_counters = new HSpaceCounters("s1", 2 /* ordinal */, tonyp@3176: pad_capacity(overall_reserved()) /* max_capacity */, tonyp@3176: pad_capacity(survivor_space_committed()) /* init_capacity */, jmasa@2821: _young_collection_counters); johnc@3620: johnc@3620: if (UsePerfData) { johnc@3620: // Given that this survivor space is not used, we update it here johnc@3620: // once to reflect that its used space is 0 so that we don't have to johnc@3620: // worry about updating it again later. johnc@3620: _from_counters->update_used(0); johnc@3620: } jmasa@2821: } jmasa@2821: tonyp@3176: void G1MonitoringSupport::recalculate_sizes() { tonyp@3176: G1CollectedHeap* g1 = g1h(); tonyp@3176: tonyp@3176: // Recalculate all the sizes from scratch. We assume that this is tonyp@3176: // called at a point where no concurrent updates to the various tonyp@3176: // values we read here are possible (i.e., at a STW phase at the end tonyp@3176: // of a GC). tonyp@3176: tonyp@3713: uint young_list_length = g1->young_list()->length(); tonyp@3713: uint survivor_list_length = g1->g1_policy()->recorded_survivor_regions(); tonyp@3176: assert(young_list_length >= survivor_list_length, "invariant"); tonyp@3713: uint eden_list_length = young_list_length - survivor_list_length; tonyp@3176: // Max length includes any potential extensions to the young gen tonyp@3176: // we'll do when the GC locker is active. tonyp@3713: uint young_list_max_length = g1->g1_policy()->young_list_max_length(); tonyp@3176: assert(young_list_max_length >= survivor_list_length, "invariant"); tonyp@3713: uint eden_list_max_length = young_list_max_length - survivor_list_length; tonyp@3176: tonyp@3176: _overall_used = g1->used_unlocked(); tonyp@3713: _eden_used = (size_t) eden_list_length * HeapRegion::GrainBytes; tonyp@3713: _survivor_used = (size_t) survivor_list_length * HeapRegion::GrainBytes; tonyp@3176: _young_region_num = young_list_length; tonyp@3176: _old_used = subtract_up_to_zero(_overall_used, _eden_used + _survivor_used); tonyp@3176: tonyp@3176: // First calculate the committed sizes that can be calculated independently. tonyp@3176: _survivor_committed = _survivor_used; tonyp@3176: _old_committed = HeapRegion::align_up_to_region_byte_size(_old_used); tonyp@3176: tonyp@3176: // Next, start with the overall committed size. tonyp@3176: _overall_committed = g1->capacity(); tonyp@3176: size_t committed = _overall_committed; tonyp@3176: tonyp@3176: // Remove the committed size we have calculated so far (for the tonyp@3176: // survivor and old space). tonyp@3176: assert(committed >= (_survivor_committed + _old_committed), "sanity"); tonyp@3176: committed -= _survivor_committed + _old_committed; tonyp@3176: tonyp@3176: // Next, calculate and remove the committed size for the eden. tonyp@3713: _eden_committed = (size_t) eden_list_max_length * HeapRegion::GrainBytes; tonyp@3176: // Somewhat defensive: be robust in case there are inaccuracies in tonyp@3176: // the calculations tonyp@3176: _eden_committed = MIN2(_eden_committed, committed); tonyp@3176: committed -= _eden_committed; tonyp@3176: tonyp@3176: // Finally, give the rest to the old space... tonyp@3176: _old_committed += committed; tonyp@3176: // ..and calculate the young gen committed. tonyp@3176: _young_gen_committed = _eden_committed + _survivor_committed; tonyp@3176: tonyp@3176: assert(_overall_committed == tonyp@3176: (_eden_committed + _survivor_committed + _old_committed), tonyp@3176: "the committed sizes should add up"); tonyp@3176: // Somewhat defensive: cap the eden used size to make sure it tonyp@3176: // never exceeds the committed size. tonyp@3176: _eden_used = MIN2(_eden_used, _eden_committed); tonyp@3176: // _survivor_committed and _old_committed are calculated in terms of tonyp@3176: // the corresponding _*_used value, so the next two conditions tonyp@3176: // should hold. tonyp@3176: assert(_survivor_used <= _survivor_committed, "post-condition"); tonyp@3176: assert(_old_used <= _old_committed, "post-condition"); jmasa@2821: } jmasa@2821: tonyp@3176: void G1MonitoringSupport::recalculate_eden_size() { tonyp@3176: G1CollectedHeap* g1 = g1h(); jmasa@2821: tonyp@3176: // When a new eden region is allocated, only the eden_used size is tonyp@3176: // affected (since we have recalculated everything else at the last GC). jmasa@2821: tonyp@3713: uint young_region_num = g1h()->young_list()->length(); tonyp@3176: if (young_region_num > _young_region_num) { tonyp@3713: uint diff = young_region_num - _young_region_num; tonyp@3713: _eden_used += (size_t) diff * HeapRegion::GrainBytes; tonyp@3176: // Somewhat defensive: cap the eden used size to make sure it tonyp@3176: // never exceeds the committed size. tonyp@3176: _eden_used = MIN2(_eden_used, _eden_committed); tonyp@3176: _young_region_num = young_region_num; jmasa@2821: } jmasa@2821: } jmasa@2821: tonyp@3176: void G1MonitoringSupport::update_sizes() { tonyp@3176: recalculate_sizes(); jmasa@2821: if (UsePerfData) { tonyp@3176: eden_counters()->update_capacity(pad_capacity(eden_space_committed())); tonyp@3176: eden_counters()->update_used(eden_space_used()); tonyp@3176: // only the to survivor space (s1) is active, so we don't need to tonyp@3176: // update the counteres for the from survivor space (s0) tonyp@3176: to_counters()->update_capacity(pad_capacity(survivor_space_committed())); tonyp@3176: to_counters()->update_used(survivor_space_used()); tonyp@3176: old_space_counters()->update_capacity(pad_capacity(old_space_committed())); tonyp@3176: old_space_counters()->update_used(old_space_used()); tonyp@3176: old_collection_counters()->update_all(); tonyp@3176: young_collection_counters()->update_all(); coleenp@4037: MetaspaceCounters::update_performance_counters(); ehelin@5531: CompressedClassSpaceCounters::update_performance_counters(); tonyp@3176: } tonyp@3176: } tonyp@3176: tonyp@3176: void G1MonitoringSupport::update_eden_size() { tonyp@3176: recalculate_eden_size(); tonyp@3176: if (UsePerfData) { jmasa@2821: eden_counters()->update_used(eden_space_used()); jmasa@2821: } jmasa@2821: }