1 /* 2 * Copyright (c) 2002, 2012, 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_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONMANAGER_HPP 26 #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONMANAGER_HPP 27 28 #include "gc_implementation/parallelScavenge/psOldGen.hpp" 29 #include "gc_implementation/parallelScavenge/psPromotionLAB.hpp" 30 #include "memory/allocation.hpp" 31 #include "utilities/taskqueue.hpp" 32 33 // 34 // psPromotionManager is used by a single thread to manage object survival 35 // during a scavenge. The promotion manager contains thread local data only. 36 // 37 // NOTE! Be carefull when allocating the stacks on cheap. If you are going 38 // to use a promotion manager in more than one thread, the stacks MUST be 39 // on cheap. This can lead to memory leaks, though, as they are not auto 40 // deallocated. 41 // 42 // FIX ME FIX ME Add a destructor, and don't rely on the user to drain/flush/deallocate! 43 // 44 45 // Move to some global location 46 #define HAS_BEEN_MOVED 0x1501d01d 47 // End move to some global location 48 49 class MutableSpace; 50 class PSOldGen; 51 class ParCompactionManager; 52 53 class PSPromotionManager : public CHeapObj { 54 friend class PSScavenge; 55 friend class PSRefProcTaskExecutor; 56 private: 57 static PSPromotionManager** _manager_array; 58 static OopStarTaskQueueSet* _stack_array_depth; 59 static PSOldGen* _old_gen; 60 static MutableSpace* _young_space; 61 62 #if TASKQUEUE_STATS 63 size_t _masked_pushes; 64 size_t _masked_steals; 65 size_t _arrays_chunked; 66 size_t _array_chunks_processed; 67 68 void print_taskqueue_stats(uint i) const; 69 void print_local_stats(uint i) const; 70 static void print_stats(); 71 72 void reset_stats(); 73 #endif // TASKQUEUE_STATS 74 75 PSYoungPromotionLAB _young_lab; 76 PSOldPromotionLAB _old_lab; 77 bool _young_gen_is_full; 78 bool _old_gen_is_full; 79 80 OopStarTaskQueue _claimed_stack_depth; 81 OverflowTaskQueue<oop> _claimed_stack_breadth; 82 83 bool _totally_drain; 84 uint _target_stack_size; 85 86 uint _array_chunk_size; 87 uint _min_array_size_for_chunking; 88 89 // Accessors 90 static PSOldGen* old_gen() { return _old_gen; } 91 static MutableSpace* young_space() { return _young_space; } 92 93 inline static PSPromotionManager* manager_array(int index); 94 template <class T> inline void claim_or_forward_internal_depth(T* p); 95 96 // On the task queues we push reference locations as well as 97 // partially-scanned arrays (in the latter case, we push an oop to 98 // the from-space image of the array and the length on the 99 // from-space image indicates how many entries on the array we still 100 // need to scan; this is basically how ParNew does partial array 101 // scanning too). To be able to distinguish between reference 102 // locations and partially-scanned array oops we simply mask the 103 // latter oops with 0x01. The next three methods do the masking, 104 // unmasking, and checking whether the oop is masked or not. Notice 105 // that the signature of the mask and unmask methods looks a bit 106 // strange, as they accept and return different types (oop and 107 // oop*). This is because of the difference in types between what 108 // the task queue holds (oop*) and oops to partially-scanned arrays 109 // (oop). We do all the necessary casting in the mask / unmask 110 // methods to avoid sprinkling the rest of the code with more casts. 111 112 // These are added to the taskqueue so PS_CHUNKED_ARRAY_OOP_MASK (or any 113 // future masks) can't conflict with COMPRESSED_OOP_MASK 114 #define PS_CHUNKED_ARRAY_OOP_MASK 0x2 115 116 bool is_oop_masked(StarTask p) { 117 // If something is marked chunked it's always treated like wide oop* 118 return (((intptr_t)(oop*)p) & PS_CHUNKED_ARRAY_OOP_MASK) == 119 PS_CHUNKED_ARRAY_OOP_MASK; 120 } 121 122 oop* mask_chunked_array_oop(oop obj) { 123 assert(!is_oop_masked((oop*) obj), "invariant"); 124 oop* ret = (oop*) ((uintptr_t)obj | PS_CHUNKED_ARRAY_OOP_MASK); 125 assert(is_oop_masked(ret), "invariant"); 126 return ret; 127 } 128 129 oop unmask_chunked_array_oop(StarTask p) { 130 assert(is_oop_masked(p), "invariant"); 131 assert(!p.is_narrow(), "chunked array oops cannot be narrow"); 132 oop *chunk = (oop*)p; // cast p to oop (uses conversion operator) 133 oop ret = oop((oop*)((uintptr_t)chunk & ~PS_CHUNKED_ARRAY_OOP_MASK)); 134 assert(!is_oop_masked((oop*) ret), "invariant"); 135 return ret; 136 } 137 138 template <class T> void process_array_chunk_work(oop obj, 139 int start, int end); 140 void process_array_chunk(oop old); 141 142 template <class T> void push_depth(T* p) { 143 claimed_stack_depth()->push(p); 144 } 145 146 protected: 147 static OopStarTaskQueueSet* stack_array_depth() { return _stack_array_depth; } 148 public: 149 // Static 150 static void initialize(); 151 152 static void pre_scavenge(); 153 static void post_scavenge(); 154 155 static PSPromotionManager* gc_thread_promotion_manager(int index); 156 static PSPromotionManager* vm_thread_promotion_manager(); 157 158 static bool steal_depth(int queue_num, int* seed, StarTask& t) { 159 return stack_array_depth()->steal(queue_num, seed, t); 160 } 161 162 PSPromotionManager(); 163 164 // Accessors 165 OopStarTaskQueue* claimed_stack_depth() { 166 return &_claimed_stack_depth; 167 } 168 169 bool young_gen_is_full() { return _young_gen_is_full; } 170 171 bool old_gen_is_full() { return _old_gen_is_full; } 172 void set_old_gen_is_full(bool state) { _old_gen_is_full = state; } 173 174 // Promotion methods 175 template<bool promote_immediately> oop copy_to_survivor_space(oop o); 176 oop oop_promotion_failed(oop obj, markOop obj_mark); 177 178 void reset(); 179 180 void flush_labs(); 181 void drain_stacks(bool totally_drain) { 182 drain_stacks_depth(totally_drain); 183 } 184 public: 185 void drain_stacks_cond_depth() { 186 if (claimed_stack_depth()->size() > _target_stack_size) { 187 drain_stacks_depth(false); 188 } 189 } 190 void drain_stacks_depth(bool totally_drain); 191 192 bool stacks_empty() { 193 return claimed_stack_depth()->is_empty(); 194 } 195 196 inline void process_popped_location_depth(StarTask p); 197 198 template <class T> inline void claim_or_forward_depth(T* p); 199 200 TASKQUEUE_STATS_ONLY(inline void record_steal(StarTask& p);) 201 }; 202 203 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONMANAGER_HPP