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

Bug Summary

File:	lib/TableGen/Record.cpp
Warning:	line 1605, column 11 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 Record.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/Record.cpp

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

→

1//===- Record.cpp - Record implementation ---------------------------------===//
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 tablegen record classes.
11//
12//===----------------------------------------------------------------------===//

14#include "llvm/ADT/ArrayRef.h"
15#include "llvm/ADT/DenseMap.h"
16#include "llvm/ADT/FoldingSet.h"
17#include "llvm/ADT/SmallString.h"
18#include "llvm/ADT/SmallVector.h"
19#include "llvm/ADT/StringExtras.h"
20#include "llvm/ADT/StringMap.h"
21#include "llvm/ADT/StringRef.h"
22#include "llvm/Support/Allocator.h"
23#include "llvm/Support/Casting.h"
24#include "llvm/Support/Compiler.h"
25#include "llvm/Support/ErrorHandling.h"
26#include "llvm/Support/SMLoc.h"
27#include "llvm/Support/raw_ostream.h"
28#include "llvm/TableGen/Error.h"
29#include "llvm/TableGen/Record.h"
30#include <cassert>
31#include <cstdint>
32#include <memory>
33#include <string>
34#include <utility>
35#include <vector>

37using namespace llvm;

39static BumpPtrAllocator Allocator;

41//===----------------------------------------------------------------------===//
42//    Type implementations
43//===----------------------------------------------------------------------===//

45BitRecTy BitRecTy::Shared;
46CodeRecTy CodeRecTy::Shared;
47IntRecTy IntRecTy::Shared;
48StringRecTy StringRecTy::Shared;
49DagRecTy DagRecTy::Shared;

51#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
52LLVM_DUMP_METHOD__attribute__((noinline)) __attribute__((__used__)) void RecTy::dump() const { print(errs()); }
53#endif

55ListRecTy *RecTy::getListTy() {
if (!ListTy)
  ListTy = new(Allocator) ListRecTy(this);
return ListTy;
59}

61bool RecTy::typeIsConvertibleTo(const RecTy *RHS) const {
assert(RHS && "NULL pointer")(static_cast <bool> (RHS && "NULL pointer") ? void
 (0) : __assert_fail ("RHS && \"NULL pointer\"", "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 62, __extension__ __PRETTY_FUNCTION__));
return Kind == RHS->getRecTyKind();
64}

66bool RecTy::typeIsA(const RecTy *RHS) const { return this == RHS; }

68bool BitRecTy::typeIsConvertibleTo(const RecTy *RHS) const{
if (RecTy::typeIsConvertibleTo(RHS) || RHS->getRecTyKind() == IntRecTyKind)
  return true;
if (const BitsRecTy *BitsTy = dyn_cast<BitsRecTy>(RHS))
  return BitsTy->getNumBits() == 1;
return false;
74}

76BitsRecTy *BitsRecTy::get(unsigned Sz) {
static std::vector<BitsRecTy*> Shared;
if (Sz >= Shared.size())
  Shared.resize(Sz + 1);
BitsRecTy *&Ty = Shared[Sz];
if (!Ty)
  Ty = new(Allocator) BitsRecTy(Sz);
return Ty;
84}

86std::string BitsRecTy::getAsString() const {
return "bits<" + utostr(Size) + ">";
88}

90bool BitsRecTy::typeIsConvertibleTo(const RecTy *RHS) const {
if (RecTy::typeIsConvertibleTo(RHS)) //argument and the sender are same type
  return cast<BitsRecTy>(RHS)->Size == Size;
RecTyKind kind = RHS->getRecTyKind();
return (kind == BitRecTyKind && Size == 1) || (kind == IntRecTyKind);
95}

97bool BitsRecTy::typeIsA(const RecTy *RHS) const {
if (const BitsRecTy *RHSb = dyn_cast<BitsRecTy>(RHS))
  return RHSb->Size == Size;
return false;
101}

103bool IntRecTy::typeIsConvertibleTo(const RecTy *RHS) const {
RecTyKind kind = RHS->getRecTyKind();
return kind==BitRecTyKind || kind==BitsRecTyKind || kind==IntRecTyKind;
106}

108bool CodeRecTy::typeIsConvertibleTo(const RecTy *RHS) const {
RecTyKind Kind = RHS->getRecTyKind();
return Kind == CodeRecTyKind || Kind == StringRecTyKind;
111}

113std::string StringRecTy::getAsString() const {
return "string";
115}

117bool StringRecTy::typeIsConvertibleTo(const RecTy *RHS) const {
RecTyKind Kind = RHS->getRecTyKind();
return Kind == StringRecTyKind || Kind == CodeRecTyKind;
120}

122std::string ListRecTy::getAsString() const {
return "list<" + Ty->getAsString() + ">";
124}

126bool ListRecTy::typeIsConvertibleTo(const RecTy *RHS) const {
if (const auto *ListTy = dyn_cast<ListRecTy>(RHS))
  return Ty->typeIsConvertibleTo(ListTy->getElementType());
return false;
130}

132bool ListRecTy::typeIsA(const RecTy *RHS) const {
if (const ListRecTy *RHSl = dyn_cast<ListRecTy>(RHS))
  return getElementType()->typeIsA(RHSl->getElementType());
return false;
136}

138std::string DagRecTy::getAsString() const {
return "dag";
140}

142static void ProfileRecordRecTy(FoldingSetNodeID &ID,
                             ArrayRef<Record *> Classes) {
ID.AddInteger(Classes.size());
for (Record *R : Classes)
  ID.AddPointer(R);
147}

149RecordRecTy *RecordRecTy::get(ArrayRef<Record *> UnsortedClasses) {
if (UnsortedClasses.empty()) {
  static RecordRecTy AnyRecord(0);
  return &AnyRecord;
}

FoldingSet<RecordRecTy> &ThePool =
    UnsortedClasses[0]->getRecords().RecordTypePool;

SmallVector<Record *, 4> Classes(UnsortedClasses.begin(),
                                 UnsortedClasses.end());
llvm::sort(Classes.begin(), Classes.end(),
           [](Record *LHS, Record *RHS) {
             return LHS->getNameInitAsString() < RHS->getNameInitAsString();
           });

FoldingSetNodeID ID;
ProfileRecordRecTy(ID, Classes);

void *IP = nullptr;
if (RecordRecTy *Ty = ThePool.FindNodeOrInsertPos(ID, IP))
  return Ty;

172#ifndef NDEBUG
// Check for redundancy.
for (unsigned i = 0; i < Classes.size(); ++i) {
  for (unsigned j = 0; j < Classes.size(); ++j) {
    assert(i == j || !Classes[i]->isSubClassOf(Classes[j]))(static_cast <bool> (i == j || !Classes[i]->isSubClassOf
(Classes[j])) ? void (0) : __assert_fail ("i == j || !Classes[i]->isSubClassOf(Classes[j])"
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 176, __extension__ __PRETTY_FUNCTION__));
  }
  assert(&Classes[0]->getRecords() == &Classes[i]->getRecords())(static_cast <bool> (&Classes[0]->getRecords() ==
 &Classes[i]->getRecords()) ? void (0) : __assert_fail
 ("&Classes[0]->getRecords() == &Classes[i]->getRecords()"
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 178, __extension__ __PRETTY_FUNCTION__));
}
180#endif

void *Mem = Allocator.Allocate(totalSizeToAlloc<Record *>(Classes.size()),
                               alignof(RecordRecTy));
RecordRecTy *Ty = new(Mem) RecordRecTy(Classes.size());
std::uninitialized_copy(Classes.begin(), Classes.end(),
                        Ty->getTrailingObjects<Record *>());
ThePool.InsertNode(Ty, IP);
return Ty;
189}

191void RecordRecTy::Profile(FoldingSetNodeID &ID) const {
ProfileRecordRecTy(ID, getClasses());
193}

195std::string RecordRecTy::getAsString() const {
if (NumClasses == 1)
  return getClasses()[0]->getNameInitAsString();

std::string Str = "{";
bool First = true;
for (Record *R : getClasses()) {
  if (!First)
    Str += ", ";
  First = false;
  Str += R->getNameInitAsString();
}
Str += "}";
return Str;
209}

211bool RecordRecTy::isSubClassOf(Record *Class) const {
return llvm::any_of(getClasses(), [Class](Record *MySuperClass) {
                                    return MySuperClass == Class ||
                                           MySuperClass->isSubClassOf(Class);
                                  });
216}

218bool RecordRecTy::typeIsConvertibleTo(const RecTy *RHS) const {
if (this == RHS)
  return true;

const RecordRecTy *RTy = dyn_cast<RecordRecTy>(RHS);
if (!RTy)
  return false;

return llvm::all_of(RTy->getClasses(), [this](Record *TargetClass) {
                                         return isSubClassOf(TargetClass);
                                       });
229}

231bool RecordRecTy::typeIsA(const RecTy *RHS) const {
return typeIsConvertibleTo(RHS);
233}

235static RecordRecTy *resolveRecordTypes(RecordRecTy *T1, RecordRecTy *T2) {
SmallVector<Record *, 4> CommonSuperClasses;
SmallVector<Record *, 4> Stack;

Stack.insert(Stack.end(), T1->classes_begin(), T1->classes_end());

while (!Stack.empty()) {
  Record *R = Stack.back();
  Stack.pop_back();

  if (T2->isSubClassOf(R)) {
    CommonSuperClasses.push_back(R);
  } else {
    R->getDirectSuperClasses(Stack);
  }
}

return RecordRecTy::get(CommonSuperClasses);
253}

255RecTy *llvm::resolveTypes(RecTy *T1, RecTy *T2) {
if (T1 == T2)
  return T1;

if (RecordRecTy *RecTy1 = dyn_cast<RecordRecTy>(T1)) {
  if (RecordRecTy *RecTy2 = dyn_cast<RecordRecTy>(T2))
    return resolveRecordTypes(RecTy1, RecTy2);
}

if (T1->typeIsConvertibleTo(T2))
  return T2;
if (T2->typeIsConvertibleTo(T1))
  return T1;

if (ListRecTy *ListTy1 = dyn_cast<ListRecTy>(T1)) {
  if (ListRecTy *ListTy2 = dyn_cast<ListRecTy>(T2)) {
    RecTy* NewType = resolveTypes(ListTy1->getElementType(),
                                  ListTy2->getElementType());
    if (NewType)
      return NewType->getListTy();
  }
}

return nullptr;
279}

281//===----------------------------------------------------------------------===//
282//    Initializer implementations
283//===----------------------------------------------------------------------===//

285void Init::anchor() {}

287#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
288LLVM_DUMP_METHOD__attribute__((noinline)) __attribute__((__used__)) void Init::dump() const { return print(errs()); }
289#endif

291UnsetInit *UnsetInit::get() {
static UnsetInit TheInit;
return &TheInit;
294}

296Init *UnsetInit::getCastTo(RecTy *Ty) const {
return const_cast<UnsetInit *>(this);
298}

300Init *UnsetInit::convertInitializerTo(RecTy *Ty) const {
return const_cast<UnsetInit *>(this);
302}

304BitInit *BitInit::get(bool V) {
static BitInit True(true);
static BitInit False(false);

return V ? &True : &False;
309}

311Init *BitInit::convertInitializerTo(RecTy *Ty) const {
if (isa<BitRecTy>(Ty))
  return const_cast<BitInit *>(this);

if (isa<IntRecTy>(Ty))
  return IntInit::get(getValue());

if (auto *BRT = dyn_cast<BitsRecTy>(Ty)) {
  // Can only convert single bit.
  if (BRT->getNumBits() == 1)
    return BitsInit::get(const_cast<BitInit *>(this));
}

return nullptr;
325}

327static void
328ProfileBitsInit(FoldingSetNodeID &ID, ArrayRef<Init *> Range) {
ID.AddInteger(Range.size());

for (Init *I : Range)
  ID.AddPointer(I);
333}

335BitsInit *BitsInit::get(ArrayRef<Init *> Range) {
static FoldingSet<BitsInit> ThePool;

FoldingSetNodeID ID;
ProfileBitsInit(ID, Range);

void *IP = nullptr;
if (BitsInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *>(Range.size()),
                               alignof(BitsInit));
BitsInit *I = new(Mem) BitsInit(Range.size());
std::uninitialized_copy(Range.begin(), Range.end(),
                        I->getTrailingObjects<Init *>());
ThePool.InsertNode(I, IP);
return I;
352}

354void BitsInit::Profile(FoldingSetNodeID &ID) const {
ProfileBitsInit(ID, makeArrayRef(getTrailingObjects<Init *>(), NumBits));
356}

358Init *BitsInit::convertInitializerTo(RecTy *Ty) const {
if (isa<BitRecTy>(Ty)) {
  if (getNumBits() != 1) return nullptr; // Only accept if just one bit!
  return getBit(0);
}

if (auto *BRT = dyn_cast<BitsRecTy>(Ty)) {
  // If the number of bits is right, return it.  Otherwise we need to expand
  // or truncate.
  if (getNumBits() != BRT->getNumBits()) return nullptr;
  return const_cast<BitsInit *>(this);
}

if (isa<IntRecTy>(Ty)) {
  int64_t Result = 0;
  for (unsigned i = 0, e = getNumBits(); i != e; ++i)
    if (auto *Bit = dyn_cast<BitInit>(getBit(i)))
      Result |= static_cast<int64_t>(Bit->getValue()) << i;
    else
      return nullptr;
  return IntInit::get(Result);
}

return nullptr;
382}

384Init *
385BitsInit::convertInitializerBitRange(ArrayRef<unsigned> Bits) const {
SmallVector<Init *, 16> NewBits(Bits.size());

for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
  if (Bits[i] >= getNumBits())
    return nullptr;
  NewBits[i] = getBit(Bits[i]);
}
return BitsInit::get(NewBits);
394}

396bool BitsInit::isConcrete() const {
for (unsigned i = 0, e = getNumBits(); i != e; ++i) {
  if (!getBit(i)->isConcrete())
    return false;
}
return true;
402}

404std::string BitsInit::getAsString() const {
std::string Result = "{ ";
for (unsigned i = 0, e = getNumBits(); i != e; ++i) {
  if (i) Result += ", ";
  if (Init *Bit = getBit(e-i-1))
    Result += Bit->getAsString();
  else
    Result += "*";
}
return Result + " }";
414}

416// resolveReferences - If there are any field references that refer to fields
417// that have been filled in, we can propagate the values now.
418Init *BitsInit::resolveReferences(Resolver &R) const {
bool Changed = false;
SmallVector<Init *, 16> NewBits(getNumBits());

Init *CachedBitVarRef = nullptr;
Init *CachedBitVarResolved = nullptr;

for (unsigned i = 0, e = getNumBits(); i != e; ++i) {
  Init *CurBit = getBit(i);
  Init *NewBit = CurBit;

  if (VarBitInit *CurBitVar = dyn_cast<VarBitInit>(CurBit)) {
    if (CurBitVar->getBitVar() != CachedBitVarRef) {
      CachedBitVarRef = CurBitVar->getBitVar();
      CachedBitVarResolved = CachedBitVarRef->resolveReferences(R);
    }

    NewBit = CachedBitVarResolved->getBit(CurBitVar->getBitNum());
  } else {
    // getBit(0) implicitly converts int and bits<1> values to bit.
    NewBit = CurBit->resolveReferences(R)->getBit(0);
  }

  if (isa<UnsetInit>(NewBit) && R.keepUnsetBits())
    NewBit = CurBit;
  NewBits[i] = NewBit;
  Changed |= CurBit != NewBit;
}

if (Changed)
  return BitsInit::get(NewBits);

return const_cast<BitsInit *>(this);
451}

453IntInit *IntInit::get(int64_t V) {
static DenseMap<int64_t, IntInit*> ThePool;

IntInit *&I = ThePool[V];
if (!I) I = new(Allocator) IntInit(V);
return I;
459}

461std::string IntInit::getAsString() const {
return itostr(Value);
463}

465static bool canFitInBitfield(int64_t Value, unsigned NumBits) {
// For example, with NumBits == 4, we permit Values from [-7 .. 15].
return (NumBits >= sizeof(Value) * 8) ||
       (Value >> NumBits == 0) || (Value >> (NumBits-1) == -1);
469}

471Init *IntInit::convertInitializerTo(RecTy *Ty) const {
if (isa<IntRecTy>(Ty))
  return const_cast<IntInit *>(this);

if (isa<BitRecTy>(Ty)) {
  int64_t Val = getValue();
  if (Val != 0 && Val != 1) return nullptr;  // Only accept 0 or 1 for a bit!
  return BitInit::get(Val != 0);
}

if (auto *BRT = dyn_cast<BitsRecTy>(Ty)) {
  int64_t Value = getValue();
  // Make sure this bitfield is large enough to hold the integer value.
  if (!canFitInBitfield(Value, BRT->getNumBits()))
    return nullptr;

  SmallVector<Init *, 16> NewBits(BRT->getNumBits());
  for (unsigned i = 0; i != BRT->getNumBits(); ++i)
    NewBits[i] = BitInit::get(Value & (1LL << i));

  return BitsInit::get(NewBits);
}

return nullptr;
495}

497Init *
498IntInit::convertInitializerBitRange(ArrayRef<unsigned> Bits) const {
SmallVector<Init *, 16> NewBits(Bits.size());

for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
  if (Bits[i] >= 64)
    return nullptr;

  NewBits[i] = BitInit::get(Value & (INT64_C(1)1L << Bits[i]));
}
return BitsInit::get(NewBits);
508}

