/build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp

Bug Summary

File:	tools/clang/lib/ARCMigrate/ObjCMT.cpp
Warning:	line 983, column 33 Use of memory after it is freed

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name ObjCMT.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-eagerly-assume -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -mrelocation-model pic -pic-level 2 -mthread-model posix -relaxed-aliasing -fmath-errno -masm-verbose -mconstructor-aliases -munwind-tables -fuse-init-array -target-cpu x86-64 -dwarf-column-info -debugger-tuning=gdb -momit-leaf-frame-pointer -ffunction-sections -fdata-sections -resource-dir /usr/lib/llvm-7/lib/clang/7.0.0 -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I /build/llvm-toolchain-snapshot-7~svn329677/build-llvm/tools/clang/lib/ARCMigrate -I /build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate -I /build/llvm-toolchain-snapshot-7~svn329677/tools/clang/include -I /build/llvm-toolchain-snapshot-7~svn329677/build-llvm/tools/clang/include -I /build/llvm-toolchain-snapshot-7~svn329677/build-llvm/include -I /build/llvm-toolchain-snapshot-7~svn329677/include -U NDEBUG -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/7.3.0/../../../../include/c++/7.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/7.3.0/../../../../include/x86_64-linux-gnu/c++/7.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/7.3.0/../../../../include/x86_64-linux-gnu/c++/7.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/7.3.0/../../../../include/c++/7.3.0/backward -internal-isystem /usr/include/clang/7.0.0/include/ -internal-isystem /usr/local/include -internal-isystem /usr/lib/llvm-7/lib/clang/7.0.0/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -O2 -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-maybe-uninitialized -Wno-comment -std=c++11 -fdeprecated-macro -fdebug-compilation-dir /build/llvm-toolchain-snapshot-7~svn329677/build-llvm/tools/clang/lib/ARCMigrate -ferror-limit 19 -fmessage-length 0 -fvisibility-inlines-hidden -fobjc-runtime=gcc -fno-common -fdiagnostics-show-option -vectorize-loops -vectorize-slp -analyzer-checker optin.performance.Padding -analyzer-output=html -analyzer-config stable-report-filename=true -o /tmp/scan-build-2018-04-11-031539-24776-1 -x c++ /build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp

/build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp

→

1//===--- ObjCMT.cpp - ObjC Migrate Tool -----------------------------------===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//

10#include "Transforms.h"
11#include "clang/ARCMigrate/ARCMT.h"
12#include "clang/ARCMigrate/ARCMTActions.h"
13#include "clang/AST/ASTConsumer.h"
14#include "clang/AST/ASTContext.h"
15#include "clang/AST/Attr.h"
16#include "clang/AST/NSAPI.h"
17#include "clang/AST/ParentMap.h"
18#include "clang/AST/RecursiveASTVisitor.h"
19#include "clang/Analysis/DomainSpecific/CocoaConventions.h"
20#include "clang/Basic/FileManager.h"
21#include "clang/Edit/Commit.h"
22#include "clang/Edit/EditedSource.h"
23#include "clang/Edit/EditsReceiver.h"
24#include "clang/Edit/Rewriters.h"
25#include "clang/Frontend/CompilerInstance.h"
26#include "clang/Frontend/MultiplexConsumer.h"
27#include "clang/Lex/PPConditionalDirectiveRecord.h"
28#include "clang/Lex/Preprocessor.h"
29#include "clang/Rewrite/Core/Rewriter.h"
30#include "clang/StaticAnalyzer/Checkers/ObjCRetainCount.h"
31#include "llvm/ADT/SmallString.h"
32#include "llvm/ADT/StringSet.h"
33#include "llvm/Support/Path.h"
34#include "llvm/Support/SourceMgr.h"
35#include "llvm/Support/YAMLParser.h"

37using namespace clang;
38using namespace arcmt;
39using namespace ento::objc_retain;

41namespace {

43class ObjCMigrateASTConsumer : public ASTConsumer {
enum CF_BRIDGING_KIND {
  CF_BRIDGING_NONE,
  CF_BRIDGING_ENABLE,
  CF_BRIDGING_MAY_INCLUDE
};

void migrateDecl(Decl *D);
void migrateObjCContainerDecl(ASTContext &Ctx, ObjCContainerDecl *D);
void migrateProtocolConformance(ASTContext &Ctx,
                                const ObjCImplementationDecl *ImpDecl);
void CacheObjCNSIntegerTypedefed(const TypedefDecl *TypedefDcl);
bool migrateNSEnumDecl(ASTContext &Ctx, const EnumDecl *EnumDcl,
                   const TypedefDecl *TypedefDcl);
void migrateAllMethodInstaceType(ASTContext &Ctx, ObjCContainerDecl *CDecl);
void migrateMethodInstanceType(ASTContext &Ctx, ObjCContainerDecl *CDecl,
                               ObjCMethodDecl *OM);
bool migrateProperty(ASTContext &Ctx, ObjCContainerDecl *D, ObjCMethodDecl *OM);
void migrateNsReturnsInnerPointer(ASTContext &Ctx, ObjCMethodDecl *OM);
void migratePropertyNsReturnsInnerPointer(ASTContext &Ctx, ObjCPropertyDecl *P);
void migrateFactoryMethod(ASTContext &Ctx, ObjCContainerDecl *CDecl,
                          ObjCMethodDecl *OM,
                          ObjCInstanceTypeFamily OIT_Family = OIT_None);

void migrateCFAnnotation(ASTContext &Ctx, const Decl *Decl);
void AddCFAnnotations(ASTContext &Ctx, const CallEffects &CE,
                      const FunctionDecl *FuncDecl, bool ResultAnnotated);
void AddCFAnnotations(ASTContext &Ctx, const CallEffects &CE,
                      const ObjCMethodDecl *MethodDecl, bool ResultAnnotated);

void AnnotateImplicitBridging(ASTContext &Ctx);

CF_BRIDGING_KIND migrateAddFunctionAnnotation(ASTContext &Ctx,
                                              const FunctionDecl *FuncDecl);

void migrateARCSafeAnnotation(ASTContext &Ctx, ObjCContainerDecl *CDecl);

void migrateAddMethodAnnotation(ASTContext &Ctx,
                                const ObjCMethodDecl *MethodDecl);

void inferDesignatedInitializers(ASTContext &Ctx,
                                 const ObjCImplementationDecl *ImplD);

bool InsertFoundation(ASTContext &Ctx, SourceLocation Loc);

88public:
std::string MigrateDir;
unsigned ASTMigrateActions;
FileID FileId;
const TypedefDecl *NSIntegerTypedefed;
const TypedefDecl *NSUIntegerTypedefed;
std::unique_ptr<NSAPI> NSAPIObj;
std::unique_ptr<edit::EditedSource> Editor;
FileRemapper &Remapper;
FileManager &FileMgr;
const PPConditionalDirectiveRecord *PPRec;
Preprocessor &PP;
bool IsOutputFile;
bool FoundationIncluded;
llvm::SmallPtrSet<ObjCProtocolDecl *, 32> ObjCProtocolDecls;
llvm::SmallVector<const Decl *, 8> CFFunctionIBCandidates;
llvm::StringSet<> WhiteListFilenames;

ObjCMigrateASTConsumer(StringRef migrateDir,
                       unsigned astMigrateActions,
                       FileRemapper &remapper,
                       FileManager &fileMgr,
                       const PPConditionalDirectiveRecord *PPRec,
                       Preprocessor &PP,
                       bool isOutputFile,
                       ArrayRef<std::string> WhiteList)
: MigrateDir(migrateDir),
  ASTMigrateActions(astMigrateActions),
  NSIntegerTypedefed(nullptr), NSUIntegerTypedefed(nullptr),
  Remapper(remapper), FileMgr(fileMgr), PPRec(PPRec), PP(PP),
  IsOutputFile(isOutputFile),
  FoundationIncluded(false){

  // FIXME: StringSet should have insert(iter, iter) to use here.
  for (const std::string &Val : WhiteList)
    WhiteListFilenames.insert(Val);
}

126protected:
void Initialize(ASTContext &Context) override {
  NSAPIObj.reset(new NSAPI(Context));
  Editor.reset(new edit::EditedSource(Context.getSourceManager(),
                                      Context.getLangOpts(),
                                      PPRec));
}

bool HandleTopLevelDecl(DeclGroupRef DG) override {
  for (DeclGroupRef::iterator I = DG.begin(), E = DG.end(); I != E; ++I)
    migrateDecl(*I);
  return true;
}
void HandleInterestingDecl(DeclGroupRef DG) override {
  // Ignore decls from the PCH.
}
void HandleTopLevelDeclInObjCContainer(DeclGroupRef DG) override {
  ObjCMigrateASTConsumer::HandleTopLevelDecl(DG);
}

void HandleTranslationUnit(ASTContext &Ctx) override;

bool canModifyFile(StringRef Path) {
  if (WhiteListFilenames.empty())
    return true;
  return WhiteListFilenames.find(llvm::sys::path::filename(Path))
      != WhiteListFilenames.end();
}
bool canModifyFile(const FileEntry *FE) {
  if (!FE)
    return false;
  return canModifyFile(FE->getName());
}
bool canModifyFile(FileID FID) {
  if (FID.isInvalid())
    return false;
  return canModifyFile(PP.getSourceManager().getFileEntryForID(FID));
}

bool canModify(const Decl *D) {
  if (!D)
    return false;
  if (const ObjCCategoryImplDecl *CatImpl = dyn_cast<ObjCCategoryImplDecl>(D))
    return canModify(CatImpl->getCategoryDecl());
  if (const ObjCImplementationDecl *Impl = dyn_cast<ObjCImplementationDecl>(D))
    return canModify(Impl->getClassInterface());
  if (const ObjCMethodDecl *MD = dyn_cast<ObjCMethodDecl>(D))
    return canModify(cast<Decl>(MD->getDeclContext()));

  FileID FID = PP.getSourceManager().getFileID(D->getLocation());
  return canModifyFile(FID);
}
178};

180} // end anonymous namespace

182ObjCMigrateAction::ObjCMigrateAction(
                                std::unique_ptr<FrontendAction> WrappedAction,
                                   StringRef migrateDir,
                                   unsigned migrateAction)
: WrapperFrontendAction(std::move(WrappedAction)), MigrateDir(migrateDir),
  ObjCMigAction(migrateAction),
  CompInst(nullptr) {
if (MigrateDir.empty())
  MigrateDir = "."; // user current directory if none is given.
191}

193std::unique_ptr<ASTConsumer>
194ObjCMigrateAction::CreateASTConsumer(CompilerInstance &CI, StringRef InFile) {
PPConditionalDirectiveRecord *
  PPRec = new PPConditionalDirectiveRecord(CompInst->getSourceManager());
1
Memory is allocated→
CI.getPreprocessor().addPPCallbacks(std::unique_ptr<PPCallbacks>(PPRec));
2
←
Calling '~unique_ptr'→
7
←
Returning from '~unique_ptr'→
std::vector<std::unique_ptr<ASTConsumer>> Consumers;
Consumers.push_back(WrapperFrontendAction::CreateASTConsumer(CI, InFile));
Consumers.push_back(llvm::make_unique<ObjCMigrateASTConsumer>(
8
←
Calling 'make_unique'→
    MigrateDir, ObjCMigAction, Remapper, CompInst->getFileManager(), PPRec,
    CompInst->getPreprocessor(), false, None));
return llvm::make_unique<MultiplexConsumer>(std::move(Consumers));
204}

206bool ObjCMigrateAction::BeginInvocation(CompilerInstance &CI) {
Remapper.initFromDisk(MigrateDir, CI.getDiagnostics(),
                      /*ignoreIfFilesChanges=*/true);
CompInst = &CI;
CI.getDiagnostics().setIgnoreAllWarnings(true);
return true;
212}

214namespace {
// FIXME. This duplicates one in RewriteObjCFoundationAPI.cpp
bool subscriptOperatorNeedsParens(const Expr *FullExpr) {
  const Expr* Expr = FullExpr->IgnoreImpCasts();
  return !(isa<ArraySubscriptExpr>(Expr) || isa<CallExpr>(Expr) ||
           isa<DeclRefExpr>(Expr) || isa<CXXNamedCastExpr>(Expr) ||
           isa<CXXConstructExpr>(Expr) || isa<CXXThisExpr>(Expr) ||
           isa<CXXTypeidExpr>(Expr) ||
           isa<CXXUnresolvedConstructExpr>(Expr) ||
           isa<ObjCMessageExpr>(Expr) || isa<ObjCPropertyRefExpr>(Expr) ||
           isa<ObjCProtocolExpr>(Expr) || isa<MemberExpr>(Expr) ||
           isa<ObjCIvarRefExpr>(Expr) || isa<ParenExpr>(FullExpr) ||
           isa<ParenListExpr>(Expr) || isa<SizeOfPackExpr>(Expr));
}

/// \brief - Rewrite message expression for Objective-C setter and getters into
/// property-dot syntax.
bool rewriteToPropertyDotSyntax(const ObjCMessageExpr *Msg,
                                Preprocessor &PP,
                                const NSAPI &NS, edit::Commit &commit,
                                const ParentMap *PMap) {
  if (!Msg || Msg->isImplicit() ||
      (Msg->getReceiverKind() != ObjCMessageExpr::Instance &&
       Msg->getReceiverKind() != ObjCMessageExpr::SuperInstance))
    return false;
  if (const Expr *Receiver = Msg->getInstanceReceiver())
    if (Receiver->getType()->isObjCBuiltinType())
      return false;
    
  const ObjCMethodDecl *Method = Msg->getMethodDecl();
  if (!Method)
    return false;
  if (!Method->isPropertyAccessor())
    return false;
  
  const ObjCPropertyDecl *Prop = Method->findPropertyDecl();
  if (!Prop)
    return false;
  
  SourceRange MsgRange = Msg->getSourceRange();
  bool ReceiverIsSuper =
    (Msg->getReceiverKind() == ObjCMessageExpr::SuperInstance);
  // for 'super' receiver is nullptr.
  const Expr *receiver = Msg->getInstanceReceiver();
  bool NeedsParen =
    ReceiverIsSuper ? false : subscriptOperatorNeedsParens(receiver);
  bool IsGetter = (Msg->getNumArgs() == 0);
  if (IsGetter) {
    // Find space location range between receiver expression and getter method.
    SourceLocation BegLoc =
      ReceiverIsSuper ? Msg->getSuperLoc() : receiver->getLocEnd();
    BegLoc = PP.getLocForEndOfToken(BegLoc);
    SourceLocation EndLoc = Msg->getSelectorLoc(0);
    SourceRange SpaceRange(BegLoc, EndLoc);
    std::string PropertyDotString;
    // rewrite getter method expression into: receiver.property or
    // (receiver).property
    if (NeedsParen) {
      commit.insertBefore(receiver->getLocStart(), "(");
      PropertyDotString = ").";
    }
    else
      PropertyDotString = ".";
    PropertyDotString += Prop->getName();
    commit.replace(SpaceRange, PropertyDotString);
    
    // remove '[' ']'
    commit.replace(SourceRange(MsgRange.getBegin(), MsgRange.getBegin()), "");
    commit.replace(SourceRange(MsgRange.getEnd(), MsgRange.getEnd()), "");
  } else {
    if (NeedsParen)
      commit.insertWrap("(", receiver->getSourceRange(), ")");
    std::string PropertyDotString = ".";
    PropertyDotString += Prop->getName();
    PropertyDotString += " =";
    const Expr*const* Args = Msg->getArgs();
    const Expr *RHS = Args[0];
    if (!RHS)
      return false;
    SourceLocation BegLoc =
      ReceiverIsSuper ? Msg->getSuperLoc() : receiver->getLocEnd();
    BegLoc = PP.getLocForEndOfToken(BegLoc);
    SourceLocation EndLoc = RHS->getLocStart();
    EndLoc = EndLoc.getLocWithOffset(-1);
    const char *colon = PP.getSourceManager().getCharacterData(EndLoc);
    // Add a space after '=' if there is no space between RHS and '='
    if (colon && colon[0] == ':')
      PropertyDotString += " ";
    SourceRange Range(BegLoc, EndLoc);
    commit.replace(Range, PropertyDotString);
    // remove '[' ']'
    commit.replace(SourceRange(MsgRange.getBegin(), MsgRange.getBegin()), "");
    commit.replace(SourceRange(MsgRange.getEnd(), MsgRange.getEnd()), "");
  }
  return true;
}

311class ObjCMigrator : public RecursiveASTVisitor<ObjCMigrator> {
ObjCMigrateASTConsumer &Consumer;
ParentMap &PMap;

315public:
ObjCMigrator(ObjCMigrateASTConsumer &consumer, ParentMap &PMap)
  : Consumer(consumer), PMap(PMap) { }

bool shouldVisitTemplateInstantiations() const { return false; }
bool shouldWalkTypesOfTypeLocs() const { return false; }

bool VisitObjCMessageExpr(ObjCMessageExpr *E) {
  if (Consumer.ASTMigrateActions & FrontendOptions::ObjCMT_Literals) {
    edit::Commit commit(*Consumer.Editor);
    edit::rewriteToObjCLiteralSyntax(E, *Consumer.NSAPIObj, commit, &PMap);
    Consumer.Editor->commit(commit);
  }

  if (Consumer.ASTMigrateActions & FrontendOptions::ObjCMT_Subscripting) {
    edit::Commit commit(*Consumer.Editor);
    edit::rewriteToObjCSubscriptSyntax(E, *Consumer.NSAPIObj, commit);
    Consumer.Editor->commit(commit);
  }

  if (Consumer.ASTMigrateActions & FrontendOptions::ObjCMT_PropertyDotSyntax) {
    edit::Commit commit(*Consumer.Editor);
    rewriteToPropertyDotSyntax(E, Consumer.PP, *Consumer.NSAPIObj,
                               commit, &PMap);
    Consumer.Editor->commit(commit);
  }

  return true;
}

bool TraverseObjCMessageExpr(ObjCMessageExpr *E) {
  // Do depth first; we want to rewrite the subexpressions first so that if
  // we have to move expressions we will move them already rewritten.
  for (Stmt *SubStmt : E->children())
    if (!TraverseStmt(SubStmt))
      return false;

  return WalkUpFromObjCMessageExpr(E);
}
354};

356class BodyMigrator : public RecursiveASTVisitor<BodyMigrator> {
ObjCMigrateASTConsumer &Consumer;
std::unique_ptr<ParentMap> PMap;

360public:
BodyMigrator(ObjCMigrateASTConsumer &consumer) : Consumer(consumer) { }

bool shouldVisitTemplateInstantiations() const { return false; }
bool shouldWalkTypesOfTypeLocs() const { return false; }

bool TraverseStmt(Stmt *S) {
  PMap.reset(new ParentMap(S));
  ObjCMigrator(Consumer, *PMap).TraverseStmt(S);
  return true;
}
371};
372} // end anonymous namespace

374void ObjCMigrateASTConsumer::migrateDecl(Decl *D) {
if (!D)
  return;
if (isa<ObjCMethodDecl>(D))
  return; // Wait for the ObjC container declaration.

BodyMigrator(*this).TraverseDecl(D);
381}

383static void append_attr(std::string &PropertyString, const char *attr,
                      bool &LParenAdded) {
if (!LParenAdded) {
  PropertyString += "(";
  LParenAdded = true;
}
else
  PropertyString += ", ";
PropertyString += attr;
392}

394static
395void MigrateBlockOrFunctionPointerTypeVariable(std::string & PropertyString,
                                             const std::string& TypeString,
                                             const char *name) {
const char *argPtr = TypeString.c_str();
int paren = 0;
while (*argPtr) {
  switch (*argPtr) {
    case '(':
      PropertyString += *argPtr;
      paren++;
      break;
    case ')':
      PropertyString += *argPtr;
      paren--;
      break;
    case '^':
    case '*':
      PropertyString += (*argPtr);
      if (paren == 1) {
        PropertyString += name;
        name = "";
      }
      break;
    default:
      PropertyString += *argPtr;
      break;
  }
  argPtr++;
}
424}

426static const char *PropertyMemoryAttribute(ASTContext &Context, QualType ArgType) {
Qualifiers::ObjCLifetime propertyLifetime = ArgType.getObjCLifetime();
bool RetainableObject = ArgType->isObjCRetainableType();
if (RetainableObject &&
    (propertyLifetime == Qualifiers::OCL_Strong
     || propertyLifetime == Qualifiers::OCL_None)) {
  if (const ObjCObjectPointerType *ObjPtrTy =
      ArgType->getAs<ObjCObjectPointerType>()) {
    ObjCInterfaceDecl *IDecl = ObjPtrTy->getObjectType()->getInterface();
    if (IDecl &&
        IDecl->lookupNestedProtocol(&Context.Idents.get("NSCopying")))
      return "copy";
    else
      return "strong";
  }
  else if (ArgType->isBlockPointerType())
    return "copy";
} else if (propertyLifetime == Qualifiers::OCL_Weak)
  // TODO. More precise determination of 'weak' attribute requires
  // looking into setter's implementation for backing weak ivar.
  return "weak";
else if (RetainableObject)
  return ArgType->isBlockPointerType() ? "copy" : "strong";
return nullptr;
450}

