1 /* 2 * Copyright (c) 2005, 2015, 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_VM_OPTO_MACRO_HPP 26 #define SHARE_VM_OPTO_MACRO_HPP 27 28 #include "opto/phase.hpp" 29 30 class AllocateNode; 31 class AllocateArrayNode; 32 class CallNode; 33 class Node; 34 class PhaseIterGVN; 35 36 class PhaseMacroExpand : public Phase { 37 private: 38 PhaseIterGVN &_igvn; 39 40 // Helper methods roughly modeled after GraphKit: 41 Node* top() const { return C->top(); } 42 Node* intcon(jint con) const { return _igvn.intcon(con); } 43 Node* longcon(jlong con) const { return _igvn.longcon(con); } 44 Node* makecon(const Type *t) const { return _igvn.makecon(t); } 45 Node* basic_plus_adr(Node* base, int offset) { 46 return (offset == 0)? base: basic_plus_adr(base, MakeConX(offset)); 47 } 48 Node* basic_plus_adr(Node* base, Node* ptr, int offset) { 49 return (offset == 0)? ptr: basic_plus_adr(base, ptr, MakeConX(offset)); 50 } 51 Node* basic_plus_adr(Node* base, Node* offset) { 52 return basic_plus_adr(base, base, offset); 53 } 54 Node* basic_plus_adr(Node* base, Node* ptr, Node* offset) { 55 Node* adr = new AddPNode(base, ptr, offset); 56 return transform_later(adr); 57 } 58 Node* transform_later(Node* n) { 59 // equivalent to _gvn.transform in GraphKit, Ideal, etc. 60 _igvn.register_new_node_with_optimizer(n); 61 return n; 62 } 63 void set_eden_pointers(Node* &eden_top_adr, Node* &eden_end_adr); 64 Node* make_load( Node* ctl, Node* mem, Node* base, int offset, 65 const Type* value_type, BasicType bt); 66 Node* make_store(Node* ctl, Node* mem, Node* base, int offset, 67 Node* value, BasicType bt); 68 69 // For Heap-related sampling - will generate code to invoke call() 70 // if the given sampling parameters are true. 71 void conditional_sample(Node *should_sample, 72 BoolTest::mask test, 73 float probability, 74 CallLeafNode *call, 75 Node *thread, 76 Node **fast_oop_ctrl, 77 Node **fast_oop_rawmem, 78 Node **fast_oop, 79 Node* size_in_bytes, 80 Node *in_node); 81 82 // projections extracted from a call node 83 ProjNode *_fallthroughproj; 84 ProjNode *_fallthroughcatchproj; 85 ProjNode *_ioproj_fallthrough; 86 ProjNode *_ioproj_catchall; 87 ProjNode *_catchallcatchproj; 88 ProjNode *_memproj_fallthrough; 89 ProjNode *_memproj_catchall; 90 ProjNode *_resproj; 91 92 // Additional data collected during macro expansion 93 bool _has_locks; 94 95 void expand_allocate(AllocateNode *alloc); 96 void expand_allocate_array(AllocateArrayNode *alloc); 97 void expand_allocate_common(AllocateNode* alloc, 98 Node* length, 99 const TypeFunc* slow_call_type, 100 address slow_call_address); 101 Node *value_from_mem(Node *mem, Node *ctl, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc); 102 Node *value_from_mem_phi(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc, Node_Stack *value_phis, int level); 103 104 bool eliminate_boxing_node(CallStaticJavaNode *boxing); 105 bool eliminate_allocate_node(AllocateNode *alloc); 106 bool can_eliminate_allocation(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints); 107 bool scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints_done); 108 void process_users_of_allocation(CallNode *alloc); 109 110 void eliminate_card_mark(Node *cm); 111 void mark_eliminated_box(Node* box, Node* obj); 112 void mark_eliminated_locking_nodes(AbstractLockNode *alock); 113 bool eliminate_locking_node(AbstractLockNode *alock); 114 void expand_lock_node(LockNode *lock); 115 void expand_unlock_node(UnlockNode *unlock); 116 117 // More helper methods modeled after GraphKit for array copy 118 void insert_mem_bar(Node** ctrl, Node** mem, int opcode, Node* precedent = NULL); 119 Node* array_element_address(Node* ary, Node* idx, BasicType elembt); 120 Node* ConvI2L(Node* offset); 121 Node* make_leaf_call(Node* ctrl, Node* mem, 122 const TypeFunc* call_type, address call_addr, 123 const char* call_name, 124 const TypePtr* adr_type, 125 Node* parm0 = NULL, Node* parm1 = NULL, 126 Node* parm2 = NULL, Node* parm3 = NULL, 127 Node* parm4 = NULL, Node* parm5 = NULL, 128 Node* parm6 = NULL, Node* parm7 = NULL); 129 130 // helper methods modeled after LibraryCallKit for array copy 131 Node* generate_guard(Node** ctrl, Node* test, RegionNode* region, float true_prob); 132 Node* generate_slow_guard(Node** ctrl, Node* test, RegionNode* region); 133 void generate_negative_guard(Node** ctrl, Node* index, RegionNode* region); 134 void generate_limit_guard(Node** ctrl, Node* offset, Node* subseq_length, Node* array_length, RegionNode* region); 135 136 // More helper methods for array copy 137 Node* generate_nonpositive_guard(Node** ctrl, Node* index, bool never_negative); 138 void finish_arraycopy_call(Node* call, Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type); 139 address basictype2arraycopy(BasicType t, 140 Node* src_offset, 141 Node* dest_offset, 142 bool disjoint_bases, 143 const char* &name, 144 bool dest_uninitialized); 145 Node* generate_arraycopy(ArrayCopyNode *ac, 146 AllocateArrayNode* alloc, 147 Node** ctrl, MergeMemNode* mem, Node** io, 148 const TypePtr* adr_type, 149 BasicType basic_elem_type, 150 Node* src, Node* src_offset, 151 Node* dest, Node* dest_offset, 152 Node* copy_length, 153 bool disjoint_bases = false, 154 bool length_never_negative = false, 155 RegionNode* slow_region = NULL); 156 void generate_clear_array(Node* ctrl, MergeMemNode* merge_mem, 157 const TypePtr* adr_type, 158 Node* dest, 159 BasicType basic_elem_type, 160 Node* slice_idx, 161 Node* slice_len, 162 Node* dest_size); 163 bool generate_block_arraycopy(Node** ctrl, MergeMemNode** mem, Node* io, 164 const TypePtr* adr_type, 165 BasicType basic_elem_type, 166 AllocateNode* alloc, 167 Node* src, Node* src_offset, 168 Node* dest, Node* dest_offset, 169 Node* dest_size, bool dest_uninitialized); 170 MergeMemNode* generate_slow_arraycopy(ArrayCopyNode *ac, 171 Node** ctrl, Node* mem, Node** io, 172 const TypePtr* adr_type, 173 Node* src, Node* src_offset, 174 Node* dest, Node* dest_offset, 175 Node* copy_length, bool dest_uninitialized); 176 Node* generate_checkcast_arraycopy(Node** ctrl, MergeMemNode** mem, 177 const TypePtr* adr_type, 178 Node* dest_elem_klass, 179 Node* src, Node* src_offset, 180 Node* dest, Node* dest_offset, 181 Node* copy_length, bool dest_uninitialized); 182 Node* generate_generic_arraycopy(Node** ctrl, MergeMemNode** mem, 183 const TypePtr* adr_type, 184 Node* src, Node* src_offset, 185 Node* dest, Node* dest_offset, 186 Node* copy_length, bool dest_uninitialized); 187 void generate_unchecked_arraycopy(Node** ctrl, MergeMemNode** mem, 188 const TypePtr* adr_type, 189 BasicType basic_elem_type, 190 bool disjoint_bases, 191 Node* src, Node* src_offset, 192 Node* dest, Node* dest_offset, 193 Node* copy_length, bool dest_uninitialized); 194 195 void expand_arraycopy_node(ArrayCopyNode *ac); 196 197 int replace_input(Node *use, Node *oldref, Node *newref); 198 void copy_call_debug_info(CallNode *oldcall, CallNode * newcall); 199 Node* opt_bits_test(Node* ctrl, Node* region, int edge, Node* word, int mask, int bits, bool return_fast_path = false); 200 void copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call); 201 CallNode* make_slow_call(CallNode *oldcall, const TypeFunc* slow_call_type, address slow_call, 202 const char* leaf_name, Node* slow_path, Node* parm0, Node* parm1, 203 Node* parm2); 204 void extract_call_projections(CallNode *call); 205 206 Node* initialize_object(AllocateNode* alloc, 207 Node* control, Node* rawmem, Node* object, 208 Node* klass_node, Node* length, 209 Node* size_in_bytes); 210 211 Node* prefetch_allocation(Node* i_o, 212 Node*& needgc_false, Node*& contended_phi_rawmem, 213 Node* old_eden_top, Node* new_eden_top, 214 Node* length); 215 216 Node* make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset, Node* ctl, Node* mem, BasicType ft, const Type *ftype, AllocateNode *alloc); 217 218 public: 219 PhaseMacroExpand(PhaseIterGVN &igvn) : Phase(Macro_Expand), _igvn(igvn), _has_locks(false) { 220 _igvn.set_delay_transform(true); 221 } 222 void eliminate_macro_nodes(); 223 bool expand_macro_nodes(); 224 225 }; 226 227 #endif // SHARE_VM_OPTO_MACRO_HPP