*** old/src/share/vm/opto/loopopts.cpp	Thu May 15 17:09:30 2014
--- new/src/share/vm/opto/loopopts.cpp	Thu May 15 17:09:29 2014

*** 54,64 ****
--- 54,64 ----
    Node *phi;
    if (t_oop != NULL && t_oop->is_known_instance_field()) {
      int iid    = t_oop->instance_id();
      int index  = C->get_alias_index(t_oop);
      int offset = t_oop->offset();
-     phi = new (C) PhiNode(region, type, NULL, iid, index, offset);
    } else {
      phi = PhiNode::make_blank(region, n);
    }
    uint old_unique = C->unique();
    for (uint i = 1; i < region->req(); i++) {

*** 361,373 ****
--- 361,373 ----
      // Convert I-V into I+ (0-V); same for V-I
      if( add->Opcode() == Op_SubI &&
          _igvn.type( add->in(1) ) != TypeInt::ZERO ) {
        Node *zero = _igvn.intcon(0);
        set_ctrl(zero, C->root());
-       Node *neg = new (C) SubINode( _igvn.intcon(0), add->in(2) );
        register_new_node( neg, get_ctrl(add->in(2) ) );
-       add = new (C) AddINode( add->in(1), neg );
        register_new_node( add, add_ctrl );
      }
      if( add->Opcode() != Op_AddI ) return NULL;
      // See if one add input is loop invariant
      Node *add_var = add->in(1);

*** 389,406 ****
--- 389,406 ----
        return NULL;
      if( n_loop == add_invar_loop || !add_invar_loop->is_member( n_loop ) )
        return NULL;              // No invariant part of the add?
  
      // Yes!  Reshape address expression!
-     Node *inv_scale = new (C) LShiftINode( add_invar, scale );
      Node *inv_scale_ctrl =
        dom_depth(add_invar_ctrl) > dom_depth(scale_ctrl) ?
        add_invar_ctrl : scale_ctrl;
      register_new_node( inv_scale, inv_scale_ctrl );
-     Node *var_scale = new (C) LShiftINode( add_var, scale );
      register_new_node( var_scale, n_ctrl );
-     Node *var_add = new (C) AddINode( var_scale, inv_scale );
      register_new_node( var_add, n_ctrl );
      _igvn.replace_node( n, var_add );
      return var_add;
    }
  

*** 428,441 ****
--- 428,441 ----
          Node *n23_ctrl = get_ctrl(n->in(2)->in(3));
          IdealLoopTree *n22loop = get_loop( n22_ctrl );
          IdealLoopTree *n23_loop = get_loop( n23_ctrl );
          if( n22loop != n_loop && n22loop->is_member(n_loop) &&
              n23_loop == n_loop ) {
-           Node *add1 = new (C) AddPNode( n->in(1), n->in(2)->in(2), n->in(3) );
            // Stuff new AddP in the loop preheader
            register_new_node( add1, n_loop->_head->in(LoopNode::EntryControl) );
-           Node *add2 = new (C) AddPNode( n->in(1), add1, n->in(2)->in(3) );
            register_new_node( add2, n_ctrl );
            _igvn.replace_node( n, add2 );
            return add2;
          }
        }

*** 449,462 ****
--- 449,462 ----
          if( is_member(n_loop,get_ctrl(V)) ) {
          } else {
            Node *tmp = V; V = I; I = tmp;
          }
          if( !is_member(n_loop,get_ctrl(I)) ) {
-           Node *add1 = new (C) AddPNode( n->in(1), n->in(2), I );
            // Stuff new AddP in the loop preheader
            register_new_node( add1, n_loop->_head->in(LoopNode::EntryControl) );
-           Node *add2 = new (C) AddPNode( n->in(1), add1, V );
            register_new_node( add2, n_ctrl );
            _igvn.replace_node( n, add2 );
            return add2;
          }
        }

*** 1102,1113 ****
--- 1102,1113 ----
  
    Node *sample_bool = phi->in(1);
    Node *sample_cmp  = sample_bool->in(1);
  
    // Make Phis to merge the Cmp's inputs.
-   PhiNode *phi1 = new (C) PhiNode( phi->in(0), Type::TOP );
-   PhiNode *phi2 = new (C) PhiNode( phi->in(0), Type::TOP );
    for( i = 1; i < phi->req(); i++ ) {
      Node *n1 = phi->in(i)->in(1)->in(1);
      Node *n2 = phi->in(i)->in(1)->in(2);
      phi1->set_req( i, n1 );
      phi2->set_req( i, n2 );

*** 1170,1181 ****
--- 1170,1181 ----
    }
  
    Node *sample_cmp = phi->in(1);
  
    // Make Phis to merge the Cmp's inputs.
