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