annotate hotspot/src/share/vm/opto/macro.hpp @ 24923:9631f7d691dc

8034812: remove IDX_INIT macro hack in Node class Summary: The IDX_INIT macro used by Node::Node(...) to retrieve the Compile object is removed and replaced by a call to Compile::current(). The Node constructor, new operator and all calls to it are adapted accordingly. Reviewed-by: kvn, jrose, iveresov, goetz
author thartmann
date Mon, 02 Jun 2014 08:07:29 +0200
parents f690330b10b9
children 4b49fd58bbd9
rev   line source
duke@1 1 /*
mikael@22234 2 * Copyright (c) 2005, 2013, Oracle and/or its affiliates. All rights reserved.
duke@1 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@1 4 *
duke@1 5 * This code is free software; you can redistribute it and/or modify it
duke@1 6 * under the terms of the GNU General Public License version 2 only, as
duke@1 7 * published by the Free Software Foundation.
duke@1 8 *
duke@1 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@1 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@1 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@1 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@1 13 * accompanied this code).
duke@1 14 *
duke@1 15 * You should have received a copy of the GNU General Public License version
duke@1 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@1 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@1 18 *
trims@5547 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@5547 20 * or visit www.oracle.com if you need additional information or have any
trims@5547 21 * questions.
duke@1 22 *
duke@1 23 */
duke@1 24
stefank@7397 25 #ifndef SHARE_VM_OPTO_MACRO_HPP
stefank@7397 26 #define SHARE_VM_OPTO_MACRO_HPP
stefank@7397 27
stefank@7397 28 #include "opto/phase.hpp"
stefank@7397 29
duke@1 30 class AllocateNode;
duke@1 31 class AllocateArrayNode;
duke@1 32 class CallNode;
duke@1 33 class Node;
duke@1 34 class PhaseIterGVN;
duke@1 35
duke@1 36 class PhaseMacroExpand : public Phase {
duke@1 37 private:
duke@1 38 PhaseIterGVN &_igvn;
duke@1 39
duke@1 40 // Helper methods roughly modelled after GraphKit:
duke@1 41 Node* top() const { return C->top(); }
duke@1 42 Node* intcon(jint con) const { return _igvn.intcon(con); }
duke@1 43 Node* longcon(jlong con) const { return _igvn.longcon(con); }
duke@1 44 Node* makecon(const Type *t) const { return _igvn.makecon(t); }
duke@1 45 Node* basic_plus_adr(Node* base, int offset) {
duke@1 46 return (offset == 0)? base: basic_plus_adr(base, MakeConX(offset));
duke@1 47 }
duke@1 48 Node* basic_plus_adr(Node* base, Node* ptr, int offset) {
duke@1 49 return (offset == 0)? ptr: basic_plus_adr(base, ptr, MakeConX(offset));
duke@1 50 }
duke@1 51 Node* basic_plus_adr(Node* base, Node* offset) {
duke@1 52 return basic_plus_adr(base, base, offset);
duke@1 53 }
duke@1 54 Node* basic_plus_adr(Node* base, Node* ptr, Node* offset) {
thartmann@24923 55 Node* adr = new AddPNode(base, ptr, offset);
duke@1 56 return transform_later(adr);
duke@1 57 }
duke@1 58 Node* transform_later(Node* n) {
duke@1 59 // equivalent to _gvn.transform in GraphKit, Ideal, etc.
duke@1 60 _igvn.register_new_node_with_optimizer(n);
duke@1 61 return n;
duke@1 62 }
duke@1 63 void set_eden_pointers(Node* &eden_top_adr, Node* &eden_end_adr);
duke@1 64 Node* make_load( Node* ctl, Node* mem, Node* base, int offset,
duke@1 65 const Type* value_type, BasicType bt);
duke@1 66 Node* make_store(Node* ctl, Node* mem, Node* base, int offset,
duke@1 67 Node* value, BasicType bt);
duke@1 68
duke@1 69 // projections extracted from a call node
duke@1 70 ProjNode *_fallthroughproj;
duke@1 71 ProjNode *_fallthroughcatchproj;
duke@1 72 ProjNode *_ioproj_fallthrough;
duke@1 73 ProjNode *_ioproj_catchall;
duke@1 74 ProjNode *_catchallcatchproj;
duke@1 75 ProjNode *_memproj_fallthrough;
duke@1 76 ProjNode *_memproj_catchall;
duke@1 77 ProjNode *_resproj;
duke@1 78
kvn@23491 79 // Additional data collected during macro expansion
kvn@23491 80 bool _has_locks;
duke@1 81
duke@1 82 void expand_allocate(AllocateNode *alloc);
duke@1 83 void expand_allocate_array(AllocateArrayNode *alloc);
duke@1 84 void expand_allocate_common(AllocateNode* alloc,
duke@1 85 Node* length,
duke@1 86 const TypeFunc* slow_call_type,
duke@1 87 address slow_call_address);
kvn@246 88 Node *value_from_mem(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc);
kvn@955 89 Node *value_from_mem_phi(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc, Node_Stack *value_phis, int level);
kvn@246 90
kvn@17383 91 bool eliminate_boxing_node(CallStaticJavaNode *boxing);
kvn@246 92 bool eliminate_allocate_node(AllocateNode *alloc);
kvn@246 93 bool can_eliminate_allocation(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints);
kvn@246 94 bool scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints_done);
kvn@17383 95 void process_users_of_allocation(CallNode *alloc);
kvn@246 96
kvn@246 97 void eliminate_card_mark(Node *cm);
kvn@11445 98 void mark_eliminated_box(Node* box, Node* obj);
kvn@9977 99 void mark_eliminated_locking_nodes(AbstractLockNode *alock);
kvn@239 100 bool eliminate_locking_node(AbstractLockNode *alock);
duke@1 101 void expand_lock_node(LockNode *lock);
duke@1 102 void expand_unlock_node(UnlockNode *unlock);
duke@1 103
duke@1 104 int replace_input(Node *use, Node *oldref, Node *newref);
duke@1 105 void copy_call_debug_info(CallNode *oldcall, CallNode * newcall);
kvn@1500 106 Node* opt_bits_test(Node* ctrl, Node* region, int edge, Node* word, int mask, int bits, bool return_fast_path = false);
duke@1 107 void copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call);
duke@1 108 CallNode* make_slow_call(CallNode *oldcall, const TypeFunc* slow_call_type, address slow_call,
duke@1 109 const char* leaf_name, Node* slow_path, Node* parm0, Node* parm1);
duke@1 110 void extract_call_projections(CallNode *call);
duke@1 111
duke@1 112 Node* initialize_object(AllocateNode* alloc,
duke@1 113 Node* control, Node* rawmem, Node* object,
duke@1 114 Node* klass_node, Node* length,
duke@1 115 Node* size_in_bytes);
duke@1 116
duke@1 117 Node* prefetch_allocation(Node* i_o,
duke@1 118 Node*& needgc_false, Node*& contended_phi_rawmem,
duke@1 119 Node* old_eden_top, Node* new_eden_top,
duke@1 120 Node* length);
duke@1 121
duke@1 122 public:
kvn@23491 123 PhaseMacroExpand(PhaseIterGVN &igvn) : Phase(Macro_Expand), _igvn(igvn), _has_locks(false) {
coleenp@360 124 _igvn.set_delay_transform(true);
coleenp@360 125 }
kvn@11191 126 void eliminate_macro_nodes();
duke@1 127 bool expand_macro_nodes();
duke@1 128
duke@1 129 };
stefank@7397 130
stefank@7397 131 #endif // SHARE_VM_OPTO_MACRO_HPP