Lines Matching refs:Merge
469 /// Conservatively merge the two RRInfo. Returns true if a partial merge has
471 bool Merge(const RRInfo &Other);
485 Merge(const RRInfo &Other) {
486 // Conservatively merge the ReleaseMetadata information.
490 // Conservatively merge the boolean state.
495 // Merge the call sets.
498 // Merge the insert point sets. If there are any differences,
499 // that makes this a partial merge.
600 void Merge(const PtrState &Other, bool TopDown);
625 PtrState::Merge(const PtrState &Other, bool TopDown) {
634 // If we're doing a merge on a path that's previously seen a partial
635 // merge, conservatively drop the sequence, to avoid doing partial
636 // RR elimination. If the branch predicates for the two merge differ,
640 // Otherwise merge the other PtrState's RRInfo into our RRInfo. At this
642 // the merge operation caused us to undergo a partial merging of reverse
644 Partial = RRI.Merge(Other.RRI);
781 /// The top-down traversal uses this to merge information about predecessors to
796 // merge the entries. Otherwise, copy the entry and merge it with an empty
801 Pair.first->second.Merge(Pair.second ? PtrState() : MI->second,
806 // same key, force it to merge with an empty entry.
810 MI->second.Merge(PtrState(), /*TopDown=*/true);
813 /// The bottom-up traversal uses this to merge information about successors to
828 // same key, merge the entries. Otherwise, copy the entry and merge
833 Pair.first->second.Merge(Pair.second ? PtrState() : MI->second,
838 // with the same key, force it to merge with an empty entry.
842 MI->second.Merge(PtrState(), /*TopDown=*/false);
2039 // Merge the states from each successor to compute the initial state
2249 // Merge the states from each predecessor to compute the initial state
2534 // Merge the ReleaseMetadata and IsTailCallRelease values.
