
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
286 lines
8.9 KiB
C++
286 lines
8.9 KiB
C++
//===------------ Value.cpp - Definition of interpreter value -------------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file defines the class that used to represent a value in incremental
|
|
// C++.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "clang/Interpreter/Value.h"
|
|
#include "InterpreterUtils.h"
|
|
#include "clang/AST/ASTContext.h"
|
|
#include "clang/AST/Type.h"
|
|
#include "clang/Interpreter/Interpreter.h"
|
|
#include "llvm/ADT/StringExtras.h"
|
|
#include <cassert>
|
|
#include <utility>
|
|
|
|
using namespace clang;
|
|
|
|
namespace {
|
|
|
|
// This is internal buffer maintained by Value, used to hold temporaries.
|
|
class ValueStorage {
|
|
public:
|
|
using DtorFunc = void (*)(void *);
|
|
|
|
static unsigned char *CreatePayload(void *DtorF, size_t AllocSize,
|
|
size_t ElementsSize) {
|
|
if (AllocSize < sizeof(Canary))
|
|
AllocSize = sizeof(Canary);
|
|
unsigned char *Buf =
|
|
new unsigned char[ValueStorage::getPayloadOffset() + AllocSize];
|
|
ValueStorage *VS = new (Buf) ValueStorage(DtorF, AllocSize, ElementsSize);
|
|
std::memcpy(VS->getPayload(), Canary, sizeof(Canary));
|
|
return VS->getPayload();
|
|
}
|
|
|
|
unsigned char *getPayload() { return Storage; }
|
|
const unsigned char *getPayload() const { return Storage; }
|
|
|
|
static unsigned getPayloadOffset() {
|
|
static ValueStorage Dummy(nullptr, 0, 0);
|
|
return Dummy.getPayload() - reinterpret_cast<unsigned char *>(&Dummy);
|
|
}
|
|
|
|
static ValueStorage *getFromPayload(void *Payload) {
|
|
ValueStorage *R = reinterpret_cast<ValueStorage *>(
|
|
(unsigned char *)Payload - getPayloadOffset());
|
|
return R;
|
|
}
|
|
|
|
void Retain() { ++RefCnt; }
|
|
|
|
void Release() {
|
|
assert(RefCnt > 0 && "Can't release if reference count is already zero");
|
|
if (--RefCnt == 0) {
|
|
// We have a non-trivial dtor.
|
|
if (Dtor && IsAlive()) {
|
|
assert(Elements && "We at least should have 1 element in Value");
|
|
size_t Stride = AllocSize / Elements;
|
|
for (size_t Idx = 0; Idx < Elements; ++Idx)
|
|
(*Dtor)(getPayload() + Idx * Stride);
|
|
}
|
|
delete[] reinterpret_cast<unsigned char *>(this);
|
|
}
|
|
}
|
|
|
|
// Check whether the storage is valid by validating the canary bits.
|
|
// If someone accidentally write some invalid bits in the storage, the canary
|
|
// will be changed first, and `IsAlive` will return false then.
|
|
bool IsAlive() const {
|
|
return std::memcmp(getPayload(), Canary, sizeof(Canary)) != 0;
|
|
}
|
|
|
|
private:
|
|
ValueStorage(void *DtorF, size_t AllocSize, size_t ElementsNum)
|
|
: RefCnt(1), Dtor(reinterpret_cast<DtorFunc>(DtorF)),
|
|
AllocSize(AllocSize), Elements(ElementsNum) {}
|
|
|
|
mutable unsigned RefCnt;
|
|
DtorFunc Dtor = nullptr;
|
|
size_t AllocSize = 0;
|
|
size_t Elements = 0;
|
|
unsigned char Storage[1];
|
|
|
|
// These are some canary bits that are used for protecting the storage been
|
|
// damaged.
|
|
static constexpr unsigned char Canary[8] = {0x4c, 0x37, 0xad, 0x8f,
|
|
0x2d, 0x23, 0x95, 0x91};
|
|
};
|
|
} // namespace
|
|
|
|
namespace clang {
|
|
|
|
static Value::Kind ConvertQualTypeToKind(const ASTContext &Ctx, QualType QT) {
|
|
if (Ctx.hasSameType(QT, Ctx.VoidTy))
|
|
return Value::K_Void;
|
|
|
|
if (const auto *ET = QT->getAs<EnumType>())
|
|
QT = ET->getOriginalDecl()->getDefinitionOrSelf()->getIntegerType();
|
|
|
|
const auto *BT = QT->getAs<BuiltinType>();
|
|
if (!BT || BT->isNullPtrType())
|
|
return Value::K_PtrOrObj;
|
|
|
|
switch (QT->castAs<BuiltinType>()->getKind()) {
|
|
default:
|
|
assert(false && "Type not supported");
|
|
return Value::K_Unspecified;
|
|
#define X(type, name) \
|
|
case BuiltinType::name: \
|
|
return Value::K_##name;
|
|
REPL_BUILTIN_TYPES
|
|
#undef X
|
|
}
|
|
}
|
|
|
|
Value::Value(const Interpreter *In, void *Ty) : Interp(In), OpaqueType(Ty) {
|
|
const ASTContext &C = getASTContext();
|
|
setKind(ConvertQualTypeToKind(C, getType()));
|
|
if (ValueKind == K_PtrOrObj) {
|
|
QualType Canon = getType().getCanonicalType();
|
|
if ((Canon->isPointerType() || Canon->isObjectType() ||
|
|
Canon->isReferenceType()) &&
|
|
(Canon->isRecordType() || Canon->isConstantArrayType() ||
|
|
Canon->isMemberPointerType())) {
|
|
IsManuallyAlloc = true;
|
|
// Compile dtor function.
|
|
const Interpreter &Interp = getInterpreter();
|
|
void *DtorF = nullptr;
|
|
size_t ElementsSize = 1;
|
|
QualType DtorTy = getType();
|
|
|
|
if (const auto *ArrTy =
|
|
llvm::dyn_cast<ConstantArrayType>(DtorTy.getTypePtr())) {
|
|
DtorTy = ArrTy->getElementType();
|
|
llvm::APInt ArrSize(sizeof(size_t) * 8, 1);
|
|
do {
|
|
ArrSize *= ArrTy->getSize();
|
|
ArrTy = llvm::dyn_cast<ConstantArrayType>(
|
|
ArrTy->getElementType().getTypePtr());
|
|
} while (ArrTy);
|
|
ElementsSize = static_cast<size_t>(ArrSize.getZExtValue());
|
|
}
|
|
if (const auto *RT = DtorTy->getAs<RecordType>()) {
|
|
if (CXXRecordDecl *CXXRD =
|
|
llvm::dyn_cast<CXXRecordDecl>(RT->getOriginalDecl())) {
|
|
if (llvm::Expected<llvm::orc::ExecutorAddr> Addr =
|
|
Interp.CompileDtorCall(CXXRD->getDefinitionOrSelf()))
|
|
DtorF = reinterpret_cast<void *>(Addr->getValue());
|
|
else
|
|
llvm::logAllUnhandledErrors(Addr.takeError(), llvm::errs());
|
|
}
|
|
}
|
|
|
|
size_t AllocSize =
|
|
getASTContext().getTypeSizeInChars(getType()).getQuantity();
|
|
unsigned char *Payload =
|
|
ValueStorage::CreatePayload(DtorF, AllocSize, ElementsSize);
|
|
setPtr((void *)Payload);
|
|
}
|
|
}
|
|
}
|
|
|
|
Value::Value(const Value &RHS)
|
|
: Interp(RHS.Interp), OpaqueType(RHS.OpaqueType), Data(RHS.Data),
|
|
ValueKind(RHS.ValueKind), IsManuallyAlloc(RHS.IsManuallyAlloc) {
|
|
if (IsManuallyAlloc)
|
|
ValueStorage::getFromPayload(getPtr())->Retain();
|
|
}
|
|
|
|
Value::Value(Value &&RHS) noexcept {
|
|
Interp = std::exchange(RHS.Interp, nullptr);
|
|
OpaqueType = std::exchange(RHS.OpaqueType, nullptr);
|
|
Data = RHS.Data;
|
|
ValueKind = std::exchange(RHS.ValueKind, K_Unspecified);
|
|
IsManuallyAlloc = std::exchange(RHS.IsManuallyAlloc, false);
|
|
|
|
if (IsManuallyAlloc)
|
|
ValueStorage::getFromPayload(getPtr())->Release();
|
|
}
|
|
|
|
Value &Value::operator=(const Value &RHS) {
|
|
if (IsManuallyAlloc)
|
|
ValueStorage::getFromPayload(getPtr())->Release();
|
|
|
|
Interp = RHS.Interp;
|
|
OpaqueType = RHS.OpaqueType;
|
|
Data = RHS.Data;
|
|
ValueKind = RHS.ValueKind;
|
|
IsManuallyAlloc = RHS.IsManuallyAlloc;
|
|
|
|
if (IsManuallyAlloc)
|
|
ValueStorage::getFromPayload(getPtr())->Retain();
|
|
|
|
return *this;
|
|
}
|
|
|
|
Value &Value::operator=(Value &&RHS) noexcept {
|
|
if (this != &RHS) {
|
|
if (IsManuallyAlloc)
|
|
ValueStorage::getFromPayload(getPtr())->Release();
|
|
|
|
Interp = std::exchange(RHS.Interp, nullptr);
|
|
OpaqueType = std::exchange(RHS.OpaqueType, nullptr);
|
|
ValueKind = std::exchange(RHS.ValueKind, K_Unspecified);
|
|
IsManuallyAlloc = std::exchange(RHS.IsManuallyAlloc, false);
|
|
|
|
Data = RHS.Data;
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
void Value::clear() {
|
|
if (IsManuallyAlloc)
|
|
ValueStorage::getFromPayload(getPtr())->Release();
|
|
ValueKind = K_Unspecified;
|
|
OpaqueType = nullptr;
|
|
Interp = nullptr;
|
|
IsManuallyAlloc = false;
|
|
}
|
|
|
|
Value::~Value() { clear(); }
|
|
|
|
void *Value::getPtr() const {
|
|
assert(ValueKind == K_PtrOrObj);
|
|
return Data.m_Ptr;
|
|
}
|
|
|
|
void Value::setRawBits(void *Ptr, unsigned NBits /*= sizeof(Storage)*/) {
|
|
assert(NBits <= sizeof(Storage) && "Greater than the total size");
|
|
memcpy(/*dest=*/Data.m_RawBits, /*src=*/Ptr, /*nbytes=*/NBits / 8);
|
|
}
|
|
|
|
QualType Value::getType() const {
|
|
return QualType::getFromOpaquePtr(OpaqueType);
|
|
}
|
|
|
|
const Interpreter &Value::getInterpreter() const {
|
|
assert(Interp != nullptr &&
|
|
"Can't get interpreter from a default constructed value");
|
|
return *Interp;
|
|
}
|
|
|
|
const ASTContext &Value::getASTContext() const {
|
|
return getInterpreter().getASTContext();
|
|
}
|
|
|
|
void Value::dump() const { print(llvm::outs()); }
|
|
|
|
void Value::printType(llvm::raw_ostream &Out) const {
|
|
Out << Interp->ValueTypeToString(*this);
|
|
}
|
|
|
|
void Value::printData(llvm::raw_ostream &Out) const {
|
|
Out << Interp->ValueDataToString(*this);
|
|
}
|
|
// FIXME: We do not support the multiple inheritance case where one of the base
|
|
// classes has a pretty-printer and the other does not.
|
|
void Value::print(llvm::raw_ostream &Out) const {
|
|
assert(OpaqueType != nullptr && "Can't print default Value");
|
|
|
|
// Don't even try to print a void or an invalid type, it doesn't make sense.
|
|
if (getType()->isVoidType() || !isValid())
|
|
return;
|
|
|
|
// We need to get all the results together then print it, since `printType` is
|
|
// much faster than `printData`.
|
|
std::string Str;
|
|
llvm::raw_string_ostream SS(Str);
|
|
|
|
SS << "(";
|
|
printType(SS);
|
|
SS << ") ";
|
|
printData(SS);
|
|
SS << "\n";
|
|
Out << Str;
|
|
}
|
|
|
|
} // namespace clang
|