Fri, 25 May 2012 07:53:11 -0700
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
Summary: optimize this code pattern obj.getClass() == A.class.
Reviewed-by: jrose, kvn
Contributed-by: Krystal Mok <sajia@taobao.com>
duke@435 | 1 | /* |
kvn@3564 | 2 | * Copyright (c) 2005, 2012, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "ci/bcEscapeAnalyzer.hpp" |
kvn@3651 | 27 | #include "compiler/compileLog.hpp" |
stefank@2314 | 28 | #include "libadt/vectset.hpp" |
stefank@2314 | 29 | #include "memory/allocation.hpp" |
stefank@2314 | 30 | #include "opto/c2compiler.hpp" |
stefank@2314 | 31 | #include "opto/callnode.hpp" |
stefank@2314 | 32 | #include "opto/cfgnode.hpp" |
stefank@2314 | 33 | #include "opto/compile.hpp" |
stefank@2314 | 34 | #include "opto/escape.hpp" |
stefank@2314 | 35 | #include "opto/phaseX.hpp" |
stefank@2314 | 36 | #include "opto/rootnode.hpp" |
duke@435 | 37 | |
kvn@1989 | 38 | ConnectionGraph::ConnectionGraph(Compile * C, PhaseIterGVN *igvn) : |
kvn@3651 | 39 | _nodes(C->comp_arena(), C->unique(), C->unique(), NULL), |
kvn@679 | 40 | _collecting(true), |
kvn@3651 | 41 | _verify(false), |
kvn@679 | 42 | _compile(C), |
kvn@1989 | 43 | _igvn(igvn), |
kvn@679 | 44 | _node_map(C->comp_arena()) { |
kvn@3651 | 45 | // Add unknown java object. |
kvn@3651 | 46 | add_java_object(C->top(), PointsToNode::GlobalEscape); |
kvn@3651 | 47 | phantom_obj = ptnode_adr(C->top()->_idx)->as_JavaObject(); |
kvn@688 | 48 | // Add ConP(#NULL) and ConN(#NULL) nodes. |
kvn@688 | 49 | Node* oop_null = igvn->zerocon(T_OBJECT); |
kvn@3651 | 50 | assert(oop_null->_idx < nodes_size(), "should be created already"); |
kvn@3651 | 51 | add_java_object(oop_null, PointsToNode::NoEscape); |
kvn@3651 | 52 | null_obj = ptnode_adr(oop_null->_idx)->as_JavaObject(); |
kvn@688 | 53 | if (UseCompressedOops) { |
kvn@688 | 54 | Node* noop_null = igvn->zerocon(T_NARROWOOP); |
kvn@3651 | 55 | assert(noop_null->_idx < nodes_size(), "should be created already"); |
kvn@3651 | 56 | map_ideal_node(noop_null, null_obj); |
kvn@688 | 57 | } |
kvn@3309 | 58 | _pcmp_neq = NULL; // Should be initialized |
kvn@3309 | 59 | _pcmp_eq = NULL; |
duke@435 | 60 | } |
duke@435 | 61 | |
kvn@3651 | 62 | bool ConnectionGraph::has_candidates(Compile *C) { |
kvn@3651 | 63 | // EA brings benefits only when the code has allocations and/or locks which |
kvn@3651 | 64 | // are represented by ideal Macro nodes. |
kvn@3651 | 65 | int cnt = C->macro_count(); |
kvn@3651 | 66 | for( int i=0; i < cnt; i++ ) { |
kvn@3651 | 67 | Node *n = C->macro_node(i); |
kvn@3651 | 68 | if ( n->is_Allocate() ) |
kvn@3651 | 69 | return true; |
kvn@3651 | 70 | if( n->is_Lock() ) { |
kvn@3651 | 71 | Node* obj = n->as_Lock()->obj_node()->uncast(); |
kvn@3651 | 72 | if( !(obj->is_Parm() || obj->is_Con()) ) |
kvn@3651 | 73 | return true; |
kvn@3318 | 74 | } |
kvn@3318 | 75 | } |
kvn@3651 | 76 | return false; |
duke@435 | 77 | } |
duke@435 | 78 | |
kvn@3651 | 79 | void ConnectionGraph::do_analysis(Compile *C, PhaseIterGVN *igvn) { |
kvn@3651 | 80 | Compile::TracePhase t2("escapeAnalysis", &Phase::_t_escapeAnalysis, true); |
kvn@3651 | 81 | ResourceMark rm; |
duke@435 | 82 | |
kvn@3651 | 83 | // Add ConP#NULL and ConN#NULL nodes before ConnectionGraph construction |
kvn@3651 | 84 | // to create space for them in ConnectionGraph::_nodes[]. |
kvn@3651 | 85 | Node* oop_null = igvn->zerocon(T_OBJECT); |
kvn@3651 | 86 | Node* noop_null = igvn->zerocon(T_NARROWOOP); |
kvn@3651 | 87 | ConnectionGraph* congraph = new(C->comp_arena()) ConnectionGraph(C, igvn); |
kvn@3651 | 88 | // Perform escape analysis |
kvn@3651 | 89 | if (congraph->compute_escape()) { |
kvn@3651 | 90 | // There are non escaping objects. |
kvn@3651 | 91 | C->set_congraph(congraph); |
kvn@3651 | 92 | } |
kvn@3651 | 93 | // Cleanup. |
kvn@3651 | 94 | if (oop_null->outcnt() == 0) |
kvn@3651 | 95 | igvn->hash_delete(oop_null); |
kvn@3651 | 96 | if (noop_null->outcnt() == 0) |
kvn@3651 | 97 | igvn->hash_delete(noop_null); |
duke@435 | 98 | } |
duke@435 | 99 | |
kvn@3651 | 100 | bool ConnectionGraph::compute_escape() { |
kvn@3651 | 101 | Compile* C = _compile; |
kvn@3651 | 102 | PhaseGVN* igvn = _igvn; |
kvn@3651 | 103 | |
kvn@3651 | 104 | // Worklists used by EA. |
kvn@3651 | 105 | Unique_Node_List delayed_worklist; |
kvn@3651 | 106 | GrowableArray<Node*> alloc_worklist; |
kvn@3651 | 107 | GrowableArray<Node*> ptr_cmp_worklist; |
kvn@3651 | 108 | GrowableArray<Node*> storestore_worklist; |
kvn@3651 | 109 | GrowableArray<PointsToNode*> ptnodes_worklist; |
kvn@3651 | 110 | GrowableArray<JavaObjectNode*> java_objects_worklist; |
kvn@3651 | 111 | GrowableArray<JavaObjectNode*> non_escaped_worklist; |
kvn@3651 | 112 | GrowableArray<FieldNode*> oop_fields_worklist; |
kvn@3651 | 113 | DEBUG_ONLY( GrowableArray<Node*> addp_worklist; ) |
kvn@3651 | 114 | |
kvn@3651 | 115 | { Compile::TracePhase t3("connectionGraph", &Phase::_t_connectionGraph, true); |
kvn@3651 | 116 | |
kvn@3651 | 117 | // 1. Populate Connection Graph (CG) with PointsTo nodes. |
kvn@3651 | 118 | ideal_nodes.map(C->unique(), NULL); // preallocate space |
kvn@3651 | 119 | // Initialize worklist |
kvn@3651 | 120 | if (C->root() != NULL) { |
kvn@3651 | 121 | ideal_nodes.push(C->root()); |
kvn@3651 | 122 | } |
kvn@3651 | 123 | for( uint next = 0; next < ideal_nodes.size(); ++next ) { |
kvn@3651 | 124 | Node* n = ideal_nodes.at(next); |
kvn@3651 | 125 | // Create PointsTo nodes and add them to Connection Graph. Called |
kvn@3651 | 126 | // only once per ideal node since ideal_nodes is Unique_Node list. |
kvn@3651 | 127 | add_node_to_connection_graph(n, &delayed_worklist); |
kvn@3651 | 128 | PointsToNode* ptn = ptnode_adr(n->_idx); |
kvn@3651 | 129 | if (ptn != NULL) { |
kvn@3651 | 130 | ptnodes_worklist.append(ptn); |
kvn@3651 | 131 | if (ptn->is_JavaObject()) { |
kvn@3651 | 132 | java_objects_worklist.append(ptn->as_JavaObject()); |
kvn@3651 | 133 | if ((n->is_Allocate() || n->is_CallStaticJava()) && |
kvn@3651 | 134 | (ptn->escape_state() < PointsToNode::GlobalEscape)) { |
kvn@3651 | 135 | // Only allocations and java static calls results are interesting. |
kvn@3651 | 136 | non_escaped_worklist.append(ptn->as_JavaObject()); |
kvn@3651 | 137 | } |
kvn@3651 | 138 | } else if (ptn->is_Field() && ptn->as_Field()->is_oop()) { |
kvn@3651 | 139 | oop_fields_worklist.append(ptn->as_Field()); |
kvn@3651 | 140 | } |
kvn@3651 | 141 | } |
kvn@3651 | 142 | if (n->is_MergeMem()) { |
kvn@3651 | 143 | // Collect all MergeMem nodes to add memory slices for |
kvn@3651 | 144 | // scalar replaceable objects in split_unique_types(). |
kvn@3651 | 145 | _mergemem_worklist.append(n->as_MergeMem()); |
kvn@3651 | 146 | } else if (OptimizePtrCompare && n->is_Cmp() && |
kvn@3651 | 147 | (n->Opcode() == Op_CmpP || n->Opcode() == Op_CmpN)) { |
kvn@3651 | 148 | // Collect compare pointers nodes. |
kvn@3651 | 149 | ptr_cmp_worklist.append(n); |
kvn@3651 | 150 | } else if (n->is_MemBarStoreStore()) { |
kvn@3651 | 151 | // Collect all MemBarStoreStore nodes so that depending on the |
kvn@3651 | 152 | // escape status of the associated Allocate node some of them |
kvn@3651 | 153 | // may be eliminated. |
kvn@3651 | 154 | storestore_worklist.append(n); |
kvn@3651 | 155 | #ifdef ASSERT |
kvn@3651 | 156 | } else if(n->is_AddP()) { |
kvn@3651 | 157 | // Collect address nodes for graph verification. |
kvn@3651 | 158 | addp_worklist.append(n); |
kvn@3651 | 159 | #endif |
kvn@3651 | 160 | } |
kvn@3651 | 161 | for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { |
kvn@3651 | 162 | Node* m = n->fast_out(i); // Get user |
kvn@3651 | 163 | ideal_nodes.push(m); |
kvn@3651 | 164 | } |
kvn@3651 | 165 | } |
kvn@3651 | 166 | if (non_escaped_worklist.length() == 0) { |
kvn@3651 | 167 | _collecting = false; |
kvn@3651 | 168 | return false; // Nothing to do. |
kvn@3651 | 169 | } |
kvn@3651 | 170 | // Add final simple edges to graph. |
kvn@3651 | 171 | while(delayed_worklist.size() > 0) { |
kvn@3651 | 172 | Node* n = delayed_worklist.pop(); |
kvn@3651 | 173 | add_final_edges(n); |
kvn@3651 | 174 | } |
kvn@3651 | 175 | int ptnodes_length = ptnodes_worklist.length(); |
kvn@3651 | 176 | |
kvn@3651 | 177 | #ifdef ASSERT |
kvn@3651 | 178 | if (VerifyConnectionGraph) { |
kvn@3651 | 179 | // Verify that no new simple edges could be created and all |
kvn@3651 | 180 | // local vars has edges. |
kvn@3651 | 181 | _verify = true; |
kvn@3651 | 182 | for (int next = 0; next < ptnodes_length; ++next) { |
kvn@3651 | 183 | PointsToNode* ptn = ptnodes_worklist.at(next); |
kvn@3651 | 184 | add_final_edges(ptn->ideal_node()); |
kvn@3651 | 185 | if (ptn->is_LocalVar() && ptn->edge_count() == 0) { |
kvn@3651 | 186 | ptn->dump(); |
kvn@3651 | 187 | assert(ptn->as_LocalVar()->edge_count() > 0, "sanity"); |
kvn@3651 | 188 | } |
kvn@3651 | 189 | } |
kvn@3651 | 190 | _verify = false; |
kvn@3651 | 191 | } |
kvn@3651 | 192 | #endif |
kvn@3651 | 193 | |
kvn@3651 | 194 | // 2. Finish Graph construction by propagating references to all |
kvn@3651 | 195 | // java objects through graph. |
kvn@3651 | 196 | if (!complete_connection_graph(ptnodes_worklist, non_escaped_worklist, |
kvn@3651 | 197 | java_objects_worklist, oop_fields_worklist)) { |
kvn@3651 | 198 | // All objects escaped or hit time or iterations limits. |
kvn@3651 | 199 | _collecting = false; |
kvn@3651 | 200 | return false; |
kvn@3651 | 201 | } |
kvn@3651 | 202 | |
kvn@3651 | 203 | // 3. Adjust scalar_replaceable state of nonescaping objects and push |
kvn@3651 | 204 | // scalar replaceable allocations on alloc_worklist for processing |
kvn@3651 | 205 | // in split_unique_types(). |
kvn@3651 | 206 | int non_escaped_length = non_escaped_worklist.length(); |
kvn@3651 | 207 | for (int next = 0; next < non_escaped_length; next++) { |
kvn@3651 | 208 | JavaObjectNode* ptn = non_escaped_worklist.at(next); |
kvn@3651 | 209 | if (ptn->escape_state() == PointsToNode::NoEscape && |
kvn@3651 | 210 | ptn->scalar_replaceable()) { |
kvn@3651 | 211 | adjust_scalar_replaceable_state(ptn); |
kvn@3651 | 212 | if (ptn->scalar_replaceable()) { |
kvn@3651 | 213 | alloc_worklist.append(ptn->ideal_node()); |
kvn@3651 | 214 | } |
kvn@3651 | 215 | } |
kvn@3651 | 216 | } |
kvn@3651 | 217 | |
kvn@3651 | 218 | #ifdef ASSERT |
kvn@3651 | 219 | if (VerifyConnectionGraph) { |
kvn@3651 | 220 | // Verify that graph is complete - no new edges could be added or needed. |
kvn@3651 | 221 | verify_connection_graph(ptnodes_worklist, non_escaped_worklist, |
kvn@3651 | 222 | java_objects_worklist, addp_worklist); |
kvn@3651 | 223 | } |
kvn@3651 | 224 | assert(C->unique() == nodes_size(), "no new ideal nodes should be added during ConnectionGraph build"); |
kvn@3651 | 225 | assert(null_obj->escape_state() == PointsToNode::NoEscape && |
kvn@3651 | 226 | null_obj->edge_count() == 0 && |
kvn@3651 | 227 | !null_obj->arraycopy_src() && |
kvn@3651 | 228 | !null_obj->arraycopy_dst(), "sanity"); |
kvn@3651 | 229 | #endif |
kvn@3651 | 230 | |
kvn@3651 | 231 | _collecting = false; |
kvn@3651 | 232 | |
kvn@3651 | 233 | } // TracePhase t3("connectionGraph") |
kvn@3651 | 234 | |
kvn@3651 | 235 | // 4. Optimize ideal graph based on EA information. |
kvn@3651 | 236 | bool has_non_escaping_obj = (non_escaped_worklist.length() > 0); |
kvn@3651 | 237 | if (has_non_escaping_obj) { |
kvn@3651 | 238 | optimize_ideal_graph(ptr_cmp_worklist, storestore_worklist); |
kvn@3651 | 239 | } |
kvn@3651 | 240 | |
kvn@3651 | 241 | #ifndef PRODUCT |
kvn@3651 | 242 | if (PrintEscapeAnalysis) { |
kvn@3651 | 243 | dump(ptnodes_worklist); // Dump ConnectionGraph |
kvn@3651 | 244 | } |
kvn@3651 | 245 | #endif |
kvn@3651 | 246 | |
kvn@3651 | 247 | bool has_scalar_replaceable_candidates = (alloc_worklist.length() > 0); |
kvn@3651 | 248 | #ifdef ASSERT |
kvn@3651 | 249 | if (VerifyConnectionGraph) { |
kvn@3651 | 250 | int alloc_length = alloc_worklist.length(); |
kvn@3651 | 251 | for (int next = 0; next < alloc_length; ++next) { |
kvn@3651 | 252 | Node* n = alloc_worklist.at(next); |
kvn@3651 | 253 | PointsToNode* ptn = ptnode_adr(n->_idx); |
kvn@3651 | 254 | assert(ptn->escape_state() == PointsToNode::NoEscape && ptn->scalar_replaceable(), "sanity"); |
kvn@3651 | 255 | } |
kvn@3651 | 256 | } |
kvn@3651 | 257 | #endif |
kvn@3651 | 258 | |
kvn@3651 | 259 | // 5. Separate memory graph for scalar replaceable allcations. |
kvn@3651 | 260 | if (has_scalar_replaceable_candidates && |
kvn@3651 | 261 | C->AliasLevel() >= 3 && EliminateAllocations) { |
kvn@3651 | 262 | // Now use the escape information to create unique types for |
kvn@3651 | 263 | // scalar replaceable objects. |
kvn@3651 | 264 | split_unique_types(alloc_worklist); |
kvn@3651 | 265 | if (C->failing()) return false; |
kvn@3651 | 266 | C->print_method("After Escape Analysis", 2); |
kvn@3651 | 267 | |
kvn@3651 | 268 | #ifdef ASSERT |
kvn@3651 | 269 | } else if (Verbose && (PrintEscapeAnalysis || PrintEliminateAllocations)) { |
kvn@3651 | 270 | tty->print("=== No allocations eliminated for "); |
kvn@3651 | 271 | C->method()->print_short_name(); |
kvn@3651 | 272 | if(!EliminateAllocations) { |
kvn@3651 | 273 | tty->print(" since EliminateAllocations is off ==="); |
kvn@3651 | 274 | } else if(!has_scalar_replaceable_candidates) { |
kvn@3651 | 275 | tty->print(" since there are no scalar replaceable candidates ==="); |
kvn@3651 | 276 | } else if(C->AliasLevel() < 3) { |
kvn@3651 | 277 | tty->print(" since AliasLevel < 3 ==="); |
kvn@3651 | 278 | } |
kvn@3651 | 279 | tty->cr(); |
kvn@3651 | 280 | #endif |
kvn@3651 | 281 | } |
kvn@3651 | 282 | return has_non_escaping_obj; |
kvn@3651 | 283 | } |
kvn@3651 | 284 | |
kvn@3651 | 285 | // Populate Connection Graph with PointsTo nodes and create simple |
kvn@3651 | 286 | // connection graph edges. |
kvn@3651 | 287 | void ConnectionGraph::add_node_to_connection_graph(Node *n, Unique_Node_List *delayed_worklist) { |
kvn@3651 | 288 | assert(!_verify, "this method sould not be called for verification"); |
kvn@3651 | 289 | PhaseGVN* igvn = _igvn; |
kvn@3651 | 290 | uint n_idx = n->_idx; |
kvn@3651 | 291 | PointsToNode* n_ptn = ptnode_adr(n_idx); |
kvn@3651 | 292 | if (n_ptn != NULL) |
kvn@3651 | 293 | return; // No need to redefine PointsTo node during first iteration. |
kvn@3651 | 294 | |
kvn@3651 | 295 | if (n->is_Call()) { |
kvn@3651 | 296 | // Arguments to allocation and locking don't escape. |
kvn@3651 | 297 | if (n->is_AbstractLock()) { |
kvn@3651 | 298 | // Put Lock and Unlock nodes on IGVN worklist to process them during |
kvn@3651 | 299 | // first IGVN optimization when escape information is still available. |
kvn@3651 | 300 | record_for_optimizer(n); |
kvn@3651 | 301 | } else if (n->is_Allocate()) { |
kvn@3651 | 302 | add_call_node(n->as_Call()); |
kvn@3651 | 303 | record_for_optimizer(n); |
kvn@3651 | 304 | } else { |
kvn@3651 | 305 | if (n->is_CallStaticJava()) { |
kvn@3651 | 306 | const char* name = n->as_CallStaticJava()->_name; |
kvn@3651 | 307 | if (name != NULL && strcmp(name, "uncommon_trap") == 0) |
kvn@3651 | 308 | return; // Skip uncommon traps |
kvn@3651 | 309 | } |
kvn@3651 | 310 | // Don't mark as processed since call's arguments have to be processed. |
kvn@3651 | 311 | delayed_worklist->push(n); |
kvn@3651 | 312 | // Check if a call returns an object. |
kvn@3651 | 313 | if (n->as_Call()->returns_pointer() && |
kvn@3651 | 314 | n->as_Call()->proj_out(TypeFunc::Parms) != NULL) { |
kvn@3651 | 315 | add_call_node(n->as_Call()); |
kvn@3651 | 316 | } |
kvn@3651 | 317 | } |
kvn@3651 | 318 | return; |
kvn@3651 | 319 | } |
kvn@3651 | 320 | // Put this check here to process call arguments since some call nodes |
kvn@3651 | 321 | // point to phantom_obj. |
kvn@3651 | 322 | if (n_ptn == phantom_obj || n_ptn == null_obj) |
kvn@3651 | 323 | return; // Skip predefined nodes. |
kvn@3651 | 324 | |
kvn@3651 | 325 | int opcode = n->Opcode(); |
kvn@3651 | 326 | switch (opcode) { |
kvn@3651 | 327 | case Op_AddP: { |
kvn@3651 | 328 | Node* base = get_addp_base(n); |
kvn@3651 | 329 | PointsToNode* ptn_base = ptnode_adr(base->_idx); |
kvn@3651 | 330 | // Field nodes are created for all field types. They are used in |
kvn@3651 | 331 | // adjust_scalar_replaceable_state() and split_unique_types(). |
kvn@3651 | 332 | // Note, non-oop fields will have only base edges in Connection |
kvn@3651 | 333 | // Graph because such fields are not used for oop loads and stores. |
kvn@3651 | 334 | int offset = address_offset(n, igvn); |
kvn@3651 | 335 | add_field(n, PointsToNode::NoEscape, offset); |
kvn@3651 | 336 | if (ptn_base == NULL) { |
kvn@3651 | 337 | delayed_worklist->push(n); // Process it later. |
kvn@3651 | 338 | } else { |
kvn@3651 | 339 | n_ptn = ptnode_adr(n_idx); |
kvn@3651 | 340 | add_base(n_ptn->as_Field(), ptn_base); |
kvn@3651 | 341 | } |
kvn@3651 | 342 | break; |
kvn@3651 | 343 | } |
kvn@3651 | 344 | case Op_CastX2P: { |
kvn@3651 | 345 | map_ideal_node(n, phantom_obj); |
kvn@3651 | 346 | break; |
kvn@3651 | 347 | } |
kvn@3651 | 348 | case Op_CastPP: |
kvn@3651 | 349 | case Op_CheckCastPP: |
kvn@3651 | 350 | case Op_EncodeP: |
kvn@3651 | 351 | case Op_DecodeN: { |
kvn@3651 | 352 | add_local_var_and_edge(n, PointsToNode::NoEscape, |
kvn@3651 | 353 | n->in(1), delayed_worklist); |
kvn@3651 | 354 | break; |
kvn@3651 | 355 | } |
kvn@3651 | 356 | case Op_CMoveP: { |
kvn@3651 | 357 | add_local_var(n, PointsToNode::NoEscape); |
kvn@3651 | 358 | // Do not add edges during first iteration because some could be |
kvn@3651 | 359 | // not defined yet. |
kvn@3651 | 360 | delayed_worklist->push(n); |
kvn@3651 | 361 | break; |
kvn@3651 | 362 | } |
kvn@3651 | 363 | case Op_ConP: |
kvn@3651 | 364 | case Op_ConN: { |
kvn@3651 | 365 | // assume all oop constants globally escape except for null |
kvn@3651 | 366 | PointsToNode::EscapeState es; |
kvn@3651 | 367 | if (igvn->type(n) == TypePtr::NULL_PTR || |
kvn@3651 | 368 | igvn->type(n) == TypeNarrowOop::NULL_PTR) { |
kvn@3651 | 369 | es = PointsToNode::NoEscape; |
kvn@3651 | 370 | } else { |
kvn@3651 | 371 | es = PointsToNode::GlobalEscape; |
kvn@3651 | 372 | } |
kvn@3651 | 373 | add_java_object(n, es); |
kvn@3651 | 374 | break; |
kvn@3651 | 375 | } |
kvn@3651 | 376 | case Op_CreateEx: { |
kvn@3651 | 377 | // assume that all exception objects globally escape |
kvn@3651 | 378 | add_java_object(n, PointsToNode::GlobalEscape); |
kvn@3651 | 379 | break; |
kvn@3651 | 380 | } |
kvn@3651 | 381 | case Op_LoadKlass: |
kvn@3651 | 382 | case Op_LoadNKlass: { |
kvn@3651 | 383 | // Unknown class is loaded |
kvn@3651 | 384 | map_ideal_node(n, phantom_obj); |
kvn@3651 | 385 | break; |
kvn@3651 | 386 | } |
kvn@3651 | 387 | case Op_LoadP: |
kvn@3651 | 388 | case Op_LoadN: |
kvn@3651 | 389 | case Op_LoadPLocked: { |
kvn@3651 | 390 | // Using isa_ptr() instead of isa_oopptr() for LoadP and Phi because |
kvn@3651 | 391 | // ThreadLocal has RawPrt type. |
kvn@3651 | 392 | const Type* t = igvn->type(n); |
kvn@3651 | 393 | if (t->make_ptr() != NULL) { |
kvn@3651 | 394 | Node* adr = n->in(MemNode::Address); |
kvn@3651 | 395 | #ifdef ASSERT |
kvn@3651 | 396 | if (!adr->is_AddP()) { |
kvn@3651 | 397 | assert(igvn->type(adr)->isa_rawptr(), "sanity"); |
kvn@3651 | 398 | } else { |
kvn@3651 | 399 | assert((ptnode_adr(adr->_idx) == NULL || |
kvn@3651 | 400 | ptnode_adr(adr->_idx)->as_Field()->is_oop()), "sanity"); |
kvn@3651 | 401 | } |
kvn@3651 | 402 | #endif |
kvn@3651 | 403 | add_local_var_and_edge(n, PointsToNode::NoEscape, |
kvn@3651 | 404 | adr, delayed_worklist); |
kvn@3651 | 405 | } |
kvn@3651 | 406 | break; |
kvn@3651 | 407 | } |
kvn@3651 | 408 | case Op_Parm: { |
kvn@3651 | 409 | map_ideal_node(n, phantom_obj); |
kvn@3651 | 410 | break; |
kvn@3651 | 411 | } |
kvn@3651 | 412 | case Op_PartialSubtypeCheck: { |
kvn@3651 | 413 | // Produces Null or notNull and is used in only in CmpP so |
kvn@3651 | 414 | // phantom_obj could be used. |
kvn@3651 | 415 | map_ideal_node(n, phantom_obj); // Result is unknown |
kvn@3651 | 416 | break; |
kvn@3651 | 417 | } |
kvn@3651 | 418 | case Op_Phi: { |
kvn@3651 | 419 | // Using isa_ptr() instead of isa_oopptr() for LoadP and Phi because |
kvn@3651 | 420 | // ThreadLocal has RawPrt type. |
kvn@3651 | 421 | const Type* t = n->as_Phi()->type(); |
kvn@3651 | 422 | if (t->make_ptr() != NULL) { |
kvn@3651 | 423 | add_local_var(n, PointsToNode::NoEscape); |
kvn@3651 | 424 | // Do not add edges during first iteration because some could be |
kvn@3651 | 425 | // not defined yet. |
kvn@3651 | 426 | delayed_worklist->push(n); |
kvn@3651 | 427 | } |
kvn@3651 | 428 | break; |
kvn@3651 | 429 | } |
kvn@3651 | 430 | case Op_Proj: { |
kvn@3651 | 431 | // we are only interested in the oop result projection from a call |
kvn@3651 | 432 | if (n->as_Proj()->_con == TypeFunc::Parms && n->in(0)->is_Call() && |
kvn@3651 | 433 | n->in(0)->as_Call()->returns_pointer()) { |
kvn@3651 | 434 | add_local_var_and_edge(n, PointsToNode::NoEscape, |
kvn@3651 | 435 | n->in(0), delayed_worklist); |
kvn@3651 | 436 | } |
kvn@3651 | 437 | break; |
kvn@3651 | 438 | } |
kvn@3651 | 439 | case Op_Rethrow: // Exception object escapes |
kvn@3651 | 440 | case Op_Return: { |
kvn@3651 | 441 | if (n->req() > TypeFunc::Parms && |
kvn@3651 | 442 | igvn->type(n->in(TypeFunc::Parms))->isa_oopptr()) { |
kvn@3651 | 443 | // Treat Return value as LocalVar with GlobalEscape escape state. |
kvn@3651 | 444 | add_local_var_and_edge(n, PointsToNode::GlobalEscape, |
kvn@3651 | 445 | n->in(TypeFunc::Parms), delayed_worklist); |
kvn@3651 | 446 | } |
kvn@3651 | 447 | break; |
kvn@3651 | 448 | } |
kvn@3651 | 449 | case Op_StoreP: |
kvn@3651 | 450 | case Op_StoreN: |
kvn@3651 | 451 | case Op_StorePConditional: |
kvn@3651 | 452 | case Op_CompareAndSwapP: |
kvn@3651 | 453 | case Op_CompareAndSwapN: { |
kvn@3651 | 454 | Node* adr = n->in(MemNode::Address); |
kvn@3651 | 455 | const Type *adr_type = igvn->type(adr); |
kvn@3651 | 456 | adr_type = adr_type->make_ptr(); |
kvn@3651 | 457 | if (adr_type->isa_oopptr() || |
kvn@3651 | 458 | (opcode == Op_StoreP || opcode == Op_StoreN) && |
kvn@3651 | 459 | (adr_type == TypeRawPtr::NOTNULL && |
kvn@3651 | 460 | adr->in(AddPNode::Address)->is_Proj() && |
kvn@3651 | 461 | adr->in(AddPNode::Address)->in(0)->is_Allocate())) { |
kvn@3651 | 462 | delayed_worklist->push(n); // Process it later. |
kvn@3651 | 463 | #ifdef ASSERT |
kvn@3651 | 464 | assert(adr->is_AddP(), "expecting an AddP"); |
kvn@3651 | 465 | if (adr_type == TypeRawPtr::NOTNULL) { |
kvn@3651 | 466 | // Verify a raw address for a store captured by Initialize node. |
kvn@3651 | 467 | int offs = (int)igvn->find_intptr_t_con(adr->in(AddPNode::Offset), Type::OffsetBot); |
kvn@3651 | 468 | assert(offs != Type::OffsetBot, "offset must be a constant"); |
kvn@3651 | 469 | } |
kvn@3657 | 470 | #endif |
kvn@3651 | 471 | } else { |
kvn@3651 | 472 | // Ignore copy the displaced header to the BoxNode (OSR compilation). |
kvn@3651 | 473 | if (adr->is_BoxLock()) |
kvn@3651 | 474 | break; |
kvn@3657 | 475 | // Stored value escapes in unsafe access. |
kvn@3657 | 476 | if ((opcode == Op_StoreP) && (adr_type == TypeRawPtr::BOTTOM)) { |
kvn@3657 | 477 | // Pointer stores in G1 barriers looks like unsafe access. |
kvn@3657 | 478 | // Ignore such stores to be able scalar replace non-escaping |
kvn@3657 | 479 | // allocations. |
kvn@3657 | 480 | if (UseG1GC && adr->is_AddP()) { |
kvn@3657 | 481 | Node* base = get_addp_base(adr); |
kvn@3657 | 482 | if (base->Opcode() == Op_LoadP && |
kvn@3657 | 483 | base->in(MemNode::Address)->is_AddP()) { |
kvn@3657 | 484 | adr = base->in(MemNode::Address); |
kvn@3657 | 485 | Node* tls = get_addp_base(adr); |
kvn@3657 | 486 | if (tls->Opcode() == Op_ThreadLocal) { |
kvn@3657 | 487 | int offs = (int)igvn->find_intptr_t_con(adr->in(AddPNode::Offset), Type::OffsetBot); |
kvn@3657 | 488 | if (offs == in_bytes(JavaThread::satb_mark_queue_offset() + |
kvn@3657 | 489 | PtrQueue::byte_offset_of_buf())) { |
kvn@3657 | 490 | break; // G1 pre barier previous oop value store. |
kvn@3657 | 491 | } |
kvn@3657 | 492 | if (offs == in_bytes(JavaThread::dirty_card_queue_offset() + |
kvn@3657 | 493 | PtrQueue::byte_offset_of_buf())) { |
kvn@3657 | 494 | break; // G1 post barier card address store. |
kvn@3657 | 495 | } |
kvn@3657 | 496 | } |
kvn@3657 | 497 | } |
kvn@3657 | 498 | } |
kvn@3657 | 499 | delayed_worklist->push(n); // Process unsafe access later. |
kvn@3657 | 500 | break; |
kvn@3651 | 501 | } |
kvn@3657 | 502 | #ifdef ASSERT |
kvn@3657 | 503 | n->dump(1); |
kvn@3657 | 504 | assert(false, "not unsafe or G1 barrier raw StoreP"); |
kvn@3651 | 505 | #endif |
kvn@3651 | 506 | } |
kvn@3651 | 507 | break; |
kvn@3651 | 508 | } |
kvn@3651 | 509 | case Op_AryEq: |
kvn@3651 | 510 | case Op_StrComp: |
kvn@3651 | 511 | case Op_StrEquals: |
kvn@3651 | 512 | case Op_StrIndexOf: { |
kvn@3651 | 513 | add_local_var(n, PointsToNode::ArgEscape); |
kvn@3651 | 514 | delayed_worklist->push(n); // Process it later. |
kvn@3651 | 515 | break; |
kvn@3651 | 516 | } |
kvn@3651 | 517 | case Op_ThreadLocal: { |
kvn@3651 | 518 | add_java_object(n, PointsToNode::ArgEscape); |
kvn@3651 | 519 | break; |
kvn@3651 | 520 | } |
kvn@3651 | 521 | default: |
kvn@3651 | 522 | ; // Do nothing for nodes not related to EA. |
kvn@3651 | 523 | } |
kvn@3651 | 524 | return; |
kvn@3651 | 525 | } |
kvn@3651 | 526 | |
kvn@3651 | 527 | #ifdef ASSERT |
kvn@3651 | 528 | #define ELSE_FAIL(name) \ |
kvn@3651 | 529 | /* Should not be called for not pointer type. */ \ |
kvn@3651 | 530 | n->dump(1); \ |
kvn@3651 | 531 | assert(false, name); \ |
kvn@3651 | 532 | break; |
kvn@3651 | 533 | #else |
kvn@3651 | 534 | #define ELSE_FAIL(name) \ |
kvn@3651 | 535 | break; |
kvn@3651 | 536 | #endif |
kvn@3651 | 537 | |
kvn@3651 | 538 | // Add final simple edges to graph. |
kvn@3651 | 539 | void ConnectionGraph::add_final_edges(Node *n) { |
kvn@3651 | 540 | PointsToNode* n_ptn = ptnode_adr(n->_idx); |
kvn@3651 | 541 | #ifdef ASSERT |
kvn@3651 | 542 | if (_verify && n_ptn->is_JavaObject()) |
kvn@3651 | 543 | return; // This method does not change graph for JavaObject. |
kvn@3651 | 544 | #endif |
kvn@3651 | 545 | |
kvn@3651 | 546 | if (n->is_Call()) { |
kvn@3651 | 547 | process_call_arguments(n->as_Call()); |
kvn@3651 | 548 | return; |
kvn@3651 | 549 | } |
kvn@3651 | 550 | assert(n->is_Store() || n->is_LoadStore() || |
kvn@3651 | 551 | (n_ptn != NULL) && (n_ptn->ideal_node() != NULL), |
kvn@3651 | 552 | "node should be registered already"); |
kvn@3651 | 553 | int opcode = n->Opcode(); |
kvn@3651 | 554 | switch (opcode) { |
kvn@3651 | 555 | case Op_AddP: { |
kvn@3651 | 556 | Node* base = get_addp_base(n); |
kvn@3651 | 557 | PointsToNode* ptn_base = ptnode_adr(base->_idx); |
kvn@3651 | 558 | assert(ptn_base != NULL, "field's base should be registered"); |
kvn@3651 | 559 | add_base(n_ptn->as_Field(), ptn_base); |
kvn@3651 | 560 | break; |
kvn@3651 | 561 | } |
kvn@3651 | 562 | case Op_CastPP: |
kvn@3651 | 563 | case Op_CheckCastPP: |
kvn@3651 | 564 | case Op_EncodeP: |
kvn@3651 | 565 | case Op_DecodeN: { |
kvn@3651 | 566 | add_local_var_and_edge(n, PointsToNode::NoEscape, |
kvn@3651 | 567 | n->in(1), NULL); |
kvn@3651 | 568 | break; |
kvn@3651 | 569 | } |
kvn@3651 | 570 | case Op_CMoveP: { |
kvn@3651 | 571 | for (uint i = CMoveNode::IfFalse; i < n->req(); i++) { |
kvn@3651 | 572 | Node* in = n->in(i); |
kvn@3651 | 573 | if (in == NULL) |
kvn@3651 | 574 | continue; // ignore NULL |
kvn@3651 | 575 | Node* uncast_in = in->uncast(); |
kvn@3651 | 576 | if (uncast_in->is_top() || uncast_in == n) |
kvn@3651 | 577 | continue; // ignore top or inputs which go back this node |
kvn@3651 | 578 | PointsToNode* ptn = ptnode_adr(in->_idx); |
kvn@3651 | 579 | assert(ptn != NULL, "node should be registered"); |
kvn@3651 | 580 | add_edge(n_ptn, ptn); |
kvn@3651 | 581 | } |
kvn@3651 | 582 | break; |
kvn@3651 | 583 | } |
kvn@3651 | 584 | case Op_LoadP: |
kvn@3651 | 585 | case Op_LoadN: |
kvn@3651 | 586 | case Op_LoadPLocked: { |
kvn@3651 | 587 | // Using isa_ptr() instead of isa_oopptr() for LoadP and Phi because |
kvn@3651 | 588 | // ThreadLocal has RawPrt type. |
kvn@3651 | 589 | const Type* t = _igvn->type(n); |
kvn@3651 | 590 | if (t->make_ptr() != NULL) { |
kvn@3651 | 591 | Node* adr = n->in(MemNode::Address); |
kvn@3651 | 592 | add_local_var_and_edge(n, PointsToNode::NoEscape, adr, NULL); |
kvn@3651 | 593 | break; |
kvn@3651 | 594 | } |
kvn@3651 | 595 | ELSE_FAIL("Op_LoadP"); |
kvn@3651 | 596 | } |
kvn@3651 | 597 | case Op_Phi: { |
kvn@3651 | 598 | // Using isa_ptr() instead of isa_oopptr() for LoadP and Phi because |
kvn@3651 | 599 | // ThreadLocal has RawPrt type. |
kvn@3651 | 600 | const Type* t = n->as_Phi()->type(); |
kvn@3651 | 601 | if (t->make_ptr() != NULL) { |
kvn@3651 | 602 | for (uint i = 1; i < n->req(); i++) { |
kvn@3651 | 603 | Node* in = n->in(i); |
kvn@3651 | 604 | if (in == NULL) |
kvn@3651 | 605 | continue; // ignore NULL |
kvn@3651 | 606 | Node* uncast_in = in->uncast(); |
kvn@3651 | 607 | if (uncast_in->is_top() || uncast_in == n) |
kvn@3651 | 608 | continue; // ignore top or inputs which go back this node |
kvn@3651 | 609 | PointsToNode* ptn = ptnode_adr(in->_idx); |
kvn@3651 | 610 | assert(ptn != NULL, "node should be registered"); |
kvn@3651 | 611 | add_edge(n_ptn, ptn); |
kvn@3651 | 612 | } |
kvn@3651 | 613 | break; |
kvn@3651 | 614 | } |
kvn@3651 | 615 | ELSE_FAIL("Op_Phi"); |
kvn@3651 | 616 | } |
kvn@3651 | 617 | case Op_Proj: { |
kvn@3651 | 618 | // we are only interested in the oop result projection from a call |
kvn@3651 | 619 | if (n->as_Proj()->_con == TypeFunc::Parms && n->in(0)->is_Call() && |
kvn@3651 | 620 | n->in(0)->as_Call()->returns_pointer()) { |
kvn@3651 | 621 | add_local_var_and_edge(n, PointsToNode::NoEscape, n->in(0), NULL); |
kvn@3651 | 622 | break; |
kvn@3651 | 623 | } |
kvn@3651 | 624 | ELSE_FAIL("Op_Proj"); |
kvn@3651 | 625 | } |
kvn@3651 | 626 | case Op_Rethrow: // Exception object escapes |
kvn@3651 | 627 | case Op_Return: { |
kvn@3651 | 628 | if (n->req() > TypeFunc::Parms && |
kvn@3651 | 629 | _igvn->type(n->in(TypeFunc::Parms))->isa_oopptr()) { |
kvn@3651 | 630 | // Treat Return value as LocalVar with GlobalEscape escape state. |
kvn@3651 | 631 | add_local_var_and_edge(n, PointsToNode::GlobalEscape, |
kvn@3651 | 632 | n->in(TypeFunc::Parms), NULL); |
kvn@3651 | 633 | break; |
kvn@3651 | 634 | } |
kvn@3651 | 635 | ELSE_FAIL("Op_Return"); |
kvn@3651 | 636 | } |
kvn@3651 | 637 | case Op_StoreP: |
kvn@3651 | 638 | case Op_StoreN: |
kvn@3651 | 639 | case Op_StorePConditional: |
kvn@3651 | 640 | case Op_CompareAndSwapP: |
kvn@3651 | 641 | case Op_CompareAndSwapN: { |
kvn@3651 | 642 | Node* adr = n->in(MemNode::Address); |
kvn@3651 | 643 | const Type *adr_type = _igvn->type(adr); |
kvn@3651 | 644 | adr_type = adr_type->make_ptr(); |
kvn@3651 | 645 | if (adr_type->isa_oopptr() || |
kvn@3651 | 646 | (opcode == Op_StoreP || opcode == Op_StoreN) && |
kvn@3651 | 647 | (adr_type == TypeRawPtr::NOTNULL && |
kvn@3651 | 648 | adr->in(AddPNode::Address)->is_Proj() && |
kvn@3651 | 649 | adr->in(AddPNode::Address)->in(0)->is_Allocate())) { |
kvn@3651 | 650 | // Point Address to Value |
kvn@3651 | 651 | PointsToNode* adr_ptn = ptnode_adr(adr->_idx); |
kvn@3651 | 652 | assert(adr_ptn != NULL && |
kvn@3651 | 653 | adr_ptn->as_Field()->is_oop(), "node should be registered"); |
kvn@3651 | 654 | Node *val = n->in(MemNode::ValueIn); |
kvn@3651 | 655 | PointsToNode* ptn = ptnode_adr(val->_idx); |
kvn@3651 | 656 | assert(ptn != NULL, "node should be registered"); |
kvn@3651 | 657 | add_edge(adr_ptn, ptn); |
kvn@3651 | 658 | break; |
kvn@3657 | 659 | } else if ((opcode == Op_StoreP) && (adr_type == TypeRawPtr::BOTTOM)) { |
kvn@3657 | 660 | // Stored value escapes in unsafe access. |
kvn@3657 | 661 | Node *val = n->in(MemNode::ValueIn); |
kvn@3657 | 662 | PointsToNode* ptn = ptnode_adr(val->_idx); |
kvn@3657 | 663 | assert(ptn != NULL, "node should be registered"); |
kvn@3657 | 664 | ptn->set_escape_state(PointsToNode::GlobalEscape); |
kvn@3657 | 665 | // Add edge to object for unsafe access with offset. |
kvn@3657 | 666 | PointsToNode* adr_ptn = ptnode_adr(adr->_idx); |
kvn@3657 | 667 | assert(adr_ptn != NULL, "node should be registered"); |
kvn@3657 | 668 | if (adr_ptn->is_Field()) { |
kvn@3657 | 669 | assert(adr_ptn->as_Field()->is_oop(), "should be oop field"); |
kvn@3657 | 670 | add_edge(adr_ptn, ptn); |
kvn@3657 | 671 | } |
kvn@3657 | 672 | break; |
kvn@3651 | 673 | } |
kvn@3651 | 674 | ELSE_FAIL("Op_StoreP"); |
kvn@3651 | 675 | } |
kvn@3651 | 676 | case Op_AryEq: |
kvn@3651 | 677 | case Op_StrComp: |
kvn@3651 | 678 | case Op_StrEquals: |
kvn@3651 | 679 | case Op_StrIndexOf: { |
kvn@3651 | 680 | // char[] arrays passed to string intrinsic do not escape but |
kvn@3651 | 681 | // they are not scalar replaceable. Adjust escape state for them. |
kvn@3651 | 682 | // Start from in(2) edge since in(1) is memory edge. |
kvn@3651 | 683 | for (uint i = 2; i < n->req(); i++) { |
kvn@3651 | 684 | Node* adr = n->in(i); |
kvn@3651 | 685 | const Type* at = _igvn->type(adr); |
kvn@3651 | 686 | if (!adr->is_top() && at->isa_ptr()) { |
kvn@3651 | 687 | assert(at == Type::TOP || at == TypePtr::NULL_PTR || |
kvn@3651 | 688 | at->isa_ptr() != NULL, "expecting a pointer"); |
kvn@3651 | 689 | if (adr->is_AddP()) { |
kvn@3651 | 690 | adr = get_addp_base(adr); |
kvn@3651 | 691 | } |
kvn@3651 | 692 | PointsToNode* ptn = ptnode_adr(adr->_idx); |
kvn@3651 | 693 | assert(ptn != NULL, "node should be registered"); |
kvn@3651 | 694 | add_edge(n_ptn, ptn); |
kvn@3651 | 695 | } |
kvn@3651 | 696 | } |
kvn@3651 | 697 | break; |
kvn@3651 | 698 | } |
kvn@3651 | 699 | default: { |
kvn@3651 | 700 | // This method should be called only for EA specific nodes which may |
kvn@3651 | 701 | // miss some edges when they were created. |
kvn@3651 | 702 | #ifdef ASSERT |
kvn@3651 | 703 | n->dump(1); |
kvn@3651 | 704 | #endif |
kvn@3651 | 705 | guarantee(false, "unknown node"); |
kvn@3651 | 706 | } |
kvn@3651 | 707 | } |
kvn@3651 | 708 | return; |
kvn@3651 | 709 | } |
kvn@3651 | 710 | |
kvn@3651 | 711 | void ConnectionGraph::add_call_node(CallNode* call) { |
kvn@3651 | 712 | assert(call->returns_pointer(), "only for call which returns pointer"); |
kvn@3651 | 713 | uint call_idx = call->_idx; |
kvn@3651 | 714 | if (call->is_Allocate()) { |
kvn@3651 | 715 | Node* k = call->in(AllocateNode::KlassNode); |
kvn@3651 | 716 | const TypeKlassPtr* kt = k->bottom_type()->isa_klassptr(); |
kvn@3651 | 717 | assert(kt != NULL, "TypeKlassPtr required."); |
kvn@3651 | 718 | ciKlass* cik = kt->klass(); |
kvn@3651 | 719 | PointsToNode::EscapeState es = PointsToNode::NoEscape; |
kvn@3651 | 720 | bool scalar_replaceable = true; |
kvn@3651 | 721 | if (call->is_AllocateArray()) { |
kvn@3651 | 722 | if (!cik->is_array_klass()) { // StressReflectiveCode |
kvn@3651 | 723 | es = PointsToNode::GlobalEscape; |
kvn@3651 | 724 | } else { |
kvn@3651 | 725 | int length = call->in(AllocateNode::ALength)->find_int_con(-1); |
kvn@3651 | 726 | if (length < 0 || length > EliminateAllocationArraySizeLimit) { |
kvn@3651 | 727 | // Not scalar replaceable if the length is not constant or too big. |
kvn@3651 | 728 | scalar_replaceable = false; |
kvn@3651 | 729 | } |
kvn@3651 | 730 | } |
kvn@3651 | 731 | } else { // Allocate instance |
kvn@3651 | 732 | if (cik->is_subclass_of(_compile->env()->Thread_klass()) || |
kvn@3651 | 733 | !cik->is_instance_klass() || // StressReflectiveCode |
kvn@3651 | 734 | cik->as_instance_klass()->has_finalizer()) { |
kvn@3651 | 735 | es = PointsToNode::GlobalEscape; |
kvn@3651 | 736 | } |
kvn@3651 | 737 | } |
kvn@3651 | 738 | add_java_object(call, es); |
kvn@3651 | 739 | PointsToNode* ptn = ptnode_adr(call_idx); |
kvn@3651 | 740 | if (!scalar_replaceable && ptn->scalar_replaceable()) { |
kvn@3651 | 741 | ptn->set_scalar_replaceable(false); |
kvn@3651 | 742 | } |
kvn@3651 | 743 | } else if (call->is_CallStaticJava()) { |
kvn@3651 | 744 | // Call nodes could be different types: |
kvn@3651 | 745 | // |
kvn@3651 | 746 | // 1. CallDynamicJavaNode (what happened during call is unknown): |
kvn@3651 | 747 | // |
kvn@3651 | 748 | // - mapped to GlobalEscape JavaObject node if oop is returned; |
kvn@3651 | 749 | // |
kvn@3651 | 750 | // - all oop arguments are escaping globally; |
kvn@3651 | 751 | // |
kvn@3651 | 752 | // 2. CallStaticJavaNode (execute bytecode analysis if possible): |
kvn@3651 | 753 | // |
kvn@3651 | 754 | // - the same as CallDynamicJavaNode if can't do bytecode analysis; |
kvn@3651 | 755 | // |
kvn@3651 | 756 | // - mapped to GlobalEscape JavaObject node if unknown oop is returned; |
kvn@3651 | 757 | // - mapped to NoEscape JavaObject node if non-escaping object allocated |
kvn@3651 | 758 | // during call is returned; |
kvn@3651 | 759 | // - mapped to ArgEscape LocalVar node pointed to object arguments |
kvn@3651 | 760 | // which are returned and does not escape during call; |
kvn@3651 | 761 | // |
kvn@3651 | 762 | // - oop arguments escaping status is defined by bytecode analysis; |
kvn@3651 | 763 | // |
kvn@3651 | 764 | // For a static call, we know exactly what method is being called. |
kvn@3651 | 765 | // Use bytecode estimator to record whether the call's return value escapes. |
kvn@3651 | 766 | ciMethod* meth = call->as_CallJava()->method(); |
kvn@3651 | 767 | if (meth == NULL) { |
kvn@3651 | 768 | const char* name = call->as_CallStaticJava()->_name; |
kvn@3651 | 769 | assert(strncmp(name, "_multianewarray", 15) == 0, "TODO: add failed case check"); |
kvn@3651 | 770 | // Returns a newly allocated unescaped object. |
kvn@3651 | 771 | add_java_object(call, PointsToNode::NoEscape); |
kvn@3651 | 772 | ptnode_adr(call_idx)->set_scalar_replaceable(false); |
kvn@3651 | 773 | } else { |
kvn@3651 | 774 | BCEscapeAnalyzer* call_analyzer = meth->get_bcea(); |
kvn@3651 | 775 | call_analyzer->copy_dependencies(_compile->dependencies()); |
kvn@3651 | 776 | if (call_analyzer->is_return_allocated()) { |
kvn@3651 | 777 | // Returns a newly allocated unescaped object, simply |
kvn@3651 | 778 | // update dependency information. |
kvn@3651 | 779 | // Mark it as NoEscape so that objects referenced by |
kvn@3651 | 780 | // it's fields will be marked as NoEscape at least. |
kvn@3651 | 781 | add_java_object(call, PointsToNode::NoEscape); |
kvn@3651 | 782 | ptnode_adr(call_idx)->set_scalar_replaceable(false); |
kvn@3651 | 783 | } else { |
kvn@3651 | 784 | // Determine whether any arguments are returned. |
kvn@3651 | 785 | const TypeTuple* d = call->tf()->domain(); |
kvn@3651 | 786 | bool ret_arg = false; |
kvn@3651 | 787 | for (uint i = TypeFunc::Parms; i < d->cnt(); i++) { |
kvn@3651 | 788 | if (d->field_at(i)->isa_ptr() != NULL && |
kvn@3651 | 789 | call_analyzer->is_arg_returned(i - TypeFunc::Parms)) { |
kvn@3651 | 790 | ret_arg = true; |
kvn@3651 | 791 | break; |
kvn@3651 | 792 | } |
kvn@3651 | 793 | } |
kvn@3651 | 794 | if (ret_arg) { |
kvn@3651 | 795 | add_local_var(call, PointsToNode::ArgEscape); |
kvn@3651 | 796 | } else { |
kvn@3651 | 797 | // Returns unknown object. |
kvn@3651 | 798 | map_ideal_node(call, phantom_obj); |
kvn@3651 | 799 | } |
kvn@3651 | 800 | } |
kvn@3651 | 801 | } |
kvn@3651 | 802 | } else { |
kvn@3651 | 803 | // An other type of call, assume the worst case: |
kvn@3651 | 804 | // returned value is unknown and globally escapes. |
kvn@3651 | 805 | assert(call->Opcode() == Op_CallDynamicJava, "add failed case check"); |
kvn@3651 | 806 | map_ideal_node(call, phantom_obj); |
kvn@3651 | 807 | } |
kvn@3651 | 808 | } |
kvn@3651 | 809 | |
kvn@3651 | 810 | void ConnectionGraph::process_call_arguments(CallNode *call) { |
kvn@3651 | 811 | bool is_arraycopy = false; |
kvn@3651 | 812 | switch (call->Opcode()) { |
kvn@3651 | 813 | #ifdef ASSERT |
kvn@3651 | 814 | case Op_Allocate: |
kvn@3651 | 815 | case Op_AllocateArray: |
kvn@3651 | 816 | case Op_Lock: |
kvn@3651 | 817 | case Op_Unlock: |
kvn@3651 | 818 | assert(false, "should be done already"); |
kvn@3651 | 819 | break; |
kvn@3651 | 820 | #endif |
kvn@3651 | 821 | case Op_CallLeafNoFP: |
kvn@3651 | 822 | is_arraycopy = (call->as_CallLeaf()->_name != NULL && |
kvn@3651 | 823 | strstr(call->as_CallLeaf()->_name, "arraycopy") != 0); |
kvn@3651 | 824 | // fall through |
kvn@3651 | 825 | case Op_CallLeaf: { |
kvn@3651 | 826 | // Stub calls, objects do not escape but they are not scale replaceable. |
kvn@3651 | 827 | // Adjust escape state for outgoing arguments. |
kvn@3651 | 828 | const TypeTuple * d = call->tf()->domain(); |
kvn@3651 | 829 | bool src_has_oops = false; |
kvn@3651 | 830 | for (uint i = TypeFunc::Parms; i < d->cnt(); i++) { |
kvn@3651 | 831 | const Type* at = d->field_at(i); |
kvn@3651 | 832 | Node *arg = call->in(i); |
kvn@3651 | 833 | const Type *aat = _igvn->type(arg); |
kvn@3651 | 834 | if (arg->is_top() || !at->isa_ptr() || !aat->isa_ptr()) |
kvn@3651 | 835 | continue; |
kvn@3651 | 836 | if (arg->is_AddP()) { |
kvn@3651 | 837 | // |
kvn@3651 | 838 | // The inline_native_clone() case when the arraycopy stub is called |
kvn@3651 | 839 | // after the allocation before Initialize and CheckCastPP nodes. |
kvn@3651 | 840 | // Or normal arraycopy for object arrays case. |
kvn@3651 | 841 | // |
kvn@3651 | 842 | // Set AddP's base (Allocate) as not scalar replaceable since |
kvn@3651 | 843 | // pointer to the base (with offset) is passed as argument. |
kvn@3651 | 844 | // |
kvn@3651 | 845 | arg = get_addp_base(arg); |
kvn@3651 | 846 | } |
kvn@3651 | 847 | PointsToNode* arg_ptn = ptnode_adr(arg->_idx); |
kvn@3651 | 848 | assert(arg_ptn != NULL, "should be registered"); |
kvn@3651 | 849 | PointsToNode::EscapeState arg_esc = arg_ptn->escape_state(); |
kvn@3651 | 850 | if (is_arraycopy || arg_esc < PointsToNode::ArgEscape) { |
kvn@3651 | 851 | assert(aat == Type::TOP || aat == TypePtr::NULL_PTR || |
kvn@3651 | 852 | aat->isa_ptr() != NULL, "expecting an Ptr"); |
kvn@3651 | 853 | bool arg_has_oops = aat->isa_oopptr() && |
kvn@3651 | 854 | (aat->isa_oopptr()->klass() == NULL || aat->isa_instptr() || |
kvn@3651 | 855 | (aat->isa_aryptr() && aat->isa_aryptr()->klass()->is_obj_array_klass())); |
kvn@3651 | 856 | if (i == TypeFunc::Parms) { |
kvn@3651 | 857 | src_has_oops = arg_has_oops; |
kvn@3651 | 858 | } |
kvn@3651 | 859 | // |
kvn@3651 | 860 | // src or dst could be j.l.Object when other is basic type array: |
kvn@3651 | 861 | // |
kvn@3651 | 862 | // arraycopy(char[],0,Object*,0,size); |
kvn@3651 | 863 | // arraycopy(Object*,0,char[],0,size); |
kvn@3651 | 864 | // |
kvn@3651 | 865 | // Don't add edges in such cases. |
kvn@3651 | 866 | // |
kvn@3651 | 867 | bool arg_is_arraycopy_dest = src_has_oops && is_arraycopy && |
kvn@3651 | 868 | arg_has_oops && (i > TypeFunc::Parms); |
kvn@3651 | 869 | #ifdef ASSERT |
kvn@3651 | 870 | if (!(is_arraycopy || |
kvn@3651 | 871 | call->as_CallLeaf()->_name != NULL && |
kvn@3651 | 872 | (strcmp(call->as_CallLeaf()->_name, "g1_wb_pre") == 0 || |
kvn@3651 | 873 | strcmp(call->as_CallLeaf()->_name, "g1_wb_post") == 0 )) |
kvn@3651 | 874 | ) { |
kvn@3651 | 875 | call->dump(); |
kvn@3651 | 876 | assert(false, "EA: unexpected CallLeaf"); |
kvn@3651 | 877 | } |
kvn@3651 | 878 | #endif |
kvn@3651 | 879 | // Always process arraycopy's destination object since |
kvn@3651 | 880 | // we need to add all possible edges to references in |
kvn@3651 | 881 | // source object. |
kvn@3651 | 882 | if (arg_esc >= PointsToNode::ArgEscape && |
kvn@3651 | 883 | !arg_is_arraycopy_dest) { |
kvn@3651 | 884 | continue; |
kvn@3651 | 885 | } |
kvn@3651 | 886 | set_escape_state(arg_ptn, PointsToNode::ArgEscape); |
kvn@3651 | 887 | if (arg_is_arraycopy_dest) { |
kvn@3651 | 888 | Node* src = call->in(TypeFunc::Parms); |
kvn@3651 | 889 | if (src->is_AddP()) { |
kvn@3651 | 890 | src = get_addp_base(src); |
kvn@3651 | 891 | } |
kvn@3651 | 892 | PointsToNode* src_ptn = ptnode_adr(src->_idx); |
kvn@3651 | 893 | assert(src_ptn != NULL, "should be registered"); |
kvn@3651 | 894 | if (arg_ptn != src_ptn) { |
kvn@3651 | 895 | // Special arraycopy edge: |
kvn@3651 | 896 | // A destination object's field can't have the source object |
kvn@3651 | 897 | // as base since objects escape states are not related. |
kvn@3651 | 898 | // Only escape state of destination object's fields affects |
kvn@3651 | 899 | // escape state of fields in source object. |
kvn@3651 | 900 | add_arraycopy(call, PointsToNode::ArgEscape, src_ptn, arg_ptn); |
kvn@3651 | 901 | } |
kvn@3651 | 902 | } |
kvn@3651 | 903 | } |
kvn@3651 | 904 | } |
kvn@3651 | 905 | break; |
kvn@3651 | 906 | } |
kvn@3651 | 907 | case Op_CallStaticJava: { |
kvn@3651 | 908 | // For a static call, we know exactly what method is being called. |
kvn@3651 | 909 | // Use bytecode estimator to record the call's escape affects |
kvn@3651 | 910 | #ifdef ASSERT |
kvn@3651 | 911 | const char* name = call->as_CallStaticJava()->_name; |
kvn@3651 | 912 | assert((name == NULL || strcmp(name, "uncommon_trap") != 0), "normal calls only"); |
kvn@3651 | 913 | #endif |
kvn@3651 | 914 | ciMethod* meth = call->as_CallJava()->method(); |
kvn@3651 | 915 | BCEscapeAnalyzer* call_analyzer = (meth !=NULL) ? meth->get_bcea() : NULL; |
kvn@3651 | 916 | // fall-through if not a Java method or no analyzer information |
kvn@3651 | 917 | if (call_analyzer != NULL) { |
kvn@3651 | 918 | PointsToNode* call_ptn = ptnode_adr(call->_idx); |
kvn@3651 | 919 | const TypeTuple* d = call->tf()->domain(); |
kvn@3651 | 920 | for (uint i = TypeFunc::Parms; i < d->cnt(); i++) { |
kvn@3651 | 921 | const Type* at = d->field_at(i); |
kvn@3651 | 922 | int k = i - TypeFunc::Parms; |
kvn@3651 | 923 | Node* arg = call->in(i); |
kvn@3651 | 924 | PointsToNode* arg_ptn = ptnode_adr(arg->_idx); |
kvn@3651 | 925 | if (at->isa_ptr() != NULL && |
kvn@3651 | 926 | call_analyzer->is_arg_returned(k)) { |
kvn@3651 | 927 | // The call returns arguments. |
kvn@3651 | 928 | if (call_ptn != NULL) { // Is call's result used? |
kvn@3651 | 929 | assert(call_ptn->is_LocalVar(), "node should be registered"); |
kvn@3651 | 930 | assert(arg_ptn != NULL, "node should be registered"); |
kvn@3651 | 931 | add_edge(call_ptn, arg_ptn); |
kvn@3651 | 932 | } |
kvn@3651 | 933 | } |
kvn@3651 | 934 | if (at->isa_oopptr() != NULL && |
kvn@3651 | 935 | arg_ptn->escape_state() < PointsToNode::GlobalEscape) { |
kvn@3651 | 936 | if (!call_analyzer->is_arg_stack(k)) { |
kvn@3651 | 937 | // The argument global escapes |
kvn@3651 | 938 | set_escape_state(arg_ptn, PointsToNode::GlobalEscape); |
kvn@3651 | 939 | } else { |
kvn@3651 | 940 | set_escape_state(arg_ptn, PointsToNode::ArgEscape); |
kvn@3651 | 941 | if (!call_analyzer->is_arg_local(k)) { |
kvn@3651 | 942 | // The argument itself doesn't escape, but any fields might |
kvn@3651 | 943 | set_fields_escape_state(arg_ptn, PointsToNode::GlobalEscape); |
kvn@3651 | 944 | } |
kvn@3651 | 945 | } |
kvn@3651 | 946 | } |
kvn@3651 | 947 | } |
kvn@3651 | 948 | if (call_ptn != NULL && call_ptn->is_LocalVar()) { |
kvn@3651 | 949 | // The call returns arguments. |
kvn@3651 | 950 | assert(call_ptn->edge_count() > 0, "sanity"); |
kvn@3651 | 951 | if (!call_analyzer->is_return_local()) { |
kvn@3651 | 952 | // Returns also unknown object. |
kvn@3651 | 953 | add_edge(call_ptn, phantom_obj); |
kvn@3651 | 954 | } |
kvn@3651 | 955 | } |
kvn@3651 | 956 | break; |
kvn@3651 | 957 | } |
kvn@3651 | 958 | } |
kvn@3651 | 959 | default: { |
kvn@3651 | 960 | // Fall-through here if not a Java method or no analyzer information |
kvn@3651 | 961 | // or some other type of call, assume the worst case: all arguments |
kvn@3651 | 962 | // globally escape. |
kvn@3651 | 963 | const TypeTuple* d = call->tf()->domain(); |
kvn@3651 | 964 | for (uint i = TypeFunc::Parms; i < d->cnt(); i++) { |
kvn@3651 | 965 | const Type* at = d->field_at(i); |
kvn@3651 | 966 | if (at->isa_oopptr() != NULL) { |
kvn@3651 | 967 | Node* arg = call->in(i); |
kvn@3651 | 968 | if (arg->is_AddP()) { |
kvn@3651 | 969 | arg = get_addp_base(arg); |
kvn@3651 | 970 | } |
kvn@3651 | 971 | assert(ptnode_adr(arg->_idx) != NULL, "should be defined already"); |
kvn@3651 | 972 | set_escape_state(ptnode_adr(arg->_idx), PointsToNode::GlobalEscape); |
kvn@3651 | 973 | } |
kvn@3651 | 974 | } |
kvn@3651 | 975 | } |
kvn@3651 | 976 | } |
kvn@3651 | 977 | } |
kvn@3651 | 978 | |
kvn@3651 | 979 | |
kvn@3651 | 980 | // Finish Graph construction. |
kvn@3651 | 981 | bool ConnectionGraph::complete_connection_graph( |
kvn@3651 | 982 | GrowableArray<PointsToNode*>& ptnodes_worklist, |
kvn@3651 | 983 | GrowableArray<JavaObjectNode*>& non_escaped_worklist, |
kvn@3651 | 984 | GrowableArray<JavaObjectNode*>& java_objects_worklist, |
kvn@3651 | 985 | GrowableArray<FieldNode*>& oop_fields_worklist) { |
kvn@3651 | 986 | // Normally only 1-3 passes needed to build Connection Graph depending |
kvn@3651 | 987 | // on graph complexity. Observed 8 passes in jvm2008 compiler.compiler. |
kvn@3651 | 988 | // Set limit to 20 to catch situation when something did go wrong and |
kvn@3651 | 989 | // bailout Escape Analysis. |
kvn@3651 | 990 | // Also limit build time to 30 sec (60 in debug VM). |
kvn@3651 | 991 | #define CG_BUILD_ITER_LIMIT 20 |
kvn@3651 | 992 | #ifdef ASSERT |
kvn@3651 | 993 | #define CG_BUILD_TIME_LIMIT 60.0 |
kvn@3651 | 994 | #else |
kvn@3651 | 995 | #define CG_BUILD_TIME_LIMIT 30.0 |
kvn@3651 | 996 | #endif |
kvn@3651 | 997 | |
kvn@3651 | 998 | // Propagate GlobalEscape and ArgEscape escape states and check that |
kvn@3651 | 999 | // we still have non-escaping objects. The method pushs on _worklist |
kvn@3651 | 1000 | // Field nodes which reference phantom_object. |
kvn@3651 | 1001 | if (!find_non_escaped_objects(ptnodes_worklist, non_escaped_worklist)) { |
kvn@3651 | 1002 | return false; // Nothing to do. |
kvn@3651 | 1003 | } |
kvn@3651 | 1004 | // Now propagate references to all JavaObject nodes. |
kvn@3651 | 1005 | int java_objects_length = java_objects_worklist.length(); |
kvn@3651 | 1006 | elapsedTimer time; |
kvn@3651 | 1007 | int new_edges = 1; |
kvn@3651 | 1008 | int iterations = 0; |
kvn@3651 | 1009 | do { |
kvn@3651 | 1010 | while ((new_edges > 0) && |
kvn@3651 | 1011 | (iterations++ < CG_BUILD_ITER_LIMIT) && |
kvn@3651 | 1012 | (time.seconds() < CG_BUILD_TIME_LIMIT)) { |
kvn@3651 | 1013 | time.start(); |
kvn@3651 | 1014 | new_edges = 0; |
kvn@3651 | 1015 | // Propagate references to phantom_object for nodes pushed on _worklist |
kvn@3651 | 1016 | // by find_non_escaped_objects() and find_field_value(). |
kvn@3651 | 1017 | new_edges += add_java_object_edges(phantom_obj, false); |
kvn@3651 | 1018 | for (int next = 0; next < java_objects_length; ++next) { |
kvn@3651 | 1019 | JavaObjectNode* ptn = java_objects_worklist.at(next); |
kvn@3651 | 1020 | new_edges += add_java_object_edges(ptn, true); |
kvn@3651 | 1021 | } |
kvn@3651 | 1022 | if (new_edges > 0) { |
kvn@3651 | 1023 | // Update escape states on each iteration if graph was updated. |
kvn@3651 | 1024 | if (!find_non_escaped_objects(ptnodes_worklist, non_escaped_worklist)) { |
kvn@3651 | 1025 | return false; // Nothing to do. |
kvn@3651 | 1026 | } |
kvn@3651 | 1027 | } |
kvn@3651 | 1028 | time.stop(); |
kvn@3651 | 1029 | } |
kvn@3651 | 1030 | if ((iterations < CG_BUILD_ITER_LIMIT) && |
kvn@3651 | 1031 | (time.seconds() < CG_BUILD_TIME_LIMIT)) { |
kvn@3651 | 1032 | time.start(); |
kvn@3651 | 1033 | // Find fields which have unknown value. |
kvn@3651 | 1034 | int fields_length = oop_fields_worklist.length(); |
kvn@3651 | 1035 | for (int next = 0; next < fields_length; next++) { |
kvn@3651 | 1036 | FieldNode* field = oop_fields_worklist.at(next); |
kvn@3651 | 1037 | if (field->edge_count() == 0) { |
kvn@3651 | 1038 | new_edges += find_field_value(field); |
kvn@3651 | 1039 | // This code may added new edges to phantom_object. |
kvn@3651 | 1040 | // Need an other cycle to propagate references to phantom_object. |
kvn@3651 | 1041 | } |
kvn@3651 | 1042 | } |
kvn@3651 | 1043 | time.stop(); |
kvn@3651 | 1044 | } else { |
kvn@3651 | 1045 | new_edges = 0; // Bailout |
kvn@3651 | 1046 | } |
kvn@3651 | 1047 | } while (new_edges > 0); |
kvn@3651 | 1048 | |
kvn@3651 | 1049 | // Bailout if passed limits. |
kvn@3651 | 1050 | if ((iterations >= CG_BUILD_ITER_LIMIT) || |
kvn@3651 | 1051 | (time.seconds() >= CG_BUILD_TIME_LIMIT)) { |
kvn@3651 | 1052 | Compile* C = _compile; |
kvn@3651 | 1053 | if (C->log() != NULL) { |
kvn@3651 | 1054 | C->log()->begin_elem("connectionGraph_bailout reason='reached "); |
kvn@3651 | 1055 | C->log()->text("%s", (iterations >= CG_BUILD_ITER_LIMIT) ? "iterations" : "time"); |
kvn@3651 | 1056 | C->log()->end_elem(" limit'"); |
kvn@3651 | 1057 | } |
kvn@3651 | 1058 | assert(false, err_msg("infinite EA connection graph build (%f sec, %d iterations) with %d nodes and worklist size %d", |
kvn@3651 | 1059 | time.seconds(), iterations, nodes_size(), ptnodes_worklist.length())); |
kvn@3651 | 1060 | // Possible infinite build_connection_graph loop, |
kvn@3651 | 1061 | // bailout (no changes to ideal graph were made). |
kvn@3651 | 1062 | return false; |
kvn@3651 | 1063 | } |
kvn@3651 | 1064 | #ifdef ASSERT |
kvn@3651 | 1065 | if (Verbose && PrintEscapeAnalysis) { |
kvn@3651 | 1066 | tty->print_cr("EA: %d iterations to build connection graph with %d nodes and worklist size %d", |
kvn@3651 | 1067 | iterations, nodes_size(), ptnodes_worklist.length()); |
kvn@3651 | 1068 | } |
kvn@3651 | 1069 | #endif |
kvn@3651 | 1070 | |
kvn@3651 | 1071 | #undef CG_BUILD_ITER_LIMIT |
kvn@3651 | 1072 | #undef CG_BUILD_TIME_LIMIT |
kvn@3651 | 1073 | |
kvn@3651 | 1074 | // Find fields initialized by NULL for non-escaping Allocations. |
kvn@3651 | 1075 | int non_escaped_length = non_escaped_worklist.length(); |
kvn@3651 | 1076 | for (int next = 0; next < non_escaped_length; next++) { |
kvn@3651 | 1077 | JavaObjectNode* ptn = non_escaped_worklist.at(next); |
kvn@3651 | 1078 | PointsToNode::EscapeState es = ptn->escape_state(); |
kvn@3651 | 1079 | assert(es <= PointsToNode::ArgEscape, "sanity"); |
kvn@3651 | 1080 | if (es == PointsToNode::NoEscape) { |
kvn@3651 | 1081 | if (find_init_values(ptn, null_obj, _igvn) > 0) { |
kvn@3651 | 1082 | // Adding references to NULL object does not change escape states |
kvn@3651 | 1083 | // since it does not escape. Also no fields are added to NULL object. |
kvn@3651 | 1084 | add_java_object_edges(null_obj, false); |
kvn@3651 | 1085 | } |
kvn@3651 | 1086 | } |
kvn@3651 | 1087 | Node* n = ptn->ideal_node(); |
kvn@3651 | 1088 | if (n->is_Allocate()) { |
kvn@3651 | 1089 | // The object allocated by this Allocate node will never be |
kvn@3651 | 1090 | // seen by an other thread. Mark it so that when it is |
kvn@3651 | 1091 | // expanded no MemBarStoreStore is added. |
kvn@3651 | 1092 | InitializeNode* ini = n->as_Allocate()->initialization(); |
kvn@3651 | 1093 | if (ini != NULL) |
kvn@3651 | 1094 | ini->set_does_not_escape(); |
kvn@3651 | 1095 | } |
kvn@3651 | 1096 | } |
kvn@3651 | 1097 | return true; // Finished graph construction. |
kvn@3651 | 1098 | } |
kvn@3651 | 1099 | |
kvn@3651 | 1100 | // Propagate GlobalEscape and ArgEscape escape states to all nodes |
kvn@3651 | 1101 | // and check that we still have non-escaping java objects. |
kvn@3651 | 1102 | bool ConnectionGraph::find_non_escaped_objects(GrowableArray<PointsToNode*>& ptnodes_worklist, |
kvn@3651 | 1103 | GrowableArray<JavaObjectNode*>& non_escaped_worklist) { |
kvn@3651 | 1104 | GrowableArray<PointsToNode*> escape_worklist; |
kvn@3651 | 1105 | // First, put all nodes with GlobalEscape and ArgEscape states on worklist. |
kvn@3651 | 1106 | int ptnodes_length = ptnodes_worklist.length(); |
kvn@3651 | 1107 | for (int next = 0; next < ptnodes_length; ++next) { |
kvn@3651 | 1108 | PointsToNode* ptn = ptnodes_worklist.at(next); |
kvn@3651 | 1109 | if (ptn->escape_state() >= PointsToNode::ArgEscape || |
kvn@3651 | 1110 | ptn->fields_escape_state() >= PointsToNode::ArgEscape) { |
kvn@3651 | 1111 | escape_worklist.push(ptn); |
kvn@3651 | 1112 | } |
kvn@3651 | 1113 | } |
kvn@3651 | 1114 | // Set escape states to referenced nodes (edges list). |
kvn@3651 | 1115 | while (escape_worklist.length() > 0) { |
kvn@3651 | 1116 | PointsToNode* ptn = escape_worklist.pop(); |
kvn@3651 | 1117 | PointsToNode::EscapeState es = ptn->escape_state(); |
kvn@3651 | 1118 | PointsToNode::EscapeState field_es = ptn->fields_escape_state(); |
kvn@3651 | 1119 | if (ptn->is_Field() && ptn->as_Field()->is_oop() && |
kvn@3651 | 1120 | es >= PointsToNode::ArgEscape) { |
kvn@3651 | 1121 | // GlobalEscape or ArgEscape state of field means it has unknown value. |
kvn@3651 | 1122 | if (add_edge(ptn, phantom_obj)) { |
kvn@3651 | 1123 | // New edge was added |
kvn@3651 | 1124 | add_field_uses_to_worklist(ptn->as_Field()); |
kvn@3651 | 1125 | } |
kvn@3651 | 1126 | } |
kvn@3651 | 1127 | for (EdgeIterator i(ptn); i.has_next(); i.next()) { |
kvn@3651 | 1128 | PointsToNode* e = i.get(); |
kvn@3651 | 1129 | if (e->is_Arraycopy()) { |
kvn@3651 | 1130 | assert(ptn->arraycopy_dst(), "sanity"); |
kvn@3651 | 1131 | // Propagate only fields escape state through arraycopy edge. |
kvn@3651 | 1132 | if (e->fields_escape_state() < field_es) { |
kvn@3651 | 1133 | set_fields_escape_state(e, field_es); |
kvn@3651 | 1134 | escape_worklist.push(e); |
kvn@3651 | 1135 | } |
kvn@3651 | 1136 | } else if (es >= field_es) { |
kvn@3651 | 1137 | // fields_escape_state is also set to 'es' if it is less than 'es'. |
kvn@3651 | 1138 | if (e->escape_state() < es) { |
kvn@3651 | 1139 | set_escape_state(e, es); |
kvn@3651 | 1140 | escape_worklist.push(e); |
kvn@3651 | 1141 | } |
kvn@3651 | 1142 | } else { |
kvn@3651 | 1143 | // Propagate field escape state. |
kvn@3651 | 1144 | bool es_changed = false; |
kvn@3651 | 1145 | if (e->fields_escape_state() < field_es) { |
kvn@3651 | 1146 | set_fields_escape_state(e, field_es); |
kvn@3651 | 1147 | es_changed = true; |
kvn@3651 | 1148 | } |
kvn@3651 | 1149 | if ((e->escape_state() < field_es) && |
kvn@3651 | 1150 | e->is_Field() && ptn->is_JavaObject() && |
kvn@3651 | 1151 | e->as_Field()->is_oop()) { |
kvn@3651 | 1152 | // Change escape state of referenced fileds. |
kvn@3651 | 1153 | set_escape_state(e, field_es); |
kvn@3651 | 1154 | es_changed = true;; |
kvn@3651 | 1155 | } else if (e->escape_state() < es) { |
kvn@3651 | 1156 | set_escape_state(e, es); |
kvn@3651 | 1157 | es_changed = true;; |
kvn@3651 | 1158 | } |
kvn@3651 | 1159 | if (es_changed) { |
kvn@3651 | 1160 | escape_worklist.push(e); |
kvn@3651 | 1161 | } |
kvn@3651 | 1162 | } |
kvn@3651 | 1163 | } |
kvn@3651 | 1164 | } |
kvn@3651 | 1165 | // Remove escaped objects from non_escaped list. |
kvn@3651 | 1166 | for (int next = non_escaped_worklist.length()-1; next >= 0 ; --next) { |
kvn@3651 | 1167 | JavaObjectNode* ptn = non_escaped_worklist.at(next); |
kvn@3651 | 1168 | if (ptn->escape_state() >= PointsToNode::GlobalEscape) { |
kvn@3651 | 1169 | non_escaped_worklist.delete_at(next); |
kvn@3651 | 1170 | } |
kvn@3651 | 1171 | if (ptn->escape_state() == PointsToNode::NoEscape) { |
kvn@3651 | 1172 | // Find fields in non-escaped allocations which have unknown value. |
kvn@3651 | 1173 | find_init_values(ptn, phantom_obj, NULL); |
kvn@3651 | 1174 | } |
kvn@3651 | 1175 | } |
kvn@3651 | 1176 | return (non_escaped_worklist.length() > 0); |
kvn@3651 | 1177 | } |
kvn@3651 | 1178 | |
kvn@3651 | 1179 | // Add all references to JavaObject node by walking over all uses. |
kvn@3651 | 1180 | int ConnectionGraph::add_java_object_edges(JavaObjectNode* jobj, bool populate_worklist) { |
kvn@3651 | 1181 | int new_edges = 0; |
kvn@3651 | 1182 | if (populate_worklist) { |
kvn@3651 | 1183 | // Populate _worklist by uses of jobj's uses. |
kvn@3651 | 1184 | for (UseIterator i(jobj); i.has_next(); i.next()) { |
kvn@3651 | 1185 | PointsToNode* use = i.get(); |
kvn@3651 | 1186 | if (use->is_Arraycopy()) |
kvn@3651 | 1187 | continue; |
kvn@3651 | 1188 | add_uses_to_worklist(use); |
kvn@3651 | 1189 | if (use->is_Field() && use->as_Field()->is_oop()) { |
kvn@3651 | 1190 | // Put on worklist all field's uses (loads) and |
kvn@3651 | 1191 | // related field nodes (same base and offset). |
kvn@3651 | 1192 | add_field_uses_to_worklist(use->as_Field()); |
kvn@3651 | 1193 | } |
kvn@3651 | 1194 | } |
kvn@3651 | 1195 | } |
kvn@3651 | 1196 | while(_worklist.length() > 0) { |
kvn@3651 | 1197 | PointsToNode* use = _worklist.pop(); |
kvn@3651 | 1198 | if (PointsToNode::is_base_use(use)) { |
kvn@3651 | 1199 | // Add reference from jobj to field and from field to jobj (field's base). |
kvn@3651 | 1200 | use = PointsToNode::get_use_node(use)->as_Field(); |
kvn@3651 | 1201 | if (add_base(use->as_Field(), jobj)) { |
kvn@3651 | 1202 | new_edges++; |
kvn@3651 | 1203 | } |
kvn@3651 | 1204 | continue; |
kvn@3651 | 1205 | } |
kvn@3651 | 1206 | assert(!use->is_JavaObject(), "sanity"); |
kvn@3651 | 1207 | if (use->is_Arraycopy()) { |
kvn@3651 | 1208 | if (jobj == null_obj) // NULL object does not have field edges |
kvn@3651 | 1209 | continue; |
kvn@3651 | 1210 | // Added edge from Arraycopy node to arraycopy's source java object |
kvn@3651 | 1211 | if (add_edge(use, jobj)) { |
kvn@3651 | 1212 | jobj->set_arraycopy_src(); |
kvn@3651 | 1213 | new_edges++; |
kvn@3651 | 1214 | } |
kvn@3651 | 1215 | // and stop here. |
kvn@3651 | 1216 | continue; |
kvn@3651 | 1217 | } |
kvn@3651 | 1218 | if (!add_edge(use, jobj)) |
kvn@3651 | 1219 | continue; // No new edge added, there was such edge already. |
kvn@3651 | 1220 | new_edges++; |
kvn@3651 | 1221 | if (use->is_LocalVar()) { |
kvn@3651 | 1222 | add_uses_to_worklist(use); |
kvn@3651 | 1223 | if (use->arraycopy_dst()) { |
kvn@3651 | 1224 | for (EdgeIterator i(use); i.has_next(); i.next()) { |
kvn@3651 | 1225 | PointsToNode* e = i.get(); |
kvn@3651 | 1226 | if (e->is_Arraycopy()) { |
kvn@3651 | 1227 | if (jobj == null_obj) // NULL object does not have field edges |
kvn@3651 | 1228 | continue; |
kvn@3651 | 1229 | // Add edge from arraycopy's destination java object to Arraycopy node. |
kvn@3651 | 1230 | if (add_edge(jobj, e)) { |
kvn@3651 | 1231 | new_edges++; |
kvn@3651 | 1232 | jobj->set_arraycopy_dst(); |
kvn@3651 | 1233 | } |
kvn@3651 | 1234 | } |
kvn@3651 | 1235 | } |
kvn@3651 | 1236 | } |
kvn@3651 | 1237 | } else { |
kvn@3651 | 1238 | // Added new edge to stored in field values. |
kvn@3651 | 1239 | // Put on worklist all field's uses (loads) and |
kvn@3651 | 1240 | // related field nodes (same base and offset). |
kvn@3651 | 1241 | add_field_uses_to_worklist(use->as_Field()); |
kvn@3651 | 1242 | } |
kvn@3651 | 1243 | } |
kvn@3651 | 1244 | return new_edges; |
kvn@3651 | 1245 | } |
kvn@3651 | 1246 | |
kvn@3651 | 1247 | // Put on worklist all related field nodes. |
kvn@3651 | 1248 | void ConnectionGraph::add_field_uses_to_worklist(FieldNode* field) { |
kvn@3651 | 1249 | assert(field->is_oop(), "sanity"); |
kvn@3651 | 1250 | int offset = field->offset(); |
kvn@3651 | 1251 | add_uses_to_worklist(field); |
kvn@3651 | 1252 | // Loop over all bases of this field and push on worklist Field nodes |
kvn@3651 | 1253 | // with the same offset and base (since they may reference the same field). |
kvn@3651 | 1254 | for (BaseIterator i(field); i.has_next(); i.next()) { |
kvn@3651 | 1255 | PointsToNode* base = i.get(); |
kvn@3651 | 1256 | add_fields_to_worklist(field, base); |
kvn@3651 | 1257 | // Check if the base was source object of arraycopy and go over arraycopy's |
kvn@3651 | 1258 | // destination objects since values stored to a field of source object are |
kvn@3651 | 1259 | // accessable by uses (loads) of fields of destination objects. |
kvn@3651 | 1260 | if (base->arraycopy_src()) { |
kvn@3651 | 1261 | for (UseIterator j(base); j.has_next(); j.next()) { |
kvn@3651 | 1262 | PointsToNode* arycp = j.get(); |
kvn@3651 | 1263 | if (arycp->is_Arraycopy()) { |
kvn@3651 | 1264 | for (UseIterator k(arycp); k.has_next(); k.next()) { |
kvn@3651 | 1265 | PointsToNode* abase = k.get(); |
kvn@3651 | 1266 | if (abase->arraycopy_dst() && abase != base) { |
kvn@3651 | 1267 | // Look for the same arracopy reference. |
kvn@3651 | 1268 | add_fields_to_worklist(field, abase); |
kvn@3651 | 1269 | } |
kvn@3651 | 1270 | } |
kvn@3651 | 1271 | } |
kvn@3651 | 1272 | } |
kvn@3651 | 1273 | } |
kvn@3651 | 1274 | } |
kvn@3651 | 1275 | } |
kvn@3651 | 1276 | |
kvn@3651 | 1277 | // Put on worklist all related field nodes. |
kvn@3651 | 1278 | void ConnectionGraph::add_fields_to_worklist(FieldNode* field, PointsToNode* base) { |
kvn@3651 | 1279 | int offset = field->offset(); |
kvn@3651 | 1280 | if (base->is_LocalVar()) { |
kvn@3651 | 1281 | for (UseIterator j(base); j.has_next(); j.next()) { |
kvn@3651 | 1282 | PointsToNode* f = j.get(); |
kvn@3651 | 1283 | if (PointsToNode::is_base_use(f)) { // Field |
kvn@3651 | 1284 | f = PointsToNode::get_use_node(f); |
kvn@3651 | 1285 | if (f == field || !f->as_Field()->is_oop()) |
kvn@3651 | 1286 | continue; |
kvn@3651 | 1287 | int offs = f->as_Field()->offset(); |
kvn@3651 | 1288 | if (offs == offset || offset == Type::OffsetBot || offs == Type::OffsetBot) { |
kvn@3651 | 1289 | add_to_worklist(f); |
kvn@3651 | 1290 | } |
kvn@3651 | 1291 | } |
kvn@3651 | 1292 | } |
kvn@3651 | 1293 | } else { |
kvn@3651 | 1294 | assert(base->is_JavaObject(), "sanity"); |
kvn@3651 | 1295 | if (// Skip phantom_object since it is only used to indicate that |
kvn@3651 | 1296 | // this field's content globally escapes. |
kvn@3651 | 1297 | (base != phantom_obj) && |
kvn@3651 | 1298 | // NULL object node does not have fields. |
kvn@3651 | 1299 | (base != null_obj)) { |
kvn@3651 | 1300 | for (EdgeIterator i(base); i.has_next(); i.next()) { |
kvn@3651 | 1301 | PointsToNode* f = i.get(); |
kvn@3651 | 1302 | // Skip arraycopy edge since store to destination object field |
kvn@3651 | 1303 | // does not update value in source object field. |
kvn@3651 | 1304 | if (f->is_Arraycopy()) { |
kvn@3651 | 1305 | assert(base->arraycopy_dst(), "sanity"); |
kvn@3651 | 1306 | continue; |
kvn@3651 | 1307 | } |
kvn@3651 | 1308 | if (f == field || !f->as_Field()->is_oop()) |
kvn@3651 | 1309 | continue; |
kvn@3651 | 1310 | int offs = f->as_Field()->offset(); |
kvn@3651 | 1311 | if (offs == offset || offset == Type::OffsetBot || offs == Type::OffsetBot) { |
kvn@3651 | 1312 | add_to_worklist(f); |
kvn@3651 | 1313 | } |
kvn@3651 | 1314 | } |
kvn@3651 | 1315 | } |
kvn@3651 | 1316 | } |
kvn@3651 | 1317 | } |
kvn@3651 | 1318 | |
kvn@3651 | 1319 | // Find fields which have unknown value. |
kvn@3651 | 1320 | int ConnectionGraph::find_field_value(FieldNode* field) { |
kvn@3651 | 1321 | // Escaped fields should have init value already. |
kvn@3651 | 1322 | assert(field->escape_state() == PointsToNode::NoEscape, "sanity"); |
kvn@3651 | 1323 | int new_edges = 0; |
kvn@3651 | 1324 | for (BaseIterator i(field); i.has_next(); i.next()) { |
kvn@3651 | 1325 | PointsToNode* base = i.get(); |
kvn@3651 | 1326 | if (base->is_JavaObject()) { |
kvn@3651 | 1327 | // Skip Allocate's fields which will be processed later. |
kvn@3651 | 1328 | if (base->ideal_node()->is_Allocate()) |
kvn@3651 | 1329 | return 0; |
kvn@3651 | 1330 | assert(base == null_obj, "only NULL ptr base expected here"); |
kvn@3651 | 1331 | } |
kvn@3651 | 1332 | } |
kvn@3651 | 1333 | if (add_edge(field, phantom_obj)) { |
kvn@3651 | 1334 | // New edge was added |
kvn@3651 | 1335 | new_edges++; |
kvn@3651 | 1336 | add_field_uses_to_worklist(field); |
kvn@3651 | 1337 | } |
kvn@3651 | 1338 | return new_edges; |
kvn@3651 | 1339 | } |
kvn@3651 | 1340 | |
kvn@3651 | 1341 | // Find fields initializing values for allocations. |
kvn@3651 | 1342 | int ConnectionGraph::find_init_values(JavaObjectNode* pta, PointsToNode* init_val, PhaseTransform* phase) { |
kvn@3651 | 1343 | assert(pta->escape_state() == PointsToNode::NoEscape, "Not escaped Allocate nodes only"); |
kvn@3651 | 1344 | int new_edges = 0; |
kvn@3651 | 1345 | Node* alloc = pta->ideal_node(); |
kvn@3651 | 1346 | if (init_val == phantom_obj) { |
kvn@3651 | 1347 | // Do nothing for Allocate nodes since its fields values are "known". |
kvn@3651 | 1348 | if (alloc->is_Allocate()) |
kvn@3651 | 1349 | return 0; |
kvn@3651 | 1350 | assert(alloc->as_CallStaticJava(), "sanity"); |
kvn@3651 | 1351 | #ifdef ASSERT |
kvn@3651 | 1352 | if (alloc->as_CallStaticJava()->method() == NULL) { |
kvn@3651 | 1353 | const char* name = alloc->as_CallStaticJava()->_name; |
kvn@3651 | 1354 | assert(strncmp(name, "_multianewarray", 15) == 0, "sanity"); |
kvn@3651 | 1355 | } |
kvn@3651 | 1356 | #endif |
kvn@3651 | 1357 | // Non-escaped allocation returned from Java or runtime call have |
kvn@3651 | 1358 | // unknown values in fields. |
kvn@3651 | 1359 | for (EdgeIterator i(pta); i.has_next(); i.next()) { |
kvn@3651 | 1360 | PointsToNode* ptn = i.get(); |
kvn@3651 | 1361 | if (ptn->is_Field() && ptn->as_Field()->is_oop()) { |
kvn@3651 | 1362 | if (add_edge(ptn, phantom_obj)) { |
kvn@3651 | 1363 | // New edge was added |
kvn@3651 | 1364 | new_edges++; |
kvn@3651 | 1365 | add_field_uses_to_worklist(ptn->as_Field()); |
kvn@3651 | 1366 | } |
kvn@3651 | 1367 | } |
kvn@3651 | 1368 | } |
kvn@3651 | 1369 | return new_edges; |
kvn@3651 | 1370 | } |
kvn@3651 | 1371 | assert(init_val == null_obj, "sanity"); |
kvn@3651 | 1372 | // Do nothing for Call nodes since its fields values are unknown. |
kvn@3651 | 1373 | if (!alloc->is_Allocate()) |
kvn@3651 | 1374 | return 0; |
kvn@3651 | 1375 | |
kvn@3651 | 1376 | InitializeNode* ini = alloc->as_Allocate()->initialization(); |
kvn@3651 | 1377 | Compile* C = _compile; |
kvn@3651 | 1378 | bool visited_bottom_offset = false; |
kvn@3651 | 1379 | GrowableArray<int> offsets_worklist; |
kvn@3651 | 1380 | |
kvn@3651 | 1381 | // Check if an oop field's initializing value is recorded and add |
kvn@3651 | 1382 | // a corresponding NULL if field's value if it is not recorded. |
kvn@3651 | 1383 | // Connection Graph does not record a default initialization by NULL |
kvn@3651 | 1384 | // captured by Initialize node. |
kvn@3651 | 1385 | // |
kvn@3651 | 1386 | for (EdgeIterator i(pta); i.has_next(); i.next()) { |
kvn@3651 | 1387 | PointsToNode* ptn = i.get(); // Field (AddP) |
kvn@3651 | 1388 | if (!ptn->is_Field() || !ptn->as_Field()->is_oop()) |
kvn@3651 | 1389 | continue; // Not oop field |
kvn@3651 | 1390 | int offset = ptn->as_Field()->offset(); |
kvn@3651 | 1391 | if (offset == Type::OffsetBot) { |
kvn@3651 | 1392 | if (!visited_bottom_offset) { |
kvn@3651 | 1393 | // OffsetBot is used to reference array's element, |
kvn@3651 | 1394 | // always add reference to NULL to all Field nodes since we don't |
kvn@3651 | 1395 | // known which element is referenced. |
kvn@3651 | 1396 | if (add_edge(ptn, null_obj)) { |
kvn@3651 | 1397 | // New edge was added |
kvn@3651 | 1398 | new_edges++; |
kvn@3651 | 1399 | add_field_uses_to_worklist(ptn->as_Field()); |
kvn@3651 | 1400 | visited_bottom_offset = true; |
kvn@3651 | 1401 | } |
kvn@3651 | 1402 | } |
kvn@3651 | 1403 | } else { |
kvn@3651 | 1404 | // Check only oop fields. |
kvn@3651 | 1405 | const Type* adr_type = ptn->ideal_node()->as_AddP()->bottom_type(); |
kvn@3651 | 1406 | if (adr_type->isa_rawptr()) { |
kvn@3651 | 1407 | #ifdef ASSERT |
kvn@3651 | 1408 | // Raw pointers are used for initializing stores so skip it |
kvn@3651 | 1409 | // since it should be recorded already |
kvn@3651 | 1410 | Node* base = get_addp_base(ptn->ideal_node()); |
kvn@3651 | 1411 | assert(adr_type->isa_rawptr() && base->is_Proj() && |
kvn@3651 | 1412 | (base->in(0) == alloc),"unexpected pointer type"); |
kvn@3651 | 1413 | #endif |
kvn@3651 | 1414 | continue; |
kvn@3651 | 1415 | } |
kvn@3651 | 1416 | if (!offsets_worklist.contains(offset)) { |
kvn@3651 | 1417 | offsets_worklist.append(offset); |
kvn@3651 | 1418 | Node* value = NULL; |
kvn@3651 | 1419 | if (ini != NULL) { |
kvn@3651 | 1420 | BasicType ft = UseCompressedOops ? T_NARROWOOP : T_OBJECT; |
kvn@3651 | 1421 | Node* store = ini->find_captured_store(offset, type2aelembytes(ft), phase); |
kvn@3651 | 1422 | if (store != NULL && store->is_Store()) { |
kvn@3651 | 1423 | value = store->in(MemNode::ValueIn); |
kvn@3651 | 1424 | } else { |
kvn@3651 | 1425 | // There could be initializing stores which follow allocation. |
kvn@3651 | 1426 | // For example, a volatile field store is not collected |
kvn@3651 | 1427 | // by Initialize node. |
kvn@3651 | 1428 | // |
kvn@3651 | 1429 | // Need to check for dependent loads to separate such stores from |
kvn@3651 | 1430 | // stores which follow loads. For now, add initial value NULL so |
kvn@3651 | 1431 | // that compare pointers optimization works correctly. |
kvn@3651 | 1432 | } |
kvn@3651 | 1433 | } |
kvn@3651 | 1434 | if (value == NULL) { |
kvn@3651 | 1435 | // A field's initializing value was not recorded. Add NULL. |
kvn@3651 | 1436 | if (add_edge(ptn, null_obj)) { |
kvn@3651 | 1437 | // New edge was added |
kvn@3651 | 1438 | new_edges++; |
kvn@3651 | 1439 | add_field_uses_to_worklist(ptn->as_Field()); |
kvn@3651 | 1440 | } |
kvn@3651 | 1441 | } |
kvn@3651 | 1442 | } |
kvn@3651 | 1443 | } |
kvn@3651 | 1444 | } |
kvn@3651 | 1445 | return new_edges; |
kvn@3651 | 1446 | } |
kvn@3651 | 1447 | |
kvn@3651 | 1448 | // Adjust scalar_replaceable state after Connection Graph is built. |
kvn@3651 | 1449 | void ConnectionGraph::adjust_scalar_replaceable_state(JavaObjectNode* jobj) { |
kvn@3651 | 1450 | // Search for non-escaping objects which are not scalar replaceable |
kvn@3651 | 1451 | // and mark them to propagate the state to referenced objects. |
kvn@3651 | 1452 | |
kvn@3651 | 1453 | // 1. An object is not scalar replaceable if the field into which it is |
kvn@3651 | 1454 | // stored has unknown offset (stored into unknown element of an array). |
kvn@3651 | 1455 | // |
kvn@3651 | 1456 | for (UseIterator i(jobj); i.has_next(); i.next()) { |
kvn@3651 | 1457 | PointsToNode* use = i.get(); |
kvn@3651 | 1458 | assert(!use->is_Arraycopy(), "sanity"); |
kvn@3651 | 1459 | if (use->is_Field()) { |
kvn@3651 | 1460 | FieldNode* field = use->as_Field(); |
kvn@3651 | 1461 | assert(field->is_oop() && field->scalar_replaceable() && |
kvn@3651 | 1462 | field->fields_escape_state() == PointsToNode::NoEscape, "sanity"); |
kvn@3651 | 1463 | if (field->offset() == Type::OffsetBot) { |
kvn@3651 | 1464 | jobj->set_scalar_replaceable(false); |
kvn@3651 | 1465 | return; |
kvn@3651 | 1466 | } |
kvn@3651 | 1467 | } |
kvn@3651 | 1468 | assert(use->is_Field() || use->is_LocalVar(), "sanity"); |
kvn@3651 | 1469 | // 2. An object is not scalar replaceable if it is merged with other objects. |
kvn@3651 | 1470 | for (EdgeIterator j(use); j.has_next(); j.next()) { |
kvn@3651 | 1471 | PointsToNode* ptn = j.get(); |
kvn@3651 | 1472 | if (ptn->is_JavaObject() && ptn != jobj) { |
kvn@3651 | 1473 | // Mark all objects. |
kvn@3651 | 1474 | jobj->set_scalar_replaceable(false); |
kvn@3651 | 1475 | ptn->set_scalar_replaceable(false); |
kvn@3651 | 1476 | } |
kvn@3651 | 1477 | } |
kvn@3651 | 1478 | if (!jobj->scalar_replaceable()) { |
kvn@3651 | 1479 | return; |
kvn@3651 | 1480 | } |
kvn@3651 | 1481 | } |
kvn@3651 | 1482 | |
kvn@3651 | 1483 | for (EdgeIterator j(jobj); j.has_next(); j.next()) { |
kvn@3651 | 1484 | // Non-escaping object node should point only to field nodes. |
kvn@3651 | 1485 | FieldNode* field = j.get()->as_Field(); |
kvn@3651 | 1486 | int offset = field->as_Field()->offset(); |
kvn@3651 | 1487 | |
kvn@3651 | 1488 | // 3. An object is not scalar replaceable if it has a field with unknown |
kvn@3651 | 1489 | // offset (array's element is accessed in loop). |
kvn@3651 | 1490 | if (offset == Type::OffsetBot) { |
kvn@3651 | 1491 | jobj->set_scalar_replaceable(false); |
kvn@3651 | 1492 | return; |
kvn@3651 | 1493 | } |
kvn@3651 | 1494 | // 4. Currently an object is not scalar replaceable if a LoadStore node |
kvn@3651 | 1495 | // access its field since the field value is unknown after it. |
kvn@3651 | 1496 | // |
kvn@3651 | 1497 | Node* n = field->ideal_node(); |
kvn@3651 | 1498 | for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { |
kvn@3651 | 1499 | if (n->fast_out(i)->is_LoadStore()) { |
kvn@3651 | 1500 | jobj->set_scalar_replaceable(false); |
kvn@3651 | 1501 | return; |
kvn@3651 | 1502 | } |
kvn@3651 | 1503 | } |
kvn@3651 | 1504 | |
kvn@3651 | 1505 | // 5. Or the address may point to more then one object. This may produce |
kvn@3651 | 1506 | // the false positive result (set not scalar replaceable) |
kvn@3651 | 1507 | // since the flow-insensitive escape analysis can't separate |
kvn@3651 | 1508 | // the case when stores overwrite the field's value from the case |
kvn@3651 | 1509 | // when stores happened on different control branches. |
kvn@3651 | 1510 | // |
kvn@3651 | 1511 | // Note: it will disable scalar replacement in some cases: |
kvn@3651 | 1512 | // |
kvn@3651 | 1513 | // Point p[] = new Point[1]; |
kvn@3651 | 1514 | // p[0] = new Point(); // Will be not scalar replaced |
kvn@3651 | 1515 | // |
kvn@3651 | 1516 | // but it will save us from incorrect optimizations in next cases: |
kvn@3651 | 1517 | // |
kvn@3651 | 1518 | // Point p[] = new Point[1]; |
kvn@3651 | 1519 | // if ( x ) p[0] = new Point(); // Will be not scalar replaced |
kvn@3651 | 1520 | // |
kvn@3651 | 1521 | if (field->base_count() > 1) { |
kvn@3651 | 1522 | for (BaseIterator i(field); i.has_next(); i.next()) { |
kvn@3651 | 1523 | PointsToNode* base = i.get(); |
kvn@3651 | 1524 | // Don't take into account LocalVar nodes which |
kvn@3651 | 1525 | // may point to only one object which should be also |
kvn@3651 | 1526 | // this field's base by now. |
kvn@3651 | 1527 | if (base->is_JavaObject() && base != jobj) { |
kvn@3651 | 1528 | // Mark all bases. |
kvn@3651 | 1529 | jobj->set_scalar_replaceable(false); |
kvn@3651 | 1530 | base->set_scalar_replaceable(false); |
kvn@3651 | 1531 | } |
kvn@3651 | 1532 | } |
kvn@3651 | 1533 | } |
kvn@3651 | 1534 | } |
kvn@3651 | 1535 | } |
kvn@3651 | 1536 | |
kvn@3651 | 1537 | #ifdef ASSERT |
kvn@3651 | 1538 | void ConnectionGraph::verify_connection_graph( |
kvn@3651 | 1539 | GrowableArray<PointsToNode*>& ptnodes_worklist, |
kvn@3651 | 1540 | GrowableArray<JavaObjectNode*>& non_escaped_worklist, |
kvn@3651 | 1541 | GrowableArray<JavaObjectNode*>& java_objects_worklist, |
kvn@3651 | 1542 | GrowableArray<Node*>& addp_worklist) { |
kvn@3651 | 1543 | // Verify that graph is complete - no new edges could be added. |
kvn@3651 | 1544 | int java_objects_length = java_objects_worklist.length(); |
kvn@3651 | 1545 | int non_escaped_length = non_escaped_worklist.length(); |
kvn@3651 | 1546 | int new_edges = 0; |
kvn@3651 | 1547 | for (int next = 0; next < java_objects_length; ++next) { |
kvn@3651 | 1548 | JavaObjectNode* ptn = java_objects_worklist.at(next); |
kvn@3651 | 1549 | new_edges += add_java_object_edges(ptn, true); |
kvn@3651 | 1550 | } |
kvn@3651 | 1551 | assert(new_edges == 0, "graph was not complete"); |
kvn@3651 | 1552 | // Verify that escape state is final. |
kvn@3651 | 1553 | int length = non_escaped_worklist.length(); |
kvn@3651 | 1554 | find_non_escaped_objects(ptnodes_worklist, non_escaped_worklist); |
kvn@3651 | 1555 | assert((non_escaped_length == non_escaped_worklist.length()) && |
kvn@3651 | 1556 | (non_escaped_length == length) && |
kvn@3651 | 1557 | (_worklist.length() == 0), "escape state was not final"); |
kvn@3651 | 1558 | |
kvn@3651 | 1559 | // Verify fields information. |
kvn@3651 | 1560 | int addp_length = addp_worklist.length(); |
kvn@3651 | 1561 | for (int next = 0; next < addp_length; ++next ) { |
kvn@3651 | 1562 | Node* n = addp_worklist.at(next); |
kvn@3651 | 1563 | FieldNode* field = ptnode_adr(n->_idx)->as_Field(); |
kvn@3651 | 1564 | if (field->is_oop()) { |
kvn@3651 | 1565 | // Verify that field has all bases |
kvn@3651 | 1566 | Node* base = get_addp_base(n); |
kvn@3651 | 1567 | PointsToNode* ptn = ptnode_adr(base->_idx); |
kvn@3651 | 1568 | if (ptn->is_JavaObject()) { |
kvn@3651 | 1569 | assert(field->has_base(ptn->as_JavaObject()), "sanity"); |
kvn@3651 | 1570 | } else { |
kvn@3651 | 1571 | assert(ptn->is_LocalVar(), "sanity"); |
kvn@3651 | 1572 | for (EdgeIterator i(ptn); i.has_next(); i.next()) { |
kvn@3651 | 1573 | PointsToNode* e = i.get(); |
kvn@3651 | 1574 | if (e->is_JavaObject()) { |
kvn@3651 | 1575 | assert(field->has_base(e->as_JavaObject()), "sanity"); |
kvn@3651 | 1576 | } |
kvn@3651 | 1577 | } |
kvn@3651 | 1578 | } |
kvn@3651 | 1579 | // Verify that all fields have initializing values. |
kvn@3651 | 1580 | if (field->edge_count() == 0) { |
kvn@3651 | 1581 | field->dump(); |
kvn@3651 | 1582 | assert(field->edge_count() > 0, "sanity"); |
kvn@3651 | 1583 | } |
kvn@3651 | 1584 | } |
kvn@3651 | 1585 | } |
kvn@3651 | 1586 | } |
kvn@3651 | 1587 | #endif |
kvn@3651 | 1588 | |
kvn@3651 | 1589 | // Optimize ideal graph. |
kvn@3651 | 1590 | void ConnectionGraph::optimize_ideal_graph(GrowableArray<Node*>& ptr_cmp_worklist, |
kvn@3651 | 1591 | GrowableArray<Node*>& storestore_worklist) { |
kvn@3651 | 1592 | Compile* C = _compile; |
kvn@3651 | 1593 | PhaseIterGVN* igvn = _igvn; |
kvn@3651 | 1594 | if (EliminateLocks) { |
kvn@3651 | 1595 | // Mark locks before changing ideal graph. |
kvn@3651 | 1596 | int cnt = C->macro_count(); |
kvn@3651 | 1597 | for( int i=0; i < cnt; i++ ) { |
kvn@3651 | 1598 | Node *n = C->macro_node(i); |
kvn@3651 | 1599 | if (n->is_AbstractLock()) { // Lock and Unlock nodes |
kvn@3651 | 1600 | AbstractLockNode* alock = n->as_AbstractLock(); |
kvn@3651 | 1601 | if (!alock->is_non_esc_obj()) { |
kvn@3651 | 1602 | if (not_global_escape(alock->obj_node())) { |
kvn@3651 | 1603 | assert(!alock->is_eliminated() || alock->is_coarsened(), "sanity"); |
kvn@3651 | 1604 | // The lock could be marked eliminated by lock coarsening |
kvn@3651 | 1605 | // code during first IGVN before EA. Replace coarsened flag |
kvn@3651 | 1606 | // to eliminate all associated locks/unlocks. |
kvn@3651 | 1607 | alock->set_non_esc_obj(); |
kvn@3651 | 1608 | } |
kvn@3651 | 1609 | } |
kvn@3651 | 1610 | } |
kvn@3651 | 1611 | } |
kvn@3651 | 1612 | } |
kvn@3651 | 1613 | |
kvn@3651 | 1614 | if (OptimizePtrCompare) { |
kvn@3651 | 1615 | // Add ConI(#CC_GT) and ConI(#CC_EQ). |
kvn@3651 | 1616 | _pcmp_neq = igvn->makecon(TypeInt::CC_GT); |
kvn@3651 | 1617 | _pcmp_eq = igvn->makecon(TypeInt::CC_EQ); |
kvn@3651 | 1618 | // Optimize objects compare. |
kvn@3651 | 1619 | while (ptr_cmp_worklist.length() != 0) { |
kvn@3651 | 1620 | Node *n = ptr_cmp_worklist.pop(); |
kvn@3651 | 1621 | Node *res = optimize_ptr_compare(n); |
kvn@3651 | 1622 | if (res != NULL) { |
kvn@3651 | 1623 | #ifndef PRODUCT |
kvn@3651 | 1624 | if (PrintOptimizePtrCompare) { |
kvn@3651 | 1625 | tty->print_cr("++++ Replaced: %d %s(%d,%d) --> %s", n->_idx, (n->Opcode() == Op_CmpP ? "CmpP" : "CmpN"), n->in(1)->_idx, n->in(2)->_idx, (res == _pcmp_eq ? "EQ" : "NotEQ")); |
kvn@3651 | 1626 | if (Verbose) { |
kvn@3651 | 1627 | n->dump(1); |
kvn@3651 | 1628 | } |
kvn@3651 | 1629 | } |
kvn@3651 | 1630 | #endif |
kvn@3651 | 1631 | igvn->replace_node(n, res); |
kvn@3651 | 1632 | } |
kvn@3651 | 1633 | } |
kvn@3651 | 1634 | // cleanup |
kvn@3651 | 1635 | if (_pcmp_neq->outcnt() == 0) |
kvn@3651 | 1636 | igvn->hash_delete(_pcmp_neq); |
kvn@3651 | 1637 | if (_pcmp_eq->outcnt() == 0) |
kvn@3651 | 1638 | igvn->hash_delete(_pcmp_eq); |
kvn@3651 | 1639 | } |
kvn@3651 | 1640 | |
kvn@3651 | 1641 | // For MemBarStoreStore nodes added in library_call.cpp, check |
kvn@3651 | 1642 | // escape status of associated AllocateNode and optimize out |
kvn@3651 | 1643 | // MemBarStoreStore node if the allocated object never escapes. |
kvn@3651 | 1644 | while (storestore_worklist.length() != 0) { |
kvn@3651 | 1645 | Node *n = storestore_worklist.pop(); |
kvn@3651 | 1646 | MemBarStoreStoreNode *storestore = n ->as_MemBarStoreStore(); |
kvn@3651 | 1647 | Node *alloc = storestore->in(MemBarNode::Precedent)->in(0); |
kvn@3651 | 1648 | assert (alloc->is_Allocate(), "storestore should point to AllocateNode"); |
kvn@3651 | 1649 | if (not_global_escape(alloc)) { |
kvn@3651 | 1650 | MemBarNode* mb = MemBarNode::make(C, Op_MemBarCPUOrder, Compile::AliasIdxBot); |
kvn@3651 | 1651 | mb->init_req(TypeFunc::Memory, storestore->in(TypeFunc::Memory)); |
kvn@3651 | 1652 | mb->init_req(TypeFunc::Control, storestore->in(TypeFunc::Control)); |
kvn@3651 | 1653 | igvn->register_new_node_with_optimizer(mb); |
kvn@3651 | 1654 | igvn->replace_node(storestore, mb); |
kvn@3651 | 1655 | } |
kvn@3651 | 1656 | } |
kvn@3651 | 1657 | } |
kvn@3651 | 1658 | |
kvn@3651 | 1659 | // Optimize objects compare. |
kvn@3651 | 1660 | Node* ConnectionGraph::optimize_ptr_compare(Node* n) { |
kvn@3651 | 1661 | assert(OptimizePtrCompare, "sanity"); |
kvn@3651 | 1662 | PointsToNode* ptn1 = ptnode_adr(n->in(1)->_idx); |
kvn@3651 | 1663 | PointsToNode* ptn2 = ptnode_adr(n->in(2)->_idx); |
kvn@3651 | 1664 | JavaObjectNode* jobj1 = unique_java_object(n->in(1)); |
kvn@3651 | 1665 | JavaObjectNode* jobj2 = unique_java_object(n->in(2)); |
kvn@3651 | 1666 | assert(ptn1->is_JavaObject() || ptn1->is_LocalVar(), "sanity"); |
kvn@3651 | 1667 | assert(ptn2->is_JavaObject() || ptn2->is_LocalVar(), "sanity"); |
kvn@3651 | 1668 | |
kvn@3651 | 1669 | // Check simple cases first. |
kvn@3651 | 1670 | if (jobj1 != NULL) { |
kvn@3651 | 1671 | if (jobj1->escape_state() == PointsToNode::NoEscape) { |
kvn@3651 | 1672 | if (jobj1 == jobj2) { |
kvn@3651 | 1673 | // Comparing the same not escaping object. |
kvn@3651 | 1674 | return _pcmp_eq; |
kvn@3651 | 1675 | } |
kvn@3651 | 1676 | Node* obj = jobj1->ideal_node(); |
kvn@3651 | 1677 | // Comparing not escaping allocation. |
kvn@3651 | 1678 | if ((obj->is_Allocate() || obj->is_CallStaticJava()) && |
kvn@3651 | 1679 | !ptn2->points_to(jobj1)) { |
kvn@3651 | 1680 | return _pcmp_neq; // This includes nullness check. |
kvn@3651 | 1681 | } |
kvn@3651 | 1682 | } |
kvn@3651 | 1683 | } |
kvn@3651 | 1684 | if (jobj2 != NULL) { |
kvn@3651 | 1685 | if (jobj2->escape_state() == PointsToNode::NoEscape) { |
kvn@3651 | 1686 | Node* obj = jobj2->ideal_node(); |
kvn@3651 | 1687 | // Comparing not escaping allocation. |
kvn@3651 | 1688 | if ((obj->is_Allocate() || obj->is_CallStaticJava()) && |
kvn@3651 | 1689 | !ptn1->points_to(jobj2)) { |
kvn@3651 | 1690 | return _pcmp_neq; // This includes nullness check. |
kvn@3651 | 1691 | } |
kvn@3651 | 1692 | } |
kvn@3651 | 1693 | } |
kvn@3651 | 1694 | if (jobj1 != NULL && jobj1 != phantom_obj && |
kvn@3651 | 1695 | jobj2 != NULL && jobj2 != phantom_obj && |
kvn@3651 | 1696 | jobj1->ideal_node()->is_Con() && |
kvn@3651 | 1697 | jobj2->ideal_node()->is_Con()) { |
kvn@3651 | 1698 | // Klass or String constants compare. Need to be careful with |
kvn@3651 | 1699 | // compressed pointers - compare types of ConN and ConP instead of nodes. |
kvn@3651 | 1700 | const Type* t1 = jobj1->ideal_node()->bottom_type()->make_ptr(); |
kvn@3651 | 1701 | const Type* t2 = jobj2->ideal_node()->bottom_type()->make_ptr(); |
kvn@3651 | 1702 | assert(t1 != NULL && t2 != NULL, "sanity"); |
kvn@3651 | 1703 | if (t1->make_ptr() == t2->make_ptr()) { |
kvn@3651 | 1704 | return _pcmp_eq; |
kvn@3651 | 1705 | } else { |
kvn@3651 | 1706 | return _pcmp_neq; |
kvn@3651 | 1707 | } |
kvn@3651 | 1708 | } |
kvn@3651 | 1709 | if (ptn1->meet(ptn2)) { |
kvn@3651 | 1710 | return NULL; // Sets are not disjoint |
kvn@3651 | 1711 | } |
kvn@3651 | 1712 | |
kvn@3651 | 1713 | // Sets are disjoint. |
kvn@3651 | 1714 | bool set1_has_unknown_ptr = ptn1->points_to(phantom_obj); |
kvn@3651 | 1715 | bool set2_has_unknown_ptr = ptn2->points_to(phantom_obj); |
kvn@3651 | 1716 | bool set1_has_null_ptr = ptn1->points_to(null_obj); |
kvn@3651 | 1717 | bool set2_has_null_ptr = ptn2->points_to(null_obj); |
kvn@3651 | 1718 | if (set1_has_unknown_ptr && set2_has_null_ptr || |
kvn@3651 | 1719 | set2_has_unknown_ptr && set1_has_null_ptr) { |
kvn@3651 | 1720 | // Check nullness of unknown object. |
kvn@3651 | 1721 | return NULL; |
kvn@3651 | 1722 | } |
kvn@3651 | 1723 | |
kvn@3651 | 1724 | // Disjointness by itself is not sufficient since |
kvn@3651 | 1725 | // alias analysis is not complete for escaped objects. |
kvn@3651 | 1726 | // Disjoint sets are definitely unrelated only when |
kvn@3651 | 1727 | // at least one set has only not escaping allocations. |
kvn@3651 | 1728 | if (!set1_has_unknown_ptr && !set1_has_null_ptr) { |
kvn@3651 | 1729 | if (ptn1->non_escaping_allocation()) { |
kvn@3651 | 1730 | return _pcmp_neq; |
kvn@3651 | 1731 | } |
kvn@3651 | 1732 | } |
kvn@3651 | 1733 | if (!set2_has_unknown_ptr && !set2_has_null_ptr) { |
kvn@3651 | 1734 | if (ptn2->non_escaping_allocation()) { |
kvn@3651 | 1735 | return _pcmp_neq; |
kvn@3651 | 1736 | } |
kvn@3651 | 1737 | } |
kvn@3651 | 1738 | return NULL; |
kvn@3651 | 1739 | } |
kvn@3651 | 1740 | |
kvn@3651 | 1741 | // Connection Graph constuction functions. |
kvn@3651 | 1742 | |
kvn@3651 | 1743 | void ConnectionGraph::add_local_var(Node *n, PointsToNode::EscapeState es) { |
kvn@3651 | 1744 | PointsToNode* ptadr = _nodes.at(n->_idx); |
kvn@3651 | 1745 | if (ptadr != NULL) { |
kvn@3651 | 1746 | assert(ptadr->is_LocalVar() && ptadr->ideal_node() == n, "sanity"); |
kvn@3651 | 1747 | return; |
kvn@3651 | 1748 | } |
kvn@3651 | 1749 | Compile* C = _compile; |
kvn@3651 | 1750 | ptadr = new (C->comp_arena()) LocalVarNode(C, n, es); |
kvn@3651 | 1751 | _nodes.at_put(n->_idx, ptadr); |
kvn@3651 | 1752 | } |
kvn@3651 | 1753 | |
kvn@3651 | 1754 | void ConnectionGraph::add_java_object(Node *n, PointsToNode::EscapeState es) { |
kvn@3651 | 1755 | PointsToNode* ptadr = _nodes.at(n->_idx); |
kvn@3651 | 1756 | if (ptadr != NULL) { |
kvn@3651 | 1757 | assert(ptadr->is_JavaObject() && ptadr->ideal_node() == n, "sanity"); |
kvn@3651 | 1758 | return; |
kvn@3651 | 1759 | } |
kvn@3651 | 1760 | Compile* C = _compile; |
kvn@3651 | 1761 | ptadr = new (C->comp_arena()) JavaObjectNode(C, n, es); |
kvn@3651 | 1762 | _nodes.at_put(n->_idx, ptadr); |
kvn@3651 | 1763 | } |
kvn@3651 | 1764 | |
kvn@3651 | 1765 | void ConnectionGraph::add_field(Node *n, PointsToNode::EscapeState es, int offset) { |
kvn@3651 | 1766 | PointsToNode* ptadr = _nodes.at(n->_idx); |
kvn@3651 | 1767 | if (ptadr != NULL) { |
kvn@3651 | 1768 | assert(ptadr->is_Field() && ptadr->ideal_node() == n, "sanity"); |
kvn@3651 | 1769 | return; |
kvn@3651 | 1770 | } |
kvn@3651 | 1771 | Compile* C = _compile; |
kvn@3651 | 1772 | bool is_oop = is_oop_field(n, offset); |
kvn@3651 | 1773 | FieldNode* field = new (C->comp_arena()) FieldNode(C, n, es, offset, is_oop); |
kvn@3651 | 1774 | _nodes.at_put(n->_idx, field); |
kvn@3651 | 1775 | } |
kvn@3651 | 1776 | |
kvn@3651 | 1777 | void ConnectionGraph::add_arraycopy(Node *n, PointsToNode::EscapeState es, |
kvn@3651 | 1778 | PointsToNode* src, PointsToNode* dst) { |
kvn@3651 | 1779 | assert(!src->is_Field() && !dst->is_Field(), "only for JavaObject and LocalVar"); |
kvn@3651 | 1780 | assert((src != null_obj) && (dst != null_obj), "not for ConP NULL"); |
kvn@3651 | 1781 | PointsToNode* ptadr = _nodes.at(n->_idx); |
kvn@3651 | 1782 | if (ptadr != NULL) { |
kvn@3651 | 1783 | assert(ptadr->is_Arraycopy() && ptadr->ideal_node() == n, "sanity"); |
kvn@3651 | 1784 | return; |
kvn@3651 | 1785 | } |
kvn@3651 | 1786 | Compile* C = _compile; |
kvn@3651 | 1787 | ptadr = new (C->comp_arena()) ArraycopyNode(C, n, es); |
kvn@3651 | 1788 | _nodes.at_put(n->_idx, ptadr); |
kvn@3651 | 1789 | // Add edge from arraycopy node to source object. |
kvn@3651 | 1790 | (void)add_edge(ptadr, src); |
kvn@3651 | 1791 | src->set_arraycopy_src(); |
kvn@3651 | 1792 | // Add edge from destination object to arraycopy node. |
kvn@3651 | 1793 | (void)add_edge(dst, ptadr); |
kvn@3651 | 1794 | dst->set_arraycopy_dst(); |
kvn@3651 | 1795 | } |
kvn@3651 | 1796 | |
kvn@3651 | 1797 | bool ConnectionGraph::is_oop_field(Node* n, int offset) { |
kvn@3651 | 1798 | const Type* adr_type = n->as_AddP()->bottom_type(); |
kvn@3651 | 1799 | BasicType bt = T_INT; |
kvn@3651 | 1800 | if (offset == Type::OffsetBot) { |
kvn@3651 | 1801 | // Check only oop fields. |
kvn@3651 | 1802 | if (!adr_type->isa_aryptr() || |
kvn@3651 | 1803 | (adr_type->isa_aryptr()->klass() == NULL) || |
kvn@3651 | 1804 | adr_type->isa_aryptr()->klass()->is_obj_array_klass()) { |
kvn@3651 | 1805 | // OffsetBot is used to reference array's element. Ignore first AddP. |
kvn@3651 | 1806 | if (find_second_addp(n, n->in(AddPNode::Base)) == NULL) { |
kvn@3651 | 1807 | bt = T_OBJECT; |
kvn@3651 | 1808 | } |
kvn@3651 | 1809 | } |
kvn@3651 | 1810 | } else if (offset != oopDesc::klass_offset_in_bytes()) { |
kvn@3651 | 1811 | if (adr_type->isa_instptr()) { |
kvn@3651 | 1812 | ciField* field = _compile->alias_type(adr_type->isa_instptr())->field(); |
kvn@3651 | 1813 | if (field != NULL) { |
kvn@3651 | 1814 | bt = field->layout_type(); |
kvn@3651 | 1815 | } else { |
kvn@3651 | 1816 | // Ignore non field load (for example, klass load) |
kvn@3651 | 1817 | } |
kvn@3651 | 1818 | } else if (adr_type->isa_aryptr()) { |
kvn@3651 | 1819 | if (offset == arrayOopDesc::length_offset_in_bytes()) { |
kvn@3651 | 1820 | // Ignore array length load. |
kvn@3651 | 1821 | } else if (find_second_addp(n, n->in(AddPNode::Base)) != NULL) { |
kvn@3651 | 1822 | // Ignore first AddP. |
kvn@3651 | 1823 | } else { |
kvn@3651 | 1824 | const Type* elemtype = adr_type->isa_aryptr()->elem(); |
kvn@3651 | 1825 | bt = elemtype->array_element_basic_type(); |
kvn@3651 | 1826 | } |
kvn@3651 | 1827 | } else if (adr_type->isa_rawptr() || adr_type->isa_klassptr()) { |
kvn@3651 | 1828 | // Allocation initialization, ThreadLocal field access, unsafe access |
kvn@3651 | 1829 | for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { |
kvn@3651 | 1830 | int opcode = n->fast_out(i)->Opcode(); |
kvn@3651 | 1831 | if (opcode == Op_StoreP || opcode == Op_LoadP || |
kvn@3651 | 1832 | opcode == Op_StoreN || opcode == Op_LoadN) { |
kvn@3651 | 1833 | bt = T_OBJECT; |
kvn@3651 | 1834 | } |
kvn@3651 | 1835 | } |
kvn@3651 | 1836 | } |
kvn@3651 | 1837 | } |
kvn@3651 | 1838 | return (bt == T_OBJECT || bt == T_NARROWOOP || bt == T_ARRAY); |
kvn@3651 | 1839 | } |
kvn@3651 | 1840 | |
kvn@3651 | 1841 | // Returns unique pointed java object or NULL. |
kvn@3651 | 1842 | JavaObjectNode* ConnectionGraph::unique_java_object(Node *n) { |
kvn@3651 | 1843 | assert(!_collecting, "should not call when contructed graph"); |
kvn@3651 | 1844 | // If the node was created after the escape computation we can't answer. |
kvn@3651 | 1845 | uint idx = n->_idx; |
kvn@3651 | 1846 | if (idx >= nodes_size()) { |
kvn@3651 | 1847 | return NULL; |
kvn@3651 | 1848 | } |
kvn@3651 | 1849 | PointsToNode* ptn = ptnode_adr(idx); |
kvn@3651 | 1850 | if (ptn->is_JavaObject()) { |
kvn@3651 | 1851 | return ptn->as_JavaObject(); |
kvn@3651 | 1852 | } |
kvn@3651 | 1853 | assert(ptn->is_LocalVar(), "sanity"); |
kvn@3651 | 1854 | // Check all java objects it points to. |
kvn@3651 | 1855 | JavaObjectNode* jobj = NULL; |
kvn@3651 | 1856 | for (EdgeIterator i(ptn); i.has_next(); i.next()) { |
kvn@3651 | 1857 | PointsToNode* e = i.get(); |
kvn@3651 | 1858 | if (e->is_JavaObject()) { |
kvn@3651 | 1859 | if (jobj == NULL) { |
kvn@3651 | 1860 | jobj = e->as_JavaObject(); |
kvn@3651 | 1861 | } else if (jobj != e) { |
kvn@3651 | 1862 | return NULL; |
kvn@3651 | 1863 | } |
kvn@3651 | 1864 | } |
kvn@3651 | 1865 | } |
kvn@3651 | 1866 | return jobj; |
kvn@3651 | 1867 | } |
kvn@3651 | 1868 | |
kvn@3651 | 1869 | // Return true if this node points only to non-escaping allocations. |
kvn@3651 | 1870 | bool PointsToNode::non_escaping_allocation() { |
kvn@3651 | 1871 | if (is_JavaObject()) { |
kvn@3651 | 1872 | Node* n = ideal_node(); |
kvn@3651 | 1873 | if (n->is_Allocate() || n->is_CallStaticJava()) { |
kvn@3651 | 1874 | return (escape_state() == PointsToNode::NoEscape); |
kvn@3651 | 1875 | } else { |
kvn@3651 | 1876 | return false; |
kvn@3651 | 1877 | } |
kvn@3651 | 1878 | } |
kvn@3651 | 1879 | assert(is_LocalVar(), "sanity"); |
kvn@3651 | 1880 | // Check all java objects it points to. |
kvn@3651 | 1881 | for (EdgeIterator i(this); i.has_next(); i.next()) { |
kvn@3651 | 1882 | PointsToNode* e = i.get(); |
kvn@3651 | 1883 | if (e->is_JavaObject()) { |
kvn@3651 | 1884 | Node* n = e->ideal_node(); |
kvn@3651 | 1885 | if ((e->escape_state() != PointsToNode::NoEscape) || |
kvn@3651 | 1886 | !(n->is_Allocate() || n->is_CallStaticJava())) { |
kvn@3651 | 1887 | return false; |
kvn@3651 | 1888 | } |
kvn@3651 | 1889 | } |
kvn@3651 | 1890 | } |
kvn@3651 | 1891 | return true; |
kvn@3651 | 1892 | } |
kvn@3651 | 1893 | |
kvn@3651 | 1894 | // Return true if we know the node does not escape globally. |
kvn@3651 | 1895 | bool ConnectionGraph::not_global_escape(Node *n) { |
kvn@3651 | 1896 | assert(!_collecting, "should not call during graph construction"); |
kvn@3651 | 1897 | // If the node was created after the escape computation we can't answer. |
kvn@3651 | 1898 | uint idx = n->_idx; |
kvn@3651 | 1899 | if (idx >= nodes_size()) { |
kvn@3651 | 1900 | return false; |
kvn@3651 | 1901 | } |
kvn@3651 | 1902 | PointsToNode* ptn = ptnode_adr(idx); |
kvn@3651 | 1903 | PointsToNode::EscapeState es = ptn->escape_state(); |
kvn@3651 | 1904 | // If we have already computed a value, return it. |
kvn@3651 | 1905 | if (es >= PointsToNode::GlobalEscape) |
kvn@3651 | 1906 | return false; |
kvn@3651 | 1907 | if (ptn->is_JavaObject()) { |
kvn@3651 | 1908 | return true; // (es < PointsToNode::GlobalEscape); |
kvn@3651 | 1909 | } |
kvn@3651 | 1910 | assert(ptn->is_LocalVar(), "sanity"); |
kvn@3651 | 1911 | // Check all java objects it points to. |
kvn@3651 | 1912 | for (EdgeIterator i(ptn); i.has_next(); i.next()) { |
kvn@3651 | 1913 | if (i.get()->escape_state() >= PointsToNode::GlobalEscape) |
kvn@3651 | 1914 | return false; |
kvn@3651 | 1915 | } |
kvn@3651 | 1916 | return true; |
kvn@3651 | 1917 | } |
kvn@3651 | 1918 | |
kvn@3651 | 1919 | |
kvn@3651 | 1920 | // Helper functions |
kvn@3651 | 1921 | |
kvn@3651 | 1922 | // Return true if this node points to specified node or nodes it points to. |
kvn@3651 | 1923 | bool PointsToNode::points_to(JavaObjectNode* ptn) const { |
kvn@3651 | 1924 | if (is_JavaObject()) { |
kvn@3651 | 1925 | return (this == ptn); |
kvn@3651 | 1926 | } |
kvn@3651 | 1927 | assert(is_LocalVar(), "sanity"); |
kvn@3651 | 1928 | for (EdgeIterator i(this); i.has_next(); i.next()) { |
kvn@3651 | 1929 | if (i.get() == ptn) |
kvn@3651 | 1930 | return true; |
kvn@3651 | 1931 | } |
kvn@3651 | 1932 | return false; |
kvn@3651 | 1933 | } |
kvn@3651 | 1934 | |
kvn@3651 | 1935 | // Return true if one node points to an other. |
kvn@3651 | 1936 | bool PointsToNode::meet(PointsToNode* ptn) { |
kvn@3651 | 1937 | if (this == ptn) { |
kvn@3651 | 1938 | return true; |
kvn@3651 | 1939 | } else if (ptn->is_JavaObject()) { |
kvn@3651 | 1940 | return this->points_to(ptn->as_JavaObject()); |
kvn@3651 | 1941 | } else if (this->is_JavaObject()) { |
kvn@3651 | 1942 | return ptn->points_to(this->as_JavaObject()); |
kvn@3651 | 1943 | } |
kvn@3651 | 1944 | assert(this->is_LocalVar() && ptn->is_LocalVar(), "sanity"); |
kvn@3651 | 1945 | int ptn_count = ptn->edge_count(); |
kvn@3651 | 1946 | for (EdgeIterator i(this); i.has_next(); i.next()) { |
kvn@3651 | 1947 | PointsToNode* this_e = i.get(); |
kvn@3651 | 1948 | for (int j = 0; j < ptn_count; j++) { |
kvn@3651 | 1949 | if (this_e == ptn->edge(j)) |
kvn@3651 | 1950 | return true; |
kvn@3651 | 1951 | } |
kvn@3651 | 1952 | } |
kvn@3651 | 1953 | return false; |
kvn@3651 | 1954 | } |
kvn@3651 | 1955 | |
kvn@3651 | 1956 | #ifdef ASSERT |
kvn@3651 | 1957 | // Return true if bases point to this java object. |
kvn@3651 | 1958 | bool FieldNode::has_base(JavaObjectNode* jobj) const { |
kvn@3651 | 1959 | for (BaseIterator i(this); i.has_next(); i.next()) { |
kvn@3651 | 1960 | if (i.get() == jobj) |
kvn@3651 | 1961 | return true; |
kvn@3651 | 1962 | } |
kvn@3651 | 1963 | return false; |
kvn@3651 | 1964 | } |
kvn@3651 | 1965 | #endif |
kvn@3651 | 1966 | |
kvn@500 | 1967 | int ConnectionGraph::address_offset(Node* adr, PhaseTransform *phase) { |
kvn@500 | 1968 | const Type *adr_type = phase->type(adr); |
kvn@500 | 1969 | if (adr->is_AddP() && adr_type->isa_oopptr() == NULL && |
kvn@500 | 1970 | adr->in(AddPNode::Address)->is_Proj() && |
kvn@500 | 1971 | adr->in(AddPNode::Address)->in(0)->is_Allocate()) { |
kvn@500 | 1972 | // We are computing a raw address for a store captured by an Initialize |
kvn@500 | 1973 | // compute an appropriate address type. AddP cases #3 and #5 (see below). |
kvn@500 | 1974 | int offs = (int)phase->find_intptr_t_con(adr->in(AddPNode::Offset), Type::OffsetBot); |
kvn@500 | 1975 | assert(offs != Type::OffsetBot || |
kvn@500 | 1976 | adr->in(AddPNode::Address)->in(0)->is_AllocateArray(), |
kvn@500 | 1977 | "offset must be a constant or it is initialization of array"); |
kvn@500 | 1978 | return offs; |
kvn@500 | 1979 | } |
kvn@500 | 1980 | const TypePtr *t_ptr = adr_type->isa_ptr(); |
duke@435 | 1981 | assert(t_ptr != NULL, "must be a pointer type"); |
duke@435 | 1982 | return t_ptr->offset(); |
duke@435 | 1983 | } |
duke@435 | 1984 | |
kvn@3651 | 1985 | Node* ConnectionGraph::get_addp_base(Node *addp) { |
kvn@500 | 1986 | assert(addp->is_AddP(), "must be AddP"); |
kvn@500 | 1987 | // |
kvn@500 | 1988 | // AddP cases for Base and Address inputs: |
kvn@500 | 1989 | // case #1. Direct object's field reference: |
kvn@500 | 1990 | // Allocate |
kvn@500 | 1991 | // | |
kvn@500 | 1992 | // Proj #5 ( oop result ) |
kvn@500 | 1993 | // | |
kvn@500 | 1994 | // CheckCastPP (cast to instance type) |
kvn@500 | 1995 | // | | |
kvn@500 | 1996 | // AddP ( base == address ) |
kvn@500 | 1997 | // |
kvn@500 | 1998 | // case #2. Indirect object's field reference: |
kvn@500 | 1999 | // Phi |
kvn@500 | 2000 | // | |
kvn@500 | 2001 | // CastPP (cast to instance type) |
kvn@500 | 2002 | // | | |
kvn@500 | 2003 | // AddP ( base == address ) |
kvn@500 | 2004 | // |
kvn@500 | 2005 | // case #3. Raw object's field reference for Initialize node: |
kvn@500 | 2006 | // Allocate |
kvn@500 | 2007 | // | |
kvn@500 | 2008 | // Proj #5 ( oop result ) |
kvn@500 | 2009 | // top | |
kvn@500 | 2010 | // \ | |
kvn@500 | 2011 | // AddP ( base == top ) |
kvn@500 | 2012 | // |
kvn@500 | 2013 | // case #4. Array's element reference: |
kvn@500 | 2014 | // {CheckCastPP | CastPP} |
kvn@500 | 2015 | // | | | |
kvn@500 | 2016 | // | AddP ( array's element offset ) |
kvn@500 | 2017 | // | | |
kvn@500 | 2018 | // AddP ( array's offset ) |
kvn@500 | 2019 | // |
kvn@500 | 2020 | // case #5. Raw object's field reference for arraycopy stub call: |
kvn@500 | 2021 | // The inline_native_clone() case when the arraycopy stub is called |
kvn@500 | 2022 | // after the allocation before Initialize and CheckCastPP nodes. |
kvn@500 | 2023 | // Allocate |
kvn@500 | 2024 | // | |
kvn@500 | 2025 | // Proj #5 ( oop result ) |
kvn@500 | 2026 | // | | |
kvn@500 | 2027 | // AddP ( base == address ) |
kvn@500 | 2028 | // |
kvn@512 | 2029 | // case #6. Constant Pool, ThreadLocal, CastX2P or |
kvn@512 | 2030 | // Raw object's field reference: |
kvn@512 | 2031 | // {ConP, ThreadLocal, CastX2P, raw Load} |
kvn@500 | 2032 | // top | |
kvn@500 | 2033 | // \ | |
kvn@500 | 2034 | // AddP ( base == top ) |
kvn@500 | 2035 | // |
kvn@512 | 2036 | // case #7. Klass's field reference. |
kvn@512 | 2037 | // LoadKlass |
kvn@512 | 2038 | // | | |
kvn@512 | 2039 | // AddP ( base == address ) |
kvn@512 | 2040 | // |
kvn@599 | 2041 | // case #8. narrow Klass's field reference. |
kvn@599 | 2042 | // LoadNKlass |
kvn@599 | 2043 | // | |
kvn@599 | 2044 | // DecodeN |
kvn@599 | 2045 | // | | |
kvn@599 | 2046 | // AddP ( base == address ) |
kvn@599 | 2047 | // |
kvn@3651 | 2048 | Node *base = addp->in(AddPNode::Base); |
kvn@3651 | 2049 | if (base->uncast()->is_top()) { // The AddP case #3 and #6. |
kvn@3651 | 2050 | base = addp->in(AddPNode::Address); |
kvn@1392 | 2051 | while (base->is_AddP()) { |
kvn@1392 | 2052 | // Case #6 (unsafe access) may have several chained AddP nodes. |
kvn@3651 | 2053 | assert(base->in(AddPNode::Base)->uncast()->is_top(), "expected unsafe access address only"); |
kvn@3651 | 2054 | base = base->in(AddPNode::Address); |
kvn@1392 | 2055 | } |
kvn@3651 | 2056 | Node* uncast_base = base->uncast(); |
kvn@3651 | 2057 | int opcode = uncast_base->Opcode(); |
kvn@3651 | 2058 | assert(opcode == Op_ConP || opcode == Op_ThreadLocal || |
kvn@3651 | 2059 | opcode == Op_CastX2P || uncast_base->is_DecodeN() || |
kvn@3651 | 2060 | (uncast_base->is_Mem() && uncast_base->bottom_type() == TypeRawPtr::NOTNULL) || |
kvn@3651 | 2061 | (uncast_base->is_Proj() && uncast_base->in(0)->is_Allocate()), "sanity"); |
duke@435 | 2062 | } |
kvn@500 | 2063 | return base; |
kvn@500 | 2064 | } |
kvn@500 | 2065 | |
kvn@3651 | 2066 | Node* ConnectionGraph::find_second_addp(Node* addp, Node* n) { |
kvn@500 | 2067 | assert(addp->is_AddP() && addp->outcnt() > 0, "Don't process dead nodes"); |
kvn@500 | 2068 | Node* addp2 = addp->raw_out(0); |
kvn@500 | 2069 | if (addp->outcnt() == 1 && addp2->is_AddP() && |
kvn@500 | 2070 | addp2->in(AddPNode::Base) == n && |
kvn@500 | 2071 | addp2->in(AddPNode::Address) == addp) { |
kvn@500 | 2072 | assert(addp->in(AddPNode::Base) == n, "expecting the same base"); |
kvn@500 | 2073 | // |
kvn@500 | 2074 | // Find array's offset to push it on worklist first and |
kvn@500 | 2075 | // as result process an array's element offset first (pushed second) |
kvn@500 | 2076 | // to avoid CastPP for the array's offset. |
kvn@500 | 2077 | // Otherwise the inserted CastPP (LocalVar) will point to what |
kvn@500 | 2078 | // the AddP (Field) points to. Which would be wrong since |
kvn@500 | 2079 | // the algorithm expects the CastPP has the same point as |
kvn@500 | 2080 | // as AddP's base CheckCastPP (LocalVar). |
kvn@500 | 2081 | // |
kvn@500 | 2082 | // ArrayAllocation |
kvn@500 | 2083 | // | |
kvn@500 | 2084 | // CheckCastPP |
kvn@500 | 2085 | // | |
kvn@500 | 2086 | // memProj (from ArrayAllocation CheckCastPP) |
kvn@500 | 2087 | // | || |
kvn@500 | 2088 | // | || Int (element index) |
kvn@500 | 2089 | // | || | ConI (log(element size)) |
kvn@500 | 2090 | // | || | / |
kvn@500 | 2091 | // | || LShift |
kvn@500 | 2092 | // | || / |
kvn@500 | 2093 | // | AddP (array's element offset) |
kvn@500 | 2094 | // | | |
kvn@500 | 2095 | // | | ConI (array's offset: #12(32-bits) or #24(64-bits)) |
kvn@500 | 2096 | // | / / |
kvn@500 | 2097 | // AddP (array's offset) |
kvn@500 | 2098 | // | |
kvn@500 | 2099 | // Load/Store (memory operation on array's element) |
kvn@500 | 2100 | // |
kvn@500 | 2101 | return addp2; |
kvn@500 | 2102 | } |
kvn@500 | 2103 | return NULL; |
duke@435 | 2104 | } |
duke@435 | 2105 | |
duke@435 | 2106 | // |
duke@435 | 2107 | // Adjust the type and inputs of an AddP which computes the |
duke@435 | 2108 | // address of a field of an instance |
duke@435 | 2109 | // |
kvn@3651 | 2110 | bool ConnectionGraph::split_AddP(Node *addp, Node *base) { |
kvn@3651 | 2111 | PhaseGVN* igvn = _igvn; |
kvn@500 | 2112 | const TypeOopPtr *base_t = igvn->type(base)->isa_oopptr(); |
kvn@658 | 2113 | assert(base_t != NULL && base_t->is_known_instance(), "expecting instance oopptr"); |
duke@435 | 2114 | const TypeOopPtr *t = igvn->type(addp)->isa_oopptr(); |
kvn@500 | 2115 | if (t == NULL) { |
kvn@500 | 2116 | // We are computing a raw address for a store captured by an Initialize |
kvn@728 | 2117 | // compute an appropriate address type (cases #3 and #5). |
kvn@500 | 2118 | assert(igvn->type(addp) == TypeRawPtr::NOTNULL, "must be raw pointer"); |
kvn@500 | 2119 | assert(addp->in(AddPNode::Address)->is_Proj(), "base of raw address must be result projection from allocation"); |
kvn@741 | 2120 | intptr_t offs = (int)igvn->find_intptr_t_con(addp->in(AddPNode::Offset), Type::OffsetBot); |
kvn@500 | 2121 | assert(offs != Type::OffsetBot, "offset must be a constant"); |
kvn@500 | 2122 | t = base_t->add_offset(offs)->is_oopptr(); |
kvn@500 | 2123 | } |
kvn@658 | 2124 | int inst_id = base_t->instance_id(); |
kvn@658 | 2125 | assert(!t->is_known_instance() || t->instance_id() == inst_id, |
duke@435 | 2126 | "old type must be non-instance or match new type"); |
kvn@728 | 2127 | |
kvn@728 | 2128 | // The type 't' could be subclass of 'base_t'. |
kvn@728 | 2129 | // As result t->offset() could be large then base_t's size and it will |
kvn@728 | 2130 | // cause the failure in add_offset() with narrow oops since TypeOopPtr() |
kvn@728 | 2131 | // constructor verifies correctness of the offset. |
kvn@728 | 2132 | // |
twisti@1040 | 2133 | // It could happened on subclass's branch (from the type profiling |
kvn@728 | 2134 | // inlining) which was not eliminated during parsing since the exactness |
kvn@728 | 2135 | // of the allocation type was not propagated to the subclass type check. |
kvn@728 | 2136 | // |
kvn@1423 | 2137 | // Or the type 't' could be not related to 'base_t' at all. |
kvn@1423 | 2138 | // It could happened when CHA type is different from MDO type on a dead path |
kvn@1423 | 2139 | // (for example, from instanceof check) which is not collapsed during parsing. |
kvn@1423 | 2140 | // |
kvn@728 | 2141 | // Do nothing for such AddP node and don't process its users since |
kvn@728 | 2142 | // this code branch will go away. |
kvn@728 | 2143 | // |
kvn@728 | 2144 | if (!t->is_known_instance() && |
kvn@1423 | 2145 | !base_t->klass()->is_subtype_of(t->klass())) { |
kvn@728 | 2146 | return false; // bail out |
kvn@728 | 2147 | } |
duke@435 | 2148 | const TypeOopPtr *tinst = base_t->add_offset(t->offset())->is_oopptr(); |
kvn@1497 | 2149 | // Do NOT remove the next line: ensure a new alias index is allocated |
kvn@1497 | 2150 | // for the instance type. Note: C++ will not remove it since the call |
kvn@1497 | 2151 | // has side effect. |
duke@435 | 2152 | int alias_idx = _compile->get_alias_index(tinst); |
duke@435 | 2153 | igvn->set_type(addp, tinst); |
duke@435 | 2154 | // record the allocation in the node map |
kvn@3651 | 2155 | set_map(addp, get_map(base->_idx)); |
kvn@688 | 2156 | // Set addp's Base and Address to 'base'. |
kvn@688 | 2157 | Node *abase = addp->in(AddPNode::Base); |
kvn@688 | 2158 | Node *adr = addp->in(AddPNode::Address); |
kvn@688 | 2159 | if (adr->is_Proj() && adr->in(0)->is_Allocate() && |
kvn@688 | 2160 | adr->in(0)->_idx == (uint)inst_id) { |
kvn@688 | 2161 | // Skip AddP cases #3 and #5. |
kvn@688 | 2162 | } else { |
kvn@688 | 2163 | assert(!abase->is_top(), "sanity"); // AddP case #3 |
kvn@688 | 2164 | if (abase != base) { |
kvn@688 | 2165 | igvn->hash_delete(addp); |
kvn@688 | 2166 | addp->set_req(AddPNode::Base, base); |
kvn@688 | 2167 | if (abase == adr) { |
kvn@688 | 2168 | addp->set_req(AddPNode::Address, base); |
kvn@688 | 2169 | } else { |
kvn@688 | 2170 | // AddP case #4 (adr is array's element offset AddP node) |
kvn@688 | 2171 | #ifdef ASSERT |
kvn@688 | 2172 | const TypeOopPtr *atype = igvn->type(adr)->isa_oopptr(); |
kvn@688 | 2173 | assert(adr->is_AddP() && atype != NULL && |
kvn@688 | 2174 | atype->instance_id() == inst_id, "array's element offset should be processed first"); |
kvn@688 | 2175 | #endif |
kvn@688 | 2176 | } |
kvn@688 | 2177 | igvn->hash_insert(addp); |
duke@435 | 2178 | } |
duke@435 | 2179 | } |
kvn@500 | 2180 | // Put on IGVN worklist since at least addp's type was changed above. |
kvn@500 | 2181 | record_for_optimizer(addp); |
kvn@728 | 2182 | return true; |
duke@435 | 2183 | } |
duke@435 | 2184 | |
duke@435 | 2185 | // |
duke@435 | 2186 | // Create a new version of orig_phi if necessary. Returns either the newly |
kvn@2741 | 2187 | // created phi or an existing phi. Sets create_new to indicate whether a new |
duke@435 | 2188 | // phi was created. Cache the last newly created phi in the node map. |
duke@435 | 2189 | // |
kvn@3651 | 2190 | PhiNode *ConnectionGraph::create_split_phi(PhiNode *orig_phi, int alias_idx, GrowableArray<PhiNode *> &orig_phi_worklist, bool &new_created) { |
duke@435 | 2191 | Compile *C = _compile; |
kvn@3651 | 2192 | PhaseGVN* igvn = _igvn; |
duke@435 | 2193 | new_created = false; |
duke@435 | 2194 | int phi_alias_idx = C->get_alias_index(orig_phi->adr_type()); |
duke@435 | 2195 | // nothing to do if orig_phi is bottom memory or matches alias_idx |
kvn@500 | 2196 | if (phi_alias_idx == alias_idx) { |
duke@435 | 2197 | return orig_phi; |
duke@435 | 2198 | } |
kvn@1286 | 2199 | // Have we recently created a Phi for this alias index? |
duke@435 | 2200 | PhiNode *result = get_map_phi(orig_phi->_idx); |
duke@435 | 2201 | if (result != NULL && C->get_alias_index(result->adr_type()) == alias_idx) { |
duke@435 | 2202 | return result; |
duke@435 | 2203 | } |
kvn@1286 | 2204 | // Previous check may fail when the same wide memory Phi was split into Phis |
kvn@1286 | 2205 | // for different memory slices. Search all Phis for this region. |
kvn@1286 | 2206 | if (result != NULL) { |
kvn@1286 | 2207 | Node* region = orig_phi->in(0); |
kvn@1286 | 2208 | for (DUIterator_Fast imax, i = region->fast_outs(imax); i < imax; i++) { |
kvn@1286 | 2209 | Node* phi = region->fast_out(i); |
kvn@1286 | 2210 | if (phi->is_Phi() && |
kvn@1286 | 2211 | C->get_alias_index(phi->as_Phi()->adr_type()) == alias_idx) { |
kvn@1286 | 2212 | assert(phi->_idx >= nodes_size(), "only new Phi per instance memory slice"); |
kvn@1286 | 2213 | return phi->as_Phi(); |
kvn@1286 | 2214 | } |
kvn@1286 | 2215 | } |
kvn@1286 | 2216 | } |
kvn@473 | 2217 | if ((int)C->unique() + 2*NodeLimitFudgeFactor > MaxNodeLimit) { |
kvn@473 | 2218 | if (C->do_escape_analysis() == true && !C->failing()) { |
kvn@473 | 2219 | // Retry compilation without escape analysis. |
kvn@473 | 2220 | // If this is the first failure, the sentinel string will "stick" |
kvn@473 | 2221 | // to the Compile object, and the C2Compiler will see it and retry. |
kvn@473 | 2222 | C->record_failure(C2Compiler::retry_no_escape_analysis()); |
kvn@473 | 2223 | } |
kvn@473 | 2224 | return NULL; |
kvn@473 | 2225 | } |
duke@435 | 2226 | orig_phi_worklist.append_if_missing(orig_phi); |
kvn@500 | 2227 | const TypePtr *atype = C->get_adr_type(alias_idx); |
duke@435 | 2228 | result = PhiNode::make(orig_phi->in(0), NULL, Type::MEMORY, atype); |
kvn@1286 | 2229 | C->copy_node_notes_to(result, orig_phi); |
duke@435 | 2230 | igvn->set_type(result, result->bottom_type()); |
duke@435 | 2231 | record_for_optimizer(result); |
kvn@3651 | 2232 | set_map(orig_phi, result); |
duke@435 | 2233 | new_created = true; |
duke@435 | 2234 | return result; |
duke@435 | 2235 | } |
duke@435 | 2236 | |
duke@435 | 2237 | // |
kvn@2741 | 2238 | // Return a new version of Memory Phi "orig_phi" with the inputs having the |
duke@435 | 2239 | // specified alias index. |
duke@435 | 2240 | // |
kvn@3651 | 2241 | PhiNode *ConnectionGraph::split_memory_phi(PhiNode *orig_phi, int alias_idx, GrowableArray<PhiNode *> &orig_phi_worklist) { |
duke@435 | 2242 | assert(alias_idx != Compile::AliasIdxBot, "can't split out bottom memory"); |
duke@435 | 2243 | Compile *C = _compile; |
kvn@3651 | 2244 | PhaseGVN* igvn = _igvn; |
duke@435 | 2245 | bool new_phi_created; |
kvn@3651 | 2246 | PhiNode *result = create_split_phi(orig_phi, alias_idx, orig_phi_worklist, new_phi_created); |
duke@435 | 2247 | if (!new_phi_created) { |
duke@435 | 2248 | return result; |
duke@435 | 2249 | } |
duke@435 | 2250 | GrowableArray<PhiNode *> phi_list; |
duke@435 | 2251 | GrowableArray<uint> cur_input; |
duke@435 | 2252 | PhiNode *phi = orig_phi; |
duke@435 | 2253 | uint idx = 1; |
duke@435 | 2254 | bool finished = false; |
duke@435 | 2255 | while(!finished) { |
duke@435 | 2256 | while (idx < phi->req()) { |
kvn@3651 | 2257 | Node *mem = find_inst_mem(phi->in(idx), alias_idx, orig_phi_worklist); |
duke@435 | 2258 | if (mem != NULL && mem->is_Phi()) { |
kvn@3651 | 2259 | PhiNode *newphi = create_split_phi(mem->as_Phi(), alias_idx, orig_phi_worklist, new_phi_created); |
duke@435 | 2260 | if (new_phi_created) { |
duke@435 | 2261 | // found an phi for which we created a new split, push current one on worklist and begin |
duke@435 | 2262 | // processing new one |
duke@435 | 2263 | phi_list.push(phi); |
duke@435 | 2264 | cur_input.push(idx); |
duke@435 | 2265 | phi = mem->as_Phi(); |
kvn@500 | 2266 | result = newphi; |
duke@435 | 2267 | idx = 1; |
duke@435 | 2268 | continue; |
duke@435 | 2269 | } else { |
kvn@500 | 2270 | mem = newphi; |
duke@435 | 2271 | } |
duke@435 | 2272 | } |
kvn@473 | 2273 | if (C->failing()) { |
kvn@473 | 2274 | return NULL; |
kvn@473 | 2275 | } |
duke@435 | 2276 | result->set_req(idx++, mem); |
duke@435 | 2277 | } |
duke@435 | 2278 | #ifdef ASSERT |
duke@435 | 2279 | // verify that the new Phi has an input for each input of the original |
duke@435 | 2280 | assert( phi->req() == result->req(), "must have same number of inputs."); |
duke@435 | 2281 | assert( result->in(0) != NULL && result->in(0) == phi->in(0), "regions must match"); |
kvn@500 | 2282 | #endif |
kvn@500 | 2283 | // Check if all new phi's inputs have specified alias index. |
kvn@500 | 2284 | // Otherwise use old phi. |
duke@435 | 2285 | for (uint i = 1; i < phi->req(); i++) { |
kvn@500 | 2286 | Node* in = result->in(i); |
kvn@500 | 2287 | assert((phi->in(i) == NULL) == (in == NULL), "inputs must correspond."); |
duke@435 | 2288 | } |
duke@435 | 2289 | // we have finished processing a Phi, see if there are any more to do |
duke@435 | 2290 | finished = (phi_list.length() == 0 ); |
duke@435 | 2291 | if (!finished) { |
duke@435 | 2292 | phi = phi_list.pop(); |
duke@435 | 2293 | idx = cur_input.pop(); |
kvn@500 | 2294 | PhiNode *prev_result = get_map_phi(phi->_idx); |
kvn@500 | 2295 | prev_result->set_req(idx++, result); |
kvn@500 | 2296 | result = prev_result; |
duke@435 | 2297 | } |
duke@435 | 2298 | } |
duke@435 | 2299 | return result; |
duke@435 | 2300 | } |
duke@435 | 2301 | |
kvn@500 | 2302 | // |
kvn@500 | 2303 | // The next methods are derived from methods in MemNode. |
kvn@500 | 2304 | // |
kvn@3651 | 2305 | Node* ConnectionGraph::step_through_mergemem(MergeMemNode *mmem, int alias_idx, const TypeOopPtr *toop) { |
kvn@500 | 2306 | Node *mem = mmem; |
never@2170 | 2307 | // TypeOopPtr::NOTNULL+any is an OOP with unknown offset - generally |
kvn@500 | 2308 | // means an array I have not precisely typed yet. Do not do any |
kvn@500 | 2309 | // alias stuff with it any time soon. |
kvn@3651 | 2310 | if (toop->base() != Type::AnyPtr && |
never@2170 | 2311 | !(toop->klass() != NULL && |
never@2170 | 2312 | toop->klass()->is_java_lang_Object() && |
kvn@3651 | 2313 | toop->offset() == Type::OffsetBot)) { |
kvn@500 | 2314 | mem = mmem->memory_at(alias_idx); |
kvn@500 | 2315 | // Update input if it is progress over what we have now |
kvn@500 | 2316 | } |
kvn@500 | 2317 | return mem; |
kvn@500 | 2318 | } |
kvn@500 | 2319 | |
kvn@500 | 2320 | // |
kvn@1536 | 2321 | // Move memory users to their memory slices. |
kvn@1536 | 2322 | // |
kvn@3651 | 2323 | void ConnectionGraph::move_inst_mem(Node* n, GrowableArray<PhiNode *> &orig_phis) { |
kvn@1536 | 2324 | Compile* C = _compile; |
kvn@3651 | 2325 | PhaseGVN* igvn = _igvn; |
kvn@1536 | 2326 | const TypePtr* tp = igvn->type(n->in(MemNode::Address))->isa_ptr(); |
kvn@1536 | 2327 | assert(tp != NULL, "ptr type"); |
kvn@1536 | 2328 | int alias_idx = C->get_alias_index(tp); |
kvn@1536 | 2329 | int general_idx = C->get_general_index(alias_idx); |
kvn@1536 | 2330 | |
kvn@1536 | 2331 | // Move users first |
kvn@1536 | 2332 | for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { |
kvn@1536 | 2333 | Node* use = n->fast_out(i); |
kvn@1536 | 2334 | if (use->is_MergeMem()) { |
kvn@1536 | 2335 | MergeMemNode* mmem = use->as_MergeMem(); |
kvn@1536 | 2336 | assert(n == mmem->memory_at(alias_idx), "should be on instance memory slice"); |
kvn@1536 | 2337 | if (n != mmem->memory_at(general_idx) || alias_idx == general_idx) { |
kvn@1536 | 2338 | continue; // Nothing to do |
kvn@1536 | 2339 | } |
kvn@1536 | 2340 | // Replace previous general reference to mem node. |
kvn@1536 | 2341 | uint orig_uniq = C->unique(); |
kvn@3651 | 2342 | Node* m = find_inst_mem(n, general_idx, orig_phis); |
kvn@1536 | 2343 | assert(orig_uniq == C->unique(), "no new nodes"); |
kvn@1536 | 2344 | mmem->set_memory_at(general_idx, m); |
kvn@1536 | 2345 | --imax; |
kvn@1536 | 2346 | --i; |
kvn@1536 | 2347 | } else if (use->is_MemBar()) { |
kvn@1536 | 2348 | assert(!use->is_Initialize(), "initializing stores should not be moved"); |
kvn@1536 | 2349 | if (use->req() > MemBarNode::Precedent && |
kvn@1536 | 2350 | use->in(MemBarNode::Precedent) == n) { |
kvn@1536 | 2351 | // Don't move related membars. |
kvn@1536 | 2352 | record_for_optimizer(use); |
kvn@1536 | 2353 | continue; |
kvn@1536 | 2354 | } |
kvn@1536 | 2355 | tp = use->as_MemBar()->adr_type()->isa_ptr(); |
kvn@1536 | 2356 | if (tp != NULL && C->get_alias_index(tp) == alias_idx || |
kvn@1536 | 2357 | alias_idx == general_idx) { |
kvn@1536 | 2358 | continue; // Nothing to do |
kvn@1536 | 2359 | } |
kvn@1536 | 2360 | // Move to general memory slice. |
kvn@1536 | 2361 | uint orig_uniq = C->unique(); |
kvn@3651 | 2362 | Node* m = find_inst_mem(n, general_idx, orig_phis); |
kvn@1536 | 2363 | assert(orig_uniq == C->unique(), "no new nodes"); |
kvn@1536 | 2364 | igvn->hash_delete(use); |
kvn@1536 | 2365 | imax -= use->replace_edge(n, m); |
kvn@1536 | 2366 | igvn->hash_insert(use); |
kvn@1536 | 2367 | record_for_optimizer(use); |
kvn@1536 | 2368 | --i; |
kvn@1536 | 2369 | #ifdef ASSERT |
kvn@1536 | 2370 | } else if (use->is_Mem()) { |
kvn@1536 | 2371 | if (use->Opcode() == Op_StoreCM && use->in(MemNode::OopStore) == n) { |
kvn@1536 | 2372 | // Don't move related cardmark. |
kvn@1536 | 2373 | continue; |
kvn@1536 | 2374 | } |
kvn@1536 | 2375 | // Memory nodes should have new memory input. |
kvn@1536 | 2376 | tp = igvn->type(use->in(MemNode::Address))->isa_ptr(); |
kvn@1536 | 2377 | assert(tp != NULL, "ptr type"); |
kvn@1536 | 2378 | int idx = C->get_alias_index(tp); |
kvn@1536 | 2379 | assert(get_map(use->_idx) != NULL || idx == alias_idx, |
kvn@1536 | 2380 | "Following memory nodes should have new memory input or be on the same memory slice"); |
kvn@1536 | 2381 | } else if (use->is_Phi()) { |
kvn@1536 | 2382 | // Phi nodes should be split and moved already. |
kvn@1536 | 2383 | tp = use->as_Phi()->adr_type()->isa_ptr(); |
kvn@1536 | 2384 | assert(tp != NULL, "ptr type"); |
kvn@1536 | 2385 | int idx = C->get_alias_index(tp); |
kvn@1536 | 2386 | assert(idx == alias_idx, "Following Phi nodes should be on the same memory slice"); |
kvn@1536 | 2387 | } else { |
kvn@1536 | 2388 | use->dump(); |
kvn@1536 | 2389 | assert(false, "should not be here"); |
kvn@1536 | 2390 | #endif |
kvn@1536 | 2391 | } |
kvn@1536 | 2392 | } |
kvn@1536 | 2393 | } |
kvn@1536 | 2394 | |
kvn@1536 | 2395 | // |
kvn@500 | 2396 | // Search memory chain of "mem" to find a MemNode whose address |
kvn@500 | 2397 | // is the specified alias index. |
kvn@500 | 2398 | // |
kvn@3651 | 2399 | Node* ConnectionGraph::find_inst_mem(Node *orig_mem, int alias_idx, GrowableArray<PhiNode *> &orig_phis) { |
kvn@500 | 2400 | if (orig_mem == NULL) |
kvn@500 | 2401 | return orig_mem; |
kvn@3651 | 2402 | Compile* C = _compile; |
kvn@3651 | 2403 | PhaseGVN* igvn = _igvn; |
never@2170 | 2404 | const TypeOopPtr *toop = C->get_adr_type(alias_idx)->isa_oopptr(); |
never@2170 | 2405 | bool is_instance = (toop != NULL) && toop->is_known_instance(); |
kvn@688 | 2406 | Node *start_mem = C->start()->proj_out(TypeFunc::Memory); |
kvn@500 | 2407 | Node *prev = NULL; |
kvn@500 | 2408 | Node *result = orig_mem; |
kvn@500 | 2409 | while (prev != result) { |
kvn@500 | 2410 | prev = result; |
kvn@688 | 2411 | if (result == start_mem) |
twisti@1040 | 2412 | break; // hit one of our sentinels |
kvn@500 | 2413 | if (result->is_Mem()) { |
kvn@3651 | 2414 | const Type *at = igvn->type(result->in(MemNode::Address)); |
kvn@2741 | 2415 | if (at == Type::TOP) |
kvn@2741 | 2416 | break; // Dead |
kvn@2741 | 2417 | assert (at->isa_ptr() != NULL, "pointer type required."); |
kvn@2741 | 2418 | int idx = C->get_alias_index(at->is_ptr()); |
kvn@2741 | 2419 | if (idx == alias_idx) |
kvn@2741 | 2420 | break; // Found |
kvn@2741 | 2421 | if (!is_instance && (at->isa_oopptr() == NULL || |
kvn@2741 | 2422 | !at->is_oopptr()->is_known_instance())) { |
kvn@2741 | 2423 | break; // Do not skip store to general memory slice. |
kvn@500 | 2424 | } |
kvn@688 | 2425 | result = result->in(MemNode::Memory); |
kvn@500 | 2426 | } |
kvn@500 | 2427 | if (!is_instance) |
kvn@500 | 2428 | continue; // don't search further for non-instance types |
kvn@500 | 2429 | // skip over a call which does not affect this memory slice |
kvn@500 | 2430 | if (result->is_Proj() && result->as_Proj()->_con == TypeFunc::Memory) { |
kvn@500 | 2431 | Node *proj_in = result->in(0); |
never@2170 | 2432 | if (proj_in->is_Allocate() && proj_in->_idx == (uint)toop->instance_id()) { |
twisti@1040 | 2433 | break; // hit one of our sentinels |
kvn@688 | 2434 | } else if (proj_in->is_Call()) { |
kvn@500 | 2435 | CallNode *call = proj_in->as_Call(); |
kvn@3651 | 2436 | if (!call->may_modify(toop, igvn)) { |
kvn@500 | 2437 | result = call->in(TypeFunc::Memory); |
kvn@500 | 2438 | } |
kvn@500 | 2439 | } else if (proj_in->is_Initialize()) { |
kvn@500 | 2440 | AllocateNode* alloc = proj_in->as_Initialize()->allocation(); |
kvn@500 | 2441 | // Stop if this is the initialization for the object instance which |
kvn@500 | 2442 | // which contains this memory slice, otherwise skip over it. |
never@2170 | 2443 | if (alloc == NULL || alloc->_idx != (uint)toop->instance_id()) { |
kvn@500 | 2444 | result = proj_in->in(TypeFunc::Memory); |
kvn@500 | 2445 | } |
kvn@500 | 2446 | } else if (proj_in->is_MemBar()) { |
kvn@500 | 2447 | result = proj_in->in(TypeFunc::Memory); |
kvn@500 | 2448 | } |
kvn@500 | 2449 | } else if (result->is_MergeMem()) { |
kvn@500 | 2450 | MergeMemNode *mmem = result->as_MergeMem(); |
never@2170 | 2451 | result = step_through_mergemem(mmem, alias_idx, toop); |
kvn@500 | 2452 | if (result == mmem->base_memory()) { |
kvn@500 | 2453 | // Didn't find instance memory, search through general slice recursively. |
kvn@500 | 2454 | result = mmem->memory_at(C->get_general_index(alias_idx)); |
kvn@3651 | 2455 | result = find_inst_mem(result, alias_idx, orig_phis); |
kvn@500 | 2456 | if (C->failing()) { |
kvn@500 | 2457 | return NULL; |
kvn@500 | 2458 | } |
kvn@500 | 2459 | mmem->set_memory_at(alias_idx, result); |
kvn@500 | 2460 | } |
kvn@500 | 2461 | } else if (result->is_Phi() && |
kvn@500 | 2462 | C->get_alias_index(result->as_Phi()->adr_type()) != alias_idx) { |
kvn@3651 | 2463 | Node *un = result->as_Phi()->unique_input(igvn); |
kvn@500 | 2464 | if (un != NULL) { |
kvn@1536 | 2465 | orig_phis.append_if_missing(result->as_Phi()); |
kvn@500 | 2466 | result = un; |
kvn@500 | 2467 | } else { |
kvn@500 | 2468 | break; |
kvn@500 | 2469 | } |
kvn@1535 | 2470 | } else if (result->is_ClearArray()) { |
kvn@3651 | 2471 | if (!ClearArrayNode::step_through(&result, (uint)toop->instance_id(), igvn)) { |
kvn@1535 | 2472 | // Can not bypass initialization of the instance |
kvn@1535 | 2473 | // we are looking for. |
kvn@1535 | 2474 | break; |
kvn@1535 | 2475 | } |
kvn@1535 | 2476 | // Otherwise skip it (the call updated 'result' value). |
kvn@1019 | 2477 | } else if (result->Opcode() == Op_SCMemProj) { |
kvn@1019 | 2478 | assert(result->in(0)->is_LoadStore(), "sanity"); |
kvn@3651 | 2479 | const Type *at = igvn->type(result->in(0)->in(MemNode::Address)); |
kvn@1019 | 2480 | if (at != Type::TOP) { |
kvn@1019 | 2481 | assert (at->isa_ptr() != NULL, "pointer type required."); |
kvn@1019 | 2482 | int idx = C->get_alias_index(at->is_ptr()); |
kvn@1019 | 2483 | assert(idx != alias_idx, "Object is not scalar replaceable if a LoadStore node access its field"); |
kvn@1019 | 2484 | break; |
kvn@1019 | 2485 | } |
kvn@1019 | 2486 | result = result->in(0)->in(MemNode::Memory); |
kvn@500 | 2487 | } |
kvn@500 | 2488 | } |
kvn@682 | 2489 | if (result->is_Phi()) { |
kvn@500 | 2490 | PhiNode *mphi = result->as_Phi(); |
kvn@500 | 2491 | assert(mphi->bottom_type() == Type::MEMORY, "memory phi required"); |
kvn@500 | 2492 | const TypePtr *t = mphi->adr_type(); |
kvn@2741 | 2493 | if (!is_instance) { |
kvn@682 | 2494 | // Push all non-instance Phis on the orig_phis worklist to update inputs |
kvn@682 | 2495 | // during Phase 4 if needed. |
kvn@682 | 2496 | orig_phis.append_if_missing(mphi); |
kvn@2741 | 2497 | } else if (C->get_alias_index(t) != alias_idx) { |
kvn@2741 | 2498 | // Create a new Phi with the specified alias index type. |
kvn@3651 | 2499 | result = split_memory_phi(mphi, alias_idx, orig_phis); |
kvn@500 | 2500 | } |
kvn@500 | 2501 | } |
kvn@500 | 2502 | // the result is either MemNode, PhiNode, InitializeNode. |
kvn@500 | 2503 | return result; |
kvn@500 | 2504 | } |
kvn@500 | 2505 | |
duke@435 | 2506 | // |
duke@435 | 2507 | // Convert the types of unescaped object to instance types where possible, |
duke@435 | 2508 | // propagate the new type information through the graph, and update memory |
duke@435 | 2509 | // edges and MergeMem inputs to reflect the new type. |
duke@435 | 2510 | // |
duke@435 | 2511 | // We start with allocations (and calls which may be allocations) on alloc_worklist. |
duke@435 | 2512 | // The processing is done in 4 phases: |
duke@435 | 2513 | // |
duke@435 | 2514 | // Phase 1: Process possible allocations from alloc_worklist. Create instance |
duke@435 | 2515 | // types for the CheckCastPP for allocations where possible. |
duke@435 | 2516 | // Propagate the the new types through users as follows: |
duke@435 | 2517 | // casts and Phi: push users on alloc_worklist |
duke@435 | 2518 | // AddP: cast Base and Address inputs to the instance type |
duke@435 | 2519 | // push any AddP users on alloc_worklist and push any memnode |
duke@435 | 2520 | // users onto memnode_worklist. |
duke@435 | 2521 | // Phase 2: Process MemNode's from memnode_worklist. compute new address type and |
duke@435 | 2522 | // search the Memory chain for a store with the appropriate type |
duke@435 | 2523 | // address type. If a Phi is found, create a new version with |
twisti@1040 | 2524 | // the appropriate memory slices from each of the Phi inputs. |
duke@435 | 2525 | // For stores, process the users as follows: |
duke@435 | 2526 | // MemNode: push on memnode_worklist |
duke@435 | 2527 | // MergeMem: push on mergemem_worklist |
duke@435 | 2528 | // Phase 3: Process MergeMem nodes from mergemem_worklist. Walk each memory slice |
duke@435 | 2529 | // moving the first node encountered of each instance type to the |
duke@435 | 2530 | // the input corresponding to its alias index. |
duke@435 | 2531 | // appropriate memory slice. |
duke@435 | 2532 | // Phase 4: Update the inputs of non-instance memory Phis and the Memory input of memnodes. |
duke@435 | 2533 | // |
duke@435 | 2534 | // In the following example, the CheckCastPP nodes are the cast of allocation |
duke@435 | 2535 | // results and the allocation of node 29 is unescaped and eligible to be an |
duke@435 | 2536 | // instance type. |
duke@435 | 2537 | // |
duke@435 | 2538 | // We start with: |
duke@435 | 2539 | // |
duke@435 | 2540 | // 7 Parm #memory |
duke@435 | 2541 | // 10 ConI "12" |
duke@435 | 2542 | // 19 CheckCastPP "Foo" |
duke@435 | 2543 | // 20 AddP _ 19 19 10 Foo+12 alias_index=4 |
duke@435 | 2544 | // 29 CheckCastPP "Foo" |
duke@435 | 2545 | // 30 AddP _ 29 29 10 Foo+12 alias_index=4 |
duke@435 | 2546 | // |
duke@435 | 2547 | // 40 StoreP 25 7 20 ... alias_index=4 |
duke@435 | 2548 | // 50 StoreP 35 40 30 ... alias_index=4 |
duke@435 | 2549 | // 60 StoreP 45 50 20 ... alias_index=4 |
duke@435 | 2550 | // 70 LoadP _ 60 30 ... alias_index=4 |
duke@435 | 2551 | // 80 Phi 75 50 60 Memory alias_index=4 |
duke@435 | 2552 | // 90 LoadP _ 80 30 ... alias_index=4 |
duke@435 | 2553 | // 100 LoadP _ 80 20 ... alias_index=4 |
duke@435 | 2554 | // |
duke@435 | 2555 | // |
duke@435 | 2556 | // Phase 1 creates an instance type for node 29 assigning it an instance id of 24 |
duke@435 | 2557 | // and creating a new alias index for node 30. This gives: |
duke@435 | 2558 | // |
duke@435 | 2559 | // 7 Parm #memory |
duke@435 | 2560 | // 10 ConI "12" |
duke@435 | 2561 | // 19 CheckCastPP "Foo" |
duke@435 | 2562 | // 20 AddP _ 19 19 10 Foo+12 alias_index=4 |
duke@435 | 2563 | // 29 CheckCastPP "Foo" iid=24 |
duke@435 | 2564 | // 30 AddP _ 29 29 10 Foo+12 alias_index=6 iid=24 |
duke@435 | 2565 | // |
duke@435 | 2566 | // 40 StoreP 25 7 20 ... alias_index=4 |
duke@435 | 2567 | // 50 StoreP 35 40 30 ... alias_index=6 |
duke@435 | 2568 | // 60 StoreP 45 50 20 ... alias_index=4 |
duke@435 | 2569 | // 70 LoadP _ 60 30 ... alias_index=6 |
duke@435 | 2570 | // 80 Phi 75 50 60 Memory alias_index=4 |
duke@435 | 2571 | // 90 LoadP _ 80 30 ... alias_index=6 |
duke@435 | 2572 | // 100 LoadP _ 80 20 ... alias_index=4 |
duke@435 | 2573 | // |
duke@435 | 2574 | // In phase 2, new memory inputs are computed for the loads and stores, |
duke@435 | 2575 | // And a new version of the phi is created. In phase 4, the inputs to |
duke@435 | 2576 | // node 80 are updated and then the memory nodes are updated with the |
duke@435 | 2577 | // values computed in phase 2. This results in: |
duke@435 | 2578 | // |
duke@435 | 2579 | // 7 Parm #memory |
duke@435 | 2580 | // 10 ConI "12" |
duke@435 | 2581 | // 19 CheckCastPP "Foo" |
duke@435 | 2582 | // 20 AddP _ 19 19 10 Foo+12 alias_index=4 |
duke@435 | 2583 | // 29 CheckCastPP "Foo" iid=24 |
duke@435 | 2584 | // 30 AddP _ 29 29 10 Foo+12 alias_index=6 iid=24 |
duke@435 | 2585 | // |
duke@435 | 2586 | // 40 StoreP 25 7 20 ... alias_index=4 |
duke@435 | 2587 | // 50 StoreP 35 7 30 ... alias_index=6 |
duke@435 | 2588 | // 60 StoreP 45 40 20 ... alias_index=4 |
duke@435 | 2589 | // 70 LoadP _ 50 30 ... alias_index=6 |
duke@435 | 2590 | // 80 Phi 75 40 60 Memory alias_index=4 |
duke@435 | 2591 | // 120 Phi 75 50 50 Memory alias_index=6 |
duke@435 | 2592 | // 90 LoadP _ 120 30 ... alias_index=6 |
duke@435 | 2593 | // 100 LoadP _ 80 20 ... alias_index=4 |
duke@435 | 2594 | // |
duke@435 | 2595 | void ConnectionGraph::split_unique_types(GrowableArray<Node *> &alloc_worklist) { |
duke@435 | 2596 | GrowableArray<Node *> memnode_worklist; |
duke@435 | 2597 | GrowableArray<PhiNode *> orig_phis; |
kvn@2276 | 2598 | PhaseIterGVN *igvn = _igvn; |
duke@435 | 2599 | uint new_index_start = (uint) _compile->num_alias_types(); |
kvn@1536 | 2600 | Arena* arena = Thread::current()->resource_area(); |
kvn@1536 | 2601 | VectorSet visited(arena); |
kvn@3651 | 2602 | ideal_nodes.clear(); // Reset for use with set_map/get_map. |
kvn@3651 | 2603 | uint unique_old = _compile->unique(); |
kvn@500 | 2604 | |
kvn@500 | 2605 | // Phase 1: Process possible allocations from alloc_worklist. |
kvn@500 | 2606 | // Create instance types for the CheckCastPP for allocations where possible. |
kvn@679 | 2607 | // |
kvn@679 | 2608 | // (Note: don't forget to change the order of the second AddP node on |
kvn@679 | 2609 | // the alloc_worklist if the order of the worklist processing is changed, |
kvn@679 | 2610 | // see the comment in find_second_addp().) |
kvn@679 | 2611 | // |
duke@435 | 2612 | while (alloc_worklist.length() != 0) { |
duke@435 | 2613 | Node *n = alloc_worklist.pop(); |
duke@435 | 2614 | uint ni = n->_idx; |
duke@435 | 2615 | if (n->is_Call()) { |
duke@435 | 2616 | CallNode *alloc = n->as_Call(); |
duke@435 | 2617 | // copy escape information to call node |
kvn@679 | 2618 | PointsToNode* ptn = ptnode_adr(alloc->_idx); |
kvn@3651 | 2619 | PointsToNode::EscapeState es = ptn->escape_state(); |
kvn@500 | 2620 | // We have an allocation or call which returns a Java object, |
kvn@500 | 2621 | // see if it is unescaped. |
kvn@3254 | 2622 | if (es != PointsToNode::NoEscape || !ptn->scalar_replaceable()) |
duke@435 | 2623 | continue; |
kvn@1219 | 2624 | // Find CheckCastPP for the allocate or for the return value of a call |
kvn@1219 | 2625 | n = alloc->result_cast(); |
kvn@1219 | 2626 | if (n == NULL) { // No uses except Initialize node |
kvn@1219 | 2627 | if (alloc->is_Allocate()) { |
kvn@1219 | 2628 | // Set the scalar_replaceable flag for allocation |
kvn@1219 | 2629 | // so it could be eliminated if it has no uses. |
kvn@1219 | 2630 | alloc->as_Allocate()->_is_scalar_replaceable = true; |
kvn@1219 | 2631 | } |
kvn@1219 | 2632 | continue; |
kvn@474 | 2633 | } |
kvn@1219 | 2634 | if (!n->is_CheckCastPP()) { // not unique CheckCastPP. |
kvn@1219 | 2635 | assert(!alloc->is_Allocate(), "allocation should have unique type"); |
kvn@500 | 2636 | continue; |
kvn@1219 | 2637 | } |
kvn@1219 | 2638 | |
kvn@500 | 2639 | // The inline code for Object.clone() casts the allocation result to |
kvn@682 | 2640 | // java.lang.Object and then to the actual type of the allocated |
kvn@500 | 2641 | // object. Detect this case and use the second cast. |
kvn@682 | 2642 | // Also detect j.l.reflect.Array.newInstance(jobject, jint) case when |
kvn@682 | 2643 | // the allocation result is cast to java.lang.Object and then |
kvn@682 | 2644 | // to the actual Array type. |
kvn@500 | 2645 | if (alloc->is_Allocate() && n->as_Type()->type() == TypeInstPtr::NOTNULL |
kvn@682 | 2646 | && (alloc->is_AllocateArray() || |
kvn@682 | 2647 | igvn->type(alloc->in(AllocateNode::KlassNode)) != TypeKlassPtr::OBJECT)) { |
kvn@500 | 2648 | Node *cast2 = NULL; |
kvn@500 | 2649 | for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { |
kvn@500 | 2650 | Node *use = n->fast_out(i); |
kvn@500 | 2651 | if (use->is_CheckCastPP()) { |
kvn@500 | 2652 | cast2 = use; |
kvn@500 | 2653 | break; |
kvn@500 | 2654 | } |
kvn@500 | 2655 | } |
kvn@500 | 2656 | if (cast2 != NULL) { |
kvn@500 | 2657 | n = cast2; |
kvn@500 | 2658 | } else { |
kvn@1219 | 2659 | // Non-scalar replaceable if the allocation type is unknown statically |
kvn@1219 | 2660 | // (reflection allocation), the object can't be restored during |
kvn@1219 | 2661 | // deoptimization without precise type. |
kvn@500 | 2662 | continue; |
kvn@500 | 2663 | } |
kvn@500 | 2664 | } |
kvn@1219 | 2665 | if (alloc->is_Allocate()) { |
kvn@1219 | 2666 | // Set the scalar_replaceable flag for allocation |
kvn@1219 | 2667 | // so it could be eliminated. |
kvn@1219 | 2668 | alloc->as_Allocate()->_is_scalar_replaceable = true; |
kvn@1219 | 2669 | } |
kvn@3651 | 2670 | set_escape_state(ptnode_adr(n->_idx), es); // CheckCastPP escape state |
kvn@682 | 2671 | // in order for an object to be scalar-replaceable, it must be: |
kvn@500 | 2672 | // - a direct allocation (not a call returning an object) |
kvn@500 | 2673 | // - non-escaping |
kvn@500 | 2674 | // - eligible to be a unique type |
kvn@500 | 2675 | // - not determined to be ineligible by escape analysis |
kvn@3651 | 2676 | set_map(alloc, n); |
kvn@3651 | 2677 | set_map(n, alloc); |
kvn@500 | 2678 | const TypeOopPtr *t = igvn->type(n)->isa_oopptr(); |
kvn@500 | 2679 | if (t == NULL) |
kvn@3254 | 2680 | continue; // not a TypeOopPtr |
kvn@3651 | 2681 | const TypeOopPtr* tinst = t->cast_to_exactness(true)->is_oopptr()->cast_to_instance_id(ni); |
duke@435 | 2682 | igvn->hash_delete(n); |
duke@435 | 2683 | igvn->set_type(n, tinst); |
duke@435 | 2684 | n->raise_bottom_type(tinst); |
duke@435 | 2685 | igvn->hash_insert(n); |
kvn@500 | 2686 | record_for_optimizer(n); |
kvn@3254 | 2687 | if (alloc->is_Allocate() && (t->isa_instptr() || t->isa_aryptr())) { |
kvn@598 | 2688 | |
kvn@598 | 2689 | // First, put on the worklist all Field edges from Connection Graph |
kvn@598 | 2690 | // which is more accurate then putting immediate users from Ideal Graph. |
kvn@3651 | 2691 | for (EdgeIterator e(ptn); e.has_next(); e.next()) { |
kvn@3651 | 2692 | PointsToNode* tgt = e.get(); |
kvn@3651 | 2693 | Node* use = tgt->ideal_node(); |
kvn@3651 | 2694 | assert(tgt->is_Field() && use->is_AddP(), |
kvn@598 | 2695 | "only AddP nodes are Field edges in CG"); |
kvn@598 | 2696 | if (use->outcnt() > 0) { // Don't process dead nodes |
kvn@598 | 2697 | Node* addp2 = find_second_addp(use, use->in(AddPNode::Base)); |
kvn@598 | 2698 | if (addp2 != NULL) { |
kvn@598 | 2699 | assert(alloc->is_AllocateArray(),"array allocation was expected"); |
kvn@598 | 2700 | alloc_worklist.append_if_missing(addp2); |
kvn@598 | 2701 | } |
kvn@598 | 2702 | alloc_worklist.append_if_missing(use); |
kvn@598 | 2703 | } |
kvn@598 | 2704 | } |
kvn@598 | 2705 | |
kvn@500 | 2706 | // An allocation may have an Initialize which has raw stores. Scan |
kvn@500 | 2707 | // the users of the raw allocation result and push AddP users |
kvn@500 | 2708 | // on alloc_worklist. |
kvn@500 | 2709 | Node *raw_result = alloc->proj_out(TypeFunc::Parms); |
kvn@500 | 2710 | assert (raw_result != NULL, "must have an allocation result"); |
kvn@500 | 2711 | for (DUIterator_Fast imax, i = raw_result->fast_outs(imax); i < imax; i++) { |
kvn@500 | 2712 | Node *use = raw_result->fast_out(i); |
kvn@500 | 2713 | if (use->is_AddP() && use->outcnt() > 0) { // Don't process dead nodes |
kvn@500 | 2714 | Node* addp2 = find_second_addp(use, raw_result); |
kvn@500 | 2715 | if (addp2 != NULL) { |
kvn@500 | 2716 | assert(alloc->is_AllocateArray(),"array allocation was expected"); |
kvn@500 | 2717 | alloc_worklist.append_if_missing(addp2); |
kvn@500 | 2718 | } |
kvn@500 | 2719 | alloc_worklist.append_if_missing(use); |
kvn@1535 | 2720 | } else if (use->is_MemBar()) { |
kvn@500 | 2721 | memnode_worklist.append_if_missing(use); |
kvn@500 | 2722 | } |
kvn@500 | 2723 | } |
kvn@500 | 2724 | } |
duke@435 | 2725 | } else if (n->is_AddP()) { |
kvn@3651 | 2726 | JavaObjectNode* jobj = unique_java_object(get_addp_base(n)); |
kvn@3651 | 2727 | if (jobj == NULL || jobj == phantom_obj) { |
kvn@3651 | 2728 | #ifdef ASSERT |
kvn@3651 | 2729 | ptnode_adr(get_addp_base(n)->_idx)->dump(); |
kvn@3651 | 2730 | ptnode_adr(n->_idx)->dump(); |
kvn@3651 | 2731 | assert(jobj != NULL && jobj != phantom_obj, "escaped allocation"); |
kvn@3651 | 2732 | #endif |
kvn@3651 | 2733 | _compile->record_failure(C2Compiler::retry_no_escape_analysis()); |
kvn@3651 | 2734 | return; |
kvn@1535 | 2735 | } |
kvn@3651 | 2736 | Node *base = get_map(jobj->idx()); // CheckCastPP node |
kvn@3651 | 2737 | if (!split_AddP(n, base)) continue; // wrong type from dead path |
kvn@500 | 2738 | } else if (n->is_Phi() || |
kvn@500 | 2739 | n->is_CheckCastPP() || |
kvn@603 | 2740 | n->is_EncodeP() || |
kvn@603 | 2741 | n->is_DecodeN() || |
kvn@500 | 2742 | (n->is_ConstraintCast() && n->Opcode() == Op_CastPP)) { |
duke@435 | 2743 | if (visited.test_set(n->_idx)) { |
duke@435 | 2744 | assert(n->is_Phi(), "loops only through Phi's"); |
duke@435 | 2745 | continue; // already processed |
duke@435 | 2746 | } |
kvn@3651 | 2747 | JavaObjectNode* jobj = unique_java_object(n); |
kvn@3651 | 2748 | if (jobj == NULL || jobj == phantom_obj) { |
kvn@3651 | 2749 | #ifdef ASSERT |
kvn@3651 | 2750 | ptnode_adr(n->_idx)->dump(); |
kvn@3651 | 2751 | assert(jobj != NULL && jobj != phantom_obj, "escaped allocation"); |
kvn@3651 | 2752 | #endif |
kvn@3651 | 2753 | _compile->record_failure(C2Compiler::retry_no_escape_analysis()); |
kvn@3651 | 2754 | return; |
kvn@3651 | 2755 | } else { |
kvn@3651 | 2756 | Node *val = get_map(jobj->idx()); // CheckCastPP node |
duke@435 | 2757 | TypeNode *tn = n->as_Type(); |
kvn@3651 | 2758 | const TypeOopPtr* tinst = igvn->type(val)->isa_oopptr(); |
kvn@658 | 2759 | assert(tinst != NULL && tinst->is_known_instance() && |
kvn@3651 | 2760 | tinst->instance_id() == jobj->idx() , "instance type expected."); |
kvn@598 | 2761 | |
kvn@598 | 2762 | const Type *tn_type = igvn->type(tn); |
kvn@658 | 2763 | const TypeOopPtr *tn_t; |
kvn@658 | 2764 | if (tn_type->isa_narrowoop()) { |
kvn@658 | 2765 | tn_t = tn_type->make_ptr()->isa_oopptr(); |
kvn@658 | 2766 | } else { |
kvn@658 | 2767 | tn_t = tn_type->isa_oopptr(); |
kvn@658 | 2768 | } |
kvn@1535 | 2769 | if (tn_t != NULL && tinst->klass()->is_subtype_of(tn_t->klass())) { |
kvn@598 | 2770 | if (tn_type->isa_narrowoop()) { |
kvn@598 | 2771 | tn_type = tinst->make_narrowoop(); |
kvn@598 | 2772 | } else { |
kvn@598 | 2773 | tn_type = tinst; |
kvn@598 | 2774 | } |
duke@435 | 2775 | igvn->hash_delete(tn); |
kvn@598 | 2776 | igvn->set_type(tn, tn_type); |
kvn@598 | 2777 | tn->set_type(tn_type); |
duke@435 | 2778 | igvn->hash_insert(tn); |
kvn@500 | 2779 | record_for_optimizer(n); |
kvn@728 | 2780 | } else { |
kvn@1535 | 2781 | assert(tn_type == TypePtr::NULL_PTR || |
kvn@1535 | 2782 | tn_t != NULL && !tinst->klass()->is_subtype_of(tn_t->klass()), |
kvn@1535 | 2783 | "unexpected type"); |
kvn@1535 | 2784 | continue; // Skip dead path with different type |
duke@435 | 2785 | } |
duke@435 | 2786 | } |
duke@435 | 2787 | } else { |
kvn@1535 | 2788 | debug_only(n->dump();) |
kvn@1535 | 2789 | assert(false, "EA: unexpected node"); |
duke@435 | 2790 | continue; |
duke@435 | 2791 | } |
kvn@1535 | 2792 | // push allocation's users on appropriate worklist |
duke@435 | 2793 | for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { |
duke@435 | 2794 | Node *use = n->fast_out(i); |
duke@435 | 2795 | if(use->is_Mem() && use->in(MemNode::Address) == n) { |
kvn@1535 | 2796 | // Load/store to instance's field |
kvn@500 | 2797 | memnode_worklist.append_if_missing(use); |
kvn@1535 | 2798 | } else if (use->is_MemBar()) { |
kvn@500 | 2799 | memnode_worklist.append_if_missing(use); |
kvn@500 | 2800 | } else if (use->is_AddP() && use->outcnt() > 0) { // No dead nodes |
kvn@500 | 2801 | Node* addp2 = find_second_addp(use, n); |
kvn@500 | 2802 | if (addp2 != NULL) { |
kvn@500 | 2803 | alloc_worklist.append_if_missing(addp2); |
kvn@500 | 2804 | } |
kvn@500 | 2805 | alloc_worklist.append_if_missing(use); |
kvn@500 | 2806 | } else if (use->is_Phi() || |
kvn@500 | 2807 | use->is_CheckCastPP() || |
kvn@603 | 2808 | use->is_EncodeP() || |
kvn@603 | 2809 | use->is_DecodeN() || |
kvn@500 | 2810 | (use->is_ConstraintCast() && use->Opcode() == Op_CastPP)) { |
kvn@500 | 2811 | alloc_worklist.append_if_missing(use); |
kvn@1535 | 2812 | #ifdef ASSERT |
kvn@1535 | 2813 | } else if (use->is_Mem()) { |
kvn@1535 | 2814 | assert(use->in(MemNode::Address) != n, "EA: missing allocation reference path"); |
kvn@1535 | 2815 | } else if (use->is_MergeMem()) { |
kvn@1535 | 2816 | assert(_mergemem_worklist.contains(use->as_MergeMem()), "EA: missing MergeMem node in the worklist"); |
kvn@1535 | 2817 | } else if (use->is_SafePoint()) { |
kvn@1535 | 2818 | // Look for MergeMem nodes for calls which reference unique allocation |
kvn@1535 | 2819 | // (through CheckCastPP nodes) even for debug info. |
kvn@1535 | 2820 | Node* m = use->in(TypeFunc::Memory); |
kvn@1535 | 2821 | if (m->is_MergeMem()) { |
kvn@1535 | 2822 | assert(_mergemem_worklist.contains(m->as_MergeMem()), "EA: missing MergeMem node in the worklist"); |
kvn@1535 | 2823 | } |
kvn@1535 | 2824 | } else { |
kvn@1535 | 2825 | uint op = use->Opcode(); |
kvn@1535 | 2826 | if (!(op == Op_CmpP || op == Op_Conv2B || |
kvn@1535 | 2827 | op == Op_CastP2X || op == Op_StoreCM || |
kvn@1535 | 2828 | op == Op_FastLock || op == Op_AryEq || op == Op_StrComp || |
kvn@1535 | 2829 | op == Op_StrEquals || op == Op_StrIndexOf)) { |
kvn@1535 | 2830 | n->dump(); |
kvn@1535 | 2831 | use->dump(); |
kvn@1535 | 2832 | assert(false, "EA: missing allocation reference path"); |
kvn@1535 | 2833 | } |
kvn@1535 | 2834 | #endif |
duke@435 | 2835 | } |
duke@435 | 2836 | } |
duke@435 | 2837 | |
duke@435 | 2838 | } |
kvn@500 | 2839 | // New alias types were created in split_AddP(). |
duke@435 | 2840 | uint new_index_end = (uint) _compile->num_alias_types(); |
kvn@3651 | 2841 | assert(unique_old == _compile->unique(), "there should be no new ideal nodes after Phase 1"); |
duke@435 | 2842 | |
duke@435 | 2843 | // Phase 2: Process MemNode's from memnode_worklist. compute new address type and |
duke@435 | 2844 | // compute new values for Memory inputs (the Memory inputs are not |
duke@435 | 2845 | // actually updated until phase 4.) |
duke@435 | 2846 | if (memnode_worklist.length() == 0) |
duke@435 | 2847 | return; // nothing to do |
duke@435 | 2848 | while (memnode_worklist.length() != 0) { |
duke@435 | 2849 | Node *n = memnode_worklist.pop(); |
kvn@500 | 2850 | if (visited.test_set(n->_idx)) |
kvn@500 | 2851 | continue; |
kvn@1535 | 2852 | if (n->is_Phi() || n->is_ClearArray()) { |
kvn@1535 | 2853 | // we don't need to do anything, but the users must be pushed |
kvn@1535 | 2854 | } else if (n->is_MemBar()) { // Initialize, MemBar nodes |
kvn@1535 | 2855 | // we don't need to do anything, but the users must be pushed |
kvn@1535 | 2856 | n = n->as_MemBar()->proj_out(TypeFunc::Memory); |
kvn@500 | 2857 | if (n == NULL) |
duke@435 | 2858 | continue; |
duke@435 | 2859 | } else { |
duke@435 | 2860 | assert(n->is_Mem(), "memory node required."); |
duke@435 | 2861 | Node *addr = n->in(MemNode::Address); |
duke@435 | 2862 | const Type *addr_t = igvn->type(addr); |
duke@435 | 2863 | if (addr_t == Type::TOP) |
duke@435 | 2864 | continue; |
duke@435 | 2865 | assert (addr_t->isa_ptr() != NULL, "pointer type required."); |
duke@435 | 2866 | int alias_idx = _compile->get_alias_index(addr_t->is_ptr()); |
kvn@500 | 2867 | assert ((uint)alias_idx < new_index_end, "wrong alias index"); |
kvn@3651 | 2868 | Node *mem = find_inst_mem(n->in(MemNode::Memory), alias_idx, orig_phis); |
kvn@473 | 2869 | if (_compile->failing()) { |
kvn@473 | 2870 | return; |
kvn@473 | 2871 | } |
kvn@500 | 2872 | if (mem != n->in(MemNode::Memory)) { |
kvn@1536 | 2873 | // We delay the memory edge update since we need old one in |
kvn@1536 | 2874 | // MergeMem code below when instances memory slices are separated. |
kvn@3651 | 2875 | set_map(n, mem); |
kvn@500 | 2876 | } |
duke@435 | 2877 | if (n->is_Load()) { |
duke@435 | 2878 | continue; // don't push users |
duke@435 | 2879 | } else if (n->is_LoadStore()) { |
duke@435 | 2880 | // get the memory projection |
duke@435 | 2881 | for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { |
duke@435 | 2882 | Node *use = n->fast_out(i); |
duke@435 | 2883 | if (use->Opcode() == Op_SCMemProj) { |
duke@435 | 2884 | n = use; |
duke@435 | 2885 | break; |
duke@435 | 2886 | } |
duke@435 | 2887 | } |
duke@435 | 2888 | assert(n->Opcode() == Op_SCMemProj, "memory projection required"); |
duke@435 | 2889 | } |
duke@435 | 2890 | } |
duke@435 | 2891 | // push user on appropriate worklist |
duke@435 | 2892 | for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { |
duke@435 | 2893 | Node *use = n->fast_out(i); |
kvn@1535 | 2894 | if (use->is_Phi() || use->is_ClearArray()) { |
kvn@500 | 2895 | memnode_worklist.append_if_missing(use); |
duke@435 | 2896 | } else if(use->is_Mem() && use->in(MemNode::Memory) == n) { |
kvn@1535 | 2897 | if (use->Opcode() == Op_StoreCM) // Ignore cardmark stores |
kvn@1535 | 2898 | continue; |
kvn@500 | 2899 | memnode_worklist.append_if_missing(use); |
kvn@1535 | 2900 | } else if (use->is_MemBar()) { |
kvn@500 | 2901 | memnode_worklist.append_if_missing(use); |
kvn@1535 | 2902 | #ifdef ASSERT |
kvn@1535 | 2903 | } else if(use->is_Mem()) { |
kvn@1535 | 2904 | assert(use->in(MemNode::Memory) != n, "EA: missing memory path"); |
duke@435 | 2905 | } else if (use->is_MergeMem()) { |
kvn@1535 | 2906 | assert(_mergemem_worklist.contains(use->as_MergeMem()), "EA: missing MergeMem node in the worklist"); |
kvn@1535 | 2907 | } else { |
kvn@1535 | 2908 | uint op = use->Opcode(); |
kvn@1535 | 2909 | if (!(op == Op_StoreCM || |
kvn@1535 | 2910 | (op == Op_CallLeaf && use->as_CallLeaf()->_name != NULL && |
kvn@1535 | 2911 | strcmp(use->as_CallLeaf()->_name, "g1_wb_pre") == 0) || |
kvn@1535 | 2912 | op == Op_AryEq || op == Op_StrComp || |
kvn@1535 | 2913 | op == Op_StrEquals || op == Op_StrIndexOf)) { |
kvn@1535 | 2914 | n->dump(); |
kvn@1535 | 2915 | use->dump(); |
kvn@1535 | 2916 | assert(false, "EA: missing memory path"); |
kvn@1535 | 2917 | } |
kvn@1535 | 2918 | #endif |
duke@435 | 2919 | } |
duke@435 | 2920 | } |
duke@435 | 2921 | } |
duke@435 | 2922 | |
kvn@500 | 2923 | // Phase 3: Process MergeMem nodes from mergemem_worklist. |
kvn@1535 | 2924 | // Walk each memory slice moving the first node encountered of each |
kvn@500 | 2925 | // instance type to the the input corresponding to its alias index. |
kvn@1535 | 2926 | uint length = _mergemem_worklist.length(); |
kvn@1535 | 2927 | for( uint next = 0; next < length; ++next ) { |
kvn@1535 | 2928 | MergeMemNode* nmm = _mergemem_worklist.at(next); |
kvn@1535 | 2929 | assert(!visited.test_set(nmm->_idx), "should not be visited before"); |
duke@435 | 2930 | // Note: we don't want to use MergeMemStream here because we only want to |
kvn@1535 | 2931 | // scan inputs which exist at the start, not ones we add during processing. |
kvn@1535 | 2932 | // Note 2: MergeMem may already contains instance memory slices added |
kvn@1535 | 2933 | // during find_inst_mem() call when memory nodes were processed above. |
kvn@1535 | 2934 | igvn->hash_delete(nmm); |
duke@435 | 2935 | uint nslices = nmm->req(); |
duke@435 | 2936 | for (uint i = Compile::AliasIdxRaw+1; i < nslices; i++) { |
kvn@500 | 2937 | Node* mem = nmm->in(i); |
kvn@500 | 2938 | Node* cur = NULL; |
duke@435 | 2939 | if (mem == NULL || mem->is_top()) |
duke@435 | 2940 | continue; |
kvn@1536 | 2941 | // First, update mergemem by moving memory nodes to corresponding slices |
kvn@1536 | 2942 | // if their type became more precise since this mergemem was created. |
duke@435 | 2943 | while (mem->is_Mem()) { |
duke@435 | 2944 | const Type *at = igvn->type(mem->in(MemNode::Address)); |
duke@435 | 2945 | if (at != Type::TOP) { |
duke@435 | 2946 | assert (at->isa_ptr() != NULL, "pointer type required."); |
duke@435 | 2947 | uint idx = (uint)_compile->get_alias_index(at->is_ptr()); |
duke@435 | 2948 | if (idx == i) { |
duke@435 | 2949 | if (cur == NULL) |
duke@435 | 2950 | cur = mem; |
duke@435 | 2951 | } else { |
duke@435 | 2952 | if (idx >= nmm->req() || nmm->is_empty_memory(nmm->in(idx))) { |
duke@435 | 2953 | nmm->set_memory_at(idx, mem); |
duke@435 | 2954 | } |
duke@435 | 2955 | } |
duke@435 | 2956 | } |
duke@435 | 2957 | mem = mem->in(MemNode::Memory); |
duke@435 | 2958 | } |
duke@435 | 2959 | nmm->set_memory_at(i, (cur != NULL) ? cur : mem); |
kvn@500 | 2960 | // Find any instance of the current type if we haven't encountered |
kvn@1536 | 2961 | // already a memory slice of the instance along the memory chain. |
kvn@500 | 2962 | for (uint ni = new_index_start; ni < new_index_end; ni++) { |
kvn@500 | 2963 | if((uint)_compile->get_general_index(ni) == i) { |
kvn@500 | 2964 | Node *m = (ni >= nmm->req()) ? nmm->empty_memory() : nmm->in(ni); |
kvn@500 | 2965 | if (nmm->is_empty_memory(m)) { |
kvn@3651 | 2966 | Node* result = find_inst_mem(mem, ni, orig_phis); |
kvn@500 | 2967 | if (_compile->failing()) { |
kvn@500 | 2968 | return; |
kvn@500 | 2969 | } |
kvn@500 | 2970 | nmm->set_memory_at(ni, result); |
kvn@500 | 2971 | } |
kvn@500 | 2972 | } |
kvn@500 | 2973 | } |
kvn@500 | 2974 | } |
kvn@500 | 2975 | // Find the rest of instances values |
kvn@500 | 2976 | for (uint ni = new_index_start; ni < new_index_end; ni++) { |
kvn@1536 | 2977 | const TypeOopPtr *tinst = _compile->get_adr_type(ni)->isa_oopptr(); |
kvn@500 | 2978 | Node* result = step_through_mergemem(nmm, ni, tinst); |
kvn@500 | 2979 | if (result == nmm->base_memory()) { |
kvn@500 | 2980 | // Didn't find instance memory, search through general slice recursively. |
kvn@1536 | 2981 | result = nmm->memory_at(_compile->get_general_index(ni)); |
kvn@3651 | 2982 | result = find_inst_mem(result, ni, orig_phis); |
kvn@500 | 2983 | if (_compile->failing()) { |
kvn@500 | 2984 | return; |
kvn@500 | 2985 | } |
kvn@500 | 2986 | nmm->set_memory_at(ni, result); |
kvn@500 | 2987 | } |
kvn@500 | 2988 | } |
kvn@500 | 2989 | igvn->hash_insert(nmm); |
kvn@500 | 2990 | record_for_optimizer(nmm); |
duke@435 | 2991 | } |
duke@435 | 2992 | |
kvn@500 | 2993 | // Phase 4: Update the inputs of non-instance memory Phis and |
kvn@500 | 2994 | // the Memory input of memnodes |
duke@435 | 2995 | // First update the inputs of any non-instance Phi's from |
duke@435 | 2996 | // which we split out an instance Phi. Note we don't have |
duke@435 | 2997 | // to recursively process Phi's encounted on the input memory |
duke@435 | 2998 | // chains as is done in split_memory_phi() since they will |
duke@435 | 2999 | // also be processed here. |
kvn@682 | 3000 | for (int j = 0; j < orig_phis.length(); j++) { |
kvn@682 | 3001 | PhiNode *phi = orig_phis.at(j); |
duke@435 | 3002 | int alias_idx = _compile->get_alias_index(phi->adr_type()); |
duke@435 | 3003 | igvn->hash_delete(phi); |
duke@435 | 3004 | for (uint i = 1; i < phi->req(); i++) { |
duke@435 | 3005 | Node *mem = phi->in(i); |
kvn@3651 | 3006 | Node *new_mem = find_inst_mem(mem, alias_idx, orig_phis); |
kvn@500 | 3007 | if (_compile->failing()) { |
kvn@500 | 3008 | return; |
kvn@500 | 3009 | } |
duke@435 | 3010 | if (mem != new_mem) { |
duke@435 | 3011 | phi->set_req(i, new_mem); |
duke@435 | 3012 | } |
duke@435 | 3013 | } |
duke@435 | 3014 | igvn->hash_insert(phi); |
duke@435 | 3015 | record_for_optimizer(phi); |
duke@435 | 3016 | } |
duke@435 | 3017 | |
duke@435 | 3018 | // Update the memory inputs of MemNodes with the value we computed |
kvn@1536 | 3019 | // in Phase 2 and move stores memory users to corresponding memory slices. |
kvn@2810 | 3020 | // Disable memory split verification code until the fix for 6984348. |
kvn@2810 | 3021 | // Currently it produces false negative results since it does not cover all cases. |
kvn@2810 | 3022 | #if 0 // ifdef ASSERT |
kvn@2556 | 3023 | visited.Reset(); |
kvn@1536 | 3024 | Node_Stack old_mems(arena, _compile->unique() >> 2); |
kvn@1536 | 3025 | #endif |
kvn@3651 | 3026 | for (uint i = 0; i < ideal_nodes.size(); i++) { |
kvn@3651 | 3027 | Node* n = ideal_nodes.at(i); |
kvn@3651 | 3028 | Node* nmem = get_map(n->_idx); |
kvn@3651 | 3029 | assert(nmem != NULL, "sanity"); |
kvn@3651 | 3030 | if (n->is_Mem()) { |
kvn@2810 | 3031 | #if 0 // ifdef ASSERT |
kvn@3651 | 3032 | Node* old_mem = n->in(MemNode::Memory); |
kvn@3651 | 3033 | if (!visited.test_set(old_mem->_idx)) { |
kvn@3651 | 3034 | old_mems.push(old_mem, old_mem->outcnt()); |
kvn@3651 | 3035 | } |
kvn@1536 | 3036 | #endif |
kvn@3651 | 3037 | assert(n->in(MemNode::Memory) != nmem, "sanity"); |
kvn@3651 | 3038 | if (!n->is_Load()) { |
kvn@3651 | 3039 | // Move memory users of a store first. |
kvn@3651 | 3040 | move_inst_mem(n, orig_phis); |
duke@435 | 3041 | } |
kvn@3651 | 3042 | // Now update memory input |
kvn@3651 | 3043 | igvn->hash_delete(n); |
kvn@3651 | 3044 | n->set_req(MemNode::Memory, nmem); |
kvn@3651 | 3045 | igvn->hash_insert(n); |
kvn@3651 | 3046 | record_for_optimizer(n); |
kvn@3651 | 3047 | } else { |
kvn@3651 | 3048 | assert(n->is_Allocate() || n->is_CheckCastPP() || |
kvn@3651 | 3049 | n->is_AddP() || n->is_Phi(), "unknown node used for set_map()"); |
duke@435 | 3050 | } |
duke@435 | 3051 | } |
kvn@2810 | 3052 | #if 0 // ifdef ASSERT |
kvn@1536 | 3053 | // Verify that memory was split correctly |
kvn@1536 | 3054 | while (old_mems.is_nonempty()) { |
kvn@1536 | 3055 | Node* old_mem = old_mems.node(); |
kvn@1536 | 3056 | uint old_cnt = old_mems.index(); |
kvn@1536 | 3057 | old_mems.pop(); |
kvn@2810 | 3058 | assert(old_cnt == old_mem->outcnt(), "old mem could be lost"); |
kvn@1536 | 3059 | } |
kvn@1536 | 3060 | #endif |
duke@435 | 3061 | } |
duke@435 | 3062 | |
kvn@3651 | 3063 | #ifndef PRODUCT |
kvn@3651 | 3064 | static const char *node_type_names[] = { |
kvn@3651 | 3065 | "UnknownType", |
kvn@3651 | 3066 | "JavaObject", |
kvn@3651 | 3067 | "LocalVar", |
kvn@3651 | 3068 | "Field", |
kvn@3651 | 3069 | "Arraycopy" |
kvn@3651 | 3070 | }; |
kvn@3651 | 3071 | |
kvn@3651 | 3072 | static const char *esc_names[] = { |
kvn@3651 | 3073 | "UnknownEscape", |
kvn@3651 | 3074 | "NoEscape", |
kvn@3651 | 3075 | "ArgEscape", |
kvn@3651 | 3076 | "GlobalEscape" |
kvn@3651 | 3077 | }; |
kvn@3651 | 3078 | |
kvn@3651 | 3079 | void PointsToNode::dump(bool print_state) const { |
kvn@3651 | 3080 | NodeType nt = node_type(); |
kvn@3651 | 3081 | tty->print("%s ", node_type_names[(int) nt]); |
kvn@3651 | 3082 | if (print_state) { |
kvn@3651 | 3083 | EscapeState es = escape_state(); |
kvn@3651 | 3084 | EscapeState fields_es = fields_escape_state(); |
kvn@3651 | 3085 | tty->print("%s(%s) ", esc_names[(int)es], esc_names[(int)fields_es]); |
kvn@3651 | 3086 | if (nt == PointsToNode::JavaObject && !this->scalar_replaceable()) |
kvn@3651 | 3087 | tty->print("NSR"); |
kvn@3651 | 3088 | } |
kvn@3651 | 3089 | if (is_Field()) { |
kvn@3651 | 3090 | FieldNode* f = (FieldNode*)this; |
kvn@3651 | 3091 | tty->print("("); |
kvn@3651 | 3092 | for (BaseIterator i(f); i.has_next(); i.next()) { |
kvn@3651 | 3093 | PointsToNode* b = i.get(); |
kvn@3651 | 3094 | tty->print(" %d%s", b->idx(),(b->is_JavaObject() ? "P" : "")); |
kvn@679 | 3095 | } |
kvn@3651 | 3096 | tty->print(" )"); |
kvn@679 | 3097 | } |
kvn@3651 | 3098 | tty->print("["); |
kvn@3651 | 3099 | for (EdgeIterator i(this); i.has_next(); i.next()) { |
kvn@3651 | 3100 | PointsToNode* e = i.get(); |
kvn@3651 | 3101 | tty->print(" %d%s%s", e->idx(),(e->is_JavaObject() ? "P" : (e->is_Field() ? "F" : "")), e->is_Arraycopy() ? "cp" : ""); |
kvn@3651 | 3102 | } |
kvn@3651 | 3103 | tty->print(" ["); |
kvn@3651 | 3104 | for (UseIterator i(this); i.has_next(); i.next()) { |
kvn@3651 | 3105 | PointsToNode* u = i.get(); |
kvn@3651 | 3106 | bool is_base = false; |
kvn@3651 | 3107 | if (PointsToNode::is_base_use(u)) { |
kvn@3651 | 3108 | is_base = true; |
kvn@3651 | 3109 | u = PointsToNode::get_use_node(u)->as_Field(); |
kvn@3651 | 3110 | } |
kvn@3651 | 3111 | tty->print(" %d%s%s", u->idx(), is_base ? "b" : "", u->is_Arraycopy() ? "cp" : ""); |
kvn@3651 | 3112 | } |
kvn@3651 | 3113 | tty->print(" ]] "); |
kvn@3651 | 3114 | if (_node == NULL) |
kvn@3651 | 3115 | tty->print_cr("<null>"); |
kvn@3651 | 3116 | else |
kvn@3651 | 3117 | _node->dump(); |
kvn@679 | 3118 | } |
kvn@679 | 3119 | |
kvn@3651 | 3120 | void ConnectionGraph::dump(GrowableArray<PointsToNode*>& ptnodes_worklist) { |
duke@435 | 3121 | bool first = true; |
kvn@3651 | 3122 | int ptnodes_length = ptnodes_worklist.length(); |
kvn@3651 | 3123 | for (int i = 0; i < ptnodes_length; i++) { |
kvn@3651 | 3124 | PointsToNode *ptn = ptnodes_worklist.at(i); |
kvn@3651 | 3125 | if (ptn == NULL || !ptn->is_JavaObject()) |
duke@435 | 3126 | continue; |
kvn@3651 | 3127 | PointsToNode::EscapeState es = ptn->escape_state(); |
kvn@3651 | 3128 | if (ptn->ideal_node()->is_Allocate() && (es == PointsToNode::NoEscape || Verbose)) { |
kvn@500 | 3129 | if (first) { |
kvn@500 | 3130 | tty->cr(); |
kvn@500 | 3131 | tty->print("======== Connection graph for "); |
kvn@679 | 3132 | _compile->method()->print_short_name(); |
kvn@500 | 3133 | tty->cr(); |
kvn@500 | 3134 | first = false; |
kvn@500 | 3135 | } |
kvn@500 | 3136 | ptn->dump(); |
kvn@3651 | 3137 | // Print all locals and fields which reference this allocation |
kvn@3651 | 3138 | for (UseIterator j(ptn); j.has_next(); j.next()) { |
kvn@3651 | 3139 | PointsToNode* use = j.get(); |
kvn@3651 | 3140 | if (use->is_LocalVar()) { |
kvn@3651 | 3141 | use->dump(Verbose); |
kvn@3651 | 3142 | } else if (Verbose) { |
kvn@3651 | 3143 | use->dump(); |
kvn@500 | 3144 | } |
kvn@500 | 3145 | } |
kvn@500 | 3146 | tty->cr(); |
duke@435 | 3147 | } |
duke@435 | 3148 | } |
duke@435 | 3149 | } |
duke@435 | 3150 | #endif |