Searched refs:lpt (Results 1 - 6 of 6) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A Dsuperword.hpp241 void transform_loop(IdealLoopTree* lpt);
245 IdealLoopTree* lpt() { return _lpt; } function in class:SuperWord
260 void set_lpt(IdealLoopTree* lpt) { _lpt = lpt; } argument
441 IdealLoopTree* lpt() { return _slp->lpt(); } function in class:VALUE_OBJ_CLASS_SPEC
446 return !lpt()->is_member(phase()->get_loop(n_c));
H A DloopTransform.cpp2386 IdealLoopTree* lpt = iter.current(); local
2387 changed |= intrinsify_fill(lpt);
2395 bool PhaseIdealLoop::match_fill_loop(IdealLoopTree* lpt, Node*& store, Node*& store_value, argument
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
2618 intrinsify_fill(IdealLoopTree* lpt) argument
[all...]
H A Dsuperword.cpp69 void SuperWord::transform_loop(IdealLoopTree* lpt) { argument
74 assert(lpt->_head->is_CountedLoop(), "must be");
75 CountedLoopNode *cl = lpt->_head->as_CountedLoop();
83 if (cl_exit->in(0) != lpt->_head) return;
98 set_lpt(lpt);
1347 lpt()->dump_head();
1597 for (uint i = 0; i < lpt()->_body.size(); i++ ) {
1598 Node *n = lpt()->_body.at(i);
H A DloopPredicate.cpp551 Invariance(Arena* area, IdealLoopTree* lpt) : argument
552 _lpt(lpt), _phase(lpt->_phase),
H A Dloopnode.cpp2305 IdealLoopTree* lpt = iter.current(); local
2306 if (!lpt->is_counted() || !lpt->is_inner()) continue;
2308 lpt->reassociate_invariants(this);
2314 if (lpt->policy_range_check(this)) {
2315 lpt->_rce_candidate = 1; // = true
2395 IdealLoopTree* lpt = iter.current(); local
2396 if (lpt->is_counted()) {
2397 sw.transform_loop(lpt);
H A Dloopnode.hpp1040 bool intrinsify_fill(IdealLoopTree* lpt);
1041 bool match_fill_loop(IdealLoopTree* lpt, Node*& store, Node*& store_value,
1103 // IdealLoopTree* lpt = iter.current();
1104 // if (!lpt->is_counted()) continue;

Completed in 55 milliseconds