452static void rewriteToObjCProperty(const ObjCMethodDecl *Getter,
                                const ObjCMethodDecl *Setter,
                                const NSAPI &NS, edit::Commit &commit,
                                unsigned LengthOfPrefix,
                                bool Atomic, bool UseNsIosOnlyMacro,
                                bool AvailabilityArgsMatch) {
ASTContext &Context = NS.getASTContext();
bool LParenAdded = false;
std::string PropertyString = "@property ";
if (UseNsIosOnlyMacro && NS.isMacroDefined("NS_NONATOMIC_IOSONLY")) {
  PropertyString += "(NS_NONATOMIC_IOSONLY";
  LParenAdded = true;
} else if (!Atomic) {
  PropertyString += "(nonatomic";
  LParenAdded = true;
}

std::string PropertyNameString = Getter->getNameAsString();
StringRef PropertyName(PropertyNameString);
if (LengthOfPrefix > 0) {
  if (!LParenAdded) {
    PropertyString += "(getter=";
    LParenAdded = true;
  }
  else
    PropertyString += ", getter=";
  PropertyString += PropertyNameString;
}
// Property with no setter may be suggested as a 'readonly' property.
if (!Setter)
  append_attr(PropertyString, "readonly", LParenAdded);


// Short circuit 'delegate' properties that contain the name "delegate" or
// "dataSource", or have exact name "target" to have 'assign' attribute.
if (PropertyName.equals("target") ||
    (PropertyName.find("delegate") != StringRef::npos) ||
    (PropertyName.find("dataSource") != StringRef::npos)) {
  QualType QT = Getter->getReturnType();
  if (!QT->isRealType())
    append_attr(PropertyString, "assign", LParenAdded);
} else if (!Setter) {
  QualType ResType = Context.getCanonicalType(Getter->getReturnType());
  if (const char *MemoryManagementAttr = PropertyMemoryAttribute(Context, ResType))
    append_attr(PropertyString, MemoryManagementAttr, LParenAdded);
} else {
  const ParmVarDecl *argDecl = *Setter->param_begin();
  QualType ArgType = Context.getCanonicalType(argDecl->getType());
  if (const char *MemoryManagementAttr = PropertyMemoryAttribute(Context, ArgType))
    append_attr(PropertyString, MemoryManagementAttr, LParenAdded);
}
if (LParenAdded)
  PropertyString += ')';
QualType RT = Getter->getReturnType();
if (!isa<TypedefType>(RT)) {
  // strip off any ARC lifetime qualifier.
  QualType CanResultTy = Context.getCanonicalType(RT);
  if (CanResultTy.getQualifiers().hasObjCLifetime()) {
    Qualifiers Qs = CanResultTy.getQualifiers();
    Qs.removeObjCLifetime();
    RT = Context.getQualifiedType(CanResultTy.getUnqualifiedType(), Qs);
  }
}
PropertyString += " ";
PrintingPolicy SubPolicy(Context.getPrintingPolicy());
SubPolicy.SuppressStrongLifetime = true;
SubPolicy.SuppressLifetimeQualifiers = true;
std::string TypeString = RT.getAsString(SubPolicy);
if (LengthOfPrefix > 0) {
  // property name must strip off "is" and lower case the first character
  // after that; e.g. isContinuous will become continuous.
  StringRef PropertyNameStringRef(PropertyNameString);
  PropertyNameStringRef = PropertyNameStringRef.drop_front(LengthOfPrefix);
  PropertyNameString = PropertyNameStringRef;
  bool NoLowering = (isUppercase(PropertyNameString[0]) &&
                     PropertyNameString.size() > 1 &&
                     isUppercase(PropertyNameString[1]));
  if (!NoLowering)
    PropertyNameString[0] = toLowercase(PropertyNameString[0]);
}
if (RT->isBlockPointerType() || RT->isFunctionPointerType())
  MigrateBlockOrFunctionPointerTypeVariable(PropertyString,
                                            TypeString,
                                            PropertyNameString.c_str());
else {
  char LastChar = TypeString[TypeString.size()-1];
  PropertyString += TypeString;
  if (LastChar != '*')
    PropertyString += ' ';
  PropertyString += PropertyNameString;
}
SourceLocation StartGetterSelectorLoc = Getter->getSelectorStartLoc();
Selector GetterSelector = Getter->getSelector();

SourceLocation EndGetterSelectorLoc =
  StartGetterSelectorLoc.getLocWithOffset(GetterSelector.getNameForSlot(0).size());
commit.replace(CharSourceRange::getCharRange(Getter->getLocStart(),
                                             EndGetterSelectorLoc),
               PropertyString);
if (Setter && AvailabilityArgsMatch) {
  SourceLocation EndLoc = Setter->getDeclaratorEndLoc();
  // Get location past ';'
  EndLoc = EndLoc.getLocWithOffset(1);
  SourceLocation BeginOfSetterDclLoc = Setter->getLocStart();
  // FIXME. This assumes that setter decl; is immediately preceded by eoln.
  // It is trying to remove the setter method decl. line entirely.
  BeginOfSetterDclLoc = BeginOfSetterDclLoc.getLocWithOffset(-1);
  commit.remove(SourceRange(BeginOfSetterDclLoc, EndLoc));
}
561}

563static bool IsCategoryNameWithDeprecatedSuffix(ObjCContainerDecl *D) {
if (ObjCCategoryDecl *CatDecl = dyn_cast<ObjCCategoryDecl>(D)) {
  StringRef Name = CatDecl->getName();
  return Name.endswith("Deprecated");
}
return false;
569}

571void ObjCMigrateASTConsumer::migrateObjCContainerDecl(ASTContext &Ctx,
                                                    ObjCContainerDecl *D) {
if (D->isDeprecated() || IsCategoryNameWithDeprecatedSuffix(D))
  return;
  
for (auto *Method : D->methods()) {
  if (Method->isDeprecated())
    continue;
  bool PropertyInferred = migrateProperty(Ctx, D, Method);
  // If a property is inferred, do not attempt to attach NS_RETURNS_INNER_POINTER to
  // the getter method as it ends up on the property itself which we don't want
  // to do unless -objcmt-returns-innerpointer-property  option is on.
  if (!PropertyInferred ||
      (ASTMigrateActions & FrontendOptions::ObjCMT_ReturnsInnerPointerProperty))
    if (ASTMigrateActions & FrontendOptions::ObjCMT_Annotation)
      migrateNsReturnsInnerPointer(Ctx, Method);
}
if (!(ASTMigrateActions & FrontendOptions::ObjCMT_ReturnsInnerPointerProperty))
  return;

for (auto *Prop : D->instance_properties()) {
  if ((ASTMigrateActions & FrontendOptions::ObjCMT_Annotation) &&
      !Prop->isDeprecated())
    migratePropertyNsReturnsInnerPointer(Ctx, Prop);
}
596}

598static bool
599ClassImplementsAllMethodsAndProperties(ASTContext &Ctx,
                                    const ObjCImplementationDecl *ImpDecl,
                                     const ObjCInterfaceDecl *IDecl,
                                    ObjCProtocolDecl *Protocol) {
// In auto-synthesis, protocol properties are not synthesized. So,
// a conforming protocol must have its required properties declared
// in class interface.
bool HasAtleastOneRequiredProperty = false;
if (const ObjCProtocolDecl *PDecl = Protocol->getDefinition())
  for (const auto *Property : PDecl->instance_properties()) {
    if (Property->getPropertyImplementation() == ObjCPropertyDecl::Optional)
      continue;
    HasAtleastOneRequiredProperty = true;
    DeclContext::lookup_result R = IDecl->lookup(Property->getDeclName());
    if (R.size() == 0) {
      // Relax the rule and look into class's implementation for a synthesize
      // or dynamic declaration. Class is implementing a property coming from
      // another protocol. This still makes the target protocol as conforming.
      if (!ImpDecl->FindPropertyImplDecl(
                                Property->getDeclName().getAsIdentifierInfo(),
                                Property->getQueryKind()))
        return false;
    }
    else if (ObjCPropertyDecl *ClassProperty = dyn_cast<ObjCPropertyDecl>(R[0])) {
        if ((ClassProperty->getPropertyAttributes()
            != Property->getPropertyAttributes()) ||
            !Ctx.hasSameType(ClassProperty->getType(), Property->getType()))
          return false;
    }
    else
      return false;
  }

// At this point, all required properties in this protocol conform to those
// declared in the class.
// Check that class implements the required methods of the protocol too.
bool HasAtleastOneRequiredMethod = false;
if (const ObjCProtocolDecl *PDecl = Protocol->getDefinition()) {
  if (PDecl->meth_begin() == PDecl->meth_end())
    return HasAtleastOneRequiredProperty;
  for (const auto *MD : PDecl->methods()) {
    if (MD->isImplicit())
      continue;
    if (MD->getImplementationControl() == ObjCMethodDecl::Optional)
      continue;
    DeclContext::lookup_result R = ImpDecl->lookup(MD->getDeclName());
    if (R.size() == 0)
      return false;
    bool match = false;
    HasAtleastOneRequiredMethod = true;
    for (unsigned I = 0, N = R.size(); I != N; ++I)
      if (ObjCMethodDecl *ImpMD = dyn_cast<ObjCMethodDecl>(R[0]))
        if (Ctx.ObjCMethodsAreEqual(MD, ImpMD)) {
          match = true;
          break;
        }
    if (!match)
      return false;
  }
}
return HasAtleastOneRequiredProperty || HasAtleastOneRequiredMethod;
660}

662static bool rewriteToObjCInterfaceDecl(const ObjCInterfaceDecl *IDecl,
                  llvm::SmallVectorImpl<ObjCProtocolDecl*> &ConformingProtocols,
                  const NSAPI &NS, edit::Commit &commit) {
const ObjCList<ObjCProtocolDecl> &Protocols = IDecl->getReferencedProtocols();
std::string ClassString;
SourceLocation EndLoc =
IDecl->getSuperClass() ? IDecl->getSuperClassLoc() : IDecl->getLocation();

if (Protocols.empty()) {
  ClassString = '<';
  for (unsigned i = 0, e = ConformingProtocols.size(); i != e; i++) {
    ClassString += ConformingProtocols[i]->getNameAsString();
    if (i != (e-1))
      ClassString += ", ";
  }
  ClassString += "> ";
}
else {
  ClassString = ", ";
  for (unsigned i = 0, e = ConformingProtocols.size(); i != e; i++) {
    ClassString += ConformingProtocols[i]->getNameAsString();
    if (i != (e-1))
      ClassString += ", ";
  }
  ObjCInterfaceDecl::protocol_loc_iterator PL = IDecl->protocol_loc_end() - 1;
  EndLoc = *PL;
}

commit.insertAfterToken(EndLoc, ClassString);
return true;
692}

694static StringRef GetUnsignedName(StringRef NSIntegerName) {
StringRef UnsignedName = llvm::StringSwitch<StringRef>(NSIntegerName)
  .Case("int8_t", "uint8_t")
  .Case("int16_t", "uint16_t")
  .Case("int32_t", "uint32_t")
  .Case("NSInteger", "NSUInteger")
  .Case("int64_t", "uint64_t")
  .Default(NSIntegerName);
return UnsignedName;
703}

705static bool rewriteToNSEnumDecl(const EnumDecl *EnumDcl,
                              const TypedefDecl *TypedefDcl,
                              const NSAPI &NS, edit::Commit &commit,
                              StringRef NSIntegerName,
                              bool NSOptions) {
std::string ClassString;
if (NSOptions) {
  ClassString = "typedef NS_OPTIONS(";
  ClassString += GetUnsignedName(NSIntegerName);
}
else {
  ClassString = "typedef NS_ENUM(";
  ClassString += NSIntegerName;
}
ClassString += ", ";

ClassString += TypedefDcl->getIdentifier()->getName();
ClassString += ')';
SourceRange R(EnumDcl->getLocStart(), EnumDcl->getLocStart());
commit.replace(R, ClassString);
SourceLocation EndOfEnumDclLoc = EnumDcl->getLocEnd();
EndOfEnumDclLoc = trans::findSemiAfterLocation(EndOfEnumDclLoc,
                                               NS.getASTContext(), /*IsDecl*/true);
if (EndOfEnumDclLoc.isValid()) {
  SourceRange EnumDclRange(EnumDcl->getLocStart(), EndOfEnumDclLoc);
  commit.insertFromRange(TypedefDcl->getLocStart(), EnumDclRange);
}
else
  return false;

SourceLocation EndTypedefDclLoc = TypedefDcl->getLocEnd();
EndTypedefDclLoc = trans::findSemiAfterLocation(EndTypedefDclLoc,
                                               NS.getASTContext(), /*IsDecl*/true);
if (EndTypedefDclLoc.isValid()) {
  SourceRange TDRange(TypedefDcl->getLocStart(), EndTypedefDclLoc);
  commit.remove(TDRange);
}
else
  return false;

EndOfEnumDclLoc = trans::findLocationAfterSemi(EnumDcl->getLocEnd(), NS.getASTContext(),
                                               /*IsDecl*/true);
if (EndOfEnumDclLoc.isValid()) {
  SourceLocation BeginOfEnumDclLoc = EnumDcl->getLocStart();
  // FIXME. This assumes that enum decl; is immediately preceded by eoln.
  // It is trying to remove the enum decl. lines entirely.
  BeginOfEnumDclLoc = BeginOfEnumDclLoc.getLocWithOffset(-1);
  commit.remove(SourceRange(BeginOfEnumDclLoc, EndOfEnumDclLoc));
  return true;
}
return false;
756}

758static void rewriteToNSMacroDecl(ASTContext &Ctx,
                               const EnumDecl *EnumDcl,
                              const TypedefDecl *TypedefDcl,
                              const NSAPI &NS, edit::Commit &commit,
                               bool IsNSIntegerType) {
QualType DesignatedEnumType = EnumDcl->getIntegerType();
assert(!DesignatedEnumType.isNull()(static_cast <bool> (!DesignatedEnumType.isNull() &&
 "rewriteToNSMacroDecl - underlying enum type is null") ? void
 (0) : __assert_fail ("!DesignatedEnumType.isNull() && \"rewriteToNSMacroDecl - underlying enum type is null\""
, "/build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp"
, 765, __extension__ __PRETTY_FUNCTION__))
       && "rewriteToNSMacroDecl - underlying enum type is null")(static_cast <bool> (!DesignatedEnumType.isNull() &&
 "rewriteToNSMacroDecl - underlying enum type is null") ? void
 (0) : __assert_fail ("!DesignatedEnumType.isNull() && \"rewriteToNSMacroDecl - underlying enum type is null\""
, "/build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp"
, 765, __extension__ __PRETTY_FUNCTION__));

PrintingPolicy Policy(Ctx.getPrintingPolicy());
std::string TypeString = DesignatedEnumType.getAsString(Policy);
std::string ClassString = IsNSIntegerType ? "NS_ENUM(" : "NS_OPTIONS(";
ClassString += TypeString;
ClassString += ", ";

ClassString += TypedefDcl->getIdentifier()->getName();
ClassString += ") ";
SourceLocation EndLoc = EnumDcl->getBraceRange().getBegin();
if (EndLoc.isInvalid())
  return;
CharSourceRange R = CharSourceRange::getCharRange(EnumDcl->getLocStart(), EndLoc);
commit.replace(R, ClassString);
// This is to remove spaces between '}' and typedef name.
SourceLocation StartTypedefLoc = EnumDcl->getLocEnd();
StartTypedefLoc = StartTypedefLoc.getLocWithOffset(+1);
SourceLocation EndTypedefLoc = TypedefDcl->getLocEnd();

commit.remove(SourceRange(StartTypedefLoc, EndTypedefLoc));
786}

788static bool UseNSOptionsMacro(Preprocessor &PP, ASTContext &Ctx,
                            const EnumDecl *EnumDcl) {
bool PowerOfTwo = true;
bool AllHexdecimalEnumerator = true;
uint64_t MaxPowerOfTwoVal = 0;
for (auto Enumerator : EnumDcl->enumerators()) {
  const Expr *InitExpr = Enumerator->getInitExpr();
  if (!InitExpr) {
    PowerOfTwo = false;
    AllHexdecimalEnumerator = false;
    continue;
  }
  InitExpr = InitExpr->IgnoreParenCasts();
  if (const BinaryOperator *BO = dyn_cast<BinaryOperator>(InitExpr))
    if (BO->isShiftOp() || BO->isBitwiseOp())
      return true;
  
  uint64_t EnumVal = Enumerator->getInitVal().getZExtValue();
  if (PowerOfTwo && EnumVal) {
    if (!llvm::isPowerOf2_64(EnumVal))
      PowerOfTwo = false;
    else if (EnumVal > MaxPowerOfTwoVal)
      MaxPowerOfTwoVal = EnumVal;
  }
  if (AllHexdecimalEnumerator && EnumVal) {
    bool FoundHexdecimalEnumerator = false;
    SourceLocation EndLoc = Enumerator->getLocEnd();
    Token Tok;
    if (!PP.getRawToken(EndLoc, Tok, /*IgnoreWhiteSpace=*/true))
      if (Tok.isLiteral() && Tok.getLength() > 2) {
        if (const char *StringLit = Tok.getLiteralData())
          FoundHexdecimalEnumerator =
            (StringLit[0] == '0' && (toLowercase(StringLit[1]) == 'x'));
      }
    if (!FoundHexdecimalEnumerator)
      AllHexdecimalEnumerator = false;
  }
}
return AllHexdecimalEnumerator || (PowerOfTwo && (MaxPowerOfTwoVal > 2));
827}

829void ObjCMigrateASTConsumer::migrateProtocolConformance(ASTContext &Ctx,   
                                          const ObjCImplementationDecl *ImpDecl) {
const ObjCInterfaceDecl *IDecl = ImpDecl->getClassInterface();
if (!IDecl || ObjCProtocolDecls.empty() || IDecl->isDeprecated())
  return;
// Find all implicit conforming protocols for this class
// and make them explicit.
llvm::SmallPtrSet<ObjCProtocolDecl *, 8> ExplicitProtocols;
Ctx.CollectInheritedProtocols(IDecl, ExplicitProtocols);
llvm::SmallVector<ObjCProtocolDecl *, 8> PotentialImplicitProtocols;

for (ObjCProtocolDecl *ProtDecl : ObjCProtocolDecls)
  if (!ExplicitProtocols.count(ProtDecl))
    PotentialImplicitProtocols.push_back(ProtDecl);

if (PotentialImplicitProtocols.empty())
  return;

// go through list of non-optional methods and properties in each protocol
// in the PotentialImplicitProtocols list. If class implements every one of the
// methods and properties, then this class conforms to this protocol.
llvm::SmallVector<ObjCProtocolDecl*, 8> ConformingProtocols;
for (unsigned i = 0, e = PotentialImplicitProtocols.size(); i != e; i++)
  if (ClassImplementsAllMethodsAndProperties(Ctx, ImpDecl, IDecl,
                                            PotentialImplicitProtocols[i]))
    ConformingProtocols.push_back(PotentialImplicitProtocols[i]);

if (ConformingProtocols.empty())
  return;

// Further reduce number of conforming protocols. If protocol P1 is in the list
// protocol P2 (P2<P1>), No need to include P1.
llvm::SmallVector<ObjCProtocolDecl*, 8> MinimalConformingProtocols;
for (unsigned i = 0, e = ConformingProtocols.size(); i != e; i++) {
  bool DropIt = false;
  ObjCProtocolDecl *TargetPDecl = ConformingProtocols[i];
  for (unsigned i1 = 0, e1 = ConformingProtocols.size(); i1 != e1; i1++) {
    ObjCProtocolDecl *PDecl = ConformingProtocols[i1];
    if (PDecl == TargetPDecl)
      continue;
    if (PDecl->lookupProtocolNamed(
          TargetPDecl->getDeclName().getAsIdentifierInfo())) {
      DropIt = true;
      break;
    }
  }
  if (!DropIt)
    MinimalConformingProtocols.push_back(TargetPDecl);
}
if (MinimalConformingProtocols.empty())
  return;
edit::Commit commit(*Editor);
rewriteToObjCInterfaceDecl(IDecl, MinimalConformingProtocols,
                           *NSAPIObj, commit);
Editor->commit(commit);
884}

886void ObjCMigrateASTConsumer::CacheObjCNSIntegerTypedefed(
                                        const TypedefDecl *TypedefDcl) {

QualType qt = TypedefDcl->getTypeSourceInfo()->getType();
if (NSAPIObj->isObjCNSIntegerType(qt))
  NSIntegerTypedefed = TypedefDcl;
else if (NSAPIObj->isObjCNSUIntegerType(qt))
  NSUIntegerTypedefed = TypedefDcl;
894}

