1 /* 2 * Copyright (c) 2006, 2012, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "memory/allocation.inline.hpp" 27 #include "opto/connode.hpp" 28 #include "opto/convertnode.hpp" 29 #include "opto/loopnode.hpp" 30 #include "opto/opaquenode.hpp" 31 #include "opto/rootnode.hpp" 32 33 //================= Loop Unswitching ===================== 34 // 35 // orig: transformed: 36 // if (invariant-test) then 37 // predicate predicate 38 // loop loop 39 // stmt1 stmt1 40 // if (invariant-test) then stmt2 41 // stmt2 stmt4 42 // else endloop 43 // stmt3 else 44 // endif predicate [clone] 45 // stmt4 loop [clone] 46 // endloop stmt1 [clone] 47 // stmt3 48 // stmt4 [clone] 49 // endloop 50 // endif 51 // 52 // Note: the "else" clause may be empty 53 54 //------------------------------policy_unswitching----------------------------- 55 // Return TRUE or FALSE if the loop should be unswitched 56 // (ie. clone loop with an invariant test that does not exit the loop) 57 bool IdealLoopTree::policy_unswitching( PhaseIdealLoop *phase ) const { 58 if( !LoopUnswitching ) { 59 return false; 60 } 61 if (!_head->is_Loop()) { 62 return false; 63 } 64 65 // check for vectorized loops, any unswitching was already applied 66 if (_head->is_CountedLoop() && _head->as_CountedLoop()->do_unroll_only()) { 67 return false; 68 } 69 70 int nodes_left = phase->C->max_node_limit() - phase->C->live_nodes(); 71 if ((int)(2 * _body.size()) > nodes_left) { 72 return false; // Too speculative if running low on nodes. 73 } 74 LoopNode* head = _head->as_Loop(); 75 if (head->unswitch_count() + 1 > head->unswitch_max()) { 76 return false; 77 } 78 return phase->find_unswitching_candidate(this) != NULL; 79 } 80 81 //------------------------------find_unswitching_candidate----------------------------- 82 // Find candidate "if" for unswitching 83 IfNode* PhaseIdealLoop::find_unswitching_candidate(const IdealLoopTree *loop) const { 84 85 // Find first invariant test that doesn't exit the loop 86 LoopNode *head = loop->_head->as_Loop(); 87 IfNode* unswitch_iff = NULL; 88 Node* n = head->in(LoopNode::LoopBackControl); 89 while (n != head) { 90 Node* n_dom = idom(n); 91 if (n->is_Region()) { 92 if (n_dom->is_If()) { 93 IfNode* iff = n_dom->as_If(); 94 if (iff->in(1)->is_Bool()) { 95 BoolNode* bol = iff->in(1)->as_Bool(); 96 if (bol->in(1)->is_Cmp()) { 97 // If condition is invariant and not a loop exit, 98 // then found reason to unswitch. 99 if (loop->is_invariant(bol) && !loop->is_loop_exit(iff)) { 100 unswitch_iff = iff; 101 } 102 } 103 } 104 } 105 } 106 n = n_dom; 107 } 108 return unswitch_iff; 109 } 110 111 //------------------------------do_unswitching----------------------------- 112 // Clone loop with an invariant test (that does not exit) and 113 // insert a clone of the test that selects which version to 114 // execute. 115 void PhaseIdealLoop::do_unswitching (IdealLoopTree *loop, Node_List &old_new) { 116 117 // Find first invariant test that doesn't exit the loop 118 LoopNode *head = loop->_head->as_Loop(); 119 120 IfNode* unswitch_iff = find_unswitching_candidate((const IdealLoopTree *)loop); 121 assert(unswitch_iff != NULL, "should be at least one"); 122 123 #ifndef PRODUCT 124 if (TraceLoopOpts) { 125 tty->print("Unswitch %d ", head->unswitch_count()+1); 126 loop->dump_head(); 127 } 128 #endif 129 130 // Need to revert back to normal loop 131 if (head->is_CountedLoop() && !head->as_CountedLoop()->is_normal_loop()) { 132 head->as_CountedLoop()->set_normal_loop(); 133 } 134 135 ProjNode* proj_true = create_slow_version_of_loop(loop, old_new, unswitch_iff->Opcode(), CloneIncludesStripMined); 136 137 #ifdef ASSERT 138 Node* uniqc = proj_true->unique_ctrl_out(); 139 Node* entry = head->skip_strip_mined()->in(LoopNode::EntryControl); 140 Node* predicate = find_predicate(entry); 141 if (predicate != NULL && UseLoopPredicate) { 142 // We may have two predicates, find first. 143 entry = find_predicate(entry->in(0)->in(0)); 144 if (entry != NULL) predicate = entry; 145 } 146 if (predicate != NULL) predicate = predicate->in(0); 147 assert(proj_true->is_IfTrue() && 148 (predicate == NULL && uniqc == head && !head->is_strip_mined() || 149 predicate == NULL && uniqc == head->in(LoopNode::EntryControl) && head->is_strip_mined() || 150 predicate != NULL && uniqc == predicate), "by construction"); 151 #endif 152 // Increment unswitch count 153 LoopNode* head_clone = old_new[head->_idx]->as_Loop(); 154 int nct = head->unswitch_count() + 1; 155 head->set_unswitch_count(nct); 156 head_clone->set_unswitch_count(nct); 157 158 // Add test to new "if" outside of loop 159 IfNode* invar_iff = proj_true->in(0)->as_If(); 160 Node* invar_iff_c = invar_iff->in(0); 161 BoolNode* bol = unswitch_iff->in(1)->as_Bool(); 162 invar_iff->set_req(1, bol); 163 invar_iff->_prob = unswitch_iff->_prob; 164 165 ProjNode* proj_false = invar_iff->proj_out(0)->as_Proj(); 166 167 // Hoist invariant casts out of each loop to the appropriate 168 // control projection. 169 170 Node_List worklist; 171 172 for (DUIterator_Fast imax, i = unswitch_iff->fast_outs(imax); i < imax; i++) { 173 ProjNode* proj= unswitch_iff->fast_out(i)->as_Proj(); 174 // Copy to a worklist for easier manipulation 175 for (DUIterator_Fast jmax, j = proj->fast_outs(jmax); j < jmax; j++) { 176 Node* use = proj->fast_out(j); 177 if (use->Opcode() == Op_CheckCastPP && loop->is_invariant(use->in(1))) { 178 worklist.push(use); 179 } 180 } 181 ProjNode* invar_proj = invar_iff->proj_out(proj->_con)->as_Proj(); 182 while (worklist.size() > 0) { 183 Node* use = worklist.pop(); 184 Node* nuse = use->clone(); 185 nuse->set_req(0, invar_proj); 186 _igvn.replace_input_of(use, 1, nuse); 187 register_new_node(nuse, invar_proj); 188 // Same for the clone 189 Node* use_clone = old_new[use->_idx]; 190 _igvn.replace_input_of(use_clone, 1, nuse); 191 } 192 } 193 194 // Hardwire the control paths in the loops into if(true) and if(false) 195 _igvn.rehash_node_delayed(unswitch_iff); 196 short_circuit_if(unswitch_iff, proj_true); 197 198 IfNode* unswitch_iff_clone = old_new[unswitch_iff->_idx]->as_If(); 199 _igvn.rehash_node_delayed(unswitch_iff_clone); 200 short_circuit_if(unswitch_iff_clone, proj_false); 201 202 // Reoptimize loops 203 loop->record_for_igvn(); 204 for(int i = loop->_body.size() - 1; i >= 0 ; i--) { 205 Node *n = loop->_body[i]; 206 Node *n_clone = old_new[n->_idx]; 207 _igvn._worklist.push(n_clone); 208 } 209 210 #ifndef PRODUCT 211 if (TraceLoopUnswitching) { 212 tty->print_cr("Loop unswitching orig: %d @ %d new: %d @ %d", 213 head->_idx, unswitch_iff->_idx, 214 old_new[head->_idx]->_idx, unswitch_iff_clone->_idx); 215 } 216 #endif 217 218 C->set_major_progress(); 219 } 220 221 //-------------------------create_slow_version_of_loop------------------------ 222 // Create a slow version of the loop by cloning the loop 223 // and inserting an if to select fast-slow versions. 224 // Return control projection of the entry to the fast version. 225 ProjNode* PhaseIdealLoop::create_slow_version_of_loop(IdealLoopTree *loop, 226 Node_List &old_new, 227 int opcode, 228 CloneLoopMode mode) { 229 LoopNode* head = loop->_head->as_Loop(); 230 bool counted_loop = head->is_CountedLoop(); 231 Node* entry = head->skip_strip_mined()->in(LoopNode::EntryControl); 232 _igvn.rehash_node_delayed(entry); 233 IdealLoopTree* outer_loop = loop->_parent; 234 235 head->verify_strip_mined(1); 236 237 Node *cont = _igvn.intcon(1); 238 set_ctrl(cont, C->root()); 239 Node* opq = new Opaque1Node(C, cont); 240 register_node(opq, outer_loop, entry, dom_depth(entry)); 241 Node *bol = new Conv2BNode(opq); 242 register_node(bol, outer_loop, entry, dom_depth(entry)); 243 IfNode* iff = (opcode == Op_RangeCheck) ? new RangeCheckNode(entry, bol, PROB_MAX, COUNT_UNKNOWN) : 244 new IfNode(entry, bol, PROB_MAX, COUNT_UNKNOWN); 245 register_node(iff, outer_loop, entry, dom_depth(entry)); 246 ProjNode* iffast = new IfTrueNode(iff); 247 register_node(iffast, outer_loop, iff, dom_depth(iff)); 248 ProjNode* ifslow = new IfFalseNode(iff); 249 register_node(ifslow, outer_loop, iff, dom_depth(iff)); 250 251 // Clone the loop body. The clone becomes the fast loop. The 252 // original pre-header will (illegally) have 3 control users 253 // (old & new loops & new if). 254 clone_loop(loop, old_new, dom_depth(head->skip_strip_mined()), mode, iff); 255 assert(old_new[head->_idx]->is_Loop(), "" ); 256 257 // Fast (true) control 258 Node* iffast_pred = clone_loop_predicates(entry, iffast, !counted_loop); 259 260 // Slow (false) control 261 Node* ifslow_pred = clone_loop_predicates(entry, ifslow, !counted_loop); 262 263 Node* l = head->skip_strip_mined(); 264 _igvn.replace_input_of(l, LoopNode::EntryControl, iffast_pred); 265 set_idom(l, iffast_pred, dom_depth(l)); 266 LoopNode* slow_l = old_new[head->_idx]->as_Loop()->skip_strip_mined(); 267 _igvn.replace_input_of(slow_l, LoopNode::EntryControl, ifslow_pred); 268 set_idom(slow_l, ifslow_pred, dom_depth(l)); 269 270 recompute_dom_depth(); 271 272 return iffast; 273 } 274 275 LoopNode* PhaseIdealLoop::create_reserve_version_of_loop(IdealLoopTree *loop, CountedLoopReserveKit* lk) { 276 Node_List old_new; 277 LoopNode* head = loop->_head->as_Loop(); 278 bool counted_loop = head->is_CountedLoop(); 279 Node* entry = head->skip_strip_mined()->in(LoopNode::EntryControl); 280 _igvn.rehash_node_delayed(entry); 281 IdealLoopTree* outer_loop = head->is_strip_mined() ? loop->_parent->_parent : loop->_parent; 282 283 ConINode* const_1 = _igvn.intcon(1); 284 set_ctrl(const_1, C->root()); 285 IfNode* iff = new IfNode(entry, const_1, PROB_MAX, COUNT_UNKNOWN); 286 register_node(iff, outer_loop, entry, dom_depth(entry)); 287 ProjNode* iffast = new IfTrueNode(iff); 288 register_node(iffast, outer_loop, iff, dom_depth(iff)); 289 ProjNode* ifslow = new IfFalseNode(iff); 290 register_node(ifslow, outer_loop, iff, dom_depth(iff)); 291 292 // Clone the loop body. The clone becomes the fast loop. The 293 // original pre-header will (illegally) have 3 control users 294 // (old & new loops & new if). 295 clone_loop(loop, old_new, dom_depth(head), CloneIncludesStripMined, iff); 296 assert(old_new[head->_idx]->is_Loop(), "" ); 297 298 LoopNode* slow_head = old_new[head->_idx]->as_Loop(); 299 300 #ifndef PRODUCT 301 if (TraceLoopOpts) { 302 tty->print_cr("PhaseIdealLoop::create_reserve_version_of_loop:"); 303 tty->print("\t iff = %d, ", iff->_idx); iff->dump(); 304 tty->print("\t iffast = %d, ", iffast->_idx); iffast->dump(); 305 tty->print("\t ifslow = %d, ", ifslow->_idx); ifslow->dump(); 306 tty->print("\t before replace_input_of: head = %d, ", head->_idx); head->dump(); 307 tty->print("\t before replace_input_of: slow_head = %d, ", slow_head->_idx); slow_head->dump(); 308 } 309 #endif 310 311 // Fast (true) control 312 _igvn.replace_input_of(head->skip_strip_mined(), LoopNode::EntryControl, iffast); 313 // Slow (false) control 314 _igvn.replace_input_of(slow_head->skip_strip_mined(), LoopNode::EntryControl, ifslow); 315 316 recompute_dom_depth(); 317 318 lk->set_iff(iff); 319 320 #ifndef PRODUCT 321 if (TraceLoopOpts ) { 322 tty->print("\t after replace_input_of: head = %d, ", head->_idx); head->dump(); 323 tty->print("\t after replace_input_of: slow_head = %d, ", slow_head->_idx); slow_head->dump(); 324 } 325 #endif 326 327 return slow_head->as_Loop(); 328 } 329 330 CountedLoopReserveKit::CountedLoopReserveKit(PhaseIdealLoop* phase, IdealLoopTree *loop, bool active = true) : 331 _phase(phase), 332 _lpt(loop), 333 _lp(NULL), 334 _iff(NULL), 335 _lp_reserved(NULL), 336 _has_reserved(false), 337 _use_new(false), 338 _active(active) 339 { 340 create_reserve(); 341 }; 342 343 CountedLoopReserveKit::~CountedLoopReserveKit() { 344 if (!_active) { 345 return; 346 } 347 348 if (_has_reserved && !_use_new) { 349 // intcon(0)->iff-node reverts CF to the reserved copy 350 ConINode* const_0 = _phase->_igvn.intcon(0); 351 _phase->set_ctrl(const_0, _phase->C->root()); 352 _iff->set_req(1, const_0); 353 354 #ifndef PRODUCT 355 if (TraceLoopOpts) { 356 tty->print_cr("CountedLoopReserveKit::~CountedLoopReserveKit()"); 357 tty->print("\t discard loop %d and revert to the reserved loop clone %d: ", _lp->_idx, _lp_reserved->_idx); 358 _lp_reserved->dump(); 359 } 360 #endif 361 } 362 } 363 364 bool CountedLoopReserveKit::create_reserve() { 365 if (!_active) { 366 return false; 367 } 368 369 if(!_lpt->_head->is_CountedLoop()) { 370 if (TraceLoopOpts) { 371 tty->print_cr("CountedLoopReserveKit::create_reserve: %d not counted loop", _lpt->_head->_idx); 372 } 373 return false; 374 } 375 CountedLoopNode *cl = _lpt->_head->as_CountedLoop(); 376 if (!cl->is_valid_counted_loop()) { 377 if (TraceLoopOpts) { 378 tty->print_cr("CountedLoopReserveKit::create_reserve: %d not valid counted loop", cl->_idx); 379 } 380 return false; // skip malformed counted loop 381 } 382 if (!cl->is_main_loop()) { 383 bool loop_not_canonical = true; 384 if (cl->is_post_loop() && (cl->slp_max_unroll() > 0)) { 385 loop_not_canonical = false; 386 } 387 // only reject some loop forms 388 if (loop_not_canonical) { 389 if (TraceLoopOpts) { 390 tty->print_cr("CountedLoopReserveKit::create_reserve: %d not canonical loop", cl->_idx); 391 } 392 return false; // skip normal, pre, and post (conditionally) loops 393 } 394 } 395 396 _lp = _lpt->_head->as_Loop(); 397 _lp_reserved = _phase->create_reserve_version_of_loop(_lpt, this); 398 399 if (!_lp_reserved->is_CountedLoop()) { 400 return false; 401 } 402 403 Node* ifslow_pred = _lp_reserved->skip_strip_mined()->in(LoopNode::EntryControl); 404 405 if (!ifslow_pred->is_IfFalse()) { 406 return false; 407 } 408 409 Node* iff = ifslow_pred->in(0); 410 if (!iff->is_If() || iff != _iff) { 411 return false; 412 } 413 414 if (iff->in(1)->Opcode() != Op_ConI) { 415 return false; 416 } 417 418 return _has_reserved = true; 419 }