382 |
382 |
383 // Set a required input edge, also updates corresponding output edge |
383 // Set a required input edge, also updates corresponding output edge |
384 void add_req( Node *n ); // Append a NEW required input |
384 void add_req( Node *n ); // Append a NEW required input |
385 void add_req_batch( Node* n, uint m ); // Append m NEW required inputs (all n). |
385 void add_req_batch( Node* n, uint m ); // Append m NEW required inputs (all n). |
386 void del_req( uint idx ); // Delete required edge & compact |
386 void del_req( uint idx ); // Delete required edge & compact |
|
387 void del_req_ordered( uint idx ); // Delete required edge & compact with preserved order |
387 void ins_req( uint i, Node *n ); // Insert a NEW required input |
388 void ins_req( uint i, Node *n ); // Insert a NEW required input |
388 void set_req( uint i, Node *n ) { |
389 void set_req( uint i, Node *n ) { |
389 assert( is_not_dead(n), "can not use dead node"); |
390 assert( is_not_dead(n), "can not use dead node"); |
390 assert( i < _cnt, err_msg_res("oob: i=%d, _cnt=%d", i, _cnt)); |
391 assert( i < _cnt, err_msg_res("oob: i=%d, _cnt=%d", i, _cnt)); |
391 assert( !VerifyHashTableKeys || _hash_lock == 0, |
392 assert( !VerifyHashTableKeys || _hash_lock == 0, |