510CodeInit *CodeInit::get(StringRef V) {
static StringMap<CodeInit*, BumpPtrAllocator &> ThePool(Allocator);

auto &Entry = *ThePool.insert(std::make_pair(V, nullptr)).first;
if (!Entry.second)
  Entry.second = new(Allocator) CodeInit(Entry.getKey());
return Entry.second;
517}

519StringInit *StringInit::get(StringRef V) {
static StringMap<StringInit*, BumpPtrAllocator &> ThePool(Allocator);

auto &Entry = *ThePool.insert(std::make_pair(V, nullptr)).first;
if (!Entry.second)
  Entry.second = new(Allocator) StringInit(Entry.getKey());
return Entry.second;
526}

528Init *StringInit::convertInitializerTo(RecTy *Ty) const {
if (isa<StringRecTy>(Ty))
  return const_cast<StringInit *>(this);
if (isa<CodeRecTy>(Ty))
  return CodeInit::get(getValue());

return nullptr;
535}

537Init *CodeInit::convertInitializerTo(RecTy *Ty) const {
if (isa<CodeRecTy>(Ty))
  return const_cast<CodeInit *>(this);
if (isa<StringRecTy>(Ty))
  return StringInit::get(getValue());

return nullptr;
544}

546static void ProfileListInit(FoldingSetNodeID &ID,
                          ArrayRef<Init *> Range,
                          RecTy *EltTy) {
ID.AddInteger(Range.size());
ID.AddPointer(EltTy);

for (Init *I : Range)
  ID.AddPointer(I);
554}

556ListInit *ListInit::get(ArrayRef<Init *> Range, RecTy *EltTy) {
static FoldingSet<ListInit> ThePool;

FoldingSetNodeID ID;
ProfileListInit(ID, Range, EltTy);

void *IP = nullptr;
if (ListInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

assert(Range.empty() || !isa<TypedInit>(Range[0]) ||(static_cast <bool> (Range.empty() || !isa<TypedInit
>(Range[0]) || cast<TypedInit>(Range[0])->getType
()->typeIsConvertibleTo(EltTy)) ? void (0) : __assert_fail
 ("Range.empty() || !isa<TypedInit>(Range[0]) || cast<TypedInit>(Range[0])->getType()->typeIsConvertibleTo(EltTy)"
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 567, __extension__ __PRETTY_FUNCTION__))
       cast<TypedInit>(Range[0])->getType()->typeIsConvertibleTo(EltTy))(static_cast <bool> (Range.empty() || !isa<TypedInit
>(Range[0]) || cast<TypedInit>(Range[0])->getType
()->typeIsConvertibleTo(EltTy)) ? void (0) : __assert_fail
 ("Range.empty() || !isa<TypedInit>(Range[0]) || cast<TypedInit>(Range[0])->getType()->typeIsConvertibleTo(EltTy)"
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 567, __extension__ __PRETTY_FUNCTION__));

void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *>(Range.size()),
                               alignof(ListInit));
ListInit *I = new(Mem) ListInit(Range.size(), EltTy);
std::uninitialized_copy(Range.begin(), Range.end(),
                        I->getTrailingObjects<Init *>());
ThePool.InsertNode(I, IP);
return I;
576}

