author | trims |
Thu, 27 May 2010 19:08:38 -0700 | |
changeset 5547 | f4b087cbb361 |
parent 5076 | 8b74a4b60b31 |
child 5918 | 73b96456819a |
permissions | -rw-r--r-- |
1 | 1 |
/* |
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5076
diff
changeset
|
2 |
* Copyright (c) 2001, 2009, 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 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
25 |
template <unsigned int N> |
1 | 26 |
class TaskQueueSuper: public CHeapObj { |
27 |
protected: |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
28 |
// 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
|
29 |
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
|
30 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
31 |
// 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
|
32 |
volatile uint _bottom; |
1 | 33 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
34 |
enum { MOD_N_MASK = N - 1 }; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
35 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
36 |
class Age { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
37 |
public: |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
38 |
Age(size_t data = 0) { _data = data; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
39 |
Age(const Age& age) { _data = age._data; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
40 |
Age(idx_t top, idx_t tag) { _fields._top = top; _fields._tag = tag; } |
1 | 41 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
42 |
Age get() const volatile { return _data; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
43 |
void set(Age age) volatile { _data = age._data; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
44 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
45 |
idx_t top() const volatile { return _fields._top; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
46 |
idx_t tag() const volatile { return _fields._tag; } |
1 | 47 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
48 |
// Increment top; if it wraps, increment tag also. |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
49 |
void increment() { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
50 |
_fields._top = increment_index(_fields._top); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
51 |
if (_fields._top == 0) ++_fields._tag; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
52 |
} |
1 | 53 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
54 |
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
|
55 |
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
|
56 |
(volatile intptr_t *)&_data, |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
57 |
(intptr_t)old_age._data); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
58 |
} |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
59 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
60 |
bool operator ==(const Age& other) const { return _data == other._data; } |
1 | 61 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
62 |
private: |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
63 |
struct fields { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
64 |
idx_t _top; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
65 |
idx_t _tag; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
66 |
}; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
67 |
union { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
68 |
size_t _data; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
69 |
fields _fields; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
70 |
}; |
1 | 71 |
}; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
72 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
73 |
volatile Age _age; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
74 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
75 |
// These both operate mod N. |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
76 |
static uint increment_index(uint ind) { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
77 |
return (ind + 1) & MOD_N_MASK; |
1 | 78 |
} |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
79 |
static uint decrement_index(uint ind) { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
80 |
return (ind - 1) & MOD_N_MASK; |
1 | 81 |
} |
82 |
||
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
83 |
// 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
|
84 |
// interpreted as 0. |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
85 |
uint dirty_size(uint bot, uint top) const { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
86 |
return (bot - top) & MOD_N_MASK; |
1 | 87 |
} |
88 |
||
89 |
// 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
|
90 |
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
|
91 |
uint sz = dirty_size(bot, top); |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
92 |
// 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
|
93 |
// 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
|
94 |
// 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
|
95 |
// _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
|
96 |
// 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
|
97 |
// 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
|
98 |
// 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
|
99 |
// 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
|
100 |
// 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
|
101 |
// 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
|
102 |
// 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
|
103 |
// 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
|
104 |
// 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
|
105 |
// _bottom == top so subsequent pushes will be performed normally. |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
106 |
return (sz == N - 1) ? 0 : sz; |
1 | 107 |
} |
108 |
||
109 |
public: |
|
110 |
TaskQueueSuper() : _bottom(0), _age() {} |
|
111 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
112 |
// Return true if the TaskQueue contains any tasks. |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
113 |
bool peek() { return _bottom != _age.top(); } |
1 | 114 |
|
115 |
// Return an estimate of the number of elements in the queue. |
|
116 |
// The "careful" version admits the possibility of pop_local/pop_global |
|
117 |
// races. |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
118 |
uint size() const { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
119 |
return size(_bottom, _age.top()); |
1 | 120 |
} |
121 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
122 |
uint dirty_size() const { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
123 |
return dirty_size(_bottom, _age.top()); |
1 | 124 |
} |
125 |
||
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
126 |
void set_empty() { |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
127 |
_bottom = 0; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
128 |
_age.set(0); |
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
129 |
} |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
130 |
|
1 | 131 |
// Maximum number of elements allowed in the queue. This is two less |
132 |
// 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
|
133 |
uint max_elems() const { return N - 2; } |
5035 | 134 |
|
135 |
// Total size of queue. |
|
136 |
static const uint total_size() { return N; } |
|
1 | 137 |
}; |
138 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
139 |
template<class E, unsigned int N = TASKQUEUE_SIZE> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
140 |
class GenericTaskQueue: public TaskQueueSuper<N> { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
141 |
protected: |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
142 |
typedef typename TaskQueueSuper<N>::Age Age; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
143 |
typedef typename TaskQueueSuper<N>::idx_t idx_t; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
144 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
145 |
using TaskQueueSuper<N>::_bottom; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
146 |
using TaskQueueSuper<N>::_age; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
147 |
using TaskQueueSuper<N>::increment_index; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
148 |
using TaskQueueSuper<N>::decrement_index; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
149 |
using TaskQueueSuper<N>::dirty_size; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
150 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
151 |
public: |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
152 |
using TaskQueueSuper<N>::max_elems; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
153 |
using TaskQueueSuper<N>::size; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
154 |
|
1 | 155 |
private: |
156 |
// 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
|
157 |
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
|
158 |
bool pop_local_slow(uint localBot, Age oldAge); |
1 | 159 |
|
160 |
public: |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
161 |
typedef E element_type; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
162 |
|
1 | 163 |
// Initializes the queue to empty. |
164 |
GenericTaskQueue(); |
|
165 |
||
166 |
void initialize(); |
|
167 |
||
168 |
// Push the task "t" on the queue. Returns "false" iff the queue is |
|
169 |
// full. |
|
170 |
inline bool push(E t); |
|
171 |
||
172 |
// If succeeds in claiming a task (from the 'local' end, that is, the |
|
173 |
// most recently pushed task), returns "true" and sets "t" to that task. |
|
174 |
// Otherwise, the queue is empty and returns false. |
|
175 |
inline bool pop_local(E& t); |
|
176 |
||
177 |
// If succeeds in claiming a task (from the 'global' end, that is, the |
|
178 |
// least recently pushed task), returns "true" and sets "t" to that task. |
|
179 |
// Otherwise, the queue is empty and returns false. |
|
180 |
bool pop_global(E& t); |
|
181 |
||
182 |
// Delete any resource associated with the queue. |
|
183 |
~GenericTaskQueue(); |
|
184 |
||
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
185 |
// apply the closure to all elements in the task queue |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
186 |
void oops_do(OopClosure* f); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
187 |
|
1 | 188 |
private: |
189 |
// Element array. |
|
190 |
volatile E* _elems; |
|
191 |
}; |
|
192 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
193 |
template<class E, unsigned int N> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
194 |
GenericTaskQueue<E, N>::GenericTaskQueue() { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
195 |
assert(sizeof(Age) == sizeof(size_t), "Depends on this."); |
1 | 196 |
} |
197 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
198 |
template<class E, unsigned int N> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
199 |
void GenericTaskQueue<E, N>::initialize() { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
200 |
_elems = NEW_C_HEAP_ARRAY(E, N); |
1 | 201 |
guarantee(_elems != NULL, "Allocation failed."); |
202 |
} |
|
203 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
204 |
template<class E, unsigned int N> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
205 |
void GenericTaskQueue<E, N>::oops_do(OopClosure* f) { |
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
206 |
// 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
|
207 |
uint iters = size(); |
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
208 |
uint index = _bottom; |
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
209 |
for (uint i = 0; i < iters; ++i) { |
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
210 |
index = decrement_index(index); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
211 |
// tty->print_cr(" doing entry %d," INTPTR_T " -> " INTPTR_T, |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
212 |
// index, &_elems[index], _elems[index]); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
213 |
E* t = (E*)&_elems[index]; // cast away volatility |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
214 |
oop* p = (oop*)t; |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
215 |
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
|
216 |
f->do_oop(p); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
217 |
} |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
218 |
// tty->print_cr("END OopTaskQueue::oops_do"); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
219 |
} |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
220 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
221 |
template<class E, unsigned int N> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
222 |
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
|
223 |
if (dirty_n_elems == N - 1) { |
1 | 224 |
// 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
|
225 |
uint localBot = _bottom; |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
226 |
// 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
|
227 |
const_cast<E&>(_elems[localBot] = t); |
4027
1c62fbaf6b68
6888847: TaskQueue needs release_store() for correctness on RMO machines
bobv
parents:
3607
diff
changeset
|
228 |
OrderAccess::release_store(&_bottom, increment_index(localBot)); |
1 | 229 |
return true; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
230 |
} |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
231 |
return false; |
1 | 232 |
} |
233 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
234 |
template<class E, unsigned int N> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
235 |
bool GenericTaskQueue<E, N>:: |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
236 |
pop_local_slow(uint localBot, Age oldAge) { |
1 | 237 |
// This queue was observed to contain exactly one element; either this |
238 |
// thread will claim it, or a competing "pop_global". In either case, |
|
239 |
// the queue will be logically empty afterwards. Create a new Age value |
|
240 |
// that represents the empty queue for the given value of "_bottom". (We |
|
241 |
// must also increment "tag" because of the case where "bottom == 1", |
|
242 |
// "top == 0". A pop_global could read the queue element in that case, |
|
243 |
// then have the owner thread do a pop followed by another push. Without |
|
244 |
// the incrementing of "tag", the pop_global's CAS could succeed, |
|
245 |
// 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
|
246 |
Age newAge((idx_t)localBot, oldAge.tag() + 1); |
1 | 247 |
// Perhaps a competing pop_global has already incremented "top", in which |
248 |
// case it wins the element. |
|
249 |
if (localBot == oldAge.top()) { |
|
250 |
// No competing pop_global has yet incremented "top"; we'll try to |
|
251 |
// install new_age, thus claiming the element. |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
252 |
Age tempAge = _age.cmpxchg(newAge, oldAge); |
1 | 253 |
if (tempAge == oldAge) { |
254 |
// We win. |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
255 |
assert(dirty_size(localBot, _age.top()) != N - 1, "sanity"); |
1 | 256 |
return true; |
257 |
} |
|
258 |
} |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
259 |
// 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
|
260 |
// 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
|
261 |
// to become the canonical one. |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
262 |
_age.set(newAge); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
263 |
assert(dirty_size(localBot, _age.top()) != N - 1, "sanity"); |
1 | 264 |
return false; |
265 |
} |
|
266 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
267 |
template<class E, unsigned int N> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
268 |
bool GenericTaskQueue<E, N>::pop_global(E& t) { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
269 |
Age oldAge = _age.get(); |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
270 |
uint localBot = _bottom; |
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
271 |
uint n_elems = size(localBot, oldAge.top()); |
1 | 272 |
if (n_elems == 0) { |
273 |
return false; |
|
274 |
} |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
275 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
276 |
const_cast<E&>(t = _elems[oldAge.top()]); |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
277 |
Age newAge(oldAge); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
278 |
newAge.increment(); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
279 |
Age resAge = _age.cmpxchg(newAge, oldAge); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
280 |
|
1 | 281 |
// Note that using "_bottom" here might fail, since a pop_local might |
282 |
// have decremented it. |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
283 |
assert(dirty_size(localBot, newAge.top()) != N - 1, "sanity"); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
284 |
return resAge == oldAge; |
1 | 285 |
} |
286 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
287 |
template<class E, unsigned int N> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
288 |
GenericTaskQueue<E, N>::~GenericTaskQueue() { |
1 | 289 |
FREE_C_HEAP_ARRAY(E, _elems); |
290 |
} |
|
291 |
||
292 |
// Inherits the typedef of "Task" from above. |
|
293 |
class TaskQueueSetSuper: public CHeapObj { |
|
294 |
protected: |
|
295 |
static int randomParkAndMiller(int* seed0); |
|
296 |
public: |
|
297 |
// Returns "true" if some TaskQueue in the set contains a task. |
|
298 |
virtual bool peek() = 0; |
|
299 |
}; |
|
300 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
301 |
template<class T> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
302 |
class GenericTaskQueueSet: public TaskQueueSetSuper { |
1 | 303 |
private: |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
304 |
uint _n; |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
305 |
T** _queues; |
1 | 306 |
|
307 |
public: |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
308 |
typedef typename T::element_type E; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
309 |
|
1 | 310 |
GenericTaskQueueSet(int n) : _n(n) { |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
311 |
typedef T* GenericTaskQueuePtr; |
1 | 312 |
_queues = NEW_C_HEAP_ARRAY(GenericTaskQueuePtr, n); |
313 |
for (int i = 0; i < n; i++) { |
|
314 |
_queues[i] = NULL; |
|
315 |
} |
|
316 |
} |
|
317 |
||
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
318 |
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
|
319 |
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
|
320 |
bool steal_best_of_all(uint queue_num, int* seed, E& t); |
1 | 321 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
322 |
void register_queue(uint i, T* q); |
1 | 323 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
324 |
T* queue(uint n); |
1 | 325 |
|
326 |
// The thread with queue number "queue_num" (and whose random number seed |
|
327 |
// is at "seed") is trying to steal a task from some other queue. (It |
|
328 |
// may try several queues, according to some configuration parameter.) |
|
329 |
// If some steal succeeds, returns "true" and sets "t" the stolen task, |
|
330 |
// otherwise returns false. |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
331 |
bool steal(uint queue_num, int* seed, E& t); |
1 | 332 |
|
333 |
bool peek(); |
|
334 |
}; |
|
335 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
336 |
template<class T> void |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
337 |
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
|
338 |
assert(i < _n, "index out of range."); |
1 | 339 |
_queues[i] = q; |
340 |
} |
|
341 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
342 |
template<class T> T* |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
343 |
GenericTaskQueueSet<T>::queue(uint i) { |
1 | 344 |
return _queues[i]; |
345 |
} |
|
346 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
347 |
template<class T> bool |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
348 |
GenericTaskQueueSet<T>::steal(uint queue_num, int* seed, E& t) { |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
349 |
for (uint i = 0; i < 2 * _n; i++) |
1 | 350 |
if (steal_best_of_2(queue_num, seed, t)) |
351 |
return true; |
|
352 |
return false; |
|
353 |
} |
|
354 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
355 |
template<class T> bool |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
356 |
GenericTaskQueueSet<T>::steal_best_of_all(uint queue_num, int* seed, E& t) { |
1 | 357 |
if (_n > 2) { |
358 |
int best_k; |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
359 |
uint best_sz = 0; |
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
360 |
for (uint k = 0; k < _n; k++) { |
1 | 361 |
if (k == queue_num) continue; |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
362 |
uint sz = _queues[k]->size(); |
1 | 363 |
if (sz > best_sz) { |
364 |
best_sz = sz; |
|
365 |
best_k = k; |
|
366 |
} |
|
367 |
} |
|
368 |
return best_sz > 0 && _queues[best_k]->pop_global(t); |
|
369 |
} else if (_n == 2) { |
|
370 |
// Just try the other one. |
|
371 |
int k = (queue_num + 1) % 2; |
|
372 |
return _queues[k]->pop_global(t); |
|
373 |
} else { |
|
374 |
assert(_n == 1, "can't be zero."); |
|
375 |
return false; |
|
376 |
} |
|
377 |
} |
|
378 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
379 |
template<class T> bool |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
380 |
GenericTaskQueueSet<T>::steal_1_random(uint queue_num, int* seed, E& t) { |
1 | 381 |
if (_n > 2) { |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
382 |
uint k = queue_num; |
1 | 383 |
while (k == queue_num) k = randomParkAndMiller(seed) % _n; |
384 |
return _queues[2]->pop_global(t); |
|
385 |
} else if (_n == 2) { |
|
386 |
// Just try the other one. |
|
387 |
int k = (queue_num + 1) % 2; |
|
388 |
return _queues[k]->pop_global(t); |
|
389 |
} else { |
|
390 |
assert(_n == 1, "can't be zero."); |
|
391 |
return false; |
|
392 |
} |
|
393 |
} |
|
394 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
395 |
template<class T> bool |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
396 |
GenericTaskQueueSet<T>::steal_best_of_2(uint queue_num, int* seed, E& t) { |
1 | 397 |
if (_n > 2) { |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
398 |
uint k1 = queue_num; |
1 | 399 |
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
|
400 |
uint k2 = queue_num; |
1 | 401 |
while (k2 == queue_num || k2 == k1) k2 = randomParkAndMiller(seed) % _n; |
402 |
// Sample both and try the larger. |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
403 |
uint sz1 = _queues[k1]->size(); |
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
404 |
uint sz2 = _queues[k2]->size(); |
1 | 405 |
if (sz2 > sz1) return _queues[k2]->pop_global(t); |
406 |
else return _queues[k1]->pop_global(t); |
|
407 |
} else if (_n == 2) { |
|
408 |
// Just try the other one. |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
409 |
uint k = (queue_num + 1) % 2; |
1 | 410 |
return _queues[k]->pop_global(t); |
411 |
} else { |
|
412 |
assert(_n == 1, "can't be zero."); |
|
413 |
return false; |
|
414 |
} |
|
415 |
} |
|
416 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
417 |
template<class T> |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
418 |
bool GenericTaskQueueSet<T>::peek() { |
1 | 419 |
// Try all the queues. |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
420 |
for (uint j = 0; j < _n; j++) { |
1 | 421 |
if (_queues[j]->peek()) |
422 |
return true; |
|
423 |
} |
|
424 |
return false; |
|
425 |
} |
|
426 |
||
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
427 |
// When to terminate from the termination protocol. |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
428 |
class TerminatorTerminator: public CHeapObj { |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
429 |
public: |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
430 |
virtual bool should_exit_termination() = 0; |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
431 |
}; |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
432 |
|
1 | 433 |
// A class to aid in the termination of a set of parallel tasks using |
434 |
// TaskQueueSet's for work stealing. |
|
435 |
||
2010
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
436 |
#undef TRACESPINNING |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
437 |
|
1 | 438 |
class ParallelTaskTerminator: public StackObj { |
439 |
private: |
|
440 |
int _n_threads; |
|
441 |
TaskQueueSetSuper* _queue_set; |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
442 |
int _offered_termination; |
1 | 443 |
|
2010
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
444 |
#ifdef TRACESPINNING |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
445 |
static uint _total_yields; |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
446 |
static uint _total_spins; |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
447 |
static uint _total_peeks; |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
448 |
#endif |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
449 |
|
1 | 450 |
bool peek_in_queue_set(); |
451 |
protected: |
|
452 |
virtual void yield(); |
|
453 |
void sleep(uint millis); |
|
454 |
||
455 |
public: |
|
456 |
||
457 |
// "n_threads" is the number of threads to be terminated. "queue_set" is a |
|
458 |
// queue sets of work queues of other threads. |
|
459 |
ParallelTaskTerminator(int n_threads, TaskQueueSetSuper* queue_set); |
|
460 |
||
461 |
// The current thread has no work, and is ready to terminate if everyone |
|
462 |
// else is. If returns "true", all threads are terminated. If returns |
|
463 |
// "false", available work has been observed in one of the task queues, |
|
464 |
// so the global task is not complete. |
|
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
465 |
bool offer_termination() { |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
466 |
return offer_termination(NULL); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
467 |
} |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
468 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
469 |
// 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
|
470 |
// method of the terminator parameter returns true. If terminator is |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
471 |
// NULL, then it is ignored. |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
472 |
bool offer_termination(TerminatorTerminator* terminator); |
1 | 473 |
|
474 |
// Reset the terminator, so that it may be reused again. |
|
475 |
// The caller is responsible for ensuring that this is done |
|
476 |
// in an MT-safe manner, once the previous round of use of |
|
477 |
// the terminator is finished. |
|
478 |
void reset_for_reuse(); |
|
479 |
||
2010
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
480 |
#ifdef TRACESPINNING |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
481 |
static uint total_yields() { return _total_yields; } |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
482 |
static uint total_spins() { return _total_spins; } |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
483 |
static uint total_peeks() { return _total_peeks; } |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
484 |
static void print_termination_counts(); |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
485 |
#endif |
1 | 486 |
}; |
487 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
488 |
template<class E, unsigned int N> inline bool |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
489 |
GenericTaskQueue<E, N>::push(E t) { |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
490 |
uint localBot = _bottom; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
491 |
assert((localBot >= 0) && (localBot < N), "_bottom out of range."); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
492 |
idx_t top = _age.top(); |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
493 |
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
|
494 |
assert(dirty_n_elems < N, "n_elems out of range."); |
1 | 495 |
if (dirty_n_elems < max_elems()) { |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
496 |
// 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
|
497 |
const_cast<E&>(_elems[localBot] = t); |
4027
1c62fbaf6b68
6888847: TaskQueue needs release_store() for correctness on RMO machines
bobv
parents:
3607
diff
changeset
|
498 |
OrderAccess::release_store(&_bottom, increment_index(localBot)); |
1 | 499 |
return true; |
500 |
} else { |
|
501 |
return push_slow(t, dirty_n_elems); |
|
502 |
} |
|
503 |
} |
|
504 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
505 |
template<class E, unsigned int N> inline bool |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
506 |
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
|
507 |
uint localBot = _bottom; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
508 |
// This value cannot be N-1. That can only occur as a result of |
1 | 509 |
// the assignment to bottom in this method. If it does, this method |
510 |
// resets the size( to 0 before the next call (which is sequential, |
|
511 |
// since this is pop_local.) |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
512 |
uint dirty_n_elems = dirty_size(localBot, _age.top()); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
513 |
assert(dirty_n_elems != N - 1, "Shouldn't be possible..."); |
1 | 514 |
if (dirty_n_elems == 0) return false; |
515 |
localBot = decrement_index(localBot); |
|
516 |
_bottom = localBot; |
|
517 |
// This is necessary to prevent any read below from being reordered |
|
518 |
// before the store just above. |
|
519 |
OrderAccess::fence(); |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
520 |
const_cast<E&>(t = _elems[localBot]); |
1 | 521 |
// This is a second read of "age"; the "size()" above is the first. |
522 |
// If there's still at least one element in the queue, based on the |
|
523 |
// "_bottom" and "age" we've read, then there can be no interference with |
|
524 |
// a "pop_global" operation, and we're done. |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
525 |
idx_t tp = _age.top(); // XXX |
1 | 526 |
if (size(localBot, tp) > 0) { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
527 |
assert(dirty_size(localBot, tp) != N - 1, "sanity"); |
1 | 528 |
return true; |
529 |
} else { |
|
530 |
// Otherwise, the queue contained exactly one element; we take the slow |
|
531 |
// path. |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
532 |
return pop_local_slow(localBot, _age.get()); |
1 | 533 |
} |
534 |
} |
|
535 |
||
536 |
typedef oop Task; |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
537 |
typedef GenericTaskQueue<Task> OopTaskQueue; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
538 |
typedef GenericTaskQueueSet<OopTaskQueue> OopTaskQueueSet; |
1 | 539 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
540 |
#ifdef _MSC_VER |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
541 |
#pragma warning(push) |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
542 |
// warning C4522: multiple assignment operators specified |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
543 |
#pragma warning(disable:4522) |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
544 |
#endif |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
545 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
546 |
// 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
|
547 |
// 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
|
548 |
// 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
|
549 |
class StarTask { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
550 |
void* _holder; // either union oop* or narrowOop* |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
551 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
552 |
enum { COMPRESSED_OOP_MASK = 1 }; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
553 |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
554 |
public: |
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
555 |
StarTask(narrowOop* p) { |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
556 |
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
|
557 |
_holder = (void *)((uintptr_t)p | COMPRESSED_OOP_MASK); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
558 |
} |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
559 |
StarTask(oop* p) { |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
560 |
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
|
561 |
_holder = (void*)p; |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
562 |
} |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
563 |
StarTask() { _holder = NULL; } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
564 |
operator oop*() { return (oop*)_holder; } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
565 |
operator narrowOop*() { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
566 |
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
|
567 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
568 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
569 |
StarTask& operator=(const StarTask& t) { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
570 |
_holder = t._holder; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
571 |
return *this; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
572 |
} |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
573 |
volatile StarTask& operator=(const volatile StarTask& t) volatile { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
574 |
_holder = t._holder; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
575 |
return *this; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
576 |
} |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
577 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
578 |
bool is_narrow() const { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
579 |
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
|
580 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
581 |
}; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
582 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
583 |
class ObjArrayTask |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
584 |
{ |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
585 |
public: |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
586 |
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
|
587 |
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
|
588 |
assert(idx <= size_t(max_jint), "too big"); |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
589 |
} |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
590 |
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
|
591 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
592 |
ObjArrayTask& operator =(const ObjArrayTask& t) { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
593 |
_obj = t._obj; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
594 |
_index = t._index; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
595 |
return *this; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
596 |
} |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
597 |
volatile ObjArrayTask& |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
598 |
operator =(const volatile ObjArrayTask& t) volatile { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
599 |
_obj = t._obj; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
600 |
_index = t._index; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
601 |
return *this; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
602 |
} |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
603 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
604 |
inline oop obj() const { return _obj; } |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
605 |
inline int index() const { return _index; } |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
606 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
607 |
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
|
608 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
609 |
private: |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
610 |
oop _obj; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
611 |
int _index; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
612 |
}; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
613 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
614 |
#ifdef _MSC_VER |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
615 |
#pragma warning(pop) |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
616 |
#endif |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
617 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
618 |
typedef GenericTaskQueue<StarTask> OopStarTaskQueue; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
619 |
typedef GenericTaskQueueSet<OopStarTaskQueue> OopStarTaskQueueSet; |
1 | 620 |
|
1407
9006b01ba3fd
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
1388
diff
changeset
|
621 |
typedef size_t RegionTask; // index for region |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
622 |
typedef GenericTaskQueue<RegionTask> RegionTaskQueue; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
623 |
typedef GenericTaskQueueSet<RegionTaskQueue> RegionTaskQueueSet; |
1 | 624 |
|
1407
9006b01ba3fd
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
1388
diff
changeset
|
625 |
class RegionTaskQueueWithOverflow: public CHeapObj { |
1 | 626 |
protected: |
1407
9006b01ba3fd
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
1388
diff
changeset
|
627 |
RegionTaskQueue _region_queue; |
9006b01ba3fd
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
1388
diff
changeset
|
628 |
GrowableArray<RegionTask>* _overflow_stack; |
1 | 629 |
|
630 |
public: |
|
1407
9006b01ba3fd
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
1388
diff
changeset
|
631 |
RegionTaskQueueWithOverflow() : _overflow_stack(NULL) {} |
1 | 632 |
// Initialize both stealable queue and overflow |
633 |
void initialize(); |
|
634 |
// Save first to stealable queue and then to overflow |
|
1407
9006b01ba3fd
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
1388
diff
changeset
|
635 |
void save(RegionTask t); |
1 | 636 |
// Retrieve first from overflow and then from stealable queue |
1407
9006b01ba3fd
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
1388
diff
changeset
|
637 |
bool retrieve(RegionTask& region_index); |
1 | 638 |
// Retrieve from stealable queue |
1407
9006b01ba3fd
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
1388
diff
changeset
|
639 |
bool retrieve_from_stealable_queue(RegionTask& region_index); |
1 | 640 |
// Retrieve from overflow |
1407
9006b01ba3fd
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
1388
diff
changeset
|
641 |
bool retrieve_from_overflow(RegionTask& region_index); |
1 | 642 |
bool is_empty(); |
643 |
bool stealable_is_empty(); |
|
644 |
bool overflow_is_empty(); |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
645 |
uint stealable_size() { return _region_queue.size(); } |
1407
9006b01ba3fd
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
1388
diff
changeset
|
646 |
RegionTaskQueue* task_queue() { return &_region_queue; } |
1 | 647 |
}; |
648 |
||
1407
9006b01ba3fd
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
1388
diff
changeset
|
649 |
#define USE_RegionTaskQueueWithOverflow |