
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
130 lines
5.3 KiB
C++
130 lines
5.3 KiB
C++
//===--- MoveForwardingReferenceCheck.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 "MoveForwardingReferenceCheck.h"
|
|
#include "clang/Lex/Lexer.h"
|
|
|
|
using namespace clang::ast_matchers;
|
|
|
|
namespace clang::tidy::bugprone {
|
|
|
|
static void replaceMoveWithForward(const UnresolvedLookupExpr *Callee,
|
|
const ParmVarDecl *ParmVar,
|
|
const TemplateTypeParmDecl *TypeParmDecl,
|
|
DiagnosticBuilder &Diag,
|
|
const ASTContext &Context) {
|
|
const SourceManager &SM = Context.getSourceManager();
|
|
const LangOptions &LangOpts = Context.getLangOpts();
|
|
|
|
CharSourceRange CallRange =
|
|
Lexer::makeFileCharRange(CharSourceRange::getTokenRange(
|
|
Callee->getBeginLoc(), Callee->getEndLoc()),
|
|
SM, LangOpts);
|
|
|
|
if (CallRange.isValid()) {
|
|
const std::string TypeName =
|
|
(TypeParmDecl->getIdentifier() && !TypeParmDecl->isImplicit())
|
|
? TypeParmDecl->getName().str()
|
|
: (llvm::Twine("decltype(") + ParmVar->getName() + ")").str();
|
|
|
|
const std::string ForwardName =
|
|
(llvm::Twine("forward<") + TypeName + ">").str();
|
|
|
|
// Create a replacement only if we see a "standard" way of calling
|
|
// std::move(). This will hopefully prevent erroneous replacements if the
|
|
// code does unusual things (e.g. create an alias for std::move() in
|
|
// another namespace).
|
|
NestedNameSpecifier NNS = Callee->getQualifier();
|
|
switch (NNS.getKind()) {
|
|
case NestedNameSpecifier::Kind::Null:
|
|
// Called as "move" (i.e. presumably the code had a "using std::move;").
|
|
// We still conservatively put a "std::" in front of the forward because
|
|
// we don't know whether the code also had a "using std::forward;".
|
|
Diag << FixItHint::CreateReplacement(CallRange, "std::" + ForwardName);
|
|
break;
|
|
case NestedNameSpecifier::Kind::Namespace: {
|
|
auto [Namespace, Prefix] = NNS.getAsNamespaceAndPrefix();
|
|
if (Namespace->getName() == "std") {
|
|
if (!Prefix) {
|
|
// Called as "std::move".
|
|
Diag << FixItHint::CreateReplacement(CallRange,
|
|
"std::" + ForwardName);
|
|
} else if (Prefix.getKind() == NestedNameSpecifier::Kind::Global) {
|
|
// Called as "::std::move".
|
|
Diag << FixItHint::CreateReplacement(CallRange,
|
|
"::std::" + ForwardName);
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
default:
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
void MoveForwardingReferenceCheck::registerMatchers(MatchFinder *Finder) {
|
|
// Matches a ParmVarDecl for a forwarding reference, i.e. a non-const rvalue
|
|
// reference of a function template parameter type.
|
|
auto ForwardingReferenceParmMatcher =
|
|
parmVarDecl(
|
|
hasType(qualType(rValueReferenceType(),
|
|
references(templateTypeParmType(hasDeclaration(
|
|
templateTypeParmDecl().bind("type-parm-decl")))),
|
|
unless(references(qualType(isConstQualified()))))))
|
|
.bind("parm-var");
|
|
|
|
Finder->addMatcher(
|
|
callExpr(callee(unresolvedLookupExpr(
|
|
hasAnyDeclaration(namedDecl(
|
|
hasUnderlyingDecl(hasName("::std::move")))))
|
|
.bind("lookup")),
|
|
argumentCountIs(1),
|
|
hasArgument(0, ignoringParenImpCasts(declRefExpr(
|
|
to(ForwardingReferenceParmMatcher)))))
|
|
.bind("call-move"),
|
|
this);
|
|
}
|
|
|
|
void MoveForwardingReferenceCheck::check(
|
|
const MatchFinder::MatchResult &Result) {
|
|
const auto *CallMove = Result.Nodes.getNodeAs<CallExpr>("call-move");
|
|
const auto *UnresolvedLookup =
|
|
Result.Nodes.getNodeAs<UnresolvedLookupExpr>("lookup");
|
|
const auto *ParmVar = Result.Nodes.getNodeAs<ParmVarDecl>("parm-var");
|
|
const auto *TypeParmDecl =
|
|
Result.Nodes.getNodeAs<TemplateTypeParmDecl>("type-parm-decl");
|
|
|
|
// Get the FunctionDecl and FunctionTemplateDecl containing the function
|
|
// parameter.
|
|
const auto *FuncForParam = dyn_cast<FunctionDecl>(ParmVar->getDeclContext());
|
|
if (!FuncForParam)
|
|
return;
|
|
const FunctionTemplateDecl *FuncTemplate =
|
|
FuncForParam->getDescribedFunctionTemplate();
|
|
if (!FuncTemplate)
|
|
return;
|
|
|
|
// Check that the template type parameter belongs to the same function
|
|
// template as the function parameter of that type. (This implies that type
|
|
// deduction will happen on the type.)
|
|
const TemplateParameterList *Params = FuncTemplate->getTemplateParameters();
|
|
if (!llvm::is_contained(*Params, TypeParmDecl))
|
|
return;
|
|
|
|
auto Diag = diag(CallMove->getExprLoc(),
|
|
"forwarding reference passed to std::move(), which may "
|
|
"unexpectedly cause lvalues to be moved; use "
|
|
"std::forward() instead");
|
|
|
|
replaceMoveWithForward(UnresolvedLookup, ParmVar, TypeParmDecl, Diag,
|
|
*Result.Context);
|
|
}
|
|
|
|
} // namespace clang::tidy::bugprone
|