Interp.h

Go to the documentation of this file.

//===--- Interp.h - Interpreter for the constexpr VM ------------*- 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
//
//===----------------------------------------------------------------------===//
//
// Definition of the interpreter state and entry point.
//
//===----------------------------------------------------------------------===//
 
#ifndef LLVM_CLANG_AST_INTERP_INTERP_H
#define LLVM_CLANG_AST_INTERP_INTERP_H
 
#include "../ExprConstShared.h"
#include "BitcastBuffer.h"
#include "Boolean.h"
#include "Char.h"
#include "DynamicAllocator.h"
#include "FixedPoint.h"
#include "Floating.h"
#include "Function.h"
#include "InterpBuiltinBitCast.h"
#include "InterpFrame.h"
#include "InterpHelpers.h"
#include "InterpStack.h"
#include "InterpState.h"
#include "MemberPointer.h"
#include "PrimType.h"
#include "Program.h"
#include "Reflect.h"
#include "State.h"
#include "clang/AST/ASTContext.h"
#include "clang/AST/Expr.h"
#include "llvm/ADT/APFloat.h"
#include "llvm/ADT/APSInt.h"
#include "llvm/Support/Compiler.h"
#include <type_traits>
 
// preserve_none causes problems when asan is enabled on both AArch64 and other
// platforms. Disable it until all the bugs are fixed here.
//
// See https://github.com/llvm/llvm-project/issues/177519 for AArch64.
#if !defined(__aarch64__) && !defined(__i386__) &&                             \
    !__has_feature(address_sanitizer) &&                                       \
    __has_cpp_attribute(clang::preserve_none)
#define PRESERVE_NONE [[clang::preserve_none]]
#else
#define PRESERVE_NONE
#endif
 
namespace clang {
namespace interp {
 
using APSInt = llvm::APSInt;
using FixedPointSemantics = llvm::FixedPointSemantics;
 
/// Checks if a pointer is null.
bool CheckNull(InterpState &S, CodePtr OpPC, const Pointer &Ptr,
               CheckSubobjectKind CSK);
 
/// Checks if Ptr is a one-past-the-end pointer.
bool CheckSubobject(InterpState &S, CodePtr OpPC, const Pointer &Ptr,
                    CheckSubobjectKind CSK);
 
/// Checks if a pointer points to const storage.
bool CheckConst(InterpState &S, CodePtr OpPC, const Pointer &Ptr);
 
/// Checks if the Descriptor is of a constexpr or const global variable.
bool CheckConstant(InterpState &S, CodePtr OpPC, const Descriptor *Desc,
                   AccessKinds AK = AK_Read);
 
bool CheckFinalLoad(InterpState &S, CodePtr OpPC, const Pointer &Ptr);
 
bool diagnoseUninitialized(InterpState &S, CodePtr OpPC, const Pointer &Ptr,
                           AccessKinds AK);
 
bool diagnoseArrayIndex(InterpState &S, CodePtr OpPC, const APSInt &Index,
                        std::optional<uint64_t> NumElems = std::nullopt,
                        bool IsArray = true);
 
/// Checks a direct load of a primitive value from a global or local variable.
bool CheckGlobalLoad(InterpState &S, CodePtr OpPC, const Block *B);
bool CheckLocalLoad(InterpState &S, CodePtr OpPC, const Block *B);
 
/// Checks if a value can be stored in a block.
bool CheckStore(InterpState &S, CodePtr OpPC, const Pointer &Ptr,
                AccessKinds AK = AK_Assign, bool WillBeActivated = false);
 
/// Checks if a value can be initialized.
bool CheckInit(InterpState &S, CodePtr OpPC, const Pointer &Ptr);
 
/// Checks the 'this' pointer.
bool CheckThis(InterpState &S, CodePtr OpPC);
 
/// Checks if dynamic memory allocation is available in the current
/// language mode.
bool CheckDynamicMemoryAllocation(InterpState &S, CodePtr OpPC);
 
/// Check the source of the pointer passed to delete/delete[] has actually
/// been heap allocated by us.
bool CheckDeleteSource(InterpState &S, CodePtr OpPC, const Pointer &Ptr);
 
/// Sets the given integral value to the pointer, which is of
/// a std::{weak,partial,strong}_ordering type.
bool SetThreeWayComparisonField(InterpState &S, CodePtr OpPC,
                                const Pointer &Ptr, const APSInt &IntValue);
 
bool CallVar(InterpState &S, CodePtr OpPC, const Function *Func,
             uint32_t VarArgSize);
bool Call(InterpState &S, CodePtr OpPC, const Function *Func,
          uint32_t VarArgSize);
bool CallVirt(InterpState &S, CodePtr OpPC, const Function *Func,
              uint32_t VarArgSize);
bool CallBI(InterpState &S, CodePtr OpPC, const CallExpr *CE,
            uint32_t BuiltinID);
bool CallPtr(InterpState &S, CodePtr OpPC, uint32_t ArgSize,
             const CallExpr *CE);
bool CheckLiteralType(InterpState &S, CodePtr OpPC, const Type *T);
bool InvalidShuffleVectorIndex(InterpState &S, CodePtr OpPC, uint32_t Index);
bool CheckBitCast(InterpState &S, CodePtr OpPC, bool HasIndeterminateBits,
                  bool TargetIsUCharOrByte);
bool CheckBCPResult(InterpState &S, const Pointer &Ptr);
bool checkDestructor(InterpState &S, CodePtr OpPC, const Pointer &Ptr);
bool CheckFunctionDecl(InterpState &S, CodePtr OpPC, const FunctionDecl *FD);
bool CheckBitCast(InterpState &S, CodePtr OpPC, const Type *TargetType,
                  bool SrcIsVoidPtr);
bool handleReference(InterpState &S, CodePtr OpPC, Block *B);
bool InvalidCast(InterpState &S, CodePtr OpPC, CastKind Kind, bool Fatal);
 
bool handleFixedPointOverflow(InterpState &S, CodePtr OpPC,
                              const FixedPoint &FP);
 
bool Destroy(InterpState &S, CodePtr OpPC, uint32_t I);
bool DynamicCast(InterpState &S, CodePtr OpPC, const Type *DestType,
                 bool IsReferenceCast);
bool CastFloatingIntegralAP(InterpState &S, CodePtr OpPC, uint32_t BitWidth,
                            uint32_t FPOI);
bool CastFloatingIntegralAPS(InterpState &S, CodePtr OpPC, uint32_t BitWidth,
                             uint32_t FPOI);
 
enum class ShiftDir { Left, Right };
 
enum class ShiftFailure {
  NegativeCount,
  TooLarge,
  NegativeLeftOperand,
  DiscardsBits,
};
 
LLVM_ATTRIBUTE_NOINLINE bool diagnoseShiftFailure(InterpState &S, CodePtr OpPC,
                                                  ShiftFailure Failure,
                                                  const APSInt *Value = nullptr,
                                                  unsigned Bits = 0);
 
/// Checks if the shift operation is legal.
template <ShiftDir Dir, typename LT, typename RT>
bool CheckShift(InterpState &S, CodePtr OpPC, const LT &LHS, const RT &RHS,
                unsigned Bits) {
  if (RHS.isNegative()) {
    const APSInt Value = RHS.toAPSInt();
    if (!diagnoseShiftFailure(S, OpPC, ShiftFailure::NegativeCount, &Value))
      return false;
  }
 
  // C++11 [expr.shift]p1: Shift width must be less than the bit width of
  // the shifted type.
  if (Bits > 1 && RHS >= Bits) {
    const APSInt Value = RHS.toAPSInt();
    if (!diagnoseShiftFailure(S, OpPC, ShiftFailure::TooLarge, &Value, Bits))
      return false;
  }
 
  if constexpr (Dir == ShiftDir::Left) {
    if (LHS.isSigned() && !S.getLangOpts().CPlusPlus20) {
      // C++11 [expr.shift]p2: A signed left shift must have a non-negative
      // operand, and must not overflow the corresponding unsigned type.
      if (LHS.isNegative()) {
        const APSInt Value = LHS.toAPSInt();
        if (!diagnoseShiftFailure(S, OpPC, ShiftFailure::NegativeLeftOperand,
                                  &Value))
          return false;
      } else if (LHS.toUnsigned().countLeadingZeros() <
                 static_cast<unsigned>(RHS)) {
        if (!diagnoseShiftFailure(S, OpPC, ShiftFailure::DiscardsBits))
          return false;
      }
    }
  }
 
  // C++2a [expr.shift]p2: [P0907R4]:
  //    E1 << E2 is the unique value congruent to
  //    E1 x 2^E2 module 2^N.
  return true;
}
 
/// Checks if Div/Rem operation on LHS and RHS is valid.
template <typename T>
bool CheckDivRem(InterpState &S, CodePtr OpPC, const T &LHS, const T &RHS) {
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (!LHS.isNumber() || !RHS.isNumber())
      return false;
  }
 
  if (RHS.isZero()) {
    const auto *Op = cast<BinaryOperator>(S.Current->getExpr(OpPC));
    if constexpr (std::is_same_v<T, Floating>) {
      S.CCEDiag(Op, diag::note_expr_divide_by_zero)
          << Op->getRHS()->getSourceRange();
      return true;
    }
 
    S.FFDiag(Op, diag::note_expr_divide_by_zero)
        << Op->getRHS()->getSourceRange();
    return false;
  }
 
