
This is a major change on how we represent nested name qualifications in the AST. * The nested name specifier itself and how it's stored is changed. The prefixes for types are handled within the type hierarchy, which makes canonicalization for them super cheap, no memory allocation required. Also translating a type into nested name specifier form becomes a no-op. An identifier is stored as a DependentNameType. The nested name specifier gains a lightweight handle class, to be used instead of passing around pointers, which is similar to what is implemented for TemplateName. There is still one free bit available, and this handle can be used within a PointerUnion and PointerIntPair, which should keep bit-packing aficionados happy. * The ElaboratedType node is removed, all type nodes in which it could previously apply to can now store the elaborated keyword and name qualifier, tail allocating when present. * TagTypes can now point to the exact declaration found when producing these, as opposed to the previous situation of there only existing one TagType per entity. This increases the amount of type sugar retained, and can have several applications, for example in tracking module ownership, and other tools which care about source file origins, such as IWYU. These TagTypes are lazily allocated, in order to limit the increase in AST size. This patch offers a great performance benefit. It greatly improves compilation time for [stdexec](https://github.com/NVIDIA/stdexec). For one datapoint, for `test_on2.cpp` in that project, which is the slowest compiling test, this patch improves `-c` compilation time by about 7.2%, with the `-fsyntax-only` improvement being at ~12%. This has great results on compile-time-tracker as well:  This patch also further enables other optimziations in the future, and will reduce the performance impact of template specialization resugaring when that lands. It has some other miscelaneous drive-by fixes. About the review: Yes the patch is huge, sorry about that. Part of the reason is that I started by the nested name specifier part, before the ElaboratedType part, but that had a huge performance downside, as ElaboratedType is a big performance hog. I didn't have the steam to go back and change the patch after the fact. There is also a lot of internal API changes, and it made sense to remove ElaboratedType in one go, versus removing it from one type at a time, as that would present much more churn to the users. Also, the nested name specifier having a different API avoids missing changes related to how prefixes work now, which could make existing code compile but not work. How to review: The important changes are all in `clang/include/clang/AST` and `clang/lib/AST`, with also important changes in `clang/lib/Sema/TreeTransform.h`. The rest and bulk of the changes are mostly consequences of the changes in API. PS: TagType::getDecl is renamed to `getOriginalDecl` in this patch, just for easier to rebasing. I plan to rename it back after this lands. Fixes #136624 Fixes https://github.com/llvm/llvm-project/issues/43179 Fixes https://github.com/llvm/llvm-project/issues/68670 Fixes https://github.com/llvm/llvm-project/issues/92757
165 lines
6.0 KiB
C++
165 lines
6.0 KiB
C++
//===--- ExplicitConstructorCheck.cpp - clang-tidy ------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "ExplicitConstructorCheck.h"
|
|
#include "clang/AST/ASTContext.h"
|
|
#include "clang/ASTMatchers/ASTMatchFinder.h"
|
|
#include "clang/ASTMatchers/ASTMatchers.h"
|
|
#include "clang/Lex/Lexer.h"
|
|
|
|
using namespace clang::ast_matchers;
|
|
|
|
namespace clang::tidy::google {
|
|
|
|
void ExplicitConstructorCheck::registerMatchers(MatchFinder *Finder) {
|
|
Finder->addMatcher(
|
|
cxxConstructorDecl(unless(anyOf(isImplicit(), // Compiler-generated.
|
|
isDeleted(), isInstantiated())))
|
|
.bind("ctor"),
|
|
this);
|
|
Finder->addMatcher(
|
|
cxxConversionDecl(unless(anyOf(isExplicit(), // Already marked explicit.
|
|
isImplicit(), // Compiler-generated.
|
|
isDeleted(), isInstantiated())))
|
|
|
|
.bind("conversion"),
|
|
this);
|
|
}
|
|
|
|
// Looks for the token matching the predicate and returns the range of the found
|
|
// token including trailing whitespace.
|
|
static SourceRange findToken(const SourceManager &Sources,
|
|
const LangOptions &LangOpts,
|
|
SourceLocation StartLoc, SourceLocation EndLoc,
|
|
bool (*Pred)(const Token &)) {
|
|
if (StartLoc.isMacroID() || EndLoc.isMacroID())
|
|
return {};
|
|
FileID File = Sources.getFileID(Sources.getSpellingLoc(StartLoc));
|
|
StringRef Buf = Sources.getBufferData(File);
|
|
const char *StartChar = Sources.getCharacterData(StartLoc);
|
|
Lexer Lex(StartLoc, LangOpts, StartChar, StartChar, Buf.end());
|
|
Lex.SetCommentRetentionState(true);
|
|
Token Tok;
|
|
do {
|
|
Lex.LexFromRawLexer(Tok);
|
|
if (Pred(Tok)) {
|
|
Token NextTok;
|
|
Lex.LexFromRawLexer(NextTok);
|
|
return {Tok.getLocation(), NextTok.getLocation()};
|
|
}
|
|
} while (Tok.isNot(tok::eof) && Tok.getLocation() < EndLoc);
|
|
|
|
return {};
|
|
}
|
|
|
|
static bool declIsStdInitializerList(const NamedDecl *D) {
|
|
// First use the fast getName() method to avoid unnecessary calls to the
|
|
// slow getQualifiedNameAsString().
|
|
return D->getName() == "initializer_list" &&
|
|
D->getQualifiedNameAsString() == "std::initializer_list";
|
|
}
|
|
|
|
static bool isStdInitializerList(QualType Type) {
|
|
Type = Type.getCanonicalType();
|
|
if (const auto *TS = Type->getAs<TemplateSpecializationType>()) {
|
|
if (const TemplateDecl *TD = TS->getTemplateName().getAsTemplateDecl())
|
|
return declIsStdInitializerList(TD);
|
|
}
|
|
if (const auto *RT = Type->getAs<RecordType>()) {
|
|
if (const auto *Specialization =
|
|
dyn_cast<ClassTemplateSpecializationDecl>(RT->getOriginalDecl()))
|
|
return declIsStdInitializerList(Specialization->getSpecializedTemplate());
|
|
}
|
|
return false;
|
|
}
|
|
|
|
void ExplicitConstructorCheck::check(const MatchFinder::MatchResult &Result) {
|
|
constexpr char NoExpressionWarningMessage[] =
|
|
"%0 must be marked explicit to avoid unintentional implicit conversions";
|
|
constexpr char WithExpressionWarningMessage[] =
|
|
"%0 explicit expression evaluates to 'false'";
|
|
|
|
if (const auto *Conversion =
|
|
Result.Nodes.getNodeAs<CXXConversionDecl>("conversion")) {
|
|
if (Conversion->isOutOfLine())
|
|
return;
|
|
SourceLocation Loc = Conversion->getLocation();
|
|
// Ignore all macros until we learn to ignore specific ones (e.g. used in
|
|
// gmock to define matchers).
|
|
if (Loc.isMacroID())
|
|
return;
|
|
diag(Loc, NoExpressionWarningMessage)
|
|
<< Conversion << FixItHint::CreateInsertion(Loc, "explicit ");
|
|
return;
|
|
}
|
|
|
|
const auto *Ctor = Result.Nodes.getNodeAs<CXXConstructorDecl>("ctor");
|
|
if (Ctor->isOutOfLine() || Ctor->getNumParams() == 0 ||
|
|
Ctor->getMinRequiredArguments() > 1)
|
|
return;
|
|
|
|
const ExplicitSpecifier ExplicitSpec = Ctor->getExplicitSpecifier();
|
|
|
|
bool TakesInitializerList = isStdInitializerList(
|
|
Ctor->getParamDecl(0)->getType().getNonReferenceType());
|
|
if (ExplicitSpec.isExplicit() &&
|
|
(Ctor->isCopyOrMoveConstructor() || TakesInitializerList)) {
|
|
auto IsKwExplicit = [](const Token &Tok) {
|
|
return Tok.is(tok::raw_identifier) &&
|
|
Tok.getRawIdentifier() == "explicit";
|
|
};
|
|
SourceRange ExplicitTokenRange =
|
|
findToken(*Result.SourceManager, getLangOpts(),
|
|
Ctor->getOuterLocStart(), Ctor->getEndLoc(), IsKwExplicit);
|
|
StringRef ConstructorDescription;
|
|
if (Ctor->isMoveConstructor())
|
|
ConstructorDescription = "move";
|
|
else if (Ctor->isCopyConstructor())
|
|
ConstructorDescription = "copy";
|
|
else
|
|
ConstructorDescription = "initializer-list";
|
|
|
|
auto Diag = diag(Ctor->getLocation(),
|
|
"%0 constructor should not be declared explicit")
|
|
<< ConstructorDescription;
|
|
if (ExplicitTokenRange.isValid()) {
|
|
Diag << FixItHint::CreateRemoval(
|
|
CharSourceRange::getCharRange(ExplicitTokenRange));
|
|
}
|
|
return;
|
|
}
|
|
|
|
if (ExplicitSpec.isExplicit() || Ctor->isCopyOrMoveConstructor() ||
|
|
TakesInitializerList)
|
|
return;
|
|
|
|
// Don't complain about explicit(false) or dependent expressions
|
|
const Expr *ExplicitExpr = ExplicitSpec.getExpr();
|
|
if (ExplicitExpr) {
|
|
ExplicitExpr = ExplicitExpr->IgnoreImplicit();
|
|
if (isa<CXXBoolLiteralExpr>(ExplicitExpr) ||
|
|
ExplicitExpr->isInstantiationDependent())
|
|
return;
|
|
}
|
|
|
|
const bool SingleArgument =
|
|
Ctor->getNumParams() == 1 && !Ctor->getParamDecl(0)->isParameterPack();
|
|
SourceLocation Loc = Ctor->getLocation();
|
|
auto Diag =
|
|
diag(Loc, ExplicitExpr ? WithExpressionWarningMessage
|
|
: NoExpressionWarningMessage)
|
|
<< (SingleArgument
|
|
? "single-argument constructors"
|
|
: "constructors that are callable with a single argument");
|
|
|
|
if (!ExplicitExpr)
|
|
Diag << FixItHint::CreateInsertion(Loc, "explicit ");
|
|
}
|
|
|
|
} // namespace clang::tidy::google
|