author | stefank |
Fri, 22 May 2015 13:35:29 +0200 | |
changeset 30878 | f1702744b3a4 |
parent 30764 | fec48bf5a827 |
child 31994 | 3721b7aa3a0d |
permissions | -rw-r--r-- |
1 | 1 |
/* |
30585 | 2 |
* Copyright (c) 2001, 2015, 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 |
||
30764 | 25 |
#ifndef SHARE_VM_GC_SHARED_TASKQUEUE_HPP |
26 |
#define SHARE_VM_GC_SHARED_TASKQUEUE_HPP |
|
7397 | 27 |
|
28 |
#include "memory/allocation.hpp" |
|
29 |
#include "utilities/stack.hpp" |
|
30 |
||
6067 | 31 |
// Simple TaskQueue stats that are collected by default in debug builds. |
32 |
||
33 |
#if !defined(TASKQUEUE_STATS) && defined(ASSERT) |
|
34 |
#define TASKQUEUE_STATS 1 |
|
35 |
#elif !defined(TASKQUEUE_STATS) |
|
36 |
#define TASKQUEUE_STATS 0 |
|
37 |
#endif |
|
38 |
||
39 |
#if TASKQUEUE_STATS |
|
40 |
#define TASKQUEUE_STATS_ONLY(code) code |
|
41 |
#else |
|
42 |
#define TASKQUEUE_STATS_ONLY(code) |
|
43 |
#endif // TASKQUEUE_STATS |
|
44 |
||
45 |
#if TASKQUEUE_STATS |
|
46 |
class TaskQueueStats { |
|
47 |
public: |
|
48 |
enum StatId { |
|
49 |
push, // number of taskqueue pushes |
|
50 |
pop, // number of taskqueue pops |
|
51 |
pop_slow, // subset of taskqueue pops that were done slow-path |
|
52 |
steal_attempt, // number of taskqueue steal attempts |
|
53 |
steal, // number of taskqueue steals |
|
54 |
overflow, // number of overflow pushes |
|
55 |
overflow_max_len, // max length of overflow stack |
|
56 |
last_stat_id |
|
57 |
}; |
|
58 |
||
59 |
public: |
|
60 |
inline TaskQueueStats() { reset(); } |
|
61 |
||
62 |
inline void record_push() { ++_stats[push]; } |
|
63 |
inline void record_pop() { ++_stats[pop]; } |
|
64 |
inline void record_pop_slow() { record_pop(); ++_stats[pop_slow]; } |
|
65 |
inline void record_steal(bool success); |
|
66 |
inline void record_overflow(size_t new_length); |
|
67 |
||
6251 | 68 |
TaskQueueStats & operator +=(const TaskQueueStats & addend); |
69 |
||
6067 | 70 |
inline size_t get(StatId id) const { return _stats[id]; } |
71 |
inline const size_t* get() const { return _stats; } |
|
72 |
||
73 |
inline void reset(); |
|
74 |
||
6251 | 75 |
// Print the specified line of the header (does not include a line separator). |
6067 | 76 |
static void print_header(unsigned int line, outputStream* const stream = tty, |
77 |
unsigned int width = 10); |
|
6251 | 78 |
// Print the statistics (does not include a line separator). |
6067 | 79 |
void print(outputStream* const stream = tty, unsigned int width = 10) const; |
80 |
||
6251 | 81 |
DEBUG_ONLY(void verify() const;) |
82 |
||
6067 | 83 |
private: |
84 |
size_t _stats[last_stat_id]; |
|
85 |
static const char * const _names[last_stat_id]; |
|
86 |
}; |
|
87 |
||
88 |
void TaskQueueStats::record_steal(bool success) { |
|
89 |
++_stats[steal_attempt]; |
|
90 |
if (success) ++_stats[steal]; |
|
91 |
} |
|
92 |
||
93 |
void TaskQueueStats::record_overflow(size_t new_len) { |
|
94 |
++_stats[overflow]; |
|
95 |
if (new_len > _stats[overflow_max_len]) _stats[overflow_max_len] = new_len; |
|
96 |
} |
|
97 |
||
98 |
void TaskQueueStats::reset() { |
|
99 |
memset(_stats, 0, sizeof(_stats)); |
|
100 |
} |
|
101 |
#endif // TASKQUEUE_STATS |
|
102 |
||
19346
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
103 |
// TaskQueueSuper collects functionality common to all GenericTaskQueue instances. |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
104 |
|
13195 | 105 |
template <unsigned int N, MEMFLAGS F> |
106 |
class TaskQueueSuper: public CHeapObj<F> { |
|
1 | 107 |
protected: |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
108 |
// 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
|
109 |
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
|
110 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
111 |
// 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
|
112 |
volatile uint _bottom; |
1 | 113 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
114 |
enum { MOD_N_MASK = N - 1 }; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
115 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
116 |
class Age { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
117 |
public: |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
118 |
Age(size_t data = 0) { _data = data; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
119 |
Age(const Age& age) { _data = age._data; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
120 |
Age(idx_t top, idx_t tag) { _fields._top = top; _fields._tag = tag; } |
1 | 121 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
122 |
Age get() const volatile { return _data; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
123 |
void set(Age age) volatile { _data = 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 |
idx_t top() const volatile { return _fields._top; } |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
126 |
idx_t tag() const volatile { return _fields._tag; } |
1 | 127 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
128 |
// Increment top; if it wraps, increment tag also. |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
129 |
void increment() { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
130 |
_fields._top = increment_index(_fields._top); |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
131 |
if (_fields._top == 0) ++_fields._tag; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
132 |
} |
1 | 133 |
|
30566
18eb9aa972d0
8076177: Remove usage of stack.inline.hpp functions from taskqueue.hpp
stefank
parents:
27880
diff
changeset
|
134 |
Age cmpxchg(const Age new_age, const Age old_age) volatile; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
135 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
136 |
bool operator ==(const Age& other) const { return _data == other._data; } |
1 | 137 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
138 |
private: |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
139 |
struct fields { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
140 |
idx_t _top; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
141 |
idx_t _tag; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
142 |
}; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
143 |
union { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
144 |
size_t _data; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
145 |
fields _fields; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
146 |
}; |
1 | 147 |
}; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
148 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
149 |
volatile Age _age; |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
150 |
|
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
151 |
// These both operate mod N. |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
152 |
static uint increment_index(uint ind) { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
153 |
return (ind + 1) & MOD_N_MASK; |
1 | 154 |
} |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
155 |
static uint decrement_index(uint ind) { |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
156 |
return (ind - 1) & MOD_N_MASK; |
1 | 157 |
} |
158 |
||
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
159 |
// 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
|
160 |
// interpreted as 0. |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
161 |
uint dirty_size(uint bot, uint top) const { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
162 |
return (bot - top) & MOD_N_MASK; |
1 | 163 |
} |
164 |
||
165 |
// 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
|
166 |
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
|
167 |
uint sz = dirty_size(bot, top); |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
168 |
// 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
|
169 |
// 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
|
170 |
// 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
|
171 |
// _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
|
172 |
// 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
|
173 |
// 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
|
174 |
// 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
|
175 |
// 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
|
176 |
// 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
|
177 |
// 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
|
178 |
// 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
|
179 |
// 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
|
180 |
// 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
|
181 |
// _bottom == top so subsequent pushes will be performed normally. |
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
182 |
return (sz == N - 1) ? 0 : sz; |
1 | 183 |
} |
184 |
||
185 |
public: |
|
186 |
TaskQueueSuper() : _bottom(0), _age() {} |
|
187 |
||
5918 | 188 |
// Return true if the TaskQueue contains/does not contain any tasks. |
189 |
bool peek() const { return _bottom != _age.top(); } |
|
190 |
bool is_empty() const { return size() == 0; } |
|
1 | 191 |
|
192 |
// Return an estimate of the number of elements in the queue. |
|
193 |
// The "careful" version admits the possibility of pop_local/pop_global |
|
194 |
// races. |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
195 |
uint size() const { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
196 |
return size(_bottom, _age.top()); |
1 | 197 |
} |
198 |
||
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
199 |
uint dirty_size() const { |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
200 |
return dirty_size(_bottom, _age.top()); |
1 | 201 |
} |
202 |
||
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
203 |
void set_empty() { |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
204 |
_bottom = 0; |
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
205 |
_age.set(0); |
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
206 |
} |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
207 |
|
1 | 208 |
// Maximum number of elements allowed in the queue. This is two less |
209 |
// 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
|
210 |
uint max_elems() const { return N - 2; } |
5035 | 211 |
|
212 |
// Total size of queue. |
|
213 |
static const uint total_size() { return N; } |
|
6067 | 214 |
|
215 |
TASKQUEUE_STATS_ONLY(TaskQueueStats stats;) |
|
1 | 216 |
}; |
217 |
||
19346
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
218 |
// |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
219 |
// GenericTaskQueue implements an ABP, Aurora-Blumofe-Plaxton, double- |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
220 |
// ended-queue (deque), intended for use in work stealing. Queue operations |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
221 |
// are non-blocking. |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
222 |
// |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
223 |
// A queue owner thread performs push() and pop_local() operations on one end |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
224 |
// of the queue, while other threads may steal work using the pop_global() |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
225 |
// method. |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
226 |
// |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
227 |
// The main difference to the original algorithm is that this |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
228 |
// implementation allows wrap-around at the end of its allocated |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
229 |
// storage, which is an array. |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
230 |
// |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
231 |
// The original paper is: |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
232 |
// |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
233 |
// Arora, N. S., Blumofe, R. D., and Plaxton, C. G. |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
234 |
// Thread scheduling for multiprogrammed multiprocessors. |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
235 |
// Theory of Computing Systems 34, 2 (2001), 115-144. |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
236 |
// |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
237 |
// The following paper provides an correctness proof and an |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
238 |
// implementation for weakly ordered memory models including (pseudo-) |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
239 |
// code containing memory barriers for a Chase-Lev deque. Chase-Lev is |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
240 |
// similar to ABP, with the main difference that it allows resizing of the |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
241 |
// underlying storage: |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
242 |
// |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
243 |
// Le, N. M., Pop, A., Cohen A., and Nardell, F. Z. |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
244 |
// Correct and efficient work-stealing for weak memory models |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
245 |
// Proceedings of the 18th ACM SIGPLAN symposium on Principles and |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
246 |
// practice of parallel programming (PPoPP 2013), 69-80 |
7a5310d39603
8022784: TaskQueue misses minimal documentation and references for analysis
tschatzl
parents:
19153
diff
changeset
|
247 |
// |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
248 |
|
13195 | 249 |
template <class E, MEMFLAGS F, unsigned int N = TASKQUEUE_SIZE> |
250 |
class GenericTaskQueue: public TaskQueueSuper<N, F> { |
|
16682
4e30a46f6b76
7197666: java -d64 -version core dumps in a box with lots of memory
brutisso
parents:
14292
diff
changeset
|
251 |
ArrayAllocator<E, F> _array_allocator; |
13195 | 252 |
protected: |
253 |
typedef typename TaskQueueSuper<N, F>::Age Age; |
|
254 |
typedef typename TaskQueueSuper<N, F>::idx_t idx_t; |
|
255 |
||
256 |
using TaskQueueSuper<N, F>::_bottom; |
|
257 |
using TaskQueueSuper<N, F>::_age; |
|
258 |
using TaskQueueSuper<N, F>::increment_index; |
|
259 |
using TaskQueueSuper<N, F>::decrement_index; |
|
260 |
using TaskQueueSuper<N, F>::dirty_size; |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
261 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
262 |
public: |
13195 | 263 |
using TaskQueueSuper<N, F>::max_elems; |
264 |
using TaskQueueSuper<N, F>::size; |
|
265 |
||
266 |
#if TASKQUEUE_STATS |
|
267 |
using TaskQueueSuper<N, F>::stats; |
|
268 |
#endif |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
269 |
|
1 | 270 |
private: |
271 |
// 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
|
272 |
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
|
273 |
bool pop_local_slow(uint localBot, Age oldAge); |
1 | 274 |
|
275 |
public: |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
276 |
typedef E element_type; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
277 |
|
1 | 278 |
// Initializes the queue to empty. |
279 |
GenericTaskQueue(); |
|
280 |
||
281 |
void initialize(); |
|
282 |
||
5918 | 283 |
// Push the task "t" on the queue. Returns "false" iff the queue is full. |
1 | 284 |
inline bool push(E t); |
285 |
||
5918 | 286 |
// Attempts to claim a task from the "local" end of the queue (the most |
287 |
// recently pushed). If successful, returns true and sets t to the task; |
|
288 |
// otherwise, returns false (the queue is empty). |
|
20282
7f9cbdf89af2
7195622: CheckUnhandledOops has limited usefulness now
hseigel
parents:
19346
diff
changeset
|
289 |
inline bool pop_local(volatile E& t); |
1 | 290 |
|
5918 | 291 |
// Like pop_local(), but uses the "global" end of the queue (the least |
292 |
// recently pushed). |
|
20282
7f9cbdf89af2
7195622: CheckUnhandledOops has limited usefulness now
hseigel
parents:
19346
diff
changeset
|
293 |
bool pop_global(volatile E& t); |
1 | 294 |
|
295 |
// Delete any resource associated with the queue. |
|
296 |
~GenericTaskQueue(); |
|
297 |
||
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
298 |
// apply the closure to all elements in the task queue |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
299 |
void oops_do(OopClosure* f); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
300 |
|
1 | 301 |
private: |
302 |
// Element array. |
|
303 |
volatile E* _elems; |
|
304 |
}; |
|
305 |
||
13195 | 306 |
template<class E, MEMFLAGS F, unsigned int N> |
307 |
GenericTaskQueue<E, F, N>::GenericTaskQueue() { |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
308 |
assert(sizeof(Age) == sizeof(size_t), "Depends on this."); |
1 | 309 |
} |
310 |
||
5918 | 311 |
// OverflowTaskQueue is a TaskQueue that also includes an overflow stack for |
312 |
// elements that do not fit in the TaskQueue. |
|
313 |
// |
|
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
6759
diff
changeset
|
314 |
// This class hides two methods from super classes: |
5918 | 315 |
// |
316 |
// push() - push onto the task queue or, if that fails, onto the overflow stack |
|
317 |
// is_empty() - return true if both the TaskQueue and overflow stack are empty |
|
318 |
// |
|
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
6759
diff
changeset
|
319 |
// Note that size() is not hidden--it returns the number of elements in the |
5918 | 320 |
// TaskQueue, and does not include the size of the overflow stack. This |
321 |
// simplifies replacement of GenericTaskQueues with OverflowTaskQueues. |
|
13195 | 322 |
template<class E, MEMFLAGS F, unsigned int N = TASKQUEUE_SIZE> |
323 |
class OverflowTaskQueue: public GenericTaskQueue<E, F, N> |
|
5918 | 324 |
{ |
325 |
public: |
|
13195 | 326 |
typedef Stack<E, F> overflow_t; |
327 |
typedef GenericTaskQueue<E, F, N> taskqueue_t; |
|
5918 | 328 |
|
6067 | 329 |
TASKQUEUE_STATS_ONLY(using taskqueue_t::stats;) |
330 |
||
5918 | 331 |
// Push task t onto the queue or onto the overflow stack. Return true. |
332 |
inline bool push(E t); |
|
333 |
||
334 |
// Attempt to pop from the overflow stack; return true if anything was popped. |
|
335 |
inline bool pop_overflow(E& t); |
|
336 |
||
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
6759
diff
changeset
|
337 |
inline overflow_t* overflow_stack() { return &_overflow_stack; } |
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
6759
diff
changeset
|
338 |
|
5918 | 339 |
inline bool taskqueue_empty() const { return taskqueue_t::is_empty(); } |
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
6759
diff
changeset
|
340 |
inline bool overflow_empty() const { return _overflow_stack.is_empty(); } |
5918 | 341 |
inline bool is_empty() const { |
342 |
return taskqueue_empty() && overflow_empty(); |
|
343 |
} |
|
344 |
||
345 |
private: |
|
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
6759
diff
changeset
|
346 |
overflow_t _overflow_stack; |
5918 | 347 |
}; |
348 |
||
13195 | 349 |
class TaskQueueSetSuper { |
1 | 350 |
protected: |
351 |
static int randomParkAndMiller(int* seed0); |
|
352 |
public: |
|
353 |
// Returns "true" if some TaskQueue in the set contains a task. |
|
354 |
virtual bool peek() = 0; |
|
355 |
}; |
|
356 |
||
13195 | 357 |
template <MEMFLAGS F> class TaskQueueSetSuperImpl: public CHeapObj<F>, public TaskQueueSetSuper { |
358 |
}; |
|
359 |
||
360 |
template<class T, MEMFLAGS F> |
|
361 |
class GenericTaskQueueSet: public TaskQueueSetSuperImpl<F> { |
|
1 | 362 |
private: |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
363 |
uint _n; |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
364 |
T** _queues; |
1 | 365 |
|
366 |
public: |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
367 |
typedef typename T::element_type E; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
368 |
|
30566
18eb9aa972d0
8076177: Remove usage of stack.inline.hpp functions from taskqueue.hpp
stefank
parents:
27880
diff
changeset
|
369 |
GenericTaskQueueSet(int n); |
1 | 370 |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
371 |
bool steal_best_of_2(uint queue_num, int* seed, E& t); |
1 | 372 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
373 |
void register_queue(uint i, T* q); |
1 | 374 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
375 |
T* queue(uint n); |
1 | 376 |
|
5918 | 377 |
// The thread with queue number "queue_num" (and whose random number seed is |
378 |
// at "seed") is trying to steal a task from some other queue. (It may try |
|
379 |
// several queues, according to some configuration parameter.) If some steal |
|
380 |
// succeeds, returns "true" and sets "t" to the stolen task, otherwise returns |
|
381 |
// false. |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
382 |
bool steal(uint queue_num, int* seed, E& t); |
1 | 383 |
|
384 |
bool peek(); |
|
30878
f1702744b3a4
8080877: Don't use workers()->total_workers() when walking G1CollectedHeap::_task_queues
stefank
parents:
30764
diff
changeset
|
385 |
|
f1702744b3a4
8080877: Don't use workers()->total_workers() when walking G1CollectedHeap::_task_queues
stefank
parents:
30764
diff
changeset
|
386 |
uint size() const { return _n; } |
1 | 387 |
}; |
388 |
||
13195 | 389 |
template<class T, MEMFLAGS F> void |
390 |
GenericTaskQueueSet<T, F>::register_queue(uint i, T* q) { |
|
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
391 |
assert(i < _n, "index out of range."); |
1 | 392 |
_queues[i] = q; |
393 |
} |
|
394 |
||
13195 | 395 |
template<class T, MEMFLAGS F> T* |
396 |
GenericTaskQueueSet<T, F>::queue(uint i) { |
|
1 | 397 |
return _queues[i]; |
398 |
} |
|
399 |
||
13195 | 400 |
template<class T, MEMFLAGS F> |
401 |
bool GenericTaskQueueSet<T, F>::peek() { |
|
1 | 402 |
// Try all the queues. |
2005
42075507972b
6787254: Work queue capacity can be increased substantially on some platforms
ysr
parents:
1407
diff
changeset
|
403 |
for (uint j = 0; j < _n; j++) { |
1 | 404 |
if (_queues[j]->peek()) |
405 |
return true; |
|
406 |
} |
|
407 |
return false; |
|
408 |
} |
|
409 |
||
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
410 |
// When to terminate from the termination protocol. |
13195 | 411 |
class TerminatorTerminator: public CHeapObj<mtInternal> { |
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
412 |
public: |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
413 |
virtual bool should_exit_termination() = 0; |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
414 |
}; |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
415 |
|
1 | 416 |
// A class to aid in the termination of a set of parallel tasks using |
417 |
// TaskQueueSet's for work stealing. |
|
418 |
||
2010
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
419 |
#undef TRACESPINNING |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
420 |
|
1 | 421 |
class ParallelTaskTerminator: public StackObj { |
422 |
private: |
|
30585 | 423 |
uint _n_threads; |
1 | 424 |
TaskQueueSetSuper* _queue_set; |
30585 | 425 |
uint _offered_termination; |
1 | 426 |
|
2010
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
427 |
#ifdef TRACESPINNING |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
428 |
static uint _total_yields; |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
429 |
static uint _total_spins; |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
430 |
static uint _total_peeks; |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
431 |
#endif |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
432 |
|
1 | 433 |
bool peek_in_queue_set(); |
434 |
protected: |
|
435 |
virtual void yield(); |
|
436 |
void sleep(uint millis); |
|
437 |
||
438 |
public: |
|
439 |
||
440 |
// "n_threads" is the number of threads to be terminated. "queue_set" is a |
|
441 |
// queue sets of work queues of other threads. |
|
30585 | 442 |
ParallelTaskTerminator(uint n_threads, TaskQueueSetSuper* queue_set); |
1 | 443 |
|
444 |
// The current thread has no work, and is ready to terminate if everyone |
|
445 |
// else is. If returns "true", all threads are terminated. If returns |
|
446 |
// "false", available work has been observed in one of the task queues, |
|
447 |
// so the global task is not complete. |
|
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
448 |
bool offer_termination() { |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
449 |
return offer_termination(NULL); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
450 |
} |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
451 |
|
3607
fa62293fa65c
6821693: 64-bit TaskQueue capacity still too small
jcoomes
parents:
3262
diff
changeset
|
452 |
// 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
|
453 |
// method of the terminator parameter returns true. If terminator is |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
454 |
// NULL, then it is ignored. |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
455 |
bool offer_termination(TerminatorTerminator* terminator); |
1 | 456 |
|
457 |
// Reset the terminator, so that it may be reused again. |
|
458 |
// The caller is responsible for ensuring that this is done |
|
459 |
// in an MT-safe manner, once the previous round of use of |
|
460 |
// the terminator is finished. |
|
461 |
void reset_for_reuse(); |
|
6759
67b1a69ef5aa
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
6251
diff
changeset
|
462 |
// Same as above but the number of parallel threads is set to the |
67b1a69ef5aa
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
6251
diff
changeset
|
463 |
// given number. |
30585 | 464 |
void reset_for_reuse(uint n_threads); |
1 | 465 |
|
2010
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
466 |
#ifdef TRACESPINNING |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
467 |
static uint total_yields() { return _total_yields; } |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
468 |
static uint total_spins() { return _total_spins; } |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
469 |
static uint total_peeks() { return _total_peeks; } |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
470 |
static void print_termination_counts(); |
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2005
diff
changeset
|
471 |
#endif |
1 | 472 |
}; |
473 |
||
13195 | 474 |
typedef GenericTaskQueue<oop, mtGC> OopTaskQueue; |
475 |
typedef GenericTaskQueueSet<OopTaskQueue, mtGC> OopTaskQueueSet; |
|
1 | 476 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
477 |
#ifdef _MSC_VER |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
478 |
#pragma warning(push) |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
479 |
// warning C4522: multiple assignment operators specified |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
480 |
#pragma warning(disable:4522) |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
481 |
#endif |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
482 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
483 |
// 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
|
484 |
// 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
|
485 |
// 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
|
486 |
class StarTask { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
487 |
void* _holder; // either union oop* or narrowOop* |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
488 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
489 |
enum { COMPRESSED_OOP_MASK = 1 }; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
490 |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
491 |
public: |
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
492 |
StarTask(narrowOop* p) { |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
493 |
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
|
494 |
_holder = (void *)((uintptr_t)p | COMPRESSED_OOP_MASK); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
495 |
} |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
496 |
StarTask(oop* p) { |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
497 |
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
|
498 |
_holder = (void*)p; |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2105
diff
changeset
|
499 |
} |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
500 |
StarTask() { _holder = NULL; } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
501 |
operator oop*() { return (oop*)_holder; } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
502 |
operator narrowOop*() { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
503 |
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
|
504 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
505 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
506 |
StarTask& operator=(const StarTask& t) { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
507 |
_holder = t._holder; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
508 |
return *this; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
509 |
} |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
510 |
volatile StarTask& operator=(const volatile StarTask& t) volatile { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
511 |
_holder = t._holder; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
512 |
return *this; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
513 |
} |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
514 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
515 |
bool is_narrow() const { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
516 |
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
|
517 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
518 |
}; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
519 |
|
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
520 |
class ObjArrayTask |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
521 |
{ |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
522 |
public: |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
523 |
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
|
524 |
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
|
525 |
assert(idx <= size_t(max_jint), "too big"); |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
526 |
} |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
527 |
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
|
528 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
529 |
ObjArrayTask& operator =(const ObjArrayTask& t) { |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
530 |
_obj = t._obj; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
531 |
_index = t._index; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
532 |
return *this; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
533 |
} |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
534 |
volatile ObjArrayTask& |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
535 |
operator =(const volatile ObjArrayTask& t) volatile { |
20282
7f9cbdf89af2
7195622: CheckUnhandledOops has limited usefulness now
hseigel
parents:
19346
diff
changeset
|
536 |
(void)const_cast<oop&>(_obj = t._obj); |
5076
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
537 |
_index = t._index; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
538 |
return *this; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
539 |
} |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
540 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
541 |
inline oop obj() const { return _obj; } |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
542 |
inline int index() const { return _index; } |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
543 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
544 |
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
|
545 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
546 |
private: |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
547 |
oop _obj; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
548 |
int _index; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
549 |
}; |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
550 |
|
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
551 |
#ifdef _MSC_VER |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
552 |
#pragma warning(pop) |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
553 |
#endif |
8b74a4b60b31
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
5035
diff
changeset
|
554 |
|
13195 | 555 |
typedef OverflowTaskQueue<StarTask, mtClass> OopStarTaskQueue; |
556 |
typedef GenericTaskQueueSet<OopStarTaskQueue, mtClass> OopStarTaskQueueSet; |
|
1 | 557 |
|
13195 | 558 |
typedef OverflowTaskQueue<size_t, mtInternal> RegionTaskQueue; |
559 |
typedef GenericTaskQueueSet<RegionTaskQueue, mtClass> RegionTaskQueueSet; |
|
6759
67b1a69ef5aa
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
6251
diff
changeset
|
560 |
|
7397 | 561 |
|
30764 | 562 |
#endif // SHARE_VM_GC_SHARED_TASKQUEUE_HPP |