  if constexpr (!std::is_same_v<T, FixedPoint>) {
    if (LHS.isSigned() && LHS.isMin() && RHS.isNegative() && RHS.isMinusOne()) {
      APSInt LHSInt = LHS.toAPSInt();
      SmallString<32> Trunc;
      (-LHSInt.extend(LHSInt.getBitWidth() + 1)).toString(Trunc, 10);
      const SourceInfo &Loc = S.Current->getSource(OpPC);
      const Expr *E = S.Current->getExpr(OpPC);
      S.CCEDiag(Loc, diag::note_constexpr_overflow) << Trunc << E->getType();
      return false;
    }
  }
  return true;
}
 
/// Checks if the result of a floating-point operation is valid
/// in the current context.
/// Notes:
///   - CheckFloatStatus is the same as
///     checkFloatingPointResultForConstantFolding in
///     clang/lib/AST/ExprConstant.cpp.
///   - CheckFloatResult will also check if the result is NaN, in addition to
///     CheckFloatStatus's checks.
// FIXME: P3899R3 (adopted by WG21 in June 2026) likely makes this interface
// obsolete.
// https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2026/p3899r3.html
// Also see the comment:
// https://github.com/llvm/llvm-project/pull/213750/changes/2fea01449764e23b84ce6790bc7121d369546192#r3708712572
bool CheckFloatResult(InterpState &S, CodePtr OpPC, const Floating &Result,
                      APFloat::opStatus Status, FPOptions FPO);
 
/// Check if the given floating-point evaluation status is allowed for
/// compile-time constant folding during translation (as opposed to mandatory
/// constant expression evaluation).
bool CheckFloatStatus(InterpState &S, CodePtr OpPC, APFloat::opStatus Status,
                      FPOptions FPO);
 
/// Checks why the given DeclRefExpr is invalid.
bool CheckDeclRef(InterpState &S, CodePtr OpPC, const DeclRefExpr *DR);
bool InvalidDeclRef(InterpState &S, CodePtr OpPC, const DeclRefExpr *DR,
                    bool InitializerFailed);
 
/// DerivedToBaseMemberPointer
bool CastMemberPtrBasePop(InterpState &S, int32_t Off,
                          const RecordDecl *BaseDecl);
/// BaseToDerivedMemberPointer
bool CastMemberPtrDerivedPop(InterpState &S, int32_t Off,
                             const RecordDecl *BaseDecl);
enum class ArithOp { Add, Sub };
 
//===----------------------------------------------------------------------===//
// Returning values
//===----------------------------------------------------------------------===//
 
void cleanupAfterFunctionCall(InterpState &S, const Function *Func);
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
PRESERVE_NONE bool Ret(InterpState &S) {
  const T &Ret = S.Stk.pop<T>();
 
  assert(S.Current);
#ifndef NDEBUG
  assert(S.Current->getFrameOffset() == S.Stk.size() && "Invalid frame");
#endif
 
  // This only happens via Context::Run().
  if (S.Current->isBottomFrame())
    return true;
 
  cleanupAfterFunctionCall(S, S.Current->getFunction());
  S.PC = S.Current->getRetPC();
  S.Stk.push<T>(Ret);
  return true;
}
 
PRESERVE_NONE inline bool RetVoid(InterpState &S) {
  assert(S.Current);
#ifndef NDEBUG
  assert(S.Current->getFrameOffset() == S.Stk.size() && "Invalid frame");
#endif
 
  // This only happens via Context::Run().
  if (S.Current->isBottomFrame())
    return true;
 
  cleanupAfterFunctionCall(S, S.Current->getFunction());
  S.PC = S.Current->getRetPC();
  return true;
}
 
//===----------------------------------------------------------------------===//
// Add, Sub, Mul
//===----------------------------------------------------------------------===//
 
template <typename T, bool (*OpFW)(T, T, unsigned, T *),
          template <typename U> class OpAP>
bool AddSubMulHelper(InterpState &S, CodePtr OpPC, unsigned Bits, const T &LHS,
                     const T &RHS) {
  // Should've been handled before.
  if constexpr (isIntegralOrPointer<T>()) {
    assert(LHS.isNumber() && RHS.isNumber());
  }
 
  // Fast path - add the numbers with fixed width.
  T Result;
  if constexpr (needsAlloc<T>())
    Result = S.allocAP<T>(LHS.bitWidth());
 
  if (!OpFW(LHS, RHS, Bits, &Result)) {
    S.Stk.push<T>(Result);
    return true;
  }
  // If for some reason evaluation continues, use the truncated results.
  S.Stk.push<T>(Result);
 
  // Short-circuit fixed-points here since the error handling is easier.
  if constexpr (std::is_same_v<T, FixedPoint>)
    return handleFixedPointOverflow(S, OpPC, Result);
 
  // If wrapping is enabled, the new value is fine.
  if (S.Current->getExpr(OpPC)->getType().isWrapType())
    return true;
 
  // Slow path - compute the result using another bit of precision.
  APSInt Value = OpAP<APSInt>()(LHS.toAPSInt(Bits), RHS.toAPSInt(Bits));
 
  // Report undefined behaviour, stopping if required.
  if (S.checkingForUndefinedBehavior()) {
    const Expr *E = S.Current->getExpr(OpPC);
    QualType Type = E->getType();
    SmallString<32> Trunc;
    Value.trunc(Result.bitWidth())
        .toString(Trunc, 10, Result.isSigned(), /*formatAsCLiteral=*/false,
                  /*UpperCase=*/true, /*InsertSeparators=*/true);
    S.report(E->getExprLoc(), diag::warn_integer_constant_overflow)
        << Trunc << Type << E->getSourceRange();
  }
 
  if (!handleOverflow(S, OpPC, Value)) {
    S.Stk.pop<T>();
    return false;
  }
  return true;
}
 
// Add or subtract an integer-thats-actually-a-pointer and one real integer.
template <typename T, template <typename U> class Op>
static bool AddSubNonNumber(InterpState &S, CodePtr OpPC, T LHS, T RHS) {
  assert(!LHS.isNumber() || !RHS.isNumber());
 
  typename T::ReprT Number;
  const void *Ptr;
  typename T::ReprT Offset;
  IntegralKind Kind;
  if (LHS.isNumber()) {
    if (RHS.getKind() == IntegralKind::AddrLabelDiff)
      return Invalid(S, OpPC);
 
    Number = static_cast<typename T::ReprT>(LHS);
    Ptr = RHS.getPtr();
    Offset = RHS.getOffset();
    Kind = RHS.getKind();
  } else {
    assert(RHS.isNumber());
    if (LHS.getKind() == IntegralKind::AddrLabelDiff)
      return Invalid(S, OpPC);
 
    Number = static_cast<typename T::ReprT>(RHS);
    Ptr = LHS.getPtr();
    Offset = LHS.getOffset();
    Kind = LHS.getKind();
  }
 
  S.Stk.push<T>(Kind, Ptr, Op<int32_t>()(Offset, Number));
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Add(InterpState &S, CodePtr OpPC) {
  const T &RHS = S.Stk.pop<T>();
  const T &LHS = S.Stk.pop<T>();
  const unsigned Bits = RHS.bitWidth() + 1;
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (LHS.isNumber() != RHS.isNumber())
      return AddSubNonNumber<T, std::plus>(S, OpPC, LHS, RHS);
    else if (LHS.isNumber() && RHS.isNumber())
      ; // Fall through to proper addition below.
    else
      return false; // Reject everything else.
  }
 
  return AddSubMulHelper<T, T::add, std::plus>(S, OpPC, Bits, LHS, RHS);
}
 
inline bool Addf(InterpState &S, CodePtr OpPC, uint32_t FPOI) {
  const Floating &RHS = S.Stk.pop<Floating>();
  const Floating &LHS = S.Stk.pop<Floating>();
 
  FPOptions FPO = FPOptions::getFromOpaqueInt(FPOI);
  Floating Result = S.allocFloat(LHS.getSemantics());
  auto Status = Floating::add(LHS, RHS, getRoundingMode(FPO), &Result);
  S.Stk.push<Floating>(Result);
  return CheckFloatResult(S, OpPC, Result, Status, FPO);
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Sub(InterpState &S, CodePtr OpPC) {
  const T &RHS = S.Stk.pop<T>();
  const T &LHS = S.Stk.pop<T>();
  const unsigned Bits = RHS.bitWidth() + 1;
 
  if constexpr (isIntegralOrPointer<T>()) {
    // Handle (int)&&a - (int)&&b.
    // Both operands should be integrals that point to labels and the result is
    // a AddrLabelDiff integral.
    if (LHS.getKind() == IntegralKind::LabelAddress ||
        RHS.getKind() == IntegralKind::LabelAddress) {
      const auto *A = LHS.getKind() == IntegralKind::LabelAddress
                          ? reinterpret_cast<const Expr *>(LHS.getPtr())
                          : nullptr;
      const auto *B = RHS.getKind() == IntegralKind::LabelAddress
                          ? reinterpret_cast<const Expr *>(RHS.getPtr())
                          : nullptr;
      if (!isa_and_nonnull<AddrLabelExpr>(A) ||
          !isa_and_nonnull<AddrLabelExpr>(B))
        return false;
      const auto *LHSAddrExpr = cast<AddrLabelExpr>(A);
      const auto *RHSAddrExpr = cast<AddrLabelExpr>(B);
 
      if (LHSAddrExpr->getLabel()->getDeclContext() !=
          RHSAddrExpr->getLabel()->getDeclContext())
        return Invalid(S, OpPC);
 
      S.Stk.push<T>(LHSAddrExpr, RHSAddrExpr);
      return true;
    }
 
    if (!LHS.isNumber() && RHS.isNumber())
      return AddSubNonNumber<T, std::minus>(S, OpPC, LHS, RHS);
    else if (LHS.isNumber() && RHS.isNumber())
      ; // Fall through to proper addition below.
    else
      return false; // Reject everything else.
  }
 
  return AddSubMulHelper<T, T::sub, std::minus>(S, OpPC, Bits, LHS, RHS);
}
 
inline bool Subf(InterpState &S, CodePtr OpPC, uint32_t FPOI) {
  const Floating &RHS = S.Stk.pop<Floating>();
  const Floating &LHS = S.Stk.pop<Floating>();
 
  FPOptions FPO = FPOptions::getFromOpaqueInt(FPOI);
  Floating Result = S.allocFloat(LHS.getSemantics());
  auto Status = Floating::sub(LHS, RHS, getRoundingMode(FPO), &Result);
  S.Stk.push<Floating>(Result);
  return CheckFloatResult(S, OpPC, Result, Status, FPO);
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Mul(InterpState &S, CodePtr OpPC) {
  const T &RHS = S.Stk.pop<T>();
  const T &LHS = S.Stk.pop<T>();
  const unsigned Bits = RHS.bitWidth() * 2;
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (!LHS.isNumber() || !RHS.isNumber())
      return Invalid(S, OpPC);
  }
 
  return AddSubMulHelper<T, T::mul, std::multiplies>(S, OpPC, Bits, LHS, RHS);
}
 
inline bool Mulf(InterpState &S, CodePtr OpPC, uint32_t FPOI) {
  const Floating &RHS = S.Stk.pop<Floating>();
  const Floating &LHS = S.Stk.pop<Floating>();
 
  FPOptions FPO = FPOptions::getFromOpaqueInt(FPOI);
  Floating Result = S.allocFloat(LHS.getSemantics());
 
  auto Status = Floating::mul(LHS, RHS, getRoundingMode(FPO), &Result);
 
  S.Stk.push<Floating>(Result);
  return CheckFloatResult(S, OpPC, Result, Status, FPO);
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool Mulc(InterpState &S) {
  const Pointer &RHS = S.Stk.pop<Pointer>();
  const Pointer &LHS = S.Stk.pop<Pointer>();
  const Pointer &Result = S.Stk.peek<Pointer>();
 
  if constexpr (std::is_same_v<T, Floating>) {
    APFloat A = LHS.elem<Floating>(0).getAPFloat();
    APFloat B = LHS.elem<Floating>(1).getAPFloat();
    APFloat C = RHS.elem<Floating>(0).getAPFloat();
    APFloat D = RHS.elem<Floating>(1).getAPFloat();
 
    APFloat ResR(A.getSemantics());
    APFloat ResI(A.getSemantics());
    HandleComplexComplexMul(A, B, C, D, ResR, ResI);
 
    // Copy into the result.
    Floating RA = S.allocFloat(A.getSemantics());
    RA.copy(ResR);
    Result.elem<Floating>(0) = RA; // Floating(ResR);
 
    Floating RI = S.allocFloat(A.getSemantics());
    RI.copy(ResI);
    Result.elem<Floating>(1) = RI; // Floating(ResI);
    Result.initializeAllElements();
  } else {
    // Integer element type.
    const T &LHSR = LHS.elem<T>(0);
    const T &LHSI = LHS.elem<T>(1);
    const T &RHSR = RHS.elem<T>(0);
    const T &RHSI = RHS.elem<T>(1);
    unsigned Bits = LHSR.bitWidth();
 
    // We only handle actual numbers here.
    if (!LHSR.isNumber() || !LHSI.isNumber() || !RHSR.isNumber() ||
        !RHSI.isNumber())
      return false;
 
    // real(Result) = (real(LHS) * real(RHS)) - (imag(LHS) * imag(RHS))
    T A;
    if constexpr (needsAlloc<T>())
      A = S.allocAP<T>(Bits);
    if (T::mul(LHSR, RHSR, Bits, &A))
      return false;
 
    T B;
    if constexpr (needsAlloc<T>())
      B = S.allocAP<T>(Bits);
    if (T::mul(LHSI, RHSI, Bits, &B))
      return false;
 
    if constexpr (needsAlloc<T>())
      Result.elem<T>(0) = S.allocAP<T>(Bits);
    if (T::sub(A, B, Bits, &Result.elem<T>(0)))
      return false;
 
    // imag(Result) = (real(LHS) * imag(RHS)) + (imag(LHS) * real(RHS))
    if (T::mul(LHSR, RHSI, Bits, &A))
      return false;
    if (T::mul(LHSI, RHSR, Bits, &B))
      return false;
 
    if constexpr (needsAlloc<T>())
      Result.elem<T>(1) = S.allocAP<T>(Bits);
    if (T::add(A, B, Bits, &Result.elem<T>(1)))
      return false;
    Result.initialize();
    Result.initializeAllElements();
  }
 
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool Divc(InterpState &S, CodePtr OpPC) {
  const Pointer &RHS = S.Stk.pop<Pointer>();
  const Pointer &LHS = S.Stk.pop<Pointer>();
  const Pointer &Result = S.Stk.peek<Pointer>();
 
  if constexpr (std::is_same_v<T, Floating>) {
    APFloat A = LHS.elem<Floating>(0).getAPFloat();
    APFloat B = LHS.elem<Floating>(1).getAPFloat();
    APFloat C = RHS.elem<Floating>(0).getAPFloat();
    APFloat D = RHS.elem<Floating>(1).getAPFloat();
 
    APFloat ResR(A.getSemantics());
    APFloat ResI(A.getSemantics());
    HandleComplexComplexDiv(A, B, C, D, ResR, ResI);
 
    // Copy into the result.
    Floating RA = S.allocFloat(A.getSemantics());
    RA.copy(ResR);
    Result.elem<Floating>(0) = RA; // Floating(ResR);
 
    Floating RI = S.allocFloat(A.getSemantics());
    RI.copy(ResI);
    Result.elem<Floating>(1) = RI; // Floating(ResI);
 
    Result.initializeAllElements();
  } else {
    // Integer element type.
    const T &LHSR = LHS.elem<T>(0);
    const T &LHSI = LHS.elem<T>(1);
    const T &RHSR = RHS.elem<T>(0);
    const T &RHSI = RHS.elem<T>(1);
    unsigned Bits = LHSR.bitWidth();
 
    if (RHSR.isZero() && RHSI.isZero()) {
      const SourceInfo &E = S.Current->getSource(OpPC);
      S.FFDiag(E, diag::note_expr_divide_by_zero);
      return false;
    }
 
    // Den = real(RHS)² + imag(RHS)²
    T A, B;
    if constexpr (needsAlloc<T>()) {
      A = S.allocAP<T>(Bits);
      B = S.allocAP<T>(Bits);
    }
 
    if (T::mul(RHSR, RHSR, Bits, &A) || T::mul(RHSI, RHSI, Bits, &B)) {
      // Ignore overflow here, because that's what the current interpeter does.
    }
    T Den;
    if constexpr (needsAlloc<T>())
      Den = S.allocAP<T>(Bits);
 
    if (T::add(A, B, Bits, &Den))
      return false;
 
    if (Den.isZero()) {
      const SourceInfo &E = S.Current->getSource(OpPC);
      S.FFDiag(E, diag::note_expr_divide_by_zero);
      return false;
    }
 
    // real(Result) = ((real(LHS) * real(RHS)) + (imag(LHS) * imag(RHS))) / Den
    T &ResultR = Result.elem<T>(0);
    T &ResultI = Result.elem<T>(1);
    if constexpr (needsAlloc<T>()) {
      ResultR = S.allocAP<T>(Bits);
      ResultI = S.allocAP<T>(Bits);
    }
    if (T::mul(LHSR, RHSR, Bits, &A) || T::mul(LHSI, RHSI, Bits, &B))
      return false;
    if (T::add(A, B, Bits, &ResultR))
      return false;
    if (T::div(ResultR, Den, Bits, &ResultR))
      return false;
 
    // imag(Result) = ((imag(LHS) * real(RHS)) - (real(LHS) * imag(RHS))) / Den
    if (T::mul(LHSI, RHSR, Bits, &A) || T::mul(LHSR, RHSI, Bits, &B))
      return false;
    if (T::sub(A, B, Bits, &ResultI))
      return false;
    if (T::div(ResultI, Den, Bits, &ResultI))
      return false;
    Result.initializeAllElements();
  }
 
  return true;
}
 
/// 1) Pops the RHS from the stack.
/// 2) Pops the LHS from the stack.
/// 3) Pushes 'LHS & RHS' on the stack
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool BitAnd(InterpState &S) {
  const T &RHS = S.Stk.pop<T>();
  const T &LHS = S.Stk.pop<T>();
  unsigned Bits = RHS.bitWidth();
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (!LHS.isNumber() || !RHS.isNumber())
      return false;
  }
 
  T Result;
  if constexpr (needsAlloc<T>())
    Result = S.allocAP<T>(Bits);
 
  if (!T::bitAnd(LHS, RHS, Bits, &Result)) {
    S.Stk.push<T>(Result);
    return true;
  }
  return false;
}
 
/// 1) Pops the RHS from the stack.
/// 2) Pops the LHS from the stack.
/// 3) Pushes 'LHS | RHS' on the stack
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool BitOr(InterpState &S) {
  const T &RHS = S.Stk.pop<T>();
  const T &LHS = S.Stk.pop<T>();
  unsigned Bits = RHS.bitWidth();
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (!LHS.isNumber() || !RHS.isNumber())
      return false;
  }
 
  T Result;
  if constexpr (needsAlloc<T>())
    Result = S.allocAP<T>(Bits);
 
  if (!T::bitOr(LHS, RHS, Bits, &Result)) {
    S.Stk.push<T>(Result);
    return true;
  }
  return false;
}
 
/// 1) Pops the RHS from the stack.
/// 2) Pops the LHS from the stack.
/// 3) Pushes 'LHS ^ RHS' on the stack
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool BitXor(InterpState &S) {
  const T &RHS = S.Stk.pop<T>();
  const T &LHS = S.Stk.pop<T>();
  unsigned Bits = RHS.bitWidth();
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (!LHS.isNumber() || !RHS.isNumber())
      return false;
  }
 
  T Result;
  if constexpr (needsAlloc<T>())
    Result = S.allocAP<T>(Bits);
 
  if (!T::bitXor(LHS, RHS, Bits, &Result)) {
    S.Stk.push<T>(Result);
    return true;
  }
  return false;
}
 
/// 1) Pops the RHS from the stack.
/// 2) Pops the LHS from the stack.
/// 3) Pushes 'LHS % RHS' on the stack (the remainder of dividing LHS by RHS).
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Rem(InterpState &S, CodePtr OpPC) {
  const T &RHS = S.Stk.pop<T>();
  const T &LHS = S.Stk.pop<T>();
  const unsigned Bits = RHS.bitWidth() * 2;
 
  if (!CheckDivRem(S, OpPC, LHS, RHS))
    return false;
 
  T Result;
  if constexpr (needsAlloc<T>())
    Result = S.allocAP<T>(LHS.bitWidth());
 
  if (!T::rem(LHS, RHS, Bits, &Result)) {
    S.Stk.push<T>(Result);
    return true;
  }
  return false;
}
 
/// 1) Pops the RHS from the stack.
/// 2) Pops the LHS from the stack.
/// 3) Pushes 'LHS / RHS' on the stack
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Div(InterpState &S, CodePtr OpPC) {
  const T &RHS = S.Stk.pop<T>();
  const T &LHS = S.Stk.pop<T>();
  const unsigned Bits = RHS.bitWidth() * 2;
 
  if (!CheckDivRem(S, OpPC, LHS, RHS))
    return false;
 
  T Result;
  if constexpr (needsAlloc<T>())
    Result = S.allocAP<T>(LHS.bitWidth());
 
  if (!T::div(LHS, RHS, Bits, &Result)) {
    S.Stk.push<T>(Result);
    return true;
  }
 
  if constexpr (std::is_same_v<T, FixedPoint>) {
    if (handleFixedPointOverflow(S, OpPC, Result)) {
      S.Stk.push<T>(Result);
      return true;
    }
  }
  return false;
}
 
inline bool Divf(InterpState &S, CodePtr OpPC, uint32_t FPOI) {
  const Floating &RHS = S.Stk.pop<Floating>();
  const Floating &LHS = S.Stk.pop<Floating>();
 
  if (!CheckDivRem(S, OpPC, LHS, RHS))
    return false;
 
  FPOptions FPO = FPOptions::getFromOpaqueInt(FPOI);
 
  Floating Result = S.allocFloat(LHS.getSemantics());
  auto Status = Floating::div(LHS, RHS, getRoundingMode(FPO), &Result);
 
  S.Stk.push<Floating>(Result);
  return CheckFloatResult(S, OpPC, Result, Status, FPO);
}
 
//===----------------------------------------------------------------------===//
// Inv
//===----------------------------------------------------------------------===//
 
inline bool Inv(InterpState &S) {
  const auto &Val = S.Stk.pop<Boolean>();
  S.Stk.push<Boolean>(!Val);
  return true;
}
 
//===----------------------------------------------------------------------===//
// Neg
//===----------------------------------------------------------------------===//
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Neg(InterpState &S, CodePtr OpPC) {
  const T &Value = S.Stk.pop<T>();
 
  if constexpr (std::is_same_v<T, Floating>) {
    T Result = S.allocFloat(Value.getSemantics());
 
    if (!T::neg(Value, &Result)) {
      S.Stk.push<T>(Result);
      return true;
    }
    return false;
  } else {
    T Result;
    if constexpr (needsAlloc<T>())
      Result = S.allocAP<T>(Value.bitWidth());
 
    if (!T::neg(Value, &Result)) {
      S.Stk.push<T>(Result);
      return true;
    }
 
    assert((isIntegerType(Name) || Name == PT_FixedPoint) &&
           "don't expect other types to fail at constexpr negation");
    S.Stk.push<T>(Result);
 
    if (S.Current->getExpr(OpPC)->getType().isWrapType())
      return true;
 
    APSInt NegatedValue = -Value.toAPSInt(Value.bitWidth() + 1);
    if (S.checkingForUndefinedBehavior()) {
      const Expr *E = S.Current->getExpr(OpPC);
      QualType Type = E->getType();
      SmallString<32> Trunc;
      NegatedValue.trunc(Result.bitWidth())
          .toString(Trunc, 10, Result.isSigned(), /*formatAsCLiteral=*/false,
                    /*UpperCase=*/true, /*InsertSeparators=*/true);
      S.report(E->getExprLoc(), diag::warn_integer_constant_overflow)
          << Trunc << Type << E->getSourceRange();
      return true;
    }
 
    return handleOverflow(S, OpPC, NegatedValue);
  }
}
 
enum class PushVal : bool {
  No,
  Yes,
};
enum class IncDecOp {
  Inc,
  Dec,
};
 
template <typename T, IncDecOp Op, PushVal DoPush>
bool IncDecHelper(InterpState &S, CodePtr OpPC, const Pointer &Ptr,
                  bool CanOverflow, UnsignedOrNone BitWidth = std::nullopt) {
  assert(!Ptr.isDummy());
 
  if constexpr (std::is_same_v<T, Boolean>) {
    if (!S.getLangOpts().CPlusPlus14)
      return Invalid(S, OpPC);
  }
 
  const T &Value = Ptr.deref<T>();
 
  // Can't inc/dec non-numbers.
  if constexpr (isIntegralOrPointer<T>()) {
    if (!Value.isNumber())
      return false;
  }
 
  T Result;
  if constexpr (needsAlloc<T>())
    Result = S.allocAP<T>(Value.bitWidth());
 
  if constexpr (DoPush == PushVal::Yes)
    S.Stk.push<T>(Value);
 
  if constexpr (Op == IncDecOp::Inc) {
    if (!T::increment(Value, &Result) || !CanOverflow) {
      if (BitWidth)
        Ptr.deref<T>() = Result.truncate(*BitWidth);
      else
        Ptr.deref<T>() = Result;
      return true;
    }
  } else {
    if (!T::decrement(Value, &Result) || !CanOverflow) {
      if (BitWidth)
        Ptr.deref<T>() = Result.truncate(*BitWidth);
      else
        Ptr.deref<T>() = Result;
      return true;
    }
  }
  assert(CanOverflow);
 
  if (S.Current->getExpr(OpPC)->getType().isWrapType()) {
    Ptr.deref<T>() = Result;
    return true;
  }
 
  // Something went wrong with the previous operation. Compute the
  // result with another bit of precision.
  unsigned Bits = Value.bitWidth() + 1;
  APSInt APResult;
  if constexpr (Op == IncDecOp::Inc)
    APResult = ++Value.toAPSInt(Bits);
  else
    APResult = --Value.toAPSInt(Bits);
 
  // Report undefined behaviour, stopping if required.
  if (S.checkingForUndefinedBehavior()) {
    const Expr *E = S.Current->getExpr(OpPC);
    QualType Type = E->getType();
    SmallString<32> Trunc;
    APResult.trunc(Result.bitWidth())
        .toString(Trunc, 10, Result.isSigned(), /*formatAsCLiteral=*/false,
                  /*UpperCase=*/true, /*InsertSeparators=*/true);
    S.report(E->getExprLoc(), diag::warn_integer_constant_overflow)
        << Trunc << Type << E->getSourceRange();
    return true;
  }
  return handleOverflow(S, OpPC, APResult);
}
 
/// 1) Pops a pointer from the stack
/// 2) Load the value from the pointer
/// 3) Writes the value increased by one back to the pointer
/// 4) Pushes the original (pre-inc) value on the stack.
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Inc(InterpState &S, CodePtr OpPC, bool CanOverflow) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Increment))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecHelper<T, IncDecOp::Inc, PushVal::Yes>(S, OpPC, Ptr,
                                                      CanOverflow);
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool IncBitfield(InterpState &S, CodePtr OpPC, bool CanOverflow,
                 unsigned BitWidth) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Increment))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecHelper<T, IncDecOp::Inc, PushVal::Yes>(S, OpPC, Ptr, CanOverflow,
                                                      BitWidth);
}
 
/// 1) Pops a pointer from the stack
/// 2) Load the value from the pointer
/// 3) Writes the value increased by one back to the pointer
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool IncPop(InterpState &S, CodePtr OpPC, bool CanOverflow) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Increment))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecHelper<T, IncDecOp::Inc, PushVal::No>(S, OpPC, Ptr, CanOverflow);
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool IncPopBitfield(InterpState &S, CodePtr OpPC, bool CanOverflow,
                    uint32_t BitWidth) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Increment))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecHelper<T, IncDecOp::Inc, PushVal::No>(S, OpPC, Ptr, CanOverflow,
                                                     BitWidth);
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool PreInc(InterpState &S, CodePtr OpPC, bool CanOverflow) {
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Increment))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecHelper<T, IncDecOp::Inc, PushVal::No>(S, OpPC, Ptr, CanOverflow);
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool PreIncBitfield(InterpState &S, CodePtr OpPC, bool CanOverflow,
                    uint32_t BitWidth) {
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Increment))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecHelper<T, IncDecOp::Inc, PushVal::No>(S, OpPC, Ptr, CanOverflow,
                                                     BitWidth);
}
 
