PtrTypesSemantics.cpp

Go to the documentation of this file.

//=======- PtrTypesSemantics.cpp ---------------------------------*- C++ -*-==//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
 
#include "PtrTypesSemantics.h"
#include "ASTUtils.h"
#include "clang/AST/Attr.h"
#include "clang/AST/CXXInheritance.h"
#include "clang/AST/Decl.h"
#include "clang/AST/DeclCXX.h"
#include "clang/AST/DeclTemplate.h"
#include "clang/AST/ExprCXX.h"
#include "clang/AST/StmtVisitor.h"
#include "clang/Analysis/Analyses/LifetimeSafety/LifetimeAnnotations.h"
#include "clang/Analysis/DomainSpecific/CocoaConventions.h"
#include "llvm/ADT/StringSet.h"
#include <optional>
 
using namespace clang;
 
namespace {
 
bool hasPublicMethodInBaseClass(const CXXRecordDecl *R, StringRef NameToMatch) {
  assert(R);
  assert(R->hasDefinition());
 
  for (const CXXMethodDecl *MD : R->methods()) {
    const auto MethodName = safeGetName(MD);
    if (MethodName == NameToMatch && MD->getAccess() == AS_public)
      return true;
  }
 
  for (const Decl *D : R->decls()) {
    const auto *Shadow = dyn_cast<UsingShadowDecl>(D);
    if (!Shadow || Shadow->getAccess() != AS_public)
      continue;
    const auto *MD = dyn_cast<CXXMethodDecl>(Shadow->getTargetDecl());
    if (MD && safeGetName(MD) == NameToMatch)
      return true;
  }
  return false;
}
 
} // namespace
 
