Mercurial > jdk8-mips64-public > hotspot / annotate
src/share/vm/memory/tenuredGeneration.hpp@7ae4e26cb1e0 (annotated)
src/share/vm/memory/tenuredGeneration.hpp
Thu, 12 Oct 2017 21:27:07 +0800
- author
- aoqi
- date
- Thu, 12 Oct 2017 21:27:07 +0800
- changeset 7535
- 7ae4e26cb1e0
- parent 6876
- 710a3c8b516e
- permissions
- -rw-r--r--
merge
| aoqi@0 | 1 | /* |
| aoqi@0 | 2 | * Copyright (c) 2001, 2013, Oracle and/or its affiliates. All rights reserved. |
| aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| aoqi@0 | 4 | * |
| aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
| aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| aoqi@0 | 7 | * published by the Free Software Foundation. |
| aoqi@0 | 8 | * |
| aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| aoqi@0 | 13 | * accompanied this code). |
| aoqi@0 | 14 | * |
| aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
| aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| aoqi@0 | 18 | * |
| aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
| aoqi@0 | 21 | * questions. |
| aoqi@0 | 22 | * |
| aoqi@0 | 23 | */ |
| aoqi@0 | 24 | |
| aoqi@0 | 25 | #ifndef SHARE_VM_MEMORY_TENUREDGENERATION_HPP |
| aoqi@0 | 26 | #define SHARE_VM_MEMORY_TENUREDGENERATION_HPP |
| aoqi@0 | 27 | |
| aoqi@0 | 28 | #include "gc_implementation/shared/cSpaceCounters.hpp" |
| aoqi@0 | 29 | #include "gc_implementation/shared/gcStats.hpp" |
| aoqi@0 | 30 | #include "gc_implementation/shared/generationCounters.hpp" |
| aoqi@0 | 31 | #include "memory/generation.hpp" |
| aoqi@0 | 32 | #include "utilities/macros.hpp" |
| aoqi@0 | 33 | |
| aoqi@0 | 34 | // TenuredGeneration models the heap containing old (promoted/tenured) objects. |
| aoqi@0 | 35 | |
| aoqi@0 | 36 | class ParGCAllocBufferWithBOT; |
| aoqi@0 | 37 | |
| aoqi@0 | 38 | class TenuredGeneration: public OneContigSpaceCardGeneration { |
| aoqi@0 | 39 | friend class VMStructs; |
| aoqi@0 | 40 | protected: |
| aoqi@0 | 41 | |
| aoqi@0 | 42 | #if INCLUDE_ALL_GCS |
| aoqi@0 | 43 | // To support parallel promotion: an array of parallel allocation |
| aoqi@0 | 44 | // buffers, one per thread, initially NULL. |
| aoqi@0 | 45 | ParGCAllocBufferWithBOT** _alloc_buffers; |
| aoqi@0 | 46 | #endif // INCLUDE_ALL_GCS |
| aoqi@0 | 47 | |
| aoqi@0 | 48 | // Retire all alloc buffers before a full GC, so that they will be |
| aoqi@0 | 49 | // re-allocated at the start of the next young GC. |
| aoqi@0 | 50 | void retire_alloc_buffers_before_full_gc(); |
| aoqi@0 | 51 | |
| aoqi@0 | 52 | GenerationCounters* _gen_counters; |
| aoqi@0 | 53 | CSpaceCounters* _space_counters; |
| aoqi@0 | 54 | |
| aoqi@0 | 55 | public: |
| aoqi@0 | 56 | TenuredGeneration(ReservedSpace rs, size_t initial_byte_size, int level, |
| aoqi@0 | 57 | GenRemSet* remset); |
| aoqi@0 | 58 | |
| aoqi@0 | 59 | Generation::Name kind() { return Generation::MarkSweepCompact; } |
| aoqi@0 | 60 | |
| aoqi@0 | 61 | // Printing |
| aoqi@0 | 62 | const char* name() const; |
| aoqi@0 | 63 | const char* short_name() const { return "Tenured"; } |
| aoqi@0 | 64 | bool must_be_youngest() const { return false; } |
| aoqi@0 | 65 | bool must_be_oldest() const { return true; } |
| aoqi@0 | 66 | |
| aoqi@0 | 67 | // Does a "full" (forced) collection invoked on this generation collect |
| aoqi@0 | 68 | // all younger generations as well? Note that this is a |
| aoqi@0 | 69 | // hack to allow the collection of the younger gen first if the flag is |
| aoqi@0 | 70 | // set. This is better than using th policy's should_collect_gen0_first() |
| aoqi@0 | 71 | // since that causes us to do an extra unnecessary pair of restart-&-stop-world. |
| aoqi@0 | 72 | virtual bool full_collects_younger_generations() const { |
| aoqi@0 | 73 | return !CollectGen0First; |
| aoqi@0 | 74 | } |
| aoqi@0 | 75 | |
| aoqi@0 | 76 | virtual void gc_prologue(bool full); |
| aoqi@0 | 77 | virtual void gc_epilogue(bool full); |
| aoqi@0 | 78 | bool should_collect(bool full, |
| aoqi@0 | 79 | size_t word_size, |
| aoqi@0 | 80 | bool is_tlab); |
| aoqi@0 | 81 | |
| aoqi@0 | 82 | virtual void collect(bool full, |
| aoqi@0 | 83 | bool clear_all_soft_refs, |
| aoqi@0 | 84 | size_t size, |
| aoqi@0 | 85 | bool is_tlab); |
| aoqi@0 | 86 | virtual void compute_new_size(); |
| aoqi@0 | 87 | |
| aoqi@0 | 88 | #if INCLUDE_ALL_GCS |
| aoqi@0 | 89 | // Overrides. |
| aoqi@0 | 90 | virtual oop par_promote(int thread_num, |
| aoqi@0 | 91 | oop obj, markOop m, size_t word_sz); |
| aoqi@0 | 92 | virtual void par_promote_alloc_undo(int thread_num, |
| aoqi@0 | 93 | HeapWord* obj, size_t word_sz); |
| aoqi@0 | 94 | virtual void par_promote_alloc_done(int thread_num); |
| aoqi@0 | 95 | #endif // INCLUDE_ALL_GCS |
| aoqi@0 | 96 | |
| aoqi@0 | 97 | // Performance Counter support |
| aoqi@0 | 98 | void update_counters(); |
| aoqi@0 | 99 | |
| aoqi@0 | 100 | // Statistics |
| aoqi@0 | 101 | |
| aoqi@0 | 102 | virtual void update_gc_stats(int level, bool full); |
| aoqi@0 | 103 | |
| aoqi@0 | 104 | virtual bool promotion_attempt_is_safe(size_t max_promoted_in_bytes) const; |
| aoqi@0 | 105 | |
| aoqi@0 | 106 | void verify_alloc_buffers_clean(); |
| aoqi@0 | 107 | }; |
| aoqi@0 | 108 | |
| aoqi@0 | 109 | #endif // SHARE_VM_MEMORY_TENUREDGENERATION_HPP |
