Mercurial > hg > truffle
annotate src/share/vm/opto/cfgnode.cpp @ 163:885ed790ecf0
6695810: null oop passed to encode_heap_oop_not_null
Summary: fix several problems in C2 related to Escape Analysis and Compressed Oops.
Reviewed-by: never, jrose
| author | kvn |
|---|---|
| date | Wed, 21 May 2008 10:45:07 -0700 |
| parents | e0bd2e08e3d0 |
| children | 65fe2bd88839 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 2 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. | |
| 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | |
| 4 * | |
| 5 * This code is free software; you can redistribute it and/or modify it | |
| 6 * under the terms of the GNU General Public License version 2 only, as | |
| 7 * published by the Free Software Foundation. | |
| 8 * | |
| 9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
| 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 12 * version 2 for more details (a copy is included in the LICENSE file that | |
| 13 * accompanied this code). | |
| 14 * | |
| 15 * You should have received a copy of the GNU General Public License version | |
| 16 * 2 along with this work; if not, write to the Free Software Foundation, | |
| 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
| 18 * | |
| 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
| 20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
| 21 * have any questions. | |
| 22 * | |
| 23 */ | |
| 24 | |
| 25 // Portions of code courtesy of Clifford Click | |
| 26 | |
| 27 // Optimization - Graph Style | |
| 28 | |
| 29 #include "incls/_precompiled.incl" | |
| 30 #include "incls/_cfgnode.cpp.incl" | |
| 31 | |
| 32 //============================================================================= | |
| 33 //------------------------------Value------------------------------------------ | |
| 34 // Compute the type of the RegionNode. | |
| 35 const Type *RegionNode::Value( PhaseTransform *phase ) const { | |
| 36 for( uint i=1; i<req(); ++i ) { // For all paths in | |
| 37 Node *n = in(i); // Get Control source | |
| 38 if( !n ) continue; // Missing inputs are TOP | |
| 39 if( phase->type(n) == Type::CONTROL ) | |
| 40 return Type::CONTROL; | |
| 41 } | |
| 42 return Type::TOP; // All paths dead? Then so are we | |
| 43 } | |
| 44 | |
| 45 //------------------------------Identity--------------------------------------- | |
| 46 // Check for Region being Identity. | |
| 47 Node *RegionNode::Identity( PhaseTransform *phase ) { | |
| 48 // Cannot have Region be an identity, even if it has only 1 input. | |
| 49 // Phi users cannot have their Region input folded away for them, | |
| 50 // since they need to select the proper data input | |
| 51 return this; | |
| 52 } | |
| 53 | |
| 54 //------------------------------merge_region----------------------------------- | |
| 55 // If a Region flows into a Region, merge into one big happy merge. This is | |
| 56 // hard to do if there is stuff that has to happen | |
| 57 static Node *merge_region(RegionNode *region, PhaseGVN *phase) { | |
| 58 if( region->Opcode() != Op_Region ) // Do not do to LoopNodes | |
| 59 return NULL; | |
| 60 Node *progress = NULL; // Progress flag | |
| 61 PhaseIterGVN *igvn = phase->is_IterGVN(); | |
| 62 | |
| 63 uint rreq = region->req(); | |
| 64 for( uint i = 1; i < rreq; i++ ) { | |
| 65 Node *r = region->in(i); | |
| 66 if( r && r->Opcode() == Op_Region && // Found a region? | |
| 67 r->in(0) == r && // Not already collapsed? | |
| 68 r != region && // Avoid stupid situations | |
| 69 r->outcnt() == 2 ) { // Self user and 'region' user only? | |
| 70 assert(!r->as_Region()->has_phi(), "no phi users"); | |
| 71 if( !progress ) { // No progress | |
| 72 if (region->has_phi()) { | |
| 73 return NULL; // Only flatten if no Phi users | |
| 74 // igvn->hash_delete( phi ); | |
| 75 } | |
| 76 igvn->hash_delete( region ); | |
| 77 progress = region; // Making progress | |
| 78 } | |
| 79 igvn->hash_delete( r ); | |
| 80 | |
| 81 // Append inputs to 'r' onto 'region' | |
| 82 for( uint j = 1; j < r->req(); j++ ) { | |
| 83 // Move an input from 'r' to 'region' | |
| 84 region->add_req(r->in(j)); | |
| 85 r->set_req(j, phase->C->top()); | |
| 86 // Update phis of 'region' | |
| 87 //for( uint k = 0; k < max; k++ ) { | |
| 88 // Node *phi = region->out(k); | |
| 89 // if( phi->is_Phi() ) { | |
| 90 // phi->add_req(phi->in(i)); | |
| 91 // } | |
| 92 //} | |
| 93 | |
| 94 rreq++; // One more input to Region | |
| 95 } // Found a region to merge into Region | |
| 96 // Clobber pointer to the now dead 'r' | |
| 97 region->set_req(i, phase->C->top()); | |
| 98 } | |
| 99 } | |
| 100 | |
| 101 return progress; | |
| 102 } | |
| 103 | |
| 104 | |
| 105 | |
| 106 //--------------------------------has_phi-------------------------------------- | |
| 107 // Helper function: Return any PhiNode that uses this region or NULL | |
| 108 PhiNode* RegionNode::has_phi() const { | |
| 109 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) { | |
| 110 Node* phi = fast_out(i); | |
| 111 if (phi->is_Phi()) { // Check for Phi users | |
| 112 assert(phi->in(0) == (Node*)this, "phi uses region only via in(0)"); | |
| 113 return phi->as_Phi(); // this one is good enough | |
| 114 } | |
| 115 } | |
| 116 | |
| 117 return NULL; | |
| 118 } | |
| 119 | |
| 120 | |
| 121 //-----------------------------has_unique_phi---------------------------------- | |
| 122 // Helper function: Return the only PhiNode that uses this region or NULL | |
| 123 PhiNode* RegionNode::has_unique_phi() const { | |
| 124 // Check that only one use is a Phi | |
| 125 PhiNode* only_phi = NULL; | |
| 126 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) { | |
| 127 Node* phi = fast_out(i); | |
| 128 if (phi->is_Phi()) { // Check for Phi users | |
| 129 assert(phi->in(0) == (Node*)this, "phi uses region only via in(0)"); | |
| 130 if (only_phi == NULL) { | |
| 131 only_phi = phi->as_Phi(); | |
| 132 } else { | |
| 133 return NULL; // multiple phis | |
| 134 } | |
| 135 } | |
| 136 } | |
| 137 | |
| 138 return only_phi; | |
| 139 } | |
| 140 | |
| 141 | |
| 142 //------------------------------check_phi_clipping----------------------------- | |
| 143 // Helper function for RegionNode's identification of FP clipping | |
| 144 // Check inputs to the Phi | |
| 145 static bool check_phi_clipping( PhiNode *phi, ConNode * &min, uint &min_idx, ConNode * &max, uint &max_idx, Node * &val, uint &val_idx ) { | |
| 146 min = NULL; | |
| 147 max = NULL; | |
| 148 val = NULL; | |
| 149 min_idx = 0; | |
| 150 max_idx = 0; | |
| 151 val_idx = 0; | |
| 152 uint phi_max = phi->req(); | |
| 153 if( phi_max == 4 ) { | |
| 154 for( uint j = 1; j < phi_max; ++j ) { | |
| 155 Node *n = phi->in(j); | |
| 156 int opcode = n->Opcode(); | |
| 157 switch( opcode ) { | |
| 158 case Op_ConI: | |
| 159 { | |
| 160 if( min == NULL ) { | |
| 161 min = n->Opcode() == Op_ConI ? (ConNode*)n : NULL; | |
| 162 min_idx = j; | |
| 163 } else { | |
| 164 max = n->Opcode() == Op_ConI ? (ConNode*)n : NULL; | |
| 165 max_idx = j; | |
| 166 if( min->get_int() > max->get_int() ) { | |
| 167 // Swap min and max | |
| 168 ConNode *temp; | |
| 169 uint temp_idx; | |
| 170 temp = min; min = max; max = temp; | |
| 171 temp_idx = min_idx; min_idx = max_idx; max_idx = temp_idx; | |
| 172 } | |
| 173 } | |
| 174 } | |
| 175 break; | |
| 176 default: | |
| 177 { | |
| 178 val = n; | |
| 179 val_idx = j; | |
| 180 } | |
| 181 break; | |
| 182 } | |
| 183 } | |
| 184 } | |
| 185 return ( min && max && val && (min->get_int() <= 0) && (max->get_int() >=0) ); | |
| 186 } | |
| 187 | |
| 188 | |
| 189 //------------------------------check_if_clipping------------------------------ | |
| 190 // Helper function for RegionNode's identification of FP clipping | |
| 191 // Check that inputs to Region come from two IfNodes, | |
| 192 // | |
| 193 // If | |
| 194 // False True | |
| 195 // If | | |
| 196 // False True | | |
| 197 // | | | | |
| 198 // RegionNode_inputs | |
| 199 // | |
| 200 static bool check_if_clipping( const RegionNode *region, IfNode * &bot_if, IfNode * &top_if ) { | |
| 201 top_if = NULL; | |
| 202 bot_if = NULL; | |
| 203 | |
| 204 // Check control structure above RegionNode for (if ( if ) ) | |
| 205 Node *in1 = region->in(1); | |
| 206 Node *in2 = region->in(2); | |
| 207 Node *in3 = region->in(3); | |
| 208 // Check that all inputs are projections | |
| 209 if( in1->is_Proj() && in2->is_Proj() && in3->is_Proj() ) { | |
| 210 Node *in10 = in1->in(0); | |
| 211 Node *in20 = in2->in(0); | |
| 212 Node *in30 = in3->in(0); | |
| 213 // Check that #1 and #2 are ifTrue and ifFalse from same If | |
| 214 if( in10 != NULL && in10->is_If() && | |
| 215 in20 != NULL && in20->is_If() && | |
| 216 in30 != NULL && in30->is_If() && in10 == in20 && | |
| 217 (in1->Opcode() != in2->Opcode()) ) { | |
| 218 Node *in100 = in10->in(0); | |
| 219 Node *in1000 = (in100 != NULL && in100->is_Proj()) ? in100->in(0) : NULL; | |
| 220 // Check that control for in10 comes from other branch of IF from in3 | |
| 221 if( in1000 != NULL && in1000->is_If() && | |
| 222 in30 == in1000 && (in3->Opcode() != in100->Opcode()) ) { | |
| 223 // Control pattern checks | |
| 224 top_if = (IfNode*)in1000; | |
| 225 bot_if = (IfNode*)in10; | |
| 226 } | |
| 227 } | |
| 228 } | |
| 229 | |
| 230 return (top_if != NULL); | |
| 231 } | |
| 232 | |
| 233 | |
| 234 //------------------------------check_convf2i_clipping------------------------- | |
| 235 // Helper function for RegionNode's identification of FP clipping | |
| 236 // Verify that the value input to the phi comes from "ConvF2I; LShift; RShift" | |
| 237 static bool check_convf2i_clipping( PhiNode *phi, uint idx, ConvF2INode * &convf2i, Node *min, Node *max) { | |
| 238 convf2i = NULL; | |
| 239 | |
| 240 // Check for the RShiftNode | |
| 241 Node *rshift = phi->in(idx); | |
| 242 assert( rshift, "Previous checks ensure phi input is present"); | |
| 243 if( rshift->Opcode() != Op_RShiftI ) { return false; } | |
| 244 | |
| 245 // Check for the LShiftNode | |
| 246 Node *lshift = rshift->in(1); | |
| 247 assert( lshift, "Previous checks ensure phi input is present"); | |
| 248 if( lshift->Opcode() != Op_LShiftI ) { return false; } | |
| 249 | |
| 250 // Check for the ConvF2INode | |
| 251 Node *conv = lshift->in(1); | |
| 252 if( conv->Opcode() != Op_ConvF2I ) { return false; } | |
| 253 | |
| 254 // Check that shift amounts are only to get sign bits set after F2I | |
| 255 jint max_cutoff = max->get_int(); | |
| 256 jint min_cutoff = min->get_int(); | |
| 257 jint left_shift = lshift->in(2)->get_int(); | |
| 258 jint right_shift = rshift->in(2)->get_int(); | |
| 259 jint max_post_shift = nth_bit(BitsPerJavaInteger - left_shift - 1); | |
| 260 if( left_shift != right_shift || | |
| 261 0 > left_shift || left_shift >= BitsPerJavaInteger || | |
| 262 max_post_shift < max_cutoff || | |
| 263 max_post_shift < -min_cutoff ) { | |
| 264 // Shifts are necessary but current transformation eliminates them | |
| 265 return false; | |
| 266 } | |
| 267 | |
| 268 // OK to return the result of ConvF2I without shifting | |
| 269 convf2i = (ConvF2INode*)conv; | |
| 270 return true; | |
| 271 } | |
| 272 | |
| 273 | |
| 274 //------------------------------check_compare_clipping------------------------- | |
| 275 // Helper function for RegionNode's identification of FP clipping | |
| 276 static bool check_compare_clipping( bool less_than, IfNode *iff, ConNode *limit, Node * & input ) { | |
| 277 Node *i1 = iff->in(1); | |
| 278 if ( !i1->is_Bool() ) { return false; } | |
| 279 BoolNode *bool1 = i1->as_Bool(); | |
| 280 if( less_than && bool1->_test._test != BoolTest::le ) { return false; } | |
| 281 else if( !less_than && bool1->_test._test != BoolTest::lt ) { return false; } | |
| 282 const Node *cmpF = bool1->in(1); | |
| 283 if( cmpF->Opcode() != Op_CmpF ) { return false; } | |
| 284 // Test that the float value being compared against | |
| 285 // is equivalent to the int value used as a limit | |
| 286 Node *nodef = cmpF->in(2); | |
| 287 if( nodef->Opcode() != Op_ConF ) { return false; } | |
| 288 jfloat conf = nodef->getf(); | |
| 289 jint coni = limit->get_int(); | |
| 290 if( ((int)conf) != coni ) { return false; } | |
| 291 input = cmpF->in(1); | |
| 292 return true; | |
| 293 } | |
| 294 | |
| 295 //------------------------------is_unreachable_region-------------------------- | |
| 296 // Find if the Region node is reachable from the root. | |
| 297 bool RegionNode::is_unreachable_region(PhaseGVN *phase) const { | |
| 298 assert(req() == 2, ""); | |
| 299 | |
| 300 // First, cut the simple case of fallthrough region when NONE of | |
| 301 // region's phis references itself directly or through a data node. | |
| 302 uint max = outcnt(); | |
| 303 uint i; | |
| 304 for (i = 0; i < max; i++) { | |
| 305 Node* phi = raw_out(i); | |
| 306 if (phi != NULL && phi->is_Phi()) { | |
| 307 assert(phase->eqv(phi->in(0), this) && phi->req() == 2, ""); | |
| 308 if (phi->outcnt() == 0) | |
| 309 continue; // Safe case - no loops | |
| 310 if (phi->outcnt() == 1) { | |
| 311 Node* u = phi->raw_out(0); | |
| 312 // Skip if only one use is an other Phi or Call or Uncommon trap. | |
| 313 // It is safe to consider this case as fallthrough. | |
| 314 if (u != NULL && (u->is_Phi() || u->is_CFG())) | |
| 315 continue; | |
| 316 } | |
| 317 // Check when phi references itself directly or through an other node. | |
| 318 if (phi->as_Phi()->simple_data_loop_check(phi->in(1)) >= PhiNode::Unsafe) | |
| 319 break; // Found possible unsafe data loop. | |
| 320 } | |
| 321 } | |
| 322 if (i >= max) | |
| 323 return false; // An unsafe case was NOT found - don't need graph walk. | |
| 324 | |
| 325 // Unsafe case - check if the Region node is reachable from root. | |
| 326 ResourceMark rm; | |
| 327 | |
| 328 Arena *a = Thread::current()->resource_area(); | |
| 329 Node_List nstack(a); | |
| 330 VectorSet visited(a); | |
| 331 | |
| 332 // Mark all control nodes reachable from root outputs | |
| 333 Node *n = (Node*)phase->C->root(); | |
| 334 nstack.push(n); | |
| 335 visited.set(n->_idx); | |
| 336 while (nstack.size() != 0) { | |
| 337 n = nstack.pop(); | |
| 338 uint max = n->outcnt(); | |
| 339 for (uint i = 0; i < max; i++) { | |
| 340 Node* m = n->raw_out(i); | |
| 341 if (m != NULL && m->is_CFG()) { | |
| 342 if (phase->eqv(m, this)) { | |
| 343 return false; // We reached the Region node - it is not dead. | |
| 344 } | |
| 345 if (!visited.test_set(m->_idx)) | |
| 346 nstack.push(m); | |
| 347 } | |
| 348 } | |
| 349 } | |
| 350 | |
| 351 return true; // The Region node is unreachable - it is dead. | |
| 352 } | |
| 353 | |
| 354 //------------------------------Ideal------------------------------------------ | |
| 355 // Return a node which is more "ideal" than the current node. Must preserve | |
| 356 // the CFG, but we can still strip out dead paths. | |
| 357 Node *RegionNode::Ideal(PhaseGVN *phase, bool can_reshape) { | |
| 358 if( !can_reshape && !in(0) ) return NULL; // Already degraded to a Copy | |
| 359 assert(!in(0) || !in(0)->is_Root(), "not a specially hidden merge"); | |
| 360 | |
| 361 // Check for RegionNode with no Phi users and both inputs come from either | |
| 362 // arm of the same IF. If found, then the control-flow split is useless. | |
| 363 bool has_phis = false; | |
| 364 if (can_reshape) { // Need DU info to check for Phi users | |
| 365 has_phis = (has_phi() != NULL); // Cache result | |
| 366 if (!has_phis) { // No Phi users? Nothing merging? | |
| 367 for (uint i = 1; i < req()-1; i++) { | |
| 368 Node *if1 = in(i); | |
| 369 if( !if1 ) continue; | |
| 370 Node *iff = if1->in(0); | |
| 371 if( !iff || !iff->is_If() ) continue; | |
| 372 for( uint j=i+1; j<req(); j++ ) { | |
| 373 if( in(j) && in(j)->in(0) == iff && | |
| 374 if1->Opcode() != in(j)->Opcode() ) { | |
| 375 // Add the IF Projections to the worklist. They (and the IF itself) | |
| 376 // will be eliminated if dead. | |
| 377 phase->is_IterGVN()->add_users_to_worklist(iff); | |
| 378 set_req(i, iff->in(0));// Skip around the useless IF diamond | |
| 379 set_req(j, NULL); | |
| 380 return this; // Record progress | |
| 381 } | |
| 382 } | |
| 383 } | |
| 384 } | |
| 385 } | |
| 386 | |
| 387 // Remove TOP or NULL input paths. If only 1 input path remains, this Region | |
| 388 // degrades to a copy. | |
| 389 bool add_to_worklist = false; | |
| 390 int cnt = 0; // Count of values merging | |
| 391 DEBUG_ONLY( int cnt_orig = req(); ) // Save original inputs count | |
| 392 int del_it = 0; // The last input path we delete | |
| 393 // For all inputs... | |
| 394 for( uint i=1; i<req(); ++i ){// For all paths in | |
| 395 Node *n = in(i); // Get the input | |
| 396 if( n != NULL ) { | |
| 397 // Remove useless control copy inputs | |
| 398 if( n->is_Region() && n->as_Region()->is_copy() ) { | |
| 399 set_req(i, n->nonnull_req()); | |
| 400 i--; | |
| 401 continue; | |
| 402 } | |
| 403 if( n->is_Proj() ) { // Remove useless rethrows | |
| 404 Node *call = n->in(0); | |
| 405 if (call->is_Call() && call->as_Call()->entry_point() == OptoRuntime::rethrow_stub()) { | |
| 406 set_req(i, call->in(0)); | |
| 407 i--; | |
| 408 continue; | |
| 409 } | |
| 410 } | |
| 411 if( phase->type(n) == Type::TOP ) { | |
| 412 set_req(i, NULL); // Ignore TOP inputs | |
| 413 i--; | |
| 414 continue; | |
| 415 } | |
| 416 cnt++; // One more value merging | |
| 417 | |
| 418 } else if (can_reshape) { // Else found dead path with DU info | |
| 419 PhaseIterGVN *igvn = phase->is_IterGVN(); | |
| 420 del_req(i); // Yank path from self | |
| 421 del_it = i; | |
| 422 uint max = outcnt(); | |
| 423 DUIterator j; | |
| 424 bool progress = true; | |
| 425 while(progress) { // Need to establish property over all users | |
| 426 progress = false; | |
| 427 for (j = outs(); has_out(j); j++) { | |
| 428 Node *n = out(j); | |
| 429 if( n->req() != req() && n->is_Phi() ) { | |
| 430 assert( n->in(0) == this, "" ); | |
| 431 igvn->hash_delete(n); // Yank from hash before hacking edges | |
| 432 n->set_req_X(i,NULL,igvn);// Correct DU info | |
| 433 n->del_req(i); // Yank path from Phis | |
| 434 if( max != outcnt() ) { | |
| 435 progress = true; | |
| 436 j = refresh_out_pos(j); | |
| 437 max = outcnt(); | |
| 438 } | |
| 439 } | |
| 440 } | |
| 441 } | |
| 442 add_to_worklist = true; | |
| 443 i--; | |
| 444 } | |
| 445 } | |
| 446 | |
| 447 if (can_reshape && cnt == 1) { | |
| 448 // Is it dead loop? | |
| 449 // If it is LoopNopde it had 2 (+1 itself) inputs and | |
| 450 // one of them was cut. The loop is dead if it was EntryContol. | |
| 451 assert(!this->is_Loop() || cnt_orig == 3, "Loop node should have 3 inputs"); | |
| 452 if (this->is_Loop() && del_it == LoopNode::EntryControl || | |
| 453 !this->is_Loop() && has_phis && is_unreachable_region(phase)) { | |
| 454 // Yes, the region will be removed during the next step below. | |
| 455 // Cut the backedge input and remove phis since no data paths left. | |
| 456 // We don't cut outputs to other nodes here since we need to put them | |
| 457 // on the worklist. | |
| 458 del_req(1); | |
| 459 cnt = 0; | |
| 460 assert( req() == 1, "no more inputs expected" ); | |
| 461 uint max = outcnt(); | |
| 462 bool progress = true; | |
| 463 Node *top = phase->C->top(); | |
| 464 PhaseIterGVN *igvn = phase->is_IterGVN(); | |
| 465 DUIterator j; | |
| 466 while(progress) { | |
| 467 progress = false; | |
| 468 for (j = outs(); has_out(j); j++) { | |
| 469 Node *n = out(j); | |
| 470 if( n->is_Phi() ) { | |
| 471 assert( igvn->eqv(n->in(0), this), "" ); | |
| 472 assert( n->req() == 2 && n->in(1) != NULL, "Only one data input expected" ); | |
| 473 // Break dead loop data path. | |
| 474 // Eagerly replace phis with top to avoid phis copies generation. | |
| 475 igvn->add_users_to_worklist(n); | |
| 476 igvn->hash_delete(n); // Yank from hash before hacking edges | |
| 477 igvn->subsume_node(n, top); | |
| 478 if( max != outcnt() ) { | |
| 479 progress = true; | |
| 480 j = refresh_out_pos(j); | |
| 481 max = outcnt(); | |
| 482 } | |
| 483 } | |
| 484 } | |
| 485 } | |
| 486 add_to_worklist = true; | |
| 487 } | |
| 488 } | |
| 489 if (add_to_worklist) { | |
| 490 phase->is_IterGVN()->add_users_to_worklist(this); // Revisit collapsed Phis | |
| 491 } | |
| 492 | |
| 493 if( cnt <= 1 ) { // Only 1 path in? | |
| 494 set_req(0, NULL); // Null control input for region copy | |
| 495 if( cnt == 0 && !can_reshape) { // Parse phase - leave the node as it is. | |
| 496 // No inputs or all inputs are NULL. | |
| 497 return NULL; | |
| 498 } else if (can_reshape) { // Optimization phase - remove the node | |
| 499 PhaseIterGVN *igvn = phase->is_IterGVN(); | |
| 500 Node *parent_ctrl; | |
| 501 if( cnt == 0 ) { | |
| 502 assert( req() == 1, "no inputs expected" ); | |
| 503 // During IGVN phase such region will be subsumed by TOP node | |
| 504 // so region's phis will have TOP as control node. | |
| 505 // Kill phis here to avoid it. PhiNode::is_copy() will be always false. | |
| 506 // Also set other user's input to top. | |
| 507 parent_ctrl = phase->C->top(); | |
| 508 } else { | |
| 509 // The fallthrough case since we already checked dead loops above. | |
| 510 parent_ctrl = in(1); | |
| 511 assert(parent_ctrl != NULL, "Region is a copy of some non-null control"); | |
| 512 assert(!igvn->eqv(parent_ctrl, this), "Close dead loop"); | |
| 513 } | |
| 514 if (!add_to_worklist) | |
| 515 igvn->add_users_to_worklist(this); // Check for further allowed opts | |
| 516 for (DUIterator_Last imin, i = last_outs(imin); i >= imin; --i) { | |
| 517 Node* n = last_out(i); | |
| 518 igvn->hash_delete(n); // Remove from worklist before modifying edges | |
| 519 if( n->is_Phi() ) { // Collapse all Phis | |
| 520 // Eagerly replace phis to avoid copies generation. | |
| 521 igvn->add_users_to_worklist(n); | |
| 522 igvn->hash_delete(n); // Yank from hash before hacking edges | |
| 523 if( cnt == 0 ) { | |
| 524 assert( n->req() == 1, "No data inputs expected" ); | |
| 525 igvn->subsume_node(n, parent_ctrl); // replaced by top | |
| 526 } else { | |
| 527 assert( n->req() == 2 && n->in(1) != NULL, "Only one data input expected" ); | |
| 528 Node* in1 = n->in(1); // replaced by unique input | |
| 529 if( n->as_Phi()->is_unsafe_data_reference(in1) ) | |
| 530 in1 = phase->C->top(); // replaced by top | |
| 531 igvn->subsume_node(n, in1); | |
| 532 } | |
| 533 } | |
| 534 else if( n->is_Region() ) { // Update all incoming edges | |
| 535 assert( !igvn->eqv(n, this), "Must be removed from DefUse edges"); | |
| 536 uint uses_found = 0; | |
| 537 for( uint k=1; k < n->req(); k++ ) { | |
| 538 if( n->in(k) == this ) { | |
| 539 n->set_req(k, parent_ctrl); | |
| 540 uses_found++; | |
| 541 } | |
| 542 } | |
| 543 if( uses_found > 1 ) { // (--i) done at the end of the loop. | |
| 544 i -= (uses_found - 1); | |
| 545 } | |
| 546 } | |
| 547 else { | |
| 548 assert( igvn->eqv(n->in(0), this), "Expect RegionNode to be control parent"); | |
| 549 n->set_req(0, parent_ctrl); | |
| 550 } | |
| 551 #ifdef ASSERT | |
| 552 for( uint k=0; k < n->req(); k++ ) { | |
| 553 assert( !igvn->eqv(n->in(k), this), "All uses of RegionNode should be gone"); | |
| 554 } | |
| 555 #endif | |
| 556 } | |
| 557 // Remove the RegionNode itself from DefUse info | |
| 558 igvn->remove_dead_node(this); | |
| 559 return NULL; | |
| 560 } | |
| 561 return this; // Record progress | |
| 562 } | |
| 563 | |
| 564 | |
| 565 // If a Region flows into a Region, merge into one big happy merge. | |
| 566 if (can_reshape) { | |
| 567 Node *m = merge_region(this, phase); | |
| 568 if (m != NULL) return m; | |
| 569 } | |
| 570 | |
| 571 // Check if this region is the root of a clipping idiom on floats | |
| 572 if( ConvertFloat2IntClipping && can_reshape && req() == 4 ) { | |
| 573 // Check that only one use is a Phi and that it simplifies to two constants + | |
| 574 PhiNode* phi = has_unique_phi(); | |
| 575 if (phi != NULL) { // One Phi user | |
| 576 // Check inputs to the Phi | |
| 577 ConNode *min; | |
| 578 ConNode *max; | |
| 579 Node *val; | |
| 580 uint min_idx; | |
| 581 uint max_idx; | |
| 582 uint val_idx; | |
| 583 if( check_phi_clipping( phi, min, min_idx, max, max_idx, val, val_idx ) ) { | |
| 584 IfNode *top_if; | |
| 585 IfNode *bot_if; | |
| 586 if( check_if_clipping( this, bot_if, top_if ) ) { | |
| 587 // Control pattern checks, now verify compares | |
| 588 Node *top_in = NULL; // value being compared against | |
| 589 Node *bot_in = NULL; | |
| 590 if( check_compare_clipping( true, bot_if, min, bot_in ) && | |
| 591 check_compare_clipping( false, top_if, max, top_in ) ) { | |
| 592 if( bot_in == top_in ) { | |
| 593 PhaseIterGVN *gvn = phase->is_IterGVN(); | |
| 594 assert( gvn != NULL, "Only had DefUse info in IterGVN"); | |
| 595 // Only remaining check is that bot_in == top_in == (Phi's val + mods) | |
| 596 | |
| 597 // Check for the ConvF2INode | |
| 598 ConvF2INode *convf2i; | |
| 599 if( check_convf2i_clipping( phi, val_idx, convf2i, min, max ) && | |
| 600 convf2i->in(1) == bot_in ) { | |
| 601 // Matched pattern, including LShiftI; RShiftI, replace with integer compares | |
| 602 // max test | |
| 603 Node *cmp = gvn->register_new_node_with_optimizer(new (phase->C, 3) CmpINode( convf2i, min )); | |
| 604 Node *boo = gvn->register_new_node_with_optimizer(new (phase->C, 2) BoolNode( cmp, BoolTest::lt )); | |
| 605 IfNode *iff = (IfNode*)gvn->register_new_node_with_optimizer(new (phase->C, 2) IfNode( top_if->in(0), boo, PROB_UNLIKELY_MAG(5), top_if->_fcnt )); | |
| 606 Node *if_min= gvn->register_new_node_with_optimizer(new (phase->C, 1) IfTrueNode (iff)); | |
| 607 Node *ifF = gvn->register_new_node_with_optimizer(new (phase->C, 1) IfFalseNode(iff)); | |
| 608 // min test | |
| 609 cmp = gvn->register_new_node_with_optimizer(new (phase->C, 3) CmpINode( convf2i, max )); | |
| 610 boo = gvn->register_new_node_with_optimizer(new (phase->C, 2) BoolNode( cmp, BoolTest::gt )); | |
| 611 iff = (IfNode*)gvn->register_new_node_with_optimizer(new (phase->C, 2) IfNode( ifF, boo, PROB_UNLIKELY_MAG(5), bot_if->_fcnt )); | |
| 612 Node *if_max= gvn->register_new_node_with_optimizer(new (phase->C, 1) IfTrueNode (iff)); | |
| 613 ifF = gvn->register_new_node_with_optimizer(new (phase->C, 1) IfFalseNode(iff)); | |
| 614 // update input edges to region node | |
| 615 set_req_X( min_idx, if_min, gvn ); | |
| 616 set_req_X( max_idx, if_max, gvn ); | |
| 617 set_req_X( val_idx, ifF, gvn ); | |
| 618 // remove unnecessary 'LShiftI; RShiftI' idiom | |
| 619 gvn->hash_delete(phi); | |
| 620 phi->set_req_X( val_idx, convf2i, gvn ); | |
| 621 gvn->hash_find_insert(phi); | |
| 622 // Return transformed region node | |
| 623 return this; | |
| 624 } | |
| 625 } | |
| 626 } | |
| 627 } | |
| 628 } | |
| 629 } | |
| 630 } | |
| 631 | |
| 632 return NULL; | |
| 633 } | |
| 634 | |
| 635 | |
| 636 | |
| 637 const RegMask &RegionNode::out_RegMask() const { | |
| 638 return RegMask::Empty; | |
| 639 } | |
| 640 | |
| 641 // Find the one non-null required input. RegionNode only | |
| 642 Node *Node::nonnull_req() const { | |
| 643 assert( is_Region(), "" ); | |
| 644 for( uint i = 1; i < _cnt; i++ ) | |
| 645 if( in(i) ) | |
| 646 return in(i); | |
| 647 ShouldNotReachHere(); | |
| 648 return NULL; | |
| 649 } | |
| 650 | |
| 651 | |
| 652 //============================================================================= | |
| 653 // note that these functions assume that the _adr_type field is flattened | |
| 654 uint PhiNode::hash() const { | |
| 655 const Type* at = _adr_type; | |
| 656 return TypeNode::hash() + (at ? at->hash() : 0); | |
| 657 } | |
| 658 uint PhiNode::cmp( const Node &n ) const { | |
| 659 return TypeNode::cmp(n) && _adr_type == ((PhiNode&)n)._adr_type; | |
| 660 } | |
| 661 static inline | |
| 662 const TypePtr* flatten_phi_adr_type(const TypePtr* at) { | |
| 663 if (at == NULL || at == TypePtr::BOTTOM) return at; | |
| 664 return Compile::current()->alias_type(at)->adr_type(); | |
| 665 } | |
| 666 | |
| 667 //----------------------------make--------------------------------------------- | |
| 668 // create a new phi with edges matching r and set (initially) to x | |
| 669 PhiNode* PhiNode::make(Node* r, Node* x, const Type *t, const TypePtr* at) { | |
| 670 uint preds = r->req(); // Number of predecessor paths | |
| 671 assert(t != Type::MEMORY || at == flatten_phi_adr_type(at), "flatten at"); | |
| 672 PhiNode* p = new (Compile::current(), preds) PhiNode(r, t, at); | |
| 673 for (uint j = 1; j < preds; j++) { | |
| 674 // Fill in all inputs, except those which the region does not yet have | |
| 675 if (r->in(j) != NULL) | |
| 676 p->init_req(j, x); | |
| 677 } | |
| 678 return p; | |
| 679 } | |
| 680 PhiNode* PhiNode::make(Node* r, Node* x) { | |
| 681 const Type* t = x->bottom_type(); | |
| 682 const TypePtr* at = NULL; | |
| 683 if (t == Type::MEMORY) at = flatten_phi_adr_type(x->adr_type()); | |
| 684 return make(r, x, t, at); | |
| 685 } | |
| 686 PhiNode* PhiNode::make_blank(Node* r, Node* x) { | |
| 687 const Type* t = x->bottom_type(); | |
| 688 const TypePtr* at = NULL; | |
| 689 if (t == Type::MEMORY) at = flatten_phi_adr_type(x->adr_type()); | |
| 690 return new (Compile::current(), r->req()) PhiNode(r, t, at); | |
| 691 } | |
| 692 | |
| 693 | |
| 694 //------------------------slice_memory----------------------------------------- | |
| 695 // create a new phi with narrowed memory type | |
| 696 PhiNode* PhiNode::slice_memory(const TypePtr* adr_type) const { | |
| 697 PhiNode* mem = (PhiNode*) clone(); | |
| 698 *(const TypePtr**)&mem->_adr_type = adr_type; | |
| 699 // convert self-loops, or else we get a bad graph | |
| 700 for (uint i = 1; i < req(); i++) { | |
| 701 if ((const Node*)in(i) == this) mem->set_req(i, mem); | |
| 702 } | |
| 703 mem->verify_adr_type(); | |
| 704 return mem; | |
| 705 } | |
| 706 | |
|
74
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
707 //------------------------split_out_instance----------------------------------- |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
708 // Split out an instance type from a bottom phi. |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
709 PhiNode* PhiNode::split_out_instance(const TypePtr* at, PhaseIterGVN *igvn) const { |
| 163 | 710 const TypeOopPtr *t_oop = at->isa_oopptr(); |
| 711 assert(t_oop != NULL && t_oop->is_instance(), "expecting instance oopptr"); | |
| 712 const TypePtr *t = adr_type(); | |
| 713 assert(type() == Type::MEMORY && | |
| 714 (t == TypePtr::BOTTOM || t == TypeRawPtr::BOTTOM || | |
| 715 t->isa_oopptr() && !t->is_oopptr()->is_instance() && | |
| 716 t->is_oopptr()->cast_to_instance(t_oop->instance_id()) == t_oop), | |
| 717 "bottom or raw memory required"); | |
|
74
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
718 |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
719 // Check if an appropriate node already exists. |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
720 Node *region = in(0); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
721 for (DUIterator_Fast kmax, k = region->fast_outs(kmax); k < kmax; k++) { |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
722 Node* use = region->fast_out(k); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
723 if( use->is_Phi()) { |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
724 PhiNode *phi2 = use->as_Phi(); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
725 if (phi2->type() == Type::MEMORY && phi2->adr_type() == at) { |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
726 return phi2; |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
727 } |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
728 } |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
729 } |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
730 Compile *C = igvn->C; |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
731 Arena *a = Thread::current()->resource_area(); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
732 Node_Array node_map = new Node_Array(a); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
733 Node_Stack stack(a, C->unique() >> 4); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
734 PhiNode *nphi = slice_memory(at); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
735 igvn->register_new_node_with_optimizer( nphi ); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
736 node_map.map(_idx, nphi); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
737 stack.push((Node *)this, 1); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
738 while(!stack.is_empty()) { |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
739 PhiNode *ophi = stack.node()->as_Phi(); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
740 uint i = stack.index(); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
741 assert(i >= 1, "not control edge"); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
742 stack.pop(); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
743 nphi = node_map[ophi->_idx]->as_Phi(); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
744 for (; i < ophi->req(); i++) { |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
745 Node *in = ophi->in(i); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
746 if (in == NULL || igvn->type(in) == Type::TOP) |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
747 continue; |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
748 Node *opt = MemNode::optimize_simple_memory_chain(in, at, igvn); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
749 PhiNode *optphi = opt->is_Phi() ? opt->as_Phi() : NULL; |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
750 if (optphi != NULL && optphi->adr_type() == TypePtr::BOTTOM) { |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
751 opt = node_map[optphi->_idx]; |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
752 if (opt == NULL) { |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
753 stack.push(ophi, i); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
754 nphi = optphi->slice_memory(at); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
755 igvn->register_new_node_with_optimizer( nphi ); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
756 node_map.map(optphi->_idx, nphi); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
757 ophi = optphi; |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
758 i = 0; // will get incremented at top of loop |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
759 continue; |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
760 } |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
761 } |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
762 nphi->set_req(i, opt); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
763 } |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
764 } |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
765 return nphi; |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
766 } |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
767 |
| 0 | 768 //------------------------verify_adr_type-------------------------------------- |
| 769 #ifdef ASSERT | |
| 770 void PhiNode::verify_adr_type(VectorSet& visited, const TypePtr* at) const { | |
| 771 if (visited.test_set(_idx)) return; //already visited | |
| 772 | |
| 773 // recheck constructor invariants: | |
| 774 verify_adr_type(false); | |
| 775 | |
| 776 // recheck local phi/phi consistency: | |
| 777 assert(_adr_type == at || _adr_type == TypePtr::BOTTOM, | |
| 778 "adr_type must be consistent across phi nest"); | |
| 779 | |
| 780 // walk around | |
| 781 for (uint i = 1; i < req(); i++) { | |
| 782 Node* n = in(i); | |
| 783 if (n == NULL) continue; | |
| 784 const Node* np = in(i); | |
| 785 if (np->is_Phi()) { | |
| 786 np->as_Phi()->verify_adr_type(visited, at); | |
| 787 } else if (n->bottom_type() == Type::TOP | |
| 788 || (n->is_Mem() && n->in(MemNode::Address)->bottom_type() == Type::TOP)) { | |
| 789 // ignore top inputs | |
| 790 } else { | |
| 791 const TypePtr* nat = flatten_phi_adr_type(n->adr_type()); | |
| 792 // recheck phi/non-phi consistency at leaves: | |
| 793 assert((nat != NULL) == (at != NULL), ""); | |
| 794 assert(nat == at || nat == TypePtr::BOTTOM, | |
| 795 "adr_type must be consistent at leaves of phi nest"); | |
| 796 } | |
| 797 } | |
| 798 } | |
| 799 | |
| 800 // Verify a whole nest of phis rooted at this one. | |
| 801 void PhiNode::verify_adr_type(bool recursive) const { | |
| 802 if (is_error_reported()) return; // muzzle asserts when debugging an error | |
| 803 if (Node::in_dump()) return; // muzzle asserts when printing | |
| 804 | |
| 805 assert((_type == Type::MEMORY) == (_adr_type != NULL), "adr_type for memory phis only"); | |
| 806 | |
| 807 if (!VerifyAliases) return; // verify thoroughly only if requested | |
| 808 | |
| 809 assert(_adr_type == flatten_phi_adr_type(_adr_type), | |
| 810 "Phi::adr_type must be pre-normalized"); | |
| 811 | |
| 812 if (recursive) { | |
| 813 VectorSet visited(Thread::current()->resource_area()); | |
| 814 verify_adr_type(visited, _adr_type); | |
| 815 } | |
| 816 } | |
| 817 #endif | |
| 818 | |
| 819 | |
| 820 //------------------------------Value------------------------------------------ | |
| 821 // Compute the type of the PhiNode | |
| 822 const Type *PhiNode::Value( PhaseTransform *phase ) const { | |
| 823 Node *r = in(0); // RegionNode | |
| 824 if( !r ) // Copy or dead | |
| 825 return in(1) ? phase->type(in(1)) : Type::TOP; | |
| 826 | |
| 827 // Note: During parsing, phis are often transformed before their regions. | |
| 828 // This means we have to use type_or_null to defend against untyped regions. | |
| 829 if( phase->type_or_null(r) == Type::TOP ) // Dead code? | |
| 830 return Type::TOP; | |
| 831 | |
| 832 // Check for trip-counted loop. If so, be smarter. | |
| 833 CountedLoopNode *l = r->is_CountedLoop() ? r->as_CountedLoop() : NULL; | |
| 834 if( l && l->can_be_counted_loop(phase) && | |
| 835 ((const Node*)l->phi() == this) ) { // Trip counted loop! | |
| 836 // protect against init_trip() or limit() returning NULL | |
| 837 const Node *init = l->init_trip(); | |
| 838 const Node *limit = l->limit(); | |
| 839 if( init != NULL && limit != NULL && l->stride_is_con() ) { | |
| 840 const TypeInt *lo = init ->bottom_type()->isa_int(); | |
| 841 const TypeInt *hi = limit->bottom_type()->isa_int(); | |
| 842 if( lo && hi ) { // Dying loops might have TOP here | |
| 843 int stride = l->stride_con(); | |
| 844 if( stride < 0 ) { // Down-counter loop | |
| 845 const TypeInt *tmp = lo; lo = hi; hi = tmp; | |
| 846 stride = -stride; | |
| 847 } | |
| 848 if( lo->_hi < hi->_lo ) // Reversed endpoints are well defined :-( | |
| 849 return TypeInt::make(lo->_lo,hi->_hi,3); | |
| 850 } | |
| 851 } | |
| 852 } | |
| 853 | |
| 854 // Until we have harmony between classes and interfaces in the type | |
| 855 // lattice, we must tread carefully around phis which implicitly | |
| 856 // convert the one to the other. | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
857 const TypeInstPtr* ttip = _type->isa_narrowoop() ? _type->isa_narrowoop()->make_oopptr()->isa_instptr() :_type->isa_instptr(); |
| 0 | 858 bool is_intf = false; |
| 859 if (ttip != NULL) { | |
| 860 ciKlass* k = ttip->klass(); | |
| 861 if (k->is_loaded() && k->is_interface()) | |
| 862 is_intf = true; | |
| 863 } | |
| 864 | |
| 865 // Default case: merge all inputs | |
| 866 const Type *t = Type::TOP; // Merged type starting value | |
| 867 for (uint i = 1; i < req(); ++i) {// For all paths in | |
| 868 // Reachable control path? | |
| 869 if (r->in(i) && phase->type(r->in(i)) == Type::CONTROL) { | |
| 870 const Type* ti = phase->type(in(i)); | |
| 871 // We assume that each input of an interface-valued Phi is a true | |
| 872 // subtype of that interface. This might not be true of the meet | |
| 873 // of all the input types. The lattice is not distributive in | |
| 874 // such cases. Ward off asserts in type.cpp by refusing to do | |
| 875 // meets between interfaces and proper classes. | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
876 const TypeInstPtr* tiip = ti->isa_narrowoop() ? ti->is_narrowoop()->make_oopptr()->isa_instptr() : ti->isa_instptr(); |
| 0 | 877 if (tiip) { |
| 878 bool ti_is_intf = false; | |
| 879 ciKlass* k = tiip->klass(); | |
| 880 if (k->is_loaded() && k->is_interface()) | |
| 881 ti_is_intf = true; | |
| 882 if (is_intf != ti_is_intf) | |
| 883 { t = _type; break; } | |
| 884 } | |
| 885 t = t->meet(ti); | |
| 886 } | |
| 887 } | |
| 888 | |
| 889 // The worst-case type (from ciTypeFlow) should be consistent with "t". | |
| 890 // That is, we expect that "t->higher_equal(_type)" holds true. | |
| 891 // There are various exceptions: | |
| 892 // - Inputs which are phis might in fact be widened unnecessarily. | |
| 893 // For example, an input might be a widened int while the phi is a short. | |
| 894 // - Inputs might be BotPtrs but this phi is dependent on a null check, | |
| 895 // and postCCP has removed the cast which encodes the result of the check. | |
| 896 // - The type of this phi is an interface, and the inputs are classes. | |
| 897 // - Value calls on inputs might produce fuzzy results. | |
| 898 // (Occurrences of this case suggest improvements to Value methods.) | |
| 899 // | |
| 900 // It is not possible to see Type::BOTTOM values as phi inputs, | |
| 901 // because the ciTypeFlow pre-pass produces verifier-quality types. | |
| 902 const Type* ft = t->filter(_type); // Worst case type | |
| 903 | |
| 904 #ifdef ASSERT | |
| 905 // The following logic has been moved into TypeOopPtr::filter. | |
| 906 const Type* jt = t->join(_type); | |
| 907 if( jt->empty() ) { // Emptied out??? | |
| 908 | |
| 909 // Check for evil case of 't' being a class and '_type' expecting an | |
| 910 // interface. This can happen because the bytecodes do not contain | |
| 911 // enough type info to distinguish a Java-level interface variable | |
| 912 // from a Java-level object variable. If we meet 2 classes which | |
| 913 // both implement interface I, but their meet is at 'j/l/O' which | |
| 914 // doesn't implement I, we have no way to tell if the result should | |
| 915 // be 'I' or 'j/l/O'. Thus we'll pick 'j/l/O'. If this then flows | |
| 916 // into a Phi which "knows" it's an Interface type we'll have to | |
| 917 // uplift the type. | |
| 918 if( !t->empty() && ttip && ttip->is_loaded() && ttip->klass()->is_interface() ) | |
| 919 { assert(ft == _type, ""); } // Uplift to interface | |
| 920 // Otherwise it's something stupid like non-overlapping int ranges | |
| 921 // found on dying counted loops. | |
| 922 else | |
| 923 { assert(ft == Type::TOP, ""); } // Canonical empty value | |
| 924 } | |
| 925 | |
| 926 else { | |
| 927 | |
| 928 // If we have an interface-typed Phi and we narrow to a class type, the join | |
| 929 // should report back the class. However, if we have a J/L/Object | |
| 930 // class-typed Phi and an interface flows in, it's possible that the meet & | |
| 931 // join report an interface back out. This isn't possible but happens | |
| 932 // because the type system doesn't interact well with interfaces. | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
933 const TypeInstPtr *jtip = jt->isa_narrowoop() ? jt->isa_narrowoop()->make_oopptr()->isa_instptr() : jt->isa_instptr(); |
| 0 | 934 if( jtip && ttip ) { |
| 935 if( jtip->is_loaded() && jtip->klass()->is_interface() && | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
936 ttip->is_loaded() && !ttip->klass()->is_interface() ) { |
| 0 | 937 // Happens in a CTW of rt.jar, 320-341, no extra flags |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
938 assert(ft == ttip->cast_to_ptr_type(jtip->ptr()) || |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
939 ft->isa_narrowoop() && ft->isa_narrowoop()->make_oopptr() == ttip->cast_to_ptr_type(jtip->ptr()), ""); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
940 jt = ft; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
941 } |
| 0 | 942 } |
| 943 if (jt != ft && jt->base() == ft->base()) { | |
| 944 if (jt->isa_int() && | |
| 945 jt->is_int()->_lo == ft->is_int()->_lo && | |
| 946 jt->is_int()->_hi == ft->is_int()->_hi) | |
| 947 jt = ft; | |
| 948 if (jt->isa_long() && | |
| 949 jt->is_long()->_lo == ft->is_long()->_lo && | |
| 950 jt->is_long()->_hi == ft->is_long()->_hi) | |
| 951 jt = ft; | |
| 952 } | |
| 953 if (jt != ft) { | |
| 954 tty->print("merge type: "); t->dump(); tty->cr(); | |
| 955 tty->print("kill type: "); _type->dump(); tty->cr(); | |
| 956 tty->print("join type: "); jt->dump(); tty->cr(); | |
| 957 tty->print("filter type: "); ft->dump(); tty->cr(); | |
| 958 } | |
| 959 assert(jt == ft, ""); | |
| 960 } | |
| 961 #endif //ASSERT | |
| 962 | |
| 963 // Deal with conversion problems found in data loops. | |
| 964 ft = phase->saturate(ft, phase->type_or_null(this), _type); | |
| 965 | |
| 966 return ft; | |
| 967 } | |
| 968 | |
| 969 | |
| 970 //------------------------------is_diamond_phi--------------------------------- | |
| 971 // Does this Phi represent a simple well-shaped diamond merge? Return the | |
| 972 // index of the true path or 0 otherwise. | |
| 973 int PhiNode::is_diamond_phi() const { | |
| 974 // Check for a 2-path merge | |
| 975 Node *region = in(0); | |
| 976 if( !region ) return 0; | |
| 977 if( region->req() != 3 ) return 0; | |
| 978 if( req() != 3 ) return 0; | |
| 979 // Check that both paths come from the same If | |
| 980 Node *ifp1 = region->in(1); | |
| 981 Node *ifp2 = region->in(2); | |
| 982 if( !ifp1 || !ifp2 ) return 0; | |
| 983 Node *iff = ifp1->in(0); | |
| 984 if( !iff || !iff->is_If() ) return 0; | |
| 985 if( iff != ifp2->in(0) ) return 0; | |
| 986 // Check for a proper bool/cmp | |
| 987 const Node *b = iff->in(1); | |
| 988 if( !b->is_Bool() ) return 0; | |
| 989 const Node *cmp = b->in(1); | |
| 990 if( !cmp->is_Cmp() ) return 0; | |
| 991 | |
| 992 // Check for branching opposite expected | |
| 993 if( ifp2->Opcode() == Op_IfTrue ) { | |
| 994 assert( ifp1->Opcode() == Op_IfFalse, "" ); | |
| 995 return 2; | |
| 996 } else { | |
| 997 assert( ifp1->Opcode() == Op_IfTrue, "" ); | |
| 998 return 1; | |
| 999 } | |
| 1000 } | |
| 1001 | |
| 1002 //----------------------------check_cmove_id----------------------------------- | |
| 1003 // Check for CMove'ing a constant after comparing against the constant. | |
| 1004 // Happens all the time now, since if we compare equality vs a constant in | |
| 1005 // the parser, we "know" the variable is constant on one path and we force | |
| 1006 // it. Thus code like "if( x==0 ) {/*EMPTY*/}" ends up inserting a | |
| 1007 // conditional move: "x = (x==0)?0:x;". Yucko. This fix is slightly more | |
| 1008 // general in that we don't need constants. Since CMove's are only inserted | |
| 1009 // in very special circumstances, we do it here on generic Phi's. | |
| 1010 Node* PhiNode::is_cmove_id(PhaseTransform* phase, int true_path) { | |
| 1011 assert(true_path !=0, "only diamond shape graph expected"); | |
| 1012 | |
| 1013 // is_diamond_phi() has guaranteed the correctness of the nodes sequence: | |
| 1014 // phi->region->if_proj->ifnode->bool->cmp | |
| 1015 Node* region = in(0); | |
| 1016 Node* iff = region->in(1)->in(0); | |
| 1017 BoolNode* b = iff->in(1)->as_Bool(); | |
| 1018 Node* cmp = b->in(1); | |
| 1019 Node* tval = in(true_path); | |
| 1020 Node* fval = in(3-true_path); | |
| 1021 Node* id = CMoveNode::is_cmove_id(phase, cmp, tval, fval, b); | |
| 1022 if (id == NULL) | |
| 1023 return NULL; | |
| 1024 | |
| 1025 // Either value might be a cast that depends on a branch of 'iff'. | |
| 1026 // Since the 'id' value will float free of the diamond, either | |
| 1027 // decast or return failure. | |
| 1028 Node* ctl = id->in(0); | |
| 1029 if (ctl != NULL && ctl->in(0) == iff) { | |
| 1030 if (id->is_ConstraintCast()) { | |
| 1031 return id->in(1); | |
| 1032 } else { | |
| 1033 // Don't know how to disentangle this value. | |
| 1034 return NULL; | |
| 1035 } | |
| 1036 } | |
| 1037 | |
| 1038 return id; | |
| 1039 } | |
| 1040 | |
| 1041 //------------------------------Identity--------------------------------------- | |
| 1042 // Check for Region being Identity. | |
| 1043 Node *PhiNode::Identity( PhaseTransform *phase ) { | |
| 1044 // Check for no merging going on | |
| 1045 // (There used to be special-case code here when this->region->is_Loop. | |
| 1046 // It would check for a tributary phi on the backedge that the main phi | |
| 1047 // trivially, perhaps with a single cast. The unique_input method | |
| 1048 // does all this and more, by reducing such tributaries to 'this'.) | |
| 1049 Node* uin = unique_input(phase); | |
| 1050 if (uin != NULL) { | |
| 1051 return uin; | |
| 1052 } | |
| 1053 | |
| 1054 int true_path = is_diamond_phi(); | |
| 1055 if (true_path != 0) { | |
| 1056 Node* id = is_cmove_id(phase, true_path); | |
| 1057 if (id != NULL) return id; | |
| 1058 } | |
| 1059 | |
| 1060 return this; // No identity | |
| 1061 } | |
| 1062 | |
| 1063 //-----------------------------unique_input------------------------------------ | |
| 1064 // Find the unique value, discounting top, self-loops, and casts. | |
| 1065 // Return top if there are no inputs, and self if there are multiple. | |
| 1066 Node* PhiNode::unique_input(PhaseTransform* phase) { | |
| 1067 // 1) One unique direct input, or | |
| 1068 // 2) some of the inputs have an intervening ConstraintCast and | |
| 1069 // the type of input is the same or sharper (more specific) | |
| 1070 // than the phi's type. | |
| 1071 // 3) an input is a self loop | |
| 1072 // | |
| 1073 // 1) input or 2) input or 3) input __ | |
| 1074 // / \ / \ \ / \ | |
| 1075 // \ / | cast phi cast | |
| 1076 // phi \ / / \ / | |
| 1077 // phi / -- | |
| 1078 | |
| 1079 Node* r = in(0); // RegionNode | |
| 1080 if (r == NULL) return in(1); // Already degraded to a Copy | |
| 1081 Node* uncasted_input = NULL; // The unique uncasted input (ConstraintCasts removed) | |
| 1082 Node* direct_input = NULL; // The unique direct input | |
| 1083 | |
| 1084 for (uint i = 1, cnt = req(); i < cnt; ++i) { | |
| 1085 Node* rc = r->in(i); | |
| 1086 if (rc == NULL || phase->type(rc) == Type::TOP) | |
| 1087 continue; // ignore unreachable control path | |
| 1088 Node* n = in(i); | |
| 1089 Node* un = n->uncast(); | |
| 1090 if (un == NULL || un == this || phase->type(un) == Type::TOP) { | |
| 1091 continue; // ignore if top, or in(i) and "this" are in a data cycle | |
| 1092 } | |
| 1093 // Check for a unique uncasted input | |
| 1094 if (uncasted_input == NULL) { | |
| 1095 uncasted_input = un; | |
| 1096 } else if (uncasted_input != un) { | |
| 1097 uncasted_input = NodeSentinel; // no unique uncasted input | |
| 1098 } | |
| 1099 // Check for a unique direct input | |
| 1100 if (direct_input == NULL) { | |
| 1101 direct_input = n; | |
| 1102 } else if (direct_input != n) { | |
| 1103 direct_input = NodeSentinel; // no unique direct input | |
| 1104 } | |
| 1105 } | |
| 1106 if (direct_input == NULL) { | |
| 1107 return phase->C->top(); // no inputs | |
| 1108 } | |
| 1109 assert(uncasted_input != NULL,""); | |
| 1110 | |
| 1111 if (direct_input != NodeSentinel) { | |
| 1112 return direct_input; // one unique direct input | |
| 1113 } | |
| 1114 if (uncasted_input != NodeSentinel && | |
| 1115 phase->type(uncasted_input)->higher_equal(type())) { | |
| 1116 return uncasted_input; // one unique uncasted input | |
| 1117 } | |
| 1118 | |
| 1119 // Nothing. | |
| 1120 return NULL; | |
| 1121 } | |
| 1122 | |
| 1123 //------------------------------is_x2logic------------------------------------- | |
| 1124 // Check for simple convert-to-boolean pattern | |
| 1125 // If:(C Bool) Region:(IfF IfT) Phi:(Region 0 1) | |
| 1126 // Convert Phi to an ConvIB. | |
| 1127 static Node *is_x2logic( PhaseGVN *phase, PhiNode *phi, int true_path ) { | |
| 1128 assert(true_path !=0, "only diamond shape graph expected"); | |
| 1129 // Convert the true/false index into an expected 0/1 return. | |
| 1130 // Map 2->0 and 1->1. | |
| 1131 int flipped = 2-true_path; | |
| 1132 | |
| 1133 // is_diamond_phi() has guaranteed the correctness of the nodes sequence: | |
| 1134 // phi->region->if_proj->ifnode->bool->cmp | |
| 1135 Node *region = phi->in(0); | |
| 1136 Node *iff = region->in(1)->in(0); | |
| 1137 BoolNode *b = (BoolNode*)iff->in(1); | |
| 1138 const CmpNode *cmp = (CmpNode*)b->in(1); | |
| 1139 | |
| 1140 Node *zero = phi->in(1); | |
| 1141 Node *one = phi->in(2); | |
| 1142 const Type *tzero = phase->type( zero ); | |
| 1143 const Type *tone = phase->type( one ); | |
| 1144 | |
| 1145 // Check for compare vs 0 | |
| 1146 const Type *tcmp = phase->type(cmp->in(2)); | |
| 1147 if( tcmp != TypeInt::ZERO && tcmp != TypePtr::NULL_PTR ) { | |
| 1148 // Allow cmp-vs-1 if the other input is bounded by 0-1 | |
| 1149 if( !(tcmp == TypeInt::ONE && phase->type(cmp->in(1)) == TypeInt::BOOL) ) | |
| 1150 return NULL; | |
| 1151 flipped = 1-flipped; // Test is vs 1 instead of 0! | |
| 1152 } | |
| 1153 | |
| 1154 // Check for setting zero/one opposite expected | |
| 1155 if( tzero == TypeInt::ZERO ) { | |
| 1156 if( tone == TypeInt::ONE ) { | |
| 1157 } else return NULL; | |
| 1158 } else if( tzero == TypeInt::ONE ) { | |
| 1159 if( tone == TypeInt::ZERO ) { | |
| 1160 flipped = 1-flipped; | |
| 1161 } else return NULL; | |
| 1162 } else return NULL; | |
| 1163 | |
| 1164 // Check for boolean test backwards | |
| 1165 if( b->_test._test == BoolTest::ne ) { | |
| 1166 } else if( b->_test._test == BoolTest::eq ) { | |
| 1167 flipped = 1-flipped; | |
| 1168 } else return NULL; | |
| 1169 | |
| 1170 // Build int->bool conversion | |
| 1171 Node *n = new (phase->C, 2) Conv2BNode( cmp->in(1) ); | |
| 1172 if( flipped ) | |
| 1173 n = new (phase->C, 3) XorINode( phase->transform(n), phase->intcon(1) ); | |
| 1174 | |
| 1175 return n; | |
| 1176 } | |
| 1177 | |
| 1178 //------------------------------is_cond_add------------------------------------ | |
| 1179 // Check for simple conditional add pattern: "(P < Q) ? X+Y : X;" | |
| 1180 // To be profitable the control flow has to disappear; there can be no other | |
| 1181 // values merging here. We replace the test-and-branch with: | |
| 1182 // "(sgn(P-Q))&Y) + X". Basically, convert "(P < Q)" into 0 or -1 by | |
| 1183 // moving the carry bit from (P-Q) into a register with 'sbb EAX,EAX'. | |
| 1184 // Then convert Y to 0-or-Y and finally add. | |
| 1185 // This is a key transform for SpecJava _201_compress. | |
| 1186 static Node* is_cond_add(PhaseGVN *phase, PhiNode *phi, int true_path) { | |
| 1187 assert(true_path !=0, "only diamond shape graph expected"); | |
| 1188 | |
| 1189 // is_diamond_phi() has guaranteed the correctness of the nodes sequence: | |
| 1190 // phi->region->if_proj->ifnode->bool->cmp | |
| 1191 RegionNode *region = (RegionNode*)phi->in(0); | |
| 1192 Node *iff = region->in(1)->in(0); | |
| 1193 BoolNode* b = iff->in(1)->as_Bool(); | |
| 1194 const CmpNode *cmp = (CmpNode*)b->in(1); | |
| 1195 | |
| 1196 // Make sure only merging this one phi here | |
| 1197 if (region->has_unique_phi() != phi) return NULL; | |
| 1198 | |
| 1199 // Make sure each arm of the diamond has exactly one output, which we assume | |
| 1200 // is the region. Otherwise, the control flow won't disappear. | |
| 1201 if (region->in(1)->outcnt() != 1) return NULL; | |
| 1202 if (region->in(2)->outcnt() != 1) return NULL; | |
| 1203 | |
| 1204 // Check for "(P < Q)" of type signed int | |
| 1205 if (b->_test._test != BoolTest::lt) return NULL; | |
| 1206 if (cmp->Opcode() != Op_CmpI) return NULL; | |
| 1207 | |
| 1208 Node *p = cmp->in(1); | |
| 1209 Node *q = cmp->in(2); | |
| 1210 Node *n1 = phi->in( true_path); | |
| 1211 Node *n2 = phi->in(3-true_path); | |
| 1212 | |
| 1213 int op = n1->Opcode(); | |
| 1214 if( op != Op_AddI // Need zero as additive identity | |
| 1215 /*&&op != Op_SubI && | |
| 1216 op != Op_AddP && | |
| 1217 op != Op_XorI && | |
| 1218 op != Op_OrI*/ ) | |
| 1219 return NULL; | |
| 1220 | |
| 1221 Node *x = n2; | |
| 1222 Node *y = n1->in(1); | |
| 1223 if( n2 == n1->in(1) ) { | |
| 1224 y = n1->in(2); | |
| 1225 } else if( n2 == n1->in(1) ) { | |
| 1226 } else return NULL; | |
| 1227 | |
| 1228 // Not so profitable if compare and add are constants | |
| 1229 if( q->is_Con() && phase->type(q) != TypeInt::ZERO && y->is_Con() ) | |
| 1230 return NULL; | |
| 1231 | |
| 1232 Node *cmplt = phase->transform( new (phase->C, 3) CmpLTMaskNode(p,q) ); | |
| 1233 Node *j_and = phase->transform( new (phase->C, 3) AndINode(cmplt,y) ); | |
| 1234 return new (phase->C, 3) AddINode(j_and,x); | |
| 1235 } | |
| 1236 | |
| 1237 //------------------------------is_absolute------------------------------------ | |
| 1238 // Check for absolute value. | |
| 1239 static Node* is_absolute( PhaseGVN *phase, PhiNode *phi_root, int true_path) { | |
| 1240 assert(true_path !=0, "only diamond shape graph expected"); | |
| 1241 | |
| 1242 int cmp_zero_idx = 0; // Index of compare input where to look for zero | |
| 1243 int phi_x_idx = 0; // Index of phi input where to find naked x | |
| 1244 | |
| 1245 // ABS ends with the merge of 2 control flow paths. | |
| 1246 // Find the false path from the true path. With only 2 inputs, 3 - x works nicely. | |
| 1247 int false_path = 3 - true_path; | |
| 1248 | |
| 1249 // is_diamond_phi() has guaranteed the correctness of the nodes sequence: | |
| 1250 // phi->region->if_proj->ifnode->bool->cmp | |
| 1251 BoolNode *bol = phi_root->in(0)->in(1)->in(0)->in(1)->as_Bool(); | |
| 1252 | |
| 1253 // Check bool sense | |
| 1254 switch( bol->_test._test ) { | |
| 1255 case BoolTest::lt: cmp_zero_idx = 1; phi_x_idx = true_path; break; | |
| 1256 case BoolTest::le: cmp_zero_idx = 2; phi_x_idx = false_path; break; | |
| 1257 case BoolTest::gt: cmp_zero_idx = 2; phi_x_idx = true_path; break; | |
| 1258 case BoolTest::ge: cmp_zero_idx = 1; phi_x_idx = false_path; break; | |
| 1259 default: return NULL; break; | |
| 1260 } | |
| 1261 | |
| 1262 // Test is next | |
| 1263 Node *cmp = bol->in(1); | |
| 1264 const Type *tzero = NULL; | |
| 1265 switch( cmp->Opcode() ) { | |
| 1266 case Op_CmpF: tzero = TypeF::ZERO; break; // Float ABS | |
| 1267 case Op_CmpD: tzero = TypeD::ZERO; break; // Double ABS | |
| 1268 default: return NULL; | |
| 1269 } | |
| 1270 | |
| 1271 // Find zero input of compare; the other input is being abs'd | |
| 1272 Node *x = NULL; | |
| 1273 bool flip = false; | |
| 1274 if( phase->type(cmp->in(cmp_zero_idx)) == tzero ) { | |
| 1275 x = cmp->in(3 - cmp_zero_idx); | |
| 1276 } else if( phase->type(cmp->in(3 - cmp_zero_idx)) == tzero ) { | |
| 1277 // The test is inverted, we should invert the result... | |
| 1278 x = cmp->in(cmp_zero_idx); | |
| 1279 flip = true; | |
| 1280 } else { | |
| 1281 return NULL; | |
| 1282 } | |
| 1283 | |
| 1284 // Next get the 2 pieces being selected, one is the original value | |
| 1285 // and the other is the negated value. | |
| 1286 if( phi_root->in(phi_x_idx) != x ) return NULL; | |
| 1287 | |
| 1288 // Check other phi input for subtract node | |
| 1289 Node *sub = phi_root->in(3 - phi_x_idx); | |
| 1290 | |
| 1291 // Allow only Sub(0,X) and fail out for all others; Neg is not OK | |
| 1292 if( tzero == TypeF::ZERO ) { | |
| 1293 if( sub->Opcode() != Op_SubF || | |
| 1294 sub->in(2) != x || | |
| 1295 phase->type(sub->in(1)) != tzero ) return NULL; | |
| 1296 x = new (phase->C, 2) AbsFNode(x); | |
| 1297 if (flip) { | |
| 1298 x = new (phase->C, 3) SubFNode(sub->in(1), phase->transform(x)); | |
| 1299 } | |
| 1300 } else { | |
| 1301 if( sub->Opcode() != Op_SubD || | |
| 1302 sub->in(2) != x || | |
| 1303 phase->type(sub->in(1)) != tzero ) return NULL; | |
| 1304 x = new (phase->C, 2) AbsDNode(x); | |
| 1305 if (flip) { | |
| 1306 x = new (phase->C, 3) SubDNode(sub->in(1), phase->transform(x)); | |
| 1307 } | |
| 1308 } | |
| 1309 | |
| 1310 return x; | |
| 1311 } | |
| 1312 | |
| 1313 //------------------------------split_once------------------------------------- | |
| 1314 // Helper for split_flow_path | |
| 1315 static void split_once(PhaseIterGVN *igvn, Node *phi, Node *val, Node *n, Node *newn) { | |
| 1316 igvn->hash_delete(n); // Remove from hash before hacking edges | |
| 1317 | |
| 1318 uint j = 1; | |
| 1319 for( uint i = phi->req()-1; i > 0; i-- ) { | |
| 1320 if( phi->in(i) == val ) { // Found a path with val? | |
| 1321 // Add to NEW Region/Phi, no DU info | |
| 1322 newn->set_req( j++, n->in(i) ); | |
| 1323 // Remove from OLD Region/Phi | |
| 1324 n->del_req(i); | |
| 1325 } | |
| 1326 } | |
| 1327 | |
| 1328 // Register the new node but do not transform it. Cannot transform until the | |
| 1329 // entire Region/Phi conglerate has been hacked as a single huge transform. | |
| 1330 igvn->register_new_node_with_optimizer( newn ); | |
| 1331 // Now I can point to the new node. | |
| 1332 n->add_req(newn); | |
| 1333 igvn->_worklist.push(n); | |
| 1334 } | |
| 1335 | |
| 1336 //------------------------------split_flow_path-------------------------------- | |
| 1337 // Check for merging identical values and split flow paths | |
| 1338 static Node* split_flow_path(PhaseGVN *phase, PhiNode *phi) { | |
| 1339 BasicType bt = phi->type()->basic_type(); | |
| 1340 if( bt == T_ILLEGAL || type2size[bt] <= 0 ) | |
| 1341 return NULL; // Bail out on funny non-value stuff | |
| 1342 if( phi->req() <= 3 ) // Need at least 2 matched inputs and a | |
| 1343 return NULL; // third unequal input to be worth doing | |
| 1344 | |
| 1345 // Scan for a constant | |
| 1346 uint i; | |
| 1347 for( i = 1; i < phi->req()-1; i++ ) { | |
| 1348 Node *n = phi->in(i); | |
| 1349 if( !n ) return NULL; | |
| 1350 if( phase->type(n) == Type::TOP ) return NULL; | |
| 163 | 1351 if( n->Opcode() == Op_ConP || n->Opcode() == Op_ConN ) |
| 0 | 1352 break; |
| 1353 } | |
| 1354 if( i >= phi->req() ) // Only split for constants | |
| 1355 return NULL; | |
| 1356 | |
| 1357 Node *val = phi->in(i); // Constant to split for | |
| 1358 uint hit = 0; // Number of times it occurs | |
| 1359 | |
| 1360 for( ; i < phi->req(); i++ ){ // Count occurances of constant | |
| 1361 Node *n = phi->in(i); | |
| 1362 if( !n ) return NULL; | |
| 1363 if( phase->type(n) == Type::TOP ) return NULL; | |
| 1364 if( phi->in(i) == val ) | |
| 1365 hit++; | |
| 1366 } | |
| 1367 | |
| 1368 if( hit <= 1 || // Make sure we find 2 or more | |
| 1369 hit == phi->req()-1 ) // and not ALL the same value | |
| 1370 return NULL; | |
| 1371 | |
| 1372 // Now start splitting out the flow paths that merge the same value. | |
| 1373 // Split first the RegionNode. | |
| 1374 PhaseIterGVN *igvn = phase->is_IterGVN(); | |
| 1375 Node *r = phi->region(); | |
| 1376 RegionNode *newr = new (phase->C, hit+1) RegionNode(hit+1); | |
| 1377 split_once(igvn, phi, val, r, newr); | |
| 1378 | |
| 1379 // Now split all other Phis than this one | |
| 1380 for (DUIterator_Fast kmax, k = r->fast_outs(kmax); k < kmax; k++) { | |
| 1381 Node* phi2 = r->fast_out(k); | |
| 1382 if( phi2->is_Phi() && phi2->as_Phi() != phi ) { | |
| 1383 PhiNode *newphi = PhiNode::make_blank(newr, phi2); | |
| 1384 split_once(igvn, phi, val, phi2, newphi); | |
| 1385 } | |
| 1386 } | |
| 1387 | |
| 1388 // Clean up this guy | |
| 1389 igvn->hash_delete(phi); | |
| 1390 for( i = phi->req()-1; i > 0; i-- ) { | |
| 1391 if( phi->in(i) == val ) { | |
| 1392 phi->del_req(i); | |
| 1393 } | |
| 1394 } | |
| 1395 phi->add_req(val); | |
| 1396 | |
| 1397 return phi; | |
| 1398 } | |
| 1399 | |
| 1400 //============================================================================= | |
| 1401 //------------------------------simple_data_loop_check------------------------- | |
| 1402 // Try to determing if the phi node in a simple safe/unsafe data loop. | |
| 1403 // Returns: | |
| 1404 // enum LoopSafety { Safe = 0, Unsafe, UnsafeLoop }; | |
| 1405 // Safe - safe case when the phi and it's inputs reference only safe data | |
| 1406 // nodes; | |
| 1407 // Unsafe - the phi and it's inputs reference unsafe data nodes but there | |
| 1408 // is no reference back to the phi - need a graph walk | |
| 1409 // to determine if it is in a loop; | |
| 1410 // UnsafeLoop - unsafe case when the phi references itself directly or through | |
| 1411 // unsafe data node. | |
| 1412 // Note: a safe data node is a node which could/never reference itself during | |
| 1413 // GVN transformations. For now it is Con, Proj, Phi, CastPP, CheckCastPP. | |
| 1414 // I mark Phi nodes as safe node not only because they can reference itself | |
| 1415 // but also to prevent mistaking the fallthrough case inside an outer loop | |
| 1416 // as dead loop when the phi references itselfs through an other phi. | |
| 1417 PhiNode::LoopSafety PhiNode::simple_data_loop_check(Node *in) const { | |
| 1418 // It is unsafe loop if the phi node references itself directly. | |
| 1419 if (in == (Node*)this) | |
| 1420 return UnsafeLoop; // Unsafe loop | |
| 1421 // Unsafe loop if the phi node references itself through an unsafe data node. | |
| 1422 // Exclude cases with null inputs or data nodes which could reference | |
| 1423 // itself (safe for dead loops). | |
| 1424 if (in != NULL && !in->is_dead_loop_safe()) { | |
| 1425 // Check inputs of phi's inputs also. | |
| 1426 // It is much less expensive then full graph walk. | |
| 1427 uint cnt = in->req(); | |
|
126
72f4a668df19
6625997: CastPP, CheckCastPP and Proj nodes are not dead loop safe
kvn
parents:
113
diff
changeset
|
1428 uint i = (in->is_Proj() && !in->is_CFG()) ? 0 : 1; |
|
72f4a668df19
6625997: CastPP, CheckCastPP and Proj nodes are not dead loop safe
kvn
parents:
113
diff
changeset
|
1429 for (; i < cnt; ++i) { |
| 0 | 1430 Node* m = in->in(i); |
| 1431 if (m == (Node*)this) | |
| 1432 return UnsafeLoop; // Unsafe loop | |
| 1433 if (m != NULL && !m->is_dead_loop_safe()) { | |
| 1434 // Check the most common case (about 30% of all cases): | |
| 1435 // phi->Load/Store->AddP->(ConP ConP Con)/(Parm Parm Con). | |
| 1436 Node *m1 = (m->is_AddP() && m->req() > 3) ? m->in(1) : NULL; | |
| 1437 if (m1 == (Node*)this) | |
| 1438 return UnsafeLoop; // Unsafe loop | |
| 1439 if (m1 != NULL && m1 == m->in(2) && | |
| 1440 m1->is_dead_loop_safe() && m->in(3)->is_Con()) { | |
| 1441 continue; // Safe case | |
| 1442 } | |
| 1443 // The phi references an unsafe node - need full analysis. | |
| 1444 return Unsafe; | |
| 1445 } | |
| 1446 } | |
| 1447 } | |
| 1448 return Safe; // Safe case - we can optimize the phi node. | |
| 1449 } | |
| 1450 | |
| 1451 //------------------------------is_unsafe_data_reference----------------------- | |
| 1452 // If phi can be reached through the data input - it is data loop. | |
| 1453 bool PhiNode::is_unsafe_data_reference(Node *in) const { | |
| 1454 assert(req() > 1, ""); | |
| 1455 // First, check simple cases when phi references itself directly or | |
| 1456 // through an other node. | |
| 1457 LoopSafety safety = simple_data_loop_check(in); | |
| 1458 if (safety == UnsafeLoop) | |
| 1459 return true; // phi references itself - unsafe loop | |
| 1460 else if (safety == Safe) | |
| 1461 return false; // Safe case - phi could be replaced with the unique input. | |
| 1462 | |
| 1463 // Unsafe case when we should go through data graph to determine | |
| 1464 // if the phi references itself. | |
| 1465 | |
| 1466 ResourceMark rm; | |
| 1467 | |
| 1468 Arena *a = Thread::current()->resource_area(); | |
| 1469 Node_List nstack(a); | |
| 1470 VectorSet visited(a); | |
| 1471 | |
| 1472 nstack.push(in); // Start with unique input. | |
| 1473 visited.set(in->_idx); | |
| 1474 while (nstack.size() != 0) { | |
| 1475 Node* n = nstack.pop(); | |
| 1476 uint cnt = n->req(); | |
|
126
72f4a668df19
6625997: CastPP, CheckCastPP and Proj nodes are not dead loop safe
kvn
parents:
113
diff
changeset
|
1477 uint i = (n->is_Proj() && !n->is_CFG()) ? 0 : 1; |
|
72f4a668df19
6625997: CastPP, CheckCastPP and Proj nodes are not dead loop safe
kvn
parents:
113
diff
changeset
|
1478 for (; i < cnt; i++) { |
| 0 | 1479 Node* m = n->in(i); |
| 1480 if (m == (Node*)this) { | |
| 1481 return true; // Data loop | |
| 1482 } | |
| 1483 if (m != NULL && !m->is_dead_loop_safe()) { // Only look for unsafe cases. | |
| 1484 if (!visited.test_set(m->_idx)) | |
| 1485 nstack.push(m); | |
| 1486 } | |
| 1487 } | |
| 1488 } | |
| 1489 return false; // The phi is not reachable from its inputs | |
| 1490 } | |
| 1491 | |
| 1492 | |
| 1493 //------------------------------Ideal------------------------------------------ | |
| 1494 // Return a node which is more "ideal" than the current node. Must preserve | |
| 1495 // the CFG, but we can still strip out dead paths. | |
| 1496 Node *PhiNode::Ideal(PhaseGVN *phase, bool can_reshape) { | |
| 1497 // The next should never happen after 6297035 fix. | |
| 1498 if( is_copy() ) // Already degraded to a Copy ? | |
| 1499 return NULL; // No change | |
| 1500 | |
| 1501 Node *r = in(0); // RegionNode | |
| 1502 assert(r->in(0) == NULL || !r->in(0)->is_Root(), "not a specially hidden merge"); | |
| 1503 | |
| 1504 // Note: During parsing, phis are often transformed before their regions. | |
| 1505 // This means we have to use type_or_null to defend against untyped regions. | |
| 1506 if( phase->type_or_null(r) == Type::TOP ) // Dead code? | |
| 1507 return NULL; // No change | |
| 1508 | |
| 1509 Node *top = phase->C->top(); | |
| 1510 | |
| 1511 // The are 2 situations when only one valid phi's input is left | |
| 1512 // (in addition to Region input). | |
| 1513 // One: region is not loop - replace phi with this input. | |
| 1514 // Two: region is loop - replace phi with top since this data path is dead | |
| 1515 // and we need to break the dead data loop. | |
| 1516 Node* progress = NULL; // Record if any progress made | |
| 1517 for( uint j = 1; j < req(); ++j ){ // For all paths in | |
| 1518 // Check unreachable control paths | |
| 1519 Node* rc = r->in(j); | |
| 1520 Node* n = in(j); // Get the input | |
| 1521 if (rc == NULL || phase->type(rc) == Type::TOP) { | |
| 1522 if (n != top) { // Not already top? | |
| 1523 set_req(j, top); // Nuke it down | |
| 1524 progress = this; // Record progress | |
| 1525 } | |
| 1526 } | |
| 1527 } | |
| 1528 | |
| 1529 Node* uin = unique_input(phase); | |
| 1530 if (uin == top) { // Simplest case: no alive inputs. | |
| 1531 if (can_reshape) // IGVN transformation | |
| 1532 return top; | |
| 1533 else | |
| 1534 return NULL; // Identity will return TOP | |
| 1535 } else if (uin != NULL) { | |
| 1536 // Only one not-NULL unique input path is left. | |
| 1537 // Determine if this input is backedge of a loop. | |
| 1538 // (Skip new phis which have no uses and dead regions). | |
| 1539 if( outcnt() > 0 && r->in(0) != NULL ) { | |
| 1540 // First, take the short cut when we know it is a loop and | |
| 1541 // the EntryControl data path is dead. | |
| 1542 assert(!r->is_Loop() || r->req() == 3, "Loop node should have 3 inputs"); | |
| 1543 // Then, check if there is a data loop when phi references itself directly | |
| 1544 // or through other data nodes. | |
| 1545 if( r->is_Loop() && !phase->eqv_uncast(uin, in(LoopNode::EntryControl)) || | |
| 1546 !r->is_Loop() && is_unsafe_data_reference(uin) ) { | |
| 1547 // Break this data loop to avoid creation of a dead loop. | |
| 1548 if (can_reshape) { | |
| 1549 return top; | |
| 1550 } else { | |
| 1551 // We can't return top if we are in Parse phase - cut inputs only | |
| 1552 // let Identity to handle the case. | |
| 1553 replace_edge(uin, top); | |
| 1554 return NULL; | |
| 1555 } | |
| 1556 } | |
| 1557 } | |
| 1558 | |
| 1559 // One unique input. | |
| 1560 debug_only(Node* ident = Identity(phase)); | |
| 1561 // The unique input must eventually be detected by the Identity call. | |
| 1562 #ifdef ASSERT | |
| 1563 if (ident != uin && !ident->is_top()) { | |
| 1564 // print this output before failing assert | |
| 1565 r->dump(3); | |
| 1566 this->dump(3); | |
| 1567 ident->dump(); | |
| 1568 uin->dump(); | |
| 1569 } | |
| 1570 #endif | |
| 1571 assert(ident == uin || ident->is_top(), "Identity must clean this up"); | |
| 1572 return NULL; | |
| 1573 } | |
| 1574 | |
| 1575 | |
| 1576 Node* opt = NULL; | |
| 1577 int true_path = is_diamond_phi(); | |
| 1578 if( true_path != 0 ) { | |
| 1579 // Check for CMove'ing identity. If it would be unsafe, | |
| 1580 // handle it here. In the safe case, let Identity handle it. | |
| 1581 Node* unsafe_id = is_cmove_id(phase, true_path); | |
| 1582 if( unsafe_id != NULL && is_unsafe_data_reference(unsafe_id) ) | |
| 1583 opt = unsafe_id; | |
| 1584 | |
| 1585 // Check for simple convert-to-boolean pattern | |
| 1586 if( opt == NULL ) | |
| 1587 opt = is_x2logic(phase, this, true_path); | |
| 1588 | |
| 1589 // Check for absolute value | |
| 1590 if( opt == NULL ) | |
| 1591 opt = is_absolute(phase, this, true_path); | |
| 1592 | |
| 1593 // Check for conditional add | |
| 1594 if( opt == NULL && can_reshape ) | |
| 1595 opt = is_cond_add(phase, this, true_path); | |
| 1596 | |
| 1597 // These 4 optimizations could subsume the phi: | |
| 1598 // have to check for a dead data loop creation. | |
| 1599 if( opt != NULL ) { | |
| 1600 if( opt == unsafe_id || is_unsafe_data_reference(opt) ) { | |
| 1601 // Found dead loop. | |
| 1602 if( can_reshape ) | |
| 1603 return top; | |
| 1604 // We can't return top if we are in Parse phase - cut inputs only | |
| 1605 // to stop further optimizations for this phi. Identity will return TOP. | |
| 1606 assert(req() == 3, "only diamond merge phi here"); | |
| 1607 set_req(1, top); | |
| 1608 set_req(2, top); | |
| 1609 return NULL; | |
| 1610 } else { | |
| 1611 return opt; | |
| 1612 } | |
| 1613 } | |
| 1614 } | |
| 1615 | |
| 1616 // Check for merging identical values and split flow paths | |
| 1617 if (can_reshape) { | |
| 1618 opt = split_flow_path(phase, this); | |
| 1619 // This optimization only modifies phi - don't need to check for dead loop. | |
| 1620 assert(opt == NULL || phase->eqv(opt, this), "do not elide phi"); | |
| 1621 if (opt != NULL) return opt; | |
| 1622 } | |
| 1623 | |
| 1624 if (in(1) != NULL && in(1)->Opcode() == Op_AddP && can_reshape) { | |
| 1625 // Try to undo Phi of AddP: | |
| 1626 // (Phi (AddP base base y) (AddP base2 base2 y)) | |
| 1627 // becomes: | |
| 1628 // newbase := (Phi base base2) | |
| 1629 // (AddP newbase newbase y) | |
| 1630 // | |
| 1631 // This occurs as a result of unsuccessful split_thru_phi and | |
| 1632 // interferes with taking advantage of addressing modes. See the | |
| 1633 // clone_shift_expressions code in matcher.cpp | |
| 1634 Node* addp = in(1); | |
| 1635 const Type* type = addp->in(AddPNode::Base)->bottom_type(); | |
| 1636 Node* y = addp->in(AddPNode::Offset); | |
| 1637 if (y != NULL && addp->in(AddPNode::Base) == addp->in(AddPNode::Address)) { | |
| 1638 // make sure that all the inputs are similar to the first one, | |
| 1639 // i.e. AddP with base == address and same offset as first AddP | |
| 1640 bool doit = true; | |
| 1641 for (uint i = 2; i < req(); i++) { | |
| 1642 if (in(i) == NULL || | |
| 1643 in(i)->Opcode() != Op_AddP || | |
| 1644 in(i)->in(AddPNode::Base) != in(i)->in(AddPNode::Address) || | |
| 1645 in(i)->in(AddPNode::Offset) != y) { | |
| 1646 doit = false; | |
| 1647 break; | |
| 1648 } | |
| 1649 // Accumulate type for resulting Phi | |
| 1650 type = type->meet(in(i)->in(AddPNode::Base)->bottom_type()); | |
| 1651 } | |
| 1652 Node* base = NULL; | |
| 1653 if (doit) { | |
| 1654 // Check for neighboring AddP nodes in a tree. | |
| 1655 // If they have a base, use that it. | |
| 1656 for (DUIterator_Fast kmax, k = this->fast_outs(kmax); k < kmax; k++) { | |
| 1657 Node* u = this->fast_out(k); | |
| 1658 if (u->is_AddP()) { | |
| 1659 Node* base2 = u->in(AddPNode::Base); | |
| 1660 if (base2 != NULL && !base2->is_top()) { | |
| 1661 if (base == NULL) | |
| 1662 base = base2; | |
| 1663 else if (base != base2) | |
| 1664 { doit = false; break; } | |
| 1665 } | |
| 1666 } | |
| 1667 } | |
| 1668 } | |
| 1669 if (doit) { | |
| 1670 if (base == NULL) { | |
| 1671 base = new (phase->C, in(0)->req()) PhiNode(in(0), type, NULL); | |
| 1672 for (uint i = 1; i < req(); i++) { | |
| 1673 base->init_req(i, in(i)->in(AddPNode::Base)); | |
| 1674 } | |
| 1675 phase->is_IterGVN()->register_new_node_with_optimizer(base); | |
| 1676 } | |
| 1677 return new (phase->C, 4) AddPNode(base, base, y); | |
| 1678 } | |
| 1679 } | |
| 1680 } | |
| 1681 | |
| 1682 // Split phis through memory merges, so that the memory merges will go away. | |
| 1683 // Piggy-back this transformation on the search for a unique input.... | |
| 1684 // It will be as if the merged memory is the unique value of the phi. | |
| 1685 // (Do not attempt this optimization unless parsing is complete. | |
| 1686 // It would make the parser's memory-merge logic sick.) | |
| 1687 // (MergeMemNode is not dead_loop_safe - need to check for dead loop.) | |
| 1688 if (progress == NULL && can_reshape && type() == Type::MEMORY) { | |
| 1689 // see if this phi should be sliced | |
| 1690 uint merge_width = 0; | |
| 1691 bool saw_self = false; | |
| 1692 for( uint i=1; i<req(); ++i ) {// For all paths in | |
| 1693 Node *ii = in(i); | |
| 1694 if (ii->is_MergeMem()) { | |
| 1695 MergeMemNode* n = ii->as_MergeMem(); | |
| 1696 merge_width = MAX2(merge_width, n->req()); | |
| 1697 saw_self = saw_self || phase->eqv(n->base_memory(), this); | |
| 1698 } | |
| 1699 } | |
| 1700 | |
| 1701 // This restriction is temporarily necessary to ensure termination: | |
| 1702 if (!saw_self && adr_type() == TypePtr::BOTTOM) merge_width = 0; | |
| 1703 | |
| 1704 if (merge_width > Compile::AliasIdxRaw) { | |
| 1705 // found at least one non-empty MergeMem | |
| 1706 const TypePtr* at = adr_type(); | |
| 1707 if (at != TypePtr::BOTTOM) { | |
| 1708 // Patch the existing phi to select an input from the merge: | |
| 1709 // Phi:AT1(...MergeMem(m0, m1, m2)...) into | |
| 1710 // Phi:AT1(...m1...) | |
| 1711 int alias_idx = phase->C->get_alias_index(at); | |
| 1712 for (uint i=1; i<req(); ++i) { | |
| 1713 Node *ii = in(i); | |
| 1714 if (ii->is_MergeMem()) { | |
| 1715 MergeMemNode* n = ii->as_MergeMem(); | |
| 1716 // compress paths and change unreachable cycles to TOP | |
| 1717 // If not, we can update the input infinitely along a MergeMem cycle | |
| 1718 // Equivalent code is in MemNode::Ideal_common | |
| 1719 Node *m = phase->transform(n); | |
| 1720 // If tranformed to a MergeMem, get the desired slice | |
| 1721 // Otherwise the returned node represents memory for every slice | |
| 1722 Node *new_mem = (m->is_MergeMem()) ? | |
| 1723 m->as_MergeMem()->memory_at(alias_idx) : m; | |
| 1724 // Update input if it is progress over what we have now | |
| 1725 if (new_mem != ii) { | |
| 1726 set_req(i, new_mem); | |
| 1727 progress = this; | |
| 1728 } | |
| 1729 } | |
| 1730 } | |
| 1731 } else { | |
| 1732 // We know that at least one MergeMem->base_memory() == this | |
| 1733 // (saw_self == true). If all other inputs also references this phi | |
| 1734 // (directly or through data nodes) - it is dead loop. | |
| 1735 bool saw_safe_input = false; | |
| 1736 for (uint j = 1; j < req(); ++j) { | |
| 1737 Node *n = in(j); | |
| 1738 if (n->is_MergeMem() && n->as_MergeMem()->base_memory() == this) | |
| 1739 continue; // skip known cases | |
| 1740 if (!is_unsafe_data_reference(n)) { | |
| 1741 saw_safe_input = true; // found safe input | |
| 1742 break; | |
| 1743 } | |
| 1744 } | |
| 1745 if (!saw_safe_input) | |
| 1746 return top; // all inputs reference back to this phi - dead loop | |
| 1747 | |
| 1748 // Phi(...MergeMem(m0, m1:AT1, m2:AT2)...) into | |
| 1749 // MergeMem(Phi(...m0...), Phi:AT1(...m1...), Phi:AT2(...m2...)) | |
| 1750 PhaseIterGVN *igvn = phase->is_IterGVN(); | |
| 1751 Node* hook = new (phase->C, 1) Node(1); | |
| 1752 PhiNode* new_base = (PhiNode*) clone(); | |
| 1753 // Must eagerly register phis, since they participate in loops. | |
| 1754 if (igvn) { | |
| 1755 igvn->register_new_node_with_optimizer(new_base); | |
| 1756 hook->add_req(new_base); | |
| 1757 } | |
| 1758 MergeMemNode* result = MergeMemNode::make(phase->C, new_base); | |
| 1759 for (uint i = 1; i < req(); ++i) { | |
| 1760 Node *ii = in(i); | |
| 1761 if (ii->is_MergeMem()) { | |
| 1762 MergeMemNode* n = ii->as_MergeMem(); | |
| 1763 for (MergeMemStream mms(result, n); mms.next_non_empty2(); ) { | |
| 1764 // If we have not seen this slice yet, make a phi for it. | |
| 1765 bool made_new_phi = false; | |
| 1766 if (mms.is_empty()) { | |
| 1767 Node* new_phi = new_base->slice_memory(mms.adr_type(phase->C)); | |
| 1768 made_new_phi = true; | |
| 1769 if (igvn) { | |
| 1770 igvn->register_new_node_with_optimizer(new_phi); | |
| 1771 hook->add_req(new_phi); | |
| 1772 } | |
| 1773 mms.set_memory(new_phi); | |
| 1774 } | |
| 1775 Node* phi = mms.memory(); | |
| 1776 assert(made_new_phi || phi->in(i) == n, "replace the i-th merge by a slice"); | |
| 1777 phi->set_req(i, mms.memory2()); | |
| 1778 } | |
| 1779 } | |
| 1780 } | |
| 1781 // Distribute all self-loops. | |
| 1782 { // (Extra braces to hide mms.) | |
| 1783 for (MergeMemStream mms(result); mms.next_non_empty(); ) { | |
| 1784 Node* phi = mms.memory(); | |
| 1785 for (uint i = 1; i < req(); ++i) { | |
| 1786 if (phi->in(i) == this) phi->set_req(i, phi); | |
| 1787 } | |
| 1788 } | |
| 1789 } | |
| 1790 // now transform the new nodes, and return the mergemem | |
| 1791 for (MergeMemStream mms(result); mms.next_non_empty(); ) { | |
| 1792 Node* phi = mms.memory(); | |
| 1793 mms.set_memory(phase->transform(phi)); | |
| 1794 } | |
| 1795 if (igvn) { // Unhook. | |
| 1796 igvn->hash_delete(hook); | |
| 1797 for (uint i = 1; i < hook->req(); i++) { | |
| 1798 hook->set_req(i, NULL); | |
| 1799 } | |
| 1800 } | |
| 1801 // Replace self with the result. | |
| 1802 return result; | |
| 1803 } | |
| 1804 } | |
|
74
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
1805 // |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
1806 // Other optimizations on the memory chain |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
1807 // |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
1808 const TypePtr* at = adr_type(); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
1809 for( uint i=1; i<req(); ++i ) {// For all paths in |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
1810 Node *ii = in(i); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
1811 Node *new_in = MemNode::optimize_memory_chain(ii, at, phase); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
1812 if (ii != new_in ) { |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
1813 set_req(i, new_in); |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
1814 progress = this; |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
1815 } |
|
2a9af0b9cb1c
6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents:
0
diff
changeset
|
1816 } |
| 0 | 1817 } |
| 1818 | |
| 1819 return progress; // Return any progress | |
| 1820 } | |
| 1821 | |
| 1822 //------------------------------out_RegMask------------------------------------ | |
| 1823 const RegMask &PhiNode::in_RegMask(uint i) const { | |
| 1824 return i ? out_RegMask() : RegMask::Empty; | |
| 1825 } | |
| 1826 | |
| 1827 const RegMask &PhiNode::out_RegMask() const { | |
| 1828 uint ideal_reg = Matcher::base2reg[_type->base()]; | |
| 1829 assert( ideal_reg != Node::NotAMachineReg, "invalid type at Phi" ); | |
| 1830 if( ideal_reg == 0 ) return RegMask::Empty; | |
| 1831 return *(Compile::current()->matcher()->idealreg2spillmask[ideal_reg]); | |
| 1832 } | |
| 1833 | |
| 1834 #ifndef PRODUCT | |
| 1835 void PhiNode::dump_spec(outputStream *st) const { | |
| 1836 TypeNode::dump_spec(st); | |
| 1837 if (in(0) != NULL && | |
| 1838 in(0)->is_CountedLoop() && | |
| 1839 in(0)->as_CountedLoop()->phi() == this) { | |
| 1840 st->print(" #tripcount"); | |
| 1841 } | |
| 1842 } | |
| 1843 #endif | |
| 1844 | |
| 1845 | |
| 1846 //============================================================================= | |
| 1847 const Type *GotoNode::Value( PhaseTransform *phase ) const { | |
| 1848 // If the input is reachable, then we are executed. | |
| 1849 // If the input is not reachable, then we are not executed. | |
| 1850 return phase->type(in(0)); | |
| 1851 } | |
| 1852 | |
| 1853 Node *GotoNode::Identity( PhaseTransform *phase ) { | |
| 1854 return in(0); // Simple copy of incoming control | |
| 1855 } | |
| 1856 | |
| 1857 const RegMask &GotoNode::out_RegMask() const { | |
| 1858 return RegMask::Empty; | |
| 1859 } | |
| 1860 | |
| 1861 //============================================================================= | |
| 1862 const RegMask &JumpNode::out_RegMask() const { | |
| 1863 return RegMask::Empty; | |
| 1864 } | |
| 1865 | |
| 1866 //============================================================================= | |
| 1867 const RegMask &JProjNode::out_RegMask() const { | |
| 1868 return RegMask::Empty; | |
| 1869 } | |
| 1870 | |
| 1871 //============================================================================= | |
| 1872 const RegMask &CProjNode::out_RegMask() const { | |
| 1873 return RegMask::Empty; | |
| 1874 } | |
| 1875 | |
| 1876 | |
| 1877 | |
| 1878 //============================================================================= | |
| 1879 | |
| 1880 uint PCTableNode::hash() const { return Node::hash() + _size; } | |
| 1881 uint PCTableNode::cmp( const Node &n ) const | |
| 1882 { return _size == ((PCTableNode&)n)._size; } | |
| 1883 | |
| 1884 const Type *PCTableNode::bottom_type() const { | |
| 1885 const Type** f = TypeTuple::fields(_size); | |
| 1886 for( uint i = 0; i < _size; i++ ) f[i] = Type::CONTROL; | |
| 1887 return TypeTuple::make(_size, f); | |
| 1888 } | |
| 1889 | |
| 1890 //------------------------------Value------------------------------------------ | |
| 1891 // Compute the type of the PCTableNode. If reachable it is a tuple of | |
| 1892 // Control, otherwise the table targets are not reachable | |
| 1893 const Type *PCTableNode::Value( PhaseTransform *phase ) const { | |
| 1894 if( phase->type(in(0)) == Type::CONTROL ) | |
| 1895 return bottom_type(); | |
| 1896 return Type::TOP; // All paths dead? Then so are we | |
| 1897 } | |
| 1898 | |
| 1899 //------------------------------Ideal------------------------------------------ | |
| 1900 // Return a node which is more "ideal" than the current node. Strip out | |
| 1901 // control copies | |
| 1902 Node *PCTableNode::Ideal(PhaseGVN *phase, bool can_reshape) { | |
| 1903 return remove_dead_region(phase, can_reshape) ? this : NULL; | |
| 1904 } | |
| 1905 | |
| 1906 //============================================================================= | |
| 1907 uint JumpProjNode::hash() const { | |
| 1908 return Node::hash() + _dest_bci; | |
| 1909 } | |
| 1910 | |
| 1911 uint JumpProjNode::cmp( const Node &n ) const { | |
| 1912 return ProjNode::cmp(n) && | |
| 1913 _dest_bci == ((JumpProjNode&)n)._dest_bci; | |
| 1914 } | |
| 1915 | |
| 1916 #ifndef PRODUCT | |
| 1917 void JumpProjNode::dump_spec(outputStream *st) const { | |
| 1918 ProjNode::dump_spec(st); | |
| 1919 st->print("@bci %d ",_dest_bci); | |
| 1920 } | |
| 1921 #endif | |
| 1922 | |
| 1923 //============================================================================= | |
| 1924 //------------------------------Value------------------------------------------ | |
| 1925 // Check for being unreachable, or for coming from a Rethrow. Rethrow's cannot | |
| 1926 // have the default "fall_through_index" path. | |
| 1927 const Type *CatchNode::Value( PhaseTransform *phase ) const { | |
| 1928 // Unreachable? Then so are all paths from here. | |
| 1929 if( phase->type(in(0)) == Type::TOP ) return Type::TOP; | |
| 1930 // First assume all paths are reachable | |
| 1931 const Type** f = TypeTuple::fields(_size); | |
| 1932 for( uint i = 0; i < _size; i++ ) f[i] = Type::CONTROL; | |
| 1933 // Identify cases that will always throw an exception | |
| 1934 // () rethrow call | |
| 1935 // () virtual or interface call with NULL receiver | |
| 1936 // () call is a check cast with incompatible arguments | |
| 1937 if( in(1)->is_Proj() ) { | |
| 1938 Node *i10 = in(1)->in(0); | |
| 1939 if( i10->is_Call() ) { | |
| 1940 CallNode *call = i10->as_Call(); | |
| 1941 // Rethrows always throw exceptions, never return | |
| 1942 if (call->entry_point() == OptoRuntime::rethrow_stub()) { | |
| 1943 f[CatchProjNode::fall_through_index] = Type::TOP; | |
| 1944 } else if( call->req() > TypeFunc::Parms ) { | |
| 1945 const Type *arg0 = phase->type( call->in(TypeFunc::Parms) ); | |
| 1946 // Check for null reciever to virtual or interface calls | |
| 1947 if( call->is_CallDynamicJava() && | |
| 1948 arg0->higher_equal(TypePtr::NULL_PTR) ) { | |
| 1949 f[CatchProjNode::fall_through_index] = Type::TOP; | |
| 1950 } | |
| 1951 } // End of if not a runtime stub | |
| 1952 } // End of if have call above me | |
| 1953 } // End of slot 1 is not a projection | |
| 1954 return TypeTuple::make(_size, f); | |
| 1955 } | |
| 1956 | |
| 1957 //============================================================================= | |
| 1958 uint CatchProjNode::hash() const { | |
| 1959 return Node::hash() + _handler_bci; | |
| 1960 } | |
| 1961 | |
| 1962 | |
| 1963 uint CatchProjNode::cmp( const Node &n ) const { | |
| 1964 return ProjNode::cmp(n) && | |
| 1965 _handler_bci == ((CatchProjNode&)n)._handler_bci; | |
| 1966 } | |
| 1967 | |
| 1968 | |
| 1969 //------------------------------Identity--------------------------------------- | |
| 1970 // If only 1 target is possible, choose it if it is the main control | |
| 1971 Node *CatchProjNode::Identity( PhaseTransform *phase ) { | |
| 1972 // If my value is control and no other value is, then treat as ID | |
| 1973 const TypeTuple *t = phase->type(in(0))->is_tuple(); | |
| 1974 if (t->field_at(_con) != Type::CONTROL) return this; | |
| 1975 // If we remove the last CatchProj and elide the Catch/CatchProj, then we | |
| 1976 // also remove any exception table entry. Thus we must know the call | |
| 1977 // feeding the Catch will not really throw an exception. This is ok for | |
| 1978 // the main fall-thru control (happens when we know a call can never throw | |
| 1979 // an exception) or for "rethrow", because a further optimnization will | |
| 1980 // yank the rethrow (happens when we inline a function that can throw an | |
| 1981 // exception and the caller has no handler). Not legal, e.g., for passing | |
| 1982 // a NULL receiver to a v-call, or passing bad types to a slow-check-cast. | |
| 1983 // These cases MUST throw an exception via the runtime system, so the VM | |
| 1984 // will be looking for a table entry. | |
| 1985 Node *proj = in(0)->in(1); // Expect a proj feeding CatchNode | |
| 1986 CallNode *call; | |
| 1987 if (_con != TypeFunc::Control && // Bail out if not the main control. | |
| 1988 !(proj->is_Proj() && // AND NOT a rethrow | |
| 1989 proj->in(0)->is_Call() && | |
| 1990 (call = proj->in(0)->as_Call()) && | |
| 1991 call->entry_point() == OptoRuntime::rethrow_stub())) | |
| 1992 return this; | |
| 1993 | |
| 1994 // Search for any other path being control | |
| 1995 for (uint i = 0; i < t->cnt(); i++) { | |
| 1996 if (i != _con && t->field_at(i) == Type::CONTROL) | |
| 1997 return this; | |
| 1998 } | |
| 1999 // Only my path is possible; I am identity on control to the jump | |
| 2000 return in(0)->in(0); | |
| 2001 } | |
| 2002 | |
| 2003 | |
| 2004 #ifndef PRODUCT | |
| 2005 void CatchProjNode::dump_spec(outputStream *st) const { | |
| 2006 ProjNode::dump_spec(st); | |
| 2007 st->print("@bci %d ",_handler_bci); | |
| 2008 } | |
| 2009 #endif | |
| 2010 | |
| 2011 //============================================================================= | |
| 2012 //------------------------------Identity--------------------------------------- | |
| 2013 // Check for CreateEx being Identity. | |
| 2014 Node *CreateExNode::Identity( PhaseTransform *phase ) { | |
| 2015 if( phase->type(in(1)) == Type::TOP ) return in(1); | |
| 2016 if( phase->type(in(0)) == Type::TOP ) return in(0); | |
| 2017 // We only come from CatchProj, unless the CatchProj goes away. | |
| 2018 // If the CatchProj is optimized away, then we just carry the | |
| 2019 // exception oop through. | |
| 2020 CallNode *call = in(1)->in(0)->as_Call(); | |
| 2021 | |
| 2022 return ( in(0)->is_CatchProj() && in(0)->in(0)->in(1) == in(1) ) | |
| 2023 ? this | |
| 2024 : call->in(TypeFunc::Parms); | |
| 2025 } | |
| 2026 | |
| 2027 //============================================================================= | |
| 127 | 2028 //------------------------------Value------------------------------------------ |
| 2029 // Check for being unreachable. | |
| 2030 const Type *NeverBranchNode::Value( PhaseTransform *phase ) const { | |
| 2031 if (!in(0) || in(0)->is_top()) return Type::TOP; | |
| 2032 return bottom_type(); | |
| 2033 } | |
| 2034 | |
| 2035 //------------------------------Ideal------------------------------------------ | |
| 2036 // Check for no longer being part of a loop | |
| 2037 Node *NeverBranchNode::Ideal(PhaseGVN *phase, bool can_reshape) { | |
| 2038 if (can_reshape && !in(0)->is_Loop()) { | |
| 2039 // Dead code elimination can sometimes delete this projection so | |
| 2040 // if it's not there, there's nothing to do. | |
| 2041 Node* fallthru = proj_out(0); | |
| 2042 if (fallthru != NULL) { | |
| 2043 phase->is_IterGVN()->subsume_node(fallthru, in(0)); | |
| 2044 } | |
| 2045 return phase->C->top(); | |
| 2046 } | |
| 2047 return NULL; | |
| 2048 } | |
| 2049 | |
| 0 | 2050 #ifndef PRODUCT |
| 2051 void NeverBranchNode::format( PhaseRegAlloc *ra_, outputStream *st) const { | |
| 2052 st->print("%s", Name()); | |
| 2053 } | |
| 2054 #endif |