| //===- Type.cpp - Type representation and manipulation --------------------===// |
| // |
| // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| // See https://llvm.org/LICENSE.txt for license information. |
| // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| // |
| //===----------------------------------------------------------------------===// |
| // |
| // This file implements type-related functionality. |
| // |
| //===----------------------------------------------------------------------===// |
| |
| #include "clang/AST/Type.h" |
| #include "Linkage.h" |
| #include "clang/AST/ASTContext.h" |
| #include "clang/AST/Attr.h" |
| #include "clang/AST/CharUnits.h" |
| #include "clang/AST/Decl.h" |
| #include "clang/AST/DeclBase.h" |
| #include "clang/AST/DeclCXX.h" |
| #include "clang/AST/DeclObjC.h" |
| #include "clang/AST/DeclTemplate.h" |
| #include "clang/AST/Expr.h" |
| #include "clang/AST/NestedNameSpecifier.h" |
| #include "clang/AST/NonTrivialTypeVisitor.h" |
| #include "clang/AST/PrettyPrinter.h" |
| #include "clang/AST/TemplateBase.h" |
| #include "clang/AST/TemplateName.h" |
| #include "clang/AST/TypeVisitor.h" |
| #include "clang/Basic/AddressSpaces.h" |
| #include "clang/Basic/ExceptionSpecificationType.h" |
| #include "clang/Basic/IdentifierTable.h" |
| #include "clang/Basic/LLVM.h" |
| #include "clang/Basic/LangOptions.h" |
| #include "clang/Basic/Linkage.h" |
| #include "clang/Basic/Specifiers.h" |
| #include "clang/Basic/TargetCXXABI.h" |
| #include "clang/Basic/TargetInfo.h" |
| #include "clang/Basic/Visibility.h" |
| #include "llvm/ADT/APInt.h" |
| #include "llvm/ADT/APSInt.h" |
| #include "llvm/ADT/ArrayRef.h" |
| #include "llvm/ADT/FoldingSet.h" |
| #include "llvm/ADT/None.h" |
| #include "llvm/ADT/SmallVector.h" |
| #include "llvm/Support/Casting.h" |
| #include "llvm/Support/ErrorHandling.h" |
| #include "llvm/Support/MathExtras.h" |
| #include <algorithm> |
| #include <cassert> |
| #include <cstdint> |
| #include <cstring> |
| #include <type_traits> |
| |
| using namespace clang; |
| |
| bool Qualifiers::isStrictSupersetOf(Qualifiers Other) const { |
| return (*this != Other) && |
| // CVR qualifiers superset |
| (((Mask & CVRMask) | (Other.Mask & CVRMask)) == (Mask & CVRMask)) && |
| // ObjC GC qualifiers superset |
| ((getObjCGCAttr() == Other.getObjCGCAttr()) || |
| (hasObjCGCAttr() && !Other.hasObjCGCAttr())) && |
| // Address space superset. |
| ((getAddressSpace() == Other.getAddressSpace()) || |
| (hasAddressSpace()&& !Other.hasAddressSpace())) && |
| // Lifetime qualifier superset. |
| ((getObjCLifetime() == Other.getObjCLifetime()) || |
| (hasObjCLifetime() && !Other.hasObjCLifetime())); |
| } |
| |
| const IdentifierInfo* QualType::getBaseTypeIdentifier() const { |
| const Type* ty = getTypePtr(); |
| NamedDecl *ND = nullptr; |
| if (ty->isPointerType() || ty->isReferenceType()) |
| return ty->getPointeeType().getBaseTypeIdentifier(); |
| else if (ty->isRecordType()) |
| ND = ty->castAs<RecordType>()->getDecl(); |
| else if (ty->isEnumeralType()) |
| ND = ty->castAs<EnumType>()->getDecl(); |
| else if (ty->getTypeClass() == Type::Typedef) |
| ND = ty->castAs<TypedefType>()->getDecl(); |
| else if (ty->isArrayType()) |
| return ty->castAsArrayTypeUnsafe()-> |
| getElementType().getBaseTypeIdentifier(); |
| |
| if (ND) |
| return ND->getIdentifier(); |
| return nullptr; |
| } |
| |
| bool QualType::mayBeDynamicClass() const { |
| const auto *ClassDecl = getTypePtr()->getPointeeCXXRecordDecl(); |
| return ClassDecl && ClassDecl->mayBeDynamicClass(); |
| } |
| |
| bool QualType::mayBeNotDynamicClass() const { |
| const auto *ClassDecl = getTypePtr()->getPointeeCXXRecordDecl(); |
| return !ClassDecl || ClassDecl->mayBeNonDynamicClass(); |
| } |
| |
| bool QualType::isConstant(QualType T, const ASTContext &Ctx) { |
| if (T.isConstQualified()) |
| return true; |
| |
| if (const ArrayType *AT = Ctx.getAsArrayType(T)) |
| return AT->getElementType().isConstant(Ctx); |
| |
| return T.getAddressSpace() == LangAS::opencl_constant; |
| } |
| |
| // C++ [temp.dep.type]p1: |
| // A type is dependent if it is... |
| // - an array type constructed from any dependent type or whose |
| // size is specified by a constant expression that is |
| // value-dependent, |
| ArrayType::ArrayType(TypeClass tc, QualType et, QualType can, |
| ArraySizeModifier sm, unsigned tq, const Expr *sz) |
| // Note, we need to check for DependentSizedArrayType explicitly here |
| // because we use a DependentSizedArrayType with no size expression as the |
| // type of a dependent array of unknown bound with a dependent braced |
| // initializer: |
| // |
| // template<int ...N> int arr[] = {N...}; |
| : Type(tc, can, |
| et->isDependentType() || (sz && sz->isValueDependent()) || |
| tc == DependentSizedArray, |
| et->isInstantiationDependentType() || |
| (sz && sz->isInstantiationDependent()) || |
| tc == DependentSizedArray, |
| (tc == VariableArray || et->isVariablyModifiedType()), |
| et->containsUnexpandedParameterPack() || |
| (sz && sz->containsUnexpandedParameterPack())), |
| ElementType(et) { |
| ArrayTypeBits.IndexTypeQuals = tq; |
| ArrayTypeBits.SizeModifier = sm; |
| } |
| |
| unsigned ConstantArrayType::getNumAddressingBits(const ASTContext &Context, |
| QualType ElementType, |
| const llvm::APInt &NumElements) { |
| uint64_t ElementSize = Context.getTypeSizeInChars(ElementType).getQuantity(); |
| |
| // Fast path the common cases so we can avoid the conservative computation |
| // below, which in common cases allocates "large" APSInt values, which are |
| // slow. |
| |
| // If the element size is a power of 2, we can directly compute the additional |
| // number of addressing bits beyond those required for the element count. |
| if (llvm::isPowerOf2_64(ElementSize)) { |
| return NumElements.getActiveBits() + llvm::Log2_64(ElementSize); |
| } |
| |
| // If both the element count and element size fit in 32-bits, we can do the |
| // computation directly in 64-bits. |
| if ((ElementSize >> 32) == 0 && NumElements.getBitWidth() <= 64 && |
| (NumElements.getZExtValue() >> 32) == 0) { |
| uint64_t TotalSize = NumElements.getZExtValue() * ElementSize; |
| return 64 - llvm::countLeadingZeros(TotalSize); |
| } |
| |
| // Otherwise, use APSInt to handle arbitrary sized values. |
| llvm::APSInt SizeExtended(NumElements, true); |
| unsigned SizeTypeBits = Context.getTypeSize(Context.getSizeType()); |
| SizeExtended = SizeExtended.extend(std::max(SizeTypeBits, |
| SizeExtended.getBitWidth()) * 2); |
| |
| llvm::APSInt TotalSize(llvm::APInt(SizeExtended.getBitWidth(), ElementSize)); |
| TotalSize *= SizeExtended; |
| |
| return TotalSize.getActiveBits(); |
| } |
| |
| unsigned ConstantArrayType::getMaxSizeBits(const ASTContext &Context) { |
| unsigned Bits = Context.getTypeSize(Context.getSizeType()); |
| |
| // Limit the number of bits in size_t so that maximal bit size fits 64 bit |
| // integer (see PR8256). We can do this as currently there is no hardware |
| // that supports full 64-bit virtual space. |
| if (Bits > 61) |
| Bits = 61; |
| |
| return Bits; |
| } |
| |
| void ConstantArrayType::Profile(llvm::FoldingSetNodeID &ID, |
| const ASTContext &Context, QualType ET, |
| const llvm::APInt &ArraySize, |
| const Expr *SizeExpr, ArraySizeModifier SizeMod, |
| unsigned TypeQuals) { |
| ID.AddPointer(ET.getAsOpaquePtr()); |
| ID.AddInteger(ArraySize.getZExtValue()); |
| ID.AddInteger(SizeMod); |
| ID.AddInteger(TypeQuals); |
| ID.AddBoolean(SizeExpr != 0); |
| if (SizeExpr) |
| SizeExpr->Profile(ID, Context, true); |
| } |
| |
| DependentSizedArrayType::DependentSizedArrayType(const ASTContext &Context, |
| QualType et, QualType can, |
| Expr *e, ArraySizeModifier sm, |
| unsigned tq, |
| SourceRange brackets) |
| : ArrayType(DependentSizedArray, et, can, sm, tq, e), |
| Context(Context), SizeExpr((Stmt*) e), Brackets(brackets) {} |
| |
| void DependentSizedArrayType::Profile(llvm::FoldingSetNodeID &ID, |
| const ASTContext &Context, |
| QualType ET, |
| ArraySizeModifier SizeMod, |
| unsigned TypeQuals, |
| Expr *E) { |
| ID.AddPointer(ET.getAsOpaquePtr()); |
| ID.AddInteger(SizeMod); |
| ID.AddInteger(TypeQuals); |
| E->Profile(ID, Context, true); |
| } |
| |
| DependentVectorType::DependentVectorType( |
| const ASTContext &Context, QualType ElementType, QualType CanonType, |
| Expr *SizeExpr, SourceLocation Loc, VectorType::VectorKind VecKind) |
| : Type(DependentVector, CanonType, /*Dependent=*/true, |
| /*InstantiationDependent=*/true, |
| ElementType->isVariablyModifiedType(), |
| ElementType->containsUnexpandedParameterPack() || |
| (SizeExpr && SizeExpr->containsUnexpandedParameterPack())), |
| Context(Context), ElementType(ElementType), SizeExpr(SizeExpr), Loc(Loc) { |
| VectorTypeBits.VecKind = VecKind; |
| } |
| |
| void DependentVectorType::Profile(llvm::FoldingSetNodeID &ID, |
| const ASTContext &Context, |
| QualType ElementType, const Expr *SizeExpr, |
| VectorType::VectorKind VecKind) { |
| ID.AddPointer(ElementType.getAsOpaquePtr()); |
| ID.AddInteger(VecKind); |
| SizeExpr->Profile(ID, Context, true); |
| } |
| |
| DependentSizedExtVectorType::DependentSizedExtVectorType(const |
| ASTContext &Context, |
| QualType ElementType, |
| QualType can, |
| Expr *SizeExpr, |
| SourceLocation loc) |
| : Type(DependentSizedExtVector, can, /*Dependent=*/true, |
| /*InstantiationDependent=*/true, |
| ElementType->isVariablyModifiedType(), |
| (ElementType->containsUnexpandedParameterPack() || |
| (SizeExpr && SizeExpr->containsUnexpandedParameterPack()))), |
| Context(Context), SizeExpr(SizeExpr), ElementType(ElementType), |
| loc(loc) {} |
| |
| void |
| DependentSizedExtVectorType::Profile(llvm::FoldingSetNodeID &ID, |
| const ASTContext &Context, |
| QualType ElementType, Expr *SizeExpr) { |
| ID.AddPointer(ElementType.getAsOpaquePtr()); |
| SizeExpr->Profile(ID, Context, true); |
| } |
| |
| DependentAddressSpaceType::DependentAddressSpaceType( |
| const ASTContext &Context, QualType PointeeType, QualType can, |
| Expr *AddrSpaceExpr, SourceLocation loc) |
| : Type(DependentAddressSpace, can, /*Dependent=*/true, |
| /*InstantiationDependent=*/true, |
| PointeeType->isVariablyModifiedType(), |
| (PointeeType->containsUnexpandedParameterPack() || |
| (AddrSpaceExpr && |
| AddrSpaceExpr->containsUnexpandedParameterPack()))), |
| Context(Context), AddrSpaceExpr(AddrSpaceExpr), PointeeType(PointeeType), |
| loc(loc) {} |
| |
| void DependentAddressSpaceType::Profile(llvm::FoldingSetNodeID &ID, |
| const ASTContext &Context, |
| QualType PointeeType, |
| Expr *AddrSpaceExpr) { |
| ID.AddPointer(PointeeType.getAsOpaquePtr()); |
| AddrSpaceExpr->Profile(ID, Context, true); |
| } |
| |
| VectorType::VectorType(QualType vecType, unsigned nElements, QualType canonType, |
| VectorKind vecKind) |
| : VectorType(Vector, vecType, nElements, canonType, vecKind) {} |
| |
| VectorType::VectorType(TypeClass tc, QualType vecType, unsigned nElements, |
| QualType canonType, VectorKind vecKind) |
| : Type(tc, canonType, vecType->isDependentType(), |
| vecType->isInstantiationDependentType(), |
| vecType->isVariablyModifiedType(), |
| vecType->containsUnexpandedParameterPack()), |
| ElementType(vecType) { |
| VectorTypeBits.VecKind = vecKind; |
| VectorTypeBits.NumElements = nElements; |
| } |
| |
| /// getArrayElementTypeNoTypeQual - If this is an array type, return the |
| /// element type of the array, potentially with type qualifiers missing. |
| /// This method should never be used when type qualifiers are meaningful. |
| const Type *Type::getArrayElementTypeNoTypeQual() const { |
| // If this is directly an array type, return it. |
| if (const auto *ATy = dyn_cast<ArrayType>(this)) |
| return ATy->getElementType().getTypePtr(); |
| |
| // If the canonical form of this type isn't the right kind, reject it. |
| if (!isa<ArrayType>(CanonicalType)) |
| return nullptr; |
| |
| // If this is a typedef for an array type, strip the typedef off without |
| // losing all typedef information. |
| return cast<ArrayType>(getUnqualifiedDesugaredType()) |
| ->getElementType().getTypePtr(); |
| } |
| |
| /// getDesugaredType - Return the specified type with any "sugar" removed from |
| /// the type. This takes off typedefs, typeof's etc. If the outer level of |
| /// the type is already concrete, it returns it unmodified. This is similar |
| /// to getting the canonical type, but it doesn't remove *all* typedefs. For |
| /// example, it returns "T*" as "T*", (not as "int*"), because the pointer is |
| /// concrete. |
| QualType QualType::getDesugaredType(QualType T, const ASTContext &Context) { |
| SplitQualType split = getSplitDesugaredType(T); |
| return Context.getQualifiedType(split.Ty, split.Quals); |
| } |
| |
| QualType QualType::getSingleStepDesugaredTypeImpl(QualType type, |
| const ASTContext &Context) { |
| SplitQualType split = type.split(); |
| QualType desugar = split.Ty->getLocallyUnqualifiedSingleStepDesugaredType(); |
| return Context.getQualifiedType(desugar, split.Quals); |
| } |
| |
| // Check that no type class is polymorphic. LLVM style RTTI should be used |
| // instead. If absolutely needed an exception can still be added here by |
| // defining the appropriate macro (but please don't do this). |
| #define TYPE(CLASS, BASE) \ |
| static_assert(!std::is_polymorphic<CLASS##Type>::value, \ |
| #CLASS "Type should not be polymorphic!"); |
| #include "clang/AST/TypeNodes.inc" |
| |
| // Check that no type class has a non-trival destructor. Types are |
| // allocated with the BumpPtrAllocator from ASTContext and therefore |
| // their destructor is not executed. |
| // |
| // FIXME: ConstantArrayType is not trivially destructible because of its |
| // APInt member. It should be replaced in favor of ASTContext allocation. |
| #define TYPE(CLASS, BASE) \ |
| static_assert(std::is_trivially_destructible<CLASS##Type>::value || \ |
| std::is_same<CLASS##Type, ConstantArrayType>::value, \ |
| #CLASS "Type should be trivially destructible!"); |
| #include "clang/AST/TypeNodes.inc" |
| |
| QualType Type::getLocallyUnqualifiedSingleStepDesugaredType() const { |
| switch (getTypeClass()) { |
| #define ABSTRACT_TYPE(Class, Parent) |
| #define TYPE(Class, Parent) \ |
| case Type::Class: { \ |
| const auto *ty = cast<Class##Type>(this); \ |
| if (!ty->isSugared()) return QualType(ty, 0); \ |
| return ty->desugar(); \ |
| } |
| #include "clang/AST/TypeNodes.inc" |
| } |
| llvm_unreachable("bad type kind!"); |
| } |
| |
| SplitQualType QualType::getSplitDesugaredType(QualType T) { |
| QualifierCollector Qs; |
| |
| QualType Cur = T; |
| while (true) { |
| const Type *CurTy = Qs.strip(Cur); |
| switch (CurTy->getTypeClass()) { |
| #define ABSTRACT_TYPE(Class, Parent) |
| #define TYPE(Class, Parent) \ |
| case Type::Class: { \ |
| const auto *Ty = cast<Class##Type>(CurTy); \ |
| if (!Ty->isSugared()) \ |
| return SplitQualType(Ty, Qs); \ |
| Cur = Ty->desugar(); \ |
| break; \ |
| } |
| #include "clang/AST/TypeNodes.inc" |
| } |
| } |
| } |
| |
| SplitQualType QualType::getSplitUnqualifiedTypeImpl(QualType type) { |
| SplitQualType split = type.split(); |
| |
| // All the qualifiers we've seen so far. |
| Qualifiers quals = split.Quals; |
| |
| // The last type node we saw with any nodes inside it. |
| const Type *lastTypeWithQuals = split.Ty; |
| |
| while (true) { |
| QualType next; |
| |
| // Do a single-step desugar, aborting the loop if the type isn't |
| // sugared. |
| switch (split.Ty->getTypeClass()) { |
| #define ABSTRACT_TYPE(Class, Parent) |
| #define TYPE(Class, Parent) \ |
| case Type::Class: { \ |
| const auto *ty = cast<Class##Type>(split.Ty); \ |
| if (!ty->isSugared()) goto done; \ |
| next = ty->desugar(); \ |
| break; \ |
| } |
| #include "clang/AST/TypeNodes.inc" |
| } |
| |
| // Otherwise, split the underlying type. If that yields qualifiers, |
| // update the information. |
| split = next.split(); |
| if (!split.Quals.empty()) { |
| lastTypeWithQuals = split.Ty; |
| quals.addConsistentQualifiers(split.Quals); |
| } |
| } |
| |
| done: |
| return SplitQualType(lastTypeWithQuals, quals); |
| } |
| |
| QualType QualType::IgnoreParens(QualType T) { |
| // FIXME: this seems inherently un-qualifiers-safe. |
| while (const auto *PT = T->getAs<ParenType>()) |
| T = PT->getInnerType(); |
| return T; |
| } |
| |
| /// This will check for a T (which should be a Type which can act as |
| /// sugar, such as a TypedefType) by removing any existing sugar until it |
| /// reaches a T or a non-sugared type. |
| template<typename T> static const T *getAsSugar(const Type *Cur) { |
| while (true) { |
| if (const auto *Sugar = dyn_cast<T>(Cur)) |
| return Sugar; |
| switch (Cur->getTypeClass()) { |
| #define ABSTRACT_TYPE(Class, Parent) |
| #define TYPE(Class, Parent) \ |
| case Type::Class: { \ |
| const auto *Ty = cast<Class##Type>(Cur); \ |
| if (!Ty->isSugared()) return 0; \ |
| Cur = Ty->desugar().getTypePtr(); \ |
| break; \ |
| } |
| #include "clang/AST/TypeNodes.inc" |
| } |
| } |
| } |
| |
| template <> const TypedefType *Type::getAs() const { |
| return getAsSugar<TypedefType>(this); |
| } |
| |
| template <> const TemplateSpecializationType *Type::getAs() const { |
| return getAsSugar<TemplateSpecializationType>(this); |
| } |
| |
| template <> const AttributedType *Type::getAs() const { |
| return getAsSugar<AttributedType>(this); |
| } |
| |
| /// getUnqualifiedDesugaredType - Pull any qualifiers and syntactic |
| /// sugar off the given type. This should produce an object of the |
| /// same dynamic type as the canonical type. |
| const Type *Type::getUnqualifiedDesugaredType() const { |
| const Type *Cur = this; |
| |
| while (true) { |
| switch (Cur->getTypeClass()) { |
| #define ABSTRACT_TYPE(Class, Parent) |
| #define TYPE(Class, Parent) \ |
| case Class: { \ |
| const auto *Ty = cast<Class##Type>(Cur); \ |
| if (!Ty->isSugared()) return Cur; \ |
| Cur = Ty->desugar().getTypePtr(); \ |
| break; \ |
| } |
| #include "clang/AST/TypeNodes.inc" |
| } |
| } |
| } |
| |
| bool Type::isClassType() const { |
| if (const auto *RT = getAs<RecordType>()) |
| return RT->getDecl()->isClass(); |
| return false; |
| } |
| |
| bool Type::isStructureType() const { |
| if (const auto *RT = getAs<RecordType>()) |
| return RT->getDecl()->isStruct(); |
| return false; |
| } |
| |
| bool Type::isObjCBoxableRecordType() const { |
| if (const auto *RT = getAs<RecordType>()) |
| return RT->getDecl()->hasAttr<ObjCBoxableAttr>(); |
| return false; |
| } |
| |
| bool Type::isInterfaceType() const { |
| if (const auto *RT = getAs<RecordType>()) |
| return RT->getDecl()->isInterface(); |
| return false; |
| } |
| |
| bool Type::isStructureOrClassType() const { |
| if (const auto *RT = getAs<RecordType>()) { |
| RecordDecl *RD = RT->getDecl(); |
| return RD->isStruct() || RD->isClass() || RD->isInterface(); |
| } |
| return false; |
| } |
| |
| bool Type::isVoidPointerType() const { |
| if (const auto *PT = getAs<PointerType>()) |
| return PT->getPointeeType()->isVoidType(); |
| return false; |
| } |
| |
| bool Type::isUnionType() const { |
| if (const auto *RT = getAs<RecordType>()) |
| return RT->getDecl()->isUnion(); |
| return false; |
| } |
| |
| bool Type::isComplexType() const { |
| if (const auto *CT = dyn_cast<ComplexType>(CanonicalType)) |
| return CT->getElementType()->isFloatingType(); |
| return false; |
| } |
| |
| bool Type::isComplexIntegerType() const { |
| // Check for GCC complex integer extension. |
| return getAsComplexIntegerType(); |
| } |
| |
| bool Type::isScopedEnumeralType() const { |
| if (const auto *ET = getAs<EnumType>()) |
| return ET->getDecl()->isScoped(); |
| return false; |
| } |
| |
| const ComplexType *Type::getAsComplexIntegerType() const { |
| if (const auto *Complex = getAs<ComplexType>()) |
| if (Complex->getElementType()->isIntegerType()) |
| return Complex; |
| return nullptr; |
| } |
| |
| QualType Type::getPointeeType() const { |
| if (const auto *PT = getAs<PointerType>()) |
| return PT->getPointeeType(); |
| if (const auto *OPT = getAs<ObjCObjectPointerType>()) |
| return OPT->getPointeeType(); |
| if (const auto *BPT = getAs<BlockPointerType>()) |
| return BPT->getPointeeType(); |
| if (const auto *RT = getAs<ReferenceType>()) |
| return RT->getPointeeType(); |
| if (const auto *MPT = getAs<MemberPointerType>()) |
| return MPT->getPointeeType(); |
| if (const auto *DT = getAs<DecayedType>()) |
| return DT->getPointeeType(); |
| return {}; |
| } |
| |
| const RecordType *Type::getAsStructureType() const { |
| // If this is directly a structure type, return it. |
| if (const auto *RT = dyn_cast<RecordType>(this)) { |
| if (RT->getDecl()->isStruct()) |
| return RT; |
| } |
| |
| // If the canonical form of this type isn't the right kind, reject it. |
| if (const auto *RT = dyn_cast<RecordType>(CanonicalType)) { |
| if (!RT->getDecl()->isStruct()) |
| return nullptr; |
| |
| // If this is a typedef for a structure type, strip the typedef off without |
| // losing all typedef information. |
| return cast<RecordType>(getUnqualifiedDesugaredType()); |
| } |
| return nullptr; |
| } |
| |
| const RecordType *Type::getAsUnionType() const { |
| // If this is directly a union type, return it. |
| if (const auto *RT = dyn_cast<RecordType>(this)) { |
| if (RT->getDecl()->isUnion()) |
| return RT; |
| } |
| |
| // If the canonical form of this type isn't the right kind, reject it. |
| if (const auto *RT = dyn_cast<RecordType>(CanonicalType)) { |
| if (!RT->getDecl()->isUnion()) |
| return nullptr; |
| |
| // If this is a typedef for a union type, strip the typedef off without |
| // losing all typedef information. |
| return cast<RecordType>(getUnqualifiedDesugaredType()); |
| } |
| |
| return nullptr; |
| } |
| |
| bool Type::isObjCIdOrObjectKindOfType(const ASTContext &ctx, |
| const ObjCObjectType *&bound) const { |
| bound = nullptr; |
| |
| const auto *OPT = getAs<ObjCObjectPointerType>(); |
| if (!OPT) |
| return false; |
| |
| // Easy case: id. |
| if (OPT->isObjCIdType()) |
| return true; |
| |
| // If it's not a __kindof type, reject it now. |
| if (!OPT->isKindOfType()) |
| return false; |
| |
| // If it's Class or qualified Class, it's not an object type. |
| if (OPT->isObjCClassType() || OPT->isObjCQualifiedClassType()) |
| return false; |
| |
| // Figure out the type bound for the __kindof type. |
| bound = OPT->getObjectType()->stripObjCKindOfTypeAndQuals(ctx) |
| ->getAs<ObjCObjectType>(); |
| return true; |
| } |
| |
| bool Type::isObjCClassOrClassKindOfType() const { |
| const auto *OPT = getAs<ObjCObjectPointerType>(); |
| if (!OPT) |
| return false; |
| |
| // Easy case: Class. |
| if (OPT->isObjCClassType()) |
| return true; |
| |
| // If it's not a __kindof type, reject it now. |
| if (!OPT->isKindOfType()) |
| return false; |
| |
| // If it's Class or qualified Class, it's a class __kindof type. |
| return OPT->isObjCClassType() || OPT->isObjCQualifiedClassType(); |
| } |
| |
| ObjCTypeParamType::ObjCTypeParamType(const ObjCTypeParamDecl *D, |
| QualType can, |
| ArrayRef<ObjCProtocolDecl *> protocols) |
| : Type(ObjCTypeParam, can, can->isDependentType(), |
| can->isInstantiationDependentType(), |
| can->isVariablyModifiedType(), |
| /*ContainsUnexpandedParameterPack=*/false), |
| OTPDecl(const_cast<ObjCTypeParamDecl*>(D)) { |
| initialize(protocols); |
| } |
| |
| QualType ObjCTypeParamType::desugar() const { |
| return getDecl()->getUnderlyingType(); |
| } |
| |
| ObjCObjectType::ObjCObjectType(QualType Canonical, QualType Base, |
| ArrayRef<QualType> typeArgs, |
| ArrayRef<ObjCProtocolDecl *> protocols, |
| bool isKindOf) |
| : Type(ObjCObject, Canonical, Base->isDependentType(), |
| Base->isInstantiationDependentType(), |
| Base->isVariablyModifiedType(), |
| Base->containsUnexpandedParameterPack()), |
| BaseType(Base) { |
| ObjCObjectTypeBits.IsKindOf = isKindOf; |
| |
| ObjCObjectTypeBits.NumTypeArgs = typeArgs.size(); |
| assert(getTypeArgsAsWritten().size() == typeArgs.size() && |
| "bitfield overflow in type argument count"); |
| if (!typeArgs.empty()) |
| memcpy(getTypeArgStorage(), typeArgs.data(), |
| typeArgs.size() * sizeof(QualType)); |
| |
| for (auto typeArg : typeArgs) { |
| if (typeArg->isDependentType()) |
| setDependent(); |
| else if (typeArg->isInstantiationDependentType()) |
| setInstantiationDependent(); |
| |
| if (typeArg->containsUnexpandedParameterPack()) |
| setContainsUnexpandedParameterPack(); |
| } |
| // Initialize the protocol qualifiers. The protocol storage is known |
| // after we set number of type arguments. |
| initialize(protocols); |
| } |
| |
| bool ObjCObjectType::isSpecialized() const { |
| // If we have type arguments written here, the type is specialized. |
| if (ObjCObjectTypeBits.NumTypeArgs > 0) |
| return true; |
| |
| // Otherwise, check whether the base type is specialized. |
| if (const auto objcObject = getBaseType()->getAs<ObjCObjectType>()) { |
| // Terminate when we reach an interface type. |
| if (isa<ObjCInterfaceType>(objcObject)) |
| return false; |
| |
| return objcObject->isSpecialized(); |
| } |
| |
| // Not specialized. |
| return false; |
| } |
| |
| ArrayRef<QualType> ObjCObjectType::getTypeArgs() const { |
| // We have type arguments written on this type. |
| if (isSpecializedAsWritten()) |
| return getTypeArgsAsWritten(); |
| |
| // Look at the base type, which might have type arguments. |
| if (const auto objcObject = getBaseType()->getAs<ObjCObjectType>()) { |
| // Terminate when we reach an interface type. |
| if (isa<ObjCInterfaceType>(objcObject)) |
| return {}; |
| |
| return objcObject->getTypeArgs(); |
| } |
| |
| // No type arguments. |
| return {}; |
| } |
| |
| bool ObjCObjectType::isKindOfType() const { |
| if (isKindOfTypeAsWritten()) |
| return true; |
| |
| // Look at the base type, which might have type arguments. |
| if (const auto objcObject = getBaseType()->getAs<ObjCObjectType>()) { |
| // Terminate when we reach an interface type. |
| if (isa<ObjCInterfaceType>(objcObject)) |
| return false; |
| |
| return objcObject->isKindOfType(); |
| } |
| |
| // Not a "__kindof" type. |
| return false; |
| } |
| |
| QualType ObjCObjectType::stripObjCKindOfTypeAndQuals( |
| const ASTContext &ctx) const { |
| if (!isKindOfType() && qual_empty()) |
| return QualType(this, 0); |
| |
| // Recursively strip __kindof. |
| SplitQualType splitBaseType = getBaseType().split(); |
| QualType baseType(splitBaseType.Ty, 0); |
| if (const auto *baseObj = splitBaseType.Ty->getAs<ObjCObjectType>()) |
| baseType = baseObj->stripObjCKindOfTypeAndQuals(ctx); |
| |
| return ctx.getObjCObjectType(ctx.getQualifiedType(baseType, |
| splitBaseType.Quals), |
| getTypeArgsAsWritten(), |
| /*protocols=*/{}, |
| /*isKindOf=*/false); |
| } |
| |
| const ObjCObjectPointerType *ObjCObjectPointerType::stripObjCKindOfTypeAndQuals( |
| const ASTContext &ctx) const { |
| if (!isKindOfType() && qual_empty()) |
| return this; |
| |
| QualType obj = getObjectType()->stripObjCKindOfTypeAndQuals(ctx); |
| return ctx.getObjCObjectPointerType(obj)->castAs<ObjCObjectPointerType>(); |
| } |
| |
| namespace { |
| |
| /// Visitor used to perform a simple type transformation that does not change |
| /// the semantics of the type. |
| template <typename Derived> |
| struct SimpleTransformVisitor : public TypeVisitor<Derived, QualType> { |
| ASTContext &Ctx; |
| |
| QualType recurse(QualType type) { |
| // Split out the qualifiers from the type. |
| SplitQualType splitType = type.split(); |
| |
| // Visit the type itself. |
| QualType result = static_cast<Derived *>(this)->Visit(splitType.Ty); |
| if (result.isNull()) |
| return result; |
| |
| // Reconstruct the transformed type by applying the local qualifiers |
| // from the split type. |
| return Ctx.getQualifiedType(result, splitType.Quals); |
| } |
| |
| public: |
| explicit SimpleTransformVisitor(ASTContext &ctx) : Ctx(ctx) {} |
| |
| // None of the clients of this transformation can occur where |
| // there are dependent types, so skip dependent types. |
| #define TYPE(Class, Base) |
| #define DEPENDENT_TYPE(Class, Base) \ |
| QualType Visit##Class##Type(const Class##Type *T) { return QualType(T, 0); } |
| #include "clang/AST/TypeNodes.inc" |
| |
| #define TRIVIAL_TYPE_CLASS(Class) \ |
| QualType Visit##Class##Type(const Class##Type *T) { return QualType(T, 0); } |
| #define SUGARED_TYPE_CLASS(Class) \ |
| QualType Visit##Class##Type(const Class##Type *T) { \ |
| if (!T->isSugared()) \ |
| return QualType(T, 0); \ |
| QualType desugaredType = recurse(T->desugar()); \ |
| if (desugaredType.isNull()) \ |
| return {}; \ |
| if (desugaredType.getAsOpaquePtr() == T->desugar().getAsOpaquePtr()) \ |
| return QualType(T, 0); \ |
| return desugaredType; \ |
| } |
| |
| TRIVIAL_TYPE_CLASS(Builtin) |
| |
| QualType VisitComplexType(const ComplexType *T) { |
| QualType elementType = recurse(T->getElementType()); |
| if (elementType.isNull()) |
| return {}; |
| |
| if (elementType.getAsOpaquePtr() == T->getElementType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getComplexType(elementType); |
| } |
| |
| QualType VisitPointerType(const PointerType *T) { |
| QualType pointeeType = recurse(T->getPointeeType()); |
| if (pointeeType.isNull()) |
| return {}; |
| |
| if (pointeeType.getAsOpaquePtr() == T->getPointeeType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getPointerType(pointeeType); |
| } |
| |
| QualType VisitBlockPointerType(const BlockPointerType *T) { |
| QualType pointeeType = recurse(T->getPointeeType()); |
| if (pointeeType.isNull()) |
| return {}; |
| |
| if (pointeeType.getAsOpaquePtr() == T->getPointeeType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getBlockPointerType(pointeeType); |
| } |
| |
| QualType VisitLValueReferenceType(const LValueReferenceType *T) { |
| QualType pointeeType = recurse(T->getPointeeTypeAsWritten()); |
| if (pointeeType.isNull()) |
| return {}; |
| |
| if (pointeeType.getAsOpaquePtr() |
| == T->getPointeeTypeAsWritten().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getLValueReferenceType(pointeeType, T->isSpelledAsLValue()); |
| } |
| |
| QualType VisitRValueReferenceType(const RValueReferenceType *T) { |
| QualType pointeeType = recurse(T->getPointeeTypeAsWritten()); |
| if (pointeeType.isNull()) |
| return {}; |
| |
| if (pointeeType.getAsOpaquePtr() |
| == T->getPointeeTypeAsWritten().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getRValueReferenceType(pointeeType); |
| } |
| |
| QualType VisitMemberPointerType(const MemberPointerType *T) { |
| QualType pointeeType = recurse(T->getPointeeType()); |
| if (pointeeType.isNull()) |
| return {}; |
| |
| if (pointeeType.getAsOpaquePtr() == T->getPointeeType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getMemberPointerType(pointeeType, T->getClass()); |
| } |
| |
| QualType VisitConstantArrayType(const ConstantArrayType *T) { |
| QualType elementType = recurse(T->getElementType()); |
| if (elementType.isNull()) |
| return {}; |
| |
| if (elementType.getAsOpaquePtr() == T->getElementType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getConstantArrayType(elementType, T->getSize(), T->getSizeExpr(), |
| T->getSizeModifier(), |
| T->getIndexTypeCVRQualifiers()); |
| } |
| |
| QualType VisitVariableArrayType(const VariableArrayType *T) { |
| QualType elementType = recurse(T->getElementType()); |
| if (elementType.isNull()) |
| return {}; |
| |
| if (elementType.getAsOpaquePtr() == T->getElementType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getVariableArrayType(elementType, T->getSizeExpr(), |
| T->getSizeModifier(), |
| T->getIndexTypeCVRQualifiers(), |
| T->getBracketsRange()); |
| } |
| |
| QualType VisitIncompleteArrayType(const IncompleteArrayType *T) { |
| QualType elementType = recurse(T->getElementType()); |
| if (elementType.isNull()) |
| return {}; |
| |
| if (elementType.getAsOpaquePtr() == T->getElementType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getIncompleteArrayType(elementType, T->getSizeModifier(), |
| T->getIndexTypeCVRQualifiers()); |
| } |
| |
| QualType VisitVectorType(const VectorType *T) { |
| QualType elementType = recurse(T->getElementType()); |
| if (elementType.isNull()) |
| return {}; |
| |
| if (elementType.getAsOpaquePtr() == T->getElementType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getVectorType(elementType, T->getNumElements(), |
| T->getVectorKind()); |
| } |
| |
| QualType VisitExtVectorType(const ExtVectorType *T) { |
| QualType elementType = recurse(T->getElementType()); |
| if (elementType.isNull()) |
| return {}; |
| |
| if (elementType.getAsOpaquePtr() == T->getElementType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getExtVectorType(elementType, T->getNumElements()); |
| } |
| |
| QualType VisitFunctionNoProtoType(const FunctionNoProtoType *T) { |
| QualType returnType = recurse(T->getReturnType()); |
| if (returnType.isNull()) |
| return {}; |
| |
| if (returnType.getAsOpaquePtr() == T->getReturnType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getFunctionNoProtoType(returnType, T->getExtInfo()); |
| } |
| |
| QualType VisitFunctionProtoType(const FunctionProtoType *T) { |
| QualType returnType = recurse(T->getReturnType()); |
| if (returnType.isNull()) |
| return {}; |
| |
| // Transform parameter types. |
| SmallVector<QualType, 4> paramTypes; |
| bool paramChanged = false; |
| for (auto paramType : T->getParamTypes()) { |
| QualType newParamType = recurse(paramType); |
| if (newParamType.isNull()) |
| return {}; |
| |
| if (newParamType.getAsOpaquePtr() != paramType.getAsOpaquePtr()) |
| paramChanged = true; |
| |
| paramTypes.push_back(newParamType); |
| } |
| |
| // Transform extended info. |
| FunctionProtoType::ExtProtoInfo info = T->getExtProtoInfo(); |
| bool exceptionChanged = false; |
| if (info.ExceptionSpec.Type == EST_Dynamic) { |
| SmallVector<QualType, 4> exceptionTypes; |
| for (auto exceptionType : info.ExceptionSpec.Exceptions) { |
| QualType newExceptionType = recurse(exceptionType); |
| if (newExceptionType.isNull()) |
| return {}; |
| |
| if (newExceptionType.getAsOpaquePtr() != exceptionType.getAsOpaquePtr()) |
| exceptionChanged = true; |
| |
| exceptionTypes.push_back(newExceptionType); |
| } |
| |
| if (exceptionChanged) { |
| info.ExceptionSpec.Exceptions = |
| llvm::makeArrayRef(exceptionTypes).copy(Ctx); |
| } |
| } |
| |
| if (returnType.getAsOpaquePtr() == T->getReturnType().getAsOpaquePtr() && |
| !paramChanged && !exceptionChanged) |
| return QualType(T, 0); |
| |
| return Ctx.getFunctionType(returnType, paramTypes, info); |
| } |
| |
| QualType VisitParenType(const ParenType *T) { |
| QualType innerType = recurse(T->getInnerType()); |
| if (innerType.isNull()) |
| return {}; |
| |
| if (innerType.getAsOpaquePtr() == T->getInnerType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getParenType(innerType); |
| } |
| |
| SUGARED_TYPE_CLASS(Typedef) |
| SUGARED_TYPE_CLASS(ObjCTypeParam) |
| SUGARED_TYPE_CLASS(MacroQualified) |
| |
| QualType VisitAdjustedType(const AdjustedType *T) { |
| QualType originalType = recurse(T->getOriginalType()); |
| if (originalType.isNull()) |
| return {}; |
| |
| QualType adjustedType = recurse(T->getAdjustedType()); |
| if (adjustedType.isNull()) |
| return {}; |
| |
| if (originalType.getAsOpaquePtr() |
| == T->getOriginalType().getAsOpaquePtr() && |
| adjustedType.getAsOpaquePtr() == T->getAdjustedType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getAdjustedType(originalType, adjustedType); |
| } |
| |
| QualType VisitDecayedType(const DecayedType *T) { |
| QualType originalType = recurse(T->getOriginalType()); |
| if (originalType.isNull()) |
| return {}; |
| |
| if (originalType.getAsOpaquePtr() |
| == T->getOriginalType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getDecayedType(originalType); |
| } |
| |
| SUGARED_TYPE_CLASS(TypeOfExpr) |
| SUGARED_TYPE_CLASS(TypeOf) |
| SUGARED_TYPE_CLASS(Decltype) |
| SUGARED_TYPE_CLASS(UnaryTransform) |
| TRIVIAL_TYPE_CLASS(Record) |
| TRIVIAL_TYPE_CLASS(Enum) |
| |
| // FIXME: Non-trivial to implement, but important for C++ |
| SUGARED_TYPE_CLASS(Elaborated) |
| |
| QualType VisitAttributedType(const AttributedType *T) { |
| QualType modifiedType = recurse(T->getModifiedType()); |
| if (modifiedType.isNull()) |
| return {}; |
| |
| QualType equivalentType = recurse(T->getEquivalentType()); |
| if (equivalentType.isNull()) |
| return {}; |
| |
| if (modifiedType.getAsOpaquePtr() |
| == T->getModifiedType().getAsOpaquePtr() && |
| equivalentType.getAsOpaquePtr() |
| == T->getEquivalentType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getAttributedType(T->getAttrKind(), modifiedType, |
| equivalentType); |
| } |
| |
| QualType VisitSubstTemplateTypeParmType(const SubstTemplateTypeParmType *T) { |
| QualType replacementType = recurse(T->getReplacementType()); |
| if (replacementType.isNull()) |
| return {}; |
| |
| if (replacementType.getAsOpaquePtr() |
| == T->getReplacementType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getSubstTemplateTypeParmType(T->getReplacedParameter(), |
| replacementType); |
| } |
| |
| // FIXME: Non-trivial to implement, but important for C++ |
| SUGARED_TYPE_CLASS(TemplateSpecialization) |
| |
| QualType VisitAutoType(const AutoType *T) { |
| if (!T->isDeduced()) |
| return QualType(T, 0); |
| |
| QualType deducedType = recurse(T->getDeducedType()); |
| if (deducedType.isNull()) |
| return {}; |
| |
| if (deducedType.getAsOpaquePtr() |
| == T->getDeducedType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getAutoType(deducedType, T->getKeyword(), |
| T->isDependentType()); |
| } |
| |
| // FIXME: Non-trivial to implement, but important for C++ |
| SUGARED_TYPE_CLASS(PackExpansion) |
| |
| QualType VisitObjCObjectType(const ObjCObjectType *T) { |
| QualType baseType = recurse(T->getBaseType()); |
| if (baseType.isNull()) |
| return {}; |
| |
| // Transform type arguments. |
| bool typeArgChanged = false; |
| SmallVector<QualType, 4> typeArgs; |
| for (auto typeArg : T->getTypeArgsAsWritten()) { |
| QualType newTypeArg = recurse(typeArg); |
| if (newTypeArg.isNull()) |
| return {}; |
| |
| if (newTypeArg.getAsOpaquePtr() != typeArg.getAsOpaquePtr()) |
| typeArgChanged = true; |
| |
| typeArgs.push_back(newTypeArg); |
| } |
| |
| if (baseType.getAsOpaquePtr() == T->getBaseType().getAsOpaquePtr() && |
| !typeArgChanged) |
| return QualType(T, 0); |
| |
| return Ctx.getObjCObjectType(baseType, typeArgs, |
| llvm::makeArrayRef(T->qual_begin(), |
| T->getNumProtocols()), |
| T->isKindOfTypeAsWritten()); |
| } |
| |
| TRIVIAL_TYPE_CLASS(ObjCInterface) |
| |
| QualType VisitObjCObjectPointerType(const ObjCObjectPointerType *T) { |
| QualType pointeeType = recurse(T->getPointeeType()); |
| if (pointeeType.isNull()) |
| return {}; |
| |
| if (pointeeType.getAsOpaquePtr() |
| == T->getPointeeType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getObjCObjectPointerType(pointeeType); |
| } |
| |
| QualType VisitAtomicType(const AtomicType *T) { |
| QualType valueType = recurse(T->getValueType()); |
| if (valueType.isNull()) |
| return {}; |
| |
| if (valueType.getAsOpaquePtr() |
| == T->getValueType().getAsOpaquePtr()) |
| return QualType(T, 0); |
| |
| return Ctx.getAtomicType(valueType); |
| } |
| |
| #undef TRIVIAL_TYPE_CLASS |
| #undef SUGARED_TYPE_CLASS |
| }; |
| |
| struct SubstObjCTypeArgsVisitor |
| : public SimpleTransformVisitor<SubstObjCTypeArgsVisitor> { |
| using BaseType = SimpleTransformVisitor<SubstObjCTypeArgsVisitor>; |
| |
| ArrayRef<QualType> TypeArgs; |
| ObjCSubstitutionContext SubstContext; |
| |
| SubstObjCTypeArgsVisitor(ASTContext &ctx, ArrayRef<QualType> typeArgs, |
| ObjCSubstitutionContext context) |
| : BaseType(ctx), TypeArgs(typeArgs), SubstContext(context) {} |
| |
| QualType VisitObjCTypeParamType(const ObjCTypeParamType *OTPTy) { |
| // Replace an Objective-C type parameter reference with the corresponding |
| // type argument. |
| ObjCTypeParamDecl *typeParam = OTPTy->getDecl(); |
| // If we have type arguments, use them. |
| if (!TypeArgs.empty()) { |
| QualType argType = TypeArgs[typeParam->getIndex()]; |
| if (OTPTy->qual_empty()) |
| return argType; |
| |
| // Apply protocol lists if exists. |
| bool hasError; |
| SmallVector<ObjCProtocolDecl *, 8> protocolsVec; |
| protocolsVec.append(OTPTy->qual_begin(), OTPTy->qual_end()); |
| ArrayRef<ObjCProtocolDecl *> protocolsToApply = protocolsVec; |
| return Ctx.applyObjCProtocolQualifiers( |
| argType, protocolsToApply, hasError, true/*allowOnPointerType*/); |
| } |
| |
| switch (SubstContext) { |
| case ObjCSubstitutionContext::Ordinary: |
| case ObjCSubstitutionContext::Parameter: |
| case ObjCSubstitutionContext::Superclass: |
| // Substitute the bound. |
| return typeParam->getUnderlyingType(); |
| |
| case ObjCSubstitutionContext::Result: |
| case ObjCSubstitutionContext::Property: { |
| // Substitute the __kindof form of the underlying type. |
| const auto *objPtr = |
| typeParam->getUnderlyingType()->castAs<ObjCObjectPointerType>(); |
| |
| // __kindof types, id, and Class don't need an additional |
| // __kindof. |
| if (objPtr->isKindOfType() || objPtr->isObjCIdOrClassType()) |
| return typeParam->getUnderlyingType(); |
| |
| // Add __kindof. |
| const auto *obj = objPtr->getObjectType(); |
| QualType resultTy = Ctx.getObjCObjectType( |
| obj->getBaseType(), obj->getTypeArgsAsWritten(), obj->getProtocols(), |
| /*isKindOf=*/true); |
| |
| // Rebuild object pointer type. |
| return Ctx.getObjCObjectPointerType(resultTy); |
| } |
| } |
| llvm_unreachable("Unexpected ObjCSubstitutionContext!"); |
| } |
| |
| QualType VisitFunctionType(const FunctionType *funcType) { |
| // If we have a function type, update the substitution context |
| // appropriately. |
| |
| //Substitute result type. |
| QualType returnType = funcType->getReturnType().substObjCTypeArgs( |
| Ctx, TypeArgs, ObjCSubstitutionContext::Result); |
| if (returnType.isNull()) |
| return {}; |
| |
| // Handle non-prototyped functions, which only substitute into the result |
| // type. |
| if (isa<FunctionNoProtoType>(funcType)) { |
| // If the return type was unchanged, do nothing. |
| if (returnType.getAsOpaquePtr() == |
| funcType->getReturnType().getAsOpaquePtr()) |
| return BaseType::VisitFunctionType(funcType); |
| |
| // Otherwise, build a new type. |
| return Ctx.getFunctionNoProtoType(returnType, funcType->getExtInfo()); |
| } |
| |
| const auto *funcProtoType = cast<FunctionProtoType>(funcType); |
| |
| // Transform parameter types. |
| SmallVector<QualType, 4> paramTypes; |
| bool paramChanged = false; |
| for (auto paramType : funcProtoType->getParamTypes()) { |
| QualType newParamType = paramType.substObjCTypeArgs( |
| Ctx, TypeArgs, ObjCSubstitutionContext::Parameter); |
| if (newParamType.isNull()) |
| return {}; |
| |
| if (newParamType.getAsOpaquePtr() != paramType.getAsOpaquePtr()) |
| paramChanged = true; |
| |
| paramTypes.push_back(newParamType); |
| } |
| |
| // Transform extended info. |
| FunctionProtoType::ExtProtoInfo info = funcProtoType->getExtProtoInfo(); |
| bool exceptionChanged = false; |
| if (info.ExceptionSpec.Type == EST_Dynamic) { |
| SmallVector<QualType, 4> exceptionTypes; |
| for (auto exceptionType : info.ExceptionSpec.Exceptions) { |
| QualType newExceptionType = exceptionType.substObjCTypeArgs( |
| Ctx, TypeArgs, ObjCSubstitutionContext::Ordinary); |
| if (newExceptionType.isNull()) |
| return {}; |
| |
| if (newExceptionType.getAsOpaquePtr() != exceptionType.getAsOpaquePtr()) |
| exceptionChanged = true; |
| |
| exceptionTypes.push_back(newExceptionType); |
| } |
| |
| if (exceptionChanged) { |
| info.ExceptionSpec.Exceptions = |
| llvm::makeArrayRef(exceptionTypes).copy(Ctx); |
| } |
| } |
| |
| if (returnType.getAsOpaquePtr() == |
| funcProtoType->getReturnType().getAsOpaquePtr() && |
| !paramChanged && !exceptionChanged) |
| return BaseType::VisitFunctionType(funcType); |
| |
| return Ctx.getFunctionType(returnType, paramTypes, info); |
| } |
| |
| QualType VisitObjCObjectType(const ObjCObjectType *objcObjectType) { |
| // Substitute into the type arguments of a specialized Objective-C object |
| // type. |
| if (objcObjectType->isSpecializedAsWritten()) { |
| SmallVector<QualType, 4> newTypeArgs; |
| bool anyChanged = false; |
| for (auto typeArg : objcObjectType->getTypeArgsAsWritten()) { |
| QualType newTypeArg = typeArg.substObjCTypeArgs( |
| Ctx, TypeArgs, ObjCSubstitutionContext::Ordinary); |
| if (newTypeArg.isNull()) |
| return {}; |
| |
| if (newTypeArg.getAsOpaquePtr() != typeArg.getAsOpaquePtr()) { |
| // If we're substituting based on an unspecialized context type, |
| // produce an unspecialized type. |
| ArrayRef<ObjCProtocolDecl *> protocols( |
| objcObjectType->qual_begin(), objcObjectType->getNumProtocols()); |
| if (TypeArgs.empty() && |
| SubstContext != ObjCSubstitutionContext::Superclass) { |
| return Ctx.getObjCObjectType( |
| objcObjectType->getBaseType(), {}, protocols, |
| objcObjectType->isKindOfTypeAsWritten()); |
| } |
| |
| anyChanged = true; |
| } |
| |
| newTypeArgs.push_back(newTypeArg); |
| } |
| |
| if (anyChanged) { |
| ArrayRef<ObjCProtocolDecl *> protocols( |
| objcObjectType->qual_begin(), objcObjectType->getNumProtocols()); |
| return Ctx.getObjCObjectType(objcObjectType->getBaseType(), newTypeArgs, |
| protocols, |
| objcObjectType->isKindOfTypeAsWritten()); |
| } |
| } |
| |
| return BaseType::VisitObjCObjectType(objcObjectType); |
| } |
| |
| QualType VisitAttributedType(const AttributedType *attrType) { |
| QualType newType = BaseType::VisitAttributedType(attrType); |
| if (newType.isNull()) |
| return {}; |
| |
| const auto *newAttrType = dyn_cast<AttributedType>(newType.getTypePtr()); |
| if (!newAttrType || newAttrType->getAttrKind() != attr::ObjCKindOf) |
| return newType; |
| |
| // Find out if it's an Objective-C object or object pointer type; |
| QualType newEquivType = newAttrType->getEquivalentType(); |
| const ObjCObjectPointerType *ptrType = |
| newEquivType->getAs<ObjCObjectPointerType>(); |
| const ObjCObjectType *objType = ptrType |
| ? ptrType->getObjectType() |
| : newEquivType->getAs<ObjCObjectType>(); |
| if (!objType) |
| return newType; |
| |
| // Rebuild the "equivalent" type, which pushes __kindof down into |
| // the object type. |
| newEquivType = Ctx.getObjCObjectType( |
| objType->getBaseType(), objType->getTypeArgsAsWritten(), |
| objType->getProtocols(), |
| // There is no need to apply kindof on an unqualified id type. |
| /*isKindOf=*/objType->isObjCUnqualifiedId() ? false : true); |
| |
| // If we started with an object pointer type, rebuild it. |
| if (ptrType) |
| newEquivType = Ctx.getObjCObjectPointerType(newEquivType); |
| |
| // Rebuild the attributed type. |
| return Ctx.getAttributedType(newAttrType->getAttrKind(), |
| newAttrType->getModifiedType(), newEquivType); |
| } |
| }; |
| |
| struct StripObjCKindOfTypeVisitor |
| : public SimpleTransformVisitor<StripObjCKindOfTypeVisitor> { |
| using BaseType = SimpleTransformVisitor<StripObjCKindOfTypeVisitor>; |
| |
| explicit StripObjCKindOfTypeVisitor(ASTContext &ctx) : BaseType(ctx) {} |
| |
| QualType VisitObjCObjectType(const ObjCObjectType *objType) { |
| if (!objType->isKindOfType()) |
| return BaseType::VisitObjCObjectType(objType); |
| |
| QualType baseType = objType->getBaseType().stripObjCKindOfType(Ctx); |
| return Ctx.getObjCObjectType(baseType, objType->getTypeArgsAsWritten(), |
| objType->getProtocols(), |
| /*isKindOf=*/false); |
| } |
| }; |
| |
| } // namespace |
| |
| /// Substitute the given type arguments for Objective-C type |
| /// parameters within the given type, recursively. |
| QualType QualType::substObjCTypeArgs(ASTContext &ctx, |
| ArrayRef<QualType> typeArgs, |
| ObjCSubstitutionContext context) const { |
| SubstObjCTypeArgsVisitor visitor(ctx, typeArgs, context); |
| return visitor.recurse(*this); |
| } |
| |
| QualType QualType::substObjCMemberType(QualType objectType, |
| const DeclContext *dc, |
| ObjCSubstitutionContext context) const { |
| if (auto subs = objectType->getObjCSubstitutions(dc)) |
| return substObjCTypeArgs(dc->getParentASTContext(), *subs, context); |
| |
| return *this; |
| } |
| |
| QualType QualType::stripObjCKindOfType(const ASTContext &constCtx) const { |
| // FIXME: Because ASTContext::getAttributedType() is non-const. |
| auto &ctx = const_cast<ASTContext &>(constCtx); |
| StripObjCKindOfTypeVisitor visitor(ctx); |
| return visitor.recurse(*this); |
| } |
| |
| QualType QualType::getAtomicUnqualifiedType() const { |
| if (const auto AT = getTypePtr()->getAs<AtomicType>()) |
| return AT->getValueType().getUnqualifiedType(); |
| return getUnqualifiedType(); |
| } |
| |
| Optional<ArrayRef<QualType>> Type::getObjCSubstitutions( |
| const DeclContext *dc) const { |
| // Look through method scopes. |
| if (const auto method = dyn_cast<ObjCMethodDecl>(dc)) |
| dc = method->getDeclContext(); |
| |
| // Find the class or category in which the type we're substituting |
| // was declared. |
| const auto *dcClassDecl = dyn_cast<ObjCInterfaceDecl>(dc); |
| const ObjCCategoryDecl *dcCategoryDecl = nullptr; |
| ObjCTypeParamList *dcTypeParams = nullptr; |
| if (dcClassDecl) { |
| // If the class does not have any type parameters, there's no |
| // substitution to do. |
| dcTypeParams = dcClassDecl->getTypeParamList(); |
| if (!dcTypeParams) |
| return None; |
| } else { |
| // If we are in neither a class nor a category, there's no |
| // substitution to perform. |
| dcCategoryDecl = dyn_cast<ObjCCategoryDecl>(dc); |
| if (!dcCategoryDecl) |
| return None; |
| |
| // If the category does not have any type parameters, there's no |
| // substitution to do. |
| dcTypeParams = dcCategoryDecl->getTypeParamList(); |
| if (!dcTypeParams) |
| return None; |
| |
| dcClassDecl = dcCategoryDecl->getClassInterface(); |
| if (!dcClassDecl) |
| return None; |
| } |
| assert(dcTypeParams && "No substitutions to perform"); |
| assert(dcClassDecl && "No class context"); |
| |
| // Find the underlying object type. |
| const ObjCObjectType *objectType; |
| if (const auto *objectPointerType = getAs<ObjCObjectPointerType>()) { |
| objectType = objectPointerType->getObjectType(); |
| } else if (getAs<BlockPointerType>()) { |
| ASTContext &ctx = dc->getParentASTContext(); |
| objectType = ctx.getObjCObjectType(ctx.ObjCBuiltinIdTy, {}, {}) |
| ->castAs<ObjCObjectType>(); |
| } else { |
| objectType = getAs<ObjCObjectType>(); |
| } |
| |
| /// Extract the class from the receiver object type. |
| ObjCInterfaceDecl *curClassDecl = objectType ? objectType->getInterface() |
| : nullptr; |
| if (!curClassDecl) { |
| // If we don't have a context type (e.g., this is "id" or some |
| // variant thereof), substitute the bounds. |
| return llvm::ArrayRef<QualType>(); |
| } |
| |
| // Follow the superclass chain until we've mapped the receiver type |
| // to the same class as the context. |
| while (curClassDecl != dcClassDecl) { |
| // Map to the superclass type. |
| QualType superType = objectType->getSuperClassType(); |
| if (superType.isNull()) { |
| objectType = nullptr; |
| break; |
| } |
| |
| objectType = superType->castAs<ObjCObjectType>(); |
| curClassDecl = objectType->getInterface(); |
| } |
| |
| // If we don't have a receiver type, or the receiver type does not |
| // have type arguments, substitute in the defaults. |
| if (!objectType || objectType->isUnspecialized()) { |
| return llvm::ArrayRef<QualType>(); |
| } |
| |
| // The receiver type has the type arguments we want. |
| return objectType->getTypeArgs(); |
| } |
| |
| bool Type::acceptsObjCTypeParams() const { |
| if (auto *IfaceT = getAsObjCInterfaceType()) { |
| if (auto *ID = IfaceT->getInterface()) { |
| if (ID->getTypeParamList()) |
| return true; |
| } |
| } |
| |
| return false; |
| } |
| |
| void ObjCObjectType::computeSuperClassTypeSlow() const { |
| // Retrieve the class declaration for this type. If there isn't one |
| // (e.g., this is some variant of "id" or "Class"), then there is no |
| // superclass type. |
| ObjCInterfaceDecl *classDecl = getInterface(); |
| if (!classDecl) { |
| CachedSuperClassType.setInt(true); |
| return; |
| } |
| |
| // Extract the superclass type. |
| const ObjCObjectType *superClassObjTy = classDecl->getSuperClassType(); |
| if (!superClassObjTy) { |
| CachedSuperClassType.setInt(true); |
| return; |
| } |
| |
| ObjCInterfaceDecl *superClassDecl = superClassObjTy->getInterface(); |
| if (!superClassDecl) { |
| CachedSuperClassType.setInt(true); |
| return; |
| } |
| |
| // If the superclass doesn't have type parameters, then there is no |
| // substitution to perform. |
| QualType superClassType(superClassObjTy, 0); |
| ObjCTypeParamList *superClassTypeParams = superClassDecl->getTypeParamList(); |
| if (!superClassTypeParams) { |
| CachedSuperClassType.setPointerAndInt( |
| superClassType->castAs<ObjCObjectType>(), true); |
| return; |
| } |
| |
| // If the superclass reference is unspecialized, return it. |
| if (superClassObjTy->isUnspecialized()) { |
| CachedSuperClassType.setPointerAndInt(superClassObjTy, true); |
| return; |
| } |
| |
| // If the subclass is not parameterized, there aren't any type |
| // parameters in the superclass reference to substitute. |
| ObjCTypeParamList *typeParams = classDecl->getTypeParamList(); |
| if (!typeParams) { |
| CachedSuperClassType.setPointerAndInt( |
| superClassType->castAs<ObjCObjectType>(), true); |
| return; |
| } |
| |
| // If the subclass type isn't specialized, return the unspecialized |
| // superclass. |
| if (isUnspecialized()) { |
| QualType unspecializedSuper |
| = classDecl->getASTContext().getObjCInterfaceType( |
| superClassObjTy->getInterface()); |
| CachedSuperClassType.setPointerAndInt( |
| unspecializedSuper->castAs<ObjCObjectType>(), |
| true); |
| return; |
| } |
| |
| // Substitute the provided type arguments into the superclass type. |
| ArrayRef<QualType> typeArgs = getTypeArgs(); |
| assert(typeArgs.size() == typeParams->size()); |
| CachedSuperClassType.setPointerAndInt( |
| superClassType.substObjCTypeArgs(classDecl->getASTContext(), typeArgs, |
| ObjCSubstitutionContext::Superclass) |
| ->castAs<ObjCObjectType>(), |
| true); |
| } |
| |
| const ObjCInterfaceType *ObjCObjectPointerType::getInterfaceType() const { |
| if (auto interfaceDecl = getObjectType()->getInterface()) { |
| return interfaceDecl->getASTContext().getObjCInterfaceType(interfaceDecl) |
| ->castAs<ObjCInterfaceType>(); |
| } |
| |
| return nullptr; |
| } |
| |
| QualType ObjCObjectPointerType::getSuperClassType() const { |
| QualType superObjectType = getObjectType()->getSuperClassType(); |
| if (superObjectType.isNull()) |
| return superObjectType; |
| |
| ASTContext &ctx = getInterfaceDecl()->getASTContext(); |
| return ctx.getObjCObjectPointerType(superObjectType); |
| } |
| |
| const ObjCObjectType *Type::getAsObjCQualifiedInterfaceType() const { |
| // There is no sugar for ObjCObjectType's, just return the canonical |
| // type pointer if it is the right class. There is no typedef information to |
| // return and these cannot be Address-space qualified. |
| if (const auto *T = getAs<ObjCObjectType>()) |
| if (T->getNumProtocols() && T->getInterface()) |
| return T; |
| return nullptr; |
| } |
| |
| bool Type::isObjCQualifiedInterfaceType() const { |
| return getAsObjCQualifiedInterfaceType() != nullptr; |
| } |
| |
| const ObjCObjectPointerType *Type::getAsObjCQualifiedIdType() const { |
| // There is no sugar for ObjCQualifiedIdType's, just return the canonical |
| // type pointer if it is the right class. |
| if (const auto *OPT = getAs<ObjCObjectPointerType>()) { |
| if (OPT->isObjCQualifiedIdType()) |
| return OPT; |
| } |
| return nullptr; |
| } |
| |
| const ObjCObjectPointerType *Type::getAsObjCQualifiedClassType() const { |
| // There is no sugar for ObjCQualifiedClassType's, just return the canonical |
| // type pointer if it is the right class. |
| if (const auto *OPT = getAs<ObjCObjectPointerType>()) { |
| if (OPT->isObjCQualifiedClassType()) |
| return OPT; |
| } |
| return nullptr; |
| } |
| |
| const ObjCObjectType *Type::getAsObjCInterfaceType() const { |
| if (const auto *OT = getAs<ObjCObjectType>()) { |
| if (OT->getInterface()) |
| return OT; |
| } |
| return nullptr; |
| } |
| |
| const ObjCObjectPointerType *Type::getAsObjCInterfacePointerType() const { |
| if (const auto *OPT = getAs<ObjCObjectPointerType>()) { |
| if (OPT->getInterfaceType()) |
| return OPT; |
| } |
| return nullptr; |
| } |
| |
| const CXXRecordDecl *Type::getPointeeCXXRecordDecl() const { |
| QualType PointeeType; |
| if (const auto *PT = getAs<PointerType>()) |
| PointeeType = PT->getPointeeType(); |
| else if (const auto *RT = getAs<ReferenceType>()) |
| PointeeType = RT->getPointeeType(); |
| else |
| return nullptr; |
| |
| if (const auto *RT = PointeeType->getAs<RecordType>()) |
| return dyn_cast<CXXRecordDecl>(RT->getDecl()); |
| |
| return nullptr; |
| } |
| |
| CXXRecordDecl *Type::getAsCXXRecordDecl() const { |
| return dyn_cast_or_null<CXXRecordDecl>(getAsTagDecl()); |
| } |
| |
| RecordDecl *Type::getAsRecordDecl() const { |
| return dyn_cast_or_null<RecordDecl>(getAsTagDecl()); |
| } |
| |
| TagDecl *Type::getAsTagDecl() const { |
| if (const auto *TT = getAs<TagType>()) |
| return TT->getDecl(); |
| if (const auto *Injected = getAs<InjectedClassNameType>()) |
| return Injected->getDecl(); |
| |
| return nullptr; |
| } |
| |
| bool Type::hasAttr(attr::Kind AK) const { |
| const Type *Cur = this; |
| while (const auto *AT = Cur->getAs<AttributedType>()) { |
| if (AT->getAttrKind() == AK) |
| return true; |
| Cur = AT->getEquivalentType().getTypePtr(); |
| } |
| return false; |
| } |
| |
| namespace { |
| |
| class GetContainedDeducedTypeVisitor : |
| public TypeVisitor<GetContainedDeducedTypeVisitor, Type*> { |
| bool Syntactic; |
| |
| public: |
| GetContainedDeducedTypeVisitor(bool Syntactic = false) |
| : Syntactic(Syntactic) {} |
| |
| using TypeVisitor<GetContainedDeducedTypeVisitor, Type*>::Visit; |
| |
| Type *Visit(QualType T) { |
| if (T.isNull()) |
| return nullptr; |
| return Visit(T.getTypePtr()); |
| } |
| |
| // The deduced type itself. |
| Type *VisitDeducedType(const DeducedType *AT) { |
| return const_cast<DeducedType*>(AT); |
| } |
| |
| // Only these types can contain the desired 'auto' type. |
| |
| Type *VisitElaboratedType(const ElaboratedType *T) { |
| return Visit(T->getNamedType()); |
| } |
| |
| Type *VisitPointerType(const PointerType *T) { |
| return Visit(T->getPointeeType()); |
| } |
| |
| Type *VisitBlockPointerType(const BlockPointerType *T) { |
| return Visit(T->getPointeeType()); |
| } |
| |
| Type *VisitReferenceType(const ReferenceType *T) { |
| return Visit(T->getPointeeTypeAsWritten()); |
| } |
| |
| Type *VisitMemberPointerType(const MemberPointerType *T) { |
| return Visit(T->getPointeeType()); |
| } |
| |
| Type *VisitArrayType(const ArrayType *T) { |
| return Visit(T->getElementType()); |
| } |
| |
| Type *VisitDependentSizedExtVectorType( |
| const DependentSizedExtVectorType *T) { |
| return Visit(T->getElementType()); |
| } |
| |
| Type *VisitVectorType(const VectorType *T) { |
| return Visit(T->getElementType()); |
| } |
| |
| Type *VisitFunctionProtoType(const FunctionProtoType *T) { |
| if (Syntactic && T->hasTrailingReturn()) |
| return const_cast<FunctionProtoType*>(T); |
| return VisitFunctionType(T); |
| } |
| |
| Type *VisitFunctionType(const FunctionType *T) { |
| return Visit(T->getReturnType()); |
| } |
| |
| Type *VisitParenType(const ParenType *T) { |
| return Visit(T->getInnerType()); |
| } |
| |
| Type *VisitAttributedType(const AttributedType *T) { |
| return Visit(T->getModifiedType()); |
| } |
| |
| Type *VisitMacroQualifiedType(const MacroQualifiedType *T) { |
| return Visit(T->getUnderlyingType()); |
| } |
| |
| Type *VisitAdjustedType(const AdjustedType *T) { |
| return Visit(T->getOriginalType()); |
| } |
| |
| Type *VisitPackExpansionType(const PackExpansionType *T) { |
| return Visit(T->getPattern()); |
| } |
| }; |
| |
| } // namespace |
| |
| DeducedType *Type::getContainedDeducedType() const { |
| return cast_or_null<DeducedType>( |
| GetContainedDeducedTypeVisitor().Visit(this)); |
| } |
| |
| bool Type::hasAutoForTrailingReturnType() const { |
| return dyn_cast_or_null<FunctionType>( |
| GetContainedDeducedTypeVisitor(true).Visit(this)); |
| } |
| |
| bool Type::hasIntegerRepresentation() const { |
| if (const auto *VT = dyn_cast<VectorType>(CanonicalType)) |
| return VT->getElementType()->isIntegerType(); |
| else |
| return isIntegerType(); |
| } |
| |
| /// Determine whether this type is an integral type. |
| /// |
| /// This routine determines whether the given type is an integral type per |
| /// C++ [basic.fundamental]p7. Although the C standard does not define the |
| /// term "integral type", it has a similar term "integer type", and in C++ |
| /// the two terms are equivalent. However, C's "integer type" includes |
| /// enumeration types, while C++'s "integer type" does not. The \c ASTContext |
| /// parameter is used to determine whether we should be following the C or |
| /// C++ rules when determining whether this type is an integral/integer type. |
| /// |
| /// For cases where C permits "an integer type" and C++ permits "an integral |
| /// type", use this routine. |
| /// |
| /// For cases where C permits "an integer type" and C++ permits "an integral |
| /// or enumeration type", use \c isIntegralOrEnumerationType() instead. |
| /// |
| /// \param Ctx The context in which this type occurs. |
| /// |
| /// \returns true if the type is considered an integral type, false otherwise. |
| bool Type::isIntegralType(const ASTContext &Ctx) const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) |
| return BT->getKind() >= BuiltinType::Bool && |
| BT->getKind() <= BuiltinType::Int128; |
| |
| // Complete enum types are integral in C. |
| if (!Ctx.getLangOpts().CPlusPlus) |
| if (const auto *ET = dyn_cast<EnumType>(CanonicalType)) |
| return ET->getDecl()->isComplete(); |
| |
| return false; |
| } |
| |
| bool Type::isIntegralOrUnscopedEnumerationType() const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) |
| return BT->getKind() >= BuiltinType::Bool && |
| BT->getKind() <= BuiltinType::Int128; |
| |
| // Check for a complete enum type; incomplete enum types are not properly an |
| // enumeration type in the sense required here. |
| // C++0x: However, if the underlying type of the enum is fixed, it is |
| // considered complete. |
| if (const auto *ET = dyn_cast<EnumType>(CanonicalType)) |
| return ET->getDecl()->isComplete() && !ET->getDecl()->isScoped(); |
| |
| return false; |
| } |
| |
| bool Type::isCharType() const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) |
| return BT->getKind() == BuiltinType::Char_U || |
| BT->getKind() == BuiltinType::UChar || |
| BT->getKind() == BuiltinType::Char_S || |
| BT->getKind() == BuiltinType::SChar; |
| return false; |
| } |
| |
| bool Type::isWideCharType() const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) |
| return BT->getKind() == BuiltinType::WChar_S || |
| BT->getKind() == BuiltinType::WChar_U; |
| return false; |
| } |
| |
| bool Type::isChar8Type() const { |
| if (const BuiltinType *BT = dyn_cast<BuiltinType>(CanonicalType)) |
| return BT->getKind() == BuiltinType::Char8; |
| return false; |
| } |
| |
| bool Type::isChar16Type() const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) |
| return BT->getKind() == BuiltinType::Char16; |
| return false; |
| } |
| |
| bool Type::isChar32Type() const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) |
| return BT->getKind() == BuiltinType::Char32; |
| return false; |
| } |
| |
| /// Determine whether this type is any of the built-in character |
| /// types. |
| bool Type::isAnyCharacterType() const { |
| const auto *BT = dyn_cast<BuiltinType>(CanonicalType); |
| if (!BT) return false; |
| switch (BT->getKind()) { |
| default: return false; |
| case BuiltinType::Char_U: |
| case BuiltinType::UChar: |
| case BuiltinType::WChar_U: |
| case BuiltinType::Char8: |
| case BuiltinType::Char16: |
| case BuiltinType::Char32: |
| case BuiltinType::Char_S: |
| case BuiltinType::SChar: |
| case BuiltinType::WChar_S: |
| return true; |
| } |
| } |
| |
| /// isSignedIntegerType - Return true if this is an integer type that is |
| /// signed, according to C99 6.2.5p4 [char, signed char, short, int, long..], |
| /// an enum decl which has a signed representation |
| bool Type::isSignedIntegerType() const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) { |
| return BT->getKind() >= BuiltinType::Char_S && |
| BT->getKind() <= BuiltinType::Int128; |
| } |
| |
| if (const EnumType *ET = dyn_cast<EnumType>(CanonicalType)) { |
| // Incomplete enum types are not treated as integer types. |
| // FIXME: In C++, enum types are never integer types. |
| if (ET->getDecl()->isComplete() && !ET->getDecl()->isScoped()) |
| return ET->getDecl()->getIntegerType()->isSignedIntegerType(); |
| } |
| |
| return false; |
| } |
| |
| bool Type::isSignedIntegerOrEnumerationType() const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) { |
| return BT->getKind() >= BuiltinType::Char_S && |
| BT->getKind() <= BuiltinType::Int128; |
| } |
| |
| if (const auto *ET = dyn_cast<EnumType>(CanonicalType)) { |
| if (ET->getDecl()->isComplete()) |
| return ET->getDecl()->getIntegerType()->isSignedIntegerType(); |
| } |
| |
| return false; |
| } |
| |
| bool Type::hasSignedIntegerRepresentation() const { |
| if (const auto *VT = dyn_cast<VectorType>(CanonicalType)) |
| return VT->getElementType()->isSignedIntegerOrEnumerationType(); |
| else |
| return isSignedIntegerOrEnumerationType(); |
| } |
| |
| /// isUnsignedIntegerType - Return true if this is an integer type that is |
| /// unsigned, according to C99 6.2.5p6 [which returns true for _Bool], an enum |
| /// decl which has an unsigned representation |
| bool Type::isUnsignedIntegerType() const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) { |
| return BT->getKind() >= BuiltinType::Bool && |
| BT->getKind() <= BuiltinType::UInt128; |
| } |
| |
| if (const auto *ET = dyn_cast<EnumType>(CanonicalType)) { |
| // Incomplete enum types are not treated as integer types. |
| // FIXME: In C++, enum types are never integer types. |
| if (ET->getDecl()->isComplete() && !ET->getDecl()->isScoped()) |
| return ET->getDecl()->getIntegerType()->isUnsignedIntegerType(); |
| } |
| |
| return false; |
| } |
| |
| bool Type::isUnsignedIntegerOrEnumerationType() const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) { |
| return BT->getKind() >= BuiltinType::Bool && |
| BT->getKind() <= BuiltinType::UInt128; |
| } |
| |
| if (const auto *ET = dyn_cast<EnumType>(CanonicalType)) { |
| if (ET->getDecl()->isComplete()) |
| return ET->getDecl()->getIntegerType()->isUnsignedIntegerType(); |
| } |
| |
| return false; |
| } |
| |
| bool Type::hasUnsignedIntegerRepresentation() const { |
| if (const auto *VT = dyn_cast<VectorType>(CanonicalType)) |
| return VT->getElementType()->isUnsignedIntegerOrEnumerationType(); |
| else |
| return isUnsignedIntegerOrEnumerationType(); |
| } |
| |
| bool Type::isFloatingType() const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) |
| return BT->getKind() >= BuiltinType::Half && |
| BT->getKind() <= BuiltinType::Float128; |
| if (const auto *CT = dyn_cast<ComplexType>(CanonicalType)) |
| return CT->getElementType()->isFloatingType(); |
| return false; |
| } |
| |
| bool Type::hasFloatingRepresentation() const { |
| if (const auto *VT = dyn_cast<VectorType>(CanonicalType)) |
| return VT->getElementType()->isFloatingType(); |
| else |
| return isFloatingType(); |
| } |
| |
| bool Type::isRealFloatingType() const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) |
| return BT->isFloatingPoint(); |
| return false; |
| } |
| |
| bool Type::isRealType() const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) |
| return BT->getKind() >= BuiltinType::Bool && |
| BT->getKind() <= BuiltinType::Float128; |
| if (const auto *ET = dyn_cast<EnumType>(CanonicalType)) |
| return ET->getDecl()->isComplete() && !ET->getDecl()->isScoped(); |
| return false; |
| } |
| |
| bool Type::isArithmeticType() const { |
| if (const auto *BT = dyn_cast<BuiltinType>(CanonicalType)) |
| return BT->getKind() >= BuiltinType::Bool && |
| BT->getKind() <= BuiltinType::Float128; |
| if (const auto *ET = dyn_cast<EnumType>(CanonicalType)) |
| // GCC allows forward declaration of enum types (forbid by C99 6.7.2.3p2). |
| // If a body isn't seen by the time we get here, return false. |
| // |
| // C++0x: Enumerations are not arithmetic types. For now, just return |
| // false for scoped enumerations since that will disable any |
| // unwanted implicit conversions. |
| return !ET->getDecl()->isScoped() && ET->getDecl()->isComplete(); |
| return isa<ComplexType>(CanonicalType); |
| } |
| |
| Type::ScalarTypeKind Type::getScalarTypeKind() const { |
| assert(isScalarType()); |
| |
| const Type *T = CanonicalType.getTypePtr(); |
| if (const auto *BT = dyn_cast<BuiltinType>(T)) { |
| if (BT->getKind() == BuiltinType::Bool) return STK_Bool; |
| if (BT->getKind() == BuiltinType::NullPtr) return STK_CPointer; |
| if (BT->isInteger()) return STK_Integral; |
| if (BT->isFloatingPoint()) return STK_Floating; |
| if (BT->isFixedPointType()) return STK_FixedPoint; |
| llvm_unreachable("unknown scalar builtin type"); |
| } else if (isa<PointerType>(T)) { |
| return STK_CPointer; |
| } else if (isa<BlockPointerType>(T)) { |
| return STK_BlockPointer; |
| } else if (isa<ObjCObjectPointerType>(T)) { |
| return STK_ObjCObjectPointer; |
| } else if (isa<MemberPointerType>(T)) { |
| return STK_MemberPointer; |
| } else if (isa<EnumType>(T)) { |
| assert(cast<EnumType>(T)->getDecl()->isComplete()); |
| return STK_Integral; |
| } else if (const auto *CT = dyn_cast<ComplexType>(T)) { |
| if (CT->getElementType()->isRealFloatingType()) |
| return STK_FloatingComplex; |
| return STK_IntegralComplex; |
| } |
| |
| llvm_unreachable("unknown scalar type"); |
| } |
| |
| /// Determines whether the type is a C++ aggregate type or C |
| /// aggregate or union type. |
| /// |
| /// An aggregate type is an array or a class type (struct, union, or |
| /// class) that has no user-declared constructors, no private or |
| /// protected non-static data members, no base classes, and no virtual |
| /// functions (C++ [dcl.init.aggr]p1). The notion of an aggregate type |
| /// subsumes the notion of C aggregates (C99 6.2.5p21) because it also |
| /// includes union types. |
| bool Type::isAggregateType() const { |
| if (const auto *Record = dyn_cast<RecordType>(CanonicalType)) { |
| if (const auto *ClassDecl = dyn_cast<CXXRecordDecl>(Record->getDecl())) |
| return ClassDecl->isAggregate(); |
| |
| return true; |
| } |
| |
| return isa<ArrayType>(CanonicalType); |
| } |
| |
| /// isConstantSizeType - Return true if this is not a variable sized type, |
| /// according to the rules of C99 6.7.5p3. It is not legal to call this on |
| /// incomplete types or dependent types. |
| bool Type::isConstantSizeType() const { |
| assert(!isIncompleteType() && "This doesn't make sense for incomplete types"); |
| assert(!isDependentType() && "This doesn't make sense for dependent types"); |
| // The VAT must have a size, as it is known to be complete. |
| return !isa<VariableArrayType>(CanonicalType); |
| } |
| |
| /// isIncompleteType - Return true if this is an incomplete type (C99 6.2.5p1) |
| /// - a type that can describe objects, but which lacks information needed to |
| /// determine its size. |
| bool Type::isIncompleteType(NamedDecl **Def) const { |
| if (Def) |
| *Def = nullptr; |
| |
| switch (CanonicalType->getTypeClass()) { |
| default: return false; |
| case Builtin: |
| // Void is the only incomplete builtin type. Per C99 6.2.5p19, it can never |
| // be completed. |
| return isVoidType(); |
| case Enum: { |
| EnumDecl *EnumD = cast<EnumType>(CanonicalType)->getDecl(); |
| if (Def) |
| *Def = EnumD; |
| return !EnumD->isComplete(); |
| } |
| case Record: { |
| // A tagged type (struct/union/enum/class) is incomplete if the decl is a |
| // forward declaration, but not a full definition (C99 6.2.5p22). |
| RecordDecl *Rec = cast<RecordType>(CanonicalType)->getDecl(); |
| if (Def) |
| *Def = Rec; |
| return !Rec->isCompleteDefinition(); |
| } |
| case ConstantArray: |
| // An array is incomplete if its element type is incomplete |
| // (C++ [dcl.array]p1). |
| // We don't handle variable arrays (they're not allowed in C++) or |
| // dependent-sized arrays (dependent types are never treated as incomplete). |
| return cast<ArrayType>(CanonicalType)->getElementType() |
| ->isIncompleteType(Def); |
| case IncompleteArray: |
| // An array of unknown size is an incomplete type (C99 6.2.5p22). |
| return true; |
| case MemberPointer: { |
| // Member pointers in the MS ABI have special behavior in |
| // RequireCompleteType: they attach a MSInheritanceAttr to the CXXRecordDecl |
| // to indicate which inheritance model to use. |
| auto *MPTy = cast<MemberPointerType>(CanonicalType); |
| const Type *ClassTy = MPTy->getClass(); |
| // Member pointers with dependent class types don't get special treatment. |
| if (ClassTy->isDependentType()) |
| return false; |
| const CXXRecordDecl *RD = ClassTy->getAsCXXRecordDecl(); |
| ASTContext &Context = RD->getASTContext(); |
| // Member pointers not in the MS ABI don't get special treatment. |
| if (!Context.getTargetInfo().getCXXABI().isMicrosoft()) |
| return false; |
| // The inheritance attribute might only be present on the most recent |
| // CXXRecordDecl, use that one. |
| RD = RD->getMostRecentNonInjectedDecl(); |
| // Nothing interesting to do if the inheritance attribute is already set. |
| if (RD->hasAttr<MSInheritanceAttr>()) |
| return false; |
| return true; |
| } |
| case ObjCObject: |
| return cast<ObjCObjectType>(CanonicalType)->getBaseType() |
| ->isIncompleteType(Def); |
| case ObjCInterface: { |
| // ObjC interfaces are incomplete if they are @class, not @interface. |
| ObjCInterfaceDecl *Interface |
| = cast<ObjCInterfaceType>(CanonicalType)->getDecl(); |
| if (Def) |
| *Def = Interface; |
| return !Interface->hasDefinition(); |
| } |
| } |
| } |
| |
| bool QualType::isPODType(const ASTContext &Context) const { |
| // C++11 has a more relaxed definition of POD. |
| if (Context.getLangOpts().CPlusPlus11) |
| return isCXX11PODType(Context); |
| |
| return isCXX98PODType(Context); |
| } |
| |
| bool QualType::isCXX98PODType(const ASTContext &Context) const { |
| // The compiler shouldn't query this for incomplete types, but the user might. |
| // We return false for that case. Except for incomplete arrays of PODs, which |
| // are PODs according to the standard. |
| if (isNull()) |
| return false; |
| |
| if ((*this)->isIncompleteArrayType()) |
| return Context.getBaseElementType(*this).isCXX98PODType(Context); |
| |
| if ((*this)->isIncompleteType()) |
| return false; |
| |
| if (hasNonTrivialObjCLifetime()) |
| return false; |
| |
| QualType CanonicalType = getTypePtr()->CanonicalType; |
| switch (CanonicalType->getTypeClass()) { |
| // Everything not explicitly mentioned is not POD. |
| default: return false; |
| case Type::VariableArray: |
| case Type::ConstantArray: |
| // IncompleteArray is handled above. |
| return Context.getBaseElementType(*this).isCXX98PODType(Context); |
| |
| case Type::ObjCObjectPointer: |
| case Type::BlockPointer: |
| case Type::Builtin: |
| case Type::Complex: |
| case Type::Pointer: |
| case Type::MemberPointer: |
| case Type::Vector: |
| case Type::ExtVector: |
| return true; |
| |
| case Type::Enum: |
| return true; |
| |
| case Type::Record: |
| if (const auto *ClassDecl = |
| dyn_cast<CXXRecordDecl>(cast<RecordType>(CanonicalType)->getDecl())) |
| return ClassDecl->isPOD(); |
| |
| // C struct/union is POD. |
| return true; |
| } |
| } |
| |
| bool QualType::isTrivialType(const ASTContext &Context) const { |
| // The compiler shouldn't query this for incomplete types, but the user might. |
| // We return false for that case. Except for incomplete arrays of PODs, which |
| // are PODs according to the standard. |
| if (isNull()) |
| return false; |
| |
| if ((*this)->isArrayType()) |
| return Context.getBaseElementType(*this).isTrivialType(Context); |
| |
| // Return false for incomplete types after skipping any incomplete array |
| // types which are expressly allowed by the standard and thus our API. |
| if ((*this)->isIncompleteType()) |
| return false; |
| |
| if (hasNonTrivialObjCLifetime()) |
| return false; |
| |
| QualType CanonicalType = getTypePtr()->CanonicalType; |
| if (CanonicalType->isDependentType()) |
| return false; |
| |
| // C++0x [basic.types]p9: |
| // Scalar types, trivial class types, arrays of such types, and |
| // cv-qualified versions of these types are collectively called trivial |
| // types. |
| |
| // As an extension, Clang treats vector types as Scalar types. |
| if (CanonicalType->isScalarType() || CanonicalType->isVectorType()) |
| return true; |
| if (const auto *RT = CanonicalType->getAs<RecordType>()) { |
| if (const auto *ClassDecl = dyn_cast<CXXRecordDecl>(RT->getDecl())) { |
| // C++11 [class]p6: |
| // A trivial class is a class that has a default constructor, |
| // has no non-trivial default constructors, and is trivially |
| // copyable. |
| return ClassDecl->hasDefaultConstructor() && |
| !ClassDecl->hasNonTrivialDefaultConstructor() && |
| ClassDecl->isTriviallyCopyable(); |
| } |
| |
| return true; |
| } |
| |
| // No other types can match. |
| return false; |
| } |
| |
| bool QualType::isTriviallyCopyableType(const ASTContext &Context) const { |
| if ((*this)->isArrayType()) |
| return Context.getBaseElementType(*this).isTriviallyCopyableType(Context); |
| |
| if (hasNonTrivialObjCLifetime()) |
| return false; |
| |
| // C++11 [basic.types]p9 - See Core 2094 |
| // Scalar types, trivially copyable class types, arrays of such types, and |
| // cv-qualified versions of these types are collectively |
| // called trivially copyable types. |
| |
| QualType CanonicalType = getCanonicalType(); |
| if (CanonicalType->isDependentType()) |
| return false; |
| |
| // Return false for incomplete types after skipping any incomplete array types |
| // which are expressly allowed by the standard and thus our API. |
| if (CanonicalType->isIncompleteType()) |
| return false; |
| |
| // As an extension, Clang treats vector types as Scalar types. |
| if (CanonicalType->isScalarType() || CanonicalType->isVectorType()) |
| return true; |
| |
| if (const auto *RT = CanonicalType->getAs<RecordType>()) { |
| if (const auto *ClassDecl = dyn_cast<CXXRecordDecl>(RT->getDecl())) { |
| if (!ClassDecl->isTriviallyCopyable()) return false; |
| } |
| |
| return true; |
| } |
| |
| // No other types can match. |
| return false; |
| } |
| |
| bool QualType::isNonWeakInMRRWithObjCWeak(const ASTContext &Context) const { |
| return !Context.getLangOpts().ObjCAutoRefCount && |
| Context.getLangOpts().ObjCWeak && |
| getObjCLifetime() != Qualifiers::OCL_Weak; |
| } |
| |
| bool QualType::hasNonTrivialToPrimitiveDefaultInitializeCUnion(const RecordDecl *RD) { |
| return RD->hasNonTrivialToPrimitiveDefaultInitializeCUnion(); |
| } |
| |
| bool QualType::hasNonTrivialToPrimitiveDestructCUnion(const RecordDecl *RD) { |
| return RD->hasNonTrivialToPrimitiveDestructCUnion(); |
| } |
| |
| bool QualType::hasNonTrivialToPrimitiveCopyCUnion(const RecordDecl *RD) { |
| return RD->hasNonTrivialToPrimitiveCopyCUnion(); |
| } |
| |
| QualType::PrimitiveDefaultInitializeKind |
| QualType::isNonTrivialToPrimitiveDefaultInitialize() const { |
| if (const auto *RT = |
| getTypePtr()->getBaseElementTypeUnsafe()->getAs<RecordType>()) |
| if (RT->getDecl()->isNonTrivialToPrimitiveDefaultInitialize()) |
| return PDIK_Struct; |
| |
| switch (getQualifiers().getObjCLifetime()) { |
| case Qualifiers::OCL_Strong: |
| return PDIK_ARCStrong; |
| case Qualifiers::OCL_Weak: |
| return PDIK_ARCWeak; |
| default: |
| return PDIK_Trivial; |
| } |
| } |
| |
| QualType::PrimitiveCopyKind QualType::isNonTrivialToPrimitiveCopy() const { |
| if (const auto *RT = |
| getTypePtr()->getBaseElementTypeUnsafe()->getAs<RecordType>()) |
| if (RT->getDecl()->isNonTrivialToPrimitiveCopy()) |
| return PCK_Struct; |
| |
| Qualifiers Qs = getQualifiers(); |
| switch (Qs.getObjCLifetime()) { |
| case Qualifiers::OCL_Strong: |
| return PCK_ARCStrong; |
| case Qualifiers::OCL_Weak: |
| return PCK_ARCWeak; |
| default: |
| return Qs.hasVolatile() ? PCK_VolatileTrivial : PCK_Trivial; |
| } |
| } |
| |
| QualType::PrimitiveCopyKind |
| QualType::isNonTrivialToPrimitiveDestructiveMove() const { |
| return isNonTrivialToPrimitiveCopy(); |
| } |
| |
| bool Type::isLiteralType(const ASTContext &Ctx) const { |
| if (isDependentType()) |
| return false; |
| |
| // C++1y [basic.types]p10: |
| // A type is a literal type if it is: |
| // -- cv void; or |
| if (Ctx.getLangOpts().CPlusPlus14 && isVoidType()) |
| return true; |
| |
| // C++11 [basic.types]p10: |
| // A type is a literal type if it is: |
| // [...] |
| // -- an array of literal type other than an array of runtime bound; or |
| if (isVariableArrayType()) |
| return false; |
| const Type *BaseTy = getBaseElementTypeUnsafe(); |
| assert(BaseTy && "NULL element type"); |
| |
| // Return false for incomplete types after skipping any incomplete array |
| // types; those are expressly allowed by the standard and thus our API. |
| if (BaseTy->isIncompleteType()) |
| return false; |
| |
| // C++11 [basic.types]p10: |
| // A type is a literal type if it is: |
| // -- a scalar type; or |
| // As an extension, Clang treats vector types and complex types as |
| // literal types. |
| if (BaseTy->isScalarType() || BaseTy->isVectorType() || |
| BaseTy->isAnyComplexType()) |
| return true; |
| // -- a reference type; or |
| if (BaseTy->isReferenceType()) |
| return true; |
| // -- a class type that has all of the following properties: |
| if (const auto *RT = BaseTy->getAs<RecordType>()) { |
| // -- a trivial destructor, |
| // -- every constructor call and full-expression in the |
| // brace-or-equal-initializers for non-static data members (if any) |
| // is a constant expression, |
| // -- it is an aggregate type or has at least one constexpr |
| // constructor or constructor template that is not a copy or move |
| // constructor, and |
| // -- all non-static data members and base classes of literal types |
| // |
| // We resolve DR1361 by ignoring the second bullet. |
| if (const auto *ClassDecl = dyn_cast<CXXRecordDecl>(RT->getDecl())) |
| return ClassDecl->isLiteral(); |
| |
| return true; |
| } |
| |
| // We treat _Atomic T as a literal type if T is a literal type. |
| if (const auto *AT = BaseTy->getAs<AtomicType>()) |
| return AT->getValueType()->isLiteralType(Ctx); |
| |
| // If this type hasn't been deduced yet, then conservatively assume that |
| // it'll work out to be a literal type. |
| if (isa<AutoType>(BaseTy->getCanonicalTypeInternal())) |
| return true; |
| |
| return false; |
| } |
| |
| bool Type::isStandardLayoutType() const { |
| if (isDependentType()) |
| return false; |
| |
| // C++0x [basic.types]p9: |
| // Scalar types, standard-layout class types, arrays of such types, and |
| // cv-qualified versions of these types are collectively called |
| // standard-layout types. |
| const Type *BaseTy = getBaseElementTypeUnsafe(); |
| assert(BaseTy && "NULL element type"); |
| |
| // Return false for incomplete types after skipping any incomplete array |
| // types which are expressly allowed by the standard and thus our API. |
| if (BaseTy->isIncompleteType()) |
| return false; |
| |
| // As an extension, Clang treats vector types as Scalar types. |
| if (BaseTy->isScalarType() || BaseTy->isVectorType()) return true; |
| if (const auto *RT = BaseTy->getAs<RecordType>()) { |
| if (const auto *ClassDecl = dyn_cast<CXXRecordDecl>(RT->getDecl())) |
| if (!ClassDecl->isStandardLayout()) |
| return false; |
| |
| // Default to 'true' for non-C++ class types. |
| // FIXME: This is a bit dubious, but plain C structs should trivially meet |
| // all the requirements of standard layout classes. |
| return true; |
| } |
| |
| // No other types can match. |
| return false; |
| } |
| |
| // This is effectively the intersection of isTrivialType and |
| // isStandardLayoutType. We implement it directly to avoid redundant |
| // conversions from a type to a CXXRecordDecl. |
| bool QualType::isCXX11PODType(const ASTContext &Context) const { |
| const Type *ty = getTypePtr(); |
| if (ty->isDependentType()) |
| return false; |
| |
| if (hasNonTrivialObjCLifetime()) |
| return false; |
| |
| // C++11 [basic.types]p9: |
| // Scalar types, POD classes, arrays of such types, and cv-qualified |
| // versions of these types are collectively called trivial types. |
| const Type *BaseTy = ty->getBaseElementTypeUnsafe(); |
| assert(BaseTy && "NULL element type"); |
| |
| // Return false for incomplete types after skipping any incomplete array |
| // types which are expressly allowed by the standard and thus our API. |
| if (BaseTy->isIncompleteType()) |
| return false; |
| |
| // As an extension, Clang treats vector types as Scalar types. |
| if (BaseTy->isScalarType() || BaseTy->isVectorType()) return true; |
| if (const auto *RT = BaseTy->getAs<RecordType>()) { |
| if (const auto *ClassDecl = dyn_cast<CXXRecordDecl>(RT->getDecl())) { |
| // C++11 [class]p10: |
| // A POD struct is a non-union class that is both a trivial class [...] |
| if (!ClassDecl->isTrivial()) return false; |
| |
| // C++11 [class]p10: |
| // A POD struct is a non-union class that is both a trivial class and |
| // a standard-layout class [...] |
| if (!ClassDecl->isStandardLayout()) return false; |
| |
| // C++11 [class]p10: |
| // A POD struct is a non-union class that is both a trivial class and |
| // a standard-layout class, and has no non-static data members of type |
| // non-POD struct, non-POD union (or array of such types). [...] |
| // |
| // We don't directly query the recursive aspect as the requirements for |
| // both standard-layout classes and trivial classes apply recursively |
| // already. |
| } |
| |
| return true; |
| } |
| |
| // No other types can match. |
| return false; |
| } |
| |
| bool Type::isNothrowT() const { |
| if (const auto *RD = getAsCXXRecordDecl()) { |
| IdentifierInfo *II = RD->getIdentifier(); |
| if (II && II->isStr("nothrow_t") && RD->isInStdNamespace()) |
| return true; |
| } |
| return false; |
| } |
| |
| bool Type::isAlignValT() const { |
| if (const auto *ET = getAs<EnumType>()) { |
| IdentifierInfo *II = ET->getDecl()->getIdentifier(); |
| if (II && II->isStr("align_val_t") && ET->getDecl()->isInStdNamespace()) |
| return true; |
| } |
| return false; |
| } |
| |
| bool Type::isStdByteType() const { |
| if (const auto *ET = getAs<EnumType>()) { |
| IdentifierInfo *II = ET->getDecl()->getIdentifier(); |
| if (II && II->isStr("byte") && ET->getDecl()->isInStdNamespace()) |
| return true; |
| } |
| return false; |
| } |
| |
| bool Type::isPromotableIntegerType() const { |
| if (const auto *BT = getAs<BuiltinType>()) |
| switch (BT->getKind()) { |
| case BuiltinType::Bool: |
| case BuiltinType::Char_S: |
| case BuiltinType::Char_U: |
| case BuiltinType::SChar: |
| case BuiltinType::UChar: |
| case BuiltinType::Short: |
| case BuiltinType::UShort: |
| case BuiltinType::WChar_S: |
| case BuiltinType::WChar_U: |
| case BuiltinType::Char8: |
| case BuiltinType::Char16: |
| case BuiltinType::Char32: |
| return true; |
| default: |
| return false; |
| } |
| |
| // Enumerated types are promotable to their compatible integer types |
| // (C99 6.3.1.1) a.k.a. its underlying type (C++ [conv.prom]p2). |
| if (const auto *ET = getAs<EnumType>()){ |
| if (this->isDependentType() || ET->getDecl()->getPromotionType().isNull() |
| || ET->getDecl()->isScoped()) |
| return false; |
| |
| return true; |
| } |
| |
| return false; |
| } |
| |
| bool Type::isSpecifierType() const { |
| // Note that this intentionally does not use the canonical type. |
| switch (getTypeClass()) { |
| case Builtin: |
| case Record: |
| case Enum: |
| case Typedef: |
| case Complex: |
| case TypeOfExpr: |
| case TypeOf: |
| case TemplateTypeParm: |
| case SubstTemplateTypeParm: |
| case TemplateSpecialization: |
| case Elaborated: |
| case DependentName: |
| case DependentTemplateSpecialization: |
| case ObjCInterface: |
| case ObjCObject: |
| case ObjCObjectPointer: // FIXME: object pointers aren't really specifiers |
| return true; |
| default: |
| return false; |
| } |
| } |
| |
| ElaboratedTypeKeyword |
| TypeWithKeyword::getKeywordForTypeSpec(unsigned TypeSpec) { |
| switch (TypeSpec) { |
| default: return ETK_None; |
| case TST_typename: return ETK_Typename; |
| case TST_class: return ETK_Class; |
| case TST_struct: return ETK_Struct; |
| case TST_interface: return ETK_Interface; |
| case TST_union: return ETK_Union; |
| case TST_enum: return ETK_Enum; |
| } |
| } |
| |
| TagTypeKind |
| TypeWithKeyword::getTagTypeKindForTypeSpec(unsigned TypeSpec) { |
| switch(TypeSpec) { |
| case TST_class: return TTK_Class; |
| case TST_struct: return TTK_Struct; |
| case TST_interface: return TTK_Interface; |
| case TST_union: return TTK_Union; |
| case TST_enum: return TTK_Enum; |
| } |
| |
| llvm_unreachable("Type specifier is not a tag type kind."); |
| } |
| |
| ElaboratedTypeKeyword |
| TypeWithKeyword::getKeywordForTagTypeKind(TagTypeKind Kind) { |
| switch (Kind) { |
| case TTK_Class: return ETK_Class; |
| case TTK_Struct: return ETK_Struct; |
| case TTK_Interface: return ETK_Interface; |
| case TTK_Union: return ETK_Union; |
| case TTK_Enum: return ETK_Enum; |
| } |
| llvm_unreachable("Unknown tag type kind."); |
| } |
| |
| TagTypeKind |
| TypeWithKeyword::getTagTypeKindForKeyword(ElaboratedTypeKeyword Keyword) { |
| switch (Keyword) { |
| case ETK_Class: return TTK_Class; |
| case ETK_Struct: return TTK_Struct; |
| case ETK_Interface: return TTK_Interface; |
| case ETK_Union: return TTK_Union; |
| case ETK_Enum: return TTK_Enum; |
| case ETK_None: // Fall through. |
| case ETK_Typename: |
| llvm_unreachable("Elaborated type keyword is not a tag type kind."); |
| } |
| llvm_unreachable("Unknown elaborated type keyword."); |
| } |
| |
| bool |
| TypeWithKeyword::KeywordIsTagTypeKind(ElaboratedTypeKeyword Keyword) { |
| switch (Keyword) { |
| case ETK_None: |
| case ETK_Typename: |
| return false; |
| case ETK_Class: |
| case ETK_Struct: |
| case ETK_Interface: |
| case ETK_Union: |
| case ETK_Enum: |
| return true; |
| } |
| llvm_unreachable("Unknown elaborated type keyword."); |
| } |
| |
| StringRef TypeWithKeyword::getKeywordName(ElaboratedTypeKeyword Keyword) { |
| switch (Keyword) { |
| case ETK_None: return {}; |
| case ETK_Typename: return "typename"; |
| case ETK_Class: return "class"; |
| case ETK_Struct: return "struct"; |
| case ETK_Interface: return "__interface"; |
| case ETK_Union: return "union"; |
| case ETK_Enum: return "enum"; |
| } |
| |
| llvm_unreachable("Unknown elaborated type keyword."); |
| } |
| |
| DependentTemplateSpecializationType::DependentTemplateSpecializationType( |
| ElaboratedTypeKeyword Keyword, |
| NestedNameSpecifier *NNS, const IdentifierInfo *Name, |
| ArrayRef<TemplateArgument> Args, |
| QualType Canon) |
| : TypeWithKeyword(Keyword, DependentTemplateSpecialization, Canon, true, true, |
| /*VariablyModified=*/false, |
| NNS && NNS->containsUnexpandedParameterPack()), |
| NNS(NNS), Name(Name) { |
| DependentTemplateSpecializationTypeBits.NumArgs = Args.size(); |
| assert((!NNS || NNS->isDependent()) && |
| "DependentTemplateSpecializatonType requires dependent qualifier"); |
| TemplateArgument *ArgBuffer = getArgBuffer(); |
| for (const TemplateArgument &Arg : Args) { |
| if (Arg.containsUnexpandedParameterPack()) |
| setContainsUnexpandedParameterPack(); |
| |
| new (ArgBuffer++) TemplateArgument(Arg); |
| } |
| } |
| |
| void |
| DependentTemplateSpecializationType::Profile(llvm::FoldingSetNodeID &ID, |
| const ASTContext &Context, |
| ElaboratedTypeKeyword Keyword, |
| NestedNameSpecifier *Qualifier, |
| const IdentifierInfo *Name, |
| ArrayRef<TemplateArgument> Args) { |
| ID.AddInteger(Keyword); |
| ID.AddPointer(Qualifier); |
| ID.AddPointer(Name); |
| for (const TemplateArgument &Arg : Args) |
| Arg.Profile(ID, Context); |
| } |
| |
| bool Type::isElaboratedTypeSpecifier() const { |
| ElaboratedTypeKeyword Keyword; |
| if (const auto *Elab = dyn_cast<ElaboratedType>(this)) |
| Keyword = Elab->getKeyword(); |
| else if (const auto *DepName = dyn_cast<DependentNameType>(this)) |
| Keyword = DepName->getKeyword(); |
| else if (const auto *DepTST = |
| dyn_cast<DependentTemplateSpecializationType>(this)) |
| Keyword = DepTST->getKeyword(); |
| else |
| return false; |
| |
| return TypeWithKeyword::KeywordIsTagTypeKind(Keyword); |
| } |
| |
| const char *Type::getTypeClassName() const { |
| switch (TypeBits.TC) { |
| #define ABSTRACT_TYPE(Derived, Base) |
| #define TYPE(Derived, Base) case Derived: return #Derived; |
| #include "clang/AST/TypeNodes.inc" |
| } |
| |
| llvm_unreachable("Invalid type class."); |
| } |
| |
| StringRef BuiltinType::getName(const PrintingPolicy &Policy) const { |
| switch (getKind()) { |
| case Void: |
| return "void"; |
| case Bool: |
| return Policy.Bool ? "bool" : "_Bool"; |
| case Char_S: |
| return "char"; |
| case Char_U: |
| return "char"; |
| case SChar: |
| return "signed char"; |
| case Short: |
| return "short"; |
| case Int: |
| return "int"; |
| case Long: |
| return "long"; |
| case LongLong: |
| return "long long"; |
| case Int128: |
| return "__int128"; |
| case UChar: |
| return "unsigned char"; |
| case UShort: |
| return "unsigned short"; |
| case UInt: |
| return "unsigned int"; |
| case ULong: |
| return "unsigned long"; |
| case ULongLong: |
| return "unsigned long long"; |
| case UInt128: |
| return "unsigned __int128"; |
| case Half: |
| return Policy.Half ? "half" : "__fp16"; |
| case Float: |
| return "float"; |
| case Double: |
| return "double"; |
| case LongDouble: |
| return "long double"; |
| case ShortAccum: |
| return "short _Accum"; |
| case Accum: |
| return "_Accum"; |
| case LongAccum: |
| return "long _Accum"; |
| case UShortAccum: |
| return "unsigned short _Accum"; |
| case UAccum: |
| return "unsigned _Accum"; |
| case ULongAccum: |
| return "unsigned long _Accum"; |
| case BuiltinType::ShortFract: |
| return "short _Fract"; |
| case BuiltinType::Fract: |
| return "_Fract"; |
| case BuiltinType::LongFract: |
| return "long _Fract"; |
| case BuiltinType::UShortFract: |
| return "unsigned short _Fract"; |
| case BuiltinType::UFract: |
| return "unsigned _Fract"; |
| case BuiltinType::ULongFract: |
| return "unsigned long _Fract"; |
| case BuiltinType::SatShortAccum: |
| return "_Sat short _Accum"; |
| case BuiltinType::SatAccum: |
| return "_Sat _Accum"; |
| case BuiltinType::SatLongAccum: |
| return "_Sat long _Accum"; |
| case BuiltinType::SatUShortAccum: |
| return "_Sat unsigned short _Accum"; |
| case BuiltinType::SatUAccum: |
| return "_Sat unsigned _Accum"; |
| case BuiltinType::SatULongAccum: |
<