Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
PojavLauncherTeam
GitHub Repository: PojavLauncherTeam/mobile
Path: blob/master/src/hotspot/share/gc/parallel/psPromotionManager.hpp
41152 views
1
/*
2
* Copyright (c) 2002, 2021, Oracle and/or its affiliates. All rights reserved.
3
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4
*
5
* This code is free software; you can redistribute it and/or modify it
6
* under the terms of the GNU General Public License version 2 only, as
7
* published by the Free Software Foundation.
8
*
9
* This code is distributed in the hope that it will be useful, but WITHOUT
10
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12
* version 2 for more details (a copy is included in the LICENSE file that
13
* accompanied this code).
14
*
15
* You should have received a copy of the GNU General Public License version
16
* 2 along with this work; if not, write to the Free Software Foundation,
17
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18
*
19
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20
* or visit www.oracle.com if you need additional information or have any
21
* questions.
22
*
23
*/
24
25
#ifndef SHARE_GC_PARALLEL_PSPROMOTIONMANAGER_HPP
26
#define SHARE_GC_PARALLEL_PSPROMOTIONMANAGER_HPP
27
28
#include "gc/parallel/psPromotionLAB.hpp"
29
#include "gc/shared/copyFailedInfo.hpp"
30
#include "gc/shared/gcTrace.hpp"
31
#include "gc/shared/preservedMarks.hpp"
32
#include "gc/shared/taskqueue.hpp"
33
#include "memory/padded.hpp"
34
#include "utilities/globalDefinitions.hpp"
35
36
//
37
// psPromotionManager is used by a single thread to manage object survival
38
// during a scavenge. The promotion manager contains thread local data only.
39
//
40
// NOTE! Be careful when allocating the stacks on cheap. If you are going
41
// to use a promotion manager in more than one thread, the stacks MUST be
42
// on cheap. This can lead to memory leaks, though, as they are not auto
43
// deallocated.
44
//
45
// FIX ME FIX ME Add a destructor, and don't rely on the user to drain/flush/deallocate!
46
//
47
48
class MutableSpace;
49
class PSOldGen;
50
class ParCompactionManager;
51
52
class PSPromotionManager {
53
friend class PSScavenge;
54
friend class ScavengeRootsTask;
55
56
private:
57
typedef OverflowTaskQueue<ScannerTask, mtGC> PSScannerTasksQueue;
58
typedef GenericTaskQueueSet<PSScannerTasksQueue, mtGC> PSScannerTasksQueueSet;
59
60
static PaddedEnd<PSPromotionManager>* _manager_array;
61
static PSScannerTasksQueueSet* _stack_array_depth;
62
static PreservedMarksSet* _preserved_marks_set;
63
static PSOldGen* _old_gen;
64
static MutableSpace* _young_space;
65
66
#if TASKQUEUE_STATS
67
size_t _array_chunk_pushes;
68
size_t _array_chunk_steals;
69
size_t _arrays_chunked;
70
size_t _array_chunks_processed;
71
72
void print_local_stats(outputStream* const out, uint i) const;
73
static void print_taskqueue_stats();
74
75
void reset_stats();
76
#endif // TASKQUEUE_STATS
77
78
PSYoungPromotionLAB _young_lab;
79
PSOldPromotionLAB _old_lab;
80
bool _young_gen_is_full;
81
bool _old_gen_is_full;
82
83
PSScannerTasksQueue _claimed_stack_depth;
84
OverflowTaskQueue<oop, mtGC> _claimed_stack_breadth;
85
86
bool _totally_drain;
87
uint _target_stack_size;
88
89
uint _array_chunk_size;
90
uint _min_array_size_for_chunking;
91
92
PreservedMarks* _preserved_marks;
93
PromotionFailedInfo _promotion_failed_info;
94
95
// Accessors
96
static PSOldGen* old_gen() { return _old_gen; }
97
static MutableSpace* young_space() { return _young_space; }
98
99
inline static PSPromotionManager* manager_array(uint index);
100
101
template <class T> void process_array_chunk_work(oop obj,
102
int start, int end);
103
void process_array_chunk(PartialArrayScanTask task);
104
105
void push_depth(ScannerTask task);
106
107
inline void promotion_trace_event(oop new_obj, oop old_obj, size_t obj_size,
108
uint age, bool tenured,
109
const PSPromotionLAB* lab);
110
111
static PSScannerTasksQueueSet* stack_array_depth() { return _stack_array_depth; }
112
113
public:
114
// Static
115
static void initialize();
116
117
static void pre_scavenge();
118
static bool post_scavenge(YoungGCTracer& gc_tracer);
119
120
static PSPromotionManager* gc_thread_promotion_manager(uint index);
121
static PSPromotionManager* vm_thread_promotion_manager();
122
123
static bool steal_depth(int queue_num, ScannerTask& t);
124
125
PSPromotionManager();
126
127
// Accessors
128
PSScannerTasksQueue* claimed_stack_depth() {
129
return &_claimed_stack_depth;
130
}
131
132
bool young_gen_is_full() { return _young_gen_is_full; }
133
134
bool old_gen_is_full() { return _old_gen_is_full; }
135
void set_old_gen_is_full(bool state) { _old_gen_is_full = state; }
136
137
// Promotion methods
138
template<bool promote_immediately> oop copy_to_survivor_space(oop o);
139
oop oop_promotion_failed(oop obj, markWord obj_mark);
140
141
void reset();
142
void register_preserved_marks(PreservedMarks* preserved_marks);
143
static void restore_preserved_marks();
144
145
void flush_labs();
146
void drain_stacks(bool totally_drain) {
147
drain_stacks_depth(totally_drain);
148
}
149
public:
150
void drain_stacks_cond_depth() {
151
if (claimed_stack_depth()->size() > _target_stack_size) {
152
drain_stacks_depth(false);
153
}
154
}
155
void drain_stacks_depth(bool totally_drain);
156
157
bool stacks_empty() {
158
return claimed_stack_depth()->is_empty();
159
}
160
161
inline void process_popped_location_depth(ScannerTask task);
162
163
static bool should_scavenge(oop* p, bool check_to_space = false);
164
static bool should_scavenge(narrowOop* p, bool check_to_space = false);
165
166
template <bool promote_immediately, class T>
167
void copy_and_push_safe_barrier(T* p);
168
169
template <class T> inline void claim_or_forward_depth(T* p);
170
171
TASKQUEUE_STATS_ONLY(inline void record_steal(ScannerTask task);)
172
173
void push_contents(oop obj);
174
};
175
176
#endif // SHARE_GC_PARALLEL_PSPROMOTIONMANAGER_HPP
177
178