1 /*
  2  * Copyright (c) 2005, 2021, 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 = NULL, Node* parm1 = NULL,
 71                        Node* parm2 = NULL, Node* parm3 = NULL,
 72                        Node* parm4 = NULL, Node* parm5 = NULL,
 73                        Node* parm6 = NULL, Node* parm7 = NULL);
 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   // Additional data collected during macro expansion
 87   bool _has_locks;
 88 
 89   void expand_allocate(AllocateNode *alloc);
 90   void expand_allocate_array(AllocateArrayNode *alloc);
 91   void expand_allocate_common(AllocateNode* alloc,
 92                               Node* length,
 93                               const TypeFunc* slow_call_type,
 94                               address slow_call_address,
 95                               Node* valid_length_test);
 96   void yank_alloc_node(AllocateNode* alloc);
 97   Node *value_from_mem(Node *mem, Node *ctl, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc);
 98   Node *value_from_mem_phi(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc, Node_Stack *value_phis, int level);
 99 
100   bool eliminate_boxing_node(CallStaticJavaNode *boxing);
101   bool eliminate_allocate_node(AllocateNode *alloc);
102   bool can_eliminate_allocation(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints);
103   bool scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints_done);
104   void process_users_of_allocation(CallNode *alloc);
105 
106   void eliminate_gc_barrier(Node *p2x);
107   void mark_eliminated_box(Node* box, Node* obj);
108   void mark_eliminated_locking_nodes(AbstractLockNode *alock);
109   bool eliminate_locking_node(AbstractLockNode *alock);
110   void expand_lock_node(LockNode *lock);
111   void expand_unlock_node(UnlockNode *unlock);
112 
113   // More helper methods modeled after GraphKit for array copy
114   void insert_mem_bar(Node** ctrl, Node** mem, int opcode, Node* precedent = NULL);
115   Node* array_element_address(Node* ary, Node* idx, BasicType elembt);
116   Node* ConvI2L(Node* offset);
117 
118   // helper methods modeled after LibraryCallKit for array copy
119   Node* generate_guard(Node** ctrl, Node* test, RegionNode* region, float true_prob);
120   Node* generate_slow_guard(Node** ctrl, Node* test, RegionNode* region);
121 
122   void generate_partial_inlining_block(Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type,
123                                        RegionNode** exit_block, Node** result_memory, Node* length,
124                                        Node* src_start, Node* dst_start, BasicType type);
125 
126   void generate_negative_guard(Node** ctrl, Node* index, RegionNode* region);
127   void generate_limit_guard(Node** ctrl, Node* offset, Node* subseq_length, Node* array_length, RegionNode* region);
128 
129   // More helper methods for array copy
130   Node* generate_nonpositive_guard(Node** ctrl, Node* index, bool never_negative);
131   void finish_arraycopy_call(Node* call, Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type);
132   Node* generate_arraycopy(ArrayCopyNode *ac,
133                            AllocateArrayNode* alloc,
134                            Node** ctrl, MergeMemNode* mem, Node** io,
135                            const TypePtr* adr_type,
136                            BasicType basic_elem_type,
137                            Node* src,  Node* src_offset,
138                            Node* dest, Node* dest_offset,
139                            Node* copy_length,
140                            bool disjoint_bases = false,
141                            bool length_never_negative = false,
142                            RegionNode* slow_region = NULL);
143   void generate_clear_array(Node* ctrl, MergeMemNode* merge_mem,
144                             const TypePtr* adr_type,
145                             Node* dest,
146                             BasicType basic_elem_type,
147                             Node* slice_idx,
148                             Node* slice_len,
149                             Node* dest_size);
150   bool generate_block_arraycopy(Node** ctrl, MergeMemNode** mem, Node* io,
151                                 const TypePtr* adr_type,
152                                 BasicType basic_elem_type,
153                                 AllocateNode* alloc,
154                                 Node* src,  Node* src_offset,
155                                 Node* dest, Node* dest_offset,
156                                 Node* dest_size, bool dest_uninitialized);
157   MergeMemNode* generate_slow_arraycopy(ArrayCopyNode *ac,
158                                         Node** ctrl, Node* mem, Node** io,
159                                         const TypePtr* adr_type,
160                                         Node* src,  Node* src_offset,
161                                         Node* dest, Node* dest_offset,
162                                         Node* copy_length, bool dest_uninitialized);
163   Node* generate_checkcast_arraycopy(Node** ctrl, MergeMemNode** mem,
164                                      const TypePtr* adr_type,
165                                      Node* dest_elem_klass,
166                                      Node* src,  Node* src_offset,
167                                      Node* dest, Node* dest_offset,
168                                      Node* copy_length, bool dest_uninitialized);
169   Node* generate_generic_arraycopy(Node** ctrl, MergeMemNode** mem,
170                                    const TypePtr* adr_type,
171                                    Node* src,  Node* src_offset,
172                                    Node* dest, Node* dest_offset,
173                                    Node* copy_length, bool dest_uninitialized);
174   bool generate_unchecked_arraycopy(Node** ctrl, MergeMemNode** mem,
175                                     const TypePtr* adr_type,
176                                     BasicType basic_elem_type,
177                                     bool disjoint_bases,
178                                     Node* src,  Node* src_offset,
179                                     Node* dest, Node* dest_offset,
180                                     Node* copy_length, bool dest_uninitialized);
181 
182   void expand_arraycopy_node(ArrayCopyNode *ac);
183 
184   void expand_subtypecheck_node(SubTypeCheckNode *check);
185 
186   int replace_input(Node *use, Node *oldref, Node *newref);
187   void migrate_outs(Node *old, Node *target);
188   Node* opt_bits_test(Node* ctrl, Node* region, int edge, Node* word, int mask, int bits, bool return_fast_path = false);
189   void copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call);
190   CallNode* make_slow_call(CallNode *oldcall, const TypeFunc* slow_call_type, address slow_call,
191                            const char* leaf_name, Node* slow_path, Node* parm0, Node* parm1,
192                            Node* parm2);
193 
194   Node* initialize_object(AllocateNode* alloc,
195                           Node* control, Node* rawmem, Node* object,
196                           Node* klass_node, Node* length,
197                           Node* size_in_bytes);
198 
199   Node* make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset, Node* ctl, Node* mem, BasicType ft, const Type *ftype, AllocateNode *alloc);
200 
201 public:
202   PhaseMacroExpand(PhaseIterGVN &igvn) : Phase(Macro_Expand), _igvn(igvn), _has_locks(false) {
203     _igvn.set_delay_transform(true);
204   }
205   void eliminate_macro_nodes();
206   bool expand_macro_nodes();
207 
208   PhaseIterGVN &igvn() const { return _igvn; }
209 
210 #ifndef PRODUCT
211     static int _objs_scalar_replaced_counter;
212     static int _monitor_objects_removed_counter;
213     static int _GC_barriers_removed_counter;
214     static int _memory_barriers_removed_counter;
215     static void print_statistics();
216     static int count_MemBar(Compile *C);
217 #endif
218 
219   // Members accessed from BarrierSetC2
220   void replace_node(Node* source, Node* target) { _igvn.replace_node(source, target); }
221   Node* intcon(jint con)        const { return _igvn.intcon(con); }
222   Node* longcon(jlong con)      const { return _igvn.longcon(con); }
223   Node* makecon(const Type *t)  const { return _igvn.makecon(t); }
224   Node* top()                   const { return C->top(); }
225 
226   Node* prefetch_allocation(Node* i_o,
227                             Node*& needgc_false, Node*& contended_phi_rawmem,
228                             Node* old_eden_top, Node* new_eden_top,
229                             intx lines);
230   void expand_dtrace_alloc_probe(AllocateNode* alloc, Node* fast_oop, Node*&fast_oop_ctrl, Node*&fast_oop_rawmem);
231   void expand_initialize_membar(AllocateNode* alloc, InitializeNode* init, Node*&fast_oop_ctrl, Node*&fast_oop_rawmem);
232 };
233 
234 #endif // SHARE_OPTO_MACRO_HPP