equal
deleted
inserted
replaced
1385 return true; |
1385 return true; |
1386 } |
1386 } |
1387 return false; |
1387 return false; |
1388 } |
1388 } |
1389 |
1389 |
1390 //------------------------------Ideal_DU_postCCP------------------------------- |
|
1391 // Idealize graph, using DU info. Must clone result into new-space |
|
1392 Node *Node::Ideal_DU_postCCP( PhaseCCP * ) { |
|
1393 return NULL; // Default to no change |
|
1394 } |
|
1395 |
|
1396 //------------------------------hash------------------------------------------- |
1390 //------------------------------hash------------------------------------------- |
1397 // Hash function over Nodes. |
1391 // Hash function over Nodes. |
1398 uint Node::hash() const { |
1392 uint Node::hash() const { |
1399 uint sum = 0; |
1393 uint sum = 0; |
1400 for( uint i=0; i<_cnt; i++ ) // Add in all inputs |
1394 for( uint i=0; i<_cnt; i++ ) // Add in all inputs |
2079 } |
2073 } |
2080 } |
2074 } |
2081 return found; |
2075 return found; |
2082 } |
2076 } |
2083 |
2077 |
|
2078 void Node::ensure_control_or_add_prec(Node* c) { |
|
2079 if (in(0) == NULL) { |
|
2080 set_req(0, c); |
|
2081 } else if (in(0) != c) { |
|
2082 add_prec(c); |
|
2083 } |
|
2084 } |
|
2085 |
2084 //============================================================================= |
2086 //============================================================================= |
2085 //------------------------------yank------------------------------------------- |
2087 //------------------------------yank------------------------------------------- |
2086 // Find and remove |
2088 // Find and remove |
2087 void Node_List::yank( Node *n ) { |
2089 void Node_List::yank( Node *n ) { |
2088 uint i; |
2090 uint i; |