Tooling/ASTDiff/ASTDiff.cpp

38     SrcToDst = std::make_unique<NodeId[]>(Size);
39     DstToSrc = std::make_unique<NodeId[]>(Size);
52   std::unique_ptr<NodeId[]> SrcToDst, DstToSrc;
70   NodeId getMapped(const std::unique_ptr<SyntaxTree::Impl> &Tree,
119        typename std::enable_if<std::is_base_of<Stmt, T>::value, T>::type *Node,
124        typename std::enable_if<std::is_base_of<Decl, T>::value, T>::type *Node,
132   std::vector<Node> Nodes;
133   std::vector<NodeId> Leaves;
135   std::vector<int> PostorderIds;
136   std::vector<NodeId> NodesBfs;
151   std::string getRelativeName(const NamedDecl *ND,
153   std::string getRelativeName(const NamedDecl *ND) const;
155   std::string getNodeValue(NodeId Id) const;
156   std::string getNodeValue(const Node &Node) const;
157   std::string getDeclValue(const Decl *D) const;
158   std::string getStmtValue(const Stmt *S) const;
196   template <class T> std::tuple<NodeId, NodeId> PreTraverse(T *ASTNode) {
212     return std::make_tuple(MyId, Tree.getNode(MyId).Parent);
214   void PostTraverse(std::tuple<NodeId, NodeId> State) {
216     std::tie(MyId, PreviousParent) = State;
229       N.Height = std::max(N.Height, 1 + Tree.getNode(Child).Height);
280 static std::vector<NodeId> getSubtreePostorder(const SyntaxTree::Impl &Tree,
282   std::vector<NodeId> Postorder;
283   std::function<void(NodeId)> Traverse = [&](NodeId Id) {
293 static std::vector<NodeId> getSubtreeBfs(const SyntaxTree::Impl &Tree,
295   std::vector<NodeId> Ids;
308   std::function<void(NodeId)> PostorderTraverse = [&](NodeId Id) {
357 std::string
360   std::string Val = ND->getQualifiedNameAsString();
361   std::string ContextPrefix;
379 std::string SyntaxTree::Impl::getRelativeName(const NamedDecl *ND) const {
397 static std::string getInitializerValue(const CXXCtorInitializer *Init,
408 std::string SyntaxTree::Impl::getNodeValue(NodeId Id) const {
412 std::string SyntaxTree::Impl::getNodeValue(const Node &N) const {
423 std::string SyntaxTree::Impl::getDeclValue(const Decl *D) const {
424   std::string Value;
446 std::string SyntaxTree::Impl::getStmtValue(const Stmt *S) const {
490   std::vector<NodeId> RootIds;
492   std::vector<SNodeId> LeftMostDescendants;
495   std::vector<SNodeId> KeyRoots;
518   std::string getNodeValue(SNodeId Id) const {
541     std::unordered_set<int> Visited;
562   std::unique_ptr<std::unique_ptr<double[]>[]> TreeDist, ForestDist;
568     TreeDist = std::make_unique<std::unique_ptr<double[]>[]>(
570     ForestDist = std::make_unique<std::unique_ptr<double[]>[]>(
573       TreeDist[I] = std::make_unique<double[]>(size_t(S2.getSize()) + 1);
574       ForestDist[I] = std::make_unique<double[]>(size_t(S2.getSize()) + 1);
578   std::vector<std::pair<NodeId, NodeId>> getMatchingNodes() {
579     std::vector<std::pair<NodeId, NodeId>> Matches;
580     std::vector<std::pair<SNodeId, SNodeId>> TreePairs;
590       std::tie(LastRow, LastCol) = TreePairs.back();
646       return std::numeric_limits<double>::max();
671               std::min({ForestDist[D1 - 1][D2] + DeletionCost,
677               std::min({ForestDist[D1 - 1][D2] + DeletionCost,
692 llvm::Optional<std::string> Node::getQualifiedIdentifier() const {
724   std::vector<NodeId> Container;
725   PriorityQueue<NodeId, std::vector<NodeId>, HeightLess> List;
733   std::vector<NodeId> pop() {
735     std::vector<NodeId> Result;
785   if (std::max(T1.getNumberOfDescendants(Id1), T2.getNumberOfDescendants(Id2)) >
789   std::vector<std::pair<NodeId, NodeId>> R = Matcher.getMatchingNodes();
835   std::vector<NodeId> Postorder = getSubtreePostorder(T1, T1.getRootId());
869   while (std::min(Max1 = L1.peekMax(), Max2 = L2.peekMax()) >
881     std::vector<NodeId> H1, H2;
963     : DiffImpl(std::make_unique<Impl>(*T1.TreeImpl, *T2.TreeImpl, Options)) {}
972     : TreeImpl(std::make_unique<SyntaxTree::Impl>(
994 std::pair<unsigned, unsigned>
1010 std::string SyntaxTree::getNodeValue(NodeId Id) const {
1014 std::string SyntaxTree::getNodeValue(const Node &N) const {