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