Cross Reference: /openjdk7/hotspot/src/share/vm/opto/loopopts.cpp

Lines Matching refs:head
839     // If trying to do a 'Split-If' at the loop head, it is only
1840 // The first node in "sched" is the loop head, followed by
1846   assert(member.test(loop->_head->_idx), "loop head must be in member set");
1914 // Has use internal to the vector set (ie. not in a phi at the loop head)
1916   Node* head  = loop->_head;
1919     if (vset.test(use->_idx) && !(use->is_Phi() && use->in(0) == head)) {
2119 // the new loop head and the other copy at the bottom of the new loop.
2150 //         head.  This is very dependent on the graph structure
2156 //         new loop head, and the clone's not-peel section is
2331   LoopNode *head  = loop->_head->as_Loop();
2333   if (head->is_partial_peel_loop() || head->partial_peel_has_failed()) {
2348         tty->print_cr("\nExit control too complex: lp: %d", head->_idx);
2355   int dd = dom_depth(head);
2359   // Walk up dominators to loop head looking for first loop exit
2365   while( iff != head ) {
2398   if (first_not_peeled == NULL || first_not_peeled == head) {
2411     Node* t = head->in(2);
2414       if (t == head) break;
2432   // the head through last_peel.
2434   worklist.push(head);
2435   peel.set(head->_idx);
2474   for (DUIterator_Fast jmax, j = head->fast_outs(jmax); j < jmax; j++) {
2475     Node* use = head->fast_out(j);
2541     assert(!head->is_partial_peel_loop(), "not partial peeled");
2542     head->mark_partial_peel_failed();
2554   // Create new loop head for new phis and to hang
2557   new_head->set_unswitch_count(head->unswitch_count()); // Preserve
2580   Node* head_clone             = old_new[head->_idx];
2593              (use->is_Phi() && use->in(0) == head)) ) {
2632   // Redirect control to the new loop head if a cloned node in
2659   // Copy head_clone back-branch info to original head
2660   // and remove original head's loop entry and
2661   // clone head's back-branch
2662   _igvn.rehash_node_delayed(head); // Multiple edge updates
2663   head->set_req(LoopNode::EntryControl,    head_clone->in(LoopNode::LoopBackControl));
2664   head->set_req(LoopNode::LoopBackControl, C->top());
2668   for (DUIterator_Fast kmax, k = head->fast_outs(kmax); k < kmax; k++) {
2669     Node* use = head->fast_out(k);
2681   set_idom(head, orig_tail_clone, dd);
2700       if (tt == head) tty->print_cr("orig head");
2701       else if (tt == new_head_clone) tty->print_cr("new head");
2702       else if (tt == head_clone) tty->print_cr("clone head");