-   PhiNode *phi1 = new (C) PhiNode( phi->in(0), Type::TOP );
-   PhiNode *phi2 = new (C) PhiNode( phi->in(0), Type::TOP );
    for( uint j = 1; j < phi->req(); j++ ) {
      Node *cmp_top = phi->in(j); // Inputs are all Cmp or TOP
      Node *n1, *n2;
      if( cmp_top->is_Cmp() ) {
        n1 = cmp_top->in(1);

*** 1335,1345 ****
--- 1335,1345 ----
          set_loop(newuse, use_loop);
          set_idom(newuse, nnn, dom_depth(nnn) + 1 );
  
          // We need a Region to merge the exit from the peeled body and the
          // exit from the old loop body.
-         RegionNode *r = new (C) RegionNode(3);
          // Map the old use to the new merge point
          old_new.map( use->_idx, r );
          uint dd_r = MIN2(dom_depth(newuse),dom_depth(use));
          assert( dd_r >= dom_depth(dom_lca(newuse,use)), "" );
  

*** 1682,1698 ****
--- 1682,1698 ----
  
    proj->set_req(0, NULL);  // temporary disconnect
    ProjNode* proj2 = proj_clone(proj, iff);
    register_node(proj2, loop, iff, ddepth);
  
!   Node* cmp = Signed ? (Node*) new (C)CmpINode(left, right) : (Node*) new (C)CmpUNode(left, right);
    register_node(cmp, loop, proj2, ddepth);
  
-   BoolNode* bol = new (C)BoolNode(cmp, relop);
    register_node(bol, loop, proj2, ddepth);
  
-   IfNode* new_if = new (C)IfNode(proj2, bol, iff->_prob, iff->_fcnt);
    register_node(new_if, loop, proj2, ddepth);
  
    proj->set_req(0, new_if); // reattach
    set_idom(proj, new_if, ddepth);
  

*** 1740,1754 ****
--- 1740,1754 ----
  
    proj->set_req(0, NULL);  // temporary disconnect
    ProjNode* proj2 = proj_clone(proj, iff);
    register_node(proj2, loop, iff, ddepth);
  
-   RegionNode* reg = new (C)RegionNode(2);
    reg->set_req(1, proj2);
    register_node(reg, loop, iff, ddepth);
  
-   IfNode* dum_if = new (C)IfNode(reg, short_circuit_if(NULL, proj), iff->_prob, iff->_fcnt);
    register_node(dum_if, loop, reg, ddepth);
  
    proj->set_req(0, dum_if); // reattach
    set_idom(proj, dum_if, ddepth);
  

*** 2567,2577 ****
--- 2567,2577 ----
  
    // Step 3: clone loop, retarget control, and insert new phis
  
    // Create new loop head for new phis and to hang
    // the nodes being moved (sinked) from the peel region.
-   LoopNode* new_head = new (C) LoopNode(last_peel, last_peel);
    new_head->set_unswitch_count(head->unswitch_count()); // Preserve
    _igvn.register_new_node_with_optimizer(new_head);
    assert(first_not_peeled->in(0) == last_peel, "last_peel <- first_not_peeled");
    first_not_peeled->set_req(0, new_head);
    set_loop(new_head, loop);

*** 2767,2781 ****
--- 2767,2781 ----
        // Check that use is live out the bottom.  Assuming the trip-counter
        // update is right at the bottom, uses of of the loop middle are ok.
        if (dom_lca(exit, u_ctrl) != exit) continue;
        // Hit!  Refactor use to use the post-incremented tripcounter.
        // Compute a post-increment tripcounter.
-       Node *opaq = new (C) Opaque2Node( C, cle->incr() );
        register_new_node( opaq, u_ctrl );
        Node *neg_stride = _igvn.intcon(-cle->stride_con());
        set_ctrl(neg_stride, C->root());
-       Node *post = new (C) AddINode( opaq, neg_stride);
        register_new_node( post, u_ctrl );
        _igvn.rehash_node_delayed(use);
        for (uint j = 1; j < use->req(); j++) {
          if (use->in(j) == phi)
            use->set_req(j, post);