head 1.1; branch 1.1.1; access; symbols netbsd-11-0-RC4:1.1.1.2 netbsd-11-0-RC3:1.1.1.2 netbsd-11-0-RC2:1.1.1.2 netbsd-11-0-RC1:1.1.1.2 perseant-exfatfs-base-20250801:1.1.1.2 netbsd-11:1.1.1.2.0.12 netbsd-11-base:1.1.1.2 netbsd-10-1-RELEASE:1.1.1.2 perseant-exfatfs-base-20240630:1.1.1.2 perseant-exfatfs:1.1.1.2.0.10 perseant-exfatfs-base:1.1.1.2 netbsd-8-3-RELEASE:1.1.1.1 netbsd-9-4-RELEASE:1.1.1.2 netbsd-10-0-RELEASE:1.1.1.2 netbsd-10-0-RC6:1.1.1.2 netbsd-10-0-RC5:1.1.1.2 netbsd-10-0-RC4:1.1.1.2 netbsd-10-0-RC3:1.1.1.2 netbsd-10-0-RC2:1.1.1.2 netbsd-10-0-RC1:1.1.1.2 netbsd-10:1.1.1.2.0.8 netbsd-10-base:1.1.1.2 netbsd-9-3-RELEASE:1.1.1.2 cjep_sun2x:1.1.1.2.0.6 cjep_sun2x-base:1.1.1.2 cjep_staticlib_x-base1:1.1.1.2 netbsd-9-2-RELEASE:1.1.1.2 cjep_staticlib_x:1.1.1.2.0.4 cjep_staticlib_x-base:1.1.1.2 netbsd-9-1-RELEASE:1.1.1.2 phil-wifi-20200421:1.1.1.2 phil-wifi-20200411:1.1.1.2 phil-wifi-20200406:1.1.1.2 netbsd-8-2-RELEASE:1.1.1.1 netbsd-9-0-RELEASE:1.1.1.2 netbsd-9-0-RC2:1.1.1.2 netbsd-9-0-RC1:1.1.1.2 netbsd-9:1.1.1.2.0.2 netbsd-9-base:1.1.1.2 netbsd-8-1-RELEASE:1.1.1.1 netbsd-8-1-RC1:1.1.1.1 pgoyette-compat-merge-20190127:1.1.1.1.14.1 pgoyette-compat-20190127:1.1.1.2 pgoyette-compat-20190118:1.1.1.2 pgoyette-compat-1226:1.1.1.2 pgoyette-compat-1126:1.1.1.2 pgoyette-compat-1020:1.1.1.2 pgoyette-compat-0930:1.1.1.2 pgoyette-compat-0906:1.1.1.2 pgoyette-compat-0728:1.1.1.2 netbsd-8-0-RELEASE:1.1.1.1 phil-wifi:1.1.1.1.0.16 phil-wifi-base:1.1.1.1 pgoyette-compat-0625:1.1.1.1 netbsd-8-0-RC2:1.1.1.1 pgoyette-compat-0521:1.1.1.1 pgoyette-compat-0502:1.1.1.1 pgoyette-compat-0422:1.1.1.1 netbsd-8-0-RC1:1.1.1.1 pgoyette-compat-0415:1.1.1.1 pgoyette-compat-0407:1.1.1.1 pgoyette-compat-0330:1.1.1.1 pgoyette-compat-0322:1.1.1.1 pgoyette-compat-0315:1.1.1.1 pgoyette-compat:1.1.1.1.0.14 pgoyette-compat-base:1.1.1.1 clang-319952:1.1.1.1 matt-nb8-mediatek:1.1.1.1.0.12 matt-nb8-mediatek-base:1.1.1.1 clang-309604:1.1.1.1 perseant-stdc-iso10646:1.1.1.1.0.10 perseant-stdc-iso10646-base:1.1.1.1 netbsd-8:1.1.1.1.0.8 netbsd-8-base:1.1.1.1 prg-localcount2-base3:1.1.1.1 prg-localcount2-base2:1.1.1.1 prg-localcount2-base1:1.1.1.1 prg-localcount2:1.1.1.1.0.6 prg-localcount2-base:1.1.1.1 pgoyette-localcount-20170426:1.1.1.1 bouyer-socketcan-base1:1.1.1.1 pgoyette-localcount:1.1.1.1.0.4 pgoyette-localcount-20170320:1.1.1.1 clang-294123:1.1.1.1 bouyer-socketcan:1.1.1.1.0.2 bouyer-socketcan-base:1.1.1.1 clang-291444:1.1.1.1 LLVM:1.1.1; locks; strict; comment @// @; 1.1 date 2017.01.11.10.33.06; author joerg; state Exp; branches 1.1.1.1; next ; commitid CNnUNfII1jgNmxBz; 1.1.1.1 date 2017.01.11.10.33.06; author joerg; state Exp; branches 1.1.1.1.4.1 1.1.1.1.14.1 1.1.1.1.16.1; next 1.1.1.2; commitid CNnUNfII1jgNmxBz; 1.1.1.2 date 2018.07.17.19.10.01; author joerg; state dead; branches; next ; commitid gpOGVOd4uxNnuwKA; 1.1.1.1.4.1 date 2017.01.11.10.33.06; author pgoyette; state dead; branches; next 1.1.1.1.4.2; commitid jjw7cAwgyKq7RfKz; 1.1.1.1.4.2 date 2017.03.20.06.53.38; author pgoyette; state Exp; branches; next ; commitid jjw7cAwgyKq7RfKz; 1.1.1.1.14.1 date 2018.07.28.04.34.17; author pgoyette; state dead; branches; next ; commitid 1UP1xAIUxv1ZgRLA; 1.1.1.1.16.1 date 2019.06.10.21.46.45; author christos; state dead; branches; next ; commitid jtc8rnCzWiEEHGqB; desc @@ 1.1 log @Initial revision @ text @//===- unittests/AST/PostOrderASTVisitor.cpp - Declaration printer tests --===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This file contains tests for the post-order traversing functionality // of RecursiveASTVisitor. // //===----------------------------------------------------------------------===// #include "clang/AST/RecursiveASTVisitor.h" #include "clang/Tooling/Tooling.h" #include "gtest/gtest.h" using namespace clang; namespace { class RecordingVisitor : public RecursiveASTVisitor { bool VisitPostOrder; public: explicit RecordingVisitor(bool VisitPostOrder) : VisitPostOrder(VisitPostOrder) { } // List of visited nodes during traversal. std::vector VisitedNodes; bool shouldTraversePostOrder() const { return VisitPostOrder; } bool VisitUnaryOperator(UnaryOperator *Op) { VisitedNodes.push_back(Op->getOpcodeStr(Op->getOpcode())); return true; } bool VisitBinaryOperator(BinaryOperator *Op) { VisitedNodes.push_back(Op->getOpcodeStr()); return true; } bool VisitIntegerLiteral(IntegerLiteral *Lit) { VisitedNodes.push_back(Lit->getValue().toString(10, false)); return true; } bool VisitVarDecl(VarDecl* D) { VisitedNodes.push_back(D->getNameAsString()); return true; } bool VisitCXXMethodDecl(CXXMethodDecl *D) { VisitedNodes.push_back(D->getQualifiedNameAsString()); return true; } bool VisitReturnStmt(ReturnStmt *S) { VisitedNodes.push_back("return"); return true; } bool VisitCXXRecordDecl(CXXRecordDecl *Declaration) { VisitedNodes.push_back(Declaration->getQualifiedNameAsString()); return true; } bool VisitTemplateTypeParmType(TemplateTypeParmType *T) { VisitedNodes.push_back(T->getDecl()->getQualifiedNameAsString()); return true; } }; } TEST(RecursiveASTVisitor, PostOrderTraversal) { auto ASTUnit = tooling::buildASTFromCode( "class A {" " class B {" " int foo() { while(4) { int i = 9; int j = -5; } return (1 + 3) + 2; }" " };" "};" ); auto TU = ASTUnit->getASTContext().getTranslationUnitDecl(); // We traverse the translation unit and store all // visited nodes. RecordingVisitor Visitor(true); Visitor.TraverseTranslationUnitDecl(TU); std::vector expected = {"4", "9", "i", "5", "-", "j", "1", "3", "+", "2", "+", "return", "A::B::foo", "A::B", "A"}; // Compare the list of actually visited nodes // with the expected list of visited nodes. ASSERT_EQ(expected.size(), Visitor.VisitedNodes.size()); for (std::size_t I = 0; I < expected.size(); I++) { ASSERT_EQ(expected[I], Visitor.VisitedNodes[I]); } } TEST(RecursiveASTVisitor, NoPostOrderTraversal) { auto ASTUnit = tooling::buildASTFromCode( "class A {" " class B {" " int foo() { return 1 + 2; }" " };" "};" ); auto TU = ASTUnit->getASTContext().getTranslationUnitDecl(); // We traverse the translation unit and store all // visited nodes. RecordingVisitor Visitor(false); Visitor.TraverseTranslationUnitDecl(TU); std::vector expected = { "A", "A::B", "A::B::foo", "return", "+", "1", "2" }; // Compare the list of actually visited nodes // with the expected list of visited nodes. ASSERT_EQ(expected.size(), Visitor.VisitedNodes.size()); for (std::size_t I = 0; I < expected.size(); I++) { ASSERT_EQ(expected[I], Visitor.VisitedNodes[I]); } } @ 1.1.1.1 log @Import Clang pre-4.0.0 r291444. @ text @@ 1.1.1.1.16.1 log @Sync with HEAD @ text @@ 1.1.1.1.14.1 log @Sync with HEAD @ text @@ 1.1.1.2 log @Mark files not tagged with clang-337282 as dead @ text @@ 1.1.1.1.4.1 log @file PostOrderASTVisitor.cpp was added on branch pgoyette-localcount on 2017-03-20 06:53:38 +0000 @ text @d1 128 @ 1.1.1.1.4.2 log @Sync with HEAD @ text @a0 128 //===- unittests/AST/PostOrderASTVisitor.cpp - Declaration printer tests --===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This file contains tests for the post-order traversing functionality // of RecursiveASTVisitor. // //===----------------------------------------------------------------------===// #include "clang/AST/RecursiveASTVisitor.h" #include "clang/Tooling/Tooling.h" #include "gtest/gtest.h" using namespace clang; namespace { class RecordingVisitor : public RecursiveASTVisitor { bool VisitPostOrder; public: explicit RecordingVisitor(bool VisitPostOrder) : VisitPostOrder(VisitPostOrder) { } // List of visited nodes during traversal. std::vector VisitedNodes; bool shouldTraversePostOrder() const { return VisitPostOrder; } bool VisitUnaryOperator(UnaryOperator *Op) { VisitedNodes.push_back(Op->getOpcodeStr(Op->getOpcode())); return true; } bool VisitBinaryOperator(BinaryOperator *Op) { VisitedNodes.push_back(Op->getOpcodeStr()); return true; } bool VisitIntegerLiteral(IntegerLiteral *Lit) { VisitedNodes.push_back(Lit->getValue().toString(10, false)); return true; } bool VisitVarDecl(VarDecl* D) { VisitedNodes.push_back(D->getNameAsString()); return true; } bool VisitCXXMethodDecl(CXXMethodDecl *D) { VisitedNodes.push_back(D->getQualifiedNameAsString()); return true; } bool VisitReturnStmt(ReturnStmt *S) { VisitedNodes.push_back("return"); return true; } bool VisitCXXRecordDecl(CXXRecordDecl *Declaration) { VisitedNodes.push_back(Declaration->getQualifiedNameAsString()); return true; } bool VisitTemplateTypeParmType(TemplateTypeParmType *T) { VisitedNodes.push_back(T->getDecl()->getQualifiedNameAsString()); return true; } }; } TEST(RecursiveASTVisitor, PostOrderTraversal) { auto ASTUnit = tooling::buildASTFromCode( "class A {" " class B {" " int foo() { while(4) { int i = 9; int j = -5; } return (1 + 3) + 2; }" " };" "};" ); auto TU = ASTUnit->getASTContext().getTranslationUnitDecl(); // We traverse the translation unit and store all // visited nodes. RecordingVisitor Visitor(true); Visitor.TraverseTranslationUnitDecl(TU); std::vector expected = {"4", "9", "i", "5", "-", "j", "1", "3", "+", "2", "+", "return", "A::B::foo", "A::B", "A"}; // Compare the list of actually visited nodes // with the expected list of visited nodes. ASSERT_EQ(expected.size(), Visitor.VisitedNodes.size()); for (std::size_t I = 0; I < expected.size(); I++) { ASSERT_EQ(expected[I], Visitor.VisitedNodes[I]); } } TEST(RecursiveASTVisitor, NoPostOrderTraversal) { auto ASTUnit = tooling::buildASTFromCode( "class A {" " class B {" " int foo() { return 1 + 2; }" " };" "};" ); auto TU = ASTUnit->getASTContext().getTranslationUnitDecl(); // We traverse the translation unit and store all // visited nodes. RecordingVisitor Visitor(false); Visitor.TraverseTranslationUnitDecl(TU); std::vector expected = { "A", "A::B", "A::B::foo", "return", "+", "1", "2" }; // Compare the list of actually visited nodes // with the expected list of visited nodes. ASSERT_EQ(expected.size(), Visitor.VisitedNodes.size()); for (std::size_t I = 0; I < expected.size(); I++) { ASSERT_EQ(expected[I], Visitor.VisitedNodes[I]); } } @