/// 1) Pops a pointer from the stack
/// 2) Load the value from the pointer
/// 3) Writes the value decreased by one back to the pointer
/// 4) Pushes the original (pre-dec) value on the stack.
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Dec(InterpState &S, CodePtr OpPC, bool CanOverflow) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Decrement))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecHelper<T, IncDecOp::Dec, PushVal::Yes>(S, OpPC, Ptr,
                                                      CanOverflow);
}
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool DecBitfield(InterpState &S, CodePtr OpPC, bool CanOverflow,
                 uint32_t BitWidth) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Decrement))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecHelper<T, IncDecOp::Dec, PushVal::Yes>(S, OpPC, Ptr, CanOverflow,
                                                      BitWidth);
}
 
/// 1) Pops a pointer from the stack
/// 2) Load the value from the pointer
/// 3) Writes the value decreased by one back to the pointer
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool DecPop(InterpState &S, CodePtr OpPC, bool CanOverflow) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Decrement))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecHelper<T, IncDecOp::Dec, PushVal::No>(S, OpPC, Ptr, CanOverflow);
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool DecPopBitfield(InterpState &S, CodePtr OpPC, bool CanOverflow,
                    uint32_t BitWidth) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Decrement))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecHelper<T, IncDecOp::Dec, PushVal::No>(S, OpPC, Ptr, CanOverflow,
                                                     BitWidth);
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool PreDec(InterpState &S, CodePtr OpPC, bool CanOverflow) {
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Decrement))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
  return IncDecHelper<T, IncDecOp::Dec, PushVal::No>(S, OpPC, Ptr, CanOverflow);
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool PreDecBitfield(InterpState &S, CodePtr OpPC, bool CanOverflow,
                    uint32_t BitWidth) {
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Decrement))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
  return IncDecHelper<T, IncDecOp::Dec, PushVal::No>(S, OpPC, Ptr, CanOverflow,
                                                     BitWidth);
}
 
template <IncDecOp Op, PushVal DoPush>
bool IncDecFloatHelper(InterpState &S, CodePtr OpPC, const Pointer &Ptr,
                       uint32_t FPOI) {
  Floating Value = Ptr.deref<Floating>();
  Floating Result = S.allocFloat(Value.getSemantics());
 
  if constexpr (DoPush == PushVal::Yes)
    S.Stk.push<Floating>(Value);
 
  FPOptions FPO = FPOptions::getFromOpaqueInt(FPOI);
  llvm::APFloat::opStatus Status;
  if constexpr (Op == IncDecOp::Inc)
    Status = Floating::increment(Value, getRoundingMode(FPO), &Result);
  else
    Status = Floating::decrement(Value, getRoundingMode(FPO), &Result);
 
  Ptr.deref<Floating>() = Result;
 
  return CheckFloatResult(S, OpPC, Result, Status, FPO);
}
 
inline bool Incf(InterpState &S, CodePtr OpPC, uint32_t FPOI) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Increment))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecFloatHelper<IncDecOp::Inc, PushVal::Yes>(S, OpPC, Ptr, FPOI);
}
 
inline bool IncfPop(InterpState &S, CodePtr OpPC, uint32_t FPOI) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Increment))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecFloatHelper<IncDecOp::Inc, PushVal::No>(S, OpPC, Ptr, FPOI);
}
 
inline bool Decf(InterpState &S, CodePtr OpPC, uint32_t FPOI) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Decrement))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecFloatHelper<IncDecOp::Dec, PushVal::Yes>(S, OpPC, Ptr, FPOI);
}
 
inline bool DecfPop(InterpState &S, CodePtr OpPC, uint32_t FPOI) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr, AK_Decrement))
    return false;
  if (!CheckConst(S, OpPC, Ptr))
    return false;
 
  return IncDecFloatHelper<IncDecOp::Dec, PushVal::No>(S, OpPC, Ptr, FPOI);
}
 
/// 1) Pops the value from the stack.
/// 2) Pushes the bitwise complemented value on the stack (~V).
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Comp(InterpState &S) {
  const T &Val = S.Stk.pop<T>();
 
  T Result;
  if constexpr (needsAlloc<T>())
    Result = S.allocAP<T>(Val.bitWidth());
 
  if (!T::comp(Val, &Result)) {
    S.Stk.push<T>(Result);
    return true;
  }
  return false;
}
 
//===----------------------------------------------------------------------===//
// EQ, NE, GT, GE, LT, LE
//===----------------------------------------------------------------------===//
 
using CompareFn = llvm::function_ref<bool(ComparisonCategoryResult)>;
 
template <typename T>
bool CmpHelper(InterpState &S, CodePtr OpPC, CompareFn Fn) {
  assert((!std::is_same_v<T, MemberPointer>) &&
         "Non-equality comparisons on member pointer types should already be "
         "rejected in Sema.");
  using BoolT = PrimConv<PT_Bool>::T;
  const T &RHS = S.Stk.pop<T>();
  const T &LHS = S.Stk.pop<T>();
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (!LHS.isNumber() || !RHS.isNumber())
      return Invalid(S, OpPC);
  }
 
  S.Stk.push<BoolT>(BoolT::from(Fn(LHS.compare(RHS))));
  return true;
}
 
template <typename T>
bool CmpHelperEQ(InterpState &S, CodePtr OpPC, CompareFn Fn) {
  return CmpHelper<T>(S, OpPC, Fn);
}
 
template <>
inline bool CmpHelper<Pointer>(InterpState &S, CodePtr OpPC, CompareFn Fn) {
  using BoolT = PrimConv<PT_Bool>::T;
  const Pointer &RHS = S.Stk.pop<Pointer>();
  const Pointer &LHS = S.Stk.pop<Pointer>();
 
  // Function pointers cannot be compared in an ordered way.
  if (LHS.isFunctionPointer() || RHS.isFunctionPointer() ||
      LHS.isTypeidPointer() || RHS.isTypeidPointer()) {
    const SourceInfo &Loc = S.Current->getSource(OpPC);
    S.FFDiag(Loc, diag::note_constexpr_pointer_comparison_unspecified)
        << LHS.toDiagnosticString(S.getASTContext())
        << RHS.toDiagnosticString(S.getASTContext());
    return false;
  }
 
  if (LHS == RHS) {
    S.Stk.push<BoolT>(BoolT::from(Fn(ComparisonCategoryResult::Equal)));
    return true;
  }
 
  if (!Pointer::hasSameBase(LHS, RHS)) {
    const SourceInfo &Loc = S.Current->getSource(OpPC);
    S.FFDiag(Loc, diag::note_constexpr_pointer_comparison_unspecified)
        << LHS.toDiagnosticString(S.getASTContext())
        << RHS.toDiagnosticString(S.getASTContext());
    return false;
  }
 
  // Diagnose comparisons between fields with different access specifiers,
  // comparisons between bases and bases+fields.
  if (std::optional<std::pair<PtrView, PtrView>> Split =
          Pointer::computeSplitPoint(LHS, RHS)) {
    const FieldDecl *LF = Split->first.getField();
    const FieldDecl *RF = Split->second.getField();
    if (!LF && !RF)
      S.CCEDiag(S.Current->getSource(OpPC),
                diag::note_constexpr_pointer_comparison_base_classes);
    else if (!LF)
      S.CCEDiag(S.Current->getSource(OpPC),
                diag::note_constexpr_pointer_comparison_base_field)
          << Split->first.getRecord()->getDecl() << RF->getParent() << RF;
    else if (!RF)
      S.CCEDiag(S.Current->getSource(OpPC),
                diag::note_constexpr_pointer_comparison_base_field)
          << Split->second.getRecord()->getDecl() << LF->getParent() << LF;
    else if (!LF->getParent()->isUnion() &&
             LF->getAccess() != RF->getAccess()) {
      S.CCEDiag(S.Current->getSource(OpPC),
                diag::note_constexpr_pointer_comparison_differing_access)
          << LF << LF->getAccess() << RF << RF->getAccess() << LF->getParent();
    }
  }
 
  std::optional<size_t> VL = LHS.computeOffsetForComparison(S.getASTContext());
  std::optional<size_t> VR = RHS.computeOffsetForComparison(S.getASTContext());
  if (!VL || !VR)
    return Invalid(S, OpPC);
  S.Stk.push<BoolT>(BoolT::from(Fn(Compare(*VL, *VR))));
  return true;
}
 
bool arePotentiallyOverlappingStringLiterals(const Pointer &LHS,
                                             const Pointer &RHS);
 
template <>
inline bool CmpHelperEQ<Pointer>(InterpState &S, CodePtr OpPC, CompareFn Fn) {
  using BoolT = PrimConv<PT_Bool>::T;
  const Pointer &RHS = S.Stk.pop<Pointer>();
  const Pointer &LHS = S.Stk.pop<Pointer>();
 
  if (LHS.isZero() && RHS.isZero()) {
    S.Stk.push<BoolT>(BoolT::from(Fn(ComparisonCategoryResult::Equal)));
    return true;
  }
 
  // Reject comparisons to weak pointers.
  for (const auto &P : {LHS, RHS}) {
    if (P.isZero())
      continue;
    if (P.isWeak()) {
      const SourceInfo &Loc = S.Current->getSource(OpPC);
      S.FFDiag(Loc, diag::note_constexpr_pointer_weak_comparison)
          << P.toDiagnosticString(S.getASTContext());
      return false;
    }
  }
 
  // p == nullptr or nullptr == p.
  if (RHS.isZero() || LHS.isZero()) {
    S.Stk.push<BoolT>(BoolT::from(Fn(ComparisonCategoryResult::Unordered)));
    return true;
  }
 
  assert(!LHS.isZero());
  assert(!RHS.isZero());
 
  if (!S.inConstantContext()) {
    if (LHS.isConstexprUnknown() || RHS.isConstexprUnknown())
      return false;
  }
 
  if (LHS.isFunctionPointer() && RHS.isFunctionPointer()) {
    S.Stk.push<BoolT>(BoolT::from(Fn(Compare(LHS.getIntegerRepresentation(),
                                             RHS.getIntegerRepresentation()))));
    return true;
  }
 
  if (Pointer::hasSameBase(LHS, RHS)) {
    std::optional<size_t> A = LHS.computeOffsetForComparison(S.getASTContext());
    std::optional<size_t> B = RHS.computeOffsetForComparison(S.getASTContext());
    if (!A || !B)
      return false;
 
    S.Stk.push<BoolT>(BoolT::from(Fn(Compare(*A, *B))));
    return true;
  }
  // Otherwise we need to do a bunch of extra checks before returning Unordered.
 
  if (LHS.isStringPointer() && RHS.isStringPointer() &&
      arePotentiallyOverlappingStringLiterals(LHS, RHS)) {
    S.FFDiag(S.Current->getSource(OpPC),
             diag::note_constexpr_literal_comparison)
        << LHS.toDiagnosticString(S.getASTContext())
        << RHS.toDiagnosticString(S.getASTContext());
    return false;
  }
 
  if (LHS.isOnePastEnd() && !RHS.isOnePastEnd()) {
    const SourceInfo &Loc = S.Current->getSource(OpPC);
    S.FFDiag(Loc, diag::note_constexpr_pointer_comparison_past_end)
        << LHS.toDiagnosticString(S.getASTContext());
    return false;
  }
  if (RHS.isOnePastEnd() && !LHS.isOnePastEnd()) {
    const SourceInfo &Loc = S.Current->getSource(OpPC);
    S.FFDiag(Loc, diag::note_constexpr_pointer_comparison_past_end)
        << RHS.toDiagnosticString(S.getASTContext());
    return false;
  }
 
  // Reject comparisons to literals.
  for (const auto &P : {LHS, RHS}) {
    if (P.isZero())
      continue;
    if (P.pointsToLiteral()) {
      const Expr *E = P.getRootExpr();
      if (isa<StringLiteral>(E)) {
        const SourceInfo &Loc = S.Current->getSource(OpPC);
        S.FFDiag(Loc, diag::note_constexpr_literal_comparison);
        return false;
      }
      if (const auto *CE = dyn_cast<CallExpr>(E);
          CE && isOpaqueConstantCall(CE)) {
        const SourceInfo &Loc = S.Current->getSource(OpPC);
        S.FFDiag(Loc, diag::note_constexpr_opaque_call_comparison)
            << P.toDiagnosticString(S.getASTContext());
        return false;
      }
    } else if (P.isIntegralPointer()) {
      const SourceInfo &Loc = S.Current->getSource(OpPC);
      S.FFDiag(Loc, diag::note_constexpr_pointer_constant_comparison)
          << LHS.toDiagnosticString(S.getASTContext())
          << RHS.toDiagnosticString(S.getASTContext());
      return false;
    }
  }
 
  if (LHS.isUnknownSizeArray() && RHS.isUnknownSizeArray()) {
    const SourceInfo &Loc = S.Current->getSource(OpPC);
    S.FFDiag(Loc, diag::note_constexpr_pointer_comparison_zero_sized)
        << LHS.toDiagnosticString(S.getASTContext())
        << RHS.toDiagnosticString(S.getASTContext());
    return false;
  }
 
  if (LHS.isConstexprUnknown() || RHS.isConstexprUnknown()) {
    if (!S.checkingPotentialConstantExpression())
      S.FFDiag(S.Current->getSource(OpPC),
               diag::note_constexpr_pointer_comparison_unspecified)
          << LHS.toDiagnosticString(S.getASTContext())
          << RHS.toDiagnosticString(S.getASTContext());
    return false;
  }
 
  S.Stk.push<BoolT>(BoolT::from(Fn(ComparisonCategoryResult::Unordered)));
  return true;
}
 
