Lines Matching defs:merge
166 // Either find the merge-point of both branches, or the highest reachable
170 // As long as there's no merge-point.
187 // occur multiple times until a return/jumploop/merge is discovered.
527 // independently live will be killed as part of the merge.
761 RegisterMerge* merge;
762 LoadMergeState(entry.state, &node, &merge);
778 RegisterMerge* merge;
779 LoadMergeState(entry.state, &node, &merge);
815 RegisterMerge* merge;
816 LoadMergeState(entry.state, &node, &merge);
833 if (merge) merge->operand(predecessor_id) = register_info;
837 if (merge) {
840 merge->operand(predecessor_id) = node->allocation();
843 // already spilled or in another place in the merge state.
852 // If the register is unallocated at the merge point, and the incoming
862 merge = new (buffer) RegisterMerge();
863 merge->node = node == nullptr ? incoming : node;
865 // If the register is unallocated at the merge point, allocation so far
877 merge->operand(i) = info_so_far;
879 // If the register is unallocated at the merge point, fill in the
880 // incoming value. Otherwise find the merge-point node in the incoming
883 merge->operand(predecessor_id) = register_info;
885 merge->operand(predecessor_id) = node->allocation();
887 entry.state = {merge, initialized_merge};