Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/parNew/parNewGeneration.hpp @ 1665:a93a9eda13f7
6962947: shared TaskQueue statistics
Reviewed-by: tonyp, ysr
| author | jcoomes |
|---|---|
| date | Fri, 16 Jul 2010 21:33:21 -0700 |
| parents | c18cbe5936b8 |
| children | 94251661de76 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 1665 | 2 * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved. |
| 0 | 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 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1145
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1145
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1145
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 25 class ChunkArray; | |
| 26 class ParScanWithoutBarrierClosure; | |
| 27 class ParScanWithBarrierClosure; | |
| 28 class ParRootScanWithoutBarrierClosure; | |
| 29 class ParRootScanWithBarrierTwoGensClosure; | |
| 30 class ParEvacuateFollowersClosure; | |
| 31 | |
| 32 // It would be better if these types could be kept local to the .cpp file, | |
| 33 // but they must be here to allow ParScanClosure::do_oop_work to be defined | |
| 34 // in genOopClosures.inline.hpp. | |
| 35 | |
| 1665 | 36 typedef Padded<OopTaskQueue> ObjToScanQueue; |
| 37 typedef GenericTaskQueueSet<ObjToScanQueue> ObjToScanQueueSet; | |
| 0 | 38 |
| 39 // Enable this to get push/pop/steal stats. | |
| 40 const int PAR_STATS_ENABLED = 0; | |
| 41 | |
| 42 class ParKeepAliveClosure: public DefNewGeneration::KeepAliveClosure { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
43 private: |
| 0 | 44 ParScanWeakRefClosure* _par_cl; |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
45 protected: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
46 template <class T> void do_oop_work(T* p); |
| 0 | 47 public: |
| 48 ParKeepAliveClosure(ParScanWeakRefClosure* cl); | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
49 virtual void do_oop(oop* p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
50 virtual void do_oop(narrowOop* p); |
| 0 | 51 }; |
| 52 | |
| 53 // The state needed by thread performing parallel young-gen collection. | |
| 54 class ParScanThreadState { | |
| 55 friend class ParScanThreadStateSet; | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
56 private: |
| 0 | 57 ObjToScanQueue *_work_queue; |
|
679
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
58 GrowableArray<oop>* _overflow_stack; |
| 0 | 59 |
| 60 ParGCAllocBuffer _to_space_alloc_buffer; | |
| 61 | |
| 62 ParScanWithoutBarrierClosure _to_space_closure; // scan_without_gc_barrier | |
| 63 ParScanWithBarrierClosure _old_gen_closure; // scan_with_gc_barrier | |
| 64 ParRootScanWithoutBarrierClosure _to_space_root_closure; // scan_root_without_gc_barrier | |
| 65 // One of these two will be passed to process_strong_roots, which will | |
| 66 // set its generation. The first is for two-gen configs where the | |
| 67 // old gen collects the perm gen; the second is for arbitrary configs. | |
| 68 // The second isn't used right now (it used to be used for the train, an | |
| 69 // incremental collector) but the declaration has been left as a reminder. | |
| 70 ParRootScanWithBarrierTwoGensClosure _older_gen_closure; | |
| 71 // This closure will always be bound to the old gen; it will be used | |
| 72 // in evacuate_followers. | |
| 73 ParRootScanWithBarrierTwoGensClosure _old_gen_root_closure; // scan_old_root_with_gc_barrier | |
| 74 ParEvacuateFollowersClosure _evacuate_followers; | |
| 75 DefNewGeneration::IsAliveClosure _is_alive_closure; | |
| 76 ParScanWeakRefClosure _scan_weak_ref_closure; | |
| 77 ParKeepAliveClosure _keep_alive_closure; | |
| 78 | |
| 79 | |
| 80 Space* _to_space; | |
| 81 Space* to_space() { return _to_space; } | |
| 82 | |
|
679
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
83 ParNewGeneration* _young_gen; |
|
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
84 ParNewGeneration* young_gen() const { return _young_gen; } |
|
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
85 |
| 0 | 86 Generation* _old_gen; |
| 87 Generation* old_gen() { return _old_gen; } | |
| 88 | |
| 89 HeapWord *_young_old_boundary; | |
| 90 | |
| 91 int _hash_seed; | |
| 92 int _thread_num; | |
| 93 ageTable _ageTable; | |
| 94 | |
| 95 bool _to_space_full; | |
| 96 | |
| 97 int _pushes, _pops, _steals, _steal_attempts, _term_attempts; | |
| 98 int _overflow_pushes, _overflow_refills, _overflow_refill_objs; | |
| 99 | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
695
diff
changeset
|
100 // Stats for promotion failure |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
695
diff
changeset
|
101 size_t _promotion_failure_size; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
695
diff
changeset
|
102 |
| 0 | 103 // Timing numbers. |
| 104 double _start; | |
| 105 double _start_strong_roots; | |
| 106 double _strong_roots_time; | |
| 107 double _start_term; | |
| 108 double _term_time; | |
| 109 | |
| 110 // Helper for trim_queues. Scans subset of an array and makes | |
| 111 // remainder available for work stealing. | |
| 112 void scan_partial_array_and_push_remainder(oop obj); | |
| 113 | |
| 114 // In support of CMS' parallel rescan of survivor space. | |
| 115 ChunkArray* _survivor_chunk_array; | |
| 116 ChunkArray* survivor_chunk_array() { return _survivor_chunk_array; } | |
| 117 | |
| 118 void record_survivor_plab(HeapWord* plab_start, size_t plab_word_size); | |
| 119 | |
| 120 ParScanThreadState(Space* to_space_, ParNewGeneration* gen_, | |
| 121 Generation* old_gen_, int thread_num_, | |
| 695 | 122 ObjToScanQueueSet* work_queue_set_, |
| 123 GrowableArray<oop>** overflow_stack_set_, | |
| 124 size_t desired_plab_sz_, | |
| 0 | 125 ParallelTaskTerminator& term_); |
| 126 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
127 public: |
| 0 | 128 ageTable* age_table() {return &_ageTable;} |
| 129 | |
| 130 ObjToScanQueue* work_queue() { return _work_queue; } | |
| 131 | |
| 132 ParGCAllocBuffer* to_space_alloc_buffer() { | |
| 133 return &_to_space_alloc_buffer; | |
| 134 } | |
| 135 | |
| 136 ParEvacuateFollowersClosure& evacuate_followers_closure() { return _evacuate_followers; } | |
| 137 DefNewGeneration::IsAliveClosure& is_alive_closure() { return _is_alive_closure; } | |
| 138 ParScanWeakRefClosure& scan_weak_ref_closure() { return _scan_weak_ref_closure; } | |
| 139 ParKeepAliveClosure& keep_alive_closure() { return _keep_alive_closure; } | |
| 140 ParScanClosure& older_gen_closure() { return _older_gen_closure; } | |
| 141 ParRootScanWithoutBarrierClosure& to_space_root_closure() { return _to_space_root_closure; }; | |
| 142 | |
| 143 // Decrease queue size below "max_size". | |
| 144 void trim_queues(int max_size); | |
| 145 | |
|
679
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
146 // Private overflow stack usage |
|
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
147 GrowableArray<oop>* overflow_stack() { return _overflow_stack; } |
|
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
148 bool take_from_overflow_stack(); |
|
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
149 void push_on_overflow_stack(oop p); |
|
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
150 |
| 0 | 151 // Is new_obj a candidate for scan_partial_array_and_push_remainder method. |
| 152 inline bool should_be_partially_scanned(oop new_obj, oop old_obj) const; | |
| 153 | |
| 154 int* hash_seed() { return &_hash_seed; } | |
| 155 int thread_num() { return _thread_num; } | |
| 156 | |
| 157 // Allocate a to-space block of size "sz", or else return NULL. | |
| 158 HeapWord* alloc_in_to_space_slow(size_t word_sz); | |
| 159 | |
| 160 HeapWord* alloc_in_to_space(size_t word_sz) { | |
| 161 HeapWord* obj = to_space_alloc_buffer()->allocate(word_sz); | |
| 162 if (obj != NULL) return obj; | |
| 163 else return alloc_in_to_space_slow(word_sz); | |
| 164 } | |
| 165 | |
| 166 HeapWord* young_old_boundary() { return _young_old_boundary; } | |
| 167 | |
| 168 void set_young_old_boundary(HeapWord *boundary) { | |
| 169 _young_old_boundary = boundary; | |
| 170 } | |
| 171 | |
| 172 // Undo the most recent allocation ("obj", of "word_sz"). | |
| 173 void undo_alloc_in_to_space(HeapWord* obj, size_t word_sz); | |
| 174 | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
695
diff
changeset
|
175 // Promotion failure stats |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
695
diff
changeset
|
176 size_t promotion_failure_size() { return promotion_failure_size(); } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
695
diff
changeset
|
177 void log_promotion_failure(size_t sz) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
695
diff
changeset
|
178 if (_promotion_failure_size == 0) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
695
diff
changeset
|
179 _promotion_failure_size = sz; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
695
diff
changeset
|
180 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
695
diff
changeset
|
181 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
695
diff
changeset
|
182 void print_and_clear_promotion_failure_size(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
695
diff
changeset
|
183 |
| 0 | 184 int pushes() { return _pushes; } |
| 185 int pops() { return _pops; } | |
| 186 int steals() { return _steals; } | |
| 187 int steal_attempts() { return _steal_attempts; } | |
| 188 int term_attempts() { return _term_attempts; } | |
| 189 int overflow_pushes() { return _overflow_pushes; } | |
| 190 int overflow_refills() { return _overflow_refills; } | |
| 191 int overflow_refill_objs() { return _overflow_refill_objs; } | |
| 192 | |
| 193 void note_push() { if (PAR_STATS_ENABLED) _pushes++; } | |
| 194 void note_pop() { if (PAR_STATS_ENABLED) _pops++; } | |
| 195 void note_steal() { if (PAR_STATS_ENABLED) _steals++; } | |
| 196 void note_steal_attempt() { if (PAR_STATS_ENABLED) _steal_attempts++; } | |
| 197 void note_term_attempt() { if (PAR_STATS_ENABLED) _term_attempts++; } | |
| 198 void note_overflow_push() { if (PAR_STATS_ENABLED) _overflow_pushes++; } | |
| 199 void note_overflow_refill(int objs) { | |
| 200 if (PAR_STATS_ENABLED) { | |
| 201 _overflow_refills++; | |
| 202 _overflow_refill_objs += objs; | |
| 203 } | |
| 204 } | |
| 205 | |
| 206 void start_strong_roots() { | |
| 207 _start_strong_roots = os::elapsedTime(); | |
| 208 } | |
| 209 void end_strong_roots() { | |
| 210 _strong_roots_time += (os::elapsedTime() - _start_strong_roots); | |
| 211 } | |
| 212 double strong_roots_time() { return _strong_roots_time; } | |
| 213 void start_term_time() { | |
| 214 note_term_attempt(); | |
| 215 _start_term = os::elapsedTime(); | |
| 216 } | |
| 217 void end_term_time() { | |
| 218 _term_time += (os::elapsedTime() - _start_term); | |
| 219 } | |
| 220 double term_time() { return _term_time; } | |
| 221 | |
| 222 double elapsed() { | |
| 223 return os::elapsedTime() - _start; | |
| 224 } | |
| 225 }; | |
| 226 | |
| 227 class ParNewGenTask: public AbstractGangTask { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
228 private: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
229 ParNewGeneration* _gen; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
230 Generation* _next_gen; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
231 HeapWord* _young_old_boundary; |
| 0 | 232 class ParScanThreadStateSet* _state_set; |
| 233 | |
| 234 public: | |
| 235 ParNewGenTask(ParNewGeneration* gen, | |
| 236 Generation* next_gen, | |
| 237 HeapWord* young_old_boundary, | |
| 238 ParScanThreadStateSet* state_set); | |
| 239 | |
| 240 HeapWord* young_old_boundary() { return _young_old_boundary; } | |
| 241 | |
| 242 void work(int i); | |
| 243 }; | |
| 244 | |
| 245 class KeepAliveClosure: public DefNewGeneration::KeepAliveClosure { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
246 protected: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
247 template <class T> void do_oop_work(T* p); |
| 0 | 248 public: |
| 249 KeepAliveClosure(ScanWeakRefClosure* cl); | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
250 virtual void do_oop(oop* p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
251 virtual void do_oop(narrowOop* p); |
| 0 | 252 }; |
| 253 | |
| 254 class EvacuateFollowersClosureGeneral: public VoidClosure { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
255 private: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
256 GenCollectedHeap* _gch; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
257 int _level; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
258 OopsInGenClosure* _scan_cur_or_nonheap; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
259 OopsInGenClosure* _scan_older; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
260 public: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
261 EvacuateFollowersClosureGeneral(GenCollectedHeap* gch, int level, |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
262 OopsInGenClosure* cur, |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
263 OopsInGenClosure* older); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
264 virtual void do_void(); |
| 0 | 265 }; |
| 266 | |
| 267 // Closure for scanning ParNewGeneration. | |
| 268 // Same as ScanClosure, except does parallel GC barrier. | |
| 269 class ScanClosureWithParBarrier: public ScanClosure { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
270 protected: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
271 template <class T> void do_oop_work(T* p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
272 public: |
| 0 | 273 ScanClosureWithParBarrier(ParNewGeneration* g, bool gc_barrier); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
274 virtual void do_oop(oop* p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
275 virtual void do_oop(narrowOop* p); |
| 0 | 276 }; |
| 277 | |
| 278 // Implements AbstractRefProcTaskExecutor for ParNew. | |
| 279 class ParNewRefProcTaskExecutor: public AbstractRefProcTaskExecutor { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
280 private: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
281 ParNewGeneration& _generation; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
282 ParScanThreadStateSet& _state_set; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
283 public: |
| 0 | 284 ParNewRefProcTaskExecutor(ParNewGeneration& generation, |
| 285 ParScanThreadStateSet& state_set) | |
| 286 : _generation(generation), _state_set(state_set) | |
| 287 { } | |
| 288 | |
| 289 // Executes a task using worker threads. | |
| 290 virtual void execute(ProcessTask& task); | |
| 291 virtual void execute(EnqueueTask& task); | |
| 292 // Switch to single threaded mode. | |
| 293 virtual void set_single_threaded_mode(); | |
| 294 }; | |
| 295 | |
| 296 | |
| 297 // A Generation that does parallel young-gen collection. | |
| 298 | |
| 299 class ParNewGeneration: public DefNewGeneration { | |
| 300 friend class ParNewGenTask; | |
| 301 friend class ParNewRefProcTask; | |
| 302 friend class ParNewRefProcTaskExecutor; | |
| 303 friend class ParScanThreadStateSet; | |
| 534 | 304 friend class ParEvacuateFollowersClosure; |
| 0 | 305 |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
306 private: |
| 695 | 307 // The per-worker-thread work queues |
| 0 | 308 ObjToScanQueueSet* _task_queues; |
| 309 | |
| 695 | 310 // Per-worker-thread local overflow stacks |
| 311 GrowableArray<oop>** _overflow_stacks; | |
| 312 | |
| 0 | 313 // Desired size of survivor space plab's |
| 314 PLABStats _plab_stats; | |
| 315 | |
| 316 // A list of from-space images of to-be-scanned objects, threaded through | |
| 317 // klass-pointers (klass information already copied to the forwarded | |
| 318 // image.) Manipulated with CAS. | |
| 319 oop _overflow_list; | |
| 534 | 320 NOT_PRODUCT(ssize_t _num_par_pushes;) |
| 0 | 321 |
| 322 // If true, older generation does not support promotion undo, so avoid. | |
| 323 static bool _avoid_promotion_undo; | |
| 324 | |
| 325 // This closure is used by the reference processor to filter out | |
| 326 // references to live referent. | |
| 327 DefNewGeneration::IsAliveClosure _is_alive_closure; | |
| 328 | |
| 329 static oop real_forwardee_slow(oop obj); | |
| 330 static void waste_some_time(); | |
| 331 | |
| 332 // Preserve the mark of "obj", if necessary, in preparation for its mark | |
| 333 // word being overwritten with a self-forwarding-pointer. | |
| 334 void preserve_mark_if_necessary(oop obj, markOop m); | |
| 335 | |
| 336 protected: | |
| 337 | |
| 338 bool _survivor_overflow; | |
| 339 | |
| 340 bool avoid_promotion_undo() { return _avoid_promotion_undo; } | |
| 341 void set_avoid_promotion_undo(bool v) { _avoid_promotion_undo = v; } | |
| 342 | |
| 343 bool survivor_overflow() { return _survivor_overflow; } | |
| 344 void set_survivor_overflow(bool v) { _survivor_overflow = v; } | |
| 345 | |
| 346 // Adjust the tenuring threshold. See the implementation for | |
| 347 // the details of the policy. | |
| 348 virtual void adjust_desired_tenuring_threshold(); | |
| 349 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
350 public: |
| 0 | 351 ParNewGeneration(ReservedSpace rs, size_t initial_byte_size, int level); |
| 352 | |
| 353 ~ParNewGeneration() { | |
| 354 for (uint i = 0; i < ParallelGCThreads; i++) | |
| 355 delete _task_queues->queue(i); | |
| 356 | |
| 357 delete _task_queues; | |
| 358 } | |
| 359 | |
| 360 virtual void ref_processor_init(); | |
| 361 virtual Generation::Name kind() { return Generation::ParNew; } | |
| 362 virtual const char* name() const; | |
| 363 virtual const char* short_name() const { return "ParNew"; } | |
| 364 | |
| 365 // override | |
| 366 virtual bool refs_discovery_is_mt() const { | |
| 367 assert(UseParNewGC, "ParNewGeneration only when UseParNewGC"); | |
| 368 return ParallelGCThreads > 1; | |
| 369 } | |
| 370 | |
| 371 // Make the collection virtual. | |
| 372 virtual void collect(bool full, | |
| 373 bool clear_all_soft_refs, | |
| 374 size_t size, | |
| 375 bool is_tlab); | |
| 376 | |
| 377 // This needs to be visible to the closure function. | |
| 378 // "obj" is the object to be copied, "m" is a recent value of its mark | |
| 379 // that must not contain a forwarding pointer (though one might be | |
| 380 // inserted in "obj"s mark word by a parallel thread). | |
| 381 inline oop copy_to_survivor_space(ParScanThreadState* par_scan_state, | |
| 382 oop obj, size_t obj_sz, markOop m) { | |
| 383 if (_avoid_promotion_undo) { | |
| 384 return copy_to_survivor_space_avoiding_promotion_undo(par_scan_state, | |
| 385 obj, obj_sz, m); | |
| 386 } | |
| 387 | |
| 388 return copy_to_survivor_space_with_undo(par_scan_state, obj, obj_sz, m); | |
| 389 } | |
| 390 | |
| 391 oop copy_to_survivor_space_avoiding_promotion_undo(ParScanThreadState* par_scan_state, | |
| 392 oop obj, size_t obj_sz, markOop m); | |
| 393 | |
| 394 oop copy_to_survivor_space_with_undo(ParScanThreadState* par_scan_state, | |
| 395 oop obj, size_t obj_sz, markOop m); | |
| 396 | |
| 534 | 397 // in support of testing overflow code |
| 398 NOT_PRODUCT(int _overflow_counter;) | |
| 399 NOT_PRODUCT(bool should_simulate_overflow();) | |
| 400 | |
|
679
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
401 // Accessor for overflow list |
|
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
402 oop overflow_list() { return _overflow_list; } |
|
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
403 |
| 0 | 404 // Push the given (from-space) object on the global overflow list. |
| 534 | 405 void push_on_overflow_list(oop from_space_obj, ParScanThreadState* par_scan_state); |
| 0 | 406 |
| 407 // If the global overflow list is non-empty, move some tasks from it | |
|
679
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
408 // onto "work_q" (which need not be empty). No more than 1/4 of the |
|
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
409 // available space on "work_q" is used. |
| 0 | 410 bool take_from_overflow_list(ParScanThreadState* par_scan_state); |
|
679
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
579
diff
changeset
|
411 bool take_from_overflow_list_work(ParScanThreadState* par_scan_state); |
| 0 | 412 |
| 413 // The task queues to be used by parallel GC threads. | |
| 414 ObjToScanQueueSet* task_queues() { | |
| 415 return _task_queues; | |
| 416 } | |
| 417 | |
| 418 PLABStats* plab_stats() { | |
| 419 return &_plab_stats; | |
| 420 } | |
| 421 | |
| 422 size_t desired_plab_sz() { | |
| 423 return _plab_stats.desired_plab_sz(); | |
| 424 } | |
| 425 | |
| 426 static oop real_forwardee(oop obj); | |
| 427 | |
| 428 DEBUG_ONLY(static bool is_legal_forward_ptr(oop p);) | |
| 429 }; |