template <>
inline bool CmpHelperEQ<MemberPointer>(InterpState &S, CodePtr OpPC,
                                       CompareFn Fn) {
  const auto &RHS = S.Stk.pop<MemberPointer>();
  const auto &LHS = S.Stk.pop<MemberPointer>();
 
  // If either operand is a pointer to a weak function, the comparison is not
  // constant.
  for (const auto &MP : {LHS, RHS}) {
    if (MP.isWeak()) {
      const SourceInfo &Loc = S.Current->getSource(OpPC);
      S.FFDiag(Loc, diag::note_constexpr_mem_pointer_weak_comparison)
          << MP.getMemberFunction();
      return false;
    }
  }
 
  // C++11 [expr.eq]p2:
  //   If both operands are null, they compare equal. Otherwise if only one is
  //   null, they compare unequal.
  if (LHS.isZero() && RHS.isZero()) {
    S.Stk.push<Boolean>(Fn(ComparisonCategoryResult::Equal));
    return true;
  }
  if (LHS.isZero() || RHS.isZero()) {
    S.Stk.push<Boolean>(Fn(ComparisonCategoryResult::Unordered));
    return true;
  }
 
  // We cannot compare against virtual declarations at compile time.
  for (const auto &MP : {LHS, RHS}) {
    if (const CXXMethodDecl *MD = MP.getMemberFunction();
        MD && MD->isVirtual()) {
      const SourceInfo &Loc = S.Current->getSource(OpPC);
      S.CCEDiag(Loc, diag::note_constexpr_compare_virtual_mem_ptr) << MD;
    }
  }
 
  S.Stk.push<Boolean>(Boolean::from(Fn(LHS.compare(RHS))));
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool EQ(InterpState &S, CodePtr OpPC) {
  return CmpHelperEQ<T>(S, OpPC, [](ComparisonCategoryResult R) {
    return R == ComparisonCategoryResult::Equal;
  });
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool CMP3(InterpState &S, CodePtr OpPC, const ComparisonCategoryInfo *CmpInfo) {
  const T &RHS = S.Stk.pop<T>();
  const T &LHS = S.Stk.pop<T>();
  const Pointer &P = S.Stk.peek<Pointer>();
 
  ComparisonCategoryResult CmpResult;
  if constexpr (std::is_same_v<T, Pointer>) {
    if (!Pointer::hasSameBase(LHS, RHS)) {
      S.FFDiag(S.Current->getSource(OpPC),
               diag::note_constexpr_pointer_comparison_unspecified)
          << LHS.toDiagnosticString(S.getASTContext())
          << RHS.toDiagnosticString(S.getASTContext());
      return false;
    }
    std::optional<size_t> LHSOffset =
        LHS.computeLayoutOffset(S.getASTContext());
    std::optional<size_t> RHSOffset =
        RHS.computeLayoutOffset(S.getASTContext());
    if (!LHSOffset || !RHSOffset)
      return false;
 
    if (LHSOffset < RHSOffset)
      CmpResult = ComparisonCategoryResult::Less;
    else if (LHSOffset > RHSOffset)
      CmpResult = ComparisonCategoryResult::Greater;
    else
      CmpResult = ComparisonCategoryResult::Equal;
  } else {
    CmpResult = LHS.compare(RHS);
  }
 
  assert(CmpInfo);
  const auto *CmpValueInfo =
      CmpInfo->getValueInfo(CmpInfo->makeWeakResult(CmpResult));
  assert(CmpValueInfo);
  assert(CmpValueInfo->hasValidIntValue());
  return SetThreeWayComparisonField(S, OpPC, P, CmpValueInfo->getIntValue());
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool NE(InterpState &S, CodePtr OpPC) {
  return CmpHelperEQ<T>(S, OpPC, [](ComparisonCategoryResult R) {
    return R != ComparisonCategoryResult::Equal;
  });
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool LT(InterpState &S, CodePtr OpPC) {
  return CmpHelper<T>(S, OpPC, [](ComparisonCategoryResult R) {
    return R == ComparisonCategoryResult::Less;
  });
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool LE(InterpState &S, CodePtr OpPC) {
  return CmpHelper<T>(S, OpPC, [](ComparisonCategoryResult R) {
    return R == ComparisonCategoryResult::Less ||
           R == ComparisonCategoryResult::Equal;
  });
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool GT(InterpState &S, CodePtr OpPC) {
  return CmpHelper<T>(S, OpPC, [](ComparisonCategoryResult R) {
    return R == ComparisonCategoryResult::Greater;
  });
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool GE(InterpState &S, CodePtr OpPC) {
  return CmpHelper<T>(S, OpPC, [](ComparisonCategoryResult R) {
    return R == ComparisonCategoryResult::Greater ||
           R == ComparisonCategoryResult::Equal;
  });
}
 
//===----------------------------------------------------------------------===//
// Dup, Pop, Test
//===----------------------------------------------------------------------===//
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Dup(InterpState &S) {
  S.Stk.push<T>(S.Stk.peek<T>());
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Pop(InterpState &S) {
  S.Stk.discard<T>();
  return true;
}
 
/// [Value1, Value2] -> [Value2, Value1]
template <PrimType TopName, PrimType BottomName> bool Flip(InterpState &S) {
  using TopT = typename PrimConv<TopName>::T;
  using BottomT = typename PrimConv<BottomName>::T;
 
  const auto &Top = S.Stk.pop<TopT>();
  const auto &Bottom = S.Stk.pop<BottomT>();
 
  S.Stk.push<TopT>(Top);
  S.Stk.push<BottomT>(Bottom);
 
  return true;
}
 
//===----------------------------------------------------------------------===//
// Const
//===----------------------------------------------------------------------===//
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Const(InterpState &S, const T &Arg) {
  if constexpr (needsAlloc<T>()) {
    T Result = S.allocAP<T>(Arg.bitWidth());
    Result.copy(Arg.toAPSInt());
    S.Stk.push<T>(Result);
    return true;
  }
 
  if constexpr (std::is_same_v<T, uint16_t>) {
    S.Stk.push<Integral<16, false>>(Integral<16, false>::from(Arg));
  } else if constexpr (std::is_same_v<T, int16_t>) {
    S.Stk.push<Integral<16, true>>(Integral<16, true>::from(Arg));
  } else if constexpr (std::is_same_v<T, uint32_t>) {
    S.Stk.push<Integral<32, false>>(Integral<32, false>::from(Arg));
  } else if constexpr (std::is_same_v<T, int32_t>) {
    S.Stk.push<Integral<32, true>>(Integral<32, true>::from(Arg));
  } else if constexpr (std::is_same_v<T, uint64_t>) {
    S.Stk.push<Integral<64, false>>(Integral<64, false>::from(Arg));
  } else if constexpr (std::is_same_v<T, int64_t>) {
    S.Stk.push<Integral<64, true>>(Integral<64, true>::from(Arg));
  } else {
    // Bool.
    S.Stk.push<T>(Arg);
  }
 
  return true;
}
 
inline bool ConstFloat(InterpState &S, const Floating &F) {
  Floating Result = S.allocFloat(F.getSemantics());
  Result.copy(F.getAPFloat());
  S.Stk.push<Floating>(Result);
  return true;
}
 
//===----------------------------------------------------------------------===//
// Get/Set Local/Param/Global/This
//===----------------------------------------------------------------------===//
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool GetLocal(InterpState &S, CodePtr OpPC, uint32_t I) {
  const Block *B = S.Current->getLocalBlock(I);
  if (!CheckLocalLoad(S, OpPC, B))
    return false;
  S.Stk.push<T>(B->deref<T>());
  return true;
}
 
bool EndLifetime(InterpState &S, CodePtr OpPC);
bool PseudoDtor(InterpState &S, CodePtr OpPC);
bool StartThisLifetime(InterpState &S);
bool StartThisLifetime1(InterpState &S);
bool MarkDestroyed(InterpState &S, CodePtr OpPC);
bool DefaultInit(InterpState &S, CodePtr OpPC, const CXXConstructorDecl *Ctor);
 
/// 1) Pops the value from the stack.
/// 2) Writes the value to the local variable with the
///    given offset.
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool SetLocal(InterpState &S, uint32_t I) {
  S.Current->setLocal<T>(I, S.Stk.pop<T>());
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool GetParam(InterpState &S, uint32_t Index) {
  if (S.checkingPotentialConstantExpression()) {
    return false;
  }
  S.Stk.push<T>(S.Current->getParam<T>(Index));
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool SetParam(InterpState &S, uint32_t I) {
  S.Current->setParam<T>(I, S.Stk.pop<T>());
  return true;
}
 
/// 1) Peeks a pointer on the stack
/// 2) Pushes the value of the pointer's field on the stack
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool GetField(InterpState &S, CodePtr OpPC, uint32_t I) {
  const Pointer &Obj = S.Stk.peek<Pointer>();
  if (!CheckNull(S, OpPC, Obj, CSK_Field))
    return false;
  if (!CheckRange(S, OpPC, Obj, CSK_Field))
    return false;
 
  if (!Obj.isBlockPointer())
    return false;
 
  // FIXME(postswitch): The isUnknownSizeArray() check here is only needed
  // to keep an invalid sample producing the same diagnostics as the current
  // interpreter.
  if (!Obj.getFieldDesc()->isRecord() && !Obj.isUnknownSizeArray())
    return false;
 
  PtrView FieldPtr = Obj.view().atField(I);
  if (!CheckLoad(S, OpPC, FieldPtr))
    return false;
  S.Stk.push<T>(FieldPtr.deref<T>());
  return true;
}
 
/// 1) Pops a pointer from the stack
/// 2) Pushes the value of the pointer's field on the stack
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool GetFieldPop(InterpState &S, CodePtr OpPC, uint32_t I) {
  const Pointer &Obj = S.Stk.pop<Pointer>();
  if (!CheckNull(S, OpPC, Obj, CSK_Field))
    return false;
  if (!CheckRange(S, OpPC, Obj, CSK_Field))
    return false;
 
  if (!Obj.isBlockPointer())
    return false;
 
  // FIXME(postswitch): The isUnknownSizeArray() check here is only needed
  // to keep an invalid sample producing the same diagnostics as the current
  // interpreter.
  if (!Obj.getFieldDesc()->isRecord() && !Obj.isUnknownSizeArray())
    return false;
 
  PtrView FieldPtr = Obj.view().atField(I);
  if (!CheckLoad(S, OpPC, FieldPtr))
    return false;
  S.Stk.push<T>(FieldPtr.deref<T>());
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool GetThisField(InterpState &S, CodePtr OpPC, uint32_t I) {
  if (S.checkingPotentialConstantExpression())
    return false;
  if (!CheckThis(S, OpPC))
    return false;
  const Pointer &This = S.Current->getThis();
 
  if (!This.isBlockPointer())
    return false;
 
  PtrView FieldPtr = This.view().atField(I);
  if (!CheckLoad(S, OpPC, FieldPtr))
    return false;
  S.Stk.push<T>(FieldPtr.deref<T>());
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool GetGlobal(InterpState &S, CodePtr OpPC, uint32_t I) {
  const Block *B = S.P.getGlobal(I);
 
  if (!CheckGlobalLoad(S, OpPC, B))
    return false;
 
  S.Stk.push<T>(B->deref<T>());
  return true;
}
 
/// Same as GetGlobal, but without the checks.
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool GetGlobalUnchecked(InterpState &S, CodePtr OpPC, uint32_t I) {
  const Block *B = S.P.getGlobal(I);
  const auto &Desc = B->getBlockDesc<GlobalInlineDescriptor>();
  if (Desc.InitState != GlobalInitState::Initialized)
    return diagnoseUninitialized(S, OpPC, B->isExtern(), B);
 
  S.Stk.push<T>(B->deref<T>());
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool SetGlobal(InterpState &S, CodePtr OpPC, uint32_t I) {
  // TODO: emit warning.
  return false;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool InitGlobal(InterpState &S, uint32_t I) {
  const Pointer &P = S.P.getGlobal(I);
 
  P.deref<T>() = S.Stk.pop<T>();
 
  if constexpr (std::is_same_v<T, Floating>) {
    auto &Val = P.deref<Floating>();
    if (!Val.singleWord()) {
      uint64_t *NewMemory = new (S.P) uint64_t[Val.numWords()];
      Val.take(NewMemory);
    }
 
  } else if constexpr (std::is_same_v<T, MemberPointer>) {
    auto &Val = P.deref<MemberPointer>();
    unsigned PathLength = Val.getPathLength();
    auto *NewPath = new (S.P) const CXXRecordDecl *[PathLength];
    for (unsigned I = 0; I != PathLength; ++I) {
      NewPath[I] = Val.getPathEntry(I);
    }
    Val.takePath(NewPath);
  } else if constexpr (std::is_same_v<T, Pointer>) {
    auto &Val = P.deref<Pointer>();
    if (Val.isOpaquePointer() && Val.asOpaquePointer().PathLength != 0) {
      const OpaquePointer &OP = Val.asOpaquePointer();
      auto *NewPath = new (S.P) PointerPathEntry[OP.PathLength];
      std::memcpy(NewPath, OP.Path, OP.PathLength * sizeof(PointerPathEntry));
      Val = Pointer(OP.withPath(NewPath, OP.PathLength,
                                OP.getFieldType().getTypePtr(),
                                OP.isOnePastEnd()),
                    Val.getByteOffset());
    }
 
  } else if constexpr (needsAlloc<T>()) {
    auto &Val = P.deref<T>();
    if (!Val.singleWord()) {
      uint64_t *NewMemory = new (S.P) uint64_t[Val.numWords()];
      Val.take(NewMemory);
    }
  }
 
  P.initialize();
  return true;
}
 
/// 1) Converts the value on top of the stack to an APValue
/// 2) Sets that APValue on \Temp
/// 3) Initializes global with index \I with that
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool InitGlobalTemp(InterpState &S, uint32_t I,
                    const LifetimeExtendedTemporaryDecl *Temp) {
  if (S.EvalMode == EvaluationMode::ConstantFold)
    return false;
  assert(Temp);
 
  const Pointer &Ptr = S.P.getGlobal(I);
  assert(Ptr.getRootExpr());
  S.SeenGlobalTemporaries.push_back(std::make_pair(Ptr.getRootExpr(), Temp));
 
  Ptr.deref<T>() = S.Stk.pop<T>();
  Ptr.initialize();
  return true;
}
 
/// 1) Converts the value on top of the stack to an APValue
/// 2) Sets that APValue on \Temp
/// 3) Initialized global with index \I with that
inline bool InitGlobalTempComp(InterpState &S,
                               const LifetimeExtendedTemporaryDecl *Temp) {
  if (S.EvalMode == EvaluationMode::ConstantFold)
    return false;
  assert(Temp);
 
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  S.SeenGlobalTemporaries.push_back(std::make_pair(Ptr.getRootExpr(), Temp));
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool InitThisField(InterpState &S, CodePtr OpPC, uint32_t I) {
  if (S.checkingPotentialConstantExpression() && S.Current->isBottomFrame())
    return false;
  if (!CheckThis(S, OpPC))
    return false;
  const Pointer &This = S.Current->getThis();
  if (!This.isDereferencable())
    return false;
 
  const Pointer &Field = This.atField(I);
  Field.deref<T>() = S.Stk.pop<T>();
  Field.initialize();
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool InitThisFieldActivate(InterpState &S, CodePtr OpPC, uint32_t I) {
  if (S.checkingPotentialConstantExpression() && S.Current->isBottomFrame())
    return false;
  if (!CheckThis(S, OpPC))
    return false;
  const Pointer &This = S.Current->getThis();
  if (!This.isDereferencable())
    return false;
 
  const Pointer &Field = This.atField(I);
  Field.deref<T>() = S.Stk.pop<T>();
  Field.activate();
  Field.initialize();
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool InitThisBitField(InterpState &S, CodePtr OpPC, uint32_t FieldOffset,
                      uint32_t FieldBitWidth) {
  if (S.checkingPotentialConstantExpression() && S.Current->isBottomFrame())
    return false;
  if (!CheckThis(S, OpPC))
    return false;
  const Pointer &This = S.Current->getThis();
  if (!This.isDereferencable())
    return false;
 
  const Pointer &Field = This.atField(FieldOffset);
  const auto &Value = S.Stk.pop<T>();
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (!Value.isNumber())
      return false;
  }
 
  Field.deref<T>() = Value.truncate(FieldBitWidth);
  Field.initialize();
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool InitThisBitFieldActivate(InterpState &S, CodePtr OpPC,
                              uint32_t FieldOffset, uint32_t FieldBitWidth) {
  if (S.checkingPotentialConstantExpression() && S.Current->isBottomFrame())
    return false;
  if (!CheckThis(S, OpPC))
    return false;
  const Pointer &This = S.Current->getThis();
  if (!This.isDereferencable())
    return false;
 
  const Pointer &Field = This.atField(FieldOffset);
  const auto &Value = S.Stk.pop<T>();
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (!Value.isNumber())
      return false;
  }
 
  Field.deref<T>() = Value.truncate(FieldBitWidth);
  Field.initialize();
  Field.activate();
  return true;
}
 
/// 1) Pops the value from the stack
/// 2) Peeks a pointer from the stack
/// 3) Pushes the value to field I of the pointer on the stack
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool InitField(InterpState &S, CodePtr OpPC, uint32_t I) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  if (!Ptr.isDereferencable())
    return false;
 
  if (!CheckRange(S, OpPC, Ptr, CSK_Field))
    return false;
  if (!CheckArray(S, OpPC, Ptr))
    return false;
 
  const Pointer &Field = Ptr.atField(I);
  Field.deref<T>() = Value;
  Field.initialize();
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool InitFieldActivate(InterpState &S, CodePtr OpPC, uint32_t I) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  if (!Ptr.isDereferencable())
    return false;
  if (!CheckRange(S, OpPC, Ptr, CSK_Field))
    return false;
  if (!CheckArray(S, OpPC, Ptr))
    return false;
 
  const Pointer &Field = Ptr.atField(I);
  Field.deref<T>() = Value;
  Field.activate();
  Field.initialize();
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool InitBitField(InterpState &S, CodePtr OpPC, uint32_t FieldOffset,
                  uint32_t FieldBitWidth) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  if (!Ptr.isDereferencable())
    return false;
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (!Value.isNumber())
      return false;
  }
  if (!CheckRange(S, OpPC, Ptr, CSK_Field))
    return false;
  if (!CheckArray(S, OpPC, Ptr))
    return false;
 
  const Pointer &Field = Ptr.atField(FieldOffset);
 
  unsigned BitWidth = std::min(FieldBitWidth, Value.bitWidth());
  if constexpr (needsAlloc<T>()) {
    T Result = S.allocAP<T>(Value.bitWidth());
    if constexpr (T::isSigned())
      Result.copy(
          Value.toAPSInt().trunc(BitWidth).sextOrTrunc(Value.bitWidth()));
    else
      Result.copy(
          Value.toAPSInt().trunc(BitWidth).zextOrTrunc(Value.bitWidth()));
 
    Field.deref<T>() = Result;
  } else {
    Field.deref<T>() = Value.truncate(FieldBitWidth);
  }
  Field.initialize();
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool InitBitFieldActivate(InterpState &S, CodePtr OpPC, uint32_t FieldOffset,
                          uint32_t FieldBitWidth) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  if (!Ptr.isDereferencable())
    return false;
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (!Value.isNumber())
      return false;
  }
  if (!CheckRange(S, OpPC, Ptr, CSK_Field))
    return false;
  if (!CheckArray(S, OpPC, Ptr))
    return false;
 
  const Pointer &Field = Ptr.atField(FieldOffset);
 
  unsigned BitWidth = std::min(FieldBitWidth, Value.bitWidth());
  if constexpr (needsAlloc<T>()) {
    T Result = S.allocAP<T>(Value.bitWidth());
    if constexpr (T::isSigned())
      Result.copy(
          Value.toAPSInt().trunc(BitWidth).sextOrTrunc(Value.bitWidth()));
    else
      Result.copy(
          Value.toAPSInt().trunc(BitWidth).zextOrTrunc(Value.bitWidth()));
 
    Field.deref<T>() = Result;
  } else {
    Field.deref<T>() = Value.truncate(FieldBitWidth);
  }
  Field.activate();
  Field.initialize();
  return true;
}
 
//===----------------------------------------------------------------------===//
// GetPtr Local/Param/Global/Field/This
//===----------------------------------------------------------------------===//
 
inline bool GetPtrLocal(InterpState &S, uint32_t I) {
  S.Stk.push<Pointer>(S.Current->getLocalPointer(I));
  return true;
}
 
inline bool GetRefLocal(InterpState &S, CodePtr OpPC, uint32_t I) {
  Block *LocalBlock = S.Current->getLocalBlock(I);
  return handleReference(S, OpPC, LocalBlock);
}
 
inline bool GetRefGlobal(InterpState &S, CodePtr OpPC, uint32_t I) {
  Block *B = S.P.getGlobal(I);
 
  // If we're currently evaluating this variable, use that in-flight value.
  // It will otherwise be diagnosed as non-initialized reference and we will
  // complain about a missing initializer.
  if (S.EvaluatingDecl && B->getDescriptor()->asVarDecl() == S.EvaluatingDecl) {
    S.Stk.push<Pointer>(B);
    return true;
  }
 
  if (B->isConstexprUnknown()) {
    S.Stk.push<Pointer>(B);
    return true;
  }
 
  const auto &Desc = B->getBlockDesc<GlobalInlineDescriptor>();
  if (Desc.InitState != GlobalInitState::Initialized)
    return diagnoseUninitialized(S, OpPC, B->isExtern(), B);
 
  S.Stk.push<Pointer>(B->deref<Pointer>());
  return true;
}
 
inline bool CheckRefInit(InterpState &S, CodePtr OpPC) {
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  return CheckRange(S, OpPC, Ptr, AK_Read);
}
 
inline bool GetPtrParam(InterpState &S, uint32_t Index) {
  if (S.Current->isBottomFrame())
    return false;
  S.Stk.push<Pointer>(S.Current->getParamPointer(Index));
  return true;
}
 
inline bool GetPtrGlobal(InterpState &S, uint32_t I) {
  S.Stk.push<Pointer>(S.P.getPtrGlobal(I));
  return true;
}
 
/// 1) Peeks a Pointer
/// 2) Pushes Pointer.atField(Off) on the stack
bool GetPtrField(InterpState &S, CodePtr OpPC, uint32_t Off);
bool GetPtrFieldPop(InterpState &S, CodePtr OpPC, uint32_t Off);
 
bool GetPtrBase(InterpState &S, CodePtr OpPC, uint32_t Off);
bool GetPtrBasePop(InterpState &S, CodePtr OpPC, uint32_t Off, bool NullOK);
 
bool GetPtrDerivedPop(InterpState &S, CodePtr OpPC, bool NullOK,
                      const Type *TargetType, const Type *FinalType);
 
inline bool GetPtrThisField(InterpState &S, CodePtr OpPC, uint32_t Off) {
  if (S.checkingPotentialConstantExpression() && S.Current->isBottomFrame())
    return false;
  if (!CheckThis(S, OpPC))
    return false;
  const Pointer &This = S.Current->getThis();
  if (!This.isBlockPointer())
    return false;
  S.Stk.push<Pointer>(This.atField(Off));
  return true;
}
 
inline bool GetPtrThisBase(InterpState &S, CodePtr OpPC, uint32_t Off) {
  if (S.checkingPotentialConstantExpression() && S.Current->isBottomFrame())
    return false;
  if (!CheckThis(S, OpPC))
    return false;
  const Pointer &This = S.Current->getThis();
  S.Stk.push<Pointer>(This.atField(Off));
  return true;
}
 
inline bool FinishInitPop(InterpState &S) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  Ptr.initialize();
  return true;
}
 
inline bool FinishInit(InterpState &S) {
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  Ptr.initialize();
  return true;
}
 
inline bool FinishInitActivate(InterpState &S) {
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  Ptr.initialize();
  Ptr.activate();
  return true;
}
 
inline bool FinishInitActivatePop(InterpState &S) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  Ptr.initialize();
  Ptr.activate();
  return true;
}
 
bool FinishInitGlobal(InterpState &S);
 
inline bool Dump(InterpState &S) {
  S.Stk.dump();
  return true;
}
 
inline bool CheckNull(InterpState &S, CodePtr OpPC) {
  const auto &Ptr = S.Stk.peek<Pointer>();
  if (Ptr.isZero()) {
    S.FFDiag(S.Current->getSource(OpPC),
             diag::note_constexpr_dereferencing_null);
    return S.noteUndefinedBehavior();
  }
  return true;
}
 
bool virtBaseHelper(InterpState &S, const CXXRecordDecl *Decl,
                    const Pointer &Ptr);
 
inline bool GetPtrVirtBasePop(InterpState &S, CodePtr OpPC,
                              const CXXRecordDecl *D) {
  assert(D);
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckNull(S, OpPC, Ptr, CSK_Base))
    return false;
  return virtBaseHelper(S, D, Ptr);
}
 
inline bool GetPtrVirtBase(InterpState &S, CodePtr OpPC,
                           const CXXRecordDecl *D) {
  assert(D);
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  if (!CheckNull(S, OpPC, Ptr, CSK_Base))
    return false;
  return virtBaseHelper(S, D, Ptr);
}
 
inline bool GetPtrThisVirtBase(InterpState &S, CodePtr OpPC,
                               const CXXRecordDecl *D) {
  assert(D);
  if (S.checkingPotentialConstantExpression())
    return false;
  if (!CheckThis(S, OpPC))
    return false;
  const Pointer &This = S.Current->getThis();
  return virtBaseHelper(S, D, This);
}
 
//===----------------------------------------------------------------------===//
// Load, Store, Init
//===----------------------------------------------------------------------===//
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Load(InterpState &S, CodePtr OpPC) {
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr))
    return false;
  if (!Ptr.canDeref(Name))
    return false;
  S.Stk.push<T>(Ptr.load<T>());
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool LoadPop(InterpState &S, CodePtr OpPC) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckLoad(S, OpPC, Ptr))
    return false;
  if (!Ptr.canDeref(Name))
    return false;
  S.Stk.push<T>(Ptr.load<T>());
  return true;
}
 
/// Like LoadPop above, but if any of the checks fail, we
/// turn the pointer into an opaque pointer of appropriate type.
inline bool LoadPopL(InterpState &S, CodePtr OpPC) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  auto *P = S.getEvalStatus().Diag;
  S.getEvalStatus().Diag = nullptr;
 
  bool Failed = false;
  if (!CheckLoad(S, OpPC, Ptr))
    Failed = true;
  if (!Ptr.isBlockPointer())
    Failed = true;
  if (!Failed && !Ptr.canDeref(PT_Ptr))
    Failed = true;
  S.getEvalStatus().Diag = P;
 
  if (Failed) {
    if (Ptr.isOpaquePointer()) {
      const OpaquePointer &OP = Ptr.asOpaquePointer();
 
      if (!Ptr.asOpaquePointer().Base.getType()->isPointerType())
        return false;
 
      QualType T = Ptr.getType();
      S.Stk.push<Pointer>(OP.withFieldType(T.getTypePtr()),
                          Ptr.getByteOffset());
      return true;
    }
 
    // Convert the block pointer to an opaque pointer.
    if (!Ptr.isBlockPointer())
      return false;
    // FIXME: I *think* we need more information here than just the base.
    S.Stk.push<Pointer>(Ptr.getDeclDesc()->asValueDecl());
  } else {
    S.Stk.push<Pointer>(Ptr.deref<Pointer>());
  }
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Store(InterpState &S, CodePtr OpPC) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  if (!CheckStore(S, OpPC, Ptr))
    return false;
  if (!Ptr.canDeref(Name))
    return false;
  Ptr.initialize();
  Ptr.deref<T>() = Value;
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool StorePop(InterpState &S, CodePtr OpPC) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckStore(S, OpPC, Ptr))
    return false;
  if (!Ptr.canDeref(Name))
    return false;
  Ptr.initialize();
  Ptr.deref<T>() = Value;
  return true;
}
 
static inline bool Activate(InterpState &S) {
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  Ptr.activate();
  return true;
}
 
static inline bool ActivateThisField(InterpState &S, uint32_t I) {
  if (S.checkingPotentialConstantExpression())
    return false;
  if (!S.Current->hasThisPointer())
    return false;
 
  const Pointer &Ptr = S.Current->getThis();
  Ptr.atField(I).activate();
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool StoreActivate(InterpState &S, CodePtr OpPC) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.peek<Pointer>();
 
  if (!CheckStore(S, OpPC, Ptr, AK_Assign, /*WillBeActivated=*/true))
    return false;
  Ptr.initialize();
  Ptr.activate();
  Ptr.deref<T>() = Value;
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool StoreActivatePop(InterpState &S, CodePtr OpPC) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.pop<Pointer>();
 
  if (!CheckStore(S, OpPC, Ptr, AK_Assign, /*WillBeActivated=*/true))
    return false;
  Ptr.initialize();
  Ptr.activate();
  Ptr.deref<T>() = Value;
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool StoreBitField(InterpState &S, CodePtr OpPC) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.peek<Pointer>();
 
  if (!CheckStore(S, OpPC, Ptr))
    return false;
  Ptr.initialize();
  if (const auto *FD = Ptr.getField())
    Ptr.deref<T>() = Value.truncate(FD->getBitWidthValue());
  else
    Ptr.deref<T>() = Value;
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool StoreBitFieldPop(InterpState &S, CodePtr OpPC) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckStore(S, OpPC, Ptr))
    return false;
  Ptr.initialize();
  if (const auto *FD = Ptr.getField())
    Ptr.deref<T>() = Value.truncate(FD->getBitWidthValue());
  else
    Ptr.deref<T>() = Value;
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool StoreBitFieldActivate(InterpState &S, CodePtr OpPC) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.peek<Pointer>();
 
  if (!CheckStore(S, OpPC, Ptr, AK_Assign, /*WillBeActivated=*/true))
    return false;
  Ptr.initialize();
  Ptr.activate();
  if (const auto *FD = Ptr.getField())
    Ptr.deref<T>() = Value.truncate(FD->getBitWidthValue());
  else
    Ptr.deref<T>() = Value;
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool StoreBitFieldActivatePop(InterpState &S, CodePtr OpPC) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.pop<Pointer>();
 
  if (!CheckStore(S, OpPC, Ptr, AK_Assign, /*WillBeActivated=*/true))
    return false;
  Ptr.initialize();
  Ptr.activate();
  if (const auto *FD = Ptr.getField())
    Ptr.deref<T>() = Value.truncate(FD->getBitWidthValue());
  else
    Ptr.deref<T>() = Value;
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Init(InterpState &S, CodePtr OpPC) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  if (!CheckInit(S, OpPC, Ptr))
    return false;
  Ptr.initialize();
  new (&Ptr.deref<T>()) T(Value);
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool InitPop(InterpState &S, CodePtr OpPC) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckInit(S, OpPC, Ptr))
    return false;
  Ptr.initialize();
  new (&Ptr.deref<T>()) T(Value);
  return true;
}
 
/// 1) Pops the value from the stack
/// 2) Peeks a pointer and gets its index \Idx
/// 3) Sets the value on the pointer, leaving the pointer on the stack.
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool InitElem(InterpState &S, CodePtr OpPC, uint32_t Idx) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.peek<Pointer>();
 
  if (Ptr.isConstexprUnknown())
    return false;
 
  const Descriptor *Desc = Ptr.getFieldDesc();
  if (Desc->isUnknownSizeArray())
    return false;
 
  // In the unlikely event that we're initializing the first item of
  // a non-array, skip the atIndex().
  if (Idx == 0 && !Desc->isArray()) {
    Ptr.initialize();
    new (&Ptr.deref<T>()) T(Value);
    return true;
  }
 
  if (!CheckLive(S, OpPC, Ptr, AK_Assign))
    return false;
  if (Idx >= Desc->getNumElems()) {
    // CheckRange.
    if (S.getLangOpts().CPlusPlus) {
      const SourceInfo &Loc = S.Current->getSource(OpPC);
      S.FFDiag(Loc, diag::note_constexpr_access_past_end)
          << AK_Assign << S.Current->getRange(OpPC);
    }
    return false;
  }
  Ptr.initializeElement(Idx);
  new (&Ptr.elem<T>(Idx)) T(Value);
  return true;
}
 
/// The same as InitElem, but pops the pointer as well.
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool InitElemPop(InterpState &S, CodePtr OpPC, uint32_t Idx) {
  const T &Value = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.pop<Pointer>();
 
  if (Ptr.isConstexprUnknown())
    return false;
 
  const Descriptor *Desc = Ptr.getFieldDesc();
  if (Desc->isUnknownSizeArray())
    return false;
 
  // In the unlikely event that we're initializing the first item of
  // a non-array, skip the atIndex().
  if (Idx == 0 && !Desc->isArray()) {
    Ptr.initialize();
    new (&Ptr.deref<T>()) T(Value);
    return true;
  }
 
  if (!CheckLive(S, OpPC, Ptr, AK_Assign))
    return false;
  if (Idx >= Desc->getNumElems()) {
    // CheckRange.
    if (S.getLangOpts().CPlusPlus) {
      const SourceInfo &Loc = S.Current->getSource(OpPC);
      S.FFDiag(Loc, diag::note_constexpr_access_past_end)
          << AK_Assign << S.Current->getRange(OpPC);
    }
    return false;
  }
  Ptr.initializeElement(Idx);
  new (&Ptr.elem<T>(Idx)) T(Value);
  return true;
}
 
inline bool ToMemberPtr(InterpState &S) {
  const auto &Member = S.Stk.pop<MemberPointer>();
  const auto &Base = S.Stk.pop<Pointer>();
 
  S.Stk.push<MemberPointer>(Member.takeInstance(Base));
  return true;
}
 
inline bool CastMemberPtrPtr(InterpState &S, CodePtr OpPC) {
  const auto &MP = S.Stk.pop<MemberPointer>();
 
  if (std::optional<Pointer> Ptr = MP.toPointer(S.Ctx)) {
    S.Stk.push<Pointer>(*Ptr);
    return true;
  }
  return Invalid(S, OpPC);
}
 
bool Memcpy(InterpState &S, CodePtr OpPC);
bool TrivialCopy(InterpState &S, CodePtr OpPC, bool Activate,
                 const Function *Func);
 
//===----------------------------------------------------------------------===//
// AddOffset, SubOffset
//===----------------------------------------------------------------------===//
 
template <class T, ArithOp Op>
std::optional<Pointer> OffsetHelper(InterpState &S, CodePtr OpPC,
                                    const T &Offset, const Pointer &Ptr,
                                    bool IsPointerArith = false) {
  // A zero offset does not change the pointer.
  if (Offset.isZero())
    return Ptr;
 
  if (IsPointerArith && !CheckNull(S, OpPC, Ptr, CSK_ArrayIndex)) {
    // The CheckNull will have emitted a note already, but we only
    // abort in C++, since this is fine in C.
    if (S.getLangOpts().CPlusPlus)
      return std::nullopt;
  }
 
  // Arrays of unknown bounds cannot have pointers into them.
  if (!CheckArray(S, OpPC, Ptr))
    return std::nullopt;
 
  // This is much simpler for integral pointers, so handle them first.
  if (Ptr.isIntegralPointer()) {
    uint64_t V = Ptr.getIntegerRepresentation();
    QualType ElemType = Ptr.asIntPointer().getPointeeType();
    uint64_t ElemSize =
        (ElemType.isNull() || ElemType->isVoidType())
            ? 1u
            : S.getASTContext().getTypeSizeInChars(ElemType).getQuantity();
    uint64_t O = static_cast<uint64_t>(Offset) * ElemSize;
    if constexpr (Op == ArithOp::Add) {
      return Pointer(V + O, Ptr.asIntPointer().getType());
    } else
      return Pointer(V - O, Ptr.asIntPointer().getType());
  } else if (Ptr.isFunctionPointer()) {
    uint64_t O = static_cast<uint64_t>(Offset);
    uint64_t N;
    if constexpr (Op == ArithOp::Add)
      N = Ptr.getByteOffset() + O;
    else
      N = Ptr.getByteOffset() - O;
 
    if (N > 1)
      diagnoseArrayIndex(S, OpPC, APSInt::getUnsigned(N), 0, /*IsArray=*/false);
    return Pointer(Ptr.asFunctionPointer().Func, N);
  } else if (Ptr.isStringPointer()) {
    int64_t NewOffset;
    if constexpr (Op == ArithOp::Add)
      NewOffset = Ptr.getByteOffset() + static_cast<int64_t>(Offset);
    else
      NewOffset = Ptr.getByteOffset() - static_cast<int64_t>(Offset);
    if (NewOffset < 0 ||
        NewOffset > (Ptr.asStringPointer().getLiteral()->getLength() + 1)) {
      diagnoseArrayIndex(S, OpPC, APSInt::get(NewOffset),
                         (Ptr.asStringPointer().getLiteral()->getLength() + 1));
      return std::nullopt;
    }
    return Pointer(Ptr.asStringPointer(), NewOffset);
  } else if (!Ptr.isBlockPointer()) {
    return std::nullopt;
  }
 
  assert(Ptr.isBlockPointer());
 
  uint64_t MaxIndex = static_cast<uint64_t>(Ptr.getNumElems());
  uint64_t Index;
  if (Ptr.isOnePastEnd())
    Index = MaxIndex;
  else
    Index = Ptr.getIndex();
 
  bool Invalid = false;
  // Helper to report an invalid offset, computed as APSInt.
  auto DiagInvalidOffset = [&]() -> void {
    const unsigned Bits = Offset.bitWidth();
    APSInt APOffset(Offset.toAPSInt().extend(Bits + 2), /*IsUnsigend=*/false);
    APSInt APIndex(APInt(Bits + 2, Index, /*IsSigned=*/true),
                   /*IsUnsigned=*/false);
    APSInt NewIndex =
        (Op == ArithOp::Add) ? (APIndex + APOffset) : (APIndex - APOffset);
    diagnoseArrayIndex(S, OpPC, NewIndex, MaxIndex, Ptr.inArray());
    Invalid = true;
  };
 
  uint64_t IOffset = static_cast<uint64_t>(Offset);
  uint64_t MaxOffset = MaxIndex - Index;
 
  if constexpr (Op == ArithOp::Add) {
    // If the new offset would be negative, bail out.
    if (Offset.isNegative() && (Offset.isMin() || -IOffset > Index))
      DiagInvalidOffset();
 
    // If the new offset would be out of bounds, bail out.
    if (Offset.isPositive() && IOffset > MaxOffset)
      DiagInvalidOffset();
  } else {
    // If the new offset would be negative, bail out.
    if (Offset.isPositive() && Index < IOffset)
      DiagInvalidOffset();
 
    // If the new offset would be out of bounds, bail out.
    if (Offset.isNegative() && (Offset.isMin() || -IOffset > MaxOffset))
      DiagInvalidOffset();
  }
 
  if (Invalid && (S.getLangOpts().CPlusPlus || Ptr.inArray()))
    return std::nullopt;
 
  // Offset is valid - compute it on unsigned.
  int64_t WideIndex = static_cast<int64_t>(Index);
  int64_t WideOffset = static_cast<int64_t>(Offset);
  int64_t Result;
  if constexpr (Op == ArithOp::Add)
    Result = WideIndex + WideOffset;
  else
    Result = WideIndex - WideOffset;
 
  // When the pointer is one-past-end, going back to index 0 is the only
  // useful thing we can do. Any other index has been diagnosed before and
  // we don't get here.
  if (Result == 0 && Ptr.isOnePastEnd()) {
    if (Ptr.getFieldDesc()->isArray())
      return Ptr.atIndex(0);
    return Pointer(Ptr.asBlockPointer().Pointee, Ptr.asBlockPointer().Base);
  }
 
  return Ptr.atIndex(static_cast<uint64_t>(Result));
}
 
std::optional<Pointer> addSubOffsetOpaque(InterpState &S, CodePtr OpPC,
                                          const Pointer &Ptr, APSInt &&Offset,
                                          ArithOp Op);
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool AddOffset(InterpState &S, CodePtr OpPC) {
  const T &Offset = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.pop<Pointer>().expand();
 
  if (Ptr.isOpaquePointer()) {
    if (std::optional<Pointer> Result =
            addSubOffsetOpaque(S, OpPC, Ptr, Offset.toAPSInt(), ArithOp::Add)) {
      S.Stk.push<Pointer>(*Result);
      return true;
    }
    return false;
  }
 
  if (std::optional<Pointer> Result = OffsetHelper<T, ArithOp::Add>(
          S, OpPC, Offset, Ptr, /*IsPointerArith=*/true)) {
    S.Stk.push<Pointer>(Result->narrow());
    return true;
  }
  return false;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool SubOffset(InterpState &S, CodePtr OpPC) {
  const T &Offset = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.pop<Pointer>().expand();
 
  if (Ptr.isOpaquePointer()) {
    if (std::optional<Pointer> Result =
            addSubOffsetOpaque(S, OpPC, Ptr, Offset.toAPSInt(), ArithOp::Sub)) {
      S.Stk.push<Pointer>(*Result);
      return true;
    }
    return false;
  }
 
  if (std::optional<Pointer> Result = OffsetHelper<T, ArithOp::Sub>(
          S, OpPC, Offset, Ptr, /*IsPointerArith=*/true)) {
    S.Stk.push<Pointer>(Result->narrow());
    return true;
  }
  return false;
}
 
inline bool GetOpaquePtr(InterpState &S, DeclOrExpr DOE,
                         bool ConstexprUnknown) {
  S.Stk.push<Pointer>(DOE, ConstexprUnknown);
  return true;
}
 
template <ArithOp Op>
static inline bool IncDecPtrHelper(InterpState &S, CodePtr OpPC,
                                   const Pointer &Ptr) {
  if (!Ptr.isDereferencable())
    return false;
 
  using OneT = Char<false>;
 
  const Pointer &P = Ptr.deref<Pointer>();
  if (!CheckNull(S, OpPC, P, CSK_ArrayIndex))
    return false;
 
  // Get the current value on the stack.
  S.Stk.push<Pointer>(P);
 
  if (P.isOpaquePointer()) {
    if (std::optional<Pointer> Result =
            addSubOffsetOpaque(S, OpPC, P, APSInt(APInt(1, 1), true), Op)) {
      Ptr.deref<Pointer>() = *Result;
      return true;
    }
    return false;
  }
 
  // Now the current Ptr again and a constant 1.
  OneT One = OneT::from(1);
  if (std::optional<Pointer> Result =
          OffsetHelper<OneT, Op>(S, OpPC, One, P, /*IsPointerArith=*/true)) {
    // Store the new value.
    Ptr.deref<Pointer>() = Result->narrow();
    return true;
  }
  return false;
}
 
static inline bool IncPtr(InterpState &S, CodePtr OpPC) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
 
  if (!Ptr.isInitialized())
    return diagnoseUninitialized(S, OpPC, Ptr, AK_Increment);
 
  return IncDecPtrHelper<ArithOp::Add>(S, OpPC, Ptr);
}
 
static inline bool DecPtr(InterpState &S, CodePtr OpPC) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
 
  if (!Ptr.isInitialized())
    return diagnoseUninitialized(S, OpPC, Ptr, AK_Decrement);
 
  return IncDecPtrHelper<ArithOp::Sub>(S, OpPC, Ptr);
}
 
/// 1) Pops a Pointer from the stack.
/// 2) Pops another Pointer from the stack.
/// 3) Pushes the difference of the indices of the two pointers on the stack.
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool SubPtr(InterpState &S, CodePtr OpPC, uint32_t ElemSize) {
  const Pointer &LHS = S.Stk.pop<Pointer>().expand();
  const Pointer &RHS = S.Stk.pop<Pointer>().expand();
 
  if (LHS.pointsToLabel() || RHS.pointsToLabel()) {
    if constexpr (isIntegralOrPointer<T>()) {
      const AddrLabelExpr *LHSAddrExpr = LHS.getPointedToLabel();
      const AddrLabelExpr *RHSAddrExpr = RHS.getPointedToLabel();
      if (!LHSAddrExpr || !RHSAddrExpr) {
        S.FFDiag(S.Current->getSource(OpPC),
                 diag::note_constexpr_pointer_arith_unspecified)
            << LHS.toDiagnosticString(S.getASTContext())
            << RHS.toDiagnosticString(S.getASTContext());
        return false;
      }
 
      if (LHSAddrExpr->getLabel()->getDeclContext() !=
          RHSAddrExpr->getLabel()->getDeclContext())
        return Invalid(S, OpPC);
 
      S.Stk.push<T>(LHSAddrExpr, RHSAddrExpr);
      return true;
    }
    // Can't represent an address-label-diff in these types.
    return false;
  }
 
  if (!Pointer::hasSameBase(LHS, RHS)) {
    S.FFDiag(S.Current->getSource(OpPC),
             diag::note_constexpr_pointer_arith_unspecified)
        << LHS.toDiagnosticString(S.getASTContext())
        << RHS.toDiagnosticString(S.getASTContext());
    return false;
  }
 
  if (ElemSize == 0) {
    QualType PtrT = S.getASTContext().getBaseElementType(LHS.getType());
    QualType ArrayTy = S.getASTContext().getConstantArrayType(
        PtrT, APInt::getZero(1), nullptr, ArraySizeModifier::Normal, 0);
    S.FFDiag(S.Current->getSource(OpPC),
             diag::note_constexpr_pointer_subtraction_zero_size)
        << ArrayTy;
 
    return false;
  }
 
  if (LHS == RHS) {
    S.Stk.push<T>();
    return true;
  }
 
  // C++11 [expr.add]p6:
  //   Unless both pointers point to elements of the same array object, or
  //   one past the last element of the array object, the behavior is
  //   undefined.
  if (LHS.isBlockPointer() && !Pointer::elemsOfSameArray(LHS, RHS))
    S.CCEDiag(S.Current->getSource(OpPC),
              diag::note_constexpr_pointer_subtraction_not_same_array);
 
  std::optional<size_t> VL = LHS.computeLayoutOffset(S.getASTContext());
  if (!VL)
    return false;
  std::optional<size_t> VR = RHS.computeLayoutOffset(S.getASTContext());
  if (!VR)
    return false;
 
  // We allow (VL - VR) / Elemsize to have non-zero remainder. This happens for
  // invalid expressions where LHS and RHS are of different types.
  int64_t R64 =
      (static_cast<int64_t>(*VL) - static_cast<int64_t>(*VR)) / ElemSize;
  if (static_cast<int64_t>(T::from(R64)) != R64)
    return handleOverflow(S, OpPC, R64);
 
  S.Stk.push<T>(T::from(R64));
  return true;
}
 
inline bool EnableLocal(InterpState &S, uint32_t I) {
  assert(!S.Current->isLocalEnabled(I));
  S.Current->enableLocal(I);
  return true;
}
 
inline bool GetLocalEnabled(InterpState &S, uint32_t I) {
  assert(S.Current);
  S.Stk.push<bool>(S.Current->isLocalEnabled(I));
  return true;
}
 
//===----------------------------------------------------------------------===//
// Cast, CastFP
//===----------------------------------------------------------------------===//
 
template <PrimType TIn, PrimType TOut> bool Cast(InterpState &S, CodePtr OpPC) {
  using T = typename PrimConv<TIn>::T;
  using U = typename PrimConv<TOut>::T;
 
  auto In = S.Stk.pop<T>();
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (In.getKind() != IntegralKind::Number &&
        In.getKind() != IntegralKind::AddrLabelDiff) {
      if (!CheckIntegralAddressCast(S, OpPC, U::bitWidth()))
        return Invalid(S, OpPC);
    } else if (In.getKind() == IntegralKind::AddrLabelDiff) {
      // Allow casts of address-of-label differences if they are no-ops
      // or narrowing, if the result is at least 32 bits wide.
      // (The narrowing case isn't actually guaranteed to
      // be constant-evaluatable except in some narrow cases which are hard
      // to detect here.  We let it through on the assumption the user knows
      // what they are doing.)
      if (!(U::bitWidth() >= 32 && U::bitWidth() <= In.bitWidth()))
        return false;
    }
  }
 
  S.Stk.push<U>(U::from(In));
  return true;
}
 
