Lines Matching defs:lpt
2386 IdealLoopTree* lpt = iter.current();
2387 changed |= intrinsify_fill(lpt);
2395 bool PhaseIdealLoop::match_fill_loop(IdealLoopTree* lpt, Node*& store, Node*& store_value,
2406 CountedLoopNode* head = lpt->_head->as_CountedLoop();
2407 for (uint i = 0; msg == NULL && i < lpt->_body.size(); i++) {
2408 Node* n = lpt->_body.at(i);
2421 if (!lpt->is_invariant(value)) {
2568 for (uint i = 0; msg == NULL && i < lpt->_body.size(); i++) {
2569 Node* n = lpt->_body.at(i);
2582 for (uint i = 0; msg == NULL && i < lpt->_body.size(); i++) {
2583 Node* n = lpt->_body.at(i);
2589 if (!lpt->_body.contains(use)) {
2591 // lpt->_body.dump();
2608 lpt->_body.dump();
2618 bool PhaseIdealLoop::intrinsify_fill(IdealLoopTree* lpt) {
2620 if (!lpt->is_counted() || !lpt->is_inner()) {
2625 CountedLoopNode* head = lpt->_head->as_CountedLoop();
2636 if (!match_fill_loop(lpt, store, store_value, shift, offset)) {
2643 lpt->dump_head();
2757 for (uint i = 0; i < lpt->_body.size(); i++) {
2758 Node* n = lpt->_body.at(i);