equal
deleted
inserted
replaced
2947 IdealLoopTree* lpt = iter.current(); |
2947 IdealLoopTree* lpt = iter.current(); |
2948 bool is_counted = lpt->is_counted(); |
2948 bool is_counted = lpt->is_counted(); |
2949 if (!is_counted || !lpt->is_inner()) continue; |
2949 if (!is_counted || !lpt->is_inner()) continue; |
2950 |
2950 |
2951 // check for vectorized loops, any reassociation of invariants was already done |
2951 // check for vectorized loops, any reassociation of invariants was already done |
2952 if (is_counted && lpt->_head->as_CountedLoop()->do_unroll_only()) continue; |
2952 if (is_counted && lpt->_head->as_CountedLoop()->is_unroll_only()) continue; |
2953 |
2953 |
2954 lpt->reassociate_invariants(this); |
2954 lpt->reassociate_invariants(this); |
2955 |
2955 |
2956 // Because RCE opportunities can be masked by split_thru_phi, |
2956 // Because RCE opportunities can be masked by split_thru_phi, |
2957 // look for RCE candidates and inhibit split_thru_phi |
2957 // look for RCE candidates and inhibit split_thru_phi |