Mercurial > hg > graal-jvmci-8
comparison src/share/vm/opto/split_if.cpp @ 6804:e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
Summary: Deleted placement new operator of Node - node(size_t, Compile *, int).
Reviewed-by: kvn, twisti
Contributed-by: bharadwaj.yadavalli@oracle.com
author | kvn |
---|---|
date | Thu, 27 Sep 2012 09:38:42 -0700 |
parents | 5e990493719e |
children | b9a9ed0f8eeb |
comparison
equal
deleted
inserted
replaced
6803:06f52c4d0e18 | 6804:e626685e9f6c |
---|---|
33 // Split Node 'n' through merge point. | 33 // Split Node 'n' through merge point. |
34 Node *PhaseIdealLoop::split_thru_region( Node *n, Node *region ) { | 34 Node *PhaseIdealLoop::split_thru_region( Node *n, Node *region ) { |
35 uint wins = 0; | 35 uint wins = 0; |
36 assert( n->is_CFG(), "" ); | 36 assert( n->is_CFG(), "" ); |
37 assert( region->is_Region(), "" ); | 37 assert( region->is_Region(), "" ); |
38 Node *r = new (C, region->req()) RegionNode( region->req() ); | 38 Node *r = new (C) RegionNode( region->req() ); |
39 IdealLoopTree *loop = get_loop( n ); | 39 IdealLoopTree *loop = get_loop( n ); |
40 for( uint i = 1; i < region->req(); i++ ) { | 40 for( uint i = 1; i < region->req(); i++ ) { |
41 Node *x = n->clone(); | 41 Node *x = n->clone(); |
42 Node *in0 = n->in(0); | 42 Node *in0 = n->in(0); |
43 if( in0->in(0) == region ) x->set_req( 0, in0->in(i) ); | 43 if( in0->in(0) == region ) x->set_req( 0, in0->in(i) ); |