896bool ObjCMigrateASTConsumer::migrateNSEnumDecl(ASTContext &Ctx,
                                         const EnumDecl *EnumDcl,
                                         const TypedefDecl *TypedefDcl) {
if (!EnumDcl->isCompleteDefinition() || EnumDcl->getIdentifier() ||
    EnumDcl->isDeprecated())
  return false;
if (!TypedefDcl) {
  if (NSIntegerTypedefed) {
    TypedefDcl = NSIntegerTypedefed;
    NSIntegerTypedefed = nullptr;
  }
  else if (NSUIntegerTypedefed) {
    TypedefDcl = NSUIntegerTypedefed;
    NSUIntegerTypedefed = nullptr;
  }
  else
    return false;
  FileID FileIdOfTypedefDcl =
    PP.getSourceManager().getFileID(TypedefDcl->getLocation());
  FileID FileIdOfEnumDcl =
    PP.getSourceManager().getFileID(EnumDcl->getLocation());
  if (FileIdOfTypedefDcl != FileIdOfEnumDcl)
    return false;
}
if (TypedefDcl->isDeprecated())
  return false;

QualType qt = TypedefDcl->getTypeSourceInfo()->getType();
StringRef NSIntegerName = NSAPIObj->GetNSIntegralKind(qt);

if (NSIntegerName.empty()) {
  // Also check for typedef enum {...} TD;
  if (const EnumType *EnumTy = qt->getAs<EnumType>()) {
    if (EnumTy->getDecl() == EnumDcl) {
      bool NSOptions = UseNSOptionsMacro(PP, Ctx, EnumDcl);
      if (!InsertFoundation(Ctx, TypedefDcl->getLocStart()))
        return false;
      edit::Commit commit(*Editor);
      rewriteToNSMacroDecl(Ctx, EnumDcl, TypedefDcl, *NSAPIObj, commit, !NSOptions);
      Editor->commit(commit);
      return true;
    }
  }
  return false;
}

// We may still use NS_OPTIONS based on what we find in the enumertor list.
bool NSOptions = UseNSOptionsMacro(PP, Ctx, EnumDcl);
if (!InsertFoundation(Ctx, TypedefDcl->getLocStart()))
  return false;
edit::Commit commit(*Editor);
bool Res = rewriteToNSEnumDecl(EnumDcl, TypedefDcl, *NSAPIObj,
                               commit, NSIntegerName, NSOptions);
Editor->commit(commit);
return Res;
951}

953static void ReplaceWithInstancetype(ASTContext &Ctx,
                                  const ObjCMigrateASTConsumer &ASTC,
                                  ObjCMethodDecl *OM) {
if (OM->getReturnType() == Ctx.getObjCInstanceType())
  return; // already has instancetype.

SourceRange R;
std::string ClassString;
if (TypeSourceInfo *TSInfo = OM->getReturnTypeSourceInfo()) {
  TypeLoc TL = TSInfo->getTypeLoc();
  R = SourceRange(TL.getBeginLoc(), TL.getEndLoc());
  ClassString = "instancetype";
}
else {
  R = SourceRange(OM->getLocStart(), OM->getLocStart());
  ClassString = OM->isInstanceMethod() ? '-' : '+';
  ClassString += " (instancetype)";
}
edit::Commit commit(*ASTC.Editor);
commit.replace(R, ClassString);
ASTC.Editor->commit(commit);
974}

976static void ReplaceWithClasstype(const ObjCMigrateASTConsumer &ASTC,
                                  ObjCMethodDecl *OM) {
ObjCInterfaceDecl *IDecl = OM->getClassInterface();
SourceRange R;
std::string ClassString;
if (TypeSourceInfo *TSInfo = OM->getReturnTypeSourceInfo()) {
  TypeLoc TL = TSInfo->getTypeLoc();
  R = SourceRange(TL.getBeginLoc(), TL.getEndLoc()); {
    ClassString  = IDecl->getName();
    ClassString += "*";
  }
}
else {
  R = SourceRange(OM->getLocStart(), OM->getLocStart());
  ClassString = "+ (";
  ClassString += IDecl->getName(); ClassString += "*)";
}
edit::Commit commit(*ASTC.Editor);
commit.replace(R, ClassString);
ASTC.Editor->commit(commit);
996}

998void ObjCMigrateASTConsumer::migrateMethodInstanceType(ASTContext &Ctx,
                                                     ObjCContainerDecl *CDecl,
                                                     ObjCMethodDecl *OM) {
ObjCInstanceTypeFamily OIT_Family =
  Selector::getInstTypeMethodFamily(OM->getSelector());

std::string ClassName;
switch (OIT_Family) {
  case OIT_None:
    migrateFactoryMethod(Ctx, CDecl, OM);
    return;
  case OIT_Array:
    ClassName = "NSArray";
    break;
  case OIT_Dictionary:
    ClassName = "NSDictionary";
    break;
  case OIT_Singleton:
    migrateFactoryMethod(Ctx, CDecl, OM, OIT_Singleton);
    return;
  case OIT_Init:
    if (OM->getReturnType()->isObjCIdType())
      ReplaceWithInstancetype(Ctx, *this, OM);
    return;
  case OIT_ReturnsSelf:
    migrateFactoryMethod(Ctx, CDecl, OM, OIT_ReturnsSelf);
    return;
}
if (!OM->getReturnType()->isObjCIdType())
  return;

ObjCInterfaceDecl *IDecl = dyn_cast<ObjCInterfaceDecl>(CDecl);
if (!IDecl) {
  if (ObjCCategoryDecl *CatDecl = dyn_cast<ObjCCategoryDecl>(CDecl))
    IDecl = CatDecl->getClassInterface();
  else if (ObjCImplDecl *ImpDecl = dyn_cast<ObjCImplDecl>(CDecl))
    IDecl = ImpDecl->getClassInterface();
}
if (!IDecl ||
    !IDecl->lookupInheritedClass(&Ctx.Idents.get(ClassName))) {
  migrateFactoryMethod(Ctx, CDecl, OM);
  return;
}
ReplaceWithInstancetype(Ctx, *this, OM);
1042}

1044static bool TypeIsInnerPointer(QualType T) {
if (!T->isAnyPointerType())
  return false;
if (T->isObjCObjectPointerType() || T->isObjCBuiltinType() ||
    T->isBlockPointerType() || T->isFunctionPointerType() ||
    ento::coreFoundation::isCFObjectRef(T))
  return false;
// Also, typedef-of-pointer-to-incomplete-struct is something that we assume
// is not an innter pointer type.
QualType OrigT = T;
while (const TypedefType *TD = dyn_cast<TypedefType>(T.getTypePtr()))
  T = TD->getDecl()->getUnderlyingType();
if (OrigT == T || !T->isPointerType())
  return true;
const PointerType* PT = T->getAs<PointerType>();
QualType UPointeeT = PT->getPointeeType().getUnqualifiedType();
if (UPointeeT->isRecordType()) {
  const RecordType *RecordTy = UPointeeT->getAs<RecordType>();
  if (!RecordTy->getDecl()->isCompleteDefinition())
    return false;
}
return true;
1066}

1068/// \brief Check whether the two versions match.
1069static bool versionsMatch(const VersionTuple &X, const VersionTuple &Y) {
return (X == Y);
1071}

1073/// AvailabilityAttrsMatch - This routine checks that if comparing two
1074/// availability attributes, all their components match. It returns
1075/// true, if not dealing with availability or when all components of
1076/// availability attributes match. This routine is only called when
1077/// the attributes are of the same kind.
1078static bool AvailabilityAttrsMatch(Attr *At1, Attr *At2) {
const AvailabilityAttr *AA1 = dyn_cast<AvailabilityAttr>(At1);
if (!AA1)
  return true;
const AvailabilityAttr *AA2 = dyn_cast<AvailabilityAttr>(At2);

VersionTuple Introduced1 = AA1->getIntroduced();
VersionTuple Deprecated1 = AA1->getDeprecated();
VersionTuple Obsoleted1 = AA1->getObsoleted();
bool IsUnavailable1 = AA1->getUnavailable();
VersionTuple Introduced2 = AA2->getIntroduced();
VersionTuple Deprecated2 = AA2->getDeprecated();
VersionTuple Obsoleted2 = AA2->getObsoleted();
bool IsUnavailable2 = AA2->getUnavailable();
return (versionsMatch(Introduced1, Introduced2) &&
        versionsMatch(Deprecated1, Deprecated2) &&
        versionsMatch(Obsoleted1, Obsoleted2) &&
        IsUnavailable1 == IsUnavailable2);
1096}

1098static bool MatchTwoAttributeLists(const AttrVec &Attrs1, const AttrVec &Attrs2,
                                 bool &AvailabilityArgsMatch) {
// This list is very small, so this need not be optimized.
for (unsigned i = 0, e = Attrs1.size(); i != e; i++) {
  bool match = false;
  for (unsigned j = 0, f = Attrs2.size(); j != f; j++) {
    // Matching attribute kind only. Except for Availability attributes,
    // we are not getting into details of the attributes. For all practical purposes
    // this is sufficient.
    if (Attrs1[i]->getKind() == Attrs2[j]->getKind()) {
      if (AvailabilityArgsMatch)
        AvailabilityArgsMatch = AvailabilityAttrsMatch(Attrs1[i], Attrs2[j]);
      match = true;
      break;
    }
  }
  if (!match)
    return false;
}
return true;
1118}

1120/// AttributesMatch - This routine checks list of attributes for two
1121/// decls. It returns false, if there is a mismatch in kind of
1122/// attributes seen in the decls. It returns true if the two decls
1123/// have list of same kind of attributes. Furthermore, when there
1124/// are availability attributes in the two decls, it sets the
1125/// AvailabilityArgsMatch to false if availability attributes have
1126/// different versions, etc.
1127static bool AttributesMatch(const Decl *Decl1, const Decl *Decl2,
                          bool &AvailabilityArgsMatch) {
if (!Decl1->hasAttrs() || !Decl2->hasAttrs()) {
  AvailabilityArgsMatch = (Decl1->hasAttrs() == Decl2->hasAttrs());
  return true;
}
AvailabilityArgsMatch = true;
const AttrVec &Attrs1 = Decl1->getAttrs();
const AttrVec &Attrs2 = Decl2->getAttrs();
bool match = MatchTwoAttributeLists(Attrs1, Attrs2, AvailabilityArgsMatch);
if (match && (Attrs2.size() > Attrs1.size()))
  return MatchTwoAttributeLists(Attrs2, Attrs1, AvailabilityArgsMatch);
return match;
1140}

1142static bool IsValidIdentifier(ASTContext &Ctx,
                            const char *Name) {
if (!isIdentifierHead(Name[0]))
  return false;
std::string NameString = Name;
NameString[0] = toLowercase(NameString[0]);
IdentifierInfo *II = &Ctx.Idents.get(NameString);
return II->getTokenID() ==  tok::identifier;
1150}

1152bool ObjCMigrateASTConsumer::migrateProperty(ASTContext &Ctx,
                           ObjCContainerDecl *D,
                           ObjCMethodDecl *Method) {
if (Method->isPropertyAccessor() || !Method->isInstanceMethod() ||
    Method->param_size() != 0)
  return false;
// Is this method candidate to be a getter?
QualType GRT = Method->getReturnType();
if (GRT->isVoidType())
  return false;

Selector GetterSelector = Method->getSelector();
ObjCInstanceTypeFamily OIT_Family =
  Selector::getInstTypeMethodFamily(GetterSelector);

if (OIT_Family != OIT_None)
  return false;

IdentifierInfo *getterName = GetterSelector.getIdentifierInfoForSlot(0);
Selector SetterSelector =
SelectorTable::constructSetterSelector(PP.getIdentifierTable(),
                                       PP.getSelectorTable(),
                                       getterName);
ObjCMethodDecl *SetterMethod = D->getInstanceMethod(SetterSelector);
unsigned LengthOfPrefix = 0;
if (!SetterMethod) {
  // try a different naming convention for getter: isXxxxx
  StringRef getterNameString = getterName->getName();
  bool IsPrefix = getterNameString.startswith("is");
  // Note that we don't want to change an isXXX method of retainable object
  // type to property (readonly or otherwise).
  if (IsPrefix && GRT->isObjCRetainableType())
    return false;
  if (IsPrefix || getterNameString.startswith("get")) {
    LengthOfPrefix = (IsPrefix ? 2 : 3);
    const char *CGetterName = getterNameString.data() + LengthOfPrefix;
    // Make sure that first character after "is" or "get" prefix can
    // start an identifier.
    if (!IsValidIdentifier(Ctx, CGetterName))
      return false;
    if (CGetterName[0] && isUppercase(CGetterName[0])) {
      getterName = &Ctx.Idents.get(CGetterName);
      SetterSelector =
      SelectorTable::constructSetterSelector(PP.getIdentifierTable(),
                                             PP.getSelectorTable(),
                                             getterName);
      SetterMethod = D->getInstanceMethod(SetterSelector);
    }
  }
}

if (SetterMethod) {
  if ((ASTMigrateActions & FrontendOptions::ObjCMT_ReadwriteProperty) == 0)
    return false;
  bool AvailabilityArgsMatch;
  if (SetterMethod->isDeprecated() ||
      !AttributesMatch(Method, SetterMethod, AvailabilityArgsMatch))
    return false;
  
  // Is this a valid setter, matching the target getter?
  QualType SRT = SetterMethod->getReturnType();
  if (!SRT->isVoidType())
    return false;
  const ParmVarDecl *argDecl = *SetterMethod->param_begin();
  QualType ArgType = argDecl->getType();
  if (!Ctx.hasSameUnqualifiedType(ArgType, GRT))
    return false;
  edit::Commit commit(*Editor);
  rewriteToObjCProperty(Method, SetterMethod, *NSAPIObj, commit,
                        LengthOfPrefix,
                        (ASTMigrateActions &
                         FrontendOptions::ObjCMT_AtomicProperty) != 0,
                        (ASTMigrateActions &
                         FrontendOptions::ObjCMT_NsAtomicIOSOnlyProperty) != 0,
                        AvailabilityArgsMatch);
  Editor->commit(commit);
  return true;
}
else if (ASTMigrateActions & FrontendOptions::ObjCMT_ReadonlyProperty) {
  // Try a non-void method with no argument (and no setter or property of same name
  // as a 'readonly' property.
  edit::Commit commit(*Editor);
  rewriteToObjCProperty(Method, nullptr /*SetterMethod*/, *NSAPIObj, commit,
                        LengthOfPrefix,
                        (ASTMigrateActions &
                         FrontendOptions::ObjCMT_AtomicProperty) != 0,
                        (ASTMigrateActions &
                         FrontendOptions::ObjCMT_NsAtomicIOSOnlyProperty) != 0,
                        /*AvailabilityArgsMatch*/false);
  Editor->commit(commit);
  return true;
}
return false;
1245}

1247void ObjCMigrateASTConsumer::migrateNsReturnsInnerPointer(ASTContext &Ctx,
                                                        ObjCMethodDecl *OM) {
if (OM->isImplicit() ||
    !OM->isInstanceMethod() ||
    OM->hasAttr<ObjCReturnsInnerPointerAttr>())
  return;

QualType RT = OM->getReturnType();
if (!TypeIsInnerPointer(RT) ||
    !NSAPIObj->isMacroDefined("NS_RETURNS_INNER_POINTER"))
  return;

edit::Commit commit(*Editor);
commit.insertBefore(OM->getLocEnd(), " NS_RETURNS_INNER_POINTER");
Editor->commit(commit);
1262}

1264void ObjCMigrateASTConsumer::migratePropertyNsReturnsInnerPointer(ASTContext &Ctx,
                                                                ObjCPropertyDecl *P) {
QualType T = P->getType();

if (!TypeIsInnerPointer(T) ||
    !NSAPIObj->isMacroDefined("NS_RETURNS_INNER_POINTER"))
  return;
edit::Commit commit(*Editor);
commit.insertBefore(P->getLocEnd(), " NS_RETURNS_INNER_POINTER ");
Editor->commit(commit);
1274}

1276void ObjCMigrateASTConsumer::migrateAllMethodInstaceType(ASTContext &Ctx,
                                               ObjCContainerDecl *CDecl) {
if (CDecl->isDeprecated() || IsCategoryNameWithDeprecatedSuffix(CDecl))
  return;

// migrate methods which can have instancetype as their result type.
for (auto *Method : CDecl->methods()) {
  if (Method->isDeprecated())
    continue;
  migrateMethodInstanceType(Ctx, CDecl, Method);
}
1287}

1289void ObjCMigrateASTConsumer::migrateFactoryMethod(ASTContext &Ctx,
                                                ObjCContainerDecl *CDecl,
                                                ObjCMethodDecl *OM,
                                                ObjCInstanceTypeFamily OIT_Family) {
if (OM->isInstanceMethod() ||
    OM->getReturnType() == Ctx.getObjCInstanceType() ||
    !OM->getReturnType()->isObjCIdType())
  return;

// Candidate factory methods are + (id) NaMeXXX : ... which belong to a class
// NSYYYNamE with matching names be at least 3 characters long.
ObjCInterfaceDecl *IDecl = dyn_cast<ObjCInterfaceDecl>(CDecl);
if (!IDecl) {
  if (ObjCCategoryDecl *CatDecl = dyn_cast<ObjCCategoryDecl>(CDecl))
    IDecl = CatDecl->getClassInterface();
  else if (ObjCImplDecl *ImpDecl = dyn_cast<ObjCImplDecl>(CDecl))
    IDecl = ImpDecl->getClassInterface();
}
if (!IDecl)
  return;

std::string StringClassName = IDecl->getName();
StringRef LoweredClassName(StringClassName);
std::string StringLoweredClassName = LoweredClassName.lower();
LoweredClassName = StringLoweredClassName;

IdentifierInfo *MethodIdName = OM->getSelector().getIdentifierInfoForSlot(0);
// Handle method with no name at its first selector slot; e.g. + (id):(int)x.
if (!MethodIdName)
  return;

std::string MethodName = MethodIdName->getName();
if (OIT_Family == OIT_Singleton || OIT_Family == OIT_ReturnsSelf) {
  StringRef STRefMethodName(MethodName);
  size_t len = 0;
  if (STRefMethodName.startswith("standard"))
    len = strlen("standard");
  else if (STRefMethodName.startswith("shared"))
    len = strlen("shared");
  else if (STRefMethodName.startswith("default"))
    len = strlen("default");
  else
    return;
  MethodName = STRefMethodName.substr(len);
}
std::string MethodNameSubStr = MethodName.substr(0, 3);
StringRef MethodNamePrefix(MethodNameSubStr);
std::string StringLoweredMethodNamePrefix = MethodNamePrefix.lower();
MethodNamePrefix = StringLoweredMethodNamePrefix;
size_t Ix = LoweredClassName.rfind(MethodNamePrefix);
if (Ix == StringRef::npos)
  return;
std::string ClassNamePostfix = LoweredClassName.substr(Ix);
StringRef LoweredMethodName(MethodName);
std::string StringLoweredMethodName = LoweredMethodName.lower();
LoweredMethodName = StringLoweredMethodName;
if (!LoweredMethodName.startswith(ClassNamePostfix))
  return;
if (OIT_Family == OIT_ReturnsSelf)
  ReplaceWithClasstype(*this, OM);
else
  ReplaceWithInstancetype(Ctx, *this, OM);
1351}

1353static bool IsVoidStarType(QualType Ty) {
if (!Ty->isPointerType())
  return false;

while (const TypedefType *TD = dyn_cast<TypedefType>(Ty.getTypePtr()))
  Ty = TD->getDecl()->getUnderlyingType();

// Is the type void*?
const PointerType* PT = Ty->getAs<PointerType>();
if (PT->getPointeeType().getUnqualifiedType()->isVoidType())
  return true;
return IsVoidStarType(PT->getPointeeType());
1365}

1367/// AuditedType - This routine audits the type AT and returns false if it is one of known
1368/// CF object types or of the "void *" variety. It returns true if we don't care about the type
1369/// such as a non-pointer or pointers which have no ownership issues (such as "int *").
1370static bool AuditedType (QualType AT) {
if (!AT->isAnyPointerType() && !AT->isBlockPointerType())
  return true;
// FIXME. There isn't much we can say about CF pointer type; or is there?
if (ento::coreFoundation::isCFObjectRef(AT) ||
    IsVoidStarType(AT) ||
    // If an ObjC object is type, assuming that it is not a CF function and
    // that it is an un-audited function.
    AT->isObjCObjectPointerType() || AT->isObjCBuiltinType())
  return false;
// All other pointers are assumed audited as harmless.
return true;
1382}

1384void ObjCMigrateASTConsumer::AnnotateImplicitBridging(ASTContext &Ctx) {
if (CFFunctionIBCandidates.empty())
  return;
if (!NSAPIObj->isMacroDefined("CF_IMPLICIT_BRIDGING_ENABLED")) {
  CFFunctionIBCandidates.clear();
  FileId = FileID();
  return;
}
// Insert CF_IMPLICIT_BRIDGING_ENABLE/CF_IMPLICIT_BRIDGING_DISABLED
const Decl *FirstFD = CFFunctionIBCandidates[0];
const Decl *LastFD  =
  CFFunctionIBCandidates[CFFunctionIBCandidates.size()-1];
const char *PragmaString = "\nCF_IMPLICIT_BRIDGING_ENABLED\n\n";
edit::Commit commit(*Editor);
commit.insertBefore(FirstFD->getLocStart(), PragmaString);
PragmaString = "\n\nCF_IMPLICIT_BRIDGING_DISABLED\n";
SourceLocation EndLoc = LastFD->getLocEnd();
// get location just past end of function location.
EndLoc = PP.getLocForEndOfToken(EndLoc);
if (isa<FunctionDecl>(LastFD)) {
  // For Methods, EndLoc points to the ending semcolon. So,
  // not of these extra work is needed.
  Token Tok;
  // get locaiton of token that comes after end of function.
  bool Failed = PP.getRawToken(EndLoc, Tok, /*IgnoreWhiteSpace=*/true);
  if (!Failed)
    EndLoc = Tok.getLocation();
}
commit.insertAfterToken(EndLoc, PragmaString);
Editor->commit(commit);
FileId = FileID();
CFFunctionIBCandidates.clear();
1416}