578void ListInit::Profile(FoldingSetNodeID &ID) const {
RecTy *EltTy = cast<ListRecTy>(getType())->getElementType();

ProfileListInit(ID, getValues(), EltTy);
582}

584Init *ListInit::convertInitializerTo(RecTy *Ty) const {
if (getType() == Ty)
  return const_cast<ListInit*>(this);

if (auto *LRT = dyn_cast<ListRecTy>(Ty)) {
  SmallVector<Init*, 8> Elements;
  Elements.reserve(getValues().size());

  // Verify that all of the elements of the list are subclasses of the
  // appropriate class!
  bool Changed = false;
  RecTy *ElementType = LRT->getElementType();
  for (Init *I : getValues())
    if (Init *CI = I->convertInitializerTo(ElementType)) {
      Elements.push_back(CI);
      if (CI != I)
        Changed = true;
    } else
      return nullptr;

  if (!Changed)
    return const_cast<ListInit*>(this);
  return ListInit::get(Elements, ElementType);
}

return nullptr;
610}

612Init *ListInit::convertInitListSlice(ArrayRef<unsigned> Elements) const {
SmallVector<Init*, 8> Vals;
Vals.reserve(Elements.size());
for (unsigned Element : Elements) {
  if (Element >= size())
    return nullptr;
  Vals.push_back(getElement(Element));
}
return ListInit::get(Vals, getElementType());
621}

