1 /*
2 * Copyright (c) 2015, 2021, Red Hat, Inc. All rights reserved.
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_SHENANDOAH_C2_SHENANDOAHSUPPORT_HPP
26 #define SHARE_GC_SHENANDOAH_C2_SHENANDOAHSUPPORT_HPP
27
28 #include "gc/shenandoah/shenandoahBarrierSet.hpp"
29 #include "memory/allocation.hpp"
30 #include "opto/addnode.hpp"
31 #include "opto/graphKit.hpp"
32 #include "opto/machnode.hpp"
33 #include "opto/memnode.hpp"
34 #include "opto/multnode.hpp"
35 #include "opto/node.hpp"
36
37 class PhaseGVN;
38 class MemoryGraphFixer;
39
40 class ShenandoahBarrierC2Support : public AllStatic {
41 private:
42 #ifdef ASSERT
43 enum verify_type {
44 ShenandoahLoad,
45 ShenandoahStore,
46 ShenandoahValue,
47 ShenandoahOopStore,
48 ShenandoahNone
49 };
50
51 static bool verify_helper(Node* in, Node_Stack& phis, VectorSet& visited, verify_type t, bool trace, Unique_Node_List& barriers_used);
52 static void report_verify_failure(const char* msg, Node* n1 = nullptr, Node* n2 = nullptr);
53 #endif
54 static Node* dom_mem(Node* mem, Node* ctrl, int alias, Node*& mem_ctrl, PhaseIdealLoop* phase);
55 static Node* no_branches(Node* c, Node* dom, bool allow_one_proj, PhaseIdealLoop* phase);
56 static bool is_gc_state_test(Node* iff, int mask);
57 static bool has_safepoint_between(Node* start, Node* stop, PhaseIdealLoop *phase);
58 static Node* find_bottom_mem(Node* ctrl, PhaseIdealLoop* phase);
59 static void follow_barrier_uses(Node* n, Node* ctrl, Unique_Node_List& uses, PhaseIdealLoop* phase);
60 static void test_null(Node*& ctrl, Node* val, Node*& null_ctrl, PhaseIdealLoop* phase);
61 static void test_gc_state(Node*& ctrl, Node* raw_mem, Node*& heap_stable_ctrl,
62 PhaseIdealLoop* phase, int flags);
63 static void call_lrb_stub(Node*& ctrl, Node*& val, Node* load_addr,
64 DecoratorSet decorators, PhaseIdealLoop* phase);
65 static void test_in_cset(Node*& ctrl, Node*& not_cset_ctrl, Node* val, Node* raw_mem, PhaseIdealLoop* phase);
66 static void move_gc_state_test_out_of_loop(IfNode* iff, PhaseIdealLoop* phase);
67 static void merge_back_to_back_tests(Node* n, PhaseIdealLoop* phase);
68 static bool merge_point_safe(Node* region);
69 static bool identical_backtoback_ifs(Node *n, PhaseIdealLoop* phase);
70 static void fix_ctrl(Node* barrier, Node* region, const MemoryGraphFixer& fixer, Unique_Node_List& uses, Unique_Node_List& uses_to_ignore, uint last, PhaseIdealLoop* phase);
71 static IfNode* find_unswitching_candidate(const IdealLoopTree *loop, PhaseIdealLoop* phase);
72
73 static Node* get_load_addr(PhaseIdealLoop* phase, VectorSet& visited, Node* lrb);
74 public:
75 static bool is_dominator(Node* d_c, Node* n_c, Node* d, Node* n, PhaseIdealLoop* phase);
76 static bool is_dominator_same_ctrl(Node* c, Node* d, Node* n, PhaseIdealLoop* phase);
77
78 static bool is_gc_state_load(Node* n);
79 static bool is_heap_stable_test(Node* iff);
80
81 static bool expand(Compile* C, PhaseIterGVN& igvn);
82 static void pin_and_expand(PhaseIdealLoop* phase);
83 static void optimize_after_expansion(VectorSet& visited, Node_Stack& nstack, Node_List& old_new, PhaseIdealLoop* phase);
84
85 #ifdef ASSERT
86 static void verify(RootNode* root);
87 #endif
88 };
89
90 class MemoryGraphFixer : public ResourceObj {
91 private:
92 Node_List _memory_nodes;
93 int _alias;
94 PhaseIdealLoop* _phase;
95 bool _include_lsm;
96
97 void collect_memory_nodes();
98 Node* get_ctrl(Node* n) const;
99 Node* ctrl_or_self(Node* n) const;
100 bool mem_is_valid(Node* m, Node* c) const;
101 MergeMemNode* allocate_merge_mem(Node* mem, Node* rep_proj, Node* rep_ctrl) const;
102 MergeMemNode* clone_merge_mem(Node* u, Node* mem, Node* rep_proj, Node* rep_ctrl, DUIterator& i) const;
103 void fix_memory_uses(Node* mem, Node* replacement, Node* rep_proj, Node* rep_ctrl) const;
104 bool should_process_phi(Node* phi) const;
105 bool has_mem_phi(Node* region) const;
106
107 public:
108 MemoryGraphFixer(int alias, bool include_lsm, PhaseIdealLoop* phase) :
109 _alias(alias), _phase(phase), _include_lsm(include_lsm) {
110 assert(_alias != Compile::AliasIdxBot, "unsupported");
111 collect_memory_nodes();
112 }
113
114 Node* find_mem(Node* ctrl, Node* n) const;
115 void fix_mem(Node* ctrl, Node* region, Node* mem, Node* mem_for_ctrl, Node* mem_phi, Unique_Node_List& uses);
116 int alias() const { return _alias; }
117
118 Node* collect_memory_for_infinite_loop(const Node* in);
119
120 void record_new_ctrl(Node* ctrl, Node* region, Node* mem, Node* mem_for_ctrl);
121 };
122
123 class ShenandoahCompareAndSwapPNode : public CompareAndSwapPNode {
124 public:
125 ShenandoahCompareAndSwapPNode(Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord)
126 : CompareAndSwapPNode(c, mem, adr, val, ex, mem_ord) { }
127
128 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape) {
129 if (in(ExpectedIn) != nullptr && phase->type(in(ExpectedIn)) == TypePtr::NULL_PTR) {
130 return new CompareAndSwapPNode(in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address), in(MemNode::ValueIn), in(ExpectedIn), order());
131 }
132 return nullptr;
133 }
134
135 virtual int Opcode() const;
136 };
137
138 class ShenandoahCompareAndSwapNNode : public CompareAndSwapNNode {
139 public:
140 ShenandoahCompareAndSwapNNode(Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord)
141 : CompareAndSwapNNode(c, mem, adr, val, ex, mem_ord) { }
142
143 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape) {
144 if (in(ExpectedIn) != nullptr && phase->type(in(ExpectedIn)) == TypeNarrowOop::NULL_PTR) {
145 return new CompareAndSwapNNode(in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address), in(MemNode::ValueIn), in(ExpectedIn), order());
146 }
147 return nullptr;
148 }
149
150 virtual int Opcode() const;
151 };
152
153 class ShenandoahWeakCompareAndSwapPNode : public WeakCompareAndSwapPNode {
154 public:
155 ShenandoahWeakCompareAndSwapPNode(Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord)
156 : WeakCompareAndSwapPNode(c, mem, adr, val, ex, mem_ord) { }
157
158 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape) {
159 if (in(ExpectedIn) != nullptr && phase->type(in(ExpectedIn)) == TypePtr::NULL_PTR) {
160 return new WeakCompareAndSwapPNode(in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address), in(MemNode::ValueIn), in(ExpectedIn), order());
161 }
162 return nullptr;
163 }
164
165 virtual int Opcode() const;
166 };
167
168 class ShenandoahWeakCompareAndSwapNNode : public WeakCompareAndSwapNNode {
169 public:
170 ShenandoahWeakCompareAndSwapNNode(Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord)
171 : WeakCompareAndSwapNNode(c, mem, adr, val, ex, mem_ord) { }
172
173 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape) {
174 if (in(ExpectedIn) != nullptr && phase->type(in(ExpectedIn)) == TypeNarrowOop::NULL_PTR) {
175 return new WeakCompareAndSwapNNode(in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address), in(MemNode::ValueIn), in(ExpectedIn), order());
176 }
177 return nullptr;
178 }
179
180 virtual int Opcode() const;
181 };
182
183 class ShenandoahCompareAndExchangePNode : public CompareAndExchangePNode {
184 public:
185 ShenandoahCompareAndExchangePNode(Node *c, Node *mem, Node *adr, Node *val, Node *ex, const TypePtr* at, const Type* t, MemNode::MemOrd mem_ord)
186 : CompareAndExchangePNode(c, mem, adr, val, ex, at, t, mem_ord) { }
187
188 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape) {
189 if (in(ExpectedIn) != nullptr && phase->type(in(ExpectedIn)) == TypePtr::NULL_PTR) {
190 return new CompareAndExchangePNode(in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address), in(MemNode::ValueIn), in(ExpectedIn), adr_type(), bottom_type(), order());
191 }
192 return nullptr;
193 }
194
195 virtual int Opcode() const;
196 };
197
198 class ShenandoahCompareAndExchangeNNode : public CompareAndExchangeNNode {
199 public:
200 ShenandoahCompareAndExchangeNNode(Node *c, Node *mem, Node *adr, Node *val, Node *ex, const TypePtr* at, const Type* t, MemNode::MemOrd mem_ord)
201 : CompareAndExchangeNNode(c, mem, adr, val, ex, at, t, mem_ord) { }
202
203 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape) {
204 if (in(ExpectedIn) != nullptr && phase->type(in(ExpectedIn)) == TypeNarrowOop::NULL_PTR) {
205 return new CompareAndExchangeNNode(in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address), in(MemNode::ValueIn), in(ExpectedIn), adr_type(), bottom_type(), order());
206 }
207 return nullptr;
208 }
209
210 virtual int Opcode() const;
211 };
212
213 class ShenandoahLoadReferenceBarrierNode : public Node {
214 public:
215 enum {
216 Control,
217 ValueIn
218 };
219
220 private:
221 DecoratorSet _decorators;
222
223 public:
224 ShenandoahLoadReferenceBarrierNode(Node* ctrl, Node* val, DecoratorSet decorators);
225
226 DecoratorSet decorators() const;
227 virtual int Opcode() const;
228 virtual const Type* bottom_type() const;
229 virtual const Type* Value(PhaseGVN* phase) const;
230 virtual const class TypePtr *adr_type() const { return TypeOopPtr::BOTTOM; }
231 virtual uint match_edge(uint idx) const {
232 return idx >= ValueIn;
233 }
234 virtual uint ideal_reg() const { return Op_RegP; }
235
236 virtual Node* Identity(PhaseGVN* phase);
237
238 virtual uint size_of() const;
239 virtual uint hash() const;
240 virtual bool cmp( const Node &n ) const;
241
242 private:
243 bool needs_barrier(PhaseGVN* phase, Node* n);
244 bool needs_barrier_impl(PhaseGVN* phase, Node* n, Unique_Node_List &visited);
245 };
246
247
248 #endif // SHARE_GC_SHENANDOAH_C2_SHENANDOAHSUPPORT_HPP