truffle: src/share/vm/opto/macro.cpp annotate

annotate src/share/vm/opto/macro.cpp @ 565:7fe62bb75bf4

6799693: Server compiler leads to data corruption when expression throws an Exception Summary: Use merged memory state for an allocation's slow path. Reviewed-by: never

author	kvn
date	Thu, 05 Feb 2009 14:43:58 -0800
parents	dd70dd4c91de
children	0fbdb4381b99 49a36a80b0c7

rev	line source
0 a61af66fc99e Initial load duke parents: diff changeset	1 /*
196 d1605aabd0a1 6719955: Update copyright year xdono parents: 168 diff changeset	2 * Copyright 2005-2008 Sun Microsystems, Inc. All Rights Reserved.
0 a61af66fc99e Initial load duke parents: diff changeset	3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
a61af66fc99e Initial load duke parents: diff changeset	4 *
a61af66fc99e Initial load duke parents: diff changeset	5 * This code is free software; you can redistribute it and/or modify it
a61af66fc99e Initial load duke parents: diff changeset	6 * under the terms of the GNU General Public License version 2 only, as
a61af66fc99e Initial load duke parents: diff changeset	7 * published by the Free Software Foundation.
a61af66fc99e Initial load duke parents: diff changeset	8 *
a61af66fc99e Initial load duke parents: diff changeset	9 * This code is distributed in the hope that it will be useful, but WITHOUT
a61af66fc99e Initial load duke parents: diff changeset	10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
a61af66fc99e Initial load duke parents: diff changeset	11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
a61af66fc99e Initial load duke parents: diff changeset	12 * version 2 for more details (a copy is included in the LICENSE file that
a61af66fc99e Initial load duke parents: diff changeset	13 * accompanied this code).
a61af66fc99e Initial load duke parents: diff changeset	14 *
a61af66fc99e Initial load duke parents: diff changeset	15 * You should have received a copy of the GNU General Public License version
a61af66fc99e Initial load duke parents: diff changeset	16 * 2 along with this work; if not, write to the Free Software Foundation,
a61af66fc99e Initial load duke parents: diff changeset	17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
a61af66fc99e Initial load duke parents: diff changeset	18 *
a61af66fc99e Initial load duke parents: diff changeset	19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
a61af66fc99e Initial load duke parents: diff changeset	20 * CA 95054 USA or visit www.sun.com if you need additional information or
a61af66fc99e Initial load duke parents: diff changeset	21 * have any questions.
a61af66fc99e Initial load duke parents: diff changeset	22 *
a61af66fc99e Initial load duke parents: diff changeset	23 */
a61af66fc99e Initial load duke parents: diff changeset	24
a61af66fc99e Initial load duke parents: diff changeset	25 #include "incls/_precompiled.incl"
a61af66fc99e Initial load duke parents: diff changeset	26 #include "incls/_macro.cpp.incl"
a61af66fc99e Initial load duke parents: diff changeset	27
a61af66fc99e Initial load duke parents: diff changeset	28
a61af66fc99e Initial load duke parents: diff changeset	29 //
a61af66fc99e Initial load duke parents: diff changeset	30 // Replace any references to "oldref" in inputs to "use" with "newref".
a61af66fc99e Initial load duke parents: diff changeset	31 // Returns the number of replacements made.
a61af66fc99e Initial load duke parents: diff changeset	32 //
a61af66fc99e Initial load duke parents: diff changeset	33 int PhaseMacroExpand::replace_input(Node use, Node oldref, Node *newref) {
a61af66fc99e Initial load duke parents: diff changeset	34 int nreplacements = 0;
a61af66fc99e Initial load duke parents: diff changeset	35 uint req = use->req();
a61af66fc99e Initial load duke parents: diff changeset	36 for (uint j = 0; j < use->len(); j++) {
a61af66fc99e Initial load duke parents: diff changeset	37 Node *uin = use->in(j);
a61af66fc99e Initial load duke parents: diff changeset	38 if (uin == oldref) {
a61af66fc99e Initial load duke parents: diff changeset	39 if (j < req)
a61af66fc99e Initial load duke parents: diff changeset	40 use->set_req(j, newref);
a61af66fc99e Initial load duke parents: diff changeset	41 else
a61af66fc99e Initial load duke parents: diff changeset	42 use->set_prec(j, newref);
a61af66fc99e Initial load duke parents: diff changeset	43 nreplacements++;
a61af66fc99e Initial load duke parents: diff changeset	44 } else if (j >= req && uin == NULL) {
a61af66fc99e Initial load duke parents: diff changeset	45 break;
a61af66fc99e Initial load duke parents: diff changeset	46 }
a61af66fc99e Initial load duke parents: diff changeset	47 }
a61af66fc99e Initial load duke parents: diff changeset	48 return nreplacements;
a61af66fc99e Initial load duke parents: diff changeset	49 }
a61af66fc99e Initial load duke parents: diff changeset	50
a61af66fc99e Initial load duke parents: diff changeset	51 void PhaseMacroExpand::copy_call_debug_info(CallNode oldcall, CallNode newcall) {
a61af66fc99e Initial load duke parents: diff changeset	52 // Copy debug information and adjust JVMState information
a61af66fc99e Initial load duke parents: diff changeset	53 uint old_dbg_start = oldcall->tf()->domain()->cnt();
a61af66fc99e Initial load duke parents: diff changeset	54 uint new_dbg_start = newcall->tf()->domain()->cnt();
a61af66fc99e Initial load duke parents: diff changeset	55 int jvms_adj = new_dbg_start - old_dbg_start;
a61af66fc99e Initial load duke parents: diff changeset	56 assert (new_dbg_start == newcall->req(), "argument count mismatch");
63 eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	57
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	58 Dict* sosn_map = new Dict(cmpkey,hashkey);
0 a61af66fc99e Initial load duke parents: diff changeset	59 for (uint i = old_dbg_start; i < oldcall->req(); i++) {
63 eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	60 Node* old_in = oldcall->in(i);
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	61 // Clone old SafePointScalarObjectNodes, adjusting their field contents.
460 424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	62 if (old_in != NULL && old_in->is_SafePointScalarObject()) {
63 eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	63 SafePointScalarObjectNode* old_sosn = old_in->as_SafePointScalarObject();
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	64 uint old_unique = C->unique();
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	65 Node* new_in = old_sosn->clone(jvms_adj, sosn_map);
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	66 if (old_unique != C->unique()) {
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	67 new_in = transform_later(new_in); // Register new node.
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	68 }
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	69 old_in = new_in;
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	70 }
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	71 newcall->add_req(old_in);
0 a61af66fc99e Initial load duke parents: diff changeset	72 }
63 eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	73
0 a61af66fc99e Initial load duke parents: diff changeset	74 newcall->set_jvms(oldcall->jvms());
a61af66fc99e Initial load duke parents: diff changeset	75 for (JVMState *jvms = newcall->jvms(); jvms != NULL; jvms = jvms->caller()) {
a61af66fc99e Initial load duke parents: diff changeset	76 jvms->set_map(newcall);
a61af66fc99e Initial load duke parents: diff changeset	77 jvms->set_locoff(jvms->locoff()+jvms_adj);
a61af66fc99e Initial load duke parents: diff changeset	78 jvms->set_stkoff(jvms->stkoff()+jvms_adj);
a61af66fc99e Initial load duke parents: diff changeset	79 jvms->set_monoff(jvms->monoff()+jvms_adj);
63 eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	80 jvms->set_scloff(jvms->scloff()+jvms_adj);
0 a61af66fc99e Initial load duke parents: diff changeset	81 jvms->set_endoff(jvms->endoff()+jvms_adj);
a61af66fc99e Initial load duke parents: diff changeset	82 }
a61af66fc99e Initial load duke parents: diff changeset	83 }
a61af66fc99e Initial load duke parents: diff changeset	84
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	85 Node* PhaseMacroExpand::opt_bits_test(Node* ctrl, Node* region, int edge, Node* word, int mask, int bits, bool return_fast_path) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	86 Node* cmp;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	87 if (mask != 0) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	88 Node* and_node = transform_later(new (C, 3) AndXNode(word, MakeConX(mask)));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	89 cmp = transform_later(new (C, 3) CmpXNode(and_node, MakeConX(bits)));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	90 } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	91 cmp = word;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	92 }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	93 Node* bol = transform_later(new (C, 2) BoolNode(cmp, BoolTest::ne));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	94 IfNode* iff = new (C, 2) IfNode( ctrl, bol, PROB_MIN, COUNT_UNKNOWN );
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	95 transform_later(iff);
0 a61af66fc99e Initial load duke parents: diff changeset	96
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	97 // Fast path taken.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	98 Node *fast_taken = transform_later( new (C, 1) IfFalseNode(iff) );
0 a61af66fc99e Initial load duke parents: diff changeset	99
a61af66fc99e Initial load duke parents: diff changeset	100 // Fast path not-taken, i.e. slow path
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	101 Node *slow_taken = transform_later( new (C, 1) IfTrueNode(iff) );
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	102
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	103 if (return_fast_path) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	104 region->init_req(edge, slow_taken); // Capture slow-control
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	105 return fast_taken;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	106 } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	107 region->init_req(edge, fast_taken); // Capture fast-control
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	108 return slow_taken;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	109 }
0 a61af66fc99e Initial load duke parents: diff changeset	110 }
a61af66fc99e Initial load duke parents: diff changeset	111
a61af66fc99e Initial load duke parents: diff changeset	112 //--------------------copy_predefined_input_for_runtime_call--------------------
a61af66fc99e Initial load duke parents: diff changeset	113 void PhaseMacroExpand::copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call) {
a61af66fc99e Initial load duke parents: diff changeset	114 // Set fixed predefined input arguments
a61af66fc99e Initial load duke parents: diff changeset	115 call->init_req( TypeFunc::Control, ctrl );
a61af66fc99e Initial load duke parents: diff changeset	116 call->init_req( TypeFunc::I_O , oldcall->in( TypeFunc::I_O) );
a61af66fc99e Initial load duke parents: diff changeset	117 call->init_req( TypeFunc::Memory , oldcall->in( TypeFunc::Memory ) ); // ?????
a61af66fc99e Initial load duke parents: diff changeset	118 call->init_req( TypeFunc::ReturnAdr, oldcall->in( TypeFunc::ReturnAdr ) );
a61af66fc99e Initial load duke parents: diff changeset	119 call->init_req( TypeFunc::FramePtr, oldcall->in( TypeFunc::FramePtr ) );
a61af66fc99e Initial load duke parents: diff changeset	120 }
a61af66fc99e Initial load duke parents: diff changeset	121
a61af66fc99e Initial load duke parents: diff changeset	122 //------------------------------make_slow_call---------------------------------
a61af66fc99e Initial load duke parents: diff changeset	123 CallNode* PhaseMacroExpand::make_slow_call(CallNode oldcall, const TypeFunc slow_call_type, address slow_call, const char* leaf_name, Node* slow_path, Node* parm0, Node* parm1) {
a61af66fc99e Initial load duke parents: diff changeset	124
a61af66fc99e Initial load duke parents: diff changeset	125 // Slow-path call
a61af66fc99e Initial load duke parents: diff changeset	126 int size = slow_call_type->domain()->cnt();
a61af66fc99e Initial load duke parents: diff changeset	127 CallNode *call = leaf_name
a61af66fc99e Initial load duke parents: diff changeset	128 ? (CallNode*)new (C, size) CallLeafNode ( slow_call_type, slow_call, leaf_name, TypeRawPtr::BOTTOM )
a61af66fc99e Initial load duke parents: diff changeset	129 : (CallNode*)new (C, size) CallStaticJavaNode( slow_call_type, slow_call, OptoRuntime::stub_name(slow_call), oldcall->jvms()->bci(), TypeRawPtr::BOTTOM );
a61af66fc99e Initial load duke parents: diff changeset	130
a61af66fc99e Initial load duke parents: diff changeset	131 // Slow path call has no side-effects, uses few values
a61af66fc99e Initial load duke parents: diff changeset	132 copy_predefined_input_for_runtime_call(slow_path, oldcall, call );
a61af66fc99e Initial load duke parents: diff changeset	133 if (parm0 != NULL) call->init_req(TypeFunc::Parms+0, parm0);
a61af66fc99e Initial load duke parents: diff changeset	134 if (parm1 != NULL) call->init_req(TypeFunc::Parms+1, parm1);
a61af66fc99e Initial load duke parents: diff changeset	135 copy_call_debug_info(oldcall, call);
a61af66fc99e Initial load duke parents: diff changeset	136 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON.
a61af66fc99e Initial load duke parents: diff changeset	137 _igvn.hash_delete(oldcall);
a61af66fc99e Initial load duke parents: diff changeset	138 _igvn.subsume_node(oldcall, call);
a61af66fc99e Initial load duke parents: diff changeset	139 transform_later(call);
a61af66fc99e Initial load duke parents: diff changeset	140
a61af66fc99e Initial load duke parents: diff changeset	141 return call;
a61af66fc99e Initial load duke parents: diff changeset	142 }
a61af66fc99e Initial load duke parents: diff changeset	143
a61af66fc99e Initial load duke parents: diff changeset	144 void PhaseMacroExpand::extract_call_projections(CallNode *call) {
a61af66fc99e Initial load duke parents: diff changeset	145 _fallthroughproj = NULL;
a61af66fc99e Initial load duke parents: diff changeset	146 _fallthroughcatchproj = NULL;
a61af66fc99e Initial load duke parents: diff changeset	147 _ioproj_fallthrough = NULL;
a61af66fc99e Initial load duke parents: diff changeset	148 _ioproj_catchall = NULL;
a61af66fc99e Initial load duke parents: diff changeset	149 _catchallcatchproj = NULL;
a61af66fc99e Initial load duke parents: diff changeset	150 _memproj_fallthrough = NULL;
a61af66fc99e Initial load duke parents: diff changeset	151 _memproj_catchall = NULL;
a61af66fc99e Initial load duke parents: diff changeset	152 _resproj = NULL;
a61af66fc99e Initial load duke parents: diff changeset	153 for (DUIterator_Fast imax, i = call->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load duke parents: diff changeset	154 ProjNode *pn = call->fast_out(i)->as_Proj();
a61af66fc99e Initial load duke parents: diff changeset	155 switch (pn->_con) {
a61af66fc99e Initial load duke parents: diff changeset	156 case TypeFunc::Control:
a61af66fc99e Initial load duke parents: diff changeset	157 {
a61af66fc99e Initial load duke parents: diff changeset	158 // For Control (fallthrough) and I_O (catch_all_index) we have CatchProj -> Catch -> Proj
a61af66fc99e Initial load duke parents: diff changeset	159 _fallthroughproj = pn;
a61af66fc99e Initial load duke parents: diff changeset	160 DUIterator_Fast jmax, j = pn->fast_outs(jmax);
a61af66fc99e Initial load duke parents: diff changeset	161 const Node *cn = pn->fast_out(j);
a61af66fc99e Initial load duke parents: diff changeset	162 if (cn->is_Catch()) {
a61af66fc99e Initial load duke parents: diff changeset	163 ProjNode *cpn = NULL;
a61af66fc99e Initial load duke parents: diff changeset	164 for (DUIterator_Fast kmax, k = cn->fast_outs(kmax); k < kmax; k++) {
a61af66fc99e Initial load duke parents: diff changeset	165 cpn = cn->fast_out(k)->as_Proj();
a61af66fc99e Initial load duke parents: diff changeset	166 assert(cpn->is_CatchProj(), "must be a CatchProjNode");
a61af66fc99e Initial load duke parents: diff changeset	167 if (cpn->_con == CatchProjNode::fall_through_index)
a61af66fc99e Initial load duke parents: diff changeset	168 _fallthroughcatchproj = cpn;
a61af66fc99e Initial load duke parents: diff changeset	169 else {
a61af66fc99e Initial load duke parents: diff changeset	170 assert(cpn->_con == CatchProjNode::catch_all_index, "must be correct index.");
a61af66fc99e Initial load duke parents: diff changeset	171 _catchallcatchproj = cpn;
a61af66fc99e Initial load duke parents: diff changeset	172 }
a61af66fc99e Initial load duke parents: diff changeset	173 }
a61af66fc99e Initial load duke parents: diff changeset	174 }
a61af66fc99e Initial load duke parents: diff changeset	175 break;
a61af66fc99e Initial load duke parents: diff changeset	176 }
a61af66fc99e Initial load duke parents: diff changeset	177 case TypeFunc::I_O:
a61af66fc99e Initial load duke parents: diff changeset	178 if (pn->_is_io_use)
a61af66fc99e Initial load duke parents: diff changeset	179 _ioproj_catchall = pn;
a61af66fc99e Initial load duke parents: diff changeset	180 else
a61af66fc99e Initial load duke parents: diff changeset	181 _ioproj_fallthrough = pn;
a61af66fc99e Initial load duke parents: diff changeset	182 break;
a61af66fc99e Initial load duke parents: diff changeset	183 case TypeFunc::Memory:
a61af66fc99e Initial load duke parents: diff changeset	184 if (pn->_is_io_use)
a61af66fc99e Initial load duke parents: diff changeset	185 _memproj_catchall = pn;
a61af66fc99e Initial load duke parents: diff changeset	186 else
a61af66fc99e Initial load duke parents: diff changeset	187 _memproj_fallthrough = pn;
a61af66fc99e Initial load duke parents: diff changeset	188 break;
a61af66fc99e Initial load duke parents: diff changeset	189 case TypeFunc::Parms:
a61af66fc99e Initial load duke parents: diff changeset	190 _resproj = pn;
a61af66fc99e Initial load duke parents: diff changeset	191 break;
a61af66fc99e Initial load duke parents: diff changeset	192 default:
a61af66fc99e Initial load duke parents: diff changeset	193 assert(false, "unexpected projection from allocation node.");
a61af66fc99e Initial load duke parents: diff changeset	194 }
a61af66fc99e Initial load duke parents: diff changeset	195 }
a61af66fc99e Initial load duke parents: diff changeset	196
a61af66fc99e Initial load duke parents: diff changeset	197 }
a61af66fc99e Initial load duke parents: diff changeset	198
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	199 // Eliminate a card mark sequence. p2x is a ConvP2XNode
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	200 void PhaseMacroExpand::eliminate_card_mark(Node *p2x) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	201 assert(p2x->Opcode() == Op_CastP2X, "ConvP2XNode required");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	202 Node *shift = p2x->unique_out();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	203 Node *addp = shift->unique_out();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	204 for (DUIterator_Last jmin, j = addp->last_outs(jmin); j >= jmin; --j) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	205 Node *st = addp->last_out(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	206 assert(st->is_Store(), "store required");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	207 _igvn.replace_node(st, st->in(MemNode::Memory));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	208 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	209 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	210
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	211 // Search for a memory operation for the specified memory slice.
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	212 static Node scan_mem_chain(Node mem, int alias_idx, int offset, Node start_mem, Node alloc, PhaseGVN *phase) {
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	213 Node *orig_mem = mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	214 Node *alloc_mem = alloc->in(TypeFunc::Memory);
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	215 const TypeOopPtr *tinst = phase->C->get_adr_type(alias_idx)->isa_oopptr();
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	216 while (true) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	217 if (mem == alloc_mem \|\| mem == start_mem ) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	218 return mem; // hit one of our sentinals
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	219 } else if (mem->is_MergeMem()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	220 mem = mem->as_MergeMem()->memory_at(alias_idx);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	221 } else if (mem->is_Proj() && mem->as_Proj()->_con == TypeFunc::Memory) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	222 Node *in = mem->in(0);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	223 // we can safely skip over safepoints, calls, locks and membars because we
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	224 // already know that the object is safe to eliminate.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	225 if (in->is_Initialize() && in->as_Initialize()->allocation() == alloc) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	226 return in;
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	227 } else if (in->is_Call()) {
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	228 CallNode *call = in->as_Call();
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	229 if (!call->may_modify(tinst, phase)) {
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	230 mem = call->in(TypeFunc::Memory);
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	231 }
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	232 mem = in->in(TypeFunc::Memory);
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	233 } else if (in->is_MemBar()) {
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	234 mem = in->in(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	235 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	236 assert(false, "unexpected projection");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	237 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	238 } else if (mem->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	239 const TypePtr* atype = mem->as_Store()->adr_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	240 int adr_idx = Compile::current()->get_alias_index(atype);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	241 if (adr_idx == alias_idx) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	242 assert(atype->isa_oopptr(), "address type must be oopptr");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	243 int adr_offset = atype->offset();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	244 uint adr_iid = atype->is_oopptr()->instance_id();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	245 // Array elements references have the same alias_idx
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	246 // but different offset and different instance_id.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	247 if (adr_offset == offset && adr_iid == alloc->_idx)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	248 return mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	249 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	250 assert(adr_idx == Compile::AliasIdxRaw, "address must match or be raw");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	251 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	252 mem = mem->in(MemNode::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	253 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	254 return mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	255 }
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	256 assert(mem != orig_mem, "dead memory loop");
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	257 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	258 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	259
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	260 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	261 // Given a Memory Phi, compute a value Phi containing the values from stores
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	262 // on the input paths.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	263 // Note: this function is recursive, its depth is limied by the "level" argument
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	264 // Returns the computed Phi, or NULL if it cannot compute it.
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	265 Node PhaseMacroExpand::value_from_mem_phi(Node mem, BasicType ft, const Type phi_type, const TypeOopPtr adr_t, Node alloc, Node_Stack value_phis, int level) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	266 assert(mem->is_Phi(), "sanity");
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	267 int alias_idx = C->get_alias_index(adr_t);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	268 int offset = adr_t->offset();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	269 int instance_id = adr_t->instance_id();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	270
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	271 // Check if an appropriate value phi already exists.
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	272 Node* region = mem->in(0);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	273 for (DUIterator_Fast kmax, k = region->fast_outs(kmax); k < kmax; k++) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	274 Node* phi = region->fast_out(k);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	275 if (phi->is_Phi() && phi != mem &&
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	276 phi->as_Phi()->is_same_inst_field(phi_type, instance_id, alias_idx, offset)) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	277 return phi;
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	278 }
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	279 }
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	280 // Check if an appropriate new value phi already exists.
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	281 Node* new_phi = NULL;
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	282 uint size = value_phis->size();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	283 for (uint i=0; i < size; i++) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	284 if ( mem->_idx == value_phis->index_at(i) ) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	285 return value_phis->node_at(i);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	286 }
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	287 }
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	288
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	289 if (level <= 0) {
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	290 return NULL; // Give up: phi tree too deep
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	291 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	292 Node *start_mem = C->start()->proj_out(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	293 Node *alloc_mem = alloc->in(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	294
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	295 uint length = mem->req();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	296 GrowableArray <Node *> values(length, length, NULL);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	297
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	298 // create a new Phi for the value
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	299 PhiNode *phi = new (C, length) PhiNode(mem->in(0), phi_type, NULL, instance_id, alias_idx, offset);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	300 transform_later(phi);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	301 value_phis->push(phi, mem->_idx);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	302
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	303 for (uint j = 1; j < length; j++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	304 Node *in = mem->in(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	305 if (in == NULL \|\| in->is_top()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	306 values.at_put(j, in);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	307 } else {
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	308 Node *val = scan_mem_chain(in, alias_idx, offset, start_mem, alloc, &_igvn);
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	309 if (val == start_mem \|\| val == alloc_mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	310 // hit a sentinel, return appropriate 0 value
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	311 values.at_put(j, _igvn.zerocon(ft));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	312 continue;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	313 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	314 if (val->is_Initialize()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	315 val = val->as_Initialize()->find_captured_store(offset, type2aelembytes(ft), &_igvn);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	316 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	317 if (val == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	318 return NULL; // can't find a value on this path
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	319 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	320 if (val == mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	321 values.at_put(j, mem);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	322 } else if (val->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	323 values.at_put(j, val->in(MemNode::ValueIn));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	324 } else if(val->is_Proj() && val->in(0) == alloc) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	325 values.at_put(j, _igvn.zerocon(ft));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	326 } else if (val->is_Phi()) {
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	327 val = value_from_mem_phi(val, ft, phi_type, adr_t, alloc, value_phis, level-1);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	328 if (val == NULL) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	329 return NULL;
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	330 }
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	331 values.at_put(j, val);
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	332 } else {
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	333 assert(false, "unknown node on this path");
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	334 return NULL; // unknown node on this path
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	335 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	336 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	337 }
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	338 // Set Phi's inputs
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	339 for (uint j = 1; j < length; j++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	340 if (values.at(j) == mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	341 phi->init_req(j, phi);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	342 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	343 phi->init_req(j, values.at(j));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	344 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	345 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	346 return phi;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	347 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	348
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	349 // Search the last value stored into the object's field.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	350 Node PhaseMacroExpand::value_from_mem(Node sfpt_mem, BasicType ft, const Type ftype, const TypeOopPtr adr_t, Node *alloc) {
223 1dd146f17531 6716441: error in meet with +DoEscapeAnalysis kvn parents: 221 diff changeset	351 assert(adr_t->is_known_instance_field(), "instance required");
1dd146f17531 6716441: error in meet with +DoEscapeAnalysis kvn parents: 221 diff changeset	352 int instance_id = adr_t->instance_id();
1dd146f17531 6716441: error in meet with +DoEscapeAnalysis kvn parents: 221 diff changeset	353 assert((uint)instance_id == alloc->_idx, "wrong allocation");
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	354
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	355 int alias_idx = C->get_alias_index(adr_t);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	356 int offset = adr_t->offset();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	357 Node *start_mem = C->start()->proj_out(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	358 Node *alloc_ctrl = alloc->in(TypeFunc::Control);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	359 Node *alloc_mem = alloc->in(TypeFunc::Memory);
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	360 Arena *a = Thread::current()->resource_area();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	361 VectorSet visited(a);
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	362
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	363
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	364 bool done = sfpt_mem == alloc_mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	365 Node *mem = sfpt_mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	366 while (!done) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	367 if (visited.test_set(mem->_idx)) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	368 return NULL; // found a loop, give up
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	369 }
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	370 mem = scan_mem_chain(mem, alias_idx, offset, start_mem, alloc, &_igvn);
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	371 if (mem == start_mem \|\| mem == alloc_mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	372 done = true; // hit a sentinel, return appropriate 0 value
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	373 } else if (mem->is_Initialize()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	374 mem = mem->as_Initialize()->find_captured_store(offset, type2aelembytes(ft), &_igvn);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	375 if (mem == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	376 done = true; // Something go wrong.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	377 } else if (mem->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	378 const TypePtr* atype = mem->as_Store()->adr_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	379 assert(C->get_alias_index(atype) == Compile::AliasIdxRaw, "store is correct memory slice");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	380 done = true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	381 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	382 } else if (mem->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	383 const TypeOopPtr* atype = mem->as_Store()->adr_type()->isa_oopptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	384 assert(atype != NULL, "address type must be oopptr");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	385 assert(C->get_alias_index(atype) == alias_idx &&
223 1dd146f17531 6716441: error in meet with +DoEscapeAnalysis kvn parents: 221 diff changeset	386 atype->is_known_instance_field() && atype->offset() == offset &&
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	387 atype->instance_id() == instance_id, "store is correct memory slice");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	388 done = true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	389 } else if (mem->is_Phi()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	390 // try to find a phi's unique input
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	391 Node *unique_input = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	392 Node *top = C->top();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	393 for (uint i = 1; i < mem->req(); i++) {
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	394 Node *n = scan_mem_chain(mem->in(i), alias_idx, offset, start_mem, alloc, &_igvn);
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	395 if (n == NULL \|\| n == top \|\| n == mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	396 continue;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	397 } else if (unique_input == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	398 unique_input = n;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	399 } else if (unique_input != n) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	400 unique_input = top;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	401 break;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	402 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	403 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	404 if (unique_input != NULL && unique_input != top) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	405 mem = unique_input;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	406 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	407 done = true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	408 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	409 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	410 assert(false, "unexpected node");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	411 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	412 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	413 if (mem != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	414 if (mem == start_mem \|\| mem == alloc_mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	415 // hit a sentinel, return appropriate 0 value
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	416 return _igvn.zerocon(ft);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	417 } else if (mem->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	418 return mem->in(MemNode::ValueIn);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	419 } else if (mem->is_Phi()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	420 // attempt to produce a Phi reflecting the values on the input paths of the Phi
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	421 Node_Stack value_phis(a, 8);
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	422 Node * phi = value_from_mem_phi(mem, ft, ftype, adr_t, alloc, &value_phis, ValueSearchLimit);
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	423 if (phi != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	424 return phi;
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	425 } else {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	426 // Kill all new Phis
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	427 while(value_phis.is_nonempty()) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	428 Node* n = value_phis.node();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	429 _igvn.hash_delete(n);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	430 _igvn.subsume_node(n, C->top());
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	431 value_phis.pop();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	432 }
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	433 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	434 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	435 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	436 // Something go wrong.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	437 return NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	438 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	439
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	440 // Check the possibility of scalar replacement.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	441 bool PhaseMacroExpand::can_eliminate_allocation(AllocateNode alloc, GrowableArray <SafePointNode >& safepoints) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	442 // Scan the uses of the allocation to check for anything that would
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	443 // prevent us from eliminating it.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	444 NOT_PRODUCT( const char* fail_eliminate = NULL; )
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	445 DEBUG_ONLY( Node* disq_node = NULL; )
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	446 bool can_eliminate = true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	447
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	448 Node* res = alloc->result_cast();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	449 const TypeOopPtr* res_type = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	450 if (res == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	451 // All users were eliminated.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	452 } else if (!res->is_CheckCastPP()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	453 alloc->_is_scalar_replaceable = false; // don't try again
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	454 NOT_PRODUCT(fail_eliminate = "Allocation does not have unique CheckCastPP";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	455 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	456 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	457 res_type = _igvn.type(res)->isa_oopptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	458 if (res_type == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	459 NOT_PRODUCT(fail_eliminate = "Neither instance or array allocation";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	460 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	461 } else if (res_type->isa_aryptr()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	462 int length = alloc->in(AllocateNode::ALength)->find_int_con(-1);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	463 if (length < 0) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	464 NOT_PRODUCT(fail_eliminate = "Array's size is not constant";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	465 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	466 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	467 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	468 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	469
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	470 if (can_eliminate && res != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	471 for (DUIterator_Fast jmax, j = res->fast_outs(jmax);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	472 j < jmax && can_eliminate; j++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	473 Node* use = res->fast_out(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	474
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	475 if (use->is_AddP()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	476 const TypePtr* addp_type = _igvn.type(use)->is_ptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	477 int offset = addp_type->offset();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	478
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	479 if (offset == Type::OffsetTop \|\| offset == Type::OffsetBot) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	480 NOT_PRODUCT(fail_eliminate = "Undefined field referrence";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	481 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	482 break;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	483 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	484 for (DUIterator_Fast kmax, k = use->fast_outs(kmax);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	485 k < kmax && can_eliminate; k++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	486 Node* n = use->fast_out(k);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	487 if (!n->is_Store() && n->Opcode() != Op_CastP2X) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	488 DEBUG_ONLY(disq_node = n;)
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	489 if (n->is_Load() \|\| n->is_LoadStore()) {
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	490 NOT_PRODUCT(fail_eliminate = "Field load";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	491 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	492 NOT_PRODUCT(fail_eliminate = "Not store field referrence";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	493 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	494 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	495 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	496 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	497 } else if (use->is_SafePoint()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	498 SafePointNode* sfpt = use->as_SafePoint();
168 7793bd37a336 6705887: Compressed Oops: generate x64 addressing and implicit null checks with narrow oops kvn parents: 163 diff changeset	499 if (sfpt->is_Call() && sfpt->as_Call()->has_non_debug_use(res)) {
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	500 // Object is passed as argument.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	501 DEBUG_ONLY(disq_node = use;)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	502 NOT_PRODUCT(fail_eliminate = "Object is passed as argument";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	503 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	504 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	505 Node* sfptMem = sfpt->memory();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	506 if (sfptMem == NULL \|\| sfptMem->is_top()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	507 DEBUG_ONLY(disq_node = use;)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	508 NOT_PRODUCT(fail_eliminate = "NULL or TOP memory";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	509 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	510 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	511 safepoints.append_if_missing(sfpt);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	512 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	513 } else if (use->Opcode() != Op_CastP2X) { // CastP2X is used by card mark
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	514 if (use->is_Phi()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	515 if (use->outcnt() == 1 && use->unique_out()->Opcode() == Op_Return) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	516 NOT_PRODUCT(fail_eliminate = "Object is return value";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	517 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	518 NOT_PRODUCT(fail_eliminate = "Object is referenced by Phi";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	519 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	520 DEBUG_ONLY(disq_node = use;)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	521 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	522 if (use->Opcode() == Op_Return) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	523 NOT_PRODUCT(fail_eliminate = "Object is return value";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	524 }else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	525 NOT_PRODUCT(fail_eliminate = "Object is referenced by node";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	526 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	527 DEBUG_ONLY(disq_node = use;)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	528 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	529 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	530 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	531 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	532 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	533
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	534 #ifndef PRODUCT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	535 if (PrintEliminateAllocations) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	536 if (can_eliminate) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	537 tty->print("Scalar ");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	538 if (res == NULL)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	539 alloc->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	540 else
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	541 res->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	542 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	543 tty->print("NotScalar (%s)", fail_eliminate);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	544 if (res == NULL)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	545 alloc->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	546 else
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	547 res->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	548 #ifdef ASSERT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	549 if (disq_node != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	550 tty->print(" >>>> ");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	551 disq_node->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	552 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	553 #endif /ASSERT/
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	554 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	555 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	556 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	557 return can_eliminate;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	558 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	559
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	560 // Do scalar replacement.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	561 bool PhaseMacroExpand::scalar_replacement(AllocateNode alloc, GrowableArray <SafePointNode >& safepoints) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	562 GrowableArray <SafePointNode *> safepoints_done;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	563
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	564 ciKlass* klass = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	565 ciInstanceKlass* iklass = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	566 int nfields = 0;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	567 int array_base;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	568 int element_size;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	569 BasicType basic_elem_type;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	570 ciType* elem_type;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	571
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	572 Node* res = alloc->result_cast();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	573 const TypeOopPtr* res_type = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	574 if (res != NULL) { // Could be NULL when there are no users
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	575 res_type = _igvn.type(res)->isa_oopptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	576 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	577
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	578 if (res != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	579 klass = res_type->klass();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	580 if (res_type->isa_instptr()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	581 // find the fields of the class which will be needed for safepoint debug information
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	582 assert(klass->is_instance_klass(), "must be an instance klass.");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	583 iklass = klass->as_instance_klass();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	584 nfields = iklass->nof_nonstatic_fields();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	585 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	586 // find the array's elements which will be needed for safepoint debug information
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	587 nfields = alloc->in(AllocateNode::ALength)->find_int_con(-1);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	588 assert(klass->is_array_klass() && nfields >= 0, "must be an array klass.");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	589 elem_type = klass->as_array_klass()->element_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	590 basic_elem_type = elem_type->basic_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	591 array_base = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	592 element_size = type2aelembytes(basic_elem_type);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	593 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	594 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	595 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	596 // Process the safepoint uses
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	597 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	598 while (safepoints.length() > 0) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	599 SafePointNode* sfpt = safepoints.pop();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	600 Node* mem = sfpt->memory();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	601 uint first_ind = sfpt->req();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	602 SafePointScalarObjectNode* sobj = new (C, 1) SafePointScalarObjectNode(res_type,
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	603 #ifdef ASSERT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	604 alloc,
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	605 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	606 first_ind, nfields);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	607 sobj->init_req(0, sfpt->in(TypeFunc::Control));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	608 transform_later(sobj);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	609
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	610 // Scan object's fields adding an input to the safepoint for each field.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	611 for (int j = 0; j < nfields; j++) {
306 af945ba2e739 6741738: TypePtr::add_offset() set incorrect offset when the add overflows kvn parents: 253 diff changeset	612 intptr_t offset;
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	613 ciField* field = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	614 if (iklass != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	615 field = iklass->nonstatic_field_at(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	616 offset = field->offset();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	617 elem_type = field->type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	618 basic_elem_type = field->layout_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	619 } else {
306 af945ba2e739 6741738: TypePtr::add_offset() set incorrect offset when the add overflows kvn parents: 253 diff changeset	620 offset = array_base + j * (intptr_t)element_size;
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	621 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	622
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	623 const Type *field_type;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	624 // The next code is taken from Parse::do_get_xxx().
124 b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	625 if (basic_elem_type == T_OBJECT \|\| basic_elem_type == T_ARRAY) {
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	626 if (!elem_type->is_loaded()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	627 field_type = TypeInstPtr::BOTTOM;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	628 } else if (field != NULL && field->is_constant()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	629 // This can happen if the constant oop is non-perm.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	630 ciObject* con = field->constant_value().as_object();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	631 // Do not "join" in the previous type; it doesn't add value,
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	632 // and may yield a vacuous result if the field is of interface type.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	633 field_type = TypeOopPtr::make_from_constant(con)->isa_oopptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	634 assert(field_type != NULL, "field singleton type must be consistent");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	635 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	636 field_type = TypeOopPtr::make_from_klass(elem_type->as_klass());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	637 }
124 b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	638 if (UseCompressedOops) {
221 1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode kvn parents: 216 diff changeset	639 field_type = field_type->make_narrowoop();
124 b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	640 basic_elem_type = T_NARROWOOP;
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	641 }
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	642 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	643 field_type = Type::get_const_basic_type(basic_elem_type);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	644 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	645
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	646 const TypeOopPtr *field_addr_type = res_type->add_offset(offset)->isa_oopptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	647
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	648 Node *field_val = value_from_mem(mem, basic_elem_type, field_type, field_addr_type, alloc);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	649 if (field_val == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	650 // we weren't able to find a value for this field,
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	651 // give up on eliminating this allocation
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	652 alloc->_is_scalar_replaceable = false; // don't try again
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	653 // remove any extra entries we added to the safepoint
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	654 uint last = sfpt->req() - 1;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	655 for (int k = 0; k < j; k++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	656 sfpt->del_req(last--);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	657 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	658 // rollback processed safepoints
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	659 while (safepoints_done.length() > 0) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	660 SafePointNode* sfpt_done = safepoints_done.pop();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	661 // remove any extra entries we added to the safepoint
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	662 last = sfpt_done->req() - 1;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	663 for (int k = 0; k < nfields; k++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	664 sfpt_done->del_req(last--);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	665 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	666 JVMState *jvms = sfpt_done->jvms();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	667 jvms->set_endoff(sfpt_done->req());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	668 // Now make a pass over the debug information replacing any references
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	669 // to SafePointScalarObjectNode with the allocated object.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	670 int start = jvms->debug_start();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	671 int end = jvms->debug_end();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	672 for (int i = start; i < end; i++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	673 if (sfpt_done->in(i)->is_SafePointScalarObject()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	674 SafePointScalarObjectNode* scobj = sfpt_done->in(i)->as_SafePointScalarObject();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	675 if (scobj->first_index() == sfpt_done->req() &&
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	676 scobj->n_fields() == (uint)nfields) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	677 assert(scobj->alloc() == alloc, "sanity");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	678 sfpt_done->set_req(i, res);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	679 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	680 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	681 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	682 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	683 #ifndef PRODUCT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	684 if (PrintEliminateAllocations) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	685 if (field != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	686 tty->print("=== At SafePoint node %d can't find value of Field: ",
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	687 sfpt->_idx);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	688 field->print();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	689 int field_idx = C->get_alias_index(field_addr_type);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	690 tty->print(" (alias_idx=%d)", field_idx);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	691 } else { // Array's element
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	692 tty->print("=== At SafePoint node %d can't find value of array element [%d]",
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	693 sfpt->_idx, j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	694 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	695 tty->print(", which prevents elimination of: ");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	696 if (res == NULL)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	697 alloc->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	698 else
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	699 res->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	700 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	701 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	702 return false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	703 }
124 b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	704 if (UseCompressedOops && field_type->isa_narrowoop()) {
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	705 // Enable "DecodeN(EncodeP(Allocate)) --> Allocate" transformation
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	706 // to be able scalar replace the allocation.
221 1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode kvn parents: 216 diff changeset	707 if (field_val->is_EncodeP()) {
1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode kvn parents: 216 diff changeset	708 field_val = field_val->in(1);
1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode kvn parents: 216 diff changeset	709 } else {
1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode kvn parents: 216 diff changeset	710 field_val = transform_later(new (C, 2) DecodeNNode(field_val, field_val->bottom_type()->make_ptr()));
1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode kvn parents: 216 diff changeset	711 }
124 b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	712 }
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	713 sfpt->add_req(field_val);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	714 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	715 JVMState *jvms = sfpt->jvms();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	716 jvms->set_endoff(sfpt->req());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	717 // Now make a pass over the debug information replacing any references
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	718 // to the allocated object with "sobj"
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	719 int start = jvms->debug_start();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	720 int end = jvms->debug_end();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	721 for (int i = start; i < end; i++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	722 if (sfpt->in(i) == res) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	723 sfpt->set_req(i, sobj);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	724 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	725 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	726 safepoints_done.append_if_missing(sfpt); // keep it for rollback
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	727 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	728 return true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	729 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	730
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	731 // Process users of eliminated allocation.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	732 void PhaseMacroExpand::process_users_of_allocation(AllocateNode *alloc) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	733 Node* res = alloc->result_cast();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	734 if (res != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	735 for (DUIterator_Last jmin, j = res->last_outs(jmin); j >= jmin; ) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	736 Node *use = res->last_out(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	737 uint oc1 = res->outcnt();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	738
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	739 if (use->is_AddP()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	740 for (DUIterator_Last kmin, k = use->last_outs(kmin); k >= kmin; ) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	741 Node *n = use->last_out(k);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	742 uint oc2 = use->outcnt();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	743 if (n->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	744 _igvn.replace_node(n, n->in(MemNode::Memory));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	745 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	746 assert( n->Opcode() == Op_CastP2X, "CastP2X required");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	747 eliminate_card_mark(n);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	748 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	749 k -= (oc2 - use->outcnt());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	750 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	751 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	752 assert( !use->is_SafePoint(), "safepoint uses must have been already elimiated");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	753 assert( use->Opcode() == Op_CastP2X, "CastP2X required");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	754 eliminate_card_mark(use);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	755 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	756 j -= (oc1 - res->outcnt());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	757 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	758 assert(res->outcnt() == 0, "all uses of allocated objects must be deleted");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	759 _igvn.remove_dead_node(res);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	760 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	761
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	762 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	763 // Process other users of allocation's projections
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	764 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	765 if (_resproj != NULL && _resproj->outcnt() != 0) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	766 for (DUIterator_Last jmin, j = _resproj->last_outs(jmin); j >= jmin; ) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	767 Node *use = _resproj->last_out(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	768 uint oc1 = _resproj->outcnt();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	769 if (use->is_Initialize()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	770 // Eliminate Initialize node.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	771 InitializeNode *init = use->as_Initialize();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	772 assert(init->outcnt() <= 2, "only a control and memory projection expected");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	773 Node *ctrl_proj = init->proj_out(TypeFunc::Control);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	774 if (ctrl_proj != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	775 assert(init->in(TypeFunc::Control) == _fallthroughcatchproj, "allocation control projection");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	776 _igvn.replace_node(ctrl_proj, _fallthroughcatchproj);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	777 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	778 Node *mem_proj = init->proj_out(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	779 if (mem_proj != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	780 Node *mem = init->in(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	781 #ifdef ASSERT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	782 if (mem->is_MergeMem()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	783 assert(mem->in(TypeFunc::Memory) == _memproj_fallthrough, "allocation memory projection");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	784 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	785 assert(mem == _memproj_fallthrough, "allocation memory projection");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	786 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	787 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	788 _igvn.replace_node(mem_proj, mem);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	789 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	790 } else if (use->is_AddP()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	791 // raw memory addresses used only by the initialization
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	792 _igvn.hash_delete(use);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	793 _igvn.subsume_node(use, C->top());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	794 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	795 assert(false, "only Initialize or AddP expected");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	796 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	797 j -= (oc1 - _resproj->outcnt());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	798 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	799 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	800 if (_fallthroughcatchproj != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	801 _igvn.replace_node(_fallthroughcatchproj, alloc->in(TypeFunc::Control));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	802 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	803 if (_memproj_fallthrough != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	804 _igvn.replace_node(_memproj_fallthrough, alloc->in(TypeFunc::Memory));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	805 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	806 if (_memproj_catchall != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	807 _igvn.replace_node(_memproj_catchall, C->top());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	808 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	809 if (_ioproj_fallthrough != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	810 _igvn.replace_node(_ioproj_fallthrough, alloc->in(TypeFunc::I_O));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	811 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	812 if (_ioproj_catchall != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	813 _igvn.replace_node(_ioproj_catchall, C->top());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	814 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	815 if (_catchallcatchproj != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	816 _igvn.replace_node(_catchallcatchproj, C->top());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	817 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	818 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	819
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	820 bool PhaseMacroExpand::eliminate_allocate_node(AllocateNode *alloc) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	821
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	822 if (!EliminateAllocations \|\| !alloc->_is_scalar_replaceable) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	823 return false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	824 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	825
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	826 extract_call_projections(alloc);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	827
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	828 GrowableArray <SafePointNode *> safepoints;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	829 if (!can_eliminate_allocation(alloc, safepoints)) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	830 return false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	831 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	832
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	833 if (!scalar_replacement(alloc, safepoints)) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	834 return false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	835 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	836
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	837 process_users_of_allocation(alloc);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	838
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	839 #ifndef PRODUCT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	840 if (PrintEliminateAllocations) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	841 if (alloc->is_AllocateArray())
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	842 tty->print_cr("++++ Eliminated: %d AllocateArray", alloc->_idx);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	843 else
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	844 tty->print_cr("++++ Eliminated: %d Allocate", alloc->_idx);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	845 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	846 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	847
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	848 return true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	849 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	850
0 a61af66fc99e Initial load duke parents: diff changeset	851
a61af66fc99e Initial load duke parents: diff changeset	852 //---------------------------set_eden_pointers-------------------------
a61af66fc99e Initial load duke parents: diff changeset	853 void PhaseMacroExpand::set_eden_pointers(Node* &eden_top_adr, Node* &eden_end_adr) {
a61af66fc99e Initial load duke parents: diff changeset	854 if (UseTLAB) { // Private allocation: load from TLS
a61af66fc99e Initial load duke parents: diff changeset	855 Node* thread = transform_later(new (C, 1) ThreadLocalNode());
a61af66fc99e Initial load duke parents: diff changeset	856 int tlab_top_offset = in_bytes(JavaThread::tlab_top_offset());
a61af66fc99e Initial load duke parents: diff changeset	857 int tlab_end_offset = in_bytes(JavaThread::tlab_end_offset());
a61af66fc99e Initial load duke parents: diff changeset	858 eden_top_adr = basic_plus_adr(top()/not oop/, thread, tlab_top_offset);
a61af66fc99e Initial load duke parents: diff changeset	859 eden_end_adr = basic_plus_adr(top()/not oop/, thread, tlab_end_offset);
a61af66fc99e Initial load duke parents: diff changeset	860 } else { // Shared allocation: load from globals
a61af66fc99e Initial load duke parents: diff changeset	861 CollectedHeap* ch = Universe::heap();
a61af66fc99e Initial load duke parents: diff changeset	862 address top_adr = (address)ch->top_addr();
a61af66fc99e Initial load duke parents: diff changeset	863 address end_adr = (address)ch->end_addr();
a61af66fc99e Initial load duke parents: diff changeset	864 eden_top_adr = makecon(TypeRawPtr::make(top_adr));
a61af66fc99e Initial load duke parents: diff changeset	865 eden_end_adr = basic_plus_adr(eden_top_adr, end_adr - top_adr);
a61af66fc99e Initial load duke parents: diff changeset	866 }
a61af66fc99e Initial load duke parents: diff changeset	867 }
a61af66fc99e Initial load duke parents: diff changeset	868
a61af66fc99e Initial load duke parents: diff changeset	869
a61af66fc99e Initial load duke parents: diff changeset	870 Node* PhaseMacroExpand::make_load(Node* ctl, Node* mem, Node* base, int offset, const Type* value_type, BasicType bt) {
a61af66fc99e Initial load duke parents: diff changeset	871 Node* adr = basic_plus_adr(base, offset);
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	872 const TypePtr* adr_type = adr->bottom_type()->is_ptr();
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 73 diff changeset	873 Node* value = LoadNode::make(_igvn, ctl, mem, adr, adr_type, value_type, bt);
0 a61af66fc99e Initial load duke parents: diff changeset	874 transform_later(value);
a61af66fc99e Initial load duke parents: diff changeset	875 return value;
a61af66fc99e Initial load duke parents: diff changeset	876 }
a61af66fc99e Initial load duke parents: diff changeset	877
a61af66fc99e Initial load duke parents: diff changeset	878
a61af66fc99e Initial load duke parents: diff changeset	879 Node* PhaseMacroExpand::make_store(Node* ctl, Node* mem, Node* base, int offset, Node* value, BasicType bt) {
a61af66fc99e Initial load duke parents: diff changeset	880 Node* adr = basic_plus_adr(base, offset);
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 73 diff changeset	881 mem = StoreNode::make(_igvn, ctl, mem, adr, NULL, value, bt);
0 a61af66fc99e Initial load duke parents: diff changeset	882 transform_later(mem);
a61af66fc99e Initial load duke parents: diff changeset	883 return mem;
a61af66fc99e Initial load duke parents: diff changeset	884 }
a61af66fc99e Initial load duke parents: diff changeset	885
a61af66fc99e Initial load duke parents: diff changeset	886 //=============================================================================
a61af66fc99e Initial load duke parents: diff changeset	887 //
a61af66fc99e Initial load duke parents: diff changeset	888 // A L L O C A T I O N
a61af66fc99e Initial load duke parents: diff changeset	889 //
a61af66fc99e Initial load duke parents: diff changeset	890 // Allocation attempts to be fast in the case of frequent small objects.
a61af66fc99e Initial load duke parents: diff changeset	891 // It breaks down like this:
a61af66fc99e Initial load duke parents: diff changeset	892 //
a61af66fc99e Initial load duke parents: diff changeset	893 // 1) Size in doublewords is computed. This is a constant for objects and
a61af66fc99e Initial load duke parents: diff changeset	894 // variable for most arrays. Doubleword units are used to avoid size
a61af66fc99e Initial load duke parents: diff changeset	895 // overflow of huge doubleword arrays. We need doublewords in the end for
a61af66fc99e Initial load duke parents: diff changeset	896 // rounding.
a61af66fc99e Initial load duke parents: diff changeset	897 //
a61af66fc99e Initial load duke parents: diff changeset	898 // 2) Size is checked for being 'too large'. Too-large allocations will go
a61af66fc99e Initial load duke parents: diff changeset	899 // the slow path into the VM. The slow path can throw any required
a61af66fc99e Initial load duke parents: diff changeset	900 // exceptions, and does all the special checks for very large arrays. The
a61af66fc99e Initial load duke parents: diff changeset	901 // size test can constant-fold away for objects. For objects with
a61af66fc99e Initial load duke parents: diff changeset	902 // finalizers it constant-folds the otherway: you always go slow with
a61af66fc99e Initial load duke parents: diff changeset	903 // finalizers.
a61af66fc99e Initial load duke parents: diff changeset	904 //
a61af66fc99e Initial load duke parents: diff changeset	905 // 3) If NOT using TLABs, this is the contended loop-back point.
a61af66fc99e Initial load duke parents: diff changeset	906 // Load-Locked the heap top. If using TLABs normal-load the heap top.
a61af66fc99e Initial load duke parents: diff changeset	907 //
a61af66fc99e Initial load duke parents: diff changeset	908 // 4) Check that heap top + size*8 < max. If we fail go the slow ` route.
a61af66fc99e Initial load duke parents: diff changeset	909 // NOTE: "top+size*8" cannot wrap the 4Gig line! Here's why: for largish
a61af66fc99e Initial load duke parents: diff changeset	910 // "size*8" we always enter the VM, where "largish" is a constant picked small
a61af66fc99e Initial load duke parents: diff changeset	911 // enough that there's always space between the eden max and 4Gig (old space is
a61af66fc99e Initial load duke parents: diff changeset	912 // there so it's quite large) and large enough that the cost of entering the VM
a61af66fc99e Initial load duke parents: diff changeset	913 // is dwarfed by the cost to initialize the space.
a61af66fc99e Initial load duke parents: diff changeset	914 //
a61af66fc99e Initial load duke parents: diff changeset	915 // 5) If NOT using TLABs, Store-Conditional the adjusted heap top back
a61af66fc99e Initial load duke parents: diff changeset	916 // down. If contended, repeat at step 3. If using TLABs normal-store
a61af66fc99e Initial load duke parents: diff changeset	917 // adjusted heap top back down; there is no contention.
a61af66fc99e Initial load duke parents: diff changeset	918 //
a61af66fc99e Initial load duke parents: diff changeset	919 // 6) If !ZeroTLAB then Bulk-clear the object/array. Fill in klass & mark
a61af66fc99e Initial load duke parents: diff changeset	920 // fields.
a61af66fc99e Initial load duke parents: diff changeset	921 //
a61af66fc99e Initial load duke parents: diff changeset	922 // 7) Merge with the slow-path; cast the raw memory pointer to the correct
a61af66fc99e Initial load duke parents: diff changeset	923 // oop flavor.
a61af66fc99e Initial load duke parents: diff changeset	924 //
a61af66fc99e Initial load duke parents: diff changeset	925 //=============================================================================
a61af66fc99e Initial load duke parents: diff changeset	926 // FastAllocateSizeLimit value is in DOUBLEWORDS.
a61af66fc99e Initial load duke parents: diff changeset	927 // Allocations bigger than this always go the slow route.
a61af66fc99e Initial load duke parents: diff changeset	928 // This value must be small enough that allocation attempts that need to
a61af66fc99e Initial load duke parents: diff changeset	929 // trigger exceptions go the slow route. Also, it must be small enough so
a61af66fc99e Initial load duke parents: diff changeset	930 // that heap_top + size_in_bytes does not wrap around the 4Gig limit.
a61af66fc99e Initial load duke parents: diff changeset	931 //=============================================================================j//
a61af66fc99e Initial load duke parents: diff changeset	932 // %%% Here is an old comment from parseHelper.cpp; is it outdated?
a61af66fc99e Initial load duke parents: diff changeset	933 // The allocator will coalesce int->oop copies away. See comment in
a61af66fc99e Initial load duke parents: diff changeset	934 // coalesce.cpp about how this works. It depends critically on the exact
a61af66fc99e Initial load duke parents: diff changeset	935 // code shape produced here, so if you are changing this code shape
a61af66fc99e Initial load duke parents: diff changeset	936 // make sure the GC info for the heap-top is correct in and around the
a61af66fc99e Initial load duke parents: diff changeset	937 // slow-path call.
a61af66fc99e Initial load duke parents: diff changeset	938 //
a61af66fc99e Initial load duke parents: diff changeset	939
a61af66fc99e Initial load duke parents: diff changeset	940 void PhaseMacroExpand::expand_allocate_common(
a61af66fc99e Initial load duke parents: diff changeset	941 AllocateNode* alloc, // allocation node to be expanded
a61af66fc99e Initial load duke parents: diff changeset	942 Node* length, // array length for an array allocation
a61af66fc99e Initial load duke parents: diff changeset	943 const TypeFunc* slow_call_type, // Type of slow call
a61af66fc99e Initial load duke parents: diff changeset	944 address slow_call_address // Address of slow call
a61af66fc99e Initial load duke parents: diff changeset	945 )
a61af66fc99e Initial load duke parents: diff changeset	946 {
a61af66fc99e Initial load duke parents: diff changeset	947
a61af66fc99e Initial load duke parents: diff changeset	948 Node* ctrl = alloc->in(TypeFunc::Control);
a61af66fc99e Initial load duke parents: diff changeset	949 Node* mem = alloc->in(TypeFunc::Memory);
a61af66fc99e Initial load duke parents: diff changeset	950 Node* i_o = alloc->in(TypeFunc::I_O);
a61af66fc99e Initial load duke parents: diff changeset	951 Node* size_in_bytes = alloc->in(AllocateNode::AllocSize);
a61af66fc99e Initial load duke parents: diff changeset	952 Node* klass_node = alloc->in(AllocateNode::KlassNode);
a61af66fc99e Initial load duke parents: diff changeset	953 Node* initial_slow_test = alloc->in(AllocateNode::InitialTest);
a61af66fc99e Initial load duke parents: diff changeset	954
a61af66fc99e Initial load duke parents: diff changeset	955 assert(ctrl != NULL, "must have control");
a61af66fc99e Initial load duke parents: diff changeset	956 // We need a Region and corresponding Phi's to merge the slow-path and fast-path results.
a61af66fc99e Initial load duke parents: diff changeset	957 // they will not be used if "always_slow" is set
a61af66fc99e Initial load duke parents: diff changeset	958 enum { slow_result_path = 1, fast_result_path = 2 };
a61af66fc99e Initial load duke parents: diff changeset	959 Node *result_region;
a61af66fc99e Initial load duke parents: diff changeset	960 Node *result_phi_rawmem;
a61af66fc99e Initial load duke parents: diff changeset	961 Node *result_phi_rawoop;
a61af66fc99e Initial load duke parents: diff changeset	962 Node *result_phi_i_o;
a61af66fc99e Initial load duke parents: diff changeset	963
a61af66fc99e Initial load duke parents: diff changeset	964 // The initial slow comparison is a size check, the comparison
a61af66fc99e Initial load duke parents: diff changeset	965 // we want to do is a BoolTest::gt
a61af66fc99e Initial load duke parents: diff changeset	966 bool always_slow = false;
a61af66fc99e Initial load duke parents: diff changeset	967 int tv = _igvn.find_int_con(initial_slow_test, -1);
a61af66fc99e Initial load duke parents: diff changeset	968 if (tv >= 0) {
a61af66fc99e Initial load duke parents: diff changeset	969 always_slow = (tv == 1);
a61af66fc99e Initial load duke parents: diff changeset	970 initial_slow_test = NULL;
a61af66fc99e Initial load duke parents: diff changeset	971 } else {
a61af66fc99e Initial load duke parents: diff changeset	972 initial_slow_test = BoolNode::make_predicate(initial_slow_test, &_igvn);
a61af66fc99e Initial load duke parents: diff changeset	973 }
a61af66fc99e Initial load duke parents: diff changeset	974
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	975 if (DTraceAllocProbes \|\|
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	976 !UseTLAB && (!Universe::heap()->supports_inline_contig_alloc() \|\|
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	977 (UseConcMarkSweepGC && CMSIncrementalMode))) {
0 a61af66fc99e Initial load duke parents: diff changeset	978 // Force slow-path allocation
a61af66fc99e Initial load duke parents: diff changeset	979 always_slow = true;
a61af66fc99e Initial load duke parents: diff changeset	980 initial_slow_test = NULL;
a61af66fc99e Initial load duke parents: diff changeset	981 }
a61af66fc99e Initial load duke parents: diff changeset	982
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	983
0 a61af66fc99e Initial load duke parents: diff changeset	984 enum { too_big_or_final_path = 1, need_gc_path = 2 };
a61af66fc99e Initial load duke parents: diff changeset	985 Node *slow_region = NULL;
a61af66fc99e Initial load duke parents: diff changeset	986 Node *toobig_false = ctrl;
a61af66fc99e Initial load duke parents: diff changeset	987
a61af66fc99e Initial load duke parents: diff changeset	988 assert (initial_slow_test == NULL \|\| !always_slow, "arguments must be consistent");
a61af66fc99e Initial load duke parents: diff changeset	989 // generate the initial test if necessary
a61af66fc99e Initial load duke parents: diff changeset	990 if (initial_slow_test != NULL ) {
a61af66fc99e Initial load duke parents: diff changeset	991 slow_region = new (C, 3) RegionNode(3);
a61af66fc99e Initial load duke parents: diff changeset	992
a61af66fc99e Initial load duke parents: diff changeset	993 // Now make the initial failure test. Usually a too-big test but
a61af66fc99e Initial load duke parents: diff changeset	994 // might be a TRUE for finalizers or a fancy class check for
a61af66fc99e Initial load duke parents: diff changeset	995 // newInstance0.
a61af66fc99e Initial load duke parents: diff changeset	996 IfNode *toobig_iff = new (C, 2) IfNode(ctrl, initial_slow_test, PROB_MIN, COUNT_UNKNOWN);
a61af66fc99e Initial load duke parents: diff changeset	997 transform_later(toobig_iff);
a61af66fc99e Initial load duke parents: diff changeset	998 // Plug the failing-too-big test into the slow-path region
a61af66fc99e Initial load duke parents: diff changeset	999 Node *toobig_true = new (C, 1) IfTrueNode( toobig_iff );
a61af66fc99e Initial load duke parents: diff changeset	1000 transform_later(toobig_true);
a61af66fc99e Initial load duke parents: diff changeset	1001 slow_region ->init_req( too_big_or_final_path, toobig_true );
a61af66fc99e Initial load duke parents: diff changeset	1002 toobig_false = new (C, 1) IfFalseNode( toobig_iff );
a61af66fc99e Initial load duke parents: diff changeset	1003 transform_later(toobig_false);
a61af66fc99e Initial load duke parents: diff changeset	1004 } else { // No initial test, just fall into next case
a61af66fc99e Initial load duke parents: diff changeset	1005 toobig_false = ctrl;
a61af66fc99e Initial load duke parents: diff changeset	1006 debug_only(slow_region = NodeSentinel);
a61af66fc99e Initial load duke parents: diff changeset	1007 }
a61af66fc99e Initial load duke parents: diff changeset	1008
a61af66fc99e Initial load duke parents: diff changeset	1009 Node *slow_mem = mem; // save the current memory state for slow path
a61af66fc99e Initial load duke parents: diff changeset	1010 // generate the fast allocation code unless we know that the initial test will always go slow
a61af66fc99e Initial load duke parents: diff changeset	1011 if (!always_slow) {
565 7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception kvn parents: 490 diff changeset	1012 // Fast path modifies only raw memory.
7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception kvn parents: 490 diff changeset	1013 if (mem->is_MergeMem()) {
7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception kvn parents: 490 diff changeset	1014 mem = mem->as_MergeMem()->memory_at(Compile::AliasIdxRaw);
7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception kvn parents: 490 diff changeset	1015 }
7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception kvn parents: 490 diff changeset	1016
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1017 Node* eden_top_adr;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1018 Node* eden_end_adr;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1019
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1020 set_eden_pointers(eden_top_adr, eden_end_adr);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1021
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1022 // Load Eden::end. Loop invariant and hoisted.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1023 //
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1024 // Note: We set the control input on "eden_end" and "old_eden_top" when using
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1025 // a TLAB to work around a bug where these values were being moved across
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1026 // a safepoint. These are not oops, so they cannot be include in the oop
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1027 // map, but the can be changed by a GC. The proper way to fix this would
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1028 // be to set the raw memory state when generating a SafepointNode. However
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1029 // this will require extensive changes to the loop optimization in order to
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1030 // prevent a degradation of the optimization.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1031 // See comment in memnode.hpp, around line 227 in class LoadPNode.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1032 Node *eden_end = make_load(ctrl, mem, eden_end_adr, 0, TypeRawPtr::BOTTOM, T_ADDRESS);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1033
0 a61af66fc99e Initial load duke parents: diff changeset	1034 // allocate the Region and Phi nodes for the result
a61af66fc99e Initial load duke parents: diff changeset	1035 result_region = new (C, 3) RegionNode(3);
a61af66fc99e Initial load duke parents: diff changeset	1036 result_phi_rawmem = new (C, 3) PhiNode( result_region, Type::MEMORY, TypeRawPtr::BOTTOM );
a61af66fc99e Initial load duke parents: diff changeset	1037 result_phi_rawoop = new (C, 3) PhiNode( result_region, TypeRawPtr::BOTTOM );
a61af66fc99e Initial load duke parents: diff changeset	1038 result_phi_i_o = new (C, 3) PhiNode( result_region, Type::ABIO ); // I/O is used for Prefetch
a61af66fc99e Initial load duke parents: diff changeset	1039
a61af66fc99e Initial load duke parents: diff changeset	1040 // We need a Region for the loop-back contended case.
a61af66fc99e Initial load duke parents: diff changeset	1041 enum { fall_in_path = 1, contended_loopback_path = 2 };
a61af66fc99e Initial load duke parents: diff changeset	1042 Node *contended_region;
a61af66fc99e Initial load duke parents: diff changeset	1043 Node *contended_phi_rawmem;
a61af66fc99e Initial load duke parents: diff changeset	1044 if( UseTLAB ) {
a61af66fc99e Initial load duke parents: diff changeset	1045 contended_region = toobig_false;
a61af66fc99e Initial load duke parents: diff changeset	1046 contended_phi_rawmem = mem;
a61af66fc99e Initial load duke parents: diff changeset	1047 } else {
a61af66fc99e Initial load duke parents: diff changeset	1048 contended_region = new (C, 3) RegionNode(3);
a61af66fc99e Initial load duke parents: diff changeset	1049 contended_phi_rawmem = new (C, 3) PhiNode( contended_region, Type::MEMORY, TypeRawPtr::BOTTOM);
a61af66fc99e Initial load duke parents: diff changeset	1050 // Now handle the passing-too-big test. We fall into the contended
a61af66fc99e Initial load duke parents: diff changeset	1051 // loop-back merge point.
a61af66fc99e Initial load duke parents: diff changeset	1052 contended_region ->init_req( fall_in_path, toobig_false );
a61af66fc99e Initial load duke parents: diff changeset	1053 contended_phi_rawmem->init_req( fall_in_path, mem );
a61af66fc99e Initial load duke parents: diff changeset	1054 transform_later(contended_region);
a61af66fc99e Initial load duke parents: diff changeset	1055 transform_later(contended_phi_rawmem);
a61af66fc99e Initial load duke parents: diff changeset	1056 }
a61af66fc99e Initial load duke parents: diff changeset	1057
a61af66fc99e Initial load duke parents: diff changeset	1058 // Load(-locked) the heap top.
a61af66fc99e Initial load duke parents: diff changeset	1059 // See note above concerning the control input when using a TLAB
a61af66fc99e Initial load duke parents: diff changeset	1060 Node *old_eden_top = UseTLAB
a61af66fc99e Initial load duke parents: diff changeset	1061 ? new (C, 3) LoadPNode ( ctrl, contended_phi_rawmem, eden_top_adr, TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM )
a61af66fc99e Initial load duke parents: diff changeset	1062 : new (C, 3) LoadPLockedNode( contended_region, contended_phi_rawmem, eden_top_adr );
a61af66fc99e Initial load duke parents: diff changeset	1063
a61af66fc99e Initial load duke parents: diff changeset	1064 transform_later(old_eden_top);
a61af66fc99e Initial load duke parents: diff changeset	1065 // Add to heap top to get a new heap top
a61af66fc99e Initial load duke parents: diff changeset	1066 Node *new_eden_top = new (C, 4) AddPNode( top(), old_eden_top, size_in_bytes );
a61af66fc99e Initial load duke parents: diff changeset	1067 transform_later(new_eden_top);
a61af66fc99e Initial load duke parents: diff changeset	1068 // Check for needing a GC; compare against heap end
a61af66fc99e Initial load duke parents: diff changeset	1069 Node *needgc_cmp = new (C, 3) CmpPNode( new_eden_top, eden_end );
a61af66fc99e Initial load duke parents: diff changeset	1070 transform_later(needgc_cmp);
a61af66fc99e Initial load duke parents: diff changeset	1071 Node *needgc_bol = new (C, 2) BoolNode( needgc_cmp, BoolTest::ge );
a61af66fc99e Initial load duke parents: diff changeset	1072 transform_later(needgc_bol);
a61af66fc99e Initial load duke parents: diff changeset	1073 IfNode *needgc_iff = new (C, 2) IfNode(contended_region, needgc_bol, PROB_UNLIKELY_MAG(4), COUNT_UNKNOWN );
a61af66fc99e Initial load duke parents: diff changeset	1074 transform_later(needgc_iff);
a61af66fc99e Initial load duke parents: diff changeset	1075
a61af66fc99e Initial load duke parents: diff changeset	1076 // Plug the failing-heap-space-need-gc test into the slow-path region
a61af66fc99e Initial load duke parents: diff changeset	1077 Node *needgc_true = new (C, 1) IfTrueNode( needgc_iff );
a61af66fc99e Initial load duke parents: diff changeset	1078 transform_later(needgc_true);
a61af66fc99e Initial load duke parents: diff changeset	1079 if( initial_slow_test ) {
a61af66fc99e Initial load duke parents: diff changeset	1080 slow_region ->init_req( need_gc_path, needgc_true );
a61af66fc99e Initial load duke parents: diff changeset	1081 // This completes all paths into the slow merge point
a61af66fc99e Initial load duke parents: diff changeset	1082 transform_later(slow_region);
a61af66fc99e Initial load duke parents: diff changeset	1083 } else { // No initial slow path needed!
a61af66fc99e Initial load duke parents: diff changeset	1084 // Just fall from the need-GC path straight into the VM call.
a61af66fc99e Initial load duke parents: diff changeset	1085 slow_region = needgc_true;
a61af66fc99e Initial load duke parents: diff changeset	1086 }
a61af66fc99e Initial load duke parents: diff changeset	1087 // No need for a GC. Setup for the Store-Conditional
a61af66fc99e Initial load duke parents: diff changeset	1088 Node *needgc_false = new (C, 1) IfFalseNode( needgc_iff );
a61af66fc99e Initial load duke parents: diff changeset	1089 transform_later(needgc_false);
a61af66fc99e Initial load duke parents: diff changeset	1090
a61af66fc99e Initial load duke parents: diff changeset	1091 // Grab regular I/O before optional prefetch may change it.
a61af66fc99e Initial load duke parents: diff changeset	1092 // Slow-path does no I/O so just set it to the original I/O.
a61af66fc99e Initial load duke parents: diff changeset	1093 result_phi_i_o->init_req( slow_result_path, i_o );
a61af66fc99e Initial load duke parents: diff changeset	1094
a61af66fc99e Initial load duke parents: diff changeset	1095 i_o = prefetch_allocation(i_o, needgc_false, contended_phi_rawmem,
a61af66fc99e Initial load duke parents: diff changeset	1096 old_eden_top, new_eden_top, length);
a61af66fc99e Initial load duke parents: diff changeset	1097
a61af66fc99e Initial load duke parents: diff changeset	1098 // Store (-conditional) the modified eden top back down.
a61af66fc99e Initial load duke parents: diff changeset	1099 // StorePConditional produces flags for a test PLUS a modified raw
a61af66fc99e Initial load duke parents: diff changeset	1100 // memory state.
a61af66fc99e Initial load duke parents: diff changeset	1101 Node *store_eden_top;
a61af66fc99e Initial load duke parents: diff changeset	1102 Node *fast_oop_ctrl;
a61af66fc99e Initial load duke parents: diff changeset	1103 if( UseTLAB ) {
a61af66fc99e Initial load duke parents: diff changeset	1104 store_eden_top = new (C, 4) StorePNode( needgc_false, contended_phi_rawmem, eden_top_adr, TypeRawPtr::BOTTOM, new_eden_top );
a61af66fc99e Initial load duke parents: diff changeset	1105 transform_later(store_eden_top);
a61af66fc99e Initial load duke parents: diff changeset	1106 fast_oop_ctrl = needgc_false; // No contention, so this is the fast path
a61af66fc99e Initial load duke parents: diff changeset	1107 } else {
a61af66fc99e Initial load duke parents: diff changeset	1108 store_eden_top = new (C, 5) StorePConditionalNode( needgc_false, contended_phi_rawmem, eden_top_adr, new_eden_top, old_eden_top );
a61af66fc99e Initial load duke parents: diff changeset	1109 transform_later(store_eden_top);
a61af66fc99e Initial load duke parents: diff changeset	1110 Node *contention_check = new (C, 2) BoolNode( store_eden_top, BoolTest::ne );
a61af66fc99e Initial load duke parents: diff changeset	1111 transform_later(contention_check);
a61af66fc99e Initial load duke parents: diff changeset	1112 store_eden_top = new (C, 1) SCMemProjNode(store_eden_top);
a61af66fc99e Initial load duke parents: diff changeset	1113 transform_later(store_eden_top);
a61af66fc99e Initial load duke parents: diff changeset	1114
a61af66fc99e Initial load duke parents: diff changeset	1115 // If not using TLABs, check to see if there was contention.
a61af66fc99e Initial load duke parents: diff changeset	1116 IfNode *contention_iff = new (C, 2) IfNode ( needgc_false, contention_check, PROB_MIN, COUNT_UNKNOWN );
a61af66fc99e Initial load duke parents: diff changeset	1117 transform_later(contention_iff);
a61af66fc99e Initial load duke parents: diff changeset	1118 Node *contention_true = new (C, 1) IfTrueNode( contention_iff );
a61af66fc99e Initial load duke parents: diff changeset	1119 transform_later(contention_true);
a61af66fc99e Initial load duke parents: diff changeset	1120 // If contention, loopback and try again.
a61af66fc99e Initial load duke parents: diff changeset	1121 contended_region->init_req( contended_loopback_path, contention_true );
a61af66fc99e Initial load duke parents: diff changeset	1122 contended_phi_rawmem->init_req( contended_loopback_path, store_eden_top );
a61af66fc99e Initial load duke parents: diff changeset	1123
a61af66fc99e Initial load duke parents: diff changeset	1124 // Fast-path succeeded with no contention!
a61af66fc99e Initial load duke parents: diff changeset	1125 Node *contention_false = new (C, 1) IfFalseNode( contention_iff );
a61af66fc99e Initial load duke parents: diff changeset	1126 transform_later(contention_false);
a61af66fc99e Initial load duke parents: diff changeset	1127 fast_oop_ctrl = contention_false;
a61af66fc99e Initial load duke parents: diff changeset	1128 }
a61af66fc99e Initial load duke parents: diff changeset	1129
a61af66fc99e Initial load duke parents: diff changeset	1130 // Rename successful fast-path variables to make meaning more obvious
a61af66fc99e Initial load duke parents: diff changeset	1131 Node* fast_oop = old_eden_top;
a61af66fc99e Initial load duke parents: diff changeset	1132 Node* fast_oop_rawmem = store_eden_top;
a61af66fc99e Initial load duke parents: diff changeset	1133 fast_oop_rawmem = initialize_object(alloc,
a61af66fc99e Initial load duke parents: diff changeset	1134 fast_oop_ctrl, fast_oop_rawmem, fast_oop,
a61af66fc99e Initial load duke parents: diff changeset	1135 klass_node, length, size_in_bytes);
a61af66fc99e Initial load duke parents: diff changeset	1136
a61af66fc99e Initial load duke parents: diff changeset	1137 if (ExtendedDTraceProbes) {
a61af66fc99e Initial load duke parents: diff changeset	1138 // Slow-path call
a61af66fc99e Initial load duke parents: diff changeset	1139 int size = TypeFunc::Parms + 2;
a61af66fc99e Initial load duke parents: diff changeset	1140 CallLeafNode *call = new (C, size) CallLeafNode(OptoRuntime::dtrace_object_alloc_Type(),
a61af66fc99e Initial load duke parents: diff changeset	1141 CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_object_alloc_base),
a61af66fc99e Initial load duke parents: diff changeset	1142 "dtrace_object_alloc",
a61af66fc99e Initial load duke parents: diff changeset	1143 TypeRawPtr::BOTTOM);
a61af66fc99e Initial load duke parents: diff changeset	1144
a61af66fc99e Initial load duke parents: diff changeset	1145 // Get base of thread-local storage area
a61af66fc99e Initial load duke parents: diff changeset	1146 Node* thread = new (C, 1) ThreadLocalNode();
a61af66fc99e Initial load duke parents: diff changeset	1147 transform_later(thread);
a61af66fc99e Initial load duke parents: diff changeset	1148
a61af66fc99e Initial load duke parents: diff changeset	1149 call->init_req(TypeFunc::Parms+0, thread);
a61af66fc99e Initial load duke parents: diff changeset	1150 call->init_req(TypeFunc::Parms+1, fast_oop);
a61af66fc99e Initial load duke parents: diff changeset	1151 call->init_req( TypeFunc::Control, fast_oop_ctrl );
a61af66fc99e Initial load duke parents: diff changeset	1152 call->init_req( TypeFunc::I_O , top() ) ; // does no i/o
a61af66fc99e Initial load duke parents: diff changeset	1153 call->init_req( TypeFunc::Memory , fast_oop_rawmem );
a61af66fc99e Initial load duke parents: diff changeset	1154 call->init_req( TypeFunc::ReturnAdr, alloc->in(TypeFunc::ReturnAdr) );
a61af66fc99e Initial load duke parents: diff changeset	1155 call->init_req( TypeFunc::FramePtr, alloc->in(TypeFunc::FramePtr) );
a61af66fc99e Initial load duke parents: diff changeset	1156 transform_later(call);
a61af66fc99e Initial load duke parents: diff changeset	1157 fast_oop_ctrl = new (C, 1) ProjNode(call,TypeFunc::Control);
a61af66fc99e Initial load duke parents: diff changeset	1158 transform_later(fast_oop_ctrl);
a61af66fc99e Initial load duke parents: diff changeset	1159 fast_oop_rawmem = new (C, 1) ProjNode(call,TypeFunc::Memory);
a61af66fc99e Initial load duke parents: diff changeset	1160 transform_later(fast_oop_rawmem);
a61af66fc99e Initial load duke parents: diff changeset	1161 }
a61af66fc99e Initial load duke parents: diff changeset	1162
a61af66fc99e Initial load duke parents: diff changeset	1163 // Plug in the successful fast-path into the result merge point
a61af66fc99e Initial load duke parents: diff changeset	1164 result_region ->init_req( fast_result_path, fast_oop_ctrl );
a61af66fc99e Initial load duke parents: diff changeset	1165 result_phi_rawoop->init_req( fast_result_path, fast_oop );
a61af66fc99e Initial load duke parents: diff changeset	1166 result_phi_i_o ->init_req( fast_result_path, i_o );
a61af66fc99e Initial load duke parents: diff changeset	1167 result_phi_rawmem->init_req( fast_result_path, fast_oop_rawmem );
a61af66fc99e Initial load duke parents: diff changeset	1168 } else {
a61af66fc99e Initial load duke parents: diff changeset	1169 slow_region = ctrl;
a61af66fc99e Initial load duke parents: diff changeset	1170 }
a61af66fc99e Initial load duke parents: diff changeset	1171
a61af66fc99e Initial load duke parents: diff changeset	1172 // Generate slow-path call
a61af66fc99e Initial load duke parents: diff changeset	1173 CallNode *call = new (C, slow_call_type->domain()->cnt())
a61af66fc99e Initial load duke parents: diff changeset	1174 CallStaticJavaNode(slow_call_type, slow_call_address,
a61af66fc99e Initial load duke parents: diff changeset	1175 OptoRuntime::stub_name(slow_call_address),
a61af66fc99e Initial load duke parents: diff changeset	1176 alloc->jvms()->bci(),
a61af66fc99e Initial load duke parents: diff changeset	1177 TypePtr::BOTTOM);
a61af66fc99e Initial load duke parents: diff changeset	1178 call->init_req( TypeFunc::Control, slow_region );
a61af66fc99e Initial load duke parents: diff changeset	1179 call->init_req( TypeFunc::I_O , top() ) ; // does no i/o
a61af66fc99e Initial load duke parents: diff changeset	1180 call->init_req( TypeFunc::Memory , slow_mem ); // may gc ptrs
a61af66fc99e Initial load duke parents: diff changeset	1181 call->init_req( TypeFunc::ReturnAdr, alloc->in(TypeFunc::ReturnAdr) );
a61af66fc99e Initial load duke parents: diff changeset	1182 call->init_req( TypeFunc::FramePtr, alloc->in(TypeFunc::FramePtr) );
a61af66fc99e Initial load duke parents: diff changeset	1183
a61af66fc99e Initial load duke parents: diff changeset	1184 call->init_req(TypeFunc::Parms+0, klass_node);
a61af66fc99e Initial load duke parents: diff changeset	1185 if (length != NULL) {
a61af66fc99e Initial load duke parents: diff changeset	1186 call->init_req(TypeFunc::Parms+1, length);
a61af66fc99e Initial load duke parents: diff changeset	1187 }
a61af66fc99e Initial load duke parents: diff changeset	1188
a61af66fc99e Initial load duke parents: diff changeset	1189 // Copy debug information and adjust JVMState information, then replace
a61af66fc99e Initial load duke parents: diff changeset	1190 // allocate node with the call
a61af66fc99e Initial load duke parents: diff changeset	1191 copy_call_debug_info((CallNode *) alloc, call);
a61af66fc99e Initial load duke parents: diff changeset	1192 if (!always_slow) {
a61af66fc99e Initial load duke parents: diff changeset	1193 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON.
a61af66fc99e Initial load duke parents: diff changeset	1194 }
a61af66fc99e Initial load duke parents: diff changeset	1195 _igvn.hash_delete(alloc);
a61af66fc99e Initial load duke parents: diff changeset	1196 _igvn.subsume_node(alloc, call);
a61af66fc99e Initial load duke parents: diff changeset	1197 transform_later(call);
a61af66fc99e Initial load duke parents: diff changeset	1198
a61af66fc99e Initial load duke parents: diff changeset	1199 // Identify the output projections from the allocate node and
a61af66fc99e Initial load duke parents: diff changeset	1200 // adjust any references to them.
a61af66fc99e Initial load duke parents: diff changeset	1201 // The control and io projections look like:
a61af66fc99e Initial load duke parents: diff changeset	1202 //
a61af66fc99e Initial load duke parents: diff changeset	1203 // v---Proj(ctrl) <-----+ v---CatchProj(ctrl)
a61af66fc99e Initial load duke parents: diff changeset	1204 // Allocate Catch
a61af66fc99e Initial load duke parents: diff changeset	1205 // ^---Proj(io) <-------+ ^---CatchProj(io)
a61af66fc99e Initial load duke parents: diff changeset	1206 //
a61af66fc99e Initial load duke parents: diff changeset	1207 // We are interested in the CatchProj nodes.
a61af66fc99e Initial load duke parents: diff changeset	1208 //
a61af66fc99e Initial load duke parents: diff changeset	1209 extract_call_projections(call);
a61af66fc99e Initial load duke parents: diff changeset	1210
a61af66fc99e Initial load duke parents: diff changeset	1211 // An allocate node has separate memory projections for the uses on the control and i_o paths
a61af66fc99e Initial load duke parents: diff changeset	1212 // Replace uses of the control memory projection with result_phi_rawmem (unless we are only generating a slow call)
a61af66fc99e Initial load duke parents: diff changeset	1213 if (!always_slow && _memproj_fallthrough != NULL) {
a61af66fc99e Initial load duke parents: diff changeset	1214 for (DUIterator_Fast imax, i = _memproj_fallthrough->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load duke parents: diff changeset	1215 Node *use = _memproj_fallthrough->fast_out(i);
a61af66fc99e Initial load duke parents: diff changeset	1216 _igvn.hash_delete(use);
a61af66fc99e Initial load duke parents: diff changeset	1217 imax -= replace_input(use, _memproj_fallthrough, result_phi_rawmem);
a61af66fc99e Initial load duke parents: diff changeset	1218 _igvn._worklist.push(use);
a61af66fc99e Initial load duke parents: diff changeset	1219 // back up iterator
a61af66fc99e Initial load duke parents: diff changeset	1220 --i;
a61af66fc99e Initial load duke parents: diff changeset	1221 }
a61af66fc99e Initial load duke parents: diff changeset	1222 }
a61af66fc99e Initial load duke parents: diff changeset	1223 // Now change uses of _memproj_catchall to use _memproj_fallthrough and delete _memproj_catchall so
a61af66fc99e Initial load duke parents: diff changeset	1224 // we end up with a call that has only 1 memory projection
a61af66fc99e Initial load duke parents: diff changeset	1225 if (_memproj_catchall != NULL ) {
a61af66fc99e Initial load duke parents: diff changeset	1226 if (_memproj_fallthrough == NULL) {
a61af66fc99e Initial load duke parents: diff changeset	1227 _memproj_fallthrough = new (C, 1) ProjNode(call, TypeFunc::Memory);
a61af66fc99e Initial load duke parents: diff changeset	1228 transform_later(_memproj_fallthrough);
a61af66fc99e Initial load duke parents: diff changeset	1229 }
a61af66fc99e Initial load duke parents: diff changeset	1230 for (DUIterator_Fast imax, i = _memproj_catchall->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load duke parents: diff changeset	1231 Node *use = _memproj_catchall->fast_out(i);
a61af66fc99e Initial load duke parents: diff changeset	1232 _igvn.hash_delete(use);
a61af66fc99e Initial load duke parents: diff changeset	1233 imax -= replace_input(use, _memproj_catchall, _memproj_fallthrough);
a61af66fc99e Initial load duke parents: diff changeset	1234 _igvn._worklist.push(use);
a61af66fc99e Initial load duke parents: diff changeset	1235 // back up iterator
a61af66fc99e Initial load duke parents: diff changeset	1236 --i;
a61af66fc99e Initial load duke parents: diff changeset	1237 }
a61af66fc99e Initial load duke parents: diff changeset	1238 }
a61af66fc99e Initial load duke parents: diff changeset	1239
a61af66fc99e Initial load duke parents: diff changeset	1240 // An allocate node has separate i_o projections for the uses on the control and i_o paths
a61af66fc99e Initial load duke parents: diff changeset	1241 // Replace uses of the control i_o projection with result_phi_i_o (unless we are only generating a slow call)
a61af66fc99e Initial load duke parents: diff changeset	1242 if (_ioproj_fallthrough == NULL) {
a61af66fc99e Initial load duke parents: diff changeset	1243 _ioproj_fallthrough = new (C, 1) ProjNode(call, TypeFunc::I_O);
a61af66fc99e Initial load duke parents: diff changeset	1244 transform_later(_ioproj_fallthrough);
a61af66fc99e Initial load duke parents: diff changeset	1245 } else if (!always_slow) {
a61af66fc99e Initial load duke parents: diff changeset	1246 for (DUIterator_Fast imax, i = _ioproj_fallthrough->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load duke parents: diff changeset	1247 Node *use = _ioproj_fallthrough->fast_out(i);
a61af66fc99e Initial load duke parents: diff changeset	1248
a61af66fc99e Initial load duke parents: diff changeset	1249 _igvn.hash_delete(use);
a61af66fc99e Initial load duke parents: diff changeset	1250 imax -= replace_input(use, _ioproj_fallthrough, result_phi_i_o);
a61af66fc99e Initial load duke parents: diff changeset	1251 _igvn._worklist.push(use);
a61af66fc99e Initial load duke parents: diff changeset	1252 // back up iterator
a61af66fc99e Initial load duke parents: diff changeset	1253 --i;
a61af66fc99e Initial load duke parents: diff changeset	1254 }
a61af66fc99e Initial load duke parents: diff changeset	1255 }
a61af66fc99e Initial load duke parents: diff changeset	1256 // Now change uses of _ioproj_catchall to use _ioproj_fallthrough and delete _ioproj_catchall so
a61af66fc99e Initial load duke parents: diff changeset	1257 // we end up with a call that has only 1 control projection
a61af66fc99e Initial load duke parents: diff changeset	1258 if (_ioproj_catchall != NULL ) {
a61af66fc99e Initial load duke parents: diff changeset	1259 for (DUIterator_Fast imax, i = _ioproj_catchall->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load duke parents: diff changeset	1260 Node *use = _ioproj_catchall->fast_out(i);
a61af66fc99e Initial load duke parents: diff changeset	1261 _igvn.hash_delete(use);
a61af66fc99e Initial load duke parents: diff changeset	1262 imax -= replace_input(use, _ioproj_catchall, _ioproj_fallthrough);
a61af66fc99e Initial load duke parents: diff changeset	1263 _igvn._worklist.push(use);
a61af66fc99e Initial load duke parents: diff changeset	1264 // back up iterator
a61af66fc99e Initial load duke parents: diff changeset	1265 --i;
a61af66fc99e Initial load duke parents: diff changeset	1266 }
a61af66fc99e Initial load duke parents: diff changeset	1267 }
a61af66fc99e Initial load duke parents: diff changeset	1268
a61af66fc99e Initial load duke parents: diff changeset	1269 // if we generated only a slow call, we are done
a61af66fc99e Initial load duke parents: diff changeset	1270 if (always_slow)
a61af66fc99e Initial load duke parents: diff changeset	1271 return;
a61af66fc99e Initial load duke parents: diff changeset	1272
a61af66fc99e Initial load duke parents: diff changeset	1273
a61af66fc99e Initial load duke parents: diff changeset	1274 if (_fallthroughcatchproj != NULL) {
a61af66fc99e Initial load duke parents: diff changeset	1275 ctrl = _fallthroughcatchproj->clone();
a61af66fc99e Initial load duke parents: diff changeset	1276 transform_later(ctrl);
a61af66fc99e Initial load duke parents: diff changeset	1277 _igvn.hash_delete(_fallthroughcatchproj);
a61af66fc99e Initial load duke parents: diff changeset	1278 _igvn.subsume_node(_fallthroughcatchproj, result_region);
a61af66fc99e Initial load duke parents: diff changeset	1279 } else {
a61af66fc99e Initial load duke parents: diff changeset	1280 ctrl = top();
a61af66fc99e Initial load duke parents: diff changeset	1281 }
a61af66fc99e Initial load duke parents: diff changeset	1282 Node *slow_result;
a61af66fc99e Initial load duke parents: diff changeset	1283 if (_resproj == NULL) {
a61af66fc99e Initial load duke parents: diff changeset	1284 // no uses of the allocation result
a61af66fc99e Initial load duke parents: diff changeset	1285 slow_result = top();
a61af66fc99e Initial load duke parents: diff changeset	1286 } else {
a61af66fc99e Initial load duke parents: diff changeset	1287 slow_result = _resproj->clone();
a61af66fc99e Initial load duke parents: diff changeset	1288 transform_later(slow_result);
a61af66fc99e Initial load duke parents: diff changeset	1289 _igvn.hash_delete(_resproj);
a61af66fc99e Initial load duke parents: diff changeset	1290 _igvn.subsume_node(_resproj, result_phi_rawoop);
a61af66fc99e Initial load duke parents: diff changeset	1291 }
a61af66fc99e Initial load duke parents: diff changeset	1292
a61af66fc99e Initial load duke parents: diff changeset	1293 // Plug slow-path into result merge point
a61af66fc99e Initial load duke parents: diff changeset	1294 result_region ->init_req( slow_result_path, ctrl );
a61af66fc99e Initial load duke parents: diff changeset	1295 result_phi_rawoop->init_req( slow_result_path, slow_result);
a61af66fc99e Initial load duke parents: diff changeset	1296 result_phi_rawmem->init_req( slow_result_path, _memproj_fallthrough );
a61af66fc99e Initial load duke parents: diff changeset	1297 transform_later(result_region);
a61af66fc99e Initial load duke parents: diff changeset	1298 transform_later(result_phi_rawoop);
a61af66fc99e Initial load duke parents: diff changeset	1299 transform_later(result_phi_rawmem);
a61af66fc99e Initial load duke parents: diff changeset	1300 transform_later(result_phi_i_o);
a61af66fc99e Initial load duke parents: diff changeset	1301 // This completes all paths into the result merge point
a61af66fc99e Initial load duke parents: diff changeset	1302 }
a61af66fc99e Initial load duke parents: diff changeset	1303
a61af66fc99e Initial load duke parents: diff changeset	1304
a61af66fc99e Initial load duke parents: diff changeset	1305 // Helper for PhaseMacroExpand::expand_allocate_common.
a61af66fc99e Initial load duke parents: diff changeset	1306 // Initializes the newly-allocated storage.
a61af66fc99e Initial load duke parents: diff changeset	1307 Node*
a61af66fc99e Initial load duke parents: diff changeset	1308 PhaseMacroExpand::initialize_object(AllocateNode* alloc,
a61af66fc99e Initial load duke parents: diff changeset	1309 Node* control, Node* rawmem, Node* object,
a61af66fc99e Initial load duke parents: diff changeset	1310 Node* klass_node, Node* length,
a61af66fc99e Initial load duke parents: diff changeset	1311 Node* size_in_bytes) {
a61af66fc99e Initial load duke parents: diff changeset	1312 InitializeNode* init = alloc->initialization();
a61af66fc99e Initial load duke parents: diff changeset	1313 // Store the klass & mark bits
a61af66fc99e Initial load duke parents: diff changeset	1314 Node* mark_node = NULL;
a61af66fc99e Initial load duke parents: diff changeset	1315 // For now only enable fast locking for non-array types
a61af66fc99e Initial load duke parents: diff changeset	1316 if (UseBiasedLocking && (length == NULL)) {
a61af66fc99e Initial load duke parents: diff changeset	1317 mark_node = make_load(NULL, rawmem, klass_node, Klass::prototype_header_offset_in_bytes() + sizeof(oopDesc), TypeRawPtr::BOTTOM, T_ADDRESS);
a61af66fc99e Initial load duke parents: diff changeset	1318 } else {
a61af66fc99e Initial load duke parents: diff changeset	1319 mark_node = makecon(TypeRawPtr::make((address)markOopDesc::prototype()));
a61af66fc99e Initial load duke parents: diff changeset	1320 }
a61af66fc99e Initial load duke parents: diff changeset	1321 rawmem = make_store(control, rawmem, object, oopDesc::mark_offset_in_bytes(), mark_node, T_ADDRESS);
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 73 diff changeset	1322
0 a61af66fc99e Initial load duke parents: diff changeset	1323 rawmem = make_store(control, rawmem, object, oopDesc::klass_offset_in_bytes(), klass_node, T_OBJECT);
a61af66fc99e Initial load duke parents: diff changeset	1324 int header_size = alloc->minimum_header_size(); // conservatively small
a61af66fc99e Initial load duke parents: diff changeset	1325
a61af66fc99e Initial load duke parents: diff changeset	1326 // Array length
a61af66fc99e Initial load duke parents: diff changeset	1327 if (length != NULL) { // Arrays need length field
a61af66fc99e Initial load duke parents: diff changeset	1328 rawmem = make_store(control, rawmem, object, arrayOopDesc::length_offset_in_bytes(), length, T_INT);
a61af66fc99e Initial load duke parents: diff changeset	1329 // conservatively small header size:
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 73 diff changeset	1330 header_size = arrayOopDesc::base_offset_in_bytes(T_BYTE);
0 a61af66fc99e Initial load duke parents: diff changeset	1331 ciKlass* k = _igvn.type(klass_node)->is_klassptr()->klass();
a61af66fc99e Initial load duke parents: diff changeset	1332 if (k->is_array_klass()) // we know the exact header size in most cases:
a61af66fc99e Initial load duke parents: diff changeset	1333 header_size = Klass::layout_helper_header_size(k->layout_helper());
a61af66fc99e Initial load duke parents: diff changeset	1334 }
a61af66fc99e Initial load duke parents: diff changeset	1335
a61af66fc99e Initial load duke parents: diff changeset	1336 // Clear the object body, if necessary.
a61af66fc99e Initial load duke parents: diff changeset	1337 if (init == NULL) {
a61af66fc99e Initial load duke parents: diff changeset	1338 // The init has somehow disappeared; be cautious and clear everything.
a61af66fc99e Initial load duke parents: diff changeset	1339 //
a61af66fc99e Initial load duke parents: diff changeset	1340 // This can happen if a node is allocated but an uncommon trap occurs
a61af66fc99e Initial load duke parents: diff changeset	1341 // immediately. In this case, the Initialize gets associated with the
a61af66fc99e Initial load duke parents: diff changeset	1342 // trap, and may be placed in a different (outer) loop, if the Allocate
a61af66fc99e Initial load duke parents: diff changeset	1343 // is in a loop. If (this is rare) the inner loop gets unrolled, then
a61af66fc99e Initial load duke parents: diff changeset	1344 // there can be two Allocates to one Initialize. The answer in all these
a61af66fc99e Initial load duke parents: diff changeset	1345 // edge cases is safety first. It is always safe to clear immediately
a61af66fc99e Initial load duke parents: diff changeset	1346 // within an Allocate, and then (maybe or maybe not) clear some more later.
a61af66fc99e Initial load duke parents: diff changeset	1347 if (!ZeroTLAB)
a61af66fc99e Initial load duke parents: diff changeset	1348 rawmem = ClearArrayNode::clear_memory(control, rawmem, object,
a61af66fc99e Initial load duke parents: diff changeset	1349 header_size, size_in_bytes,
a61af66fc99e Initial load duke parents: diff changeset	1350 &_igvn);
a61af66fc99e Initial load duke parents: diff changeset	1351 } else {
a61af66fc99e Initial load duke parents: diff changeset	1352 if (!init->is_complete()) {
a61af66fc99e Initial load duke parents: diff changeset	1353 // Try to win by zeroing only what the init does not store.
a61af66fc99e Initial load duke parents: diff changeset	1354 // We can also try to do some peephole optimizations,
a61af66fc99e Initial load duke parents: diff changeset	1355 // such as combining some adjacent subword stores.
a61af66fc99e Initial load duke parents: diff changeset	1356 rawmem = init->complete_stores(control, rawmem, object,
a61af66fc99e Initial load duke parents: diff changeset	1357 header_size, size_in_bytes, &_igvn);
a61af66fc99e Initial load duke parents: diff changeset	1358 }
a61af66fc99e Initial load duke parents: diff changeset	1359 // We have no more use for this link, since the AllocateNode goes away:
a61af66fc99e Initial load duke parents: diff changeset	1360 init->set_req(InitializeNode::RawAddress, top());
a61af66fc99e Initial load duke parents: diff changeset	1361 // (If we keep the link, it just confuses the register allocator,
a61af66fc99e Initial load duke parents: diff changeset	1362 // who thinks he sees a real use of the address by the membar.)
a61af66fc99e Initial load duke parents: diff changeset	1363 }
a61af66fc99e Initial load duke parents: diff changeset	1364
a61af66fc99e Initial load duke parents: diff changeset	1365 return rawmem;
a61af66fc99e Initial load duke parents: diff changeset	1366 }
a61af66fc99e Initial load duke parents: diff changeset	1367
a61af66fc99e Initial load duke parents: diff changeset	1368 // Generate prefetch instructions for next allocations.
a61af66fc99e Initial load duke parents: diff changeset	1369 Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
a61af66fc99e Initial load duke parents: diff changeset	1370 Node*& contended_phi_rawmem,
a61af66fc99e Initial load duke parents: diff changeset	1371 Node* old_eden_top, Node* new_eden_top,
a61af66fc99e Initial load duke parents: diff changeset	1372 Node* length) {
a61af66fc99e Initial load duke parents: diff changeset	1373 if( UseTLAB && AllocatePrefetchStyle == 2 ) {
a61af66fc99e Initial load duke parents: diff changeset	1374 // Generate prefetch allocation with watermark check.
a61af66fc99e Initial load duke parents: diff changeset	1375 // As an allocation hits the watermark, we will prefetch starting
a61af66fc99e Initial load duke parents: diff changeset	1376 // at a "distance" away from watermark.
a61af66fc99e Initial load duke parents: diff changeset	1377 enum { fall_in_path = 1, pf_path = 2 };
a61af66fc99e Initial load duke parents: diff changeset	1378
a61af66fc99e Initial load duke parents: diff changeset	1379 Node *pf_region = new (C, 3) RegionNode(3);
a61af66fc99e Initial load duke parents: diff changeset	1380 Node *pf_phi_rawmem = new (C, 3) PhiNode( pf_region, Type::MEMORY,
a61af66fc99e Initial load duke parents: diff changeset	1381 TypeRawPtr::BOTTOM );
a61af66fc99e Initial load duke parents: diff changeset	1382 // I/O is used for Prefetch
a61af66fc99e Initial load duke parents: diff changeset	1383 Node *pf_phi_abio = new (C, 3) PhiNode( pf_region, Type::ABIO );
a61af66fc99e Initial load duke parents: diff changeset	1384
a61af66fc99e Initial load duke parents: diff changeset	1385 Node *thread = new (C, 1) ThreadLocalNode();
a61af66fc99e Initial load duke parents: diff changeset	1386 transform_later(thread);
a61af66fc99e Initial load duke parents: diff changeset	1387
a61af66fc99e Initial load duke parents: diff changeset	1388 Node eden_pf_adr = new (C, 4) AddPNode( top()/not oop*/, thread,
a61af66fc99e Initial load duke parents: diff changeset	1389 _igvn.MakeConX(in_bytes(JavaThread::tlab_pf_top_offset())) );
a61af66fc99e Initial load duke parents: diff changeset	1390 transform_later(eden_pf_adr);
a61af66fc99e Initial load duke parents: diff changeset	1391
a61af66fc99e Initial load duke parents: diff changeset	1392 Node *old_pf_wm = new (C, 3) LoadPNode( needgc_false,
a61af66fc99e Initial load duke parents: diff changeset	1393 contended_phi_rawmem, eden_pf_adr,
a61af66fc99e Initial load duke parents: diff changeset	1394 TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM );
a61af66fc99e Initial load duke parents: diff changeset	1395 transform_later(old_pf_wm);
a61af66fc99e Initial load duke parents: diff changeset	1396
a61af66fc99e Initial load duke parents: diff changeset	1397 // check against new_eden_top
a61af66fc99e Initial load duke parents: diff changeset	1398 Node *need_pf_cmp = new (C, 3) CmpPNode( new_eden_top, old_pf_wm );
a61af66fc99e Initial load duke parents: diff changeset	1399 transform_later(need_pf_cmp);
a61af66fc99e Initial load duke parents: diff changeset	1400 Node *need_pf_bol = new (C, 2) BoolNode( need_pf_cmp, BoolTest::ge );
a61af66fc99e Initial load duke parents: diff changeset	1401 transform_later(need_pf_bol);
a61af66fc99e Initial load duke parents: diff changeset	1402 IfNode *need_pf_iff = new (C, 2) IfNode( needgc_false, need_pf_bol,
a61af66fc99e Initial load duke parents: diff changeset	1403 PROB_UNLIKELY_MAG(4), COUNT_UNKNOWN );
a61af66fc99e Initial load duke parents: diff changeset	1404 transform_later(need_pf_iff);
a61af66fc99e Initial load duke parents: diff changeset	1405
a61af66fc99e Initial load duke parents: diff changeset	1406 // true node, add prefetchdistance
a61af66fc99e Initial load duke parents: diff changeset	1407 Node *need_pf_true = new (C, 1) IfTrueNode( need_pf_iff );
a61af66fc99e Initial load duke parents: diff changeset	1408 transform_later(need_pf_true);
a61af66fc99e Initial load duke parents: diff changeset	1409
a61af66fc99e Initial load duke parents: diff changeset	1410 Node *need_pf_false = new (C, 1) IfFalseNode( need_pf_iff );
a61af66fc99e Initial load duke parents: diff changeset	1411 transform_later(need_pf_false);
a61af66fc99e Initial load duke parents: diff changeset	1412
a61af66fc99e Initial load duke parents: diff changeset	1413 Node *new_pf_wmt = new (C, 4) AddPNode( top(), old_pf_wm,
a61af66fc99e Initial load duke parents: diff changeset	1414 _igvn.MakeConX(AllocatePrefetchDistance) );
a61af66fc99e Initial load duke parents: diff changeset	1415 transform_later(new_pf_wmt );
a61af66fc99e Initial load duke parents: diff changeset	1416 new_pf_wmt->set_req(0, need_pf_true);
a61af66fc99e Initial load duke parents: diff changeset	1417
a61af66fc99e Initial load duke parents: diff changeset	1418 Node *store_new_wmt = new (C, 4) StorePNode( need_pf_true,
a61af66fc99e Initial load duke parents: diff changeset	1419 contended_phi_rawmem, eden_pf_adr,
a61af66fc99e Initial load duke parents: diff changeset	1420 TypeRawPtr::BOTTOM, new_pf_wmt );
a61af66fc99e Initial load duke parents: diff changeset	1421 transform_later(store_new_wmt);
a61af66fc99e Initial load duke parents: diff changeset	1422
a61af66fc99e Initial load duke parents: diff changeset	1423 // adding prefetches
a61af66fc99e Initial load duke parents: diff changeset	1424 pf_phi_abio->init_req( fall_in_path, i_o );
a61af66fc99e Initial load duke parents: diff changeset	1425
a61af66fc99e Initial load duke parents: diff changeset	1426 Node *prefetch_adr;
a61af66fc99e Initial load duke parents: diff changeset	1427 Node *prefetch;
a61af66fc99e Initial load duke parents: diff changeset	1428 uint lines = AllocatePrefetchDistance / AllocatePrefetchStepSize;
a61af66fc99e Initial load duke parents: diff changeset	1429 uint step_size = AllocatePrefetchStepSize;
a61af66fc99e Initial load duke parents: diff changeset	1430 uint distance = 0;
a61af66fc99e Initial load duke parents: diff changeset	1431
a61af66fc99e Initial load duke parents: diff changeset	1432 for ( uint i = 0; i < lines; i++ ) {
a61af66fc99e Initial load duke parents: diff changeset	1433 prefetch_adr = new (C, 4) AddPNode( old_pf_wm, new_pf_wmt,
a61af66fc99e Initial load duke parents: diff changeset	1434 _igvn.MakeConX(distance) );
a61af66fc99e Initial load duke parents: diff changeset	1435 transform_later(prefetch_adr);
a61af66fc99e Initial load duke parents: diff changeset	1436 prefetch = new (C, 3) PrefetchWriteNode( i_o, prefetch_adr );
a61af66fc99e Initial load duke parents: diff changeset	1437 transform_later(prefetch);
a61af66fc99e Initial load duke parents: diff changeset	1438 distance += step_size;
a61af66fc99e Initial load duke parents: diff changeset	1439 i_o = prefetch;
a61af66fc99e Initial load duke parents: diff changeset	1440 }
a61af66fc99e Initial load duke parents: diff changeset	1441 pf_phi_abio->set_req( pf_path, i_o );
a61af66fc99e Initial load duke parents: diff changeset	1442
a61af66fc99e Initial load duke parents: diff changeset	1443 pf_region->init_req( fall_in_path, need_pf_false );
a61af66fc99e Initial load duke parents: diff changeset	1444 pf_region->init_req( pf_path, need_pf_true );
a61af66fc99e Initial load duke parents: diff changeset	1445
a61af66fc99e Initial load duke parents: diff changeset	1446 pf_phi_rawmem->init_req( fall_in_path, contended_phi_rawmem );
a61af66fc99e Initial load duke parents: diff changeset	1447 pf_phi_rawmem->init_req( pf_path, store_new_wmt );
a61af66fc99e Initial load duke parents: diff changeset	1448
a61af66fc99e Initial load duke parents: diff changeset	1449 transform_later(pf_region);
a61af66fc99e Initial load duke parents: diff changeset	1450 transform_later(pf_phi_rawmem);
a61af66fc99e Initial load duke parents: diff changeset	1451 transform_later(pf_phi_abio);
a61af66fc99e Initial load duke parents: diff changeset	1452
a61af66fc99e Initial load duke parents: diff changeset	1453 needgc_false = pf_region;
a61af66fc99e Initial load duke parents: diff changeset	1454 contended_phi_rawmem = pf_phi_rawmem;
a61af66fc99e Initial load duke parents: diff changeset	1455 i_o = pf_phi_abio;
a61af66fc99e Initial load duke parents: diff changeset	1456 } else if( AllocatePrefetchStyle > 0 ) {
a61af66fc99e Initial load duke parents: diff changeset	1457 // Insert a prefetch for each allocation only on the fast-path
a61af66fc99e Initial load duke parents: diff changeset	1458 Node *prefetch_adr;
a61af66fc99e Initial load duke parents: diff changeset	1459 Node *prefetch;
a61af66fc99e Initial load duke parents: diff changeset	1460 // Generate several prefetch instructions only for arrays.
a61af66fc99e Initial load duke parents: diff changeset	1461 uint lines = (length != NULL) ? AllocatePrefetchLines : 1;
a61af66fc99e Initial load duke parents: diff changeset	1462 uint step_size = AllocatePrefetchStepSize;
a61af66fc99e Initial load duke parents: diff changeset	1463 uint distance = AllocatePrefetchDistance;
a61af66fc99e Initial load duke parents: diff changeset	1464 for ( uint i = 0; i < lines; i++ ) {
a61af66fc99e Initial load duke parents: diff changeset	1465 prefetch_adr = new (C, 4) AddPNode( old_eden_top, new_eden_top,
a61af66fc99e Initial load duke parents: diff changeset	1466 _igvn.MakeConX(distance) );
a61af66fc99e Initial load duke parents: diff changeset	1467 transform_later(prefetch_adr);
a61af66fc99e Initial load duke parents: diff changeset	1468 prefetch = new (C, 3) PrefetchWriteNode( i_o, prefetch_adr );
a61af66fc99e Initial load duke parents: diff changeset	1469 // Do not let it float too high, since if eden_top == eden_end,
a61af66fc99e Initial load duke parents: diff changeset	1470 // both might be null.
a61af66fc99e Initial load duke parents: diff changeset	1471 if( i == 0 ) { // Set control for first prefetch, next follows it
a61af66fc99e Initial load duke parents: diff changeset	1472 prefetch->init_req(0, needgc_false);
a61af66fc99e Initial load duke parents: diff changeset	1473 }
a61af66fc99e Initial load duke parents: diff changeset	1474 transform_later(prefetch);
a61af66fc99e Initial load duke parents: diff changeset	1475 distance += step_size;
a61af66fc99e Initial load duke parents: diff changeset	1476 i_o = prefetch;
a61af66fc99e Initial load duke parents: diff changeset	1477 }
a61af66fc99e Initial load duke parents: diff changeset	1478 }
a61af66fc99e Initial load duke parents: diff changeset	1479 return i_o;
a61af66fc99e Initial load duke parents: diff changeset	1480 }
a61af66fc99e Initial load duke parents: diff changeset	1481
a61af66fc99e Initial load duke parents: diff changeset	1482
a61af66fc99e Initial load duke parents: diff changeset	1483 void PhaseMacroExpand::expand_allocate(AllocateNode *alloc) {
a61af66fc99e Initial load duke parents: diff changeset	1484 expand_allocate_common(alloc, NULL,
a61af66fc99e Initial load duke parents: diff changeset	1485 OptoRuntime::new_instance_Type(),
a61af66fc99e Initial load duke parents: diff changeset	1486 OptoRuntime::new_instance_Java());
a61af66fc99e Initial load duke parents: diff changeset	1487 }
a61af66fc99e Initial load duke parents: diff changeset	1488
a61af66fc99e Initial load duke parents: diff changeset	1489 void PhaseMacroExpand::expand_allocate_array(AllocateArrayNode *alloc) {
a61af66fc99e Initial load duke parents: diff changeset	1490 Node* length = alloc->in(AllocateNode::ALength);
a61af66fc99e Initial load duke parents: diff changeset	1491 expand_allocate_common(alloc, length,
a61af66fc99e Initial load duke parents: diff changeset	1492 OptoRuntime::new_array_Type(),
a61af66fc99e Initial load duke parents: diff changeset	1493 OptoRuntime::new_array_Java());
a61af66fc99e Initial load duke parents: diff changeset	1494 }
a61af66fc99e Initial load duke parents: diff changeset	1495
a61af66fc99e Initial load duke parents: diff changeset	1496
a61af66fc99e Initial load duke parents: diff changeset	1497 // we have determined that this lock/unlock can be eliminated, we simply
a61af66fc99e Initial load duke parents: diff changeset	1498 // eliminate the node without expanding it.
a61af66fc99e Initial load duke parents: diff changeset	1499 //
a61af66fc99e Initial load duke parents: diff changeset	1500 // Note: The membar's associated with the lock/unlock are currently not
a61af66fc99e Initial load duke parents: diff changeset	1501 // eliminated. This should be investigated as a future enhancement.
a61af66fc99e Initial load duke parents: diff changeset	1502 //
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1503 bool PhaseMacroExpand::eliminate_locking_node(AbstractLockNode *alock) {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1504
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1505 if (!alock->is_eliminated()) {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1506 return false;
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1507 }
460 424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1508 if (alock->is_Lock() && !alock->is_coarsened()) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1509 // Create new "eliminated" BoxLock node and use it
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1510 // in monitor debug info for the same object.
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1511 BoxLockNode* oldbox = alock->box_node()->as_BoxLock();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1512 Node* obj = alock->obj_node();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1513 if (!oldbox->is_eliminated()) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1514 BoxLockNode* newbox = oldbox->clone()->as_BoxLock();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1515 newbox->set_eliminated();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1516 transform_later(newbox);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1517 // Replace old box node with new box for all users
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1518 // of the same object.
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1519 for (uint i = 0; i < oldbox->outcnt();) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1520
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1521 bool next_edge = true;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1522 Node* u = oldbox->raw_out(i);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1523 if (u == alock) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1524 i++;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1525 continue; // It will be removed below
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1526 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1527 if (u->is_Lock() &&
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1528 u->as_Lock()->obj_node() == obj &&
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1529 // oldbox could be referenced in debug info also
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1530 u->as_Lock()->box_node() == oldbox) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1531 assert(u->as_Lock()->is_eliminated(), "sanity");
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1532 _igvn.hash_delete(u);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1533 u->set_req(TypeFunc::Parms + 1, newbox);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1534 next_edge = false;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1535 #ifdef ASSERT
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1536 } else if (u->is_Unlock() && u->as_Unlock()->obj_node() == obj) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1537 assert(u->as_Unlock()->is_eliminated(), "sanity");
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1538 #endif
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1539 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1540 // Replace old box in monitor debug info.
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1541 if (u->is_SafePoint() && u->as_SafePoint()->jvms()) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1542 SafePointNode* sfn = u->as_SafePoint();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1543 JVMState* youngest_jvms = sfn->jvms();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1544 int max_depth = youngest_jvms->depth();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1545 for (int depth = 1; depth <= max_depth; depth++) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1546 JVMState* jvms = youngest_jvms->of_depth(depth);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1547 int num_mon = jvms->nof_monitors();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1548 // Loop over monitors
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1549 for (int idx = 0; idx < num_mon; idx++) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1550 Node* obj_node = sfn->monitor_obj(jvms, idx);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1551 Node* box_node = sfn->monitor_box(jvms, idx);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1552 if (box_node == oldbox && obj_node == obj) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1553 int j = jvms->monitor_box_offset(idx);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1554 _igvn.hash_delete(u);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1555 u->set_req(j, newbox);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1556 next_edge = false;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1557 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1558 } // for (int idx = 0;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1559 } // for (int depth = 1;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1560 } // if (u->is_SafePoint()
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1561 if (next_edge) i++;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1562 } // for (uint i = 0; i < oldbox->outcnt();)
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1563 } // if (!oldbox->is_eliminated())
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1564 } // if (alock->is_Lock() && !lock->is_coarsened())
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1565
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1566 #ifndef PRODUCT
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1567 if (PrintEliminateLocks) {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1568 if (alock->is_Lock()) {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1569 tty->print_cr("++++ Eliminating: %d Lock", alock->_idx);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1570 } else {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1571 tty->print_cr("++++ Eliminating: %d Unlock", alock->_idx);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1572 }
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1573 }
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1574 #endif
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1575
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1576 Node* mem = alock->in(TypeFunc::Memory);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1577 Node* ctrl = alock->in(TypeFunc::Control);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1578
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1579 extract_call_projections(alock);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1580 // There are 2 projections from the lock. The lock node will
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1581 // be deleted when its last use is subsumed below.
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1582 assert(alock->outcnt() == 2 &&
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1583 _fallthroughproj != NULL &&
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1584 _memproj_fallthrough != NULL,
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1585 "Unexpected projections from Lock/Unlock");
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1586
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1587 Node* fallthroughproj = _fallthroughproj;
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1588 Node* memproj_fallthrough = _memproj_fallthrough;
0 a61af66fc99e Initial load duke parents: diff changeset	1589
a61af66fc99e Initial load duke parents: diff changeset	1590 // The memory projection from a lock/unlock is RawMem
a61af66fc99e Initial load duke parents: diff changeset	1591 // The input to a Lock is merged memory, so extract its RawMem input
a61af66fc99e Initial load duke parents: diff changeset	1592 // (unless the MergeMem has been optimized away.)
a61af66fc99e Initial load duke parents: diff changeset	1593 if (alock->is_Lock()) {
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1594 // Seach for MemBarAcquire node and delete it also.
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1595 MemBarNode* membar = fallthroughproj->unique_ctrl_out()->as_MemBar();
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1596 assert(membar != NULL && membar->Opcode() == Op_MemBarAcquire, "");
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1597 Node* ctrlproj = membar->proj_out(TypeFunc::Control);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1598 Node* memproj = membar->proj_out(TypeFunc::Memory);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1599 _igvn.hash_delete(ctrlproj);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1600 _igvn.subsume_node(ctrlproj, fallthroughproj);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1601 _igvn.hash_delete(memproj);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1602 _igvn.subsume_node(memproj, memproj_fallthrough);
460 424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1603
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1604 // Delete FastLock node also if this Lock node is unique user
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1605 // (a loop peeling may clone a Lock node).
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1606 Node* flock = alock->as_Lock()->fastlock_node();
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1607 if (flock->outcnt() == 1) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1608 assert(flock->unique_out() == alock, "sanity");
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1609 _igvn.hash_delete(flock);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1610 _igvn.subsume_node(flock, top());
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1611 }
0 a61af66fc99e Initial load duke parents: diff changeset	1612 }
a61af66fc99e Initial load duke parents: diff changeset	1613
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1614 // Seach for MemBarRelease node and delete it also.
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1615 if (alock->is_Unlock() && ctrl != NULL && ctrl->is_Proj() &&
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1616 ctrl->in(0)->is_MemBar()) {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1617 MemBarNode* membar = ctrl->in(0)->as_MemBar();
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1618 assert(membar->Opcode() == Op_MemBarRelease &&
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1619 mem->is_Proj() && membar == mem->in(0), "");
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1620 _igvn.hash_delete(fallthroughproj);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1621 _igvn.subsume_node(fallthroughproj, ctrl);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1622 _igvn.hash_delete(memproj_fallthrough);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1623 _igvn.subsume_node(memproj_fallthrough, mem);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1624 fallthroughproj = ctrl;
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1625 memproj_fallthrough = mem;
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1626 ctrl = membar->in(TypeFunc::Control);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1627 mem = membar->in(TypeFunc::Memory);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1628 }
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1629
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1630 _igvn.hash_delete(fallthroughproj);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1631 _igvn.subsume_node(fallthroughproj, ctrl);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1632 _igvn.hash_delete(memproj_fallthrough);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1633 _igvn.subsume_node(memproj_fallthrough, mem);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1634 return true;
0 a61af66fc99e Initial load duke parents: diff changeset	1635 }
a61af66fc99e Initial load duke parents: diff changeset	1636
a61af66fc99e Initial load duke parents: diff changeset	1637
a61af66fc99e Initial load duke parents: diff changeset	1638 //------------------------------expand_lock_node----------------------
a61af66fc99e Initial load duke parents: diff changeset	1639 void PhaseMacroExpand::expand_lock_node(LockNode *lock) {
a61af66fc99e Initial load duke parents: diff changeset	1640
a61af66fc99e Initial load duke parents: diff changeset	1641 Node* ctrl = lock->in(TypeFunc::Control);
a61af66fc99e Initial load duke parents: diff changeset	1642 Node* mem = lock->in(TypeFunc::Memory);
a61af66fc99e Initial load duke parents: diff changeset	1643 Node* obj = lock->obj_node();
a61af66fc99e Initial load duke parents: diff changeset	1644 Node* box = lock->box_node();
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1645 Node* flock = lock->fastlock_node();
0 a61af66fc99e Initial load duke parents: diff changeset	1646
a61af66fc99e Initial load duke parents: diff changeset	1647 // Make the merge point
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1648 Node *region;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1649 Node *mem_phi;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1650 Node *slow_path;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1651
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1652 if (UseOptoBiasInlining) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1653 /*
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1654 * See the full descrition in MacroAssembler::biased_locking_enter().
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1655 *
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1656 * if( (mark_word & biased_lock_mask) == biased_lock_pattern ) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1657 * // The object is biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1658 * proto_node = klass->prototype_header;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1659 * o_node = thread \| proto_node;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1660 * x_node = o_node ^ mark_word;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1661 * if( (x_node & ~age_mask) == 0 ) { // Biased to the current thread ?
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1662 * // Done.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1663 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1664 * if( (x_node & biased_lock_mask) != 0 ) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1665 * // The klass's prototype header is no longer biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1666 * cas(&mark_word, mark_word, proto_node)
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1667 * goto cas_lock;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1668 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1669 * // The klass's prototype header is still biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1670 * if( (x_node & epoch_mask) != 0 ) { // Expired epoch?
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1671 * old = mark_word;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1672 * new = o_node;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1673 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1674 * // Different thread or anonymous biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1675 * old = mark_word & (epoch_mask \| age_mask \| biased_lock_mask);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1676 * new = thread \| old;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1677 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1678 * // Try to rebias.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1679 * if( cas(&mark_word, old, new) == 0 ) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1680 * // Done.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1681 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1682 * goto slow_path; // Failed.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1683 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1684 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1685 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1686 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1687 * // The object is not biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1688 * cas_lock:
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1689 * if( FastLock(obj) == 0 ) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1690 * // Done.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1691 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1692 * slow_path:
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1693 * OptoRuntime::complete_monitor_locking_Java(obj);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1694 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1695 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1696 */
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1697
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1698 region = new (C, 5) RegionNode(5);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1699 // create a Phi for the memory state
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1700 mem_phi = new (C, 5) PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1701
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1702 Node* fast_lock_region = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1703 Node* fast_lock_mem_phi = new (C, 3) PhiNode( fast_lock_region, Type::MEMORY, TypeRawPtr::BOTTOM);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1704
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1705 // First, check mark word for the biased lock pattern.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1706 Node* mark_node = make_load(ctrl, mem, obj, oopDesc::mark_offset_in_bytes(), TypeX_X, TypeX_X->basic_type());
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1707
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1708 // Get fast path - mark word has the biased lock pattern.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1709 ctrl = opt_bits_test(ctrl, fast_lock_region, 1, mark_node,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1710 markOopDesc::biased_lock_mask_in_place,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1711 markOopDesc::biased_lock_pattern, true);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1712 // fast_lock_region->in(1) is set to slow path.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1713 fast_lock_mem_phi->init_req(1, mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1714
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1715 // Now check that the lock is biased to the current thread and has
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1716 // the same epoch and bias as Klass::_prototype_header.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1717
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1718 // Special-case a fresh allocation to avoid building nodes:
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1719 Node* klass_node = AllocateNode::Ideal_klass(obj, &_igvn);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1720 if (klass_node == NULL) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1721 Node* k_adr = basic_plus_adr(obj, oopDesc::klass_offset_in_bytes());
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1722 klass_node = transform_later( LoadKlassNode::make(_igvn, mem, k_adr, _igvn.type(k_adr)->is_ptr()) );
490 dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code" kvn parents: 460 diff changeset	1723 #ifdef _LP64
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code" kvn parents: 460 diff changeset	1724 if (UseCompressedOops && klass_node->is_DecodeN()) {
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code" kvn parents: 460 diff changeset	1725 assert(klass_node->in(1)->Opcode() == Op_LoadNKlass, "sanity");
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code" kvn parents: 460 diff changeset	1726 klass_node->in(1)->init_req(0, ctrl);
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code" kvn parents: 460 diff changeset	1727 } else
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code" kvn parents: 460 diff changeset	1728 #endif
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code" kvn parents: 460 diff changeset	1729 klass_node->init_req(0, ctrl);
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1730 }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1731 Node *proto_node = make_load(ctrl, mem, klass_node, Klass::prototype_header_offset_in_bytes() + sizeof(oopDesc), TypeX_X, TypeX_X->basic_type());
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1732
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1733 Node* thread = transform_later(new (C, 1) ThreadLocalNode());
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1734 Node* cast_thread = transform_later(new (C, 2) CastP2XNode(ctrl, thread));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1735 Node* o_node = transform_later(new (C, 3) OrXNode(cast_thread, proto_node));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1736 Node* x_node = transform_later(new (C, 3) XorXNode(o_node, mark_node));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1737
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1738 // Get slow path - mark word does NOT match the value.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1739 Node* not_biased_ctrl = opt_bits_test(ctrl, region, 3, x_node,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1740 (~markOopDesc::age_mask_in_place), 0);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1741 // region->in(3) is set to fast path - the object is biased to the current thread.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1742 mem_phi->init_req(3, mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1743
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1744
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1745 // Mark word does NOT match the value (thread \| Klass::_prototype_header).
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1746
0 a61af66fc99e Initial load duke parents: diff changeset	1747
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1748 // First, check biased pattern.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1749 // Get fast path - _prototype_header has the same biased lock pattern.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1750 ctrl = opt_bits_test(not_biased_ctrl, fast_lock_region, 2, x_node,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1751 markOopDesc::biased_lock_mask_in_place, 0, true);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1752
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1753 not_biased_ctrl = fast_lock_region->in(2); // Slow path
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1754 // fast_lock_region->in(2) - the prototype header is no longer biased
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1755 // and we have to revoke the bias on this object.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1756 // We are going to try to reset the mark of this object to the prototype
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1757 // value and fall through to the CAS-based locking scheme.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1758 Node* adr = basic_plus_adr(obj, oopDesc::mark_offset_in_bytes());
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1759 Node* cas = new (C, 5) StoreXConditionalNode(not_biased_ctrl, mem, adr,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1760 proto_node, mark_node);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1761 transform_later(cas);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1762 Node* proj = transform_later( new (C, 1) SCMemProjNode(cas));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1763 fast_lock_mem_phi->init_req(2, proj);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1764
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1765
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1766 // Second, check epoch bits.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1767 Node* rebiased_region = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1768 Node* old_phi = new (C, 3) PhiNode( rebiased_region, TypeX_X);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1769 Node* new_phi = new (C, 3) PhiNode( rebiased_region, TypeX_X);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1770
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1771 // Get slow path - mark word does NOT match epoch bits.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1772 Node* epoch_ctrl = opt_bits_test(ctrl, rebiased_region, 1, x_node,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1773 markOopDesc::epoch_mask_in_place, 0);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1774 // The epoch of the current bias is not valid, attempt to rebias the object
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1775 // toward the current thread.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1776 rebiased_region->init_req(2, epoch_ctrl);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1777 old_phi->init_req(2, mark_node);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1778 new_phi->init_req(2, o_node);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1779
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1780 // rebiased_region->in(1) is set to fast path.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1781 // The epoch of the current bias is still valid but we know
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1782 // nothing about the owner; it might be set or it might be clear.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1783 Node* cmask = MakeConX(markOopDesc::biased_lock_mask_in_place \|
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1784 markOopDesc::age_mask_in_place \|
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1785 markOopDesc::epoch_mask_in_place);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1786 Node* old = transform_later(new (C, 3) AndXNode(mark_node, cmask));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1787 cast_thread = transform_later(new (C, 2) CastP2XNode(ctrl, thread));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1788 Node* new_mark = transform_later(new (C, 3) OrXNode(cast_thread, old));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1789 old_phi->init_req(1, old);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1790 new_phi->init_req(1, new_mark);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1791
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1792 transform_later(rebiased_region);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1793 transform_later(old_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1794 transform_later(new_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1795
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1796 // Try to acquire the bias of the object using an atomic operation.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1797 // If this fails we will go in to the runtime to revoke the object's bias.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1798 cas = new (C, 5) StoreXConditionalNode(rebiased_region, mem, adr,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1799 new_phi, old_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1800 transform_later(cas);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1801 proj = transform_later( new (C, 1) SCMemProjNode(cas));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1802
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1803 // Get slow path - Failed to CAS.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1804 not_biased_ctrl = opt_bits_test(rebiased_region, region, 4, cas, 0, 0);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1805 mem_phi->init_req(4, proj);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1806 // region->in(4) is set to fast path - the object is rebiased to the current thread.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1807
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1808 // Failed to CAS.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1809 slow_path = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1810 Node *slow_mem = new (C, 3) PhiNode( slow_path, Type::MEMORY, TypeRawPtr::BOTTOM);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1811
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1812 slow_path->init_req(1, not_biased_ctrl); // Capture slow-control
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1813 slow_mem->init_req(1, proj);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1814
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1815 // Call CAS-based locking scheme (FastLock node).
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1816
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1817 transform_later(fast_lock_region);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1818 transform_later(fast_lock_mem_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1819
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1820 // Get slow path - FastLock failed to lock the object.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1821 ctrl = opt_bits_test(fast_lock_region, region, 2, flock, 0, 0);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1822 mem_phi->init_req(2, fast_lock_mem_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1823 // region->in(2) is set to fast path - the object is locked to the current thread.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1824
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1825 slow_path->init_req(2, ctrl); // Capture slow-control
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1826 slow_mem->init_req(2, fast_lock_mem_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1827
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1828 transform_later(slow_path);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1829 transform_later(slow_mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1830 // Reset lock's memory edge.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1831 lock->set_req(TypeFunc::Memory, slow_mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1832
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1833 } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1834 region = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1835 // create a Phi for the memory state
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1836 mem_phi = new (C, 3) PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1837
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1838 // Optimize test; set region slot 2
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1839 slow_path = opt_bits_test(ctrl, region, 2, flock, 0, 0);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1840 mem_phi->init_req(2, mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1841 }
0 a61af66fc99e Initial load duke parents: diff changeset	1842
a61af66fc99e Initial load duke parents: diff changeset	1843 // Make slow path call
a61af66fc99e Initial load duke parents: diff changeset	1844 CallNode call = make_slow_call( (CallNode ) lock, OptoRuntime::complete_monitor_enter_Type(), OptoRuntime::complete_monitor_locking_Java(), NULL, slow_path, obj, box );
a61af66fc99e Initial load duke parents: diff changeset	1845
a61af66fc99e Initial load duke parents: diff changeset	1846 extract_call_projections(call);
a61af66fc99e Initial load duke parents: diff changeset	1847
a61af66fc99e Initial load duke parents: diff changeset	1848 // Slow path can only throw asynchronous exceptions, which are always
a61af66fc99e Initial load duke parents: diff changeset	1849 // de-opted. So the compiler thinks the slow-call can never throw an
a61af66fc99e Initial load duke parents: diff changeset	1850 // exception. If it DOES throw an exception we would need the debug
a61af66fc99e Initial load duke parents: diff changeset	1851 // info removed first (since if it throws there is no monitor).
a61af66fc99e Initial load duke parents: diff changeset	1852 assert ( _ioproj_fallthrough == NULL && _ioproj_catchall == NULL &&
a61af66fc99e Initial load duke parents: diff changeset	1853 _memproj_catchall == NULL && _catchallcatchproj == NULL, "Unexpected projection from Lock");
a61af66fc99e Initial load duke parents: diff changeset	1854
a61af66fc99e Initial load duke parents: diff changeset	1855 // Capture slow path
a61af66fc99e Initial load duke parents: diff changeset	1856 // disconnect fall-through projection from call and create a new one
a61af66fc99e Initial load duke parents: diff changeset	1857 // hook up users of fall-through projection to region
a61af66fc99e Initial load duke parents: diff changeset	1858 Node *slow_ctrl = _fallthroughproj->clone();
a61af66fc99e Initial load duke parents: diff changeset	1859 transform_later(slow_ctrl);
a61af66fc99e Initial load duke parents: diff changeset	1860 _igvn.hash_delete(_fallthroughproj);
a61af66fc99e Initial load duke parents: diff changeset	1861 _fallthroughproj->disconnect_inputs(NULL);
a61af66fc99e Initial load duke parents: diff changeset	1862 region->init_req(1, slow_ctrl);
a61af66fc99e Initial load duke parents: diff changeset	1863 // region inputs are now complete
a61af66fc99e Initial load duke parents: diff changeset	1864 transform_later(region);
a61af66fc99e Initial load duke parents: diff changeset	1865 _igvn.subsume_node(_fallthroughproj, region);
a61af66fc99e Initial load duke parents: diff changeset	1866
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1867 Node *memproj = transform_later( new(C, 1) ProjNode(call, TypeFunc::Memory) );
0 a61af66fc99e Initial load duke parents: diff changeset	1868 mem_phi->init_req(1, memproj );
a61af66fc99e Initial load duke parents: diff changeset	1869 transform_later(mem_phi);
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1870 _igvn.hash_delete(_memproj_fallthrough);
0 a61af66fc99e Initial load duke parents: diff changeset	1871 _igvn.subsume_node(_memproj_fallthrough, mem_phi);
a61af66fc99e Initial load duke parents: diff changeset	1872 }
a61af66fc99e Initial load duke parents: diff changeset	1873
a61af66fc99e Initial load duke parents: diff changeset	1874 //------------------------------expand_unlock_node----------------------
a61af66fc99e Initial load duke parents: diff changeset	1875 void PhaseMacroExpand::expand_unlock_node(UnlockNode *unlock) {
a61af66fc99e Initial load duke parents: diff changeset	1876
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1877 Node* ctrl = unlock->in(TypeFunc::Control);
0 a61af66fc99e Initial load duke parents: diff changeset	1878 Node* mem = unlock->in(TypeFunc::Memory);
a61af66fc99e Initial load duke parents: diff changeset	1879 Node* obj = unlock->obj_node();
a61af66fc99e Initial load duke parents: diff changeset	1880 Node* box = unlock->box_node();
a61af66fc99e Initial load duke parents: diff changeset	1881
a61af66fc99e Initial load duke parents: diff changeset	1882 // No need for a null check on unlock
a61af66fc99e Initial load duke parents: diff changeset	1883
a61af66fc99e Initial load duke parents: diff changeset	1884 // Make the merge point
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1885 Node *region;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1886 Node *mem_phi;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1887
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1888 if (UseOptoBiasInlining) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1889 // Check for biased locking unlock case, which is a no-op.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1890 // See the full descrition in MacroAssembler::biased_locking_exit().
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1891 region = new (C, 4) RegionNode(4);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1892 // create a Phi for the memory state
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1893 mem_phi = new (C, 4) PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1894 mem_phi->init_req(3, mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1895
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1896 Node* mark_node = make_load(ctrl, mem, obj, oopDesc::mark_offset_in_bytes(), TypeX_X, TypeX_X->basic_type());
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1897 ctrl = opt_bits_test(ctrl, region, 3, mark_node,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1898 markOopDesc::biased_lock_mask_in_place,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1899 markOopDesc::biased_lock_pattern);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1900 } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1901 region = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1902 // create a Phi for the memory state
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1903 mem_phi = new (C, 3) PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1904 }
0 a61af66fc99e Initial load duke parents: diff changeset	1905
a61af66fc99e Initial load duke parents: diff changeset	1906 FastUnlockNode *funlock = new (C, 3) FastUnlockNode( ctrl, obj, box );
a61af66fc99e Initial load duke parents: diff changeset	1907 funlock = transform_later( funlock )->as_FastUnlock();
a61af66fc99e Initial load duke parents: diff changeset	1908 // Optimize test; set region slot 2
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1909 Node *slow_path = opt_bits_test(ctrl, region, 2, funlock, 0, 0);
0 a61af66fc99e Initial load duke parents: diff changeset	1910
a61af66fc99e Initial load duke parents: diff changeset	1911 CallNode call = make_slow_call( (CallNode ) unlock, OptoRuntime::complete_monitor_exit_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::complete_monitor_unlocking_C), "complete_monitor_unlocking_C", slow_path, obj, box );
a61af66fc99e Initial load duke parents: diff changeset	1912
a61af66fc99e Initial load duke parents: diff changeset	1913 extract_call_projections(call);
a61af66fc99e Initial load duke parents: diff changeset	1914
a61af66fc99e Initial load duke parents: diff changeset	1915 assert ( _ioproj_fallthrough == NULL && _ioproj_catchall == NULL &&
a61af66fc99e Initial load duke parents: diff changeset	1916 _memproj_catchall == NULL && _catchallcatchproj == NULL, "Unexpected projection from Lock");
a61af66fc99e Initial load duke parents: diff changeset	1917
a61af66fc99e Initial load duke parents: diff changeset	1918 // No exceptions for unlocking
a61af66fc99e Initial load duke parents: diff changeset	1919 // Capture slow path
a61af66fc99e Initial load duke parents: diff changeset	1920 // disconnect fall-through projection from call and create a new one
a61af66fc99e Initial load duke parents: diff changeset	1921 // hook up users of fall-through projection to region
a61af66fc99e Initial load duke parents: diff changeset	1922 Node *slow_ctrl = _fallthroughproj->clone();
a61af66fc99e Initial load duke parents: diff changeset	1923 transform_later(slow_ctrl);
a61af66fc99e Initial load duke parents: diff changeset	1924 _igvn.hash_delete(_fallthroughproj);
a61af66fc99e Initial load duke parents: diff changeset	1925 _fallthroughproj->disconnect_inputs(NULL);
a61af66fc99e Initial load duke parents: diff changeset	1926 region->init_req(1, slow_ctrl);
a61af66fc99e Initial load duke parents: diff changeset	1927 // region inputs are now complete
a61af66fc99e Initial load duke parents: diff changeset	1928 transform_later(region);
a61af66fc99e Initial load duke parents: diff changeset	1929 _igvn.subsume_node(_fallthroughproj, region);
a61af66fc99e Initial load duke parents: diff changeset	1930
a61af66fc99e Initial load duke parents: diff changeset	1931 Node *memproj = transform_later( new(C, 1) ProjNode(call, TypeFunc::Memory) );
a61af66fc99e Initial load duke parents: diff changeset	1932 mem_phi->init_req(1, memproj );
a61af66fc99e Initial load duke parents: diff changeset	1933 mem_phi->init_req(2, mem);
a61af66fc99e Initial load duke parents: diff changeset	1934 transform_later(mem_phi);
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1935 _igvn.hash_delete(_memproj_fallthrough);
0 a61af66fc99e Initial load duke parents: diff changeset	1936 _igvn.subsume_node(_memproj_fallthrough, mem_phi);
a61af66fc99e Initial load duke parents: diff changeset	1937 }
a61af66fc99e Initial load duke parents: diff changeset	1938
a61af66fc99e Initial load duke parents: diff changeset	1939 //------------------------------expand_macro_nodes----------------------
a61af66fc99e Initial load duke parents: diff changeset	1940 // Returns true if a failure occurred.
a61af66fc99e Initial load duke parents: diff changeset	1941 bool PhaseMacroExpand::expand_macro_nodes() {
a61af66fc99e Initial load duke parents: diff changeset	1942 if (C->macro_count() == 0)
a61af66fc99e Initial load duke parents: diff changeset	1943 return false;
460 424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1944 // First, attempt to eliminate locks
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1945 bool progress = true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1946 while (progress) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1947 progress = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1948 for (int i = C->macro_count(); i > 0; i--) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1949 Node * n = C->macro_node(i-1);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1950 bool success = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1951 debug_only(int old_macro_count = C->macro_count(););
460 424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1952 if (n->is_AbstractLock()) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1953 success = eliminate_locking_node(n->as_AbstractLock());
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1954 } else if (n->Opcode() == Op_Opaque1 \|\| n->Opcode() == Op_Opaque2) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1955 _igvn.add_users_to_worklist(n);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1956 _igvn.hash_delete(n);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1957 _igvn.subsume_node(n, n->in(1));
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1958 success = true;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1959 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1960 assert(success == (C->macro_count() < old_macro_count), "elimination reduces macro count");
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1961 progress = progress \|\| success;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1962 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1963 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1964 // Next, attempt to eliminate allocations
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1965 progress = true;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1966 while (progress) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1967 progress = false;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1968 for (int i = C->macro_count(); i > 0; i--) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1969 Node * n = C->macro_node(i-1);
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1970 bool success = false;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1971 debug_only(int old_macro_count = C->macro_count(););
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1972 switch (n->class_id()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1973 case Node::Class_Allocate:
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1974 case Node::Class_AllocateArray:
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1975 success = eliminate_allocate_node(n->as_Allocate());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1976 break;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1977 case Node::Class_Lock:
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1978 case Node::Class_Unlock:
460 424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1979 assert(!n->as_AbstractLock()->is_eliminated(), "sanity");
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1980 break;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1981 default:
460 424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1982 assert(false, "unknown node type in macro list");
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1983 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1984 assert(success == (C->macro_count() < old_macro_count), "elimination reduces macro count");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1985 progress = progress \|\| success;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1986 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1987 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1988 // Make sure expansion will not cause node limit to be exceeded.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1989 // Worst case is a macro node gets expanded into about 50 nodes.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1990 // Allow 50% more for optimization.
0 a61af66fc99e Initial load duke parents: diff changeset	1991 if (C->check_node_count(C->macro_count() * 75, "out of nodes before macro expansion" ) )
a61af66fc99e Initial load duke parents: diff changeset	1992 return true;
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1993
0 a61af66fc99e Initial load duke parents: diff changeset	1994 // expand "macro" nodes
a61af66fc99e Initial load duke parents: diff changeset	1995 // nodes are removed from the macro list as they are processed
a61af66fc99e Initial load duke parents: diff changeset	1996 while (C->macro_count() > 0) {
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1997 int macro_count = C->macro_count();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	1998 Node * n = C->macro_node(macro_count-1);
0 a61af66fc99e Initial load duke parents: diff changeset	1999 assert(n->is_macro(), "only macro nodes expected here");
a61af66fc99e Initial load duke parents: diff changeset	2000 if (_igvn.type(n) == Type::TOP \|\| n->in(0)->is_top() ) {
a61af66fc99e Initial load duke parents: diff changeset	2001 // node is unreachable, so don't try to expand it
a61af66fc99e Initial load duke parents: diff changeset	2002 C->remove_macro_node(n);
a61af66fc99e Initial load duke parents: diff changeset	2003 continue;
a61af66fc99e Initial load duke parents: diff changeset	2004 }
a61af66fc99e Initial load duke parents: diff changeset	2005 switch (n->class_id()) {
a61af66fc99e Initial load duke parents: diff changeset	2006 case Node::Class_Allocate:
a61af66fc99e Initial load duke parents: diff changeset	2007 expand_allocate(n->as_Allocate());
a61af66fc99e Initial load duke parents: diff changeset	2008 break;
a61af66fc99e Initial load duke parents: diff changeset	2009 case Node::Class_AllocateArray:
a61af66fc99e Initial load duke parents: diff changeset	2010 expand_allocate_array(n->as_AllocateArray());
a61af66fc99e Initial load duke parents: diff changeset	2011 break;
a61af66fc99e Initial load duke parents: diff changeset	2012 case Node::Class_Lock:
a61af66fc99e Initial load duke parents: diff changeset	2013 expand_lock_node(n->as_Lock());
a61af66fc99e Initial load duke parents: diff changeset	2014 break;
a61af66fc99e Initial load duke parents: diff changeset	2015 case Node::Class_Unlock:
a61af66fc99e Initial load duke parents: diff changeset	2016 expand_unlock_node(n->as_Unlock());
a61af66fc99e Initial load duke parents: diff changeset	2017 break;
a61af66fc99e Initial load duke parents: diff changeset	2018 default:
a61af66fc99e Initial load duke parents: diff changeset	2019 assert(false, "unknown node type in macro list");
a61af66fc99e Initial load duke parents: diff changeset	2020 }
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2021 assert(C->macro_count() < macro_count, "must have deleted a node from macro list");
0 a61af66fc99e Initial load duke parents: diff changeset	2022 if (C->failing()) return true;
a61af66fc99e Initial load duke parents: diff changeset	2023 }
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 73 diff changeset	2024
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 73 diff changeset	2025 _igvn.set_delay_transform(false);
0 a61af66fc99e Initial load duke parents: diff changeset	2026 _igvn.optimize();
a61af66fc99e Initial load duke parents: diff changeset	2027 return false;
a61af66fc99e Initial load duke parents: diff changeset	2028 }

Mercurial > hg > truffle

annotate src/share/vm/opto/macro.cpp @ 565:7fe62bb75bf4