623Record *ListInit::getElementAsRecord(unsigned i) const {
assert(i < NumValues && "List element index out of range!")(static_cast <bool> (i < NumValues && "List element index out of range!"
) ? void (0) : __assert_fail ("i < NumValues && \"List element index out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 624, __extension__ __PRETTY_FUNCTION__));
DefInit *DI = dyn_cast<DefInit>(getElement(i));
if (!DI)
  PrintFatalError("Expected record in list!");
return DI->getDef();
629}

631Init *ListInit::resolveReferences(Resolver &R) const {
SmallVector<Init*, 8> Resolved;
Resolved.reserve(size());
bool Changed = false;

for (Init *CurElt : getValues()) {
  Init *E = CurElt->resolveReferences(R);
  Changed |= E != CurElt;
  Resolved.push_back(E);
}

if (Changed)
  return ListInit::get(Resolved, getElementType());
return const_cast<ListInit *>(this);
645}

647bool ListInit::isConcrete() const {
for (Init *Element : *this) {
  if (!Element->isConcrete())
    return false;
}
return true;
653}

655std::string ListInit::getAsString() const {
std::string Result = "[";
const char *sep = "";
for (Init *Element : *this) {
  Result += sep;
  sep = ", ";
  Result += Element->getAsString();
}
return Result + "]";
664}

666Init *OpInit::getBit(unsigned Bit) const {
if (getType() == BitRecTy::get())
  return const_cast<OpInit*>(this);
return VarBitInit::get(const_cast<OpInit*>(this), Bit);
670}

672static void
673ProfileUnOpInit(FoldingSetNodeID &ID, unsigned Opcode, Init *Op, RecTy *Type) {
ID.AddInteger(Opcode);
ID.AddPointer(Op);
ID.AddPointer(Type);
677}

679UnOpInit *UnOpInit::get(UnaryOp Opc, Init *LHS, RecTy *Type) {
static FoldingSet<UnOpInit> ThePool;

FoldingSetNodeID ID;
ProfileUnOpInit(ID, Opc, LHS, Type);

void *IP = nullptr;
if (UnOpInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

UnOpInit *I = new(Allocator) UnOpInit(Opc, LHS, Type);
ThePool.InsertNode(I, IP);
return I;
692}

694void UnOpInit::Profile(FoldingSetNodeID &ID) const {
ProfileUnOpInit(ID, getOpcode(), getOperand(), getType());
696}

698Init *UnOpInit::Fold(Record *CurRec, bool IsFinal) const {
switch (getOpcode()) {
case CAST:
  if (isa<StringRecTy>(getType())) {
    if (StringInit *LHSs = dyn_cast<StringInit>(LHS))
      return LHSs;

    if (DefInit *LHSd = dyn_cast<DefInit>(LHS))
      return StringInit::get(LHSd->getAsString());

    if (IntInit *LHSi = dyn_cast<IntInit>(LHS))
      return StringInit::get(LHSi->getAsString());
  } else if (isa<RecordRecTy>(getType())) {
    if (StringInit *Name = dyn_cast<StringInit>(LHS)) {
      assert(CurRec && "NULL pointer")(static_cast <bool> (CurRec && "NULL pointer") ?
 void (0) : __assert_fail ("CurRec && \"NULL pointer\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 712, __extension__ __PRETTY_FUNCTION__));
      Record *D;

      // Self-references are allowed, but their resolution is delayed until
      // the final resolve to ensure that we get the correct type for them.
      if (Name == CurRec->getNameInit()) {
        if (!IsFinal)
          break;
        D = CurRec;
      } else {
        D = CurRec->getRecords().getDef(Name->getValue());
        if (!D) {
          if (IsFinal)
            PrintFatalError(CurRec->getLoc(),
                            Twine("Undefined reference to record: '") +
                            Name->getValue() + "'\n");
          break;
        }
      }

      DefInit *DI = DefInit::get(D);
      if (!DI->getType()->typeIsA(getType())) {
        PrintFatalError(CurRec->getLoc(),
                        Twine("Expected type '") +
                        getType()->getAsString() + "', got '" +
                        DI->getType()->getAsString() + "' in: " +
                        getAsString() + "\n");
      }
      return DI;
    }
  }

  if (Init *NewInit = LHS->convertInitializerTo(getType()))
    return NewInit;
  break;

case HEAD:
  if (ListInit *LHSl = dyn_cast<ListInit>(LHS)) {
    assert(!LHSl->empty() && "Empty list in head")(static_cast <bool> (!LHSl->empty() && "Empty list in head"
) ? void (0) : __assert_fail ("!LHSl->empty() && \"Empty list in head\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 750, __extension__ __PRETTY_FUNCTION__));
    return LHSl->getElement(0);
  }
  break;

case TAIL:
  if (ListInit *LHSl = dyn_cast<ListInit>(LHS)) {
    assert(!LHSl->empty() && "Empty list in tail")(static_cast <bool> (!LHSl->empty() && "Empty list in tail"
) ? void (0) : __assert_fail ("!LHSl->empty() && \"Empty list in tail\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 757, __extension__ __PRETTY_FUNCTION__));
    // Note the +1.  We can't just pass the result of getValues()
    // directly.
    return ListInit::get(LHSl->getValues().slice(1), LHSl->getElementType());
  }
  break;

case SIZE:
  if (ListInit *LHSl = dyn_cast<ListInit>(LHS))
    return IntInit::get(LHSl->size());
  break;

case EMPTY:
  if (ListInit *LHSl = dyn_cast<ListInit>(LHS))
    return IntInit::get(LHSl->empty());
  if (StringInit *LHSs = dyn_cast<StringInit>(LHS))
    return IntInit::get(LHSs->getValue().empty());
  break;
}
return const_cast<UnOpInit *>(this);
777}

779Init *UnOpInit::resolveReferences(Resolver &R) const {
Init *lhs = LHS->resolveReferences(R);

if (LHS != lhs || (R.isFinal() && getOpcode() == CAST))
  return (UnOpInit::get(getOpcode(), lhs, getType()))
      ->Fold(R.getCurrentRecord(), R.isFinal());
return const_cast<UnOpInit *>(this);
786}

788std::string UnOpInit::getAsString() const {
std::string Result;
switch (getOpcode()) {
case CAST: Result = "!cast<" + getType()->getAsString() + ">"; break;
case HEAD: Result = "!head"; break;
case TAIL: Result = "!tail"; break;
case SIZE: Result = "!size"; break;
case EMPTY: Result = "!empty"; break;
}
return Result + "(" + LHS->getAsString() + ")";
798}

800static void
801ProfileBinOpInit(FoldingSetNodeID &ID, unsigned Opcode, Init *LHS, Init *RHS,
               RecTy *Type) {
ID.AddInteger(Opcode);
ID.AddPointer(LHS);
ID.AddPointer(RHS);
ID.AddPointer(Type);
807}

809BinOpInit *BinOpInit::get(BinaryOp Opc, Init *LHS,
                        Init *RHS, RecTy *Type) {
static FoldingSet<BinOpInit> ThePool;

FoldingSetNodeID ID;
ProfileBinOpInit(ID, Opc, LHS, RHS, Type);

void *IP = nullptr;
if (BinOpInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

BinOpInit *I = new(Allocator) BinOpInit(Opc, LHS, RHS, Type);
ThePool.InsertNode(I, IP);
return I;
823}

825void BinOpInit::Profile(FoldingSetNodeID &ID) const {
ProfileBinOpInit(ID, getOpcode(), getLHS(), getRHS(), getType());
827}

829static StringInit *ConcatStringInits(const StringInit *I0,
                                   const StringInit *I1) {
SmallString<80> Concat(I0->getValue());
Concat.append(I1->getValue());
return StringInit::get(Concat);
834}

836Init *BinOpInit::getStrConcat(Init *I0, Init *I1) {
// Shortcut for the common case of concatenating two strings.
if (const StringInit *I0s = dyn_cast<StringInit>(I0))
  if (const StringInit *I1s = dyn_cast<StringInit>(I1))
    return ConcatStringInits(I0s, I1s);
return BinOpInit::get(BinOpInit::STRCONCAT, I0, I1, StringRecTy::get());
842}

844Init *BinOpInit::Fold(Record *CurRec) const {
switch (getOpcode()) {
case CONCAT: {
  DagInit *LHSs = dyn_cast<DagInit>(LHS);
  DagInit *RHSs = dyn_cast<DagInit>(RHS);
  if (LHSs && RHSs) {
    DefInit *LOp = dyn_cast<DefInit>(LHSs->getOperator());
    DefInit *ROp = dyn_cast<DefInit>(RHSs->getOperator());
    if (!LOp || !ROp)
      break;
    if (LOp->getDef() != ROp->getDef()) {
      PrintFatalError(Twine("Concatenated Dag operators do not match: '") +
                      LHSs->getAsString() + "' vs. '" + RHSs->getAsString() +
                      "'");
    }
    SmallVector<Init*, 8> Args;
    SmallVector<StringInit*, 8> ArgNames;
    for (unsigned i = 0, e = LHSs->getNumArgs(); i != e; ++i) {
      Args.push_back(LHSs->getArg(i));
      ArgNames.push_back(LHSs->getArgName(i));
    }
    for (unsigned i = 0, e = RHSs->getNumArgs(); i != e; ++i) {
      Args.push_back(RHSs->getArg(i));
      ArgNames.push_back(RHSs->getArgName(i));
    }
    return DagInit::get(LHSs->getOperator(), nullptr, Args, ArgNames);
  }
  break;
}
case LISTCONCAT: {
  ListInit *LHSs = dyn_cast<ListInit>(LHS);
  ListInit *RHSs = dyn_cast<ListInit>(RHS);
  if (LHSs && RHSs) {
    SmallVector<Init *, 8> Args;
    Args.insert(Args.end(), LHSs->begin(), LHSs->end());
    Args.insert(Args.end(), RHSs->begin(), RHSs->end());
    return ListInit::get(Args, LHSs->getElementType());
  }
  break;
}
case STRCONCAT: {
  StringInit *LHSs = dyn_cast<StringInit>(LHS);
  StringInit *RHSs = dyn_cast<StringInit>(RHS);
  if (LHSs && RHSs)
    return ConcatStringInits(LHSs, RHSs);
  break;
}
case EQ:
case NE:
case LE:
case LT:
case GE:
case GT: {
  // try to fold eq comparison for 'bit' and 'int', otherwise fallback
  // to string objects.
  IntInit *L =
      dyn_cast_or_null<IntInit>(LHS->convertInitializerTo(IntRecTy::get()));
  IntInit *R =
      dyn_cast_or_null<IntInit>(RHS->convertInitializerTo(IntRecTy::get()));

  if (L && R) {
    bool Result;
    switch (getOpcode()) {
    case EQ: Result = L->getValue() == R->getValue(); break;
    case NE: Result = L->getValue() != R->getValue(); break;
    case LE: Result = L->getValue() <= R->getValue(); break;
    case LT: Result = L->getValue() < R->getValue(); break;
    case GE: Result = L->getValue() >= R->getValue(); break;
    case GT: Result = L->getValue() > R->getValue(); break;
    default: llvm_unreachable("unhandled comparison")::llvm::llvm_unreachable_internal("unhandled comparison", "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 913);
    }
    return BitInit::get(Result);
  }

  if (getOpcode() == EQ || getOpcode() == NE) {
    StringInit *LHSs = dyn_cast<StringInit>(LHS);
    StringInit *RHSs = dyn_cast<StringInit>(RHS);

    // Make sure we've resolved
    if (LHSs && RHSs) {
      bool Equal = LHSs->getValue() == RHSs->getValue();
      return BitInit::get(getOpcode() == EQ ? Equal : !Equal);
    }
  }

  break;
}
case ADD:
case AND:
case OR:
case SHL:
case SRA:
case SRL: {
  IntInit *LHSi =
    dyn_cast_or_null<IntInit>(LHS->convertInitializerTo(IntRecTy::get()));
  IntInit *RHSi =
    dyn_cast_or_null<IntInit>(RHS->convertInitializerTo(IntRecTy::get()));
  if (LHSi && RHSi) {
    int64_t LHSv = LHSi->getValue(), RHSv = RHSi->getValue();
    int64_t Result;
    switch (getOpcode()) {
    default: llvm_unreachable("Bad opcode!")::llvm::llvm_unreachable_internal("Bad opcode!", "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 945);
    case ADD: Result = LHSv +  RHSv; break;
    case AND: Result = LHSv &  RHSv; break;
    case OR: Result = LHSv | RHSv; break;
    case SHL: Result = LHSv << RHSv; break;
    case SRA: Result = LHSv >> RHSv; break;
    case SRL: Result = (uint64_t)LHSv >> (uint64_t)RHSv; break;
    }
    return IntInit::get(Result);
  }
  break;
}
}
return const_cast<BinOpInit *>(this);
959}

961Init *BinOpInit::resolveReferences(Resolver &R) const {
Init *lhs = LHS->resolveReferences(R);
Init *rhs = RHS->resolveReferences(R);

if (LHS != lhs || RHS != rhs)
  return (BinOpInit::get(getOpcode(), lhs, rhs, getType()))
      ->Fold(R.getCurrentRecord());
return const_cast<BinOpInit *>(this);
969}

971std::string BinOpInit::getAsString() const {
std::string Result;
switch (getOpcode()) {
case CONCAT: Result = "!con"; break;
case ADD: Result = "!add"; break;
case AND: Result = "!and"; break;
case OR: Result = "!or"; break;
case SHL: Result = "!shl"; break;
case SRA: Result = "!sra"; break;
case SRL: Result = "!srl"; break;
case EQ: Result = "!eq"; break;
case NE: Result = "!ne"; break;
case LE: Result = "!le"; break;
case LT: Result = "!lt"; break;
case GE: Result = "!ge"; break;
case GT: Result = "!gt"; break;
case LISTCONCAT: Result = "!listconcat"; break;
case STRCONCAT: Result = "!strconcat"; break;
}
return Result + "(" + LHS->getAsString() + ", " + RHS->getAsString() + ")";
991}

993static void
994ProfileTernOpInit(FoldingSetNodeID &ID, unsigned Opcode, Init *LHS, Init *MHS,
                Init *RHS, RecTy *Type) {
ID.AddInteger(Opcode);
ID.AddPointer(LHS);
ID.AddPointer(MHS);
ID.AddPointer(RHS);
ID.AddPointer(Type);
1001}

1003TernOpInit *TernOpInit::get(TernaryOp Opc, Init *LHS, Init *MHS, Init *RHS,
                          RecTy *Type) {
static FoldingSet<TernOpInit> ThePool;

FoldingSetNodeID ID;
ProfileTernOpInit(ID, Opc, LHS, MHS, RHS, Type);

void *IP = nullptr;
if (TernOpInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

TernOpInit *I = new(Allocator) TernOpInit(Opc, LHS, MHS, RHS, Type);
ThePool.InsertNode(I, IP);
return I;
1017}

1019void TernOpInit::Profile(FoldingSetNodeID &ID) const {
ProfileTernOpInit(ID, getOpcode(), getLHS(), getMHS(), getRHS(), getType());
1021}

1023static Init *ForeachApply(Init *LHS, Init *MHSe, Init *RHS, Record *CurRec) {
MapResolver R(CurRec);
R.set(LHS, MHSe);
return RHS->resolveReferences(R);
1027}

1029static Init *ForeachDagApply(Init *LHS, DagInit *MHSd, Init *RHS,
                           Record *CurRec) {
bool Change = false;
Init *Val = ForeachApply(LHS, MHSd->getOperator(), RHS, CurRec);
if (Val != MHSd->getOperator())
  Change = true;

SmallVector<std::pair<Init *, StringInit *>, 8> NewArgs;
for (unsigned int i = 0; i < MHSd->getNumArgs(); ++i) {
  Init *Arg = MHSd->getArg(i);
  Init *NewArg;
  StringInit *ArgName = MHSd->getArgName(i);

  if (DagInit *Argd = dyn_cast<DagInit>(Arg))
    NewArg = ForeachDagApply(LHS, Argd, RHS, CurRec);
  else
    NewArg = ForeachApply(LHS, Arg, RHS, CurRec);

  NewArgs.push_back(std::make_pair(NewArg, ArgName));
  if (Arg != NewArg)
    Change = true;
}

if (Change)
  return DagInit::get(Val, nullptr, NewArgs);
return MHSd;
1055}

1057// Applies RHS to all elements of MHS, using LHS as a temp variable.
1058static Init *ForeachHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type,
                         Record *CurRec) {
if (DagInit *MHSd = dyn_cast<DagInit>(MHS))
  return ForeachDagApply(LHS, MHSd, RHS, CurRec);

if (ListInit *MHSl = dyn_cast<ListInit>(MHS)) {
  SmallVector<Init *, 8> NewList(MHSl->begin(), MHSl->end());

  for (Init *&Item : NewList) {
    Init *NewItem = ForeachApply(LHS, Item, RHS, CurRec);
    if (NewItem != Item)
      Item = NewItem;
  }
  return ListInit::get(NewList, cast<ListRecTy>(Type)->getElementType());
}

return nullptr;
1075}

1077Init *TernOpInit::Fold(Record *CurRec) const {
switch (getOpcode()) {
case SUBST: {
  DefInit *LHSd = dyn_cast<DefInit>(LHS);
  VarInit *LHSv = dyn_cast<VarInit>(LHS);
  StringInit *LHSs = dyn_cast<StringInit>(LHS);

  DefInit *MHSd = dyn_cast<DefInit>(MHS);
  VarInit *MHSv = dyn_cast<VarInit>(MHS);
  StringInit *MHSs = dyn_cast<StringInit>(MHS);

  DefInit *RHSd = dyn_cast<DefInit>(RHS);
  VarInit *RHSv = dyn_cast<VarInit>(RHS);
  StringInit *RHSs = dyn_cast<StringInit>(RHS);

  if (LHSd && MHSd && RHSd) {
    Record *Val = RHSd->getDef();
    if (LHSd->getAsString() == RHSd->getAsString())
      Val = MHSd->getDef();
    return DefInit::get(Val);
  }
  if (LHSv && MHSv && RHSv) {
    std::string Val = RHSv->getName();
    if (LHSv->getAsString() == RHSv->getAsString())
      Val = MHSv->getName();
    return VarInit::get(Val, getType());
  }
  if (LHSs && MHSs && RHSs) {
    std::string Val = RHSs->getValue();

    std::string::size_type found;
    std::string::size_type idx = 0;
    while (true) {
      found = Val.find(LHSs->getValue(), idx);
      if (found == std::string::npos)
        break;
      Val.replace(found, LHSs->getValue().size(), MHSs->getValue());
      idx = found + MHSs->getValue().size();
    }

    return StringInit::get(Val);
  }
  break;
}

case FOREACH: {
  if (Init *Result = ForeachHelper(LHS, MHS, RHS, getType(), CurRec))
    return Result;
  break;
}

case IF: {
  if (IntInit *LHSi = dyn_cast_or_null<IntInit>(
                          LHS->convertInitializerTo(IntRecTy::get()))) {
    if (LHSi->getValue())
      return MHS;
    return RHS;
  }
  break;
}

case DAG: {
  ListInit *MHSl = dyn_cast<ListInit>(MHS);
  ListInit *RHSl = dyn_cast<ListInit>(RHS);
  bool MHSok = MHSl || isa<UnsetInit>(MHS);
  bool RHSok = RHSl || isa<UnsetInit>(RHS);

  if (isa<UnsetInit>(MHS) && isa<UnsetInit>(RHS))
    break; // Typically prevented by the parser, but might happen with template args

  if (MHSok && RHSok && (!MHSl || !RHSl || MHSl->size() == RHSl->size())) {
    SmallVector<std::pair<Init *, StringInit *>, 8> Children;
    unsigned Size = MHSl ? MHSl->size() : RHSl->size();
    for (unsigned i = 0; i != Size; ++i) {
      Init *Node = MHSl ? MHSl->getElement(i) : UnsetInit::get();
      Init *Name = RHSl ? RHSl->getElement(i) : UnsetInit::get();
      if (!isa<StringInit>(Name) && !isa<UnsetInit>(Name))
        return const_cast<TernOpInit *>(this);
      Children.emplace_back(Node, dyn_cast<StringInit>(Name));
    }
    return DagInit::get(LHS, nullptr, Children);
  }
  break;
}
}

return const_cast<TernOpInit *>(this);
1164}

1166Init *TernOpInit::resolveReferences(Resolver &R) const {
Init *lhs = LHS->resolveReferences(R);

if (getOpcode() == IF && lhs != LHS) {
  if (IntInit *Value = dyn_cast_or_null<IntInit>(
                           lhs->convertInitializerTo(IntRecTy::get()))) {
    // Short-circuit
    if (Value->getValue())
      return MHS->resolveReferences(R);
    return RHS->resolveReferences(R);
  }
}

Init *mhs = MHS->resolveReferences(R);
Init *rhs;

if (getOpcode() == FOREACH) {
  ShadowResolver SR(R);
  SR.addShadow(lhs);
  rhs = RHS->resolveReferences(SR);
} else {
  rhs = RHS->resolveReferences(R);
}

if (LHS != lhs || MHS != mhs || RHS != rhs)
  return (TernOpInit::get(getOpcode(), lhs, mhs, rhs, getType()))
      ->Fold(R.getCurrentRecord());
return const_cast<TernOpInit *>(this);
1194}

1196std::string TernOpInit::getAsString() const {
std::string Result;
switch (getOpcode()) {
case SUBST: Result = "!subst"; break;
case FOREACH: Result = "!foreach"; break;
case IF: Result = "!if"; break;
case DAG: Result = "!dag"; break;
}
return Result + "(" + LHS->getAsString() + ", " + MHS->getAsString() + ", " +
       RHS->getAsString() + ")";
1206}

1208static void ProfileFoldOpInit(FoldingSetNodeID &ID, Init *A, Init *B,
                            Init *Start, Init *List, Init *Expr,
                            RecTy *Type) {
ID.AddPointer(Start);
ID.AddPointer(List);
ID.AddPointer(A);
ID.AddPointer(B);
ID.AddPointer(Expr);
ID.AddPointer(Type);
1217}

1219FoldOpInit *FoldOpInit::get(Init *Start, Init *List, Init *A, Init *B,
                          Init *Expr, RecTy *Type) {
static FoldingSet<FoldOpInit> ThePool;

FoldingSetNodeID ID;
ProfileFoldOpInit(ID, Start, List, A, B, Expr, Type);

void *IP = nullptr;
if (FoldOpInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

FoldOpInit *I = new (Allocator) FoldOpInit(Start, List, A, B, Expr, Type);
ThePool.InsertNode(I, IP);
return I;
1233}

1235void FoldOpInit::Profile(FoldingSetNodeID &ID) const {
ProfileFoldOpInit(ID, Start, List, A, B, Expr, getType());
1237}

1239Init *FoldOpInit::Fold(Record *CurRec) const {
if (ListInit *LI = dyn_cast<ListInit>(List)) {
  Init *Accum = Start;
  for (Init *Elt : *LI) {
    MapResolver R(CurRec);
    R.set(A, Accum);
    R.set(B, Elt);
    Accum = Expr->resolveReferences(R);
  }
  return Accum;
}
return const_cast<FoldOpInit *>(this);
1251}

1253Init *FoldOpInit::resolveReferences(Resolver &R) const {
Init *NewStart = Start->resolveReferences(R);
Init *NewList = List->resolveReferences(R);
ShadowResolver SR(R);
SR.addShadow(A);
SR.addShadow(B);
Init *NewExpr = Expr->resolveReferences(SR);

if (Start == NewStart && List == NewList && Expr == NewExpr)
  return const_cast<FoldOpInit *>(this);

return get(NewStart, NewList, A, B, NewExpr, getType())
    ->Fold(R.getCurrentRecord());
1266}

1268Init *FoldOpInit::getBit(unsigned Bit) const {
return VarBitInit::get(const_cast<FoldOpInit *>(this), Bit);
1270}

1272std::string FoldOpInit::getAsString() const {
return (Twine("!foldl(") + Start->getAsString() + ", " + List->getAsString() +
        ", " + A->getAsUnquotedString() + ", " + B->getAsUnquotedString() +
        ", " + Expr->getAsString() + ")")
    .str();
1277}

1279static void ProfileIsAOpInit(FoldingSetNodeID &ID, RecTy *CheckType,
                           Init *Expr) {
ID.AddPointer(CheckType);
ID.AddPointer(Expr);
1283}

1285IsAOpInit *IsAOpInit::get(RecTy *CheckType, Init *Expr) {
static FoldingSet<IsAOpInit> ThePool;

FoldingSetNodeID ID;
ProfileIsAOpInit(ID, CheckType, Expr);

void *IP = nullptr;
if (IsAOpInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

IsAOpInit *I = new (Allocator) IsAOpInit(CheckType, Expr);
ThePool.InsertNode(I, IP);
return I;
1298}

1300void IsAOpInit::Profile(FoldingSetNodeID &ID) const {
ProfileIsAOpInit(ID, CheckType, Expr);
1302}

1304Init *IsAOpInit::Fold() const {
if (TypedInit *TI = dyn_cast<TypedInit>(Expr)) {
  // Is the expression type known to be (a subclass of) the desired type?
  if (TI->getType()->typeIsConvertibleTo(CheckType))
    return IntInit::get(1);

  if (isa<RecordRecTy>(CheckType)) {
    // If the target type is not a subclass of the expression type, or if
    // the expression has fully resolved to a record, we know that it can't
    // be of the required type.
    if (!CheckType->typeIsConvertibleTo(TI->getType()) || isa<DefInit>(Expr))
      return IntInit::get(0);
  } else {
    // We treat non-record types as not castable.
    return IntInit::get(0);
  }
}
return const_cast<IsAOpInit *>(this);
1322}

1324Init *IsAOpInit::resolveReferences(Resolver &R) const {
Init *NewExpr = Expr->resolveReferences(R);
if (Expr != NewExpr)
  return get(CheckType, NewExpr)->Fold();
return const_cast<IsAOpInit *>(this);
1329}

1331Init *IsAOpInit::getBit(unsigned Bit) const {
return VarBitInit::get(const_cast<IsAOpInit *>(this), Bit);
1333}

1335std::string IsAOpInit::getAsString() const {
return (Twine("!isa<") + CheckType->getAsString() + ">(" +
        Expr->getAsString() + ")")
    .str();
1339}

1341RecTy *TypedInit::getFieldType(StringInit *FieldName) const {
if (RecordRecTy *RecordType = dyn_cast<RecordRecTy>(getType())) {
  for (Record *Rec : RecordType->getClasses()) {
    if (RecordVal *Field = Rec->getValue(FieldName))
      return Field->getType();
  }
}
return nullptr;
1349}

1351Init *
1352TypedInit::convertInitializerTo(RecTy *Ty) const {
if (getType() == Ty || getType()->typeIsA(Ty))
  return const_cast<TypedInit *>(this);

if (isa<BitRecTy>(getType()) && isa<BitsRecTy>(Ty) &&
    cast<BitsRecTy>(Ty)->getNumBits() == 1)
  return BitsInit::get({const_cast<TypedInit *>(this)});

return nullptr;
1361}

1363Init *TypedInit::convertInitializerBitRange(ArrayRef<unsigned> Bits) const {
BitsRecTy *T = dyn_cast<BitsRecTy>(getType());
if (!T) return nullptr;  // Cannot subscript a non-bits variable.
unsigned NumBits = T->getNumBits();

SmallVector<Init *, 16> NewBits;
NewBits.reserve(Bits.size());
for (unsigned Bit : Bits) {
  if (Bit >= NumBits)
    return nullptr;

  NewBits.push_back(VarBitInit::get(const_cast<TypedInit *>(this), Bit));
}
return BitsInit::get(NewBits);
1377}

1379Init *TypedInit::getCastTo(RecTy *Ty) const {
// Handle the common case quickly
if (getType() == Ty || getType()->typeIsA(Ty))
  return const_cast<TypedInit *>(this);

if (Init *Converted = convertInitializerTo(Ty)) {
  assert(!isa<TypedInit>(Converted) ||(static_cast <bool> (!isa<TypedInit>(Converted) ||
 cast<TypedInit>(Converted)->getType()->typeIsA(Ty
)) ? void (0) : __assert_fail ("!isa<TypedInit>(Converted) || cast<TypedInit>(Converted)->getType()->typeIsA(Ty)"
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 1386, __extension__ __PRETTY_FUNCTION__))
         cast<TypedInit>(Converted)->getType()->typeIsA(Ty))(static_cast <bool> (!isa<TypedInit>(Converted) ||
 cast<TypedInit>(Converted)->getType()->typeIsA(Ty
)) ? void (0) : __assert_fail ("!isa<TypedInit>(Converted) || cast<TypedInit>(Converted)->getType()->typeIsA(Ty)"
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 1386, __extension__ __PRETTY_FUNCTION__));
  return Converted;
}

if (!getType()->typeIsConvertibleTo(Ty))
  return nullptr;

return UnOpInit::get(UnOpInit::CAST, const_cast<TypedInit *>(this), Ty)
    ->Fold(nullptr);
1395}

1397Init *TypedInit::convertInitListSlice(ArrayRef<unsigned> Elements) const {
ListRecTy *T = dyn_cast<ListRecTy>(getType());
if (!T) return nullptr;  // Cannot subscript a non-list variable.

if (Elements.size() == 1)
  return VarListElementInit::get(const_cast<TypedInit *>(this), Elements[0]);

SmallVector<Init*, 8> ListInits;
ListInits.reserve(Elements.size());
for (unsigned Element : Elements)
  ListInits.push_back(VarListElementInit::get(const_cast<TypedInit *>(this),
                                              Element));
return ListInit::get(ListInits, T->getElementType());
1410}


1413VarInit *VarInit::get(StringRef VN, RecTy *T) {
Init *Value = StringInit::get(VN);
return VarInit::get(Value, T);
1416}

1418VarInit *VarInit::get(Init *VN, RecTy *T) {
using Key = std::pair<RecTy *, Init *>;
static DenseMap<Key, VarInit*> ThePool;

Key TheKey(std::make_pair(T, VN));

VarInit *&I = ThePool[TheKey];
if (!I)
  I = new(Allocator) VarInit(VN, T);
return I;
1428}

1430StringRef VarInit::getName() const {
StringInit *NameString = cast<StringInit>(getNameInit());
return NameString->getValue();
1433}

1435Init *VarInit::getBit(unsigned Bit) const {
if (getType() == BitRecTy::get())
  return const_cast<VarInit*>(this);
return VarBitInit::get(const_cast<VarInit*>(this), Bit);
1439}

1441Init *VarInit::resolveReferences(Resolver &R) const {
if (Init *Val = R.resolve(VarName))
  return Val;
return const_cast<VarInit *>(this);
1445}

1447VarBitInit *VarBitInit::get(TypedInit *T, unsigned B) {
using Key = std::pair<TypedInit *, unsigned>;
static DenseMap<Key, VarBitInit*> ThePool;

Key TheKey(std::make_pair(T, B));

VarBitInit *&I = ThePool[TheKey];
if (!I)
  I = new(Allocator) VarBitInit(T, B);
return I;
1457}

1459std::string VarBitInit::getAsString() const {
return TI->getAsString() + "{" + utostr(Bit) + "}";
1461}

1463Init *VarBitInit::resolveReferences(Resolver &R) const {
Init *I = TI->resolveReferences(R);
if (TI != I)
  return I->getBit(getBitNum());

return const_cast<VarBitInit*>(this);
1469}

1471VarListElementInit *VarListElementInit::get(TypedInit *T,
                                          unsigned E) {
using Key = std::pair<TypedInit *, unsigned>;
static DenseMap<Key, VarListElementInit*> ThePool;

Key TheKey(std::make_pair(T, E));

VarListElementInit *&I = ThePool[TheKey];
if (!I) I = new(Allocator) VarListElementInit(T, E);
return I;
1481}

1483std::string VarListElementInit::getAsString() const {
return TI->getAsString() + "[" + utostr(Element) + "]";
1485}

1487Init *VarListElementInit::resolveReferences(Resolver &R) const {
Init *NewTI = TI->resolveReferences(R);
if (ListInit *List = dyn_cast<ListInit>(NewTI)) {
  // Leave out-of-bounds array references as-is. This can happen without
  // being an error, e.g. in the untaken "branch" of an !if expression.
  if (getElementNum() < List->size())
    return List->getElement(getElementNum());
}
if (NewTI != TI && isa<TypedInit>(NewTI))
  return VarListElementInit::get(cast<TypedInit>(NewTI), getElementNum());
return const_cast<VarListElementInit *>(this);
1498}

1500Init *VarListElementInit::getBit(unsigned Bit) const {
if (getType() == BitRecTy::get())
  return const_cast<VarListElementInit*>(this);
return VarBitInit::get(const_cast<VarListElementInit*>(this), Bit);
1504}

1506DefInit::DefInit(Record *D)
  : TypedInit(IK_DefInit, D->getType()), Def(D) {}

1509DefInit *DefInit::get(Record *R) {
return R->getDefInit();
1511}

1513Init *DefInit::convertInitializerTo(RecTy *Ty) const {
if (auto *RRT = dyn_cast<RecordRecTy>(Ty))
  if (getType()->typeIsConvertibleTo(RRT))
    return const_cast<DefInit *>(this);
return nullptr;
1518}

1520RecTy *DefInit::getFieldType(StringInit *FieldName) const {
if (const RecordVal *RV = Def->getValue(FieldName))
  return RV->getType();
return nullptr;
1524}

1526std::string DefInit::getAsString() const {
return Def->getName();
1528}

1530static void ProfileVarDefInit(FoldingSetNodeID &ID,
                            Record *Class,
                            ArrayRef<Init *> Args) {
ID.AddInteger(Args.size());
ID.AddPointer(Class);

for (Init *I : Args)
  ID.AddPointer(I);
1538}

1540VarDefInit *VarDefInit::get(Record *Class, ArrayRef<Init *> Args) {
static FoldingSet<VarDefInit> ThePool;

FoldingSetNodeID ID;
ProfileVarDefInit(ID, Class, Args);

void *IP = nullptr;
if (VarDefInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *>(Args.size()),
                               alignof(VarDefInit));
VarDefInit *I = new(Mem) VarDefInit(Class, Args.size());
std::uninitialized_copy(Args.begin(), Args.end(),
                        I->getTrailingObjects<Init *>());
ThePool.InsertNode(I, IP);
return I;
1557}

1559void VarDefInit::Profile(FoldingSetNodeID &ID) const {
ProfileVarDefInit(ID, Class, args());
1561}

1563DefInit *VarDefInit::instantiate() {
if (!Def) {
6
←
Assuming the condition is true→
7
←
Taking true branch→
  RecordKeeper &Records = Class->getRecords();
  auto NewRecOwner = make_unique<Record>(Records.getNewAnonymousName(),
8
←
Calling 'make_unique'→
10
←
Returned allocated memory→
                                         Class->getLoc(), Records,
                                         /*IsAnonymous=*/true);
  Record *NewRec = NewRecOwner.get();

  // Copy values from class to instance
  for (const RecordVal &Val : Class->getValues()) {
11
←
Assuming '__begin2' is equal to '__end2'→
    if (Val.getName() != "NAME")
      NewRec->addValue(Val);
  }

  // Substitute and resolve template arguments
  ArrayRef<Init *> TArgs = Class->getTemplateArgs();
  MapResolver R(NewRec);

  for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
12
←
Assuming 'i' is equal to 'e'→
13
←
Loop condition is false. Execution continues on line 1590→
    if (i < args_size())
      R.set(TArgs[i], getArg(i));
    else
      R.set(TArgs[i], NewRec->getValue(TArgs[i])->getValue());

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

  NewRec->resolveReferences(R);

  // Add superclasses.
  ArrayRef<std::pair<Record *, SMRange>> SCs = Class->getSuperClasses();
  for (const auto &SCPair : SCs)
14
←
Assuming '__begin2' is equal to '__end2'→
    NewRec->addSuperClass(SCPair.first, SCPair.second);

  NewRec->addSuperClass(Class,
                        SMRange(Class->getLoc().back(),
                                Class->getLoc().back()));

  // Resolve internal references and store in record keeper
  NewRec->resolveReferences();
  Records.addDef(std::move(NewRecOwner));
15
←
Calling '~unique_ptr'→
20
←
Returning from '~unique_ptr'→

  Def = DefInit::get(NewRec);
21
←
Use of memory after it is freed
}

return Def;
1609}

1611Init *VarDefInit::resolveReferences(Resolver &R) const {
TrackUnresolvedResolver UR(&R);
bool Changed = false;
SmallVector<Init *, 8> NewArgs;
NewArgs.reserve(args_size());

for (Init *Arg : args()) {
  Init *NewArg = Arg->resolveReferences(UR);
  NewArgs.push_back(NewArg);
  Changed |= NewArg != Arg;
}

if (Changed) {
  auto New = VarDefInit::get(Class, NewArgs);
  if (!UR.foundUnresolved())
    return New->instantiate();
  return New;
}
return const_cast<VarDefInit *>(this);
1630}

1632Init *VarDefInit::Fold() const {
if (Def)
1
Assuming the condition is false→
2
←
Taking false branch→
  return Def;

TrackUnresolvedResolver R;
for (Init *Arg : args())
3
←
Assuming '__begin1' is equal to '__end1'→
  Arg->resolveReferences(R);

if (!R.foundUnresolved())
4
←
Taking true branch→
  return const_cast<VarDefInit *>(this)->instantiate();
5
←
Calling 'VarDefInit::instantiate'→
return const_cast<VarDefInit *>(this);
1643}

1645std::string VarDefInit::getAsString() const {
std::string Result = Class->getNameInitAsString() + "<";
const char *sep = "";
for (Init *Arg : args()) {
  Result += sep;
  sep = ", ";
  Result += Arg->getAsString();
}
return Result + ">";
1654}

1656FieldInit *FieldInit::get(Init *R, StringInit *FN) {
using Key = std::pair<Init *, StringInit *>;
static DenseMap<Key, FieldInit*> ThePool;

Key TheKey(std::make_pair(R, FN));

FieldInit *&I = ThePool[TheKey];
if (!I) I = new(Allocator) FieldInit(R, FN);
return I;
1665}

1667Init *FieldInit::getBit(unsigned Bit) const {
if (getType() == BitRecTy::get())
  return const_cast<FieldInit*>(this);
return VarBitInit::get(const_cast<FieldInit*>(this), Bit);
1671}

1673Init *FieldInit::resolveReferences(Resolver &R) const {
Init *NewRec = Rec->resolveReferences(R);
if (NewRec != Rec)
  return FieldInit::get(NewRec, FieldName)->Fold(R.getCurrentRecord());
return const_cast<FieldInit *>(this);
1678}

1680Init *FieldInit::Fold(Record *CurRec) const {
if (DefInit *DI = dyn_cast<DefInit>(Rec)) {
  Record *Def = DI->getDef();
  if (Def == CurRec)
    PrintFatalError(CurRec->getLoc(),
                    Twine("Attempting to access field '") +
                    FieldName->getAsUnquotedString() + "' of '" +
                    Rec->getAsString() + "' is a forbidden self-reference");
  Init *FieldVal = Def->getValue(FieldName)->getValue();
  if (FieldVal->isComplete())
    return FieldVal;
}
return const_cast<FieldInit *>(this);
1693}

1695static void ProfileDagInit(FoldingSetNodeID &ID, Init *V, StringInit *VN,
                         ArrayRef<Init *> ArgRange,
                         ArrayRef<StringInit *> NameRange) {
ID.AddPointer(V);
ID.AddPointer(VN);

ArrayRef<Init *>::iterator Arg = ArgRange.begin();
ArrayRef<StringInit *>::iterator Name = NameRange.begin();
while (Arg != ArgRange.end()) {
  assert(Name != NameRange.end() && "Arg name underflow!")(static_cast <bool> (Name != NameRange.end() &&
 "Arg name underflow!") ? void (0) : __assert_fail ("Name != NameRange.end() && \"Arg name underflow!\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 1704, __extension__ __PRETTY_FUNCTION__));
  ID.AddPointer(*Arg++);
  ID.AddPointer(*Name++);
}
assert(Name == NameRange.end() && "Arg name overflow!")(static_cast <bool> (Name == NameRange.end() &&
 "Arg name overflow!") ? void (0) : __assert_fail ("Name == NameRange.end() && \"Arg name overflow!\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 1708, __extension__ __PRETTY_FUNCTION__));
1709}

1711DagInit *
1712DagInit::get(Init *V, StringInit *VN, ArrayRef<Init *> ArgRange,
           ArrayRef<StringInit *> NameRange) {
static FoldingSet<DagInit> ThePool;

FoldingSetNodeID ID;
ProfileDagInit(ID, V, VN, ArgRange, NameRange);

void *IP = nullptr;
if (DagInit *I = ThePool.FindNodeOrInsertPos(ID, IP))
  return I;

void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *, StringInit *>(ArgRange.size(), NameRange.size()), alignof(BitsInit));
DagInit *I = new(Mem) DagInit(V, VN, ArgRange.size(), NameRange.size());
std::uninitialized_copy(ArgRange.begin(), ArgRange.end(),
                        I->getTrailingObjects<Init *>());
std::uninitialized_copy(NameRange.begin(), NameRange.end(),
                        I->getTrailingObjects<StringInit *>());
ThePool.InsertNode(I, IP);
return I;
1731}

1733DagInit *
1734DagInit::get(Init *V, StringInit *VN,
           ArrayRef<std::pair<Init*, StringInit*>> args) {
SmallVector<Init *, 8> Args;
SmallVector<StringInit *, 8> Names;

for (const auto &Arg : args) {
  Args.push_back(Arg.first);
  Names.push_back(Arg.second);
}

return DagInit::get(V, VN, Args, Names);
1745}

1747void DagInit::Profile(FoldingSetNodeID &ID) const {
ProfileDagInit(ID, Val, ValName, makeArrayRef(getTrailingObjects<Init *>(), NumArgs), makeArrayRef(getTrailingObjects<StringInit *>(), NumArgNames));
1749}

1751Init *DagInit::resolveReferences(Resolver &R) const {
SmallVector<Init*, 8> NewArgs;
NewArgs.reserve(arg_size());
bool ArgsChanged = false;
for (const Init *Arg : getArgs()) {
  Init *NewArg = Arg->resolveReferences(R);
  NewArgs.push_back(NewArg);
  ArgsChanged |= NewArg != Arg;
}

Init *Op = Val->resolveReferences(R);
if (Op != Val || ArgsChanged)
  return DagInit::get(Op, ValName, NewArgs, getArgNames());

return const_cast<DagInit *>(this);
1766}

1768bool DagInit::isConcrete() const {
if (!Val->isConcrete())
  return false;
for (const Init *Elt : getArgs()) {
  if (!Elt->isConcrete())
    return false;
}
return true;
1776}

1778std::string DagInit::getAsString() const {
std::string Result = "(" + Val->getAsString();
if (ValName)
  Result += ":" + ValName->getAsUnquotedString();
if (!arg_empty()) {
  Result += " " + getArg(0)->getAsString();
  if (getArgName(0)) Result += ":$" + getArgName(0)->getAsUnquotedString();
  for (unsigned i = 1, e = getNumArgs(); i != e; ++i) {
    Result += ", " + getArg(i)->getAsString();
    if (getArgName(i)) Result += ":$" + getArgName(i)->getAsUnquotedString();
  }
}
return Result + ")";
1791}

1793//===----------------------------------------------------------------------===//
1794//    Other implementations
1795//===----------------------------------------------------------------------===//

1797RecordVal::RecordVal(Init *N, RecTy *T, bool P)
: Name(N), TyAndPrefix(T, P) {
setValue(UnsetInit::get());
assert(Value && "Cannot create unset value for current type!")(static_cast <bool> (Value && "Cannot create unset value for current type!"
) ? void (0) : __assert_fail ("Value && \"Cannot create unset value for current type!\""
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 1800, __extension__ __PRETTY_FUNCTION__));
1801}

1803StringRef RecordVal::getName() const {
return cast<StringInit>(getNameInit())->getValue();
1805}

1807bool RecordVal::setValue(Init *V) {
if (V) {
  Value = V->getCastTo(getType());
  if (Value) {
    assert(!isa<TypedInit>(Value) ||(static_cast <bool> (!isa<TypedInit>(Value) || cast
<TypedInit>(Value)->getType()->typeIsA(getType())
) ? void (0) : __assert_fail ("!isa<TypedInit>(Value) || cast<TypedInit>(Value)->getType()->typeIsA(getType())"
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 1812, __extension__ __PRETTY_FUNCTION__))
           cast<TypedInit>(Value)->getType()->typeIsA(getType()))(static_cast <bool> (!isa<TypedInit>(Value) || cast
<TypedInit>(Value)->getType()->typeIsA(getType())
) ? void (0) : __assert_fail ("!isa<TypedInit>(Value) || cast<TypedInit>(Value)->getType()->typeIsA(getType())"
, "/build/llvm-toolchain-snapshot-7~svn329677/lib/TableGen/Record.cpp"
, 1812, __extension__ __PRETTY_FUNCTION__));
    if (BitsRecTy *BTy = dyn_cast<BitsRecTy>(getType())) {
      if (!isa<BitsInit>(Value)) {
        SmallVector<Init *, 64> Bits;
        Bits.reserve(BTy->getNumBits());
        for (unsigned i = 0, e = BTy->getNumBits(); i < e; ++i)
          Bits.push_back(Value->getBit(i));
        Value = BitsInit::get(Bits);
      }
    }
  }
  return Value == nullptr;
}
Value = nullptr;
return false;
1827}

1829#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1830LLVM_DUMP_METHOD__attribute__((noinline)) __attribute__((__used__)) void RecordVal::dump() const { errs() << *this; }
1831#endif

1833void RecordVal::print(raw_ostream &OS, bool PrintSem) const {
if (getPrefix()) OS << "field ";
OS << *getType() << " " << getNameInitAsString();

if (getValue())
  OS << " = " << *getValue();

if (PrintSem) OS << ";\n";
1841}

1843unsigned Record::LastID = 0;

1845void Record::init() {
checkName();

// Every record potentially has a def at the top.  This value is
// replaced with the top-level def name at instantiation time.
addValue(RecordVal(StringInit::get("NAME"), StringRecTy::get(), false));
1851}

1853void Record::checkName() {
// Ensure the record name has string type.
const TypedInit *TypedName = cast<const TypedInit>(Name);
if (!isa<StringRecTy>(TypedName->getType()))
  PrintFatalError(getLoc(), Twine("Record name '") + Name->getAsString() +
                                "' is not a string!");
1859}

1861RecordRecTy *Record::getType() {
SmallVector<Record *, 4> DirectSCs;
getDirectSuperClasses(DirectSCs);
return RecordRecTy::get(DirectSCs);
1865}

1867DefInit *Record::getDefInit() {
if (!TheInit)
  TheInit = new(Allocator) DefInit(this);
return TheInit;
1871}

1873void Record::setName(Init *NewName) {
Name = NewName;
checkName();
// DO NOT resolve record values to the name at this point because
// there might be default values for arguments of this def.  Those
// arguments might not have been resolved yet so we don't want to
// prematurely assume values for those arguments were not passed to
// this def.
//
// Nonetheless, it may be that some of this Record's values
// reference the record name.  Indeed, the reason for having the
// record name be an Init is to provide this flexibility.  The extra
// resolve steps after completely instantiating defs takes care of
// this.  See TGParser::ParseDef and TGParser::ParseDefm.
1887}

1889void Record::getDirectSuperClasses(SmallVectorImpl<Record *> &Classes) const {
ArrayRef<std::pair<Record *, SMRange>> SCs = getSuperClasses();
while (!SCs.empty()) {
  // Superclasses are in reverse preorder, so 'back' is a direct superclass,
  // and its transitive superclasses are directly preceding it.
  Record *SC = SCs.back().first;
  SCs = SCs.drop_back(1 + SC->getSuperClasses().size());
  Classes.push_back(SC);
}
1898}

1900void Record::resolveReferences(Resolver &R, const RecordVal *SkipVal) {
for (RecordVal &Value : Values) {
  if (SkipVal == &Value) // Skip resolve the same field as the given one
    continue;
  if (Init *V = Value.getValue()) {
    Init *VR = V->resolveReferences(R);
    if (Value.setValue(VR)) {
      std::string Type;
      if (TypedInit *VRT = dyn_cast<TypedInit>(VR))
        Type =
            (Twine("of type '") + VRT->getType()->getAsString() + "' ").str();
      PrintFatalError(getLoc(), Twine("Invalid value ") + Type +
                                    "is found when setting '" +
                                    Value.getNameInitAsString() +
                                    "' of type '" +
                                    Value.getType()->getAsString() +
                                    "' after resolving references: " +
                                    VR->getAsUnquotedString() + "\n");
    }
  }
}
Init *OldName = getNameInit();
Init *NewName = Name->resolveReferences(R);
if (NewName != OldName) {
  // Re-register with RecordKeeper.
  setName(NewName);
}
1927}

1929void Record::resolveReferences() {
RecordResolver R(*this);
R.setFinal(true);
resolveReferences(R);
1933}

1935void Record::resolveReferencesTo(const RecordVal *RV) {
RecordValResolver R(*this, RV);
resolveReferences(R, RV);
1938}

1940#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1941LLVM_DUMP_METHOD__attribute__((noinline)) __attribute__((__used__)) void Record::dump() const { errs() << *this; }
1942#endif

1944raw_ostream &llvm::operator<<(raw_ostream &OS, const Record &R) {
OS << R.getNameInitAsString();

ArrayRef<Init *> TArgs = R.getTemplateArgs();
if (!TArgs.empty()) {
  OS << "<";
  bool NeedComma = false;
  for (const Init *TA : TArgs) {
    if (NeedComma) OS << ", ";
    NeedComma = true;
    const RecordVal *RV = R.getValue(TA);
    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/Record.cpp"
, 1955, __extension__ __PRETTY_FUNCTION__));
    RV->print(OS, false);
  }
  OS << ">";
}

OS << " {";
ArrayRef<std::pair<Record *, SMRange>> SC = R.getSuperClasses();
if (!SC.empty()) {
  OS << "\t//";
  for (const auto &SuperPair : SC)
    OS << " " << SuperPair.first->getNameInitAsString();
}
OS << "\n";

for (const RecordVal &Val : R.getValues())
  if (Val.getPrefix() && !R.isTemplateArg(Val.getNameInit()))
    OS << Val;
for (const RecordVal &Val : R.getValues())
  if (!Val.getPrefix() && !R.isTemplateArg(Val.getNameInit()))
    OS << Val;

return OS << "}\n";
1978}

1980Init *Record::getValueInit(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");
return R->getValue();
1986}

1988StringRef Record::getValueAsString(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (StringInit *SI = dyn_cast<StringInit>(R->getValue()))
  return SI->getValue();
if (CodeInit *CI = dyn_cast<CodeInit>(R->getValue()))
  return CI->getValue();

PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
  FieldName + "' does not have a string initializer!");
2001}

2003BitsInit *Record::getValueAsBitsInit(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (BitsInit *BI = dyn_cast<BitsInit>(R->getValue()))
  return BI;
PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
  FieldName + "' does not have a BitsInit initializer!");
2013}

2015ListInit *Record::getValueAsListInit(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (ListInit *LI = dyn_cast<ListInit>(R->getValue()))
  return LI;
PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
  FieldName + "' does not have a list initializer!");
2025}

2027std::vector<Record*>
2028Record::getValueAsListOfDefs(StringRef FieldName) const {
ListInit *List = getValueAsListInit(FieldName);
std::vector<Record*> Defs;
for (Init *I : List->getValues()) {
  if (DefInit *DI = dyn_cast<DefInit>(I))
    Defs.push_back(DI->getDef());
  else
    PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
      FieldName + "' list is not entirely DefInit!");
}
return Defs;
2039}

2041int64_t Record::getValueAsInt(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (IntInit *II = dyn_cast<IntInit>(R->getValue()))
  return II->getValue();
PrintFatalError(getLoc(), Twine("Record `") + getName() + "', field `" +
                              FieldName +
                              "' does not have an int initializer: " +
                              R->getValue()->getAsString());
2053}

2055std::vector<int64_t>
2056Record::getValueAsListOfInts(StringRef FieldName) const {
ListInit *List = getValueAsListInit(FieldName);
std::vector<int64_t> Ints;
for (Init *I : List->getValues()) {
  if (IntInit *II = dyn_cast<IntInit>(I))
    Ints.push_back(II->getValue());
  else
    PrintFatalError(getLoc(),
                    Twine("Record `") + getName() + "', field `" + FieldName +
                        "' does not have a list of ints initializer: " +
                        I->getAsString());
}
return Ints;
2069}

2071std::vector<StringRef>
2072Record::getValueAsListOfStrings(StringRef FieldName) const {
ListInit *List = getValueAsListInit(FieldName);
std::vector<StringRef> Strings;
for (Init *I : List->getValues()) {
  if (StringInit *SI = dyn_cast<StringInit>(I))
    Strings.push_back(SI->getValue());
  else
    PrintFatalError(getLoc(),
                    Twine("Record `") + getName() + "', field `" + FieldName +
                        "' does not have a list of strings initializer: " +
                        I->getAsString());
}
return Strings;
2085}

2087Record *Record::getValueAsDef(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (DefInit *DI = dyn_cast<DefInit>(R->getValue()))
  return DI->getDef();
PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
  FieldName + "' does not have a def initializer!");
2097}

2099bool Record::getValueAsBit(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (BitInit *BI = dyn_cast<BitInit>(R->getValue()))
  return BI->getValue();
PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
  FieldName + "' does not have a bit initializer!");
2109}

2111bool Record::getValueAsBitOrUnset(StringRef FieldName, bool &Unset) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName.str() + "'!\n");

if (isa<UnsetInit>(R->getValue())) {
  Unset = true;
  return false;
}
Unset = false;
if (BitInit *BI = dyn_cast<BitInit>(R->getValue()))
  return BI->getValue();
PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
  FieldName + "' does not have a bit initializer!");
2126}

2128DagInit *Record::getValueAsDag(StringRef FieldName) const {
const RecordVal *R = getValue(FieldName);
if (!R || !R->getValue())
  PrintFatalError(getLoc(), "Record `" + getName() +
    "' does not have a field named `" + FieldName + "'!\n");

if (DagInit *DI = dyn_cast<DagInit>(R->getValue()))
  return DI;
PrintFatalError(getLoc(), "Record `" + getName() + "', field `" +
  FieldName + "' does not have a dag initializer!");
2138}

2140#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2141LLVM_DUMP_METHOD__attribute__((noinline)) __attribute__((__used__)) void MultiClass::dump() const {
errs() << "Record:\n";
Rec.dump();

errs() << "Defs:\n";
for (const auto &Proto : DefPrototypes)
  Proto->dump();
2148}

2150LLVM_DUMP_METHOD__attribute__((noinline)) __attribute__((__used__)) void RecordKeeper::dump() const { errs() << *this; }
2151#endif

2153raw_ostream &llvm::operator<<(raw_ostream &OS, const RecordKeeper &RK) {
OS << "------------- Classes -----------------\n";
for (const auto &C : RK.getClasses())
  OS << "class " << *C.second;

OS << "------------- Defs -----------------\n";
for (const auto &D : RK.getDefs())
  OS << "def " << *D.second;
return OS;
2162}

2164/// GetNewAnonymousName - Generate a unique anonymous name that can be used as
2165/// an identifier.
2166Init *RecordKeeper::getNewAnonymousName() {
return StringInit::get("anonymous_" + utostr(AnonCounter++));
2168}

2170std::vector<Record *>
2171RecordKeeper::getAllDerivedDefinitions(StringRef ClassName) const {
Record *Class = getClass(ClassName);
if (!Class)
  PrintFatalError("ERROR: Couldn't find the `" + ClassName + "' class!\n");

std::vector<Record*> Defs;
for (const auto &D : getDefs())
  if (D.second->isSubClassOf(Class))
    Defs.push_back(D.second.get());

return Defs;
2182}

2184Init *llvm::QualifyName(Record &CurRec, MultiClass *CurMultiClass,
                      Init *Name, StringRef Scoper) {
Init *NewName =
    BinOpInit::getStrConcat(CurRec.getNameInit(), StringInit::get(Scoper));
NewName = BinOpInit::getStrConcat(NewName, Name);
if (CurMultiClass && Scoper != "::") {
  Init *Prefix = BinOpInit::getStrConcat(CurMultiClass->Rec.getNameInit(),
                                         StringInit::get("::"));
  NewName = BinOpInit::getStrConcat(Prefix, NewName);
}

if (BinOpInit *BinOp = dyn_cast<BinOpInit>(NewName))
  NewName = BinOp->Fold(&CurRec);
return NewName;
2198}

2200Init *MapResolver::resolve(Init *VarName) {
auto It = Map.find(VarName);
if (It == Map.end())
  return nullptr;

Init *I = It->second.V;

if (!It->second.Resolved && Map.size() > 1) {
  // Resolve mutual references among the mapped variables, but prevent
  // infinite recursion.
  Map.erase(It);
  I = I->resolveReferences(*this);
  Map[VarName] = {I, true};
}

return I;
2216}

2218Init *RecordResolver::resolve(Init *VarName) {
Init *Val = Cache.lookup(VarName);
if (Val)
  return Val;

for (Init *S : Stack) {
  if (S == VarName)
    return nullptr; // prevent infinite recursion
}

if (RecordVal *RV = getCurrentRecord()->getValue(VarName)) {
  if (!isa<UnsetInit>(RV->getValue())) {
    Val = RV->getValue();
    Stack.push_back(VarName);
    Val = Val->resolveReferences(*this);
    Stack.pop_back();
  }
}

Cache[VarName] = Val;
return Val;
2239}

2241Init *TrackUnresolvedResolver::resolve(Init *VarName) {
Init *I = nullptr;

if (R) {
  I = R->resolve(VarName);
  if (I && !FoundUnresolved) {
    // Do not recurse into the resolved initializer, as that would change
    // the behavior of the resolver we're delegating, but do check to see
    // if there are unresolved variables remaining.
    TrackUnresolvedResolver Sub;
    I->resolveReferences(Sub);
    FoundUnresolved |= Sub.FoundUnresolved;
  }
}

if (!I)
  FoundUnresolved = true;
return I;
2259}

←

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

→

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