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