/// 1) Pops a Floating from the stack.
/// 2) Pushes a new floating on the stack that uses the given semantics.
inline bool CastFP(InterpState &S, const llvm::fltSemantics *Sem,
                   llvm::RoundingMode RM) {
  Floating F = S.Stk.pop<Floating>();
  Floating Result = S.allocFloat(*Sem);
  F.toSemantics(Sem, RM, &Result);
  S.Stk.push<Floating>(Result);
  return true;
}
 
inline bool CastFixedPoint(InterpState &S, CodePtr OpPC, uint32_t FPS) {
  FixedPointSemantics TargetSemantics =
      FixedPointSemantics::getFromOpaqueInt(FPS);
  const auto &Source = S.Stk.pop<FixedPoint>();
 
  bool Overflow;
  FixedPoint Result = Source.toSemantics(TargetSemantics, &Overflow);
 
  if (Overflow && !handleFixedPointOverflow(S, OpPC, Result))
    return false;
 
  S.Stk.push<FixedPoint>(Result);
  return true;
}
 
/// Like Cast(), but we cast to an arbitrary-bitwidth integral, so we need
/// to know what bitwidth the result should be.
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool CastAP(InterpState &S, uint32_t BitWidth) {
  T Source = S.Stk.pop<T>();
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (!Source.isNumber())
      return false;
  }
 
  auto Result = S.allocAP<IntegralAP<false>>(BitWidth);
  // Copy data.
  {
    APInt SourceInt = Source.toAPSInt().extOrTrunc(BitWidth);
    Result.copy(SourceInt);
  }
  S.Stk.push<IntegralAP<false>>(Result);
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool CastAPS(InterpState &S, uint32_t BitWidth) {
  T Source = S.Stk.pop<T>();
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (!Source.isNumber())
      return false;
  }
 
  auto Result = S.allocAP<IntegralAP<true>>(BitWidth);
  // Copy data.
  {
    APInt SourceInt = Source.toAPSInt().extOrTrunc(BitWidth);
    Result.copy(SourceInt);
  }
  S.Stk.push<IntegralAP<true>>(Result);
  return true;
}
 
