================
@@ -47,6 +60,15 @@ void RedundantParenthesesCheck::registerMatchers(MatchFinder
*Finder) {
void RedundantParenthesesCheck::check(const MatchFinder::MatchResult &Result) {
const auto *PE = Result.Nodes.getNodeAs<ParenExpr>("dup");
+ if (auto *DRE = dyn_cast<DeclRefExpr>(PE->getSubExpr())) {
+ const std::string Name = DRE->getDecl()->getQualifiedNameAsString();
+ llvm::errs() << Name << "\n";
+ bool Allowed = llvm::any_of(AllowedDecls, [&Name](const llvm::Regex &NM) {
----------------
vbvictor wrote:
> The AllowedTypes in the other check use regex, maybe provide a common
> interface is easier to understand.
Yes, that's preferable. Could we then write in matchers:
`declRefExpr(to(namedDecl(unless(matchers::matchesAnyListedName(AllowedTypes)))))`
and remove logic from `match`?
https://github.com/llvm/llvm-project/pull/164827
_______________________________________________
cfe-commits mailing list
[email protected]
https://lists.llvm.org/cgi-bin/mailman/listinfo/cfe-commits