namespace clang {
 
std::optional<const clang::CXXRecordDecl *>
hasPublicMethodInBase(const CXXBaseSpecifier *Base, StringRef NameToMatch) {
  assert(Base);
 
  const Type *T = Base->getType().getTypePtrOrNull();
  if (!T)
    return std::nullopt;
 
  const CXXRecordDecl *R = T->getAsCXXRecordDecl();
  if (!R) {
    auto CT = Base->getType().getCanonicalType();
    if (auto *TST = dyn_cast<TemplateSpecializationType>(CT)) {
      auto TmplName = TST->getTemplateName();
      if (!TmplName.isNull()) {
        if (auto *TD = TmplName.getAsTemplateDecl())
          R = dyn_cast_or_null<CXXRecordDecl>(TD->getTemplatedDecl());
      }
    }
    if (!R)
      return std::nullopt;
  }
  if (!R->hasDefinition())
    return std::nullopt;
 
  return hasPublicMethodInBaseClass(R, NameToMatch) ? R : nullptr;
}
 
static std::optional<bool> hasPublicMethodInHierarchy(const CXXRecordDecl *R,
                                                      StringRef MethodName) {
  assert(R);
 
  R = R->getDefinition();
  if (!R)
    return std::nullopt;
 
  if (hasPublicMethodInBaseClass(R, MethodName))
    return true;
 
  CXXBasePaths Paths;
  Paths.setOrigin(const_cast<CXXRecordDecl *>(R));
 
  bool AnyInconclusiveBase = false;
  const auto hasPublicMethod = [&](const CXXBaseSpecifier *Base,
                                   CXXBasePath &) {
    auto HasMethodInBase = clang::hasPublicMethodInBase(Base, MethodName);
    if (!HasMethodInBase) {
      AnyInconclusiveBase = true;
      return false;
    }
    return (*HasMethodInBase) != nullptr;
  };
 
  bool Found = R->lookupInBases(hasPublicMethod, Paths,
                                /*LookupInDependent =*/true);
  if (AnyInconclusiveBase)
    return std::nullopt;
 
  return Found;
}
 
std::optional<bool> isSmartPtrCompatible(const CXXRecordDecl *R,
                                         StringRef IncMethodName,
                                         StringRef DecMethodName) {
  assert(R);
 
  auto HasInc = hasPublicMethodInHierarchy(R, IncMethodName);
  if (!HasInc)
    return std::nullopt;
 
  auto HasDec = hasPublicMethodInHierarchy(R, DecMethodName);
  if (!HasDec)
    return std::nullopt;
 
  return *HasInc && *HasDec;
}
 
std::optional<bool> isRefCountable(const clang::CXXRecordDecl *R) {
  return isSmartPtrCompatible(R, "ref", "deref");
}
 
std::optional<bool> isCheckedPtrCapable(const clang::CXXRecordDecl *R) {
  return isSmartPtrCompatible(R, "incrementCheckedPtrCount",
                              "decrementCheckedPtrCount");
}
 
std::optional<bool> isBorrowable(const clang::CXXRecordDecl *R) {
  assert(R);
  return hasPublicMethodInHierarchy(R, "crashIfBorrowed");
}
 
bool isBorrow(const clang::CXXRecordDecl *R) {
  if (!R)
    return false;
  return isBorrow(safeGetName(R));
}
 
bool isBorrowType(const clang::QualType T) {
  return isBorrow(T->getAsCXXRecordDecl());
}
 
QualType pointeeType(QualType T) {
  while (!T.isNull()) {
    QualType Pointee = T->getPointeeType();
    if (Pointee.isNull())
      break;
    T = Pointee;
  }
  return T;
}
 
QualType borrowedType(QualType T) {
  const auto *Specialization =
      dyn_cast_or_null<ClassTemplateSpecializationDecl>(
          T->getAsCXXRecordDecl());
  if (!Specialization)
    return QualType();
  const auto &Args = Specialization->getTemplateArgs();
  if (!Args.size() || Args[0].getKind() != TemplateArgument::Type)
    return QualType();
  return Args[0].getAsType();
}
 
static bool hasLifetimeBoundCtor(const clang::CXXRecordDecl *R) {
  if (!R || !R->hasDefinition())
    return false;
  for (const CXXConstructorDecl *Ctor : R->ctors()) {
    for (const ParmVarDecl *Param : Ctor->parameters()) {
      if (Param->hasAttr<LifetimeBoundAttr>() ||
          Param->hasAttr<LifetimeCaptureByAttr>())
        return true;
    }
  }
  return false;
}
 
static bool isStdRangesViewInterface(const clang::CXXRecordDecl *R) {
  if (!R || !R->getIdentifier() || R->getName() != "view_interface")
    return false;
  const auto *NS = dyn_cast<NamespaceDecl>(R->getDeclContext());
  return NS && NS->getIdentifier() && NS->getName() == "ranges" &&
         NS->getParent()->isStdNamespace();
}
 
static bool derivesFromViewInterface(const clang::CXXRecordDecl *R) {
  if (!R)
    return false;
  R = R->getDefinition();
  if (!R)
    return false;
  if (isStdRangesViewInterface(R))
    return true;
  for (const CXXBaseSpecifier &Base : R->bases()) {
    if (derivesFromViewInterface(Base.getType()->getAsCXXRecordDecl()))
      return true;
  }
  return false;
}
 
bool isStdView(const clang::CXXRecordDecl *R) {
  if (!R)
    return false;
  if (R->hasAttr<PointerAttr>())
    return true;
  static const llvm::StringSet<> StdIterators{
      "reverse_iterator", "move_iterator", "common_iterator",
      "counted_iterator", "basic_const_iterator"};
  if (R->isInStdNamespace() && R->getIdentifier() &&
      StdIterators.contains(R->getName()))
    return true;
  if (derivesFromViewInterface(R))
    return true;
  if (const auto *Parent = dyn_cast<CXXRecordDecl>(R->getDeclContext()))
    return isStdView(Parent);
  return false;
}
 
bool isView(const clang::QualType T) {
  if (T->isReferenceType())
    return true;
  if (lifetimes::isPointerLikeType(T))
    return true;
  auto *Record = T->getAsCXXRecordDecl();
  if (isStdView(Record))
    return true;
  return hasLifetimeBoundCtor(Record);
}
 
bool isRefType(const std::string &Name) {
  return Name == "Ref" || Name == "RefAllowingPartiallyDestroyed" ||
         Name == "RefPtr" || Name == "RefPtrAllowingPartiallyDestroyed";
}
 
bool isRetainPtrOrOSPtr(const std::string &Name) {
  return Name == "RetainPtr" || Name == "RetainPtrArc" ||
         Name == "OSObjectPtr" || Name == "OSObjectPtrArc";
}
 
bool isCheckedPtr(const std::string &Name) {
  return Name == "CheckedPtr" || Name == "CheckedRef";
}
 
bool isUniquePtr(const std::string &Name) {
  return Name == "unique_ptr" || Name == "UniqueRef" || Name == "LazyUniqueRef";
}
 
bool isBorrow(const std::string &Name) { return Name == "Borrow"; }
 
bool isOwnerPtr(const std::string &Name) {
  return isRefType(Name) || isCheckedPtr(Name) || isRetainPtrOrOSPtr(Name) ||
         isUniquePtr(Name);
}
 
static bool isWeakPtrClass(const std::string &Name) {
  return Name == "WeakPtr" || Name == "SingleThreadPackedWeakPtr" ||
         Name == "SingleThreadWeakPtr" || Name == "ThreadSafeWeakPtr" ||
         Name == "ThreadSafeWeakOrStrongPtr" || Name == "InlineWeakPtr";
}
 
bool isSmartPtrClass(const std::string &Name) {
  return isRefType(Name) || isCheckedPtr(Name) || isRetainPtrOrOSPtr(Name) ||
         isWeakPtrClass(Name) || Name == "WeakPtrFactory" ||
         Name == "WeakPtrFactoryWithBitField" || Name == "WeakPtrImplBase" ||
         Name == "WeakPtrImplBaseSingleThread" ||
         Name == "ThreadSafeWeakOrStrongPtr" ||
         Name == "ThreadSafeWeakPtrControlBlock" ||
         Name == "ThreadSafeRefCountedAndCanMakeThreadSafeWeakPtr";
}
 
std::string getConstructorName(const clang::FunctionDecl *F) {
  if (auto *Ctor = dyn_cast_or_null<CXXConstructorDecl>(F))
    return safeGetName(Ctor->getParent());
  return safeGetName(F);
}
 
bool isCtorOfRefCounted(const clang::FunctionDecl *F) {
  assert(F);
  auto FunctionName = getConstructorName(F);
  return isRefType(FunctionName) || FunctionName == "adoptRef" ||
         FunctionName == "UniqueRef" || FunctionName == "makeUniqueRef" ||
         FunctionName == "makeUniqueRefWithoutFastMallocCheck"
 
         || FunctionName == "String" || FunctionName == "AtomString" ||
         FunctionName == "UniqueString"
         // FIXME: Implement as attribute.
         || FunctionName == "Identifier";
}
 
bool isCtorOfCheckedPtr(const clang::FunctionDecl *F) {
  assert(F);
  return isCheckedPtr(getConstructorName(F));
}
 
bool isCtorOfRetainPtrOrOSPtr(const clang::FunctionDecl *F) {
  auto FunctionName = getConstructorName(F);
  return isRetainPtrOrOSPtr(FunctionName) || FunctionName == "adoptNS" ||
         FunctionName == "adoptNSNullable" || FunctionName == "adoptCF" ||
         FunctionName == "adoptCFNullable" || FunctionName == "retainPtr" ||
         FunctionName == "adoptNSArc" || FunctionName == "adoptOSObject" ||
         FunctionName == "adoptOSObjectArc";
}
 
bool isCtorOfSafePtr(const clang::FunctionDecl *F) {
  return isCtorOfRefCounted(F) || isCtorOfCheckedPtr(F) ||
         isCtorOfRetainPtrOrOSPtr(F);
}
 
bool isStdOrWTFMove(const clang::FunctionDecl *F) {
  auto FnName = safeGetName(F);
  auto *Namespace = F->getParent();
  if (!Namespace)
    return false;
  auto *TUDeck = Namespace->getParent();
  if (!isa_and_nonnull<TranslationUnitDecl>(TUDeck))
    return false;
  auto NsName = safeGetName(Namespace);
  return (NsName == "WTF" || NsName == "std") && FnName == "move";
}
 
template <typename Predicate>
static bool isPtrOfType(const clang::QualType T, Predicate Pred) {
  QualType type = T;
  while (!type.isNull()) {
    if (auto *SpecialT = type->getAs<TemplateSpecializationType>()) {
      auto *Decl = SpecialT->getTemplateName().getAsTemplateDecl();
      return Decl && Pred(Decl->getNameAsString());
    } else if (auto *DTS = type->getAs<DeducedTemplateSpecializationType>()) {
      auto *Decl = DTS->getTemplateName().getAsTemplateDecl();
      return Decl && Pred(Decl->getNameAsString());
    } else if (auto *RD = type->getAs<RecordType>()) {
      auto *Decl = RD->getDecl();
      return Decl && Pred(Decl->getNameAsString());
    } else
      break;
  }
  return false;
}
 
bool isRefOrCheckedPtrType(const clang::QualType T) {
  return isPtrOfType(
      T, [](auto Name) { return isRefType(Name) || isCheckedPtr(Name); });
}
 
bool isRetainPtrOrOSPtrType(const clang::QualType T) {
  return isPtrOfType(T, [](auto Name) { return isRetainPtrOrOSPtr(Name); });
}
 
bool isOwnerPtrType(const clang::QualType T) {
  return isPtrOfType(T, [](auto Name) { return isOwnerPtr(Name); });
}
 
std::optional<bool> isUncounted(const QualType T) {
  if (auto *Subst = dyn_cast<SubstTemplateTypeParmType>(T)) {
    if (auto *Decl = Subst->getAssociatedDecl()) {
      if (isRefType(safeGetName(Decl)))
        return false;
    }
  }
  return isUncounted(T->getAsCXXRecordDecl());
}
 
std::optional<bool> isUnchecked(const QualType T) {
  if (auto *Subst = dyn_cast<SubstTemplateTypeParmType>(T)) {
    if (auto *Decl = Subst->getAssociatedDecl()) {
      if (isCheckedPtr(safeGetName(Decl)))
        return false;
    }
  }
  return isUnchecked(T->getAsCXXRecordDecl());
}
 
void RetainTypeChecker::visitTranslationUnitDecl(
    const TranslationUnitDecl *TUD) {
  IsARCEnabled = TUD->getLangOpts().ObjCAutoRefCount;
  DefaultSynthProperties = TUD->getLangOpts().ObjCDefaultSynthProperties;
}
 
void RetainTypeChecker::visitTypedef(const TypedefDecl *TD) {
  auto QT = TD->getUnderlyingType();
  if (!QT->isPointerType())
    return;
 
  auto PointeeQT = QT->getPointeeType();
  const RecordType *RT = PointeeQT->getAsCanonical<RecordType>();
  if (!RT) {
    if (TD->hasAttr<ObjCBridgeAttr>() || TD->hasAttr<ObjCBridgeMutableAttr>()) {
      RecordlessTypes.insert(TD->getASTContext()
                                 .getTypedefType(ElaboratedTypeKeyword::None,
                                                 /*Qualifier=*/std::nullopt, TD)
                                 .getTypePtr());
    }
    return;
  }
 
  for (auto *Redecl : RT->getDecl()->getMostRecentDecl()->redecls()) {
    if (Redecl->getAttr<ObjCBridgeAttr>() ||
        Redecl->getAttr<ObjCBridgeMutableAttr>()) {
      CFPointees.insert({RT, TD});
      return;
    }
  }
}
 
bool RetainTypeChecker::isUnretained(const QualType QT, bool ignoreARC) {
  if (ento::cocoa::isCocoaObjectRef(QT) && (!IsARCEnabled || ignoreARC))
    return true;
  if (auto *RT = dyn_cast_or_null<RecordType>(
          QT.getCanonicalType()->getPointeeType().getTypePtrOrNull()))
    return CFPointees.contains(RT);
  return RecordlessTypes.contains(QT.getTypePtr());
}
 
const TypedefDecl *RetainTypeChecker::getCanonicalDecl(QualType QT) {
  if (auto *TT = dyn_cast_or_null<TypedefType>(QT.getTypePtrOrNull())) {
    if (auto *TD = dyn_cast<TypedefDecl>(TT->getDecl()))
      return TD;
  }
  QT = QT.getCanonicalType();
  auto PointeeQT = QT->getPointeeType();
  auto *PointeeType = PointeeQT.getTypePtrOrNull();
  if (!PointeeType)
    return nullptr;
  auto *RD = dyn_cast<RecordType>(PointeeType);
  if (!RD)
    return nullptr;
  return CFPointees.lookup(RD);
}
 
std::optional<bool> isUncounted(const CXXRecordDecl* Class)
{
  // Keep isRefCounted first as it's cheaper.
  if (!Class || isRefCounted(Class))
    return false;
 
  std::optional<bool> IsRefCountable = isRefCountable(Class);
  if (!IsRefCountable)
    return std::nullopt;
 
  return (*IsRefCountable);
}
 
std::optional<bool> isUnchecked(const CXXRecordDecl *Class) {
  if (!Class || isCheckedPtr(Class))
    return false; // Cheaper than below
  return isCheckedPtrCapable(Class);
}
 
std::optional<bool> isUncountedPtr(const QualType T) {
  if (T->isPointerType() || T->isReferenceType()) {
    if (auto *CXXRD = T->getPointeeCXXRecordDecl())
      return isUncounted(CXXRD);
  }
  return false;
}
 
std::optional<bool> isUncheckedPtr(const QualType T) {
  if (T->isPointerType() || T->isReferenceType()) {
    if (auto *CXXRD = T->getPointeeCXXRecordDecl())
      return isUnchecked(CXXRD);
  }
  return false;
}
 
std::optional<bool> isGetterOfSafePtr(const CXXMethodDecl *M) {
  assert(M);
 
  const CXXRecordDecl *calleeMethodsClass = M->getParent();
  std::string className = safeGetName(calleeMethodsClass);
  std::string method = safeGetName(M);
 
  auto OpType = M->getOverloadedOperator();
  if (isCheckedPtr(className) &&
      (method == "get" || method == "ptr" || OpType == OO_Star))
    return true;
 
  if ((isRefType(className) &&
       (method == "get" || method == "ptr" || OpType == OO_Star)) ||
      ((className == "String" || className == "AtomString" ||
        className == "AtomStringImpl" || className == "UniqueString" ||
        className == "UniqueStringImpl" || className == "Identifier") &&
       method == "impl"))
    return true;
 
  if (isRetainPtrOrOSPtr(className) && method == "get")
    return true;
 
  // Ref<T> -> T conversion
  // FIXME: Currently allowing any Ref<T> -> whatever cast.
  if (isRefType(className)) {
    if (auto *maybeRefToRawOperator = dyn_cast<CXXConversionDecl>(M)) {
      QualType QT = maybeRefToRawOperator->getConversionType();
      const Type *T = QT.getTypePtrOrNull();
      return T && (T->isPointerType() || T->isReferenceType());
    }
  }
 
  if (isCheckedPtr(className)) {
    if (auto *maybeRefToRawOperator = dyn_cast<CXXConversionDecl>(M)) {
      QualType QT = maybeRefToRawOperator->getConversionType();
      const Type *T = QT.getTypePtrOrNull();
      return T && (T->isPointerType() || T->isReferenceType());
    }
  }
 
  if (isRetainPtrOrOSPtr(className)) {
    if (auto *maybeRefToRawOperator = dyn_cast<CXXConversionDecl>(M)) {
      QualType QT = maybeRefToRawOperator->getConversionType();
      const Type *T = QT.getTypePtrOrNull();
      return T && (T->isPointerType() || T->isReferenceType() ||
                   T->isObjCObjectPointerType());
    }
  }
  return false;
}
 
bool isGetterOfUniquePtr(const CXXMethodDecl *M) {
  assert(M);
  if (!isUniquePtr(safeGetName(M->getParent())))
    return false;
  auto method = safeGetName(M);
  if (method == "get" || method == "ptr")
    return true;
  if (auto *conversion = dyn_cast<CXXConversionDecl>(M)) {
    const Type *T = conversion->getConversionType().getTypePtrOrNull();
    return T && (T->isPointerType() || T->isReferenceType());
  }
  return false;
}
 
bool isRefCounted(const CXXRecordDecl *R) {
  assert(R);
  if (auto *TmplR = R->getTemplateInstantiationPattern()) {
    // FIXME: String/AtomString/UniqueString
    const auto &ClassName = safeGetName(TmplR);
    return isRefType(ClassName);
  }
  return false;
}
 
bool isCheckedPtr(const CXXRecordDecl *R) {
  assert(R);
  if (auto *TmplR = R->getTemplateInstantiationPattern()) {
    const auto &ClassName = safeGetName(TmplR);
    return isCheckedPtr(ClassName);
  }
  return false;
}
 
bool isRetainPtrOrOSPtr(const CXXRecordDecl *R) {
  assert(R);
  if (auto *TmplR = R->getTemplateInstantiationPattern())
    return isRetainPtrOrOSPtr(safeGetName(TmplR));
  return false;
}
 
bool isWeakPtr(const CXXRecordDecl *R) {
  assert(R);
  if (auto *TmplR = R->getTemplateInstantiationPattern())
    return isWeakPtrClass(safeGetName(TmplR));
  return false;
}
 
bool isSmartPtr(const CXXRecordDecl *R) {
  assert(R);
  if (auto *TmplR = R->getTemplateInstantiationPattern())
    return isSmartPtrClass(safeGetName(TmplR));
  return false;
}
 
enum class WebKitAnnotation : uint8_t {
  None,
  PointerConversion,
  NoDelete,
};
 
static WebKitAnnotation annotationType(StringRef Annotation) {
  if (Annotation == "webkit.pointerconversion")
    return WebKitAnnotation::PointerConversion;
  if (Annotation == "webkit.nodelete")
    return WebKitAnnotation::NoDelete;
  return WebKitAnnotation::None;
}
 
static bool hasAnnotationForFunction(const FunctionDecl *FD,
                                     WebKitAnnotation TargetAnnotation) {
  for (auto *Attr : FD->specific_attrs<AnnotateAttr>()) {
    if (annotationType(Attr->getAnnotation()) == TargetAnnotation)
      return true;
  }
  auto RetType = FD->getReturnType();
  auto *Type = RetType.getTypePtrOrNull();
  if (auto *MacroQualified = dyn_cast_or_null<MacroQualifiedType>(Type))
    Type = MacroQualified->desugar().getTypePtrOrNull();
  auto *Attr = dyn_cast_or_null<AttributedType>(Type);
  if (!Attr)
    return false;
  auto *AnnotateType = dyn_cast_or_null<AnnotateTypeAttr>(Attr->getAttr());
  if (!AnnotateType)
    return false;
  return annotationType(AnnotateType->getAnnotation()) == TargetAnnotation;
}
 
bool isPtrConversion(const FunctionDecl *F) {
  assert(F);
  if (isCtorOfRefCounted(F))
    return true;
 
  // FIXME: check # of params == 1
  const auto FunctionName = safeGetName(F);
  if (FunctionName == "getPtr" || FunctionName == "WeakPtr" ||
      FunctionName == "dynamicDowncast" || FunctionName == "downcast" ||
      FunctionName == "checkedDowncast" || FunctionName == "bit_cast" ||
      FunctionName == "uncheckedDowncast" || FunctionName == "bitwise_cast" ||
      FunctionName == "bridge_cast" || FunctionName == "bridge_id_cast" ||
      FunctionName == "dynamic_cf_cast" || FunctionName == "checked_cf_cast" ||
      FunctionName == "dynamic_objc_cast" ||
      FunctionName == "checked_objc_cast")
    return true;
 
  if (hasAnnotationForFunction(F, WebKitAnnotation::PointerConversion))
    return true;
 
  return false;
}
 
static bool isNoDeleteFunctionDecl(const FunctionDecl *F) {
  return hasAnnotationForFunction(F, WebKitAnnotation::NoDelete);
}
 
bool isNoDeleteFunction(const FunctionDecl *F) {
  if (llvm::any_of(F->redecls(), isNoDeleteFunctionDecl))
    return true;
 
  const auto *MD = dyn_cast<CXXMethodDecl>(F);
  if (!MD || !MD->isVirtual())
    return false;
 
  auto Overriders = llvm::to_vector(MD->overridden_methods());
  while (!Overriders.empty()) {
    const auto *Fn = Overriders.pop_back_val();
    llvm::append_range(Overriders, Fn->overridden_methods());
    if (isNoDeleteFunctionDecl(Fn))
      return true;
  }
 
  return false;
}
 
bool isTrivialBuiltinFunction(const FunctionDecl *F) {
  if (!F || !F->getDeclName().isIdentifier())
    return false;
  auto Name = F->getName();
  return Name.starts_with("__builtin") || Name == "__libcpp_verbose_abort" ||
         Name.starts_with("os_log") || Name.starts_with("_os_log");
}
 
bool isSingleton(const NamedDecl *F) {
  assert(F);
  // FIXME: check # of params == 1
  if (auto *MethodDecl = dyn_cast<CXXMethodDecl>(F)) {
    if (!MethodDecl->isStatic())
      return false;
  }
  const auto &NameStr = safeGetName(F);
  StringRef Name = NameStr; // FIXME: Make safeGetName return StringRef.
  return Name == "singleton" || Name.ends_with("Singleton");
}
 
// We only care about statements so let's use the simple
// (non-recursive) visitor.
class TrivialFunctionAnalysisVisitor
    : public ConstStmtVisitor<TrivialFunctionAnalysisVisitor, bool> {
  using Base = ConstStmtVisitor<TrivialFunctionAnalysisVisitor, bool>;
 
  // Returns false if at least one child is non-trivial.
  bool VisitChildren(const Stmt *S) {
    for (const Stmt *Child : S->children()) {
      if (Child && !Visit(Child))
        return false;
    }
 
    return true;
  }
 
  bool canUseCachedResult(bool CachedResult) const {
    return CachedResult || !CallStack;
  }
 
  template <typename StmtOrDecl, typename CheckFunction>
  bool WithCachedResult(const StmtOrDecl *S, CheckFunction Function) {
    auto CacheIt = Cache.find(S);
    if (CacheIt != Cache.end() && canUseCachedResult(CacheIt->second))
      return CacheIt->second;
 
    // Treat a recursive statement to be trivial until proven otherwise.
    auto [RecursiveIt, IsNew] = RecursiveFn.insert(std::make_pair(S, true));
    if (!IsNew)
      return RecursiveIt->second;
 
    bool Result = Function();
 
    if (!Result) {
      for (auto &It : RecursiveFn)
        It.second = false;
    }
    RecursiveIt = RecursiveFn.find(S);
    assert(RecursiveIt != RecursiveFn.end());
    Result = RecursiveIt->second;
    RecursiveFn.erase(RecursiveIt);
    Cache[S] = Result;
 
    return Result;
  }
 
  static bool isTrivialType(QualType Ty) {
    // T*, T&, or T&& does not delete.
    if (Ty->isPointerOrReferenceType())
      return true;
 
    // Fundamental types (integral, nullptr, etc...) does not delete.
    if (Ty->isFundamentalType() || Ty->isIntegralOrEnumerationType())
      return true;
 
    return false;
  }
 
  bool CanTriviallyDestruct(QualType Ty) {
    if (Ty.isNull())
      return false;
 
    // FIXME: Handle a case when there is a local autorelease pool.
    if (Ty->isObjCObjectPointerType()) {
      auto Type = Ty.isDestructedType();
      if (Type == QualType::DK_objc_weak_lifetime || Type == QualType::DK_none)
        return true;
      // strong lifetime in ARC could dealloc an object.
    }
 
    if (isTrivialType(Ty))
      return true;
 
    if (const auto *R = Ty->getAsCXXRecordDecl()) {
      // C++ trivially destructible classes are fine.
      if (R->hasDefinition() && R->hasTrivialDestructor())
        return true;
 
      if (auto *Dtor = R->getDestructor()) {
        if (isNoDeleteFunction(Dtor))
          return true;
      }
 
      if (FieldWithNonTrivialDtor(R))
        return false;
 
      // For Webkit, side-effects are fine as long as we don't delete objects,
      // so check recursively.
      if (const auto *Dtor = R->getDestructor())
        return IsFunctionTrivial(Dtor);
    }
 
    // Structs in C are trivial.
    if (Ty->isRecordType())
      return true;
 
    // For arrays it depends on the element type.
    // FIXME: We should really use ASTContext::getAsArrayType instead.
    if (const auto *AT = Ty->getAsArrayTypeUnsafe())
      return CanTriviallyDestruct(AT->getElementType());
 
    return false; // Otherwise it's likely not trivial.
  }
 
  bool CanTriviallyConstruct(QualType Ty) {
    if (Ty.isNull())
      return false;
 
    if (isTrivialType(Ty))
      return true;
 
    if (const auto *R = Ty->getAsCXXRecordDecl()) {
      // C++ trivially destructible classes are fine.
      if (R->hasDefinition() && R->hasTrivialDefaultConstructor())
        return true;
      for (auto *Ctor : R->ctors()) {
        if (Ctor->isDefaultConstructor() && IsFunctionTrivial(Ctor))
          return true;
      }
    }
 
    return false;
  }
 
  template <typename CacheTy, typename IsTrivialTypeFn>
  bool hasNonTrivialField(const CXXRecordDecl *Cls,
                          const FieldDecl **OffendingField, CacheTy &Cache,
                          IsTrivialTypeFn IsTrivialType) {
    auto CacheIt = Cache.find(Cls);
    if (CacheIt != Cache.end() && !OffendingField)
      return CacheIt->second;
 
    bool Result = ([&] {
      auto HasNonTrivialField = [&](const CXXRecordDecl *R) {
        for (const FieldDecl *F : R->fields()) {
          if (!IsTrivialType(F->getType())) {
            if (OffendingField)
              *OffendingField = F;
            return true;
          }
        }
        return false;
      };
 
      if (HasNonTrivialField(Cls))
        return true;
 
      if (!Cls->hasDefinition())
        return false;
 
      CXXBasePaths Paths;
      Paths.setOrigin(const_cast<CXXRecordDecl *>(Cls));
      return Cls->lookupInBases(
          [&](const CXXBaseSpecifier *B, CXXBasePath &) {
            auto *T = B->getType().getTypePtrOrNull();
            if (!T)
              return false;
            auto *R = T->getAsCXXRecordDecl();
            return R && HasNonTrivialField(R);
          },
          Paths, /*LookupInDependent =*/true);
    })();
 
    Cache[Cls] = Result;
 
    return Result;
  }
 
public:
  using CacheTy = TrivialFunctionAnalysis::CacheTy;
 
  TrivialFunctionAnalysisVisitor(CacheTy &Cache,
                                 NonTrivialityReason *Reason = nullptr)
      : Cache(Cache), OffendingStmt(Reason ? &Reason->OffendingStmt : nullptr),
        CallStack(Reason ? &Reason->CallStack : nullptr) {}
 
  // Hides ConstStmtVisitor::Visit so that every recursive step in this class
  // funnels through here. Recursion unwinds innermost-first, so the first
  // statement recorded is the deepest one that failed -- the code actually
  // responsible, rather than the enclosing statement that contains it.
  // Implicit nodes have no location to point at, so they are passed over in
  // favour of the nearest enclosing node that was actually written.
  bool Visit(const Stmt *S) {
    bool Result = Base::Visit(S);
    if (!Result && OffendingStmt && !*OffendingStmt &&
        S->getBeginLoc().isValid())
      *OffendingStmt = S;
    return Result;
  }
 
  bool IsFunctionTrivial(const Decl *D) {
    if (!CallStack)
      return IsFunctionTrivialImpl(D);
 
    const auto *FnDecl = dyn_cast<FunctionDecl>(D);
    if (!FnDecl)
      return IsFunctionTrivialImpl(D);
 
    // CallStack[0, ActiveDepth) mirrors the functions currently being
    // analyzed. Anything past that was left by a callee whose failure was
    // tolerated, e.g. one of several candidate default constructors, and is
    // not part of the chain that explains this call.
    CallStack->truncate(ActiveDepth);
    size_t Index = ActiveDepth++;
    CallStack->push_back({FnDecl, nullptr});
 
    // Blame is recorded separately for each function, so that every frame
    // can point at the code within it that leads further down the chain.
    const Stmt *CalleeOffendingStmt = nullptr;
    const Stmt **SavedOffendingStmt =
        std::exchange(OffendingStmt, &CalleeOffendingStmt);
    bool Result = IsFunctionTrivialImpl(D);
    OffendingStmt = SavedOffendingStmt;
 
    --ActiveDepth;
    // On failure, keep this frame along with the frames its body left behind:
    // together they are the chain from here down to the root cause.
    if (Result)
      CallStack->truncate(Index);
    else
      (*CallStack)[Index].OffendingStmt = CalleeOffendingStmt;
    return Result;
  }
 
  bool IsFunctionTrivialImpl(const Decl *D) {
    return WithCachedResult(D, [&]() {
      auto *FnDecl = dyn_cast<FunctionDecl>(D);
      auto *MethodDecl = dyn_cast<CXXMethodDecl>(D);
      auto *CtorDecl = dyn_cast<CXXConstructorDecl>(D);
      auto *DtorDecl = dyn_cast<CXXDestructorDecl>(D);
 
      if (FnDecl) {
        if (isNoDeleteFunction(FnDecl))
          return true;
        if (MethodDecl && MethodDecl->isVirtual())
          return false;
        for (auto *Param : FnDecl->parameters()) {
          if (!HasTrivialDestructor(Param))
            return false;
        }
      }
      if (CtorDecl) {
        for (auto *CtorInit : CtorDecl->inits()) {
          if (!Visit(CtorInit->getInit()))
            return false;
        }
      }
      // An implicit or =default special member runs no user code when it is
      // trivial in the C++ standard sense, so it cannot delete. Such a
      // member's synthesized body is typically absent from the AST until
      // codegen materialises it, which the generic null-body check below
      // would otherwise conservatively classify as non-trivial.
      if (MethodDecl && !MethodDecl->isUserProvided()) {
        if (CtorDecl) {
          const CXXRecordDecl *RD = CtorDecl->getParent();
          if ((CtorDecl->isDefaultConstructor() &&
               RD->hasTrivialDefaultConstructor()) ||
              (CtorDecl->isCopyConstructor() &&
               RD->hasTrivialCopyConstructor()) ||
              (CtorDecl->isMoveConstructor() &&
               RD->hasTrivialMoveConstructor()))
            return true;
        }
        if (DtorDecl && DtorDecl->getParent()->hasTrivialDestructor())
          return true;
      }
      const Stmt *Body = D->getBody();
      if (!Body)
        return false;
      return Visit(Body);
    });
  }
 
  bool HasTrivialDestructor(const VarDecl *VD) {
    return WithCachedResult(
        VD, [&] { return CanTriviallyDestruct(VD->getType()); });
  }
 
  const FieldDecl *FieldWithNonTrivialCtor(const CXXRecordDecl *Cls) {
    const FieldDecl *OffendingField = nullptr;
    hasNonTrivialField(
        Cls, &OffendingField, FieldCtorCache,
        [&](const QualType Ty) { return CanTriviallyConstruct(Ty); });
    return OffendingField;
  }
 
  const FieldDecl *FieldWithNonTrivialDtor(const CXXRecordDecl *Cls) {
    const FieldDecl *OffendingField = nullptr;
    hasNonTrivialField(
        Cls, &OffendingField, FieldDtorCache,
        [&](const QualType Ty) { return CanTriviallyDestruct(Ty); });
    return OffendingField;
  }
 
  bool IsStatementTrivial(const Stmt *S) {
    auto CacheIt = Cache.find(S);
    if (CacheIt != Cache.end() && canUseCachedResult(CacheIt->second))
      return CacheIt->second;
    bool Result = Visit(S);
    Cache[S] = Result;
    return Result;
  }
 
  bool VisitStmt(const Stmt *S) {
    // All statements are non-trivial unless overriden later.
    // Don't even recurse into children by default.
    return false;
  }
 
  bool VisitAttributedStmt(const AttributedStmt *AS) {
    // Ignore attributes.
    return Visit(AS->getSubStmt());
  }
 
  bool VisitCompoundStmt(const CompoundStmt *CS) {
    // A compound statement is allowed as long each individual sub-statement
    // is trivial.
    return WithCachedResult(CS, [&]() { return VisitChildren(CS); });
  }
 
  bool VisitCoroutineBodyStmt(const CoroutineBodyStmt *CBS) {
    return WithCachedResult(CBS, [&]() { return VisitChildren(CBS); });
  }
 
  bool VisitReturnStmt(const ReturnStmt *RS) {
    // A return statement is allowed as long as the return value is trivial. A
    // returned smart-pointer prvalue is special: under guaranteed copy elision
    // the temporary *is* the function's return slot, so it is destructed by the
    // caller, not here. Hence we may ignore that temporary's destructor.
    if (auto *RV = RS->getRetValue())
      return visitReturnValueElidingTemp(RV);
    return true;
  }
 
  bool VisitDeclStmt(const DeclStmt *DS) {
    for (auto &Decl : DS->decls()) {
      // FIXME: Handle DecompositionDecls.
      if (auto *VD = dyn_cast<VarDecl>(Decl)) {
        if (!HasTrivialDestructor(VD))
          return false;
      }
    }
    return VisitChildren(DS);
  }
  bool VisitDoStmt(const DoStmt *DS) { return VisitChildren(DS); }
  bool VisitIfStmt(const IfStmt *IS) {
    return WithCachedResult(IS, [&]() { return VisitChildren(IS); });
  }
  bool VisitForStmt(const ForStmt *FS) {
    return WithCachedResult(FS, [&]() { return VisitChildren(FS); });
  }
  bool VisitCXXForRangeStmt(const CXXForRangeStmt *FS) {
    return WithCachedResult(FS, [&]() { return VisitChildren(FS); });
  }
  bool VisitWhileStmt(const WhileStmt *WS) {
    return WithCachedResult(WS, [&]() { return VisitChildren(WS); });
  }
  bool VisitSwitchStmt(const SwitchStmt *SS) { return VisitChildren(SS); }
  bool VisitCaseStmt(const CaseStmt *CS) { return VisitChildren(CS); }
  bool VisitDefaultStmt(const DefaultStmt *DS) { return VisitChildren(DS); }
 
  // break, continue, goto, and label statements are always trivial.
  bool VisitBreakStmt(const BreakStmt *) { return true; }
  bool VisitContinueStmt(const ContinueStmt *) { return true; }
  bool VisitGotoStmt(const GotoStmt *) { return true; }
  bool VisitLabelStmt(const LabelStmt *) { return true; }
 
  bool VisitUnaryOperator(const UnaryOperator *UO) {
    // Unary operators are trivial if its operand is trivial except co_await.
    return UO->getOpcode() != UO_Coawait && Visit(UO->getSubExpr());
  }
 
  bool VisitBinaryOperator(const BinaryOperator *BO) {
    // Binary operators are trivial if their operands are trivial.
    return Visit(BO->getLHS()) && Visit(BO->getRHS());
  }
 
  bool VisitCompoundAssignOperator(const CompoundAssignOperator *CAO) {
    // Compound assignment operator such as |= is trivial if its
    // subexpresssions are trivial.
    return VisitChildren(CAO);
  }
 
  bool VisitArraySubscriptExpr(const ArraySubscriptExpr *ASE) {
    return VisitChildren(ASE);
  }
 
  bool VisitConditionalOperator(const ConditionalOperator *CO) {
    // Ternary operators are trivial if their conditions & values are trivial.
    return VisitChildren(CO);
  }
 
  bool VisitAtomicExpr(const AtomicExpr *E) { return VisitChildren(E); }
 
  bool VisitStaticAssertDecl(const StaticAssertDecl *SAD) {
    // Any static_assert is considered trivial.
    return true;
  }
 
  bool VisitCallExpr(const CallExpr *CE) {
    if (!checkArguments(CE))
      return false;
 
    auto *Callee = CE->getDirectCallee();
    if (!Callee)
      return false;
 
    if (isPtrConversion(Callee))
      return true;
 
    const auto &Name = safeGetName(Callee);
 
    if (Callee->isInStdNamespace() &&
        (Name == "addressof" || Name == "forward" || Name == "move"))
      return true;
 
    if (Name == "WTFCrashWithInfo" || Name == "WTFBreakpointTrap" ||
        Name == "WTFReportBacktrace" ||
        Name == "WTFCrashWithSecurityImplication" || Name == "WTFCrash" ||
        Name == "WTFReportAssertionFailure" || Name == "isMainThread" ||
        Name == "isMainThreadOrGCThread" || Name == "isMainRunLoop" ||
        Name == "isWebThread" || Name == "isUIThread" ||
        Name == "mayBeGCThread" || Name == "compilerFenceForCrash" ||
        isTrivialBuiltinFunction(Callee))
      return true;
 
    return IsFunctionTrivial(Callee);
  }
 
  bool VisitGCCAsmStmt(const GCCAsmStmt *AS) {
    return AS->getAsmString() == "brk #0xc471";
  }
 
  bool
  VisitSubstNonTypeTemplateParmExpr(const SubstNonTypeTemplateParmExpr *E) {
    // Non-type template paramter is compile time constant and trivial.
    return true;
  }
 
  bool VisitUnaryExprOrTypeTraitExpr(const UnaryExprOrTypeTraitExpr *E) {
    return VisitChildren(E);
  }
 
  bool VisitPredefinedExpr(const PredefinedExpr *E) {
    // A predefined identifier such as "func" is considered trivial.
    return true;
  }
 
  bool VisitOffsetOfExpr(const OffsetOfExpr *OE) {
    // offsetof(T, D) is considered trivial.
    return true;
  }
 
  bool VisitCXXMemberCallExpr(const CXXMemberCallExpr *MCE) {
    if (!checkArguments(MCE))
      return false;
 
    bool TrivialThis = Visit(MCE->getImplicitObjectArgument());
    if (!TrivialThis)
      return false;
 
    auto *Callee = MCE->getMethodDecl();
    if (!Callee)
      return false;
 
    if (isa<CXXDestructorDecl>(Callee) &&
        !CanTriviallyDestruct(MCE->getObjectType()))
      return false;
 
    auto Name = safeGetName(Callee);
    if (Name == "ref" || Name == "incrementCheckedPtrCount")
      return true;
 
    std::optional<bool> IsGetterOfRefCounted = isGetterOfSafePtr(Callee);
    if (IsGetterOfRefCounted && *IsGetterOfRefCounted)
      return true;
 
    // Recursively descend into the callee to confirm that it's trivial as well.
    return IsFunctionTrivial(Callee);
  }
 
  bool VisitCXXOperatorCallExpr(const CXXOperatorCallExpr *OCE) {
    if (!checkArguments(OCE))
      return false;
    auto *Callee = OCE->getCalleeDecl();
    if (!Callee)
      return false;
    // Recursively descend into the callee to confirm that it's trivial as well.
    return IsFunctionTrivial(Callee);
  }
 
  bool VisitCXXRewrittenBinaryOperator(const CXXRewrittenBinaryOperator *Op) {
    auto *SemanticExpr = Op->getSemanticForm();
    return SemanticExpr && Visit(SemanticExpr);
  }
 
  bool VisitCXXDefaultArgExpr(const CXXDefaultArgExpr *E) {
    if (auto *Expr = E->getExpr()) {
      if (!Visit(Expr))
        return false;
    }
    return true;
  }
 
  bool VisitCXXDefaultInitExpr(const CXXDefaultInitExpr *E) {
    return Visit(E->getExpr());
  }
 
  bool checkArguments(const CallExpr *CE) {
    for (const Expr *Arg : CE->arguments()) {
      if (Arg && !Visit(Arg))
        return false;
    }
    return true;
  }
 
  // Triviality check for a return value that may elide a smart-pointer
  // temporary's destructor.
  //
  // This is only valid for *return values*: a returned class prvalue is
  // constructed directly into the function's return slot (C++17 guaranteed copy
  // elision), so the temporary is destructed by the caller rather than here.
  //
  // It is deliberately NOT applied to call/constructor arguments. An argument
  // temporary's lifetime ends at the full-expression *in this function* (the
  // caller destroys arguments, e.g. per the Itanium C++ ABI), so its destructor
  // runs here and may invoke delete. Proving otherwise would require
  // interprocedural ownership analysis, so arguments are checked normally.
  bool visitReturnValueElidingTemp(const Expr *Arg) {
    QualType OriginalQT = Arg->getType();
    auto *Type = OriginalQT.getTypePtrOrNull();
    if (!Type)
      return Visit(Arg);
    auto *CXXRD = Type->getAsCXXRecordDecl();
    if (!CXXRD || !isSmartPtrClass(safeGetName(CXXRD)))
      return Visit(Arg);
    Arg = Arg->IgnoreParenCasts();
    if (!Arg->isPRValue())
      return Visit(Arg);
    if (auto *Init = dyn_cast<InitListExpr>(Arg)) {
      if (Init->getNumInits() == 1)
        Arg = Init->getInit(0);
    }
    if (auto *BTE = dyn_cast<CXXBindTemporaryExpr>(Arg)) {
      // Only elide when the temporary *is* the returned object, i.e. it has the
      // same smart-pointer type as the return value. Compare canonical,
      // unqualified types rather than relying on exact QualType identity, which
      // is sensitive to sugar (typedefs/aliases) and cv-qualifiers.
      if (OriginalQT.getCanonicalType().getUnqualifiedType() ==
          BTE->getType().getCanonicalType().getUnqualifiedType())
        return Visit(BTE->getSubExpr());
    }
    return Visit(Arg);
  }
 
  bool VisitCXXConstructExpr(const CXXConstructExpr *CE) {
    if (CE->getNumArgs() == 1) {
      auto *InnerArg = CE->getArg(0);
      if (auto *MTE = dyn_cast<MaterializeTemporaryExpr>(InnerArg)) {
        auto *InnerExpr = MTE->getSubExpr();
        if (auto *BTE = dyn_cast<CXXBindTemporaryExpr>(InnerExpr))
          InnerExpr = BTE->getSubExpr();
        auto InnerQT = InnerExpr->getType();
        if (auto *InnerDecl = InnerQT->getAsCXXRecordDecl()) {
          auto *OuterCls = CE->getConstructor()->getParent();
          if (isRefType(safeGetName(OuterCls)) &&
              isRefType(safeGetName(InnerDecl)))
            return Visit(InnerExpr);
        }
      }
    }
 
    for (const Expr *Arg : CE->arguments()) {
      if (Arg && !Visit(Arg))
        return false;
    }
 
    // Recursively descend into the callee to confirm that it's trivial.
    return IsFunctionTrivial(CE->getConstructor());
  }
 
  bool VisitCXXInheritedCtorInitExpr(const CXXInheritedCtorInitExpr *E) {
    return IsFunctionTrivial(E->getConstructor());
  }
 
  bool VisitCXXNewExpr(const CXXNewExpr *NE) { return VisitChildren(NE); }
 
  bool VisitImplicitCastExpr(const ImplicitCastExpr *ICE) {
    return Visit(ICE->getSubExpr());
  }
 
  bool VisitExplicitCastExpr(const ExplicitCastExpr *ECE) {
    return Visit(ECE->getSubExpr());
  }
 
  bool VisitMaterializeTemporaryExpr(const MaterializeTemporaryExpr *VMT) {
    if (auto *ICE = dyn_cast<ImplicitCastExpr>(VMT->getSubExpr());
        ICE && ICE->getCastKind() == CK_NoOp &&
        ICE->getType().isConstQualified()) {
      if (auto *BTE = dyn_cast<CXXBindTemporaryExpr>(ICE->getSubExpr());
          BTE && isNullSmartPtr(BTE->getSubExpr()))
        return Visit(BTE->getSubExpr());
    }
    return Visit(VMT->getSubExpr());
  }
 
  // Returns true if E is known to evaluate to a smart pointer which holds
  // nullptr, e.g. RefPtr<T>(), RefPtr<T>(nullptr), Ref<T>(HashTableEmptyValue),
  // or a call to a function which simply returns one such as
  // HashTraits<Ref<T>>::emptyValue(). Destructing such a smart pointer can't
  // delete anything.
  bool isNullSmartPtr(const Expr *E, unsigned Depth = 0) {
    if (!E || Depth > 4)
      return false;
    while (true) {
      E = E->IgnoreParenCasts();
      if (auto *EWC = dyn_cast<ExprWithCleanups>(E))
        E = EWC->getSubExpr();
      else if (auto *MTE = dyn_cast<MaterializeTemporaryExpr>(E))
        E = MTE->getSubExpr();
      else if (auto *BTE = dyn_cast<CXXBindTemporaryExpr>(E))
        E = BTE->getSubExpr();
      else
        break;
    }
    if (auto *CE = dyn_cast<CXXConstructExpr>(E)) {
      auto *Ctor = CE->getConstructor();
      if (!Ctor || !isOwnerPtr(safeGetName(Ctor->getParent())))
        return false;
      if (Ctor->isDefaultConstructor())
        return true;
      if (CE->getNumArgs() != 1)
        return false;
      auto *Arg = CE->getArg(0)->IgnoreParenImpCasts();
      auto ArgType = Arg->getType();
      if (ArgType->isNullPtrType())
        return true;
      if (auto *TD = ArgType->getAsTagDecl();
          TD && safeGetName(TD) == "HashTableEmptyValueType")
        return true;
      if (Ctor->isCopyOrMoveConstructor())
        return isNullSmartPtr(Arg, Depth + 1);
      return false;
    }
    if (auto *CE = dyn_cast<CallExpr>(E)) {
      auto *Callee = CE->getDirectCallee();
      if (!Callee)
        return false;
      if (auto *MD = dyn_cast<CXXMethodDecl>(Callee); MD && MD->isVirtual())
        return false;
      auto *Body = dyn_cast_or_null<CompoundStmt>(Callee->getBody());
      if (!Body || Body->size() != 1)
        return false;
      auto *RS = dyn_cast<ReturnStmt>(Body->body_front());
      return RS && isNullSmartPtr(RS->getRetValue(), Depth + 1);
    }
    return false;
  }
 
  bool VisitCXXBindTemporaryExpr(const CXXBindTemporaryExpr *BTE) {
    if (auto *Temp = BTE->getTemporary()) {
      if (!IsFunctionTrivial(Temp->getDestructor()))
        return false;
    }
    return Visit(BTE->getSubExpr());
  }
 
  bool VisitArrayInitLoopExpr(const ArrayInitLoopExpr *AILE) {
    return Visit(AILE->getCommonExpr()) && Visit(AILE->getSubExpr());
  }
 
  bool VisitArrayInitIndexExpr(const ArrayInitIndexExpr *AIIE) {
    return true; // The current array index in VisitArrayInitLoopExpr is always
                 // trivial.
  }
 
  bool VisitOpaqueValueExpr(const OpaqueValueExpr *OVE) {
    return Visit(OVE->getSourceExpr());
  }
 
  bool VisitExprWithCleanups(const ExprWithCleanups *EWC) {
    return Visit(EWC->getSubExpr());
  }
 
  bool VisitParenExpr(const ParenExpr *PE) { return Visit(PE->getSubExpr()); }
 
  bool VisitInitListExpr(const InitListExpr *ILE) {
    for (const Expr *Child : ILE->inits()) {
      if (Child && !Visit(Child))
        return false;
    }
    return true;
  }
 
  bool VisitCXXStdInitializerListExpr(const CXXStdInitializerListExpr *ILE) {
    auto *SubExpr = ILE->getSubExpr();
    if (!SubExpr)
      return false;
    // The backing array of a std::initializer_list is a temporary whose
    // lifetime ends in this function, so its elements are destructed here.
    if (!CanTriviallyDestruct(SubExpr->getType()))
      return false;
    return Visit(SubExpr);
  }
 
  bool VisitMemberExpr(const MemberExpr *ME) {
    // Field access is allowed but the base pointer may itself be non-trivial.
    return Visit(ME->getBase());
  }
 
  bool VisitCXXThisExpr(const CXXThisExpr *CTE) {
    // The expression 'this' is always trivial, be it explicit or implicit.
    return true;
  }
 
  bool VisitCXXNullPtrLiteralExpr(const CXXNullPtrLiteralExpr *E) {
    // nullptr is trivial.
    return true;
  }
 
  bool VisitDeclRefExpr(const DeclRefExpr *DRE) {
    // The use of a variable is trivial.
    return true;
  }
 
  // Constant literal expressions are always trivial
  bool VisitIntegerLiteral(const IntegerLiteral *E) { return true; }
  bool VisitFloatingLiteral(const FloatingLiteral *E) { return true; }
  bool VisitFixedPointLiteral(const FixedPointLiteral *E) { return true; }
  bool VisitCharacterLiteral(const CharacterLiteral *E) { return true; }
  bool VisitStringLiteral(const StringLiteral *E) { return true; }
  bool VisitCXXBoolLiteralExpr(const CXXBoolLiteralExpr *E) { return true; }
 
  bool VisitConstantExpr(const ConstantExpr *CE) {
    // Constant expressions are trivial.
    return true;
  }
 
  bool VisitImplicitValueInitExpr(const ImplicitValueInitExpr *IVIE) {
    // An implicit value initialization is trvial.
    return true;
  }
 
  bool VisitCXXScalarValueInitExpr(const CXXScalarValueInitExpr *E) {
    // A value initialization of a scalar type such as int() is trivial.
    return true;
  }
 
private:
  CacheTy &Cache;
  CacheTy FieldCtorCache;
  CacheTy FieldDtorCache;
  CacheTy RecursiveFn;
  const Stmt **OffendingStmt;
  SmallVectorImpl<NonTrivialityReason::Frame> *CallStack;
  unsigned ActiveDepth = 0;
};
 
bool TrivialFunctionAnalysis::isTrivialImpl(
    const Decl *D, TrivialFunctionAnalysis::CacheTy &Cache) {
  TrivialFunctionAnalysisVisitor V(Cache);
  return V.IsFunctionTrivial(D);
}
 
bool TrivialFunctionAnalysis::isTrivialImpl(
    const Stmt *S, TrivialFunctionAnalysis::CacheTy &Cache) {
  TrivialFunctionAnalysisVisitor V(Cache);
  return V.IsStatementTrivial(S);
}
 
NonTrivialityReason TrivialFunctionAnalysis::computeReason(const Stmt *S) {
  NonTrivialityReason Reason;
  CacheTy Cache;
  TrivialFunctionAnalysisVisitor V(Cache, &Reason);
  [[maybe_unused]] bool Trivial = V.IsStatementTrivial(S);
  assert(!Trivial && "computeReason called on a trivial statement");
  return Reason;
}
 
bool TrivialFunctionAnalysis::hasTrivialDtorImpl(const VarDecl *VD,
                                                 CacheTy &Cache) {
  TrivialFunctionAnalysisVisitor V(Cache);
  return V.HasTrivialDestructor(VD);
}
 
const FieldDecl *
TrivialFunctionAnalysis::fieldWithNonTrivialCtorImpl(const CXXRecordDecl *RD,
                                                     CacheTy &Cache) {
  TrivialFunctionAnalysisVisitor V(Cache);
  return V.FieldWithNonTrivialCtor(RD);
}
 
const FieldDecl *
TrivialFunctionAnalysis::fieldWithNonTrivialDtorImpl(const CXXRecordDecl *RD,
                                                     CacheTy &Cache) {
  TrivialFunctionAnalysisVisitor V(Cache);
  return V.FieldWithNonTrivialDtor(RD);
}
 
} // namespace clang