1418void ObjCMigrateASTConsumer::migrateCFAnnotation(ASTContext &Ctx, const Decl *Decl) {
if (Decl->isDeprecated())
  return;

if (Decl->hasAttr<CFAuditedTransferAttr>()) {
  assert(CFFunctionIBCandidates.empty() &&(static_cast <bool> (CFFunctionIBCandidates.empty() &&
 "Cannot have audited functions/methods inside user " "provided CF_IMPLICIT_BRIDGING_ENABLE"
) ? void (0) : __assert_fail ("CFFunctionIBCandidates.empty() && \"Cannot have audited functions/methods inside user \" \"provided CF_IMPLICIT_BRIDGING_ENABLE\""
, "/build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp"
, 1425, __extension__ __PRETTY_FUNCTION__))
         "Cannot have audited functions/methods inside user "(static_cast <bool> (CFFunctionIBCandidates.empty() &&
 "Cannot have audited functions/methods inside user " "provided CF_IMPLICIT_BRIDGING_ENABLE"
) ? void (0) : __assert_fail ("CFFunctionIBCandidates.empty() && \"Cannot have audited functions/methods inside user \" \"provided CF_IMPLICIT_BRIDGING_ENABLE\""
, "/build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp"
, 1425, __extension__ __PRETTY_FUNCTION__))
         "provided CF_IMPLICIT_BRIDGING_ENABLE")(static_cast <bool> (CFFunctionIBCandidates.empty() &&
 "Cannot have audited functions/methods inside user " "provided CF_IMPLICIT_BRIDGING_ENABLE"
) ? void (0) : __assert_fail ("CFFunctionIBCandidates.empty() && \"Cannot have audited functions/methods inside user \" \"provided CF_IMPLICIT_BRIDGING_ENABLE\""
, "/build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp"
, 1425, __extension__ __PRETTY_FUNCTION__));
  return;
}

// Finction must be annotated first.
if (const FunctionDecl *FuncDecl = dyn_cast<FunctionDecl>(Decl)) {
  CF_BRIDGING_KIND AuditKind = migrateAddFunctionAnnotation(Ctx, FuncDecl);
  if (AuditKind == CF_BRIDGING_ENABLE) {
    CFFunctionIBCandidates.push_back(Decl);
    if (FileId.isInvalid())
      FileId = PP.getSourceManager().getFileID(Decl->getLocation());
  }
  else if (AuditKind == CF_BRIDGING_MAY_INCLUDE) {
    if (!CFFunctionIBCandidates.empty()) {
      CFFunctionIBCandidates.push_back(Decl);
      if (FileId.isInvalid())
        FileId = PP.getSourceManager().getFileID(Decl->getLocation());
    }
  }
  else
    AnnotateImplicitBridging(Ctx);
}
else {
  migrateAddMethodAnnotation(Ctx, cast<ObjCMethodDecl>(Decl));
  AnnotateImplicitBridging(Ctx);
}
1451}

1453void ObjCMigrateASTConsumer::AddCFAnnotations(ASTContext &Ctx,
                                            const CallEffects &CE,
                                            const FunctionDecl *FuncDecl,
                                            bool ResultAnnotated) {
// Annotate function.
if (!ResultAnnotated) {
  RetEffect Ret = CE.getReturnValue();
  const char *AnnotationString = nullptr;
  if (Ret.getObjKind() == RetEffect::CF) {
    if (Ret.isOwned() && NSAPIObj->isMacroDefined("CF_RETURNS_RETAINED"))
      AnnotationString = " CF_RETURNS_RETAINED";
    else if (Ret.notOwned() &&
             NSAPIObj->isMacroDefined("CF_RETURNS_NOT_RETAINED"))
      AnnotationString = " CF_RETURNS_NOT_RETAINED";
  }
  else if (Ret.getObjKind() == RetEffect::ObjC) {
    if (Ret.isOwned() && NSAPIObj->isMacroDefined("NS_RETURNS_RETAINED"))
      AnnotationString = " NS_RETURNS_RETAINED";
  }
  
  if (AnnotationString) {
    edit::Commit commit(*Editor);
    commit.insertAfterToken(FuncDecl->getLocEnd(), AnnotationString);
    Editor->commit(commit);
  }
}
ArrayRef<ArgEffect> AEArgs = CE.getArgs();
unsigned i = 0;
for (FunctionDecl::param_const_iterator pi = FuncDecl->param_begin(),
     pe = FuncDecl->param_end(); pi != pe; ++pi, ++i) {
  const ParmVarDecl *pd = *pi;
  ArgEffect AE = AEArgs[i];
  if (AE == DecRef && !pd->hasAttr<CFConsumedAttr>() &&
      NSAPIObj->isMacroDefined("CF_CONSUMED")) {
    edit::Commit commit(*Editor);
    commit.insertBefore(pd->getLocation(), "CF_CONSUMED ");
    Editor->commit(commit);
  }
  else if (AE == DecRefMsg && !pd->hasAttr<NSConsumedAttr>() &&
           NSAPIObj->isMacroDefined("NS_CONSUMED")) {
    edit::Commit commit(*Editor);
    commit.insertBefore(pd->getLocation(), "NS_CONSUMED ");
    Editor->commit(commit);
  }
}
1498}

1500ObjCMigrateASTConsumer::CF_BRIDGING_KIND
ObjCMigrateASTConsumer::migrateAddFunctionAnnotation(
                                                ASTContext &Ctx,
                                                const FunctionDecl *FuncDecl) {
if (FuncDecl->hasBody())
  return CF_BRIDGING_NONE;
  
CallEffects CE  = CallEffects::getEffect(FuncDecl);
bool FuncIsReturnAnnotated = (FuncDecl->hasAttr<CFReturnsRetainedAttr>() ||
                              FuncDecl->hasAttr<CFReturnsNotRetainedAttr>() ||
                              FuncDecl->hasAttr<NSReturnsRetainedAttr>() ||
                              FuncDecl->hasAttr<NSReturnsNotRetainedAttr>() ||
                              FuncDecl->hasAttr<NSReturnsAutoreleasedAttr>());

// Trivial case of when function is annotated and has no argument.
if (FuncIsReturnAnnotated && FuncDecl->getNumParams() == 0)
  return CF_BRIDGING_NONE;

bool ReturnCFAudited = false;
if (!FuncIsReturnAnnotated) {
  RetEffect Ret = CE.getReturnValue();
  if (Ret.getObjKind() == RetEffect::CF &&
      (Ret.isOwned() || Ret.notOwned()))
    ReturnCFAudited = true;
  else if (!AuditedType(FuncDecl->getReturnType()))
    return CF_BRIDGING_NONE;
}

// At this point result type is audited for potential inclusion.
// Now, how about argument types.
ArrayRef<ArgEffect> AEArgs = CE.getArgs();
unsigned i = 0;
bool ArgCFAudited = false;
for (FunctionDecl::param_const_iterator pi = FuncDecl->param_begin(),
     pe = FuncDecl->param_end(); pi != pe; ++pi, ++i) {
  const ParmVarDecl *pd = *pi;
  ArgEffect AE = AEArgs[i];
  if (AE == DecRef /*CFConsumed annotated*/ || AE == IncRef) {
    if (AE == DecRef && !pd->hasAttr<CFConsumedAttr>())
      ArgCFAudited = true;
    else if (AE == IncRef)
      ArgCFAudited = true;
  }
  else {
    QualType AT = pd->getType();
    if (!AuditedType(AT)) {
      AddCFAnnotations(Ctx, CE, FuncDecl, FuncIsReturnAnnotated);
      return CF_BRIDGING_NONE;
    }
  }
}
if (ReturnCFAudited || ArgCFAudited)
  return CF_BRIDGING_ENABLE;

return CF_BRIDGING_MAY_INCLUDE;
1555}

1557void ObjCMigrateASTConsumer::migrateARCSafeAnnotation(ASTContext &Ctx,
                                               ObjCContainerDecl *CDecl) {
if (!isa<ObjCInterfaceDecl>(CDecl) || CDecl->isDeprecated())
  return;

// migrate methods which can have instancetype as their result type.
for (const auto *Method : CDecl->methods())
  migrateCFAnnotation(Ctx, Method);
1565}

1567void ObjCMigrateASTConsumer::AddCFAnnotations(ASTContext &Ctx,
                                            const CallEffects &CE,
                                            const ObjCMethodDecl *MethodDecl,
                                            bool ResultAnnotated) {
// Annotate function.
if (!ResultAnnotated) {
  RetEffect Ret = CE.getReturnValue();
  const char *AnnotationString = nullptr;
  if (Ret.getObjKind() == RetEffect::CF) {
    if (Ret.isOwned() && NSAPIObj->isMacroDefined("CF_RETURNS_RETAINED"))
      AnnotationString = " CF_RETURNS_RETAINED";
    else if (Ret.notOwned() &&
             NSAPIObj->isMacroDefined("CF_RETURNS_NOT_RETAINED"))
      AnnotationString = " CF_RETURNS_NOT_RETAINED";
  }
  else if (Ret.getObjKind() == RetEffect::ObjC) {
    ObjCMethodFamily OMF = MethodDecl->getMethodFamily();
    switch (OMF) {
      case clang::OMF_alloc:
      case clang::OMF_new:
      case clang::OMF_copy:
      case clang::OMF_init:
      case clang::OMF_mutableCopy:
        break;
        
      default:
        if (Ret.isOwned() && NSAPIObj->isMacroDefined("NS_RETURNS_RETAINED"))
          AnnotationString = " NS_RETURNS_RETAINED";
        break;
    }
  }
  
  if (AnnotationString) {
    edit::Commit commit(*Editor);
    commit.insertBefore(MethodDecl->getLocEnd(), AnnotationString);
    Editor->commit(commit);
  }
}
ArrayRef<ArgEffect> AEArgs = CE.getArgs();
unsigned i = 0;
for (ObjCMethodDecl::param_const_iterator pi = MethodDecl->param_begin(),
     pe = MethodDecl->param_end(); pi != pe; ++pi, ++i) {
  const ParmVarDecl *pd = *pi;
  ArgEffect AE = AEArgs[i];
  if (AE == DecRef && !pd->hasAttr<CFConsumedAttr>() &&
      NSAPIObj->isMacroDefined("CF_CONSUMED")) {
    edit::Commit commit(*Editor);
    commit.insertBefore(pd->getLocation(), "CF_CONSUMED ");
    Editor->commit(commit);
  }
}
1618}

1620void ObjCMigrateASTConsumer::migrateAddMethodAnnotation(
                                          ASTContext &Ctx,
                                          const ObjCMethodDecl *MethodDecl) {
if (MethodDecl->hasBody() || MethodDecl->isImplicit())
  return;

CallEffects CE  = CallEffects::getEffect(MethodDecl);
bool MethodIsReturnAnnotated = (MethodDecl->hasAttr<CFReturnsRetainedAttr>() ||
                                MethodDecl->hasAttr<CFReturnsNotRetainedAttr>() ||
                                MethodDecl->hasAttr<NSReturnsRetainedAttr>() ||
                                MethodDecl->hasAttr<NSReturnsNotRetainedAttr>() ||
                                MethodDecl->hasAttr<NSReturnsAutoreleasedAttr>());

if (CE.getReceiver() == DecRefMsg &&
    !MethodDecl->hasAttr<NSConsumesSelfAttr>() &&
    MethodDecl->getMethodFamily() != OMF_init &&
    MethodDecl->getMethodFamily() != OMF_release &&
    NSAPIObj->isMacroDefined("NS_CONSUMES_SELF")) {
  edit::Commit commit(*Editor);
  commit.insertBefore(MethodDecl->getLocEnd(), " NS_CONSUMES_SELF");
  Editor->commit(commit);
}

// Trivial case of when function is annotated and has no argument.
if (MethodIsReturnAnnotated &&
    (MethodDecl->param_begin() == MethodDecl->param_end()))
  return;

if (!MethodIsReturnAnnotated) {
  RetEffect Ret = CE.getReturnValue();
  if ((Ret.getObjKind() == RetEffect::CF ||
       Ret.getObjKind() == RetEffect::ObjC) &&
      (Ret.isOwned() || Ret.notOwned())) {
    AddCFAnnotations(Ctx, CE, MethodDecl, false);
    return;
  } else if (!AuditedType(MethodDecl->getReturnType()))
    return;
}

// At this point result type is either annotated or audited.
// Now, how about argument types.
ArrayRef<ArgEffect> AEArgs = CE.getArgs();
unsigned i = 0;
for (ObjCMethodDecl::param_const_iterator pi = MethodDecl->param_begin(),
     pe = MethodDecl->param_end(); pi != pe; ++pi, ++i) {
  const ParmVarDecl *pd = *pi;
  ArgEffect AE = AEArgs[i];
  if ((AE == DecRef && !pd->hasAttr<CFConsumedAttr>()) || AE == IncRef ||
      !AuditedType(pd->getType())) {
    AddCFAnnotations(Ctx, CE, MethodDecl, MethodIsReturnAnnotated);
    return;
  }
}
1673}

1675namespace {
1676class SuperInitChecker : public RecursiveASTVisitor<SuperInitChecker> {
1677public:
bool shouldVisitTemplateInstantiations() const { return false; }
bool shouldWalkTypesOfTypeLocs() const { return false; }

bool VisitObjCMessageExpr(ObjCMessageExpr *E) {
  if (E->getReceiverKind() == ObjCMessageExpr::SuperInstance) {
    if (E->getMethodFamily() == OMF_init)
      return false;
  }
  return true;
}
1688};
1689} // end anonymous namespace

1691static bool hasSuperInitCall(const ObjCMethodDecl *MD) {
return !SuperInitChecker().TraverseStmt(MD->getBody());
1693}

1695void ObjCMigrateASTConsumer::inferDesignatedInitializers(
  ASTContext &Ctx,
  const ObjCImplementationDecl *ImplD) {

const ObjCInterfaceDecl *IFace = ImplD->getClassInterface();
if (!IFace || IFace->hasDesignatedInitializers())
  return;
if (!NSAPIObj->isMacroDefined("NS_DESIGNATED_INITIALIZER"))
  return;

for (const auto *MD : ImplD->instance_methods()) {
  if (MD->isDeprecated() ||
      MD->getMethodFamily() != OMF_init ||
      MD->isDesignatedInitializerForTheInterface())
    continue;
  const ObjCMethodDecl *IFaceM = IFace->getMethod(MD->getSelector(),
                                                  /*isInstance=*/true);
  if (!IFaceM)
    continue;
  if (hasSuperInitCall(MD)) {
    edit::Commit commit(*Editor);
    commit.insert(IFaceM->getLocEnd(), " NS_DESIGNATED_INITIALIZER");
    Editor->commit(commit);
  }
}
1720}

1722bool ObjCMigrateASTConsumer::InsertFoundation(ASTContext &Ctx,
                                            SourceLocation  Loc) {
if (FoundationIncluded)
  return true;
if (Loc.isInvalid())
  return false;
auto *nsEnumId = &Ctx.Idents.get("NS_ENUM");
if (PP.getMacroDefinitionAtLoc(nsEnumId, Loc)) {
  FoundationIncluded = true;
  return true;
}
edit::Commit commit(*Editor);
if (Ctx.getLangOpts().Modules)
  commit.insert(Loc, "#ifndef NS_ENUM\n@import Foundation;\n#endif\n");
else
  commit.insert(Loc, "#ifndef NS_ENUM\n#import <Foundation/Foundation.h>\n#endif\n");
Editor->commit(commit);
FoundationIncluded = true;
return true;
1741}

1743namespace {

1745class RewritesReceiver : public edit::EditsReceiver {
Rewriter &Rewrite;

1748public:
RewritesReceiver(Rewriter &Rewrite) : Rewrite(Rewrite) { }

void insert(SourceLocation loc, StringRef text) override {
  Rewrite.InsertText(loc, text);
}
void replace(CharSourceRange range, StringRef text) override {
  Rewrite.ReplaceText(range.getBegin(), Rewrite.getRangeSize(range), text);
}
1757};

1759class JSONEditWriter : public edit::EditsReceiver {
SourceManager &SourceMgr;
llvm::raw_ostream &OS;

1763public:
JSONEditWriter(SourceManager &SM, llvm::raw_ostream &OS)
  : SourceMgr(SM), OS(OS) {
  OS << "[\n";
}
~JSONEditWriter() override { OS << "]\n"; }

1770private:
struct EntryWriter {
  SourceManager &SourceMgr;
  llvm::raw_ostream &OS;

  EntryWriter(SourceManager &SM, llvm::raw_ostream &OS)
    : SourceMgr(SM), OS(OS) {
    OS << " {\n";
  }
  ~EntryWriter() {
    OS << " },\n";
  }

  void writeLoc(SourceLocation Loc) {
    FileID FID;
    unsigned Offset;
    std::tie(FID, Offset) = SourceMgr.getDecomposedLoc(Loc);
    assert(FID.isValid())(static_cast <bool> (FID.isValid()) ? void (0) : __assert_fail
 ("FID.isValid()", "/build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp"
, 1787, __extension__ __PRETTY_FUNCTION__));
    SmallString<200> Path =
        StringRef(SourceMgr.getFileEntryForID(FID)->getName());
    llvm::sys::fs::make_absolute(Path);
    OS << "  \"file\": \"";
    OS.write_escaped(Path.str()) << "\",\n";
    OS << "  \"offset\": " << Offset << ",\n";
  }

  void writeRemove(CharSourceRange Range) {
    assert(Range.isCharRange())(static_cast <bool> (Range.isCharRange()) ? void (0) : __assert_fail
 ("Range.isCharRange()", "/build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp"
, 1797, __extension__ __PRETTY_FUNCTION__));
    std::pair<FileID, unsigned> Begin =
        SourceMgr.getDecomposedLoc(Range.getBegin());
    std::pair<FileID, unsigned> End =
        SourceMgr.getDecomposedLoc(Range.getEnd());
    assert(Begin.first == End.first)(static_cast <bool> (Begin.first == End.first) ? void (
0) : __assert_fail ("Begin.first == End.first", "/build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp"
, 1802, __extension__ __PRETTY_FUNCTION__));
    assert(Begin.second <= End.second)(static_cast <bool> (Begin.second <= End.second) ? void
 (0) : __assert_fail ("Begin.second <= End.second", "/build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp"
, 1803, __extension__ __PRETTY_FUNCTION__));
    unsigned Length = End.second - Begin.second;

    OS << "  \"remove\": " << Length << ",\n";
  }

  void writeText(StringRef Text) {
    OS << "  \"text\": \"";
    OS.write_escaped(Text) << "\",\n";
  }
};

void insert(SourceLocation Loc, StringRef Text) override {
  EntryWriter Writer(SourceMgr, OS);
  Writer.writeLoc(Loc);
  Writer.writeText(Text);
}

void replace(CharSourceRange Range, StringRef Text) override {
  EntryWriter Writer(SourceMgr, OS);
  Writer.writeLoc(Range.getBegin());
  Writer.writeRemove(Range);
  Writer.writeText(Text);
}

void remove(CharSourceRange Range) override {
  EntryWriter Writer(SourceMgr, OS);
  Writer.writeLoc(Range.getBegin());
  Writer.writeRemove(Range);
}
1833};

1835} // end anonymous namespace

