Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/parallelScavenge/psPromotionManager.hpp @ 1662:e0ba4e04c839
6969574: invokedynamic call sites deoptimize instead of executing
Reviewed-by: kvn
author | jrose |
---|---|
date | Fri, 16 Jul 2010 18:14:19 -0700 |
parents | b2a00dd3117c |
children | a93a9eda13f7 |
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 #define PS_PM_STATS 0 | |
46 | |
47 class PSPromotionManager : public CHeapObj { | |
48 friend class PSScavenge; | |
49 friend class PSRefProcTaskExecutor; | |
50 private: | |
51 static PSPromotionManager** _manager_array; | |
52 static OopStarTaskQueueSet* _stack_array_depth; | |
53 static OopTaskQueueSet* _stack_array_breadth; | |
54 static PSOldGen* _old_gen; | |
55 static MutableSpace* _young_space; | |
56 | |
57 #if PS_PM_STATS | |
58 uint _total_pushes; | |
59 uint _masked_pushes; | |
60 | |
61 uint _overflow_pushes; | |
62 uint _max_overflow_length; | |
63 | |
64 uint _arrays_chunked; | |
65 uint _array_chunks_processed; | |
66 | |
67 uint _total_steals; | |
68 uint _masked_steals; | |
69 | |
70 void print_stats(uint i); | |
71 static void print_stats(); | |
72 #endif // PS_PM_STATS | |
73 | |
74 PSYoungPromotionLAB _young_lab; | |
75 PSOldPromotionLAB _old_lab; | |
76 bool _young_gen_is_full; | |
77 bool _old_gen_is_full; | |
78 PrefetchQueue _prefetch_queue; | |
79 | |
80 OopStarTaskQueue _claimed_stack_depth; | |
1638 | 81 OverflowTaskQueue<oop> _claimed_stack_breadth; |
0 | 82 |
83 bool _depth_first; | |
84 bool _totally_drain; | |
85 uint _target_stack_size; | |
86 | |
87 uint _array_chunk_size; | |
88 uint _min_array_size_for_chunking; | |
89 | |
90 // Accessors | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
91 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
|
92 static MutableSpace* young_space() { return _young_space; } |
0 | 93 |
94 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
|
95 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
|
96 template <class T> inline void claim_or_forward_internal_breadth(T* p); |
0 | 97 |
98 // On the task queues we push reference locations as well as | |
99 // partially-scanned arrays (in the latter case, we push an oop to | |
100 // the from-space image of the array and the length on the | |
101 // from-space image indicates how many entries on the array we still | |
102 // need to scan; this is basically how ParNew does partial array | |
103 // scanning too). To be able to distinguish between reference | |
104 // locations and partially-scanned array oops we simply mask the | |
105 // latter oops with 0x01. The next three methods do the masking, | |
106 // unmasking, and checking whether the oop is masked or not. Notice | |
107 // that the signature of the mask and unmask methods looks a bit | |
108 // strange, as they accept and return different types (oop and | |
109 // oop*). This is because of the difference in types between what | |
110 // the task queue holds (oop*) and oops to partially-scanned arrays | |
111 // (oop). We do all the necessary casting in the mask / unmask | |
112 // methods to avoid sprinkling the rest of the code with more casts. | |
113 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
114 // 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
|
115 // 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
|
116 #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
|
117 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
118 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
|
119 // 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
|
120 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
|
121 PS_CHUNKED_ARRAY_OOP_MASK; |
0 | 122 } |
123 | |
124 oop* mask_chunked_array_oop(oop obj) { | |
125 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
|
126 oop* ret = (oop*) ((uintptr_t)obj | PS_CHUNKED_ARRAY_OOP_MASK); |
0 | 127 assert(is_oop_masked(ret), "invariant"); |
128 return ret; | |
129 } | |
130 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
131 oop unmask_chunked_array_oop(StarTask p) { |
0 | 132 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
|
133 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
|
134 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
|
135 oop ret = oop((oop*)((uintptr_t)chunk & ~PS_CHUNKED_ARRAY_OOP_MASK)); |
0 | 136 assert(!is_oop_masked((oop*) ret), "invariant"); |
137 return ret; | |
138 } | |
139 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
140 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
|
141 int start, int end); |
0 | 142 void process_array_chunk(oop old); |
143 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
144 template <class T> void push_depth(T* p) { |
0 | 145 assert(depth_first(), "pre-condition"); |
146 | |
147 #if PS_PM_STATS | |
148 ++_total_pushes; | |
1638 | 149 int stack_length = claimed_stack_depth()->overflow_stack()->length(); |
0 | 150 #endif // PS_PM_STATS |
151 | |
1638 | 152 claimed_stack_depth()->push(p); |
153 | |
0 | 154 #if PS_PM_STATS |
1638 | 155 if (claimed_stack_depth()->overflow_stack()->length() != stack_length) { |
0 | 156 ++_overflow_pushes; |
1638 | 157 if ((uint)stack_length + 1 > _max_overflow_length) { |
158 _max_overflow_length = (uint)stack_length + 1; | |
0 | 159 } |
1638 | 160 } |
0 | 161 #endif // PS_PM_STATS |
162 } | |
163 | |
164 void push_breadth(oop o) { | |
165 assert(!depth_first(), "pre-condition"); | |
166 | |
167 #if PS_PM_STATS | |
168 ++_total_pushes; | |
1638 | 169 int stack_length = claimed_stack_breadth()->overflow_stack()->length(); |
0 | 170 #endif // PS_PM_STATS |
171 | |
1638 | 172 claimed_stack_breadth()->push(o); |
173 | |
0 | 174 #if PS_PM_STATS |
1638 | 175 if (claimed_stack_breadth()->overflow_stack()->length() != stack_length) { |
0 | 176 ++_overflow_pushes; |
1638 | 177 if ((uint)stack_length + 1 > _max_overflow_length) { |
178 _max_overflow_length = (uint)stack_length + 1; | |
0 | 179 } |
1638 | 180 } |
0 | 181 #endif // PS_PM_STATS |
182 } | |
183 | |
184 protected: | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
185 static OopStarTaskQueueSet* stack_array_depth() { return _stack_array_depth; } |
0 | 186 static OopTaskQueueSet* stack_array_breadth() { return _stack_array_breadth; } |
187 | |
188 public: | |
189 // Static | |
190 static void initialize(); | |
191 | |
192 static void pre_scavenge(); | |
193 static void post_scavenge(); | |
194 | |
195 static PSPromotionManager* gc_thread_promotion_manager(int index); | |
196 static PSPromotionManager* vm_thread_promotion_manager(); | |
197 | |
198 static bool steal_depth(int queue_num, int* seed, StarTask& t) { | |
199 return stack_array_depth()->steal(queue_num, seed, t); | |
200 } | |
201 | |
1638 | 202 static bool steal_breadth(int queue_num, int* seed, oop& t) { |
0 | 203 return stack_array_breadth()->steal(queue_num, seed, t); |
204 } | |
205 | |
206 PSPromotionManager(); | |
207 | |
208 // Accessors | |
209 OopStarTaskQueue* claimed_stack_depth() { | |
210 return &_claimed_stack_depth; | |
211 } | |
1638 | 212 OverflowTaskQueue<oop>* claimed_stack_breadth() { |
0 | 213 return &_claimed_stack_breadth; |
214 } | |
215 | |
216 bool young_gen_is_full() { return _young_gen_is_full; } | |
217 | |
218 bool old_gen_is_full() { return _old_gen_is_full; } | |
219 void set_old_gen_is_full(bool state) { _old_gen_is_full = state; } | |
220 | |
221 // Promotion methods | |
222 oop copy_to_survivor_space(oop o, bool depth_first); | |
223 oop oop_promotion_failed(oop obj, markOop obj_mark); | |
224 | |
225 void reset(); | |
226 | |
227 void flush_labs(); | |
228 void drain_stacks(bool totally_drain) { | |
229 if (depth_first()) { | |
230 drain_stacks_depth(totally_drain); | |
231 } else { | |
232 drain_stacks_breadth(totally_drain); | |
233 } | |
234 } | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
235 public: |
0 | 236 void drain_stacks_cond_depth() { |
237 if (claimed_stack_depth()->size() > _target_stack_size) { | |
238 drain_stacks_depth(false); | |
239 } | |
240 } | |
241 void drain_stacks_depth(bool totally_drain); | |
242 void drain_stacks_breadth(bool totally_drain); | |
243 | |
1638 | 244 bool depth_first() const { |
245 return _depth_first; | |
0 | 246 } |
247 bool stacks_empty() { | |
1638 | 248 return depth_first() ? |
249 claimed_stack_depth()->is_empty() : | |
250 claimed_stack_breadth()->is_empty(); | |
0 | 251 } |
252 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
253 inline void process_popped_location_depth(StarTask p); |
0 | 254 |
255 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
|
256 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
|
257 template <class T> inline void claim_or_forward_breadth(T* p); |
0 | 258 |
259 #if PS_PM_STATS | |
260 void increment_steals(oop* p = NULL) { | |
261 _total_steals += 1; | |
262 if (p != NULL && is_oop_masked(p)) { | |
263 _masked_steals += 1; | |
264 } | |
265 } | |
266 #endif // PS_PM_STATS | |
267 }; |