/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp

Bug Summary

File:	lib/TableGen/TGParser.cpp
Warning:	line 2590, column 9 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 TGParser.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 -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/lib/TableGen -I /build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen -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/lib/TableGen -ferror-limit 19 -fmessage-length 0 -fvisibility-inlines-hidden -fobjc-runtime=gcc -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/lib/TableGen/TGParser.cpp

/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp

→

1//===- TGParser.cpp - Parser for TableGen Files ---------------------------===//
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// Implement the Parser for TableGen.
11//
12//===----------------------------------------------------------------------===//

14#include "TGParser.h"
15#include "llvm/ADT/None.h"
16#include "llvm/ADT/STLExtras.h"
17#include "llvm/ADT/SmallVector.h"
18#include "llvm/ADT/StringExtras.h"
19#include "llvm/Support/Casting.h"
20#include "llvm/Support/Compiler.h"
21#include "llvm/Support/ErrorHandling.h"
22#include "llvm/Support/raw_ostream.h"
23#include "llvm/TableGen/Record.h"
24#include <algorithm>
25#include <cassert>
26#include <cstdint>

28using namespace llvm;

30//===----------------------------------------------------------------------===//
31// Support Code for the Semantic Actions.
32//===----------------------------------------------------------------------===//

34namespace llvm {

36struct SubClassReference {
SMRange RefRange;
Record *Rec;
SmallVector<Init*, 4> TemplateArgs;

SubClassReference() : Rec(nullptr) {}

bool isInvalid() const { return Rec == nullptr; }
44};

46struct SubMultiClassReference {
SMRange RefRange;
MultiClass *MC;
SmallVector<Init*, 4> TemplateArgs;

SubMultiClassReference() : MC(nullptr) {}

bool isInvalid() const { return MC == nullptr; }
void dump() const;
55};

57#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
58LLVM_DUMP_METHOD__attribute__((noinline)) __attribute__((__used__)) void SubMultiClassReference::dump() const {
errs() << "Multiclass:\n";

MC->dump();

errs() << "Template args:\n";
for (Init *TA : TemplateArgs)
  TA->dump();
66}
67#endif

69} // end namespace llvm

71static bool checkBitsConcrete(Record &R, const RecordVal &RV) {
BitsInit *BV = cast<BitsInit>(RV.getValue());
for (unsigned i = 0, e = BV->getNumBits(); i != e; ++i) {
  Init *Bit = BV->getBit(i);
  bool IsReference = false;
  if (auto VBI = dyn_cast<VarBitInit>(Bit)) {
    if (auto VI = dyn_cast<VarInit>(VBI->getBitVar())) {
      if (R.getValue(VI->getName()))
        IsReference = true;
    }
  } else if (isa<VarInit>(Bit)) {
    IsReference = true;
  }
  if (!(IsReference || Bit->isConcrete()))
    return false;
}
return true;
88}

90static void checkConcrete(Record &R) {
for (const RecordVal &RV : R.getValues()) {
  // HACK: Disable this check for variables declared with 'field'. This is
  // done merely because existing targets have legitimate cases of
  // non-concrete variables in helper defs. Ideally, we'd introduce a
  // 'maybe' or 'optional' modifier instead of this.
  if (RV.getPrefix())
    continue;

  if (Init *V = RV.getValue()) {
    bool Ok = isa<BitsInit>(V) ? checkBitsConcrete(R, RV) : V->isConcrete();
    if (!Ok) {
      PrintError(R.getLoc(),
                 Twine("Initializer of '") + RV.getNameInitAsString() +
                 "' in '" + R.getNameInitAsString() +
                 "' could not be fully resolved: " +
                 RV.getValue()->getAsString());
    }
  }
}
110}

112bool TGParser::AddValue(Record *CurRec, SMLoc Loc, const RecordVal &RV) {
if (!CurRec)
  CurRec = &CurMultiClass->Rec;

if (RecordVal *ERV = CurRec->getValue(RV.getNameInit())) {
  // The value already exists in the class, treat this as a set.
  if (ERV->setValue(RV.getValue()))
    return Error(Loc, "New definition of '" + RV.getName() + "' of type '" +
                 RV.getType()->getAsString() + "' is incompatible with " +
                 "previous definition of type '" +
                 ERV->getType()->getAsString() + "'");
} else {
  CurRec->addValue(RV);
}
return false;
127}

129/// SetValue -
130/// Return true on error, false on success.
131bool TGParser::SetValue(Record *CurRec, SMLoc Loc, Init *ValName,
                      ArrayRef<unsigned> BitList, Init *V,
                      bool AllowSelfAssignment) {
if (!V) return false;

if (!CurRec) CurRec = &CurMultiClass->Rec;

RecordVal *RV = CurRec->getValue(ValName);
if (!RV)
  return Error(Loc, "Value '" + ValName->getAsUnquotedString() +
               "' unknown!");

// Do not allow assignments like 'X = X'.  This will just cause infinite loops
// in the resolution machinery.
if (BitList.empty())
  if (VarInit *VI = dyn_cast<VarInit>(V))
    if (VI->getNameInit() == ValName && !AllowSelfAssignment)
      return Error(Loc, "Recursion / self-assignment forbidden");

// If we are assigning to a subset of the bits in the value... then we must be
// assigning to a field of BitsRecTy, which must have a BitsInit
// initializer.
//
if (!BitList.empty()) {
  BitsInit *CurVal = dyn_cast<BitsInit>(RV->getValue());
  if (!CurVal)
    return Error(Loc, "Value '" + ValName->getAsUnquotedString() +
                 "' is not a bits type");

  // Convert the incoming value to a bits type of the appropriate size...
  Init *BI = V->getCastTo(BitsRecTy::get(BitList.size()));
  if (!BI)
    return Error(Loc, "Initializer is not compatible with bit range");

  SmallVector<Init *, 16> NewBits(CurVal->getNumBits());

  // Loop over bits, assigning values as appropriate.
  for (unsigned i = 0, e = BitList.size(); i != e; ++i) {
    unsigned Bit = BitList[i];
    if (NewBits[Bit])
      return Error(Loc, "Cannot set bit #" + Twine(Bit) + " of value '" +
                   ValName->getAsUnquotedString() + "' more than once");
    NewBits[Bit] = BI->getBit(i);
  }

  for (unsigned i = 0, e = CurVal->getNumBits(); i != e; ++i)
    if (!NewBits[i])
      NewBits[i] = CurVal->getBit(i);

  V = BitsInit::get(NewBits);
}

if (RV->setValue(V)) {
  std::string InitType;
  if (BitsInit *BI = dyn_cast<BitsInit>(V))
    InitType = (Twine("' of type bit initializer with length ") +
                Twine(BI->getNumBits())).str();
  else if (TypedInit *TI = dyn_cast<TypedInit>(V))
    InitType = (Twine("' of type '") + TI->getType()->getAsString()).str();
  return Error(Loc, "Value '" + ValName->getAsUnquotedString() +
                        "' of type '" + RV->getType()->getAsString() +
                        "' is incompatible with initializer '" +
                        V->getAsString() + InitType + "'");
}
return false;
196}

198/// AddSubClass - Add SubClass as a subclass to CurRec, resolving its template
199/// args as SubClass's template arguments.
200bool TGParser::AddSubClass(Record *CurRec, SubClassReference &SubClass) {
Record *SC = SubClass.Rec;
// Add all of the values in the subclass into the current class.
for (const RecordVal &Val : SC->getValues())
  if (AddValue(CurRec, SubClass.RefRange.Start, Val))
    return true;

ArrayRef<Init *> TArgs = SC->getTemplateArgs();

// Ensure that an appropriate number of template arguments are specified.
if (TArgs.size() < SubClass.TemplateArgs.size())
  return Error(SubClass.RefRange.Start,
               "More template args specified than expected");

// Loop over all of the template arguments, setting them to the specified
// value or leaving them as the default if necessary.
MapResolver R(CurRec);

for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
  if (i < SubClass.TemplateArgs.size()) {
    // If a value is specified for this template arg, set it now.
    if (SetValue(CurRec, SubClass.RefRange.Start, TArgs[i],
                 None, SubClass.TemplateArgs[i]))
      return true;
  } else if (!CurRec->getValue(TArgs[i])->getValue()->isComplete()) {
    return Error(SubClass.RefRange.Start,
                 "Value not specified for template argument #" +
                 Twine(i) + " (" + TArgs[i]->getAsUnquotedString() +
                 ") of subclass '" + SC->getNameInitAsString() + "'!");
  }

  R.set(TArgs[i], CurRec->getValue(TArgs[i])->getValue());

  CurRec->removeValue(TArgs[i]);
}

CurRec->resolveReferences(R);

// Since everything went well, we can now set the "superclass" list for the
// current record.
ArrayRef<std::pair<Record *, SMRange>> SCs = SC->getSuperClasses();
for (const auto &SCPair : SCs) {
  if (CurRec->isSubClassOf(SCPair.first))
    return Error(SubClass.RefRange.Start,
                 "Already subclass of '" + SCPair.first->getName() + "'!\n");
  CurRec->addSuperClass(SCPair.first, SCPair.second);
}

if (CurRec->isSubClassOf(SC))
  return Error(SubClass.RefRange.Start,
               "Already subclass of '" + SC->getName() + "'!\n");
CurRec->addSuperClass(SC, SubClass.RefRange);
return false;
253}

255/// AddSubMultiClass - Add SubMultiClass as a subclass to
256/// CurMC, resolving its template args as SubMultiClass's
257/// template arguments.
258bool TGParser::AddSubMultiClass(MultiClass *CurMC,
                              SubMultiClassReference &SubMultiClass) {
MultiClass *SMC = SubMultiClass.MC;
Record *CurRec = &CurMC->Rec;

// Add all of the values in the subclass into the current class.
for (const auto &SMCVal : SMC->Rec.getValues())
  if (AddValue(CurRec, SubMultiClass.RefRange.Start, SMCVal))
    return true;

unsigned newDefStart = CurMC->DefPrototypes.size();

// Add all of the defs in the subclass into the current multiclass.
for (const std::unique_ptr<Record> &R : SMC->DefPrototypes) {
  // Clone the def and add it to the current multiclass
  auto NewDef = make_unique<Record>(*R);

  // Add all of the values in the superclass into the current def.
  for (const auto &MCVal : CurRec->getValues())
    if (AddValue(NewDef.get(), SubMultiClass.RefRange.Start, MCVal))
      return true;

  CurMC->DefPrototypes.push_back(std::move(NewDef));
}

ArrayRef<Init *> SMCTArgs = SMC->Rec.getTemplateArgs();

// Ensure that an appropriate number of template arguments are
// specified.
if (SMCTArgs.size() < SubMultiClass.TemplateArgs.size())
  return Error(SubMultiClass.RefRange.Start,
               "More template args specified than expected");

// Loop over all of the template arguments, setting them to the specified
// value or leaving them as the default if necessary.
MapResolver CurRecResolver(CurRec);

for (unsigned i = 0, e = SMCTArgs.size(); i != e; ++i) {
  if (i < SubMultiClass.TemplateArgs.size()) {
    // If a value is specified for this template arg, set it in the
    // superclass now.
    if (SetValue(CurRec, SubMultiClass.RefRange.Start, SMCTArgs[i],
                 None, SubMultiClass.TemplateArgs[i]))
      return true;

    // If a value is specified for this template arg, set it in the
    // new defs now.
    for (const auto &Def :
           makeArrayRef(CurMC->DefPrototypes).slice(newDefStart)) {
      if (SetValue(Def.get(), SubMultiClass.RefRange.Start, SMCTArgs[i],
                   None, SubMultiClass.TemplateArgs[i]))
        return true;
    }
  } else if (!CurRec->getValue(SMCTArgs[i])->getValue()->isComplete()) {
    return Error(SubMultiClass.RefRange.Start,
                 "Value not specified for template argument #" +
                 Twine(i) + " (" + SMCTArgs[i]->getAsUnquotedString() +
                 ") of subclass '" + SMC->Rec.getNameInitAsString() + "'!");
  }

  CurRecResolver.set(SMCTArgs[i], CurRec->getValue(SMCTArgs[i])->getValue());

  CurRec->removeValue(SMCTArgs[i]);
}

CurRec->resolveReferences(CurRecResolver);

for (const auto &Def :
     makeArrayRef(CurMC->DefPrototypes).slice(newDefStart)) {
  MapResolver R(Def.get());

  for (Init *SMCTArg : SMCTArgs) {
    R.set(SMCTArg, Def->getValue(SMCTArg)->getValue());
    Def->removeValue(SMCTArg);
  }

  Def->resolveReferences(R);
}

return false;
338}

340/// Add a record that results from 'def' or 'defm', after template arguments
341/// and the external let stack have been resolved.
342///
343/// Apply foreach loops, resolve internal variable references, and add to the
344/// current multi class or the global record keeper as appropriate.
345bool TGParser::addDef(std::unique_ptr<Record> Rec, Init *DefmName) {
IterSet IterVals;

if (Loops.empty())
  return addDefOne(std::move(Rec), DefmName, IterVals);

return addDefForeach(Rec.get(), DefmName, IterVals);
352}

