[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
//===--- ByteCodeExprGen.cpp - Code generator for expressions ---*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// 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 "ByteCodeExprGen.h"
|
|
|
|
#include "ByteCodeEmitter.h"
|
2022-08-19 13:45:11 +02:00
|
|
|
#include "ByteCodeStmtGen.h"
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
#include "Context.h"
|
2023-01-25 14:51:16 +01:00
|
|
|
#include "Floating.h"
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
#include "Function.h"
|
2024-02-25 14:03:47 +01:00
|
|
|
#include "InterpShared.h"
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
#include "PrimType.h"
|
|
|
|
#include "Program.h"
|
2024-02-25 14:03:47 +01:00
|
|
|
#include "clang/AST/Attr.h"
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
|
|
|
|
using namespace clang;
|
|
|
|
using namespace clang::interp;
|
|
|
|
|
|
|
|
using APSInt = llvm::APSInt;
|
|
|
|
|
|
|
|
namespace clang {
|
|
|
|
namespace interp {
|
|
|
|
|
|
|
|
/// Scope used to handle temporaries in toplevel variable declarations.
|
2023-03-06 19:05:54 +01:00
|
|
|
template <class Emitter> class DeclScope final : public VariableScope<Emitter> {
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
public:
|
2023-01-12 12:47:02 +01:00
|
|
|
DeclScope(ByteCodeExprGen<Emitter> *Ctx, const ValueDecl *VD)
|
2023-07-27 17:57:26 +02:00
|
|
|
: VariableScope<Emitter>(Ctx), Scope(Ctx->P, VD),
|
|
|
|
OldGlobalDecl(Ctx->GlobalDecl) {
|
|
|
|
Ctx->GlobalDecl = Context::shouldBeGloballyIndexed(VD);
|
|
|
|
}
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
|
|
|
|
void addExtended(const Scope::Local &Local) override {
|
|
|
|
return this->addLocal(Local);
|
|
|
|
}
|
|
|
|
|
2023-07-27 17:57:26 +02:00
|
|
|
~DeclScope() { this->Ctx->GlobalDecl = OldGlobalDecl; }
|
|
|
|
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
private:
|
|
|
|
Program::DeclScope Scope;
|
2023-07-27 17:57:26 +02:00
|
|
|
bool OldGlobalDecl;
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/// Scope used to handle initialization methods.
|
2023-04-30 19:37:03 +02:00
|
|
|
template <class Emitter> class OptionScope final {
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
public:
|
|
|
|
/// Root constructor, compiling or discarding primitives.
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
OptionScope(ByteCodeExprGen<Emitter> *Ctx, bool NewDiscardResult,
|
|
|
|
bool NewInitializing)
|
|
|
|
: Ctx(Ctx), OldDiscardResult(Ctx->DiscardResult),
|
|
|
|
OldInitializing(Ctx->Initializing) {
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
Ctx->DiscardResult = NewDiscardResult;
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
Ctx->Initializing = NewInitializing;
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
~OptionScope() {
|
|
|
|
Ctx->DiscardResult = OldDiscardResult;
|
|
|
|
Ctx->Initializing = OldInitializing;
|
|
|
|
}
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
|
|
|
|
private:
|
|
|
|
/// Parent context.
|
|
|
|
ByteCodeExprGen<Emitter> *Ctx;
|
|
|
|
/// Old discard flag to restore.
|
|
|
|
bool OldDiscardResult;
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
bool OldInitializing;
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
} // namespace interp
|
|
|
|
} // namespace clang
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCastExpr(const CastExpr *CE) {
|
2023-11-27 11:17:15 +01:00
|
|
|
const Expr *SubExpr = CE->getSubExpr();
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
switch (CE->getCastKind()) {
|
|
|
|
|
|
|
|
case CK_LValueToRValue: {
|
2024-02-01 12:06:49 +01:00
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
|
|
|
|
2024-03-12 15:27:35 +01:00
|
|
|
std::optional<PrimType> SubExprT = classify(SubExpr->getType());
|
|
|
|
// Prepare storage for the result.
|
|
|
|
if (!Initializing && !SubExprT) {
|
|
|
|
std::optional<unsigned> LocalIndex =
|
|
|
|
allocateLocal(SubExpr, /*IsExtended=*/false);
|
|
|
|
if (!LocalIndex)
|
|
|
|
return false;
|
|
|
|
if (!this->emitGetPtrLocal(*LocalIndex, CE))
|
|
|
|
return false;
|
|
|
|
}
|
2024-02-21 08:12:31 +01:00
|
|
|
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
|
2024-03-12 15:27:35 +01:00
|
|
|
if (SubExprT)
|
2024-02-21 08:12:31 +01:00
|
|
|
return this->emitLoadPop(*SubExprT, CE);
|
2024-03-12 15:27:35 +01:00
|
|
|
|
|
|
|
// If the subexpr type is not primitive, we need to perform a copy here.
|
|
|
|
// This happens for example in C when dereferencing a pointer of struct
|
|
|
|
// type.
|
|
|
|
return this->emitMemcpy(CE);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
|
|
|
|
2022-11-07 14:19:48 +01:00
|
|
|
case CK_UncheckedDerivedToBase:
|
|
|
|
case CK_DerivedToBase: {
|
2022-10-14 08:19:53 +02:00
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
|
2023-04-24 16:45:16 +02:00
|
|
|
unsigned DerivedOffset = collectBaseOffset(getRecordTy(CE->getType()),
|
|
|
|
getRecordTy(SubExpr->getType()));
|
|
|
|
|
|
|
|
return this->emitGetPtrBasePop(DerivedOffset, CE);
|
|
|
|
}
|
|
|
|
|
|
|
|
case CK_BaseToDerived: {
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
unsigned DerivedOffset = collectBaseOffset(getRecordTy(SubExpr->getType()),
|
|
|
|
getRecordTy(CE->getType()));
|
|
|
|
|
|
|
|
return this->emitGetPtrDerivedPop(DerivedOffset, CE);
|
2022-10-14 08:19:53 +02:00
|
|
|
}
|
|
|
|
|
2023-01-25 14:51:16 +01:00
|
|
|
case CK_FloatingCast: {
|
2024-01-10 20:19:04 +01:00
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
2023-01-25 14:51:16 +01:00
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
2023-03-27 15:03:01 +02:00
|
|
|
const auto *TargetSemantics = &Ctx.getFloatSemantics(CE->getType());
|
2023-01-25 14:51:16 +01:00
|
|
|
return this->emitCastFP(TargetSemantics, getRoundingMode(CE), CE);
|
|
|
|
}
|
|
|
|
|
|
|
|
case CK_IntegralToFloating: {
|
2024-01-10 20:19:04 +01:00
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
2023-01-25 14:51:16 +01:00
|
|
|
std::optional<PrimType> FromT = classify(SubExpr->getType());
|
|
|
|
if (!FromT)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
|
2023-03-27 15:03:01 +02:00
|
|
|
const auto *TargetSemantics = &Ctx.getFloatSemantics(CE->getType());
|
2023-01-25 14:51:16 +01:00
|
|
|
llvm::RoundingMode RM = getRoundingMode(CE);
|
|
|
|
return this->emitCastIntegralFloating(*FromT, TargetSemantics, RM, CE);
|
|
|
|
}
|
|
|
|
|
|
|
|
case CK_FloatingToBoolean:
|
|
|
|
case CK_FloatingToIntegral: {
|
2024-01-10 20:19:04 +01:00
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
|
|
|
|
2023-01-25 14:51:16 +01:00
|
|
|
std::optional<PrimType> ToT = classify(CE->getType());
|
|
|
|
|
|
|
|
if (!ToT)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
|
2023-10-11 08:53:21 +02:00
|
|
|
if (ToT == PT_IntAP)
|
|
|
|
return this->emitCastFloatingIntegralAP(Ctx.getBitWidth(CE->getType()),
|
|
|
|
CE);
|
|
|
|
if (ToT == PT_IntAPS)
|
|
|
|
return this->emitCastFloatingIntegralAPS(Ctx.getBitWidth(CE->getType()),
|
|
|
|
CE);
|
|
|
|
|
2023-01-25 14:51:16 +01:00
|
|
|
return this->emitCastFloatingIntegral(*ToT, CE);
|
|
|
|
}
|
|
|
|
|
2024-04-10 12:53:54 +02:00
|
|
|
case CK_NullToPointer: {
|
2023-01-11 12:12:52 +01:00
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
2024-04-10 12:53:54 +02:00
|
|
|
|
|
|
|
const Descriptor *Desc = nullptr;
|
|
|
|
const QualType PointeeType = CE->getType()->getPointeeType();
|
|
|
|
if (!PointeeType.isNull()) {
|
|
|
|
if (std::optional<PrimType> T = classify(PointeeType))
|
|
|
|
Desc = P.createDescriptor(SubExpr, *T);
|
|
|
|
}
|
|
|
|
return this->emitNull(classifyPrim(CE->getType()), Desc, CE);
|
|
|
|
}
|
2023-01-11 12:12:52 +01:00
|
|
|
|
2023-05-19 11:12:05 +02:00
|
|
|
case CK_PointerToIntegral: {
|
2024-02-13 06:56:58 +01:00
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
|
|
|
|
2023-05-19 11:12:05 +02:00
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
PrimType T = classifyPrim(CE->getType());
|
|
|
|
return this->emitCastPointerIntegral(T, CE);
|
|
|
|
}
|
|
|
|
|
2023-10-26 13:53:54 +02:00
|
|
|
case CK_ArrayToPointerDecay: {
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
if (!this->emitArrayDecay(CE))
|
|
|
|
return false;
|
|
|
|
if (DiscardResult)
|
|
|
|
return this->emitPopPtr(CE);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2024-04-10 12:53:54 +02:00
|
|
|
case CK_IntegralToPointer: {
|
|
|
|
QualType IntType = SubExpr->getType();
|
|
|
|
assert(IntType->isIntegralOrEnumerationType());
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
// FIXME: I think the discard is wrong since the int->ptr cast might cause a
|
|
|
|
// diagnostic.
|
|
|
|
PrimType T = classifyPrim(IntType);
|
|
|
|
if (DiscardResult)
|
|
|
|
return this->emitPop(T, CE);
|
|
|
|
|
|
|
|
QualType PtrType = CE->getType();
|
|
|
|
assert(PtrType->isPointerType());
|
|
|
|
|
|
|
|
const Descriptor *Desc;
|
|
|
|
if (std::optional<PrimType> T = classify(PtrType->getPointeeType()))
|
|
|
|
Desc = P.createDescriptor(SubExpr, *T);
|
|
|
|
else if (PtrType->getPointeeType()->isVoidType())
|
|
|
|
Desc = nullptr;
|
|
|
|
else
|
|
|
|
Desc = P.createDescriptor(CE, PtrType->getPointeeType().getTypePtr(),
|
|
|
|
Descriptor::InlineDescMD, true, false,
|
|
|
|
/*IsMutable=*/false, nullptr);
|
|
|
|
|
|
|
|
if (!this->emitGetIntPtr(T, Desc, CE))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
PrimType DestPtrT = classifyPrim(PtrType);
|
|
|
|
if (DestPtrT == PT_Ptr)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// In case we're converting the integer to a non-Pointer.
|
|
|
|
return this->emitDecayPtr(PT_Ptr, DestPtrT, CE);
|
|
|
|
}
|
|
|
|
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
case CK_AtomicToNonAtomic:
|
|
|
|
case CK_ConstructorConversion:
|
|
|
|
case CK_FunctionToPointerDecay:
|
|
|
|
case CK_NonAtomicToAtomic:
|
|
|
|
case CK_NoOp:
|
|
|
|
case CK_UserDefinedConversion:
|
2024-02-05 15:28:41 +01:00
|
|
|
return this->delegate(SubExpr);
|
|
|
|
|
2024-04-10 12:53:54 +02:00
|
|
|
case CK_BitCast: {
|
|
|
|
// Reject bitcasts to atomic types.
|
2024-02-05 15:28:41 +01:00
|
|
|
if (CE->getType()->isAtomicType()) {
|
|
|
|
if (!this->discard(SubExpr))
|
|
|
|
return false;
|
|
|
|
return this->emitInvalidCast(CastKind::Reinterpret, CE);
|
|
|
|
}
|
2024-04-10 12:53:54 +02:00
|
|
|
|
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
|
|
|
|
|
|
|
std::optional<PrimType> FromT = classify(SubExpr->getType());
|
2024-04-12 10:43:14 +02:00
|
|
|
std::optional<PrimType> ToT = classify(CE->getType());
|
2024-04-10 12:53:54 +02:00
|
|
|
if (!FromT || !ToT)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
assert(isPtrType(*FromT));
|
|
|
|
assert(isPtrType(*ToT));
|
|
|
|
if (FromT == ToT)
|
|
|
|
return this->delegate(SubExpr);
|
|
|
|
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
return this->emitDecayPtr(*FromT, *ToT, CE);
|
|
|
|
}
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
|
2022-08-26 15:39:17 +02:00
|
|
|
case CK_IntegralToBoolean:
|
2022-08-09 08:08:48 +02:00
|
|
|
case CK_IntegralCast: {
|
2023-09-09 11:04:49 +02:00
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
2022-12-05 17:30:24 +01:00
|
|
|
std::optional<PrimType> FromT = classify(SubExpr->getType());
|
|
|
|
std::optional<PrimType> ToT = classify(CE->getType());
|
2023-09-30 20:12:59 +02:00
|
|
|
|
2022-08-09 08:08:48 +02:00
|
|
|
if (!FromT || !ToT)
|
|
|
|
return false;
|
|
|
|
|
2022-10-21 08:46:33 +02:00
|
|
|
if (!this->visit(SubExpr))
|
2022-08-09 08:08:48 +02:00
|
|
|
return false;
|
|
|
|
|
2023-10-11 08:53:21 +02:00
|
|
|
if (ToT == PT_IntAP)
|
|
|
|
return this->emitCastAP(*FromT, Ctx.getBitWidth(CE->getType()), CE);
|
|
|
|
if (ToT == PT_IntAPS)
|
|
|
|
return this->emitCastAPS(*FromT, Ctx.getBitWidth(CE->getType()), CE);
|
|
|
|
|
2023-11-06 15:13:43 +01:00
|
|
|
if (FromT == ToT)
|
|
|
|
return true;
|
2022-08-09 08:08:48 +02:00
|
|
|
return this->emitCast(*FromT, *ToT, CE);
|
|
|
|
}
|
|
|
|
|
2023-04-22 06:40:54 +02:00
|
|
|
case CK_PointerToBoolean: {
|
2023-08-01 14:56:21 +02:00
|
|
|
PrimType PtrT = classifyPrim(SubExpr->getType());
|
|
|
|
|
2023-04-22 06:40:54 +02:00
|
|
|
// Just emit p != nullptr for this.
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
|
2024-04-10 12:53:54 +02:00
|
|
|
if (!this->emitNull(PtrT, nullptr, CE))
|
2023-04-22 06:40:54 +02:00
|
|
|
return false;
|
|
|
|
|
2023-08-01 14:56:21 +02:00
|
|
|
return this->emitNE(PtrT, CE);
|
2023-04-22 06:40:54 +02:00
|
|
|
}
|
|
|
|
|
2023-05-16 12:04:04 +02:00
|
|
|
case CK_IntegralComplexToBoolean:
|
|
|
|
case CK_FloatingComplexToBoolean: {
|
2024-02-20 10:27:41 +01:00
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
2023-04-15 14:20:35 +02:00
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
2024-02-20 10:27:41 +01:00
|
|
|
return this->emitComplexBoolCast(SubExpr);
|
2023-04-15 14:20:35 +02:00
|
|
|
}
|
|
|
|
|
2024-01-18 13:55:04 +01:00
|
|
|
case CK_IntegralComplexToReal:
|
|
|
|
case CK_FloatingComplexToReal:
|
|
|
|
return this->emitComplexReal(SubExpr);
|
|
|
|
|
2024-01-19 09:27:30 +01:00
|
|
|
case CK_IntegralRealToComplex:
|
|
|
|
case CK_FloatingRealToComplex: {
|
|
|
|
// We're creating a complex value here, so we need to
|
|
|
|
// allocate storage for it.
|
|
|
|
if (!Initializing) {
|
|
|
|
std::optional<unsigned> LocalIndex =
|
|
|
|
allocateLocal(CE, /*IsExtended=*/true);
|
|
|
|
if (!LocalIndex)
|
|
|
|
return false;
|
|
|
|
if (!this->emitGetPtrLocal(*LocalIndex, CE))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Init the complex value to {SubExpr, 0}.
|
|
|
|
if (!this->visitArrayElemInit(0, SubExpr))
|
|
|
|
return false;
|
|
|
|
// Zero-init the second element.
|
|
|
|
PrimType T = classifyPrim(SubExpr->getType());
|
|
|
|
if (!this->visitZeroInitializer(T, SubExpr->getType(), SubExpr))
|
|
|
|
return false;
|
|
|
|
return this->emitInitElem(T, 1, SubExpr);
|
|
|
|
}
|
|
|
|
|
2024-01-31 16:53:33 +01:00
|
|
|
case CK_IntegralComplexCast:
|
|
|
|
case CK_FloatingComplexCast:
|
|
|
|
case CK_IntegralComplexToFloatingComplex:
|
|
|
|
case CK_FloatingComplexToIntegralComplex: {
|
|
|
|
assert(CE->getType()->isAnyComplexType());
|
|
|
|
assert(SubExpr->getType()->isAnyComplexType());
|
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
|
|
|
|
|
|
|
if (!Initializing) {
|
|
|
|
std::optional<unsigned> LocalIndex =
|
|
|
|
allocateLocal(CE, /*IsExtended=*/true);
|
|
|
|
if (!LocalIndex)
|
|
|
|
return false;
|
|
|
|
if (!this->emitGetPtrLocal(*LocalIndex, CE))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Location for the SubExpr.
|
|
|
|
// Since SubExpr is of complex type, visiting it results in a pointer
|
|
|
|
// anyway, so we just create a temporary pointer variable.
|
2024-03-14 10:53:52 +01:00
|
|
|
unsigned SubExprOffset = allocateLocalPrimitive(
|
2024-01-31 16:53:33 +01:00
|
|
|
SubExpr, PT_Ptr, /*IsConst=*/true, /*IsExtended=*/false);
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
2024-03-14 10:53:52 +01:00
|
|
|
if (!this->emitSetLocal(PT_Ptr, SubExprOffset, CE))
|
2024-01-31 16:53:33 +01:00
|
|
|
return false;
|
|
|
|
|
2024-01-31 16:59:55 +01:00
|
|
|
PrimType SourceElemT = classifyComplexElementType(SubExpr->getType());
|
2024-01-31 16:53:33 +01:00
|
|
|
QualType DestElemType =
|
|
|
|
CE->getType()->getAs<ComplexType>()->getElementType();
|
|
|
|
PrimType DestElemT = classifyPrim(DestElemType);
|
|
|
|
// Cast both elements individually.
|
|
|
|
for (unsigned I = 0; I != 2; ++I) {
|
2024-03-14 10:53:52 +01:00
|
|
|
if (!this->emitGetLocal(PT_Ptr, SubExprOffset, CE))
|
2024-01-31 16:53:33 +01:00
|
|
|
return false;
|
2024-03-07 17:29:42 +01:00
|
|
|
if (!this->emitArrayElemPop(SourceElemT, I, CE))
|
2024-01-31 16:53:33 +01:00
|
|
|
return false;
|
|
|
|
|
|
|
|
// Do the cast.
|
|
|
|
if (!this->emitPrimCast(SourceElemT, DestElemT, DestElemType, CE))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Save the value.
|
|
|
|
if (!this->emitInitElem(DestElemT, I, CE))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2024-01-23 14:04:10 +01:00
|
|
|
case CK_ToVoid:
|
|
|
|
return discard(SubExpr);
|
|
|
|
|
2022-08-09 08:08:48 +02:00
|
|
|
default:
|
2024-02-21 17:21:44 +01:00
|
|
|
return this->emitInvalid(CE);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
2022-08-19 17:37:26 +01:00
|
|
|
llvm_unreachable("Unhandled clang::CastKind enum");
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitIntegerLiteral(const IntegerLiteral *LE) {
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
2022-10-30 10:05:42 +01:00
|
|
|
return this->emitConst(LE->getValue(), LE);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
|
|
|
|
2023-01-25 14:51:16 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitFloatingLiteral(const FloatingLiteral *E) {
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return this->emitConstFloat(E->getValue(), E);
|
|
|
|
}
|
|
|
|
|
2024-02-01 07:13:10 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitImaginaryLiteral(
|
|
|
|
const ImaginaryLiteral *E) {
|
|
|
|
assert(E->getType()->isAnyComplexType());
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
if (!Initializing) {
|
|
|
|
std::optional<unsigned> LocalIndex = allocateLocal(E, /*IsExtended=*/false);
|
|
|
|
if (!LocalIndex)
|
|
|
|
return false;
|
|
|
|
if (!this->emitGetPtrLocal(*LocalIndex, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
const Expr *SubExpr = E->getSubExpr();
|
|
|
|
PrimType SubExprT = classifyPrim(SubExpr->getType());
|
|
|
|
|
|
|
|
if (!this->visitZeroInitializer(SubExprT, SubExpr->getType(), SubExpr))
|
|
|
|
return false;
|
|
|
|
if (!this->emitInitElem(SubExprT, 0, SubExpr))
|
|
|
|
return false;
|
|
|
|
return this->visitArrayElemInit(1, SubExpr);
|
|
|
|
}
|
|
|
|
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
template <class Emitter>
|
2023-09-09 11:07:26 +02:00
|
|
|
bool ByteCodeExprGen<Emitter>::VisitParenExpr(const ParenExpr *E) {
|
|
|
|
return this->delegate(E->getSubExpr());
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitBinaryOperator(const BinaryOperator *BO) {
|
2022-12-31 20:04:41 +01:00
|
|
|
// Need short-circuiting for these.
|
|
|
|
if (BO->isLogicalOp())
|
|
|
|
return this->VisitLogicalBinOp(BO);
|
|
|
|
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
const Expr *LHS = BO->getLHS();
|
|
|
|
const Expr *RHS = BO->getRHS();
|
|
|
|
|
2024-03-18 14:55:29 +01:00
|
|
|
// Handle comma operators. Just discard the LHS
|
|
|
|
// and delegate to RHS.
|
|
|
|
if (BO->isCommaOp()) {
|
|
|
|
if (!this->discard(LHS))
|
|
|
|
return false;
|
|
|
|
if (RHS->getType()->isVoidType())
|
|
|
|
return this->discard(RHS);
|
|
|
|
|
|
|
|
return this->delegate(RHS);
|
|
|
|
}
|
|
|
|
|
2024-03-07 15:31:40 +01:00
|
|
|
if (BO->getType()->isAnyComplexType())
|
|
|
|
return this->VisitComplexBinOp(BO);
|
|
|
|
if ((LHS->getType()->isAnyComplexType() ||
|
|
|
|
RHS->getType()->isAnyComplexType()) &&
|
|
|
|
BO->isComparisonOp())
|
|
|
|
return this->emitComplexComparison(LHS, RHS, BO);
|
|
|
|
|
2023-02-16 08:37:03 +01:00
|
|
|
if (BO->isPtrMemOp())
|
|
|
|
return this->visit(RHS);
|
|
|
|
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
// Typecheck the args.
|
2022-12-05 17:30:24 +01:00
|
|
|
std::optional<PrimType> LT = classify(LHS->getType());
|
|
|
|
std::optional<PrimType> RT = classify(RHS->getType());
|
|
|
|
std::optional<PrimType> T = classify(BO->getType());
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
|
2023-09-29 09:41:58 +02:00
|
|
|
// Special case for C++'s three-way/spaceship operator <=>, which
|
|
|
|
// returns a std::{strong,weak,partial}_ordering (which is a class, so doesn't
|
|
|
|
// have a PrimType).
|
2024-02-09 09:18:47 +01:00
|
|
|
if (!T && BO->getOpcode() == BO_Cmp) {
|
2023-09-29 09:41:58 +02:00
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
const ComparisonCategoryInfo *CmpInfo =
|
|
|
|
Ctx.getASTContext().CompCategories.lookupInfoForType(BO->getType());
|
|
|
|
assert(CmpInfo);
|
|
|
|
|
|
|
|
// We need a temporary variable holding our return value.
|
|
|
|
if (!Initializing) {
|
|
|
|
std::optional<unsigned> ResultIndex = this->allocateLocal(BO, false);
|
|
|
|
if (!this->emitGetPtrLocal(*ResultIndex, BO))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!visit(LHS) || !visit(RHS))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return this->emitCMP3(*LT, CmpInfo, BO);
|
|
|
|
}
|
|
|
|
|
2023-02-16 08:37:03 +01:00
|
|
|
if (!LT || !RT || !T)
|
2024-01-19 10:08:03 +01:00
|
|
|
return false;
|
2023-02-16 08:37:03 +01:00
|
|
|
|
2022-10-13 10:09:36 +02:00
|
|
|
// Pointer arithmetic special case.
|
|
|
|
if (BO->getOpcode() == BO_Add || BO->getOpcode() == BO_Sub) {
|
2024-04-10 12:53:54 +02:00
|
|
|
if (isPtrType(*T) || (isPtrType(*LT) && isPtrType(*RT)))
|
2022-10-13 10:09:36 +02:00
|
|
|
return this->VisitPointerArithBinOp(BO);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!visit(LHS) || !visit(RHS))
|
|
|
|
return false;
|
|
|
|
|
2023-06-01 09:48:04 +02:00
|
|
|
// For languages such as C, cast the result of one
|
|
|
|
// of our comparision opcodes to T (which is usually int).
|
|
|
|
auto MaybeCastToBool = [this, T, BO](bool Result) {
|
|
|
|
if (!Result)
|
|
|
|
return false;
|
|
|
|
if (DiscardResult)
|
|
|
|
return this->emitPop(*T, BO);
|
|
|
|
if (T != PT_Bool)
|
|
|
|
return this->emitCast(PT_Bool, *T, BO);
|
|
|
|
return true;
|
|
|
|
};
|
|
|
|
|
2023-09-14 11:08:51 +02:00
|
|
|
auto Discard = [this, T, BO](bool Result) {
|
|
|
|
if (!Result)
|
|
|
|
return false;
|
|
|
|
return DiscardResult ? this->emitPop(*T, BO) : true;
|
|
|
|
};
|
|
|
|
|
2022-10-13 10:09:36 +02:00
|
|
|
switch (BO->getOpcode()) {
|
|
|
|
case BO_EQ:
|
2023-06-01 09:48:04 +02:00
|
|
|
return MaybeCastToBool(this->emitEQ(*LT, BO));
|
2022-10-13 10:09:36 +02:00
|
|
|
case BO_NE:
|
2023-06-01 09:48:04 +02:00
|
|
|
return MaybeCastToBool(this->emitNE(*LT, BO));
|
2022-10-13 10:09:36 +02:00
|
|
|
case BO_LT:
|
2023-06-01 09:48:04 +02:00
|
|
|
return MaybeCastToBool(this->emitLT(*LT, BO));
|
2022-10-13 10:09:36 +02:00
|
|
|
case BO_LE:
|
2023-06-01 09:48:04 +02:00
|
|
|
return MaybeCastToBool(this->emitLE(*LT, BO));
|
2022-10-13 10:09:36 +02:00
|
|
|
case BO_GT:
|
2023-06-01 09:48:04 +02:00
|
|
|
return MaybeCastToBool(this->emitGT(*LT, BO));
|
2022-10-13 10:09:36 +02:00
|
|
|
case BO_GE:
|
2023-06-01 09:48:04 +02:00
|
|
|
return MaybeCastToBool(this->emitGE(*LT, BO));
|
2022-10-13 10:09:36 +02:00
|
|
|
case BO_Sub:
|
2023-01-25 14:51:16 +01:00
|
|
|
if (BO->getType()->isFloatingType())
|
|
|
|
return Discard(this->emitSubf(getRoundingMode(BO), BO));
|
2022-10-13 10:09:36 +02:00
|
|
|
return Discard(this->emitSub(*T, BO));
|
|
|
|
case BO_Add:
|
2023-01-25 14:51:16 +01:00
|
|
|
if (BO->getType()->isFloatingType())
|
|
|
|
return Discard(this->emitAddf(getRoundingMode(BO), BO));
|
2022-10-13 10:09:36 +02:00
|
|
|
return Discard(this->emitAdd(*T, BO));
|
|
|
|
case BO_Mul:
|
2023-01-25 14:51:16 +01:00
|
|
|
if (BO->getType()->isFloatingType())
|
|
|
|
return Discard(this->emitMulf(getRoundingMode(BO), BO));
|
2022-10-13 10:09:36 +02:00
|
|
|
return Discard(this->emitMul(*T, BO));
|
|
|
|
case BO_Rem:
|
|
|
|
return Discard(this->emitRem(*T, BO));
|
|
|
|
case BO_Div:
|
2023-01-25 14:51:16 +01:00
|
|
|
if (BO->getType()->isFloatingType())
|
|
|
|
return Discard(this->emitDivf(getRoundingMode(BO), BO));
|
2022-10-13 10:09:36 +02:00
|
|
|
return Discard(this->emitDiv(*T, BO));
|
|
|
|
case BO_Assign:
|
2022-10-21 12:26:05 +02:00
|
|
|
if (DiscardResult)
|
2023-08-10 09:19:05 +02:00
|
|
|
return LHS->refersToBitField() ? this->emitStoreBitFieldPop(*T, BO)
|
|
|
|
: this->emitStorePop(*T, BO);
|
2024-02-20 12:26:15 +01:00
|
|
|
if (LHS->refersToBitField()) {
|
|
|
|
if (!this->emitStoreBitField(*T, BO))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (!this->emitStore(*T, BO))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
// Assignments aren't necessarily lvalues in C.
|
|
|
|
// Load from them in that case.
|
|
|
|
if (!BO->isLValue())
|
|
|
|
return this->emitLoadPop(*T, BO);
|
|
|
|
return true;
|
2022-10-13 10:09:36 +02:00
|
|
|
case BO_And:
|
|
|
|
return Discard(this->emitBitAnd(*T, BO));
|
|
|
|
case BO_Or:
|
|
|
|
return Discard(this->emitBitOr(*T, BO));
|
|
|
|
case BO_Shl:
|
|
|
|
return Discard(this->emitShl(*LT, *RT, BO));
|
|
|
|
case BO_Shr:
|
|
|
|
return Discard(this->emitShr(*LT, *RT, BO));
|
|
|
|
case BO_Xor:
|
|
|
|
return Discard(this->emitBitXor(*T, BO));
|
|
|
|
case BO_LOr:
|
2022-12-31 20:04:41 +01:00
|
|
|
case BO_LAnd:
|
|
|
|
llvm_unreachable("Already handled earlier");
|
2022-10-13 10:09:36 +02:00
|
|
|
default:
|
2024-01-19 10:08:03 +01:00
|
|
|
return false;
|
2022-10-13 10:09:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
llvm_unreachable("Unhandled binary op");
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Perform addition/subtraction of a pointer and an integer or
|
|
|
|
/// subtraction of two pointers.
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitPointerArithBinOp(const BinaryOperator *E) {
|
|
|
|
BinaryOperatorKind Op = E->getOpcode();
|
|
|
|
const Expr *LHS = E->getLHS();
|
|
|
|
const Expr *RHS = E->getRHS();
|
|
|
|
|
|
|
|
if ((Op != BO_Add && Op != BO_Sub) ||
|
|
|
|
(!LHS->getType()->isPointerType() && !RHS->getType()->isPointerType()))
|
|
|
|
return false;
|
|
|
|
|
2022-12-05 17:30:24 +01:00
|
|
|
std::optional<PrimType> LT = classify(LHS);
|
|
|
|
std::optional<PrimType> RT = classify(RHS);
|
2022-10-13 10:09:36 +02:00
|
|
|
|
|
|
|
if (!LT || !RT)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (LHS->getType()->isPointerType() && RHS->getType()->isPointerType()) {
|
|
|
|
if (Op != BO_Sub)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
assert(E->getType()->isIntegerType());
|
|
|
|
if (!visit(RHS) || !visit(LHS))
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
return false;
|
|
|
|
|
2022-10-13 10:09:36 +02:00
|
|
|
return this->emitSubPtr(classifyPrim(E->getType()), E);
|
|
|
|
}
|
|
|
|
|
|
|
|
PrimType OffsetType;
|
|
|
|
if (LHS->getType()->isIntegerType()) {
|
|
|
|
if (!visit(RHS) || !visit(LHS))
|
|
|
|
return false;
|
|
|
|
OffsetType = *LT;
|
|
|
|
} else if (RHS->getType()->isIntegerType()) {
|
|
|
|
if (!visit(LHS) || !visit(RHS))
|
|
|
|
return false;
|
|
|
|
OffsetType = *RT;
|
|
|
|
} else {
|
|
|
|
return false;
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
|
|
|
|
2022-10-13 10:09:36 +02:00
|
|
|
if (Op == BO_Add)
|
|
|
|
return this->emitAddOffset(OffsetType, E);
|
|
|
|
else if (Op == BO_Sub)
|
|
|
|
return this->emitSubOffset(OffsetType, E);
|
|
|
|
|
2024-01-19 10:08:03 +01:00
|
|
|
return false;
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
|
|
|
|
2022-12-31 20:04:41 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitLogicalBinOp(const BinaryOperator *E) {
|
|
|
|
assert(E->isLogicalOp());
|
|
|
|
BinaryOperatorKind Op = E->getOpcode();
|
|
|
|
const Expr *LHS = E->getLHS();
|
|
|
|
const Expr *RHS = E->getRHS();
|
2023-08-05 07:47:22 +02:00
|
|
|
std::optional<PrimType> T = classify(E->getType());
|
2022-12-31 20:04:41 +01:00
|
|
|
|
|
|
|
if (Op == BO_LOr) {
|
|
|
|
// Logical OR. Visit LHS and only evaluate RHS if LHS was FALSE.
|
|
|
|
LabelTy LabelTrue = this->getLabel();
|
|
|
|
LabelTy LabelEnd = this->getLabel();
|
|
|
|
|
2023-08-05 07:47:22 +02:00
|
|
|
if (!this->visitBool(LHS))
|
2022-12-31 20:04:41 +01:00
|
|
|
return false;
|
|
|
|
if (!this->jumpTrue(LabelTrue))
|
|
|
|
return false;
|
|
|
|
|
2023-08-05 07:47:22 +02:00
|
|
|
if (!this->visitBool(RHS))
|
2022-12-31 20:04:41 +01:00
|
|
|
return false;
|
|
|
|
if (!this->jump(LabelEnd))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
this->emitLabel(LabelTrue);
|
|
|
|
this->emitConstBool(true, E);
|
|
|
|
this->fallthrough(LabelEnd);
|
|
|
|
this->emitLabel(LabelEnd);
|
|
|
|
|
2023-08-05 07:47:22 +02:00
|
|
|
} else {
|
|
|
|
assert(Op == BO_LAnd);
|
|
|
|
// Logical AND.
|
|
|
|
// Visit LHS. Only visit RHS if LHS was TRUE.
|
|
|
|
LabelTy LabelFalse = this->getLabel();
|
|
|
|
LabelTy LabelEnd = this->getLabel();
|
2022-12-31 20:04:41 +01:00
|
|
|
|
2023-08-05 07:47:22 +02:00
|
|
|
if (!this->visitBool(LHS))
|
|
|
|
return false;
|
|
|
|
if (!this->jumpFalse(LabelFalse))
|
|
|
|
return false;
|
2022-12-31 20:04:41 +01:00
|
|
|
|
2023-08-05 07:47:22 +02:00
|
|
|
if (!this->visitBool(RHS))
|
|
|
|
return false;
|
|
|
|
if (!this->jump(LabelEnd))
|
|
|
|
return false;
|
2022-12-31 20:04:41 +01:00
|
|
|
|
2023-08-05 07:47:22 +02:00
|
|
|
this->emitLabel(LabelFalse);
|
|
|
|
this->emitConstBool(false, E);
|
|
|
|
this->fallthrough(LabelEnd);
|
|
|
|
this->emitLabel(LabelEnd);
|
|
|
|
}
|
2022-12-31 20:04:41 +01:00
|
|
|
|
|
|
|
if (DiscardResult)
|
|
|
|
return this->emitPopBool(E);
|
|
|
|
|
2023-08-05 07:47:22 +02:00
|
|
|
// For C, cast back to integer type.
|
|
|
|
assert(T);
|
|
|
|
if (T != PT_Bool)
|
|
|
|
return this->emitCast(PT_Bool, *T, E);
|
2022-12-31 20:04:41 +01:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2023-05-16 14:54:56 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitComplexBinOp(const BinaryOperator *E) {
|
2024-01-31 14:17:00 +01:00
|
|
|
// Prepare storage for result.
|
|
|
|
if (!Initializing) {
|
|
|
|
std::optional<unsigned> LocalIndex = allocateLocal(E, /*IsExtended=*/false);
|
|
|
|
if (!LocalIndex)
|
|
|
|
return false;
|
|
|
|
if (!this->emitGetPtrLocal(*LocalIndex, E))
|
|
|
|
return false;
|
|
|
|
}
|
2023-12-15 13:24:03 +01:00
|
|
|
|
2024-02-26 08:24:19 +01:00
|
|
|
// Both LHS and RHS might _not_ be of complex type, but one of them
|
|
|
|
// needs to be.
|
2023-05-16 14:54:56 +02:00
|
|
|
const Expr *LHS = E->getLHS();
|
|
|
|
const Expr *RHS = E->getRHS();
|
|
|
|
|
2024-02-26 08:24:19 +01:00
|
|
|
PrimType ResultElemT = this->classifyComplexElementType(E->getType());
|
2023-05-16 14:54:56 +02:00
|
|
|
unsigned ResultOffset = ~0u;
|
2024-02-26 08:24:19 +01:00
|
|
|
if (!DiscardResult)
|
2023-05-16 14:54:56 +02:00
|
|
|
ResultOffset = this->allocateLocalPrimitive(E, PT_Ptr, true, false);
|
|
|
|
|
|
|
|
// Save result pointer in ResultOffset
|
|
|
|
if (!this->DiscardResult) {
|
|
|
|
if (!this->emitDupPtr(E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitSetLocal(PT_Ptr, ResultOffset, E))
|
|
|
|
return false;
|
|
|
|
}
|
2024-03-14 16:20:33 +01:00
|
|
|
QualType LHSType = LHS->getType();
|
|
|
|
if (const auto *AT = LHSType->getAs<AtomicType>())
|
|
|
|
LHSType = AT->getValueType();
|
|
|
|
QualType RHSType = RHS->getType();
|
|
|
|
if (const auto *AT = RHSType->getAs<AtomicType>())
|
|
|
|
RHSType = AT->getValueType();
|
2023-05-16 14:54:56 +02:00
|
|
|
|
|
|
|
// Evaluate LHS and save value to LHSOffset.
|
2024-02-26 08:24:19 +01:00
|
|
|
bool LHSIsComplex;
|
|
|
|
unsigned LHSOffset;
|
2024-03-14 16:20:33 +01:00
|
|
|
if (LHSType->isAnyComplexType()) {
|
2024-02-26 08:24:19 +01:00
|
|
|
LHSIsComplex = true;
|
|
|
|
LHSOffset = this->allocateLocalPrimitive(LHS, PT_Ptr, true, false);
|
|
|
|
if (!this->visit(LHS))
|
|
|
|
return false;
|
|
|
|
if (!this->emitSetLocal(PT_Ptr, LHSOffset, E))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
LHSIsComplex = false;
|
2024-03-14 16:20:33 +01:00
|
|
|
PrimType LHST = classifyPrim(LHSType);
|
2024-02-26 08:24:19 +01:00
|
|
|
LHSOffset = this->allocateLocalPrimitive(LHS, LHST, true, false);
|
|
|
|
if (!this->visit(LHS))
|
|
|
|
return false;
|
|
|
|
if (!this->emitSetLocal(LHST, LHSOffset, E))
|
|
|
|
return false;
|
|
|
|
}
|
2023-05-16 14:54:56 +02:00
|
|
|
|
|
|
|
// Same with RHS.
|
2024-02-26 08:24:19 +01:00
|
|
|
bool RHSIsComplex;
|
|
|
|
unsigned RHSOffset;
|
2024-03-14 16:20:33 +01:00
|
|
|
if (RHSType->isAnyComplexType()) {
|
2024-02-26 08:24:19 +01:00
|
|
|
RHSIsComplex = true;
|
|
|
|
RHSOffset = this->allocateLocalPrimitive(RHS, PT_Ptr, true, false);
|
|
|
|
if (!this->visit(RHS))
|
|
|
|
return false;
|
|
|
|
if (!this->emitSetLocal(PT_Ptr, RHSOffset, E))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
RHSIsComplex = false;
|
2024-03-14 16:20:33 +01:00
|
|
|
PrimType RHST = classifyPrim(RHSType);
|
2024-02-26 08:24:19 +01:00
|
|
|
RHSOffset = this->allocateLocalPrimitive(RHS, RHST, true, false);
|
|
|
|
if (!this->visit(RHS))
|
|
|
|
return false;
|
|
|
|
if (!this->emitSetLocal(RHST, RHSOffset, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// For both LHS and RHS, either load the value from the complex pointer, or
|
|
|
|
// directly from the local variable. For index 1 (i.e. the imaginary part),
|
|
|
|
// just load 0 and do the operation anyway.
|
|
|
|
auto loadComplexValue = [this](bool IsComplex, unsigned ElemIndex,
|
|
|
|
unsigned Offset, const Expr *E) -> bool {
|
|
|
|
if (IsComplex) {
|
|
|
|
if (!this->emitGetLocal(PT_Ptr, Offset, E))
|
|
|
|
return false;
|
2024-03-07 17:29:42 +01:00
|
|
|
return this->emitArrayElemPop(classifyComplexElementType(E->getType()),
|
|
|
|
ElemIndex, E);
|
2024-02-26 08:24:19 +01:00
|
|
|
}
|
|
|
|
if (ElemIndex == 0)
|
|
|
|
return this->emitGetLocal(classifyPrim(E->getType()), Offset, E);
|
|
|
|
return this->visitZeroInitializer(classifyPrim(E->getType()), E->getType(),
|
|
|
|
E);
|
|
|
|
};
|
2023-05-16 14:54:56 +02:00
|
|
|
|
|
|
|
// Now we can get pointers to the LHS and RHS from the offsets above.
|
|
|
|
BinaryOperatorKind Op = E->getOpcode();
|
|
|
|
for (unsigned ElemIndex = 0; ElemIndex != 2; ++ElemIndex) {
|
|
|
|
// Result pointer for the store later.
|
|
|
|
if (!this->DiscardResult) {
|
|
|
|
if (!this->emitGetLocal(PT_Ptr, ResultOffset, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2024-02-26 08:24:19 +01:00
|
|
|
if (!loadComplexValue(LHSIsComplex, ElemIndex, LHSOffset, LHS))
|
2023-05-16 14:54:56 +02:00
|
|
|
return false;
|
|
|
|
|
2024-02-26 08:24:19 +01:00
|
|
|
if (!loadComplexValue(RHSIsComplex, ElemIndex, RHSOffset, RHS))
|
2023-05-16 14:54:56 +02:00
|
|
|
return false;
|
|
|
|
|
|
|
|
// The actual operation.
|
|
|
|
switch (Op) {
|
|
|
|
case BO_Add:
|
2024-02-26 08:24:19 +01:00
|
|
|
if (ResultElemT == PT_Float) {
|
2023-05-16 14:54:56 +02:00
|
|
|
if (!this->emitAddf(getRoundingMode(E), E))
|
|
|
|
return false;
|
|
|
|
} else {
|
2024-02-26 08:24:19 +01:00
|
|
|
if (!this->emitAdd(ResultElemT, E))
|
2023-05-16 14:54:56 +02:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case BO_Sub:
|
2024-02-26 08:24:19 +01:00
|
|
|
if (ResultElemT == PT_Float) {
|
2023-05-16 14:54:56 +02:00
|
|
|
if (!this->emitSubf(getRoundingMode(E), E))
|
|
|
|
return false;
|
|
|
|
} else {
|
2024-02-26 08:24:19 +01:00
|
|
|
if (!this->emitSub(ResultElemT, E))
|
2023-05-16 14:54:56 +02:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!this->DiscardResult) {
|
|
|
|
// Initialize array element with the value we just computed.
|
2024-02-26 08:24:19 +01:00
|
|
|
if (!this->emitInitElemPop(ResultElemT, ElemIndex, E))
|
2023-05-16 14:54:56 +02:00
|
|
|
return false;
|
|
|
|
} else {
|
2024-02-26 08:24:19 +01:00
|
|
|
if (!this->emitPop(ResultElemT, E))
|
2023-05-16 14:54:56 +02:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2022-08-27 08:21:59 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitImplicitValueInitExpr(const ImplicitValueInitExpr *E) {
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
QualType QT = E->getType();
|
|
|
|
|
2023-10-14 17:42:27 +02:00
|
|
|
if (std::optional<PrimType> T = classify(QT))
|
|
|
|
return this->visitZeroInitializer(*T, QT, E);
|
2022-08-27 08:21:59 +02:00
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
if (QT->isRecordType())
|
2022-11-02 10:28:21 +01:00
|
|
|
return false;
|
|
|
|
|
2023-10-26 13:53:54 +02:00
|
|
|
if (QT->isIncompleteArrayType())
|
|
|
|
return true;
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
if (QT->isArrayType()) {
|
|
|
|
const ArrayType *AT = QT->getAsArrayTypeUnsafe();
|
|
|
|
assert(AT);
|
|
|
|
const auto *CAT = cast<ConstantArrayType>(AT);
|
2024-03-26 14:15:56 -05:00
|
|
|
size_t NumElems = CAT->getZExtSize();
|
2023-10-15 08:51:33 +02:00
|
|
|
PrimType ElemT = classifyPrim(CAT->getElementType());
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
|
2023-10-15 08:51:33 +02:00
|
|
|
for (size_t I = 0; I != NumElems; ++I) {
|
|
|
|
if (!this->visitZeroInitializer(ElemT, CAT->getElementType(), E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitInitElem(ElemT, I, E))
|
|
|
|
return false;
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2024-02-07 08:26:47 +01:00
|
|
|
if (QT->isAnyComplexType()) {
|
|
|
|
assert(Initializing);
|
|
|
|
QualType ElemQT = QT->getAs<ComplexType>()->getElementType();
|
|
|
|
PrimType ElemT = classifyPrim(ElemQT);
|
|
|
|
for (unsigned I = 0; I < 2; ++I) {
|
|
|
|
if (!this->visitZeroInitializer(ElemT, ElemQT, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitInitElem(ElemT, I, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
return false;
|
2022-08-27 08:21:59 +02:00
|
|
|
}
|
|
|
|
|
2022-08-31 16:09:40 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitArraySubscriptExpr(
|
|
|
|
const ArraySubscriptExpr *E) {
|
|
|
|
const Expr *Base = E->getBase();
|
|
|
|
const Expr *Index = E->getIdx();
|
2023-05-04 13:01:20 +02:00
|
|
|
|
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(Base) && this->discard(Index);
|
2022-08-31 16:09:40 +02:00
|
|
|
|
2022-12-31 17:06:52 +01:00
|
|
|
// Take pointer of LHS, add offset from RHS.
|
2022-08-31 16:09:40 +02:00
|
|
|
// What's left on the stack after this is a pointer.
|
2022-10-22 09:27:21 +02:00
|
|
|
if (!this->visit(Base))
|
|
|
|
return false;
|
2022-08-31 16:09:40 +02:00
|
|
|
|
2022-10-22 09:27:21 +02:00
|
|
|
if (!this->visit(Index))
|
|
|
|
return false;
|
2022-08-31 16:09:40 +02:00
|
|
|
|
2023-05-04 13:01:20 +02:00
|
|
|
PrimType IndexT = classifyPrim(Index->getType());
|
|
|
|
return this->emitArrayElemPtrPop(IndexT, E);
|
2022-08-31 16:09:40 +02:00
|
|
|
}
|
|
|
|
|
2023-07-23 09:36:18 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::visitInitList(ArrayRef<const Expr *> Inits,
|
|
|
|
const Expr *E) {
|
|
|
|
assert(E->getType()->isRecordType());
|
|
|
|
const Record *R = getRecord(E->getType());
|
|
|
|
|
2024-02-07 16:00:36 +01:00
|
|
|
if (Inits.size() == 1 && E->getType() == Inits[0]->getType()) {
|
|
|
|
return this->visitInitializer(Inits[0]);
|
|
|
|
}
|
|
|
|
|
2023-07-23 09:36:18 +02:00
|
|
|
unsigned InitIndex = 0;
|
|
|
|
for (const Expr *Init : Inits) {
|
|
|
|
if (!this->emitDupPtr(E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (std::optional<PrimType> T = classify(Init)) {
|
|
|
|
const Record::Field *FieldToInit = R->getField(InitIndex);
|
|
|
|
if (!this->visit(Init))
|
|
|
|
return false;
|
2023-08-10 09:19:05 +02:00
|
|
|
|
|
|
|
if (FieldToInit->isBitField()) {
|
|
|
|
if (!this->emitInitBitField(*T, FieldToInit, E))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (!this->emitInitField(*T, FieldToInit->Offset, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2023-07-23 09:36:18 +02:00
|
|
|
if (!this->emitPopPtr(E))
|
|
|
|
return false;
|
|
|
|
++InitIndex;
|
|
|
|
} else {
|
|
|
|
// Initializer for a direct base class.
|
|
|
|
if (const Record::Base *B = R->getBase(Init->getType())) {
|
|
|
|
if (!this->emitGetPtrBasePop(B->Offset, Init))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->visitInitializer(Init))
|
|
|
|
return false;
|
|
|
|
|
2024-02-27 07:36:01 +01:00
|
|
|
if (!this->emitFinishInitPop(E))
|
2023-07-23 09:36:18 +02:00
|
|
|
return false;
|
|
|
|
// Base initializers don't increase InitIndex, since they don't count
|
|
|
|
// into the Record's fields.
|
|
|
|
} else {
|
|
|
|
const Record::Field *FieldToInit = R->getField(InitIndex);
|
|
|
|
// Non-primitive case. Get a pointer to the field-to-initialize
|
|
|
|
// on the stack and recurse into visitInitializer().
|
|
|
|
if (!this->emitGetPtrField(FieldToInit->Offset, Init))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->visitInitializer(Init))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->emitPopPtr(E))
|
|
|
|
return false;
|
|
|
|
++InitIndex;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2023-11-20 12:01:50 +01:00
|
|
|
/// Pointer to the array(not the element!) must be on the stack when calling
|
|
|
|
/// this.
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::visitArrayElemInit(unsigned ElemIndex,
|
|
|
|
const Expr *Init) {
|
|
|
|
if (std::optional<PrimType> T = classify(Init->getType())) {
|
|
|
|
// Visit the primitive element like normal.
|
|
|
|
if (!this->visit(Init))
|
|
|
|
return false;
|
|
|
|
return this->emitInitElem(*T, ElemIndex, Init);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Advance the pointer currently on the stack to the given
|
|
|
|
// dimension.
|
|
|
|
if (!this->emitConstUint32(ElemIndex, Init))
|
|
|
|
return false;
|
|
|
|
if (!this->emitArrayElemPtrUint32(Init))
|
|
|
|
return false;
|
|
|
|
if (!this->visitInitializer(Init))
|
|
|
|
return false;
|
2024-02-27 07:36:01 +01:00
|
|
|
return this->emitFinishInitPop(Init);
|
2023-11-20 12:01:50 +01:00
|
|
|
}
|
|
|
|
|
2022-08-31 16:09:40 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitInitListExpr(const InitListExpr *E) {
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
// Handle discarding first.
|
|
|
|
if (DiscardResult) {
|
|
|
|
for (const Expr *Init : E->inits()) {
|
2023-05-04 12:07:16 +02:00
|
|
|
if (!this->discard(Init))
|
|
|
|
return false;
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Primitive values.
|
|
|
|
if (std::optional<PrimType> T = classify(E->getType())) {
|
|
|
|
assert(!DiscardResult);
|
2023-08-23 13:49:32 +02:00
|
|
|
if (E->getNumInits() == 0)
|
2023-10-14 17:42:27 +02:00
|
|
|
return this->visitZeroInitializer(*T, E->getType(), E);
|
2023-08-23 13:49:32 +02:00
|
|
|
assert(E->getNumInits() == 1);
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
return this->delegate(E->inits()[0]);
|
|
|
|
}
|
|
|
|
|
|
|
|
QualType T = E->getType();
|
2023-07-23 09:36:18 +02:00
|
|
|
if (T->isRecordType())
|
|
|
|
return this->visitInitList(E->inits(), E);
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
|
|
|
|
if (T->isArrayType()) {
|
|
|
|
unsigned ElementIndex = 0;
|
|
|
|
for (const Expr *Init : E->inits()) {
|
2023-11-20 12:01:50 +01:00
|
|
|
if (!this->visitArrayElemInit(ElementIndex, Init))
|
|
|
|
return false;
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
++ElementIndex;
|
|
|
|
}
|
2024-01-31 08:03:37 +01:00
|
|
|
|
|
|
|
// Expand the filler expression.
|
|
|
|
// FIXME: This should go away.
|
|
|
|
if (const Expr *Filler = E->getArrayFiller()) {
|
|
|
|
const ConstantArrayType *CAT =
|
|
|
|
Ctx.getASTContext().getAsConstantArrayType(E->getType());
|
2024-03-26 14:15:56 -05:00
|
|
|
uint64_t NumElems = CAT->getZExtSize();
|
2024-01-31 08:03:37 +01:00
|
|
|
|
|
|
|
for (; ElementIndex != NumElems; ++ElementIndex) {
|
|
|
|
if (!this->visitArrayElemInit(ElementIndex, Filler))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2023-03-20 09:35:47 +01:00
|
|
|
if (T->isAnyComplexType()) {
|
2023-04-01 08:42:42 +02:00
|
|
|
unsigned NumInits = E->getNumInits();
|
2024-01-19 09:27:30 +01:00
|
|
|
|
|
|
|
if (NumInits == 1)
|
|
|
|
return this->delegate(E->inits()[0]);
|
|
|
|
|
2023-04-01 08:42:42 +02:00
|
|
|
QualType ElemQT = E->getType()->getAs<ComplexType>()->getElementType();
|
|
|
|
PrimType ElemT = classifyPrim(ElemQT);
|
|
|
|
if (NumInits == 0) {
|
|
|
|
// Zero-initialize both elements.
|
|
|
|
for (unsigned I = 0; I < 2; ++I) {
|
|
|
|
if (!this->visitZeroInitializer(ElemT, ElemQT, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitInitElem(ElemT, I, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
} else if (NumInits == 2) {
|
|
|
|
unsigned InitIndex = 0;
|
|
|
|
for (const Expr *Init : E->inits()) {
|
|
|
|
if (!this->visit(Init))
|
|
|
|
return false;
|
2023-03-20 09:35:47 +01:00
|
|
|
|
2023-04-01 08:42:42 +02:00
|
|
|
if (!this->emitInitElem(ElemT, InitIndex, E))
|
|
|
|
return false;
|
|
|
|
++InitIndex;
|
|
|
|
}
|
2023-03-20 09:35:47 +01:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2024-04-10 08:50:52 +02:00
|
|
|
if (const auto *VecT = E->getType()->getAs<VectorType>()) {
|
|
|
|
unsigned NumVecElements = VecT->getNumElements();
|
|
|
|
assert(NumVecElements >= E->getNumInits());
|
|
|
|
|
|
|
|
QualType ElemQT = VecT->getElementType();
|
|
|
|
PrimType ElemT = classifyPrim(ElemQT);
|
|
|
|
|
|
|
|
// All initializer elements.
|
|
|
|
unsigned InitIndex = 0;
|
|
|
|
for (const Expr *Init : E->inits()) {
|
|
|
|
if (!this->visit(Init))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->emitInitElem(ElemT, InitIndex, E))
|
|
|
|
return false;
|
|
|
|
++InitIndex;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Fill the rest with zeroes.
|
|
|
|
for (; InitIndex != NumVecElements; ++InitIndex) {
|
|
|
|
if (!this->visitZeroInitializer(ElemT, ElemQT, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitInitElem(ElemT, InitIndex, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
return false;
|
2022-08-31 16:09:40 +02:00
|
|
|
}
|
|
|
|
|
2023-07-23 09:36:18 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXParenListInitExpr(
|
|
|
|
const CXXParenListInitExpr *E) {
|
|
|
|
if (DiscardResult) {
|
|
|
|
for (const Expr *Init : E->getInitExprs()) {
|
|
|
|
if (!this->discard(Init))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(E->getType()->isRecordType());
|
|
|
|
return this->visitInitList(E->getInitExprs(), E);
|
|
|
|
}
|
|
|
|
|
2022-08-27 17:37:26 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitSubstNonTypeTemplateParmExpr(
|
|
|
|
const SubstNonTypeTemplateParmExpr *E) {
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
return this->delegate(E->getReplacement());
|
2022-08-27 17:37:26 +02:00
|
|
|
}
|
|
|
|
|
2022-08-31 16:09:40 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitConstantExpr(const ConstantExpr *E) {
|
2023-08-22 12:25:56 +02:00
|
|
|
std::optional<PrimType> T = classify(E->getType());
|
2024-02-06 14:14:42 +01:00
|
|
|
if (T && E->hasAPValueResult()) {
|
|
|
|
// Try to emit the APValue directly, without visiting the subexpr.
|
|
|
|
// This will only fail if we can't emit the APValue, so won't emit any
|
|
|
|
// diagnostics or any double values.
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
2023-08-22 12:25:56 +02:00
|
|
|
|
2024-02-06 14:14:42 +01:00
|
|
|
if (this->visitAPValue(E->getAPValueResult(), *T, E))
|
|
|
|
return true;
|
|
|
|
}
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
return this->delegate(E->getSubExpr());
|
2022-08-31 16:09:40 +02:00
|
|
|
}
|
|
|
|
|
2022-11-02 11:20:01 +01:00
|
|
|
static CharUnits AlignOfType(QualType T, const ASTContext &ASTCtx,
|
|
|
|
UnaryExprOrTypeTrait Kind) {
|
|
|
|
bool AlignOfReturnsPreferred =
|
|
|
|
ASTCtx.getLangOpts().getClangABICompat() <= LangOptions::ClangABI::Ver7;
|
|
|
|
|
|
|
|
// C++ [expr.alignof]p3:
|
|
|
|
// When alignof is applied to a reference type, the result is the
|
|
|
|
// alignment of the referenced type.
|
|
|
|
if (const auto *Ref = T->getAs<ReferenceType>())
|
|
|
|
T = Ref->getPointeeType();
|
|
|
|
|
2024-04-09 15:49:36 +02:00
|
|
|
if (T.getQualifiers().hasUnaligned())
|
|
|
|
return CharUnits::One();
|
|
|
|
|
2022-11-02 11:20:01 +01:00
|
|
|
// __alignof is defined to return the preferred alignment.
|
|
|
|
// Before 8, clang returned the preferred alignment for alignof and
|
|
|
|
// _Alignof as well.
|
|
|
|
if (Kind == UETT_PreferredAlignOf || AlignOfReturnsPreferred)
|
|
|
|
return ASTCtx.toCharUnitsFromBits(ASTCtx.getPreferredTypeAlign(T));
|
|
|
|
|
|
|
|
return ASTCtx.getTypeAlignInChars(T);
|
|
|
|
}
|
|
|
|
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
template <class Emitter>
|
2022-09-14 16:53:55 +02:00
|
|
|
bool ByteCodeExprGen<Emitter>::VisitUnaryExprOrTypeTraitExpr(
|
|
|
|
const UnaryExprOrTypeTraitExpr *E) {
|
2022-11-02 11:20:01 +01:00
|
|
|
UnaryExprOrTypeTrait Kind = E->getKind();
|
2024-03-16 13:21:49 +01:00
|
|
|
const ASTContext &ASTCtx = Ctx.getASTContext();
|
2022-09-14 16:53:55 +02:00
|
|
|
|
2024-03-16 13:21:49 +01:00
|
|
|
if (Kind == UETT_SizeOf || Kind == UETT_DataSizeOf) {
|
2022-09-14 16:53:55 +02:00
|
|
|
QualType ArgType = E->getTypeOfArgument();
|
2024-02-07 13:31:41 +01:00
|
|
|
|
|
|
|
// C++ [expr.sizeof]p2: "When applied to a reference or a reference type,
|
|
|
|
// the result is the size of the referenced type."
|
|
|
|
if (const auto *Ref = ArgType->getAs<ReferenceType>())
|
|
|
|
ArgType = Ref->getPointeeType();
|
|
|
|
|
2022-09-14 16:53:55 +02:00
|
|
|
CharUnits Size;
|
|
|
|
if (ArgType->isVoidType() || ArgType->isFunctionType())
|
|
|
|
Size = CharUnits::One();
|
|
|
|
else {
|
|
|
|
if (ArgType->isDependentType() || !ArgType->isConstantSizeType())
|
|
|
|
return false;
|
|
|
|
|
2024-03-16 13:21:49 +01:00
|
|
|
if (Kind == UETT_SizeOf)
|
|
|
|
Size = ASTCtx.getTypeSizeInChars(ArgType);
|
|
|
|
else
|
|
|
|
Size = ASTCtx.getTypeInfoDataSizeInChars(ArgType).Width;
|
2022-11-02 11:20:01 +01:00
|
|
|
}
|
|
|
|
|
2023-05-05 17:10:32 +02:00
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
2022-11-02 11:20:01 +01:00
|
|
|
return this->emitConst(Size.getQuantity(), E);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (Kind == UETT_AlignOf || Kind == UETT_PreferredAlignOf) {
|
|
|
|
CharUnits Size;
|
|
|
|
|
|
|
|
if (E->isArgumentType()) {
|
|
|
|
QualType ArgType = E->getTypeOfArgument();
|
|
|
|
|
|
|
|
Size = AlignOfType(ArgType, ASTCtx, Kind);
|
|
|
|
} else {
|
|
|
|
// Argument is an expression, not a type.
|
|
|
|
const Expr *Arg = E->getArgumentExpr()->IgnoreParens();
|
|
|
|
|
|
|
|
// The kinds of expressions that we have special-case logic here for
|
|
|
|
// should be kept up to date with the special checks for those
|
|
|
|
// expressions in Sema.
|
|
|
|
|
|
|
|
// alignof decl is always accepted, even if it doesn't make sense: we
|
|
|
|
// default to 1 in those cases.
|
|
|
|
if (const auto *DRE = dyn_cast<DeclRefExpr>(Arg))
|
|
|
|
Size = ASTCtx.getDeclAlign(DRE->getDecl(),
|
|
|
|
/*RefAsPointee*/ true);
|
|
|
|
else if (const auto *ME = dyn_cast<MemberExpr>(Arg))
|
|
|
|
Size = ASTCtx.getDeclAlign(ME->getMemberDecl(),
|
|
|
|
/*RefAsPointee*/ true);
|
|
|
|
else
|
|
|
|
Size = AlignOfType(Arg->getType(), ASTCtx, Kind);
|
2022-09-14 16:53:55 +02:00
|
|
|
}
|
|
|
|
|
2023-05-05 17:10:32 +02:00
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
2022-10-30 10:05:42 +01:00
|
|
|
return this->emitConst(Size.getQuantity(), E);
|
2022-09-14 16:53:55 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2022-09-16 19:11:58 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitMemberExpr(const MemberExpr *E) {
|
|
|
|
// 'Base.Member'
|
|
|
|
const Expr *Base = E->getBase();
|
2023-05-04 11:18:02 +02:00
|
|
|
|
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(Base);
|
2022-09-16 19:11:58 +02:00
|
|
|
|
2024-02-19 10:53:05 +01:00
|
|
|
if (Initializing) {
|
|
|
|
if (!this->delegate(Base))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (!this->visit(Base))
|
|
|
|
return false;
|
|
|
|
}
|
2022-09-16 19:11:58 +02:00
|
|
|
|
|
|
|
// Base above gives us a pointer on the stack.
|
|
|
|
// TODO: Implement non-FieldDecl members.
|
2023-05-04 11:18:02 +02:00
|
|
|
const ValueDecl *Member = E->getMemberDecl();
|
2022-09-16 19:11:58 +02:00
|
|
|
if (const auto *FD = dyn_cast<FieldDecl>(Member)) {
|
|
|
|
const RecordDecl *RD = FD->getParent();
|
|
|
|
const Record *R = getRecord(RD);
|
|
|
|
const Record::Field *F = R->getField(FD);
|
|
|
|
// Leave a pointer to the field on the stack.
|
2022-10-15 09:22:34 +02:00
|
|
|
if (F->Decl->getType()->isReferenceType())
|
|
|
|
return this->emitGetFieldPop(PT_Ptr, F->Offset, E);
|
2022-09-16 19:11:58 +02:00
|
|
|
return this->emitGetPtrField(F->Offset, E);
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2022-09-21 16:05:30 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitArrayInitIndexExpr(
|
|
|
|
const ArrayInitIndexExpr *E) {
|
2022-09-23 11:29:33 +02:00
|
|
|
// ArrayIndex might not be set if a ArrayInitIndexExpr is being evaluated
|
|
|
|
// stand-alone, e.g. via EvaluateAsInt().
|
|
|
|
if (!ArrayIndex)
|
|
|
|
return false;
|
2022-10-30 10:05:42 +01:00
|
|
|
return this->emitConst(*ArrayIndex, E);
|
2022-09-21 16:05:30 +02:00
|
|
|
}
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitArrayInitLoopExpr(
|
|
|
|
const ArrayInitLoopExpr *E) {
|
|
|
|
assert(Initializing);
|
|
|
|
assert(!DiscardResult);
|
2024-01-26 17:19:11 +01:00
|
|
|
|
|
|
|
// We visit the common opaque expression here once so we have its value
|
|
|
|
// cached.
|
|
|
|
if (!this->discard(E->getCommonExpr()))
|
|
|
|
return false;
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
// TODO: This compiles to quite a lot of bytecode if the array is larger.
|
2023-10-23 17:52:27 +02:00
|
|
|
// Investigate compiling this to a loop.
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
const Expr *SubExpr = E->getSubExpr();
|
|
|
|
size_t Size = E->getArraySize().getZExtValue();
|
|
|
|
|
|
|
|
// So, every iteration, we execute an assignment here
|
|
|
|
// where the LHS is on the stack (the target array)
|
|
|
|
// and the RHS is our SubExpr.
|
|
|
|
for (size_t I = 0; I != Size; ++I) {
|
|
|
|
ArrayIndexScope<Emitter> IndexScope(this, I);
|
2023-10-24 10:43:31 +02:00
|
|
|
BlockScope<Emitter> BS(this);
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
|
2023-11-20 12:01:50 +01:00
|
|
|
if (!this->visitArrayElemInit(I, SubExpr))
|
|
|
|
return false;
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2022-09-21 16:05:30 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitOpaqueValueExpr(const OpaqueValueExpr *E) {
|
2024-03-01 09:41:29 +01:00
|
|
|
const Expr *SourceExpr = E->getSourceExpr();
|
|
|
|
if (!SourceExpr)
|
|
|
|
return false;
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
if (Initializing)
|
2024-03-01 09:41:29 +01:00
|
|
|
return this->visitInitializer(SourceExpr);
|
2023-10-23 17:52:27 +02:00
|
|
|
|
2024-03-01 09:41:29 +01:00
|
|
|
PrimType SubExprT = classify(SourceExpr).value_or(PT_Ptr);
|
2023-10-23 17:52:27 +02:00
|
|
|
if (auto It = OpaqueExprs.find(E); It != OpaqueExprs.end())
|
2023-10-24 10:43:31 +02:00
|
|
|
return this->emitGetLocal(SubExprT, It->second, E);
|
2023-10-23 17:52:27 +02:00
|
|
|
|
2024-03-01 09:41:29 +01:00
|
|
|
if (!this->visit(SourceExpr))
|
2023-10-23 17:52:27 +02:00
|
|
|
return false;
|
|
|
|
|
|
|
|
// At this point we either have the evaluated source expression or a pointer
|
|
|
|
// to an object on the stack. We want to create a local variable that stores
|
|
|
|
// this value.
|
2024-03-14 10:53:52 +01:00
|
|
|
unsigned LocalIndex = allocateLocalPrimitive(E, SubExprT, /*IsConst=*/true);
|
|
|
|
if (!this->emitSetLocal(SubExprT, LocalIndex, E))
|
2023-10-23 17:52:27 +02:00
|
|
|
return false;
|
|
|
|
|
|
|
|
// Here the local variable is created but the value is removed from the stack,
|
2024-01-26 17:19:11 +01:00
|
|
|
// so we put it back if the caller needs it.
|
2023-10-24 10:43:31 +02:00
|
|
|
if (!DiscardResult) {
|
2024-03-14 10:53:52 +01:00
|
|
|
if (!this->emitGetLocal(SubExprT, LocalIndex, E))
|
2023-10-24 10:43:31 +02:00
|
|
|
return false;
|
|
|
|
}
|
2023-10-23 17:52:27 +02:00
|
|
|
|
2024-01-26 17:19:11 +01:00
|
|
|
// This is cleaned up when the local variable is destroyed.
|
2024-03-14 10:53:52 +01:00
|
|
|
OpaqueExprs.insert({E, LocalIndex});
|
2023-10-23 17:52:27 +02:00
|
|
|
|
|
|
|
return true;
|
2022-09-21 16:05:30 +02:00
|
|
|
}
|
|
|
|
|
2022-09-28 06:51:17 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitAbstractConditionalOperator(
|
|
|
|
const AbstractConditionalOperator *E) {
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
const Expr *Condition = E->getCond();
|
|
|
|
const Expr *TrueExpr = E->getTrueExpr();
|
|
|
|
const Expr *FalseExpr = E->getFalseExpr();
|
|
|
|
|
|
|
|
LabelTy LabelEnd = this->getLabel(); // Label after the operator.
|
|
|
|
LabelTy LabelFalse = this->getLabel(); // Label for the false expr.
|
|
|
|
|
2023-08-05 07:47:22 +02:00
|
|
|
if (!this->visitBool(Condition))
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->jumpFalse(LabelFalse))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->delegate(TrueExpr))
|
|
|
|
return false;
|
|
|
|
if (!this->jump(LabelEnd))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
this->emitLabel(LabelFalse);
|
|
|
|
|
|
|
|
if (!this->delegate(FalseExpr))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
this->fallthrough(LabelEnd);
|
|
|
|
this->emitLabel(LabelEnd);
|
|
|
|
|
|
|
|
return true;
|
2022-09-28 06:51:17 +02:00
|
|
|
}
|
|
|
|
|
2022-10-28 13:49:30 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitStringLiteral(const StringLiteral *E) {
|
2023-05-05 16:53:05 +02:00
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
|
|
|
|
if (!Initializing) {
|
|
|
|
unsigned StringIndex = P.createGlobalString(E);
|
|
|
|
return this->emitGetPtrGlobal(StringIndex, E);
|
|
|
|
}
|
|
|
|
|
|
|
|
// We are initializing an array on the stack.
|
|
|
|
const ConstantArrayType *CAT =
|
|
|
|
Ctx.getASTContext().getAsConstantArrayType(E->getType());
|
|
|
|
assert(CAT && "a string literal that's not a constant array?");
|
|
|
|
|
|
|
|
// If the initializer string is too long, a diagnostic has already been
|
|
|
|
// emitted. Read only the array length from the string literal.
|
2024-03-26 14:15:56 -05:00
|
|
|
unsigned ArraySize = CAT->getZExtSize();
|
2023-09-30 08:28:09 +02:00
|
|
|
unsigned N = std::min(ArraySize, E->getLength());
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
size_t CharWidth = E->getCharByteWidth();
|
|
|
|
|
|
|
|
for (unsigned I = 0; I != N; ++I) {
|
|
|
|
uint32_t CodeUnit = E->getCodeUnit(I);
|
|
|
|
|
|
|
|
if (CharWidth == 1) {
|
|
|
|
this->emitConstSint8(CodeUnit, E);
|
|
|
|
this->emitInitElemSint8(I, E);
|
|
|
|
} else if (CharWidth == 2) {
|
|
|
|
this->emitConstUint16(CodeUnit, E);
|
|
|
|
this->emitInitElemUint16(I, E);
|
|
|
|
} else if (CharWidth == 4) {
|
|
|
|
this->emitConstUint32(CodeUnit, E);
|
|
|
|
this->emitInitElemUint32(I, E);
|
|
|
|
} else {
|
|
|
|
llvm_unreachable("unsupported character width");
|
|
|
|
}
|
|
|
|
}
|
2023-09-30 08:28:09 +02:00
|
|
|
|
|
|
|
// Fill up the rest of the char array with NUL bytes.
|
|
|
|
for (unsigned I = N; I != ArraySize; ++I) {
|
|
|
|
if (CharWidth == 1) {
|
|
|
|
this->emitConstSint8(0, E);
|
|
|
|
this->emitInitElemSint8(I, E);
|
|
|
|
} else if (CharWidth == 2) {
|
|
|
|
this->emitConstUint16(0, E);
|
|
|
|
this->emitInitElemUint16(I, E);
|
|
|
|
} else if (CharWidth == 4) {
|
|
|
|
this->emitConstUint32(0, E);
|
|
|
|
this->emitInitElemUint32(I, E);
|
|
|
|
} else {
|
|
|
|
llvm_unreachable("unsupported character width");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
return true;
|
2022-10-28 13:49:30 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCharacterLiteral(
|
|
|
|
const CharacterLiteral *E) {
|
2023-05-05 16:53:05 +02:00
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
2022-10-30 10:05:42 +01:00
|
|
|
return this->emitConst(E->getValue(), E);
|
2022-10-28 13:49:30 +02:00
|
|
|
}
|
|
|
|
|
2022-12-20 10:19:56 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitFloatCompoundAssignOperator(
|
|
|
|
const CompoundAssignOperator *E) {
|
|
|
|
|
|
|
|
const Expr *LHS = E->getLHS();
|
|
|
|
const Expr *RHS = E->getRHS();
|
2023-08-10 12:01:08 +02:00
|
|
|
QualType LHSType = LHS->getType();
|
2022-12-20 10:19:56 +01:00
|
|
|
QualType LHSComputationType = E->getComputationLHSType();
|
|
|
|
QualType ResultType = E->getComputationResultType();
|
|
|
|
std::optional<PrimType> LT = classify(LHSComputationType);
|
|
|
|
std::optional<PrimType> RT = classify(ResultType);
|
|
|
|
|
2023-08-10 12:01:08 +02:00
|
|
|
assert(ResultType->isFloatingType());
|
|
|
|
|
2022-12-20 10:19:56 +01:00
|
|
|
if (!LT || !RT)
|
|
|
|
return false;
|
|
|
|
|
2023-08-10 12:01:08 +02:00
|
|
|
PrimType LHST = classifyPrim(LHSType);
|
|
|
|
|
2023-04-30 16:20:20 +02:00
|
|
|
// C++17 onwards require that we evaluate the RHS first.
|
|
|
|
// Compute RHS and save it in a temporary variable so we can
|
|
|
|
// load it again later.
|
|
|
|
if (!visit(RHS))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
unsigned TempOffset = this->allocateLocalPrimitive(E, *RT, /*IsConst=*/true);
|
|
|
|
if (!this->emitSetLocal(*RT, TempOffset, E))
|
|
|
|
return false;
|
|
|
|
|
2022-12-20 10:19:56 +01:00
|
|
|
// First, visit LHS.
|
|
|
|
if (!visit(LHS))
|
|
|
|
return false;
|
2023-08-10 12:01:08 +02:00
|
|
|
if (!this->emitLoad(LHST, E))
|
2022-12-20 10:19:56 +01:00
|
|
|
return false;
|
|
|
|
|
|
|
|
// If necessary, convert LHS to its computation type.
|
2023-08-10 12:01:08 +02:00
|
|
|
if (!this->emitPrimCast(LHST, classifyPrim(LHSComputationType),
|
|
|
|
LHSComputationType, E))
|
|
|
|
return false;
|
2022-12-20 10:19:56 +01:00
|
|
|
|
|
|
|
// Now load RHS.
|
2023-04-30 16:20:20 +02:00
|
|
|
if (!this->emitGetLocal(*RT, TempOffset, E))
|
2022-12-20 10:19:56 +01:00
|
|
|
return false;
|
|
|
|
|
2023-08-10 12:01:08 +02:00
|
|
|
llvm::RoundingMode RM = getRoundingMode(E);
|
2022-12-20 10:19:56 +01:00
|
|
|
switch (E->getOpcode()) {
|
|
|
|
case BO_AddAssign:
|
|
|
|
if (!this->emitAddf(RM, E))
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case BO_SubAssign:
|
|
|
|
if (!this->emitSubf(RM, E))
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case BO_MulAssign:
|
|
|
|
if (!this->emitMulf(RM, E))
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case BO_DivAssign:
|
|
|
|
if (!this->emitDivf(RM, E))
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2023-08-10 12:01:08 +02:00
|
|
|
if (!this->emitPrimCast(classifyPrim(ResultType), LHST, LHS->getType(), E))
|
|
|
|
return false;
|
2022-12-20 10:19:56 +01:00
|
|
|
|
|
|
|
if (DiscardResult)
|
2023-08-10 12:01:08 +02:00
|
|
|
return this->emitStorePop(LHST, E);
|
|
|
|
return this->emitStore(LHST, E);
|
2022-12-20 10:19:56 +01:00
|
|
|
}
|
|
|
|
|
2023-01-03 10:04:27 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitPointerCompoundAssignOperator(
|
|
|
|
const CompoundAssignOperator *E) {
|
|
|
|
BinaryOperatorKind Op = E->getOpcode();
|
|
|
|
const Expr *LHS = E->getLHS();
|
|
|
|
const Expr *RHS = E->getRHS();
|
|
|
|
std::optional<PrimType> LT = classify(LHS->getType());
|
|
|
|
std::optional<PrimType> RT = classify(RHS->getType());
|
|
|
|
|
|
|
|
if (Op != BO_AddAssign && Op != BO_SubAssign)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!LT || !RT)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!visit(LHS))
|
|
|
|
return false;
|
|
|
|
|
2024-02-21 16:38:01 +01:00
|
|
|
if (!this->emitLoad(*LT, LHS))
|
2023-01-03 10:04:27 +01:00
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!visit(RHS))
|
|
|
|
return false;
|
|
|
|
|
2024-02-16 12:14:48 +01:00
|
|
|
if (Op == BO_AddAssign) {
|
|
|
|
if (!this->emitAddOffset(*RT, E))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (!this->emitSubOffset(*RT, E))
|
|
|
|
return false;
|
|
|
|
}
|
2023-01-03 10:04:27 +01:00
|
|
|
|
|
|
|
if (DiscardResult)
|
|
|
|
return this->emitStorePopPtr(E);
|
|
|
|
return this->emitStorePtr(E);
|
|
|
|
}
|
|
|
|
|
2022-10-22 15:32:27 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCompoundAssignOperator(
|
|
|
|
const CompoundAssignOperator *E) {
|
2022-12-20 10:19:56 +01:00
|
|
|
|
2022-10-22 15:32:27 +02:00
|
|
|
const Expr *LHS = E->getLHS();
|
|
|
|
const Expr *RHS = E->getRHS();
|
2023-01-22 21:09:35 +01:00
|
|
|
std::optional<PrimType> LHSComputationT =
|
|
|
|
classify(E->getComputationLHSType());
|
|
|
|
std::optional<PrimType> LT = classify(LHS->getType());
|
2024-02-18 07:04:12 +01:00
|
|
|
std::optional<PrimType> RT = classify(RHS->getType());
|
2023-01-22 21:09:35 +01:00
|
|
|
std::optional<PrimType> ResultT = classify(E->getType());
|
2022-10-22 15:32:27 +02:00
|
|
|
|
2023-01-22 21:09:35 +01:00
|
|
|
if (!LT || !RT || !ResultT || !LHSComputationT)
|
2022-10-22 15:32:27 +02:00
|
|
|
return false;
|
|
|
|
|
2023-08-10 12:01:08 +02:00
|
|
|
// Handle floating point operations separately here, since they
|
|
|
|
// require special care.
|
|
|
|
|
|
|
|
if (ResultT == PT_Float || RT == PT_Float)
|
|
|
|
return VisitFloatCompoundAssignOperator(E);
|
|
|
|
|
|
|
|
if (E->getType()->isPointerType())
|
|
|
|
return VisitPointerCompoundAssignOperator(E);
|
|
|
|
|
2023-01-03 10:04:27 +01:00
|
|
|
assert(!E->getType()->isPointerType() && "Handled above");
|
2022-12-20 10:19:56 +01:00
|
|
|
assert(!E->getType()->isFloatingType() && "Handled above");
|
2023-01-25 14:51:16 +01:00
|
|
|
|
2023-04-30 16:20:20 +02:00
|
|
|
// C++17 onwards require that we evaluate the RHS first.
|
|
|
|
// Compute RHS and save it in a temporary variable so we can
|
|
|
|
// load it again later.
|
|
|
|
// FIXME: Compound assignments are unsequenced in C, so we might
|
|
|
|
// have to figure out how to reject them.
|
|
|
|
if (!visit(RHS))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
unsigned TempOffset = this->allocateLocalPrimitive(E, *RT, /*IsConst=*/true);
|
|
|
|
|
|
|
|
if (!this->emitSetLocal(*RT, TempOffset, E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Get LHS pointer, load its value and cast it to the
|
|
|
|
// computation type if necessary.
|
2022-10-22 15:32:27 +02:00
|
|
|
if (!visit(LHS))
|
|
|
|
return false;
|
|
|
|
if (!this->emitLoad(*LT, E))
|
|
|
|
return false;
|
2023-01-22 21:09:35 +01:00
|
|
|
if (*LT != *LHSComputationT) {
|
|
|
|
if (!this->emitCast(*LT, *LHSComputationT, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2023-04-30 16:20:20 +02:00
|
|
|
// Get the RHS value on the stack.
|
|
|
|
if (!this->emitGetLocal(*RT, TempOffset, E))
|
2022-10-22 15:32:27 +02:00
|
|
|
return false;
|
|
|
|
|
|
|
|
// Perform operation.
|
|
|
|
switch (E->getOpcode()) {
|
|
|
|
case BO_AddAssign:
|
2023-01-22 21:09:35 +01:00
|
|
|
if (!this->emitAdd(*LHSComputationT, E))
|
2022-10-22 15:32:27 +02:00
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case BO_SubAssign:
|
2023-01-22 21:09:35 +01:00
|
|
|
if (!this->emitSub(*LHSComputationT, E))
|
2022-10-22 15:32:27 +02:00
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case BO_MulAssign:
|
2022-10-31 12:44:38 +01:00
|
|
|
if (!this->emitMul(*LHSComputationT, E))
|
|
|
|
return false;
|
|
|
|
break;
|
2022-10-22 15:32:27 +02:00
|
|
|
case BO_DivAssign:
|
2022-10-31 12:44:38 +01:00
|
|
|
if (!this->emitDiv(*LHSComputationT, E))
|
|
|
|
return false;
|
|
|
|
break;
|
2022-10-22 15:32:27 +02:00
|
|
|
case BO_RemAssign:
|
2022-10-31 12:44:38 +01:00
|
|
|
if (!this->emitRem(*LHSComputationT, E))
|
|
|
|
return false;
|
|
|
|
break;
|
2022-10-22 15:32:27 +02:00
|
|
|
case BO_ShlAssign:
|
2023-01-22 21:09:35 +01:00
|
|
|
if (!this->emitShl(*LHSComputationT, *RT, E))
|
2022-10-22 18:19:10 +02:00
|
|
|
return false;
|
|
|
|
break;
|
2022-10-22 15:32:27 +02:00
|
|
|
case BO_ShrAssign:
|
2023-01-22 21:09:35 +01:00
|
|
|
if (!this->emitShr(*LHSComputationT, *RT, E))
|
2022-10-22 18:19:10 +02:00
|
|
|
return false;
|
|
|
|
break;
|
2022-10-22 15:32:27 +02:00
|
|
|
case BO_AndAssign:
|
2022-10-31 12:44:38 +01:00
|
|
|
if (!this->emitBitAnd(*LHSComputationT, E))
|
|
|
|
return false;
|
|
|
|
break;
|
2022-10-22 15:32:27 +02:00
|
|
|
case BO_XorAssign:
|
2022-10-31 12:44:38 +01:00
|
|
|
if (!this->emitBitXor(*LHSComputationT, E))
|
|
|
|
return false;
|
|
|
|
break;
|
2022-10-22 15:32:27 +02:00
|
|
|
case BO_OrAssign:
|
2022-10-31 12:44:38 +01:00
|
|
|
if (!this->emitBitOr(*LHSComputationT, E))
|
|
|
|
return false;
|
|
|
|
break;
|
2022-10-22 15:32:27 +02:00
|
|
|
default:
|
|
|
|
llvm_unreachable("Unimplemented compound assign operator");
|
|
|
|
}
|
|
|
|
|
2023-01-22 21:09:35 +01:00
|
|
|
// And now cast from LHSComputationT to ResultT.
|
|
|
|
if (*ResultT != *LHSComputationT) {
|
|
|
|
if (!this->emitCast(*LHSComputationT, *ResultT, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2022-10-22 15:32:27 +02:00
|
|
|
// And store the result in LHS.
|
2023-10-14 09:17:35 +02:00
|
|
|
if (DiscardResult) {
|
|
|
|
if (LHS->refersToBitField())
|
|
|
|
return this->emitStoreBitFieldPop(*ResultT, E);
|
2023-01-22 21:09:35 +01:00
|
|
|
return this->emitStorePop(*ResultT, E);
|
2023-10-14 09:17:35 +02:00
|
|
|
}
|
|
|
|
if (LHS->refersToBitField())
|
|
|
|
return this->emitStoreBitField(*ResultT, E);
|
2023-01-22 21:09:35 +01:00
|
|
|
return this->emitStore(*ResultT, E);
|
2022-10-22 15:32:27 +02:00
|
|
|
}
|
|
|
|
|
2022-10-15 14:40:23 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitExprWithCleanups(
|
|
|
|
const ExprWithCleanups *E) {
|
|
|
|
const Expr *SubExpr = E->getSubExpr();
|
|
|
|
|
|
|
|
assert(E->getNumObjects() == 0 && "TODO: Implement cleanups");
|
2023-05-04 08:45:14 +02:00
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
return this->delegate(SubExpr);
|
2022-10-15 14:40:23 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitMaterializeTemporaryExpr(
|
|
|
|
const MaterializeTemporaryExpr *E) {
|
|
|
|
const Expr *SubExpr = E->getSubExpr();
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
if (Initializing) {
|
|
|
|
// We already have a value, just initialize that.
|
|
|
|
return this->visitInitializer(SubExpr);
|
|
|
|
}
|
2023-07-05 08:26:27 +02:00
|
|
|
// If we don't end up using the materialized temporary anyway, don't
|
|
|
|
// bother creating it.
|
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
|
|
|
|
2023-07-27 17:57:26 +02:00
|
|
|
// When we're initializing a global variable *or* the storage duration of
|
|
|
|
// the temporary is explicitly static, create a global variable.
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
std::optional<PrimType> SubExprT = classify(SubExpr);
|
2023-07-27 17:57:26 +02:00
|
|
|
bool IsStatic = E->getStorageDuration() == SD_Static;
|
|
|
|
if (GlobalDecl || IsStatic) {
|
2023-02-21 09:36:37 +01:00
|
|
|
std::optional<unsigned> GlobalIndex = P.createGlobal(E);
|
|
|
|
if (!GlobalIndex)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const LifetimeExtendedTemporaryDecl *TempDecl =
|
|
|
|
E->getLifetimeExtendedTemporaryDecl();
|
2023-07-27 17:57:26 +02:00
|
|
|
if (IsStatic)
|
|
|
|
assert(TempDecl);
|
2022-10-15 14:40:23 +02:00
|
|
|
|
2023-02-21 09:36:37 +01:00
|
|
|
if (SubExprT) {
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
if (!this->visit(SubExpr))
|
2022-10-15 14:40:23 +02:00
|
|
|
return false;
|
2023-07-27 17:57:26 +02:00
|
|
|
if (IsStatic) {
|
|
|
|
if (!this->emitInitGlobalTemp(*SubExprT, *GlobalIndex, TempDecl, E))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (!this->emitInitGlobal(*SubExprT, *GlobalIndex, E))
|
|
|
|
return false;
|
|
|
|
}
|
2022-10-15 14:40:23 +02:00
|
|
|
return this->emitGetPtrGlobal(*GlobalIndex, E);
|
|
|
|
}
|
2022-12-26 09:18:56 +01:00
|
|
|
|
2023-02-21 09:36:37 +01:00
|
|
|
// Non-primitive values.
|
|
|
|
if (!this->emitGetPtrGlobal(*GlobalIndex, E))
|
|
|
|
return false;
|
|
|
|
if (!this->visitInitializer(SubExpr))
|
|
|
|
return false;
|
2023-07-27 17:57:26 +02:00
|
|
|
if (IsStatic)
|
|
|
|
return this->emitInitGlobalTempComp(TempDecl, E);
|
|
|
|
return true;
|
2022-12-26 09:18:56 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// For everyhing else, use local variables.
|
|
|
|
if (SubExprT) {
|
2024-03-14 10:53:52 +01:00
|
|
|
unsigned LocalIndex = allocateLocalPrimitive(
|
|
|
|
SubExpr, *SubExprT, /*IsConst=*/true, /*IsExtended=*/true);
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
if (!this->emitSetLocal(*SubExprT, LocalIndex, E))
|
|
|
|
return false;
|
|
|
|
return this->emitGetPtrLocal(LocalIndex, E);
|
2022-12-26 09:18:56 +01:00
|
|
|
} else {
|
2024-02-05 16:41:55 +01:00
|
|
|
const Expr *Inner = E->getSubExpr()->skipRValueSubobjectAdjustments();
|
|
|
|
|
2022-12-26 09:18:56 +01:00
|
|
|
if (std::optional<unsigned> LocalIndex =
|
2024-02-05 16:41:55 +01:00
|
|
|
allocateLocal(Inner, /*IsExtended=*/true)) {
|
2022-12-26 09:18:56 +01:00
|
|
|
if (!this->emitGetPtrLocal(*LocalIndex, E))
|
|
|
|
return false;
|
|
|
|
return this->visitInitializer(SubExpr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
2022-10-15 14:40:23 +02:00
|
|
|
|
2023-04-05 09:11:32 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXBindTemporaryExpr(
|
|
|
|
const CXXBindTemporaryExpr *E) {
|
2023-10-30 16:16:53 +01:00
|
|
|
return this->delegate(E->getSubExpr());
|
2023-04-05 09:11:32 +02:00
|
|
|
}
|
|
|
|
|
2022-12-26 09:18:56 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCompoundLiteralExpr(
|
|
|
|
const CompoundLiteralExpr *E) {
|
|
|
|
const Expr *Init = E->getInitializer();
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
if (Initializing) {
|
|
|
|
// We already have a value, just initialize that.
|
|
|
|
return this->visitInitializer(Init);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::optional<PrimType> T = classify(E->getType());
|
2022-12-26 09:18:56 +01:00
|
|
|
if (E->isFileScope()) {
|
2024-02-26 13:15:51 +01:00
|
|
|
// Avoid creating a variable if this is a primitive RValue anyway.
|
|
|
|
if (T && !E->isLValue())
|
|
|
|
return this->delegate(Init);
|
|
|
|
|
2022-12-26 09:18:56 +01:00
|
|
|
if (std::optional<unsigned> GlobalIndex = P.createGlobal(E)) {
|
|
|
|
if (!this->emitGetPtrGlobal(*GlobalIndex, E))
|
2022-10-15 14:40:23 +02:00
|
|
|
return false;
|
2024-02-26 13:15:51 +01:00
|
|
|
|
|
|
|
if (T) {
|
|
|
|
if (!this->visit(Init))
|
|
|
|
return false;
|
|
|
|
return this->emitInitGlobal(*T, *GlobalIndex, E);
|
|
|
|
}
|
|
|
|
|
2022-12-26 09:18:56 +01:00
|
|
|
return this->visitInitializer(Init);
|
|
|
|
}
|
2024-02-26 13:15:51 +01:00
|
|
|
|
|
|
|
return false;
|
2022-12-26 09:18:56 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise, use a local variable.
|
2024-02-27 07:36:46 +01:00
|
|
|
if (T && !E->isLValue()) {
|
2022-12-26 09:18:56 +01:00
|
|
|
// For primitive types, we just visit the initializer.
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
return this->delegate(Init);
|
2022-12-26 09:18:56 +01:00
|
|
|
} else {
|
2024-02-27 07:36:46 +01:00
|
|
|
unsigned LocalIndex;
|
|
|
|
|
|
|
|
if (T)
|
|
|
|
LocalIndex = this->allocateLocalPrimitive(Init, *T, false, false);
|
|
|
|
else if (std::optional<unsigned> MaybeIndex = this->allocateLocal(Init))
|
|
|
|
LocalIndex = *MaybeIndex;
|
|
|
|
else
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->emitGetPtrLocal(LocalIndex, E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (T) {
|
|
|
|
if (!this->visit(Init)) {
|
2022-12-26 09:18:56 +01:00
|
|
|
return false;
|
2024-02-27 07:36:46 +01:00
|
|
|
}
|
|
|
|
return this->emitInit(*T, E);
|
|
|
|
} else {
|
2023-05-04 12:07:16 +02:00
|
|
|
if (!this->visitInitializer(Init))
|
|
|
|
return false;
|
2022-10-15 14:40:23 +02:00
|
|
|
}
|
2024-02-27 07:36:46 +01:00
|
|
|
|
|
|
|
if (DiscardResult)
|
|
|
|
return this->emitPopPtr(E);
|
|
|
|
return true;
|
2022-10-15 14:40:23 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2023-01-24 12:11:45 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitTypeTraitExpr(const TypeTraitExpr *E) {
|
2023-05-04 11:54:30 +02:00
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
2024-02-01 08:53:16 +01:00
|
|
|
if (E->getType()->isBooleanType())
|
|
|
|
return this->emitConstBool(E->getValue(), E);
|
|
|
|
return this->emitConst(E->getValue(), E);
|
2023-01-24 12:11:45 +01:00
|
|
|
}
|
|
|
|
|
2024-03-15 17:15:15 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitArrayTypeTraitExpr(
|
|
|
|
const ArrayTypeTraitExpr *E) {
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
return this->emitConst(E->getValue(), E);
|
|
|
|
}
|
|
|
|
|
2023-03-14 11:08:16 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitLambdaExpr(const LambdaExpr *E) {
|
2024-02-19 08:54:36 +01:00
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
assert(Initializing);
|
2023-03-14 11:08:16 +01:00
|
|
|
const Record *R = P.getOrCreateRecord(E->getLambdaClass());
|
|
|
|
|
|
|
|
auto *CaptureInitIt = E->capture_init_begin();
|
|
|
|
// Initialize all fields (which represent lambda captures) of the
|
|
|
|
// record with their initializers.
|
|
|
|
for (const Record::Field &F : R->fields()) {
|
|
|
|
const Expr *Init = *CaptureInitIt;
|
|
|
|
++CaptureInitIt;
|
|
|
|
|
2024-02-26 09:52:12 +01:00
|
|
|
if (!Init)
|
|
|
|
continue;
|
|
|
|
|
2023-03-14 11:08:16 +01:00
|
|
|
if (std::optional<PrimType> T = classify(Init)) {
|
|
|
|
if (!this->visit(Init))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->emitSetField(*T, F.Offset, E))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (!this->emitDupPtr(E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->emitGetPtrField(F.Offset, E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->visitInitializer(Init))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->emitPopPtr(E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2023-04-19 08:49:21 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitPredefinedExpr(const PredefinedExpr *E) {
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
2024-02-09 11:54:10 +01:00
|
|
|
return this->delegate(E->getFunctionName());
|
2023-04-19 08:49:21 +02:00
|
|
|
}
|
|
|
|
|
2023-05-11 16:01:54 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXThrowExpr(const CXXThrowExpr *E) {
|
2023-07-28 07:35:39 +02:00
|
|
|
if (E->getSubExpr() && !this->discard(E->getSubExpr()))
|
2023-05-11 16:01:54 +02:00
|
|
|
return false;
|
|
|
|
|
|
|
|
return this->emitInvalid(E);
|
|
|
|
}
|
|
|
|
|
2023-06-19 16:24:52 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXReinterpretCastExpr(
|
|
|
|
const CXXReinterpretCastExpr *E) {
|
|
|
|
if (!this->discard(E->getSubExpr()))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return this->emitInvalidCast(CastKind::Reinterpret, E);
|
|
|
|
}
|
|
|
|
|
2023-07-19 09:20:47 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXNoexceptExpr(const CXXNoexceptExpr *E) {
|
|
|
|
assert(E->getType()->isBooleanType());
|
|
|
|
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
return this->emitConstBool(E->getValue(), E);
|
|
|
|
}
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXConstructExpr(
|
|
|
|
const CXXConstructExpr *E) {
|
|
|
|
QualType T = E->getType();
|
|
|
|
assert(!classify(T));
|
|
|
|
|
|
|
|
if (T->isRecordType()) {
|
2023-06-30 09:56:58 +02:00
|
|
|
const CXXConstructorDecl *Ctor = E->getConstructor();
|
|
|
|
|
|
|
|
// Trivial zero initialization.
|
|
|
|
if (E->requiresZeroInitialization() && Ctor->isTrivial()) {
|
|
|
|
const Record *R = getRecord(E->getType());
|
|
|
|
return this->visitZeroRecordInitializer(R, E);
|
|
|
|
}
|
|
|
|
|
|
|
|
const Function *Func = getFunction(Ctor);
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
|
|
|
|
if (!Func)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
assert(Func->hasThisPointer());
|
|
|
|
assert(!Func->hasRVO());
|
|
|
|
|
|
|
|
// If we're discarding a construct expression, we still need
|
|
|
|
// to allocate a variable and call the constructor and destructor.
|
|
|
|
if (DiscardResult) {
|
|
|
|
assert(!Initializing);
|
|
|
|
std::optional<unsigned> LocalIndex =
|
|
|
|
allocateLocal(E, /*IsExtended=*/true);
|
|
|
|
|
|
|
|
if (!LocalIndex)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->emitGetPtrLocal(*LocalIndex, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// The This pointer is already on the stack because this is an initializer,
|
|
|
|
// but we need to dup() so the call() below has its own copy.
|
|
|
|
if (!this->emitDupPtr(E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Constructor arguments.
|
|
|
|
for (const auto *Arg : E->arguments()) {
|
|
|
|
if (!this->visit(Arg))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2024-02-14 15:29:47 +01:00
|
|
|
if (Func->isVariadic()) {
|
|
|
|
uint32_t VarArgSize = 0;
|
|
|
|
unsigned NumParams = Func->getNumWrittenParams();
|
|
|
|
for (unsigned I = NumParams, N = E->getNumArgs(); I != N; ++I) {
|
|
|
|
VarArgSize +=
|
|
|
|
align(primSize(classify(E->getArg(I)->getType()).value_or(PT_Ptr)));
|
|
|
|
}
|
|
|
|
if (!this->emitCallVar(Func, VarArgSize, E))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (!this->emitCall(Func, 0, E))
|
|
|
|
return false;
|
|
|
|
}
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
|
|
|
|
// Immediately call the destructor if we have to.
|
|
|
|
if (DiscardResult) {
|
2024-02-18 18:04:27 +01:00
|
|
|
if (!this->emitRecordDestruction(getRecord(E->getType())))
|
|
|
|
return false;
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
if (!this->emitPopPtr(E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (T->isArrayType()) {
|
|
|
|
const ConstantArrayType *CAT =
|
|
|
|
Ctx.getASTContext().getAsConstantArrayType(E->getType());
|
|
|
|
assert(CAT);
|
2024-03-26 14:15:56 -05:00
|
|
|
size_t NumElems = CAT->getZExtSize();
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
const Function *Func = getFunction(E->getConstructor());
|
|
|
|
if (!Func || !Func->isConstexpr())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// FIXME(perf): We're calling the constructor once per array element here,
|
|
|
|
// in the old intepreter we had a special-case for trivial constructors.
|
|
|
|
for (size_t I = 0; I != NumElems; ++I) {
|
|
|
|
if (!this->emitConstUint64(I, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitArrayElemPtrUint64(E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Constructor arguments.
|
|
|
|
for (const auto *Arg : E->arguments()) {
|
|
|
|
if (!this->visit(Arg))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2024-02-14 15:29:47 +01:00
|
|
|
if (!this->emitCall(Func, 0, E))
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2023-07-18 17:11:30 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitSourceLocExpr(const SourceLocExpr *E) {
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
const APValue Val =
|
|
|
|
E->EvaluateInContext(Ctx.getASTContext(), SourceLocDefaultExpr);
|
|
|
|
|
|
|
|
// Things like __builtin_LINE().
|
|
|
|
if (E->getType()->isIntegerType()) {
|
|
|
|
assert(Val.isInt());
|
|
|
|
const APSInt &I = Val.getInt();
|
|
|
|
return this->emitConst(I, E);
|
|
|
|
}
|
|
|
|
// Otherwise, the APValue is an LValue, with only one element.
|
|
|
|
// Theoretically, we don't need the APValue at all of course.
|
|
|
|
assert(E->getType()->isPointerType());
|
|
|
|
assert(Val.isLValue());
|
|
|
|
const APValue::LValueBase &Base = Val.getLValueBase();
|
|
|
|
if (const Expr *LValueExpr = Base.dyn_cast<const Expr *>())
|
|
|
|
return this->visit(LValueExpr);
|
|
|
|
|
|
|
|
// Otherwise, we have a decl (which is the case for
|
|
|
|
// __builtin_source_location).
|
|
|
|
assert(Base.is<const ValueDecl *>());
|
|
|
|
assert(Val.getLValuePath().size() == 0);
|
|
|
|
const auto *BaseDecl = Base.dyn_cast<const ValueDecl *>();
|
|
|
|
assert(BaseDecl);
|
|
|
|
|
|
|
|
auto *UGCD = cast<UnnamedGlobalConstantDecl>(BaseDecl);
|
|
|
|
|
|
|
|
std::optional<unsigned> GlobalIndex = P.getOrCreateGlobal(UGCD);
|
|
|
|
if (!GlobalIndex)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->emitGetPtrGlobal(*GlobalIndex, E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const Record *R = getRecord(E->getType());
|
|
|
|
const APValue &V = UGCD->getValue();
|
|
|
|
for (unsigned I = 0, N = R->getNumFields(); I != N; ++I) {
|
|
|
|
const Record::Field *F = R->getField(I);
|
|
|
|
const APValue &FieldValue = V.getStructField(I);
|
|
|
|
|
|
|
|
PrimType FieldT = classifyPrim(F->Decl->getType());
|
|
|
|
|
|
|
|
if (!this->visitAPValue(FieldValue, FieldT, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitInitField(FieldT, F->Offset, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Leave the pointer to the global on the stack.
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2023-07-27 08:30:59 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitOffsetOfExpr(const OffsetOfExpr *E) {
|
|
|
|
unsigned N = E->getNumComponents();
|
|
|
|
if (N == 0)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for (unsigned I = 0; I != N; ++I) {
|
|
|
|
const OffsetOfNode &Node = E->getComponent(I);
|
|
|
|
if (Node.getKind() == OffsetOfNode::Array) {
|
|
|
|
const Expr *ArrayIndexExpr = E->getIndexExpr(Node.getArrayExprIndex());
|
|
|
|
PrimType IndexT = classifyPrim(ArrayIndexExpr->getType());
|
|
|
|
|
|
|
|
if (DiscardResult) {
|
|
|
|
if (!this->discard(ArrayIndexExpr))
|
|
|
|
return false;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!this->visit(ArrayIndexExpr))
|
|
|
|
return false;
|
|
|
|
// Cast to Sint64.
|
|
|
|
if (IndexT != PT_Sint64) {
|
|
|
|
if (!this->emitCast(IndexT, PT_Sint64, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
PrimType T = classifyPrim(E->getType());
|
|
|
|
return this->emitOffsetOf(T, E, E);
|
|
|
|
}
|
|
|
|
|
2023-10-10 12:45:09 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXScalarValueInitExpr(
|
|
|
|
const CXXScalarValueInitExpr *E) {
|
2023-10-24 09:18:39 +02:00
|
|
|
QualType Ty = E->getType();
|
|
|
|
|
2024-02-05 15:56:06 +01:00
|
|
|
if (DiscardResult || Ty->isVoidType())
|
2023-10-24 09:18:39 +02:00
|
|
|
return true;
|
|
|
|
|
2024-02-05 15:56:06 +01:00
|
|
|
if (std::optional<PrimType> T = classify(Ty))
|
|
|
|
return this->visitZeroInitializer(*T, Ty, E);
|
|
|
|
|
|
|
|
assert(Ty->isAnyComplexType());
|
|
|
|
if (!Initializing) {
|
|
|
|
std::optional<unsigned> LocalIndex = allocateLocal(E, /*IsExtended=*/false);
|
|
|
|
if (!LocalIndex)
|
|
|
|
return false;
|
|
|
|
if (!this->emitGetPtrLocal(*LocalIndex, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Initialize both fields to 0.
|
|
|
|
QualType ElemQT = Ty->getAs<ComplexType>()->getElementType();
|
|
|
|
PrimType ElemT = classifyPrim(ElemQT);
|
|
|
|
|
|
|
|
for (unsigned I = 0; I != 2; ++I) {
|
|
|
|
if (!this->visitZeroInitializer(ElemT, ElemQT, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitInitElem(ElemT, I, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
2023-10-10 12:45:09 +02:00
|
|
|
}
|
|
|
|
|
2023-11-12 05:34:16 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitSizeOfPackExpr(const SizeOfPackExpr *E) {
|
|
|
|
return this->emitConst(E->getPackLength(), E);
|
|
|
|
}
|
|
|
|
|
2024-01-31 15:51:48 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitGenericSelectionExpr(
|
|
|
|
const GenericSelectionExpr *E) {
|
|
|
|
return this->delegate(E->getResultExpr());
|
|
|
|
}
|
|
|
|
|
2024-02-01 09:11:27 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitChooseExpr(const ChooseExpr *E) {
|
|
|
|
return this->delegate(E->getChosenSubExpr());
|
|
|
|
}
|
|
|
|
|
2024-02-05 18:19:45 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitObjCBoolLiteralExpr(
|
|
|
|
const ObjCBoolLiteralExpr *E) {
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return this->emitConst(E->getValue(), E);
|
|
|
|
}
|
|
|
|
|
2024-02-08 09:55:07 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXInheritedCtorInitExpr(
|
|
|
|
const CXXInheritedCtorInitExpr *E) {
|
|
|
|
const CXXConstructorDecl *Ctor = E->getConstructor();
|
|
|
|
assert(!Ctor->isTrivial() &&
|
|
|
|
"Trivial CXXInheritedCtorInitExpr, implement. (possible?)");
|
|
|
|
const Function *F = this->getFunction(Ctor);
|
|
|
|
assert(F);
|
|
|
|
assert(!F->hasRVO());
|
|
|
|
assert(F->hasThisPointer());
|
|
|
|
|
|
|
|
if (!this->emitDupPtr(SourceInfo{}))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Forward all arguments of the current function (which should be a
|
|
|
|
// constructor itself) to the inherited ctor.
|
|
|
|
// This is necessary because the calling code has pushed the pointer
|
|
|
|
// of the correct base for us already, but the arguments need
|
|
|
|
// to come after.
|
|
|
|
unsigned Offset = align(primSize(PT_Ptr)); // instance pointer.
|
|
|
|
for (const ParmVarDecl *PD : Ctor->parameters()) {
|
|
|
|
PrimType PT = this->classify(PD->getType()).value_or(PT_Ptr);
|
|
|
|
|
|
|
|
if (!this->emitGetParam(PT, Offset, E))
|
|
|
|
return false;
|
|
|
|
Offset += align(primSize(PT));
|
|
|
|
}
|
|
|
|
|
2024-02-14 15:29:47 +01:00
|
|
|
return this->emitCall(F, 0, E);
|
2024-02-08 09:55:07 +01:00
|
|
|
}
|
|
|
|
|
2024-02-09 10:23:54 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitExpressionTraitExpr(
|
|
|
|
const ExpressionTraitExpr *E) {
|
|
|
|
assert(Ctx.getLangOpts().CPlusPlus);
|
|
|
|
return this->emitConstBool(E->getValue(), E);
|
|
|
|
}
|
|
|
|
|
2024-02-13 13:33:21 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXUuidofExpr(const CXXUuidofExpr *E) {
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
assert(!Initializing);
|
|
|
|
|
|
|
|
std::optional<unsigned> GlobalIndex = P.getOrCreateGlobal(E->getGuidDecl());
|
|
|
|
if (!GlobalIndex)
|
|
|
|
return false;
|
|
|
|
if (!this->emitGetPtrGlobal(*GlobalIndex, E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const Record *R = this->getRecord(E->getType());
|
|
|
|
assert(R);
|
|
|
|
|
|
|
|
const APValue &V = E->getGuidDecl()->getAsAPValue();
|
|
|
|
if (V.getKind() == APValue::None)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
assert(V.isStruct());
|
|
|
|
assert(V.getStructNumBases() == 0);
|
|
|
|
// FIXME: This could be useful in visitAPValue, too.
|
|
|
|
for (unsigned I = 0, N = V.getStructNumFields(); I != N; ++I) {
|
|
|
|
const APValue &F = V.getStructField(I);
|
|
|
|
const Record::Field *RF = R->getField(I);
|
|
|
|
|
|
|
|
if (F.isInt()) {
|
|
|
|
PrimType T = classifyPrim(RF->Decl->getType());
|
|
|
|
if (!this->visitAPValue(F, T, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitInitField(T, RF->Offset, E))
|
|
|
|
return false;
|
|
|
|
} else if (F.isArray()) {
|
|
|
|
assert(RF->Desc->isPrimitiveArray());
|
|
|
|
const auto *ArrType = RF->Decl->getType()->getAsArrayTypeUnsafe();
|
|
|
|
PrimType ElemT = classifyPrim(ArrType->getElementType());
|
|
|
|
assert(ArrType);
|
|
|
|
|
|
|
|
if (!this->emitDupPtr(E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitGetPtrField(RF->Offset, E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for (unsigned A = 0, AN = F.getArraySize(); A != AN; ++A) {
|
|
|
|
if (!this->visitAPValue(F.getArrayInitializedElt(A), ElemT, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitInitElem(ElemT, A, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!this->emitPopPtr(E))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
assert(false && "I don't think this should be possible");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2024-02-27 07:36:01 +01:00
|
|
|
return this->emitFinishInit(E);
|
2024-02-13 13:33:21 +01:00
|
|
|
}
|
|
|
|
|
2024-02-13 15:00:19 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitRequiresExpr(const RequiresExpr *E) {
|
|
|
|
assert(classifyPrim(E->getType()) == PT_Bool);
|
|
|
|
return this->emitConstBool(E->isSatisfied(), E);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitConceptSpecializationExpr(
|
|
|
|
const ConceptSpecializationExpr *E) {
|
|
|
|
assert(classifyPrim(E->getType()) == PT_Bool);
|
|
|
|
return this->emitConstBool(E->isSatisfied(), E);
|
|
|
|
}
|
|
|
|
|
2024-02-19 11:51:27 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXRewrittenBinaryOperator(
|
|
|
|
const CXXRewrittenBinaryOperator *E) {
|
|
|
|
return this->delegate(E->getSemanticForm());
|
|
|
|
}
|
|
|
|
|
2024-02-27 14:00:09 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitPseudoObjectExpr(
|
|
|
|
const PseudoObjectExpr *E) {
|
|
|
|
|
|
|
|
for (const Expr *SemE : E->semantics()) {
|
|
|
|
if (auto *OVE = dyn_cast<OpaqueValueExpr>(SemE)) {
|
|
|
|
if (SemE == E->getResultExpr())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (OVE->isUnique())
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (!this->discard(OVE))
|
|
|
|
return false;
|
|
|
|
} else if (SemE == E->getResultExpr()) {
|
|
|
|
if (!this->delegate(SemE))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (!this->discard(SemE))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2024-03-15 09:57:10 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitPackIndexingExpr(
|
|
|
|
const PackIndexingExpr *E) {
|
|
|
|
return this->delegate(E->getSelectedExpr());
|
|
|
|
}
|
|
|
|
|
2022-09-14 16:53:55 +02:00
|
|
|
template <class Emitter> bool ByteCodeExprGen<Emitter>::discard(const Expr *E) {
|
2022-11-04 05:58:59 +01:00
|
|
|
if (E->containsErrors())
|
|
|
|
return false;
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
OptionScope<Emitter> Scope(this, /*NewDiscardResult=*/true,
|
|
|
|
/*NewInitializing=*/false);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
return this->Visit(E);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
bool ByteCodeExprGen<Emitter>::delegate(const Expr *E) {
|
2022-11-04 05:58:59 +01:00
|
|
|
if (E->containsErrors())
|
2024-03-15 10:34:18 +01:00
|
|
|
return this->emitError(E);
|
2022-11-04 05:58:59 +01:00
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
// We're basically doing:
|
|
|
|
// OptionScope<Emitter> Scope(this, DicardResult, Initializing);
|
|
|
|
// but that's unnecessary of course.
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
return this->Visit(E);
|
|
|
|
}
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
template <class Emitter> bool ByteCodeExprGen<Emitter>::visit(const Expr *E) {
|
|
|
|
if (E->containsErrors())
|
2024-03-15 10:34:18 +01:00
|
|
|
return this->emitError(E);
|
2023-01-11 15:59:29 +01:00
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
if (E->getType()->isVoidType())
|
|
|
|
return this->discard(E);
|
2023-01-11 15:59:29 +01:00
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
// Create local variable to hold the return value.
|
2023-04-15 14:20:35 +02:00
|
|
|
if (!E->isGLValue() && !E->getType()->isAnyComplexType() &&
|
|
|
|
!classify(E->getType())) {
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
std::optional<unsigned> LocalIndex = allocateLocal(E, /*IsExtended=*/true);
|
|
|
|
if (!LocalIndex)
|
|
|
|
return false;
|
2023-06-01 09:48:04 +02:00
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
if (!this->emitGetPtrLocal(*LocalIndex, E))
|
2023-06-01 09:48:04 +02:00
|
|
|
return false;
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
return this->visitInitializer(E);
|
2023-06-01 09:48:04 +02:00
|
|
|
}
|
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
// Otherwise,we have a primitive return value, produce the value directly
|
2023-09-15 09:55:52 +02:00
|
|
|
// and push it on the stack.
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
OptionScope<Emitter> Scope(this, /*NewDiscardResult=*/false,
|
|
|
|
/*NewInitializing=*/false);
|
|
|
|
return this->Visit(E);
|
|
|
|
}
|
2023-01-11 15:59:29 +01:00
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::visitInitializer(const Expr *E) {
|
|
|
|
assert(!classify(E->getType()));
|
2023-01-11 15:59:29 +01:00
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
if (E->containsErrors())
|
2024-03-15 10:34:18 +01:00
|
|
|
return this->emitError(E);
|
2023-01-11 15:59:29 +01:00
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
OptionScope<Emitter> Scope(this, /*NewDiscardResult=*/false,
|
|
|
|
/*NewInitializing=*/true);
|
|
|
|
return this->Visit(E);
|
|
|
|
}
|
2023-01-11 15:59:29 +01:00
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::visitBool(const Expr *E) {
|
2023-08-05 07:47:22 +02:00
|
|
|
std::optional<PrimType> T = classify(E->getType());
|
2024-02-20 10:27:41 +01:00
|
|
|
if (!T) {
|
|
|
|
// Convert complex values to bool.
|
|
|
|
if (E->getType()->isAnyComplexType()) {
|
|
|
|
if (!this->visit(E))
|
|
|
|
return false;
|
|
|
|
return this->emitComplexBoolCast(E);
|
|
|
|
}
|
2023-08-05 07:47:22 +02:00
|
|
|
return false;
|
2024-02-20 10:27:41 +01:00
|
|
|
}
|
2023-08-05 07:47:22 +02:00
|
|
|
|
|
|
|
if (!this->visit(E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (T == PT_Bool)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// Convert pointers to bool.
|
|
|
|
if (T == PT_Ptr || T == PT_FnPtr) {
|
2024-04-10 12:53:54 +02:00
|
|
|
if (!this->emitNull(*T, nullptr, E))
|
2023-08-05 07:47:22 +02:00
|
|
|
return false;
|
|
|
|
return this->emitNE(*T, E);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Or Floats.
|
|
|
|
if (T == PT_Float)
|
|
|
|
return this->emitCastFloatingIntegralBool(E);
|
|
|
|
|
|
|
|
// Or anything else we can.
|
|
|
|
return this->emitCast(*T, PT_Bool, E);
|
2023-01-11 15:59:29 +01:00
|
|
|
}
|
|
|
|
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
template <class Emitter>
|
2023-10-14 17:42:27 +02:00
|
|
|
bool ByteCodeExprGen<Emitter>::visitZeroInitializer(PrimType T, QualType QT,
|
2023-04-01 08:41:20 +02:00
|
|
|
const Expr *E) {
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
switch (T) {
|
|
|
|
case PT_Bool:
|
|
|
|
return this->emitZeroBool(E);
|
|
|
|
case PT_Sint8:
|
|
|
|
return this->emitZeroSint8(E);
|
|
|
|
case PT_Uint8:
|
|
|
|
return this->emitZeroUint8(E);
|
|
|
|
case PT_Sint16:
|
|
|
|
return this->emitZeroSint16(E);
|
|
|
|
case PT_Uint16:
|
|
|
|
return this->emitZeroUint16(E);
|
|
|
|
case PT_Sint32:
|
|
|
|
return this->emitZeroSint32(E);
|
|
|
|
case PT_Uint32:
|
|
|
|
return this->emitZeroUint32(E);
|
|
|
|
case PT_Sint64:
|
|
|
|
return this->emitZeroSint64(E);
|
|
|
|
case PT_Uint64:
|
|
|
|
return this->emitZeroUint64(E);
|
2023-09-30 20:12:59 +02:00
|
|
|
case PT_IntAP:
|
2023-10-19 08:20:53 +02:00
|
|
|
return this->emitZeroIntAP(Ctx.getBitWidth(QT), E);
|
2023-09-30 20:12:59 +02:00
|
|
|
case PT_IntAPS:
|
2023-10-19 08:20:53 +02:00
|
|
|
return this->emitZeroIntAPS(Ctx.getBitWidth(QT), E);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
case PT_Ptr:
|
2024-04-10 12:53:54 +02:00
|
|
|
return this->emitNullPtr(nullptr, E);
|
2023-01-11 12:12:52 +01:00
|
|
|
case PT_FnPtr:
|
2024-04-10 12:53:54 +02:00
|
|
|
return this->emitNullFnPtr(nullptr, E);
|
2023-03-24 08:33:59 +01:00
|
|
|
case PT_Float: {
|
2023-04-01 08:41:20 +02:00
|
|
|
return this->emitConstFloat(APFloat::getZero(Ctx.getFloatSemantics(QT)), E);
|
2023-03-24 08:33:59 +01:00
|
|
|
}
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
|
|
|
llvm_unreachable("unknown primitive type");
|
|
|
|
}
|
|
|
|
|
2023-06-30 09:56:58 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::visitZeroRecordInitializer(const Record *R,
|
|
|
|
const Expr *E) {
|
|
|
|
assert(E);
|
|
|
|
assert(R);
|
|
|
|
// Fields
|
|
|
|
for (const Record::Field &Field : R->fields()) {
|
|
|
|
const Descriptor *D = Field.Desc;
|
|
|
|
if (D->isPrimitive()) {
|
|
|
|
QualType QT = D->getType();
|
|
|
|
PrimType T = classifyPrim(D->getType());
|
2023-10-14 17:42:27 +02:00
|
|
|
if (!this->visitZeroInitializer(T, QT, E))
|
2023-06-30 09:56:58 +02:00
|
|
|
return false;
|
|
|
|
if (!this->emitInitField(T, Field.Offset, E))
|
|
|
|
return false;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// TODO: Add GetPtrFieldPop and get rid of this dup.
|
|
|
|
if (!this->emitDupPtr(E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitGetPtrField(Field.Offset, E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (D->isPrimitiveArray()) {
|
|
|
|
QualType ET = D->getElemQualType();
|
|
|
|
PrimType T = classifyPrim(ET);
|
|
|
|
for (uint32_t I = 0, N = D->getNumElems(); I != N; ++I) {
|
2023-10-14 17:42:27 +02:00
|
|
|
if (!this->visitZeroInitializer(T, ET, E))
|
2023-06-30 09:56:58 +02:00
|
|
|
return false;
|
|
|
|
if (!this->emitInitElem(T, I, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
} else if (D->isCompositeArray()) {
|
|
|
|
const Record *ElemRecord = D->ElemDesc->ElemRecord;
|
|
|
|
assert(D->ElemDesc->ElemRecord);
|
|
|
|
for (uint32_t I = 0, N = D->getNumElems(); I != N; ++I) {
|
|
|
|
if (!this->emitConstUint32(I, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitArrayElemPtr(PT_Uint32, E))
|
|
|
|
return false;
|
|
|
|
if (!this->visitZeroRecordInitializer(ElemRecord, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitPopPtr(E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
} else if (D->isRecord()) {
|
|
|
|
if (!this->visitZeroRecordInitializer(D->ElemRecord, E))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
assert(false);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!this->emitPopPtr(E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (const Record::Base &B : R->bases()) {
|
|
|
|
if (!this->emitGetPtrBase(B.Offset, E))
|
|
|
|
return false;
|
|
|
|
if (!this->visitZeroRecordInitializer(B.R, E))
|
|
|
|
return false;
|
2024-02-27 07:36:01 +01:00
|
|
|
if (!this->emitFinishInitPop(E))
|
2023-06-30 09:56:58 +02:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// FIXME: Virtual bases.
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
template <class Emitter>
|
2022-10-30 10:05:42 +01:00
|
|
|
template <typename T>
|
2023-07-18 17:11:30 +02:00
|
|
|
bool ByteCodeExprGen<Emitter>::emitConst(T Value, PrimType Ty, const Expr *E) {
|
|
|
|
switch (Ty) {
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
case PT_Sint8:
|
2022-10-30 10:05:42 +01:00
|
|
|
return this->emitConstSint8(Value, E);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
case PT_Uint8:
|
2022-10-30 10:05:42 +01:00
|
|
|
return this->emitConstUint8(Value, E);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
case PT_Sint16:
|
2022-10-30 10:05:42 +01:00
|
|
|
return this->emitConstSint16(Value, E);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
case PT_Uint16:
|
2022-10-30 10:05:42 +01:00
|
|
|
return this->emitConstUint16(Value, E);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
case PT_Sint32:
|
2022-10-30 10:05:42 +01:00
|
|
|
return this->emitConstSint32(Value, E);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
case PT_Uint32:
|
2022-10-30 10:05:42 +01:00
|
|
|
return this->emitConstUint32(Value, E);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
case PT_Sint64:
|
2022-10-30 10:05:42 +01:00
|
|
|
return this->emitConstSint64(Value, E);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
case PT_Uint64:
|
2022-10-30 10:05:42 +01:00
|
|
|
return this->emitConstUint64(Value, E);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
case PT_Bool:
|
2022-10-30 10:05:42 +01:00
|
|
|
return this->emitConstBool(Value, E);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
case PT_Ptr:
|
2023-01-11 12:12:52 +01:00
|
|
|
case PT_FnPtr:
|
2023-01-25 14:51:16 +01:00
|
|
|
case PT_Float:
|
2024-01-31 10:00:42 +01:00
|
|
|
case PT_IntAP:
|
|
|
|
case PT_IntAPS:
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
llvm_unreachable("Invalid integral type");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
llvm_unreachable("unknown primitive type");
|
|
|
|
}
|
|
|
|
|
2022-10-30 10:05:42 +01:00
|
|
|
template <class Emitter>
|
2023-07-18 17:11:30 +02:00
|
|
|
template <typename T>
|
|
|
|
bool ByteCodeExprGen<Emitter>::emitConst(T Value, const Expr *E) {
|
|
|
|
return this->emitConst(Value, classifyPrim(E->getType()), E);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::emitConst(const APSInt &Value, PrimType Ty,
|
|
|
|
const Expr *E) {
|
2024-01-31 10:00:42 +01:00
|
|
|
if (Ty == PT_IntAPS)
|
|
|
|
return this->emitConstIntAPS(Value, E);
|
|
|
|
if (Ty == PT_IntAP)
|
|
|
|
return this->emitConstIntAP(Value, E);
|
|
|
|
|
2022-10-30 10:05:42 +01:00
|
|
|
if (Value.isSigned())
|
2023-07-18 17:11:30 +02:00
|
|
|
return this->emitConst(Value.getSExtValue(), Ty, E);
|
|
|
|
return this->emitConst(Value.getZExtValue(), Ty, E);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::emitConst(const APSInt &Value, const Expr *E) {
|
|
|
|
return this->emitConst(Value, classifyPrim(E->getType()), E);
|
2022-10-30 10:05:42 +01:00
|
|
|
}
|
|
|
|
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
template <class Emitter>
|
|
|
|
unsigned ByteCodeExprGen<Emitter>::allocateLocalPrimitive(DeclTy &&Src,
|
|
|
|
PrimType Ty,
|
|
|
|
bool IsConst,
|
|
|
|
bool IsExtended) {
|
2023-01-20 15:07:25 +01:00
|
|
|
// Make sure we don't accidentally register the same decl twice.
|
|
|
|
if (const auto *VD =
|
|
|
|
dyn_cast_if_present<ValueDecl>(Src.dyn_cast<const Decl *>())) {
|
|
|
|
assert(!P.getGlobal(VD));
|
2023-03-15 18:06:34 -07:00
|
|
|
assert(!Locals.contains(VD));
|
2024-04-07 09:25:47 +09:00
|
|
|
(void)VD;
|
2023-01-20 15:07:25 +01:00
|
|
|
}
|
|
|
|
|
2022-12-26 09:29:04 +01:00
|
|
|
// FIXME: There are cases where Src.is<Expr*>() is wrong, e.g.
|
|
|
|
// (int){12} in C. Consider using Expr::isTemporaryObject() instead
|
|
|
|
// or isa<MaterializeTemporaryExpr>().
|
|
|
|
Descriptor *D = P.createDescriptor(Src, Ty, Descriptor::InlineDescMD, IsConst,
|
|
|
|
Src.is<const Expr *>());
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
Scope::Local Local = this->createLocal(D);
|
2022-12-23 07:56:58 +01:00
|
|
|
if (auto *VD = dyn_cast_if_present<ValueDecl>(Src.dyn_cast<const Decl *>()))
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
Locals.insert({VD, Local});
|
|
|
|
VarScope->add(Local, IsExtended);
|
|
|
|
return Local.Offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
2022-12-05 17:30:24 +01:00
|
|
|
std::optional<unsigned>
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
ByteCodeExprGen<Emitter>::allocateLocal(DeclTy &&Src, bool IsExtended) {
|
2023-01-20 15:07:25 +01:00
|
|
|
// Make sure we don't accidentally register the same decl twice.
|
2023-08-30 17:39:05 +02:00
|
|
|
if ([[maybe_unused]] const auto *VD =
|
2023-01-20 15:07:25 +01:00
|
|
|
dyn_cast_if_present<ValueDecl>(Src.dyn_cast<const Decl *>())) {
|
|
|
|
assert(!P.getGlobal(VD));
|
2023-03-15 18:06:34 -07:00
|
|
|
assert(!Locals.contains(VD));
|
2023-01-20 15:07:25 +01:00
|
|
|
}
|
2023-01-19 13:52:05 +01:00
|
|
|
|
2023-01-20 15:07:25 +01:00
|
|
|
QualType Ty;
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
const ValueDecl *Key = nullptr;
|
2022-09-14 15:03:04 +02:00
|
|
|
const Expr *Init = nullptr;
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
bool IsTemporary = false;
|
2022-09-14 15:03:04 +02:00
|
|
|
if (auto *VD = dyn_cast_if_present<ValueDecl>(Src.dyn_cast<const Decl *>())) {
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
Key = VD;
|
|
|
|
Ty = VD->getType();
|
2022-09-14 15:03:04 +02:00
|
|
|
|
|
|
|
if (const auto *VarD = dyn_cast<VarDecl>(VD))
|
|
|
|
Init = VarD->getInit();
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
|
|
|
if (auto *E = Src.dyn_cast<const Expr *>()) {
|
|
|
|
IsTemporary = true;
|
|
|
|
Ty = E->getType();
|
|
|
|
}
|
|
|
|
|
2022-09-14 15:03:04 +02:00
|
|
|
Descriptor *D = P.createDescriptor(
|
2022-12-26 09:29:04 +01:00
|
|
|
Src, Ty.getTypePtr(), Descriptor::InlineDescMD, Ty.isConstQualified(),
|
|
|
|
IsTemporary, /*IsMutable=*/false, Init);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
if (!D)
|
2024-02-15 15:47:27 +01:00
|
|
|
return std::nullopt;
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
|
|
|
|
Scope::Local Local = this->createLocal(D);
|
|
|
|
if (Key)
|
|
|
|
Locals.insert({Key, Local});
|
|
|
|
VarScope->add(Local, IsExtended);
|
|
|
|
return Local.Offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
const RecordType *ByteCodeExprGen<Emitter>::getRecordTy(QualType Ty) {
|
2022-07-04 05:30:56 +09:00
|
|
|
if (const PointerType *PT = dyn_cast<PointerType>(Ty))
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
return PT->getPointeeType()->getAs<RecordType>();
|
2023-09-20 14:32:45 +02:00
|
|
|
return Ty->getAs<RecordType>();
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
Record *ByteCodeExprGen<Emitter>::getRecord(QualType Ty) {
|
2023-09-20 14:32:45 +02:00
|
|
|
if (const auto *RecordTy = getRecordTy(Ty))
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
return getRecord(RecordTy->getDecl());
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
Record *ByteCodeExprGen<Emitter>::getRecord(const RecordDecl *RD) {
|
|
|
|
return P.getOrCreateRecord(RD);
|
|
|
|
}
|
|
|
|
|
2022-09-18 20:40:27 +02:00
|
|
|
template <class Emitter>
|
|
|
|
const Function *ByteCodeExprGen<Emitter>::getFunction(const FunctionDecl *FD) {
|
2023-08-10 16:04:28 +02:00
|
|
|
return Ctx.getOrCreateFunction(FD);
|
2022-09-18 20:40:27 +02:00
|
|
|
}
|
|
|
|
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
template <class Emitter>
|
2023-09-03 06:44:53 +02:00
|
|
|
bool ByteCodeExprGen<Emitter>::visitExpr(const Expr *E) {
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
ExprScope<Emitter> RootScope(this);
|
2023-05-16 13:39:48 +02:00
|
|
|
// Void expressions.
|
|
|
|
if (E->getType()->isVoidType()) {
|
|
|
|
if (!visit(E))
|
|
|
|
return false;
|
2023-09-03 06:44:53 +02:00
|
|
|
return this->emitRetVoid(E);
|
2023-05-16 13:39:48 +02:00
|
|
|
}
|
2023-04-21 16:46:09 +02:00
|
|
|
|
2023-05-16 13:39:48 +02:00
|
|
|
// Expressions with a primitive return type.
|
|
|
|
if (std::optional<PrimType> T = classify(E)) {
|
|
|
|
if (!visit(E))
|
|
|
|
return false;
|
2023-09-03 06:44:53 +02:00
|
|
|
return this->emitRet(*T, E);
|
2023-05-16 13:39:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// Expressions with a composite return type.
|
|
|
|
// For us, that means everything we don't
|
|
|
|
// have a PrimType for.
|
|
|
|
if (std::optional<unsigned> LocalOffset = this->allocateLocal(E)) {
|
2024-02-09 19:03:18 +01:00
|
|
|
if (!this->emitGetPtrLocal(*LocalOffset, E))
|
2023-05-16 13:39:48 +02:00
|
|
|
return false;
|
|
|
|
|
2024-02-09 19:03:18 +01:00
|
|
|
if (!visitInitializer(E))
|
|
|
|
return false;
|
|
|
|
|
2024-02-27 07:36:01 +01:00
|
|
|
if (!this->emitFinishInit(E))
|
2023-05-16 13:39:48 +02:00
|
|
|
return false;
|
2024-02-28 07:38:22 +01:00
|
|
|
// We are destroying the locals AFTER the Ret op.
|
|
|
|
// The Ret op needs to copy the (alive) values, but the
|
|
|
|
// destructors may still turn the entire expression invalid.
|
|
|
|
return this->emitRetValue(E) && RootScope.destroyLocals();
|
2023-05-16 13:39:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
|
|
|
|
2023-01-20 15:07:25 +01:00
|
|
|
/// Toplevel visitDecl().
|
|
|
|
/// We get here from evaluateAsInitializer().
|
|
|
|
/// We need to evaluate the initializer and return its value.
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::visitDecl(const VarDecl *VD) {
|
2022-11-04 05:58:59 +01:00
|
|
|
assert(!VD->isInvalidDecl() && "Trying to constant evaluate an invalid decl");
|
2023-01-20 15:07:25 +01:00
|
|
|
|
2024-02-23 11:58:27 +01:00
|
|
|
// Global variable we've already seen but that's uninitialized means
|
|
|
|
// evaluating the initializer failed. Just return failure.
|
|
|
|
if (std::optional<unsigned> Index = P.getGlobal(VD);
|
|
|
|
Index && !P.getPtrGlobal(*Index).isInitialized())
|
|
|
|
return false;
|
|
|
|
|
2023-01-20 15:07:25 +01:00
|
|
|
// Create and initialize the variable.
|
|
|
|
if (!this->visitVarDecl(VD))
|
|
|
|
return false;
|
|
|
|
|
2023-11-10 09:12:14 +01:00
|
|
|
std::optional<PrimType> VarT = classify(VD->getType());
|
2023-01-20 15:07:25 +01:00
|
|
|
// Get a pointer to the variable
|
2023-07-09 14:30:15 +02:00
|
|
|
if (Context::shouldBeGloballyIndexed(VD)) {
|
2023-01-20 15:07:25 +01:00
|
|
|
auto GlobalIndex = P.getGlobal(VD);
|
|
|
|
assert(GlobalIndex); // visitVarDecl() didn't return false.
|
2023-11-10 09:12:14 +01:00
|
|
|
if (VarT) {
|
2024-01-13 05:51:03 +01:00
|
|
|
if (!this->emitGetGlobalUnchecked(*VarT, *GlobalIndex, VD))
|
2023-11-10 09:12:14 +01:00
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (!this->emitGetPtrGlobal(*GlobalIndex, VD))
|
|
|
|
return false;
|
|
|
|
}
|
2023-01-20 15:07:25 +01:00
|
|
|
} else {
|
|
|
|
auto Local = Locals.find(VD);
|
|
|
|
assert(Local != Locals.end()); // Same here.
|
2023-11-10 09:12:14 +01:00
|
|
|
if (VarT) {
|
|
|
|
if (!this->emitGetLocal(*VarT, Local->second.Offset, VD))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (!this->emitGetPtrLocal(Local->second.Offset, VD))
|
|
|
|
return false;
|
|
|
|
}
|
2023-01-20 15:07:25 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Return the value
|
2023-11-10 09:12:14 +01:00
|
|
|
if (VarT)
|
2023-01-20 15:07:25 +01:00
|
|
|
return this->emitRet(*VarT, VD);
|
2024-01-19 10:08:03 +01:00
|
|
|
|
|
|
|
// Return non-primitive values as pointers here.
|
|
|
|
return this->emitRet(PT_Ptr, VD);
|
2023-01-20 15:07:25 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::visitVarDecl(const VarDecl *VD) {
|
2022-12-26 09:18:56 +01:00
|
|
|
// We don't know what to do with these, so just return false.
|
|
|
|
if (VD->getType().isNull())
|
|
|
|
return false;
|
|
|
|
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
const Expr *Init = VD->getInit();
|
2023-01-20 15:07:25 +01:00
|
|
|
std::optional<PrimType> VarT = classify(VD->getType());
|
|
|
|
|
2023-07-09 14:30:15 +02:00
|
|
|
if (Context::shouldBeGloballyIndexed(VD)) {
|
2024-04-11 17:53:57 +02:00
|
|
|
auto initGlobal = [&](unsigned GlobalIndex) -> bool {
|
|
|
|
assert(Init);
|
2023-01-20 15:07:25 +01:00
|
|
|
DeclScope<Emitter> LocalScope(this, VD);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
|
2023-01-20 15:07:25 +01:00
|
|
|
if (VarT) {
|
|
|
|
if (!this->visit(Init))
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
return false;
|
2024-04-11 17:53:57 +02:00
|
|
|
return this->emitInitGlobal(*VarT, GlobalIndex, VD);
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
2024-04-11 17:53:57 +02:00
|
|
|
return this->visitGlobalInitializer(Init, GlobalIndex);
|
|
|
|
};
|
|
|
|
|
|
|
|
// We've already seen and initialized this global.
|
|
|
|
if (std::optional<unsigned> GlobalIndex = P.getGlobal(VD)) {
|
|
|
|
if (P.getPtrGlobal(*GlobalIndex).isInitialized())
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// The previous attempt at initialization might've been unsuccessful,
|
|
|
|
// so let's try this one.
|
|
|
|
return Init && initGlobal(*GlobalIndex);
|
2023-01-20 15:07:25 +01:00
|
|
|
}
|
2024-04-11 17:53:57 +02:00
|
|
|
|
|
|
|
std::optional<unsigned> GlobalIndex = P.createGlobal(VD, Init);
|
|
|
|
|
|
|
|
if (!GlobalIndex)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return !Init || initGlobal(*GlobalIndex);
|
2023-01-20 15:07:25 +01:00
|
|
|
} else {
|
|
|
|
VariableScope<Emitter> LocalScope(this);
|
|
|
|
if (VarT) {
|
|
|
|
unsigned Offset = this->allocateLocalPrimitive(
|
|
|
|
VD, *VarT, VD->getType().isConstQualified());
|
|
|
|
if (Init) {
|
|
|
|
// Compile the initializer in its own scope.
|
|
|
|
ExprScope<Emitter> Scope(this);
|
|
|
|
if (!this->visit(Init))
|
|
|
|
return false;
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
|
2023-01-20 15:07:25 +01:00
|
|
|
return this->emitSetLocal(*VarT, Offset, VD);
|
|
|
|
}
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
} else {
|
2024-02-19 10:32:44 +01:00
|
|
|
if (std::optional<unsigned> Offset = this->allocateLocal(VD))
|
|
|
|
return !Init || this->visitLocalInitializer(Init, *Offset);
|
|
|
|
return false;
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
2023-01-20 15:07:25 +01:00
|
|
|
return true;
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
|
|
|
|
2023-01-20 15:07:25 +01:00
|
|
|
return false;
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
}
|
|
|
|
|
2023-07-18 17:11:30 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::visitAPValue(const APValue &Val,
|
|
|
|
PrimType ValType, const Expr *E) {
|
|
|
|
assert(!DiscardResult);
|
|
|
|
if (Val.isInt())
|
|
|
|
return this->emitConst(Val.getInt(), ValType, E);
|
|
|
|
|
|
|
|
if (Val.isLValue()) {
|
|
|
|
APValue::LValueBase Base = Val.getLValueBase();
|
|
|
|
if (const Expr *BaseExpr = Base.dyn_cast<const Expr *>())
|
|
|
|
return this->visit(BaseExpr);
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2022-11-05 13:08:40 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitBuiltinCallExpr(const CallExpr *E) {
|
|
|
|
const Function *Func = getFunction(E->getDirectCallee());
|
|
|
|
if (!Func)
|
|
|
|
return false;
|
|
|
|
|
2024-03-04 07:37:33 +01:00
|
|
|
QualType ReturnType = E->getType();
|
|
|
|
std::optional<PrimType> ReturnT = classify(E);
|
|
|
|
|
|
|
|
// Non-primitive return type. Prepare storage.
|
|
|
|
if (!Initializing && !ReturnT && !ReturnType->isVoidType()) {
|
|
|
|
std::optional<unsigned> LocalIndex = allocateLocal(E, /*IsExtended=*/false);
|
|
|
|
if (!LocalIndex)
|
|
|
|
return false;
|
|
|
|
if (!this->emitGetPtrLocal(*LocalIndex, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2023-11-17 16:13:23 +01:00
|
|
|
if (!Func->isUnevaluatedBuiltin()) {
|
|
|
|
// Put arguments on the stack.
|
|
|
|
for (const auto *Arg : E->arguments()) {
|
|
|
|
if (!this->visit(Arg))
|
|
|
|
return false;
|
|
|
|
}
|
2022-11-05 13:08:40 +01:00
|
|
|
}
|
|
|
|
|
2023-07-18 07:47:20 +02:00
|
|
|
if (!this->emitCallBI(Func, E, E))
|
2022-11-05 13:08:40 +01:00
|
|
|
return false;
|
|
|
|
|
2023-01-07 08:10:48 +01:00
|
|
|
if (DiscardResult && !ReturnType->isVoidType()) {
|
2024-03-04 07:37:33 +01:00
|
|
|
assert(ReturnT);
|
|
|
|
return this->emitPop(*ReturnT, E);
|
2022-11-05 13:08:40 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2022-08-19 13:45:11 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCallExpr(const CallExpr *E) {
|
2022-11-05 13:08:40 +01:00
|
|
|
if (E->getBuiltinCallee())
|
|
|
|
return VisitBuiltinCallExpr(E);
|
2022-08-19 13:45:11 +02:00
|
|
|
|
2023-01-11 12:12:52 +01:00
|
|
|
QualType ReturnType = E->getCallReturnType(Ctx.getASTContext());
|
|
|
|
std::optional<PrimType> T = classify(ReturnType);
|
|
|
|
bool HasRVO = !ReturnType->isVoidType() && !T;
|
2024-02-25 14:03:47 +01:00
|
|
|
const FunctionDecl *FuncDecl = E->getDirectCallee();
|
2023-01-11 12:12:52 +01:00
|
|
|
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
if (HasRVO) {
|
|
|
|
if (DiscardResult) {
|
|
|
|
// If we need to discard the return value but the function returns its
|
|
|
|
// value via an RVO pointer, we need to create one such pointer just
|
|
|
|
// for this call.
|
|
|
|
if (std::optional<unsigned> LocalIndex = allocateLocal(E)) {
|
|
|
|
if (!this->emitGetPtrLocal(*LocalIndex, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
} else {
|
2024-02-26 09:29:02 +01:00
|
|
|
// We need the result. Prepare a pointer to return or
|
|
|
|
// dup the current one.
|
|
|
|
if (!Initializing) {
|
|
|
|
if (std::optional<unsigned> LocalIndex = allocateLocal(E)) {
|
|
|
|
if (!this->emitGetPtrLocal(*LocalIndex, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
2023-11-14 16:22:22 +01:00
|
|
|
if (!this->emitDupPtr(E))
|
|
|
|
return false;
|
2023-01-11 12:12:52 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2024-02-25 14:03:47 +01:00
|
|
|
auto Args = llvm::ArrayRef(E->getArgs(), E->getNumArgs());
|
2024-02-19 08:54:36 +01:00
|
|
|
// Calling a static operator will still
|
|
|
|
// pass the instance, but we don't need it.
|
|
|
|
// Discard it here.
|
|
|
|
if (isa<CXXOperatorCallExpr>(E)) {
|
2024-02-25 14:03:47 +01:00
|
|
|
if (const auto *MD = dyn_cast_if_present<CXXMethodDecl>(FuncDecl);
|
2024-02-19 08:54:36 +01:00
|
|
|
MD && MD->isStatic()) {
|
|
|
|
if (!this->discard(E->getArg(0)))
|
|
|
|
return false;
|
2024-02-25 14:03:47 +01:00
|
|
|
Args = Args.drop_front();
|
2024-02-19 08:54:36 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2023-11-14 16:22:22 +01:00
|
|
|
// Add the (optional, implicit) This pointer.
|
|
|
|
if (const auto *MC = dyn_cast<CXXMemberCallExpr>(E)) {
|
|
|
|
if (!this->visit(MC->getImplicitObjectArgument()))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2024-02-25 14:03:47 +01:00
|
|
|
llvm::BitVector NonNullArgs = collectNonNullArgs(FuncDecl, Args);
|
2023-01-11 12:12:52 +01:00
|
|
|
// Put arguments on the stack.
|
2024-02-25 14:03:47 +01:00
|
|
|
unsigned ArgIndex = 0;
|
2024-02-19 08:54:36 +01:00
|
|
|
for (const auto *Arg : Args) {
|
2023-01-11 12:12:52 +01:00
|
|
|
if (!this->visit(Arg))
|
|
|
|
return false;
|
2024-02-25 14:03:47 +01:00
|
|
|
|
|
|
|
// If we know the callee already, check the known parametrs for nullability.
|
|
|
|
if (FuncDecl && NonNullArgs[ArgIndex]) {
|
|
|
|
PrimType ArgT = classify(Arg).value_or(PT_Ptr);
|
|
|
|
if (ArgT == PT_Ptr || ArgT == PT_FnPtr) {
|
|
|
|
if (!this->emitCheckNonNullArg(ArgT, Arg))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
++ArgIndex;
|
2023-01-11 12:12:52 +01:00
|
|
|
}
|
|
|
|
|
2024-02-25 14:03:47 +01:00
|
|
|
if (FuncDecl) {
|
2022-09-18 20:40:27 +02:00
|
|
|
const Function *Func = getFunction(FuncDecl);
|
|
|
|
if (!Func)
|
|
|
|
return false;
|
2023-01-11 12:12:52 +01:00
|
|
|
assert(HasRVO == Func->hasRVO());
|
2022-08-19 13:45:11 +02:00
|
|
|
|
2023-01-26 16:25:52 +01:00
|
|
|
bool HasQualifier = false;
|
|
|
|
if (const auto *ME = dyn_cast<MemberExpr>(E->getCallee()))
|
|
|
|
HasQualifier = ME->hasQualifier();
|
|
|
|
|
|
|
|
bool IsVirtual = false;
|
|
|
|
if (const auto *MD = dyn_cast<CXXMethodDecl>(FuncDecl))
|
|
|
|
IsVirtual = MD->isVirtual();
|
|
|
|
|
2022-11-05 13:08:40 +01:00
|
|
|
// In any case call the function. The return value will end up on the stack
|
|
|
|
// and if the function has RVO, we already have the pointer on the stack to
|
|
|
|
// write the result into.
|
2023-01-26 16:25:52 +01:00
|
|
|
if (IsVirtual && !HasQualifier) {
|
2024-02-14 15:29:47 +01:00
|
|
|
uint32_t VarArgSize = 0;
|
|
|
|
unsigned NumParams = Func->getNumWrittenParams();
|
|
|
|
for (unsigned I = NumParams, N = E->getNumArgs(); I != N; ++I)
|
|
|
|
VarArgSize += align(primSize(classify(E->getArg(I)).value_or(PT_Ptr)));
|
|
|
|
|
|
|
|
if (!this->emitCallVirt(Func, VarArgSize, E))
|
|
|
|
return false;
|
|
|
|
} else if (Func->isVariadic()) {
|
|
|
|
uint32_t VarArgSize = 0;
|
2024-03-01 14:13:38 +01:00
|
|
|
unsigned NumParams =
|
|
|
|
Func->getNumWrittenParams() + isa<CXXOperatorCallExpr>(E);
|
2024-02-14 15:29:47 +01:00
|
|
|
for (unsigned I = NumParams, N = E->getNumArgs(); I != N; ++I)
|
|
|
|
VarArgSize += align(primSize(classify(E->getArg(I)).value_or(PT_Ptr)));
|
|
|
|
if (!this->emitCallVar(Func, VarArgSize, E))
|
2023-01-26 16:25:52 +01:00
|
|
|
return false;
|
|
|
|
} else {
|
2024-02-14 15:29:47 +01:00
|
|
|
if (!this->emitCall(Func, 0, E))
|
2023-01-26 16:25:52 +01:00
|
|
|
return false;
|
|
|
|
}
|
2022-08-19 13:45:11 +02:00
|
|
|
} else {
|
2023-01-11 12:12:52 +01:00
|
|
|
// Indirect call. Visit the callee, which will leave a FunctionPointer on
|
|
|
|
// the stack. Cleanup of the returned value if necessary will be done after
|
|
|
|
// the function call completed.
|
2024-02-14 15:29:47 +01:00
|
|
|
|
|
|
|
// Sum the size of all args from the call expr.
|
|
|
|
uint32_t ArgSize = 0;
|
|
|
|
for (unsigned I = 0, N = E->getNumArgs(); I != N; ++I)
|
|
|
|
ArgSize += align(primSize(classify(E->getArg(I)).value_or(PT_Ptr)));
|
|
|
|
|
2023-01-11 12:12:52 +01:00
|
|
|
if (!this->visit(E->getCallee()))
|
|
|
|
return false;
|
|
|
|
|
2024-02-25 14:03:47 +01:00
|
|
|
if (!this->emitCallPtr(ArgSize, E, E))
|
2023-01-11 12:12:52 +01:00
|
|
|
return false;
|
2022-08-19 13:45:11 +02:00
|
|
|
}
|
|
|
|
|
2023-01-11 12:12:52 +01:00
|
|
|
// Cleanup for discarded return values.
|
|
|
|
if (DiscardResult && !ReturnType->isVoidType() && T)
|
|
|
|
return this->emitPop(*T, E);
|
|
|
|
|
|
|
|
return true;
|
2022-08-19 13:45:11 +02:00
|
|
|
}
|
|
|
|
|
2022-09-16 19:11:58 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXDefaultInitExpr(
|
|
|
|
const CXXDefaultInitExpr *E) {
|
2023-09-09 07:26:52 +02:00
|
|
|
SourceLocScope<Emitter> SLS(this, E);
|
2024-03-18 12:21:16 +01:00
|
|
|
return this->delegate(E->getExpr());
|
2022-09-16 19:11:58 +02:00
|
|
|
}
|
|
|
|
|
2022-08-19 13:45:11 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXDefaultArgExpr(
|
|
|
|
const CXXDefaultArgExpr *E) {
|
2023-07-18 17:11:30 +02:00
|
|
|
SourceLocScope<Emitter> SLS(this, E);
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
|
2023-07-18 17:11:30 +02:00
|
|
|
const Expr *SubExpr = E->getExpr();
|
[clang][Interp] Rework initializers
Before this patch, we had visitRecordInitializer() and
visitArrayInitializer(), which were different from the regular visit()
in that they expected a pointer on the top of the stack, which they
initialized. For example, visitArrayInitializer handled InitListExprs by
looping over the members and initializing the elements of that pointer.
However, this had a few corner cases and problems. For example, in
visitLambdaExpr() (a lambda is always of record type), it was not clear
whether we should always create a new local variable to save the lambda
to, or not. This is why https://reviews.llvm.org/D153616 changed
things around.
This patch changes the visiting functions to:
- visit(): Always leaves a new value on the stack. If the expression
can be mapped to a primitive type, it's just visited and the value is
put on the stack. If it's of composite type, this function will
create a local variable for the expression value and call
visitInitializer(). The pointer to the local variable will stay on
the stack.
- visitInitializer(): Visits the given expression, assuming there is a
pointer on top of the stack that will be initialized by it.
- discard(): Visit the expression for side-effects, but don't leave a
value on the stack.
It also adds an additional Initializing flag to differentiate between the initializing and non-initializing case.
Differential Revision: https://reviews.llvm.org/D156027
2023-07-19 15:59:58 +02:00
|
|
|
if (std::optional<PrimType> T = classify(E->getExpr()))
|
|
|
|
return this->visit(SubExpr);
|
|
|
|
|
|
|
|
assert(Initializing);
|
|
|
|
return this->visitInitializer(SubExpr);
|
2022-08-19 13:45:11 +02:00
|
|
|
}
|
|
|
|
|
2022-08-05 13:57:39 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXBoolLiteralExpr(
|
|
|
|
const CXXBoolLiteralExpr *E) {
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return this->emitConstBool(E->getValue(), E);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXNullPtrLiteralExpr(
|
|
|
|
const CXXNullPtrLiteralExpr *E) {
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
2024-04-10 12:53:54 +02:00
|
|
|
return this->emitNullPtr(nullptr, E);
|
2022-08-05 13:57:39 +02:00
|
|
|
}
|
|
|
|
|
2023-07-18 09:22:48 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitGNUNullExpr(const GNUNullExpr *E) {
|
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
assert(E->getType()->isIntegerType());
|
|
|
|
|
|
|
|
PrimType T = classifyPrim(E->getType());
|
|
|
|
return this->emitZero(T, E);
|
|
|
|
}
|
|
|
|
|
2022-09-18 20:40:27 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitCXXThisExpr(const CXXThisExpr *E) {
|
2022-10-15 09:56:26 +02:00
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
2023-06-30 23:19:31 +02:00
|
|
|
|
2024-03-01 17:47:38 +01:00
|
|
|
if (this->LambdaThisCapture.Offset > 0) {
|
|
|
|
if (this->LambdaThisCapture.IsPtr)
|
|
|
|
return this->emitGetThisFieldPtr(this->LambdaThisCapture.Offset, E);
|
|
|
|
return this->emitGetPtrThisField(this->LambdaThisCapture.Offset, E);
|
|
|
|
}
|
2023-06-30 23:19:31 +02:00
|
|
|
|
2022-09-18 20:40:27 +02:00
|
|
|
return this->emitThis(E);
|
|
|
|
}
|
|
|
|
|
2022-08-09 08:08:48 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitUnaryOperator(const UnaryOperator *E) {
|
2022-08-18 10:15:20 +02:00
|
|
|
const Expr *SubExpr = E->getSubExpr();
|
2024-03-11 15:42:02 +01:00
|
|
|
if (SubExpr->getType()->isAnyComplexType())
|
|
|
|
return this->VisitComplexUnaryOperator(E);
|
2022-12-05 17:30:24 +01:00
|
|
|
std::optional<PrimType> T = classify(SubExpr->getType());
|
2022-08-09 08:08:48 +02:00
|
|
|
|
|
|
|
switch (E->getOpcode()) {
|
2022-10-21 09:10:29 +02:00
|
|
|
case UO_PostInc: { // x++
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
|
2024-02-21 16:38:01 +01:00
|
|
|
if (T == PT_Ptr || T == PT_FnPtr) {
|
2022-11-02 09:09:23 +01:00
|
|
|
if (!this->emitIncPtr(E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return DiscardResult ? this->emitPopPtr(E) : true;
|
|
|
|
}
|
|
|
|
|
2023-04-21 10:41:40 +02:00
|
|
|
if (T == PT_Float) {
|
|
|
|
return DiscardResult ? this->emitIncfPop(getRoundingMode(E), E)
|
|
|
|
: this->emitIncf(getRoundingMode(E), E);
|
|
|
|
}
|
|
|
|
|
2022-10-21 09:10:29 +02:00
|
|
|
return DiscardResult ? this->emitIncPop(*T, E) : this->emitInc(*T, E);
|
|
|
|
}
|
|
|
|
case UO_PostDec: { // x--
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
|
2024-02-21 16:38:01 +01:00
|
|
|
if (T == PT_Ptr || T == PT_FnPtr) {
|
2022-11-02 09:09:23 +01:00
|
|
|
if (!this->emitDecPtr(E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return DiscardResult ? this->emitPopPtr(E) : true;
|
|
|
|
}
|
|
|
|
|
2023-04-21 10:41:40 +02:00
|
|
|
if (T == PT_Float) {
|
|
|
|
return DiscardResult ? this->emitDecfPop(getRoundingMode(E), E)
|
|
|
|
: this->emitDecf(getRoundingMode(E), E);
|
|
|
|
}
|
|
|
|
|
2022-10-21 09:10:29 +02:00
|
|
|
return DiscardResult ? this->emitDecPop(*T, E) : this->emitDec(*T, E);
|
|
|
|
}
|
|
|
|
case UO_PreInc: { // ++x
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
|
2024-02-21 16:38:01 +01:00
|
|
|
if (T == PT_Ptr || T == PT_FnPtr) {
|
2023-09-03 07:04:14 +02:00
|
|
|
if (!this->emitLoadPtr(E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitConstUint8(1, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitAddOffsetUint8(E))
|
|
|
|
return false;
|
2022-11-02 09:09:23 +01:00
|
|
|
return DiscardResult ? this->emitStorePopPtr(E) : this->emitStorePtr(E);
|
|
|
|
}
|
|
|
|
|
2022-10-21 09:10:29 +02:00
|
|
|
// Post-inc and pre-inc are the same if the value is to be discarded.
|
2023-04-21 10:41:40 +02:00
|
|
|
if (DiscardResult) {
|
|
|
|
if (T == PT_Float)
|
|
|
|
return this->emitIncfPop(getRoundingMode(E), E);
|
2022-10-21 09:10:29 +02:00
|
|
|
return this->emitIncPop(*T, E);
|
2023-04-21 10:41:40 +02:00
|
|
|
}
|
2022-08-09 08:08:48 +02:00
|
|
|
|
2023-04-21 10:41:40 +02:00
|
|
|
if (T == PT_Float) {
|
|
|
|
const auto &TargetSemantics = Ctx.getFloatSemantics(E->getType());
|
2023-09-03 07:04:14 +02:00
|
|
|
if (!this->emitLoadFloat(E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitConstFloat(llvm::APFloat(TargetSemantics, 1), E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitAddf(getRoundingMode(E), E))
|
|
|
|
return false;
|
2023-04-21 10:41:40 +02:00
|
|
|
return this->emitStoreFloat(E);
|
|
|
|
}
|
2023-09-03 07:04:14 +02:00
|
|
|
if (!this->emitLoad(*T, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitConst(1, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitAdd(*T, E))
|
|
|
|
return false;
|
2022-10-21 09:10:29 +02:00
|
|
|
return this->emitStore(*T, E);
|
|
|
|
}
|
|
|
|
case UO_PreDec: { // --x
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
|
2024-02-21 16:38:01 +01:00
|
|
|
if (T == PT_Ptr || T == PT_FnPtr) {
|
2023-09-03 07:04:14 +02:00
|
|
|
if (!this->emitLoadPtr(E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitConstUint8(1, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitSubOffsetUint8(E))
|
|
|
|
return false;
|
2022-11-02 09:09:23 +01:00
|
|
|
return DiscardResult ? this->emitStorePopPtr(E) : this->emitStorePtr(E);
|
|
|
|
}
|
|
|
|
|
2022-10-21 09:10:29 +02:00
|
|
|
// Post-dec and pre-dec are the same if the value is to be discarded.
|
2023-04-21 10:41:40 +02:00
|
|
|
if (DiscardResult) {
|
|
|
|
if (T == PT_Float)
|
|
|
|
return this->emitDecfPop(getRoundingMode(E), E);
|
2022-10-21 09:10:29 +02:00
|
|
|
return this->emitDecPop(*T, E);
|
2023-04-21 10:41:40 +02:00
|
|
|
}
|
2022-10-21 09:10:29 +02:00
|
|
|
|
2023-04-21 10:41:40 +02:00
|
|
|
if (T == PT_Float) {
|
|
|
|
const auto &TargetSemantics = Ctx.getFloatSemantics(E->getType());
|
2023-09-03 07:04:14 +02:00
|
|
|
if (!this->emitLoadFloat(E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitConstFloat(llvm::APFloat(TargetSemantics, 1), E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitSubf(getRoundingMode(E), E))
|
|
|
|
return false;
|
2023-04-21 10:41:40 +02:00
|
|
|
return this->emitStoreFloat(E);
|
|
|
|
}
|
2023-09-03 07:04:14 +02:00
|
|
|
if (!this->emitLoad(*T, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitConst(1, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitSub(*T, E))
|
|
|
|
return false;
|
2022-10-21 09:10:29 +02:00
|
|
|
return this->emitStore(*T, E);
|
|
|
|
}
|
2022-08-09 08:08:48 +02:00
|
|
|
case UO_LNot: // !x
|
2023-08-05 19:59:09 +02:00
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
|
|
|
|
|
|
|
if (!this->visitBool(SubExpr))
|
2022-08-18 10:15:20 +02:00
|
|
|
return false;
|
2023-08-05 19:59:09 +02:00
|
|
|
|
|
|
|
if (!this->emitInvBool(E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (PrimType ET = classifyPrim(E->getType()); ET != PT_Bool)
|
|
|
|
return this->emitCast(PT_Bool, ET, E);
|
|
|
|
return true;
|
2022-08-09 08:08:48 +02:00
|
|
|
case UO_Minus: // -x
|
2022-10-21 08:46:33 +02:00
|
|
|
if (!this->visit(SubExpr))
|
2022-08-18 10:15:20 +02:00
|
|
|
return false;
|
2022-10-21 09:10:29 +02:00
|
|
|
return DiscardResult ? this->emitPop(*T, E) : this->emitNeg(*T, E);
|
2022-08-09 08:08:48 +02:00
|
|
|
case UO_Plus: // +x
|
2022-10-21 09:10:29 +02:00
|
|
|
if (!this->visit(SubExpr)) // noop
|
|
|
|
return false;
|
|
|
|
return DiscardResult ? this->emitPop(*T, E) : true;
|
2022-08-09 08:08:48 +02:00
|
|
|
case UO_AddrOf: // &x
|
2022-08-18 10:15:20 +02:00
|
|
|
// We should already have a pointer when we get here.
|
2023-10-27 09:32:13 +02:00
|
|
|
return this->delegate(SubExpr);
|
2022-08-09 08:08:48 +02:00
|
|
|
case UO_Deref: // *x
|
2024-02-21 08:12:31 +01:00
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
|
|
|
return this->visit(SubExpr);
|
2022-08-09 08:08:48 +02:00
|
|
|
case UO_Not: // ~x
|
2022-10-21 08:46:33 +02:00
|
|
|
if (!this->visit(SubExpr))
|
2022-09-28 14:30:44 +02:00
|
|
|
return false;
|
2022-10-21 09:10:29 +02:00
|
|
|
return DiscardResult ? this->emitPop(*T, E) : this->emitComp(*T, E);
|
2024-01-18 13:55:04 +01:00
|
|
|
case UO_Real: // __real x
|
2024-03-11 15:42:02 +01:00
|
|
|
assert(T);
|
|
|
|
return this->delegate(SubExpr);
|
2023-03-20 09:35:47 +01:00
|
|
|
case UO_Imag: { // __imag x
|
2024-03-11 15:42:02 +01:00
|
|
|
assert(T);
|
|
|
|
if (!this->discard(SubExpr))
|
|
|
|
return false;
|
|
|
|
return this->visitZeroInitializer(*T, SubExpr->getType(), SubExpr);
|
|
|
|
}
|
|
|
|
case UO_Extension:
|
|
|
|
return this->delegate(SubExpr);
|
|
|
|
case UO_Coawait:
|
|
|
|
assert(false && "Unhandled opcode");
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitComplexUnaryOperator(
|
|
|
|
const UnaryOperator *E) {
|
|
|
|
const Expr *SubExpr = E->getSubExpr();
|
|
|
|
assert(SubExpr->getType()->isAnyComplexType());
|
|
|
|
|
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
|
|
|
|
|
|
|
std::optional<PrimType> ResT = classify(E);
|
2024-03-12 08:50:51 +01:00
|
|
|
auto prepareResult = [=]() -> bool {
|
|
|
|
if (!ResT && !Initializing) {
|
|
|
|
std::optional<unsigned> LocalIndex =
|
|
|
|
allocateLocal(SubExpr, /*IsExtended=*/false);
|
|
|
|
if (!LocalIndex)
|
|
|
|
return false;
|
|
|
|
return this->emitGetPtrLocal(*LocalIndex, E);
|
|
|
|
}
|
2024-03-11 15:42:02 +01:00
|
|
|
|
2024-03-12 08:50:51 +01:00
|
|
|
return true;
|
|
|
|
};
|
2024-03-11 15:42:02 +01:00
|
|
|
|
|
|
|
// The offset of the temporary, if we created one.
|
|
|
|
unsigned SubExprOffset = ~0u;
|
|
|
|
auto createTemp = [=, &SubExprOffset]() -> bool {
|
|
|
|
SubExprOffset = this->allocateLocalPrimitive(SubExpr, PT_Ptr, true, false);
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
return this->emitSetLocal(PT_Ptr, SubExprOffset, E);
|
|
|
|
};
|
|
|
|
|
|
|
|
PrimType ElemT = classifyComplexElementType(SubExpr->getType());
|
|
|
|
auto getElem = [=](unsigned Offset, unsigned Index) -> bool {
|
|
|
|
if (!this->emitGetLocal(PT_Ptr, Offset, E))
|
|
|
|
return false;
|
|
|
|
return this->emitArrayElemPop(ElemT, Index, E);
|
|
|
|
};
|
|
|
|
|
|
|
|
switch (E->getOpcode()) {
|
|
|
|
case UO_Minus:
|
2024-03-12 08:50:51 +01:00
|
|
|
if (!prepareResult())
|
|
|
|
return false;
|
2024-03-11 15:42:02 +01:00
|
|
|
if (!createTemp())
|
|
|
|
return false;
|
|
|
|
for (unsigned I = 0; I != 2; ++I) {
|
|
|
|
if (!getElem(SubExprOffset, I))
|
|
|
|
return false;
|
|
|
|
if (!this->emitNeg(ElemT, E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitInitElem(ElemT, I, E))
|
2024-01-15 16:08:22 +01:00
|
|
|
return false;
|
|
|
|
}
|
2024-03-11 15:42:02 +01:00
|
|
|
break;
|
|
|
|
|
2024-03-12 08:50:51 +01:00
|
|
|
case UO_Plus: // +x
|
|
|
|
case UO_AddrOf: // &x
|
|
|
|
case UO_Deref: // *x
|
2024-03-11 15:42:02 +01:00
|
|
|
return this->delegate(SubExpr);
|
2024-02-01 07:13:10 +01:00
|
|
|
|
2024-03-12 07:47:48 +01:00
|
|
|
case UO_LNot:
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
|
|
|
if (!this->emitComplexBoolCast(SubExpr))
|
|
|
|
return false;
|
|
|
|
if (!this->emitInvBool(E))
|
|
|
|
return false;
|
|
|
|
if (PrimType ET = classifyPrim(E->getType()); ET != PT_Bool)
|
|
|
|
return this->emitCast(PT_Bool, ET, E);
|
|
|
|
return true;
|
|
|
|
|
2024-03-11 15:42:02 +01:00
|
|
|
case UO_Real:
|
|
|
|
return this->emitComplexReal(SubExpr);
|
|
|
|
|
|
|
|
case UO_Imag:
|
2023-03-20 09:35:47 +01:00
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
2024-03-07 17:29:42 +01:00
|
|
|
|
|
|
|
if (SubExpr->isLValue()) {
|
|
|
|
if (!this->emitConstUint8(1, E))
|
|
|
|
return false;
|
|
|
|
return this->emitArrayElemPtrPopUint8(E);
|
|
|
|
}
|
2023-05-16 13:39:48 +02:00
|
|
|
|
|
|
|
// Since our _Complex implementation does not map to a primitive type,
|
|
|
|
// we sometimes have to do the lvalue-to-rvalue conversion here manually.
|
2024-03-07 17:29:42 +01:00
|
|
|
return this->emitArrayElemPop(classifyPrim(E->getType()), 1, E);
|
2024-03-11 15:42:02 +01:00
|
|
|
|
|
|
|
default:
|
|
|
|
return this->emitInvalid(E);
|
2022-08-09 08:08:48 +02:00
|
|
|
}
|
|
|
|
|
2024-03-11 15:42:02 +01:00
|
|
|
return true;
|
2022-08-09 08:08:48 +02:00
|
|
|
}
|
|
|
|
|
2022-08-18 10:15:20 +02:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::VisitDeclRefExpr(const DeclRefExpr *E) {
|
2023-04-08 07:27:55 +02:00
|
|
|
if (DiscardResult)
|
|
|
|
return true;
|
|
|
|
|
2023-02-05 08:39:40 +01:00
|
|
|
const auto *D = E->getDecl();
|
|
|
|
|
|
|
|
if (const auto *ECD = dyn_cast<EnumConstantDecl>(D)) {
|
|
|
|
return this->emitConst(ECD->getInitVal(), E);
|
|
|
|
} else if (const auto *BD = dyn_cast<BindingDecl>(D)) {
|
|
|
|
return this->visit(BD->getBinding());
|
|
|
|
} else if (const auto *FuncDecl = dyn_cast<FunctionDecl>(D)) {
|
|
|
|
const Function *F = getFunction(FuncDecl);
|
|
|
|
return F && this->emitGetFnPtr(F, E);
|
2024-02-16 15:20:52 +01:00
|
|
|
} else if (isa<TemplateParamObjectDecl>(D)) {
|
|
|
|
if (std::optional<unsigned> Index = P.getOrCreateGlobal(D))
|
|
|
|
return this->emitGetPtrGlobal(*Index, E);
|
|
|
|
return false;
|
2023-02-05 08:39:40 +01:00
|
|
|
}
|
|
|
|
|
2022-10-15 10:11:24 +02:00
|
|
|
// References are implemented via pointers, so when we see a DeclRefExpr
|
|
|
|
// pointing to a reference, we need to get its value directly (i.e. the
|
|
|
|
// pointer to the actual value) instead of a pointer to the pointer to the
|
|
|
|
// value.
|
2023-02-05 08:39:40 +01:00
|
|
|
bool IsReference = D->getType()->isReferenceType();
|
2022-08-18 10:15:20 +02:00
|
|
|
|
2023-02-05 08:39:40 +01:00
|
|
|
// Check for local/global variables and parameters.
|
|
|
|
if (auto It = Locals.find(D); It != Locals.end()) {
|
2022-08-18 10:15:20 +02:00
|
|
|
const unsigned Offset = It->second.Offset;
|
2022-10-15 10:11:24 +02:00
|
|
|
if (IsReference)
|
|
|
|
return this->emitGetLocal(PT_Ptr, Offset, E);
|
|
|
|
return this->emitGetPtrLocal(Offset, E);
|
2023-02-05 08:39:40 +01:00
|
|
|
} else if (auto GlobalIndex = P.getGlobal(D)) {
|
2022-10-15 10:11:24 +02:00
|
|
|
if (IsReference)
|
2023-03-23 15:37:09 +01:00
|
|
|
return this->emitGetGlobalPtr(*GlobalIndex, E);
|
2022-08-31 09:24:03 +02:00
|
|
|
|
2022-10-15 10:11:24 +02:00
|
|
|
return this->emitGetPtrGlobal(*GlobalIndex, E);
|
2023-02-05 08:39:40 +01:00
|
|
|
} else if (const auto *PVD = dyn_cast<ParmVarDecl>(D)) {
|
2022-08-31 09:24:03 +02:00
|
|
|
if (auto It = this->Params.find(PVD); It != this->Params.end()) {
|
2023-06-24 12:32:05 +02:00
|
|
|
if (IsReference || !It->second.IsPtr)
|
|
|
|
return this->emitGetParamPtr(It->second.Offset, E);
|
|
|
|
|
|
|
|
return this->emitGetPtrParam(It->second.Offset, E);
|
2022-08-31 09:24:03 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2023-03-14 11:08:16 +01:00
|
|
|
// Handle lambda captures.
|
|
|
|
if (auto It = this->LambdaCaptures.find(D);
|
|
|
|
It != this->LambdaCaptures.end()) {
|
2023-06-24 12:32:05 +02:00
|
|
|
auto [Offset, IsPtr] = It->second;
|
2023-03-14 11:08:16 +01:00
|
|
|
|
2023-06-24 12:32:05 +02:00
|
|
|
if (IsPtr)
|
2023-03-14 11:08:16 +01:00
|
|
|
return this->emitGetThisFieldPtr(Offset, E);
|
|
|
|
return this->emitGetPtrThisField(Offset, E);
|
|
|
|
}
|
|
|
|
|
2024-02-15 16:26:14 +01:00
|
|
|
// Try to lazily visit (or emit dummy pointers for) declarations
|
|
|
|
// we haven't seen yet.
|
|
|
|
if (Ctx.getLangOpts().CPlusPlus) {
|
2024-02-16 12:47:31 +01:00
|
|
|
if (const auto *VD = dyn_cast<VarDecl>(D)) {
|
|
|
|
// Visit local const variables like normal.
|
2024-03-17 14:48:16 +01:00
|
|
|
if ((VD->isLocalVarDecl() || VD->isStaticDataMember()) &&
|
|
|
|
VD->getType().isConstQualified()) {
|
2024-02-16 12:47:31 +01:00
|
|
|
if (!this->visitVarDecl(VD))
|
|
|
|
return false;
|
|
|
|
// Retry.
|
|
|
|
return this->VisitDeclRefExpr(E);
|
|
|
|
}
|
2024-02-15 16:26:14 +01:00
|
|
|
}
|
|
|
|
} else {
|
2023-08-01 15:58:48 +02:00
|
|
|
if (const auto *VD = dyn_cast<VarDecl>(D);
|
2024-02-15 15:13:12 +01:00
|
|
|
VD && VD->getAnyInitializer() && VD->getType().isConstQualified()) {
|
2023-08-01 15:58:48 +02:00
|
|
|
if (!this->visitVarDecl(VD))
|
|
|
|
return false;
|
|
|
|
// Retry.
|
|
|
|
return this->VisitDeclRefExpr(E);
|
|
|
|
}
|
|
|
|
}
|
2023-07-28 08:37:41 +02:00
|
|
|
|
2024-02-28 18:09:39 +01:00
|
|
|
if (std::optional<unsigned> I = P.getOrCreateDummy(D))
|
|
|
|
return this->emitGetPtrGlobal(*I, E);
|
|
|
|
|
2023-07-28 08:37:41 +02:00
|
|
|
return this->emitInvalidDeclRef(E, E);
|
2022-08-18 10:15:20 +02:00
|
|
|
}
|
|
|
|
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
template <class Emitter>
|
|
|
|
void ByteCodeExprGen<Emitter>::emitCleanup() {
|
|
|
|
for (VariableScope<Emitter> *C = VarScope; C; C = C->getParent())
|
|
|
|
C->emitDestruction();
|
|
|
|
}
|
|
|
|
|
2023-02-07 10:56:53 +01:00
|
|
|
template <class Emitter>
|
2023-04-24 16:45:16 +02:00
|
|
|
unsigned
|
|
|
|
ByteCodeExprGen<Emitter>::collectBaseOffset(const RecordType *BaseType,
|
|
|
|
const RecordType *DerivedType) {
|
2024-03-19 08:28:56 +01:00
|
|
|
assert(BaseType);
|
|
|
|
assert(DerivedType);
|
2023-02-07 10:56:53 +01:00
|
|
|
const auto *FinalDecl = cast<CXXRecordDecl>(BaseType->getDecl());
|
|
|
|
const RecordDecl *CurDecl = DerivedType->getDecl();
|
|
|
|
const Record *CurRecord = getRecord(CurDecl);
|
|
|
|
assert(CurDecl && FinalDecl);
|
2023-04-24 16:45:16 +02:00
|
|
|
|
|
|
|
unsigned OffsetSum = 0;
|
2023-02-07 10:56:53 +01:00
|
|
|
for (;;) {
|
|
|
|
assert(CurRecord->getNumBases() > 0);
|
|
|
|
// One level up
|
|
|
|
for (const Record::Base &B : CurRecord->bases()) {
|
|
|
|
const auto *BaseDecl = cast<CXXRecordDecl>(B.Decl);
|
|
|
|
|
|
|
|
if (BaseDecl == FinalDecl || BaseDecl->isDerivedFrom(FinalDecl)) {
|
2023-04-24 16:45:16 +02:00
|
|
|
OffsetSum += B.Offset;
|
2023-02-07 10:56:53 +01:00
|
|
|
CurRecord = B.R;
|
|
|
|
CurDecl = BaseDecl;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (CurDecl == FinalDecl)
|
2023-04-24 16:45:16 +02:00
|
|
|
break;
|
2023-02-07 10:56:53 +01:00
|
|
|
}
|
|
|
|
|
2023-04-24 16:45:16 +02:00
|
|
|
assert(OffsetSum > 0);
|
|
|
|
return OffsetSum;
|
2023-02-07 10:56:53 +01:00
|
|
|
}
|
|
|
|
|
2023-08-10 12:01:08 +02:00
|
|
|
/// Emit casts from a PrimType to another PrimType.
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::emitPrimCast(PrimType FromT, PrimType ToT,
|
|
|
|
QualType ToQT, const Expr *E) {
|
|
|
|
|
|
|
|
if (FromT == PT_Float) {
|
|
|
|
// Floating to floating.
|
|
|
|
if (ToT == PT_Float) {
|
|
|
|
const llvm::fltSemantics *ToSem = &Ctx.getFloatSemantics(ToQT);
|
|
|
|
return this->emitCastFP(ToSem, getRoundingMode(E), E);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Float to integral.
|
|
|
|
if (isIntegralType(ToT) || ToT == PT_Bool)
|
|
|
|
return this->emitCastFloatingIntegral(ToT, E);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (isIntegralType(FromT) || FromT == PT_Bool) {
|
|
|
|
// Integral to integral.
|
|
|
|
if (isIntegralType(ToT) || ToT == PT_Bool)
|
|
|
|
return FromT != ToT ? this->emitCast(FromT, ToT, E) : true;
|
|
|
|
|
|
|
|
if (ToT == PT_Float) {
|
|
|
|
// Integral to floating.
|
|
|
|
const llvm::fltSemantics *ToSem = &Ctx.getFloatSemantics(ToQT);
|
|
|
|
return this->emitCastIntegralFloating(FromT, ToSem, getRoundingMode(E),
|
|
|
|
E);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2024-01-18 13:55:04 +01:00
|
|
|
/// Emits __real(SubExpr)
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::emitComplexReal(const Expr *SubExpr) {
|
|
|
|
assert(SubExpr->getType()->isAnyComplexType());
|
|
|
|
|
|
|
|
if (DiscardResult)
|
|
|
|
return this->discard(SubExpr);
|
|
|
|
|
|
|
|
if (!this->visit(SubExpr))
|
|
|
|
return false;
|
2024-03-07 17:29:42 +01:00
|
|
|
if (SubExpr->isLValue()) {
|
|
|
|
if (!this->emitConstUint8(0, SubExpr))
|
|
|
|
return false;
|
|
|
|
return this->emitArrayElemPtrPopUint8(SubExpr);
|
|
|
|
}
|
2024-01-18 13:55:04 +01:00
|
|
|
|
2024-03-07 17:29:42 +01:00
|
|
|
// Rvalue, load the actual element.
|
|
|
|
return this->emitArrayElemPop(classifyComplexElementType(SubExpr->getType()),
|
|
|
|
0, SubExpr);
|
2024-01-18 13:55:04 +01:00
|
|
|
}
|
|
|
|
|
2024-02-20 10:27:41 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::emitComplexBoolCast(const Expr *E) {
|
|
|
|
assert(!DiscardResult);
|
|
|
|
PrimType ElemT = classifyComplexElementType(E->getType());
|
|
|
|
// We emit the expression (__real(E) != 0 || __imag(E) != 0)
|
|
|
|
// for us, that means (bool)E[0] || (bool)E[1]
|
2024-03-07 17:29:42 +01:00
|
|
|
if (!this->emitArrayElem(ElemT, 0, E))
|
2024-02-20 10:27:41 +01:00
|
|
|
return false;
|
|
|
|
if (ElemT == PT_Float) {
|
|
|
|
if (!this->emitCastFloatingIntegral(PT_Bool, E))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (!this->emitCast(ElemT, PT_Bool, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// We now have the bool value of E[0] on the stack.
|
|
|
|
LabelTy LabelTrue = this->getLabel();
|
|
|
|
if (!this->jumpTrue(LabelTrue))
|
|
|
|
return false;
|
|
|
|
|
2024-03-07 17:29:42 +01:00
|
|
|
if (!this->emitArrayElemPop(ElemT, 1, E))
|
2024-02-20 10:27:41 +01:00
|
|
|
return false;
|
|
|
|
if (ElemT == PT_Float) {
|
|
|
|
if (!this->emitCastFloatingIntegral(PT_Bool, E))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (!this->emitCast(ElemT, PT_Bool, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
// Leave the boolean value of E[1] on the stack.
|
|
|
|
LabelTy EndLabel = this->getLabel();
|
|
|
|
this->jump(EndLabel);
|
|
|
|
|
|
|
|
this->emitLabel(LabelTrue);
|
|
|
|
if (!this->emitPopPtr(E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitConstBool(true, E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
this->fallthrough(EndLabel);
|
|
|
|
this->emitLabel(EndLabel);
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2024-03-07 15:31:40 +01:00
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::emitComplexComparison(const Expr *LHS,
|
|
|
|
const Expr *RHS,
|
|
|
|
const BinaryOperator *E) {
|
|
|
|
assert(E->isComparisonOp());
|
|
|
|
assert(!Initializing);
|
|
|
|
assert(!DiscardResult);
|
|
|
|
|
|
|
|
PrimType ElemT;
|
|
|
|
bool LHSIsComplex;
|
|
|
|
unsigned LHSOffset;
|
|
|
|
if (LHS->getType()->isAnyComplexType()) {
|
|
|
|
LHSIsComplex = true;
|
|
|
|
ElemT = classifyComplexElementType(LHS->getType());
|
|
|
|
LHSOffset = allocateLocalPrimitive(LHS, PT_Ptr, /*IsConst=*/true,
|
|
|
|
/*IsExtended=*/false);
|
|
|
|
if (!this->visit(LHS))
|
|
|
|
return false;
|
|
|
|
if (!this->emitSetLocal(PT_Ptr, LHSOffset, E))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
LHSIsComplex = false;
|
|
|
|
PrimType LHST = classifyPrim(LHS->getType());
|
|
|
|
LHSOffset = this->allocateLocalPrimitive(LHS, LHST, true, false);
|
|
|
|
if (!this->visit(LHS))
|
|
|
|
return false;
|
|
|
|
if (!this->emitSetLocal(LHST, LHSOffset, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool RHSIsComplex;
|
|
|
|
unsigned RHSOffset;
|
|
|
|
if (RHS->getType()->isAnyComplexType()) {
|
|
|
|
RHSIsComplex = true;
|
|
|
|
ElemT = classifyComplexElementType(RHS->getType());
|
|
|
|
RHSOffset = allocateLocalPrimitive(RHS, PT_Ptr, /*IsConst=*/true,
|
|
|
|
/*IsExtended=*/false);
|
|
|
|
if (!this->visit(RHS))
|
|
|
|
return false;
|
|
|
|
if (!this->emitSetLocal(PT_Ptr, RHSOffset, E))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
RHSIsComplex = false;
|
|
|
|
PrimType RHST = classifyPrim(RHS->getType());
|
|
|
|
RHSOffset = this->allocateLocalPrimitive(RHS, RHST, true, false);
|
|
|
|
if (!this->visit(RHS))
|
|
|
|
return false;
|
|
|
|
if (!this->emitSetLocal(RHST, RHSOffset, E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
auto getElem = [&](unsigned LocalOffset, unsigned Index,
|
|
|
|
bool IsComplex) -> bool {
|
|
|
|
if (IsComplex) {
|
|
|
|
if (!this->emitGetLocal(PT_Ptr, LocalOffset, E))
|
|
|
|
return false;
|
|
|
|
return this->emitArrayElemPop(ElemT, Index, E);
|
|
|
|
}
|
|
|
|
return this->emitGetLocal(ElemT, LocalOffset, E);
|
|
|
|
};
|
|
|
|
|
|
|
|
for (unsigned I = 0; I != 2; ++I) {
|
|
|
|
// Get both values.
|
|
|
|
if (!getElem(LHSOffset, I, LHSIsComplex))
|
|
|
|
return false;
|
|
|
|
if (!getElem(RHSOffset, I, RHSIsComplex))
|
|
|
|
return false;
|
|
|
|
// And compare them.
|
|
|
|
if (!this->emitEQ(ElemT, E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!this->emitCastBoolUint8(E))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// We now have two bool values on the stack. Compare those.
|
|
|
|
if (!this->emitAddUint8(E))
|
|
|
|
return false;
|
|
|
|
if (!this->emitConstUint8(2, E))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (E->getOpcode() == BO_EQ) {
|
|
|
|
if (!this->emitEQUint8(E))
|
|
|
|
return false;
|
|
|
|
} else if (E->getOpcode() == BO_NE) {
|
|
|
|
if (!this->emitNEUint8(E))
|
|
|
|
return false;
|
|
|
|
} else
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// In C, this returns an int.
|
|
|
|
if (PrimType ResT = classifyPrim(E->getType()); ResT != PT_Bool)
|
|
|
|
return this->emitCast(PT_Bool, ResT, E);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2024-02-20 10:27:41 +01:00
|
|
|
/// When calling this, we have a pointer of the local-to-destroy
|
|
|
|
/// on the stack.
|
|
|
|
/// Emit destruction of record types (or arrays of record types).
|
2023-03-06 19:05:54 +01:00
|
|
|
template <class Emitter>
|
2024-02-18 17:35:26 +01:00
|
|
|
bool ByteCodeExprGen<Emitter>::emitRecordDestruction(const Record *R) {
|
2023-03-06 19:05:54 +01:00
|
|
|
assert(R);
|
|
|
|
// First, destroy all fields.
|
|
|
|
for (const Record::Field &Field : llvm::reverse(R->fields())) {
|
|
|
|
const Descriptor *D = Field.Desc;
|
|
|
|
if (!D->isPrimitive() && !D->isPrimitiveArray()) {
|
|
|
|
if (!this->emitDupPtr(SourceInfo{}))
|
|
|
|
return false;
|
|
|
|
if (!this->emitGetPtrField(Field.Offset, SourceInfo{}))
|
|
|
|
return false;
|
2024-02-18 17:35:26 +01:00
|
|
|
if (!this->emitDestruction(D))
|
|
|
|
return false;
|
|
|
|
if (!this->emitPopPtr(SourceInfo{}))
|
2023-03-06 19:05:54 +01:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// FIXME: Unions need to be handled differently here. We don't want to
|
|
|
|
// call the destructor of its members.
|
|
|
|
|
|
|
|
// Now emit the destructor and recurse into base classes.
|
|
|
|
if (const CXXDestructorDecl *Dtor = R->getDestructor();
|
|
|
|
Dtor && !Dtor->isTrivial()) {
|
2024-02-28 07:38:22 +01:00
|
|
|
const Function *DtorFunc = getFunction(Dtor);
|
|
|
|
if (!DtorFunc)
|
|
|
|
return false;
|
|
|
|
assert(DtorFunc->hasThisPointer());
|
|
|
|
assert(DtorFunc->getNumParams() == 1);
|
|
|
|
if (!this->emitDupPtr(SourceInfo{}))
|
|
|
|
return false;
|
|
|
|
if (!this->emitCall(DtorFunc, 0, SourceInfo{}))
|
|
|
|
return false;
|
2023-03-06 19:05:54 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
for (const Record::Base &Base : llvm::reverse(R->bases())) {
|
|
|
|
if (!this->emitGetPtrBase(Base.Offset, SourceInfo{}))
|
|
|
|
return false;
|
2024-02-18 17:35:26 +01:00
|
|
|
if (!this->emitRecordDestruction(Base.R))
|
|
|
|
return false;
|
|
|
|
if (!this->emitPopPtr(SourceInfo{}))
|
2023-03-06 19:05:54 +01:00
|
|
|
return false;
|
|
|
|
}
|
2024-02-18 17:35:26 +01:00
|
|
|
|
2023-03-06 19:05:54 +01:00
|
|
|
// FIXME: Virtual bases.
|
2024-02-18 17:35:26 +01:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
/// When calling this, we have a pointer of the local-to-destroy
|
|
|
|
/// on the stack.
|
|
|
|
/// Emit destruction of record types (or arrays of record types).
|
|
|
|
template <class Emitter>
|
|
|
|
bool ByteCodeExprGen<Emitter>::emitDestruction(const Descriptor *Desc) {
|
|
|
|
assert(Desc);
|
|
|
|
assert(!Desc->isPrimitive());
|
|
|
|
assert(!Desc->isPrimitiveArray());
|
|
|
|
|
|
|
|
// Arrays.
|
|
|
|
if (Desc->isArray()) {
|
|
|
|
const Descriptor *ElemDesc = Desc->ElemDesc;
|
|
|
|
assert(ElemDesc);
|
|
|
|
|
|
|
|
// Don't need to do anything for these.
|
|
|
|
if (ElemDesc->isPrimitiveArray())
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// If this is an array of record types, check if we need
|
|
|
|
// to call the element destructors at all. If not, try
|
|
|
|
// to save the work.
|
|
|
|
if (const Record *ElemRecord = ElemDesc->ElemRecord) {
|
|
|
|
if (const CXXDestructorDecl *Dtor = ElemRecord->getDestructor();
|
|
|
|
!Dtor || Dtor->isTrivial())
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (ssize_t I = Desc->getNumElems() - 1; I >= 0; --I) {
|
|
|
|
if (!this->emitConstUint64(I, SourceInfo{}))
|
|
|
|
return false;
|
|
|
|
if (!this->emitArrayElemPtrUint64(SourceInfo{}))
|
|
|
|
return false;
|
|
|
|
if (!this->emitDestruction(ElemDesc))
|
|
|
|
return false;
|
|
|
|
if (!this->emitPopPtr(SourceInfo{}))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
2023-03-06 19:05:54 +01:00
|
|
|
|
2024-02-18 17:35:26 +01:00
|
|
|
assert(Desc->ElemRecord);
|
|
|
|
return this->emitRecordDestruction(Desc->ElemRecord);
|
2023-03-06 19:05:54 +01:00
|
|
|
}
|
|
|
|
|
[Clang Interpreter] Initial patch for the constexpr interpreter
Summary:
This patch introduces the skeleton of the constexpr interpreter,
capable of evaluating a simple constexpr functions consisting of
if statements. The interpreter is described in more detail in the
RFC. Further patches will add more features.
Reviewers: Bigcheese, jfb, rsmith
Subscribers: bruno, uenoku, ldionne, Tyker, thegameg, tschuett, dexonsmith, mgorny, cfe-commits
Tags: #clang
Differential Revision: https://reviews.llvm.org/D64146
llvm-svn: 371834
2019-09-13 09:46:16 +00:00
|
|
|
namespace clang {
|
|
|
|
namespace interp {
|
|
|
|
|
|
|
|
template class ByteCodeExprGen<ByteCodeEmitter>;
|
|
|
|
template class ByteCodeExprGen<EvalEmitter>;
|
|
|
|
|
|
|
|
} // namespace interp
|
|
|
|
} // namespace clang
|