33                                     Node_List& value) {  in register_contains_value()
80 int PhaseChaitin::yank( Node *old, Block *current_block, Node_List *value, Node_List *regnd ) {  in yank()
130                                        Node_List *value, Node_List *regnd) {  in yank_if_dead_recurse()
164 …_register( Node *n, uint idx, Node *def, Block *current_block, Node_List &value, Node_List &regnd …  in use_prior_register()
232 int PhaseChaitin::elide_copy( Node *n, int k, Block *current_block, Node_List &value, Node_List &re…  in elide_copy()
338                                               Node_List& value, Node_List& regnd,  in eliminate_copy_of_constant()
487   Node_List **blk2value = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1);  in post_allocate_copy_removal()
488   memset(blk2value, 0, sizeof(Node_List*) * (_cfg.number_of_blocks() + 1));  in post_allocate_copy_removal()
491   Node_List **blk2regnd = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1);  in post_allocate_copy_removal()
492   memset(blk2regnd, 0, sizeof(Node_List*) * (_cfg.number_of_blocks() + 1));  in post_allocate_copy_removal()
496   GrowableArray<Node_List*> free_list = GrowableArray<Node_List*>(16);  in post_allocate_copy_removal()
546     Node_List &regnd = *(free_list.is_empty() ? new Node_List() : free_list.pop());  in post_allocate_copy_removal()
547     Node_List &value = *(free_list.is_empty() ? new Node_List() : free_list.pop());  in post_allocate_copy_removal()
566         Node_List &f_value = *blk2value[freed->_pre_order];  in post_allocate_copy_removal()
567         Node_List &f_regnd = *blk2regnd[freed->_pre_order];  in post_allocate_copy_removal()
579         Node_List &p_regnd = *blk2regnd[pb->_pre_order];  in post_allocate_copy_removal()