354/// Recursive helper function for addDef/addDefOne to resolve references to
355/// foreach variables.
356bool TGParser::addDefForeach(Record *Rec, Init *DefmName, IterSet &IterVals) {
if (IterVals.size() != Loops.size()) {
  assert(IterVals.size() < Loops.size())(static_cast <bool> (IterVals.size() < Loops.size())
 ? void (0) : __assert_fail ("IterVals.size() < Loops.size()"
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 358, __extension__ __PRETTY_FUNCTION__));
  ForeachLoop &CurLoop = Loops[IterVals.size()];
  ListInit *List = CurLoop.ListValue;

  // Process each value.
  for (unsigned i = 0; i < List->size(); ++i) {
    IterVals.push_back(IterRecord(CurLoop.IterVar, List->getElement(i)));
    if (addDefForeach(Rec, DefmName, IterVals))
      return true;
    IterVals.pop_back();
  }
  return false;
}

// This is the bottom of the recursion. We have all of the iterator values
// for this point in the iteration space.  Instantiate a new record to
// reflect this combination of values.
auto IterRec = make_unique<Record>(*Rec);
return addDefOne(std::move(IterRec), DefmName, IterVals);
377}

379/// After resolving foreach loops, add the record as a prototype to the
380/// current multiclass, or resolve fully and add to the record keeper.
381bool TGParser::addDefOne(std::unique_ptr<Record> Rec, Init *DefmName,
                       IterSet &IterVals) {
MapResolver R(Rec.get());

for (IterRecord &IR : IterVals)
  R.set(IR.IterVar->getNameInit(), IR.IterValue);

Rec->resolveReferences(R);

if (CurMultiClass) {
  for (const auto &Proto : CurMultiClass->DefPrototypes) {
    if (Proto->getNameInit() == Rec->getNameInit()) {
      if (!Rec->isAnonymous()) {
        PrintError(Rec->getLoc(),
                  Twine("def '") + Rec->getNameInitAsString() +
                      "' already defined in this multiclass!");
        PrintNote(Proto->getLoc(), "location of previous definition");
        return true;
      }
      Rec->setName(Records.getNewAnonymousName());
      break;
    }
  }
  CurMultiClass->DefPrototypes.emplace_back(std::move(Rec));
  return false;
}

// Name construction is an incoherent mess. Unfortunately, existing .td
// files rely on pretty much all the quirks and implementation details of
// this.
if (DefmName) {
  MapResolver R(Rec.get());
  R.set(StringInit::get("NAME"), DefmName);
  Rec->resolveReferences(R);
}

if (Record *Prev = Records.getDef(Rec->getNameInitAsString())) {
  if (!Rec->isAnonymous()) {
    PrintError(Rec->getLoc(),
               "def already exists: " + Rec->getNameInitAsString());
    PrintNote(Prev->getLoc(), "location of previous definition");
    return true;
  }
  Rec->setName(Records.getNewAnonymousName());
}

Rec->resolveReferences();
checkConcrete(*Rec);

// If ObjectBody has template arguments, it's an error.
assert(Rec->getTemplateArgs().empty() && "How'd this get template args?")(static_cast <bool> (Rec->getTemplateArgs().empty() &&
 "How'd this get template args?") ? void (0) : __assert_fail (
"Rec->getTemplateArgs().empty() && \"How'd this get template args?\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 431, __extension__ __PRETTY_FUNCTION__));

for (DefsetRecord *Defset : Defsets) {
  DefInit *I = Rec->getDefInit();
  if (!I->getType()->typeIsA(Defset->EltTy)) {
    PrintError(Rec->getLoc(), Twine("adding record of incompatible type '") +
                                  I->getType()->getAsString() +
                                   "' to defset");
    PrintNote(Defset->Loc, "location of defset declaration");
    return true;
  }
  Defset->Elements.push_back(I);
}

Records.addDef(std::move(Rec));
return false;
447}

449//===----------------------------------------------------------------------===//
450// Parser Code
451//===----------------------------------------------------------------------===//

453/// isObjectStart - Return true if this is a valid first token for an Object.
454static bool isObjectStart(tgtok::TokKind K) {
return K == tgtok::Class || K == tgtok::Def || K == tgtok::Defm ||
       K == tgtok::Let || K == tgtok::MultiClass || K == tgtok::Foreach ||
       K == tgtok::Defset;
458}

460/// ParseObjectName - If a valid object name is specified, return it. If no
461/// name is specified, return the unset initializer. Return nullptr on parse
462/// error.
463///   ObjectName ::= Value [ '#' Value ]*
464///   ObjectName ::= /*empty*/
465///
466Init *TGParser::ParseObjectName(MultiClass *CurMultiClass) {
switch (Lex.getCode()) {
case tgtok::colon:
case tgtok::semi:
case tgtok::l_brace:
  // These are all of the tokens that can begin an object body.
  // Some of these can also begin values but we disallow those cases
  // because they are unlikely to be useful.
  return UnsetInit::get();
default:
  break;
}

Record *CurRec = nullptr;
if (CurMultiClass)
  CurRec = &CurMultiClass->Rec;

return ParseValue(CurRec, StringRecTy::get(), ParseNameMode);
484}

486/// ParseClassID - Parse and resolve a reference to a class name.  This returns
487/// null on error.
488///
489///    ClassID ::= ID
490///
491Record *TGParser::ParseClassID() {
if (Lex.getCode() != tgtok::Id) {
  TokError("expected name for ClassID");
  return nullptr;
}

Record *Result = Records.getClass(Lex.getCurStrVal());
if (!Result)
  TokError("Couldn't find class '" + Lex.getCurStrVal() + "'");

Lex.Lex();
return Result;
503}

505/// ParseMultiClassID - Parse and resolve a reference to a multiclass name.
506/// This returns null on error.
507///
508///    MultiClassID ::= ID
509///
510MultiClass *TGParser::ParseMultiClassID() {
if (Lex.getCode() != tgtok::Id) {
  TokError("expected name for MultiClassID");
  return nullptr;
}

MultiClass *Result = MultiClasses[Lex.getCurStrVal()].get();
if (!Result)
  TokError("Couldn't find multiclass '" + Lex.getCurStrVal() + "'");

Lex.Lex();
return Result;
522}

524/// ParseSubClassReference - Parse a reference to a subclass or to a templated
525/// subclass.  This returns a SubClassRefTy with a null Record* on error.
526///
527///  SubClassRef ::= ClassID
528///  SubClassRef ::= ClassID '<' ValueList '>'
529///
530SubClassReference TGParser::
531ParseSubClassReference(Record *CurRec, bool isDefm) {
SubClassReference Result;
Result.RefRange.Start = Lex.getLoc();

if (isDefm) {
  if (MultiClass *MC = ParseMultiClassID())
    Result.Rec = &MC->Rec;
} else {
  Result.Rec = ParseClassID();
}
if (!Result.Rec) return Result;

// If there is no template arg list, we're done.
if (Lex.getCode() != tgtok::less) {
  Result.RefRange.End = Lex.getLoc();
  return Result;
}
Lex.Lex();  // Eat the '<'

if (Lex.getCode() == tgtok::greater) {
  TokError("subclass reference requires a non-empty list of template values");
  Result.Rec = nullptr;
  return Result;
}

ParseValueList(Result.TemplateArgs, CurRec, Result.Rec);
if (Result.TemplateArgs.empty()) {
  Result.Rec = nullptr;   // Error parsing value list.
  return Result;
}

if (Lex.getCode() != tgtok::greater) {
  TokError("expected '>' in template value list");
  Result.Rec = nullptr;
  return Result;
}
Lex.Lex();
Result.RefRange.End = Lex.getLoc();

return Result;
571}

573/// ParseSubMultiClassReference - Parse a reference to a subclass or to a
574/// templated submulticlass.  This returns a SubMultiClassRefTy with a null
575/// Record* on error.
576///
577///  SubMultiClassRef ::= MultiClassID
578///  SubMultiClassRef ::= MultiClassID '<' ValueList '>'
579///
580SubMultiClassReference TGParser::
581ParseSubMultiClassReference(MultiClass *CurMC) {
SubMultiClassReference Result;
Result.RefRange.Start = Lex.getLoc();

Result.MC = ParseMultiClassID();
if (!Result.MC) return Result;

// If there is no template arg list, we're done.
if (Lex.getCode() != tgtok::less) {
  Result.RefRange.End = Lex.getLoc();
  return Result;
}
Lex.Lex();  // Eat the '<'

if (Lex.getCode() == tgtok::greater) {
  TokError("subclass reference requires a non-empty list of template values");
  Result.MC = nullptr;
  return Result;
}

ParseValueList(Result.TemplateArgs, &CurMC->Rec, &Result.MC->Rec);
if (Result.TemplateArgs.empty()) {
  Result.MC = nullptr;   // Error parsing value list.
  return Result;
}

if (Lex.getCode() != tgtok::greater) {
  TokError("expected '>' in template value list");
  Result.MC = nullptr;
  return Result;
}
Lex.Lex();
Result.RefRange.End = Lex.getLoc();

return Result;
616}

618/// ParseRangePiece - Parse a bit/value range.
619///   RangePiece ::= INTVAL
620///   RangePiece ::= INTVAL '-' INTVAL
621///   RangePiece ::= INTVAL INTVAL
622bool TGParser::ParseRangePiece(SmallVectorImpl<unsigned> &Ranges) {
if (Lex.getCode() != tgtok::IntVal) {
  TokError("expected integer or bitrange");
  return true;
}
int64_t Start = Lex.getCurIntVal();
int64_t End;

if (Start < 0)
  return TokError("invalid range, cannot be negative");

switch (Lex.Lex()) {  // eat first character.
default:
  Ranges.push_back(Start);
  return false;
case tgtok::minus:
  if (Lex.Lex() != tgtok::IntVal) {
    TokError("expected integer value as end of range");
    return true;
  }
  End = Lex.getCurIntVal();
  break;
case tgtok::IntVal:
  End = -Lex.getCurIntVal();
  break;
}
if (End < 0)
  return TokError("invalid range, cannot be negative");
Lex.Lex();

// Add to the range.
if (Start < End)
  for (; Start <= End; ++Start)
    Ranges.push_back(Start);
else
  for (; Start >= End; --Start)
    Ranges.push_back(Start);
return false;
660}

662/// ParseRangeList - Parse a list of scalars and ranges into scalar values.
663///
664///   RangeList ::= RangePiece (',' RangePiece)*
665///
666void TGParser::ParseRangeList(SmallVectorImpl<unsigned> &Result) {
// Parse the first piece.
if (ParseRangePiece(Result)) {
  Result.clear();
  return;
}
while (Lex.getCode() == tgtok::comma) {
  Lex.Lex();  // Eat the comma.

  // Parse the next range piece.
  if (ParseRangePiece(Result)) {
    Result.clear();
    return;
  }
}
681}

683/// ParseOptionalRangeList - Parse either a range list in <>'s or nothing.
684///   OptionalRangeList ::= '<' RangeList '>'
685///   OptionalRangeList ::= /*empty*/
686bool TGParser::ParseOptionalRangeList(SmallVectorImpl<unsigned> &Ranges) {
if (Lex.getCode() != tgtok::less)
  return false;

SMLoc StartLoc = Lex.getLoc();
Lex.Lex(); // eat the '<'

// Parse the range list.
ParseRangeList(Ranges);
if (Ranges.empty()) return true;

if (Lex.getCode() != tgtok::greater) {
  TokError("expected '>' at end of range list");
  return Error(StartLoc, "to match this '<'");
}
Lex.Lex();   // eat the '>'.
return false;
703}

705/// ParseOptionalBitList - Parse either a bit list in {}'s or nothing.
706///   OptionalBitList ::= '{' RangeList '}'
707///   OptionalBitList ::= /*empty*/
708bool TGParser::ParseOptionalBitList(SmallVectorImpl<unsigned> &Ranges) {
if (Lex.getCode() != tgtok::l_brace)
  return false;

SMLoc StartLoc = Lex.getLoc();
Lex.Lex(); // eat the '{'

// Parse the range list.
ParseRangeList(Ranges);
if (Ranges.empty()) return true;

if (Lex.getCode() != tgtok::r_brace) {
  TokError("expected '}' at end of bit list");
  return Error(StartLoc, "to match this '{'");
}
Lex.Lex();   // eat the '}'.
return false;
725}

727/// ParseType - Parse and return a tblgen type.  This returns null on error.
728///
729///   Type ::= STRING                       // string type
730///   Type ::= CODE                         // code type
731///   Type ::= BIT                          // bit type
732///   Type ::= BITS '<' INTVAL '>'          // bits<x> type
733///   Type ::= INT                          // int type
734///   Type ::= LIST '<' Type '>'            // list<x> type
735///   Type ::= DAG                          // dag type
736///   Type ::= ClassID                      // Record Type
737///
738RecTy *TGParser::ParseType() {
switch (Lex.getCode()) {
default: TokError("Unknown token when expecting a type"); return nullptr;
case tgtok::String: Lex.Lex(); return StringRecTy::get();
case tgtok::Code:   Lex.Lex(); return CodeRecTy::get();
case tgtok::Bit:    Lex.Lex(); return BitRecTy::get();
case tgtok::Int:    Lex.Lex(); return IntRecTy::get();
case tgtok::Dag:    Lex.Lex(); return DagRecTy::get();
case tgtok::Id:
  if (Record *R = ParseClassID()) return RecordRecTy::get(R);
  TokError("unknown class name");
  return nullptr;
case tgtok::Bits: {
  if (Lex.Lex() != tgtok::less) { // Eat 'bits'
    TokError("expected '<' after bits type");
    return nullptr;
  }
  if (Lex.Lex() != tgtok::IntVal) {  // Eat '<'
    TokError("expected integer in bits<n> type");
    return nullptr;
  }
  uint64_t Val = Lex.getCurIntVal();
  if (Lex.Lex() != tgtok::greater) {  // Eat count.
    TokError("expected '>' at end of bits<n> type");
    return nullptr;
  }
  Lex.Lex();  // Eat '>'
  return BitsRecTy::get(Val);
}
case tgtok::List: {
  if (Lex.Lex() != tgtok::less) { // Eat 'bits'
    TokError("expected '<' after list type");
    return nullptr;
  }
  Lex.Lex();  // Eat '<'
  RecTy *SubType = ParseType();
  if (!SubType) return nullptr;

  if (Lex.getCode() != tgtok::greater) {
    TokError("expected '>' at end of list<ty> type");
    return nullptr;
  }
  Lex.Lex();  // Eat '>'
  return ListRecTy::get(SubType);
}
}
784}

786/// ParseIDValue - This is just like ParseIDValue above, but it assumes the ID
787/// has already been read.
788Init *TGParser::ParseIDValue(Record *CurRec, StringInit *Name, SMLoc NameLoc,
                           IDParseMode Mode) {
if (CurRec) {
  if (const RecordVal *RV = CurRec->getValue(Name))
    return VarInit::get(Name, RV->getType());

  Init *TemplateArgName = QualifyName(*CurRec, CurMultiClass, Name, ":");

  if (CurMultiClass)
    TemplateArgName = QualifyName(CurMultiClass->Rec, CurMultiClass, Name,
                                  "::");

  if (CurRec->isTemplateArg(TemplateArgName)) {
    const RecordVal *RV = CurRec->getValue(TemplateArgName);
    assert(RV && "Template arg doesn't exist??")(static_cast <bool> (RV && "Template arg doesn't exist??"
) ? void (0) : __assert_fail ("RV && \"Template arg doesn't exist??\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 802, __extension__ __PRETTY_FUNCTION__));
    return VarInit::get(TemplateArgName, RV->getType());
  }
}

if (CurMultiClass) {
  if (Name->getValue() == "NAME")
    return VarInit::get(Name, StringRecTy::get());

  Init *MCName = QualifyName(CurMultiClass->Rec, CurMultiClass, Name, "::");

  if (CurMultiClass->Rec.isTemplateArg(MCName)) {
    const RecordVal *RV = CurMultiClass->Rec.getValue(MCName);
    assert(RV && "Template arg doesn't exist??")(static_cast <bool> (RV && "Template arg doesn't exist??"
) ? void (0) : __assert_fail ("RV && \"Template arg doesn't exist??\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 815, __extension__ __PRETTY_FUNCTION__));
    return VarInit::get(MCName, RV->getType());
  }
}

// If this is in a foreach loop, make sure it's not a loop iterator
for (const auto &L : Loops) {
  VarInit *IterVar = dyn_cast<VarInit>(L.IterVar);
  if (IterVar && IterVar->getNameInit() == Name)
    return IterVar;
}

if (Mode == ParseNameMode)
  return Name;

if (Init *I = Records.getGlobal(Name->getValue()))
  return I;

// Allow self-references of concrete defs, but delay the lookup so that we
// get the correct type.
if (CurRec && !CurMultiClass && CurRec->getNameInit() == Name)
  return UnOpInit::get(UnOpInit::CAST, Name, CurRec->getType());

if (Mode == ParseValueMode) {
  Error(NameLoc, "Variable not defined: '" + Name->getValue() + "'");
  return nullptr;
}

return Name;
844}

846/// ParseOperation - Parse an operator.  This returns null on error.
847///
848/// Operation ::= XOperator ['<' Type '>'] '(' Args ')'
849///
850Init *TGParser::ParseOperation(Record *CurRec, RecTy *ItemType) {
switch (Lex.getCode()) {
default:
  TokError("unknown operation");
  return nullptr;
case tgtok::XHead:
case tgtok::XTail:
case tgtok::XSize:
case tgtok::XEmpty:
case tgtok::XCast: {  // Value ::= !unop '(' Value ')'
  UnOpInit::UnaryOp Code;
  RecTy *Type = nullptr;

  switch (Lex.getCode()) {
  default: llvm_unreachable("Unhandled code!")::llvm::llvm_unreachable_internal("Unhandled code!", "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 864);
  case tgtok::XCast:
    Lex.Lex();  // eat the operation
    Code = UnOpInit::CAST;

    Type = ParseOperatorType();

    if (!Type) {
      TokError("did not get type for unary operator");
      return nullptr;
    }

    break;
  case tgtok::XHead:
    Lex.Lex();  // eat the operation
    Code = UnOpInit::HEAD;
    break;
  case tgtok::XTail:
    Lex.Lex();  // eat the operation
    Code = UnOpInit::TAIL;
    break;
  case tgtok::XSize:
    Lex.Lex();
    Code = UnOpInit::SIZE;
    Type = IntRecTy::get();
    break;
  case tgtok::XEmpty:
    Lex.Lex();  // eat the operation
    Code = UnOpInit::EMPTY;
    Type = IntRecTy::get();
    break;
  }
  if (Lex.getCode() != tgtok::l_paren) {
    TokError("expected '(' after unary operator");
    return nullptr;
  }
  Lex.Lex();  // eat the '('

  Init *LHS = ParseValue(CurRec);
  if (!LHS) return nullptr;

  if (Code == UnOpInit::HEAD ||
      Code == UnOpInit::TAIL ||
      Code == UnOpInit::EMPTY) {
    ListInit *LHSl = dyn_cast<ListInit>(LHS);
    StringInit *LHSs = dyn_cast<StringInit>(LHS);
    TypedInit *LHSt = dyn_cast<TypedInit>(LHS);
    if (!LHSl && !LHSs && !LHSt) {
      TokError("expected list or string type argument in unary operator");
      return nullptr;
    }
    if (LHSt) {
      ListRecTy *LType = dyn_cast<ListRecTy>(LHSt->getType());
      StringRecTy *SType = dyn_cast<StringRecTy>(LHSt->getType());
      if (!LType && !SType) {
        TokError("expected list or string type argument in unary operator");
        return nullptr;
      }
    }

    if (Code == UnOpInit::HEAD || Code == UnOpInit::TAIL ||
        Code == UnOpInit::SIZE) {
      if (!LHSl && !LHSt) {
        TokError("expected list type argument in unary operator");
        return nullptr;
      }
    }

    if (Code == UnOpInit::HEAD || Code == UnOpInit::TAIL) {
      if (LHSl && LHSl->empty()) {
        TokError("empty list argument in unary operator");
        return nullptr;
      }
      if (LHSl) {
        Init *Item = LHSl->getElement(0);
        TypedInit *Itemt = dyn_cast<TypedInit>(Item);
        if (!Itemt) {
          TokError("untyped list element in unary operator");
          return nullptr;
        }
        Type = (Code == UnOpInit::HEAD) ? Itemt->getType()
                                        : ListRecTy::get(Itemt->getType());
      } else {
        assert(LHSt && "expected list type argument in unary operator")(static_cast <bool> (LHSt && "expected list type argument in unary operator"
) ? void (0) : __assert_fail ("LHSt && \"expected list type argument in unary operator\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 947, __extension__ __PRETTY_FUNCTION__));
        ListRecTy *LType = dyn_cast<ListRecTy>(LHSt->getType());
        if (!LType) {
          TokError("expected list type argument in unary operator");
          return nullptr;
        }
        Type = (Code == UnOpInit::HEAD) ? LType->getElementType() : LType;
      }
    }
  }

  if (Lex.getCode() != tgtok::r_paren) {
    TokError("expected ')' in unary operator");
    return nullptr;
  }
  Lex.Lex();  // eat the ')'
  return (UnOpInit::get(Code, LHS, Type))->Fold(CurRec);
}

case tgtok::XIsA: {
  // Value ::= !isa '<' Type '>' '(' Value ')'
  Lex.Lex(); // eat the operation

  RecTy *Type = ParseOperatorType();
  if (!Type)
    return nullptr;

  if (Lex.getCode() != tgtok::l_paren) {
    TokError("expected '(' after type of !isa");
    return nullptr;
  }
  Lex.Lex(); // eat the '('

  Init *LHS = ParseValue(CurRec);
  if (!LHS)
    return nullptr;

  if (Lex.getCode() != tgtok::r_paren) {
    TokError("expected ')' in !isa");
    return nullptr;
  }
  Lex.Lex(); // eat the ')'

  return (IsAOpInit::get(Type, LHS))->Fold();
}

case tgtok::XConcat:
case tgtok::XADD:
case tgtok::XAND:
case tgtok::XOR:
case tgtok::XSRA:
case tgtok::XSRL:
case tgtok::XSHL:
case tgtok::XEq:
case tgtok::XNe:
case tgtok::XLe:
case tgtok::XLt:
case tgtok::XGe:
case tgtok::XGt:
case tgtok::XListConcat:
case tgtok::XStrConcat: {  // Value ::= !binop '(' Value ',' Value ')'
  tgtok::TokKind OpTok = Lex.getCode();
  SMLoc OpLoc = Lex.getLoc();
  Lex.Lex();  // eat the operation

  BinOpInit::BinaryOp Code;
  switch (OpTok) {
  default: llvm_unreachable("Unhandled code!")::llvm::llvm_unreachable_internal("Unhandled code!", "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 1014);
  case tgtok::XConcat: Code = BinOpInit::CONCAT; break;
  case tgtok::XADD:    Code = BinOpInit::ADD; break;
  case tgtok::XAND:    Code = BinOpInit::AND; break;
  case tgtok::XOR:     Code = BinOpInit::OR; break;
  case tgtok::XSRA:    Code = BinOpInit::SRA; break;
  case tgtok::XSRL:    Code = BinOpInit::SRL; break;
  case tgtok::XSHL:    Code = BinOpInit::SHL; break;
  case tgtok::XEq:     Code = BinOpInit::EQ; break;
  case tgtok::XNe:     Code = BinOpInit::NE; break;
  case tgtok::XLe:     Code = BinOpInit::LE; break;
  case tgtok::XLt:     Code = BinOpInit::LT; break;
  case tgtok::XGe:     Code = BinOpInit::GE; break;
  case tgtok::XGt:     Code = BinOpInit::GT; break;
  case tgtok::XListConcat: Code = BinOpInit::LISTCONCAT; break;
  case tgtok::XStrConcat: Code = BinOpInit::STRCONCAT; break;
  }

  RecTy *Type = nullptr;
  RecTy *ArgType = nullptr;
  switch (OpTok) {
  default:
    llvm_unreachable("Unhandled code!")::llvm::llvm_unreachable_internal("Unhandled code!", "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 1036);
  case tgtok::XConcat:
    Type = DagRecTy::get();
    ArgType = DagRecTy::get();
    break;
  case tgtok::XAND:
  case tgtok::XOR:
  case tgtok::XSRA:
  case tgtok::XSRL:
  case tgtok::XSHL:
  case tgtok::XADD:
    Type = IntRecTy::get();
    ArgType = IntRecTy::get();
    break;
  case tgtok::XEq:
  case tgtok::XNe:
    Type = BitRecTy::get();
    // ArgType for Eq / Ne is not known at this point
    break;
  case tgtok::XLe:
  case tgtok::XLt:
  case tgtok::XGe:
  case tgtok::XGt:
    Type = BitRecTy::get();
    ArgType = IntRecTy::get();
    break;
  case tgtok::XListConcat:
    // We don't know the list type until we parse the first argument
    ArgType = ItemType;
    break;
  case tgtok::XStrConcat:
    Type = StringRecTy::get();
    ArgType = StringRecTy::get();
    break;
  }

  if (Type && ItemType && !Type->typeIsConvertibleTo(ItemType)) {
    Error(OpLoc, Twine("expected value of type '") +
                 ItemType->getAsString() + "', got '" +
                 Type->getAsString() + "'");
    return nullptr;
  }

  if (Lex.getCode() != tgtok::l_paren) {
    TokError("expected '(' after binary operator");
    return nullptr;
  }
  Lex.Lex();  // eat the '('

  SmallVector<Init*, 2> InitList;

  for (;;) {
    SMLoc InitLoc = Lex.getLoc();
    InitList.push_back(ParseValue(CurRec, ArgType));
    if (!InitList.back()) return nullptr;

    // All BinOps require their arguments to be of compatible types.
    TypedInit *TI = dyn_cast<TypedInit>(InitList.back());
    if (!ArgType) {
      ArgType = TI->getType();

      switch (Code) {
      case BinOpInit::LISTCONCAT:
        if (!isa<ListRecTy>(ArgType)) {
          Error(InitLoc, Twine("expected a list, got value of type '") +
                         ArgType->getAsString() + "'");
          return nullptr;
        }
        break;
      case BinOpInit::EQ:
      case BinOpInit::NE:
        if (!ArgType->typeIsConvertibleTo(IntRecTy::get()) &&
            !ArgType->typeIsConvertibleTo(StringRecTy::get())) {
          Error(InitLoc, Twine("expected int, bits, or string; got value of "
                               "type '") + ArgType->getAsString() + "'");
          return nullptr;
        }
        break;
      default: llvm_unreachable("other ops have fixed argument types")::llvm::llvm_unreachable_internal("other ops have fixed argument types"
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 1114);
      }
    } else {
      RecTy *Resolved = resolveTypes(ArgType, TI->getType());
      if (!Resolved) {
        Error(InitLoc, Twine("expected value of type '") +
                       ArgType->getAsString() + "', got '" +
                       TI->getType()->getAsString() + "'");
        return nullptr;
      }
      if (Code != BinOpInit::ADD && Code != BinOpInit::AND &&
          Code != BinOpInit::OR && Code != BinOpInit::SRA &&
          Code != BinOpInit::SRL && Code != BinOpInit::SHL)
        ArgType = Resolved;
    }

    if (Lex.getCode() != tgtok::comma)
      break;
    Lex.Lex();  // eat the ','
  }

  if (Lex.getCode() != tgtok::r_paren) {
    TokError("expected ')' in operator");
    return nullptr;
  }
  Lex.Lex();  // eat the ')'

  if (Code == BinOpInit::LISTCONCAT)
    Type = ArgType;

  // We allow multiple operands to associative operators like !strconcat as
  // shorthand for nesting them.
  if (Code == BinOpInit::STRCONCAT || Code == BinOpInit::LISTCONCAT ||
      Code == BinOpInit::CONCAT || Code == BinOpInit::ADD ||
      Code == BinOpInit::AND || Code == BinOpInit::OR) {
    while (InitList.size() > 2) {
      Init *RHS = InitList.pop_back_val();
      RHS = (BinOpInit::get(Code, InitList.back(), RHS, Type))->Fold(CurRec);
      InitList.back() = RHS;
    }
  }

  if (InitList.size() == 2)
    return (BinOpInit::get(Code, InitList[0], InitList[1], Type))
        ->Fold(CurRec);

  Error(OpLoc, "expected two operands to operator");
  return nullptr;
}

case tgtok::XForEach: { // Value ::= !foreach '(' Id ',' Value ',' Value ')'
  SMLoc OpLoc = Lex.getLoc();
  Lex.Lex(); // eat the operation
  if (Lex.getCode() != tgtok::l_paren) {
    TokError("expected '(' after !foreach");
    return nullptr;
  }

  if (Lex.Lex() != tgtok::Id) { // eat the '('
    TokError("first argument of !foreach must be an identifier");
    return nullptr;
  }

  Init *LHS = StringInit::get(Lex.getCurStrVal());

  if (CurRec->getValue(LHS)) {
    TokError((Twine("iteration variable '") + LHS->getAsString() +
              "' already defined")
                 .str());
    return nullptr;
  }

  if (Lex.Lex() != tgtok::comma) { // eat the id
    TokError("expected ',' in ternary operator");
    return nullptr;
  }
  Lex.Lex();  // eat the ','

  Init *MHS = ParseValue(CurRec);
  if (!MHS)
    return nullptr;

  if (Lex.getCode() != tgtok::comma) {
    TokError("expected ',' in ternary operator");
    return nullptr;
  }
  Lex.Lex();  // eat the ','

  TypedInit *MHSt = dyn_cast<TypedInit>(MHS);
  if (!MHSt) {
    TokError("could not get type of !foreach input");
    return nullptr;
  }

  RecTy *InEltType = nullptr;
  RecTy *OutEltType = nullptr;
  bool IsDAG = false;

  if (ListRecTy *InListTy = dyn_cast<ListRecTy>(MHSt->getType())) {
    InEltType = InListTy->getElementType();
    if (ItemType) {
      if (ListRecTy *OutListTy = dyn_cast<ListRecTy>(ItemType)) {
        OutEltType = OutListTy->getElementType();
      } else {
        Error(OpLoc,
              "expected value of type '" + Twine(ItemType->getAsString()) +
              "', but got !foreach of list type");
        return nullptr;
      }
    }
  } else if (DagRecTy *InDagTy = dyn_cast<DagRecTy>(MHSt->getType())) {
    InEltType = InDagTy;
    if (ItemType && !isa<DagRecTy>(ItemType)) {
      Error(OpLoc,
            "expected value of type '" + Twine(ItemType->getAsString()) +
            "', but got !foreach of dag type");
      return nullptr;
    }
    IsDAG = true;
  } else {
    TokError("!foreach must have list or dag input");
    return nullptr;
  }

  CurRec->addValue(RecordVal(LHS, InEltType, false));
  Init *RHS = ParseValue(CurRec, OutEltType);
  CurRec->removeValue(LHS);
  if (!RHS)
    return nullptr;

  if (Lex.getCode() != tgtok::r_paren) {
    TokError("expected ')' in binary operator");
    return nullptr;
  }
  Lex.Lex();  // eat the ')'

  RecTy *OutType;
  if (IsDAG) {
    OutType = InEltType;
  } else {
    TypedInit *RHSt = dyn_cast<TypedInit>(RHS);
    if (!RHSt) {
      TokError("could not get type of !foreach result");
      return nullptr;
    }
    OutType = RHSt->getType()->getListTy();
  }

  return (TernOpInit::get(TernOpInit::FOREACH, LHS, MHS, RHS, OutType))
      ->Fold(CurRec);
}

case tgtok::XDag:
case tgtok::XIf:
case tgtok::XSubst: {  // Value ::= !ternop '(' Value ',' Value ',' Value ')'
  TernOpInit::TernaryOp Code;
  RecTy *Type = nullptr;

  tgtok::TokKind LexCode = Lex.getCode();
  Lex.Lex();  // eat the operation
  switch (LexCode) {
  default: llvm_unreachable("Unhandled code!")::llvm::llvm_unreachable_internal("Unhandled code!", "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 1275);
  case tgtok::XDag:
    Code = TernOpInit::DAG;
    Type = DagRecTy::get();
    ItemType = nullptr;
    break;
  case tgtok::XIf:
    Code = TernOpInit::IF;
    break;
  case tgtok::XSubst:
    Code = TernOpInit::SUBST;
    break;
  }
  if (Lex.getCode() != tgtok::l_paren) {
    TokError("expected '(' after ternary operator");
    return nullptr;
  }
  Lex.Lex();  // eat the '('

  Init *LHS = ParseValue(CurRec);
  if (!LHS) return nullptr;

  if (Lex.getCode() != tgtok::comma) {
    TokError("expected ',' in ternary operator");
    return nullptr;
  }
  Lex.Lex();  // eat the ','

  SMLoc MHSLoc = Lex.getLoc();
  Init *MHS = ParseValue(CurRec, ItemType);
  if (!MHS)
    return nullptr;

  if (Lex.getCode() != tgtok::comma) {
    TokError("expected ',' in ternary operator");
    return nullptr;
  }
  Lex.Lex();  // eat the ','

  SMLoc RHSLoc = Lex.getLoc();
  Init *RHS = ParseValue(CurRec, ItemType);
  if (!RHS)
    return nullptr;

  if (Lex.getCode() != tgtok::r_paren) {
    TokError("expected ')' in binary operator");
    return nullptr;
  }
  Lex.Lex();  // eat the ')'

  switch (LexCode) {
  default: llvm_unreachable("Unhandled code!")::llvm::llvm_unreachable_internal("Unhandled code!", "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 1326);
  case tgtok::XDag: {
    TypedInit *MHSt = dyn_cast<TypedInit>(MHS);
    if (!MHSt && !isa<UnsetInit>(MHS)) {
      Error(MHSLoc, "could not determine type of the child list in !dag");
      return nullptr;
    }
    if (MHSt && !isa<ListRecTy>(MHSt->getType())) {
      Error(MHSLoc, Twine("expected list of children, got type '") +
                        MHSt->getType()->getAsString() + "'");
      return nullptr;
    }

    TypedInit *RHSt = dyn_cast<TypedInit>(RHS);
    if (!RHSt && !isa<UnsetInit>(RHS)) {
      Error(RHSLoc, "could not determine type of the name list in !dag");
      return nullptr;
    }
    if (RHSt && StringRecTy::get()->getListTy() != RHSt->getType()) {
      Error(RHSLoc, Twine("expected list<string>, got type '") +
                        RHSt->getType()->getAsString() + "'");
      return nullptr;
    }

    if (!MHSt && !RHSt) {
      Error(MHSLoc,
            "cannot have both unset children and unset names in !dag");
      return nullptr;
    }
    break;
  }
  case tgtok::XIf: {
    RecTy *MHSTy = nullptr;
    RecTy *RHSTy = nullptr;

    if (TypedInit *MHSt = dyn_cast<TypedInit>(MHS))
      MHSTy = MHSt->getType();
    if (BitsInit *MHSbits = dyn_cast<BitsInit>(MHS))
      MHSTy = BitsRecTy::get(MHSbits->getNumBits());
    if (isa<BitInit>(MHS))
      MHSTy = BitRecTy::get();

    if (TypedInit *RHSt = dyn_cast<TypedInit>(RHS))
      RHSTy = RHSt->getType();
    if (BitsInit *RHSbits = dyn_cast<BitsInit>(RHS))
      RHSTy = BitsRecTy::get(RHSbits->getNumBits());
    if (isa<BitInit>(RHS))
      RHSTy = BitRecTy::get();

    // For UnsetInit, it's typed from the other hand.
    if (isa<UnsetInit>(MHS))
      MHSTy = RHSTy;
    if (isa<UnsetInit>(RHS))
      RHSTy = MHSTy;

    if (!MHSTy || !RHSTy) {
      TokError("could not get type for !if");
      return nullptr;
    }

    Type = resolveTypes(MHSTy, RHSTy);
    if (!Type) {
      TokError(Twine("inconsistent types '") + MHSTy->getAsString() +
               "' and '" + RHSTy->getAsString() + "' for !if");
      return nullptr;
    }
    break;
  }
  case tgtok::XSubst: {
    TypedInit *RHSt = dyn_cast<TypedInit>(RHS);
    if (!RHSt) {
      TokError("could not get type for !subst");
      return nullptr;
    }
    Type = RHSt->getType();
    break;
  }
  }
  return (TernOpInit::get(Code, LHS, MHS, RHS, Type))->Fold(CurRec);
}

case tgtok::XFoldl: {
  // Value ::= !foldl '(' Id ',' Id ',' Value ',' Value ',' Value ')'
  Lex.Lex(); // eat the operation
  if (Lex.getCode() != tgtok::l_paren) {
    TokError("expected '(' after !foldl");
    return nullptr;
  }
  Lex.Lex(); // eat the '('

  Init *StartUntyped = ParseValue(CurRec);
  if (!StartUntyped)
    return nullptr;

  TypedInit *Start = dyn_cast<TypedInit>(StartUntyped);
  if (!Start) {
    TokError(Twine("could not get type of !foldl start: '") +
             StartUntyped->getAsString() + "'");
    return nullptr;
  }

  if (Lex.getCode() != tgtok::comma) {
    TokError("expected ',' in !foldl");
    return nullptr;
  }
  Lex.Lex(); // eat the ','

  Init *ListUntyped = ParseValue(CurRec);
  if (!ListUntyped)
    return nullptr;

  TypedInit *List = dyn_cast<TypedInit>(ListUntyped);
  if (!List) {
    TokError(Twine("could not get type of !foldl list: '") +
             ListUntyped->getAsString() + "'");
    return nullptr;
  }

  ListRecTy *ListType = dyn_cast<ListRecTy>(List->getType());
  if (!ListType) {
    TokError(Twine("!foldl list must be a list, but is of type '") +
             List->getType()->getAsString());
    return nullptr;
  }

  if (Lex.getCode() != tgtok::comma) {
    TokError("expected ',' in !foldl");
    return nullptr;
  }

  if (Lex.Lex() != tgtok::Id) { // eat the ','
    TokError("third argument of !foldl must be an identifier");
    return nullptr;
  }

  Init *A = StringInit::get(Lex.getCurStrVal());
  if (CurRec->getValue(A)) {
    TokError((Twine("left !foldl variable '") + A->getAsString() +
              "' already defined")
                 .str());
    return nullptr;
  }

  if (Lex.Lex() != tgtok::comma) { // eat the id
    TokError("expected ',' in !foldl");
    return nullptr;
  }

  if (Lex.Lex() != tgtok::Id) { // eat the ','
    TokError("fourth argument of !foldl must be an identifier");
    return nullptr;
  }

  Init *B = StringInit::get(Lex.getCurStrVal());
  if (CurRec->getValue(B)) {
    TokError((Twine("right !foldl variable '") + B->getAsString() +
              "' already defined")
                 .str());
    return nullptr;
  }

  if (Lex.Lex() != tgtok::comma) { // eat the id
    TokError("expected ',' in !foldl");
    return nullptr;
  }
  Lex.Lex(); // eat the ','

  CurRec->addValue(RecordVal(A, Start->getType(), false));
  CurRec->addValue(RecordVal(B, ListType->getElementType(), false));
  Init *ExprUntyped = ParseValue(CurRec);
  CurRec->removeValue(A);
  CurRec->removeValue(B);
  if (!ExprUntyped)
    return nullptr;

  TypedInit *Expr = dyn_cast<TypedInit>(ExprUntyped);
  if (!Expr) {
    TokError("could not get type of !foldl expression");
    return nullptr;
  }

  if (Expr->getType() != Start->getType()) {
    TokError(Twine("!foldl expression must be of same type as start (") +
             Start->getType()->getAsString() + "), but is of type " +
             Expr->getType()->getAsString());
    return nullptr;
  }

  if (Lex.getCode() != tgtok::r_paren) {
    TokError("expected ')' in fold operator");
    return nullptr;
  }
  Lex.Lex(); // eat the ')'

  return FoldOpInit::get(Start, List, A, B, Expr, Start->getType())
      ->Fold(CurRec);
}
}
1524}

1526/// ParseOperatorType - Parse a type for an operator.  This returns
1527/// null on error.
1528///
1529/// OperatorType ::= '<' Type '>'
1530///
1531RecTy *TGParser::ParseOperatorType() {
RecTy *Type = nullptr;

if (Lex.getCode() != tgtok::less) {
  TokError("expected type name for operator");
  return nullptr;
}
Lex.Lex();  // eat the <

Type = ParseType();

if (!Type) {
  TokError("expected type name for operator");
  return nullptr;
}

if (Lex.getCode() != tgtok::greater) {
  TokError("expected type name for operator");
  return nullptr;
}
Lex.Lex();  // eat the >

return Type;
1554}

1556/// ParseSimpleValue - Parse a tblgen value.  This returns null on error.
1557///
1558///   SimpleValue ::= IDValue
1559///   SimpleValue ::= INTVAL
1560///   SimpleValue ::= STRVAL+
1561///   SimpleValue ::= CODEFRAGMENT
1562///   SimpleValue ::= '?'
1563///   SimpleValue ::= '{' ValueList '}'
1564///   SimpleValue ::= ID '<' ValueListNE '>'
1565///   SimpleValue ::= '[' ValueList ']'
1566///   SimpleValue ::= '(' IDValue DagArgList ')'
1567///   SimpleValue ::= CONCATTOK '(' Value ',' Value ')'
1568///   SimpleValue ::= ADDTOK '(' Value ',' Value ')'
1569///   SimpleValue ::= SHLTOK '(' Value ',' Value ')'
1570///   SimpleValue ::= SRATOK '(' Value ',' Value ')'
1571///   SimpleValue ::= SRLTOK '(' Value ',' Value ')'
1572///   SimpleValue ::= LISTCONCATTOK '(' Value ',' Value ')'
1573///   SimpleValue ::= STRCONCATTOK '(' Value ',' Value ')'
1574///
1575Init *TGParser::ParseSimpleValue(Record *CurRec, RecTy *ItemType,
                               IDParseMode Mode) {
Init *R = nullptr;
switch (Lex.getCode()) {
default: TokError("Unknown token when parsing a value"); break;
case tgtok::paste:
  // This is a leading paste operation.  This is deprecated but
  // still exists in some .td files.  Ignore it.
  Lex.Lex();  // Skip '#'.
  return ParseSimpleValue(CurRec, ItemType, Mode);
case tgtok::IntVal: R = IntInit::get(Lex.getCurIntVal()); Lex.Lex(); break;
case tgtok::BinaryIntVal: {
  auto BinaryVal = Lex.getCurBinaryIntVal();
  SmallVector<Init*, 16> Bits(BinaryVal.second);
  for (unsigned i = 0, e = BinaryVal.second; i != e; ++i)
    Bits[i] = BitInit::get(BinaryVal.first & (1LL << i));
  R = BitsInit::get(Bits);
  Lex.Lex();
  break;
}
case tgtok::StrVal: {
  std::string Val = Lex.getCurStrVal();
  Lex.Lex();

  // Handle multiple consecutive concatenated strings.
  while (Lex.getCode() == tgtok::StrVal) {
    Val += Lex.getCurStrVal();
    Lex.Lex();
  }

  R = StringInit::get(Val);
  break;
}
case tgtok::CodeFragment:
  R = CodeInit::get(Lex.getCurStrVal());
  Lex.Lex();
  break;
case tgtok::question:
  R = UnsetInit::get();
  Lex.Lex();
  break;
case tgtok::Id: {
  SMLoc NameLoc = Lex.getLoc();
  StringInit *Name = StringInit::get(Lex.getCurStrVal());
  if (Lex.Lex() != tgtok::less)  // consume the Id.
    return ParseIDValue(CurRec, Name, NameLoc, Mode);    // Value ::= IDValue

  // Value ::= ID '<' ValueListNE '>'
  if (Lex.Lex() == tgtok::greater) {
    TokError("expected non-empty value list");
    return nullptr;
  }

  // This is a CLASS<initvalslist> expression.  This is supposed to synthesize
  // a new anonymous definition, deriving from CLASS<initvalslist> with no
  // body.
  Record *Class = Records.getClass(Name->getValue());
  if (!Class) {
    Error(NameLoc, "Expected a class name, got '" + Name->getValue() + "'");
    return nullptr;
  }

  SmallVector<Init *, 8> Args;
  ParseValueList(Args, CurRec, Class);
  if (Args.empty()) return nullptr;

  if (Lex.getCode() != tgtok::greater) {
    TokError("expected '>' at end of value list");
    return nullptr;
  }
  Lex.Lex();  // eat the '>'

  // Typecheck the template arguments list
  ArrayRef<Init *> ExpectedArgs = Class->getTemplateArgs();
  if (ExpectedArgs.size() < Args.size()) {
    Error(NameLoc,
          "More template args specified than expected");
    return nullptr;
  }

  for (unsigned i = 0, e = ExpectedArgs.size(); i != e; ++i) {
    RecordVal *ExpectedArg = Class->getValue(ExpectedArgs[i]);
    if (i < Args.size()) {
      if (TypedInit *TI = dyn_cast<TypedInit>(Args[i])) {
        RecTy *ExpectedType = ExpectedArg->getType();
        if (!TI->getType()->typeIsConvertibleTo(ExpectedType)) {
          Error(NameLoc,
                "Value specified for template argument #" + Twine(i) + " (" +
                ExpectedArg->getNameInitAsString() + ") is of type '" +
                TI->getType()->getAsString() + "', expected '" +
                ExpectedType->getAsString() + "': " + TI->getAsString());
          return nullptr;
        }
        continue;
      }
    } else if (ExpectedArg->getValue()->isComplete())
      continue;

    Error(NameLoc,
          "Value not specified for template argument #" + Twine(i) + " (" +
          ExpectedArgs[i]->getAsUnquotedString() + ")");
    return nullptr;
  }

  return VarDefInit::get(Class, Args)->Fold();
}
case tgtok::l_brace: {           // Value ::= '{' ValueList '}'
  SMLoc BraceLoc = Lex.getLoc();
  Lex.Lex(); // eat the '{'
  SmallVector<Init*, 16> Vals;

  if (Lex.getCode() != tgtok::r_brace) {
    ParseValueList(Vals, CurRec);
    if (Vals.empty()) return nullptr;
  }
  if (Lex.getCode() != tgtok::r_brace) {
    TokError("expected '}' at end of bit list value");
    return nullptr;
  }
  Lex.Lex();  // eat the '}'

  SmallVector<Init *, 16> NewBits;

  // As we parse { a, b, ... }, 'a' is the highest bit, but we parse it
  // first.  We'll first read everything in to a vector, then we can reverse
  // it to get the bits in the correct order for the BitsInit value.
  for (unsigned i = 0, e = Vals.size(); i != e; ++i) {
    // FIXME: The following two loops would not be duplicated
    //        if the API was a little more orthogonal.

    // bits<n> values are allowed to initialize n bits.
    if (BitsInit *BI = dyn_cast<BitsInit>(Vals[i])) {
      for (unsigned i = 0, e = BI->getNumBits(); i != e; ++i)
        NewBits.push_back(BI->getBit((e - i) - 1));
      continue;
    }
    // bits<n> can also come from variable initializers.
    if (VarInit *VI = dyn_cast<VarInit>(Vals[i])) {
      if (BitsRecTy *BitsRec = dyn_cast<BitsRecTy>(VI->getType())) {
        for (unsigned i = 0, e = BitsRec->getNumBits(); i != e; ++i)
          NewBits.push_back(VI->getBit((e - i) - 1));
        continue;
      }
      // Fallthrough to try convert this to a bit.
    }
    // All other values must be convertible to just a single bit.
    Init *Bit = Vals[i]->getCastTo(BitRecTy::get());
    if (!Bit) {
      Error(BraceLoc, "Element #" + Twine(i) + " (" + Vals[i]->getAsString() +
            ") is not convertable to a bit");
      return nullptr;
    }
    NewBits.push_back(Bit);
  }
  std::reverse(NewBits.begin(), NewBits.end());
  return BitsInit::get(NewBits);
}
case tgtok::l_square: {          // Value ::= '[' ValueList ']'
  Lex.Lex(); // eat the '['
  SmallVector<Init*, 16> Vals;

  RecTy *DeducedEltTy = nullptr;
  ListRecTy *GivenListTy = nullptr;

  if (ItemType) {
    ListRecTy *ListType = dyn_cast<ListRecTy>(ItemType);
    if (!ListType) {
      TokError(Twine("Type mismatch for list, expected list type, got ") +
               ItemType->getAsString());
      return nullptr;
    }
    GivenListTy = ListType;
  }

  if (Lex.getCode() != tgtok::r_square) {
    ParseValueList(Vals, CurRec, nullptr,
                   GivenListTy ? GivenListTy->getElementType() : nullptr);
    if (Vals.empty()) return nullptr;
  }
  if (Lex.getCode() != tgtok::r_square) {
    TokError("expected ']' at end of list value");
    return nullptr;
  }
  Lex.Lex();  // eat the ']'

  RecTy *GivenEltTy = nullptr;
  if (Lex.getCode() == tgtok::less) {
    // Optional list element type
    Lex.Lex();  // eat the '<'

    GivenEltTy = ParseType();
    if (!GivenEltTy) {
      // Couldn't parse element type
      return nullptr;
    }

    if (Lex.getCode() != tgtok::greater) {
      TokError("expected '>' at end of list element type");
      return nullptr;
    }
    Lex.Lex();  // eat the '>'
  }

  // Check elements
  RecTy *EltTy = nullptr;
  for (Init *V : Vals) {
    TypedInit *TArg = dyn_cast<TypedInit>(V);
    if (TArg) {
      if (EltTy) {
        EltTy = resolveTypes(EltTy, TArg->getType());
        if (!EltTy) {
          TokError("Incompatible types in list elements");
          return nullptr;
        }
      } else {
        EltTy = TArg->getType();
      }
    }
  }

  if (GivenEltTy) {
    if (EltTy) {
      // Verify consistency
      if (!EltTy->typeIsConvertibleTo(GivenEltTy)) {
        TokError("Incompatible types in list elements");
        return nullptr;
      }
    }
    EltTy = GivenEltTy;
  }

  if (!EltTy) {
    if (!ItemType) {
      TokError("No type for list");
      return nullptr;
    }
    DeducedEltTy = GivenListTy->getElementType();
  } else {
    // Make sure the deduced type is compatible with the given type
    if (GivenListTy) {
      if (!EltTy->typeIsConvertibleTo(GivenListTy->getElementType())) {
        TokError(Twine("Element type mismatch for list: element type '") +
                 EltTy->getAsString() + "' not convertible to '" +
                 GivenListTy->getElementType()->getAsString());
        return nullptr;
      }
    }
    DeducedEltTy = EltTy;
  }

  return ListInit::get(Vals, DeducedEltTy);
}
case tgtok::l_paren: {         // Value ::= '(' IDValue DagArgList ')'
  Lex.Lex();   // eat the '('
  if (Lex.getCode() != tgtok::Id && Lex.getCode() != tgtok::XCast) {
    TokError("expected identifier in dag init");
    return nullptr;
  }

  Init *Operator = ParseValue(CurRec);
  if (!Operator) return nullptr;

  // If the operator name is present, parse it.
  StringInit *OperatorName = nullptr;
  if (Lex.getCode() == tgtok::colon) {
    if (Lex.Lex() != tgtok::VarName) { // eat the ':'
      TokError("expected variable name in dag operator");
      return nullptr;
    }
    OperatorName = StringInit::get(Lex.getCurStrVal());
    Lex.Lex();  // eat the VarName.
  }

  SmallVector<std::pair<llvm::Init*, StringInit*>, 8> DagArgs;
  if (Lex.getCode() != tgtok::r_paren) {
    ParseDagArgList(DagArgs, CurRec);
    if (DagArgs.empty()) return nullptr;
  }

  if (Lex.getCode() != tgtok::r_paren) {
    TokError("expected ')' in dag init");
    return nullptr;
  }
  Lex.Lex();  // eat the ')'

  return DagInit::get(Operator, OperatorName, DagArgs);
}

case tgtok::XHead:
case tgtok::XTail:
case tgtok::XSize:
case tgtok::XEmpty:
case tgtok::XCast:  // Value ::= !unop '(' Value ')'
case tgtok::XIsA:
case tgtok::XConcat:
case tgtok::XDag:
case tgtok::XADD:
case tgtok::XAND:
case tgtok::XOR:
case tgtok::XSRA:
case tgtok::XSRL:
case tgtok::XSHL:
case tgtok::XEq:
case tgtok::XNe:
case tgtok::XLe:
case tgtok::XLt:
case tgtok::XGe:
case tgtok::XGt:
case tgtok::XListConcat:
case tgtok::XStrConcat:   // Value ::= !binop '(' Value ',' Value ')'
case tgtok::XIf:
case tgtok::XFoldl:
case tgtok::XForEach:
case tgtok::XSubst: {  // Value ::= !ternop '(' Value ',' Value ',' Value ')'
  return ParseOperation(CurRec, ItemType);
}
}

return R;
1894}

1896/// ParseValue - Parse a tblgen value.  This returns null on error.
1897///
1898///   Value       ::= SimpleValue ValueSuffix*
1899///   ValueSuffix ::= '{' BitList '}'
1900///   ValueSuffix ::= '[' BitList ']'
1901///   ValueSuffix ::= '.' ID
1902///
1903Init *TGParser::ParseValue(Record *CurRec, RecTy *ItemType, IDParseMode Mode) {
Init *Result = ParseSimpleValue(CurRec, ItemType, Mode);
if (!Result) return nullptr;

// Parse the suffixes now if present.
while (true) {
  switch (Lex.getCode()) {
  default: return Result;
  case tgtok::l_brace: {
    if (Mode == ParseNameMode)
      // This is the beginning of the object body.
      return Result;

    SMLoc CurlyLoc = Lex.getLoc();
    Lex.Lex(); // eat the '{'
    SmallVector<unsigned, 16> Ranges;
    ParseRangeList(Ranges);
    if (Ranges.empty()) return nullptr;

    // Reverse the bitlist.
    std::reverse(Ranges.begin(), Ranges.end());
    Result = Result->convertInitializerBitRange(Ranges);
    if (!Result) {
      Error(CurlyLoc, "Invalid bit range for value");
      return nullptr;
    }

    // Eat the '}'.
    if (Lex.getCode() != tgtok::r_brace) {
      TokError("expected '}' at end of bit range list");
      return nullptr;
    }
    Lex.Lex();
    break;
  }
  case tgtok::l_square: {
    SMLoc SquareLoc = Lex.getLoc();
    Lex.Lex(); // eat the '['
    SmallVector<unsigned, 16> Ranges;
    ParseRangeList(Ranges);
    if (Ranges.empty()) return nullptr;

    Result = Result->convertInitListSlice(Ranges);
    if (!Result) {
      Error(SquareLoc, "Invalid range for list slice");
      return nullptr;
    }

    // Eat the ']'.
    if (Lex.getCode() != tgtok::r_square) {
      TokError("expected ']' at end of list slice");
      return nullptr;
    }
    Lex.Lex();
    break;
  }
  case tgtok::period: {
    if (Lex.Lex() != tgtok::Id) {  // eat the .
      TokError("expected field identifier after '.'");
      return nullptr;
    }
    StringInit *FieldName = StringInit::get(Lex.getCurStrVal());
    if (!Result->getFieldType(FieldName)) {
      TokError("Cannot access field '" + Lex.getCurStrVal() + "' of value '" +
               Result->getAsString() + "'");
      return nullptr;
    }
    Result = FieldInit::get(Result, FieldName)->Fold(CurRec);
    Lex.Lex();  // eat field name
    break;
  }

  case tgtok::paste:
    SMLoc PasteLoc = Lex.getLoc();

    // Create a !strconcat() operation, first casting each operand to
    // a string if necessary.

    TypedInit *LHS = dyn_cast<TypedInit>(Result);
    if (!LHS) {
      Error(PasteLoc, "LHS of paste is not typed!");
      return nullptr;
    }

    if (LHS->getType() != StringRecTy::get()) {
      LHS = dyn_cast<TypedInit>(
          UnOpInit::get(UnOpInit::CAST, LHS, StringRecTy::get())
              ->Fold(CurRec));
      if (!LHS) {
        Error(PasteLoc, Twine("can't cast '") + LHS->getAsString() +
                            "' to string");
        return nullptr;
      }
    }

    TypedInit *RHS = nullptr;

    Lex.Lex();  // Eat the '#'.
    switch (Lex.getCode()) {
    case tgtok::colon:
    case tgtok::semi:
    case tgtok::l_brace:
      // These are all of the tokens that can begin an object body.
      // Some of these can also begin values but we disallow those cases
      // because they are unlikely to be useful.

      // Trailing paste, concat with an empty string.
      RHS = StringInit::get("");
      break;

    default:
      Init *RHSResult = ParseValue(CurRec, nullptr, ParseNameMode);
      RHS = dyn_cast<TypedInit>(RHSResult);
      if (!RHS) {
        Error(PasteLoc, "RHS of paste is not typed!");
        return nullptr;
      }

      if (RHS->getType() != StringRecTy::get()) {
        RHS = dyn_cast<TypedInit>(
            UnOpInit::get(UnOpInit::CAST, RHS, StringRecTy::get())
                ->Fold(CurRec));
        if (!RHS) {
          Error(PasteLoc, Twine("can't cast '") + RHS->getAsString() +
                              "' to string");
          return nullptr;
        }
      }

      break;
    }

    Result = BinOpInit::getStrConcat(LHS, RHS);
    break;
  }
}
2039}

2041/// ParseDagArgList - Parse the argument list for a dag literal expression.
2042///
2043///    DagArg     ::= Value (':' VARNAME)?
2044///    DagArg     ::= VARNAME
2045///    DagArgList ::= DagArg
2046///    DagArgList ::= DagArgList ',' DagArg
2047void TGParser::ParseDagArgList(
  SmallVectorImpl<std::pair<llvm::Init*, StringInit*>> &Result,
  Record *CurRec) {

while (true) {
  // DagArg ::= VARNAME
  if (Lex.getCode() == tgtok::VarName) {
    // A missing value is treated like '?'.
    StringInit *VarName = StringInit::get(Lex.getCurStrVal());
    Result.emplace_back(UnsetInit::get(), VarName);
    Lex.Lex();
  } else {
    // DagArg ::= Value (':' VARNAME)?
    Init *Val = ParseValue(CurRec);
    if (!Val) {
      Result.clear();
      return;
    }

    // If the variable name is present, add it.
    StringInit *VarName = nullptr;
    if (Lex.getCode() == tgtok::colon) {
      if (Lex.Lex() != tgtok::VarName) { // eat the ':'
        TokError("expected variable name in dag literal");
        Result.clear();
        return;
      }
      VarName = StringInit::get(Lex.getCurStrVal());
      Lex.Lex();  // eat the VarName.
    }

    Result.push_back(std::make_pair(Val, VarName));
  }
  if (Lex.getCode() != tgtok::comma) break;
  Lex.Lex(); // eat the ','
}
2083}

2085/// ParseValueList - Parse a comma separated list of values, returning them as a
2086/// vector.  Note that this always expects to be able to parse at least one
2087/// value.  It returns an empty list if this is not possible.
2088///
2089///   ValueList ::= Value (',' Value)
2090///
2091void TGParser::ParseValueList(SmallVectorImpl<Init*> &Result, Record *CurRec,
                            Record *ArgsRec, RecTy *EltTy) {
RecTy *ItemType = EltTy;
unsigned int ArgN = 0;
if (ArgsRec && !EltTy) {
  ArrayRef<Init *> TArgs = ArgsRec->getTemplateArgs();
  if (TArgs.empty()) {
    TokError("template argument provided to non-template class");
    Result.clear();
    return;
  }
  const RecordVal *RV = ArgsRec->getValue(TArgs[ArgN]);
  if (!RV) {
    errs() << "Cannot find template arg " << ArgN << " (" << TArgs[ArgN]
      << ")\n";
  }
  assert(RV && "Template argument record not found??")(static_cast <bool> (RV && "Template argument record not found??"
) ? void (0) : __assert_fail ("RV && \"Template argument record not found??\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 2107, __extension__ __PRETTY_FUNCTION__));
  ItemType = RV->getType();
  ++ArgN;
}
Result.push_back(ParseValue(CurRec, ItemType));
if (!Result.back()) {
  Result.clear();
  return;
}

while (Lex.getCode() == tgtok::comma) {
  Lex.Lex();  // Eat the comma

  if (ArgsRec && !EltTy) {
    ArrayRef<Init *> TArgs = ArgsRec->getTemplateArgs();
    if (ArgN >= TArgs.size()) {
      TokError("too many template arguments");
      Result.clear();
      return;
    }
    const RecordVal *RV = ArgsRec->getValue(TArgs[ArgN]);
    assert(RV && "Template argument record not found??")(static_cast <bool> (RV && "Template argument record not found??"
) ? void (0) : __assert_fail ("RV && \"Template argument record not found??\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 2128, __extension__ __PRETTY_FUNCTION__));
    ItemType = RV->getType();
    ++ArgN;
  }
  Result.push_back(ParseValue(CurRec, ItemType));
  if (!Result.back()) {
    Result.clear();
    return;
  }
}
2138}

2140/// ParseDeclaration - Read a declaration, returning the name of field ID, or an
2141/// empty string on error.  This can happen in a number of different context's,
2142/// including within a def or in the template args for a def (which which case
2143/// CurRec will be non-null) and within the template args for a multiclass (in
2144/// which case CurRec will be null, but CurMultiClass will be set).  This can
2145/// also happen within a def that is within a multiclass, which will set both
2146/// CurRec and CurMultiClass.
2147///
2148///  Declaration ::= FIELD? Type ID ('=' Value)?
2149///
2150Init *TGParser::ParseDeclaration(Record *CurRec,
                                     bool ParsingTemplateArgs) {
// Read the field prefix if present.
bool HasField = Lex.getCode() == tgtok::Field;
if (HasField) Lex.Lex();

RecTy *Type = ParseType();
if (!Type) return nullptr;

if (Lex.getCode() != tgtok::Id) {
  TokError("Expected identifier in declaration");
  return nullptr;
}

SMLoc IdLoc = Lex.getLoc();
Init *DeclName = StringInit::get(Lex.getCurStrVal());
Lex.Lex();

if (ParsingTemplateArgs) {
  if (CurRec)
    DeclName = QualifyName(*CurRec, CurMultiClass, DeclName, ":");
  else
    assert(CurMultiClass)(static_cast <bool> (CurMultiClass) ? void (0) : __assert_fail
 ("CurMultiClass", "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 2172, __extension__ __PRETTY_FUNCTION__));
  if (CurMultiClass)
    DeclName = QualifyName(CurMultiClass->Rec, CurMultiClass, DeclName,
                           "::");
}

// Add the value.
if (AddValue(CurRec, IdLoc, RecordVal(DeclName, Type, HasField)))
  return nullptr;

// If a value is present, parse it.
if (Lex.getCode() == tgtok::equal) {
  Lex.Lex();
  SMLoc ValLoc = Lex.getLoc();
  Init *Val = ParseValue(CurRec, Type);
  if (!Val ||
      SetValue(CurRec, ValLoc, DeclName, None, Val))
    // Return the name, even if an error is thrown.  This is so that we can
    // continue to make some progress, even without the value having been
    // initialized.
    return DeclName;
}

return DeclName;
2196}

2198/// ParseForeachDeclaration - Read a foreach declaration, returning
2199/// the name of the declared object or a NULL Init on error.  Return
2200/// the name of the parsed initializer list through ForeachListName.
2201///
2202///  ForeachDeclaration ::= ID '=' '{' RangeList '}'
2203///  ForeachDeclaration ::= ID '=' RangePiece
2204///  ForeachDeclaration ::= ID '=' Value
2205///
2206VarInit *TGParser::ParseForeachDeclaration(ListInit *&ForeachListValue) {
if (Lex.getCode() != tgtok::Id) {
  TokError("Expected identifier in foreach declaration");
  return nullptr;
}

Init *DeclName = StringInit::get(Lex.getCurStrVal());
Lex.Lex();

// If a value is present, parse it.
if (Lex.getCode() != tgtok::equal) {
  TokError("Expected '=' in foreach declaration");
  return nullptr;
}
Lex.Lex();  // Eat the '='

RecTy *IterType = nullptr;
SmallVector<unsigned, 16> Ranges;

switch (Lex.getCode()) {
case tgtok::IntVal: { // RangePiece.
  if (ParseRangePiece(Ranges))
    return nullptr;
  break;
}

case tgtok::l_brace: { // '{' RangeList '}'
  Lex.Lex(); // eat the '{'
  ParseRangeList(Ranges);
  if (Lex.getCode() != tgtok::r_brace) {
    TokError("expected '}' at end of bit range list");
    return nullptr;
  }
  Lex.Lex();
  break;
}

default: {
  SMLoc ValueLoc = Lex.getLoc();
  Init *I = ParseValue(nullptr);
  if (!isa<ListInit>(I)) {
    std::string Type;
    if (TypedInit *TI = dyn_cast<TypedInit>(I))
      Type = (Twine("' of type '") + TI->getType()->getAsString()).str();
    Error(ValueLoc, "expected a list, got '" + I->getAsString() + Type + "'");
    if (CurMultiClass)
      PrintNote({}, "references to multiclass template arguments cannot be "
                    "resolved at this time");
    return nullptr;
  }
  ForeachListValue = dyn_cast<ListInit>(I);
  IterType = ForeachListValue->getElementType();
  break;
}
}

if (!Ranges.empty()) {
  assert(!IterType && "Type already initialized?")(static_cast <bool> (!IterType && "Type already initialized?"
) ? void (0) : __assert_fail ("!IterType && \"Type already initialized?\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 2263, __extension__ __PRETTY_FUNCTION__));
  IterType = IntRecTy::get();
  std::vector<Init*> Values;
  for (unsigned R : Ranges)
    Values.push_back(IntInit::get(R));
  ForeachListValue = ListInit::get(Values, IterType);
}

if (!IterType)
  return nullptr;

return VarInit::get(DeclName, IterType);
2275}

2277/// ParseTemplateArgList - Read a template argument list, which is a non-empty
2278/// sequence of template-declarations in <>'s.  If CurRec is non-null, these are
2279/// template args for a def, which may or may not be in a multiclass.  If null,
2280/// these are the template args for a multiclass.
2281///
2282///    TemplateArgList ::= '<' Declaration (',' Declaration)* '>'
2283///
2284bool TGParser::ParseTemplateArgList(Record *CurRec) {
assert(Lex.getCode() == tgtok::less && "Not a template arg list!")(static_cast <bool> (Lex.getCode() == tgtok::less &&
 "Not a template arg list!") ? void (0) : __assert_fail ("Lex.getCode() == tgtok::less && \"Not a template arg list!\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 2285, __extension__ __PRETTY_FUNCTION__));
Lex.Lex(); // eat the '<'

Record *TheRecToAddTo = CurRec ? CurRec : &CurMultiClass->Rec;

// Read the first declaration.
Init *TemplArg = ParseDeclaration(CurRec, true/*templateargs*/);
if (!TemplArg)
  return true;

TheRecToAddTo->addTemplateArg(TemplArg);

while (Lex.getCode() == tgtok::comma) {
  Lex.Lex(); // eat the ','

  // Read the following declarations.
  TemplArg = ParseDeclaration(CurRec, true/*templateargs*/);
  if (!TemplArg)
    return true;
  TheRecToAddTo->addTemplateArg(TemplArg);
}

if (Lex.getCode() != tgtok::greater)
  return TokError("expected '>' at end of template argument list");
Lex.Lex(); // eat the '>'.
return false;
2311}

2313/// ParseBodyItem - Parse a single item at within the body of a def or class.
2314///
2315///   BodyItem ::= Declaration ';'
2316///   BodyItem ::= LET ID OptionalBitList '=' Value ';'
2317bool TGParser::ParseBodyItem(Record *CurRec) {
if (Lex.getCode() != tgtok::Let) {
  if (!ParseDeclaration(CurRec, false))
    return true;

  if (Lex.getCode() != tgtok::semi)
    return TokError("expected ';' after declaration");
  Lex.Lex();
  return false;
}

// LET ID OptionalRangeList '=' Value ';'
if (Lex.Lex() != tgtok::Id)
  return TokError("expected field identifier after let");

SMLoc IdLoc = Lex.getLoc();
StringInit *FieldName = StringInit::get(Lex.getCurStrVal());
Lex.Lex();  // eat the field name.

SmallVector<unsigned, 16> BitList;
if (ParseOptionalBitList(BitList))
  return true;
std::reverse(BitList.begin(), BitList.end());

if (Lex.getCode() != tgtok::equal)
  return TokError("expected '=' in let expression");
Lex.Lex();  // eat the '='.

RecordVal *Field = CurRec->getValue(FieldName);
if (!Field)
  return TokError("Value '" + FieldName->getValue() + "' unknown!");

RecTy *Type = Field->getType();

Init *Val = ParseValue(CurRec, Type);
if (!Val) return true;

if (Lex.getCode() != tgtok::semi)
  return TokError("expected ';' after let expression");
Lex.Lex();

return SetValue(CurRec, IdLoc, FieldName, BitList, Val);
2359}

2361/// ParseBody - Read the body of a class or def.  Return true on error, false on
2362/// success.
2363///
2364///   Body     ::= ';'
2365///   Body     ::= '{' BodyList '}'
2366///   BodyList BodyItem*
2367///
2368bool TGParser::ParseBody(Record *CurRec) {
// If this is a null definition, just eat the semi and return.
if (Lex.getCode() == tgtok::semi) {
  Lex.Lex();
  return false;
}

if (Lex.getCode() != tgtok::l_brace)
  return TokError("Expected ';' or '{' to start body");
// Eat the '{'.
Lex.Lex();

while (Lex.getCode() != tgtok::r_brace)
  if (ParseBodyItem(CurRec))
    return true;

// Eat the '}'.
Lex.Lex();
return false;
2387}

2389/// \brief Apply the current let bindings to \a CurRec.
2390/// \returns true on error, false otherwise.
2391bool TGParser::ApplyLetStack(Record *CurRec) {
for (SmallVectorImpl<LetRecord> &LetInfo : LetStack)
  for (LetRecord &LR : LetInfo)
    if (SetValue(CurRec, LR.Loc, LR.Name, LR.Bits, LR.Value))
      return true;
return false;
2397}

2399/// ParseObjectBody - Parse the body of a def or class.  This consists of an
2400/// optional ClassList followed by a Body.  CurRec is the current def or class
2401/// that is being parsed.
2402///
2403///   ObjectBody      ::= BaseClassList Body
2404///   BaseClassList   ::= /*empty*/
2405///   BaseClassList   ::= ':' BaseClassListNE
2406///   BaseClassListNE ::= SubClassRef (',' SubClassRef)*
2407///
2408bool TGParser::ParseObjectBody(Record *CurRec) {
// If there is a baseclass list, read it.
if (Lex.getCode() == tgtok::colon) {
  Lex.Lex();

  // Read all of the subclasses.
  SubClassReference SubClass = ParseSubClassReference(CurRec, false);
  while (true) {
    // Check for error.
    if (!SubClass.Rec) return true;

    // Add it.
    if (AddSubClass(CurRec, SubClass))
      return true;

    if (Lex.getCode() != tgtok::comma) break;
    Lex.Lex(); // eat ','.
    SubClass = ParseSubClassReference(CurRec, false);
  }
}

if (ApplyLetStack(CurRec))
  return true;

return ParseBody(CurRec);
2433}

2435/// ParseDef - Parse and return a top level or multiclass def, return the record
2436/// corresponding to it.  This returns null on error.
2437///
2438///   DefInst ::= DEF ObjectName ObjectBody
2439///
2440bool TGParser::ParseDef(MultiClass *CurMultiClass) {
SMLoc DefLoc = Lex.getLoc();
assert(Lex.getCode() == tgtok::Def && "Unknown tok")(static_cast <bool> (Lex.getCode() == tgtok::Def &&
 "Unknown tok") ? void (0) : __assert_fail ("Lex.getCode() == tgtok::Def && \"Unknown tok\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 2442, __extension__ __PRETTY_FUNCTION__));
Lex.Lex();  // Eat the 'def' token.

// Parse ObjectName and make a record for it.
std::unique_ptr<Record> CurRec;
Init *Name = ParseObjectName(CurMultiClass);
if (!Name)
  return true;

if (isa<UnsetInit>(Name))
  CurRec = make_unique<Record>(Records.getNewAnonymousName(), DefLoc, Records,
                               /*Anonymous=*/true);
else
  CurRec = make_unique<Record>(Name, DefLoc, Records);

if (ParseObjectBody(CurRec.get()))
  return true;

return addDef(std::move(CurRec), nullptr);
2461}

2463/// ParseDefset - Parse a defset statement.
2464///
2465///   Defset ::= DEFSET Type Id '=' '{' ObjectList '}'
2466///
2467bool TGParser::ParseDefset() {
assert(Lex.getCode() == tgtok::Defset)(static_cast <bool> (Lex.getCode() == tgtok::Defset) ? void
 (0) : __assert_fail ("Lex.getCode() == tgtok::Defset", "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 2468, __extension__ __PRETTY_FUNCTION__));
Lex.Lex(); // Eat the 'defset' token

DefsetRecord Defset;
Defset.Loc = Lex.getLoc();
RecTy *Type = ParseType();
if (!Type)
  return true;
if (!isa<ListRecTy>(Type))
  return Error(Defset.Loc, "expected list type");
Defset.EltTy = cast<ListRecTy>(Type)->getElementType();

if (Lex.getCode() != tgtok::Id)
  return TokError("expected identifier");
StringInit *DeclName = StringInit::get(Lex.getCurStrVal());
if (Records.getGlobal(DeclName->getValue()))
  return TokError("def or global variable of this name already exists");

if (Lex.Lex() != tgtok::equal) // Eat the identifier
  return TokError("expected '='");
if (Lex.Lex() != tgtok::l_brace) // Eat the '='
  return TokError("expected '{'");
SMLoc BraceLoc = Lex.getLoc();
Lex.Lex(); // Eat the '{'

Defsets.push_back(&Defset);
bool Err = ParseObjectList(nullptr);
Defsets.pop_back();
if (Err)
  return true;

if (Lex.getCode() != tgtok::r_brace) {
  TokError("expected '}' at end of defset");
  return Error(BraceLoc, "to match this '{'");
}
Lex.Lex();  // Eat the '}'

Records.addExtraGlobal(DeclName->getValue(),
                       ListInit::get(Defset.Elements, Defset.EltTy));
return false;
2508}

2510/// ParseForeach - Parse a for statement.  Return the record corresponding
2511/// to it.  This returns true on error.
2512///
2513///   Foreach ::= FOREACH Declaration IN '{ ObjectList '}'
2514///   Foreach ::= FOREACH Declaration IN Object
2515///
2516bool TGParser::ParseForeach(MultiClass *CurMultiClass) {
assert(Lex.getCode() == tgtok::Foreach && "Unknown tok")(static_cast <bool> (Lex.getCode() == tgtok::Foreach &&
 "Unknown tok") ? void (0) : __assert_fail ("Lex.getCode() == tgtok::Foreach && \"Unknown tok\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 2517, __extension__ __PRETTY_FUNCTION__));
Lex.Lex();  // Eat the 'for' token.

// Make a temporary object to record items associated with the for
// loop.
ListInit *ListValue = nullptr;
VarInit *IterName = ParseForeachDeclaration(ListValue);
if (!IterName)
  return TokError("expected declaration in for");

if (Lex.getCode() != tgtok::In)
  return TokError("Unknown tok");
Lex.Lex();  // Eat the in

// Create a loop object and remember it.
Loops.push_back(ForeachLoop(IterName, ListValue));

if (Lex.getCode() != tgtok::l_brace) {
  // FOREACH Declaration IN Object
  if (ParseObject(CurMultiClass))
    return true;
} else {
  SMLoc BraceLoc = Lex.getLoc();
  // Otherwise, this is a group foreach.
  Lex.Lex();  // eat the '{'.

  // Parse the object list.
  if (ParseObjectList(CurMultiClass))
    return true;

  if (Lex.getCode() != tgtok::r_brace) {
    TokError("expected '}' at end of foreach command");
    return Error(BraceLoc, "to match this '{'");
  }
  Lex.Lex();  // Eat the }
}

// We've processed everything in this loop.
Loops.pop_back();

return false;
2558}

2560/// ParseClass - Parse a tblgen class definition.
2561///
2562///   ClassInst ::= CLASS ID TemplateArgList? ObjectBody
2563///
2564bool TGParser::ParseClass() {
assert(Lex.getCode() == tgtok::Class && "Unexpected token!")(static_cast <bool> (Lex.getCode() == tgtok::Class &&
 "Unexpected token!") ? void (0) : __assert_fail ("Lex.getCode() == tgtok::Class && \"Unexpected token!\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 2565, __extension__ __PRETTY_FUNCTION__));
Lex.Lex();

if (Lex.getCode() != tgtok::Id)
9
←
Assuming the condition is false→
10
←
Taking false branch→
  return TokError("expected class name after 'class' keyword");

Record *CurRec = Records.getClass(Lex.getCurStrVal());
if (CurRec) {
11
←
Taking false branch→
  // If the body was previously defined, this is an error.
  if (CurRec->getValues().size() > 1 ||  // Account for NAME.
      !CurRec->getSuperClasses().empty() ||
      !CurRec->getTemplateArgs().empty())
    return TokError("Class '" + CurRec->getNameInitAsString() +
                    "' already defined");
} else {
  // If this is the first reference to this class, create and add it.
  auto NewRec =
      llvm::make_unique<Record>(Lex.getCurStrVal(), Lex.getLoc(), Records);
12
←
Calling 'make_unique'→
14
←
Returned allocated memory→
  CurRec = NewRec.get();
  Records.addClass(std::move(NewRec));
15
←
Calling '~unique_ptr'→
20
←
Returning from '~unique_ptr'→
}
Lex.Lex(); // eat the name.

// If there are template args, parse them.
if (Lex.getCode() == tgtok::less)
21
←
Assuming the condition is true→
22
←
Taking true branch→
  if (ParseTemplateArgList(CurRec))
23
←
Use of memory after it is freed
    return true;

// Finally, parse the object body.
return ParseObjectBody(CurRec);
2595}

2597/// ParseLetList - Parse a non-empty list of assignment expressions into a list
2598/// of LetRecords.
2599///
2600///   LetList ::= LetItem (',' LetItem)*
2601///   LetItem ::= ID OptionalRangeList '=' Value
2602///
2603void TGParser::ParseLetList(SmallVectorImpl<LetRecord> &Result) {
while (true) {
  if (Lex.getCode() != tgtok::Id) {
    TokError("expected identifier in let definition");
    Result.clear();
    return;
  }

  StringInit *Name = StringInit::get(Lex.getCurStrVal());
  SMLoc NameLoc = Lex.getLoc();
  Lex.Lex();  // Eat the identifier.

  // Check for an optional RangeList.
  SmallVector<unsigned, 16> Bits;
  if (ParseOptionalRangeList(Bits)) {
    Result.clear();
    return;
  }
  std::reverse(Bits.begin(), Bits.end());

  if (Lex.getCode() != tgtok::equal) {
    TokError("expected '=' in let expression");
    Result.clear();
    return;
  }
  Lex.Lex();  // eat the '='.

  Init *Val = ParseValue(nullptr);
  if (!Val) {
    Result.clear();
    return;
  }

  // Now that we have everything, add the record.
  Result.emplace_back(Name, Bits, Val, NameLoc);

  if (Lex.getCode() != tgtok::comma)
    return;
  Lex.Lex();  // eat the comma.
}
2643}

2645/// ParseTopLevelLet - Parse a 'let' at top level.  This can be a couple of
2646/// different related productions. This works inside multiclasses too.
2647///
2648///   Object ::= LET LetList IN '{' ObjectList '}'
2649///   Object ::= LET LetList IN Object
2650///
2651bool TGParser::ParseTopLevelLet(MultiClass *CurMultiClass) {
assert(Lex.getCode() == tgtok::Let && "Unexpected token")(static_cast <bool> (Lex.getCode() == tgtok::Let &&
 "Unexpected token") ? void (0) : __assert_fail ("Lex.getCode() == tgtok::Let && \"Unexpected token\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 2652, __extension__ __PRETTY_FUNCTION__));
Lex.Lex();

// Add this entry to the let stack.
SmallVector<LetRecord, 8> LetInfo;
ParseLetList(LetInfo);
if (LetInfo.empty()) return true;
LetStack.push_back(std::move(LetInfo));

if (Lex.getCode() != tgtok::In)
  return TokError("expected 'in' at end of top-level 'let'");
Lex.Lex();

// If this is a scalar let, just handle it now
if (Lex.getCode() != tgtok::l_brace) {
  // LET LetList IN Object
  if (ParseObject(CurMultiClass))
    return true;
} else {   // Object ::= LETCommand '{' ObjectList '}'
  SMLoc BraceLoc = Lex.getLoc();
  // Otherwise, this is a group let.
  Lex.Lex();  // eat the '{'.

  // Parse the object list.
  if (ParseObjectList(CurMultiClass))
    return true;

  if (Lex.getCode() != tgtok::r_brace) {
    TokError("expected '}' at end of top level let command");
    return Error(BraceLoc, "to match this '{'");
  }
  Lex.Lex();
}

// Outside this let scope, this let block is not active.
LetStack.pop_back();
return false;
2689}

2691/// ParseMultiClass - Parse a multiclass definition.
2692///
2693///  MultiClassInst ::= MULTICLASS ID TemplateArgList?
2694///                     ':' BaseMultiClassList '{' MultiClassObject+ '}'
2695///  MultiClassObject ::= DefInst
2696///  MultiClassObject ::= MultiClassInst
2697///  MultiClassObject ::= DefMInst
2698///  MultiClassObject ::= LETCommand '{' ObjectList '}'
2699///  MultiClassObject ::= LETCommand Object
2700///
2701bool TGParser::ParseMultiClass() {
assert(Lex.getCode() == tgtok::MultiClass && "Unexpected token")(static_cast <bool> (Lex.getCode() == tgtok::MultiClass
 && "Unexpected token") ? void (0) : __assert_fail ("Lex.getCode() == tgtok::MultiClass && \"Unexpected token\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 2702, __extension__ __PRETTY_FUNCTION__));
Lex.Lex();  // Eat the multiclass token.

if (Lex.getCode() != tgtok::Id)
  return TokError("expected identifier after multiclass for name");
std::string Name = Lex.getCurStrVal();

auto Result =
  MultiClasses.insert(std::make_pair(Name,
                  llvm::make_unique<MultiClass>(Name, Lex.getLoc(),Records)));

if (!Result.second)
  return TokError("multiclass '" + Name + "' already defined");

CurMultiClass = Result.first->second.get();
Lex.Lex();  // Eat the identifier.

// If there are template args, parse them.
if (Lex.getCode() == tgtok::less)
  if (ParseTemplateArgList(nullptr))
    return true;

bool inherits = false;

// If there are submulticlasses, parse them.
if (Lex.getCode() == tgtok::colon) {
  inherits = true;

  Lex.Lex();

  // Read all of the submulticlasses.
  SubMultiClassReference SubMultiClass =
    ParseSubMultiClassReference(CurMultiClass);
  while (true) {
    // Check for error.
    if (!SubMultiClass.MC) return true;

    // Add it.
    if (AddSubMultiClass(CurMultiClass, SubMultiClass))
      return true;

    if (Lex.getCode() != tgtok::comma) break;
    Lex.Lex(); // eat ','.
    SubMultiClass = ParseSubMultiClassReference(CurMultiClass);
  }
}

if (Lex.getCode() != tgtok::l_brace) {
  if (!inherits)
    return TokError("expected '{' in multiclass definition");
  if (Lex.getCode() != tgtok::semi)
    return TokError("expected ';' in multiclass definition");
  Lex.Lex();  // eat the ';'.
} else {
  if (Lex.Lex() == tgtok::r_brace)  // eat the '{'.
    return TokError("multiclass must contain at least one def");

  while (Lex.getCode() != tgtok::r_brace) {
    switch (Lex.getCode()) {
    default:
      return TokError("expected 'let', 'def', 'defm' or 'foreach' in "
                      "multiclass body");
    case tgtok::Let:
    case tgtok::Def:
    case tgtok::Defm:
    case tgtok::Foreach:
      if (ParseObject(CurMultiClass))
        return true;
      break;
    }
  }
  Lex.Lex();  // eat the '}'.
}

CurMultiClass = nullptr;
return false;
2778}

2780/// ParseDefm - Parse the instantiation of a multiclass.
2781///
2782///   DefMInst ::= DEFM ID ':' DefmSubClassRef ';'
2783///
2784bool TGParser::ParseDefm(MultiClass *CurMultiClass) {
assert(Lex.getCode() == tgtok::Defm && "Unexpected token!")(static_cast <bool> (Lex.getCode() == tgtok::Defm &&
 "Unexpected token!") ? void (0) : __assert_fail ("Lex.getCode() == tgtok::Defm && \"Unexpected token!\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 2785, __extension__ __PRETTY_FUNCTION__));
Lex.Lex(); // eat the defm

Init *DefmName = ParseObjectName(CurMultiClass);
if (!DefmName)
  return true;
if (isa<UnsetInit>(DefmName))
  DefmName = Records.getNewAnonymousName();

if (Lex.getCode() != tgtok::colon)
  return TokError("expected ':' after defm identifier");

// Keep track of the new generated record definitions.
SmallVector<std::unique_ptr<Record>, 8> NewRecDefs;

// This record also inherits from a regular class (non-multiclass)?
bool InheritFromClass = false;

// eat the colon.
Lex.Lex();

SMLoc SubClassLoc = Lex.getLoc();
SubClassReference Ref = ParseSubClassReference(nullptr, true);

while (true) {
  if (!Ref.Rec) return true;

  // To instantiate a multiclass, we need to first get the multiclass, then
  // instantiate each def contained in the multiclass with the SubClassRef
  // template parameters.
  MultiClass *MC = MultiClasses[Ref.Rec->getName()].get();
  assert(MC && "Didn't lookup multiclass correctly?")(static_cast <bool> (MC && "Didn't lookup multiclass correctly?"
) ? void (0) : __assert_fail ("MC && \"Didn't lookup multiclass correctly?\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/TGParser.cpp"
, 2816, __extension__ __PRETTY_FUNCTION__));
  ArrayRef<Init*> TemplateVals = Ref.TemplateArgs;

  // Verify that the correct number of template arguments were specified.
  ArrayRef<Init *> TArgs = MC->Rec.getTemplateArgs();
  if (TArgs.size() < TemplateVals.size())
    return Error(SubClassLoc,
                 "more template args specified than multiclass expects");

  DenseMap<Init *, Init *> TemplateArgs;
  for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
    if (i < TemplateVals.size()) {
      TemplateArgs.insert({TArgs[i], TemplateVals[i]});
    } else {
      Init *Default = MC->Rec.getValue(TArgs[i])->getValue();
      if (!Default->isComplete()) {
        return Error(SubClassLoc,
                     "value not specified for template argument #" +
                         Twine(i) + " (" + TArgs[i]->getAsUnquotedString() +
                         ") of multiclass '" + MC->Rec.getNameInitAsString() +
                         "'");
      }
      TemplateArgs.insert({TArgs[i], Default});
    }
  }

  // Loop over all the def's in the multiclass, instantiating each one.
  for (const std::unique_ptr<Record> &DefProto : MC->DefPrototypes) {
    bool ResolveName = true;
    auto CurRec = make_unique<Record>(*DefProto);
    CurRec->appendLoc(SubClassLoc);

    if (StringInit *NameString =
            dyn_cast<StringInit>(CurRec->getNameInit())) {
      // We have a fully expanded string so there are no operators to
      // resolve.  We should concatenate the given prefix and name.
      //
      // TODO: This MUST happen before template argument resolution. This
      //       does not make sense and should be changed, but at the time of
      //       writing, there are existing .td files which rely on this
      //       implementation detail. It's a bad idea and should be fixed.
      //       See test/TableGen/name-resolution-consistency.td for some
      //       examples.
      CurRec->setName(BinOpInit::getStrConcat(DefmName, NameString));
      ResolveName = false;
    }

    MapResolver R(CurRec.get());

    if (ResolveName) {
      // If the proto's name wasn't resolved, we probably have a reference to
      // NAME and need to replace it.
      //
      // TODO: Whether the name is resolved is basically determined by magic.
      //       Unfortunately, existing .td files depend on it.
      R.set(StringInit::get("NAME"), DefmName);
    }

    for (const auto &TArg : TemplateArgs)
      R.set(TArg.first, TArg.second);

    CurRec->resolveReferences(R);

    NewRecDefs.emplace_back(std::move(CurRec));
  }

  if (Lex.getCode() != tgtok::comma) break;
  Lex.Lex(); // eat ','.

  if (Lex.getCode() != tgtok::Id)
    return TokError("expected identifier");

  SubClassLoc = Lex.getLoc();

  // A defm can inherit from regular classes (non-multiclass) as
  // long as they come in the end of the inheritance list.
  InheritFromClass = (Records.getClass(Lex.getCurStrVal()) != nullptr);

  if (InheritFromClass)
    break;

  Ref = ParseSubClassReference(nullptr, true);
}

if (InheritFromClass) {
  // Process all the classes to inherit as if they were part of a
  // regular 'def' and inherit all record values.
  SubClassReference SubClass = ParseSubClassReference(nullptr, false);
  while (true) {
    // Check for error.
    if (!SubClass.Rec) return true;

    // Get the expanded definition prototypes and teach them about
    // the record values the current class to inherit has
    for (const auto &CurRec : NewRecDefs) {
      // Add it.
      if (AddSubClass(CurRec.get(), SubClass))
        return true;
    }

    if (Lex.getCode() != tgtok::comma) break;
    Lex.Lex(); // eat ','.
    SubClass = ParseSubClassReference(nullptr, false);
  }
}

for (auto &CurRec : NewRecDefs) {
  if (ApplyLetStack(CurRec.get()))
    return true;

  addDef(std::move(CurRec), DefmName);
}

if (Lex.getCode() != tgtok::semi)
  return TokError("expected ';' at end of defm");
Lex.Lex();

return false;
2934}

2936/// ParseObject
2937///   Object ::= ClassInst
2938///   Object ::= DefInst
2939///   Object ::= MultiClassInst
2940///   Object ::= DefMInst
2941///   Object ::= LETCommand '{' ObjectList '}'
2942///   Object ::= LETCommand Object
2943bool TGParser::ParseObject(MultiClass *MC) {
switch (Lex.getCode()) {
4
←
Control jumps to 'case Class:'  at line 2956→
default:
  return TokError("Expected class, def, defm, defset, multiclass, let or "
                  "foreach");
case tgtok::Let:   return ParseTopLevelLet(MC);
case tgtok::Def:   return ParseDef(MC);
case tgtok::Foreach:   return ParseForeach(MC);
case tgtok::Defm:  return ParseDefm(MC);
case tgtok::Defset:
  if (MC)
    return TokError("defset is not allowed inside multiclass");
  return ParseDefset();
case tgtok::Class:
  if (MC)
5
←
Taking false branch→
    return TokError("class is not allowed inside multiclass");
  if (!Loops.empty())
6
←
Assuming the condition is false→
7
←
Taking false branch→
    return TokError("class is not allowed inside foreach loop");
  return ParseClass();
8
←
Calling 'TGParser::ParseClass'→
case tgtok::MultiClass:
  if (!Loops.empty())
    return TokError("multiclass is not allowed inside foreach loop");
  return ParseMultiClass();
}
2967}

2969/// ParseObjectList
2970///   ObjectList :== Object*
2971bool TGParser::ParseObjectList(MultiClass *MC) {
while (isObjectStart(Lex.getCode())) {
2
←
Loop condition is true.  Entering loop body→
  if (ParseObject(MC))
3
←
Calling 'TGParser::ParseObject'→
    return true;
}
return false;
2977}

2979bool TGParser::ParseFile() {
Lex.Lex(); // Prime the lexer.
if (ParseObjectList()) return true;
1
Calling 'TGParser::ParseObjectList'→

// If we have unread input at the end of the file, report it.
if (Lex.getCode() == tgtok::Eof)
  return false;

return TokError("Unexpected input at top level");
2988}

←

/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)...));
13
←
Memory is allocated→
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

←

/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;
18
←
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)
16
←
Taking true branch→
 get_deleter()(__ptr);
17
←
Calling 'default_delete::operator()'→
19
←
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 */