60   SyntaxTree::Impl &T1, &T2;  member in clang::diff::ASTDiff::Impl
63   Impl(SyntaxTree::Impl &T1, SyntaxTree::Impl &T2,
76     assert(&*Tree == &T2 && "Invalid tree.");  in getMapped()
566                      const SyntaxTree::Impl &T2, NodeId Id1, NodeId Id2)  in ZhangShashaMatcher()  argument
567       : DiffImpl(DiffImpl), S1(T1, Id1), S2(T2, Id2) {  in ZhangShashaMatcher()
758   const Node &N2 = T2.getNode(Id2);  in identical()
761       T1.getNodeValue(Id1) != T2.getNodeValue(Id2))  in identical()
770   return Options.isMatchingAllowed(T1.getNode(Id1), T2.getNode(Id2));  in isMatchingPossible()
776   NodeId P2 = T2.getNode(Id2).Parent;  in haveSameParents()
783   if (std::max(T1.getNumberOfDescendants(Id1), T2.getNumberOfDescendants(Id2)) >  in addOptimalMapping()
786   ZhangShashaMatcher Matcher(*this, T1, T2, Id1, Id2);  in addOptimalMapping()
803     CommonDescendants += int(Dst.isValid() && T2.isInSubtree(Dst, Id2));  in getJaccardSimilarity()
807                        T2.getNumberOfDescendants(Id2) - 1 - CommonDescendants;  in getJaccardSimilarity()
818   for (NodeId Id2 : T2) {  in findCandidate()
836         !M.hasDst(T2.getRootId())) {  in matchBottomUp()
837       if (isMatchingPossible(T1.getRootId(), T2.getRootId())) {  in matchBottomUp()
838         M.link(T1.getRootId(), T2.getRootId());  in matchBottomUp()
839         addOptimalMapping(M, T1.getRootId(), T2.getRootId());  in matchBottomUp()
859   PriorityList L2(T2);  in matchTopDown()
861   Mapping M(T1.getSize() + T2.getSize());  in matchTopDown()
864   L2.push(T2.getRootId());  in matchTopDown()
902 ASTDiff::Impl::Impl(SyntaxTree::Impl &T1, SyntaxTree::Impl &T2,  in Impl()  argument
904     : T1(T1), T2(T2), Options(Options) {  in Impl()
923   for (NodeId Id2 : T2) {  in computeChangeKinds()
925       T2.getMutableNode(Id2).Change = Insert;  in computeChangeKinds()
926       T2.getMutableNode(Id2).Shift -= 1;  in computeChangeKinds()
935             T2.findPositionInParent(Id2, true)) {  in computeChangeKinds()
937       T2.getMutableNode(Id2).Shift -= 1;  in computeChangeKinds()
940   for (NodeId Id2 : T2.NodesBfs) {  in computeChangeKinds()
945     Node &N2 = T2.getMutableNode(Id2);  in computeChangeKinds()
950             T2.findPositionInParent(Id2, true)) {  in computeChangeKinds()
953     if (T1.getNodeValue(Id1) != T2.getNodeValue(Id2)) {  in computeChangeKinds()
959 ASTDiff::ASTDiff(SyntaxTree &T1, SyntaxTree &T2,  in ASTDiff()  argument
961     : DiffImpl(std::make_unique<Impl>(*T1.TreeImpl, *T2.TreeImpl, Options)) {}  in ASTDiff()