1837void ObjCMigrateASTConsumer::HandleTranslationUnit(ASTContext &Ctx) {

TranslationUnitDecl *TU = Ctx.getTranslationUnitDecl();
if (ASTMigrateActions & FrontendOptions::ObjCMT_MigrateDecls) {
  for (DeclContext::decl_iterator D = TU->decls_begin(), DEnd = TU->decls_end();
       D != DEnd; ++D) {
    FileID FID = PP.getSourceManager().getFileID((*D)->getLocation());
    if (FID.isValid())
      if (FileId.isValid() && FileId != FID) {
        if (ASTMigrateActions & FrontendOptions::ObjCMT_Annotation)
          AnnotateImplicitBridging(Ctx);
      }
    
    if (ObjCInterfaceDecl *CDecl = dyn_cast<ObjCInterfaceDecl>(*D))
      if (canModify(CDecl))
        migrateObjCContainerDecl(Ctx, CDecl);
    if (ObjCCategoryDecl *CatDecl = dyn_cast<ObjCCategoryDecl>(*D)) {
      if (canModify(CatDecl))
        migrateObjCContainerDecl(Ctx, CatDecl);
    }
    else if (ObjCProtocolDecl *PDecl = dyn_cast<ObjCProtocolDecl>(*D)) {
      ObjCProtocolDecls.insert(PDecl->getCanonicalDecl());
      if (canModify(PDecl))
        migrateObjCContainerDecl(Ctx, PDecl);
    }
    else if (const ObjCImplementationDecl *ImpDecl =
             dyn_cast<ObjCImplementationDecl>(*D)) {
      if ((ASTMigrateActions & FrontendOptions::ObjCMT_ProtocolConformance) &&
          canModify(ImpDecl))
        migrateProtocolConformance(Ctx, ImpDecl);
    }
    else if (const EnumDecl *ED = dyn_cast<EnumDecl>(*D)) {
      if (!(ASTMigrateActions & FrontendOptions::ObjCMT_NsMacros))
        continue;
      if (!canModify(ED))
        continue;
      DeclContext::decl_iterator N = D;
      if (++N != DEnd) {
        const TypedefDecl *TD = dyn_cast<TypedefDecl>(*N);
        if (migrateNSEnumDecl(Ctx, ED, TD) && TD)
          D++;
      }
      else
        migrateNSEnumDecl(Ctx, ED, /*TypedefDecl */nullptr);
    }
    else if (const TypedefDecl *TD = dyn_cast<TypedefDecl>(*D)) {
      if (!(ASTMigrateActions & FrontendOptions::ObjCMT_NsMacros))
        continue;
      if (!canModify(TD))
        continue;
      DeclContext::decl_iterator N = D;
      if (++N == DEnd)
        continue;
      if (const EnumDecl *ED = dyn_cast<EnumDecl>(*N)) {
        if (canModify(ED)) {
          if (++N != DEnd)
            if (const TypedefDecl *TDF = dyn_cast<TypedefDecl>(*N)) {
              // prefer typedef-follows-enum to enum-follows-typedef pattern.
              if (migrateNSEnumDecl(Ctx, ED, TDF)) {
                ++D; ++D;
                CacheObjCNSIntegerTypedefed(TD);
                continue;
              }
            }
          if (migrateNSEnumDecl(Ctx, ED, TD)) {
            ++D;
            continue;
          }
        }
      }
      CacheObjCNSIntegerTypedefed(TD);
    }
    else if (const FunctionDecl *FD = dyn_cast<FunctionDecl>(*D)) {
      if ((ASTMigrateActions & FrontendOptions::ObjCMT_Annotation) &&
          canModify(FD))
        migrateCFAnnotation(Ctx, FD);
    }
    
    if (ObjCContainerDecl *CDecl = dyn_cast<ObjCContainerDecl>(*D)) {
      bool CanModify = canModify(CDecl);
      // migrate methods which can have instancetype as their result type.
      if ((ASTMigrateActions & FrontendOptions::ObjCMT_Instancetype) &&
          CanModify)
        migrateAllMethodInstaceType(Ctx, CDecl);
      // annotate methods with CF annotations.
      if ((ASTMigrateActions & FrontendOptions::ObjCMT_Annotation) &&
          CanModify)
        migrateARCSafeAnnotation(Ctx, CDecl);
    }

    if (const ObjCImplementationDecl *
          ImplD = dyn_cast<ObjCImplementationDecl>(*D)) {
      if ((ASTMigrateActions & FrontendOptions::ObjCMT_DesignatedInitializer) &&
          canModify(ImplD))
        inferDesignatedInitializers(Ctx, ImplD);
    }
  }
  if (ASTMigrateActions & FrontendOptions::ObjCMT_Annotation)
    AnnotateImplicitBridging(Ctx);
}

if (IsOutputFile) {
 std::error_code EC;
 llvm::raw_fd_ostream OS(MigrateDir, EC, llvm::sys::fs::F_None);
 if (EC) {
    DiagnosticsEngine &Diags = Ctx.getDiagnostics();
    Diags.Report(Diags.getCustomDiagID(DiagnosticsEngine::Error, "%0"))
        << EC.message();
    return;
  }

 JSONEditWriter Writer(Ctx.getSourceManager(), OS);
 Editor->applyRewrites(Writer);
 return;
}

Rewriter rewriter(Ctx.getSourceManager(), Ctx.getLangOpts());
RewritesReceiver Rec(rewriter);
Editor->applyRewrites(Rec);

for (Rewriter::buffer_iterator
      I = rewriter.buffer_begin(), E = rewriter.buffer_end(); I != E; ++I) {
  FileID FID = I->first;
  RewriteBuffer &buf = I->second;
  const FileEntry *file = Ctx.getSourceManager().getFileEntryForID(FID);
  assert(file)(static_cast <bool> (file) ? void (0) : __assert_fail (
"file", "/build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp"
, 1962, __extension__ __PRETTY_FUNCTION__));
  SmallString<512> newText;
  llvm::raw_svector_ostream vecOS(newText);
  buf.write(vecOS);
  std::unique_ptr<llvm::MemoryBuffer> memBuf(
      llvm::MemoryBuffer::getMemBufferCopy(
          StringRef(newText.data(), newText.size()), file->getName()));
  SmallString<64> filePath(file->getName());
  FileMgr.FixupRelativePath(filePath);
  Remapper.remap(filePath.str(), std::move(memBuf));
}

if (IsOutputFile) {
  Remapper.flushToFile(MigrateDir, Ctx.getDiagnostics());
} else {
  Remapper.flushToDisk(MigrateDir, Ctx.getDiagnostics());
}
1979}

1981bool MigrateSourceAction::BeginInvocation(CompilerInstance &CI) {
CI.getDiagnostics().setIgnoreAllWarnings(true);
return true;
1984}

1986static std::vector<std::string> getWhiteListFilenames(StringRef DirPath) {
using namespace llvm::sys::fs;
using namespace llvm::sys::path;

std::vector<std::string> Filenames;
if (DirPath.empty() || !is_directory(DirPath))
  return Filenames;

std::error_code EC;
directory_iterator DI = directory_iterator(DirPath, EC);
directory_iterator DE;
for (; !EC && DI != DE; DI = DI.increment(EC)) {
  if (is_regular_file(DI->path()))
    Filenames.push_back(filename(DI->path()));
}

return Filenames;
2003}

2005std::unique_ptr<ASTConsumer>
2006MigrateSourceAction::CreateASTConsumer(CompilerInstance &CI, StringRef InFile) {
PPConditionalDirectiveRecord *
  PPRec = new PPConditionalDirectiveRecord(CI.getSourceManager());
unsigned ObjCMTAction = CI.getFrontendOpts().ObjCMTAction;
unsigned ObjCMTOpts = ObjCMTAction;
// These are companion flags, they do not enable transformations.
ObjCMTOpts &= ~(FrontendOptions::ObjCMT_AtomicProperty |
                FrontendOptions::ObjCMT_NsAtomicIOSOnlyProperty);
if (ObjCMTOpts == FrontendOptions::ObjCMT_None) {
  // If no specific option was given, enable literals+subscripting transforms
  // by default.
  ObjCMTAction |= FrontendOptions::ObjCMT_Literals |
                  FrontendOptions::ObjCMT_Subscripting;
}
CI.getPreprocessor().addPPCallbacks(std::unique_ptr<PPCallbacks>(PPRec));
std::vector<std::string> WhiteList =
  getWhiteListFilenames(CI.getFrontendOpts().ObjCMTWhiteListPath);
return llvm::make_unique<ObjCMigrateASTConsumer>(
    CI.getFrontendOpts().OutputFile, ObjCMTAction, Remapper,
    CI.getFileManager(), PPRec, CI.getPreprocessor(),
    /*isOutputFile=*/true, WhiteList);
2027}

2029namespace {
2030struct EditEntry {
const FileEntry *File;
unsigned Offset;
unsigned RemoveLen;
std::string Text;

EditEntry() : File(), Offset(), RemoveLen() {}
2037};
2038} // end anonymous namespace

2040namespace llvm {
2041template<> struct DenseMapInfo<EditEntry> {
static inline EditEntry getEmptyKey() {
  EditEntry Entry;
  Entry.Offset = unsigned(-1);
  return Entry;
}
static inline EditEntry getTombstoneKey() {
  EditEntry Entry;
  Entry.Offset = unsigned(-2);
  return Entry;
}
static unsigned getHashValue(const EditEntry& Val) {
  llvm::FoldingSetNodeID ID;
  ID.AddPointer(Val.File);
  ID.AddInteger(Val.Offset);
  ID.AddInteger(Val.RemoveLen);
  ID.AddString(Val.Text);
  return ID.ComputeHash();
}
static bool isEqual(const EditEntry &LHS, const EditEntry &RHS) {
  return LHS.File == RHS.File &&
      LHS.Offset == RHS.Offset &&
      LHS.RemoveLen == RHS.RemoveLen &&
      LHS.Text == RHS.Text;
}
2066};
2067} // end namespace llvm

2069namespace {
2070class RemapFileParser {
FileManager &FileMgr;

2073public:
RemapFileParser(FileManager &FileMgr) : FileMgr(FileMgr) { }

bool parse(StringRef File, SmallVectorImpl<EditEntry> &Entries) {
  using namespace llvm::yaml;

  llvm::ErrorOr<std::unique_ptr<llvm::MemoryBuffer>> FileBufOrErr =
      llvm::MemoryBuffer::getFile(File);
  if (!FileBufOrErr)
    return true;

  llvm::SourceMgr SM;
  Stream YAMLStream(FileBufOrErr.get()->getMemBufferRef(), SM);
  document_iterator I = YAMLStream.begin();
  if (I == YAMLStream.end())
    return true;
  Node *Root = I->getRoot();
  if (!Root)
    return true;

  SequenceNode *SeqNode = dyn_cast<SequenceNode>(Root);
  if (!SeqNode)
    return true;

  for (SequenceNode::iterator
         AI = SeqNode->begin(), AE = SeqNode->end(); AI != AE; ++AI) {
    MappingNode *MapNode = dyn_cast<MappingNode>(&*AI);
    if (!MapNode)
      continue;
    parseEdit(MapNode, Entries);
  }

  return false;
}

2108private:
void parseEdit(llvm::yaml::MappingNode *Node,
               SmallVectorImpl<EditEntry> &Entries) {
  using namespace llvm::yaml;
  EditEntry Entry;
  bool Ignore = false;

  for (MappingNode::iterator
         KVI = Node->begin(), KVE = Node->end(); KVI != KVE; ++KVI) {
    ScalarNode *KeyString = dyn_cast<ScalarNode>((*KVI).getKey());
    if (!KeyString)
      continue;
    SmallString<10> KeyStorage;
    StringRef Key = KeyString->getValue(KeyStorage);

    ScalarNode *ValueString = dyn_cast<ScalarNode>((*KVI).getValue());
    if (!ValueString)
      continue;
    SmallString<64> ValueStorage;
    StringRef Val = ValueString->getValue(ValueStorage);

    if (Key == "file") {
      const FileEntry *FE = FileMgr.getFile(Val);
      if (!FE)
        Ignore = true;
      Entry.File = FE;
    } else if (Key == "offset") {
      if (Val.getAsInteger(10, Entry.Offset))
        Ignore = true;
    } else if (Key == "remove") {
      if (Val.getAsInteger(10, Entry.RemoveLen))
        Ignore = true;
    } else if (Key == "text") {
      Entry.Text = Val;
    }
  }

  if (!Ignore)
    Entries.push_back(Entry);
}
2148};
2149} // end anonymous namespace

2151static bool reportDiag(const Twine &Err, DiagnosticsEngine &Diag) {
Diag.Report(Diag.getCustomDiagID(DiagnosticsEngine::Error, "%0"))
    << Err.str();
return true;
2155}

2157static std::string applyEditsToTemp(const FileEntry *FE,
                                  ArrayRef<EditEntry> Edits,
                                  FileManager &FileMgr,
                                  DiagnosticsEngine &Diag) {
using namespace llvm::sys;

SourceManager SM(Diag, FileMgr);
FileID FID = SM.createFileID(FE, SourceLocation(), SrcMgr::C_User);
LangOptions LangOpts;
edit::EditedSource Editor(SM, LangOpts);
for (ArrayRef<EditEntry>::iterator
      I = Edits.begin(), E = Edits.end(); I != E; ++I) {
  const EditEntry &Entry = *I;
  assert(Entry.File == FE)(static_cast <bool> (Entry.File == FE) ? void (0) : __assert_fail
 ("Entry.File == FE", "/build/llvm-toolchain-snapshot-7~svn329677/tools/clang/lib/ARCMigrate/ObjCMT.cpp"
, 2170, __extension__ __PRETTY_FUNCTION__));
  SourceLocation Loc =
      SM.getLocForStartOfFile(FID).getLocWithOffset(Entry.Offset);
  CharSourceRange Range;
  if (Entry.RemoveLen != 0) {
    Range = CharSourceRange::getCharRange(Loc,
                                       Loc.getLocWithOffset(Entry.RemoveLen));
  }

  edit::Commit commit(Editor);
  if (Range.isInvalid()) {
    commit.insert(Loc, Entry.Text);
  } else if (Entry.Text.empty()) {
    commit.remove(Range);
  } else {
    commit.replace(Range, Entry.Text);
  }
  Editor.commit(commit);
}

Rewriter rewriter(SM, LangOpts);
RewritesReceiver Rec(rewriter);
Editor.applyRewrites(Rec, /*adjustRemovals=*/false);

const RewriteBuffer *Buf = rewriter.getRewriteBufferFor(FID);
SmallString<512> NewText;
llvm::raw_svector_ostream OS(NewText);
Buf->write(OS);

SmallString<64> TempPath;
int FD;
if (fs::createTemporaryFile(path::filename(FE->getName()),
                            path::extension(FE->getName()).drop_front(), FD,
                            TempPath)) {
  reportDiag("Could not create file: " + TempPath.str(), Diag);
  return std::string();
}

llvm::raw_fd_ostream TmpOut(FD, /*shouldClose=*/true);
TmpOut.write(NewText.data(), NewText.size());
TmpOut.close();

return TempPath.str();
2213}

2215bool arcmt::getFileRemappingsFromFileList(
                      std::vector<std::pair<std::string,std::string> > &remap,
                      ArrayRef<StringRef> remapFiles,
                      DiagnosticConsumer *DiagClient) {
bool hasErrorOccurred = false;

FileSystemOptions FSOpts;
FileManager FileMgr(FSOpts);
RemapFileParser Parser(FileMgr);

IntrusiveRefCntPtr<DiagnosticIDs> DiagID(new DiagnosticIDs());
IntrusiveRefCntPtr<DiagnosticsEngine> Diags(
    new DiagnosticsEngine(DiagID, new DiagnosticOptions,
                          DiagClient, /*ShouldOwnClient=*/false));

typedef llvm::DenseMap<const FileEntry *, std::vector<EditEntry> >
    FileEditEntriesTy;
FileEditEntriesTy FileEditEntries;

llvm::DenseSet<EditEntry> EntriesSet;

for (ArrayRef<StringRef>::iterator
       I = remapFiles.begin(), E = remapFiles.end(); I != E; ++I) {
  SmallVector<EditEntry, 16> Entries;
  if (Parser.parse(*I, Entries))
    continue;

  for (SmallVectorImpl<EditEntry>::iterator
         EI = Entries.begin(), EE = Entries.end(); EI != EE; ++EI) {
    EditEntry &Entry = *EI;
    if (!Entry.File)
      continue;
    std::pair<llvm::DenseSet<EditEntry>::iterator, bool>
      Insert = EntriesSet.insert(Entry);
    if (!Insert.second)
      continue;

    FileEditEntries[Entry.File].push_back(Entry);
  }
}

for (FileEditEntriesTy::iterator
       I = FileEditEntries.begin(), E = FileEditEntries.end(); I != E; ++I) {
  std::string TempFile = applyEditsToTemp(I->first, I->second,
                                          FileMgr, *Diags);
  if (TempFile.empty()) {
    hasErrorOccurred = true;
    continue;
  }

  remap.emplace_back(I->first->getName(), TempFile);
}

return hasErrorOccurred;
2269}

←

/usr/lib/gcc/x86_64-linux-gnu/7.3.0/../../../../include/c++/7.3.0/bits/unique_ptr.h

→

1// unique_ptr implementation -*- C++ -*-

3// Copyright (C) 2008-2017 Free Software Foundation, Inc.
4//
5// This file is part of the GNU ISO C++ Library.  This library is free
6// software; you can redistribute it and/or modify it under the
7// terms of the GNU General Public License as published by the
8// Free Software Foundation; either version 3, or (at your option)
9// any later version.

11// This library is distributed in the hope that it will be useful,
12// but WITHOUT ANY WARRANTY; without even the implied warranty of
13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
14// GNU General Public License for more details.

16// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.

20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
23// <http://www.gnu.org/licenses/>.

25/** @file bits/unique_ptr.h
*  This is an internal header file, included by other library headers.
*  Do not attempt to use it directly. @headername{memory}
*/

30#ifndef _UNIQUE_PTR_H1
31#define _UNIQUE_PTR_H1 1

33#include <bits/c++config.h>
34#include <debug/assertions.h>
35#include <type_traits>
36#include <utility>
37#include <tuple>
38#include <bits/stl_function.h>
39#include <bits/functional_hash.h>

41namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
42{
43_GLIBCXX_BEGIN_NAMESPACE_VERSION

/**
 * @addtogroup pointer_abstractions
 * @{
 */

50#if _GLIBCXX_USE_DEPRECATED1
template<typename> class auto_ptr;
52#endif

/// Primary template of default_delete, used by unique_ptr
template<typename _Tp>
  struct default_delete
  {
    /// Default constructor
    constexpr default_delete() noexcept = default;

    /** @brief Converting constructor.
     *
     * Allows conversion from a deleter for arrays of another type, @p _Up,
     * only if @p _Up* is convertible to @p _Tp*.
     */
    template<typename _Up, typename = typename
      enable_if<is_convertible<_Up*, _Tp*>::value>::type>
      default_delete(const default_delete<_Up>&) noexcept { }

    /// Calls @c delete @p __ptr
    void
    operator()(_Tp* __ptr) const
    {
static_assert(!is_void<_Tp>::value,
      "can't delete pointer to incomplete type");
static_assert(sizeof(_Tp)>0,
      "can't delete pointer to incomplete type");
delete __ptr;
5
←
Memory is released→
    }
  };

// _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 740 - omit specialization for array objects with a compile time length
/// Specialization for arrays, default_delete.
template<typename _Tp>
  struct default_delete<_Tp[]>
  {
  public:
    /// Default constructor
    constexpr default_delete() noexcept = default;

    /** @brief Converting constructor.
     *
     * Allows conversion from a deleter for arrays of another type, such as
     * a const-qualified version of @p _Tp.
     *
     * Conversions from types derived from @c _Tp are not allowed because
     * it is unsafe to @c delete[] an array of derived types through a
     * pointer to the base type.
     */
    template<typename _Up, typename = typename
      enable_if<is_convertible<_Up(*)[], _Tp(*)[]>::value>::type>
      default_delete(const default_delete<_Up[]>&) noexcept { }

    /// Calls @c delete[] @p __ptr
    template<typename _Up>
    typename enable_if<is_convertible<_Up(*)[], _Tp(*)[]>::value>::type
operator()(_Up* __ptr) const
    {
static_assert(sizeof(_Tp)>0,
      "can't delete pointer to incomplete type");
delete [] __ptr;
    }
  };

template <typename _Tp, typename _Dp>
  class __uniq_ptr_impl
  {
    template <typename _Up, typename _Ep, typename = void>
struct _Ptr
{
 using type = _Up*;
};

    template <typename _Up, typename _Ep>
struct
_Ptr<_Up, _Ep, __void_t<typename remove_reference<_Ep>::type::pointer>>
{
 using type = typename remove_reference<_Ep>::type::pointer;
};

  public:
    using _DeleterConstraint = enable_if<
      __and_<__not_<is_pointer<_Dp>>,
      is_default_constructible<_Dp>>::value>;

    using pointer = typename _Ptr<_Tp, _Dp>::type;

    __uniq_ptr_impl() = default;
    __uniq_ptr_impl(pointer __p) : _M_t() { _M_ptr() = __p; }

    template<typename _Del>
    __uniq_ptr_impl(pointer __p, _Del&& __d)
: _M_t(__p, std::forward<_Del>(__d)) { }

    pointer&   _M_ptr() { return std::get<0>(_M_t); }
    pointer    _M_ptr() const { return std::get<0>(_M_t); }
    _Dp&       _M_deleter() { return std::get<1>(_M_t); }
    const _Dp& _M_deleter() const { return std::get<1>(_M_t); }

  private:
    tuple<pointer, _Dp> _M_t;
  };

/// 20.7.1.2 unique_ptr for single objects.
template <typename _Tp, typename _Dp = default_delete<_Tp>>
  class unique_ptr
  {
    template <class _Up>
    using _DeleterConstraint =
typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type;

    __uniq_ptr_impl<_Tp, _Dp> _M_t;

  public:
    using pointer	  = typename __uniq_ptr_impl<_Tp, _Dp>::pointer;
    using element_type  = _Tp;
    using deleter_type  = _Dp;

    // helper template for detecting a safe conversion from another
    // unique_ptr
    template<typename _Up, typename _Ep>
using __safe_conversion_up = __and_<
       is_convertible<typename unique_ptr<_Up, _Ep>::pointer, pointer>,
              __not_<is_array<_Up>>,
              __or_<__and_<is_reference<deleter_type>,
                           is_same<deleter_type, _Ep>>,
                    __and_<__not_<is_reference<deleter_type>>,
                           is_convertible<_Ep, deleter_type>>
              >
            >;

    // Constructors.

    /// Default constructor, creates a unique_ptr that owns nothing.
    template <typename _Up = _Dp,
typename = _DeleterConstraint<_Up>>
constexpr unique_ptr() noexcept
: _M_t()
      { }

    /** Takes ownership of a pointer.
     *
     * @param __p  A pointer to an object of @c element_type
     *
     * The deleter will be value-initialized.
     */
    template <typename _Up = _Dp,
typename = _DeleterConstraint<_Up>>
explicit
unique_ptr(pointer __p) noexcept
: _M_t(__p)
      { }

    /** Takes ownership of a pointer.
     *
     * @param __p  A pointer to an object of @c element_type
     * @param __d  A reference to a deleter.
     *
     * The deleter will be initialized with @p __d
     */
    unique_ptr(pointer __p,
 typename conditional<is_reference<deleter_type>::value,
   deleter_type, const deleter_type&>::type __d) noexcept
    : _M_t(__p, __d) { }

    /** Takes ownership of a pointer.
     *
     * @param __p  A pointer to an object of @c element_type
     * @param __d  An rvalue reference to a deleter.
     *
     * The deleter will be initialized with @p std::move(__d)
     */
    unique_ptr(pointer __p,
 typename remove_reference<deleter_type>::type&& __d) noexcept
    : _M_t(std::move(__p), std::move(__d))
    { static_assert(!std::is_reference<deleter_type>::value,
      "rvalue deleter bound to reference"); }

    /// Creates a unique_ptr that owns nothing.
    template <typename _Up = _Dp,
typename = _DeleterConstraint<_Up>>
constexpr unique_ptr(nullptr_t) noexcept : unique_ptr() { }

    // Move constructors.

    /// Move constructor.
    unique_ptr(unique_ptr&& __u) noexcept
    : _M_t(__u.release(), std::forward<deleter_type>(__u.get_deleter())) { }

    /** @brief Converting constructor from another type
     *
     * Requires that the pointer owned by @p __u is convertible to the
     * type of pointer owned by this object, @p __u does not own an array,
     * and @p __u has a compatible deleter type.
     */
    template<typename _Up, typename _Ep, typename = _Require<
             __safe_conversion_up<_Up, _Ep>,
      typename conditional<is_reference<_Dp>::value,
		    is_same<_Ep, _Dp>,
		    is_convertible<_Ep, _Dp>>::type>>
unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept
: _M_t(__u.release(), std::forward<_Ep>(__u.get_deleter()))
{ }

256#if _GLIBCXX_USE_DEPRECATED1
    /// Converting constructor from @c auto_ptr
    template<typename _Up, typename = _Require<
      is_convertible<_Up*, _Tp*>, is_same<_Dp, default_delete<_Tp>>>>
unique_ptr(auto_ptr<_Up>&& __u) noexcept;
261#endif

    /// Destructor, invokes the deleter if the stored pointer is not null.
    ~unique_ptr() noexcept
    {
auto& __ptr = _M_t._M_ptr();
if (__ptr != nullptr)
3
←
Taking true branch→
 get_deleter()(__ptr);
4
←
Calling 'default_delete::operator()'→
6
←
Returning; memory was released via 2nd parameter→
__ptr = pointer();
    }

    // Assignment.

    /** @brief Move assignment operator.
     *
     * @param __u  The object to transfer ownership from.
     *
     * Invokes the deleter first if this object owns a pointer.
     */
    unique_ptr&
    operator=(unique_ptr&& __u) noexcept
    {
reset(__u.release());
get_deleter() = std::forward<deleter_type>(__u.get_deleter());
return *this;
    }

    /** @brief Assignment from another type.
     *
     * @param __u  The object to transfer ownership from, which owns a
     *             convertible pointer to a non-array object.
     *
     * Invokes the deleter first if this object owns a pointer.
     */
    template<typename _Up, typename _Ep>
      typename enable_if< __and_<
        __safe_conversion_up<_Up, _Ep>,
        is_assignable<deleter_type&, _Ep&&>
        >::value,
        unique_ptr&>::type
operator=(unique_ptr<_Up, _Ep>&& __u) noexcept
{
 reset(__u.release());
 get_deleter() = std::forward<_Ep>(__u.get_deleter());
 return *this;
}

    /// Reset the %unique_ptr to empty, invoking the deleter if necessary.
    unique_ptr&
    operator=(nullptr_t) noexcept
    {
reset();
return *this;
    }

    // Observers.

    /// Dereference the stored pointer.
    typename add_lvalue_reference<element_type>::type
    operator*() const
    {
__glibcxx_assert(get() != pointer());
return *get();
    }

    /// Return the stored pointer.
    pointer
    operator->() const noexcept
    {
_GLIBCXX_DEBUG_PEDASSERT(get() != pointer());
return get();
    }

    /// Return the stored pointer.
    pointer
    get() const noexcept
    { return _M_t._M_ptr(); }

    /// Return a reference to the stored deleter.
    deleter_type&
    get_deleter() noexcept
    { return _M_t._M_deleter(); }

    /// Return a reference to the stored deleter.
    const deleter_type&
    get_deleter() const noexcept
    { return _M_t._M_deleter(); }

    /// Return @c true if the stored pointer is not null.
    explicit operator bool() const noexcept
    { return get() == pointer() ? false : true; }

    // Modifiers.

    /// Release ownership of any stored pointer.
    pointer
    release() noexcept
    {
pointer __p = get();
_M_t._M_ptr() = pointer();
return __p;
    }

    /** @brief Replace the stored pointer.
     *
     * @param __p  The new pointer to store.
     *
     * The deleter will be invoked if a pointer is already owned.
     */
    void
    reset(pointer __p = pointer()) noexcept
    {
using std::swap;
swap(_M_t._M_ptr(), __p);
if (__p != pointer())
 get_deleter()(__p);
    }

    /// Exchange the pointer and deleter with another object.
    void
    swap(unique_ptr& __u) noexcept
    {
using std::swap;
swap(_M_t, __u._M_t);
    }

    // Disable copy from lvalue.
    unique_ptr(const unique_ptr&) = delete;
    unique_ptr& operator=(const unique_ptr&) = delete;
};

/// 20.7.1.3 unique_ptr for array objects with a runtime length
// [unique.ptr.runtime]
// _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 740 - omit specialization for array objects with a compile time length
template<typename _Tp, typename _Dp>
  class unique_ptr<_Tp[], _Dp>
  {
    template <typename _Up>
    using _DeleterConstraint =
typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type;

    __uniq_ptr_impl<_Tp, _Dp> _M_t;

    template<typename _Up>
using __remove_cv = typename remove_cv<_Up>::type;

    // like is_base_of<_Tp, _Up> but false if unqualified types are the same
    template<typename _Up>
using __is_derived_Tp
 = __and_< is_base_of<_Tp, _Up>,
    __not_<is_same<__remove_cv<_Tp>, __remove_cv<_Up>>> >;

  public:
    using pointer	  = typename __uniq_ptr_impl<_Tp, _Dp>::pointer;
    using element_type  = _Tp;
    using deleter_type  = _Dp;

    // helper template for detecting a safe conversion from another
    // unique_ptr
    template<typename _Up, typename _Ep,
             typename _Up_up = unique_ptr<_Up, _Ep>,
      typename _Up_element_type = typename _Up_up::element_type>
using __safe_conversion_up = __and_<
        is_array<_Up>,
        is_same<pointer, element_type*>,
        is_same<typename _Up_up::pointer, _Up_element_type*>,
        is_convertible<_Up_element_type(*)[], element_type(*)[]>,
        __or_<__and_<is_reference<deleter_type>, is_same<deleter_type, _Ep>>,
              __and_<__not_<is_reference<deleter_type>>,
                     is_convertible<_Ep, deleter_type>>>
      >;

    // helper template for detecting a safe conversion from a raw pointer
    template<typename _Up>
      using __safe_conversion_raw = __and_<
        __or_<__or_<is_same<_Up, pointer>,
                    is_same<_Up, nullptr_t>>,
              __and_<is_pointer<_Up>,
                     is_same<pointer, element_type*>,
                     is_convertible<
                       typename remove_pointer<_Up>::type(*)[],
                       element_type(*)[]>
              >
        >
      >;

    // Constructors.

    /// Default constructor, creates a unique_ptr that owns nothing.
    template <typename _Up = _Dp,
typename = _DeleterConstraint<_Up>>
constexpr unique_ptr() noexcept
: _M_t()
      { }

    /** Takes ownership of a pointer.
     *
     * @param __p  A pointer to an array of a type safely convertible
     * to an array of @c element_type
     *
     * The deleter will be value-initialized.
     */
    template<typename _Up,
      typename _Vp = _Dp,
      typename = _DeleterConstraint<_Vp>,
      typename = typename enable_if<
               __safe_conversion_raw<_Up>::value, bool>::type>
explicit
unique_ptr(_Up __p) noexcept
: _M_t(__p)
      { }

    /** Takes ownership of a pointer.
     *
     * @param __p  A pointer to an array of a type safely convertible
     * to an array of @c element_type
     * @param __d  A reference to a deleter.
     *
     * The deleter will be initialized with @p __d
     */
    template<typename _Up,
             typename = typename enable_if<
               __safe_conversion_raw<_Up>::value, bool>::type>
    unique_ptr(_Up __p,
               typename conditional<is_reference<deleter_type>::value,
               deleter_type, const deleter_type&>::type __d) noexcept
    : _M_t(__p, __d) { }

    /** Takes ownership of a pointer.
     *
     * @param __p  A pointer to an array of a type safely convertible
     * to an array of @c element_type
     * @param __d  A reference to a deleter.
     *
     * The deleter will be initialized with @p std::move(__d)
     */
    template<typename _Up,
             typename = typename enable_if<
               __safe_conversion_raw<_Up>::value, bool>::type>
    unique_ptr(_Up __p, typename
 remove_reference<deleter_type>::type&& __d) noexcept
    : _M_t(std::move(__p), std::move(__d))
    { static_assert(!is_reference<deleter_type>::value,
      "rvalue deleter bound to reference"); }

    /// Move constructor.
    unique_ptr(unique_ptr&& __u) noexcept
    : _M_t(__u.release(), std::forward<deleter_type>(__u.get_deleter())) { }

    /// Creates a unique_ptr that owns nothing.
    template <typename _Up = _Dp,
typename = _DeleterConstraint<_Up>>
constexpr unique_ptr(nullptr_t) noexcept : unique_ptr() { }

    template<typename _Up, typename _Ep,
      typename = _Require<__safe_conversion_up<_Up, _Ep>>>
unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept
: _M_t(__u.release(), std::forward<_Ep>(__u.get_deleter()))
{ }

    /// Destructor, invokes the deleter if the stored pointer is not null.
    ~unique_ptr()
    {
auto& __ptr = _M_t._M_ptr();
if (__ptr != nullptr)
 get_deleter()(__ptr);
__ptr = pointer();
    }

    // Assignment.

    /** @brief Move assignment operator.
     *
     * @param __u  The object to transfer ownership from.
     *
     * Invokes the deleter first if this object owns a pointer.
     */
    unique_ptr&
    operator=(unique_ptr&& __u) noexcept
    {
reset(__u.release());
get_deleter() = std::forward<deleter_type>(__u.get_deleter());
return *this;
    }

    /** @brief Assignment from another type.
     *
     * @param __u  The object to transfer ownership from, which owns a
     *             convertible pointer to an array object.
     *
     * Invokes the deleter first if this object owns a pointer.
     */
    template<typename _Up, typename _Ep>
typename
enable_if<__and_<__safe_conversion_up<_Up, _Ep>,
                       is_assignable<deleter_type&, _Ep&&>
                >::value,
                unique_ptr&>::type
operator=(unique_ptr<_Up, _Ep>&& __u) noexcept
{
 reset(__u.release());
 get_deleter() = std::forward<_Ep>(__u.get_deleter());
 return *this;
}

    /// Reset the %unique_ptr to empty, invoking the deleter if necessary.
    unique_ptr&
    operator=(nullptr_t) noexcept
    {
reset();
return *this;
    }

    // Observers.

    /// Access an element of owned array.
    typename std::add_lvalue_reference<element_type>::type
    operator[](size_t __i) const
    {
__glibcxx_assert(get() != pointer());
return get()[__i];
    }

    /// Return the stored pointer.
    pointer
    get() const noexcept
    { return _M_t._M_ptr(); }

    /// Return a reference to the stored deleter.
    deleter_type&
    get_deleter() noexcept
    { return _M_t._M_deleter(); }

    /// Return a reference to the stored deleter.
    const deleter_type&
    get_deleter() const noexcept
    { return _M_t._M_deleter(); }

    /// Return @c true if the stored pointer is not null.
    explicit operator bool() const noexcept
    { return get() == pointer() ? false : true; }

    // Modifiers.

    /// Release ownership of any stored pointer.
    pointer
    release() noexcept
    {
pointer __p = get();
_M_t._M_ptr() = pointer();
return __p;
    }

    /** @brief Replace the stored pointer.
     *
     * @param __p  The new pointer to store.
     *
     * The deleter will be invoked if a pointer is already owned.
     */
    template <typename _Up,
              typename = _Require<
                __or_<is_same<_Up, pointer>,
                      __and_<is_same<pointer, element_type*>,
                             is_pointer<_Up>,
                             is_convertible<
                               typename remove_pointer<_Up>::type(*)[],
                               element_type(*)[]
                             >
                      >
                >
             >>
    void
    reset(_Up __p) noexcept
    {
pointer __ptr = __p;
using std::swap;
swap(_M_t._M_ptr(), __ptr);
if (__ptr != nullptr)
 get_deleter()(__ptr);
    }

    void reset(nullptr_t = nullptr) noexcept
    {
      reset(pointer());
    }

    /// Exchange the pointer and deleter with another object.
    void
    swap(unique_ptr& __u) noexcept
    {
using std::swap;
swap(_M_t, __u._M_t);
    }

    // Disable copy from lvalue.
    unique_ptr(const unique_ptr&) = delete;
    unique_ptr& operator=(const unique_ptr&) = delete;
  };

template<typename _Tp, typename _Dp>
  inline
663#if __cplusplus201103L > 201402L || !defined(__STRICT_ANSI__1) // c++1z or gnu++11
  // Constrained free swap overload, see p0185r1
  typename enable_if<__is_swappable<_Dp>::value>::type
666#else
  void
668#endif
  swap(unique_ptr<_Tp, _Dp>& __x,
unique_ptr<_Tp, _Dp>& __y) noexcept
  { __x.swap(__y); }

673#if __cplusplus201103L > 201402L || !defined(__STRICT_ANSI__1) // c++1z or gnu++11
template<typename _Tp, typename _Dp>
  typename enable_if<!__is_swappable<_Dp>::value>::type
  swap(unique_ptr<_Tp, _Dp>&,
unique_ptr<_Tp, _Dp>&) = delete;
678#endif

template<typename _Tp, typename _Dp,
  typename _Up, typename _Ep>
  inline bool
  operator==(const unique_ptr<_Tp, _Dp>& __x,
      const unique_ptr<_Up, _Ep>& __y)
  { return __x.get() == __y.get(); }

template<typename _Tp, typename _Dp>
  inline bool
  operator==(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) noexcept
  { return !__x; }

template<typename _Tp, typename _Dp>
  inline bool
  operator==(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) noexcept
  { return !__x; }

template<typename _Tp, typename _Dp,
  typename _Up, typename _Ep>
  inline bool
  operator!=(const unique_ptr<_Tp, _Dp>& __x,
      const unique_ptr<_Up, _Ep>& __y)
  { return __x.get() != __y.get(); }

template<typename _Tp, typename _Dp>
  inline bool
  operator!=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) noexcept
  { return (bool)__x; }

template<typename _Tp, typename _Dp>
  inline bool
  operator!=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) noexcept
  { return (bool)__x; }

template<typename _Tp, typename _Dp,
  typename _Up, typename _Ep>
  inline bool
  operator<(const unique_ptr<_Tp, _Dp>& __x,
     const unique_ptr<_Up, _Ep>& __y)
  {
    typedef typename
std::common_type<typename unique_ptr<_Tp, _Dp>::pointer,
                typename unique_ptr<_Up, _Ep>::pointer>::type _CT;
    return std::less<_CT>()(__x.get(), __y.get());
  }

template<typename _Tp, typename _Dp>
  inline bool
  operator<(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
  { return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(__x.get(),
						 nullptr); }

template<typename _Tp, typename _Dp>
  inline bool
  operator<(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)
  { return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(nullptr,
						 __x.get()); }

template<typename _Tp, typename _Dp,
  typename _Up, typename _Ep>
  inline bool
  operator<=(const unique_ptr<_Tp, _Dp>& __x,
      const unique_ptr<_Up, _Ep>& __y)
  { return !(__y < __x); }

template<typename _Tp, typename _Dp>
  inline bool
  operator<=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
  { return !(nullptr < __x); }

template<typename _Tp, typename _Dp>
  inline bool
  operator<=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)
  { return !(__x < nullptr); }

template<typename _Tp, typename _Dp,
  typename _Up, typename _Ep>
  inline bool
  operator>(const unique_ptr<_Tp, _Dp>& __x,
     const unique_ptr<_Up, _Ep>& __y)
  { return (__y < __x); }

template<typename _Tp, typename _Dp>
  inline bool
  operator>(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
  { return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(nullptr,
						 __x.get()); }

template<typename _Tp, typename _Dp>
  inline bool
  operator>(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)
  { return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(__x.get(),
						 nullptr); }

template<typename _Tp, typename _Dp,
  typename _Up, typename _Ep>
  inline bool
  operator>=(const unique_ptr<_Tp, _Dp>& __x,
      const unique_ptr<_Up, _Ep>& __y)
  { return !(__x < __y); }

template<typename _Tp, typename _Dp>
  inline bool
  operator>=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
  { return !(__x < nullptr); }

template<typename _Tp, typename _Dp>
  inline bool
  operator>=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)
  { return !(nullptr < __x); }

/// std::hash specialization for unique_ptr.
template<typename _Tp, typename _Dp>
  struct hash<unique_ptr<_Tp, _Dp>>
  : public __hash_base<size_t, unique_ptr<_Tp, _Dp>>,
  private __poison_hash<typename unique_ptr<_Tp, _Dp>::pointer>
  {
    size_t
    operator()(const unique_ptr<_Tp, _Dp>& __u) const noexcept
    {
typedef unique_ptr<_Tp, _Dp> _UP;
return std::hash<typename _UP::pointer>()(__u.get());
    }
  };

805#if __cplusplus201103L > 201103L

807#define __cpp_lib_make_unique 201304

template<typename _Tp>
  struct _MakeUniq
  { typedef unique_ptr<_Tp> __single_object; };

template<typename _Tp>
  struct _MakeUniq<_Tp[]>
  { typedef unique_ptr<_Tp[]> __array; };

template<typename _Tp, size_t _Bound>
  struct _MakeUniq<_Tp[_Bound]>
  { struct __invalid_type { }; };

/// std::make_unique for single objects
template<typename _Tp, typename... _Args>
  inline typename _MakeUniq<_Tp>::__single_object
  make_unique(_Args&&... __args)
  { return unique_ptr<_Tp>(new _Tp(std::forward<_Args>(__args)...)); }

/// std::make_unique for arrays of unknown bound
template<typename _Tp>
  inline typename _MakeUniq<_Tp>::__array
  make_unique(size_t __num)
  { return unique_ptr<_Tp>(new remove_extent_t<_Tp>[__num]()); }

/// Disable std::make_unique for arrays of known bound
template<typename _Tp, typename... _Args>
  inline typename _MakeUniq<_Tp>::__invalid_type
  make_unique(_Args&&...) = delete;
837#endif

// @} group pointer_abstractions

841_GLIBCXX_END_NAMESPACE_VERSION
842} // namespace

844#endif /* _UNIQUE_PTR_H */

←

/build/llvm-toolchain-snapshot-7~svn329677/include/llvm/ADT/STLExtras.h

