clang-tidy/misc/NoRecursionCheck.h

0001 //===--- NoRecursionCheck.h - clang-tidy ------------------------*- C++ -*-===//
0002 //
0003 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
0004 // See https://llvm.org/LICENSE.txt for license information.
0005 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
0006 //
0007 //===----------------------------------------------------------------------===//
0008
0009 #ifndef LLVM_CLANG_TOOLS_EXTRA_CLANG_TIDY_MISC_NORECURSIONCHECK_H
0010 #define LLVM_CLANG_TOOLS_EXTRA_CLANG_TIDY_MISC_NORECURSIONCHECK_H
0011
0012 #include "../ClangTidyCheck.h"
0013
0014 namespace clang {
0015
0016 class CallGraphNode;
0017
0018 namespace tidy::misc {
0019
0020 /// Finds strongly connected functions (by analyzing call graph for SCC's
0021 /// that are loops), diagnoses each function in the cycle,
0022 /// and displays one example of possible call graph loop (recursion).
0023 ///
0024 /// For the user-facing documentation see:
0025 /// http://clang.llvm.org/extra/clang-tidy/checks/misc/no-recursion.html
0026 class NoRecursionCheck : public ClangTidyCheck {
0027 public:
0028   NoRecursionCheck(StringRef Name, ClangTidyContext *Context)
0029       : ClangTidyCheck(Name, Context) {}
0030   void registerMatchers(ast_matchers::MatchFinder *Finder) override;
0031   void check(const ast_matchers::MatchFinder::MatchResult &Result) override;
0032
0033 private:
0034   void handleSCC(ArrayRef<CallGraphNode *> SCC);
0035 };
0036
0037 } // namespace tidy::misc
0038 } // namespace clang
0039
0040 #endif // LLVM_CLANG_TOOLS_EXTRA_CLANG_TIDY_MISC_NORECURSIONCHECK_H