1 /*
2 * Copyright (c) 2005, 2019, 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_PSCOMPACTIONMANAGER_HPP
26 #define SHARE_GC_PARALLEL_PSCOMPACTIONMANAGER_HPP
27
28 #include "gc/shared/taskqueue.hpp"
29 #include "memory/allocation.hpp"
30 #include "utilities/stack.hpp"
31
32 class MutableSpace;
33 class PSOldGen;
34 class ParCompactionManager;
35 class ObjectStartArray;
36 class ParallelCompactData;
37 class ParMarkBitMap;
38
39 class ParCompactionManager : public CHeapObj<mtGC> {
40 friend class ParallelTaskTerminator;
41 friend class ParMarkBitMap;
42 friend class PSParallelCompact;
43 friend class CompactionWithStealingTask;
44 friend class UpdateAndFillClosure;
45 friend class RefProcTaskExecutor;
46 friend class IdleGCTask;
47 friend class PCRefProcTask;
48 friend class MarkFromRootsTask;
49 friend class UpdateDensePrefixAndCompactionTask;
50
51 public:
52
53 // ------------------------ Don't putback if not needed
54 // Actions that the compaction manager should take.
55 enum Action {
56 Update,
57 Copy,
58 UpdateAndCopy,
59 CopyAndUpdate,
60 NotValid
61 };
62 // ------------------------ End don't putback if not needed
63
64 private:
65 // 32-bit: 4K * 8 = 32KiB; 64-bit: 8K * 16 = 128KiB
66 #define QUEUE_SIZE (1 << NOT_LP64(12) LP64_ONLY(13))
67 typedef OverflowTaskQueue<ObjArrayTask, mtGC, QUEUE_SIZE> ObjArrayTaskQueue;
68 typedef GenericTaskQueueSet<ObjArrayTaskQueue, mtGC> ObjArrayTaskQueueSet;
69 #undef QUEUE_SIZE
70
71 static ParCompactionManager** _manager_array;
72 static OopTaskQueueSet* _stack_array;
73 static ObjArrayTaskQueueSet* _objarray_queues;
74 static ObjectStartArray* _start_array;
75 static RegionTaskQueueSet* _region_array;
76 static PSOldGen* _old_gen;
77
78 private:
79 OverflowTaskQueue<oop, mtGC> _marking_stack;
80 ObjArrayTaskQueue _objarray_stack;
81
82 // Is there a way to reuse the _marking_stack for the
83 // saving empty regions? For now just create a different
84 // type of TaskQueue.
85 RegionTaskQueue _region_stack;
86
87 static ParMarkBitMap* _mark_bitmap;
88
89 Action _action;
90
91 HeapWord* _last_query_beg;
92 oop _last_query_obj;
93 size_t _last_query_ret;
94
95 static PSOldGen* old_gen() { return _old_gen; }
96 static ObjectStartArray* start_array() { return _start_array; }
97 static OopTaskQueueSet* stack_array() { return _stack_array; }
98
99 static void initialize(ParMarkBitMap* mbm);
100
101 protected:
102 // Array of tasks. Needed by the ParallelTaskTerminator.
103 static RegionTaskQueueSet* region_array() { return _region_array; }
104 OverflowTaskQueue<oop, mtGC>* marking_stack() { return &_marking_stack; }
105
106 // Pushes onto the marking stack. If the marking stack is full,
107 // pushes onto the overflow stack.
108 void stack_push(oop obj);
109 // Do not implement an equivalent stack_pop. Deal with the
110 // marking stack and overflow stack directly.
111
112 public:
113 void reset_bitmap_query_cache() {
114 _last_query_beg = NULL;
115 _last_query_obj = NULL;
116 _last_query_ret = 0;
117 }
118
119 Action action() { return _action; }
120 void set_action(Action v) { _action = v; }
121
122 // Bitmap query support, cache last query and result
123 HeapWord* last_query_begin() { return _last_query_beg; }
124 oop last_query_object() { return _last_query_obj; }
125 size_t last_query_return() { return _last_query_ret; }
126
127 void set_last_query_begin(HeapWord *new_beg) { _last_query_beg = new_beg; }
128 void set_last_query_object(oop new_obj) { _last_query_obj = new_obj; }
129 void set_last_query_return(size_t new_ret) { _last_query_ret = new_ret; }
130
131 static void reset_all_bitmap_query_caches();
132
133 RegionTaskQueue* region_stack() { return &_region_stack; }
134
135 inline static ParCompactionManager* manager_array(uint index);
136
137 ParCompactionManager();
138
139 // Pushes onto the region stack at the given index. If the
140 // region stack is full,
141 // pushes onto the region overflow stack.
142 static void verify_region_list_empty(uint stack_index);
143 ParMarkBitMap* mark_bitmap() { return _mark_bitmap; }
144
145 // void drain_stacks();
146
147 bool should_update();
148 bool should_copy();
149
150 // Save for later processing. Must not fail.
151 inline void push(oop obj);
152 inline void push_objarray(oop objarray, size_t index);
153 inline void push_region(size_t index);
154
155 // Check mark and maybe push on marking stack.
156 template <typename T> inline void mark_and_push(T* p);
157
158 inline void follow_klass(Klass* klass);
159
160 void follow_class_loader(ClassLoaderData* klass);
161
162 // Access function for compaction managers
163 static ParCompactionManager* gc_thread_compaction_manager(uint index);
164
165 static bool steal(int queue_num, oop& t);
166 static bool steal_objarray(int queue_num, ObjArrayTask& t);
167 static bool steal(int queue_num, size_t& region);
168
169 // Process tasks remaining on any marking stack
170 void follow_marking_stacks();
171 inline bool marking_stacks_empty() const;
172
173 // Process tasks remaining on any stack
174 void drain_region_stacks();
175
176 void follow_contents(oop obj);
177 void follow_array(objArrayOop array, int index);
178
179 void update_contents(oop obj);
180
181 class FollowStackClosure: public VoidClosure {
182 private:
183 ParCompactionManager* _compaction_manager;
184 public:
185 FollowStackClosure(ParCompactionManager* cm) : _compaction_manager(cm) { }
186 virtual void do_void();
187 };
188 };
189
190 inline ParCompactionManager* ParCompactionManager::manager_array(uint index) {
191 assert(_manager_array != NULL, "access of NULL manager_array");
192 assert(index <= ParallelGCThreads, "out of range manager_array access");
193 return _manager_array[index];
194 }
195
196 bool ParCompactionManager::marking_stacks_empty() const {
197 return _marking_stack.is_empty() && _objarray_stack.is_empty();
198 }
199
200 #endif // SHARE_GC_PARALLEL_PSCOMPACTIONMANAGER_HPP