Mercurial > hg > truffle

annotate src/share/vm/utilities/taskqueue.hpp @ 2192:b92c45f2bc75

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