author | eosterlund |
Tue, 12 Nov 2019 09:25:39 +0000 | |
changeset 59025 | b398685dd029 |
parent 58516 | d376d86b0a01 |
child 59324 | 5e8f9713e343 |
permissions | -rw-r--r-- |
50180 | 1 |
/* |
54048
744dc9c33676
8217417: Decorator name typo: C2_TIGHLY_COUPLED_ALLOC
kbarrett
parents:
52925
diff
changeset
|
2 |
* Copyright (c) 2018, 2019, Oracle and/or its affiliates. All rights reserved. |
50180 | 3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 |
* |
|
5 |
* This code is free software; you can redistribute it and/or modify it |
|
6 |
* under the terms of the GNU General Public License version 2 only, as |
|
7 |
* published by the Free Software Foundation. |
|
8 |
* |
|
9 |
* This code is distributed in the hope that it will be useful, but WITHOUT |
|
10 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
11 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
12 |
* version 2 for more details (a copy is included in the LICENSE file that |
|
13 |
* accompanied this code). |
|
14 |
* |
|
15 |
* You should have received a copy of the GNU General Public License version |
|
16 |
* 2 along with this work; if not, write to the Free Software Foundation, |
|
17 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
|
18 |
* |
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
20 |
* or visit www.oracle.com if you need additional information or have any |
|
21 |
* questions. |
|
22 |
* |
|
23 |
*/ |
|
24 |
||
25 |
#ifndef SHARE_GC_SHARED_C2_BARRIERSETC2_HPP |
|
26 |
#define SHARE_GC_SHARED_C2_BARRIERSETC2_HPP |
|
27 |
||
28 |
#include "memory/allocation.hpp" |
|
29 |
#include "oops/accessDecorators.hpp" |
|
30 |
#include "opto/loopnode.hpp" |
|
52627 | 31 |
#include "opto/matcher.hpp" |
50180 | 32 |
#include "opto/memnode.hpp" |
33 |
#include "utilities/globalDefinitions.hpp" |
|
34 |
||
35 |
// This means the access is mismatched. This means the value of an access |
|
36 |
// is not equivalent to the value pointed to by the address. |
|
37 |
const DecoratorSet C2_MISMATCHED = DECORATOR_LAST << 1; |
|
38 |
// The access may not be aligned to its natural size. |
|
39 |
const DecoratorSet C2_UNALIGNED = DECORATOR_LAST << 2; |
|
40 |
// The atomic cmpxchg is weak, meaning that spurious false negatives are allowed, |
|
41 |
// but never false positives. |
|
42 |
const DecoratorSet C2_WEAK_CMPXCHG = DECORATOR_LAST << 3; |
|
43 |
// This denotes that a load has control dependency. |
|
44 |
const DecoratorSet C2_CONTROL_DEPENDENT_LOAD = DECORATOR_LAST << 4; |
|
57582
a79a819a8218
8227407: ZGC: C2 loads and load barriers can get separated by safepoints
eosterlund
parents:
55541
diff
changeset
|
45 |
// This denotes that a load that must be pinned, but may float above safepoints. |
a79a819a8218
8227407: ZGC: C2 loads and load barriers can get separated by safepoints
eosterlund
parents:
55541
diff
changeset
|
46 |
const DecoratorSet C2_UNKNOWN_CONTROL_LOAD = DECORATOR_LAST << 5; |
50180 | 47 |
// This denotes that the access is produced from the sun.misc.Unsafe intrinsics. |
48 |
const DecoratorSet C2_UNSAFE_ACCESS = DECORATOR_LAST << 6; |
|
49 |
// This denotes that the access mutates state. |
|
50 |
const DecoratorSet C2_WRITE_ACCESS = DECORATOR_LAST << 7; |
|
51 |
// This denotes that the access reads state. |
|
52 |
const DecoratorSet C2_READ_ACCESS = DECORATOR_LAST << 8; |
|
52424 | 53 |
// A nearby allocation? |
54048
744dc9c33676
8217417: Decorator name typo: C2_TIGHLY_COUPLED_ALLOC
kbarrett
parents:
52925
diff
changeset
|
54 |
const DecoratorSet C2_TIGHTLY_COUPLED_ALLOC = DECORATOR_LAST << 9; |
52424 | 55 |
// Loads and stores from an arraycopy being optimized |
56 |
const DecoratorSet C2_ARRAY_COPY = DECORATOR_LAST << 10; |
|
50180 | 57 |
|
52426
38bf0c9c4e64
8213384: Move G1/C2 barrier verification into G1BarrierSetC2
rkennke
parents:
52424
diff
changeset
|
58 |
class Compile; |
52568 | 59 |
class ConnectionGraph; |
50180 | 60 |
class GraphKit; |
61 |
class IdealKit; |
|
62 |
class Node; |
|
52712
d17e09494308
8214362: C2: gc interface entry point for split if
roland
parents:
52711
diff
changeset
|
63 |
class PhaseGVN; |
52711 | 64 |
class PhaseIdealLoop; |
52568 | 65 |
class PhaseMacroExpand; |
50180 | 66 |
class Type; |
67 |
class TypePtr; |
|
52568 | 68 |
class Unique_Node_List; |
50180 | 69 |
|
70 |
// This class wraps a node and a type. |
|
71 |
class C2AccessValue: public StackObj { |
|
72 |
protected: |
|
73 |
Node* _node; |
|
74 |
const Type* _type; |
|
75 |
||
76 |
public: |
|
77 |
C2AccessValue(Node* node, const Type* type) : |
|
78 |
_node(node), |
|
79 |
_type(type) {} |
|
80 |
||
81 |
Node* node() const { return _node; } |
|
82 |
const Type* type() const { return _type; } |
|
83 |
||
84 |
void set_node(Node* node) { _node = node; } |
|
85 |
}; |
|
86 |
||
87 |
// This class wraps a node and a pointer type. |
|
88 |
class C2AccessValuePtr: public C2AccessValue { |
|
89 |
||
90 |
public: |
|
91 |
C2AccessValuePtr(Node* node, const TypePtr* type) : |
|
92 |
C2AccessValue(node, reinterpret_cast<const Type*>(type)) {} |
|
93 |
||
94 |
const TypePtr* type() const { return reinterpret_cast<const TypePtr*>(_type); } |
|
95 |
}; |
|
96 |
||
97 |
// This class wraps a bunch of context parameters thare are passed around in the |
|
98 |
// BarrierSetC2 backend hierarchy, for loads and stores, to reduce boiler plate. |
|
99 |
class C2Access: public StackObj { |
|
100 |
protected: |
|
101 |
DecoratorSet _decorators; |
|
102 |
BasicType _type; |
|
103 |
Node* _base; |
|
104 |
C2AccessValuePtr& _addr; |
|
105 |
Node* _raw_access; |
|
59025
b398685dd029
8233506: ZGC: the load for Reference.get() can be converted to a load for strong refs
eosterlund
parents:
58516
diff
changeset
|
106 |
uint8_t _barrier_data; |
50180 | 107 |
|
108 |
void fixup_decorators(); |
|
109 |
||
110 |
public: |
|
52424 | 111 |
C2Access(DecoratorSet decorators, |
50180 | 112 |
BasicType type, Node* base, C2AccessValuePtr& addr) : |
113 |
_decorators(decorators), |
|
114 |
_type(type), |
|
115 |
_base(base), |
|
116 |
_addr(addr), |
|
59025
b398685dd029
8233506: ZGC: the load for Reference.get() can be converted to a load for strong refs
eosterlund
parents:
58516
diff
changeset
|
117 |
_raw_access(NULL), |
b398685dd029
8233506: ZGC: the load for Reference.get() can be converted to a load for strong refs
eosterlund
parents:
58516
diff
changeset
|
118 |
_barrier_data(0) |
52424 | 119 |
{} |
50180 | 120 |
|
121 |
DecoratorSet decorators() const { return _decorators; } |
|
122 |
Node* base() const { return _base; } |
|
123 |
C2AccessValuePtr& addr() const { return _addr; } |
|
124 |
BasicType type() const { return _type; } |
|
58273
08a5148e7c4e
8230505: Replace JVM type comparisons to T_OBJECT and T_ARRAY with call to is_reference_type
lfoltan
parents:
58217
diff
changeset
|
125 |
bool is_oop() const { return is_reference_type(_type); } |
50180 | 126 |
bool is_raw() const { return (_decorators & AS_RAW) != 0; } |
127 |
Node* raw_access() const { return _raw_access; } |
|
128 |
||
59025
b398685dd029
8233506: ZGC: the load for Reference.get() can be converted to a load for strong refs
eosterlund
parents:
58516
diff
changeset
|
129 |
uint8_t barrier_data() const { return _barrier_data; } |
b398685dd029
8233506: ZGC: the load for Reference.get() can be converted to a load for strong refs
eosterlund
parents:
58516
diff
changeset
|
130 |
void set_barrier_data(uint8_t data) { _barrier_data = data; } |
b398685dd029
8233506: ZGC: the load for Reference.get() can be converted to a load for strong refs
eosterlund
parents:
58516
diff
changeset
|
131 |
|
50180 | 132 |
void set_raw_access(Node* raw_access) { _raw_access = raw_access; } |
133 |
virtual void set_memory() {} // no-op for normal accesses, but not for atomic accesses. |
|
134 |
||
135 |
MemNode::MemOrd mem_node_mo() const; |
|
136 |
bool needs_cpu_membar() const; |
|
137 |
||
52424 | 138 |
virtual PhaseGVN& gvn() const = 0; |
139 |
virtual bool is_parse_access() const { return false; } |
|
140 |
virtual bool is_opt_access() const { return false; } |
|
141 |
}; |
|
142 |
||
143 |
// C2Access for parse time calls to the BarrierSetC2 backend. |
|
144 |
class C2ParseAccess: public C2Access { |
|
145 |
protected: |
|
146 |
GraphKit* _kit; |
|
147 |
||
148 |
void* barrier_set_state() const; |
|
149 |
||
150 |
public: |
|
151 |
C2ParseAccess(GraphKit* kit, DecoratorSet decorators, |
|
152 |
BasicType type, Node* base, C2AccessValuePtr& addr) : |
|
153 |
C2Access(decorators, type, base, addr), |
|
154 |
_kit(kit) { |
|
155 |
fixup_decorators(); |
|
156 |
} |
|
157 |
||
158 |
GraphKit* kit() const { return _kit; } |
|
159 |
||
50180 | 160 |
template <typename T> |
161 |
T barrier_set_state_as() const { |
|
162 |
return reinterpret_cast<T>(barrier_set_state()); |
|
163 |
} |
|
52424 | 164 |
|
165 |
virtual PhaseGVN& gvn() const; |
|
166 |
virtual bool is_parse_access() const { return true; } |
|
50180 | 167 |
}; |
168 |
||
169 |
// This class wraps a bunch of context parameters thare are passed around in the |
|
170 |
// BarrierSetC2 backend hierarchy, for atomic accesses, to reduce boiler plate. |
|
52424 | 171 |
class C2AtomicParseAccess: public C2ParseAccess { |
50180 | 172 |
Node* _memory; |
173 |
uint _alias_idx; |
|
174 |
bool _needs_pinning; |
|
175 |
||
176 |
public: |
|
52424 | 177 |
C2AtomicParseAccess(GraphKit* kit, DecoratorSet decorators, BasicType type, |
50180 | 178 |
Node* base, C2AccessValuePtr& addr, uint alias_idx) : |
52424 | 179 |
C2ParseAccess(kit, decorators, type, base, addr), |
50180 | 180 |
_memory(NULL), |
181 |
_alias_idx(alias_idx), |
|
182 |
_needs_pinning(true) {} |
|
183 |
||
184 |
// Set the memory node based on the current memory slice. |
|
185 |
virtual void set_memory(); |
|
186 |
||
187 |
Node* memory() const { return _memory; } |
|
188 |
uint alias_idx() const { return _alias_idx; } |
|
189 |
bool needs_pinning() const { return _needs_pinning; } |
|
190 |
||
191 |
void set_needs_pinning(bool value) { _needs_pinning = value; } |
|
192 |
}; |
|
193 |
||
52424 | 194 |
// C2Access for optimization time calls to the BarrierSetC2 backend. |
195 |
class C2OptAccess: public C2Access { |
|
196 |
PhaseGVN& _gvn; |
|
197 |
MergeMemNode* _mem; |
|
198 |
Node* _ctl; |
|
199 |
||
200 |
public: |
|
201 |
C2OptAccess(PhaseGVN& gvn, Node* ctl, MergeMemNode* mem, DecoratorSet decorators, |
|
202 |
BasicType type, Node* base, C2AccessValuePtr& addr) : |
|
203 |
C2Access(decorators, type, base, addr), |
|
204 |
_gvn(gvn), _mem(mem), _ctl(ctl) { |
|
205 |
fixup_decorators(); |
|
206 |
} |
|
207 |
||
208 |
||
209 |
MergeMemNode* mem() const { return _mem; } |
|
210 |
Node* ctl() const { return _ctl; } |
|
211 |
// void set_mem(Node* mem) { _mem = mem; } |
|
212 |
void set_ctl(Node* ctl) { _ctl = ctl; } |
|
213 |
||
214 |
virtual PhaseGVN& gvn() const { return _gvn; } |
|
215 |
virtual bool is_opt_access() const { return true; } |
|
216 |
}; |
|
217 |
||
218 |
||
50180 | 219 |
// This is the top-level class for the backend of the Access API in C2. |
220 |
// The top-level class is responsible for performing raw accesses. The |
|
221 |
// various GC barrier sets inherit from the BarrierSetC2 class to sprinkle |
|
222 |
// barriers into the accesses. |
|
223 |
class BarrierSetC2: public CHeapObj<mtGC> { |
|
224 |
protected: |
|
225 |
virtual void resolve_address(C2Access& access) const; |
|
226 |
virtual Node* store_at_resolved(C2Access& access, C2AccessValue& val) const; |
|
227 |
virtual Node* load_at_resolved(C2Access& access, const Type* val_type) const; |
|
228 |
||
52424 | 229 |
virtual Node* atomic_cmpxchg_val_at_resolved(C2AtomicParseAccess& access, Node* expected_val, |
50180 | 230 |
Node* new_val, const Type* val_type) const; |
52424 | 231 |
virtual Node* atomic_cmpxchg_bool_at_resolved(C2AtomicParseAccess& access, Node* expected_val, |
50180 | 232 |
Node* new_val, const Type* value_type) const; |
52424 | 233 |
virtual Node* atomic_xchg_at_resolved(C2AtomicParseAccess& access, Node* new_val, const Type* val_type) const; |
234 |
virtual Node* atomic_add_at_resolved(C2AtomicParseAccess& access, Node* new_val, const Type* val_type) const; |
|
235 |
void pin_atomic_op(C2AtomicParseAccess& access) const; |
|
50180 | 236 |
|
237 |
public: |
|
238 |
// This is the entry-point for the backend to perform accesses through the Access API. |
|
239 |
virtual Node* store_at(C2Access& access, C2AccessValue& val) const; |
|
240 |
virtual Node* load_at(C2Access& access, const Type* val_type) const; |
|
241 |
||
52424 | 242 |
virtual Node* atomic_cmpxchg_val_at(C2AtomicParseAccess& access, Node* expected_val, |
50180 | 243 |
Node* new_val, const Type* val_type) const; |
52424 | 244 |
virtual Node* atomic_cmpxchg_bool_at(C2AtomicParseAccess& access, Node* expected_val, |
50180 | 245 |
Node* new_val, const Type* val_type) const; |
52424 | 246 |
virtual Node* atomic_xchg_at(C2AtomicParseAccess& access, Node* new_val, const Type* value_type) const; |
247 |
virtual Node* atomic_add_at(C2AtomicParseAccess& access, Node* new_val, const Type* value_type) const; |
|
50180 | 248 |
|
249 |
virtual void clone(GraphKit* kit, Node* src, Node* dst, Node* size, bool is_array) const; |
|
250 |
||
51705 | 251 |
virtual Node* resolve(GraphKit* kit, Node* n, DecoratorSet decorators) const { return n; } |
252 |
||
51806 | 253 |
virtual Node* obj_allocate(PhaseMacroExpand* macro, Node* ctrl, Node* mem, Node* toobig_false, Node* size_in_bytes, |
254 |
Node*& i_o, Node*& needgc_ctrl, |
|
255 |
Node*& fast_oop_ctrl, Node*& fast_oop_rawmem, |
|
256 |
intx prefetch_lines) const; |
|
257 |
||
52429
b64514ff68fd
8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents:
52426
diff
changeset
|
258 |
virtual Node* ideal_node(PhaseGVN* phase, Node* n, bool can_reshape) const { return NULL; } |
b64514ff68fd
8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents:
52426
diff
changeset
|
259 |
virtual Node* identity_node(PhaseGVN* phase, Node* n) const { return n; } |
b64514ff68fd
8213381: Hook to allow GC to inject Node::Ideal() calls
rkennke
parents:
52426
diff
changeset
|
260 |
|
50180 | 261 |
// These are general helper methods used by C2 |
51984 | 262 |
enum ArrayCopyPhase { |
263 |
Parsing, |
|
264 |
Optimization, |
|
265 |
Expansion |
|
266 |
}; |
|
55307 | 267 |
|
51984 | 268 |
virtual bool array_copy_requires_gc_barriers(bool tightly_coupled_alloc, BasicType type, bool is_clone, ArrayCopyPhase phase) const { return false; } |
58217
b1a394e15ae9
8231085: C2/GC: Better GC-interface for expanding clone
rkennke
parents:
57584
diff
changeset
|
269 |
virtual void clone_at_expansion(PhaseMacroExpand* phase, ArrayCopyNode* ac) const; |
50180 | 270 |
|
271 |
// Support for GC barriers emitted during parsing |
|
58516
d376d86b0a01
8230565: ZGC: Redesign C2 load barrier to expand on the MachNode level
eosterlund
parents:
58273
diff
changeset
|
272 |
virtual bool has_load_barrier_nodes() const { return false; } |
50180 | 273 |
virtual bool is_gc_barrier_node(Node* node) const { return false; } |
274 |
virtual Node* step_over_gc_barrier(Node* c) const { return c; } |
|
55541
700ef5241888
8226287: Make process_users_of_allocation handle gc barriers
neliasso
parents:
55307
diff
changeset
|
275 |
virtual Node* step_over_gc_barrier_ctrl(Node* c) const { return c; } |
50180 | 276 |
|
277 |
// Support for macro expanded GC barriers |
|
278 |
virtual void register_potential_barrier_node(Node* node) const { } |
|
279 |
virtual void unregister_potential_barrier_node(Node* node) const { } |
|
280 |
virtual void eliminate_gc_barrier(PhaseMacroExpand* macro, Node* node) const { } |
|
52224
4f2215a00ed1
8212611: Small collection of simple changes from shenandoah
roland
parents:
51984
diff
changeset
|
281 |
virtual void enqueue_useful_gc_barrier(PhaseIterGVN* igvn, Node* node) const {} |
4f2215a00ed1
8212611: Small collection of simple changes from shenandoah
roland
parents:
51984
diff
changeset
|
282 |
virtual void eliminate_useless_gc_barriers(Unique_Node_List &useful, Compile* C) const {} |
50180 | 283 |
|
284 |
// Allow barrier sets to have shared state that is preserved across a compilation unit. |
|
285 |
// This could for example comprise macro nodes to be expanded during macro expansion. |
|
286 |
virtual void* create_barrier_state(Arena* comp_arena) const { return NULL; } |
|
52711 | 287 |
// If the BarrierSetC2 state has barrier nodes in its compilation |
288 |
// unit state to be expanded later, then now is the time to do so. |
|
289 |
virtual bool expand_barriers(Compile* C, PhaseIterGVN& igvn) const { return false; } |
|
290 |
virtual bool optimize_loops(PhaseIdealLoop* phase, LoopOptsMode mode, VectorSet& visited, Node_Stack& nstack, Node_List& worklist) const { return false; } |
|
291 |
virtual bool strip_mined_loops_expanded(LoopOptsMode mode) const { return false; } |
|
292 |
virtual bool is_gc_specific_loop_opts_pass(LoopOptsMode mode) const { return false; } |
|
52426
38bf0c9c4e64
8213384: Move G1/C2 barrier verification into G1BarrierSetC2
rkennke
parents:
52424
diff
changeset
|
293 |
|
52655
c88468bc7690
8214057: GC/C2 abstraction for Node::has_special_unique_user()
rkennke
parents:
52654
diff
changeset
|
294 |
virtual bool has_special_unique_user(const Node* node) const { return false; } |
c88468bc7690
8214057: GC/C2 abstraction for Node::has_special_unique_user()
rkennke
parents:
52654
diff
changeset
|
295 |
|
52426
38bf0c9c4e64
8213384: Move G1/C2 barrier verification into G1BarrierSetC2
rkennke
parents:
52424
diff
changeset
|
296 |
enum CompilePhase { |
55307 | 297 |
BeforeOptimize, |
298 |
BeforeMacroExpand, |
|
52426
38bf0c9c4e64
8213384: Move G1/C2 barrier verification into G1BarrierSetC2
rkennke
parents:
52424
diff
changeset
|
299 |
BeforeCodeGen |
38bf0c9c4e64
8213384: Move G1/C2 barrier verification into G1BarrierSetC2
rkennke
parents:
52424
diff
changeset
|
300 |
}; |
52441
6082c529aed8
8213371: GC/C2 abstraction and cleanup to handle custom offset for GC memory accesses
rkennke
parents:
52429
diff
changeset
|
301 |
|
6082c529aed8
8213371: GC/C2 abstraction and cleanup to handle custom offset for GC memory accesses
rkennke
parents:
52429
diff
changeset
|
302 |
virtual bool flatten_gc_alias_type(const TypePtr*& adr_type) const { return false; } |
6082c529aed8
8213371: GC/C2 abstraction and cleanup to handle custom offset for GC memory accesses
rkennke
parents:
52429
diff
changeset
|
303 |
#ifdef ASSERT |
6082c529aed8
8213371: GC/C2 abstraction and cleanup to handle custom offset for GC memory accesses
rkennke
parents:
52429
diff
changeset
|
304 |
virtual bool verify_gc_alias_type(const TypePtr* adr_type, int offset) const { return false; } |
55307 | 305 |
virtual void verify_gc_barriers(Compile* compile, CompilePhase phase) const {} |
52441
6082c529aed8
8213371: GC/C2 abstraction and cleanup to handle custom offset for GC memory accesses
rkennke
parents:
52429
diff
changeset
|
306 |
#endif |
52471
04d7e790aa2e
8213489: GC/C2 abstraction for Compile::final_graph_reshaping()
rkennke
parents:
52441
diff
changeset
|
307 |
|
04d7e790aa2e
8213489: GC/C2 abstraction for Compile::final_graph_reshaping()
rkennke
parents:
52441
diff
changeset
|
308 |
virtual bool final_graph_reshaping(Compile* compile, Node* n, uint opcode) const { return false; } |
04d7e790aa2e
8213489: GC/C2 abstraction for Compile::final_graph_reshaping()
rkennke
parents:
52441
diff
changeset
|
309 |
|
52568 | 310 |
virtual bool escape_add_to_con_graph(ConnectionGraph* conn_graph, PhaseGVN* gvn, Unique_Node_List* delayed_worklist, Node* n, uint opcode) const { return false; } |
311 |
virtual bool escape_add_final_edges(ConnectionGraph* conn_graph, PhaseGVN* gvn, Node* n, uint opcode) const { return false; } |
|
312 |
virtual bool escape_has_out_with_unsafe_object(Node* n) const { return false; } |
|
52627 | 313 |
|
314 |
virtual bool matcher_find_shared_visit(Matcher* matcher, Matcher::MStack& mstack, Node* n, uint opcode, bool& mem_op, int& mem_addr_idx) const { return false; }; |
|
315 |
virtual bool matcher_find_shared_post_visit(Matcher* matcher, Node* n, uint opcode) const { return false; }; |
|
316 |
virtual bool matcher_is_store_load_barrier(Node* x, uint xop) const { return false; } |
|
52654 | 317 |
|
55307 | 318 |
virtual void igvn_add_users_to_worklist(PhaseIterGVN* igvn, Node* use) const { } |
319 |
virtual void ccp_analyze(PhaseCCP* ccp, Unique_Node_List& worklist, Node* use) const { } |
|
52654 | 320 |
|
52712
d17e09494308
8214362: C2: gc interface entry point for split if
roland
parents:
52711
diff
changeset
|
321 |
virtual Node* split_if_pre(PhaseIdealLoop* phase, Node* n) const { return NULL; } |
52925
9c18c9d839d3
8214259: Implementation: JEP 189: Shenandoah: A Low-Pause-Time Garbage Collector (Experimental)
rkennke
parents:
52712
diff
changeset
|
322 |
virtual bool build_loop_late_post(PhaseIdealLoop* phase, Node* n) const { return false; } |
9c18c9d839d3
8214259: Implementation: JEP 189: Shenandoah: A Low-Pause-Time Garbage Collector (Experimental)
rkennke
parents:
52712
diff
changeset
|
323 |
virtual bool sink_node(PhaseIdealLoop* phase, Node* n, Node* x, Node* x_ctrl, Node* n_ctrl) const { return false; } |
58516
d376d86b0a01
8230565: ZGC: Redesign C2 load barrier to expand on the MachNode level
eosterlund
parents:
58273
diff
changeset
|
324 |
|
d376d86b0a01
8230565: ZGC: Redesign C2 load barrier to expand on the MachNode level
eosterlund
parents:
58273
diff
changeset
|
325 |
virtual void late_barrier_analysis() const { } |
d376d86b0a01
8230565: ZGC: Redesign C2 load barrier to expand on the MachNode level
eosterlund
parents:
58273
diff
changeset
|
326 |
virtual int estimate_stub_size() const { return 0; } |
d376d86b0a01
8230565: ZGC: Redesign C2 load barrier to expand on the MachNode level
eosterlund
parents:
58273
diff
changeset
|
327 |
virtual void emit_stubs(CodeBuffer& cb) const { } |
50180 | 328 |
}; |
329 |
||
330 |
#endif // SHARE_GC_SHARED_C2_BARRIERSETC2_HPP |