1//===- llvm/ADT/STLExtras.h - Useful STL related functions ------*- C++ -*-===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file contains some templates that are useful if you are working with the
11// STL at all.
12//
13// No library is required when using these functions.
14//
15//===----------------------------------------------------------------------===//
16 
17#ifndef LLVM_ADT_STLEXTRAS_H
18#define LLVM_ADT_STLEXTRAS_H
19 
20#include "llvm/ADT/Optional.h"
21#include "llvm/ADT/SmallVector.h"
22#include "llvm/ADT/iterator.h"
23#include "llvm/ADT/iterator_range.h"
24#include "llvm/Support/ErrorHandling.h"
25#include <algorithm>
26#include <cassert>
27#include <cstddef>
28#include <cstdint>
29#include <cstdlib>
30#include <functional>
31#include <initializer_list>
32#include <iterator>
33#include <limits>
34#include <memory>
35#include <tuple>
36#include <type_traits>
37#include <utility>
38 
39#ifdef EXPENSIVE_CHECKS
40#include <random> // for std::mt19937
41#endif
42 
43namespace llvm {
44 
45// Only used by compiler if both template types are the same.  Useful when
46// using SFINAE to test for the existence of member functions.
47template <typename T, T> struct SameType;
48 
49namespace detail {
50 
51template <typename RangeT>
52using IterOfRange = decltype(std::begin(std::declval<RangeT &>()));
53 
54template <typename RangeT>
55using ValueOfRange = typename std::remove_reference<decltype(
56    *std::begin(std::declval<RangeT &>()))>::type;
57 
58} // end namespace detail
59 
60//===----------------------------------------------------------------------===//
61//     Extra additions to <functional>
62//===----------------------------------------------------------------------===//
63 
64template <class Ty> struct identity {
65  using argument_type = Ty;
66 
67  Ty &operator()(Ty &self) const {
68    return self;
69  }
70  const Ty &operator()(const Ty &self) const {
71    return self;
72  }
73};
74 
75template <class Ty> struct less_ptr {
76  bool operator()(const Ty* left, const Ty* right) const {
77    return *left < *right;
78  }
79};
80 
81template <class Ty> struct greater_ptr {
82  bool operator()(const Ty* left, const Ty* right) const {
83    return *right < *left;
84  }
85};
86 
87/// An efficient, type-erasing, non-owning reference to a callable. This is
88/// intended for use as the type of a function parameter that is not used
89/// after the function in question returns.
90///
91/// This class does not own the callable, so it is not in general safe to store
92/// a function_ref.
93template<typename Fn> class function_ref;
94 
95template<typename Ret, typename ...Params>
96class function_ref<Ret(Params...)> {
97  Ret (*callback)(intptr_t callable, Params ...params) = nullptr;
98  intptr_t callable;
99 
100  template<typename Callable>
101  static Ret callback_fn(intptr_t callable, Params ...params) {
102    return (*reinterpret_cast<Callable*>(callable))(
103        std::forward<Params>(params)...);
104  }
105 
106public:
107  function_ref() = default;
108  function_ref(std::nullptr_t) {}
109 
110  template <typename Callable>
111  function_ref(Callable &&callable,
112               typename std::enable_if<
113                   !std::is_same<typename std::remove_reference<Callable>::type,
114                                 function_ref>::value>::type * = nullptr)
115      : callback(callback_fn<typename std::remove_reference<Callable>::type>),
116        callable(reinterpret_cast<intptr_t>(&callable)) {}
117 
118  Ret operator()(Params ...params) const {
119    return callback(callable, std::forward<Params>(params)...);
120  }
121 
122  operator bool() const { return callback; }
123};
124 
125// deleter - Very very very simple method that is used to invoke operator
126// delete on something.  It is used like this:
127//
128//   for_each(V.begin(), B.end(), deleter<Interval>);
129template <class T>
130inline void deleter(T *Ptr) {
131  delete Ptr;
132}
133 
134//===----------------------------------------------------------------------===//
135//     Extra additions to <iterator>
136//===----------------------------------------------------------------------===//
137 
138namespace adl_detail {
139 
140using std::begin;
141 
142template <typename ContainerTy>
143auto adl_begin(ContainerTy &&container)
144    -> decltype(begin(std::forward<ContainerTy>(container))) {
145  return begin(std::forward<ContainerTy>(container));
146}
147 
148using std::end;
149 
150template <typename ContainerTy>
151auto adl_end(ContainerTy &&container)
152    -> decltype(end(std::forward<ContainerTy>(container))) {
153  return end(std::forward<ContainerTy>(container));
154}
155 
156using std::swap;
157 
158template <typename T>
159void adl_swap(T &&lhs, T &&rhs) noexcept(noexcept(swap(std::declval<T>(),
160                                                       std::declval<T>()))) {
161  swap(std::forward<T>(lhs), std::forward<T>(rhs));
162}
163 
164} // end namespace adl_detail
165 
166template <typename ContainerTy>
167auto adl_begin(ContainerTy &&container)
168    -> decltype(adl_detail::adl_begin(std::forward<ContainerTy>(container))) {
169  return adl_detail::adl_begin(std::forward<ContainerTy>(container));
170}
171 
172template <typename ContainerTy>
173auto adl_end(ContainerTy &&container)
174    -> decltype(adl_detail::adl_end(std::forward<ContainerTy>(container))) {
175  return adl_detail::adl_end(std::forward<ContainerTy>(container));
176}
177 
178template <typename T>
179void adl_swap(T &&lhs, T &&rhs) noexcept(
180    noexcept(adl_detail::adl_swap(std::declval<T>(), std::declval<T>()))) {
181  adl_detail::adl_swap(std::forward<T>(lhs), std::forward<T>(rhs));
182}
183 
184// mapped_iterator - This is a simple iterator adapter that causes a function to
185// be applied whenever operator* is invoked on the iterator.
186 
187template <typename ItTy, typename FuncTy,
188          typename FuncReturnTy =
189            decltype(std::declval<FuncTy>()(*std::declval<ItTy>()))>
190class mapped_iterator
191    : public iterator_adaptor_base<
192             mapped_iterator<ItTy, FuncTy>, ItTy,
193             typename std::iterator_traits<ItTy>::iterator_category,
194             typename std::remove_reference<FuncReturnTy>::type> {
195public:
196  mapped_iterator(ItTy U, FuncTy F)
197    : mapped_iterator::iterator_adaptor_base(std::move(U)), F(std::move(F)) {}
198 
199  ItTy getCurrent() { return this->I; }
200 
201  FuncReturnTy operator*() { return F(*this->I); }
202 
203private:
204  FuncTy F;
205};
206 
207// map_iterator - Provide a convenient way to create mapped_iterators, just like
208// make_pair is useful for creating pairs...
209template <class ItTy, class FuncTy>
210inline mapped_iterator<ItTy, FuncTy> map_iterator(ItTy I, FuncTy F) {
211  return mapped_iterator<ItTy, FuncTy>(std::move(I), std::move(F));
212}
213 
214/// Helper to determine if type T has a member called rbegin().
215template <typename Ty> class has_rbegin_impl {
216  using yes = char[1];
217  using no = char[2];
218 
219  template <typename Inner>
220  static yes& test(Inner *I, decltype(I->rbegin()) * = nullptr);
221 
222  template <typename>
223  static no& test(...);
224 
225public:
226  static const bool value = sizeof(test<Ty>(nullptr)) == sizeof(yes);
227};
228 
229/// Metafunction to determine if T& or T has a member called rbegin().
230template <typename Ty>
231struct has_rbegin : has_rbegin_impl<typename std::remove_reference<Ty>::type> {
232};
233 
234// Returns an iterator_range over the given container which iterates in reverse.
235// Note that the container must have rbegin()/rend() methods for this to work.
236template <typename ContainerTy>
237auto reverse(ContainerTy &&C,
238             typename std::enable_if<has_rbegin<ContainerTy>::value>::type * =
239                 nullptr) -> decltype(make_range(C.rbegin(), C.rend())) {
240  return make_range(C.rbegin(), C.rend());
241}
242 
243// Returns a std::reverse_iterator wrapped around the given iterator.
244template <typename IteratorTy>
245std::reverse_iterator<IteratorTy> make_reverse_iterator(IteratorTy It) {
246  return std::reverse_iterator<IteratorTy>(It);
247}
248 
249// Returns an iterator_range over the given container which iterates in reverse.
250// Note that the container must have begin()/end() methods which return
251// bidirectional iterators for this to work.
252template <typename ContainerTy>
253auto reverse(
254    ContainerTy &&C,
255    typename std::enable_if<!has_rbegin<ContainerTy>::value>::type * = nullptr)
256    -> decltype(make_range(llvm::make_reverse_iterator(std::end(C)),
257                           llvm::make_reverse_iterator(std::begin(C)))) {
258  return make_range(llvm::make_reverse_iterator(std::end(C)),
259                    llvm::make_reverse_iterator(std::begin(C)));
260}
261 
262/// An iterator adaptor that filters the elements of given inner iterators.
263///
264/// The predicate parameter should be a callable object that accepts the wrapped
265/// iterator's reference type and returns a bool. When incrementing or
266/// decrementing the iterator, it will call the predicate on each element and
267/// skip any where it returns false.
268///
269/// \code
270///   int A[] = { 1, 2, 3, 4 };
271///   auto R = make_filter_range(A, [](int N) { return N % 2 == 1; });
272///   // R contains { 1, 3 }.
273/// \endcode
274template <typename WrappedIteratorT, typename PredicateT>
275class filter_iterator
276    : public iterator_adaptor_base<
277          filter_iterator<WrappedIteratorT, PredicateT>, WrappedIteratorT,
278          typename std::common_type<
279              std::forward_iterator_tag,
280              typename std::iterator_traits<
281                  WrappedIteratorT>::iterator_category>::type> {
282  using BaseT = iterator_adaptor_base<
283      filter_iterator<WrappedIteratorT, PredicateT>, WrappedIteratorT,
284      typename std::common_type<
285          std::forward_iterator_tag,
286          typename std::iterator_traits<WrappedIteratorT>::iterator_category>::
287          type>;
288 
289  struct PayloadType {
290    WrappedIteratorT End;
291    PredicateT Pred;
292  };
293 
294  Optional<PayloadType> Payload;
295 
296  void findNextValid() {
297    assert(Payload && "Payload should be engaged when findNextValid is called")(static_cast <bool> (Payload && "Payload should be engaged when findNextValid is called"
) ? void (0) : __assert_fail ("Payload && \"Payload should be engaged when findNextValid is called\""
, "/build/llvm-toolchain-snapshot-7~svn329677/include/llvm/ADT/STLExtras.h"
, 297, __extension__ __PRETTY_FUNCTION__));
298    while (this->I != Payload->End && !Payload->Pred(*this->I))
299      BaseT::operator++();
300  }
301 
302  // Construct the begin iterator. The begin iterator requires to know where end
303  // is, so that it can properly stop when it hits end.
304  filter_iterator(WrappedIteratorT Begin, WrappedIteratorT End, PredicateT Pred)
305      : BaseT(std::move(Begin)),
306        Payload(PayloadType{std::move(End), std::move(Pred)}) {
307    findNextValid();
308  }
309 
310  // Construct the end iterator. It's not incrementable, so Payload doesn't
311  // have to be engaged.
312  filter_iterator(WrappedIteratorT End) : BaseT(End) {}
313 
314public:
315  using BaseT::operator++;
316 
317  filter_iterator &operator++() {
318    BaseT::operator++();
319    findNextValid();
320    return *this;
321  }
322 
323  template <typename RT, typename PT>
324  friend iterator_range<filter_iterator<detail::IterOfRange<RT>, PT>>
325  make_filter_range(RT &&, PT);
326};
327 
328/// Convenience function that takes a range of elements and a predicate,
329/// and return a new filter_iterator range.
330///
331/// FIXME: Currently if RangeT && is a rvalue reference to a temporary, the
332/// lifetime of that temporary is not kept by the returned range object, and the
333/// temporary is going to be dropped on the floor after the make_iterator_range
334/// full expression that contains this function call.
335template <typename RangeT, typename PredicateT>
336iterator_range<filter_iterator<detail::IterOfRange<RangeT>, PredicateT>>
337make_filter_range(RangeT &&Range, PredicateT Pred) {
338  using FilterIteratorT =
339      filter_iterator<detail::IterOfRange<RangeT>, PredicateT>;
340  return make_range(FilterIteratorT(std::begin(std::forward<RangeT>(Range)),
341                                    std::end(std::forward<RangeT>(Range)),
342                                    std::move(Pred)),
343                    FilterIteratorT(std::end(std::forward<RangeT>(Range))));
344}
345 
346// forward declarations required by zip_shortest/zip_first
347template <typename R, typename UnaryPredicate>
348bool all_of(R &&range, UnaryPredicate P);
349 
350template <size_t... I> struct index_sequence;
351 
352template <class... Ts> struct index_sequence_for;
353 
354namespace detail {
355 
356using std::declval;
357 
358// We have to alias this since inlining the actual type at the usage site
359// in the parameter list of iterator_facade_base<> below ICEs MSVC 2017.
360template<typename... Iters> struct ZipTupleType {
361  using type = std::tuple<decltype(*declval<Iters>())...>;
362};
363 
364template <typename ZipType, typename... Iters>
365using zip_traits = iterator_facade_base<
366    ZipType, typename std::common_type<std::bidirectional_iterator_tag,
367                                       typename std::iterator_traits<
368                                           Iters>::iterator_category...>::type,
369    // ^ TODO: Implement random access methods.
370    typename ZipTupleType<Iters...>::type,
371    typename std::iterator_traits<typename std::tuple_element<
372        0, std::tuple<Iters...>>::type>::difference_type,
373    // ^ FIXME: This follows boost::make_zip_iterator's assumption that all
374    // inner iterators have the same difference_type. It would fail if, for
375    // instance, the second field's difference_type were non-numeric while the
376    // first is.
377    typename ZipTupleType<Iters...>::type *,
378    typename ZipTupleType<Iters...>::type>;
379 
380template <typename ZipType, typename... Iters>
381struct zip_common : public zip_traits<ZipType, Iters...> {
382  using Base = zip_traits<ZipType, Iters...>;
383  using value_type = typename Base::value_type;
384 
385  std::tuple<Iters...> iterators;
386 
387protected:
388  template <size_t... Ns> value_type deref(index_sequence<Ns...>) const {
389    return value_type(*std::get<Ns>(iterators)...);
390  }
391 
392  template <size_t... Ns>
393  decltype(iterators) tup_inc(index_sequence<Ns...>) const {
394    return std::tuple<Iters...>(std::next(std::get<Ns>(iterators))...);
395  }
396 
397  template <size_t... Ns>
398  decltype(iterators) tup_dec(index_sequence<Ns...>) const {
399    return std::tuple<Iters...>(std::prev(std::get<Ns>(iterators))...);
400  }
401 
402public:
403  zip_common(Iters &&... ts) : iterators(std::forward<Iters>(ts)...) {}
404 
405  value_type operator*() { return deref(index_sequence_for<Iters...>{}); }
406 
407  const value_type operator*() const {
408    return deref(index_sequence_for<Iters...>{});
409  }
410 
411  ZipType &operator++() {
412    iterators = tup_inc(index_sequence_for<Iters...>{});
413    return *reinterpret_cast<ZipType *>(this);
414  }
415 
416  ZipType &operator--() {
417    static_assert(Base::IsBidirectional,
418                  "All inner iterators must be at least bidirectional.");
419    iterators = tup_dec(index_sequence_for<Iters...>{});
420    return *reinterpret_cast<ZipType *>(this);
421  }
422};
423 
424template <typename... Iters>
425struct zip_first : public zip_common<zip_first<Iters...>, Iters...> {
426  using Base = zip_common<zip_first<Iters...>, Iters...>;
427 
428  bool operator==(const zip_first<Iters...> &other) const {
429    return std::get<0>(this->iterators) == std::get<0>(other.iterators);
430  }
431 
432  zip_first(Iters &&... ts) : Base(std::forward<Iters>(ts)...) {}
433};
434 
435template <typename... Iters>
436class zip_shortest : public zip_common<zip_shortest<Iters...>, Iters...> {
437  template <size_t... Ns>
438  bool test(const zip_shortest<Iters...> &other, index_sequence<Ns...>) const {
439    return all_of(std::initializer_list<bool>{std::get<Ns>(this->iterators) !=
440                                              std::get<Ns>(other.iterators)...},
441                  identity<bool>{});
442  }
443 
444public:
445  using Base = zip_common<zip_shortest<Iters...>, Iters...>;
446 
447  zip_shortest(Iters &&... ts) : Base(std::forward<Iters>(ts)...) {}
448 
449  bool operator==(const zip_shortest<Iters...> &other) const {
450    return !test(other, index_sequence_for<Iters...>{});
451  }
452};
453 
454template <template <typename...> class ItType, typename... Args> class zippy {
455public:
456  using iterator = ItType<decltype(std::begin(std::declval<Args>()))...>;
457  using iterator_category = typename iterator::iterator_category;
458  using value_type = typename iterator::value_type;
459  using difference_type = typename iterator::difference_type;
460  using pointer = typename iterator::pointer;
461  using reference = typename iterator::reference;
462 
463private:
464  std::tuple<Args...> ts;
465 
466  template <size_t... Ns> iterator begin_impl(index_sequence<Ns...>) const {
467    return iterator(std::begin(std::get<Ns>(ts))...);
468  }
469  template <size_t... Ns> iterator end_impl(index_sequence<Ns...>) const {
470    return iterator(std::end(std::get<Ns>(ts))...);
471  }
472 
473public:
474  zippy(Args &&... ts_) : ts(std::forward<Args>(ts_)...) {}
475 
476  iterator begin() const { return begin_impl(index_sequence_for<Args...>{}); }
477  iterator end() const { return end_impl(index_sequence_for<Args...>{}); }
478};
479 
480} // end namespace detail
481 
482/// zip iterator for two or more iteratable types.
483template <typename T, typename U, typename... Args>
484detail::zippy<detail::zip_shortest, T, U, Args...> zip(T &&t, U &&u,
485                                                       Args &&... args) {
486  return detail::zippy<detail::zip_shortest, T, U, Args...>(
487      std::forward<T>(t), std::forward<U>(u), std::forward<Args>(args)...);
488}
489 
490/// zip iterator that, for the sake of efficiency, assumes the first iteratee to
491/// be the shortest.
492template <typename T, typename U, typename... Args>
493detail::zippy<detail::zip_first, T, U, Args...> zip_first(T &&t, U &&u,
494                                                          Args &&... args) {
495  return detail::zippy<detail::zip_first, T, U, Args...>(
496      std::forward<T>(t), std::forward<U>(u), std::forward<Args>(args)...);
497}
498 
499/// Iterator wrapper that concatenates sequences together.
500///
501/// This can concatenate different iterators, even with different types, into
502/// a single iterator provided the value types of all the concatenated
503/// iterators expose `reference` and `pointer` types that can be converted to
504/// `ValueT &` and `ValueT *` respectively. It doesn't support more
505/// interesting/customized pointer or reference types.
506///
507/// Currently this only supports forward or higher iterator categories as
508/// inputs and always exposes a forward iterator interface.
509template <typename ValueT, typename... IterTs>
510class concat_iterator
511    : public iterator_facade_base<concat_iterator<ValueT, IterTs...>,
512                                  std::forward_iterator_tag, ValueT> {
513  using BaseT = typename concat_iterator::iterator_facade_base;
514 
515  /// We store both the current and end iterators for each concatenated
516  /// sequence in a tuple of pairs.
517  ///
518  /// Note that something like iterator_range seems nice at first here, but the
519  /// range properties are of little benefit and end up getting in the way
520  /// because we need to do mutation on the current iterators.
521  std::tuple<std::pair<IterTs, IterTs>...> IterPairs;
522 
523  /// Attempts to increment a specific iterator.
524  ///
525  /// Returns true if it was able to increment the iterator. Returns false if
526  /// the iterator is already at the end iterator.
527  template <size_t Index> bool incrementHelper() {
528    auto &IterPair = std::get<Index>(IterPairs);
529    if (IterPair.first == IterPair.second)
530      return false;
531 
532    ++IterPair.first;
533    return true;
534  }
535 
536  /// Increments the first non-end iterator.
537  ///
538  /// It is an error to call this with all iterators at the end.
539  template <size_t... Ns> void increment(index_sequence<Ns...>) {
540    // Build a sequence of functions to increment each iterator if possible.
541    bool (concat_iterator::*IncrementHelperFns[])() = {
542        &concat_iterator::incrementHelper<Ns>...};
543 
544    // Loop over them, and stop as soon as we succeed at incrementing one.
545    for (auto &IncrementHelperFn : IncrementHelperFns)
546      if ((this->*IncrementHelperFn)())
547        return;
548 
549    llvm_unreachable("Attempted to increment an end concat iterator!")::llvm::llvm_unreachable_internal("Attempted to increment an end concat iterator!"
, "/build/llvm-toolchain-snapshot-7~svn329677/include/llvm/ADT/STLExtras.h"
, 549);
550  }
551 
552  /// Returns null if the specified iterator is at the end. Otherwise,
553  /// dereferences the iterator and returns the address of the resulting
554  /// reference.
555  template <size_t Index> ValueT *getHelper() const {
556    auto &IterPair = std::get<Index>(IterPairs);
557    if (IterPair.first == IterPair.second)
558      return nullptr;
559 
560    return &*IterPair.first;
561  }
562 
563  /// Finds the first non-end iterator, dereferences, and returns the resulting
564  /// reference.
565  ///
566  /// It is an error to call this with all iterators at the end.
567  template <size_t... Ns> ValueT &get(index_sequence<Ns...>) const {
568    // Build a sequence of functions to get from iterator if possible.
569    ValueT *(concat_iterator::*GetHelperFns[])() const = {
570        &concat_iterator::getHelper<Ns>...};
571 
572    // Loop over them, and return the first result we find.
573    for (auto &GetHelperFn : GetHelperFns)
574      if (ValueT *P = (this->*GetHelperFn)())
575        return *P;
576 
577    llvm_unreachable("Attempted to get a pointer from an end concat iterator!")::llvm::llvm_unreachable_internal("Attempted to get a pointer from an end concat iterator!"
, "/build/llvm-toolchain-snapshot-7~svn329677/include/llvm/ADT/STLExtras.h"
, 577);
578  }
579 
580public:
581  /// Constructs an iterator from a squence of ranges.
582  ///
583  /// We need the full range to know how to switch between each of the
584  /// iterators.
585  template <typename... RangeTs>
586  explicit concat_iterator(RangeTs &&... Ranges)
587      : IterPairs({std::begin(Ranges), std::end(Ranges)}...) {}
588 
589  using BaseT::operator++;
590 
591  concat_iterator &operator++() {
592    increment(index_sequence_for<IterTs...>());
593    return *this;
594  }
595 
596  ValueT &operator*() const { return get(index_sequence_for<IterTs...>()); }
597 
598  bool operator==(const concat_iterator &RHS) const {
599    return IterPairs == RHS.IterPairs;
600  }
601};
602 
603namespace detail {
604 
605/// Helper to store a sequence of ranges being concatenated and access them.
606///
607/// This is designed to facilitate providing actual storage when temporaries
608/// are passed into the constructor such that we can use it as part of range
609/// based for loops.
610template <typename ValueT, typename... RangeTs> class concat_range {
611public:
612  using iterator =
613      concat_iterator<ValueT,
614                      decltype(std::begin(std::declval<RangeTs &>()))...>;
615 
616private:
617  std::tuple<RangeTs...> Ranges;
618 
619  template <size_t... Ns> iterator begin_impl(index_sequence<Ns...>) {
620    return iterator(std::get<Ns>(Ranges)...);
621  }
622  template <size_t... Ns> iterator end_impl(index_sequence<Ns...>) {
623    return iterator(make_range(std::end(std::get<Ns>(Ranges)),
624                               std::end(std::get<Ns>(Ranges)))...);
625  }
626 
627public:
628  concat_range(RangeTs &&... Ranges)
629      : Ranges(std::forward<RangeTs>(Ranges)...) {}
630 
631  iterator begin() { return begin_impl(index_sequence_for<RangeTs...>{}); }
632  iterator end() { return end_impl(index_sequence_for<RangeTs...>{}); }
633};
634 
635} // end namespace detail
636 
637/// Concatenated range across two or more ranges.
638///
639/// The desired value type must be explicitly specified.
640template <typename ValueT, typename... RangeTs>
641detail::concat_range<ValueT, RangeTs...> concat(RangeTs &&... Ranges) {
642  static_assert(sizeof...(RangeTs) > 1,
643                "Need more than one range to concatenate!");
644  return detail::concat_range<ValueT, RangeTs...>(
645      std::forward<RangeTs>(Ranges)...);
646}
647 
648//===----------------------------------------------------------------------===//
649//     Extra additions to <utility>
650//===----------------------------------------------------------------------===//
651 
652/// \brief Function object to check whether the first component of a std::pair
653/// compares less than the first component of another std::pair.
654struct less_first {
655  template <typename T> bool operator()(const T &lhs, const T &rhs) const {
656    return lhs.first < rhs.first;
657  }
658};
659 
660/// \brief Function object to check whether the second component of a std::pair
661/// compares less than the second component of another std::pair.
662struct less_second {
663  template <typename T> bool operator()(const T &lhs, const T &rhs) const {
664    return lhs.second < rhs.second;
665  }
666};
667 
668// A subset of N3658. More stuff can be added as-needed.
669 
670/// \brief Represents a compile-time sequence of integers.
671template <class T, T... I> struct integer_sequence {
672  using value_type = T;
673 
674  static constexpr size_t size() { return sizeof...(I); }
675};
676 
677/// \brief Alias for the common case of a sequence of size_ts.
678template <size_t... I>
679struct index_sequence : integer_sequence<std::size_t, I...> {};
680 
681template <std::size_t N, std::size_t... I>
682struct build_index_impl : build_index_impl<N - 1, N - 1, I...> {};
683template <std::size_t... I>
684struct build_index_impl<0, I...> : index_sequence<I...> {};
685 
686/// \brief Creates a compile-time integer sequence for a parameter pack.
687template <class... Ts>
688struct index_sequence_for : build_index_impl<sizeof...(Ts)> {};
689 
690/// Utility type to build an inheritance chain that makes it easy to rank
691/// overload candidates.
692template <int N> struct rank : rank<N - 1> {};
693template <> struct rank<0> {};
694 
695/// \brief traits class for checking whether type T is one of any of the given
696/// types in the variadic list.
697template <typename T, typename... Ts> struct is_one_of {
698  static const bool value = false;
699};
700 
701template <typename T, typename U, typename... Ts>
702struct is_one_of<T, U, Ts...> {
703  static const bool value =
704      std::is_same<T, U>::value || is_one_of<T, Ts...>::value;
705};
706 
707/// \brief traits class for checking whether type T is a base class for all
708///  the given types in the variadic list.
709template <typename T, typename... Ts> struct are_base_of {
710  static const bool value = true;
711};
712 
713template <typename T, typename U, typename... Ts>
714struct are_base_of<T, U, Ts...> {
715  static const bool value =
716      std::is_base_of<T, U>::value && are_base_of<T, Ts...>::value;
717};
718 
719//===----------------------------------------------------------------------===//
720//     Extra additions for arrays
721//===----------------------------------------------------------------------===//
722 
723/// Find the length of an array.
724template <class T, std::size_t N>
725constexpr inline size_t array_lengthof(T (&)[N]) {
726  return N;
727}
728 
729/// Adapt std::less<T> for array_pod_sort.
730template<typename T>
731inline int array_pod_sort_comparator(const void *P1, const void *P2) {
732  if (std::less<T>()(*reinterpret_cast<const T*>(P1),
733                     *reinterpret_cast<const T*>(P2)))
734    return -1;
735  if (std::less<T>()(*reinterpret_cast<const T*>(P2),
736                     *reinterpret_cast<const T*>(P1)))
737    return 1;
738  return 0;
739}
740 
741/// get_array_pod_sort_comparator - This is an internal helper function used to
742/// get type deduction of T right.
743template<typename T>
744inline int (*get_array_pod_sort_comparator(const T &))
745             (const void*, const void*) {
746  return array_pod_sort_comparator<T>;
747}
748 
749/// array_pod_sort - This sorts an array with the specified start and end
750/// extent.  This is just like std::sort, except that it calls qsort instead of
751/// using an inlined template.  qsort is slightly slower than std::sort, but
752/// most sorts are not performance critical in LLVM and std::sort has to be
753/// template instantiated for each type, leading to significant measured code
754/// bloat.  This function should generally be used instead of std::sort where
755/// possible.
756///
757/// This function assumes that you have simple POD-like types that can be
758/// compared with std::less and can be moved with memcpy.  If this isn't true,
759/// you should use std::sort.
760///
761/// NOTE: If qsort_r were portable, we could allow a custom comparator and
762/// default to std::less.
763template<class IteratorTy>
764inline void array_pod_sort(IteratorTy Start, IteratorTy End) {
765  // Don't inefficiently call qsort with one element or trigger undefined
766  // behavior with an empty sequence.
767  auto NElts = End - Start;
768  if (NElts <= 1) return;
769#ifdef EXPENSIVE_CHECKS
770  std::mt19937 Generator(std::random_device{}());
771  std::shuffle(Start, End, Generator);
772#endif
773  qsort(&*Start, NElts, sizeof(*Start), get_array_pod_sort_comparator(*Start));
774}
775 
776template <class IteratorTy>
777inline void array_pod_sort(
778    IteratorTy Start, IteratorTy End,
779    int (*Compare)(
780        const typename std::iterator_traits<IteratorTy>::value_type *,
781        const typename std::iterator_traits<IteratorTy>::value_type *)) {
782  // Don't inefficiently call qsort with one element or trigger undefined
783  // behavior with an empty sequence.
784  auto NElts = End - Start;
785  if (NElts <= 1) return;
786#ifdef EXPENSIVE_CHECKS
787  std::mt19937 Generator(std::random_device{}());
788  std::shuffle(Start, End, Generator);
789#endif
790  qsort(&*Start, NElts, sizeof(*Start),
791        reinterpret_cast<int (*)(const void *, const void *)>(Compare));
792}
793 
794// Provide wrappers to std::sort which shuffle the elements before sorting
795// to help uncover non-deterministic behavior (PR35135).
796template <typename IteratorTy>
797inline void sort(IteratorTy Start, IteratorTy End) {
798#ifdef EXPENSIVE_CHECKS
799  std::mt19937 Generator(std::random_device{}());
800  std::shuffle(Start, End, Generator);
801#endif
802  std::sort(Start, End);
803}
804 
805template <typename IteratorTy, typename Compare>
806inline void sort(IteratorTy Start, IteratorTy End, Compare Comp) {
807#ifdef EXPENSIVE_CHECKS
808  std::mt19937 Generator(std::random_device{}());
809  std::shuffle(Start, End, Generator);
810#endif
811  std::sort(Start, End, Comp);
812}
813 
814//===----------------------------------------------------------------------===//
815//     Extra additions to <algorithm>
816//===----------------------------------------------------------------------===//
817 
818/// For a container of pointers, deletes the pointers and then clears the
819/// container.
820template<typename Container>
821void DeleteContainerPointers(Container &C) {
822  for (auto V : C)
823    delete V;
824  C.clear();
825}
826 
827/// In a container of pairs (usually a map) whose second element is a pointer,
828/// deletes the second elements and then clears the container.
829template<typename Container>
830void DeleteContainerSeconds(Container &C) {
831  for (auto &V : C)
832    delete V.second;
833  C.clear();
834}
835 
836/// Provide wrappers to std::for_each which take ranges instead of having to
837/// pass begin/end explicitly.
838template <typename R, typename UnaryPredicate>
839UnaryPredicate for_each(R &&Range, UnaryPredicate P) {
840  return std::for_each(adl_begin(Range), adl_end(Range), P);
841}
842 
843/// Provide wrappers to std::all_of which take ranges instead of having to pass
844/// begin/end explicitly.
845template <typename R, typename UnaryPredicate>
846bool all_of(R &&Range, UnaryPredicate P) {
847  return std::all_of(adl_begin(Range), adl_end(Range), P);
848}
849 
850/// Provide wrappers to std::any_of which take ranges instead of having to pass
851/// begin/end explicitly.
852template <typename R, typename UnaryPredicate>
853bool any_of(R &&Range, UnaryPredicate P) {
854  return std::any_of(adl_begin(Range), adl_end(Range), P);
855}
856 
857/// Provide wrappers to std::none_of which take ranges instead of having to pass
858/// begin/end explicitly.
859template <typename R, typename UnaryPredicate>
860bool none_of(R &&Range, UnaryPredicate P) {
861  return std::none_of(adl_begin(Range), adl_end(Range), P);
862}
863 
864/// Provide wrappers to std::find which take ranges instead of having to pass
865/// begin/end explicitly.
866template <typename R, typename T>
867auto find(R &&Range, const T &Val) -> decltype(adl_begin(Range)) {
868  return std::find(adl_begin(Range), adl_end(Range), Val);
869}
870 
871/// Provide wrappers to std::find_if which take ranges instead of having to pass
872/// begin/end explicitly.
873template <typename R, typename UnaryPredicate>
874auto find_if(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) {
875  return std::find_if(adl_begin(Range), adl_end(Range), P);
876}
877 
878template <typename R, typename UnaryPredicate>
879auto find_if_not(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) {
880  return std::find_if_not(adl_begin(Range), adl_end(Range), P);
881}
882 
883/// Provide wrappers to std::remove_if which take ranges instead of having to
884/// pass begin/end explicitly.
885template <typename R, typename UnaryPredicate>
886auto remove_if(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) {
887  return std::remove_if(adl_begin(Range), adl_end(Range), P);
888}
889 
890/// Provide wrappers to std::copy_if which take ranges instead of having to
891/// pass begin/end explicitly.
892template <typename R, typename OutputIt, typename UnaryPredicate>
893OutputIt copy_if(R &&Range, OutputIt Out, UnaryPredicate P) {
894  return std::copy_if(adl_begin(Range), adl_end(Range), Out, P);
895}
896 
897template <typename R, typename OutputIt>
898OutputIt copy(R &&Range, OutputIt Out) {
899  return std::copy(adl_begin(Range), adl_end(Range), Out);
900}
901 
902/// Wrapper function around std::find to detect if an element exists
903/// in a container.
904template <typename R, typename E>
905bool is_contained(R &&Range, const E &Element) {
906  return std::find(adl_begin(Range), adl_end(Range), Element) != adl_end(Range);
907}
908 
909/// Wrapper function around std::count to count the number of times an element
910/// \p Element occurs in the given range \p Range.
911template <typename R, typename E>
912auto count(R &&Range, const E &Element) ->
913    typename std::iterator_traits<decltype(adl_begin(Range))>::difference_type {
914  return std::count(adl_begin(Range), adl_end(Range), Element);
915}
916 
917/// Wrapper function around std::count_if to count the number of times an
918/// element satisfying a given predicate occurs in a range.
919template <typename R, typename UnaryPredicate>
920auto count_if(R &&Range, UnaryPredicate P) ->
921    typename std::iterator_traits<decltype(adl_begin(Range))>::difference_type {
922  return std::count_if(adl_begin(Range), adl_end(Range), P);
923}
924 
925/// Wrapper function around std::transform to apply a function to a range and
926/// store the result elsewhere.
927template <typename R, typename OutputIt, typename UnaryPredicate>
928OutputIt transform(R &&Range, OutputIt d_first, UnaryPredicate P) {
929  return std::transform(adl_begin(Range), adl_end(Range), d_first, P);
930}
931 
932/// Provide wrappers to std::partition which take ranges instead of having to
933/// pass begin/end explicitly.
934template <typename R, typename UnaryPredicate>
935auto partition(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) {
936  return std::partition(adl_begin(Range), adl_end(Range), P);
937}
938 
939/// Provide wrappers to std::lower_bound which take ranges instead of having to
940/// pass begin/end explicitly.
941template <typename R, typename ForwardIt>
942auto lower_bound(R &&Range, ForwardIt I) -> decltype(adl_begin(Range)) {
943  return std::lower_bound(adl_begin(Range), adl_end(Range), I);
944}
945 
946/// \brief Given a range of type R, iterate the entire range and return a
947/// SmallVector with elements of the vector.  This is useful, for example,
948/// when you want to iterate a range and then sort the results.
949template <unsigned Size, typename R>
950SmallVector<typename std::remove_const<detail::ValueOfRange<R>>::type, Size>
951to_vector(R &&Range) {
952  return {adl_begin(Range), adl_end(Range)};
953}
954 
955/// Provide a container algorithm similar to C++ Library Fundamentals v2's
956/// `erase_if` which is equivalent to:
957///
958///   C.erase(remove_if(C, pred), C.end());
959///
960/// This version works for any container with an erase method call accepting
961/// two iterators.
962template <typename Container, typename UnaryPredicate>
963void erase_if(Container &C, UnaryPredicate P) {
964  C.erase(remove_if(C, P), C.end());
965}
966 
967//===----------------------------------------------------------------------===//
968//     Extra additions to <memory>
969//===----------------------------------------------------------------------===//
970 
971// Implement make_unique according to N3656.
972 
973/// \brief Constructs a `new T()` with the given args and returns a
974///        `unique_ptr<T>` which owns the object.
975///
976/// Example:
977///
978///     auto p = make_unique<int>();
979///     auto p = make_unique<std::tuple<int, int>>(0, 1);
980template <class T, class... Args>
981typename std::enable_if<!std::is_array<T>::value, std::unique_ptr<T>>::type
982make_unique(Args &&... args) {
983  return std::unique_ptr<T>(new T(std::forward<Args>(args)...));
9
←
Use of memory after it is freed
984}
985 
986/// \brief Constructs a `new T[n]` with the given args and returns a
987///        `unique_ptr<T[]>` which owns the object.
988///
989/// \param n size of the new array.
990///
991/// Example:
992///
993///     auto p = make_unique<int[]>(2); // value-initializes the array with 0's.
994template <class T>
995typename std::enable_if<std::is_array<T>::value && std::extent<T>::value == 0,
996                        std::unique_ptr<T>>::type
997make_unique(size_t n) {
998  return std::unique_ptr<T>(new typename std::remove_extent<T>::type[n]());
999}
1000 
1001/// This function isn't used and is only here to provide better compile errors.
1002template <class T, class... Args>
1003typename std::enable_if<std::extent<T>::value != 0>::type
1004make_unique(Args &&...) = delete;
1005 
1006struct FreeDeleter {
1007  void operator()(void* v) {
1008    ::free(v);
1009  }
1010};
1011 
1012template<typename First, typename Second>
1013struct pair_hash {
1014  size_t operator()(const std::pair<First, Second> &P) const {
1015    return std::hash<First>()(P.first) * 31 + std::hash<Second>()(P.second);
1016  }
1017};
1018 
1019/// A functor like C++14's std::less<void> in its absence.
1020struct less {
1021  template <typename A, typename B> bool operator()(A &&a, B &&b) const {
1022    return std::forward<A>(a) < std::forward<B>(b);
1023  }
1024};
1025 
1026/// A functor like C++14's std::equal<void> in its absence.
1027struct equal {
1028  template <typename A, typename B> bool operator()(A &&a, B &&b) const {
1029    return std::forward<A>(a) == std::forward<B>(b);
1030  }
1031};
1032 
1033/// Binary functor that adapts to any other binary functor after dereferencing
1034/// operands.
1035template <typename T> struct deref {
1036  T func;
1037 
1038  // Could be further improved to cope with non-derivable functors and
1039  // non-binary functors (should be a variadic template member function
1040  // operator()).
1041  template <typename A, typename B>
1042  auto operator()(A &lhs, B &rhs) const -> decltype(func(*lhs, *rhs)) {
1043    assert(lhs)(static_cast <bool> (lhs) ? void (0) : __assert_fail ("lhs"
, "/build/llvm-toolchain-snapshot-7~svn329677/include/llvm/ADT/STLExtras.h"
, 1043, __extension__ __PRETTY_FUNCTION__));
1044    assert(rhs)(static_cast <bool> (rhs) ? void (0) : __assert_fail ("rhs"
, "/build/llvm-toolchain-snapshot-7~svn329677/include/llvm/ADT/STLExtras.h"
, 1044, __extension__ __PRETTY_FUNCTION__));
1045    return func(*lhs, *rhs);
1046  }
1047};
1048 
1049namespace detail {
1050 
1051template <typename R> class enumerator_iter;
1052 
1053template <typename R> struct result_pair {
1054  friend class enumerator_iter<R>;
1055 
1056  result_pair() = default;
1057  result_pair(std::size_t Index, IterOfRange<R> Iter)
1058      : Index(Index), Iter(Iter) {}
1059 
1060  result_pair<R> &operator=(const result_pair<R> &Other) {
1061    Index = Other.Index;
1062    Iter = Other.Iter;
1063    return *this;
1064  }
1065 
1066  std::size_t index() const { return Index; }
1067  const ValueOfRange<R> &value() const { return *Iter; }
1068  ValueOfRange<R> &value() { return *Iter; }
1069 
1070private:
1071  std::size_t Index = std::numeric_limits<std::size_t>::max();
1072  IterOfRange<R> Iter;
1073};
1074 
1075template <typename R>
1076class enumerator_iter
1077    : public iterator_facade_base<
1078          enumerator_iter<R>, std::forward_iterator_tag, result_pair<R>,
1079          typename std::iterator_traits<IterOfRange<R>>::difference_type,
1080          typename std::iterator_traits<IterOfRange<R>>::pointer,
1081          typename std::iterator_traits<IterOfRange<R>>::reference> {
1082  using result_type = result_pair<R>;
1083 
1084public:
1085  explicit enumerator_iter(IterOfRange<R> EndIter)
1086      : Result(std::numeric_limits<size_t>::max(), EndIter) {}
1087 
1088  enumerator_iter(std::size_t Index, IterOfRange<R> Iter)
1089      : Result(Index, Iter) {}
1090 
1091  result_type &operator*() { return Result; }
1092  const result_type &operator*() const { return Result; }
1093 
1094  enumerator_iter<R> &operator++() {
1095    assert(Result.Index != std::numeric_limits<size_t>::max())(static_cast <bool> (Result.Index != std::numeric_limits
<size_t>::max()) ? void (0) : __assert_fail ("Result.Index != std::numeric_limits<size_t>::max()"
, "/build/llvm-toolchain-snapshot-7~svn329677/include/llvm/ADT/STLExtras.h"
, 1095, __extension__ __PRETTY_FUNCTION__));
1096    ++Result.Iter;
1097    ++Result.Index;
1098    return *this;
1099  }
1100 
1101  bool operator==(const enumerator_iter<R> &RHS) const {
1102    // Don't compare indices here, only iterators.  It's possible for an end
1103    // iterator to have different indices depending on whether it was created
1104    // by calling std::end() versus incrementing a valid iterator.
1105    return Result.Iter == RHS.Result.Iter;
1106  }
1107 
1108  enumerator_iter<R> &operator=(const enumerator_iter<R> &Other) {
1109    Result = Other.Result;
1110    return *this;
1111  }
1112 
1113private:
1114  result_type Result;
1115};
1116 
1117template <typename R> class enumerator {
1118public:
1119  explicit enumerator(R &&Range) : TheRange(std::forward<R>(Range)) {}
1120 
1121  enumerator_iter<R> begin() {
1122    return enumerator_iter<R>(0, std::begin(TheRange));
1123  }
1124 
1125  enumerator_iter<R> end() {
1126    return enumerator_iter<R>(std::end(TheRange));
1127  }
1128 
1129private:
1130  R TheRange;
1131};
1132 
1133} // end namespace detail
1134 
1135/// Given an input range, returns a new range whose values are are pair (A,B)
1136/// such that A is the 0-based index of the item in the sequence, and B is
1137/// the value from the original sequence.  Example:
1138///
1139/// std::vector<char> Items = {'A', 'B', 'C', 'D'};
1140/// for (auto X : enumerate(Items)) {
1141///   printf("Item %d - %c\n", X.index(), X.value());
1142/// }
1143///
1144/// Output:
1145///   Item 0 - A
1146///   Item 1 - B
1147///   Item 2 - C
1148///   Item 3 - D
1149///
1150template <typename R> detail::enumerator<R> enumerate(R &&TheRange) {
1151  return detail::enumerator<R>(std::forward<R>(TheRange));
1152}
1153 
1154namespace detail {
1155 
1156template <typename F, typename Tuple, std::size_t... I>
1157auto apply_tuple_impl(F &&f, Tuple &&t, index_sequence<I...>)
1158    -> decltype(std::forward<F>(f)(std::get<I>(std::forward<Tuple>(t))...)) {
1159  return std::forward<F>(f)(std::get<I>(std::forward<Tuple>(t))...);
1160}
1161 
1162} // end namespace detail
1163 
1164/// Given an input tuple (a1, a2, ..., an), pass the arguments of the
1165/// tuple variadically to f as if by calling f(a1, a2, ..., an) and
1166/// return the result.
1167template <typename F, typename Tuple>
1168auto apply_tuple(F &&f, Tuple &&t) -> decltype(detail::apply_tuple_impl(
1169    std::forward<F>(f), std::forward<Tuple>(t),
1170    build_index_impl<
1171        std::tuple_size<typename std::decay<Tuple>::type>::value>{})) {
1172  using Indices = build_index_impl<
1173      std::tuple_size<typename std::decay<Tuple>::type>::value>;
1174 
1175  return detail::apply_tuple_impl(std::forward<F>(f), std::forward<Tuple>(t),
1176                                  Indices{});
1177}
1178 
1179} // end namespace llvm
1180 
1181#endif // LLVM_ADT_STLEXTRAS_H