1 /*
2 * Copyright (c) 2005, 2025, Oracle and/or its affiliates. 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_OPTO_MACRO_HPP
26 #define SHARE_OPTO_MACRO_HPP
27
28 #include "opto/phase.hpp"
29
30 class AllocateNode;
31 class AllocateArrayNode;
32 class CallNode;
33 class SubTypeCheckNode;
34 class Node;
35 class PhaseIterGVN;
36
37 class PhaseMacroExpand : public Phase {
38 private:
39 PhaseIterGVN &_igvn;
40
41 public:
42 // Helper methods roughly modeled after GraphKit:
43 Node* basic_plus_adr(Node* base, int offset) {
44 return (offset == 0)? base: basic_plus_adr(base, MakeConX(offset));
45 }
46 Node* basic_plus_adr(Node* base, Node* ptr, int offset) {
47 return (offset == 0)? ptr: basic_plus_adr(base, ptr, MakeConX(offset));
48 }
49 Node* basic_plus_adr(Node* base, Node* offset) {
50 return basic_plus_adr(base, base, offset);
51 }
52 Node* basic_plus_adr(Node* base, Node* ptr, Node* offset) {
53 Node* adr = new AddPNode(base, ptr, offset);
54 return transform_later(adr);
55 }
56 Node* transform_later(Node* n) {
57 // equivalent to _gvn.transform in GraphKit, Ideal, etc.
58 _igvn.register_new_node_with_optimizer(n);
59 return n;
60 }
61 Node* make_load( Node* ctl, Node* mem, Node* base, int offset,
62 const Type* value_type, BasicType bt);
63 Node* make_store(Node* ctl, Node* mem, Node* base, int offset,
64 Node* value, BasicType bt);
65
66 Node* make_leaf_call(Node* ctrl, Node* mem,
67 const TypeFunc* call_type, address call_addr,
68 const char* call_name,
69 const TypePtr* adr_type,
70 Node* parm0 = nullptr, Node* parm1 = nullptr,
71 Node* parm2 = nullptr, Node* parm3 = nullptr,
72 Node* parm4 = nullptr, Node* parm5 = nullptr,
73 Node* parm6 = nullptr, Node* parm7 = nullptr);
74
75 address basictype2arraycopy(BasicType t,
76 Node* src_offset,
77 Node* dest_offset,
78 bool disjoint_bases,
79 const char* &name,
80 bool dest_uninitialized);
81
82 private:
83 // projections extracted from a call node
84 CallProjections _callprojs;
85
86 void expand_allocate(AllocateNode *alloc);
87 void expand_allocate_array(AllocateArrayNode *alloc);
88 void expand_allocate_common(AllocateNode* alloc,
89 Node* length,
90 const TypeFunc* slow_call_type,
91 address slow_call_address,
92 Node* valid_length_test);
93 void yank_alloc_node(AllocateNode* alloc);
94 Node *value_from_mem(Node *mem, Node *ctl, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc);
95 Node *value_from_mem_phi(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc, Node_Stack *value_phis, int level);
96
97 bool eliminate_boxing_node(CallStaticJavaNode *boxing);
98 bool eliminate_allocate_node(AllocateNode *alloc);
99 void undo_previous_scalarizations(GrowableArray <SafePointNode *> safepoints_done, AllocateNode* alloc);
100 bool scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints);
101 void process_users_of_allocation(CallNode *alloc);
102
103 void eliminate_gc_barrier(Node *p2x);
104 void mark_eliminated_box(Node* box, Node* obj);
105 void mark_eliminated_locking_nodes(AbstractLockNode *alock);
106 bool eliminate_locking_node(AbstractLockNode *alock);
107 void expand_lock_node(LockNode *lock);
108 void expand_unlock_node(UnlockNode *unlock);
109
110 // More helper methods modeled after GraphKit for array copy
111 void insert_mem_bar(Node** ctrl, Node** mem, int opcode, int alias_idx, Node* precedent = nullptr);
112 Node* array_element_address(Node* ary, Node* idx, BasicType elembt);
113 Node* ConvI2L(Node* offset);
114
115 // helper methods modeled after LibraryCallKit for array copy
116 Node* generate_guard(Node** ctrl, Node* test, RegionNode* region, float true_prob);
117 Node* generate_slow_guard(Node** ctrl, Node* test, RegionNode* region);
118
119 void generate_partial_inlining_block(Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type,
120 RegionNode** exit_block, Node** result_memory, Node* length,
121 Node* src_start, Node* dst_start, BasicType type);
122
123 void generate_negative_guard(Node** ctrl, Node* index, RegionNode* region);
124 void generate_limit_guard(Node** ctrl, Node* offset, Node* subseq_length, Node* array_length, RegionNode* region);
125
126 // More helper methods for array copy
127 Node* generate_nonpositive_guard(Node** ctrl, Node* index, bool never_negative);
128 void finish_arraycopy_call(Node* call, Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type);
129 Node* generate_arraycopy(ArrayCopyNode *ac,
130 AllocateArrayNode* alloc,
131 Node** ctrl, MergeMemNode* mem, Node** io,
132 const TypePtr* adr_type,
133 BasicType basic_elem_type,
134 Node* src, Node* src_offset,
135 Node* dest, Node* dest_offset,
136 Node* copy_length,
137 bool disjoint_bases = false,
138 bool length_never_negative = false,
139 RegionNode* slow_region = nullptr);
140 void generate_clear_array(Node* ctrl, MergeMemNode* merge_mem,
141 const TypePtr* adr_type,
142 Node* dest,
143 BasicType basic_elem_type,
144 Node* slice_idx,
145 Node* slice_len,
146 Node* dest_size);
147 bool generate_block_arraycopy(Node** ctrl, MergeMemNode** mem, Node* io,
148 const TypePtr* adr_type,
149 BasicType basic_elem_type,
150 AllocateNode* alloc,
151 Node* src, Node* src_offset,
152 Node* dest, Node* dest_offset,
153 Node* dest_size, bool dest_uninitialized);
154 MergeMemNode* generate_slow_arraycopy(ArrayCopyNode *ac,
155 Node** ctrl, Node* mem, Node** io,
156 const TypePtr* adr_type,
157 Node* src, Node* src_offset,
158 Node* dest, Node* dest_offset,
159 Node* copy_length, bool dest_uninitialized);
160 Node* generate_checkcast_arraycopy(Node** ctrl, MergeMemNode** mem,
161 const TypePtr* adr_type,
162 Node* dest_elem_klass,
163 Node* src, Node* src_offset,
164 Node* dest, Node* dest_offset,
165 Node* copy_length, bool dest_uninitialized);
166 Node* generate_generic_arraycopy(Node** ctrl, MergeMemNode** mem,
167 const TypePtr* adr_type,
168 Node* src, Node* src_offset,
169 Node* dest, Node* dest_offset,
170 Node* copy_length, bool dest_uninitialized);
171 void generate_unchecked_arraycopy(Node** ctrl, MergeMemNode** mem,
172 const TypePtr* adr_type,
173 BasicType basic_elem_type,
174 bool disjoint_bases,
175 Node* src, Node* src_offset,
176 Node* dest, Node* dest_offset,
177 Node* copy_length, bool dest_uninitialized);
178
179 void expand_arraycopy_node(ArrayCopyNode *ac);
180
181 void expand_subtypecheck_node(SubTypeCheckNode *check);
182
183 int replace_input(Node *use, Node *oldref, Node *newref);
184 void migrate_outs(Node *old, Node *target);
185 Node* opt_bits_test(Node* ctrl, Node* region, int edge, Node* word, int mask, int bits, bool return_fast_path = false);
186 void copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call);
187 CallNode* make_slow_call(CallNode *oldcall, const TypeFunc* slow_call_type, address slow_call,
188 const char* leaf_name, Node* slow_path, Node* parm0, Node* parm1,
189 Node* parm2);
190
191 Node* initialize_object(AllocateNode* alloc,
192 Node* control, Node* rawmem, Node* object,
193 Node* klass_node, Node* length,
194 Node* size_in_bytes);
195
196 Node* make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset, Node* ctl, Node* mem, BasicType ft, const Type *ftype, AllocateNode *alloc);
197
198 public:
199 PhaseMacroExpand(PhaseIterGVN &igvn) : Phase(Macro_Expand), _igvn(igvn) {
200 _igvn.set_delay_transform(true);
201 }
202
203 void refine_strip_mined_loop_macro_nodes();
204 void eliminate_macro_nodes();
205 bool expand_macro_nodes();
206 void eliminate_opaque_looplimit_macro_nodes();
207
208 SafePointScalarObjectNode* create_scalarized_object_description(AllocateNode *alloc, SafePointNode* sfpt);
209 static bool can_eliminate_allocation(PhaseIterGVN *igvn, AllocateNode *alloc, GrowableArray <SafePointNode *> *safepoints);
210
211
212 PhaseIterGVN &igvn() const { return _igvn; }
213
214 #ifndef PRODUCT
215 static int _objs_scalar_replaced_counter;
216 static int _monitor_objects_removed_counter;
217 static int _GC_barriers_removed_counter;
218 static int _memory_barriers_removed_counter;
219 static void print_statistics();
220 static int count_MemBar(Compile *C);
221 #endif
222
223 // Members accessed from BarrierSetC2
224 void replace_node(Node* source, Node* target) { _igvn.replace_node(source, target); }
225 Node* intcon(jint con) const { return _igvn.intcon(con); }
226 Node* longcon(jlong con) const { return _igvn.longcon(con); }
227 Node* makecon(const Type *t) const { return _igvn.makecon(t); }
228 Node* zerocon(BasicType bt) const { return _igvn.zerocon(bt); }
229 Node* top() const { return C->top(); }
230
231 Node* prefetch_allocation(Node* i_o,
232 Node*& needgc_false, Node*& contended_phi_rawmem,
233 Node* old_eden_top, Node* new_eden_top,
234 intx lines);
235 void expand_dtrace_alloc_probe(AllocateNode* alloc, Node* fast_oop, Node*&fast_oop_ctrl, Node*&fast_oop_rawmem);
236 void expand_initialize_membar(AllocateNode* alloc, InitializeNode* init, Node*&fast_oop_ctrl, Node*&fast_oop_rawmem);
237 };
238
239 #endif // SHARE_OPTO_MACRO_HPP