equal
deleted
inserted
replaced
644 // add new phinode if one not already found |
644 // add new phinode if one not already found |
645 if( needs_phi ) { |
645 if( needs_phi ) { |
646 // create a new phi node and insert it into the block |
646 // create a new phi node and insert it into the block |
647 // type is taken from left over pointer to a predecessor |
647 // type is taken from left over pointer to a predecessor |
648 assert(n3,"No non-NULL reaching DEF for a Phi"); |
648 assert(n3,"No non-NULL reaching DEF for a Phi"); |
649 phi = new (C, b->num_preds()) PhiNode(b->head(), n3->bottom_type()); |
649 phi = new (C) PhiNode(b->head(), n3->bottom_type()); |
650 // initialize the Reaches entry for this LRG |
650 // initialize the Reaches entry for this LRG |
651 Reachblock[slidx] = phi; |
651 Reachblock[slidx] = phi; |
652 |
652 |
653 // add node to block & node_to_block mapping |
653 // add node to block & node_to_block mapping |
654 insert_proj( b, insidx++, phi, maxlrg++ ); |
654 insert_proj( b, insidx++, phi, maxlrg++ ); |