Tue, 07 Oct 2008 11:01:35 -0700
Merge
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 2005-2007 Sun Microsystems, Inc. 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 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | // |
duke@435 | 26 | // psPromotionManager is used by a single thread to manage object survival |
duke@435 | 27 | // during a scavenge. The promotion manager contains thread local data only. |
duke@435 | 28 | // |
duke@435 | 29 | // NOTE! Be carefull when allocating the stacks on cheap. If you are going |
duke@435 | 30 | // to use a promotion manager in more than one thread, the stacks MUST be |
duke@435 | 31 | // on cheap. This can lead to memory leaks, though, as they are not auto |
duke@435 | 32 | // deallocated. |
duke@435 | 33 | // |
duke@435 | 34 | // FIX ME FIX ME Add a destructor, and don't rely on the user to drain/flush/deallocate! |
duke@435 | 35 | // |
duke@435 | 36 | |
duke@435 | 37 | // Move to some global location |
duke@435 | 38 | #define HAS_BEEN_MOVED 0x1501d01d |
duke@435 | 39 | // End move to some global location |
duke@435 | 40 | |
duke@435 | 41 | |
duke@435 | 42 | class MutableSpace; |
duke@435 | 43 | class PSOldGen; |
duke@435 | 44 | class ParCompactionManager; |
duke@435 | 45 | class ObjectStartArray; |
duke@435 | 46 | class ParallelCompactData; |
duke@435 | 47 | class ParMarkBitMap; |
duke@435 | 48 | |
duke@435 | 49 | // Move to it's own file if this works out. |
duke@435 | 50 | |
duke@435 | 51 | class ParCompactionManager : public CHeapObj { |
duke@435 | 52 | friend class ParallelTaskTerminator; |
duke@435 | 53 | friend class ParMarkBitMap; |
duke@435 | 54 | friend class PSParallelCompact; |
jcoomes@810 | 55 | friend class StealRegionCompactionTask; |
duke@435 | 56 | friend class UpdateAndFillClosure; |
duke@435 | 57 | friend class RefProcTaskExecutor; |
duke@435 | 58 | |
duke@435 | 59 | public: |
duke@435 | 60 | |
duke@435 | 61 | // ------------------------ Don't putback if not needed |
duke@435 | 62 | // Actions that the compaction manager should take. |
duke@435 | 63 | enum Action { |
duke@435 | 64 | Update, |
duke@435 | 65 | Copy, |
duke@435 | 66 | UpdateAndCopy, |
duke@435 | 67 | CopyAndUpdate, |
duke@435 | 68 | VerifyUpdate, |
duke@435 | 69 | ResetObjects, |
duke@435 | 70 | NotValid |
duke@435 | 71 | }; |
duke@435 | 72 | // ------------------------ End don't putback if not needed |
duke@435 | 73 | |
duke@435 | 74 | private: |
jcoomes@810 | 75 | static ParCompactionManager** _manager_array; |
jcoomes@810 | 76 | static OopTaskQueueSet* _stack_array; |
jcoomes@810 | 77 | static ObjectStartArray* _start_array; |
jcoomes@810 | 78 | static RegionTaskQueueSet* _region_array; |
jcoomes@810 | 79 | static PSOldGen* _old_gen; |
duke@435 | 80 | |
jcoomes@810 | 81 | OopTaskQueue _marking_stack; |
jcoomes@810 | 82 | GrowableArray<oop>* _overflow_stack; |
duke@435 | 83 | // Is there a way to reuse the _marking_stack for the |
jcoomes@810 | 84 | // saving empty regions? For now just create a different |
duke@435 | 85 | // type of TaskQueue. |
duke@435 | 86 | |
jcoomes@810 | 87 | #ifdef USE_RegionTaskQueueWithOverflow |
jcoomes@810 | 88 | RegionTaskQueueWithOverflow _region_stack; |
duke@435 | 89 | #else |
jcoomes@810 | 90 | RegionTaskQueue _region_stack; |
jcoomes@810 | 91 | GrowableArray<size_t>* _region_overflow_stack; |
duke@435 | 92 | #endif |
duke@435 | 93 | |
duke@435 | 94 | #if 1 // does this happen enough to need a per thread stack? |
jcoomes@810 | 95 | GrowableArray<Klass*>* _revisit_klass_stack; |
duke@435 | 96 | #endif |
duke@435 | 97 | static ParMarkBitMap* _mark_bitmap; |
duke@435 | 98 | |
duke@435 | 99 | Action _action; |
duke@435 | 100 | |
duke@435 | 101 | static PSOldGen* old_gen() { return _old_gen; } |
duke@435 | 102 | static ObjectStartArray* start_array() { return _start_array; } |
jcoomes@810 | 103 | static OopTaskQueueSet* stack_array() { return _stack_array; } |
duke@435 | 104 | |
duke@435 | 105 | static void initialize(ParMarkBitMap* mbm); |
duke@435 | 106 | |
duke@435 | 107 | protected: |
duke@435 | 108 | // Array of tasks. Needed by the ParallelTaskTerminator. |
jcoomes@810 | 109 | static RegionTaskQueueSet* region_array() { return _region_array; } |
jcoomes@810 | 110 | OopTaskQueue* marking_stack() { return &_marking_stack; } |
jcoomes@810 | 111 | GrowableArray<oop>* overflow_stack() { return _overflow_stack; } |
jcoomes@810 | 112 | #ifdef USE_RegionTaskQueueWithOverflow |
jcoomes@810 | 113 | RegionTaskQueueWithOverflow* region_stack() { return &_region_stack; } |
duke@435 | 114 | #else |
jcoomes@810 | 115 | RegionTaskQueue* region_stack() { return &_region_stack; } |
jcoomes@810 | 116 | GrowableArray<size_t>* region_overflow_stack() { |
jcoomes@810 | 117 | return _region_overflow_stack; |
jcoomes@810 | 118 | } |
duke@435 | 119 | #endif |
duke@435 | 120 | |
duke@435 | 121 | // Pushes onto the marking stack. If the marking stack is full, |
duke@435 | 122 | // pushes onto the overflow stack. |
duke@435 | 123 | void stack_push(oop obj); |
duke@435 | 124 | // Do not implement an equivalent stack_pop. Deal with the |
duke@435 | 125 | // marking stack and overflow stack directly. |
duke@435 | 126 | |
jcoomes@810 | 127 | // Pushes onto the region stack. If the region stack is full, |
jcoomes@810 | 128 | // pushes onto the region overflow stack. |
jcoomes@810 | 129 | void region_stack_push(size_t region_index); |
duke@435 | 130 | public: |
duke@435 | 131 | |
duke@435 | 132 | Action action() { return _action; } |
duke@435 | 133 | void set_action(Action v) { _action = v; } |
duke@435 | 134 | |
duke@435 | 135 | inline static ParCompactionManager* manager_array(int index); |
duke@435 | 136 | |
duke@435 | 137 | ParCompactionManager(); |
duke@435 | 138 | ~ParCompactionManager(); |
duke@435 | 139 | |
duke@435 | 140 | void allocate_stacks(); |
duke@435 | 141 | void deallocate_stacks(); |
duke@435 | 142 | ParMarkBitMap* mark_bitmap() { return _mark_bitmap; } |
duke@435 | 143 | |
duke@435 | 144 | // Take actions in preparation for a compaction. |
duke@435 | 145 | static void reset(); |
duke@435 | 146 | |
duke@435 | 147 | // void drain_stacks(); |
duke@435 | 148 | |
duke@435 | 149 | bool should_update(); |
duke@435 | 150 | bool should_copy(); |
duke@435 | 151 | bool should_verify_only(); |
duke@435 | 152 | bool should_reset_only(); |
duke@435 | 153 | |
duke@435 | 154 | #if 1 |
duke@435 | 155 | // Probably stays as a growable array |
duke@435 | 156 | GrowableArray<Klass*>* revisit_klass_stack() { return _revisit_klass_stack; } |
duke@435 | 157 | #endif |
duke@435 | 158 | |
duke@435 | 159 | // Save oop for later processing. Must not fail. |
duke@435 | 160 | void save_for_scanning(oop m); |
duke@435 | 161 | // Get a oop for scanning. If returns null, no oop were found. |
duke@435 | 162 | oop retrieve_for_scanning(); |
duke@435 | 163 | |
jcoomes@810 | 164 | // Save region for later processing. Must not fail. |
jcoomes@810 | 165 | void save_for_processing(size_t region_index); |
jcoomes@810 | 166 | // Get a region for processing. If returns null, no region were found. |
jcoomes@810 | 167 | bool retrieve_for_processing(size_t& region_index); |
duke@435 | 168 | |
duke@435 | 169 | // Access function for compaction managers |
duke@435 | 170 | static ParCompactionManager* gc_thread_compaction_manager(int index); |
duke@435 | 171 | |
duke@435 | 172 | static bool steal(int queue_num, int* seed, Task& t) { |
duke@435 | 173 | return stack_array()->steal(queue_num, seed, t); |
duke@435 | 174 | } |
duke@435 | 175 | |
jcoomes@810 | 176 | static bool steal(int queue_num, int* seed, RegionTask& t) { |
jcoomes@810 | 177 | return region_array()->steal(queue_num, seed, t); |
duke@435 | 178 | } |
duke@435 | 179 | |
duke@435 | 180 | // Process tasks remaining on any stack |
duke@435 | 181 | void drain_marking_stacks(OopClosure *blk); |
duke@435 | 182 | |
duke@435 | 183 | // Process tasks remaining on any stack |
jcoomes@810 | 184 | void drain_region_stacks(); |
duke@435 | 185 | |
duke@435 | 186 | // Process tasks remaining on any stack |
jcoomes@810 | 187 | void drain_region_overflow_stack(); |
duke@435 | 188 | |
duke@435 | 189 | // Debugging support |
duke@435 | 190 | #ifdef ASSERT |
duke@435 | 191 | bool stacks_have_been_allocated(); |
duke@435 | 192 | #endif |
duke@435 | 193 | }; |
duke@435 | 194 | |
duke@435 | 195 | inline ParCompactionManager* ParCompactionManager::manager_array(int index) { |
duke@435 | 196 | assert(_manager_array != NULL, "access of NULL manager_array"); |
duke@435 | 197 | assert(index >= 0 && index <= (int)ParallelGCThreads, |
duke@435 | 198 | "out of range manager_array access"); |
duke@435 | 199 | return _manager_array[index]; |
duke@435 | 200 | } |