// Cast an AP integer to Sint64 for use as an offsetof array index, failing
// constant evaluation if the value is negative or too large to fit in Sint64
// (i.e. truncation would change the value).
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool CastAPToOffsetIndex(InterpState &S, CodePtr OpPC) {
  T Val = S.Stk.pop<T>();
  if (Val.isNegative() || Val.getActiveBits() > 63)
    return Invalid(S, OpPC);
  S.Stk.push<Integral<64, true>>(
      Integral<64, true>::from(static_cast<uint64_t>(Val)));
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool CastIntegralFloating(InterpState &S, CodePtr OpPC,
                          const llvm::fltSemantics *Sem, uint32_t FPOI) {
  const T &From = S.Stk.pop<T>();
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (!From.isNumber())
      return false;
  }
 
  APSInt FromAP = From.toAPSInt();
 
  FPOptions FPO = FPOptions::getFromOpaqueInt(FPOI);
  Floating Result = S.allocFloat(*Sem);
  auto Status =
      Floating::fromIntegral(FromAP, *Sem, getRoundingMode(FPO), &Result);
  S.Stk.push<Floating>(Result);
 
  return CheckFloatResult(S, OpPC, Result, Status, FPO);
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool CastFloatingIntegral(InterpState &S, CodePtr OpPC, uint32_t FPOI) {
  const Floating &F = S.Stk.pop<Floating>();
 
  if constexpr (std::is_same_v<T, Boolean>) {
    S.Stk.push<T>(T(F.isNonZero()));
    return true;
  } else {
    APSInt Result(std::max(8u, T::bitWidth()),
                  /*IsUnsigned=*/!T::isSigned());
    auto Status = F.convertToInteger(Result);
 
    // Float-to-Integral overflow check.
    if ((Status & APFloat::opStatus::opInvalidOp)) {
      const Expr *E = S.Current->getExpr(OpPC);
      QualType Type = E->getType();
 
      S.CCEDiag(E, diag::note_constexpr_overflow) << F.getAPFloat() << Type;
      if (S.noteUndefinedBehavior()) {
        S.Stk.push<T>(T(Result));
        return true;
      }
      return false;
    }
 
    FPOptions FPO = FPOptions::getFromOpaqueInt(FPOI);
    S.Stk.push<T>(T(Result));
    return CheckFloatResult(S, OpPC, F, Status, FPO);
  }
}
 
inline bool AddrOf(InterpState &S, CodePtr OpPC) {
  const Pointer Ptr = S.Stk.pop<Pointer>();
 
  if (Ptr.isOpaquePointer()) {
    const OpaquePointer &OP = Ptr.asOpaquePointer();
    QualType T = QualType(OP.FieldType.getPointer(), 0);
 
    T = S.getASTContext().getPointerType(T);
    S.Stk.push<Pointer>(OP.withFieldType(T.getTypePtr(), OP.isOnePastEnd()));
  } else {
    S.Stk.push<Pointer>(Ptr);
  }
 
  return true;
}
 
bool CheckPointerToIntegralCast(InterpState &S, CodePtr OpPC,
                                const Pointer &Ptr, unsigned BitWidth);
bool CheckIntegralAddressCast(InterpState &S, CodePtr OpPC, unsigned BitWidth);
bool CastPointerIntegralAP(InterpState &S, CodePtr OpPC, uint32_t BitWidth);
bool CastPointerIntegralAPS(InterpState &S, CodePtr OpPC, uint32_t BitWidth);
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool CastPointerIntegral(InterpState &S, CodePtr OpPC) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (!CheckPointerToIntegralCast(S, OpPC, Ptr, T::bitWidth()))
    return Invalid(S, OpPC);
 
  if constexpr (std::is_same_v<T, Boolean>) {
    S.Stk.push<T>(T::from(Ptr.getIntegerRepresentation()));
  } else if constexpr (isIntegralOrPointer<T>()) {
    if (Ptr.isBlockPointer()) {
      S.Stk.push<T>(IntegralKind::BlockAddress, Ptr.block(), /*Offset=*/0);
    } else if (Ptr.isOpaquePointer()) {
      if (const Expr *BaseExpr = Ptr.asOpaquePointer().getBaseExpr()) {
        IntegralKind Kind = IntegralKind::ExprAddress;
        if (isa<AddrLabelExpr>(BaseExpr))
          Kind = IntegralKind::LabelAddress;
        S.Stk.push<T>(Kind, BaseExpr, 0);
      } else {
        S.Stk.push<T>(IntegralKind::Address,
                      Ptr.asOpaquePointer().Base.asVarDecl(), 0);
      }
 
    } else if (Ptr.isFunctionPointer()) {
      const void *FuncDecl = Ptr.asFunctionPointer().Func->getDecl();
      S.Stk.push<T>(IntegralKind::FunctionAddress, FuncDecl, /*Offset=*/0);
    } else if (Ptr.isStringPointer()) {
      S.Stk.push<T>(IntegralKind::ExprAddress,
                    (const void *)Ptr.asStringPointer().getLiteral(), 0);
    } else {
      S.Stk.push<T>(T::from(Ptr.getIntegerRepresentation()));
    }
  } else {
    S.Stk.push<T>(T::from(Ptr.getIntegerRepresentation()));
  }
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
static inline bool CastIntegralFixedPoint(InterpState &S, CodePtr OpPC,
                                          uint32_t FPS) {
  const T &Int = S.Stk.pop<T>();
 
  FixedPointSemantics Sem = FixedPointSemantics::getFromOpaqueInt(FPS);
 
  bool Overflow;
  FixedPoint Result = FixedPoint::from(Int.toAPSInt(), Sem, &Overflow);
 
  if (Overflow && !handleFixedPointOverflow(S, OpPC, Result))
    return false;
 
  S.Stk.push<FixedPoint>(Result);
  return true;
}
 
static inline bool CastFloatingFixedPoint(InterpState &S, CodePtr OpPC,
                                          uint32_t FPS) {
  const auto &Float = S.Stk.pop<Floating>();
 
  FixedPointSemantics Sem = FixedPointSemantics::getFromOpaqueInt(FPS);
 
  bool Overflow;
  FixedPoint Result = FixedPoint::from(Float.getAPFloat(), Sem, &Overflow);
 
  if (Overflow && !handleFixedPointOverflow(S, OpPC, Result))
    return false;
 
  S.Stk.push<FixedPoint>(Result);
  return true;
}
 
static inline bool CastFixedPointFloating(InterpState &S,
                                          const llvm::fltSemantics *Sem) {
  const auto &Fixed = S.Stk.pop<FixedPoint>();
  Floating Result = S.allocFloat(*Sem);
  Result.copy(Fixed.toFloat(Sem));
  S.Stk.push<Floating>(Result);
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
static inline bool CastFixedPointIntegral(InterpState &S, CodePtr OpPC) {
  const auto &Fixed = S.Stk.pop<FixedPoint>();
 
  bool Overflow;
  APSInt Int = Fixed.toInt(T::bitWidth(), T::isSigned(), &Overflow);
 
  if (Overflow && !handleOverflow(S, OpPC, Int))
    return false;
 
  S.Stk.push<T>(Int);
  return true;
}
 
static inline bool FnPtrCast(InterpState &S, CodePtr OpPC) {
  const SourceInfo &E = S.Current->getSource(OpPC);
  S.CCEDiag(E, diag::note_constexpr_invalid_cast)
      << diag::ConstexprInvalidCastKind::ThisConversionOrReinterpret
      << S.getLangOpts().CPlusPlus << S.Current->getRange(OpPC);
  return true;
}
 
bool PtrPtrCast(InterpState &S, CodePtr OpPC, bool SrcIsVoidPtr,
                const Type *TargetType);
 
//===----------------------------------------------------------------------===//
// Zero, Nullptr
//===----------------------------------------------------------------------===//
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool Zero(InterpState &S) {
  S.Stk.push<T>(T::zero());
  return true;
}
 
static inline bool ZeroIntAP(InterpState &S, uint32_t BitWidth) {
  auto Result = S.allocAP<IntegralAP<false>>(BitWidth);
  if (!Result.singleWord())
    std::memset(Result.Memory, 0, Result.numWords() * sizeof(uint64_t));
  S.Stk.push<IntegralAP<false>>(Result);
  return true;
}
 
static inline bool ZeroIntAPS(InterpState &S, uint32_t BitWidth) {
  auto Result = S.allocAP<IntegralAP<true>>(BitWidth);
  if (!Result.singleWord())
    std::memset(Result.Memory, 0, Result.numWords() * sizeof(uint64_t));
  S.Stk.push<IntegralAP<true>>(Result);
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool Null(InterpState &S, uint64_t Value, const Type *Ty) {
  // FIXME(perf): This is a somewhat often-used function and the value of a
  // null pointer is almost always 0.
  if constexpr (std::is_same_v<T, Pointer>)
    S.Stk.push<T>(Value, Ty, /*Offset=*/0, /*IsNull=*/true);
  else
    S.Stk.push<T>(Value, Ty);
  return true;
}
 
inline bool CastAddressSpace(InterpState &S, CodePtr OpPC, uint64_t Value,
                             const Type *Ty) {
  const Pointer Ptr = S.Stk.pop<Pointer>();
  if (Ptr.isZero())
    S.Stk.push<Pointer>(Value, Ty);
  else
    S.Stk.push<Pointer>(Ptr);
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool IsNonNull(InterpState &S) {
  const auto &P = S.Stk.pop<T>();
  if (P.isWeak())
    return false;
  S.Stk.push<Boolean>(Boolean::from(!P.isZero()));
  return true;
}
 
//===----------------------------------------------------------------------===//
// This, ImplicitThis
//===----------------------------------------------------------------------===//
 
inline bool This(InterpState &S, CodePtr OpPC) {
  // Cannot read 'this' in this mode.
  if (S.checkingPotentialConstantExpression())
    return false;
  if (!CheckThis(S, OpPC))
    return false;
  const Pointer &This = S.Current->getThis();
 
  // Ensure the This pointer has been cast to the correct base.
  if (!This.isDummy()) {
    assert(isa<CXXMethodDecl>(S.Current->getFunction()->getDecl()));
    if (!This.isTypeidPointer()) {
      [[maybe_unused]] const Record *R = This.getRecord();
      if (!R)
        R = This.narrow().getRecord();
      if (!R)
        return false;
      assert(R->getDecl() ==
             cast<CXXMethodDecl>(S.Current->getFunction()->getDecl())
                 ->getParent());
    }
  }
 
  S.Stk.push<Pointer>(This);
  return true;
}
 
inline bool RVOPtr(InterpState &S) {
  assert(S.Current->getFunction()->hasRVO());
  if (S.checkingPotentialConstantExpression())
    return false;
  S.Stk.push<Pointer>(S.Current->getRVOPtr());
  return true;
}
 
//===----------------------------------------------------------------------===//
// Shr, Shl
//===----------------------------------------------------------------------===//
 
template <class LT, class RT, ShiftDir Dir>
inline bool DoShift(InterpState &S, CodePtr OpPC, LT &LHS, RT &RHS,
                    LT *Result) {
  static_assert(!needsAlloc<LT>());
  const unsigned Bits = LHS.bitWidth();
 
  // OpenCL 6.3j: shift values are effectively % word size of LHS.
  if (S.getLangOpts().OpenCL)
    RT::bitAnd(RHS, RT::from(LHS.bitWidth() - 1, RHS.bitWidth()),
               RHS.bitWidth(), &RHS);
 
  if (RHS.isNegative()) {
    // During constant-folding, a negative shift is an opposite shift. Such a
    // shift is not a constant expression.
    const SourceInfo &Loc = S.Current->getSource(OpPC);
    S.CCEDiag(Loc, diag::note_constexpr_negative_shift) << RHS.toAPSInt();
    if (!S.noteUndefinedBehavior())
      return false;
 
    RHS = RHS.isMin() ? RT(APSInt::getMaxValue(RHS.bitWidth(), false)) : -RHS;
 
    return DoShift<LT, RT,
                   Dir == ShiftDir::Left ? ShiftDir::Right : ShiftDir::Left>(
        S, OpPC, LHS, RHS, Result);
  }
 
  if (!CheckShift<Dir>(S, OpPC, LHS, RHS, Bits))
    return false;
 
  // Limit the shift amount to Bits - 1. If this happened,
  // it has already been diagnosed by CheckShift() above,
  // but we still need to handle it.
  // Note that we have to be extra careful here since we're doing the shift in
  // any case, but we need to adjust the shift amount or the way we do the shift
  // for the potential error cases.
  typename LT::AsUnsigned R;
  unsigned MaxShiftAmount = LHS.bitWidth() - 1;
  if constexpr (Dir == ShiftDir::Left) {
    if (Compare(RHS, RT::from(MaxShiftAmount, RHS.bitWidth())) ==
        ComparisonCategoryResult::Greater) {
      if (LHS.isNegative())
        R = LT::AsUnsigned::zero(LHS.bitWidth());
      else {
        RHS = RT::from(LHS.countLeadingZeros(), RHS.bitWidth());
        LT::AsUnsigned::shiftLeft(LT::AsUnsigned::from(LHS),
                                  LT::AsUnsigned::from(RHS, Bits), Bits, &R);
      }
    } else if (LHS.isNegative()) {
      if (LHS.isMin()) {
        R = LT::AsUnsigned::zero(LHS.bitWidth());
      } else {
        // If the LHS is negative, perform the cast and invert the result.
        typename LT::AsUnsigned LHSU = LT::AsUnsigned::from(-LHS);
        LT::AsUnsigned::shiftLeft(LHSU, LT::AsUnsigned::from(RHS, Bits), Bits,
                                  &R);
        R = -R;
      }
    } else {
      // The good case, a simple left shift.
      LT::AsUnsigned::shiftLeft(LT::AsUnsigned::from(LHS),
                                LT::AsUnsigned::from(RHS, Bits), Bits, &R);
    }
    S.Stk.push<LT>(LT::from(R));
    return true;
  }
 
  // Right shift.
  if (Compare(RHS, RT::from(MaxShiftAmount, RHS.bitWidth())) ==
      ComparisonCategoryResult::Greater) {
    R = LT::AsUnsigned::from(0);
  } else {
    // Do the shift on potentially signed LT, then convert to unsigned type.
    LT A;
    LT::shiftRight(LHS, LT::from(RHS, Bits), Bits, &A);
    R = LT::AsUnsigned::from(A);
  }
 
  S.Stk.push<LT>(LT::from(R));
  return true;
}
 
/// A version of DoShift that works on IntegralAP.
template <class LT, class RT, ShiftDir Dir>
inline bool DoShiftAP(InterpState &S, CodePtr OpPC, const APSInt &LHS,
                      APSInt RHS, LT *Result) {
  const unsigned Bits = LHS.getBitWidth();
 
  // OpenCL 6.3j: shift values are effectively % word size of LHS.
  if (S.getLangOpts().OpenCL)
    RHS &=
        APSInt(llvm::APInt(RHS.getBitWidth(), static_cast<uint64_t>(Bits - 1)),
               RHS.isUnsigned());
 
  if (RHS.isNegative()) {
    // During constant-folding, a negative shift is an opposite shift. Such a
    // shift is not a constant expression.
    const SourceInfo &Loc = S.Current->getSource(OpPC);
    S.CCEDiag(Loc, diag::note_constexpr_negative_shift) << RHS; //.toAPSInt();
    if (!S.noteUndefinedBehavior())
      return false;
    return DoShiftAP<LT, RT,
                     Dir == ShiftDir::Left ? ShiftDir::Right : ShiftDir::Left>(
        S, OpPC, LHS, -(RHS.extend(RHS.getBitWidth() + 1)), Result);
  }
 
  if (!CheckShift<Dir>(S, OpPC, static_cast<LT>(LHS), static_cast<RT>(RHS),
                       Bits))
    return false;
 
  unsigned SA = (unsigned)RHS.getLimitedValue(Bits - 1);
  if constexpr (Dir == ShiftDir::Left) {
    if constexpr (needsAlloc<LT>())
      Result->copy(LHS << SA);
    else
      *Result = LT(LHS << SA);
  } else {
    if constexpr (needsAlloc<LT>())
      Result->copy(LHS >> SA);
    else
      *Result = LT(LHS >> SA);
  }
 
  S.Stk.push<LT>(*Result);
  return true;
}
 
template <PrimType NameL, PrimType NameR>
inline bool Shr(InterpState &S, CodePtr OpPC) {
  using LT = typename PrimConv<NameL>::T;
  using RT = typename PrimConv<NameR>::T;
  auto RHS = S.Stk.pop<RT>();
  auto LHS = S.Stk.pop<LT>();
 
  if constexpr (needsAlloc<LT>() || needsAlloc<RT>()) {
    LT Result;
    if constexpr (needsAlloc<LT>())
      Result = S.allocAP<LT>(LHS.bitWidth());
    return DoShiftAP<LT, RT, ShiftDir::Right>(S, OpPC, LHS.toAPSInt(),
                                              RHS.toAPSInt(), &Result);
  } else {
    LT Result;
    return DoShift<LT, RT, ShiftDir::Right>(S, OpPC, LHS, RHS, &Result);
  }
}
 
template <PrimType NameL, PrimType NameR>
inline bool Shl(InterpState &S, CodePtr OpPC) {
  using LT = typename PrimConv<NameL>::T;
  using RT = typename PrimConv<NameR>::T;
  auto RHS = S.Stk.pop<RT>();
  auto LHS = S.Stk.pop<LT>();
 
  if constexpr (needsAlloc<LT>() || needsAlloc<RT>()) {
    LT Result;
    if constexpr (needsAlloc<LT>())
      Result = S.allocAP<LT>(LHS.bitWidth());
    return DoShiftAP<LT, RT, ShiftDir::Left>(S, OpPC, LHS.toAPSInt(),
                                             RHS.toAPSInt(), &Result);
  } else {
    LT Result;
    return DoShift<LT, RT, ShiftDir::Left>(S, OpPC, LHS, RHS, &Result);
  }
}
 
static inline bool ShiftFixedPoint(InterpState &S, CodePtr OpPC, bool Left) {
  const auto &RHS = S.Stk.pop<FixedPoint>();
  const auto &LHS = S.Stk.pop<FixedPoint>();
  llvm::FixedPointSemantics LHSSema = LHS.getSemantics();
 
  unsigned ShiftBitWidth =
      LHSSema.getWidth() - (unsigned)LHSSema.hasUnsignedPadding() - 1;
 
  // Embedded-C 4.1.6.2.2:
  //   The right operand must be nonnegative and less than the total number
  //   of (nonpadding) bits of the fixed-point operand ...
  if (RHS.isNegative()) {
    S.CCEDiag(S.Current->getLocation(OpPC), diag::note_constexpr_negative_shift)
        << RHS.toAPSInt();
  } else if (static_cast<unsigned>(RHS.toAPSInt().getLimitedValue(
                 ShiftBitWidth)) != RHS.toAPSInt()) {
    const Expr *E = S.Current->getExpr(OpPC);
    S.CCEDiag(E, diag::note_constexpr_large_shift)
        << RHS.toAPSInt() << E->getType() << ShiftBitWidth;
  }
 
  FixedPoint Result;
  if (Left) {
    if (FixedPoint::shiftLeft(LHS, RHS, ShiftBitWidth, &Result) &&
        !handleFixedPointOverflow(S, OpPC, Result))
      return false;
  } else {
    if (FixedPoint::shiftRight(LHS, RHS, ShiftBitWidth, &Result) &&
        !handleFixedPointOverflow(S, OpPC, Result))
      return false;
  }
 
  S.Stk.push<FixedPoint>(Result);
  return true;
}
 
//===----------------------------------------------------------------------===//
// NoRet
//===----------------------------------------------------------------------===//
PRESERVE_NONE inline bool NoRet(InterpState &S) {
  SourceLocation EndLoc = S.Current->getCallee()->getEndLoc();
  S.FFDiag(EndLoc, diag::note_constexpr_no_return);
  return false;
}
 
//===----------------------------------------------------------------------===//
// NarrowPtr, ExpandPtr
//===----------------------------------------------------------------------===//
 
inline bool NarrowPtr(InterpState &S) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  S.Stk.push<Pointer>(Ptr.narrow());
  return true;
}
 
inline bool ExpandPtr(InterpState &S) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
  if (Ptr.isBlockPointer())
    S.Stk.push<Pointer>(Ptr.expand());
  else
    S.Stk.push<Pointer>(Ptr);
  return true;
}
 
// Implementation for ArrayElemPtr and ArrayElemPtrPop ops.
template <typename T>
inline bool arrayElemPtr(InterpState &S, CodePtr OpPC, const Pointer &Ptr,
                         const T &Offset) {
  if (Ptr.isOpaquePointer()) {
    if (S.inConstantContext() && !Offset.isZero() &&
        !CheckArray(S, OpPC, Ptr)) {
      return false;
    }
    return arrayElemPtrOpaque(S, OpPC, Ptr, Offset.toAPSInt());
  }
 
  if (Offset.isZero()) {
    if (const Descriptor *Desc = Ptr.getFieldDesc();
        Desc && Desc->isArray() && Ptr.getIndex() == 0) {
      S.Stk.push<Pointer>(Ptr.atIndex(0).narrow());
      return true;
    }
    S.Stk.push<Pointer>(Ptr.narrow());
    return true;
  }
 
  assert(!Offset.isZero());
 
  if (std::optional<Pointer> Result =
          OffsetHelper<T, ArithOp::Add>(S, OpPC, Offset, Ptr)) {
    S.Stk.push<Pointer>(Result->narrow());
    return true;
  }
  return false;
}
 
// 1) Pops an integral value from the stack
// 2) Peeks a pointer
// 3) Pushes a new pointer that's a narrowed array
//   element of the peeked pointer with the value
//   from 1) added as offset.
//
// This leaves the original pointer on the stack and pushes a new one
// with the offset applied and narrowed.
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool ArrayElemPtr(InterpState &S, CodePtr OpPC) {
  const T &Offset = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.peek<Pointer>();
 
  return arrayElemPtr<T>(S, OpPC, Ptr, Offset);
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool ArrayElemPtrPop(InterpState &S, CodePtr OpPC) {
  const T &Offset = S.Stk.pop<T>();
  const Pointer &Ptr = S.Stk.pop<Pointer>();
 
  return arrayElemPtr<T>(S, OpPC, Ptr, Offset);
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool ArrayElem(InterpState &S, CodePtr OpPC, uint32_t Index) {
  const Pointer &Ptr = S.Stk.peek<Pointer>();
 
  if (!CheckLoad(S, OpPC, Ptr))
    return false;
 
  assert(Ptr.atIndex(Index).getFieldDesc()->getPrimType() == Name);
  S.Stk.push<T>(Ptr.elem<T>(Index));
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool ArrayElemPop(InterpState &S, CodePtr OpPC, uint32_t Index) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
 
  if (!CheckLoad(S, OpPC, Ptr))
    return false;
 
  assert(Ptr.atIndex(Index).getFieldDesc()->getPrimType() == Name);
  S.Stk.push<T>(Ptr.elem<T>(Index));
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool CopyArray(InterpState &S, CodePtr OpPC, uint32_t SrcIndex,
                      uint32_t DestIndex, uint32_t Size) {
  const auto &SrcPtr = S.Stk.pop<Pointer>();
  const auto &DestPtr = S.Stk.peek<Pointer>();
 
  if (SrcPtr.isDummy() || DestPtr.isDummy())
    return false;
 
  if (!SrcPtr.isBlockPointer() || !DestPtr.isBlockPointer())
    return false;
 
  const Descriptor *SrcDesc = SrcPtr.getFieldDesc();
  const Descriptor *DestDesc = DestPtr.getFieldDesc();
  if (!SrcDesc->isPrimitiveArray() || !DestDesc->isPrimitiveArray() ||
      SrcDesc->getPrimType() != Name || DestDesc->getPrimType() != Name)
    return false;
 
  for (uint32_t I = 0; I != Size; ++I) {
    PtrView SP = SrcPtr.view().atIndex(SrcIndex + I);
 
    if (!CheckLoad(S, OpPC, SP))
      return false;
 
    DestPtr.elem<T>(DestIndex + I) = SrcPtr.elem<T>(SrcIndex + I);
    DestPtr.initializeElement(DestIndex + I);
  }
  return true;
}
 
/// Just takes a pointer and checks if it's an incomplete
/// array type.
inline bool ArrayDecay(InterpState &S, CodePtr OpPC) {
  const Pointer &Ptr = S.Stk.pop<Pointer>();
 
  if (Ptr.isZero()) {
    S.Stk.push<Pointer>(Ptr);
    return true;
  }
 
  if (!Ptr.isZeroSizeArray()) {
    if (!CheckRange(S, OpPC, Ptr, CSK_ArrayToPointer))
      return false;
  }
 
  if (Ptr.isRoot() || !Ptr.isUnknownSizeArray() || !S.inConstantContext()) {
    if (Ptr.isBlockPointer()) {
      if (!Ptr.isArrayRoot())
        return false;
      S.Stk.push<Pointer>(Ptr.atIndex(0).narrow());
      return true;
    }
 
    if (Ptr.isStringPointer()) {
      S.Stk.push<Pointer>(Ptr.asStringPointer().decay());
      return true;
    }
 
    if (!Ptr.isOpaquePointer()) {
      S.Stk.push<Pointer>(Ptr);
      return true;
    }
 
    const OpaquePointer &OP = Ptr.asOpaquePointer();
    if (!OP.getFieldType()->isArrayType()) {
      S.Stk.push<Pointer>(Ptr);
      return true;
    }
 
    if (OP.isUnknownSizeArray() && OP.PathLength != 0) {
      S.FFDiag(S.Current->getSource(OpPC),
               diag::note_constexpr_unsupported_unsized_array);
      S.Stk.push<Pointer>(Ptr);
      return true;
    }
 
    return arrayElemPtrOpaque(S, OpPC, Ptr,
                              APSInt(APInt::getZero(1), /*IsUnsigned=*/true),
                              /*AllowReplace=*/false);
  }
 
  S.FFDiag(S.Current->getSource(OpPC),
           diag::note_constexpr_unsupported_unsized_array);
  return false;
}
 
inline bool GetFnPtr(InterpState &S, const Function *Func) {
  assert(Func);
  S.Stk.push<Pointer>(Func);
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool GetIntPtr(InterpState &S, CodePtr OpPC, const Type *Ty) {
  const T &IntVal = S.Stk.pop<T>();
 
  S.CCEDiag(S.Current->getSource(OpPC), diag::note_constexpr_invalid_cast)
      << diag::ConstexprInvalidCastKind::ThisConversionOrReinterpret
      << S.getLangOpts().CPlusPlus;
 
  if constexpr (isIntegralOrPointer<T>()) {
    if (IntVal.getKind() == IntegralKind::Address) {
      if (IntVal.getOffset() != 0)
        return Invalid(S, OpPC);
      const VarDecl *VD = (const VarDecl *)IntVal.getPtr();
      unsigned GlobalIndex = *S.P.getOrCreateGlobal(VD);
      S.Stk.push<Pointer>(S.P.getGlobal(GlobalIndex));
    } else if (IntVal.getKind() == IntegralKind::BlockAddress) {
      if (IntVal.getOffset() != 0)
        return Invalid(S, OpPC);
 
      const Block *B = (const Block *)IntVal.getPtr();
      S.Stk.push<Pointer>(const_cast<Block *>(B));
    } else if (IntVal.getKind() == IntegralKind::FunctionAddress) {
      const Function *F =
          S.P.getFunction((const FunctionDecl *)IntVal.getPtr());
      S.Stk.push<Pointer>(F, IntVal.getOffset());
    } else {
      uint64_t NullValue =
          S.getASTContext().getTargetNullPointerValue(QualType(Ty, 0));
      S.Stk.push<Pointer>(static_cast<uint64_t>(IntVal), Ty, 0,
                          static_cast<uint64_t>(IntVal) == NullValue);
    }
  } else {
    S.Stk.push<Pointer>(static_cast<uint64_t>(IntVal), Ty);
  }
 
  return true;
}
 
inline bool GetStringPtr(InterpState &S, const Expr *Base) {
  S.Stk.push<Pointer>(Base, S.newStringID());
  return true;
}
 
bool GetMemberPtr(InterpState &S, const ValueDecl *D);
bool GetMemberPtrBase(InterpState &S);
bool GetMemberPtrDecl(InterpState &S);
bool CopyMemberPtrPath(InterpState &S, const RecordDecl *Entry, bool IsDerived);
 
/// Just emit a diagnostic. The expression that caused emission of this
/// op is not valid in a constant context.
 
inline bool Unsupported(InterpState &S, CodePtr OpPC) {
  const SourceLocation &Loc = S.Current->getLocation(OpPC);
  S.FFDiag(Loc, diag::note_constexpr_stmt_expr_unsupported)
      << S.Current->getRange(OpPC);
  return false;
}
 
inline bool InvalidTargetLabel(InterpState &S, CodePtr OpPC, bool IsContinue) {
  S.FFDiag(S.Current->getLocation(OpPC),
           diag::note_break_continue_label_outside_context)
      << S.Current->getRange(OpPC) << IsContinue;
  return false;
}
 
inline bool PushIgnoreDiags(InterpState &S) {
  ++S.DiagIgnoreDepth;
  if (S.DiagIgnoreDepth != 1)
    return true;
  assert(S.PrevDiags == nullptr);
  S.PrevDiags = S.getEvalStatus().Diag;
  S.PrevDiagsEmitted = S.getEvalStatus().DiagEmitted;
  S.getEvalStatus().Diag = nullptr;
  assert(!S.diagnosing());
  return true;
}
 
inline bool PopIgnoreDiags(InterpState &S) {
  assert(S.DiagIgnoreDepth != 0);
  --S.DiagIgnoreDepth;
  if (S.DiagIgnoreDepth == 0) {
    S.getEvalStatus().Diag = S.PrevDiags;
    S.getEvalStatus().DiagEmitted = S.PrevDiagsEmitted;
    S.PrevDiags = nullptr;
  }
  return true;
}
 
inline bool StartSpeculation(InterpState &S) {
#ifndef NDEBUG
  ++S.SpeculationDepth;
#endif
  return true;
}
 
inline bool StartInit(InterpState &S) {
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  S.InitializingPtrs.push_back(Ptr.view());
  return true;
}
 
inline bool StartFieldInit(InterpState &S, uint32_t FieldOffset) {
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  S.InitializingPtrs.push_back(Ptr.view().atField(FieldOffset));
  return true;
}
 
inline bool EndInit(InterpState &S) {
  S.InitializingPtrs.pop_back();
  return true;
}
 
// This is special-cased in the tablegen opcode emitter.
// Its dispatch function will NOT call InterpNext
// and instead simply return true.
PRESERVE_NONE inline bool EndSpeculation(InterpState &S) {
#ifndef NDEBUG
  assert(S.SpeculationDepth != 0);
  --S.SpeculationDepth;
#endif
  return true;
}
 
inline bool PushCC(InterpState &S, bool Value) {
  S.ConstantContextOverride = Value;
  return true;
}
inline bool PopCC(InterpState &S) {
  S.ConstantContextOverride = std::nullopt;
  return true;
}
 
inline bool PushMSVCCE(InterpState &S) {
  // This is a per-frame property.
  ++S.Current->MSVCConstexprAllowed;
  return true;
}
 
inline bool PopMSVCCE(InterpState &S) {
  assert(S.Current->MSVCConstexprAllowed >= 1);
  // This is a per-frame property.
  --S.Current->MSVCConstexprAllowed;
  return true;
}
 
/// Do nothing and just abort execution.
inline bool Error(InterpState &S) { return false; }
 
inline bool SideEffect(InterpState &S) { return S.noteSideEffect(); }
 
/// Abort without a diagnostic if we're checking for a potential constant
/// expression and this is not the bottom frame. This is used in constructors to
/// allow evaluating their initializers but abort if we encounter anything in
/// their body.
inline bool CtorCheck(InterpState &S) {
  if (S.checkingPotentialConstantExpression() && !S.Current->isBottomFrame())
    return false;
  return true;
}
 
inline bool InvalidStore(InterpState &S, CodePtr OpPC, const Type *T) {
  if (S.getLangOpts().CPlusPlus) {
    QualType VolatileType = QualType(T, 0).withVolatile();
    S.FFDiag(S.Current->getSource(OpPC),
             diag::note_constexpr_access_volatile_type)
        << AK_Assign << VolatileType;
  } else {
    S.FFDiag(S.Current->getSource(OpPC));
  }
  return false;
}
 
inline bool SizelessVectorElementSize(InterpState &S, CodePtr OpPC) {
  if (S.inConstantContext()) {
    const SourceRange &ArgRange = S.Current->getRange(OpPC);
    const Expr *E = S.Current->getExpr(OpPC);
    S.CCEDiag(E, diag::note_constexpr_non_const_vectorelements) << ArgRange;
  }
  return false;
}
 
inline bool CheckPseudoDtor(InterpState &S, CodePtr OpPC) {
  if (!S.getLangOpts().CPlusPlus20)
    S.CCEDiag(S.Current->getSource(OpPC),
              diag::note_constexpr_pseudo_destructor);
  return true;
}
 
inline bool Assume(InterpState &S, CodePtr OpPC) {
  const auto Val = S.Stk.pop<Boolean>();
 
  if (Val)
    return true;
 
  // Else, diagnose.
  const SourceLocation &Loc = S.Current->getLocation(OpPC);
  S.CCEDiag(Loc, diag::note_constexpr_assumption_failed);
  return false;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool OffsetOf(InterpState &S, CodePtr OpPC, const OffsetOfExpr *E) {
  llvm::SmallVector<int64_t> ArrayIndices;
  for (size_t I = 0; I != E->getNumExpressions(); ++I)
    ArrayIndices.emplace_back(
        static_cast<int64_t>(S.Stk.pop<Integral<64, true>>()));
 
  int64_t Result;
  if (!InterpretOffsetOf(S, OpPC, E, ArrayIndices, Result))
    return false;
 
  S.Stk.push<T>(T::from(Result));
 
  return true;
}
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool CheckNonNullArg(InterpState &S, CodePtr OpPC) {
  const T &Arg = S.Stk.peek<T>();
  if (!Arg.isZero())
    return true;
 
  const SourceLocation &Loc = S.Current->getLocation(OpPC);
  S.CCEDiag(Loc, diag::note_non_null_attribute_failed);
 
  return false;
}
 
void diagnoseEnumValue(InterpState &S, CodePtr OpPC, const EnumDecl *ED,
                       const APSInt &Value);
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool CheckEnumValue(InterpState &S, CodePtr OpPC, const EnumDecl *ED) {
  assert(ED);
  assert(!ED->isFixed());
 
  if (S.inConstantContext()) {
    const APSInt Val = S.Stk.peek<T>().toAPSInt();
    diagnoseEnumValue(S, OpPC, ED, Val);
  }
  return true;
}
 
/// OldPtr -> Integer -> NewPtr.
template <PrimType TIn, PrimType TOut> inline bool DecayPtr(InterpState &S) {
  static_assert(isPtrType(TIn) && isPtrType(TOut));
  using FromT = typename PrimConv<TIn>::T;
  using ToT = typename PrimConv<TOut>::T;
 
  const FromT &OldPtr = S.Stk.pop<FromT>();
 
  if constexpr (std::is_same_v<FromT, FunctionPointer> &&
                std::is_same_v<ToT, Pointer>) {
    S.Stk.push<Pointer>(OldPtr.getFunction(), OldPtr.getOffset());
    return true;
  } else if constexpr (std::is_same_v<FromT, Pointer> &&
                       std::is_same_v<ToT, FunctionPointer>) {
    if (OldPtr.isFunctionPointer()) {
      S.Stk.push<FunctionPointer>(OldPtr.asFunctionPointer().getFunction(),
                                  OldPtr.getByteOffset());
      return true;
    }
  }
 
  S.Stk.push<ToT>(ToT(OldPtr.getIntegerRepresentation(), nullptr));
  return true;
}
 
inline bool CheckDecl(InterpState &S, const VarDecl *VD) {
  // An expression E is a core constant expression unless the evaluation of E
  // would evaluate one of the following: [C++23] - a control flow that passes
  // through a declaration of a variable with static or thread storage duration
  // unless that variable is usable in constant expressions.
  assert(VD->isLocalVarDecl() &&
         VD->isStaticLocal()); // Checked before emitting this.
 
  if (VD == S.EvaluatingDecl)
    return true;
 
  if (!VD->isUsableInConstantExpressions(S.getASTContext())) {
    S.CCEDiag(VD->getLocation(), diag::note_constexpr_static_local)
        << (VD->getTSCSpec() == TSCS_unspecified ? 0 : 1) << VD;
    return false;
  }
  return true;
}
 
/// Check if the destination array we're initializing can hold the \p NumElems
/// elements.
inline bool CheckArrayDestSize(InterpState &S, CodePtr OpPC, size_t NumElems) {
  if (!CheckArraySize(S, OpPC, NumElems))
    return false;
 
  const Pointer &Ptr = S.Stk.peek<Pointer>();
  if (!Ptr.isUnknownSizeArray() && NumElems > Ptr.getNumElems()) {
    S.FFDiag(S.Current->getSource(OpPC), diag::note_constexpr_new_too_small)
        << Ptr.getNumElems() << NumElems;
    return false;
  }
 
  return true;
}
 
inline bool Alloc(InterpState &S, CodePtr OpPC, const Descriptor *Desc) {
  assert(Desc);
 
  if (!CheckDynamicMemoryAllocation(S, OpPC))
    return false;
 
  DynamicAllocator &Allocator = S.getAllocator();
  Block *B =
      Allocator.allocate(Desc, S.EvalID, DynamicAllocator::Form::NonArray);
  assert(B);
  S.Stk.push<Pointer>(B);
  return true;
}
 
template <PrimType Name, class SizeT = typename PrimConv<Name>::T>
inline bool AllocN(InterpState &S, CodePtr OpPC, PrimType T, const Expr *Source,
                   bool IsNoThrow) {
  if (!CheckDynamicMemoryAllocation(S, OpPC))
    return false;
 
  SizeT NumElements = S.Stk.pop<SizeT>();
  if (!CheckArraySize(S, OpPC, NumElements, primSize(T), IsNoThrow)) {
    if (!IsNoThrow)
      return false;
 
    // If this failed and is nothrow, just return a null ptr.
    S.Stk.push<Pointer>();
    return true;
  }
  if (NumElements.isNegative()) {
    if (!IsNoThrow) {
      S.FFDiag(S.Current->getSource(OpPC), diag::note_constexpr_new_negative)
          << NumElements.toDiagnosticString(S.getASTContext());
      return false;
    }
    S.Stk.push<Pointer>();
    return true;
  }
 
  if (!CheckArraySize(S, OpPC, static_cast<uint64_t>(NumElements)))
    return false;
 
  DynamicAllocator &Allocator = S.getAllocator();
  Block *B = Allocator.allocate(Source, T, static_cast<size_t>(NumElements),
                                S.EvalID, DynamicAllocator::Form::Array);
  assert(B);
  if (NumElements.isZero())
    S.Stk.push<Pointer>(B);
  else
    S.Stk.push<Pointer>(Pointer(B).atIndex(0));
  return true;
}
 
template <PrimType Name, class SizeT = typename PrimConv<Name>::T>
inline bool AllocCN(InterpState &S, CodePtr OpPC, const Descriptor *ElementDesc,
                    bool IsNoThrow) {
  if (!CheckDynamicMemoryAllocation(S, OpPC))
    return false;
 
  if (!ElementDesc)
    return false;
 
  SizeT NumElements = S.Stk.pop<SizeT>();
  if (!CheckArraySize(S, OpPC, NumElements, ElementDesc->getSize(),
                      IsNoThrow)) {
    if (!IsNoThrow)
      return false;
 
    // If this failed and is nothrow, just return a null ptr.
    S.Stk.push<Pointer>(0, ElementDesc->getType().getTypePtr(), 0,
                        /*IsNull=*/true);
    return true;
  }
  if (NumElements.isNegative()) {
    if (!IsNoThrow) {
      S.FFDiag(S.Current->getSource(OpPC), diag::note_constexpr_new_negative)
          << NumElements.toDiagnosticString(S.getASTContext());
      return false;
    }
    S.Stk.push<Pointer>();
    return true;
  }
 
  if (!CheckArraySize(S, OpPC, static_cast<uint64_t>(NumElements)))
    return false;
 
  DynamicAllocator &Allocator = S.getAllocator();
  Block *B = Allocator.allocate(ElementDesc, static_cast<size_t>(NumElements),
                                S.EvalID, DynamicAllocator::Form::Array);
  assert(B);
  if (NumElements.isZero())
    S.Stk.push<Pointer>(B);
  else
    S.Stk.push<Pointer>(Pointer(B).atIndex(0));
 
  return true;
}
 
bool Free(InterpState &S, CodePtr OpPC, bool DeleteIsArrayForm,
          bool IsGlobalDelete);
 
static inline bool IsConstantContext(InterpState &S) {
  S.Stk.push<Boolean>(Boolean::from(S.inConstantContext()));
  return true;
}
 
static inline bool CheckAllocations(InterpState &S) {
  return S.maybeDiagnoseDanglingAllocations();
}
 
/// Check if the initializer and storage types of a placement-new expression
/// match.
bool CheckNewTypeMismatch(InterpState &S, CodePtr OpPC, const Expr *E,
                          std::optional<uint64_t> ArraySize = std::nullopt);
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
bool CheckNewTypeMismatchArray(InterpState &S, CodePtr OpPC, const Expr *E) {
  const auto &Size = S.Stk.pop<T>();
  return CheckNewTypeMismatch(S, OpPC, E, static_cast<uint64_t>(Size));
}
bool InvalidNewDeleteExpr(InterpState &S, CodePtr OpPC, const Expr *E);
bool CheckPlacementNew(InterpState &S, CodePtr OpPC, const Expr *E);
 
template <PrimType Name, class T = typename PrimConv<Name>::T>
inline bool BitCastPrim(InterpState &S, CodePtr OpPC, bool TargetIsUCharOrByte,
                        uint32_t ResultBitWidth, const llvm::fltSemantics *Sem,
                        const Type *TargetType) {
  const Pointer &FromPtr = S.Stk.pop<Pointer>();
 
  if (!CheckLoad(S, OpPC, FromPtr))
    return false;
 
  if constexpr (std::is_same_v<T, Pointer>) {
    if (!TargetType->isNullPtrType()) {
      S.FFDiag(S.Current->getSource(OpPC),
               diag::note_constexpr_bit_cast_invalid_type)
          << /*IsToType=*/true << /*IsReference=*/false << 1 /*Pointer*/;
      return false;
    }
    // The only pointer type we can validly bitcast to is nullptr_t.
    S.Stk.push<Pointer>();
    return true;
  } else if constexpr (std::is_same_v<T, MemberPointer>) {
    S.FFDiag(S.Current->getSource(OpPC),
             diag::note_constexpr_bit_cast_invalid_type)
        << /*IsToType=*/true << /*IsReference=*/false << 2 /*MemberPointer*/;
    return false;
  } else {
 
    size_t BuffSize = ResultBitWidth / 8;
    llvm::SmallVector<std::byte> Buff(BuffSize);
    bool HasIndeterminateBits = false;
 
    Bits FullBitWidth(ResultBitWidth);
    Bits BitWidth = FullBitWidth;
 
    if constexpr (std::is_same_v<T, Floating>) {
      assert(Sem);
      BitWidth = Bits(llvm::APFloatBase::getSizeInBits(*Sem));
    }
 
    if (!DoBitCast(S, OpPC, FromPtr, Buff.data(), BitWidth, FullBitWidth,
                   HasIndeterminateBits))
      return false;
 
    if (!CheckBitCast(S, OpPC, HasIndeterminateBits, TargetIsUCharOrByte))
      return false;
 
    if constexpr (std::is_same_v<T, Floating>) {
      assert(Sem);
      Floating Result = S.allocFloat(*Sem);
      Floating::bitcastFromMemory(Buff.data(), *Sem, &Result);
      S.Stk.push<Floating>(Result);
    } else if constexpr (needsAlloc<T>()) {
      T Result = S.allocAP<T>(ResultBitWidth);
      T::bitcastFromMemory(Buff.data(), ResultBitWidth, &Result);
      S.Stk.push<T>(Result);
    } else if constexpr (std::is_same_v<T, Boolean>) {
      // Only allow to cast single-byte integers to bool if they are either 0
      // or 1.
      assert(FullBitWidth.getQuantity() == 8);
      auto Val = static_cast<unsigned int>(Buff[0]);
      if (Val > 1) {
        S.FFDiag(S.Current->getSource(OpPC),
                 diag::note_constexpr_bit_cast_unrepresentable_value)
            << S.getASTContext().BoolTy << Val;
        return false;
      }
      S.Stk.push<T>(T::bitcastFromMemory(Buff.data(), ResultBitWidth));
    } else {
      assert(!Sem);
      S.Stk.push<T>(T::bitcastFromMemory(Buff.data(), ResultBitWidth));
    }
    return true;
  }
}
 
inline bool BitCast(InterpState &S, CodePtr OpPC) {
  Pointer FromPtr = S.Stk.pop<Pointer>();
  Pointer &ToPtr = S.Stk.peek<Pointer>();
 
  // FIXME: Could allow reading from string pointers?
  if (!FromPtr.isBlockPointer() || !ToPtr.isBlockPointer())
    return false;
 
  const Descriptor *D = FromPtr.getFieldDesc();
  if (D->isPrimitiveArray() && FromPtr.isArrayRoot())
    FromPtr = FromPtr.atIndex(0);
 
  if (!CheckLoad(S, OpPC, FromPtr))
    return false;
 
  if (!DoBitCastPtr(S, OpPC, FromPtr, ToPtr))
    return false;
 
  return true;
}
 
/// Typeid support.
bool GetTypeid(InterpState &S, const Type *TypePtr, const Type *TypeInfoType);
bool GetTypeidPtr(InterpState &S, CodePtr OpPC, const Type *TypeInfoType);
bool DiagTypeid(InterpState &S, CodePtr OpPC);
 
inline bool CheckDestruction(InterpState &S, CodePtr OpPC) {
  const auto &Ptr = S.Stk.peek<Pointer>();
  return checkDestructor(S, OpPC, Ptr);
}
 
inline bool ReflectValue(InterpState &S, CodePtr OpPC, ReflectionKind Kind,
                         const void *Operand) {
  S.Stk.push<Reflect>(Kind, Operand);
  return true;
}
 
inline bool IsBaseClass(InterpState &S) {
  S.Stk.push<bool>(S.Stk.peek<Pointer>().isBaseClass());
  return true;
}
 
//===----------------------------------------------------------------------===//
// Read opcode arguments
//===----------------------------------------------------------------------===//
 
template <typename T> inline T ReadArg(InterpState &S, CodePtr &OpPC) {
  if constexpr (std::is_pointer<T>::value)
    return reinterpret_cast<T>(OpPC.read<uintptr_t>());
  else
    return OpPC.read<T>();
}
 
template <> inline Floating ReadArg<Floating>(InterpState &S, CodePtr &OpPC) {
  auto &Semantics =
      llvm::APFloatBase::EnumToSemantics(Floating::deserializeSemantics(*OpPC));
 
  auto F = S.allocFloat(Semantics);
  Floating::deserialize(*OpPC, &F);
  OpPC += align(F.bytesToSerialize());
  return F;
}
 
template <>
inline IntegralAP<false> ReadArg<IntegralAP<false>>(InterpState &S,
                                                    CodePtr &OpPC) {
  uint32_t BitWidth = IntegralAP<false>::deserializeSize(*OpPC);
  auto Result = S.allocAP<IntegralAP<false>>(BitWidth);
  assert(Result.bitWidth() == BitWidth);
 
  IntegralAP<false>::deserialize(*OpPC, &Result);
  OpPC += align(Result.bytesToSerialize());
  return Result;
}
 
template <>
inline IntegralAP<true> ReadArg<IntegralAP<true>>(InterpState &S,
                                                  CodePtr &OpPC) {
  uint32_t BitWidth = IntegralAP<true>::deserializeSize(*OpPC);
  auto Result = S.allocAP<IntegralAP<true>>(BitWidth);
  assert(Result.bitWidth() == BitWidth);
 
  IntegralAP<true>::deserialize(*OpPC, &Result);
  OpPC += align(Result.bytesToSerialize());
  return Result;
}
 
template <>
inline FixedPoint ReadArg<FixedPoint>(InterpState &S, CodePtr &OpPC) {
  FixedPoint FP = FixedPoint::deserialize(*OpPC);
  OpPC += align(FP.bytesToSerialize());
  return FP;
}
 
} // namespace interp
} // namespace clang
 
#endif