53 return iff->raw_out(0);
54 if( !is_member(phase->get_loop( iff->raw_out(1) )) )
55 return iff->raw_out(1);
56 return NULL;
57 }
58
59
60 //=============================================================================
61
62
63 //------------------------------record_for_igvn----------------------------
64 // Put loop body on igvn work list
65 void IdealLoopTree::record_for_igvn() {
66 for( uint i = 0; i < _body.size(); i++ ) {
67 Node *n = _body.at(i);
68 _phase->_igvn._worklist.push(n);
69 }
70 // put body of outer strip mined loop on igvn work list as well
71 if (_head->is_CountedLoop() && _head->as_Loop()->is_strip_mined()) {
72 CountedLoopNode* l = _head->as_CountedLoop();
73 _phase->_igvn._worklist.push(l->outer_loop());
74 _phase->_igvn._worklist.push(l->outer_loop_tail());
75 _phase->_igvn._worklist.push(l->outer_loop_end());
76 _phase->_igvn._worklist.push(l->outer_safepoint());
77 Node* cle_out = _head->as_CountedLoop()->loopexit()->proj_out(false);
78 _phase->_igvn._worklist.push(cle_out);
79 }
80 }
81
82 //------------------------------compute_exact_trip_count-----------------------
83 // Compute loop trip count if possible. Do not recalculate trip count for
84 // split loops (pre-main-post) which have their limits and inits behind Opaque node.
85 void IdealLoopTree::compute_trip_count(PhaseIdealLoop* phase) {
86 if (!_head->as_Loop()->is_valid_counted_loop()) {
87 return;
88 }
89 CountedLoopNode* cl = _head->as_CountedLoop();
90 // Trip count may become nonexact for iteration split loops since
91 // RCE modifies limits. Note, _trip_count value is not reset since
92 // it is used to limit unrolling of main loop.
93 cl->set_nonexact_trip_count();
94
95 // Loop's test should be part of loop.
96 if (!phase->is_member(this, phase->get_ctrl(cl->loopexit()->in(CountedLoopEndNode::TestValue))))
97 return; // Infinite loop
|
53 return iff->raw_out(0);
54 if( !is_member(phase->get_loop( iff->raw_out(1) )) )
55 return iff->raw_out(1);
56 return NULL;
57 }
58
59
60 //=============================================================================
61
62
63 //------------------------------record_for_igvn----------------------------
64 // Put loop body on igvn work list
65 void IdealLoopTree::record_for_igvn() {
66 for( uint i = 0; i < _body.size(); i++ ) {
67 Node *n = _body.at(i);
68 _phase->_igvn._worklist.push(n);
69 }
70 // put body of outer strip mined loop on igvn work list as well
71 if (_head->is_CountedLoop() && _head->as_Loop()->is_strip_mined()) {
72 CountedLoopNode* l = _head->as_CountedLoop();
73 Node* outer_loop = l->outer_loop();
74 assert(outer_loop != NULL, "missing piece of strip mined loop");
75 _phase->_igvn._worklist.push(outer_loop);
76 Node* outer_loop_tail = l->outer_loop_tail();
77 assert(outer_loop_tail != NULL, "missing piece of strip mined loop");
78 _phase->_igvn._worklist.push(outer_loop_tail);
79 Node* outer_loop_end = l->outer_loop_end();
80 assert(outer_loop_end != NULL, "missing piece of strip mined loop");
81 _phase->_igvn._worklist.push(outer_loop_end);
82 Node* outer_safepoint = l->outer_safepoint();
83 assert(outer_safepoint != NULL, "missing piece of strip mined loop");
84 _phase->_igvn._worklist.push(outer_safepoint);
85 Node* cle_out = _head->as_CountedLoop()->loopexit()->proj_out(false);
86 assert(cle_out != NULL, "missing piece of strip mined loop");
87 _phase->_igvn._worklist.push(cle_out);
88 }
89 }
90
91 //------------------------------compute_exact_trip_count-----------------------
92 // Compute loop trip count if possible. Do not recalculate trip count for
93 // split loops (pre-main-post) which have their limits and inits behind Opaque node.
94 void IdealLoopTree::compute_trip_count(PhaseIdealLoop* phase) {
95 if (!_head->as_Loop()->is_valid_counted_loop()) {
96 return;
97 }
98 CountedLoopNode* cl = _head->as_CountedLoop();
99 // Trip count may become nonexact for iteration split loops since
100 // RCE modifies limits. Note, _trip_count value is not reset since
101 // it is used to limit unrolling of main loop.
102 cl->set_nonexact_trip_count();
103
104 // Loop's test should be part of loop.
105 if (!phase->is_member(this, phase->get_ctrl(cl->loopexit()->in(CountedLoopEndNode::TestValue))))
106 return; // Infinite loop
|