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

annotate src/share/vm/opto/macro.cpp @ 6725:da91efe96a93

6964458: Reimplement class meta-data storage to use native memory Summary: Remove PermGen, allocate meta-data in metaspace linked to class loaders, rewrite GC walking, rewrite and rename metadata to be C++ classes Reviewed-by: jmasa, stefank, never, coleenp, kvn, brutisso, mgerdin, dholmes, jrose, twisti, roland Contributed-by: jmasa <jon.masamitsu@oracle.com>, stefank <stefan.karlsson@oracle.com>, mgerdin <mikael.gerdin@oracle.com>, never <tom.rodriguez@oracle.com>

author	coleenp
date	Sat, 01 Sep 2012 13:25:18 -0400
parents	d2a62e0f25eb
children	e626685e9f6c

rev	line source
0 a61af66fc99e Initial load duke parents: diff changeset	1 /*
6725 da91efe96a93 6964458: Reimplement class meta-data storage to use native memory coleenp parents: 6197 diff changeset	2 * Copyright (c) 2005, 2012, Oracle and/or its affiliates. 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 *
1552 c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories trims parents: 1367 diff changeset	19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories trims parents: 1367 diff changeset	20 * or visit www.oracle.com if you need additional information or have any
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories trims parents: 1367 diff changeset	21 * questions.
0 a61af66fc99e Initial load duke parents: diff changeset	22 *
a61af66fc99e Initial load duke parents: diff changeset	23 */
a61af66fc99e Initial load duke parents: diff changeset	24
1972 f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	25 #include "precompiled.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	26 #include "compiler/compileLog.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	27 #include "libadt/vectset.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	28 #include "opto/addnode.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	29 #include "opto/callnode.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	30 #include "opto/cfgnode.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	31 #include "opto/compile.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	32 #include "opto/connode.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	33 #include "opto/locknode.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	34 #include "opto/loopnode.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	35 #include "opto/macro.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	36 #include "opto/memnode.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	37 #include "opto/node.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	38 #include "opto/phaseX.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	39 #include "opto/rootnode.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	40 #include "opto/runtime.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	41 #include "opto/subnode.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	42 #include "opto/type.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1682 diff changeset	43 #include "runtime/sharedRuntime.hpp"
0 a61af66fc99e Initial load duke parents: diff changeset	44
a61af66fc99e Initial load duke parents: diff changeset	45
a61af66fc99e Initial load duke parents: diff changeset	46 //
a61af66fc99e Initial load duke parents: diff changeset	47 // Replace any references to "oldref" in inputs to "use" with "newref".
a61af66fc99e Initial load duke parents: diff changeset	48 // Returns the number of replacements made.
a61af66fc99e Initial load duke parents: diff changeset	49 //
a61af66fc99e Initial load duke parents: diff changeset	50 int PhaseMacroExpand::replace_input(Node use, Node oldref, Node *newref) {
a61af66fc99e Initial load duke parents: diff changeset	51 int nreplacements = 0;
a61af66fc99e Initial load duke parents: diff changeset	52 uint req = use->req();
a61af66fc99e Initial load duke parents: diff changeset	53 for (uint j = 0; j < use->len(); j++) {
a61af66fc99e Initial load duke parents: diff changeset	54 Node *uin = use->in(j);
a61af66fc99e Initial load duke parents: diff changeset	55 if (uin == oldref) {
a61af66fc99e Initial load duke parents: diff changeset	56 if (j < req)
a61af66fc99e Initial load duke parents: diff changeset	57 use->set_req(j, newref);
a61af66fc99e Initial load duke parents: diff changeset	58 else
a61af66fc99e Initial load duke parents: diff changeset	59 use->set_prec(j, newref);
a61af66fc99e Initial load duke parents: diff changeset	60 nreplacements++;
a61af66fc99e Initial load duke parents: diff changeset	61 } else if (j >= req && uin == NULL) {
a61af66fc99e Initial load duke parents: diff changeset	62 break;
a61af66fc99e Initial load duke parents: diff changeset	63 }
a61af66fc99e Initial load duke parents: diff changeset	64 }
a61af66fc99e Initial load duke parents: diff changeset	65 return nreplacements;
a61af66fc99e Initial load duke parents: diff changeset	66 }
a61af66fc99e Initial load duke parents: diff changeset	67
a61af66fc99e Initial load duke parents: diff changeset	68 void PhaseMacroExpand::copy_call_debug_info(CallNode oldcall, CallNode newcall) {
a61af66fc99e Initial load duke parents: diff changeset	69 // Copy debug information and adjust JVMState information
a61af66fc99e Initial load duke parents: diff changeset	70 uint old_dbg_start = oldcall->tf()->domain()->cnt();
a61af66fc99e Initial load duke parents: diff changeset	71 uint new_dbg_start = newcall->tf()->domain()->cnt();
a61af66fc99e Initial load duke parents: diff changeset	72 int jvms_adj = new_dbg_start - old_dbg_start;
a61af66fc99e Initial load duke parents: diff changeset	73 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	74
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	75 Dict* sosn_map = new Dict(cmpkey,hashkey);
0 a61af66fc99e Initial load duke parents: diff changeset	76 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	77 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	78 // 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	79 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	80 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	81 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	82 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	83 if (old_unique != C->unique()) {
4115 1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	84 new_in->set_req(0, C->root()); // reset control edge
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	85 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	86 }
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	87 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	88 }
eac007780a58 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint kvn parents: 0 diff changeset	89 newcall->add_req(old_in);
0 a61af66fc99e Initial load duke parents: diff changeset	90 }
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	91
0 a61af66fc99e Initial load duke parents: diff changeset	92 newcall->set_jvms(oldcall->jvms());
a61af66fc99e Initial load duke parents: diff changeset	93 for (JVMState *jvms = newcall->jvms(); jvms != NULL; jvms = jvms->caller()) {
a61af66fc99e Initial load duke parents: diff changeset	94 jvms->set_map(newcall);
a61af66fc99e Initial load duke parents: diff changeset	95 jvms->set_locoff(jvms->locoff()+jvms_adj);
a61af66fc99e Initial load duke parents: diff changeset	96 jvms->set_stkoff(jvms->stkoff()+jvms_adj);
a61af66fc99e Initial load duke parents: diff changeset	97 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	98 jvms->set_scloff(jvms->scloff()+jvms_adj);
0 a61af66fc99e Initial load duke parents: diff changeset	99 jvms->set_endoff(jvms->endoff()+jvms_adj);
a61af66fc99e Initial load duke parents: diff changeset	100 }
a61af66fc99e Initial load duke parents: diff changeset	101 }
a61af66fc99e Initial load duke parents: diff changeset	102
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	103 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	104 Node* cmp;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	105 if (mask != 0) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	106 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	107 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	108 } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	109 cmp = word;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	110 }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	111 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	112 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	113 transform_later(iff);
0 a61af66fc99e Initial load duke parents: diff changeset	114
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	115 // Fast path taken.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	116 Node *fast_taken = transform_later( new (C, 1) IfFalseNode(iff) );
0 a61af66fc99e Initial load duke parents: diff changeset	117
a61af66fc99e Initial load duke parents: diff changeset	118 // Fast path not-taken, i.e. slow path
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	119 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	120
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	121 if (return_fast_path) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	122 region->init_req(edge, slow_taken); // Capture slow-control
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	123 return fast_taken;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	124 } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	125 region->init_req(edge, fast_taken); // Capture fast-control
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	126 return slow_taken;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	127 }
0 a61af66fc99e Initial load duke parents: diff changeset	128 }
a61af66fc99e Initial load duke parents: diff changeset	129
a61af66fc99e Initial load duke parents: diff changeset	130 //--------------------copy_predefined_input_for_runtime_call--------------------
a61af66fc99e Initial load duke parents: diff changeset	131 void PhaseMacroExpand::copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call) {
a61af66fc99e Initial load duke parents: diff changeset	132 // Set fixed predefined input arguments
a61af66fc99e Initial load duke parents: diff changeset	133 call->init_req( TypeFunc::Control, ctrl );
a61af66fc99e Initial load duke parents: diff changeset	134 call->init_req( TypeFunc::I_O , oldcall->in( TypeFunc::I_O) );
a61af66fc99e Initial load duke parents: diff changeset	135 call->init_req( TypeFunc::Memory , oldcall->in( TypeFunc::Memory ) ); // ?????
a61af66fc99e Initial load duke parents: diff changeset	136 call->init_req( TypeFunc::ReturnAdr, oldcall->in( TypeFunc::ReturnAdr ) );
a61af66fc99e Initial load duke parents: diff changeset	137 call->init_req( TypeFunc::FramePtr, oldcall->in( TypeFunc::FramePtr ) );
a61af66fc99e Initial load duke parents: diff changeset	138 }
a61af66fc99e Initial load duke parents: diff changeset	139
a61af66fc99e Initial load duke parents: diff changeset	140 //------------------------------make_slow_call---------------------------------
a61af66fc99e Initial load duke parents: diff changeset	141 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	142
a61af66fc99e Initial load duke parents: diff changeset	143 // Slow-path call
a61af66fc99e Initial load duke parents: diff changeset	144 int size = slow_call_type->domain()->cnt();
a61af66fc99e Initial load duke parents: diff changeset	145 CallNode *call = leaf_name
a61af66fc99e Initial load duke parents: diff changeset	146 ? (CallNode*)new (C, size) CallLeafNode ( slow_call_type, slow_call, leaf_name, TypeRawPtr::BOTTOM )
a61af66fc99e Initial load duke parents: diff changeset	147 : (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	148
a61af66fc99e Initial load duke parents: diff changeset	149 // Slow path call has no side-effects, uses few values
a61af66fc99e Initial load duke parents: diff changeset	150 copy_predefined_input_for_runtime_call(slow_path, oldcall, call );
a61af66fc99e Initial load duke parents: diff changeset	151 if (parm0 != NULL) call->init_req(TypeFunc::Parms+0, parm0);
a61af66fc99e Initial load duke parents: diff changeset	152 if (parm1 != NULL) call->init_req(TypeFunc::Parms+1, parm1);
a61af66fc99e Initial load duke parents: diff changeset	153 copy_call_debug_info(oldcall, call);
a61af66fc99e Initial load duke parents: diff changeset	154 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON.
1621 6027dddc26c6 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist() kvn parents: 1609 diff changeset	155 _igvn.replace_node(oldcall, call);
0 a61af66fc99e Initial load duke parents: diff changeset	156 transform_later(call);
a61af66fc99e Initial load duke parents: diff changeset	157
a61af66fc99e Initial load duke parents: diff changeset	158 return call;
a61af66fc99e Initial load duke parents: diff changeset	159 }
a61af66fc99e Initial load duke parents: diff changeset	160
a61af66fc99e Initial load duke parents: diff changeset	161 void PhaseMacroExpand::extract_call_projections(CallNode *call) {
a61af66fc99e Initial load duke parents: diff changeset	162 _fallthroughproj = NULL;
a61af66fc99e Initial load duke parents: diff changeset	163 _fallthroughcatchproj = NULL;
a61af66fc99e Initial load duke parents: diff changeset	164 _ioproj_fallthrough = NULL;
a61af66fc99e Initial load duke parents: diff changeset	165 _ioproj_catchall = NULL;
a61af66fc99e Initial load duke parents: diff changeset	166 _catchallcatchproj = NULL;
a61af66fc99e Initial load duke parents: diff changeset	167 _memproj_fallthrough = NULL;
a61af66fc99e Initial load duke parents: diff changeset	168 _memproj_catchall = NULL;
a61af66fc99e Initial load duke parents: diff changeset	169 _resproj = NULL;
a61af66fc99e Initial load duke parents: diff changeset	170 for (DUIterator_Fast imax, i = call->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load duke parents: diff changeset	171 ProjNode *pn = call->fast_out(i)->as_Proj();
a61af66fc99e Initial load duke parents: diff changeset	172 switch (pn->_con) {
a61af66fc99e Initial load duke parents: diff changeset	173 case TypeFunc::Control:
a61af66fc99e Initial load duke parents: diff changeset	174 {
a61af66fc99e Initial load duke parents: diff changeset	175 // For Control (fallthrough) and I_O (catch_all_index) we have CatchProj -> Catch -> Proj
a61af66fc99e Initial load duke parents: diff changeset	176 _fallthroughproj = pn;
a61af66fc99e Initial load duke parents: diff changeset	177 DUIterator_Fast jmax, j = pn->fast_outs(jmax);
a61af66fc99e Initial load duke parents: diff changeset	178 const Node *cn = pn->fast_out(j);
a61af66fc99e Initial load duke parents: diff changeset	179 if (cn->is_Catch()) {
a61af66fc99e Initial load duke parents: diff changeset	180 ProjNode *cpn = NULL;
a61af66fc99e Initial load duke parents: diff changeset	181 for (DUIterator_Fast kmax, k = cn->fast_outs(kmax); k < kmax; k++) {
a61af66fc99e Initial load duke parents: diff changeset	182 cpn = cn->fast_out(k)->as_Proj();
a61af66fc99e Initial load duke parents: diff changeset	183 assert(cpn->is_CatchProj(), "must be a CatchProjNode");
a61af66fc99e Initial load duke parents: diff changeset	184 if (cpn->_con == CatchProjNode::fall_through_index)
a61af66fc99e Initial load duke parents: diff changeset	185 _fallthroughcatchproj = cpn;
a61af66fc99e Initial load duke parents: diff changeset	186 else {
a61af66fc99e Initial load duke parents: diff changeset	187 assert(cpn->_con == CatchProjNode::catch_all_index, "must be correct index.");
a61af66fc99e Initial load duke parents: diff changeset	188 _catchallcatchproj = cpn;
a61af66fc99e Initial load duke parents: diff changeset	189 }
a61af66fc99e Initial load duke parents: diff changeset	190 }
a61af66fc99e Initial load duke parents: diff changeset	191 }
a61af66fc99e Initial load duke parents: diff changeset	192 break;
a61af66fc99e Initial load duke parents: diff changeset	193 }
a61af66fc99e Initial load duke parents: diff changeset	194 case TypeFunc::I_O:
a61af66fc99e Initial load duke parents: diff changeset	195 if (pn->_is_io_use)
a61af66fc99e Initial load duke parents: diff changeset	196 _ioproj_catchall = pn;
a61af66fc99e Initial load duke parents: diff changeset	197 else
a61af66fc99e Initial load duke parents: diff changeset	198 _ioproj_fallthrough = pn;
a61af66fc99e Initial load duke parents: diff changeset	199 break;
a61af66fc99e Initial load duke parents: diff changeset	200 case TypeFunc::Memory:
a61af66fc99e Initial load duke parents: diff changeset	201 if (pn->_is_io_use)
a61af66fc99e Initial load duke parents: diff changeset	202 _memproj_catchall = pn;
a61af66fc99e Initial load duke parents: diff changeset	203 else
a61af66fc99e Initial load duke parents: diff changeset	204 _memproj_fallthrough = pn;
a61af66fc99e Initial load duke parents: diff changeset	205 break;
a61af66fc99e Initial load duke parents: diff changeset	206 case TypeFunc::Parms:
a61af66fc99e Initial load duke parents: diff changeset	207 _resproj = pn;
a61af66fc99e Initial load duke parents: diff changeset	208 break;
a61af66fc99e Initial load duke parents: diff changeset	209 default:
a61af66fc99e Initial load duke parents: diff changeset	210 assert(false, "unexpected projection from allocation node.");
a61af66fc99e Initial load duke parents: diff changeset	211 }
a61af66fc99e Initial load duke parents: diff changeset	212 }
a61af66fc99e Initial load duke parents: diff changeset	213
a61af66fc99e Initial load duke parents: diff changeset	214 }
a61af66fc99e Initial load duke parents: diff changeset	215
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	216 // Eliminate a card mark sequence. p2x is a ConvP2XNode
851 fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	217 void PhaseMacroExpand::eliminate_card_mark(Node* p2x) {
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	218 assert(p2x->Opcode() == Op_CastP2X, "ConvP2XNode required");
851 fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	219 if (!UseG1GC) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	220 // vanilla/CMS post barrier
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	221 Node *shift = p2x->unique_out();
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	222 Node *addp = shift->unique_out();
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	223 for (DUIterator_Last jmin, j = addp->last_outs(jmin); j >= jmin; --j) {
3282 149bb459be66 7029167: add support for conditional card marks never parents: 2100 diff changeset	224 Node *mem = addp->last_out(j);
149bb459be66 7029167: add support for conditional card marks never parents: 2100 diff changeset	225 if (UseCondCardMark && mem->is_Load()) {
149bb459be66 7029167: add support for conditional card marks never parents: 2100 diff changeset	226 assert(mem->Opcode() == Op_LoadB, "unexpected code shape");
149bb459be66 7029167: add support for conditional card marks never parents: 2100 diff changeset	227 // The load is checking if the card has been written so
149bb459be66 7029167: add support for conditional card marks never parents: 2100 diff changeset	228 // replace it with zero to fold the test.
149bb459be66 7029167: add support for conditional card marks never parents: 2100 diff changeset	229 _igvn.replace_node(mem, intcon(0));
149bb459be66 7029167: add support for conditional card marks never parents: 2100 diff changeset	230 continue;
149bb459be66 7029167: add support for conditional card marks never parents: 2100 diff changeset	231 }
149bb459be66 7029167: add support for conditional card marks never parents: 2100 diff changeset	232 assert(mem->is_Store(), "store required");
149bb459be66 7029167: add support for conditional card marks never parents: 2100 diff changeset	233 _igvn.replace_node(mem, mem->in(MemNode::Memory));
851 fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	234 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	235 } else {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	236 // G1 pre/post barriers
4894 b9bc6cae88f2 7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes kvn parents: 4792 diff changeset	237 assert(p2x->outcnt() <= 2, "expects 1 or 2 users: Xor and URShift nodes");
851 fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	238 // It could be only one user, URShift node, in Object.clone() instrinsic
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	239 // but the new allocation is passed to arraycopy stub and it could not
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	240 // be scalar replaced. So we don't check the case.
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	241
4894 b9bc6cae88f2 7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes kvn parents: 4792 diff changeset	242 // An other case of only one user (Xor) is when the value check for NULL
b9bc6cae88f2 7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes kvn parents: 4792 diff changeset	243 // in G1 post barrier is folded after CCP so the code which used URShift
b9bc6cae88f2 7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes kvn parents: 4792 diff changeset	244 // is removed.
b9bc6cae88f2 7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes kvn parents: 4792 diff changeset	245
b9bc6cae88f2 7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes kvn parents: 4792 diff changeset	246 // Take Region node before eliminating post barrier since it also
b9bc6cae88f2 7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes kvn parents: 4792 diff changeset	247 // eliminates CastP2X node when it has only one user.
b9bc6cae88f2 7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes kvn parents: 4792 diff changeset	248 Node* this_region = p2x->in(0);
b9bc6cae88f2 7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes kvn parents: 4792 diff changeset	249 assert(this_region != NULL, "");
b9bc6cae88f2 7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes kvn parents: 4792 diff changeset	250
851 fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	251 // Remove G1 post barrier.
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	252
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	253 // Search for CastP2X->Xor->URShift->Cmp path which
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	254 // checks if the store done to a different from the value's region.
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	255 // And replace Cmp with #0 (false) to collapse G1 post barrier.
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	256 Node* xorx = NULL;
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	257 for (DUIterator_Fast imax, i = p2x->fast_outs(imax); i < imax; i++) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	258 Node* u = p2x->fast_out(i);
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	259 if (u->Opcode() == Op_XorX) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	260 xorx = u;
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	261 break;
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	262 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	263 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	264 assert(xorx != NULL, "missing G1 post barrier");
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	265 Node* shift = xorx->unique_out();
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	266 Node* cmpx = shift->unique_out();
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	267 assert(cmpx->is_Cmp() && cmpx->unique_out()->is_Bool() &&
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	268 cmpx->unique_out()->as_Bool()->_test._test == BoolTest::ne,
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	269 "missing region check in G1 post barrier");
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	270 _igvn.replace_node(cmpx, makecon(TypeInt::CC_EQ));
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	271
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	272 // Remove G1 pre barrier.
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	273
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	274 // Search "if (marking != 0)" check and set it to "false".
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	275 // There is no G1 pre barrier if previous stored value is NULL
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	276 // (for example, after initialization).
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	277 if (this_region->is_Region() && this_region->req() == 3) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	278 int ind = 1;
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	279 if (!this_region->in(ind)->is_IfFalse()) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	280 ind = 2;
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	281 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	282 if (this_region->in(ind)->is_IfFalse()) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	283 Node* bol = this_region->in(ind)->in(0)->in(1);
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	284 assert(bol->is_Bool(), "");
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	285 cmpx = bol->in(1);
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	286 if (bol->as_Bool()->_test._test == BoolTest::ne &&
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	287 cmpx->is_Cmp() && cmpx->in(2) == intcon(0) &&
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	288 cmpx->in(1)->is_Load()) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	289 Node* adr = cmpx->in(1)->as_Load()->in(MemNode::Address);
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	290 const int marking_offset = in_bytes(JavaThread::satb_mark_queue_offset() +
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	291 PtrQueue::byte_offset_of_active());
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	292 if (adr->is_AddP() && adr->in(AddPNode::Base) == top() &&
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	293 adr->in(AddPNode::Address)->Opcode() == Op_ThreadLocal &&
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	294 adr->in(AddPNode::Offset) == MakeConX(marking_offset)) {
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	295 _igvn.replace_node(cmpx, makecon(TypeInt::CC_EQ));
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	296 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	297 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	298 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	299 }
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	300 // Now CastP2X can be removed since it is used only on dead path
fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	301 // which currently still alive until igvn optimize it.
4894 b9bc6cae88f2 7143491: G1 C2 CTW: assert(p2x->outcnt() == 2) failed: expects 2 users: Xor and URShift nodes kvn parents: 4792 diff changeset	302 assert(p2x->outcnt() == 0 \|\| p2x->unique_out()->Opcode() == Op_URShiftX, "");
851 fc4be448891f 6851742: (EA) allocation elimination doesn't work with UseG1GC kvn parents: 780 diff changeset	303 _igvn.replace_node(p2x, top());
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	304 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	305 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	306
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	307 // 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	308 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	309 Node *orig_mem = mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	310 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	311 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	312 while (true) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	313 if (mem == alloc_mem \|\| mem == start_mem ) {
605 98cb887364d3 6810672: Comment typos twisti parents: 601 diff changeset	314 return mem; // hit one of our sentinels
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	315 } else if (mem->is_MergeMem()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	316 mem = mem->as_MergeMem()->memory_at(alias_idx);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	317 } 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	318 Node *in = mem->in(0);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	319 // 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	320 // already know that the object is safe to eliminate.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	321 if (in->is_Initialize() && in->as_Initialize()->allocation() == alloc) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	322 return in;
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	323 } else if (in->is_Call()) {
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	324 CallNode *call = in->as_Call();
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	325 if (!call->may_modify(tinst, phase)) {
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	326 mem = call->in(TypeFunc::Memory);
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	327 }
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	328 mem = in->in(TypeFunc::Memory);
b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	329 } else if (in->is_MemBar()) {
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	330 mem = in->in(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	331 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	332 assert(false, "unexpected projection");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	333 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	334 } else if (mem->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	335 const TypePtr* atype = mem->as_Store()->adr_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	336 int adr_idx = Compile::current()->get_alias_index(atype);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	337 if (adr_idx == alias_idx) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	338 assert(atype->isa_oopptr(), "address type must be oopptr");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	339 int adr_offset = atype->offset();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	340 uint adr_iid = atype->is_oopptr()->instance_id();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	341 // Array elements references have the same alias_idx
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	342 // but different offset and different instance_id.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	343 if (adr_offset == offset && adr_iid == alloc->_idx)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	344 return mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	345 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	346 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	347 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	348 mem = mem->in(MemNode::Memory);
1100 f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	349 } else if (mem->is_ClearArray()) {
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	350 if (!ClearArrayNode::step_through(&mem, alloc->_idx, phase)) {
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	351 // Can not bypass initialization of the instance
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	352 // we are looking.
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	353 debug_only(intptr_t offset;)
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	354 assert(alloc == AllocateNode::Ideal_allocation(mem->in(3), phase, offset), "sanity");
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	355 InitializeNode* init = alloc->as_Allocate()->initialization();
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	356 // We are looking for stored value, return Initialize node
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	357 // or memory edge from Allocate node.
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	358 if (init != NULL)
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	359 return init;
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	360 else
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	361 return alloc->in(TypeFunc::Memory); // It will produce zero value (see callers).
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	362 }
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	363 // Otherwise skip it (the call updated 'mem' value).
584 49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	364 } else if (mem->Opcode() == Op_SCMemProj) {
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	365 assert(mem->in(0)->is_LoadStore(), "sanity");
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	366 const TypePtr* atype = mem->in(0)->in(MemNode::Address)->bottom_type()->is_ptr();
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	367 int adr_idx = Compile::current()->get_alias_index(atype);
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	368 if (adr_idx == alias_idx) {
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	369 assert(false, "Object is not scalar replaceable if a LoadStore node access its field");
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	370 return NULL;
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	371 }
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	372 mem = mem->in(0)->in(MemNode::Memory);
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	373 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	374 return mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	375 }
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	376 assert(mem != orig_mem, "dead memory loop");
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	377 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	378 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	379
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	380 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	381 // 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	382 // on the input paths.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	383 // 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	384 // 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	385 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	386 assert(mem->is_Phi(), "sanity");
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	387 int alias_idx = C->get_alias_index(adr_t);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	388 int offset = adr_t->offset();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	389 int instance_id = adr_t->instance_id();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	390
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	391 // Check if an appropriate value phi already exists.
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	392 Node* region = mem->in(0);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	393 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	394 Node* phi = region->fast_out(k);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	395 if (phi->is_Phi() && phi != mem &&
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	396 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	397 return phi;
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	398 }
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	399 }
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	400 // Check if an appropriate new value phi already exists.
3788 e3cbc9ddd434 7044738: Loop unroll optimization causes incorrect result kvn parents: 3754 diff changeset	401 Node* new_phi = value_phis->find(mem->_idx);
e3cbc9ddd434 7044738: Loop unroll optimization causes incorrect result kvn parents: 3754 diff changeset	402 if (new_phi != NULL)
e3cbc9ddd434 7044738: Loop unroll optimization causes incorrect result kvn parents: 3754 diff changeset	403 return new_phi;
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	404
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	405 if (level <= 0) {
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	406 return NULL; // Give up: phi tree too deep
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	407 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	408 Node *start_mem = C->start()->proj_out(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	409 Node *alloc_mem = alloc->in(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	410
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	411 uint length = mem->req();
6197 d2a62e0f25eb 6995781: Native Memory Tracking (Phase 1) zgu parents: 6144 diff changeset	412 GrowableArray <Node *> values(length, length, NULL, false);
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	413
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	414 // create a new Phi for the value
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	415 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	416 transform_later(phi);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	417 value_phis->push(phi, mem->_idx);
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	418
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	419 for (uint j = 1; j < length; j++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	420 Node *in = mem->in(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	421 if (in == NULL \|\| in->is_top()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	422 values.at_put(j, in);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	423 } else {
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	424 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	425 if (val == start_mem \|\| val == alloc_mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	426 // hit a sentinel, return appropriate 0 value
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	427 values.at_put(j, _igvn.zerocon(ft));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	428 continue;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	429 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	430 if (val->is_Initialize()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	431 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	432 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	433 if (val == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	434 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	435 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	436 if (val == mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	437 values.at_put(j, mem);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	438 } else if (val->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	439 values.at_put(j, val->in(MemNode::ValueIn));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	440 } else if(val->is_Proj() && val->in(0) == alloc) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	441 values.at_put(j, _igvn.zerocon(ft));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	442 } else if (val->is_Phi()) {
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	443 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	444 if (val == NULL) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	445 return NULL;
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	446 }
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	447 values.at_put(j, val);
584 49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	448 } else if (val->Opcode() == Op_SCMemProj) {
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	449 assert(val->in(0)->is_LoadStore(), "sanity");
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	450 assert(false, "Object is not scalar replaceable if a LoadStore node access its field");
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	451 return NULL;
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	452 } else {
584 49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	453 #ifdef ASSERT
49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	454 val->dump();
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	455 assert(false, "unknown node on this path");
584 49a36a80b0c7 6802499: EA: assert(false,"unknown node on this path") kvn parents: 565 diff changeset	456 #endif
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	457 return NULL; // unknown node on this path
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	458 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	459 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	460 }
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	461 // Set Phi's inputs
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	462 for (uint j = 1; j < length; j++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	463 if (values.at(j) == mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	464 phi->init_req(j, phi);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	465 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	466 phi->init_req(j, values.at(j));
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 return phi;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	470 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	471
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	472 // 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	473 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	474 assert(adr_t->is_known_instance_field(), "instance required");
1dd146f17531 6716441: error in meet with +DoEscapeAnalysis kvn parents: 221 diff changeset	475 int instance_id = adr_t->instance_id();
1dd146f17531 6716441: error in meet with +DoEscapeAnalysis kvn parents: 221 diff changeset	476 assert((uint)instance_id == alloc->_idx, "wrong allocation");
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	477
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	478 int alias_idx = C->get_alias_index(adr_t);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	479 int offset = adr_t->offset();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	480 Node *start_mem = C->start()->proj_out(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	481 Node *alloc_ctrl = alloc->in(TypeFunc::Control);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	482 Node *alloc_mem = alloc->in(TypeFunc::Memory);
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	483 Arena *a = Thread::current()->resource_area();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	484 VectorSet visited(a);
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	485
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	486
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	487 bool done = sfpt_mem == alloc_mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	488 Node *mem = sfpt_mem;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	489 while (!done) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	490 if (visited.test_set(mem->_idx)) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	491 return NULL; // found a loop, give up
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	492 }
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	493 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	494 if (mem == start_mem \|\| mem == alloc_mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	495 done = true; // hit a sentinel, return appropriate 0 value
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	496 } else if (mem->is_Initialize()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	497 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	498 if (mem == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	499 done = true; // Something go wrong.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	500 } else if (mem->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	501 const TypePtr* atype = mem->as_Store()->adr_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	502 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	503 done = true;
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 } else if (mem->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	506 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	507 assert(atype != NULL, "address type must be oopptr");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	508 assert(C->get_alias_index(atype) == alias_idx &&
223 1dd146f17531 6716441: error in meet with +DoEscapeAnalysis kvn parents: 221 diff changeset	509 atype->is_known_instance_field() && atype->offset() == offset &&
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	510 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	511 done = true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	512 } else if (mem->is_Phi()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	513 // try to find a phi's unique input
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	514 Node *unique_input = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	515 Node *top = C->top();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	516 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	517 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	518 if (n == NULL \|\| n == top \|\| n == mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	519 continue;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	520 } else if (unique_input == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	521 unique_input = n;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	522 } else if (unique_input != n) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	523 unique_input = top;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	524 break;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	525 }
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 if (unique_input != NULL && unique_input != top) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	528 mem = unique_input;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	529 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	530 done = true;
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 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	533 assert(false, "unexpected node");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	534 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	535 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	536 if (mem != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	537 if (mem == start_mem \|\| mem == alloc_mem) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	538 // hit a sentinel, return appropriate 0 value
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	539 return _igvn.zerocon(ft);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	540 } else if (mem->is_Store()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	541 return mem->in(MemNode::ValueIn);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	542 } else if (mem->is_Phi()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	543 // 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	544 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	545 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	546 if (phi != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	547 return phi;
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	548 } else {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	549 // Kill all new Phis
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	550 while(value_phis.is_nonempty()) {
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	551 Node* n = value_phis.node();
1621 6027dddc26c6 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist() kvn parents: 1609 diff changeset	552 _igvn.replace_node(n, C->top());
247 02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	553 value_phis.pop();
02a35ad4adf8 6723160: Nightly failure: Error: meet not symmetric kvn parents: 235 diff changeset	554 }
73 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 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	557 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	558 // Something go wrong.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	559 return NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	560 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	561
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	562 // Check the possibility of scalar replacement.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	563 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	564 // 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	565 // prevent us from eliminating it.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	566 NOT_PRODUCT( const char* fail_eliminate = NULL; )
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	567 DEBUG_ONLY( Node* disq_node = NULL; )
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	568 bool can_eliminate = true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	569
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	570 Node* res = alloc->result_cast();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	571 const TypeOopPtr* res_type = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	572 if (res == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	573 // All users were eliminated.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	574 } else if (!res->is_CheckCastPP()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	575 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	576 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	577 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	578 res_type = _igvn.type(res)->isa_oopptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	579 if (res_type == NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	580 NOT_PRODUCT(fail_eliminate = "Neither instance or array allocation";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	581 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	582 } else if (res_type->isa_aryptr()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	583 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	584 if (length < 0) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	585 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	586 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	587 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	588 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	589 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	590
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	591 if (can_eliminate && res != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	592 for (DUIterator_Fast jmax, j = res->fast_outs(jmax);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	593 j < jmax && can_eliminate; j++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	594 Node* use = res->fast_out(j);
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 if (use->is_AddP()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	597 const TypePtr* addp_type = _igvn.type(use)->is_ptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	598 int offset = addp_type->offset();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	599
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	600 if (offset == Type::OffsetTop \|\| offset == Type::OffsetBot) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	601 NOT_PRODUCT(fail_eliminate = "Undefined field referrence";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	602 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	603 break;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	604 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	605 for (DUIterator_Fast kmax, k = use->fast_outs(kmax);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	606 k < kmax && can_eliminate; k++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	607 Node* n = use->fast_out(k);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	608 if (!n->is_Store() && n->Opcode() != Op_CastP2X) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	609 DEBUG_ONLY(disq_node = n;)
253 b0fe4deeb9fb 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.") kvn parents: 247 diff changeset	610 if (n->is_Load() \|\| n->is_LoadStore()) {
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	611 NOT_PRODUCT(fail_eliminate = "Field load";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	612 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	613 NOT_PRODUCT(fail_eliminate = "Not store field referrence";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	614 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	615 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	616 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	617 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	618 } else if (use->is_SafePoint()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	619 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	620 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	621 // Object is passed as argument.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	622 DEBUG_ONLY(disq_node = use;)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	623 NOT_PRODUCT(fail_eliminate = "Object is passed as argument";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	624 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	625 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	626 Node* sfptMem = sfpt->memory();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	627 if (sfptMem == NULL \|\| sfptMem->is_top()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	628 DEBUG_ONLY(disq_node = use;)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	629 NOT_PRODUCT(fail_eliminate = "NULL or TOP memory";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	630 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	631 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	632 safepoints.append_if_missing(sfpt);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	633 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	634 } 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	635 if (use->is_Phi()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	636 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	637 NOT_PRODUCT(fail_eliminate = "Object is return value";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	638 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	639 NOT_PRODUCT(fail_eliminate = "Object is referenced by Phi";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	640 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	641 DEBUG_ONLY(disq_node = use;)
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 if (use->Opcode() == Op_Return) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	644 NOT_PRODUCT(fail_eliminate = "Object is return value";)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	645 }else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	646 NOT_PRODUCT(fail_eliminate = "Object is referenced by node";)
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 DEBUG_ONLY(disq_node = use;)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	649 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	650 can_eliminate = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	651 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	652 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	653 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	654
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	655 #ifndef PRODUCT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	656 if (PrintEliminateAllocations) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	657 if (can_eliminate) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	658 tty->print("Scalar ");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	659 if (res == NULL)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	660 alloc->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	661 else
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	662 res->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	663 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	664 tty->print("NotScalar (%s)", fail_eliminate);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	665 if (res == NULL)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	666 alloc->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	667 else
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	668 res->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	669 #ifdef ASSERT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	670 if (disq_node != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	671 tty->print(" >>>> ");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	672 disq_node->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	673 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	674 #endif /ASSERT/
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	675 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	676 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	677 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	678 return can_eliminate;
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 // Do scalar replacement.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	682 bool PhaseMacroExpand::scalar_replacement(AllocateNode alloc, GrowableArray <SafePointNode >& safepoints) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	683 GrowableArray <SafePointNode *> safepoints_done;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	684
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	685 ciKlass* klass = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	686 ciInstanceKlass* iklass = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	687 int nfields = 0;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	688 int array_base;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	689 int element_size;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	690 BasicType basic_elem_type;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	691 ciType* elem_type;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	692
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	693 Node* res = alloc->result_cast();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	694 const TypeOopPtr* res_type = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	695 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	696 res_type = _igvn.type(res)->isa_oopptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	697 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	698
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	699 if (res != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	700 klass = res_type->klass();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	701 if (res_type->isa_instptr()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	702 // 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	703 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	704 iklass = klass->as_instance_klass();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	705 nfields = iklass->nof_nonstatic_fields();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	706 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	707 // 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	708 nfields = alloc->in(AllocateNode::ALength)->find_int_con(-1);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	709 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	710 elem_type = klass->as_array_klass()->element_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	711 basic_elem_type = elem_type->basic_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	712 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	713 element_size = type2aelembytes(basic_elem_type);
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 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	716 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	717 // Process the safepoint uses
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	718 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	719 while (safepoints.length() > 0) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	720 SafePointNode* sfpt = safepoints.pop();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	721 Node* mem = sfpt->memory();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	722 uint first_ind = sfpt->req();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	723 SafePointScalarObjectNode* sobj = new (C, 1) SafePointScalarObjectNode(res_type,
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	724 #ifdef ASSERT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	725 alloc,
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	726 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	727 first_ind, nfields);
4115 1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	728 sobj->init_req(0, C->root());
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	729 transform_later(sobj);
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 // 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	732 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	733 intptr_t offset;
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	734 ciField* field = NULL;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	735 if (iklass != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	736 field = iklass->nonstatic_field_at(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	737 offset = field->offset();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	738 elem_type = field->type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	739 basic_elem_type = field->layout_type();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	740 } else {
306 af945ba2e739 6741738: TypePtr::add_offset() set incorrect offset when the add overflows kvn parents: 253 diff changeset	741 offset = array_base + j * (intptr_t)element_size;
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	742 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	743
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	744 const Type *field_type;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	745 // 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	746 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	747 if (!elem_type->is_loaded()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	748 field_type = TypeInstPtr::BOTTOM;
1682 e5dfb3ccb88b 6969569: assert(is_static() && is_constant()) failed: illegal call to constant_value() kvn parents: 1621 diff changeset	749 } else if (field != NULL && field->is_constant() && field->is_static()) {
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	750 // 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	751 ciObject* con = field->constant_value().as_object();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	752 // 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	753 // 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	754 field_type = TypeOopPtr::make_from_constant(con)->isa_oopptr();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	755 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	756 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	757 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	758 }
124 b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	759 if (UseCompressedOops) {
221 1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode kvn parents: 216 diff changeset	760 field_type = field_type->make_narrowoop();
124 b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	761 basic_elem_type = T_NARROWOOP;
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	762 }
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	763 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	764 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	765 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	766
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	767 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	768
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	769 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	770 if (field_val == NULL) {
4115 1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	771 // We weren't able to find a value for this field,
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	772 // give up on eliminating this allocation.
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	773
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	774 // Remove any extra entries we added to the safepoint.
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	775 uint last = sfpt->req() - 1;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	776 for (int k = 0; k < j; k++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	777 sfpt->del_req(last--);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	778 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	779 // rollback processed safepoints
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	780 while (safepoints_done.length() > 0) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	781 SafePointNode* sfpt_done = safepoints_done.pop();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	782 // remove any extra entries we added to the safepoint
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	783 last = sfpt_done->req() - 1;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	784 for (int k = 0; k < nfields; k++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	785 sfpt_done->del_req(last--);
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 JVMState *jvms = sfpt_done->jvms();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	788 jvms->set_endoff(sfpt_done->req());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	789 // 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	790 // to SafePointScalarObjectNode with the allocated object.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	791 int start = jvms->debug_start();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	792 int end = jvms->debug_end();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	793 for (int i = start; i < end; i++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	794 if (sfpt_done->in(i)->is_SafePointScalarObject()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	795 SafePointScalarObjectNode* scobj = sfpt_done->in(i)->as_SafePointScalarObject();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	796 if (scobj->first_index() == sfpt_done->req() &&
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	797 scobj->n_fields() == (uint)nfields) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	798 assert(scobj->alloc() == alloc, "sanity");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	799 sfpt_done->set_req(i, res);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	800 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	801 }
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 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	804 #ifndef PRODUCT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	805 if (PrintEliminateAllocations) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	806 if (field != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	807 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	808 sfpt->_idx);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	809 field->print();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	810 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	811 tty->print(" (alias_idx=%d)", field_idx);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	812 } else { // Array's element
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	813 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	814 sfpt->_idx, j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	815 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	816 tty->print(", which prevents elimination of: ");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	817 if (res == NULL)
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	818 alloc->dump();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	819 else
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	820 res->dump();
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 #endif
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 }
124 b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	825 if (UseCompressedOops && field_type->isa_narrowoop()) {
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	826 // Enable "DecodeN(EncodeP(Allocate)) --> Allocate" transformation
b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	827 // 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	828 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	829 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	830 } else {
1e026f8da827 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode kvn parents: 216 diff changeset	831 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	832 }
124 b130b98db9cf 6689060: Escape Analysis does not work with Compressed Oops kvn parents: 113 diff changeset	833 }
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	834 sfpt->add_req(field_val);
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 JVMState *jvms = sfpt->jvms();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	837 jvms->set_endoff(sfpt->req());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	838 // 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	839 // to the allocated object with "sobj"
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	840 int start = jvms->debug_start();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	841 int end = jvms->debug_end();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	842 for (int i = start; i < end; i++) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	843 if (sfpt->in(i) == res) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	844 sfpt->set_req(i, sobj);
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 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	847 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	848 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	849 return true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	850 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	851
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	852 // Process users of eliminated allocation.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	853 void PhaseMacroExpand::process_users_of_allocation(AllocateNode *alloc) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	854 Node* res = alloc->result_cast();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	855 if (res != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	856 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	857 Node *use = res->last_out(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	858 uint oc1 = res->outcnt();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	859
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	860 if (use->is_AddP()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	861 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	862 Node *n = use->last_out(k);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	863 uint oc2 = use->outcnt();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	864 if (n->is_Store()) {
1100 f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	865 #ifdef ASSERT
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	866 // Verify that there is no dependent MemBarVolatile nodes,
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	867 // they should be removed during IGVN, see MemBarNode::Ideal().
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	868 for (DUIterator_Fast pmax, p = n->fast_outs(pmax);
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	869 p < pmax; p++) {
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	870 Node* mb = n->fast_out(p);
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	871 assert(mb->is_Initialize() \|\| !mb->is_MemBar() \|\|
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	872 mb->req() <= MemBarNode::Precedent \|\|
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	873 mb->in(MemBarNode::Precedent) != n,
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	874 "MemBarVolatile should be eliminated for non-escaping object");
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	875 }
f96a1a986f7b 6895383: JCK test throws NPE for method compiled with Escape Analysis kvn parents: 1080 diff changeset	876 #endif
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	877 _igvn.replace_node(n, n->in(MemNode::Memory));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	878 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	879 eliminate_card_mark(n);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	880 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	881 k -= (oc2 - use->outcnt());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	882 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	883 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	884 eliminate_card_mark(use);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	885 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	886 j -= (oc1 - res->outcnt());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	887 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	888 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	889 _igvn.remove_dead_node(res);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	890 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	891
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	892 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	893 // Process other users of allocation's projections
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	894 //
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	895 if (_resproj != NULL && _resproj->outcnt() != 0) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	896 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	897 Node *use = _resproj->last_out(j);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	898 uint oc1 = _resproj->outcnt();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	899 if (use->is_Initialize()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	900 // Eliminate Initialize node.
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	901 InitializeNode *init = use->as_Initialize();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	902 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	903 Node *ctrl_proj = init->proj_out(TypeFunc::Control);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	904 if (ctrl_proj != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	905 assert(init->in(TypeFunc::Control) == _fallthroughcatchproj, "allocation control projection");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	906 _igvn.replace_node(ctrl_proj, _fallthroughcatchproj);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	907 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	908 Node *mem_proj = init->proj_out(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	909 if (mem_proj != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	910 Node *mem = init->in(TypeFunc::Memory);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	911 #ifdef ASSERT
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	912 if (mem->is_MergeMem()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	913 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	914 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	915 assert(mem == _memproj_fallthrough, "allocation memory projection");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	916 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	917 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	918 _igvn.replace_node(mem_proj, mem);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	919 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	920 } else if (use->is_AddP()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	921 // raw memory addresses used only by the initialization
708 f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	922 _igvn.replace_node(use, C->top());
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	923 } else {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	924 assert(false, "only Initialize or AddP expected");
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	925 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	926 j -= (oc1 - _resproj->outcnt());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	927 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	928 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	929 if (_fallthroughcatchproj != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	930 _igvn.replace_node(_fallthroughcatchproj, alloc->in(TypeFunc::Control));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	931 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	932 if (_memproj_fallthrough != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	933 _igvn.replace_node(_memproj_fallthrough, alloc->in(TypeFunc::Memory));
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	934 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	935 if (_memproj_catchall != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	936 _igvn.replace_node(_memproj_catchall, C->top());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	937 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	938 if (_ioproj_fallthrough != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	939 _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	940 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	941 if (_ioproj_catchall != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	942 _igvn.replace_node(_ioproj_catchall, C->top());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	943 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	944 if (_catchallcatchproj != NULL) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	945 _igvn.replace_node(_catchallcatchproj, C->top());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	946 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	947 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	948
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	949 bool PhaseMacroExpand::eliminate_allocate_node(AllocateNode *alloc) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	950
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	951 if (!EliminateAllocations \|\| !alloc->_is_scalar_replaceable) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	952 return false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	953 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	954
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	955 extract_call_projections(alloc);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	956
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	957 GrowableArray <SafePointNode *> safepoints;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	958 if (!can_eliminate_allocation(alloc, safepoints)) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	959 return false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	960 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	961
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	962 if (!scalar_replacement(alloc, safepoints)) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	963 return false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	964 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	965
1080 7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	966 CompileLog* log = C->log();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	967 if (log != NULL) {
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	968 Node* klass = alloc->in(AllocateNode::KlassNode);
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	969 const TypeKlassPtr* tklass = _igvn.type(klass)->is_klassptr();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	970 log->head("eliminate_allocation type='%d'",
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	971 log->identify(tklass->klass()));
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	972 JVMState* p = alloc->jvms();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	973 while (p != NULL) {
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	974 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method()));
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	975 p = p->caller();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	976 }
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	977 log->tail("eliminate_allocation");
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	978 }
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	979
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	980 process_users_of_allocation(alloc);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	981
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	982 #ifndef PRODUCT
1080 7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	983 if (PrintEliminateAllocations) {
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	984 if (alloc->is_AllocateArray())
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	985 tty->print_cr("++++ Eliminated: %d AllocateArray", alloc->_idx);
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	986 else
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	987 tty->print_cr("++++ Eliminated: %d Allocate", alloc->_idx);
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	988 }
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	989 #endif
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	990
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	991 return true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	992 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	993
0 a61af66fc99e Initial load duke parents: diff changeset	994
a61af66fc99e Initial load duke parents: diff changeset	995 //---------------------------set_eden_pointers-------------------------
a61af66fc99e Initial load duke parents: diff changeset	996 void PhaseMacroExpand::set_eden_pointers(Node* &eden_top_adr, Node* &eden_end_adr) {
a61af66fc99e Initial load duke parents: diff changeset	997 if (UseTLAB) { // Private allocation: load from TLS
a61af66fc99e Initial load duke parents: diff changeset	998 Node* thread = transform_later(new (C, 1) ThreadLocalNode());
a61af66fc99e Initial load duke parents: diff changeset	999 int tlab_top_offset = in_bytes(JavaThread::tlab_top_offset());
a61af66fc99e Initial load duke parents: diff changeset	1000 int tlab_end_offset = in_bytes(JavaThread::tlab_end_offset());
a61af66fc99e Initial load duke parents: diff changeset	1001 eden_top_adr = basic_plus_adr(top()/not oop/, thread, tlab_top_offset);
a61af66fc99e Initial load duke parents: diff changeset	1002 eden_end_adr = basic_plus_adr(top()/not oop/, thread, tlab_end_offset);
a61af66fc99e Initial load duke parents: diff changeset	1003 } else { // Shared allocation: load from globals
a61af66fc99e Initial load duke parents: diff changeset	1004 CollectedHeap* ch = Universe::heap();
a61af66fc99e Initial load duke parents: diff changeset	1005 address top_adr = (address)ch->top_addr();
a61af66fc99e Initial load duke parents: diff changeset	1006 address end_adr = (address)ch->end_addr();
a61af66fc99e Initial load duke parents: diff changeset	1007 eden_top_adr = makecon(TypeRawPtr::make(top_adr));
a61af66fc99e Initial load duke parents: diff changeset	1008 eden_end_adr = basic_plus_adr(eden_top_adr, end_adr - top_adr);
a61af66fc99e Initial load duke parents: diff changeset	1009 }
a61af66fc99e Initial load duke parents: diff changeset	1010 }
a61af66fc99e Initial load duke parents: diff changeset	1011
a61af66fc99e Initial load duke parents: diff changeset	1012
a61af66fc99e Initial load duke parents: diff changeset	1013 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	1014 Node* adr = basic_plus_adr(base, offset);
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	1015 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	1016 Node* value = LoadNode::make(_igvn, ctl, mem, adr, adr_type, value_type, bt);
0 a61af66fc99e Initial load duke parents: diff changeset	1017 transform_later(value);
a61af66fc99e Initial load duke parents: diff changeset	1018 return value;
a61af66fc99e Initial load duke parents: diff changeset	1019 }
a61af66fc99e Initial load duke parents: diff changeset	1020
a61af66fc99e Initial load duke parents: diff changeset	1021
a61af66fc99e Initial load duke parents: diff changeset	1022 Node* PhaseMacroExpand::make_store(Node* ctl, Node* mem, Node* base, int offset, Node* value, BasicType bt) {
a61af66fc99e Initial load duke parents: diff changeset	1023 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	1024 mem = StoreNode::make(_igvn, ctl, mem, adr, NULL, value, bt);
0 a61af66fc99e Initial load duke parents: diff changeset	1025 transform_later(mem);
a61af66fc99e Initial load duke parents: diff changeset	1026 return mem;
a61af66fc99e Initial load duke parents: diff changeset	1027 }
a61af66fc99e Initial load duke parents: diff changeset	1028
a61af66fc99e Initial load duke parents: diff changeset	1029 //=============================================================================
a61af66fc99e Initial load duke parents: diff changeset	1030 //
a61af66fc99e Initial load duke parents: diff changeset	1031 // A L L O C A T I O N
a61af66fc99e Initial load duke parents: diff changeset	1032 //
a61af66fc99e Initial load duke parents: diff changeset	1033 // Allocation attempts to be fast in the case of frequent small objects.
a61af66fc99e Initial load duke parents: diff changeset	1034 // It breaks down like this:
a61af66fc99e Initial load duke parents: diff changeset	1035 //
a61af66fc99e Initial load duke parents: diff changeset	1036 // 1) Size in doublewords is computed. This is a constant for objects and
a61af66fc99e Initial load duke parents: diff changeset	1037 // variable for most arrays. Doubleword units are used to avoid size
a61af66fc99e Initial load duke parents: diff changeset	1038 // overflow of huge doubleword arrays. We need doublewords in the end for
a61af66fc99e Initial load duke parents: diff changeset	1039 // rounding.
a61af66fc99e Initial load duke parents: diff changeset	1040 //
a61af66fc99e Initial load duke parents: diff changeset	1041 // 2) Size is checked for being 'too large'. Too-large allocations will go
a61af66fc99e Initial load duke parents: diff changeset	1042 // the slow path into the VM. The slow path can throw any required
a61af66fc99e Initial load duke parents: diff changeset	1043 // exceptions, and does all the special checks for very large arrays. The
a61af66fc99e Initial load duke parents: diff changeset	1044 // size test can constant-fold away for objects. For objects with
a61af66fc99e Initial load duke parents: diff changeset	1045 // finalizers it constant-folds the otherway: you always go slow with
a61af66fc99e Initial load duke parents: diff changeset	1046 // finalizers.
a61af66fc99e Initial load duke parents: diff changeset	1047 //
a61af66fc99e Initial load duke parents: diff changeset	1048 // 3) If NOT using TLABs, this is the contended loop-back point.
a61af66fc99e Initial load duke parents: diff changeset	1049 // Load-Locked the heap top. If using TLABs normal-load the heap top.
a61af66fc99e Initial load duke parents: diff changeset	1050 //
a61af66fc99e Initial load duke parents: diff changeset	1051 // 4) Check that heap top + size*8 < max. If we fail go the slow ` route.
a61af66fc99e Initial load duke parents: diff changeset	1052 // NOTE: "top+size*8" cannot wrap the 4Gig line! Here's why: for largish
a61af66fc99e Initial load duke parents: diff changeset	1053 // "size*8" we always enter the VM, where "largish" is a constant picked small
a61af66fc99e Initial load duke parents: diff changeset	1054 // enough that there's always space between the eden max and 4Gig (old space is
a61af66fc99e Initial load duke parents: diff changeset	1055 // there so it's quite large) and large enough that the cost of entering the VM
a61af66fc99e Initial load duke parents: diff changeset	1056 // is dwarfed by the cost to initialize the space.
a61af66fc99e Initial load duke parents: diff changeset	1057 //
a61af66fc99e Initial load duke parents: diff changeset	1058 // 5) If NOT using TLABs, Store-Conditional the adjusted heap top back
a61af66fc99e Initial load duke parents: diff changeset	1059 // down. If contended, repeat at step 3. If using TLABs normal-store
a61af66fc99e Initial load duke parents: diff changeset	1060 // adjusted heap top back down; there is no contention.
a61af66fc99e Initial load duke parents: diff changeset	1061 //
a61af66fc99e Initial load duke parents: diff changeset	1062 // 6) If !ZeroTLAB then Bulk-clear the object/array. Fill in klass & mark
a61af66fc99e Initial load duke parents: diff changeset	1063 // fields.
a61af66fc99e Initial load duke parents: diff changeset	1064 //
a61af66fc99e Initial load duke parents: diff changeset	1065 // 7) Merge with the slow-path; cast the raw memory pointer to the correct
a61af66fc99e Initial load duke parents: diff changeset	1066 // oop flavor.
a61af66fc99e Initial load duke parents: diff changeset	1067 //
a61af66fc99e Initial load duke parents: diff changeset	1068 //=============================================================================
a61af66fc99e Initial load duke parents: diff changeset	1069 // FastAllocateSizeLimit value is in DOUBLEWORDS.
a61af66fc99e Initial load duke parents: diff changeset	1070 // Allocations bigger than this always go the slow route.
a61af66fc99e Initial load duke parents: diff changeset	1071 // This value must be small enough that allocation attempts that need to
a61af66fc99e Initial load duke parents: diff changeset	1072 // trigger exceptions go the slow route. Also, it must be small enough so
a61af66fc99e Initial load duke parents: diff changeset	1073 // that heap_top + size_in_bytes does not wrap around the 4Gig limit.
a61af66fc99e Initial load duke parents: diff changeset	1074 //=============================================================================j//
a61af66fc99e Initial load duke parents: diff changeset	1075 // %%% Here is an old comment from parseHelper.cpp; is it outdated?
a61af66fc99e Initial load duke parents: diff changeset	1076 // The allocator will coalesce int->oop copies away. See comment in
a61af66fc99e Initial load duke parents: diff changeset	1077 // coalesce.cpp about how this works. It depends critically on the exact
a61af66fc99e Initial load duke parents: diff changeset	1078 // code shape produced here, so if you are changing this code shape
a61af66fc99e Initial load duke parents: diff changeset	1079 // make sure the GC info for the heap-top is correct in and around the
a61af66fc99e Initial load duke parents: diff changeset	1080 // slow-path call.
a61af66fc99e Initial load duke parents: diff changeset	1081 //
a61af66fc99e Initial load duke parents: diff changeset	1082
a61af66fc99e Initial load duke parents: diff changeset	1083 void PhaseMacroExpand::expand_allocate_common(
a61af66fc99e Initial load duke parents: diff changeset	1084 AllocateNode* alloc, // allocation node to be expanded
a61af66fc99e Initial load duke parents: diff changeset	1085 Node* length, // array length for an array allocation
a61af66fc99e Initial load duke parents: diff changeset	1086 const TypeFunc* slow_call_type, // Type of slow call
a61af66fc99e Initial load duke parents: diff changeset	1087 address slow_call_address // Address of slow call
a61af66fc99e Initial load duke parents: diff changeset	1088 )
a61af66fc99e Initial load duke parents: diff changeset	1089 {
a61af66fc99e Initial load duke parents: diff changeset	1090
a61af66fc99e Initial load duke parents: diff changeset	1091 Node* ctrl = alloc->in(TypeFunc::Control);
a61af66fc99e Initial load duke parents: diff changeset	1092 Node* mem = alloc->in(TypeFunc::Memory);
a61af66fc99e Initial load duke parents: diff changeset	1093 Node* i_o = alloc->in(TypeFunc::I_O);
a61af66fc99e Initial load duke parents: diff changeset	1094 Node* size_in_bytes = alloc->in(AllocateNode::AllocSize);
a61af66fc99e Initial load duke parents: diff changeset	1095 Node* klass_node = alloc->in(AllocateNode::KlassNode);
a61af66fc99e Initial load duke parents: diff changeset	1096 Node* initial_slow_test = alloc->in(AllocateNode::InitialTest);
a61af66fc99e Initial load duke parents: diff changeset	1097
4763 1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1098 Node* storestore = alloc->storestore();
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1099 if (storestore != NULL) {
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1100 // Break this link that is no longer useful and confuses register allocation
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1101 storestore->set_req(MemBarNode::Precedent, top());
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1102 }
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1103
0 a61af66fc99e Initial load duke parents: diff changeset	1104 assert(ctrl != NULL, "must have control");
a61af66fc99e Initial load duke parents: diff changeset	1105 // We need a Region and corresponding Phi's to merge the slow-path and fast-path results.
a61af66fc99e Initial load duke parents: diff changeset	1106 // they will not be used if "always_slow" is set
a61af66fc99e Initial load duke parents: diff changeset	1107 enum { slow_result_path = 1, fast_result_path = 2 };
a61af66fc99e Initial load duke parents: diff changeset	1108 Node *result_region;
a61af66fc99e Initial load duke parents: diff changeset	1109 Node *result_phi_rawmem;
a61af66fc99e Initial load duke parents: diff changeset	1110 Node *result_phi_rawoop;
a61af66fc99e Initial load duke parents: diff changeset	1111 Node *result_phi_i_o;
a61af66fc99e Initial load duke parents: diff changeset	1112
a61af66fc99e Initial load duke parents: diff changeset	1113 // The initial slow comparison is a size check, the comparison
a61af66fc99e Initial load duke parents: diff changeset	1114 // we want to do is a BoolTest::gt
a61af66fc99e Initial load duke parents: diff changeset	1115 bool always_slow = false;
a61af66fc99e Initial load duke parents: diff changeset	1116 int tv = _igvn.find_int_con(initial_slow_test, -1);
a61af66fc99e Initial load duke parents: diff changeset	1117 if (tv >= 0) {
a61af66fc99e Initial load duke parents: diff changeset	1118 always_slow = (tv == 1);
a61af66fc99e Initial load duke parents: diff changeset	1119 initial_slow_test = NULL;
a61af66fc99e Initial load duke parents: diff changeset	1120 } else {
a61af66fc99e Initial load duke parents: diff changeset	1121 initial_slow_test = BoolNode::make_predicate(initial_slow_test, &_igvn);
a61af66fc99e Initial load duke parents: diff changeset	1122 }
a61af66fc99e Initial load duke parents: diff changeset	1123
780 c96bf21b756f 6788527: Server vm intermittently fails with assertion "live value must not be garbage" with fastdebug bits kvn parents: 708 diff changeset	1124 if (C->env()->dtrace_alloc_probes() \|\|
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1125 !UseTLAB && (!Universe::heap()->supports_inline_contig_alloc() \|\|
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1126 (UseConcMarkSweepGC && CMSIncrementalMode))) {
0 a61af66fc99e Initial load duke parents: diff changeset	1127 // Force slow-path allocation
a61af66fc99e Initial load duke parents: diff changeset	1128 always_slow = true;
a61af66fc99e Initial load duke parents: diff changeset	1129 initial_slow_test = NULL;
a61af66fc99e Initial load duke parents: diff changeset	1130 }
a61af66fc99e Initial load duke parents: diff changeset	1131
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1132
0 a61af66fc99e Initial load duke parents: diff changeset	1133 enum { too_big_or_final_path = 1, need_gc_path = 2 };
a61af66fc99e Initial load duke parents: diff changeset	1134 Node *slow_region = NULL;
a61af66fc99e Initial load duke parents: diff changeset	1135 Node *toobig_false = ctrl;
a61af66fc99e Initial load duke parents: diff changeset	1136
a61af66fc99e Initial load duke parents: diff changeset	1137 assert (initial_slow_test == NULL \|\| !always_slow, "arguments must be consistent");
a61af66fc99e Initial load duke parents: diff changeset	1138 // generate the initial test if necessary
a61af66fc99e Initial load duke parents: diff changeset	1139 if (initial_slow_test != NULL ) {
a61af66fc99e Initial load duke parents: diff changeset	1140 slow_region = new (C, 3) RegionNode(3);
a61af66fc99e Initial load duke parents: diff changeset	1141
a61af66fc99e Initial load duke parents: diff changeset	1142 // Now make the initial failure test. Usually a too-big test but
a61af66fc99e Initial load duke parents: diff changeset	1143 // might be a TRUE for finalizers or a fancy class check for
a61af66fc99e Initial load duke parents: diff changeset	1144 // newInstance0.
a61af66fc99e Initial load duke parents: diff changeset	1145 IfNode *toobig_iff = new (C, 2) IfNode(ctrl, initial_slow_test, PROB_MIN, COUNT_UNKNOWN);
a61af66fc99e Initial load duke parents: diff changeset	1146 transform_later(toobig_iff);
a61af66fc99e Initial load duke parents: diff changeset	1147 // Plug the failing-too-big test into the slow-path region
a61af66fc99e Initial load duke parents: diff changeset	1148 Node *toobig_true = new (C, 1) IfTrueNode( toobig_iff );
a61af66fc99e Initial load duke parents: diff changeset	1149 transform_later(toobig_true);
a61af66fc99e Initial load duke parents: diff changeset	1150 slow_region ->init_req( too_big_or_final_path, toobig_true );
a61af66fc99e Initial load duke parents: diff changeset	1151 toobig_false = new (C, 1) IfFalseNode( toobig_iff );
a61af66fc99e Initial load duke parents: diff changeset	1152 transform_later(toobig_false);
a61af66fc99e Initial load duke parents: diff changeset	1153 } else { // No initial test, just fall into next case
a61af66fc99e Initial load duke parents: diff changeset	1154 toobig_false = ctrl;
a61af66fc99e Initial load duke parents: diff changeset	1155 debug_only(slow_region = NodeSentinel);
a61af66fc99e Initial load duke parents: diff changeset	1156 }
a61af66fc99e Initial load duke parents: diff changeset	1157
a61af66fc99e Initial load duke parents: diff changeset	1158 Node *slow_mem = mem; // save the current memory state for slow path
a61af66fc99e Initial load duke parents: diff changeset	1159 // generate the fast allocation code unless we know that the initial test will always go slow
a61af66fc99e Initial load duke parents: diff changeset	1160 if (!always_slow) {
565 7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception kvn parents: 490 diff changeset	1161 // Fast path modifies only raw memory.
7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception kvn parents: 490 diff changeset	1162 if (mem->is_MergeMem()) {
7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception kvn parents: 490 diff changeset	1163 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	1164 }
7fe62bb75bf4 6799693: Server compiler leads to data corruption when expression throws an Exception kvn parents: 490 diff changeset	1165
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1166 Node* eden_top_adr;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1167 Node* eden_end_adr;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1168
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1169 set_eden_pointers(eden_top_adr, eden_end_adr);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1170
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1171 // Load Eden::end. Loop invariant and hoisted.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1172 //
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1173 // 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	1174 // 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	1175 // a safepoint. These are not oops, so they cannot be include in the oop
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1176 // map, but they can be changed by a GC. The proper way to fix this would
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1177 // 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	1178 // 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	1179 // prevent a degradation of the optimization.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 124 diff changeset	1180 // 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	1181 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	1182
0 a61af66fc99e Initial load duke parents: diff changeset	1183 // allocate the Region and Phi nodes for the result
a61af66fc99e Initial load duke parents: diff changeset	1184 result_region = new (C, 3) RegionNode(3);
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1185 result_phi_rawmem = new (C, 3) PhiNode(result_region, Type::MEMORY, TypeRawPtr::BOTTOM);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1186 result_phi_rawoop = new (C, 3) PhiNode(result_region, TypeRawPtr::BOTTOM);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1187 result_phi_i_o = new (C, 3) PhiNode(result_region, Type::ABIO); // I/O is used for Prefetch
0 a61af66fc99e Initial load duke parents: diff changeset	1188
a61af66fc99e Initial load duke parents: diff changeset	1189 // We need a Region for the loop-back contended case.
a61af66fc99e Initial load duke parents: diff changeset	1190 enum { fall_in_path = 1, contended_loopback_path = 2 };
a61af66fc99e Initial load duke parents: diff changeset	1191 Node *contended_region;
a61af66fc99e Initial load duke parents: diff changeset	1192 Node *contended_phi_rawmem;
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1193 if (UseTLAB) {
0 a61af66fc99e Initial load duke parents: diff changeset	1194 contended_region = toobig_false;
a61af66fc99e Initial load duke parents: diff changeset	1195 contended_phi_rawmem = mem;
a61af66fc99e Initial load duke parents: diff changeset	1196 } else {
a61af66fc99e Initial load duke parents: diff changeset	1197 contended_region = new (C, 3) RegionNode(3);
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1198 contended_phi_rawmem = new (C, 3) PhiNode(contended_region, Type::MEMORY, TypeRawPtr::BOTTOM);
0 a61af66fc99e Initial load duke parents: diff changeset	1199 // Now handle the passing-too-big test. We fall into the contended
a61af66fc99e Initial load duke parents: diff changeset	1200 // loop-back merge point.
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1201 contended_region ->init_req(fall_in_path, toobig_false);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1202 contended_phi_rawmem->init_req(fall_in_path, mem);
0 a61af66fc99e Initial load duke parents: diff changeset	1203 transform_later(contended_region);
a61af66fc99e Initial load duke parents: diff changeset	1204 transform_later(contended_phi_rawmem);
a61af66fc99e Initial load duke parents: diff changeset	1205 }
a61af66fc99e Initial load duke parents: diff changeset	1206
a61af66fc99e Initial load duke parents: diff changeset	1207 // Load(-locked) the heap top.
a61af66fc99e Initial load duke parents: diff changeset	1208 // See note above concerning the control input when using a TLAB
a61af66fc99e Initial load duke parents: diff changeset	1209 Node *old_eden_top = UseTLAB
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1210 ? new (C, 3) LoadPNode (ctrl, contended_phi_rawmem, eden_top_adr, TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM)
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1211 : new (C, 3) LoadPLockedNode(contended_region, contended_phi_rawmem, eden_top_adr);
0 a61af66fc99e Initial load duke parents: diff changeset	1212
a61af66fc99e Initial load duke parents: diff changeset	1213 transform_later(old_eden_top);
a61af66fc99e Initial load duke parents: diff changeset	1214 // Add to heap top to get a new heap top
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1215 Node *new_eden_top = new (C, 4) AddPNode(top(), old_eden_top, size_in_bytes);
0 a61af66fc99e Initial load duke parents: diff changeset	1216 transform_later(new_eden_top);
a61af66fc99e Initial load duke parents: diff changeset	1217 // Check for needing a GC; compare against heap end
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1218 Node *needgc_cmp = new (C, 3) CmpPNode(new_eden_top, eden_end);
0 a61af66fc99e Initial load duke parents: diff changeset	1219 transform_later(needgc_cmp);
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1220 Node *needgc_bol = new (C, 2) BoolNode(needgc_cmp, BoolTest::ge);
0 a61af66fc99e Initial load duke parents: diff changeset	1221 transform_later(needgc_bol);
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1222 IfNode *needgc_iff = new (C, 2) IfNode(contended_region, needgc_bol, PROB_UNLIKELY_MAG(4), COUNT_UNKNOWN);
0 a61af66fc99e Initial load duke parents: diff changeset	1223 transform_later(needgc_iff);
a61af66fc99e Initial load duke parents: diff changeset	1224
a61af66fc99e Initial load duke parents: diff changeset	1225 // Plug the failing-heap-space-need-gc test into the slow-path region
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1226 Node *needgc_true = new (C, 1) IfTrueNode(needgc_iff);
0 a61af66fc99e Initial load duke parents: diff changeset	1227 transform_later(needgc_true);
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1228 if (initial_slow_test) {
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1229 slow_region->init_req(need_gc_path, needgc_true);
0 a61af66fc99e Initial load duke parents: diff changeset	1230 // This completes all paths into the slow merge point
a61af66fc99e Initial load duke parents: diff changeset	1231 transform_later(slow_region);
a61af66fc99e Initial load duke parents: diff changeset	1232 } else { // No initial slow path needed!
a61af66fc99e Initial load duke parents: diff changeset	1233 // Just fall from the need-GC path straight into the VM call.
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1234 slow_region = needgc_true;
0 a61af66fc99e Initial load duke parents: diff changeset	1235 }
a61af66fc99e Initial load duke parents: diff changeset	1236 // No need for a GC. Setup for the Store-Conditional
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1237 Node *needgc_false = new (C, 1) IfFalseNode(needgc_iff);
0 a61af66fc99e Initial load duke parents: diff changeset	1238 transform_later(needgc_false);
a61af66fc99e Initial load duke parents: diff changeset	1239
a61af66fc99e Initial load duke parents: diff changeset	1240 // Grab regular I/O before optional prefetch may change it.
a61af66fc99e Initial load duke parents: diff changeset	1241 // Slow-path does no I/O so just set it to the original I/O.
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1242 result_phi_i_o->init_req(slow_result_path, i_o);
0 a61af66fc99e Initial load duke parents: diff changeset	1243
a61af66fc99e Initial load duke parents: diff changeset	1244 i_o = prefetch_allocation(i_o, needgc_false, contended_phi_rawmem,
a61af66fc99e Initial load duke parents: diff changeset	1245 old_eden_top, new_eden_top, length);
a61af66fc99e Initial load duke parents: diff changeset	1246
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1247 // Name successful fast-path variables
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1248 Node* fast_oop = old_eden_top;
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1249 Node* fast_oop_ctrl;
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1250 Node* fast_oop_rawmem;
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1251
0 a61af66fc99e Initial load duke parents: diff changeset	1252 // Store (-conditional) the modified eden top back down.
a61af66fc99e Initial load duke parents: diff changeset	1253 // StorePConditional produces flags for a test PLUS a modified raw
a61af66fc99e Initial load duke parents: diff changeset	1254 // memory state.
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1255 if (UseTLAB) {
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1256 Node* store_eden_top =
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1257 new (C, 4) StorePNode(needgc_false, contended_phi_rawmem, eden_top_adr,
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1258 TypeRawPtr::BOTTOM, new_eden_top);
0 a61af66fc99e Initial load duke parents: diff changeset	1259 transform_later(store_eden_top);
a61af66fc99e Initial load duke parents: diff changeset	1260 fast_oop_ctrl = needgc_false; // No contention, so this is the fast path
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1261 fast_oop_rawmem = store_eden_top;
0 a61af66fc99e Initial load duke parents: diff changeset	1262 } else {
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1263 Node* store_eden_top =
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1264 new (C, 5) StorePConditionalNode(needgc_false, contended_phi_rawmem, eden_top_adr,
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1265 new_eden_top, fast_oop/old_eden_top/);
0 a61af66fc99e Initial load duke parents: diff changeset	1266 transform_later(store_eden_top);
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1267 Node *contention_check = new (C, 2) BoolNode(store_eden_top, BoolTest::ne);
0 a61af66fc99e Initial load duke parents: diff changeset	1268 transform_later(contention_check);
a61af66fc99e Initial load duke parents: diff changeset	1269 store_eden_top = new (C, 1) SCMemProjNode(store_eden_top);
a61af66fc99e Initial load duke parents: diff changeset	1270 transform_later(store_eden_top);
a61af66fc99e Initial load duke parents: diff changeset	1271
a61af66fc99e Initial load duke parents: diff changeset	1272 // If not using TLABs, check to see if there was contention.
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1273 IfNode *contention_iff = new (C, 2) IfNode (needgc_false, contention_check, PROB_MIN, COUNT_UNKNOWN);
0 a61af66fc99e Initial load duke parents: diff changeset	1274 transform_later(contention_iff);
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1275 Node *contention_true = new (C, 1) IfTrueNode(contention_iff);
0 a61af66fc99e Initial load duke parents: diff changeset	1276 transform_later(contention_true);
a61af66fc99e Initial load duke parents: diff changeset	1277 // If contention, loopback and try again.
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1278 contended_region->init_req(contended_loopback_path, contention_true);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1279 contended_phi_rawmem->init_req(contended_loopback_path, store_eden_top);
0 a61af66fc99e Initial load duke parents: diff changeset	1280
a61af66fc99e Initial load duke parents: diff changeset	1281 // Fast-path succeeded with no contention!
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1282 Node *contention_false = new (C, 1) IfFalseNode(contention_iff);
0 a61af66fc99e Initial load duke parents: diff changeset	1283 transform_later(contention_false);
a61af66fc99e Initial load duke parents: diff changeset	1284 fast_oop_ctrl = contention_false;
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1285
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1286 // Bump total allocated bytes for this thread
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1287 Node* thread = new (C, 1) ThreadLocalNode();
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1288 transform_later(thread);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1289 Node* alloc_bytes_adr = basic_plus_adr(top()/not oop/, thread,
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1290 in_bytes(JavaThread::allocated_bytes_offset()));
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1291 Node* alloc_bytes = make_load(fast_oop_ctrl, store_eden_top, alloc_bytes_adr,
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1292 0, TypeLong::LONG, T_LONG);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1293 #ifdef _LP64
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1294 Node* alloc_size = size_in_bytes;
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1295 #else
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1296 Node* alloc_size = new (C, 2) ConvI2LNode(size_in_bytes);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1297 transform_later(alloc_size);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1298 #endif
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1299 Node* new_alloc_bytes = new (C, 3) AddLNode(alloc_bytes, alloc_size);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1300 transform_later(new_alloc_bytes);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1301 fast_oop_rawmem = make_store(fast_oop_ctrl, store_eden_top, alloc_bytes_adr,
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1302 0, new_alloc_bytes, T_LONG);
0 a61af66fc99e Initial load duke parents: diff changeset	1303 }
a61af66fc99e Initial load duke parents: diff changeset	1304
4763 1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1305 InitializeNode* init = alloc->initialization();
0 a61af66fc99e Initial load duke parents: diff changeset	1306 fast_oop_rawmem = initialize_object(alloc,
a61af66fc99e Initial load duke parents: diff changeset	1307 fast_oop_ctrl, fast_oop_rawmem, fast_oop,
a61af66fc99e Initial load duke parents: diff changeset	1308 klass_node, length, size_in_bytes);
a61af66fc99e Initial load duke parents: diff changeset	1309
4763 1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1310 // If initialization is performed by an array copy, any required
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1311 // MemBarStoreStore was already added. If the object does not
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1312 // escape no need for a MemBarStoreStore. Otherwise we need a
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1313 // MemBarStoreStore so that stores that initialize this object
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1314 // can't be reordered with a subsequent store that makes this
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1315 // object accessible by other threads.
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1316 if (init == NULL \|\| (!init->is_complete_with_arraycopy() && !init->does_not_escape())) {
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1317 if (init == NULL \|\| init->req() < InitializeNode::RawStores) {
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1318 // No InitializeNode or no stores captured by zeroing
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1319 // elimination. Simply add the MemBarStoreStore after object
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1320 // initialization.
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1321 MemBarNode* mb = MemBarNode::make(C, Op_MemBarStoreStore, Compile::AliasIdxBot, fast_oop_rawmem);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1322 transform_later(mb);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1323
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1324 mb->init_req(TypeFunc::Memory, fast_oop_rawmem);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1325 mb->init_req(TypeFunc::Control, fast_oop_ctrl);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1326 fast_oop_ctrl = new (C, 1) ProjNode(mb,TypeFunc::Control);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1327 transform_later(fast_oop_ctrl);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1328 fast_oop_rawmem = new (C, 1) ProjNode(mb,TypeFunc::Memory);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1329 transform_later(fast_oop_rawmem);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1330 } else {
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1331 // Add the MemBarStoreStore after the InitializeNode so that
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1332 // all stores performing the initialization that were moved
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1333 // before the InitializeNode happen before the storestore
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1334 // barrier.
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1335
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1336 Node* init_ctrl = init->proj_out(TypeFunc::Control);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1337 Node* init_mem = init->proj_out(TypeFunc::Memory);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1338
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1339 MemBarNode* mb = MemBarNode::make(C, Op_MemBarStoreStore, Compile::AliasIdxBot);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1340 transform_later(mb);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1341
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1342 Node* ctrl = new (C, 1) ProjNode(init,TypeFunc::Control);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1343 transform_later(ctrl);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1344 Node* mem = new (C, 1) ProjNode(init,TypeFunc::Memory);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1345 transform_later(mem);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1346
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1347 // The MemBarStoreStore depends on control and memory coming
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1348 // from the InitializeNode
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1349 mb->init_req(TypeFunc::Memory, mem);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1350 mb->init_req(TypeFunc::Control, ctrl);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1351
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1352 ctrl = new (C, 1) ProjNode(mb,TypeFunc::Control);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1353 transform_later(ctrl);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1354 mem = new (C, 1) ProjNode(mb,TypeFunc::Memory);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1355 transform_later(mem);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1356
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1357 // All nodes that depended on the InitializeNode for control
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1358 // and memory must now depend on the MemBarNode that itself
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1359 // depends on the InitializeNode
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1360 _igvn.replace_node(init_ctrl, ctrl);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1361 _igvn.replace_node(init_mem, mem);
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1362 }
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1363 }
1dc233a8c7fe 7121140: Allocation paths require explicit memory synchronization operations for RMO systems roland parents: 4762 diff changeset	1364
780 c96bf21b756f 6788527: Server vm intermittently fails with assertion "live value must not be garbage" with fastdebug bits kvn parents: 708 diff changeset	1365 if (C->env()->dtrace_extended_probes()) {
0 a61af66fc99e Initial load duke parents: diff changeset	1366 // Slow-path call
a61af66fc99e Initial load duke parents: diff changeset	1367 int size = TypeFunc::Parms + 2;
a61af66fc99e Initial load duke parents: diff changeset	1368 CallLeafNode *call = new (C, size) CallLeafNode(OptoRuntime::dtrace_object_alloc_Type(),
a61af66fc99e Initial load duke parents: diff changeset	1369 CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_object_alloc_base),
a61af66fc99e Initial load duke parents: diff changeset	1370 "dtrace_object_alloc",
a61af66fc99e Initial load duke parents: diff changeset	1371 TypeRawPtr::BOTTOM);
a61af66fc99e Initial load duke parents: diff changeset	1372
a61af66fc99e Initial load duke parents: diff changeset	1373 // Get base of thread-local storage area
a61af66fc99e Initial load duke parents: diff changeset	1374 Node* thread = new (C, 1) ThreadLocalNode();
a61af66fc99e Initial load duke parents: diff changeset	1375 transform_later(thread);
a61af66fc99e Initial load duke parents: diff changeset	1376
a61af66fc99e Initial load duke parents: diff changeset	1377 call->init_req(TypeFunc::Parms+0, thread);
a61af66fc99e Initial load duke parents: diff changeset	1378 call->init_req(TypeFunc::Parms+1, fast_oop);
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1379 call->init_req(TypeFunc::Control, fast_oop_ctrl);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1380 call->init_req(TypeFunc::I_O , top()); // does no i/o
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1381 call->init_req(TypeFunc::Memory , fast_oop_rawmem);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1382 call->init_req(TypeFunc::ReturnAdr, alloc->in(TypeFunc::ReturnAdr));
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1383 call->init_req(TypeFunc::FramePtr, alloc->in(TypeFunc::FramePtr));
0 a61af66fc99e Initial load duke parents: diff changeset	1384 transform_later(call);
a61af66fc99e Initial load duke parents: diff changeset	1385 fast_oop_ctrl = new (C, 1) ProjNode(call,TypeFunc::Control);
a61af66fc99e Initial load duke parents: diff changeset	1386 transform_later(fast_oop_ctrl);
a61af66fc99e Initial load duke parents: diff changeset	1387 fast_oop_rawmem = new (C, 1) ProjNode(call,TypeFunc::Memory);
a61af66fc99e Initial load duke parents: diff changeset	1388 transform_later(fast_oop_rawmem);
a61af66fc99e Initial load duke parents: diff changeset	1389 }
a61af66fc99e Initial load duke parents: diff changeset	1390
a61af66fc99e Initial load duke parents: diff changeset	1391 // Plug in the successful fast-path into the result merge point
2100 b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1392 result_region ->init_req(fast_result_path, fast_oop_ctrl);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1393 result_phi_rawoop->init_req(fast_result_path, fast_oop);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1394 result_phi_i_o ->init_req(fast_result_path, i_o);
b1a2afa37ec4 7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis phh parents: 1972 diff changeset	1395 result_phi_rawmem->init_req(fast_result_path, fast_oop_rawmem);
0 a61af66fc99e Initial load duke parents: diff changeset	1396 } else {
a61af66fc99e Initial load duke parents: diff changeset	1397 slow_region = ctrl;
4767 d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1398 result_phi_i_o = i_o; // Rename it to use in the following code.
0 a61af66fc99e Initial load duke parents: diff changeset	1399 }
a61af66fc99e Initial load duke parents: diff changeset	1400
a61af66fc99e Initial load duke parents: diff changeset	1401 // Generate slow-path call
a61af66fc99e Initial load duke parents: diff changeset	1402 CallNode *call = new (C, slow_call_type->domain()->cnt())
a61af66fc99e Initial load duke parents: diff changeset	1403 CallStaticJavaNode(slow_call_type, slow_call_address,
a61af66fc99e Initial load duke parents: diff changeset	1404 OptoRuntime::stub_name(slow_call_address),
a61af66fc99e Initial load duke parents: diff changeset	1405 alloc->jvms()->bci(),
a61af66fc99e Initial load duke parents: diff changeset	1406 TypePtr::BOTTOM);
a61af66fc99e Initial load duke parents: diff changeset	1407 call->init_req( TypeFunc::Control, slow_region );
a61af66fc99e Initial load duke parents: diff changeset	1408 call->init_req( TypeFunc::I_O , top() ) ; // does no i/o
a61af66fc99e Initial load duke parents: diff changeset	1409 call->init_req( TypeFunc::Memory , slow_mem ); // may gc ptrs
a61af66fc99e Initial load duke parents: diff changeset	1410 call->init_req( TypeFunc::ReturnAdr, alloc->in(TypeFunc::ReturnAdr) );
a61af66fc99e Initial load duke parents: diff changeset	1411 call->init_req( TypeFunc::FramePtr, alloc->in(TypeFunc::FramePtr) );
a61af66fc99e Initial load duke parents: diff changeset	1412
a61af66fc99e Initial load duke parents: diff changeset	1413 call->init_req(TypeFunc::Parms+0, klass_node);
a61af66fc99e Initial load duke parents: diff changeset	1414 if (length != NULL) {
a61af66fc99e Initial load duke parents: diff changeset	1415 call->init_req(TypeFunc::Parms+1, length);
a61af66fc99e Initial load duke parents: diff changeset	1416 }
a61af66fc99e Initial load duke parents: diff changeset	1417
a61af66fc99e Initial load duke parents: diff changeset	1418 // Copy debug information and adjust JVMState information, then replace
a61af66fc99e Initial load duke parents: diff changeset	1419 // allocate node with the call
a61af66fc99e Initial load duke parents: diff changeset	1420 copy_call_debug_info((CallNode *) alloc, call);
a61af66fc99e Initial load duke parents: diff changeset	1421 if (!always_slow) {
a61af66fc99e Initial load duke parents: diff changeset	1422 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON.
4767 d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1423 } else {
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1424 // Hook i_o projection to avoid its elimination during allocation
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1425 // replacement (when only a slow call is generated).
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1426 call->set_req(TypeFunc::I_O, result_phi_i_o);
0 a61af66fc99e Initial load duke parents: diff changeset	1427 }
1621 6027dddc26c6 6677629: PhaseIterGVN::subsume_node() should call hash_delete() and add_users_to_worklist() kvn parents: 1609 diff changeset	1428 _igvn.replace_node(alloc, call);
0 a61af66fc99e Initial load duke parents: diff changeset	1429 transform_later(call);
a61af66fc99e Initial load duke parents: diff changeset	1430
a61af66fc99e Initial load duke parents: diff changeset	1431 // Identify the output projections from the allocate node and
a61af66fc99e Initial load duke parents: diff changeset	1432 // adjust any references to them.
a61af66fc99e Initial load duke parents: diff changeset	1433 // The control and io projections look like:
a61af66fc99e Initial load duke parents: diff changeset	1434 //
a61af66fc99e Initial load duke parents: diff changeset	1435 // v---Proj(ctrl) <-----+ v---CatchProj(ctrl)
a61af66fc99e Initial load duke parents: diff changeset	1436 // Allocate Catch
a61af66fc99e Initial load duke parents: diff changeset	1437 // ^---Proj(io) <-------+ ^---CatchProj(io)
a61af66fc99e Initial load duke parents: diff changeset	1438 //
a61af66fc99e Initial load duke parents: diff changeset	1439 // We are interested in the CatchProj nodes.
a61af66fc99e Initial load duke parents: diff changeset	1440 //
a61af66fc99e Initial load duke parents: diff changeset	1441 extract_call_projections(call);
a61af66fc99e Initial load duke parents: diff changeset	1442
4767 d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1443 // An allocate node has separate memory projections for the uses on
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1444 // the control and i_o paths. Replace the control memory projection with
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1445 // result_phi_rawmem (unless we are only generating a slow call when
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1446 // both memory projections are combined)
0 a61af66fc99e Initial load duke parents: diff changeset	1447 if (!always_slow && _memproj_fallthrough != NULL) {
a61af66fc99e Initial load duke parents: diff changeset	1448 for (DUIterator_Fast imax, i = _memproj_fallthrough->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load duke parents: diff changeset	1449 Node *use = _memproj_fallthrough->fast_out(i);
6144 5e990493719e 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node, int, Node) where applicable kvn parents: 4894 diff changeset	1450 _igvn.rehash_node_delayed(use);
0 a61af66fc99e Initial load duke parents: diff changeset	1451 imax -= replace_input(use, _memproj_fallthrough, result_phi_rawmem);
a61af66fc99e Initial load duke parents: diff changeset	1452 // back up iterator
a61af66fc99e Initial load duke parents: diff changeset	1453 --i;
a61af66fc99e Initial load duke parents: diff changeset	1454 }
a61af66fc99e Initial load duke parents: diff changeset	1455 }
4767 d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1456 // Now change uses of _memproj_catchall to use _memproj_fallthrough and delete
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1457 // _memproj_catchall so we end up with a call that has only 1 memory projection.
0 a61af66fc99e Initial load duke parents: diff changeset	1458 if (_memproj_catchall != NULL ) {
a61af66fc99e Initial load duke parents: diff changeset	1459 if (_memproj_fallthrough == NULL) {
a61af66fc99e Initial load duke parents: diff changeset	1460 _memproj_fallthrough = new (C, 1) ProjNode(call, TypeFunc::Memory);
a61af66fc99e Initial load duke parents: diff changeset	1461 transform_later(_memproj_fallthrough);
a61af66fc99e Initial load duke parents: diff changeset	1462 }
a61af66fc99e Initial load duke parents: diff changeset	1463 for (DUIterator_Fast imax, i = _memproj_catchall->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load duke parents: diff changeset	1464 Node *use = _memproj_catchall->fast_out(i);
6144 5e990493719e 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node, int, Node) where applicable kvn parents: 4894 diff changeset	1465 _igvn.rehash_node_delayed(use);
0 a61af66fc99e Initial load duke parents: diff changeset	1466 imax -= replace_input(use, _memproj_catchall, _memproj_fallthrough);
a61af66fc99e Initial load duke parents: diff changeset	1467 // back up iterator
a61af66fc99e Initial load duke parents: diff changeset	1468 --i;
a61af66fc99e Initial load duke parents: diff changeset	1469 }
4767 d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1470 assert(_memproj_catchall->outcnt() == 0, "all uses must be deleted");
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1471 _igvn.remove_dead_node(_memproj_catchall);
0 a61af66fc99e Initial load duke parents: diff changeset	1472 }
a61af66fc99e Initial load duke parents: diff changeset	1473
4767 d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1474 // An allocate node has separate i_o projections for the uses on the control
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1475 // and i_o paths. Always replace the control i_o projection with result i_o
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1476 // otherwise incoming i_o become dead when only a slow call is generated
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1477 // (it is different from memory projections where both projections are
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1478 // combined in such case).
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1479 if (_ioproj_fallthrough != NULL) {
0 a61af66fc99e Initial load duke parents: diff changeset	1480 for (DUIterator_Fast imax, i = _ioproj_fallthrough->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load duke parents: diff changeset	1481 Node *use = _ioproj_fallthrough->fast_out(i);
6144 5e990493719e 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node, int, Node) where applicable kvn parents: 4894 diff changeset	1482 _igvn.rehash_node_delayed(use);
0 a61af66fc99e Initial load duke parents: diff changeset	1483 imax -= replace_input(use, _ioproj_fallthrough, result_phi_i_o);
a61af66fc99e Initial load duke parents: diff changeset	1484 // back up iterator
a61af66fc99e Initial load duke parents: diff changeset	1485 --i;
a61af66fc99e Initial load duke parents: diff changeset	1486 }
a61af66fc99e Initial load duke parents: diff changeset	1487 }
4767 d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1488 // Now change uses of _ioproj_catchall to use _ioproj_fallthrough and delete
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1489 // _ioproj_catchall so we end up with a call that has only 1 i_o projection.
0 a61af66fc99e Initial load duke parents: diff changeset	1490 if (_ioproj_catchall != NULL ) {
4767 d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1491 if (_ioproj_fallthrough == NULL) {
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1492 _ioproj_fallthrough = new (C, 1) ProjNode(call, TypeFunc::I_O);
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1493 transform_later(_ioproj_fallthrough);
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1494 }
0 a61af66fc99e Initial load duke parents: diff changeset	1495 for (DUIterator_Fast imax, i = _ioproj_catchall->fast_outs(imax); i < imax; i++) {
a61af66fc99e Initial load duke parents: diff changeset	1496 Node *use = _ioproj_catchall->fast_out(i);
6144 5e990493719e 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node, int, Node) where applicable kvn parents: 4894 diff changeset	1497 _igvn.rehash_node_delayed(use);
0 a61af66fc99e Initial load duke parents: diff changeset	1498 imax -= replace_input(use, _ioproj_catchall, _ioproj_fallthrough);
a61af66fc99e Initial load duke parents: diff changeset	1499 // back up iterator
a61af66fc99e Initial load duke parents: diff changeset	1500 --i;
a61af66fc99e Initial load duke parents: diff changeset	1501 }
4767 d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1502 assert(_ioproj_catchall->outcnt() == 0, "all uses must be deleted");
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1503 _igvn.remove_dead_node(_ioproj_catchall);
0 a61af66fc99e Initial load duke parents: diff changeset	1504 }
a61af66fc99e Initial load duke parents: diff changeset	1505
a61af66fc99e Initial load duke parents: diff changeset	1506 // if we generated only a slow call, we are done
4767 d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1507 if (always_slow) {
d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1508 // Now we can unhook i_o.
4769 9c87bcb3b4dd 7125879: assert(proj != NULL) failed: must be found kvn parents: 4767 diff changeset	1509 if (result_phi_i_o->outcnt() > 1) {
9c87bcb3b4dd 7125879: assert(proj != NULL) failed: must be found kvn parents: 4767 diff changeset	1510 call->set_req(TypeFunc::I_O, top());
9c87bcb3b4dd 7125879: assert(proj != NULL) failed: must be found kvn parents: 4767 diff changeset	1511 } else {
9c87bcb3b4dd 7125879: assert(proj != NULL) failed: must be found kvn parents: 4767 diff changeset	1512 assert(result_phi_i_o->unique_ctrl_out() == call, "");
9c87bcb3b4dd 7125879: assert(proj != NULL) failed: must be found kvn parents: 4767 diff changeset	1513 // Case of new array with negative size known during compilation.
9c87bcb3b4dd 7125879: assert(proj != NULL) failed: must be found kvn parents: 4767 diff changeset	1514 // AllocateArrayNode::Ideal() optimization disconnect unreachable
9c87bcb3b4dd 7125879: assert(proj != NULL) failed: must be found kvn parents: 4767 diff changeset	1515 // following code since call to runtime will throw exception.
9c87bcb3b4dd 7125879: assert(proj != NULL) failed: must be found kvn parents: 4767 diff changeset	1516 // As result there will be no users of i_o after the call.
9c87bcb3b4dd 7125879: assert(proj != NULL) failed: must be found kvn parents: 4767 diff changeset	1517 // Leave i_o attached to this call to avoid problems in preceding graph.
9c87bcb3b4dd 7125879: assert(proj != NULL) failed: must be found kvn parents: 4767 diff changeset	1518 }
0 a61af66fc99e Initial load duke parents: diff changeset	1519 return;
4767 d12a66fa3820 7123954: Some CTW test crash with SIGSEGV kvn parents: 4763 diff changeset	1520 }
0 a61af66fc99e Initial load duke parents: diff changeset	1521
a61af66fc99e Initial load duke parents: diff changeset	1522
a61af66fc99e Initial load duke parents: diff changeset	1523 if (_fallthroughcatchproj != NULL) {
a61af66fc99e Initial load duke parents: diff changeset	1524 ctrl = _fallthroughcatchproj->clone();
a61af66fc99e Initial load duke parents: diff changeset	1525 transform_later(ctrl);
708 f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	1526 _igvn.replace_node(_fallthroughcatchproj, result_region);
0 a61af66fc99e Initial load duke parents: diff changeset	1527 } else {
a61af66fc99e Initial load duke parents: diff changeset	1528 ctrl = top();
a61af66fc99e Initial load duke parents: diff changeset	1529 }
a61af66fc99e Initial load duke parents: diff changeset	1530 Node *slow_result;
a61af66fc99e Initial load duke parents: diff changeset	1531 if (_resproj == NULL) {
a61af66fc99e Initial load duke parents: diff changeset	1532 // no uses of the allocation result
a61af66fc99e Initial load duke parents: diff changeset	1533 slow_result = top();
a61af66fc99e Initial load duke parents: diff changeset	1534 } else {
a61af66fc99e Initial load duke parents: diff changeset	1535 slow_result = _resproj->clone();
a61af66fc99e Initial load duke parents: diff changeset	1536 transform_later(slow_result);
708 f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	1537 _igvn.replace_node(_resproj, result_phi_rawoop);
0 a61af66fc99e Initial load duke parents: diff changeset	1538 }
a61af66fc99e Initial load duke parents: diff changeset	1539
a61af66fc99e Initial load duke parents: diff changeset	1540 // Plug slow-path into result merge point
a61af66fc99e Initial load duke parents: diff changeset	1541 result_region ->init_req( slow_result_path, ctrl );
a61af66fc99e Initial load duke parents: diff changeset	1542 result_phi_rawoop->init_req( slow_result_path, slow_result);
a61af66fc99e Initial load duke parents: diff changeset	1543 result_phi_rawmem->init_req( slow_result_path, _memproj_fallthrough );
a61af66fc99e Initial load duke parents: diff changeset	1544 transform_later(result_region);
a61af66fc99e Initial load duke parents: diff changeset	1545 transform_later(result_phi_rawoop);
a61af66fc99e Initial load duke parents: diff changeset	1546 transform_later(result_phi_rawmem);
a61af66fc99e Initial load duke parents: diff changeset	1547 transform_later(result_phi_i_o);
a61af66fc99e Initial load duke parents: diff changeset	1548 // This completes all paths into the result merge point
a61af66fc99e Initial load duke parents: diff changeset	1549 }
a61af66fc99e Initial load duke parents: diff changeset	1550
a61af66fc99e Initial load duke parents: diff changeset	1551
a61af66fc99e Initial load duke parents: diff changeset	1552 // Helper for PhaseMacroExpand::expand_allocate_common.
a61af66fc99e Initial load duke parents: diff changeset	1553 // Initializes the newly-allocated storage.
a61af66fc99e Initial load duke parents: diff changeset	1554 Node*
a61af66fc99e Initial load duke parents: diff changeset	1555 PhaseMacroExpand::initialize_object(AllocateNode* alloc,
a61af66fc99e Initial load duke parents: diff changeset	1556 Node* control, Node* rawmem, Node* object,
a61af66fc99e Initial load duke parents: diff changeset	1557 Node* klass_node, Node* length,
a61af66fc99e Initial load duke parents: diff changeset	1558 Node* size_in_bytes) {
a61af66fc99e Initial load duke parents: diff changeset	1559 InitializeNode* init = alloc->initialization();
a61af66fc99e Initial load duke parents: diff changeset	1560 // Store the klass & mark bits
a61af66fc99e Initial load duke parents: diff changeset	1561 Node* mark_node = NULL;
a61af66fc99e Initial load duke parents: diff changeset	1562 // For now only enable fast locking for non-array types
a61af66fc99e Initial load duke parents: diff changeset	1563 if (UseBiasedLocking && (length == NULL)) {
4762 069ab3f976d3 7118863: Move sizeof(klassOopDesc) into the Klass::_offset_in_bytes() functions stefank parents: 4115 diff changeset	1564 mark_node = make_load(control, rawmem, klass_node, in_bytes(Klass::prototype_header_offset()), TypeRawPtr::BOTTOM, T_ADDRESS);
0 a61af66fc99e Initial load duke parents: diff changeset	1565 } else {
a61af66fc99e Initial load duke parents: diff changeset	1566 mark_node = makecon(TypeRawPtr::make((address)markOopDesc::prototype()));
a61af66fc99e Initial load duke parents: diff changeset	1567 }
a61af66fc99e Initial load duke parents: diff changeset	1568 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	1569
6725 da91efe96a93 6964458: Reimplement class meta-data storage to use native memory coleenp parents: 6197 diff changeset	1570 rawmem = make_store(control, rawmem, object, oopDesc::klass_offset_in_bytes(), klass_node, T_METADATA);
0 a61af66fc99e Initial load duke parents: diff changeset	1571 int header_size = alloc->minimum_header_size(); // conservatively small
a61af66fc99e Initial load duke parents: diff changeset	1572
a61af66fc99e Initial load duke parents: diff changeset	1573 // Array length
a61af66fc99e Initial load duke parents: diff changeset	1574 if (length != NULL) { // Arrays need length field
a61af66fc99e Initial load duke parents: diff changeset	1575 rawmem = make_store(control, rawmem, object, arrayOopDesc::length_offset_in_bytes(), length, T_INT);
a61af66fc99e Initial load duke parents: diff changeset	1576 // conservatively small header size:
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 73 diff changeset	1577 header_size = arrayOopDesc::base_offset_in_bytes(T_BYTE);
0 a61af66fc99e Initial load duke parents: diff changeset	1578 ciKlass* k = _igvn.type(klass_node)->is_klassptr()->klass();
a61af66fc99e Initial load duke parents: diff changeset	1579 if (k->is_array_klass()) // we know the exact header size in most cases:
a61af66fc99e Initial load duke parents: diff changeset	1580 header_size = Klass::layout_helper_header_size(k->layout_helper());
a61af66fc99e Initial load duke parents: diff changeset	1581 }
a61af66fc99e Initial load duke parents: diff changeset	1582
a61af66fc99e Initial load duke parents: diff changeset	1583 // Clear the object body, if necessary.
a61af66fc99e Initial load duke parents: diff changeset	1584 if (init == NULL) {
a61af66fc99e Initial load duke parents: diff changeset	1585 // The init has somehow disappeared; be cautious and clear everything.
a61af66fc99e Initial load duke parents: diff changeset	1586 //
a61af66fc99e Initial load duke parents: diff changeset	1587 // This can happen if a node is allocated but an uncommon trap occurs
a61af66fc99e Initial load duke parents: diff changeset	1588 // immediately. In this case, the Initialize gets associated with the
a61af66fc99e Initial load duke parents: diff changeset	1589 // trap, and may be placed in a different (outer) loop, if the Allocate
a61af66fc99e Initial load duke parents: diff changeset	1590 // is in a loop. If (this is rare) the inner loop gets unrolled, then
a61af66fc99e Initial load duke parents: diff changeset	1591 // there can be two Allocates to one Initialize. The answer in all these
a61af66fc99e Initial load duke parents: diff changeset	1592 // edge cases is safety first. It is always safe to clear immediately
a61af66fc99e Initial load duke parents: diff changeset	1593 // within an Allocate, and then (maybe or maybe not) clear some more later.
a61af66fc99e Initial load duke parents: diff changeset	1594 if (!ZeroTLAB)
a61af66fc99e Initial load duke parents: diff changeset	1595 rawmem = ClearArrayNode::clear_memory(control, rawmem, object,
a61af66fc99e Initial load duke parents: diff changeset	1596 header_size, size_in_bytes,
a61af66fc99e Initial load duke parents: diff changeset	1597 &_igvn);
a61af66fc99e Initial load duke parents: diff changeset	1598 } else {
a61af66fc99e Initial load duke parents: diff changeset	1599 if (!init->is_complete()) {
a61af66fc99e Initial load duke parents: diff changeset	1600 // Try to win by zeroing only what the init does not store.
a61af66fc99e Initial load duke parents: diff changeset	1601 // We can also try to do some peephole optimizations,
a61af66fc99e Initial load duke parents: diff changeset	1602 // such as combining some adjacent subword stores.
a61af66fc99e Initial load duke parents: diff changeset	1603 rawmem = init->complete_stores(control, rawmem, object,
a61af66fc99e Initial load duke parents: diff changeset	1604 header_size, size_in_bytes, &_igvn);
a61af66fc99e Initial load duke parents: diff changeset	1605 }
a61af66fc99e Initial load duke parents: diff changeset	1606 // We have no more use for this link, since the AllocateNode goes away:
a61af66fc99e Initial load duke parents: diff changeset	1607 init->set_req(InitializeNode::RawAddress, top());
a61af66fc99e Initial load duke parents: diff changeset	1608 // (If we keep the link, it just confuses the register allocator,
a61af66fc99e Initial load duke parents: diff changeset	1609 // who thinks he sees a real use of the address by the membar.)
a61af66fc99e Initial load duke parents: diff changeset	1610 }
a61af66fc99e Initial load duke parents: diff changeset	1611
a61af66fc99e Initial load duke parents: diff changeset	1612 return rawmem;
a61af66fc99e Initial load duke parents: diff changeset	1613 }
a61af66fc99e Initial load duke parents: diff changeset	1614
a61af66fc99e Initial load duke parents: diff changeset	1615 // Generate prefetch instructions for next allocations.
a61af66fc99e Initial load duke parents: diff changeset	1616 Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
a61af66fc99e Initial load duke parents: diff changeset	1617 Node*& contended_phi_rawmem,
a61af66fc99e Initial load duke parents: diff changeset	1618 Node* old_eden_top, Node* new_eden_top,
a61af66fc99e Initial load duke parents: diff changeset	1619 Node* length) {
1367 9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1620 enum { fall_in_path = 1, pf_path = 2 };
0 a61af66fc99e Initial load duke parents: diff changeset	1621 if( UseTLAB && AllocatePrefetchStyle == 2 ) {
a61af66fc99e Initial load duke parents: diff changeset	1622 // Generate prefetch allocation with watermark check.
a61af66fc99e Initial load duke parents: diff changeset	1623 // As an allocation hits the watermark, we will prefetch starting
a61af66fc99e Initial load duke parents: diff changeset	1624 // at a "distance" away from watermark.
a61af66fc99e Initial load duke parents: diff changeset	1625
a61af66fc99e Initial load duke parents: diff changeset	1626 Node *pf_region = new (C, 3) RegionNode(3);
a61af66fc99e Initial load duke parents: diff changeset	1627 Node *pf_phi_rawmem = new (C, 3) PhiNode( pf_region, Type::MEMORY,
a61af66fc99e Initial load duke parents: diff changeset	1628 TypeRawPtr::BOTTOM );
a61af66fc99e Initial load duke parents: diff changeset	1629 // I/O is used for Prefetch
a61af66fc99e Initial load duke parents: diff changeset	1630 Node *pf_phi_abio = new (C, 3) PhiNode( pf_region, Type::ABIO );
a61af66fc99e Initial load duke parents: diff changeset	1631
a61af66fc99e Initial load duke parents: diff changeset	1632 Node *thread = new (C, 1) ThreadLocalNode();
a61af66fc99e Initial load duke parents: diff changeset	1633 transform_later(thread);
a61af66fc99e Initial load duke parents: diff changeset	1634
a61af66fc99e Initial load duke parents: diff changeset	1635 Node eden_pf_adr = new (C, 4) AddPNode( top()/not oop*/, thread,
a61af66fc99e Initial load duke parents: diff changeset	1636 _igvn.MakeConX(in_bytes(JavaThread::tlab_pf_top_offset())) );
a61af66fc99e Initial load duke parents: diff changeset	1637 transform_later(eden_pf_adr);
a61af66fc99e Initial load duke parents: diff changeset	1638
a61af66fc99e Initial load duke parents: diff changeset	1639 Node *old_pf_wm = new (C, 3) LoadPNode( needgc_false,
a61af66fc99e Initial load duke parents: diff changeset	1640 contended_phi_rawmem, eden_pf_adr,
a61af66fc99e Initial load duke parents: diff changeset	1641 TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM );
a61af66fc99e Initial load duke parents: diff changeset	1642 transform_later(old_pf_wm);
a61af66fc99e Initial load duke parents: diff changeset	1643
a61af66fc99e Initial load duke parents: diff changeset	1644 // check against new_eden_top
a61af66fc99e Initial load duke parents: diff changeset	1645 Node *need_pf_cmp = new (C, 3) CmpPNode( new_eden_top, old_pf_wm );
a61af66fc99e Initial load duke parents: diff changeset	1646 transform_later(need_pf_cmp);
a61af66fc99e Initial load duke parents: diff changeset	1647 Node *need_pf_bol = new (C, 2) BoolNode( need_pf_cmp, BoolTest::ge );
a61af66fc99e Initial load duke parents: diff changeset	1648 transform_later(need_pf_bol);
a61af66fc99e Initial load duke parents: diff changeset	1649 IfNode *need_pf_iff = new (C, 2) IfNode( needgc_false, need_pf_bol,
a61af66fc99e Initial load duke parents: diff changeset	1650 PROB_UNLIKELY_MAG(4), COUNT_UNKNOWN );
a61af66fc99e Initial load duke parents: diff changeset	1651 transform_later(need_pf_iff);
a61af66fc99e Initial load duke parents: diff changeset	1652
a61af66fc99e Initial load duke parents: diff changeset	1653 // true node, add prefetchdistance
a61af66fc99e Initial load duke parents: diff changeset	1654 Node *need_pf_true = new (C, 1) IfTrueNode( need_pf_iff );
a61af66fc99e Initial load duke parents: diff changeset	1655 transform_later(need_pf_true);
a61af66fc99e Initial load duke parents: diff changeset	1656
a61af66fc99e Initial load duke parents: diff changeset	1657 Node *need_pf_false = new (C, 1) IfFalseNode( need_pf_iff );
a61af66fc99e Initial load duke parents: diff changeset	1658 transform_later(need_pf_false);
a61af66fc99e Initial load duke parents: diff changeset	1659
a61af66fc99e Initial load duke parents: diff changeset	1660 Node *new_pf_wmt = new (C, 4) AddPNode( top(), old_pf_wm,
a61af66fc99e Initial load duke parents: diff changeset	1661 _igvn.MakeConX(AllocatePrefetchDistance) );
a61af66fc99e Initial load duke parents: diff changeset	1662 transform_later(new_pf_wmt );
a61af66fc99e Initial load duke parents: diff changeset	1663 new_pf_wmt->set_req(0, need_pf_true);
a61af66fc99e Initial load duke parents: diff changeset	1664
a61af66fc99e Initial load duke parents: diff changeset	1665 Node *store_new_wmt = new (C, 4) StorePNode( need_pf_true,
a61af66fc99e Initial load duke parents: diff changeset	1666 contended_phi_rawmem, eden_pf_adr,
a61af66fc99e Initial load duke parents: diff changeset	1667 TypeRawPtr::BOTTOM, new_pf_wmt );
a61af66fc99e Initial load duke parents: diff changeset	1668 transform_later(store_new_wmt);
a61af66fc99e Initial load duke parents: diff changeset	1669
a61af66fc99e Initial load duke parents: diff changeset	1670 // adding prefetches
a61af66fc99e Initial load duke parents: diff changeset	1671 pf_phi_abio->init_req( fall_in_path, i_o );
a61af66fc99e Initial load duke parents: diff changeset	1672
a61af66fc99e Initial load duke parents: diff changeset	1673 Node *prefetch_adr;
a61af66fc99e Initial load duke parents: diff changeset	1674 Node *prefetch;
a61af66fc99e Initial load duke parents: diff changeset	1675 uint lines = AllocatePrefetchDistance / AllocatePrefetchStepSize;
a61af66fc99e Initial load duke parents: diff changeset	1676 uint step_size = AllocatePrefetchStepSize;
a61af66fc99e Initial load duke parents: diff changeset	1677 uint distance = 0;
a61af66fc99e Initial load duke parents: diff changeset	1678
a61af66fc99e Initial load duke parents: diff changeset	1679 for ( uint i = 0; i < lines; i++ ) {
a61af66fc99e Initial load duke parents: diff changeset	1680 prefetch_adr = new (C, 4) AddPNode( old_pf_wm, new_pf_wmt,
a61af66fc99e Initial load duke parents: diff changeset	1681 _igvn.MakeConX(distance) );
a61af66fc99e Initial load duke parents: diff changeset	1682 transform_later(prefetch_adr);
3854 1af104d6cf99 7079329: Adjust allocation prefetching for T4 kvn parents: 3849 diff changeset	1683 prefetch = new (C, 3) PrefetchAllocationNode( i_o, prefetch_adr );
0 a61af66fc99e Initial load duke parents: diff changeset	1684 transform_later(prefetch);
a61af66fc99e Initial load duke parents: diff changeset	1685 distance += step_size;
a61af66fc99e Initial load duke parents: diff changeset	1686 i_o = prefetch;
a61af66fc99e Initial load duke parents: diff changeset	1687 }
a61af66fc99e Initial load duke parents: diff changeset	1688 pf_phi_abio->set_req( pf_path, i_o );
a61af66fc99e Initial load duke parents: diff changeset	1689
a61af66fc99e Initial load duke parents: diff changeset	1690 pf_region->init_req( fall_in_path, need_pf_false );
a61af66fc99e Initial load duke parents: diff changeset	1691 pf_region->init_req( pf_path, need_pf_true );
a61af66fc99e Initial load duke parents: diff changeset	1692
a61af66fc99e Initial load duke parents: diff changeset	1693 pf_phi_rawmem->init_req( fall_in_path, contended_phi_rawmem );
a61af66fc99e Initial load duke parents: diff changeset	1694 pf_phi_rawmem->init_req( pf_path, store_new_wmt );
a61af66fc99e Initial load duke parents: diff changeset	1695
a61af66fc99e Initial load duke parents: diff changeset	1696 transform_later(pf_region);
a61af66fc99e Initial load duke parents: diff changeset	1697 transform_later(pf_phi_rawmem);
a61af66fc99e Initial load duke parents: diff changeset	1698 transform_later(pf_phi_abio);
a61af66fc99e Initial load duke parents: diff changeset	1699
a61af66fc99e Initial load duke parents: diff changeset	1700 needgc_false = pf_region;
a61af66fc99e Initial load duke parents: diff changeset	1701 contended_phi_rawmem = pf_phi_rawmem;
a61af66fc99e Initial load duke parents: diff changeset	1702 i_o = pf_phi_abio;
1367 9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1703 } else if( UseTLAB && AllocatePrefetchStyle == 3 ) {
3854 1af104d6cf99 7079329: Adjust allocation prefetching for T4 kvn parents: 3849 diff changeset	1704 // Insert a prefetch for each allocation.
1af104d6cf99 7079329: Adjust allocation prefetching for T4 kvn parents: 3849 diff changeset	1705 // This code is used for Sparc with BIS.
1367 9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1706 Node *pf_region = new (C, 3) RegionNode(3);
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1707 Node *pf_phi_rawmem = new (C, 3) PhiNode( pf_region, Type::MEMORY,
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1708 TypeRawPtr::BOTTOM );
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1709
3854 1af104d6cf99 7079329: Adjust allocation prefetching for T4 kvn parents: 3849 diff changeset	1710 // Generate several prefetch instructions.
1af104d6cf99 7079329: Adjust allocation prefetching for T4 kvn parents: 3849 diff changeset	1711 uint lines = (length != NULL) ? AllocatePrefetchLines : AllocateInstancePrefetchLines;
1367 9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1712 uint step_size = AllocatePrefetchStepSize;
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1713 uint distance = AllocatePrefetchDistance;
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1714
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1715 // Next cache address.
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1716 Node *cache_adr = new (C, 4) AddPNode(old_eden_top, old_eden_top,
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1717 _igvn.MakeConX(distance));
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1718 transform_later(cache_adr);
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1719 cache_adr = new (C, 2) CastP2XNode(needgc_false, cache_adr);
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1720 transform_later(cache_adr);
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1721 Node* mask = _igvn.MakeConX(~(intptr_t)(step_size-1));
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1722 cache_adr = new (C, 3) AndXNode(cache_adr, mask);
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1723 transform_later(cache_adr);
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1724 cache_adr = new (C, 2) CastX2PNode(cache_adr);
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1725 transform_later(cache_adr);
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1726
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1727 // Prefetch
3854 1af104d6cf99 7079329: Adjust allocation prefetching for T4 kvn parents: 3849 diff changeset	1728 Node *prefetch = new (C, 3) PrefetchAllocationNode( contended_phi_rawmem, cache_adr );
1367 9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1729 prefetch->set_req(0, needgc_false);
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1730 transform_later(prefetch);
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1731 contended_phi_rawmem = prefetch;
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1732 Node *prefetch_adr;
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1733 distance = step_size;
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1734 for ( uint i = 1; i < lines; i++ ) {
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1735 prefetch_adr = new (C, 4) AddPNode( cache_adr, cache_adr,
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1736 _igvn.MakeConX(distance) );
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1737 transform_later(prefetch_adr);
3854 1af104d6cf99 7079329: Adjust allocation prefetching for T4 kvn parents: 3849 diff changeset	1738 prefetch = new (C, 3) PrefetchAllocationNode( contended_phi_rawmem, prefetch_adr );
1367 9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1739 transform_later(prefetch);
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1740 distance += step_size;
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1741 contended_phi_rawmem = prefetch;
9e321dcfa5b7 6940726: Use BIS instruction for allocation prefetch on Sparc kvn parents: 1100 diff changeset	1742 }
0 a61af66fc99e Initial load duke parents: diff changeset	1743 } else if( AllocatePrefetchStyle > 0 ) {
a61af66fc99e Initial load duke parents: diff changeset	1744 // Insert a prefetch for each allocation only on the fast-path
a61af66fc99e Initial load duke parents: diff changeset	1745 Node *prefetch_adr;
a61af66fc99e Initial load duke parents: diff changeset	1746 Node *prefetch;
3854 1af104d6cf99 7079329: Adjust allocation prefetching for T4 kvn parents: 3849 diff changeset	1747 // Generate several prefetch instructions.
1af104d6cf99 7079329: Adjust allocation prefetching for T4 kvn parents: 3849 diff changeset	1748 uint lines = (length != NULL) ? AllocatePrefetchLines : AllocateInstancePrefetchLines;
0 a61af66fc99e Initial load duke parents: diff changeset	1749 uint step_size = AllocatePrefetchStepSize;
a61af66fc99e Initial load duke parents: diff changeset	1750 uint distance = AllocatePrefetchDistance;
a61af66fc99e Initial load duke parents: diff changeset	1751 for ( uint i = 0; i < lines; i++ ) {
a61af66fc99e Initial load duke parents: diff changeset	1752 prefetch_adr = new (C, 4) AddPNode( old_eden_top, new_eden_top,
a61af66fc99e Initial load duke parents: diff changeset	1753 _igvn.MakeConX(distance) );
a61af66fc99e Initial load duke parents: diff changeset	1754 transform_later(prefetch_adr);
3854 1af104d6cf99 7079329: Adjust allocation prefetching for T4 kvn parents: 3849 diff changeset	1755 prefetch = new (C, 3) PrefetchAllocationNode( i_o, prefetch_adr );
0 a61af66fc99e Initial load duke parents: diff changeset	1756 // Do not let it float too high, since if eden_top == eden_end,
a61af66fc99e Initial load duke parents: diff changeset	1757 // both might be null.
a61af66fc99e Initial load duke parents: diff changeset	1758 if( i == 0 ) { // Set control for first prefetch, next follows it
a61af66fc99e Initial load duke parents: diff changeset	1759 prefetch->init_req(0, needgc_false);
a61af66fc99e Initial load duke parents: diff changeset	1760 }
a61af66fc99e Initial load duke parents: diff changeset	1761 transform_later(prefetch);
a61af66fc99e Initial load duke parents: diff changeset	1762 distance += step_size;
a61af66fc99e Initial load duke parents: diff changeset	1763 i_o = prefetch;
a61af66fc99e Initial load duke parents: diff changeset	1764 }
a61af66fc99e Initial load duke parents: diff changeset	1765 }
a61af66fc99e Initial load duke parents: diff changeset	1766 return i_o;
a61af66fc99e Initial load duke parents: diff changeset	1767 }
a61af66fc99e Initial load duke parents: diff changeset	1768
a61af66fc99e Initial load duke parents: diff changeset	1769
a61af66fc99e Initial load duke parents: diff changeset	1770 void PhaseMacroExpand::expand_allocate(AllocateNode *alloc) {
a61af66fc99e Initial load duke parents: diff changeset	1771 expand_allocate_common(alloc, NULL,
a61af66fc99e Initial load duke parents: diff changeset	1772 OptoRuntime::new_instance_Type(),
a61af66fc99e Initial load duke parents: diff changeset	1773 OptoRuntime::new_instance_Java());
a61af66fc99e Initial load duke parents: diff changeset	1774 }
a61af66fc99e Initial load duke parents: diff changeset	1775
a61af66fc99e Initial load duke parents: diff changeset	1776 void PhaseMacroExpand::expand_allocate_array(AllocateArrayNode *alloc) {
a61af66fc99e Initial load duke parents: diff changeset	1777 Node* length = alloc->in(AllocateNode::ALength);
3961 a92cdbac8b9e 7081933: Use zeroing elimination optimization for large array kvn parents: 3854 diff changeset	1778 InitializeNode* init = alloc->initialization();
a92cdbac8b9e 7081933: Use zeroing elimination optimization for large array kvn parents: 3854 diff changeset	1779 Node* klass_node = alloc->in(AllocateNode::KlassNode);
a92cdbac8b9e 7081933: Use zeroing elimination optimization for large array kvn parents: 3854 diff changeset	1780 ciKlass* k = _igvn.type(klass_node)->is_klassptr()->klass();
a92cdbac8b9e 7081933: Use zeroing elimination optimization for large array kvn parents: 3854 diff changeset	1781 address slow_call_address; // Address of slow call
a92cdbac8b9e 7081933: Use zeroing elimination optimization for large array kvn parents: 3854 diff changeset	1782 if (init != NULL && init->is_complete_with_arraycopy() &&
a92cdbac8b9e 7081933: Use zeroing elimination optimization for large array kvn parents: 3854 diff changeset	1783 k->is_type_array_klass()) {
a92cdbac8b9e 7081933: Use zeroing elimination optimization for large array kvn parents: 3854 diff changeset	1784 // Don't zero type array during slow allocation in VM since
a92cdbac8b9e 7081933: Use zeroing elimination optimization for large array kvn parents: 3854 diff changeset	1785 // it will be initialized later by arraycopy in compiled code.
a92cdbac8b9e 7081933: Use zeroing elimination optimization for large array kvn parents: 3854 diff changeset	1786 slow_call_address = OptoRuntime::new_array_nozero_Java();
a92cdbac8b9e 7081933: Use zeroing elimination optimization for large array kvn parents: 3854 diff changeset	1787 } else {
a92cdbac8b9e 7081933: Use zeroing elimination optimization for large array kvn parents: 3854 diff changeset	1788 slow_call_address = OptoRuntime::new_array_Java();
a92cdbac8b9e 7081933: Use zeroing elimination optimization for large array kvn parents: 3854 diff changeset	1789 }
0 a61af66fc99e Initial load duke parents: diff changeset	1790 expand_allocate_common(alloc, length,
a61af66fc99e Initial load duke parents: diff changeset	1791 OptoRuntime::new_array_Type(),
3961 a92cdbac8b9e 7081933: Use zeroing elimination optimization for large array kvn parents: 3854 diff changeset	1792 slow_call_address);
0 a61af66fc99e Initial load duke parents: diff changeset	1793 }
a61af66fc99e Initial load duke parents: diff changeset	1794
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1795 //-------------------mark_eliminated_box----------------------------------
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1796 //
3754 642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1797 // During EA obj may point to several objects but after few ideal graph
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1798 // transformations (CCP) it may point to only one non escaping object
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1799 // (but still using phi), corresponding locks and unlocks will be marked
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1800 // for elimination. Later obj could be replaced with a new node (new phi)
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1801 // and which does not have escape information. And later after some graph
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1802 // reshape other locks and unlocks (which were not marked for elimination
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1803 // before) are connected to this new obj (phi) but they still will not be
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1804 // marked for elimination since new obj has no escape information.
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1805 // Mark all associated (same box and obj) lock and unlock nodes for
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1806 // elimination if some of them marked already.
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1807 void PhaseMacroExpand::mark_eliminated_box(Node* oldbox, Node* obj) {
4792 89d0a5d40008 7129618: assert(obj_node->eqv_uncast(obj),""); kvn parents: 4790 diff changeset	1808 if (oldbox->as_BoxLock()->is_eliminated())
89d0a5d40008 7129618: assert(obj_node->eqv_uncast(obj),""); kvn parents: 4790 diff changeset	1809 return; // This BoxLock node was processed already.
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1810
4792 89d0a5d40008 7129618: assert(obj_node->eqv_uncast(obj),""); kvn parents: 4790 diff changeset	1811 // New implementation (EliminateNestedLocks) has separate BoxLock
89d0a5d40008 7129618: assert(obj_node->eqv_uncast(obj),""); kvn parents: 4790 diff changeset	1812 // node for each locked region so mark all associated locks/unlocks as
89d0a5d40008 7129618: assert(obj_node->eqv_uncast(obj),""); kvn parents: 4790 diff changeset	1813 // eliminated even if different objects are referenced in one locked region
89d0a5d40008 7129618: assert(obj_node->eqv_uncast(obj),""); kvn parents: 4790 diff changeset	1814 // (for example, OSR compilation of nested loop inside locked scope).
89d0a5d40008 7129618: assert(obj_node->eqv_uncast(obj),""); kvn parents: 4790 diff changeset	1815 if (EliminateNestedLocks \|\|
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1816 oldbox->as_BoxLock()->is_simple_lock_region(NULL, obj)) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1817 // Box is used only in one lock region. Mark this box as eliminated.
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1818 _igvn.hash_delete(oldbox);
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1819 oldbox->as_BoxLock()->set_eliminated(); // This changes box's hash value
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1820 _igvn.hash_insert(oldbox);
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1821
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1822 for (uint i = 0; i < oldbox->outcnt(); i++) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1823 Node* u = oldbox->raw_out(i);
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1824 if (u->is_AbstractLock() && !u->as_AbstractLock()->is_non_esc_obj()) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1825 AbstractLockNode* alock = u->as_AbstractLock();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1826 // Check lock's box since box could be referenced by Lock's debug info.
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1827 if (alock->box_node() == oldbox) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1828 // Mark eliminated all related locks and unlocks.
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1829 alock->set_non_esc_obj();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1830 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1831 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1832 }
3754 642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1833 return;
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1834 }
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1835
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1836 // Create new "eliminated" BoxLock node and use it in monitor debug info
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1837 // instead of oldbox for the same object.
4790 b0ff910edfc9 7128355: assert(!nocreate) failed: Cannot build a phi for a block already parsed kvn parents: 4778 diff changeset	1838 BoxLockNode* newbox = oldbox->clone()->as_BoxLock();
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1839
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1840 // Note: BoxLock node is marked eliminated only here and it is used
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1841 // to indicate that all associated lock and unlock nodes are marked
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1842 // for elimination.
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1843 newbox->set_eliminated();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1844 transform_later(newbox);
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1845
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1846 // Replace old box node with new box for all users of the same object.
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1847 for (uint i = 0; i < oldbox->outcnt();) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1848 bool next_edge = true;
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1849
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1850 Node* u = oldbox->raw_out(i);
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1851 if (u->is_AbstractLock()) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1852 AbstractLockNode* alock = u->as_AbstractLock();
4778 35acf8f0a2e4 7128352: assert(obj_node == obj) failed kvn parents: 4777 diff changeset	1853 if (alock->box_node() == oldbox && alock->obj_node()->eqv_uncast(obj)) {
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1854 // Replace Box and mark eliminated all related locks and unlocks.
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1855 alock->set_non_esc_obj();
6144 5e990493719e 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node, int, Node) where applicable kvn parents: 4894 diff changeset	1856 _igvn.rehash_node_delayed(alock);
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1857 alock->set_box_node(newbox);
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1858 next_edge = false;
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1859 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1860 }
4778 35acf8f0a2e4 7128352: assert(obj_node == obj) failed kvn parents: 4777 diff changeset	1861 if (u->is_FastLock() && u->as_FastLock()->obj_node()->eqv_uncast(obj)) {
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1862 FastLockNode* flock = u->as_FastLock();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1863 assert(flock->box_node() == oldbox, "sanity");
6144 5e990493719e 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node, int, Node) where applicable kvn parents: 4894 diff changeset	1864 _igvn.rehash_node_delayed(flock);
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1865 flock->set_box_node(newbox);
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1866 next_edge = false;
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1867 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1868
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1869 // Replace old box in monitor debug info.
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1870 if (u->is_SafePoint() && u->as_SafePoint()->jvms()) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1871 SafePointNode* sfn = u->as_SafePoint();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1872 JVMState* youngest_jvms = sfn->jvms();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1873 int max_depth = youngest_jvms->depth();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1874 for (int depth = 1; depth <= max_depth; depth++) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1875 JVMState* jvms = youngest_jvms->of_depth(depth);
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1876 int num_mon = jvms->nof_monitors();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1877 // Loop over monitors
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1878 for (int idx = 0; idx < num_mon; idx++) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1879 Node* obj_node = sfn->monitor_obj(jvms, idx);
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1880 Node* box_node = sfn->monitor_box(jvms, idx);
4778 35acf8f0a2e4 7128352: assert(obj_node == obj) failed kvn parents: 4777 diff changeset	1881 if (box_node == oldbox && obj_node->eqv_uncast(obj)) {
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1882 int j = jvms->monitor_box_offset(idx);
6144 5e990493719e 7173340: C2: code cleanup: use PhaseIterGVN::replace_edge(Node, int, Node) where applicable kvn parents: 4894 diff changeset	1883 _igvn.replace_input_of(u, j, newbox);
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1884 next_edge = false;
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1885 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1886 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1887 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1888 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1889 if (next_edge) i++;
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1890 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1891 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1892
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1893 //-----------------------mark_eliminated_locking_nodes-----------------------
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1894 void PhaseMacroExpand::mark_eliminated_locking_nodes(AbstractLockNode *alock) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1895 if (EliminateNestedLocks) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1896 if (alock->is_nested()) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1897 assert(alock->box_node()->as_BoxLock()->is_eliminated(), "sanity");
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1898 return;
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1899 } else if (!alock->is_non_esc_obj()) { // Not eliminated or coarsened
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1900 // Only Lock node has JVMState needed here.
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1901 if (alock->jvms() != NULL && alock->as_Lock()->is_nested_lock_region()) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1902 // Mark eliminated related nested locks and unlocks.
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1903 Node* obj = alock->obj_node();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1904 BoxLockNode* box_node = alock->box_node()->as_BoxLock();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1905 assert(!box_node->is_eliminated(), "should not be marked yet");
3754 642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1906 // Note: BoxLock node is marked eliminated only here
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1907 // and it is used to indicate that all associated lock
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1908 // and unlock nodes are marked for elimination.
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1909 box_node->set_eliminated(); // Box's hash is always NO_HASH here
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1910 for (uint i = 0; i < box_node->outcnt(); i++) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1911 Node* u = box_node->raw_out(i);
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1912 if (u->is_AbstractLock()) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1913 alock = u->as_AbstractLock();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1914 if (alock->box_node() == box_node) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1915 // Verify that this Box is referenced only by related locks.
4778 35acf8f0a2e4 7128352: assert(obj_node == obj) failed kvn parents: 4777 diff changeset	1916 assert(alock->obj_node()->eqv_uncast(obj), "");
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1917 // Mark all related locks and unlocks.
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1918 alock->set_nested();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1919 }
460 424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	1920 }
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1921 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1922 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1923 return;
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1924 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1925 // Process locks for non escaping object
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1926 assert(alock->is_non_esc_obj(), "");
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1927 } // EliminateNestedLocks
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1928
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1929 if (alock->is_non_esc_obj()) { // Lock is used for non escaping object
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1930 // Look for all locks of this object and mark them and
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1931 // corresponding BoxLock nodes as eliminated.
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1932 Node* obj = alock->obj_node();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1933 for (uint j = 0; j < obj->outcnt(); j++) {
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1934 Node* o = obj->raw_out(j);
4778 35acf8f0a2e4 7128352: assert(obj_node == obj) failed kvn parents: 4777 diff changeset	1935 if (o->is_AbstractLock() &&
35acf8f0a2e4 7128352: assert(obj_node == obj) failed kvn parents: 4777 diff changeset	1936 o->as_AbstractLock()->obj_node()->eqv_uncast(obj)) {
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1937 alock = o->as_AbstractLock();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1938 Node* box = alock->box_node();
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1939 // Replace old box node with new eliminated box for all users
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1940 // of the same object and mark related locks as eliminated.
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1941 mark_eliminated_box(box, obj);
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1942 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1943 }
e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1944 }
3754 642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1945 }
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1946
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1947 // we have determined that this lock/unlock can be eliminated, we simply
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1948 // eliminate the node without expanding it.
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1949 //
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1950 // Note: The membar's associated with the lock/unlock are currently not
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1951 // eliminated. This should be investigated as a future enhancement.
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1952 //
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1953 bool PhaseMacroExpand::eliminate_locking_node(AbstractLockNode *alock) {
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1954
3754 642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1955 if (!alock->is_eliminated()) {
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1956 return false;
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1957 }
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1958 #ifdef ASSERT
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	1959 if (!alock->is_coarsened()) {
3754 642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1960 // Check that new "eliminated" BoxLock node is created.
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1961 BoxLockNode* oldbox = alock->box_node()->as_BoxLock();
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1962 assert(oldbox->is_eliminated(), "should be done already");
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1963 }
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	1964 #endif
1080 7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	1965 CompileLog* log = C->log();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	1966 if (log != NULL) {
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	1967 log->head("eliminate_lock lock='%d'",
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	1968 alock->is_Lock());
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	1969 JVMState* p = alock->jvms();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	1970 while (p != NULL) {
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	1971 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method()));
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	1972 p = p->caller();
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	1973 }
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	1974 log->tail("eliminate_lock");
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	1975 }
7c57aead6d3e 6892658: C2 should optimize some stringbuilder patterns never parents: 851 diff changeset	1976
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1977 #ifndef PRODUCT
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1978 if (PrintEliminateLocks) {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1979 if (alock->is_Lock()) {
4115 1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	1980 tty->print_cr("++++ Eliminated: %d Lock", alock->_idx);
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1981 } else {
4115 1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	1982 tty->print_cr("++++ Eliminated: %d Unlock", alock->_idx);
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1983 }
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1984 }
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1985 #endif
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1986
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1987 Node* mem = alock->in(TypeFunc::Memory);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1988 Node* ctrl = alock->in(TypeFunc::Control);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1989
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1990 extract_call_projections(alock);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1991 // 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	1992 // be deleted when its last use is subsumed below.
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1993 assert(alock->outcnt() == 2 &&
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1994 _fallthroughproj != NULL &&
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1995 _memproj_fallthrough != NULL,
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1996 "Unexpected projections from Lock/Unlock");
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1997
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1998 Node* fallthroughproj = _fallthroughproj;
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	1999 Node* memproj_fallthrough = _memproj_fallthrough;
0 a61af66fc99e Initial load duke parents: diff changeset	2000
a61af66fc99e Initial load duke parents: diff changeset	2001 // The memory projection from a lock/unlock is RawMem
a61af66fc99e Initial load duke parents: diff changeset	2002 // The input to a Lock is merged memory, so extract its RawMem input
a61af66fc99e Initial load duke parents: diff changeset	2003 // (unless the MergeMem has been optimized away.)
a61af66fc99e Initial load duke parents: diff changeset	2004 if (alock->is_Lock()) {
3849 f1c12354c3f7 7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths roland parents: 3788 diff changeset	2005 // Seach for MemBarAcquireLock node and delete it also.
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2006 MemBarNode* membar = fallthroughproj->unique_ctrl_out()->as_MemBar();
3849 f1c12354c3f7 7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths roland parents: 3788 diff changeset	2007 assert(membar != NULL && membar->Opcode() == Op_MemBarAcquireLock, "");
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2008 Node* ctrlproj = membar->proj_out(TypeFunc::Control);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2009 Node* memproj = membar->proj_out(TypeFunc::Memory);
708 f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	2010 _igvn.replace_node(ctrlproj, fallthroughproj);
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	2011 _igvn.replace_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	2012
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	2013 // 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	2014 // (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	2015 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	2016 if (flock->outcnt() == 1) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	2017 assert(flock->unique_out() == alock, "sanity");
708 f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	2018 _igvn.replace_node(flock, top());
460 424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	2019 }
0 a61af66fc99e Initial load duke parents: diff changeset	2020 }
a61af66fc99e Initial load duke parents: diff changeset	2021
3849 f1c12354c3f7 7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths roland parents: 3788 diff changeset	2022 // Seach for MemBarReleaseLock node and delete it also.
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2023 if (alock->is_Unlock() && ctrl != NULL && ctrl->is_Proj() &&
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2024 ctrl->in(0)->is_MemBar()) {
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2025 MemBarNode* membar = ctrl->in(0)->as_MemBar();
3849 f1c12354c3f7 7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths roland parents: 3788 diff changeset	2026 assert(membar->Opcode() == Op_MemBarReleaseLock &&
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2027 mem->is_Proj() && membar == mem->in(0), "");
708 f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	2028 _igvn.replace_node(fallthroughproj, ctrl);
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	2029 _igvn.replace_node(memproj_fallthrough, mem);
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2030 fallthroughproj = ctrl;
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2031 memproj_fallthrough = mem;
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2032 ctrl = membar->in(TypeFunc::Control);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2033 mem = membar->in(TypeFunc::Memory);
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2034 }
6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2035
708 f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	2036 _igvn.replace_node(fallthroughproj, ctrl);
f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	2037 _igvn.replace_node(memproj_fallthrough, mem);
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2038 return true;
0 a61af66fc99e Initial load duke parents: diff changeset	2039 }
a61af66fc99e Initial load duke parents: diff changeset	2040
a61af66fc99e Initial load duke parents: diff changeset	2041
a61af66fc99e Initial load duke parents: diff changeset	2042 //------------------------------expand_lock_node----------------------
a61af66fc99e Initial load duke parents: diff changeset	2043 void PhaseMacroExpand::expand_lock_node(LockNode *lock) {
a61af66fc99e Initial load duke parents: diff changeset	2044
a61af66fc99e Initial load duke parents: diff changeset	2045 Node* ctrl = lock->in(TypeFunc::Control);
a61af66fc99e Initial load duke parents: diff changeset	2046 Node* mem = lock->in(TypeFunc::Memory);
a61af66fc99e Initial load duke parents: diff changeset	2047 Node* obj = lock->obj_node();
a61af66fc99e Initial load duke parents: diff changeset	2048 Node* box = lock->box_node();
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2049 Node* flock = lock->fastlock_node();
0 a61af66fc99e Initial load duke parents: diff changeset	2050
4790 b0ff910edfc9 7128355: assert(!nocreate) failed: Cannot build a phi for a block already parsed kvn parents: 4778 diff changeset	2051 assert(!box->as_BoxLock()->is_eliminated(), "sanity");
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	2052
0 a61af66fc99e Initial load duke parents: diff changeset	2053 // Make the merge point
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2054 Node *region;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2055 Node *mem_phi;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2056 Node *slow_path;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2057
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2058 if (UseOptoBiasInlining) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2059 /*
605 98cb887364d3 6810672: Comment typos twisti parents: 601 diff changeset	2060 * See the full description in MacroAssembler::biased_locking_enter().
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2061 *
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2062 * if( (mark_word & biased_lock_mask) == biased_lock_pattern ) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2063 * // The object is biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2064 * proto_node = klass->prototype_header;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2065 * o_node = thread \| proto_node;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2066 * x_node = o_node ^ mark_word;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2067 * 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	2068 * // Done.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2069 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2070 * if( (x_node & biased_lock_mask) != 0 ) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2071 * // The klass's prototype header is no longer biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2072 * cas(&mark_word, mark_word, proto_node)
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2073 * goto cas_lock;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2074 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2075 * // The klass's prototype header is still biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2076 * if( (x_node & epoch_mask) != 0 ) { // Expired epoch?
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2077 * old = mark_word;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2078 * new = o_node;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2079 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2080 * // Different thread or anonymous biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2081 * 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	2082 * new = thread \| old;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2083 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2084 * // Try to rebias.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2085 * if( cas(&mark_word, old, new) == 0 ) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2086 * // Done.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2087 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2088 * goto slow_path; // Failed.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2089 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2090 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2091 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2092 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2093 * // The object is not biased.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2094 * cas_lock:
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2095 * if( FastLock(obj) == 0 ) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2096 * // Done.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2097 * } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2098 * slow_path:
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2099 * OptoRuntime::complete_monitor_locking_Java(obj);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2100 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2101 * }
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2102 */
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2103
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2104 region = new (C, 5) RegionNode(5);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2105 // create a Phi for the memory state
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2106 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	2107
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2108 Node* fast_lock_region = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2109 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	2110
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2111 // First, check mark word for the biased lock pattern.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2112 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	2113
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2114 // 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	2115 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	2116 markOopDesc::biased_lock_mask_in_place,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2117 markOopDesc::biased_lock_pattern, true);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2118 // 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	2119 fast_lock_mem_phi->init_req(1, mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2120
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2121 // 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	2122 // the same epoch and bias as Klass::_prototype_header.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2123
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2124 // Special-case a fresh allocation to avoid building nodes:
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2125 Node* klass_node = AllocateNode::Ideal_klass(obj, &_igvn);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2126 if (klass_node == NULL) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2127 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	2128 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	2129 #ifdef _LP64
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code" kvn parents: 460 diff changeset	2130 if (UseCompressedOops && klass_node->is_DecodeN()) {
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code" kvn parents: 460 diff changeset	2131 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	2132 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	2133 } else
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code" kvn parents: 460 diff changeset	2134 #endif
dd70dd4c91de 6782820: Server VM fails with "unhandled implicit exception in compiled code" kvn parents: 460 diff changeset	2135 klass_node->init_req(0, ctrl);
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2136 }
4762 069ab3f976d3 7118863: Move sizeof(klassOopDesc) into the Klass::_offset_in_bytes() functions stefank parents: 4115 diff changeset	2137 Node *proto_node = make_load(ctrl, mem, klass_node, in_bytes(Klass::prototype_header_offset()), TypeX_X, TypeX_X->basic_type());
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2138
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2139 Node* thread = transform_later(new (C, 1) ThreadLocalNode());
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2140 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	2141 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	2142 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	2143
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2144 // 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	2145 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	2146 (~markOopDesc::age_mask_in_place), 0);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2147 // 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	2148 mem_phi->init_req(3, mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2149
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2150
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2151 // 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	2152
0 a61af66fc99e Initial load duke parents: diff changeset	2153
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2154 // First, check biased pattern.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2155 // 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	2156 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	2157 markOopDesc::biased_lock_mask_in_place, 0, true);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2158
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2159 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	2160 // 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	2161 // 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	2162 // 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	2163 // 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	2164 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	2165 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	2166 proto_node, mark_node);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2167 transform_later(cas);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2168 Node* proj = transform_later( new (C, 1) SCMemProjNode(cas));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2169 fast_lock_mem_phi->init_req(2, proj);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2170
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2171
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2172 // Second, check epoch bits.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2173 Node* rebiased_region = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2174 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	2175 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	2176
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2177 // 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	2178 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	2179 markOopDesc::epoch_mask_in_place, 0);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2180 // 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	2181 // toward the current thread.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2182 rebiased_region->init_req(2, epoch_ctrl);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2183 old_phi->init_req(2, mark_node);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2184 new_phi->init_req(2, o_node);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2185
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2186 // rebiased_region->in(1) is set to fast path.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2187 // 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	2188 // 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	2189 Node* cmask = MakeConX(markOopDesc::biased_lock_mask_in_place \|
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2190 markOopDesc::age_mask_in_place \|
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2191 markOopDesc::epoch_mask_in_place);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2192 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	2193 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	2194 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	2195 old_phi->init_req(1, old);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2196 new_phi->init_req(1, new_mark);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2197
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2198 transform_later(rebiased_region);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2199 transform_later(old_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2200 transform_later(new_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2201
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2202 // 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	2203 // 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	2204 cas = new (C, 5) StoreXConditionalNode(rebiased_region, mem, adr,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2205 new_phi, old_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2206 transform_later(cas);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2207 proj = transform_later( new (C, 1) SCMemProjNode(cas));
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2208
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2209 // Get slow path - Failed to CAS.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2210 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	2211 mem_phi->init_req(4, proj);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2212 // 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	2213
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2214 // Failed to CAS.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2215 slow_path = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2216 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	2217
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2218 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	2219 slow_mem->init_req(1, proj);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2220
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2221 // Call CAS-based locking scheme (FastLock node).
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2222
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2223 transform_later(fast_lock_region);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2224 transform_later(fast_lock_mem_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2225
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2226 // Get slow path - FastLock failed to lock the object.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2227 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	2228 mem_phi->init_req(2, fast_lock_mem_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2229 // 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	2230
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2231 slow_path->init_req(2, ctrl); // Capture slow-control
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2232 slow_mem->init_req(2, fast_lock_mem_phi);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2233
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2234 transform_later(slow_path);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2235 transform_later(slow_mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2236 // Reset lock's memory edge.
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2237 lock->set_req(TypeFunc::Memory, slow_mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2238
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2239 } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2240 region = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2241 // create a Phi for the memory state
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2242 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	2243
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2244 // Optimize test; set region slot 2
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2245 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	2246 mem_phi->init_req(2, mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2247 }
0 a61af66fc99e Initial load duke parents: diff changeset	2248
a61af66fc99e Initial load duke parents: diff changeset	2249 // Make slow path call
a61af66fc99e Initial load duke parents: diff changeset	2250 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	2251
a61af66fc99e Initial load duke parents: diff changeset	2252 extract_call_projections(call);
a61af66fc99e Initial load duke parents: diff changeset	2253
a61af66fc99e Initial load duke parents: diff changeset	2254 // Slow path can only throw asynchronous exceptions, which are always
a61af66fc99e Initial load duke parents: diff changeset	2255 // de-opted. So the compiler thinks the slow-call can never throw an
a61af66fc99e Initial load duke parents: diff changeset	2256 // exception. If it DOES throw an exception we would need the debug
a61af66fc99e Initial load duke parents: diff changeset	2257 // info removed first (since if it throws there is no monitor).
a61af66fc99e Initial load duke parents: diff changeset	2258 assert ( _ioproj_fallthrough == NULL && _ioproj_catchall == NULL &&
a61af66fc99e Initial load duke parents: diff changeset	2259 _memproj_catchall == NULL && _catchallcatchproj == NULL, "Unexpected projection from Lock");
a61af66fc99e Initial load duke parents: diff changeset	2260
a61af66fc99e Initial load duke parents: diff changeset	2261 // Capture slow path
a61af66fc99e Initial load duke parents: diff changeset	2262 // disconnect fall-through projection from call and create a new one
a61af66fc99e Initial load duke parents: diff changeset	2263 // hook up users of fall-through projection to region
a61af66fc99e Initial load duke parents: diff changeset	2264 Node *slow_ctrl = _fallthroughproj->clone();
a61af66fc99e Initial load duke parents: diff changeset	2265 transform_later(slow_ctrl);
a61af66fc99e Initial load duke parents: diff changeset	2266 _igvn.hash_delete(_fallthroughproj);
a61af66fc99e Initial load duke parents: diff changeset	2267 _fallthroughproj->disconnect_inputs(NULL);
a61af66fc99e Initial load duke parents: diff changeset	2268 region->init_req(1, slow_ctrl);
a61af66fc99e Initial load duke parents: diff changeset	2269 // region inputs are now complete
a61af66fc99e Initial load duke parents: diff changeset	2270 transform_later(region);
708 f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	2271 _igvn.replace_node(_fallthroughproj, region);
0 a61af66fc99e Initial load duke parents: diff changeset	2272
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2273 Node *memproj = transform_later( new(C, 1) ProjNode(call, TypeFunc::Memory) );
0 a61af66fc99e Initial load duke parents: diff changeset	2274 mem_phi->init_req(1, memproj );
a61af66fc99e Initial load duke parents: diff changeset	2275 transform_later(mem_phi);
708 f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	2276 _igvn.replace_node(_memproj_fallthrough, mem_phi);
0 a61af66fc99e Initial load duke parents: diff changeset	2277 }
a61af66fc99e Initial load duke parents: diff changeset	2278
a61af66fc99e Initial load duke parents: diff changeset	2279 //------------------------------expand_unlock_node----------------------
a61af66fc99e Initial load duke parents: diff changeset	2280 void PhaseMacroExpand::expand_unlock_node(UnlockNode *unlock) {
a61af66fc99e Initial load duke parents: diff changeset	2281
66 6dbf1a175d6b 6672848: (Escape Analysis) improve lock elimination with EA kvn parents: 63 diff changeset	2282 Node* ctrl = unlock->in(TypeFunc::Control);
0 a61af66fc99e Initial load duke parents: diff changeset	2283 Node* mem = unlock->in(TypeFunc::Memory);
a61af66fc99e Initial load duke parents: diff changeset	2284 Node* obj = unlock->obj_node();
a61af66fc99e Initial load duke parents: diff changeset	2285 Node* box = unlock->box_node();
a61af66fc99e Initial load duke parents: diff changeset	2286
4790 b0ff910edfc9 7128355: assert(!nocreate) failed: Cannot build a phi for a block already parsed kvn parents: 4778 diff changeset	2287 assert(!box->as_BoxLock()->is_eliminated(), "sanity");
4777 e9a5e0a812c8 7125896: Eliminate nested locks kvn parents: 4769 diff changeset	2288
0 a61af66fc99e Initial load duke parents: diff changeset	2289 // No need for a null check on unlock
a61af66fc99e Initial load duke parents: diff changeset	2290
a61af66fc99e Initial load duke parents: diff changeset	2291 // Make the merge point
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2292 Node *region;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2293 Node *mem_phi;
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2294
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2295 if (UseOptoBiasInlining) {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2296 // Check for biased locking unlock case, which is a no-op.
605 98cb887364d3 6810672: Comment typos twisti parents: 601 diff changeset	2297 // See the full description in MacroAssembler::biased_locking_exit().
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2298 region = new (C, 4) RegionNode(4);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2299 // create a Phi for the memory state
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2300 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	2301 mem_phi->init_req(3, mem);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2302
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2303 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	2304 ctrl = opt_bits_test(ctrl, region, 3, mark_node,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2305 markOopDesc::biased_lock_mask_in_place,
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2306 markOopDesc::biased_lock_pattern);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2307 } else {
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2308 region = new (C, 3) RegionNode(3);
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2309 // create a Phi for the memory state
a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2310 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	2311 }
0 a61af66fc99e Initial load duke parents: diff changeset	2312
a61af66fc99e Initial load duke parents: diff changeset	2313 FastUnlockNode *funlock = new (C, 3) FastUnlockNode( ctrl, obj, box );
a61af66fc99e Initial load duke parents: diff changeset	2314 funlock = transform_later( funlock )->as_FastUnlock();
a61af66fc99e Initial load duke parents: diff changeset	2315 // Optimize test; set region slot 2
420 a1980da045cc 6462850: generate biased locking code in C2 ideal graph kvn parents: 362 diff changeset	2316 Node *slow_path = opt_bits_test(ctrl, region, 2, funlock, 0, 0);
0 a61af66fc99e Initial load duke parents: diff changeset	2317
a61af66fc99e Initial load duke parents: diff changeset	2318 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	2319
a61af66fc99e Initial load duke parents: diff changeset	2320 extract_call_projections(call);
a61af66fc99e Initial load duke parents: diff changeset	2321
a61af66fc99e Initial load duke parents: diff changeset	2322 assert ( _ioproj_fallthrough == NULL && _ioproj_catchall == NULL &&
a61af66fc99e Initial load duke parents: diff changeset	2323 _memproj_catchall == NULL && _catchallcatchproj == NULL, "Unexpected projection from Lock");
a61af66fc99e Initial load duke parents: diff changeset	2324
a61af66fc99e Initial load duke parents: diff changeset	2325 // No exceptions for unlocking
a61af66fc99e Initial load duke parents: diff changeset	2326 // Capture slow path
a61af66fc99e Initial load duke parents: diff changeset	2327 // disconnect fall-through projection from call and create a new one
a61af66fc99e Initial load duke parents: diff changeset	2328 // hook up users of fall-through projection to region
a61af66fc99e Initial load duke parents: diff changeset	2329 Node *slow_ctrl = _fallthroughproj->clone();
a61af66fc99e Initial load duke parents: diff changeset	2330 transform_later(slow_ctrl);
a61af66fc99e Initial load duke parents: diff changeset	2331 _igvn.hash_delete(_fallthroughproj);
a61af66fc99e Initial load duke parents: diff changeset	2332 _fallthroughproj->disconnect_inputs(NULL);
a61af66fc99e Initial load duke parents: diff changeset	2333 region->init_req(1, slow_ctrl);
a61af66fc99e Initial load duke parents: diff changeset	2334 // region inputs are now complete
a61af66fc99e Initial load duke parents: diff changeset	2335 transform_later(region);
708 f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	2336 _igvn.replace_node(_fallthroughproj, region);
0 a61af66fc99e Initial load duke parents: diff changeset	2337
a61af66fc99e Initial load duke parents: diff changeset	2338 Node *memproj = transform_later( new(C, 1) ProjNode(call, TypeFunc::Memory) );
a61af66fc99e Initial load duke parents: diff changeset	2339 mem_phi->init_req(1, memproj );
a61af66fc99e Initial load duke parents: diff changeset	2340 mem_phi->init_req(2, mem);
a61af66fc99e Initial load duke parents: diff changeset	2341 transform_later(mem_phi);
708 f2049ae95c3d 6711117: Assertion in 64bit server vm (flat != TypePtr::BOTTOM,"cannot alias-analyze an untyped ptr") kvn parents: 628 diff changeset	2342 _igvn.replace_node(_memproj_fallthrough, mem_phi);
0 a61af66fc99e Initial load duke parents: diff changeset	2343 }
a61af66fc99e Initial load duke parents: diff changeset	2344
4115 1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2345 //---------------------------eliminate_macro_nodes----------------------
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2346 // Eliminate scalar replaced allocations and associated locks.
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2347 void PhaseMacroExpand::eliminate_macro_nodes() {
0 a61af66fc99e Initial load duke parents: diff changeset	2348 if (C->macro_count() == 0)
4115 1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2349 return;
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2350
460 424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	2351 // First, attempt to eliminate locks
3754 642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	2352 int cnt = C->macro_count();
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	2353 for (int i=0; i < cnt; i++) {
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	2354 Node *n = C->macro_node(i);
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	2355 if (n->is_AbstractLock()) { // Lock and Unlock nodes
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	2356 // Before elimination mark all associated (same box and obj)
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	2357 // lock and unlock nodes.
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	2358 mark_eliminated_locking_nodes(n->as_AbstractLock());
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	2359 }
642c68c75db9 7050280: assert(u->as_Unlock()->is_eliminated()) failed: sanity kvn parents: 3345 diff changeset	2360 }
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2361 bool progress = true;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2362 while (progress) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2363 progress = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2364 for (int i = C->macro_count(); i > 0; i--) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2365 Node * n = C->macro_node(i-1);
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2366 bool success = false;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2367 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	2368 if (n->is_AbstractLock()) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	2369 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	2370 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	2371 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	2372 progress = progress \|\| success;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	2373 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	2374 }
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	2375 // 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	2376 progress = true;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	2377 while (progress) {
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	2378 progress = false;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	2379 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	2380 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	2381 bool success = false;
424f9bfe6b96 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") kvn parents: 436 diff changeset	2382 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	2383 switch (n->class_id()) {
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2384 case Node::Class_Allocate:
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2385 case Node::Class_AllocateArray:
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2386 success = eliminate_allocate_node(n->as_Allocate());
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2387 break;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2388 case Node::Class_Lock:
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2389 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	2390 assert(!n->as_AbstractLock()->is_eliminated(), "sanity");
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2391 break;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2392 default:
4115 1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2393 assert(n->Opcode() == Op_LoopLimit \|\|
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2394 n->Opcode() == Op_Opaque1 \|\|
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2395 n->Opcode() == Op_Opaque2, "unknown node type in macro list");
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2396 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2397 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	2398 progress = progress \|\| success;
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2399 }
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2400 }
4115 1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2401 }
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2402
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2403 //------------------------------expand_macro_nodes----------------------
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2404 // Returns true if a failure occurred.
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2405 bool PhaseMacroExpand::expand_macro_nodes() {
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2406 // Last attempt to eliminate macro nodes.
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2407 eliminate_macro_nodes();
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2408
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2409 // 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	2410 // 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	2411 // Allow 50% more for optimization.
0 a61af66fc99e Initial load duke parents: diff changeset	2412 if (C->check_node_count(C->macro_count() * 75, "out of nodes before macro expansion" ) )
a61af66fc99e Initial load duke parents: diff changeset	2413 return true;
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2414
4115 1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2415 // Eliminate Opaque and LoopLimit nodes. Do it after all loop optimizations.
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2416 bool progress = true;
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2417 while (progress) {
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2418 progress = false;
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2419 for (int i = C->macro_count(); i > 0; i--) {
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2420 Node * n = C->macro_node(i-1);
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2421 bool success = false;
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2422 debug_only(int old_macro_count = C->macro_count(););
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2423 if (n->Opcode() == Op_LoopLimit) {
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2424 // Remove it from macro list and put on IGVN worklist to optimize.
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2425 C->remove_macro_node(n);
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2426 _igvn._worklist.push(n);
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2427 success = true;
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2428 } else if (n->Opcode() == Op_Opaque1 \|\| n->Opcode() == Op_Opaque2) {
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2429 _igvn.replace_node(n, n->in(1));
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2430 success = true;
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2431 }
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2432 assert(success == (C->macro_count() < old_macro_count), "elimination reduces macro count");
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2433 progress = progress \|\| success;
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2434 }
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2435 }
1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2436
0 a61af66fc99e Initial load duke parents: diff changeset	2437 // expand "macro" nodes
a61af66fc99e Initial load duke parents: diff changeset	2438 // nodes are removed from the macro list as they are processed
a61af66fc99e Initial load duke parents: diff changeset	2439 while (C->macro_count() > 0) {
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2440 int macro_count = C->macro_count();
a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2441 Node * n = C->macro_node(macro_count-1);
0 a61af66fc99e Initial load duke parents: diff changeset	2442 assert(n->is_macro(), "only macro nodes expected here");
a61af66fc99e Initial load duke parents: diff changeset	2443 if (_igvn.type(n) == Type::TOP \|\| n->in(0)->is_top() ) {
a61af66fc99e Initial load duke parents: diff changeset	2444 // node is unreachable, so don't try to expand it
a61af66fc99e Initial load duke parents: diff changeset	2445 C->remove_macro_node(n);
a61af66fc99e Initial load duke parents: diff changeset	2446 continue;
a61af66fc99e Initial load duke parents: diff changeset	2447 }
a61af66fc99e Initial load duke parents: diff changeset	2448 switch (n->class_id()) {
a61af66fc99e Initial load duke parents: diff changeset	2449 case Node::Class_Allocate:
a61af66fc99e Initial load duke parents: diff changeset	2450 expand_allocate(n->as_Allocate());
a61af66fc99e Initial load duke parents: diff changeset	2451 break;
a61af66fc99e Initial load duke parents: diff changeset	2452 case Node::Class_AllocateArray:
a61af66fc99e Initial load duke parents: diff changeset	2453 expand_allocate_array(n->as_AllocateArray());
a61af66fc99e Initial load duke parents: diff changeset	2454 break;
a61af66fc99e Initial load duke parents: diff changeset	2455 case Node::Class_Lock:
a61af66fc99e Initial load duke parents: diff changeset	2456 expand_lock_node(n->as_Lock());
a61af66fc99e Initial load duke parents: diff changeset	2457 break;
a61af66fc99e Initial load duke parents: diff changeset	2458 case Node::Class_Unlock:
a61af66fc99e Initial load duke parents: diff changeset	2459 expand_unlock_node(n->as_Unlock());
a61af66fc99e Initial load duke parents: diff changeset	2460 break;
a61af66fc99e Initial load duke parents: diff changeset	2461 default:
a61af66fc99e Initial load duke parents: diff changeset	2462 assert(false, "unknown node type in macro list");
a61af66fc99e Initial load duke parents: diff changeset	2463 }
73 a8880a78d355 6259129: (Escape Analysis) scalar replacement for not escaping objects kvn parents: 66 diff changeset	2464 assert(C->macro_count() < macro_count, "must have deleted a node from macro list");
0 a61af66fc99e Initial load duke parents: diff changeset	2465 if (C->failing()) return true;
a61af66fc99e Initial load duke parents: diff changeset	2466 }
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 73 diff changeset	2467
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 73 diff changeset	2468 _igvn.set_delay_transform(false);
0 a61af66fc99e Initial load duke parents: diff changeset	2469 _igvn.optimize();
4115 1bd45abaa507 6890673: Eliminate allocations immediately after EA kvn parents: 3961 diff changeset	2470 if (C->failing()) return true;
0 a61af66fc99e Initial load duke parents: diff changeset	2471 return false;
a61af66fc99e Initial load duke parents: diff changeset	2472 }

Mercurial > hg > truffle

annotate src/share/vm/opto/macro.cpp @ 6725:da91efe96a93