author | jcoomes |
Fri, 16 Jul 2010 21:33:21 -0700 | |
changeset 6067 | 8bfddf73fc04 |
parent 5918 | 73b96456819a |
child 6251 | 90e562b9f1cc |
permissions | -rw-r--r-- |
1 | 1 |
/* |
5918 | 2 |
* Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved. |
1 | 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 |
* |
|
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5076
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5076
diff
changeset
|
20 |
* or visit www.oracle.com if you need additional information or have any |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5076
diff
changeset
|
21 |
* questions. |
1 | 22 |
* |
23 |
*/ |
|
24 |
||
6067 | 25 |
// Simple TaskQueue stats that are collected by default in debug builds. |
26 |
||
27 |
#if !defined(TASKQUEUE_STATS) && defined(ASSERT) |
|
28 |
#define TASKQUEUE_STATS 1 |
|
29 |
#elif !defined(TASKQUEUE_STATS) |
|
30 |
#define TASKQUEUE_STATS 0 |
|
31 |
#endif |
|
32 |
||
33 |
#if TASKQUEUE_STATS |
|
34 |
#define TASKQUEUE_STATS_ONLY(code) code |
|
35 |
#else |
|
36 |
#define TASKQUEUE_STATS_ONLY(code) |
|
37 |
#endif // TASKQUEUE_STATS |
|
38 |
||
39 |
#if TASKQUEUE_STATS |
|
40 |
class TaskQueueStats { |
|
41 |
public: |
|
42 |
enum StatId { |
|
43 |
push, // number of taskqueue pushes |
|
44 |
pop, // number of taskqueue pops |
|
45 |
pop_slow, // subset of taskqueue pops that were done slow-path |
|
46 |
steal_attempt, // number of taskqueue steal attempts |
|
47 |
steal, // number of taskqueue steals |
|
48 |
overflow, // number of overflow pushes |
|
49 |
overflow_max_len, // max length of overflow stack |
|
50 |
last_stat_id |
|
51 |
}; |
|
52 |
||
53 |
public: |
|
54 |
inline TaskQueueStats() { reset(); } |
|
55 |
||
56 |
inline void record_push() { ++_stats[push]; } |
|
57 |
inline void record_pop() { ++_stats[pop]; } |
|
58 |
inline void record_pop_slow() { record_pop(); ++_stats[pop_slow]; } |
|
59 |
inline void record_steal(bool success); |
|
60 |
inline void record_overflow(size_t new_length); |
|
61 |
||
62 |
inline size_t get(StatId id) const { return _stats[id]; } |
|
63 |
inline const size_t* get() const { return _stats; } |
|
64 |
||
65 |
inline void reset(); |
|
66 |
||
67 |
static void print_header(unsigned int line, outputStream* const stream = tty, |
|
68 |
unsigned int width = 10); |
|
69 |
void print(outputStream* const stream = tty, unsigned int width = 10) const; |
|
70 |
||
71 |
private: |
|
72 |
size_t _stats[last_stat_id]; |
|
73 |
static const char * const _names[last_stat_id]; |
|
74 |
}; |
|
75 |
||
76 |
void TaskQueueStats::record_steal(bool success) { |
|
77 |
++_stats[steal_attempt]; |
|
78 |
if (success) ++_stats[steal]; |
|
79 |
} |
|
80 |
||
81 |
void TaskQueueStats::record_overflow(size_t new_len) { |
|
82 |
++_stats[overflow]; |
|
83 |
if (new_len > _stats[overflow_max_len]) _stats[overflow_max_len] = new_len; |
|
84 |
} |
|
85 |
||
86 |
void TaskQueueStats::reset() { |
|
87 |
memset(_stats, 0, sizeof(_stats)); |
|
88 |
} |
|
89 |
#endif // TASKQUEUE_STATS |
|
90 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
91 |
template <unsigned int N> |
1 | 92 |
class TaskQueueSuper: public CHeapObj { |
93 |
protected: |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
94 |
// Internal type for indexing the queue; also used for the tag. |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
95 |
typedef NOT_LP64(uint16_t) LP64_ONLY(uint32_t) idx_t; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
96 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
97 |
// The first free element after the last one pushed (mod N). |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
98 |
volatile uint _bottom; |
1 | 99 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
100 |
enum { MOD_N_MASK = N - 1 }; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
101 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
102 |
class Age { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
103 |
public: |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
104 |
Age(size_t data = 0) { _data = data; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
105 |
Age(const Age& age) { _data = age._data; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
106 |
Age(idx_t top, idx_t tag) { _fields._top = top; _fields._tag = tag; } |
1 | 107 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
108 |
Age get() const volatile { return _data; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
109 |
void set(Age age) volatile { _data = age._data; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
110 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
111 |
idx_t top() const volatile { return _fields._top; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
112 |
idx_t tag() const volatile { return _fields._tag; } |
1 | 113 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
114 |
// Increment top; if it wraps, increment tag also. |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
115 |
void increment() { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
116 |
_fields._top = increment_index(_fields._top); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
117 |
if (_fields._top == 0) ++_fields._tag; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
118 |
} |
1 | 119 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
120 |
Age cmpxchg(const Age new_age, const Age old_age) volatile { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
121 |
return (size_t) Atomic::cmpxchg_ptr((intptr_t)new_age._data, |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
122 |
(volatile intptr_t *)&_data, |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
123 |
(intptr_t)old_age._data); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
124 |
} |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
125 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
126 |
bool operator ==(const Age& other) const { return _data == other._data; } |
1 | 127 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
128 |
private: |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
129 |
struct fields { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
130 |
idx_t _top; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
131 |
idx_t _tag; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
132 |
}; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
133 |
union { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
134 |
size_t _data; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
135 |
fields _fields; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
136 |
}; |
1 | 137 |
}; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
138 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
139 |
volatile Age _age; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
140 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
141 |
// These both operate mod N. |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
142 |
static uint increment_index(uint ind) { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
143 |
return (ind + 1) & MOD_N_MASK; |
1 | 144 |
} |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
145 |
static uint decrement_index(uint ind) { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
146 |
return (ind - 1) & MOD_N_MASK; |
1 | 147 |
} |
148 |
||
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
149 |
// Returns a number in the range [0..N). If the result is "N-1", it should be |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
150 |
// interpreted as 0. |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
151 |
uint dirty_size(uint bot, uint top) const { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
152 |
return (bot - top) & MOD_N_MASK; |
1 | 153 |
} |
154 |
||
155 |
// Returns the size corresponding to the given "bot" and "top". |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
156 |
uint size(uint bot, uint top) const { |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
157 |
uint sz = dirty_size(bot, top); |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
158 |
// Has the queue "wrapped", so that bottom is less than top? There's a |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
159 |
// complicated special case here. A pair of threads could perform pop_local |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
160 |
// and pop_global operations concurrently, starting from a state in which |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
161 |
// _bottom == _top+1. The pop_local could succeed in decrementing _bottom, |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
162 |
// and the pop_global in incrementing _top (in which case the pop_global |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
163 |
// will be awarded the contested queue element.) The resulting state must |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
164 |
// be interpreted as an empty queue. (We only need to worry about one such |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
165 |
// event: only the queue owner performs pop_local's, and several concurrent |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
166 |
// threads attempting to perform the pop_global will all perform the same |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
167 |
// CAS, and only one can succeed.) Any stealing thread that reads after |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
168 |
// either the increment or decrement will see an empty queue, and will not |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
169 |
// join the competitors. The "sz == -1 || sz == N-1" state will not be |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
170 |
// modified by concurrent queues, so the owner thread can reset the state to |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
171 |
// _bottom == top so subsequent pushes will be performed normally. |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
172 |
return (sz == N - 1) ? 0 : sz; |
1 | 173 |
} |
174 |
||
175 |
public: |
|
176 |
TaskQueueSuper() : _bottom(0), _age() {} |
|
177 |
||
5918 | 178 |
// Return true if the TaskQueue contains/does not contain any tasks. |
179 |
bool peek() const { return _bottom != _age.top(); } |
|
180 |
bool is_empty() const { return size() == 0; } |
|
1 | 181 |
|
182 |
// Return an estimate of the number of elements in the queue. |
|
183 |
// The "careful" version admits the possibility of pop_local/pop_global |
|
184 |
// races. |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
185 |
uint size() const { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
186 |
return size(_bottom, _age.top()); |
1 | 187 |
} |
188 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
189 |
uint dirty_size() const { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
190 |
return dirty_size(_bottom, _age.top()); |
1 | 191 |
} |
192 |
||
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
193 |
void set_empty() { |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
194 |
_bottom = 0; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
195 |
_age.set(0); |
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
196 |
} |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
197 |
|
1 | 198 |
// Maximum number of elements allowed in the queue. This is two less |
199 |
// than the actual queue size, for somewhat complicated reasons. |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
200 |
uint max_elems() const { return N - 2; } |
5035 | 201 |
|
202 |
// Total size of queue. |
|
203 |
static const uint total_size() { return N; } |
|
6067 | 204 |
|
205 |
TASKQUEUE_STATS_ONLY(TaskQueueStats stats;) |
|
1 | 206 |
}; |
207 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
208 |
template<class E, unsigned int N = TASKQUEUE_SIZE> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
209 |
class GenericTaskQueue: public TaskQueueSuper<N> { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
210 |
protected: |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
211 |
typedef typename TaskQueueSuper<N>::Age Age; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
212 |
typedef typename TaskQueueSuper<N>::idx_t idx_t; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
213 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
214 |
using TaskQueueSuper<N>::_bottom; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
215 |
using TaskQueueSuper<N>::_age; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
216 |
using TaskQueueSuper<N>::increment_index; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
217 |
using TaskQueueSuper<N>::decrement_index; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
218 |
using TaskQueueSuper<N>::dirty_size; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
219 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
220 |
public: |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
221 |
using TaskQueueSuper<N>::max_elems; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
222 |
using TaskQueueSuper<N>::size; |
6067 | 223 |
TASKQUEUE_STATS_ONLY(using TaskQueueSuper<N>::stats;) |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
224 |
|
1 | 225 |
private: |
226 |
// Slow paths for push, pop_local. (pop_global has no fast path.) |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
227 |
bool push_slow(E t, uint dirty_n_elems); |
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
228 |
bool pop_local_slow(uint localBot, Age oldAge); |
1 | 229 |
|
230 |
public: |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
231 |
typedef E element_type; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
232 |
|
1 | 233 |
// Initializes the queue to empty. |
234 |
GenericTaskQueue(); |
|
235 |
||
236 |
void initialize(); |
|
237 |
||
5918 | 238 |
// Push the task "t" on the queue. Returns "false" iff the queue is full. |
1 | 239 |
inline bool push(E t); |
240 |
||
5918 | 241 |
// Attempts to claim a task from the "local" end of the queue (the most |
242 |
// recently pushed). If successful, returns true and sets t to the task; |
|
243 |
// otherwise, returns false (the queue is empty). |
|
1 | 244 |
inline bool pop_local(E& t); |
245 |
||
5918 | 246 |
// Like pop_local(), but uses the "global" end of the queue (the least |
247 |
// recently pushed). |
|
1 | 248 |
bool pop_global(E& t); |
249 |
||
250 |
// Delete any resource associated with the queue. |
|
251 |
~GenericTaskQueue(); |
|
252 |
||
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
253 |
// apply the closure to all elements in the task queue |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
254 |
void oops_do(OopClosure* f); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
255 |
|
1 | 256 |
private: |
257 |
// Element array. |
|
258 |
volatile E* _elems; |
|
259 |
}; |
|
260 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
261 |
template<class E, unsigned int N> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
262 |
GenericTaskQueue<E, N>::GenericTaskQueue() { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
263 |
assert(sizeof(Age) == sizeof(size_t), "Depends on this."); |
1 | 264 |
} |
265 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
266 |
template<class E, unsigned int N> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
267 |
void GenericTaskQueue<E, N>::initialize() { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
268 |
_elems = NEW_C_HEAP_ARRAY(E, N); |
1 | 269 |
} |
270 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
271 |
template<class E, unsigned int N> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
272 |
void GenericTaskQueue<E, N>::oops_do(OopClosure* f) { |
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
273 |
// tty->print_cr("START OopTaskQueue::oops_do"); |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
274 |
uint iters = size(); |
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
275 |
uint index = _bottom; |
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
276 |
for (uint i = 0; i < iters; ++i) { |
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
277 |
index = decrement_index(index); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
278 |
// tty->print_cr(" doing entry %d," INTPTR_T " -> " INTPTR_T, |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
279 |
// index, &_elems[index], _elems[index]); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
280 |
E* t = (E*)&_elems[index]; // cast away volatility |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
281 |
oop* p = (oop*)t; |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
282 |
assert((*t)->is_oop_or_null(), "Not an oop or null"); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
283 |
f->do_oop(p); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
284 |
} |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
285 |
// tty->print_cr("END OopTaskQueue::oops_do"); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
286 |
} |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
287 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
288 |
template<class E, unsigned int N> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
289 |
bool GenericTaskQueue<E, N>::push_slow(E t, uint dirty_n_elems) { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
290 |
if (dirty_n_elems == N - 1) { |
1 | 291 |
// Actually means 0, so do the push. |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
292 |
uint localBot = _bottom; |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
293 |
// g++ complains if the volatile result of the assignment is unused. |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
294 |
const_cast<E&>(_elems[localBot] = t); |
4027
1c62fbaf6b68
6888847: TaskQueue needs release_store() for correctness on RMO machines
bobv
parents:
3607
diff
changeset
|
295 |
OrderAccess::release_store(&_bottom, increment_index(localBot)); |
6067 | 296 |
TASKQUEUE_STATS_ONLY(stats.record_push()); |
1 | 297 |
return true; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
298 |
} |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
299 |
return false; |
1 | 300 |
} |
301 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
302 |
template<class E, unsigned int N> |
6067 | 303 |
bool GenericTaskQueue<E, N>::pop_local_slow(uint localBot, Age oldAge) { |
1 | 304 |
// This queue was observed to contain exactly one element; either this |
305 |
// thread will claim it, or a competing "pop_global". In either case, |
|
306 |
// the queue will be logically empty afterwards. Create a new Age value |
|
307 |
// that represents the empty queue for the given value of "_bottom". (We |
|
308 |
// must also increment "tag" because of the case where "bottom == 1", |
|
309 |
// "top == 0". A pop_global could read the queue element in that case, |
|
310 |
// then have the owner thread do a pop followed by another push. Without |
|
311 |
// the incrementing of "tag", the pop_global's CAS could succeed, |
|
312 |
// allowing it to believe it has claimed the stale element.) |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
313 |
Age newAge((idx_t)localBot, oldAge.tag() + 1); |
1 | 314 |
// Perhaps a competing pop_global has already incremented "top", in which |
315 |
// case it wins the element. |
|
316 |
if (localBot == oldAge.top()) { |
|
317 |
// No competing pop_global has yet incremented "top"; we'll try to |
|
318 |
// install new_age, thus claiming the element. |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
319 |
Age tempAge = _age.cmpxchg(newAge, oldAge); |
1 | 320 |
if (tempAge == oldAge) { |
321 |
// We win. |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
322 |
assert(dirty_size(localBot, _age.top()) != N - 1, "sanity"); |
6067 | 323 |
TASKQUEUE_STATS_ONLY(stats.record_pop_slow()); |
1 | 324 |
return true; |
325 |
} |
|
326 |
} |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
327 |
// We lose; a completing pop_global gets the element. But the queue is empty |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
328 |
// and top is greater than bottom. Fix this representation of the empty queue |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
329 |
// to become the canonical one. |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
330 |
_age.set(newAge); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
331 |
assert(dirty_size(localBot, _age.top()) != N - 1, "sanity"); |
1 | 332 |
return false; |
333 |
} |
|
334 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
335 |
template<class E, unsigned int N> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
336 |
bool GenericTaskQueue<E, N>::pop_global(E& t) { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
337 |
Age oldAge = _age.get(); |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
338 |
uint localBot = _bottom; |
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
339 |
uint n_elems = size(localBot, oldAge.top()); |
1 | 340 |
if (n_elems == 0) { |
341 |
return false; |
|
342 |
} |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
343 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
344 |
const_cast<E&>(t = _elems[oldAge.top()]); |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
345 |
Age newAge(oldAge); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
346 |
newAge.increment(); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
347 |
Age resAge = _age.cmpxchg(newAge, oldAge); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
348 |
|
1 | 349 |
// Note that using "_bottom" here might fail, since a pop_local might |
350 |
// have decremented it. |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
351 |
assert(dirty_size(localBot, newAge.top()) != N - 1, "sanity"); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
352 |
return resAge == oldAge; |
1 | 353 |
} |
354 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
355 |
template<class E, unsigned int N> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
356 |
GenericTaskQueue<E, N>::~GenericTaskQueue() { |
1 | 357 |
FREE_C_HEAP_ARRAY(E, _elems); |
358 |
} |
|
359 |
||
5918 | 360 |
// OverflowTaskQueue is a TaskQueue that also includes an overflow stack for |
361 |
// elements that do not fit in the TaskQueue. |
|
362 |
// |
|
363 |
// Three methods from super classes are overridden: |
|
364 |
// |
|
365 |
// initialize() - initialize the super classes and create the overflow stack |
|
366 |
// push() - push onto the task queue or, if that fails, onto the overflow stack |
|
367 |
// is_empty() - return true if both the TaskQueue and overflow stack are empty |
|
368 |
// |
|
369 |
// Note that size() is not overridden--it returns the number of elements in the |
|
370 |
// TaskQueue, and does not include the size of the overflow stack. This |
|
371 |
// simplifies replacement of GenericTaskQueues with OverflowTaskQueues. |
|
372 |
template<class E, unsigned int N = TASKQUEUE_SIZE> |
|
373 |
class OverflowTaskQueue: public GenericTaskQueue<E, N> |
|
374 |
{ |
|
375 |
public: |
|
376 |
typedef GrowableArray<E> overflow_t; |
|
377 |
typedef GenericTaskQueue<E, N> taskqueue_t; |
|
378 |
||
6067 | 379 |
TASKQUEUE_STATS_ONLY(using taskqueue_t::stats;) |
380 |
||
5918 | 381 |
OverflowTaskQueue(); |
382 |
~OverflowTaskQueue(); |
|
383 |
void initialize(); |
|
384 |
||
385 |
inline overflow_t* overflow_stack() const { return _overflow_stack; } |
|
386 |
||
387 |
// Push task t onto the queue or onto the overflow stack. Return true. |
|
388 |
inline bool push(E t); |
|
389 |
||
390 |
// Attempt to pop from the overflow stack; return true if anything was popped. |
|
391 |
inline bool pop_overflow(E& t); |
|
392 |
||
393 |
inline bool taskqueue_empty() const { return taskqueue_t::is_empty(); } |
|
394 |
inline bool overflow_empty() const { return overflow_stack()->is_empty(); } |
|
395 |
inline bool is_empty() const { |
|
396 |
return taskqueue_empty() && overflow_empty(); |
|
397 |
} |
|
398 |
||
399 |
private: |
|
400 |
overflow_t* _overflow_stack; |
|
401 |
}; |
|
402 |
||
403 |
template <class E, unsigned int N> |
|
404 |
OverflowTaskQueue<E, N>::OverflowTaskQueue() |
|
405 |
{ |
|
406 |
_overflow_stack = NULL; |
|
407 |
} |
|
408 |
||
409 |
template <class E, unsigned int N> |
|
410 |
OverflowTaskQueue<E, N>::~OverflowTaskQueue() |
|
411 |
{ |
|
412 |
if (_overflow_stack != NULL) { |
|
413 |
delete _overflow_stack; |
|
414 |
_overflow_stack = NULL; |
|
415 |
} |
|
416 |
} |
|
417 |
||
418 |
template <class E, unsigned int N> |
|
419 |
void OverflowTaskQueue<E, N>::initialize() |
|
420 |
{ |
|
421 |
taskqueue_t::initialize(); |
|
422 |
assert(_overflow_stack == NULL, "memory leak"); |
|
423 |
_overflow_stack = new (ResourceObj::C_HEAP) GrowableArray<E>(10, true); |
|
424 |
} |
|
425 |
||
426 |
template <class E, unsigned int N> |
|
427 |
bool OverflowTaskQueue<E, N>::push(E t) |
|
428 |
{ |
|
429 |
if (!taskqueue_t::push(t)) { |
|
430 |
overflow_stack()->push(t); |
|
6067 | 431 |
TASKQUEUE_STATS_ONLY(stats.record_overflow(overflow_stack()->length())); |
5918 | 432 |
} |
433 |
return true; |
|
434 |
} |
|
435 |
||
436 |
template <class E, unsigned int N> |
|
437 |
bool OverflowTaskQueue<E, N>::pop_overflow(E& t) |
|
438 |
{ |
|
439 |
if (overflow_empty()) return false; |
|
440 |
t = overflow_stack()->pop(); |
|
441 |
return true; |
|
442 |
} |
|
443 |
||
1 | 444 |
class TaskQueueSetSuper: public CHeapObj { |
445 |
protected: |
|
446 |
static int randomParkAndMiller(int* seed0); |
|
447 |
public: |
|
448 |
// Returns "true" if some TaskQueue in the set contains a task. |
|
449 |
virtual bool peek() = 0; |
|
450 |
}; |
|
451 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
452 |
template<class T> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
453 |
class GenericTaskQueueSet: public TaskQueueSetSuper { |
1 | 454 |
private: |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
455 |
uint _n; |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
456 |
T** _queues; |
1 | 457 |
|
458 |
public: |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
459 |
typedef typename T::element_type E; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
460 |
|
1 | 461 |
GenericTaskQueueSet(int n) : _n(n) { |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
462 |
typedef T* GenericTaskQueuePtr; |
1 | 463 |
_queues = NEW_C_HEAP_ARRAY(GenericTaskQueuePtr, n); |
464 |
for (int i = 0; i < n; i++) { |
|
465 |
_queues[i] = NULL; |
|
466 |
} |
|
467 |
} |
|
468 |
||
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
469 |
bool steal_1_random(uint queue_num, int* seed, E& t); |
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
470 |
bool steal_best_of_2(uint queue_num, int* seed, E& t); |
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
471 |
bool steal_best_of_all(uint queue_num, int* seed, E& t); |
1 | 472 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
473 |
void register_queue(uint i, T* q); |
1 | 474 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
475 |
T* queue(uint n); |
1 | 476 |
|
5918 | 477 |
// The thread with queue number "queue_num" (and whose random number seed is |
478 |
// at "seed") is trying to steal a task from some other queue. (It may try |
|
479 |
// several queues, according to some configuration parameter.) If some steal |
|
480 |
// succeeds, returns "true" and sets "t" to the stolen task, otherwise returns |
|
481 |
// false. |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
482 |
bool steal(uint queue_num, int* seed, E& t); |
1 | 483 |
|
484 |
bool peek(); |
|
485 |
}; |
|
486 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
487 |
template<class T> void |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
488 |
GenericTaskQueueSet<T>::register_queue(uint i, T* q) { |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
489 |
assert(i < _n, "index out of range."); |
1 | 490 |
_queues[i] = q; |
491 |
} |
|
492 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
493 |
template<class T> T* |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
494 |
GenericTaskQueueSet<T>::queue(uint i) { |
1 | 495 |
return _queues[i]; |
496 |
} |
|
497 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
498 |
template<class T> bool |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
499 |
GenericTaskQueueSet<T>::steal(uint queue_num, int* seed, E& t) { |
6067 | 500 |
for (uint i = 0; i < 2 * _n; i++) { |
501 |
if (steal_best_of_2(queue_num, seed, t)) { |
|
502 |
TASKQUEUE_STATS_ONLY(queue(queue_num)->stats.record_steal(true)); |
|
1 | 503 |
return true; |
6067 | 504 |
} |
505 |
} |
|
506 |
TASKQUEUE_STATS_ONLY(queue(queue_num)->stats.record_steal(false)); |
|
1 | 507 |
return false; |
508 |
} |
|
509 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
510 |
template<class T> bool |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
511 |
GenericTaskQueueSet<T>::steal_best_of_all(uint queue_num, int* seed, E& t) { |
1 | 512 |
if (_n > 2) { |
513 |
int best_k; |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
514 |
uint best_sz = 0; |
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
515 |
for (uint k = 0; k < _n; k++) { |
1 | 516 |
if (k == queue_num) continue; |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
517 |
uint sz = _queues[k]->size(); |
1 | 518 |
if (sz > best_sz) { |
519 |
best_sz = sz; |
|
520 |
best_k = k; |
|
521 |
} |
|
522 |
} |
|
523 |
return best_sz > 0 && _queues[best_k]->pop_global(t); |
|
524 |
} else if (_n == 2) { |
|
525 |
// Just try the other one. |
|
526 |
int k = (queue_num + 1) % 2; |
|
527 |
return _queues[k]->pop_global(t); |
|
528 |
} else { |
|
529 |
assert(_n == 1, "can't be zero."); |
|
530 |
return false; |
|
531 |
} |
|
532 |
} |
|
533 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
534 |
template<class T> bool |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
535 |
GenericTaskQueueSet<T>::steal_1_random(uint queue_num, int* seed, E& t) { |
1 | 536 |
if (_n > 2) { |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
537 |
uint k = queue_num; |
1 | 538 |
while (k == queue_num) k = randomParkAndMiller(seed) % _n; |
539 |
return _queues[2]->pop_global(t); |
|
540 |
} else if (_n == 2) { |
|
541 |
// Just try the other one. |
|
542 |
int k = (queue_num + 1) % 2; |
|
543 |
return _queues[k]->pop_global(t); |
|
544 |
} else { |
|
545 |
assert(_n == 1, "can't be zero."); |
|
546 |
return false; |
|
547 |
} |
|
548 |
} |
|
549 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
550 |
template<class T> bool |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
551 |
GenericTaskQueueSet<T>::steal_best_of_2(uint queue_num, int* seed, E& t) { |
1 | 552 |
if (_n > 2) { |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
553 |
uint k1 = queue_num; |
1 | 554 |
while (k1 == queue_num) k1 = randomParkAndMiller(seed) % _n; |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
555 |
uint k2 = queue_num; |
1 | 556 |
while (k2 == queue_num || k2 == k1) k2 = randomParkAndMiller(seed) % _n; |
557 |
// Sample both and try the larger. |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
558 |
uint sz1 = _queues[k1]->size(); |
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
559 |
uint sz2 = _queues[k2]->size(); |
1 | 560 |
if (sz2 > sz1) return _queues[k2]->pop_global(t); |
561 |
else return _queues[k1]->pop_global(t); |
|
562 |
} else if (_n == 2) { |
|
563 |
// Just try the other one. |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
564 |
uint k = (queue_num + 1) % 2; |
1 | 565 |
return _queues[k]->pop_global(t); |
566 |
} else { |
|
567 |
assert(_n == 1, "can't be zero."); |
|
568 |
return false; |
|
569 |
} |
|
570 |
} |
|
571 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
572 |
template<class T> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
573 |
bool GenericTaskQueueSet<T>::peek() { |
1 | 574 |
// Try all the queues. |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
575 |
for (uint j = 0; j < _n; j++) { |
1 | 576 |
if (_queues[j]->peek()) |
577 |
return true; |
|
578 |
} |
|
579 |
return false; |
|
580 |
} |
|
581 |
||
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
582 |
// When to terminate from the termination protocol. |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
583 |
class TerminatorTerminator: public CHeapObj { |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
584 |
public: |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
585 |
virtual bool should_exit_termination() = 0; |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
586 |
}; |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
587 |
|
1 | 588 |
// A class to aid in the termination of a set of parallel tasks using |
589 |
// TaskQueueSet's for work stealing. |
|
590 |
||
2010
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
591 |
#undef TRACESPINNING |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
592 |
|
1 | 593 |
class ParallelTaskTerminator: public StackObj { |
594 |
private: |
|
595 |
int _n_threads; |
|
596 |
TaskQueueSetSuper* _queue_set; |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
597 |
int _offered_termination; |
1 | 598 |
|
2010
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
599 |
#ifdef TRACESPINNING |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
600 |
static uint _total_yields; |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
601 |
static uint _total_spins; |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
602 |
static uint _total_peeks; |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
603 |
#endif |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
604 |
|
1 | 605 |
bool peek_in_queue_set(); |
606 |
protected: |
|
607 |
virtual void yield(); |
|
608 |
void sleep(uint millis); |
|
609 |
||
610 |
public: |
|
611 |
||
612 |
// "n_threads" is the number of threads to be terminated. "queue_set" is a |
|
613 |
// queue sets of work queues of other threads. |
|
614 |
ParallelTaskTerminator(int n_threads, TaskQueueSetSuper* queue_set); |
|
615 |
||
616 |
// The current thread has no work, and is ready to terminate if everyone |
|
617 |
// else is. If returns "true", all threads are terminated. If returns |
|
618 |
// "false", available work has been observed in one of the task queues, |
|
619 |
// so the global task is not complete. |
|
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
620 |
bool offer_termination() { |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
621 |
return offer_termination(NULL); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
622 |
} |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
623 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
624 |
// As above, but it also terminates if the should_exit_termination() |
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
625 |
// method of the terminator parameter returns true. If terminator is |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
626 |
// NULL, then it is ignored. |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
627 |
bool offer_termination(TerminatorTerminator* terminator); |
1 | 628 |
|
629 |
// Reset the terminator, so that it may be reused again. |
|
630 |
// The caller is responsible for ensuring that this is done |
|
631 |
// in an MT-safe manner, once the previous round of use of |
|
632 |
// the terminator is finished. |
|
633 |
void reset_for_reuse(); |
|
634 |
||
2010
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
635 |
#ifdef TRACESPINNING |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
636 |
static uint total_yields() { return _total_yields; } |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
637 |
static uint total_spins() { return _total_spins; } |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
638 |
static uint total_peeks() { return _total_peeks; } |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
639 |
static void print_termination_counts(); |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
640 |
#endif |
1 | 641 |
}; |
642 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
643 |
template<class E, unsigned int N> inline bool |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
644 |
GenericTaskQueue<E, N>::push(E t) { |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
645 |
uint localBot = _bottom; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
646 |
assert((localBot >= 0) && (localBot < N), "_bottom out of range."); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
647 |
idx_t top = _age.top(); |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
648 |
uint dirty_n_elems = dirty_size(localBot, top); |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
649 |
assert(dirty_n_elems < N, "n_elems out of range."); |
1 | 650 |
if (dirty_n_elems < max_elems()) { |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
651 |
// g++ complains if the volatile result of the assignment is unused. |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
652 |
const_cast<E&>(_elems[localBot] = t); |
4027
1c62fbaf6b68
6888847: TaskQueue needs release_store() for correctness on RMO machines
bobv
parents:
3607
diff
changeset
|
653 |
OrderAccess::release_store(&_bottom, increment_index(localBot)); |
6067 | 654 |
TASKQUEUE_STATS_ONLY(stats.record_push()); |
1 | 655 |
return true; |
656 |
} else { |
|
657 |
return push_slow(t, dirty_n_elems); |
|
658 |
} |
|
659 |
} |
|
660 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
661 |
template<class E, unsigned int N> inline bool |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
662 |
GenericTaskQueue<E, N>::pop_local(E& t) { |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
663 |
uint localBot = _bottom; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
664 |
// This value cannot be N-1. That can only occur as a result of |
1 | 665 |
// the assignment to bottom in this method. If it does, this method |
5918 | 666 |
// resets the size to 0 before the next call (which is sequential, |
1 | 667 |
// since this is pop_local.) |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
668 |
uint dirty_n_elems = dirty_size(localBot, _age.top()); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
669 |
assert(dirty_n_elems != N - 1, "Shouldn't be possible..."); |
1 | 670 |
if (dirty_n_elems == 0) return false; |
671 |
localBot = decrement_index(localBot); |
|
672 |
_bottom = localBot; |
|
673 |
// This is necessary to prevent any read below from being reordered |
|
674 |
// before the store just above. |
|
675 |
OrderAccess::fence(); |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
676 |
const_cast<E&>(t = _elems[localBot]); |
1 | 677 |
// This is a second read of "age"; the "size()" above is the first. |
678 |
// If there's still at least one element in the queue, based on the |
|
679 |
// "_bottom" and "age" we've read, then there can be no interference with |
|
680 |
// a "pop_global" operation, and we're done. |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
681 |
idx_t tp = _age.top(); // XXX |
1 | 682 |
if (size(localBot, tp) > 0) { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
683 |
assert(dirty_size(localBot, tp) != N - 1, "sanity"); |
6067 | 684 |
TASKQUEUE_STATS_ONLY(stats.record_pop()); |
1 | 685 |
return true; |
686 |
} else { |
|
687 |
// Otherwise, the queue contained exactly one element; we take the slow |
|
688 |
// path. |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
689 |
return pop_local_slow(localBot, _age.get()); |
1 | 690 |
} |
691 |
} |
|
692 |
||
5918 | 693 |
typedef GenericTaskQueue<oop> OopTaskQueue; |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
694 |
typedef GenericTaskQueueSet<OopTaskQueue> OopTaskQueueSet; |
1 | 695 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
696 |
#ifdef _MSC_VER |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
697 |
#pragma warning(push) |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
698 |
// warning C4522: multiple assignment operators specified |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
699 |
#pragma warning(disable:4522) |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
700 |
#endif |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
701 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
702 |
// This is a container class for either an oop* or a narrowOop*. |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
703 |
// Both are pushed onto a task queue and the consumer will test is_narrow() |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
704 |
// to determine which should be processed. |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
705 |
class StarTask { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
706 |
void* _holder; // either union oop* or narrowOop* |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
707 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
708 |
enum { COMPRESSED_OOP_MASK = 1 }; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
709 |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
710 |
public: |
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
711 |
StarTask(narrowOop* p) { |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
712 |
assert(((uintptr_t)p & COMPRESSED_OOP_MASK) == 0, "Information loss!"); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
713 |
_holder = (void *)((uintptr_t)p | COMPRESSED_OOP_MASK); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
714 |
} |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
715 |
StarTask(oop* p) { |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
716 |
assert(((uintptr_t)p & COMPRESSED_OOP_MASK) == 0, "Information loss!"); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
717 |
_holder = (void*)p; |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
718 |
} |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
719 |
StarTask() { _holder = NULL; } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
720 |
operator oop*() { return (oop*)_holder; } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
721 |
operator narrowOop*() { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
722 |
return (narrowOop*)((uintptr_t)_holder & ~COMPRESSED_OOP_MASK); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
723 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
724 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
725 |
StarTask& operator=(const StarTask& t) { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
726 |
_holder = t._holder; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
727 |
return *this; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
728 |
} |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
729 |
volatile StarTask& operator=(const volatile StarTask& t) volatile { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
730 |
_holder = t._holder; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
731 |
return *this; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
732 |
} |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
733 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
734 |
bool is_narrow() const { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
735 |
return (((uintptr_t)_holder & COMPRESSED_OOP_MASK) != 0); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
736 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
737 |
}; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
738 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
739 |
class ObjArrayTask |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
740 |
{ |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
741 |
public: |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
742 |
ObjArrayTask(oop o = NULL, int idx = 0): _obj(o), _index(idx) { } |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
743 |
ObjArrayTask(oop o, size_t idx): _obj(o), _index(int(idx)) { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
744 |
assert(idx <= size_t(max_jint), "too big"); |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
745 |
} |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
746 |
ObjArrayTask(const ObjArrayTask& t): _obj(t._obj), _index(t._index) { } |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
747 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
748 |
ObjArrayTask& operator =(const ObjArrayTask& t) { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
749 |
_obj = t._obj; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
750 |
_index = t._index; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
751 |
return *this; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
752 |
} |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
753 |
volatile ObjArrayTask& |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
754 |
operator =(const volatile ObjArrayTask& t) volatile { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
755 |
_obj = t._obj; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
756 |
_index = t._index; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
757 |
return *this; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
758 |
} |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
759 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
760 |
inline oop obj() const { return _obj; } |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
761 |
inline int index() const { return _index; } |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
762 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
763 |
DEBUG_ONLY(bool is_valid() const); // Tasks to be pushed/popped must be valid. |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
764 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
765 |
private: |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
766 |
oop _obj; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
767 |
int _index; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
768 |
}; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
769 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
770 |
#ifdef _MSC_VER |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
771 |
#pragma warning(pop) |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
772 |
#endif |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
773 |
|
5918 | 774 |
typedef OverflowTaskQueue<StarTask> OopStarTaskQueue; |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
775 |
typedef GenericTaskQueueSet<OopStarTaskQueue> OopStarTaskQueueSet; |
1 | 776 |
|
5918 | 777 |
typedef OverflowTaskQueue<size_t> RegionTaskQueue; |
778 |
typedef GenericTaskQueueSet<RegionTaskQueue> RegionTaskQueueSet; |