/build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/llvm/utils/TableGen/CodeGenDAGPatterns.cpp

Bug Summary

File:	llvm/utils/TableGen/CodeGenDAGPatterns.cpp
Warning:	line 1822, column 7 Called C++ object pointer is null

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name CodeGenDAGPatterns.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -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 -setup-static-analyzer -analyzer-config-compatibility-mode=true -mrelocation-model pic -pic-level 2 -mframe-pointer=none -fmath-errno -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -ffunction-sections -fdata-sections -fcoverage-compilation-dir=/build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/build-llvm/utils/TableGen -resource-dir /usr/lib/llvm-14/lib/clang/14.0.0 -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I /build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/build-llvm/utils/TableGen -I /build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/llvm/utils/TableGen -I /build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/build-llvm/include -I /build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/llvm/include -D NDEBUG -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/c++/10 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/x86_64-linux-gnu/c++/10 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/c++/10/backward -internal-isystem /usr/lib/llvm-14/lib/clang/14.0.0/include -internal-isystem /usr/local/include -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../x86_64-linux-gnu/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-class-memaccess -Wno-redundant-move -Wno-pessimizing-move -Wno-noexcept-type -Wno-comment -std=c++14 -fdeprecated-macro -fdebug-compilation-dir=/build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/build-llvm/utils/TableGen -fdebug-prefix-map=/build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e=. -ferror-limit 19 -fvisibility-inlines-hidden -stack-protector 2 -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -analyzer-output=html -analyzer-config stable-report-filename=true -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /tmp/scan-build-2021-09-04-040900-46481-1 -x c++ /build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/llvm/utils/TableGen/CodeGenDAGPatterns.cpp

/build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/llvm/utils/TableGen/CodeGenDAGPatterns.cpp

→

1//===- CodeGenDAGPatterns.cpp - Read DAG patterns from .td file -----------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// This file implements the CodeGenDAGPatterns class, which is used to read and
10// represent the patterns present in a .td file for instructions.
11//
12//===----------------------------------------------------------------------===//

14#include "CodeGenDAGPatterns.h"
15#include "llvm/ADT/DenseSet.h"
16#include "llvm/ADT/MapVector.h"
17#include "llvm/ADT/STLExtras.h"
18#include "llvm/ADT/SmallSet.h"
19#include "llvm/ADT/SmallString.h"
20#include "llvm/ADT/StringExtras.h"
21#include "llvm/ADT/StringMap.h"
22#include "llvm/ADT/Twine.h"
23#include "llvm/Support/Debug.h"
24#include "llvm/Support/ErrorHandling.h"
25#include "llvm/Support/TypeSize.h"
26#include "llvm/TableGen/Error.h"
27#include "llvm/TableGen/Record.h"
28#include <algorithm>
29#include <cstdio>
30#include <iterator>
31#include <set>
32using namespace llvm;

34#define DEBUG_TYPE"dag-patterns" "dag-patterns"

36static inline bool isIntegerOrPtr(MVT VT) {
return VT.isInteger() || VT == MVT::iPTR;
38}
39static inline bool isFloatingPoint(MVT VT) {
return VT.isFloatingPoint();
41}
42static inline bool isVector(MVT VT) {
return VT.isVector();
44}
45static inline bool isScalar(MVT VT) {
return !VT.isVector();
47}

49template <typename Predicate>
50static bool berase_if(MachineValueTypeSet &S, Predicate P) {
bool Erased = false;
// It is ok to iterate over MachineValueTypeSet and remove elements from it
// at the same time.
for (MVT T : S) {
  if (!P(T))
    continue;
  Erased = true;
  S.erase(T);
}
return Erased;
61}

63// --- TypeSetByHwMode

65// This is a parameterized type-set class. For each mode there is a list
66// of types that are currently possible for a given tree node. Type
67// inference will apply to each mode separately.

69TypeSetByHwMode::TypeSetByHwMode(ArrayRef<ValueTypeByHwMode> VTList) {
for (const ValueTypeByHwMode &VVT : VTList) {
  insert(VVT);
  AddrSpaces.push_back(VVT.PtrAddrSpace);
}
74}

76bool TypeSetByHwMode::isValueTypeByHwMode(bool AllowEmpty) const {
for (const auto &I : *this) {
  if (I.second.size() > 1)
    return false;
  if (!AllowEmpty && I.second.empty())
    return false;
}
return true;
84}

86ValueTypeByHwMode TypeSetByHwMode::getValueTypeByHwMode() const {
assert(isValueTypeByHwMode(true) &&(static_cast<void> (0))
       "The type set has multiple types for at least one HW mode")(static_cast<void> (0));
ValueTypeByHwMode VVT;
auto ASI = AddrSpaces.begin();

for (const auto &I : *this) {
  MVT T = I.second.empty() ? MVT::Other : *I.second.begin();
  VVT.getOrCreateTypeForMode(I.first, T);
  if (ASI != AddrSpaces.end())
    VVT.PtrAddrSpace = *ASI++;
}
return VVT;
99}

101bool TypeSetByHwMode::isPossible() const {
for (const auto &I : *this)
  if (!I.second.empty())
    return true;
return false;
106}

108bool TypeSetByHwMode::insert(const ValueTypeByHwMode &VVT) {
bool Changed = false;
bool ContainsDefault = false;
MVT DT = MVT::Other;

for (const auto &P : VVT) {
  unsigned M = P.first;
  // Make sure there exists a set for each specific mode from VVT.
  Changed |= getOrCreate(M).insert(P.second).second;
  // Cache VVT's default mode.
  if (DefaultMode == M) {
    ContainsDefault = true;
    DT = P.second;
  }
}

// If VVT has a default mode, add the corresponding type to all
// modes in "this" that do not exist in VVT.
if (ContainsDefault)
  for (auto &I : *this)
    if (!VVT.hasMode(I.first))
      Changed |= I.second.insert(DT).second;

return Changed;
132}

134// Constrain the type set to be the intersection with VTS.
135bool TypeSetByHwMode::constrain(const TypeSetByHwMode &VTS) {
bool Changed = false;
if (hasDefault()) {
  for (const auto &I : VTS) {
    unsigned M = I.first;
    if (M == DefaultMode || hasMode(M))
      continue;
    Map.insert({M, Map.at(DefaultMode)});
    Changed = true;
  }
}

for (auto &I : *this) {
  unsigned M = I.first;
  SetType &S = I.second;
  if (VTS.hasMode(M) || VTS.hasDefault()) {
    Changed |= intersect(I.second, VTS.get(M));
  } else if (!S.empty()) {
    S.clear();
    Changed = true;
  }
}
return Changed;
158}

160template <typename Predicate>
161bool TypeSetByHwMode::constrain(Predicate P) {
bool Changed = false;
for (auto &I : *this)
  Changed |= berase_if(I.second, [&P](MVT VT) { return !P(VT); });
return Changed;
166}

168template <typename Predicate>
169bool TypeSetByHwMode::assign_if(const TypeSetByHwMode &VTS, Predicate P) {
assert(empty())(static_cast<void> (0));
for (const auto &I : VTS) {
  SetType &S = getOrCreate(I.first);
  for (auto J : I.second)
    if (P(J))
      S.insert(J);
}
return !empty();
178}

180void TypeSetByHwMode::writeToStream(raw_ostream &OS) const {
SmallVector<unsigned, 4> Modes;
Modes.reserve(Map.size());

for (const auto &I : *this)
  Modes.push_back(I.first);
if (Modes.empty()) {
  OS << "{}";
  return;
}
array_pod_sort(Modes.begin(), Modes.end());

OS << '{';
for (unsigned M : Modes) {
  OS << ' ' << getModeName(M) << ':';
  writeToStream(get(M), OS);
}
OS << " }";
198}

200void TypeSetByHwMode::writeToStream(const SetType &S, raw_ostream &OS) {
SmallVector<MVT, 4> Types(S.begin(), S.end());
array_pod_sort(Types.begin(), Types.end());

OS << '[';
ListSeparator LS(" ");
for (const MVT &T : Types)
  OS << LS << ValueTypeByHwMode::getMVTName(T);
OS << ']';
209}

211bool TypeSetByHwMode::operator==(const TypeSetByHwMode &VTS) const {
// The isSimple call is much quicker than hasDefault - check this first.
bool IsSimple = isSimple();
bool VTSIsSimple = VTS.isSimple();
if (IsSimple && VTSIsSimple)
  return *begin() == *VTS.begin();

// Speedup: We have a default if the set is simple.
bool HaveDefault = IsSimple || hasDefault();
bool VTSHaveDefault = VTSIsSimple || VTS.hasDefault();
if (HaveDefault != VTSHaveDefault)
  return false;

SmallSet<unsigned, 4> Modes;
for (auto &I : *this)
  Modes.insert(I.first);
for (const auto &I : VTS)
  Modes.insert(I.first);

if (HaveDefault) {
  // Both sets have default mode.
  for (unsigned M : Modes) {
    if (get(M) != VTS.get(M))
      return false;
  }
} else {
  // Neither set has default mode.
  for (unsigned M : Modes) {
    // If there is no default mode, an empty set is equivalent to not having
    // the corresponding mode.
    bool NoModeThis = !hasMode(M) || get(M).empty();
    bool NoModeVTS = !VTS.hasMode(M) || VTS.get(M).empty();
    if (NoModeThis != NoModeVTS)
      return false;
    if (!NoModeThis)
      if (get(M) != VTS.get(M))
        return false;
  }
}

return true;
252}

254namespace llvm {
raw_ostream &operator<<(raw_ostream &OS, const TypeSetByHwMode &T) {
  T.writeToStream(OS);
  return OS;
}
259}

261LLVM_DUMP_METHOD__attribute__((noinline)) __attribute__((__used__))
262void TypeSetByHwMode::dump() const {
dbgs() << *this << '\n';
264}

266bool TypeSetByHwMode::intersect(SetType &Out, const SetType &In) {
bool OutP = Out.count(MVT::iPTR), InP = In.count(MVT::iPTR);
auto Int = [&In](MVT T) -> bool { return !In.count(T); };

if (OutP == InP)
  return berase_if(Out, Int);

// Compute the intersection of scalars separately to account for only
// one set containing iPTR.
// The intersection of iPTR with a set of integer scalar types that does not
// include iPTR will result in the most specific scalar type:
// - iPTR is more specific than any set with two elements or more
// - iPTR is less specific than any single integer scalar type.
// For example
// { iPTR } * { i32 }     -> { i32 }
// { iPTR } * { i32 i64 } -> { iPTR }
// and
// { iPTR i32 } * { i32 }          -> { i32 }
// { iPTR i32 } * { i32 i64 }      -> { i32 i64 }
// { iPTR i32 } * { i32 i64 i128 } -> { iPTR i32 }

// Compute the difference between the two sets in such a way that the
// iPTR is in the set that is being subtracted. This is to see if there
// are any extra scalars in the set without iPTR that are not in the
// set containing iPTR. Then the iPTR could be considered a "wildcard"
// matching these scalars. If there is only one such scalar, it would
// replace the iPTR, if there are more, the iPTR would be retained.
SetType Diff;
if (InP) {
  Diff = Out;
  berase_if(Diff, [&In](MVT T) { return In.count(T); });
  // Pre-remove these elements and rely only on InP/OutP to determine
  // whether a change has been made.
  berase_if(Out, [&Diff](MVT T) { return Diff.count(T); });
} else {
  Diff = In;
  berase_if(Diff, [&Out](MVT T) { return Out.count(T); });
  Out.erase(MVT::iPTR);
}

// The actual intersection.
bool Changed = berase_if(Out, Int);
unsigned NumD = Diff.size();
if (NumD == 0)
  return Changed;

if (NumD == 1) {
  Out.insert(*Diff.begin());
  // This is a change only if Out was the one with iPTR (which is now
  // being replaced).
  Changed |= OutP;
} else {
  // Multiple elements from Out are now replaced with iPTR.
  Out.insert(MVT::iPTR);
  Changed |= !OutP;
}
return Changed;
323}

325bool TypeSetByHwMode::validate() const {
326#ifndef NDEBUG1
if (empty())
  return true;
bool AllEmpty = true;
for (const auto &I : *this)
  AllEmpty &= I.second.empty();
return !AllEmpty;
333#endif
return true;
335}

337// --- TypeInfer

339bool TypeInfer::MergeInTypeInfo(TypeSetByHwMode &Out,
                              const TypeSetByHwMode &In) {
ValidateOnExit _1(Out, *this);
In.validate();
if (In.empty() || Out == In || TP.hasError())
  return false;
if (Out.empty()) {
  Out = In;
  return true;
}

bool Changed = Out.constrain(In);
if (Changed && Out.empty())
  TP.error("Type contradiction");

return Changed;
355}

357bool TypeInfer::forceArbitrary(TypeSetByHwMode &Out) {
ValidateOnExit _1(Out, *this);
if (TP.hasError())
  return false;
assert(!Out.empty() && "cannot pick from an empty set")(static_cast<void> (0));

bool Changed = false;
for (auto &I : Out) {
  TypeSetByHwMode::SetType &S = I.second;
  if (S.size() <= 1)
    continue;
  MVT T = *S.begin(); // Pick the first element.
  S.clear();
  S.insert(T);
  Changed = true;
}
return Changed;
374}

376bool TypeInfer::EnforceInteger(TypeSetByHwMode &Out) {
ValidateOnExit _1(Out, *this);
if (TP.hasError())
  return false;
if (!Out.empty())
  return Out.constrain(isIntegerOrPtr);

return Out.assign_if(getLegalTypes(), isIntegerOrPtr);
384}

386bool TypeInfer::EnforceFloatingPoint(TypeSetByHwMode &Out) {
ValidateOnExit _1(Out, *this);
if (TP.hasError())
  return false;
if (!Out.empty())
  return Out.constrain(isFloatingPoint);

return Out.assign_if(getLegalTypes(), isFloatingPoint);
394}

396bool TypeInfer::EnforceScalar(TypeSetByHwMode &Out) {
ValidateOnExit _1(Out, *this);
if (TP.hasError())
  return false;
if (!Out.empty())
  return Out.constrain(isScalar);

return Out.assign_if(getLegalTypes(), isScalar);
404}

406bool TypeInfer::EnforceVector(TypeSetByHwMode &Out) {
ValidateOnExit _1(Out, *this);
if (TP.hasError())
  return false;
if (!Out.empty())
  return Out.constrain(isVector);

return Out.assign_if(getLegalTypes(), isVector);
414}

416bool TypeInfer::EnforceAny(TypeSetByHwMode &Out) {
ValidateOnExit _1(Out, *this);
if (TP.hasError() || !Out.empty())
  return false;

Out = getLegalTypes();
return true;
423}

425template <typename Iter, typename Pred, typename Less>
426static Iter min_if(Iter B, Iter E, Pred P, Less L) {
if (B == E)
  return E;
Iter Min = E;
for (Iter I = B; I != E; ++I) {
  if (!P(*I))
    continue;
  if (Min == E || L(*I, *Min))
    Min = I;
}
return Min;
437}

439template <typename Iter, typename Pred, typename Less>
440static Iter max_if(Iter B, Iter E, Pred P, Less L) {
if (B == E)
  return E;
Iter Max = E;
for (Iter I = B; I != E; ++I) {
  if (!P(*I))
    continue;
  if (Max == E || L(*Max, *I))
    Max = I;
}
return Max;
451}

453/// Make sure that for each type in Small, there exists a larger type in Big.
454bool TypeInfer::EnforceSmallerThan(TypeSetByHwMode &Small,
                                 TypeSetByHwMode &Big) {
ValidateOnExit _1(Small, *this), _2(Big, *this);
if (TP.hasError())
  return false;
bool Changed = false;

if (Small.empty())
  Changed |= EnforceAny(Small);
if (Big.empty())
  Changed |= EnforceAny(Big);

assert(Small.hasDefault() && Big.hasDefault())(static_cast<void> (0));

SmallVector<unsigned, 4> Modes;
union_modes(Small, Big, Modes);

// 1. Only allow integer or floating point types and make sure that
//    both sides are both integer or both floating point.
// 2. Make sure that either both sides have vector types, or neither
//    of them does.
for (unsigned M : Modes) {
  TypeSetByHwMode::SetType &S = Small.get(M);
  TypeSetByHwMode::SetType &B = Big.get(M);

  if (any_of(S, isIntegerOrPtr) && any_of(S, isIntegerOrPtr)) {
    auto NotInt = [](MVT VT) { return !isIntegerOrPtr(VT); };
    Changed |= berase_if(S, NotInt);
    Changed |= berase_if(B, NotInt);
  } else if (any_of(S, isFloatingPoint) && any_of(B, isFloatingPoint)) {
    auto NotFP = [](MVT VT) { return !isFloatingPoint(VT); };
    Changed |= berase_if(S, NotFP);
    Changed |= berase_if(B, NotFP);
  } else if (S.empty() || B.empty()) {
    Changed = !S.empty() || !B.empty();
    S.clear();
    B.clear();
  } else {
    TP.error("Incompatible types");
    return Changed;
  }

  if (none_of(S, isVector) || none_of(B, isVector)) {
    Changed |= berase_if(S, isVector);
    Changed |= berase_if(B, isVector);
  }
}

auto LT = [](MVT A, MVT B) -> bool {
  // Always treat non-scalable MVTs as smaller than scalable MVTs for the
  // purposes of ordering.
  auto ASize = std::make_tuple(A.isScalableVector(), A.getScalarSizeInBits(),
                               A.getSizeInBits().getKnownMinSize());
  auto BSize = std::make_tuple(B.isScalableVector(), B.getScalarSizeInBits(),
                               B.getSizeInBits().getKnownMinSize());
  return ASize < BSize;
};
auto SameKindLE = [](MVT A, MVT B) -> bool {
  // This function is used when removing elements: when a vector is compared
  // to a non-vector or a scalable vector to any non-scalable MVT, it should
  // return false (to avoid removal).
  if (std::make_tuple(A.isVector(), A.isScalableVector()) !=
      std::make_tuple(B.isVector(), B.isScalableVector()))
    return false;

  return std::make_tuple(A.getScalarSizeInBits(),
                         A.getSizeInBits().getKnownMinSize()) <=
         std::make_tuple(B.getScalarSizeInBits(),
                         B.getSizeInBits().getKnownMinSize());
};

for (unsigned M : Modes) {
  TypeSetByHwMode::SetType &S = Small.get(M);
  TypeSetByHwMode::SetType &B = Big.get(M);
  // MinS = min scalar in Small, remove all scalars from Big that are
  // smaller-or-equal than MinS.
  auto MinS = min_if(S.begin(), S.end(), isScalar, LT);
  if (MinS != S.end())
    Changed |= berase_if(B, std::bind(SameKindLE,
                                      std::placeholders::_1, *MinS));

  // MaxS = max scalar in Big, remove all scalars from Small that are
  // larger than MaxS.
  auto MaxS = max_if(B.begin(), B.end(), isScalar, LT);
  if (MaxS != B.end())
    Changed |= berase_if(S, std::bind(SameKindLE,
                                      *MaxS, std::placeholders::_1));

  // MinV = min vector in Small, remove all vectors from Big that are
  // smaller-or-equal than MinV.
  auto MinV = min_if(S.begin(), S.end(), isVector, LT);
  if (MinV != S.end())
    Changed |= berase_if(B, std::bind(SameKindLE,
                                      std::placeholders::_1, *MinV));

  // MaxV = max vector in Big, remove all vectors from Small that are
  // larger than MaxV.
  auto MaxV = max_if(B.begin(), B.end(), isVector, LT);
  if (MaxV != B.end())
    Changed |= berase_if(S, std::bind(SameKindLE,
                                      *MaxV, std::placeholders::_1));
}

return Changed;
558}

560/// 1. Ensure that for each type T in Vec, T is a vector type, and that
561///    for each type U in Elem, U is a scalar type.
562/// 2. Ensure that for each (scalar) type U in Elem, there exists a (vector)
563///    type T in Vec, such that U is the element type of T.
564bool TypeInfer::EnforceVectorEltTypeIs(TypeSetByHwMode &Vec,
                                     TypeSetByHwMode &Elem) {
ValidateOnExit _1(Vec, *this), _2(Elem, *this);
if (TP.hasError())
  return false;
bool Changed = false;

if (Vec.empty())
  Changed |= EnforceVector(Vec);
if (Elem.empty())
  Changed |= EnforceScalar(Elem);

SmallVector<unsigned, 4> Modes;
union_modes(Vec, Elem, Modes);
for (unsigned M : Modes) {
  TypeSetByHwMode::SetType &V = Vec.get(M);
  TypeSetByHwMode::SetType &E = Elem.get(M);

  Changed |= berase_if(V, isScalar);  // Scalar = !vector
  Changed |= berase_if(E, isVector);  // Vector = !scalar
  assert(!V.empty() && !E.empty())(static_cast<void> (0));

  MachineValueTypeSet VT, ST;
  // Collect element types from the "vector" set.
  for (MVT T : V)
    VT.insert(T.getVectorElementType());
  // Collect scalar types from the "element" set.
  for (MVT T : E)
    ST.insert(T);

  // Remove from V all (vector) types whose element type is not in S.
  Changed |= berase_if(V, [&ST](MVT T) -> bool {
                            return !ST.count(T.getVectorElementType());
                          });
  // Remove from E all (scalar) types, for which there is no corresponding
  // type in V.
  Changed |= berase_if(E, [&VT](MVT T) -> bool { return !VT.count(T); });
}

return Changed;
604}

606bool TypeInfer::EnforceVectorEltTypeIs(TypeSetByHwMode &Vec,
                                     const ValueTypeByHwMode &VVT) {
TypeSetByHwMode Tmp(VVT);
ValidateOnExit _1(Vec, *this), _2(Tmp, *this);
return EnforceVectorEltTypeIs(Vec, Tmp);
611}

613/// Ensure that for each type T in Sub, T is a vector type, and there
614/// exists a type U in Vec such that U is a vector type with the same
615/// element type as T and at least as many elements as T.
616bool TypeInfer::EnforceVectorSubVectorTypeIs(TypeSetByHwMode &Vec,
                                           TypeSetByHwMode &Sub) {
ValidateOnExit _1(Vec, *this), _2(Sub, *this);
if (TP.hasError())
  return false;

/// Return true if B is a suB-vector of P, i.e. P is a suPer-vector of B.
auto IsSubVec = [](MVT B, MVT P) -> bool {
  if (!B.isVector() || !P.isVector())
    return false;
  // Logically a <4 x i32> is a valid subvector of <n x 4 x i32>
  // but until there are obvious use-cases for this, keep the
  // types separate.
  if (B.isScalableVector() != P.isScalableVector())
    return false;
  if (B.getVectorElementType() != P.getVectorElementType())
    return false;
  return B.getVectorMinNumElements() < P.getVectorMinNumElements();
};

/// Return true if S has no element (vector type) that T is a sub-vector of,
/// i.e. has the same element type as T and more elements.
auto NoSubV = [&IsSubVec](const TypeSetByHwMode::SetType &S, MVT T) -> bool {
  for (auto I : S)
    if (IsSubVec(T, I))
      return false;
  return true;
};

/// Return true if S has no element (vector type) that T is a super-vector
/// of, i.e. has the same element type as T and fewer elements.
auto NoSupV = [&IsSubVec](const TypeSetByHwMode::SetType &S, MVT T) -> bool {
  for (auto I : S)
    if (IsSubVec(I, T))
      return false;
  return true;
};

bool Changed = false;

if (Vec.empty())
  Changed |= EnforceVector(Vec);
if (Sub.empty())
  Changed |= EnforceVector(Sub);

SmallVector<unsigned, 4> Modes;
union_modes(Vec, Sub, Modes);
for (unsigned M : Modes) {
  TypeSetByHwMode::SetType &S = Sub.get(M);
  TypeSetByHwMode::SetType &V = Vec.get(M);

  Changed |= berase_if(S, isScalar);

  // Erase all types from S that are not sub-vectors of a type in V.
  Changed |= berase_if(S, std::bind(NoSubV, V, std::placeholders::_1));

  // Erase all types from V that are not super-vectors of a type in S.
  Changed |= berase_if(V, std::bind(NoSupV, S, std::placeholders::_1));
}

return Changed;
677}

679/// 1. Ensure that V has a scalar type iff W has a scalar type.
680/// 2. Ensure that for each vector type T in V, there exists a vector
681///    type U in W, such that T and U have the same number of elements.
682/// 3. Ensure that for each vector type U in W, there exists a vector
683///    type T in V, such that T and U have the same number of elements
684///    (reverse of 2).
685bool TypeInfer::EnforceSameNumElts(TypeSetByHwMode &V, TypeSetByHwMode &W) {
ValidateOnExit _1(V, *this), _2(W, *this);
if (TP.hasError())
  return false;

bool Changed = false;
if (V.empty())
  Changed |= EnforceAny(V);
if (W.empty())
  Changed |= EnforceAny(W);

// An actual vector type cannot have 0 elements, so we can treat scalars
// as zero-length vectors. This way both vectors and scalars can be
// processed identically.
auto NoLength = [](const SmallDenseSet<ElementCount> &Lengths,
                   MVT T) -> bool {
  return !Lengths.count(T.isVector() ? T.getVectorElementCount()
                                     : ElementCount::getNull());
};

SmallVector<unsigned, 4> Modes;
union_modes(V, W, Modes);
for (unsigned M : Modes) {
  TypeSetByHwMode::SetType &VS = V.get(M);
  TypeSetByHwMode::SetType &WS = W.get(M);

  SmallDenseSet<ElementCount> VN, WN;
  for (MVT T : VS)
    VN.insert(T.isVector() ? T.getVectorElementCount()
                           : ElementCount::getNull());
  for (MVT T : WS)
    WN.insert(T.isVector() ? T.getVectorElementCount()
                           : ElementCount::getNull());

  Changed |= berase_if(VS, std::bind(NoLength, WN, std::placeholders::_1));
  Changed |= berase_if(WS, std::bind(NoLength, VN, std::placeholders::_1));
}
return Changed;
723}

725namespace {
726struct TypeSizeComparator {
bool operator()(const TypeSize &LHS, const TypeSize &RHS) const {
  return std::make_tuple(LHS.isScalable(), LHS.getKnownMinValue()) <
         std::make_tuple(RHS.isScalable(), RHS.getKnownMinValue());
}
731};
732} // end anonymous namespace

734/// 1. Ensure that for each type T in A, there exists a type U in B,
735///    such that T and U have equal size in bits.
736/// 2. Ensure that for each type U in B, there exists a type T in A
737///    such that T and U have equal size in bits (reverse of 1).
738bool TypeInfer::EnforceSameSize(TypeSetByHwMode &A, TypeSetByHwMode &B) {
ValidateOnExit _1(A, *this), _2(B, *this);
if (TP.hasError())
  return false;
bool Changed = false;
if (A.empty())
  Changed |= EnforceAny(A);
if (B.empty())
  Changed |= EnforceAny(B);

typedef SmallSet<TypeSize, 2, TypeSizeComparator> TypeSizeSet;

auto NoSize = [](const TypeSizeSet &Sizes, MVT T) -> bool {
  return !Sizes.count(T.getSizeInBits());
};

SmallVector<unsigned, 4> Modes;
union_modes(A, B, Modes);
for (unsigned M : Modes) {
  TypeSetByHwMode::SetType &AS = A.get(M);
  TypeSetByHwMode::SetType &BS = B.get(M);
  TypeSizeSet AN, BN;

  for (MVT T : AS)
    AN.insert(T.getSizeInBits());
  for (MVT T : BS)
    BN.insert(T.getSizeInBits());

  Changed |= berase_if(AS, std::bind(NoSize, BN, std::placeholders::_1));
  Changed |= berase_if(BS, std::bind(NoSize, AN, std::placeholders::_1));
}

return Changed;
771}

773void TypeInfer::expandOverloads(TypeSetByHwMode &VTS) {
ValidateOnExit _1(VTS, *this);
const TypeSetByHwMode &Legal = getLegalTypes();
assert(Legal.isDefaultOnly() && "Default-mode only expected")(static_cast<void> (0));
const TypeSetByHwMode::SetType &LegalTypes = Legal.get(DefaultMode);

for (auto &I : VTS)
  expandOverloads(I.second, LegalTypes);
781}

783void TypeInfer::expandOverloads(TypeSetByHwMode::SetType &Out,
                              const TypeSetByHwMode::SetType &Legal) {
std::set<MVT> Ovs;
for (MVT T : Out) {
  if (!T.isOverloaded())
    continue;

  Ovs.insert(T);
  // MachineValueTypeSet allows iteration and erasing.
  Out.erase(T);
}

for (MVT Ov : Ovs) {
  switch (Ov.SimpleTy) {
    case MVT::iPTRAny:
      Out.insert(MVT::iPTR);
      return;
    case MVT::iAny:
      for (MVT T : MVT::integer_valuetypes())
        if (Legal.count(T))
          Out.insert(T);
      for (MVT T : MVT::integer_fixedlen_vector_valuetypes())
        if (Legal.count(T))
          Out.insert(T);
      for (MVT T : MVT::integer_scalable_vector_valuetypes())
        if (Legal.count(T))
          Out.insert(T);
      return;
    case MVT::fAny:
      for (MVT T : MVT::fp_valuetypes())
        if (Legal.count(T))
          Out.insert(T);
      for (MVT T : MVT::fp_fixedlen_vector_valuetypes())
        if (Legal.count(T))
          Out.insert(T);
      for (MVT T : MVT::fp_scalable_vector_valuetypes())
        if (Legal.count(T))
          Out.insert(T);
      return;
    case MVT::vAny:
      for (MVT T : MVT::vector_valuetypes())
        if (Legal.count(T))
          Out.insert(T);
      return;
    case MVT::Any:
      for (MVT T : MVT::all_valuetypes())
        if (Legal.count(T))
          Out.insert(T);
      return;
    default:
      break;
  }
}
836}

838const TypeSetByHwMode &TypeInfer::getLegalTypes() {
if (!LegalTypesCached) {
  TypeSetByHwMode::SetType &LegalTypes = LegalCache.getOrCreate(DefaultMode);
  // Stuff all types from all modes into the default mode.
  const TypeSetByHwMode &LTS = TP.getDAGPatterns().getLegalTypes();
  for (const auto &I : LTS)
    LegalTypes.insert(I.second);
  LegalTypesCached = true;
}
assert(LegalCache.isDefaultOnly() && "Default-mode only expected")(static_cast<void> (0));
return LegalCache;
849}

851#ifndef NDEBUG1
852TypeInfer::ValidateOnExit::~ValidateOnExit() {
if (Infer.Validate && !VTS.validate()) {
  dbgs() << "Type set is empty for each HW mode:\n"
            "possible type contradiction in the pattern below "
            "(use -print-records with llvm-tblgen to see all "
            "expanded records).\n";
  Infer.TP.dump();
  dbgs() << "Generated from record:\n";
  Infer.TP.getRecord()->dump();
  PrintFatalError(Infer.TP.getRecord()->getLoc(),
                  "Type set is empty for each HW mode in '" +
                      Infer.TP.getRecord()->getName() + "'");
}
865}
866#endif


869//===----------------------------------------------------------------------===//
870// ScopedName Implementation
871//===----------------------------------------------------------------------===//

873bool ScopedName::operator==(const ScopedName &o) const {
return Scope == o.Scope && Identifier == o.Identifier;
875}

877bool ScopedName::operator!=(const ScopedName &o) const {
return !(*this == o);
879}


882//===----------------------------------------------------------------------===//
883// TreePredicateFn Implementation
884//===----------------------------------------------------------------------===//

886/// TreePredicateFn constructor.  Here 'N' is a subclass of PatFrag.
887TreePredicateFn::TreePredicateFn(TreePattern *N) : PatFragRec(N) {
assert((static_cast<void> (0))
    (!hasPredCode() || !hasImmCode()) &&(static_cast<void> (0))
    ".td file corrupt: can't have a node predicate *and* an imm predicate")(static_cast<void> (0));
891}

893bool TreePredicateFn::hasPredCode() const {
return isLoad() || isStore() || isAtomic() ||
       !PatFragRec->getRecord()->getValueAsString("PredicateCode").empty();
896}

898std::string TreePredicateFn::getPredCode() const {
std::string Code;

if (!isLoad() && !isStore() && !isAtomic()) {
  Record *MemoryVT = getMemoryVT();

  if (MemoryVT)
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "MemoryVT requires IsLoad or IsStore");
}

if (!isLoad() && !isStore()) {
  if (isUnindexed())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsUnindexed requires IsLoad or IsStore");

  Record *ScalarMemoryVT = getScalarMemoryVT();

  if (ScalarMemoryVT)
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "ScalarMemoryVT requires IsLoad or IsStore");
}

if (isLoad() + isStore() + isAtomic() > 1)
  PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                  "IsLoad, IsStore, and IsAtomic are mutually exclusive");

if (isLoad()) {
  if (!isUnindexed() && !isNonExtLoad() && !isAnyExtLoad() &&
      !isSignExtLoad() && !isZeroExtLoad() && getMemoryVT() == nullptr &&
      getScalarMemoryVT() == nullptr && getAddressSpaces() == nullptr &&
      getMinAlignment() < 1)
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsLoad cannot be used by itself");
} else {
  if (isNonExtLoad())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsNonExtLoad requires IsLoad");
  if (isAnyExtLoad())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsAnyExtLoad requires IsLoad");
  if (isSignExtLoad())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsSignExtLoad requires IsLoad");
  if (isZeroExtLoad())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsZeroExtLoad requires IsLoad");
}

if (isStore()) {
  if (!isUnindexed() && !isTruncStore() && !isNonTruncStore() &&
      getMemoryVT() == nullptr && getScalarMemoryVT() == nullptr &&
      getAddressSpaces() == nullptr && getMinAlignment() < 1)
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsStore cannot be used by itself");
} else {
  if (isNonTruncStore())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsNonTruncStore requires IsStore");
  if (isTruncStore())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsTruncStore requires IsStore");
}

if (isAtomic()) {
  if (getMemoryVT() == nullptr && !isAtomicOrderingMonotonic() &&
      getAddressSpaces() == nullptr &&
      !isAtomicOrderingAcquire() && !isAtomicOrderingRelease() &&
      !isAtomicOrderingAcquireRelease() &&
      !isAtomicOrderingSequentiallyConsistent() &&
      !isAtomicOrderingAcquireOrStronger() &&
      !isAtomicOrderingReleaseOrStronger() &&
      !isAtomicOrderingWeakerThanAcquire() &&
      !isAtomicOrderingWeakerThanRelease())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsAtomic cannot be used by itself");
} else {
  if (isAtomicOrderingMonotonic())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsAtomicOrderingMonotonic requires IsAtomic");
  if (isAtomicOrderingAcquire())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsAtomicOrderingAcquire requires IsAtomic");
  if (isAtomicOrderingRelease())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsAtomicOrderingRelease requires IsAtomic");
  if (isAtomicOrderingAcquireRelease())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsAtomicOrderingAcquireRelease requires IsAtomic");
  if (isAtomicOrderingSequentiallyConsistent())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsAtomicOrderingSequentiallyConsistent requires IsAtomic");
  if (isAtomicOrderingAcquireOrStronger())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsAtomicOrderingAcquireOrStronger requires IsAtomic");
  if (isAtomicOrderingReleaseOrStronger())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsAtomicOrderingReleaseOrStronger requires IsAtomic");
  if (isAtomicOrderingWeakerThanAcquire())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsAtomicOrderingWeakerThanAcquire requires IsAtomic");
}

if (isLoad() || isStore() || isAtomic()) {
  if (ListInit *AddressSpaces = getAddressSpaces()) {
    Code += "unsigned AddrSpace = cast<MemSDNode>(N)->getAddressSpace();\n"
      " if (";

    ListSeparator LS(" && ");
    for (Init *Val : AddressSpaces->getValues()) {
      Code += LS;

      IntInit *IntVal = dyn_cast<IntInit>(Val);
      if (!IntVal) {
        PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                        "AddressSpaces element must be integer");
      }

      Code += "AddrSpace != " + utostr(IntVal->getValue());
    }

    Code += ")\nreturn false;\n";
  }

  int64_t MinAlign = getMinAlignment();
  if (MinAlign > 0) {
    Code += "if (cast<MemSDNode>(N)->getAlign() < Align(";
    Code += utostr(MinAlign);
    Code += "))\nreturn false;\n";
  }

  Record *MemoryVT = getMemoryVT();

  if (MemoryVT)
    Code += ("if (cast<MemSDNode>(N)->getMemoryVT() != MVT::" +
             MemoryVT->getName() + ") return false;\n")
                .str();
}

if (isAtomic() && isAtomicOrderingMonotonic())
  Code += "if (cast<AtomicSDNode>(N)->getMergedOrdering() != "
          "AtomicOrdering::Monotonic) return false;\n";
if (isAtomic() && isAtomicOrderingAcquire())
  Code += "if (cast<AtomicSDNode>(N)->getMergedOrdering() != "
          "AtomicOrdering::Acquire) return false;\n";
if (isAtomic() && isAtomicOrderingRelease())
  Code += "if (cast<AtomicSDNode>(N)->getMergedOrdering() != "
          "AtomicOrdering::Release) return false;\n";
if (isAtomic() && isAtomicOrderingAcquireRelease())
  Code += "if (cast<AtomicSDNode>(N)->getMergedOrdering() != "
          "AtomicOrdering::AcquireRelease) return false;\n";
if (isAtomic() && isAtomicOrderingSequentiallyConsistent())
  Code += "if (cast<AtomicSDNode>(N)->getMergedOrdering() != "
          "AtomicOrdering::SequentiallyConsistent) return false;\n";

if (isAtomic() && isAtomicOrderingAcquireOrStronger())
  Code += "if (!isAcquireOrStronger(cast<AtomicSDNode>(N)->getMergedOrdering())) "
          "return false;\n";
if (isAtomic() && isAtomicOrderingWeakerThanAcquire())
  Code += "if (isAcquireOrStronger(cast<AtomicSDNode>(N)->getMergedOrdering())) "
          "return false;\n";

if (isAtomic() && isAtomicOrderingReleaseOrStronger())
  Code += "if (!isReleaseOrStronger(cast<AtomicSDNode>(N)->getMergedOrdering())) "
          "return false;\n";
if (isAtomic() && isAtomicOrderingWeakerThanRelease())
  Code += "if (isReleaseOrStronger(cast<AtomicSDNode>(N)->getMergedOrdering())) "
          "return false;\n";

if (isLoad() || isStore()) {
  StringRef SDNodeName = isLoad() ? "LoadSDNode" : "StoreSDNode";

  if (isUnindexed())
    Code += ("if (cast<" + SDNodeName +
             ">(N)->getAddressingMode() != ISD::UNINDEXED) "
             "return false;\n")
                .str();

  if (isLoad()) {
    if ((isNonExtLoad() + isAnyExtLoad() + isSignExtLoad() +
         isZeroExtLoad()) > 1)
      PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                      "IsNonExtLoad, IsAnyExtLoad, IsSignExtLoad, and "
                      "IsZeroExtLoad are mutually exclusive");
    if (isNonExtLoad())
      Code += "if (cast<LoadSDNode>(N)->getExtensionType() != "
              "ISD::NON_EXTLOAD) return false;\n";
    if (isAnyExtLoad())
      Code += "if (cast<LoadSDNode>(N)->getExtensionType() != ISD::EXTLOAD) "
              "return false;\n";
    if (isSignExtLoad())
      Code += "if (cast<LoadSDNode>(N)->getExtensionType() != ISD::SEXTLOAD) "
              "return false;\n";
    if (isZeroExtLoad())
      Code += "if (cast<LoadSDNode>(N)->getExtensionType() != ISD::ZEXTLOAD) "
              "return false;\n";
  } else {
    if ((isNonTruncStore() + isTruncStore()) > 1)
      PrintFatalError(
          getOrigPatFragRecord()->getRecord()->getLoc(),
          "IsNonTruncStore, and IsTruncStore are mutually exclusive");
    if (isNonTruncStore())
      Code +=
          " if (cast<StoreSDNode>(N)->isTruncatingStore()) return false;\n";
    if (isTruncStore())
      Code +=
          " if (!cast<StoreSDNode>(N)->isTruncatingStore()) return false;\n";
  }

  Record *ScalarMemoryVT = getScalarMemoryVT();

  if (ScalarMemoryVT)
    Code += ("if (cast<" + SDNodeName +
             ">(N)->getMemoryVT().getScalarType() != MVT::" +
             ScalarMemoryVT->getName() + ") return false;\n")
                .str();
}

std::string PredicateCode =
    std::string(PatFragRec->getRecord()->getValueAsString("PredicateCode"));

Code += PredicateCode;

if (PredicateCode.empty() && !Code.empty())
  Code += "return true;\n";

return Code;
1125}

1127bool TreePredicateFn::hasImmCode() const {
return !PatFragRec->getRecord()->getValueAsString("ImmediateCode").empty();
1129}

1131std::string TreePredicateFn::getImmCode() const {
return std::string(
    PatFragRec->getRecord()->getValueAsString("ImmediateCode"));
1134}

1136bool TreePredicateFn::immCodeUsesAPInt() const {
return getOrigPatFragRecord()->getRecord()->getValueAsBit("IsAPInt");
1138}

1140bool TreePredicateFn::immCodeUsesAPFloat() const {
bool Unset;
// The return value will be false when IsAPFloat is unset.
return getOrigPatFragRecord()->getRecord()->getValueAsBitOrUnset("IsAPFloat",
                                                                 Unset);
1145}

1147bool TreePredicateFn::isPredefinedPredicateEqualTo(StringRef Field,
                                                 bool Value) const {
bool Unset;
bool Result =
    getOrigPatFragRecord()->getRecord()->getValueAsBitOrUnset(Field, Unset);
if (Unset)
  return false;
return Result == Value;
1155}
1156bool TreePredicateFn::usesOperands() const {
return isPredefinedPredicateEqualTo("PredicateCodeUsesOperands", true);
1158}
1159bool TreePredicateFn::isLoad() const {
return isPredefinedPredicateEqualTo("IsLoad", true);
1161}
1162bool TreePredicateFn::isStore() const {
return isPredefinedPredicateEqualTo("IsStore", true);
1164}
1165bool TreePredicateFn::isAtomic() const {
return isPredefinedPredicateEqualTo("IsAtomic", true);
1167}
1168bool TreePredicateFn::isUnindexed() const {
return isPredefinedPredicateEqualTo("IsUnindexed", true);
1170}
1171bool TreePredicateFn::isNonExtLoad() const {
return isPredefinedPredicateEqualTo("IsNonExtLoad", true);
1173}
1174bool TreePredicateFn::isAnyExtLoad() const {
return isPredefinedPredicateEqualTo("IsAnyExtLoad", true);
1176}
1177bool TreePredicateFn::isSignExtLoad() const {
return isPredefinedPredicateEqualTo("IsSignExtLoad", true);
1179}
1180bool TreePredicateFn::isZeroExtLoad() const {
return isPredefinedPredicateEqualTo("IsZeroExtLoad", true);
1182}
1183bool TreePredicateFn::isNonTruncStore() const {
return isPredefinedPredicateEqualTo("IsTruncStore", false);
1185}
1186bool TreePredicateFn::isTruncStore() const {
return isPredefinedPredicateEqualTo("IsTruncStore", true);
1188}
1189bool TreePredicateFn::isAtomicOrderingMonotonic() const {
return isPredefinedPredicateEqualTo("IsAtomicOrderingMonotonic", true);
1191}
1192bool TreePredicateFn::isAtomicOrderingAcquire() const {
return isPredefinedPredicateEqualTo("IsAtomicOrderingAcquire", true);
1194}
1195bool TreePredicateFn::isAtomicOrderingRelease() const {
return isPredefinedPredicateEqualTo("IsAtomicOrderingRelease", true);
1197}
1198bool TreePredicateFn::isAtomicOrderingAcquireRelease() const {
return isPredefinedPredicateEqualTo("IsAtomicOrderingAcquireRelease", true);
1200}
1201bool TreePredicateFn::isAtomicOrderingSequentiallyConsistent() const {
return isPredefinedPredicateEqualTo("IsAtomicOrderingSequentiallyConsistent",
                                    true);
1204}
1205bool TreePredicateFn::isAtomicOrderingAcquireOrStronger() const {
return isPredefinedPredicateEqualTo("IsAtomicOrderingAcquireOrStronger", true);
1207}
1208bool TreePredicateFn::isAtomicOrderingWeakerThanAcquire() const {
return isPredefinedPredicateEqualTo("IsAtomicOrderingAcquireOrStronger", false);
1210}
1211bool TreePredicateFn::isAtomicOrderingReleaseOrStronger() const {
return isPredefinedPredicateEqualTo("IsAtomicOrderingReleaseOrStronger", true);
1213}
1214bool TreePredicateFn::isAtomicOrderingWeakerThanRelease() const {
return isPredefinedPredicateEqualTo("IsAtomicOrderingReleaseOrStronger", false);
1216}
1217Record *TreePredicateFn::getMemoryVT() const {
Record *R = getOrigPatFragRecord()->getRecord();
if (R->isValueUnset("MemoryVT"))
  return nullptr;
return R->getValueAsDef("MemoryVT");
1222}

1224ListInit *TreePredicateFn::getAddressSpaces() const {
Record *R = getOrigPatFragRecord()->getRecord();
if (R->isValueUnset("AddressSpaces"))
  return nullptr;
return R->getValueAsListInit("AddressSpaces");
1229}

1231int64_t TreePredicateFn::getMinAlignment() const {
Record *R = getOrigPatFragRecord()->getRecord();
if (R->isValueUnset("MinAlignment"))
  return 0;
return R->getValueAsInt("MinAlignment");
1236}

1238Record *TreePredicateFn::getScalarMemoryVT() const {
Record *R = getOrigPatFragRecord()->getRecord();
if (R->isValueUnset("ScalarMemoryVT"))
  return nullptr;
return R->getValueAsDef("ScalarMemoryVT");
1243}
1244bool TreePredicateFn::hasGISelPredicateCode() const {
return !PatFragRec->getRecord()
            ->getValueAsString("GISelPredicateCode")
            .empty();
1248}
1249std::string TreePredicateFn::getGISelPredicateCode() const {
return std::string(
    PatFragRec->getRecord()->getValueAsString("GISelPredicateCode"));
1252}

1254StringRef TreePredicateFn::getImmType() const {
if (immCodeUsesAPInt())
  return "const APInt &";
if (immCodeUsesAPFloat())
  return "const APFloat &";
return "int64_t";
1260}

1262StringRef TreePredicateFn::getImmTypeIdentifier() const {
if (immCodeUsesAPInt())
  return "APInt";
if (immCodeUsesAPFloat())
  return "APFloat";
return "I64";
1268}

1270/// isAlwaysTrue - Return true if this is a noop predicate.
1271bool TreePredicateFn::isAlwaysTrue() const {
return !hasPredCode() && !hasImmCode();
1273}

1275/// Return the name to use in the generated code to reference this, this is
1276/// "Predicate_foo" if from a pattern fragment "foo".
1277std::string TreePredicateFn::getFnName() const {
return "Predicate_" + PatFragRec->getRecord()->getName().str();
1279}

1281/// getCodeToRunOnSDNode - Return the code for the function body that
1282/// evaluates this predicate.  The argument is expected to be in "Node",
1283/// not N.  This handles casting and conversion to a concrete node type as
1284/// appropriate.
1285std::string TreePredicateFn::getCodeToRunOnSDNode() const {
// Handle immediate predicates first.
std::string ImmCode = getImmCode();
if (!ImmCode.empty()) {
  if (isLoad())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsLoad cannot be used with ImmLeaf or its subclasses");
  if (isStore())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "IsStore cannot be used with ImmLeaf or its subclasses");
  if (isUnindexed())
    PrintFatalError(
        getOrigPatFragRecord()->getRecord()->getLoc(),
        "IsUnindexed cannot be used with ImmLeaf or its subclasses");
  if (isNonExtLoad())
    PrintFatalError(
        getOrigPatFragRecord()->getRecord()->getLoc(),
        "IsNonExtLoad cannot be used with ImmLeaf or its subclasses");
  if (isAnyExtLoad())
    PrintFatalError(
        getOrigPatFragRecord()->getRecord()->getLoc(),
        "IsAnyExtLoad cannot be used with ImmLeaf or its subclasses");
  if (isSignExtLoad())
    PrintFatalError(
        getOrigPatFragRecord()->getRecord()->getLoc(),
        "IsSignExtLoad cannot be used with ImmLeaf or its subclasses");
  if (isZeroExtLoad())
    PrintFatalError(
        getOrigPatFragRecord()->getRecord()->getLoc(),
        "IsZeroExtLoad cannot be used with ImmLeaf or its subclasses");
  if (isNonTruncStore())
    PrintFatalError(
        getOrigPatFragRecord()->getRecord()->getLoc(),
        "IsNonTruncStore cannot be used with ImmLeaf or its subclasses");
  if (isTruncStore())
    PrintFatalError(
        getOrigPatFragRecord()->getRecord()->getLoc(),
        "IsTruncStore cannot be used with ImmLeaf or its subclasses");
  if (getMemoryVT())
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "MemoryVT cannot be used with ImmLeaf or its subclasses");
  if (getScalarMemoryVT())
    PrintFatalError(
        getOrigPatFragRecord()->getRecord()->getLoc(),
        "ScalarMemoryVT cannot be used with ImmLeaf or its subclasses");

  std::string Result = ("    " + getImmType() + " Imm = ").str();
  if (immCodeUsesAPFloat())
    Result += "cast<ConstantFPSDNode>(Node)->getValueAPF();\n";
  else if (immCodeUsesAPInt())
    Result += "cast<ConstantSDNode>(Node)->getAPIntValue();\n";
  else
    Result += "cast<ConstantSDNode>(Node)->getSExtValue();\n";
  return Result + ImmCode;
}

// Handle arbitrary node predicates.
assert(hasPredCode() && "Don't have any predicate code!")(static_cast<void> (0));

// If this is using PatFrags, there are multiple trees to search. They should
// all have the same class.  FIXME: Is there a way to find a common
// superclass?
StringRef ClassName;
for (const auto &Tree : PatFragRec->getTrees()) {
  StringRef TreeClassName;
  if (Tree->isLeaf())
    TreeClassName = "SDNode";
  else {
    Record *Op = Tree->getOperator();
    const SDNodeInfo &Info = PatFragRec->getDAGPatterns().getSDNodeInfo(Op);
    TreeClassName = Info.getSDClassName();
  }

  if (ClassName.empty())
    ClassName = TreeClassName;
  else if (ClassName != TreeClassName) {
    PrintFatalError(getOrigPatFragRecord()->getRecord()->getLoc(),
                    "PatFrags trees do not have consistent class");
  }
}

std::string Result;
if (ClassName == "SDNode")
  Result = "    SDNode *N = Node;\n";
else
  Result = "    auto *N = cast<" + ClassName.str() + ">(Node);\n";

return (Twine(Result) + "    (void)N;\n" + getPredCode()).str();
1373}

1375//===----------------------------------------------------------------------===//
1376// PatternToMatch implementation
1377//

1379static bool isImmAllOnesAllZerosMatch(const TreePatternNode *P) {
if (!P->isLeaf())
  return false;
DefInit *DI = dyn_cast<DefInit>(P->getLeafValue());
if (!DI)
  return false;

Record *R = DI->getDef();
return R->getName() == "immAllOnesV" || R->getName() == "immAllZerosV";
1388}

1390/// getPatternSize - Return the 'size' of this pattern.  We want to match large
1391/// patterns before small ones.  This is used to determine the size of a
1392/// pattern.
1393static unsigned getPatternSize(const TreePatternNode *P,
                             const CodeGenDAGPatterns &CGP) {
unsigned Size = 3;  // The node itself.
// If the root node is a ConstantSDNode, increases its size.
// e.g. (set R32:$dst, 0).
if (P->isLeaf() && isa<IntInit>(P->getLeafValue()))
  Size += 2;

if (const ComplexPattern *AM = P->getComplexPatternInfo(CGP)) {
  Size += AM->getComplexity();
  // We don't want to count any children twice, so return early.
  return Size;
}

// If this node has some predicate function that must match, it adds to the
// complexity of this node.
if (!P->getPredicateCalls().empty())
  ++Size;

// Count children in the count if they are also nodes.
for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
  const TreePatternNode *Child = P->getChild(i);
  if (!Child->isLeaf() && Child->getNumTypes()) {
    const TypeSetByHwMode &T0 = Child->getExtType(0);
    // At this point, all variable type sets should be simple, i.e. only
    // have a default mode.
    if (T0.getMachineValueType() != MVT::Other) {
      Size += getPatternSize(Child, CGP);
      continue;
    }
  }
  if (Child->isLeaf()) {
    if (isa<IntInit>(Child->getLeafValue()))
      Size += 5;  // Matches a ConstantSDNode (+3) and a specific value (+2).
    else if (Child->getComplexPatternInfo(CGP))
      Size += getPatternSize(Child, CGP);
    else if (isImmAllOnesAllZerosMatch(Child))
      Size += 4; // Matches a build_vector(+3) and a predicate (+1).
    else if (!Child->getPredicateCalls().empty())
      ++Size;
  }
}

return Size;
1437}

1439/// Compute the complexity metric for the input pattern.  This roughly
1440/// corresponds to the number of nodes that are covered.
1441int PatternToMatch::
1442getPatternComplexity(const CodeGenDAGPatterns &CGP) const {
return getPatternSize(getSrcPattern(), CGP) + getAddedComplexity();
1444}

1446void PatternToMatch::getPredicateRecords(
  SmallVectorImpl<Record *> &PredicateRecs) const {
for (Init *I : Predicates->getValues()) {
  if (DefInit *Pred = dyn_cast<DefInit>(I)) {
    Record *Def = Pred->getDef();
    if (!Def->isSubClassOf("Predicate")) {
1452#ifndef NDEBUG1
      Def->dump();
1454#endif
      llvm_unreachable("Unknown predicate type!")__builtin_unreachable();
    }
    PredicateRecs.push_back(Def);
  }
}
// Sort so that different orders get canonicalized to the same string.
llvm::sort(PredicateRecs, LessRecord());
1462}

1464/// getPredicateCheck - Return a single string containing all of this
1465/// pattern's predicates concatenated with "&&" operators.
1466///
1467std::string PatternToMatch::getPredicateCheck() const {
SmallVector<Record *, 4> PredicateRecs;
getPredicateRecords(PredicateRecs);

SmallString<128> PredicateCheck;
for (Record *Pred : PredicateRecs) {
  StringRef CondString = Pred->getValueAsString("CondString");
  if (CondString.empty())
    continue;
  if (!PredicateCheck.empty())
    PredicateCheck += " && ";
  PredicateCheck += "(";
  PredicateCheck += CondString;
  PredicateCheck += ")";
}

if (!HwModeFeatures.empty()) {
  if (!PredicateCheck.empty())
    PredicateCheck += " && ";
  PredicateCheck += HwModeFeatures;
}

return std::string(PredicateCheck);
1490}

1492//===----------------------------------------------------------------------===//
1493// SDTypeConstraint implementation
1494//

1496SDTypeConstraint::SDTypeConstraint(Record *R, const CodeGenHwModes &CGH) {
OperandNo = R->getValueAsInt("OperandNum");

if (R->isSubClassOf("SDTCisVT")) {
  ConstraintType = SDTCisVT;
  VVT = getValueTypeByHwMode(R->getValueAsDef("VT"), CGH);
  for (const auto &P : VVT)
    if (P.second == MVT::isVoid)
      PrintFatalError(R->getLoc(), "Cannot use 'Void' as type to SDTCisVT");
} else if (R->isSubClassOf("SDTCisPtrTy")) {
  ConstraintType = SDTCisPtrTy;
} else if (R->isSubClassOf("SDTCisInt")) {
  ConstraintType = SDTCisInt;
} else if (R->isSubClassOf("SDTCisFP")) {
  ConstraintType = SDTCisFP;
} else if (R->isSubClassOf("SDTCisVec")) {
  ConstraintType = SDTCisVec;
} else if (R->isSubClassOf("SDTCisSameAs")) {
  ConstraintType = SDTCisSameAs;
  x.SDTCisSameAs_Info.OtherOperandNum = R->getValueAsInt("OtherOperandNum");
} else if (R->isSubClassOf("SDTCisVTSmallerThanOp")) {
  ConstraintType = SDTCisVTSmallerThanOp;
  x.SDTCisVTSmallerThanOp_Info.OtherOperandNum =
    R->getValueAsInt("OtherOperandNum");
} else if (R->isSubClassOf("SDTCisOpSmallerThanOp")) {
  ConstraintType = SDTCisOpSmallerThanOp;
  x.SDTCisOpSmallerThanOp_Info.BigOperandNum =
    R->getValueAsInt("BigOperandNum");
} else if (R->isSubClassOf("SDTCisEltOfVec")) {
  ConstraintType = SDTCisEltOfVec;
  x.SDTCisEltOfVec_Info.OtherOperandNum = R->getValueAsInt("OtherOpNum");
} else if (R->isSubClassOf("SDTCisSubVecOfVec")) {
  ConstraintType = SDTCisSubVecOfVec;
  x.SDTCisSubVecOfVec_Info.OtherOperandNum =
    R->getValueAsInt("OtherOpNum");
} else if (R->isSubClassOf("SDTCVecEltisVT")) {
  ConstraintType = SDTCVecEltisVT;
  VVT = getValueTypeByHwMode(R->getValueAsDef("VT"), CGH);
  for (const auto &P : VVT) {
    MVT T = P.second;
    if (T.isVector())
      PrintFatalError(R->getLoc(),
                      "Cannot use vector type as SDTCVecEltisVT");
    if (!T.isInteger() && !T.isFloatingPoint())
      PrintFatalError(R->getLoc(), "Must use integer or floating point type "
                                   "as SDTCVecEltisVT");
  }
} else if (R->isSubClassOf("SDTCisSameNumEltsAs")) {
  ConstraintType = SDTCisSameNumEltsAs;
  x.SDTCisSameNumEltsAs_Info.OtherOperandNum =
    R->getValueAsInt("OtherOperandNum");
} else if (R->isSubClassOf("SDTCisSameSizeAs")) {
  ConstraintType = SDTCisSameSizeAs;
  x.SDTCisSameSizeAs_Info.OtherOperandNum =
    R->getValueAsInt("OtherOperandNum");
} else {
  PrintFatalError(R->getLoc(),
                  "Unrecognized SDTypeConstraint '" + R->getName() + "'!\n");
}
1555}

1557/// getOperandNum - Return the node corresponding to operand #OpNo in tree
1558/// N, and the result number in ResNo.
1559static TreePatternNode *getOperandNum(unsigned OpNo, TreePatternNode *N,
                                    const SDNodeInfo &NodeInfo,
                                    unsigned &ResNo) {
unsigned NumResults = NodeInfo.getNumResults();
if (OpNo < NumResults) {
  ResNo = OpNo;
  return N;
}

OpNo -= NumResults;

if (OpNo >= N->getNumChildren()) {
  std::string S;
  raw_string_ostream OS(S);
  OS << "Invalid operand number in type constraint "
         << (OpNo+NumResults) << " ";
  N->print(OS);
  PrintFatalError(OS.str());
}

return N->getChild(OpNo);
1580}

1582/// ApplyTypeConstraint - Given a node in a pattern, apply this type
1583/// constraint to the nodes operands.  This returns true if it makes a
1584/// change, false otherwise.  If a type contradiction is found, flag an error.
1585bool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N,
                                         const SDNodeInfo &NodeInfo,
                                         TreePattern &TP) const {
if (TP.hasError())
  return false;

unsigned ResNo = 0; // The result number being referenced.
TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NodeInfo, ResNo);
TypeInfer &TI = TP.getInfer();

switch (ConstraintType) {
case SDTCisVT:
  // Operand must be a particular type.
  return NodeToApply->UpdateNodeType(ResNo, VVT, TP);
case SDTCisPtrTy:
  // Operand must be same as target pointer type.
  return NodeToApply->UpdateNodeType(ResNo, MVT::iPTR, TP);
case SDTCisInt:
  // Require it to be one of the legal integer VTs.
   return TI.EnforceInteger(NodeToApply->getExtType(ResNo));
case SDTCisFP:
  // Require it to be one of the legal fp VTs.
  return TI.EnforceFloatingPoint(NodeToApply->getExtType(ResNo));
case SDTCisVec:
  // Require it to be one of the legal vector VTs.
  return TI.EnforceVector(NodeToApply->getExtType(ResNo));
case SDTCisSameAs: {
  unsigned OResNo = 0;
  TreePatternNode *OtherNode =
    getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NodeInfo, OResNo);
  return NodeToApply->UpdateNodeType(ResNo, OtherNode->getExtType(OResNo),TP)|
         OtherNode->UpdateNodeType(OResNo,NodeToApply->getExtType(ResNo),TP);
}
case SDTCisVTSmallerThanOp: {
  // The NodeToApply must be a leaf node that is a VT.  OtherOperandNum must
  // have an integer type that is smaller than the VT.
  if (!NodeToApply->isLeaf() ||
      !isa<DefInit>(NodeToApply->getLeafValue()) ||
      !static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef()
             ->isSubClassOf("ValueType")) {
    TP.error(N->getOperator()->getName() + " expects a VT operand!");
    return false;
  }
  DefInit *DI = static_cast<DefInit*>(NodeToApply->getLeafValue());
  const CodeGenTarget &T = TP.getDAGPatterns().getTargetInfo();
  auto VVT = getValueTypeByHwMode(DI->getDef(), T.getHwModes());
  TypeSetByHwMode TypeListTmp(VVT);

  unsigned OResNo = 0;
  TreePatternNode *OtherNode =
    getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N, NodeInfo,
                  OResNo);

  return TI.EnforceSmallerThan(TypeListTmp, OtherNode->getExtType(OResNo));
}
case SDTCisOpSmallerThanOp: {
  unsigned BResNo = 0;
  TreePatternNode *BigOperand =
    getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NodeInfo,
                  BResNo);
  return TI.EnforceSmallerThan(NodeToApply->getExtType(ResNo),
                               BigOperand->getExtType(BResNo));
}
case SDTCisEltOfVec: {
  unsigned VResNo = 0;
  TreePatternNode *VecOperand =
    getOperandNum(x.SDTCisEltOfVec_Info.OtherOperandNum, N, NodeInfo,
                  VResNo);
  // Filter vector types out of VecOperand that don't have the right element
  // type.
  return TI.EnforceVectorEltTypeIs(VecOperand->getExtType(VResNo),
                                   NodeToApply->getExtType(ResNo));
}
case SDTCisSubVecOfVec: {
  unsigned VResNo = 0;
  TreePatternNode *BigVecOperand =
    getOperandNum(x.SDTCisSubVecOfVec_Info.OtherOperandNum, N, NodeInfo,
                  VResNo);

  // Filter vector types out of BigVecOperand that don't have the
  // right subvector type.
  return TI.EnforceVectorSubVectorTypeIs(BigVecOperand->getExtType(VResNo),
                                         NodeToApply->getExtType(ResNo));
}
case SDTCVecEltisVT: {
  return TI.EnforceVectorEltTypeIs(NodeToApply->getExtType(ResNo), VVT);
}
case SDTCisSameNumEltsAs: {
  unsigned OResNo = 0;
  TreePatternNode *OtherNode =
    getOperandNum(x.SDTCisSameNumEltsAs_Info.OtherOperandNum,
                  N, NodeInfo, OResNo);
  return TI.EnforceSameNumElts(OtherNode->getExtType(OResNo),
                               NodeToApply->getExtType(ResNo));
}
case SDTCisSameSizeAs: {
  unsigned OResNo = 0;
  TreePatternNode *OtherNode =
    getOperandNum(x.SDTCisSameSizeAs_Info.OtherOperandNum,
                  N, NodeInfo, OResNo);
  return TI.EnforceSameSize(OtherNode->getExtType(OResNo),
                            NodeToApply->getExtType(ResNo));
}
}
llvm_unreachable("Invalid ConstraintType!")__builtin_unreachable();
1690}

1692// Update the node type to match an instruction operand or result as specified
1693// in the ins or outs lists on the instruction definition. Return true if the
1694// type was actually changed.
1695bool TreePatternNode::UpdateNodeTypeFromInst(unsigned ResNo,
                                           Record *Operand,
                                           TreePattern &TP) {
// The 'unknown' operand indicates that types should be inferred from the
// context.
if (Operand->isSubClassOf("unknown_class"))
  return false;

// The Operand class specifies a type directly.
if (Operand->isSubClassOf("Operand")) {
  Record *R = Operand->getValueAsDef("Type");
  const CodeGenTarget &T = TP.getDAGPatterns().getTargetInfo();
  return UpdateNodeType(ResNo, getValueTypeByHwMode(R, T.getHwModes()), TP);
}

// PointerLikeRegClass has a type that is determined at runtime.
if (Operand->isSubClassOf("PointerLikeRegClass"))
  return UpdateNodeType(ResNo, MVT::iPTR, TP);

// Both RegisterClass and RegisterOperand operands derive their types from a
// register class def.
Record *RC = nullptr;
if (Operand->isSubClassOf("RegisterClass"))
  RC = Operand;
else if (Operand->isSubClassOf("RegisterOperand"))
  RC = Operand->getValueAsDef("RegClass");

assert(RC && "Unknown operand type")(static_cast<void> (0));
CodeGenTarget &Tgt = TP.getDAGPatterns().getTargetInfo();
return UpdateNodeType(ResNo, Tgt.getRegisterClass(RC).getValueTypes(), TP);
1725}

1727bool TreePatternNode::ContainsUnresolvedType(TreePattern &TP) const {
for (unsigned i = 0, e = Types.size(); i != e; ++i)
  if (!TP.getInfer().isConcrete(Types[i], true))
    return true;
for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
  if (getChild(i)->ContainsUnresolvedType(TP))
    return true;
return false;
1735}

1737bool TreePatternNode::hasProperTypeByHwMode() const {
for (const TypeSetByHwMode &S : Types)
  if (!S.isDefaultOnly())
    return true;
for (const TreePatternNodePtr &C : Children)
  if (C->hasProperTypeByHwMode())
    return true;
return false;
1745}

1747bool TreePatternNode::hasPossibleType() const {
for (const TypeSetByHwMode &S : Types)
  if (!S.isPossible())
    return false;
for (const TreePatternNodePtr &C : Children)
  if (!C->hasPossibleType())
    return false;
return true;
1755}

1757bool TreePatternNode::setDefaultMode(unsigned Mode) {
for (TypeSetByHwMode &S : Types) {
  S.makeSimple(Mode);
  // Check if the selected mode had a type conflict.
  if (S.get(DefaultMode).empty())
    return false;
}
for (const TreePatternNodePtr &C : Children)
  if (!C->setDefaultMode(Mode))
    return false;
return true;
1768}

1770//===----------------------------------------------------------------------===//
1771// SDNodeInfo implementation
1772//
1773SDNodeInfo::SDNodeInfo(Record *R, const CodeGenHwModes &CGH) : Def(R) {
EnumName    = R->getValueAsString("Opcode");
SDClassName = R->getValueAsString("SDClass");
Record *TypeProfile = R->getValueAsDef("TypeProfile");
NumResults = TypeProfile->getValueAsInt("NumResults");
NumOperands = TypeProfile->getValueAsInt("NumOperands");

// Parse the properties.
Properties = parseSDPatternOperatorProperties(R);

// Parse the type constraints.
std::vector<Record*> ConstraintList =
  TypeProfile->getValueAsListOfDefs("Constraints");
for (Record *R : ConstraintList)
  TypeConstraints.emplace_back(R, CGH);
1788}

1790/// getKnownType - If the type constraints on this node imply a fixed type
1791/// (e.g. all stores return void, etc), then return it as an
1792/// MVT::SimpleValueType.  Otherwise, return EEVT::Other.
1793MVT::SimpleValueType SDNodeInfo::getKnownType(unsigned ResNo) const {
unsigned NumResults = getNumResults();
assert(NumResults <= 1 &&(static_cast<void> (0))
       "We only work with nodes with zero or one result so far!")(static_cast<void> (0));
assert(ResNo == 0 && "Only handles single result nodes so far")(static_cast<void> (0));

for (const SDTypeConstraint &Constraint : TypeConstraints) {
  // Make sure that this applies to the correct node result.
  if (Constraint.OperandNo >= NumResults)  // FIXME: need value #
    continue;

  switch (Constraint.ConstraintType) {
  default: break;
  case SDTypeConstraint::SDTCisVT:
    if (Constraint.VVT.isSimple())
      return Constraint.VVT.getSimple().SimpleTy;
    break;
  case SDTypeConstraint::SDTCisPtrTy:
    return MVT::iPTR;
  }
}
return MVT::Other;
1815}

1817//===----------------------------------------------------------------------===//
1818// TreePatternNode implementation
1819//

1821static unsigned GetNumNodeResults(Record *Operator, CodeGenDAGPatterns &CDP) {
if (Operator->getName() == "set" ||
10
←
Assuming the condition is false→
11
←
Assuming the condition is false→
12
←
Taking false branch→
48
←
Called C++ object pointer is null
    Operator->getName() == "implicit")
  return 0;  // All return nothing.

if (Operator->isSubClassOf("Intrinsic"))
13
←
Calling 'Record::isSubClassOf'→
16
←
Returning from 'Record::isSubClassOf'→
17
←
Taking false branch→
  return CDP.getIntrinsic(Operator).IS.RetVTs.size();

if (Operator->isSubClassOf("SDNode"))
18
←
Calling 'Record::isSubClassOf'→
21
←
Returning from 'Record::isSubClassOf'→
22
←
Taking false branch→
  return CDP.getSDNodeInfo(Operator).getNumResults();

if (Operator->isSubClassOf("PatFrags")) {
23
←
Calling 'Record::isSubClassOf'→
30
←
Returning from 'Record::isSubClassOf'→
31
←
Taking true branch→
  // If we've already parsed this pattern fragment, get it.  Otherwise, handle
  // the forward reference case where one pattern fragment references another
  // before it is processed.
  if (TreePattern *PFRec = CDP.getPatternFragmentIfRead(Operator)) {
32
←
Calling 'CodeGenDAGPatterns::getPatternFragmentIfRead'→
39
←
Returning from 'CodeGenDAGPatterns::getPatternFragmentIfRead'→
40
←
Assuming 'PFRec' is null→
41
←
Taking false branch→
    // The number of results of a fragment with alternative records is the
    // maximum number of results across all alternatives.
    unsigned NumResults = 0;
    for (const auto &T : PFRec->getTrees())
      NumResults = std::max(NumResults, T->getNumTypes());
    return NumResults;
  }

  ListInit *LI = Operator->getValueAsListInit("Fragments");
  assert(LI && "Invalid Fragment")(static_cast<void> (0));
  unsigned NumResults = 0;
  for (Init *I : LI->getValues()) {
42
←
Assuming '__begin2' is not equal to '__end2'→
    Record *Op = nullptr;
43
←
'Op' initialized to a null pointer value→
    if (DagInit *Dag44.1
'Dag' is null
1
'Dag' is null
1
'Dag' is null
1
'Dag' is null
 = dyn_cast<DagInit>(I))
44
←
Assuming 'I' is not a 'DagInit'→
45
←
Taking false branch→
      if (DefInit *DI = dyn_cast<DefInit>(Dag->getOperator()))
        Op = DI->getDef();
    assert(Op && "Invalid Fragment")(static_cast<void> (0));
    NumResults = std::max(NumResults, GetNumNodeResults(Op, CDP));
46
←
Passing null pointer value via 1st parameter 'Operator'→
47
←
Calling 'GetNumNodeResults'→
  }
  return NumResults;
}

if (Operator->isSubClassOf("Instruction")) {
  CodeGenInstruction &InstInfo = CDP.getTargetInfo().getInstruction(Operator);

  unsigned NumDefsToAdd = InstInfo.Operands.NumDefs;

  // Subtract any defaulted outputs.
  for (unsigned i = 0; i != InstInfo.Operands.NumDefs; ++i) {
    Record *OperandNode = InstInfo.Operands[i].Rec;

    if (OperandNode->isSubClassOf("OperandWithDefaultOps") &&
        !CDP.getDefaultOperand(OperandNode).DefaultOps.empty())
      --NumDefsToAdd;
  }

  // Add on one implicit def if it has a resolvable type.
  if (InstInfo.HasOneImplicitDefWithKnownVT(CDP.getTargetInfo()) !=MVT::Other)
    ++NumDefsToAdd;
  return NumDefsToAdd;
}

if (Operator->isSubClassOf("SDNodeXForm"))
  return 1;  // FIXME: Generalize SDNodeXForm

if (Operator->isSubClassOf("ValueType"))
  return 1;  // A type-cast of one result.

if (Operator->isSubClassOf("ComplexPattern"))
  return 1;

errs() << *Operator;
PrintFatalError("Unhandled node in GetNumNodeResults");
1890}

1892void TreePatternNode::print(raw_ostream &OS) const {
if (isLeaf())
  OS << *getLeafValue();
else
  OS << '(' << getOperator()->getName();

for (unsigned i = 0, e = Types.size(); i != e; ++i) {
  OS << ':';
  getExtType(i).writeToStream(OS);
}

if (!isLeaf()) {
  if (getNumChildren() != 0) {
    OS << " ";
    ListSeparator LS;
    for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
      OS << LS;
      getChild(i)->print(OS);
    }
  }
  OS << ")";
}

for (const TreePredicateCall &Pred : PredicateCalls) {
  OS << "<<P:";
  if (Pred.Scope)
    OS << Pred.Scope << ":";
  OS << Pred.Fn.getFnName() << ">>";
}
if (TransformFn)
  OS << "<<X:" << TransformFn->getName() << ">>";
if (!getName().empty())
  OS << ":$" << getName();

for (const ScopedName &Name : NamesAsPredicateArg)
  OS << ":$pred:" << Name.getScope() << ":" << Name.getIdentifier();
1928}
1929void TreePatternNode::dump() const {
print(errs());
1931}

1933/// isIsomorphicTo - Return true if this node is recursively
1934/// isomorphic to the specified node.  For this comparison, the node's
1935/// entire state is considered. The assigned name is ignored, since
1936/// nodes with differing names are considered isomorphic. However, if
1937/// the assigned name is present in the dependent variable set, then
1938/// the assigned name is considered significant and the node is
1939/// isomorphic if the names match.
1940bool TreePatternNode::isIsomorphicTo(const TreePatternNode *N,
                                   const MultipleUseVarSet &DepVars) const {
if (N == this) return true;
if (N->isLeaf() != isLeaf() || getExtTypes() != N->getExtTypes() ||
    getPredicateCalls() != N->getPredicateCalls() ||
    getTransformFn() != N->getTransformFn())
  return false;

if (isLeaf()) {
  if (DefInit *DI = dyn_cast<DefInit>(getLeafValue())) {
    if (DefInit *NDI = dyn_cast<DefInit>(N->getLeafValue())) {
      return ((DI->getDef() == NDI->getDef())
              && (DepVars.find(getName()) == DepVars.end()
                  || getName() == N->getName()));
    }
  }
  return getLeafValue() == N->getLeafValue();
}

if (N->getOperator() != getOperator() ||
    N->getNumChildren() != getNumChildren()) return false;
for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
  if (!getChild(i)->isIsomorphicTo(N->getChild(i), DepVars))
    return false;
return true;
1965}

1967/// clone - Make a copy of this tree and all of its children.
1968///
1969TreePatternNodePtr TreePatternNode::clone() const {
TreePatternNodePtr New;
if (isLeaf()) {
  New = std::make_shared<TreePatternNode>(getLeafValue(), getNumTypes());
} else {
  std::vector<TreePatternNodePtr> CChildren;
  CChildren.reserve(Children.size());
  for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
    CChildren.push_back(getChild(i)->clone());
  New = std::make_shared<TreePatternNode>(getOperator(), std::move(CChildren),
                                          getNumTypes());
}
New->setName(getName());
New->setNamesAsPredicateArg(getNamesAsPredicateArg());
New->Types = Types;
New->setPredicateCalls(getPredicateCalls());
New->setTransformFn(getTransformFn());
return New;
1987}

1989/// RemoveAllTypes - Recursively strip all the types of this tree.
1990void TreePatternNode::RemoveAllTypes() {
// Reset to unknown type.
std::fill(Types.begin(), Types.end(), TypeSetByHwMode());
if (isLeaf()) return;
for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
  getChild(i)->RemoveAllTypes();
1996}


1999/// SubstituteFormalArguments - Replace the formal arguments in this tree
2000/// with actual values specified by ArgMap.
2001void TreePatternNode::SubstituteFormalArguments(
  std::map<std::string, TreePatternNodePtr> &ArgMap) {
if (isLeaf()) return;

for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
  TreePatternNode *Child = getChild(i);
  if (Child->isLeaf()) {
    Init *Val = Child->getLeafValue();
    // Note that, when substituting into an output pattern, Val might be an
    // UnsetInit.
    if (isa<UnsetInit>(Val) || (isa<DefInit>(Val) &&
        cast<DefInit>(Val)->getDef()->getName() == "node")) {
      // We found a use of a formal argument, replace it with its value.
      TreePatternNodePtr NewChild = ArgMap[Child->getName()];
      assert(NewChild && "Couldn't find formal argument!")(static_cast<void> (0));
      assert((Child->getPredicateCalls().empty() ||(static_cast<void> (0))
              NewChild->getPredicateCalls() == Child->getPredicateCalls()) &&(static_cast<void> (0))
             "Non-empty child predicate clobbered!")(static_cast<void> (0));
      setChild(i, std::move(NewChild));
    }
  } else {
    getChild(i)->SubstituteFormalArguments(ArgMap);
  }
}
2025}


2028/// InlinePatternFragments - If this pattern refers to any pattern
2029/// fragments, return the set of inlined versions (this can be more than
2030/// one if a PatFrags record has multiple alternatives).
2031void TreePatternNode::InlinePatternFragments(
TreePatternNodePtr T, TreePattern &TP,
std::vector<TreePatternNodePtr> &OutAlternatives) {

if (TP.hasError())
  return;

if (isLeaf()) {
  OutAlternatives.push_back(T);  // nothing to do.
  return;
}

Record *Op = getOperator();

if (!Op->isSubClassOf("PatFrags")) {
  if (getNumChildren() == 0) {
    OutAlternatives.push_back(T);
    return;
  }

  // Recursively inline children nodes.
  std::vector<std::vector<TreePatternNodePtr> > ChildAlternatives;
  ChildAlternatives.resize(getNumChildren());
  for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
    TreePatternNodePtr Child = getChildShared(i);
    Child->InlinePatternFragments(Child, TP, ChildAlternatives[i]);
    // If there are no alternatives for any child, there are no
    // alternatives for this expression as whole.
    if (ChildAlternatives[i].empty())
      return;

    assert((Child->getPredicateCalls().empty() ||(static_cast<void> (0))
            llvm::all_of(ChildAlternatives[i],(static_cast<void> (0))
                         [&](const TreePatternNodePtr &NewChild) {(static_cast<void> (0))
                           return NewChild->getPredicateCalls() ==(static_cast<void> (0))
                                  Child->getPredicateCalls();(static_cast<void> (0))
                         })) &&(static_cast<void> (0))
           "Non-empty child predicate clobbered!")(static_cast<void> (0));
  }

  // The end result is an all-pairs construction of the resultant pattern.
  std::vector<unsigned> Idxs;
  Idxs.resize(ChildAlternatives.size());
  bool NotDone;
  do {
    // Create the variant and add it to the output list.
    std::vector<TreePatternNodePtr> NewChildren;
    for (unsigned i = 0, e = ChildAlternatives.size(); i != e; ++i)
      NewChildren.push_back(ChildAlternatives[i][Idxs[i]]);
    TreePatternNodePtr R = std::make_shared<TreePatternNode>(
        getOperator(), std::move(NewChildren), getNumTypes());

    // Copy over properties.
    R->setName(getName());
    R->setNamesAsPredicateArg(getNamesAsPredicateArg());
    R->setPredicateCalls(getPredicateCalls());
    R->setTransformFn(getTransformFn());
    for (unsigned i = 0, e = getNumTypes(); i != e; ++i)
      R->setType(i, getExtType(i));
    for (unsigned i = 0, e = getNumResults(); i != e; ++i)
      R->setResultIndex(i, getResultIndex(i));

    // Register alternative.
    OutAlternatives.push_back(R);

    // Increment indices to the next permutation by incrementing the
    // indices from last index backward, e.g., generate the sequence
    // [0, 0], [0, 1], [1, 0], [1, 1].
    int IdxsIdx;
    for (IdxsIdx = Idxs.size() - 1; IdxsIdx >= 0; --IdxsIdx) {
      if (++Idxs[IdxsIdx] == ChildAlternatives[IdxsIdx].size())
        Idxs[IdxsIdx] = 0;
      else
        break;
    }
    NotDone = (IdxsIdx >= 0);
  } while (NotDone);

  return;
}

// Otherwise, we found a reference to a fragment.  First, look up its
// TreePattern record.
TreePattern *Frag = TP.getDAGPatterns().getPatternFragment(Op);

// Verify that we are passing the right number of operands.
if (Frag->getNumArgs() != Children.size()) {
  TP.error("'" + Op->getName() + "' fragment requires " +
           Twine(Frag->getNumArgs()) + " operands!");
  return;
}

TreePredicateFn PredFn(Frag);
unsigned Scope = 0;
if (TreePredicateFn(Frag).usesOperands())
  Scope = TP.getDAGPatterns().allocateScope();

// Compute the map of formal to actual arguments.
std::map<std::string, TreePatternNodePtr> ArgMap;
for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i) {
  TreePatternNodePtr Child = getChildShared(i);
  if (Scope != 0) {
    Child = Child->clone();
    Child->addNameAsPredicateArg(ScopedName(Scope, Frag->getArgName(i)));
  }
  ArgMap[Frag->getArgName(i)] = Child;
}

// Loop over all fragment alternatives.
for (const auto &Alternative : Frag->getTrees()) {
  TreePatternNodePtr FragTree = Alternative->clone();

  if (!PredFn.isAlwaysTrue())
    FragTree->addPredicateCall(PredFn, Scope);

  // Resolve formal arguments to their actual value.
  if (Frag->getNumArgs())
    FragTree->SubstituteFormalArguments(ArgMap);

  // Transfer types.  Note that the resolved alternative may have fewer
  // (but not more) results than the PatFrags node.
  FragTree->setName(getName());
  for (unsigned i = 0, e = FragTree->getNumTypes(); i != e; ++i)
    FragTree->UpdateNodeType(i, getExtType(i), TP);

  // Transfer in the old predicates.
  for (const TreePredicateCall &Pred : getPredicateCalls())
    FragTree->addPredicateCall(Pred);

  // The fragment we inlined could have recursive inlining that is needed.  See
  // if there are any pattern fragments in it and inline them as needed.
  FragTree->InlinePatternFragments(FragTree, TP, OutAlternatives);
}
2164}

2166/// getImplicitType - Check to see if the specified record has an implicit
2167/// type which should be applied to it.  This will infer the type of register
2168/// references from the register file information, for example.
2169///
2170/// When Unnamed is set, return the type of a DAG operand with no name, such as
2171/// the F8RC register class argument in:
2172///
2173///   (COPY_TO_REGCLASS GPR:$src, F8RC)
2174///
2175/// When Unnamed is false, return the type of a named DAG operand such as the
2176/// GPR:$src operand above.
2177///
2178static TypeSetByHwMode getImplicitType(Record *R, unsigned ResNo,
                                     bool NotRegisters,
                                     bool Unnamed,
                                     TreePattern &TP) {
CodeGenDAGPatterns &CDP = TP.getDAGPatterns();

// Check to see if this is a register operand.
if (R->isSubClassOf("RegisterOperand")) {
  assert(ResNo == 0 && "Regoperand ref only has one result!")(static_cast<void> (0));
  if (NotRegisters)
    return TypeSetByHwMode(); // Unknown.
  Record *RegClass = R->getValueAsDef("RegClass");
  const CodeGenTarget &T = TP.getDAGPatterns().getTargetInfo();
  return TypeSetByHwMode(T.getRegisterClass(RegClass).getValueTypes());
}

// Check to see if this is a register or a register class.
if (R->isSubClassOf("RegisterClass")) {
  assert(ResNo == 0 && "Regclass ref only has one result!")(static_cast<void> (0));
  // An unnamed register class represents itself as an i32 immediate, for
  // example on a COPY_TO_REGCLASS instruction.
  if (Unnamed)
    return TypeSetByHwMode(MVT::i32);

  // In a named operand, the register class provides the possible set of
  // types.
  if (NotRegisters)
    return TypeSetByHwMode(); // Unknown.
  const CodeGenTarget &T = TP.getDAGPatterns().getTargetInfo();
  return TypeSetByHwMode(T.getRegisterClass(R).getValueTypes());
}

if (R->isSubClassOf("PatFrags")) {
  assert(ResNo == 0 && "FIXME: PatFrag with multiple results?")(static_cast<void> (0));
  // Pattern fragment types will be resolved when they are inlined.
  return TypeSetByHwMode(); // Unknown.
}

if (R->isSubClassOf("Register")) {
  assert(ResNo == 0 && "Registers only produce one result!")(static_cast<void> (0));
  if (NotRegisters)
    return TypeSetByHwMode(); // Unknown.
  const CodeGenTarget &T = TP.getDAGPatterns().getTargetInfo();
  return TypeSetByHwMode(T.getRegisterVTs(R));
}

if (R->isSubClassOf("SubRegIndex")) {
  assert(ResNo == 0 && "SubRegisterIndices only produce one result!")(static_cast<void> (0));
  return TypeSetByHwMode(MVT::i32);
}

if (R->isSubClassOf("ValueType")) {
  assert(ResNo == 0 && "This node only has one result!")(static_cast<void> (0));
  // An unnamed VTSDNode represents itself as an MVT::Other immediate.
  //
  //   (sext_inreg GPR:$src, i16)
  //                         ~~~
  if (Unnamed)
    return TypeSetByHwMode(MVT::Other);
  // With a name, the ValueType simply provides the type of the named
  // variable.
  //
  //   (sext_inreg i32:$src, i16)
  //               ~~~~~~~~
  if (NotRegisters)
    return TypeSetByHwMode(); // Unknown.
  const CodeGenHwModes &CGH = CDP.getTargetInfo().getHwModes();
  return TypeSetByHwMode(getValueTypeByHwMode(R, CGH));
}

if (R->isSubClassOf("CondCode")) {
  assert(ResNo == 0 && "This node only has one result!")(static_cast<void> (0));
  // Using a CondCodeSDNode.
  return TypeSetByHwMode(MVT::Other);
}

if (R->isSubClassOf("ComplexPattern")) {
  assert(ResNo == 0 && "FIXME: ComplexPattern with multiple results?")(static_cast<void> (0));
  if (NotRegisters)
    return TypeSetByHwMode(); // Unknown.
  return TypeSetByHwMode(CDP.getComplexPattern(R).getValueType());
}
if (R->isSubClassOf("PointerLikeRegClass")) {
  assert(ResNo == 0 && "Regclass can only have one result!")(static_cast<void> (0));
  TypeSetByHwMode VTS(MVT::iPTR);
  TP.getInfer().expandOverloads(VTS);
  return VTS;
}

if (R->getName() == "node" || R->getName() == "srcvalue" ||
    R->getName() == "zero_reg" || R->getName() == "immAllOnesV" ||
    R->getName() == "immAllZerosV" || R->getName() == "undef_tied_input") {
  // Placeholder.
  return TypeSetByHwMode(); // Unknown.
}

if (R->isSubClassOf("Operand")) {
  const CodeGenHwModes &CGH = CDP.getTargetInfo().getHwModes();
  Record *T = R->getValueAsDef("Type");
  return TypeSetByHwMode(getValueTypeByHwMode(T, CGH));
}

TP.error("Unknown node flavor used in pattern: " + R->getName());
return TypeSetByHwMode(MVT::Other);
2282}


2285/// getIntrinsicInfo - If this node corresponds to an intrinsic, return the
2286/// CodeGenIntrinsic information for it, otherwise return a null pointer.
2287const CodeGenIntrinsic *TreePatternNode::
2288getIntrinsicInfo(const CodeGenDAGPatterns &CDP) const {
if (getOperator() != CDP.get_intrinsic_void_sdnode() &&
    getOperator() != CDP.get_intrinsic_w_chain_sdnode() &&
    getOperator() != CDP.get_intrinsic_wo_chain_sdnode())
  return nullptr;

unsigned IID = cast<IntInit>(getChild(0)->getLeafValue())->getValue();
return &CDP.getIntrinsicInfo(IID);
2296}

2298/// getComplexPatternInfo - If this node corresponds to a ComplexPattern,
2299/// return the ComplexPattern information, otherwise return null.
2300const ComplexPattern *
2301TreePatternNode::getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const {
Record *Rec;
if (isLeaf()) {
  DefInit *DI = dyn_cast<DefInit>(getLeafValue());
  if (!DI)
    return nullptr;
  Rec = DI->getDef();
} else
  Rec = getOperator();

if (!Rec->isSubClassOf("ComplexPattern"))
  return nullptr;
return &CGP.getComplexPattern(Rec);
2314}

2316unsigned TreePatternNode::getNumMIResults(const CodeGenDAGPatterns &CGP) const {
// A ComplexPattern specifically declares how many results it fills in.
if (const ComplexPattern *CP = getComplexPatternInfo(CGP))
  return CP->getNumOperands();

// If MIOperandInfo is specified, that gives the count.
if (isLeaf()) {
  DefInit *DI = dyn_cast<DefInit>(getLeafValue());
  if (DI && DI->getDef()->isSubClassOf("Operand")) {
    DagInit *MIOps = DI->getDef()->getValueAsDag("MIOperandInfo");
    if (MIOps->getNumArgs())
      return MIOps->getNumArgs();
  }
}

// Otherwise there is just one result.
return 1;
2333}

2335/// NodeHasProperty - Return true if this node has the specified property.
2336bool TreePatternNode::NodeHasProperty(SDNP Property,
                                    const CodeGenDAGPatterns &CGP) const {
if (isLeaf()) {
  if (const ComplexPattern *CP = getComplexPatternInfo(CGP))
    return CP->hasProperty(Property);

  return false;
}

if (Property != SDNPHasChain) {
  // The chain proprety is already present on the different intrinsic node
  // types (intrinsic_w_chain, intrinsic_void), and is not explicitly listed
  // on the intrinsic. Anything else is specific to the individual intrinsic.
  if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CGP))
    return Int->hasProperty(Property);
}

if (!Operator->isSubClassOf("SDPatternOperator"))
  return false;

return CGP.getSDNodeInfo(Operator).hasProperty(Property);
2357}




2362/// TreeHasProperty - Return true if any node in this tree has the specified
2363/// property.
2364bool TreePatternNode::TreeHasProperty(SDNP Property,
                                    const CodeGenDAGPatterns &CGP) const {
if (NodeHasProperty(Property, CGP))
  return true;
for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
  if (getChild(i)->TreeHasProperty(Property, CGP))
    return true;
return false;
2372}

2374/// isCommutativeIntrinsic - Return true if the node corresponds to a
2375/// commutative intrinsic.
2376bool
2377TreePatternNode::isCommutativeIntrinsic(const CodeGenDAGPatterns &CDP) const {
if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CDP))
  return Int->isCommutative;
return false;
2381}

2383static bool isOperandClass(const TreePatternNode *N, StringRef Class) {
if (!N->isLeaf())
  return N->getOperator()->isSubClassOf(Class);

DefInit *DI = dyn_cast<DefInit>(N->getLeafValue());
if (DI && DI->getDef()->isSubClassOf(Class))
  return true;

return false;
2392}

2394static void emitTooManyOperandsError(TreePattern &TP,
                                   StringRef InstName,
                                   unsigned Expected,
                                   unsigned Actual) {
TP.error("Instruction '" + InstName + "' was provided " + Twine(Actual) +
         " operands but expected only " + Twine(Expected) + "!");
2400}

2402static void emitTooFewOperandsError(TreePattern &TP,
                                  StringRef InstName,
                                  unsigned Actual) {
TP.error("Instruction '" + InstName +
         "' expects more than the provided " + Twine(Actual) + " operands!");
2407}

2409/// ApplyTypeConstraints - Apply all of the type constraints relevant to
2410/// this node and its children in the tree.  This returns true if it makes a
2411/// change, false otherwise.  If a type contradiction is found, flag an error.
2412bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
if (TP.hasError())
  return false;

CodeGenDAGPatterns &CDP = TP.getDAGPatterns();
if (isLeaf()) {
  if (DefInit *DI = dyn_cast<DefInit>(getLeafValue())) {
    // If it's a regclass or something else known, include the type.
    bool MadeChange = false;
    for (unsigned i = 0, e = Types.size(); i != e; ++i)
      MadeChange |= UpdateNodeType(i, getImplicitType(DI->getDef(), i,
                                                      NotRegisters,
                                                      !hasName(), TP), TP);
    return MadeChange;
  }

  if (IntInit *II = dyn_cast<IntInit>(getLeafValue())) {
    assert(Types.size() == 1 && "Invalid IntInit")(static_cast<void> (0));

    // Int inits are always integers. :)
    bool MadeChange = TP.getInfer().EnforceInteger(Types[0]);

    if (!TP.getInfer().isConcrete(Types[0], false))
      return MadeChange;

    ValueTypeByHwMode VVT = TP.getInfer().getConcrete(Types[0], false);
    for (auto &P : VVT) {
      MVT::SimpleValueType VT = P.second.SimpleTy;
      if (VT == MVT::iPTR || VT == MVT::iPTRAny)
        continue;
      unsigned Size = MVT(VT).getFixedSizeInBits();
      // Make sure that the value is representable for this type.
      if (Size >= 32)
        continue;
      // Check that the value doesn't use more bits than we have. It must
      // either be a sign- or zero-extended equivalent of the original.
      int64_t SignBitAndAbove = II->getValue() >> (Size - 1);
      if (SignBitAndAbove == -1 || SignBitAndAbove == 0 ||
          SignBitAndAbove == 1)
        continue;

      TP.error("Integer value '" + Twine(II->getValue()) +
               "' is out of range for type '" + getEnumName(VT) + "'!");
      break;
    }
    return MadeChange;
  }

  return false;
}

if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CDP)) {
  bool MadeChange = false;

  // Apply the result type to the node.
  unsigned NumRetVTs = Int->IS.RetVTs.size();
  unsigned NumParamVTs = Int->IS.ParamVTs.size();

  for (unsigned i = 0, e = NumRetVTs; i != e; ++i)
    MadeChange |= UpdateNodeType(i, Int->IS.RetVTs[i], TP);

  if (getNumChildren() != NumParamVTs + 1) {
    TP.error("Intrinsic '" + Int->Name + "' expects " + Twine(NumParamVTs) +
             " operands, not " + Twine(getNumChildren() - 1) + " operands!");
    return false;
  }

  // Apply type info to the intrinsic ID.
  MadeChange |= getChild(0)->UpdateNodeType(0, MVT::iPTR, TP);

  for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) {
    MadeChange |= getChild(i+1)->ApplyTypeConstraints(TP, NotRegisters);

    MVT::SimpleValueType OpVT = Int->IS.ParamVTs[i];
    assert(getChild(i+1)->getNumTypes() == 1 && "Unhandled case")(static_cast<void> (0));
    MadeChange |= getChild(i+1)->UpdateNodeType(0, OpVT, TP);
  }
  return MadeChange;
}

if (getOperator()->isSubClassOf("SDNode")) {
  const SDNodeInfo &NI = CDP.getSDNodeInfo(getOperator());

  // Check that the number of operands is sane.  Negative operands -> varargs.
  if (NI.getNumOperands() >= 0 &&
      getNumChildren() != (unsigned)NI.getNumOperands()) {
    TP.error(getOperator()->getName() + " node requires exactly " +
             Twine(NI.getNumOperands()) + " operands!");
    return false;
  }

  bool MadeChange = false;
  for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
    MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
  MadeChange |= NI.ApplyTypeConstraints(this, TP);
  return MadeChange;
}

if (getOperator()->isSubClassOf("Instruction")) {
  const DAGInstruction &Inst = CDP.getInstruction(getOperator());
  CodeGenInstruction &InstInfo =
    CDP.getTargetInfo().getInstruction(getOperator());

  bool MadeChange = false;

  // Apply the result types to the node, these come from the things in the
  // (outs) list of the instruction.
  unsigned NumResultsToAdd = std::min(InstInfo.Operands.NumDefs,
                                      Inst.getNumResults());
  for (unsigned ResNo = 0; ResNo != NumResultsToAdd; ++ResNo)
    MadeChange |= UpdateNodeTypeFromInst(ResNo, Inst.getResult(ResNo), TP);

  // If the instruction has implicit defs, we apply the first one as a result.
  // FIXME: This sucks, it should apply all implicit defs.
  if (!InstInfo.ImplicitDefs.empty()) {
    unsigned ResNo = NumResultsToAdd;

    // FIXME: Generalize to multiple possible types and multiple possible
    // ImplicitDefs.
    MVT::SimpleValueType VT =
      InstInfo.HasOneImplicitDefWithKnownVT(CDP.getTargetInfo());

    if (VT != MVT::Other)
      MadeChange |= UpdateNodeType(ResNo, VT, TP);
  }

  // If this is an INSERT_SUBREG, constrain the source and destination VTs to
  // be the same.
  if (getOperator()->getName() == "INSERT_SUBREG") {
    assert(getChild(0)->getNumTypes() == 1 && "FIXME: Unhandled")(static_cast<void> (0));
    MadeChange |= UpdateNodeType(0, getChild(0)->getExtType(0), TP);
    MadeChange |= getChild(0)->UpdateNodeType(0, getExtType(0), TP);
  } else if (getOperator()->getName() == "REG_SEQUENCE") {
    // We need to do extra, custom typechecking for REG_SEQUENCE since it is
    // variadic.

    unsigned NChild = getNumChildren();
    if (NChild < 3) {
      TP.error("REG_SEQUENCE requires at least 3 operands!");
      return false;
    }

    if (NChild % 2 == 0) {
      TP.error("REG_SEQUENCE requires an odd number of operands!");
      return false;
    }

    if (!isOperandClass(getChild(0), "RegisterClass")) {
      TP.error("REG_SEQUENCE requires a RegisterClass for first operand!");
      return false;
    }

    for (unsigned I = 1; I < NChild; I += 2) {
      TreePatternNode *SubIdxChild = getChild(I + 1);
      if (!isOperandClass(SubIdxChild, "SubRegIndex")) {
        TP.error("REG_SEQUENCE requires a SubRegIndex for operand " +
                 Twine(I + 1) + "!");
        return false;
      }
    }
  }

  unsigned NumResults = Inst.getNumResults();
  unsigned NumFixedOperands = InstInfo.Operands.size();

  // If one or more operands with a default value appear at the end of the
  // formal operand list for an instruction, we allow them to be overridden
  // by optional operands provided in the pattern.
  //
  // But if an operand B without a default appears at any point after an
  // operand A with a default, then we don't allow A to be overridden,
  // because there would be no way to specify whether the next operand in
  // the pattern was intended to override A or skip it.
  unsigned NonOverridableOperands = NumFixedOperands;
  while (NonOverridableOperands > NumResults &&
         CDP.operandHasDefault(InstInfo.Operands[NonOverridableOperands-1].Rec))
    --NonOverridableOperands;

  unsigned ChildNo = 0;
  assert(NumResults <= NumFixedOperands)(static_cast<void> (0));
  for (unsigned i = NumResults, e = NumFixedOperands; i != e; ++i) {
    Record *OperandNode = InstInfo.Operands[i].Rec;

    // If the operand has a default value, do we use it? We must use the
    // default if we've run out of children of the pattern DAG to consume,
    // or if the operand is followed by a non-defaulted one.
    if (CDP.operandHasDefault(OperandNode) &&
        (i < NonOverridableOperands || ChildNo >= getNumChildren()))
      continue;

    // If we have run out of child nodes and there _isn't_ a default
    // value we can use for the next operand, give an error.
    if (ChildNo >= getNumChildren()) {
      emitTooFewOperandsError(TP, getOperator()->getName(), getNumChildren());
      return false;
    }

    TreePatternNode *Child = getChild(ChildNo++);
    unsigned ChildResNo = 0;  // Instructions always use res #0 of their op.

    // If the operand has sub-operands, they may be provided by distinct
    // child patterns, so attempt to match each sub-operand separately.
    if (OperandNode->isSubClassOf("Operand")) {
      DagInit *MIOpInfo = OperandNode->getValueAsDag("MIOperandInfo");
      if (unsigned NumArgs = MIOpInfo->getNumArgs()) {
        // But don't do that if the whole operand is being provided by
        // a single ComplexPattern-related Operand.

        if (Child->getNumMIResults(CDP) < NumArgs) {
          // Match first sub-operand against the child we already have.
          Record *SubRec = cast<DefInit>(MIOpInfo->getArg(0))->getDef();
          MadeChange |=
            Child->UpdateNodeTypeFromInst(ChildResNo, SubRec, TP);

          // And the remaining sub-operands against subsequent children.
          for (unsigned Arg = 1; Arg < NumArgs; ++Arg) {
            if (ChildNo >= getNumChildren()) {
              emitTooFewOperandsError(TP, getOperator()->getName(),
                                      getNumChildren());
              return false;
            }
            Child = getChild(ChildNo++);

            SubRec = cast<DefInit>(MIOpInfo->getArg(Arg))->getDef();
            MadeChange |=
              Child->UpdateNodeTypeFromInst(ChildResNo, SubRec, TP);
          }
          continue;
        }
      }
    }

    // If we didn't match by pieces above, attempt to match the whole
    // operand now.
    MadeChange |= Child->UpdateNodeTypeFromInst(ChildResNo, OperandNode, TP);
  }

  if (!InstInfo.Operands.isVariadic && ChildNo != getNumChildren()) {
    emitTooManyOperandsError(TP, getOperator()->getName(),
                             ChildNo, getNumChildren());
    return false;
  }

  for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
    MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
  return MadeChange;
}

if (getOperator()->isSubClassOf("ComplexPattern")) {
  bool MadeChange = false;

  for (unsigned i = 0; i < getNumChildren(); ++i)
    MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);

  return MadeChange;
}

assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!")(static_cast<void> (0));

// Node transforms always take one operand.
if (getNumChildren() != 1) {
  TP.error("Node transform '" + getOperator()->getName() +
           "' requires one operand!");
  return false;
}

bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
return MadeChange;
2680}

2682/// OnlyOnRHSOfCommutative - Return true if this value is only allowed on the
2683/// RHS of a commutative operation, not the on LHS.
2684static bool OnlyOnRHSOfCommutative(TreePatternNode *N) {
if (!N->isLeaf() && N->getOperator()->getName() == "imm")
  return true;
if (N->isLeaf() && isa<IntInit>(N->getLeafValue()))
  return true;
if (isImmAllOnesAllZerosMatch(N))
  return true;
return false;
2692}


2695/// canPatternMatch - If it is impossible for this pattern to match on this
2696/// target, fill in Reason and return false.  Otherwise, return true.  This is
2697/// used as a sanity check for .td files (to prevent people from writing stuff
2698/// that can never possibly work), and to prevent the pattern permuter from
2699/// generating stuff that is useless.
2700bool TreePatternNode::canPatternMatch(std::string &Reason,
                                    const CodeGenDAGPatterns &CDP) {
if (isLeaf()) return true;

for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
  if (!getChild(i)->canPatternMatch(Reason, CDP))
    return false;

// If this is an intrinsic, handle cases that would make it not match.  For
// example, if an operand is required to be an immediate.
if (getOperator()->isSubClassOf("Intrinsic")) {
  // TODO:
  return true;
}

if (getOperator()->isSubClassOf("ComplexPattern"))
  return true;

// If this node is a commutative operator, check that the LHS isn't an
// immediate.
const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(getOperator());
bool isCommIntrinsic = isCommutativeIntrinsic(CDP);
if (NodeInfo.hasProperty(SDNPCommutative) || isCommIntrinsic) {
  // Scan all of the operands of the node and make sure that only the last one
  // is a constant node, unless the RHS also is.
  if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {
    unsigned Skip = isCommIntrinsic ? 1 : 0; // First operand is intrinsic id.
    for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i)
      if (OnlyOnRHSOfCommutative(getChild(i))) {
        Reason="Immediate value must be on the RHS of commutative operators!";
        return false;
      }
  }
}

return true;
2736}

2738//===----------------------------------------------------------------------===//
2739// TreePattern implementation
2740//

2742TreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
                       CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp),
                       isInputPattern(isInput), HasError(false),
                       Infer(*this) {
for (Init *I : RawPat->getValues())
  Trees.push_back(ParseTreePattern(I, ""));
2748}

2750TreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
                       CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp),
                       isInputPattern(isInput), HasError(false),
                       Infer(*this) {
Trees.push_back(ParseTreePattern(Pat, ""));
2755}

2757TreePattern::TreePattern(Record *TheRec, TreePatternNodePtr Pat, bool isInput,
                       CodeGenDAGPatterns &cdp)
  : TheRecord(TheRec), CDP(cdp), isInputPattern(isInput), HasError(false),
    Infer(*this) {
Trees.push_back(Pat);
2762}

2764void TreePattern::error(const Twine &Msg) {
if (HasError)
  return;
dump();
PrintError(TheRecord->getLoc(), "In " + TheRecord->getName() + ": " + Msg);
HasError = true;
2770}

2772void TreePattern::ComputeNamedNodes() {
for (TreePatternNodePtr &Tree : Trees)
  ComputeNamedNodes(Tree.get());
2775}

2777void TreePattern::ComputeNamedNodes(TreePatternNode *N) {
if (!N->getName().empty())
  NamedNodes[N->getName()].push_back(N);

for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
  ComputeNamedNodes(N->getChild(i));
2783}

2785TreePatternNodePtr TreePattern::ParseTreePattern(Init *TheInit,
                                               StringRef OpName) {
if (DefInit *DI = dyn_cast<DefInit>(TheInit)) {
  Record *R = DI->getDef();

  // Direct reference to a leaf DagNode or PatFrag?  Turn it into a
  // TreePatternNode of its own.  For example:
  ///   (foo GPR, imm) -> (foo GPR, (imm))
  if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrags"))
    return ParseTreePattern(
      DagInit::get(DI, nullptr,
                   std::vector<std::pair<Init*, StringInit*> >()),
      OpName);

  // Input argument?
  TreePatternNodePtr Res = std::make_shared<TreePatternNode>(DI, 1);
  if (R->getName() == "node" && !OpName.empty()) {
    if (OpName.empty())
      error("'node' argument requires a name to match with operand list");
    Args.push_back(std::string(OpName));
  }

  Res->setName(OpName);
  return Res;
}

// ?:$name or just $name.
if (isa<UnsetInit>(TheInit)) {
  if (OpName.empty())
    error("'?' argument requires a name to match with operand list");
  TreePatternNodePtr Res = std::make_shared<TreePatternNode>(TheInit, 1);
  Args.push_back(std::string(OpName));
  Res->setName(OpName);
  return Res;
}

if (isa<IntInit>(TheInit) || isa<BitInit>(TheInit)) {
  if (!OpName.empty())
    error("Constant int or bit argument should not have a name!");
  if (isa<BitInit>(TheInit))
    TheInit = TheInit->convertInitializerTo(IntRecTy::get());
  return std::make_shared<TreePatternNode>(TheInit, 1);
}

if (BitsInit *BI = dyn_cast<BitsInit>(TheInit)) {
  // Turn this into an IntInit.
  Init *II = BI->convertInitializerTo(IntRecTy::get());
  if (!II || !isa<IntInit>(II))
    error("Bits value must be constants!");
  return ParseTreePattern(II, OpName);
}

DagInit *Dag = dyn_cast<DagInit>(TheInit);
if (!Dag) {
  TheInit->print(errs());
  error("Pattern has unexpected init kind!");
}
DefInit *OpDef = dyn_cast<DefInit>(Dag->getOperator());
if (!OpDef) error("Pattern has unexpected operator type!");
Record *Operator = OpDef->getDef();

if (Operator->isSubClassOf("ValueType")) {
  // If the operator is a ValueType, then this must be "type cast" of a leaf
  // node.
  if (Dag->getNumArgs() != 1)
    error("Type cast only takes one operand!");

  TreePatternNodePtr New =
      ParseTreePattern(Dag->getArg(0), Dag->getArgNameStr(0));

  // Apply the type cast.
  if (New->getNumTypes() != 1)
    error("Type cast can only have one type!");
  const CodeGenHwModes &CGH = getDAGPatterns().getTargetInfo().getHwModes();
  New->UpdateNodeType(0, getValueTypeByHwMode(Operator, CGH), *this);

  if (!OpName.empty())
    error("ValueType cast should not have a name!");
  return New;
}

// Verify that this is something that makes sense for an operator.
if (!Operator->isSubClassOf("PatFrags") &&
    !Operator->isSubClassOf("SDNode") &&
    !Operator->isSubClassOf("Instruction") &&
    !Operator->isSubClassOf("SDNodeXForm") &&
    !Operator->isSubClassOf("Intrinsic") &&
    !Operator->isSubClassOf("ComplexPattern") &&
    Operator->getName() != "set" &&
    Operator->getName() != "implicit")
  error("Unrecognized node '" + Operator->getName() + "'!");

//  Check to see if this is something that is illegal in an input pattern.
if (isInputPattern) {
  if (Operator->isSubClassOf("Instruction") ||
      Operator->isSubClassOf("SDNodeXForm"))
    error("Cannot use '" + Operator->getName() + "' in an input pattern!");
} else {
  if (Operator->isSubClassOf("Intrinsic"))
    error("Cannot use '" + Operator->getName() + "' in an output pattern!");

  if (Operator->isSubClassOf("SDNode") &&
      Operator->getName() != "imm" &&
      Operator->getName() != "timm" &&
      Operator->getName() != "fpimm" &&
      Operator->getName() != "tglobaltlsaddr" &&
      Operator->getName() != "tconstpool" &&
      Operator->getName() != "tjumptable" &&
      Operator->getName() != "tframeindex" &&
      Operator->getName() != "texternalsym" &&
      Operator->getName() != "tblockaddress" &&
      Operator->getName() != "tglobaladdr" &&
      Operator->getName() != "bb" &&
      Operator->getName() != "vt" &&
      Operator->getName() != "mcsym")
    error("Cannot use '" + Operator->getName() + "' in an output pattern!");
}

std::vector<TreePatternNodePtr> Children;

// Parse all the operands.
for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i)
  Children.push_back(ParseTreePattern(Dag->getArg(i), Dag->getArgNameStr(i)));

// Get the actual number of results before Operator is converted to an intrinsic
// node (which is hard-coded to have either zero or one result).
unsigned NumResults = GetNumNodeResults(Operator, CDP);

// If the operator is an intrinsic, then this is just syntactic sugar for
// (intrinsic_* <number>, ..children..).  Pick the right intrinsic node, and
// convert the intrinsic name to a number.
if (Operator->isSubClassOf("Intrinsic")) {
  const CodeGenIntrinsic &Int = getDAGPatterns().getIntrinsic(Operator);
  unsigned IID = getDAGPatterns().getIntrinsicID(Operator)+1;

  // If this intrinsic returns void, it must have side-effects and thus a
  // chain.
  if (Int.IS.RetVTs.empty())
    Operator = getDAGPatterns().get_intrinsic_void_sdnode();
  else if (Int.ModRef != CodeGenIntrinsic::NoMem || Int.hasSideEffects)
    // Has side-effects, requires chain.
    Operator = getDAGPatterns().get_intrinsic_w_chain_sdnode();
  else // Otherwise, no chain.
    Operator = getDAGPatterns().get_intrinsic_wo_chain_sdnode();

  Children.insert(Children.begin(),
                  std::make_shared<TreePatternNode>(IntInit::get(IID), 1));
}

if (Operator->isSubClassOf("ComplexPattern")) {
  for (unsigned i = 0; i < Children.size(); ++i) {
    TreePatternNodePtr Child = Children[i];

    if (Child->getName().empty())
      error("All arguments to a ComplexPattern must be named");

    // Check that the ComplexPattern uses are consistent: "(MY_PAT $a, $b)"
    // and "(MY_PAT $b, $a)" should not be allowed in the same pattern;
    // neither should "(MY_PAT_1 $a, $b)" and "(MY_PAT_2 $a, $b)".
    auto OperandId = std::make_pair(Operator, i);
    auto PrevOp = ComplexPatternOperands.find(Child->getName());
    if (PrevOp != ComplexPatternOperands.end()) {
      if (PrevOp->getValue() != OperandId)
        error("All ComplexPattern operands must appear consistently: "
              "in the same order in just one ComplexPattern instance.");
    } else
      ComplexPatternOperands[Child->getName()] = OperandId;
  }
}

TreePatternNodePtr Result =
    std::make_shared<TreePatternNode>(Operator, std::move(Children),
                                      NumResults);
Result->setName(OpName);

if (Dag->getName()) {
  assert(Result->getName().empty())(static_cast<void> (0));
  Result->setName(Dag->getNameStr());
}
return Result;
2965}

2967/// SimplifyTree - See if we can simplify this tree to eliminate something that
2968/// will never match in favor of something obvious that will.  This is here
2969/// strictly as a convenience to target authors because it allows them to write
2970/// more type generic things and have useless type casts fold away.
2971///
2972/// This returns true if any change is made.
2973static bool SimplifyTree(TreePatternNodePtr &N) {
if (N->isLeaf())
  return false;

// If we have a bitconvert with a resolved type and if the source and
// destination types are the same, then the bitconvert is useless, remove it.
//
// We make an exception if the types are completely empty. This can come up
// when the pattern being simplified is in the Fragments list of a PatFrags,
// so that the operand is just an untyped "node". In that situation we leave
// bitconverts unsimplified, and simplify them later once the fragment is
// expanded into its true context.
if (N->getOperator()->getName() == "bitconvert" &&
    N->getExtType(0).isValueTypeByHwMode(false) &&
    !N->getExtType(0).empty() &&
    N->getExtType(0) == N->getChild(0)->getExtType(0) &&
    N->getName().empty()) {
  N = N->getChildShared(0);
  SimplifyTree(N);
  return true;
}

// Walk all children.
bool MadeChange = false;
for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
  TreePatternNodePtr Child = N->getChildShared(i);
  MadeChange |= SimplifyTree(Child);
  N->setChild(i, std::move(Child));
}
return MadeChange;
3003}



3007/// InferAllTypes - Infer/propagate as many types throughout the expression
3008/// patterns as possible.  Return true if all types are inferred, false
3009/// otherwise.  Flags an error if a type contradiction is found.
3010bool TreePattern::
3011InferAllTypes(const StringMap<SmallVector<TreePatternNode*,1> > *InNamedTypes) {
if (NamedNodes.empty())
  ComputeNamedNodes();

bool MadeChange = true;
while (MadeChange) {
  MadeChange = false;
  for (TreePatternNodePtr &Tree : Trees) {
    MadeChange |= Tree->ApplyTypeConstraints(*this, false);
    MadeChange |= SimplifyTree(Tree);
  }

  // If there are constraints on our named nodes, apply them.
  for (auto &Entry : NamedNodes) {
    SmallVectorImpl<TreePatternNode*> &Nodes = Entry.second;

    // If we have input named node types, propagate their types to the named
    // values here.
    if (InNamedTypes) {
      if (!InNamedTypes->count(Entry.getKey())) {
        error("Node '" + std::string(Entry.getKey()) +
              "' in output pattern but not input pattern");
        return true;
      }

      const SmallVectorImpl<TreePatternNode*> &InNodes =
        InNamedTypes->find(Entry.getKey())->second;

      // The input types should be fully resolved by now.
      for (TreePatternNode *Node : Nodes) {
        // If this node is a register class, and it is the root of the pattern
        // then we're mapping something onto an input register.  We allow
        // changing the type of the input register in this case.  This allows
        // us to match things like:
        //  def : Pat<(v1i64 (bitconvert(v2i32 DPR:$src))), (v1i64 DPR:$src)>;
        if (Node == Trees[0].get() && Node->isLeaf()) {
          DefInit *DI = dyn_cast<DefInit>(Node->getLeafValue());
          if (DI && (DI->getDef()->isSubClassOf("RegisterClass") ||
                     DI->getDef()->isSubClassOf("RegisterOperand")))
            continue;
        }

        assert(Node->getNumTypes() == 1 &&(static_cast<void> (0))
               InNodes[0]->getNumTypes() == 1 &&(static_cast<void> (0))
               "FIXME: cannot name multiple result nodes yet")(static_cast<void> (0));
        MadeChange |= Node->UpdateNodeType(0, InNodes[0]->getExtType(0),
                                           *this);
      }
    }

    // If there are multiple nodes with the same name, they must all have the
    // same type.
    if (Entry.second.size() > 1) {
      for (unsigned i = 0, e = Nodes.size()-1; i != e; ++i) {
        TreePatternNode *N1 = Nodes[i], *N2 = Nodes[i+1];
        assert(N1->getNumTypes() == 1 && N2->getNumTypes() == 1 &&(static_cast<void> (0))
               "FIXME: cannot name multiple result nodes yet")(static_cast<void> (0));

        MadeChange |= N1->UpdateNodeType(0, N2->getExtType(0), *this);
        MadeChange |= N2->UpdateNodeType(0, N1->getExtType(0), *this);
      }
    }
  }
}

bool HasUnresolvedTypes = false;
for (const TreePatternNodePtr &Tree : Trees)
  HasUnresolvedTypes |= Tree->ContainsUnresolvedType(*this);
return !HasUnresolvedTypes;
3080}

3082void TreePattern::print(raw_ostream &OS) const {
OS << getRecord()->getName();
if (!Args.empty()) {
  OS << "(";
  ListSeparator LS;
  for (const std::string &Arg : Args)
    OS << LS << Arg;
  OS << ")";
}
OS << ": ";

if (Trees.size() > 1)
  OS << "[\n";
for (const TreePatternNodePtr &Tree : Trees) {
  OS << "\t";
  Tree->print(OS);
  OS << "\n";
}

if (Trees.size() > 1)
  OS << "]\n";
3103}

3105void TreePattern::dump() const { print(errs()); }

3107//===----------------------------------------------------------------------===//
3108// CodeGenDAGPatterns implementation
3109//

3111CodeGenDAGPatterns::CodeGenDAGPatterns(RecordKeeper &R,
                                     PatternRewriterFn PatternRewriter)
  : Records(R), Target(R), LegalVTS(Target.getLegalValueTypes()),
    PatternRewriter(PatternRewriter) {

Intrinsics = CodeGenIntrinsicTable(Records);
ParseNodeInfo();
ParseNodeTransforms();
ParseComplexPatterns();
ParsePatternFragments();
ParseDefaultOperands();
ParseInstructions();
ParsePatternFragments(/*OutFrags*/true);
ParsePatterns();

// Generate variants.  For example, commutative patterns can match
// multiple ways.  Add them to PatternsToMatch as well.
GenerateVariants();

// Break patterns with parameterized types into a series of patterns,
// where each one has a fixed type and is predicated on the conditions
// of the associated HW mode.
ExpandHwModeBasedTypes();

// Infer instruction flags.  For example, we can detect loads,
// stores, and side effects in many cases by examining an
// instruction's pattern.
InferInstructionFlags();

// Verify that instruction flags match the patterns.
VerifyInstructionFlags();
3142}

3144Record *CodeGenDAGPatterns::getSDNodeNamed(StringRef Name) const {
Record *N = Records.getDef(Name);
if (!N || !N->isSubClassOf("SDNode"))
  PrintFatalError("Error getting SDNode '" + Name + "'!");

return N;
3150}

3152// Parse all of the SDNode definitions for the target, populating SDNodes.
3153void CodeGenDAGPatterns::ParseNodeInfo() {
std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode");
const CodeGenHwModes &CGH = getTargetInfo().getHwModes();

while (!Nodes.empty()) {
  Record *R = Nodes.back();
  SDNodes.insert(std::make_pair(R, SDNodeInfo(R, CGH)));
  Nodes.pop_back();
}

// Get the builtin intrinsic nodes.
intrinsic_void_sdnode     = getSDNodeNamed("intrinsic_void");
intrinsic_w_chain_sdnode  = getSDNodeNamed("intrinsic_w_chain");
intrinsic_wo_chain_sdnode = getSDNodeNamed("intrinsic_wo_chain");
3167}

3169/// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
3170/// map, and emit them to the file as functions.
3171void CodeGenDAGPatterns::ParseNodeTransforms() {
std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm");
while (!Xforms.empty()) {
  Record *XFormNode = Xforms.back();
  Record *SDNode = XFormNode->getValueAsDef("Opcode");
  StringRef Code = XFormNode->getValueAsString("XFormFunction");
  SDNodeXForms.insert(
      std::make_pair(XFormNode, NodeXForm(SDNode, std::string(Code))));

  Xforms.pop_back();
}
3182}

3184void CodeGenDAGPatterns::ParseComplexPatterns() {
std::vector<Record*> AMs = Records.getAllDerivedDefinitions("ComplexPattern");
while (!AMs.empty()) {
  ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));
  AMs.pop_back();
}
3190}


3193/// ParsePatternFragments - Parse all of the PatFrag definitions in the .td
3194/// file, building up the PatternFragments map.  After we've collected them all,
3195/// inline fragments together as necessary, so that there are no references left
3196/// inside a pattern fragment to a pattern fragment.
3197///
3198void CodeGenDAGPatterns::ParsePatternFragments(bool OutFrags) {
std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrags");

// First step, parse all of the fragments.
for (Record *Frag : Fragments) {
  if (OutFrags != Frag->isSubClassOf("OutPatFrag"))
    continue;

  ListInit *LI = Frag->getValueAsListInit("Fragments");
  TreePattern *P =
      (PatternFragments[Frag] = std::make_unique<TreePattern>(
           Frag, LI, !Frag->isSubClassOf("OutPatFrag"),
           *this)).get();

  // Validate the argument list, converting it to set, to discard duplicates.
  std::vector<std::string> &Args = P->getArgList();
  // Copy the args so we can take StringRefs to them.
  auto ArgsCopy = Args;
  SmallDenseSet<StringRef, 4> OperandsSet;
  OperandsSet.insert(ArgsCopy.begin(), ArgsCopy.end());

  if (OperandsSet.count(""))
    P->error("Cannot have unnamed 'node' values in pattern fragment!");

  // Parse the operands list.
  DagInit *OpsList = Frag->getValueAsDag("Operands");
  DefInit *OpsOp = dyn_cast<DefInit>(OpsList->getOperator());
  // Special cases: ops == outs == ins. Different names are used to
  // improve readability.
  if (!OpsOp ||
      (OpsOp->getDef()->getName() != "ops" &&
       OpsOp->getDef()->getName() != "outs" &&
       OpsOp->getDef()->getName() != "ins"))
    P->error("Operands list should start with '(ops ... '!");

  // Copy over the arguments.
  Args.clear();
  for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {
    if (!isa<DefInit>(OpsList->getArg(j)) ||
        cast<DefInit>(OpsList->getArg(j))->getDef()->getName() != "node")
      P->error("Operands list should all be 'node' values.");
    if (!OpsList->getArgName(j))
      P->error("Operands list should have names for each operand!");
    StringRef ArgNameStr = OpsList->getArgNameStr(j);
    if (!OperandsSet.count(ArgNameStr))
      P->error("'" + ArgNameStr +
               "' does not occur in pattern or was multiply specified!");
    OperandsSet.erase(ArgNameStr);
    Args.push_back(std::string(ArgNameStr));
  }

  if (!OperandsSet.empty())
    P->error("Operands list does not contain an entry for operand '" +
             *OperandsSet.begin() + "'!");

  // If there is a node transformation corresponding to this, keep track of
  // it.
  Record *Transform = Frag->getValueAsDef("OperandTransform");
  if (!getSDNodeTransform(Transform).second.empty())    // not noop xform?
    for (const auto &T : P->getTrees())
      T->setTransformFn(Transform);
}

// Now that we've parsed all of the tree fragments, do a closure on them so
// that there are not references to PatFrags left inside of them.
for (Record *Frag : Fragments) {
  if (OutFrags != Frag->isSubClassOf("OutPatFrag"))
    continue;

  TreePattern &ThePat = *PatternFragments[Frag];
  ThePat.InlinePatternFragments();

  // Infer as many types as possible.  Don't worry about it if we don't infer
  // all of them, some may depend on the inputs of the pattern.  Also, don't
  // validate type sets; validation may cause spurious failures e.g. if a
  // fragment needs floating-point types but the current target does not have
  // any (this is only an error if that fragment is ever used!).
  {
    TypeInfer::SuppressValidation SV(ThePat.getInfer());
    ThePat.InferAllTypes();
    ThePat.resetError();
  }

  // If debugging, print out the pattern fragment result.
  LLVM_DEBUG(ThePat.dump())do { } while (false);
}
3284}

3286void CodeGenDAGPatterns::ParseDefaultOperands() {
std::vector<Record*> DefaultOps;
DefaultOps = Records.getAllDerivedDefinitions("OperandWithDefaultOps");

// Find some SDNode.
assert(!SDNodes.empty() && "No SDNodes parsed?")(static_cast<void> (0));
Init *SomeSDNode = DefInit::get(SDNodes.begin()->first);

for (unsigned i = 0, e = DefaultOps.size(); i != e; ++i) {
  DagInit *DefaultInfo = DefaultOps[i]->getValueAsDag("DefaultOps");

  // Clone the DefaultInfo dag node, changing the operator from 'ops' to
  // SomeSDnode so that we can parse this.
  std::vector<std::pair<Init*, StringInit*> > Ops;
  for (unsigned op = 0, e = DefaultInfo->getNumArgs(); op != e; ++op)
    Ops.push_back(std::make_pair(DefaultInfo->getArg(op),
                                 DefaultInfo->getArgName(op)));
  DagInit *DI = DagInit::get(SomeSDNode, nullptr, Ops);

  // Create a TreePattern to parse this.
  TreePattern P(DefaultOps[i], DI, false, *this);
  assert(P.getNumTrees() == 1 && "This ctor can only produce one tree!")(static_cast<void> (0));

  // Copy the operands over into a DAGDefaultOperand.
  DAGDefaultOperand DefaultOpInfo;

  const TreePatternNodePtr &T = P.getTree(0);
  for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {
    TreePatternNodePtr TPN = T->getChildShared(op);
    while (TPN->ApplyTypeConstraints(P, false))
      /* Resolve all types */;

    if (TPN->ContainsUnresolvedType(P)) {
      PrintFatalError("Value #" + Twine(i) + " of OperandWithDefaultOps '" +
                      DefaultOps[i]->getName() +
                      "' doesn't have a concrete type!");
    }
    DefaultOpInfo.DefaultOps.push_back(std::move(TPN));
  }

  // Insert it into the DefaultOperands map so we can find it later.
  DefaultOperands[DefaultOps[i]] = DefaultOpInfo;
}
3329}

3331/// HandleUse - Given "Pat" a leaf in the pattern, check to see if it is an
3332/// instruction input.  Return true if this is a real use.
3333static bool HandleUse(TreePattern &I, TreePatternNodePtr Pat,
                    std::map<std::string, TreePatternNodePtr> &InstInputs) {
// No name -> not interesting.
if (Pat->getName().empty()) {
  if (Pat->isLeaf()) {
    DefInit *DI = dyn_cast<DefInit>(Pat->getLeafValue());
    if (DI && (DI->getDef()->isSubClassOf("RegisterClass") ||
               DI->getDef()->isSubClassOf("RegisterOperand")))
      I.error("Input " + DI->getDef()->getName() + " must be named!");
  }
  return false;
}

Record *Rec;
if (Pat->isLeaf()) {
  DefInit *DI = dyn_cast<DefInit>(Pat->getLeafValue());
  if (!DI)
    I.error("Input $" + Pat->getName() + " must be an identifier!");
  Rec = DI->getDef();
} else {
  Rec = Pat->getOperator();
}

// SRCVALUE nodes are ignored.
if (Rec->getName() == "srcvalue")
  return false;

TreePatternNodePtr &Slot = InstInputs[Pat->getName()];
if (!Slot) {
  Slot = Pat;
  return true;
}
Record *SlotRec;
if (Slot->isLeaf()) {
  SlotRec = cast<DefInit>(Slot->getLeafValue())->getDef();
} else {
  assert(Slot->getNumChildren() == 0 && "can't be a use with children!")(static_cast<void> (0));
  SlotRec = Slot->getOperator();
}

// Ensure that the inputs agree if we've already seen this input.
if (Rec != SlotRec)
  I.error("All $" + Pat->getName() + " inputs must agree with each other");
// Ensure that the types can agree as well.
Slot->UpdateNodeType(0, Pat->getExtType(0), I);
Pat->UpdateNodeType(0, Slot->getExtType(0), I);
if (Slot->getExtTypes() != Pat->getExtTypes())
  I.error("All $" + Pat->getName() + " inputs must agree with each other");
return true;
3382}

3384/// FindPatternInputsAndOutputs - Scan the specified TreePatternNode (which is
3385/// part of "I", the instruction), computing the set of inputs and outputs of
3386/// the pattern.  Report errors if we see anything naughty.
3387void CodeGenDAGPatterns::FindPatternInputsAndOutputs(
  TreePattern &I, TreePatternNodePtr Pat,
  std::map<std::string, TreePatternNodePtr> &InstInputs,
  MapVector<std::string, TreePatternNodePtr, std::map<std::string, unsigned>>
      &InstResults,
  std::vector<Record *> &InstImpResults) {

// The instruction pattern still has unresolved fragments.  For *named*
// nodes we must resolve those here.  This may not result in multiple
// alternatives.
if (!Pat->getName().empty()) {
  TreePattern SrcPattern(I.getRecord(), Pat, true, *this);
  SrcPattern.InlinePatternFragments();
  SrcPattern.InferAllTypes();
  Pat = SrcPattern.getOnlyTree();
}

if (Pat->isLeaf()) {
  bool isUse = HandleUse(I, Pat, InstInputs);
  if (!isUse && Pat->getTransformFn())
    I.error("Cannot specify a transform function for a non-input value!");
  return;
}

if (Pat->getOperator()->getName() == "implicit") {
  for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
    TreePatternNode *Dest = Pat->getChild(i);
    if (!Dest->isLeaf())
      I.error("implicitly defined value should be a register!");

    DefInit *Val = dyn_cast<DefInit>(Dest->getLeafValue());
    if (!Val || !Val->getDef()->isSubClassOf("Register"))
      I.error("implicitly defined value should be a register!");
    InstImpResults.push_back(Val->getDef());
  }
  return;
}

if (Pat->getOperator()->getName() != "set") {
  // If this is not a set, verify that the children nodes are not void typed,
  // and recurse.
  for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
    if (Pat->getChild(i)->getNumTypes() == 0)
      I.error("Cannot have void nodes inside of patterns!");
    FindPatternInputsAndOutputs(I, Pat->getChildShared(i), InstInputs,
                                InstResults, InstImpResults);
  }

  // If this is a non-leaf node with no children, treat it basically as if
  // it were a leaf.  This handles nodes like (imm).
  bool isUse = HandleUse(I, Pat, InstInputs);

  if (!isUse && Pat->getTransformFn())
    I.error("Cannot specify a transform function for a non-input value!");
  return;
}

// Otherwise, this is a set, validate and collect instruction results.
if (Pat->getNumChildren() == 0)
  I.error("set requires operands!");

if (Pat->getTransformFn())
  I.error("Cannot specify a transform function on a set node!");

// Check the set destinations.
unsigned NumDests = Pat->getNumChildren()-1;
for (unsigned i = 0; i != NumDests; ++i) {
  TreePatternNodePtr Dest = Pat->getChildShared(i);
  // For set destinations we also must resolve fragments here.
  TreePattern DestPattern(I.getRecord(), Dest, false, *this);
  DestPattern.InlinePatternFragments();
  DestPattern.InferAllTypes();
  Dest = DestPattern.getOnlyTree();

  if (!Dest->isLeaf())
    I.error("set destination should be a register!");

  DefInit *Val = dyn_cast<DefInit>(Dest->getLeafValue());
  if (!Val) {
    I.error("set destination should be a register!");
    continue;
  }

  if (Val->getDef()->isSubClassOf("RegisterClass") ||
      Val->getDef()->isSubClassOf("ValueType") ||
      Val->getDef()->isSubClassOf("RegisterOperand") ||
      Val->getDef()->isSubClassOf("PointerLikeRegClass")) {
    if (Dest->getName().empty())
      I.error("set destination must have a name!");
    if (InstResults.count(Dest->getName()))
      I.error("cannot set '" + Dest->getName() + "' multiple times");
    InstResults[Dest->getName()] = Dest;
  } else if (Val->getDef()->isSubClassOf("Register")) {
    InstImpResults.push_back(Val->getDef());
  } else {
    I.error("set destination should be a register!");
  }
}

// Verify and collect info from the computation.
FindPatternInputsAndOutputs(I, Pat->getChildShared(NumDests), InstInputs,
                            InstResults, InstImpResults);
3489}

3491//===----------------------------------------------------------------------===//
3492// Instruction Analysis
3493//===----------------------------------------------------------------------===//

3495class InstAnalyzer {
const CodeGenDAGPatterns &CDP;
3497public:
bool hasSideEffects;
bool mayStore;
bool mayLoad;
bool isBitcast;
bool isVariadic;
bool hasChain;

InstAnalyzer(const CodeGenDAGPatterns &cdp)
  : CDP(cdp), hasSideEffects(false), mayStore(false), mayLoad(false),
    isBitcast(false), isVariadic(false), hasChain(false) {}

void Analyze(const PatternToMatch &Pat) {
  const TreePatternNode *N = Pat.getSrcPattern();
  AnalyzeNode(N);
  // These properties are detected only on the root node.
  isBitcast = IsNodeBitcast(N);
}

3516private:
bool IsNodeBitcast(const TreePatternNode *N) const {
  if (hasSideEffects || mayLoad || mayStore || isVariadic)
    return false;

  if (N->isLeaf())
    return false;
  if (N->getNumChildren() != 1 || !N->getChild(0)->isLeaf())
    return false;

  if (N->getOperator()->isSubClassOf("ComplexPattern"))
    return false;

  const SDNodeInfo &OpInfo = CDP.getSDNodeInfo(N->getOperator());
  if (OpInfo.getNumResults() != 1 || OpInfo.getNumOperands() != 1)
    return false;
  return OpInfo.getEnumName() == "ISD::BITCAST";
}

3535public:
void AnalyzeNode(const TreePatternNode *N) {
  if (N->isLeaf()) {
    if (DefInit *DI = dyn_cast<DefInit>(N->getLeafValue())) {
      Record *LeafRec = DI->getDef();
      // Handle ComplexPattern leaves.
      if (LeafRec->isSubClassOf("ComplexPattern")) {
        const ComplexPattern &CP = CDP.getComplexPattern(LeafRec);
        if (CP.hasProperty(SDNPMayStore)) mayStore = true;
        if (CP.hasProperty(SDNPMayLoad)) mayLoad = true;
        if (CP.hasProperty(SDNPSideEffect)) hasSideEffects = true;
      }
    }
    return;
  }

  // Analyze children.
  for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
    AnalyzeNode(N->getChild(i));

  // Notice properties of the node.
  if (N->NodeHasProperty(SDNPMayStore, CDP)) mayStore = true;
  if (N->NodeHasProperty(SDNPMayLoad, CDP)) mayLoad = true;
  if (N->NodeHasProperty(SDNPSideEffect, CDP)) hasSideEffects = true;
  if (N->NodeHasProperty(SDNPVariadic, CDP)) isVariadic = true;
  if (N->NodeHasProperty(SDNPHasChain, CDP)) hasChain = true;

  if (const CodeGenIntrinsic *IntInfo = N->getIntrinsicInfo(CDP)) {
    // If this is an intrinsic, analyze it.
    if (IntInfo->ModRef & CodeGenIntrinsic::MR_Ref)
      mayLoad = true;// These may load memory.

    if (IntInfo->ModRef & CodeGenIntrinsic::MR_Mod)
      mayStore = true;// Intrinsics that can write to memory are 'mayStore'.

    if (IntInfo->ModRef >= CodeGenIntrinsic::ReadWriteMem ||
        IntInfo->hasSideEffects)
      // ReadWriteMem intrinsics can have other strange effects.
      hasSideEffects = true;
  }
}

3577};

3579static bool InferFromPattern(CodeGenInstruction &InstInfo,
                           const InstAnalyzer &PatInfo,
                           Record *PatDef) {
bool Error = false;

// Remember where InstInfo got its flags.
if (InstInfo.hasUndefFlags())
    InstInfo.InferredFrom = PatDef;

// Check explicitly set flags for consistency.
if (InstInfo.hasSideEffects != PatInfo.hasSideEffects &&
    !InstInfo.hasSideEffects_Unset) {
  // Allow explicitly setting hasSideEffects = 1 on instructions, even when
  // the pattern has no side effects. That could be useful for div/rem
  // instructions that may trap.
  if (!InstInfo.hasSideEffects) {
    Error = true;
    PrintError(PatDef->getLoc(), "Pattern doesn't match hasSideEffects = " +
               Twine(InstInfo.hasSideEffects));
  }
}

if (InstInfo.mayStore != PatInfo.mayStore && !InstInfo.mayStore_Unset) {
  Error = true;
  PrintError(PatDef->getLoc(), "Pattern doesn't match mayStore = " +
             Twine(InstInfo.mayStore));
}

if (InstInfo.mayLoad != PatInfo.mayLoad && !InstInfo.mayLoad_Unset) {
  // Allow explicitly setting mayLoad = 1, even when the pattern has no loads.
  // Some targets translate immediates to loads.
  if (!InstInfo.mayLoad) {
    Error = true;
    PrintError(PatDef->getLoc(), "Pattern doesn't match mayLoad = " +
               Twine(InstInfo.mayLoad));
  }
}

// Transfer inferred flags.
InstInfo.hasSideEffects |= PatInfo.hasSideEffects;
InstInfo.mayStore |= PatInfo.mayStore;
InstInfo.mayLoad |= PatInfo.mayLoad;

// These flags are silently added without any verification.
// FIXME: To match historical behavior of TableGen, for now add those flags
// only when we're inferring from the primary instruction pattern.
if (PatDef->isSubClassOf("Instruction")) {
  InstInfo.isBitcast |= PatInfo.isBitcast;
  InstInfo.hasChain |= PatInfo.hasChain;
  InstInfo.hasChain_Inferred = true;
}

// Don't infer isVariadic. This flag means something different on SDNodes and
// instructions. For example, a CALL SDNode is variadic because it has the
// call arguments as operands, but a CALL instruction is not variadic - it
// has argument registers as implicit, not explicit uses.

return Error;
3637}

3639/// hasNullFragReference - Return true if the DAG has any reference to the
3640/// null_frag operator.
3641static bool hasNullFragReference(DagInit *DI) {
DefInit *OpDef = dyn_cast<DefInit>(DI->getOperator());
if (!OpDef) return false;
Record *Operator = OpDef->getDef();

// If this is the null fragment, return true.
if (Operator->getName() == "null_frag") return true;
// If any of the arguments reference the null fragment, return true.
for (unsigned i = 0, e = DI->getNumArgs(); i != e; ++i) {
  if (auto Arg = dyn_cast<DefInit>(DI->getArg(i)))
    if (Arg->getDef()->getName() == "null_frag")
      return true;
  DagInit *Arg = dyn_cast<DagInit>(DI->getArg(i));
  if (Arg && hasNullFragReference(Arg))
    return true;
}

return false;
3659}

3661/// hasNullFragReference - Return true if any DAG in the list references
3662/// the null_frag operator.
3663static bool hasNullFragReference(ListInit *LI) {
for (Init *I : LI->getValues()) {
  DagInit *DI = dyn_cast<DagInit>(I);
  assert(DI && "non-dag in an instruction Pattern list?!")(static_cast<void> (0));
  if (hasNullFragReference(DI))
    return true;
}
return false;
3671}

3673/// Get all the instructions in a tree.
3674static void
3675getInstructionsInTree(TreePatternNode *Tree, SmallVectorImpl<Record*> &Instrs) {
if (Tree->isLeaf())
  return;
if (Tree->getOperator()->isSubClassOf("Instruction"))
  Instrs.push_back(Tree->getOperator());
for (unsigned i = 0, e = Tree->getNumChildren(); i != e; ++i)
  getInstructionsInTree(Tree->getChild(i), Instrs);
3682}

3684/// Check the class of a pattern leaf node against the instruction operand it
3685/// represents.
3686static bool checkOperandClass(CGIOperandList::OperandInfo &OI,
                            Record *Leaf) {
if (OI.Rec == Leaf)
  return true;

// Allow direct value types to be used in instruction set patterns.
// The type will be checked later.
if (Leaf->isSubClassOf("ValueType"))
  return true;

// Patterns can also be ComplexPattern instances.
if (Leaf->isSubClassOf("ComplexPattern"))
  return true;

return false;
3701}

3703void CodeGenDAGPatterns::parseInstructionPattern(
  CodeGenInstruction &CGI, ListInit *Pat, DAGInstMap &DAGInsts) {

assert(!DAGInsts.count(CGI.TheDef) && "Instruction already parsed!")(static_cast<void> (0));

// Parse the instruction.
TreePattern I(CGI.TheDef, Pat, true, *this);

// InstInputs - Keep track of all of the inputs of the instruction, along
// with the record they are declared as.
std::map<std::string, TreePatternNodePtr> InstInputs;

// InstResults - Keep track of all the virtual registers that are 'set'
// in the instruction, including what reg class they are.
MapVector<std::string, TreePatternNodePtr, std::map<std::string, unsigned>>
    InstResults;

std::vector<Record*> InstImpResults;

// Verify that the top-level forms in the instruction are of void type, and
// fill in the InstResults map.
SmallString<32> TypesString;
for (unsigned j = 0, e = I.getNumTrees(); j != e; ++j) {
1
Assuming 'j' is equal to 'e'→
2
←
Loop condition is false. Execution continues on line 3748→
  TypesString.clear();
  TreePatternNodePtr Pat = I.getTree(j);
  if (Pat->getNumTypes() != 0) {
    raw_svector_ostream OS(TypesString);
    ListSeparator LS;
    for (unsigned k = 0, ke = Pat->getNumTypes(); k != ke; ++k) {
      OS << LS;
      Pat->getExtType(k).writeToStream(OS);
    }
    I.error("Top-level forms in instruction pattern should have"
             " void types, has types " +
             OS.str());
  }

  // Find inputs and outputs, and verify the structure of the uses/defs.
  FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults,
                              InstImpResults);
}

// Now that we have inputs and outputs of the pattern, inspect the operands
// list for the instruction.  This determines the order that operands are
// added to the machine instruction the node corresponds to.
unsigned NumResults = InstResults.size();

// Parse the operands list from the (ops) list, validating it.
assert(I.getArgList().empty() && "Args list should still be empty here!")(static_cast<void> (0));

// Check that all of the results occur first in the list.
std::vector<Record*> Results;
std::vector<unsigned> ResultIndices;
SmallVector<TreePatternNodePtr, 2> ResNodes;
for (unsigned i = 0; i != NumResults; ++i) {
3
←
Assuming 'i' is equal to 'NumResults'→
4
←
Loop condition is false. Execution continues on line 3798→
  if (i == CGI.Operands.size()) {
    const std::string &OpName =
        llvm::find_if(
            InstResults,
            [](const std::pair<std::string, TreePatternNodePtr> &P) {
              return P.second;
            })
            ->first;

    I.error("'" + OpName + "' set but does not appear in operand list!");
  }

  const std::string &OpName = CGI.Operands[i].Name;

  // Check that it exists in InstResults.
  auto InstResultIter = InstResults.find(OpName);
  if (InstResultIter == InstResults.end() || !InstResultIter->second)
    I.error("Operand $" + OpName + " does not exist in operand list!");

  TreePatternNodePtr RNode = InstResultIter->second;
  Record *R = cast<DefInit>(RNode->getLeafValue())->getDef();
  ResNodes.push_back(std::move(RNode));
  if (!R)
    I.error("Operand $" + OpName + " should be a set destination: all "
             "outputs must occur before inputs in operand list!");

  if (!checkOperandClass(CGI.Operands[i], R))
    I.error("Operand $" + OpName + " class mismatch!");

  // Remember the return type.
  Results.push_back(CGI.Operands[i].Rec);

  // Remember the result index.
  ResultIndices.push_back(std::distance(InstResults.begin(), InstResultIter));

  // Okay, this one checks out.
  InstResultIter->second = nullptr;
}

// Loop over the inputs next.
std::vector<TreePatternNodePtr> ResultNodeOperands;
std::vector<Record*> Operands;
for (unsigned i = NumResults, e = CGI.Operands.size(); i != e; ++i) {
5
←
Assuming 'i' is equal to 'e'→
6
←
Loop condition is false. Execution continues on line 3847→
  CGIOperandList::OperandInfo &Op = CGI.Operands[i];
  const std::string &OpName = Op.Name;
  if (OpName.empty())
    I.error("Operand #" + Twine(i) + " in operands list has no name!");

  if (!InstInputs.count(OpName)) {
    // If this is an operand with a DefaultOps set filled in, we can ignore
    // this.  When we codegen it, we will do so as always executed.
    if (Op.Rec->isSubClassOf("OperandWithDefaultOps")) {
      // Does it have a non-empty DefaultOps field?  If so, ignore this
      // operand.
      if (!getDefaultOperand(Op.Rec).DefaultOps.empty())
        continue;
    }
    I.error("Operand $" + OpName +
             " does not appear in the instruction pattern");
  }
  TreePatternNodePtr InVal = InstInputs[OpName];
  InstInputs.erase(OpName);   // It occurred, remove from map.

  if (InVal->isLeaf() && isa<DefInit>(InVal->getLeafValue())) {
    Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef();
    if (!checkOperandClass(Op, InRec))
      I.error("Operand $" + OpName + "'s register class disagrees"
               " between the operand and pattern");
  }
  Operands.push_back(Op.Rec);

  // Construct the result for the dest-pattern operand list.
  TreePatternNodePtr OpNode = InVal->clone();

  // No predicate is useful on the result.
  OpNode->clearPredicateCalls();

  // Promote the xform function to be an explicit node if set.
  if (Record *Xform = OpNode->getTransformFn()) {
    OpNode->setTransformFn(nullptr);
    std::vector<TreePatternNodePtr> Children;
    Children.push_back(OpNode);
    OpNode = std::make_shared<TreePatternNode>(Xform, std::move(Children),
                                               OpNode->getNumTypes());
  }

  ResultNodeOperands.push_back(std::move(OpNode));
}

if (!InstInputs.empty())
7
←
Assuming the condition is false→
8
←
Taking false branch→
  I.error("Input operand $" + InstInputs.begin()->first +
          " occurs in pattern but not in operands list!");

TreePatternNodePtr ResultPattern = std::make_shared<TreePatternNode>(
    I.getRecord(), std::move(ResultNodeOperands),
    GetNumNodeResults(I.getRecord(), *this));
9
←
Calling 'GetNumNodeResults'→
// Copy fully inferred output node types to instruction result pattern.
for (unsigned i = 0; i != NumResults; ++i) {
  assert(ResNodes[i]->getNumTypes() == 1 && "FIXME: Unhandled")(static_cast<void> (0));
  ResultPattern->setType(i, ResNodes[i]->getExtType(0));
  ResultPattern->setResultIndex(i, ResultIndices[i]);
}

// FIXME: Assume only the first tree is the pattern. The others are clobber
// nodes.
TreePatternNodePtr Pattern = I.getTree(0);
TreePatternNodePtr SrcPattern;
if (Pattern->getOperator()->getName() == "set") {
  SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();
} else{
  // Not a set (store or something?)
  SrcPattern = Pattern;
}

// Create and insert the instruction.
// FIXME: InstImpResults should not be part of DAGInstruction.
Record *R = I.getRecord();
DAGInsts.emplace(std::piecewise_construct, std::forward_as_tuple(R),
                 std::forward_as_tuple(Results, Operands, InstImpResults,
                                       SrcPattern, ResultPattern));

LLVM_DEBUG(I.dump())do { } while (false);
3880}

3882/// ParseInstructions - Parse all of the instructions, inlining and resolving
3883/// any fragments involved.  This populates the Instructions list with fully
3884/// resolved instructions.
3885void CodeGenDAGPatterns::ParseInstructions() {
std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction");

for (Record *Instr : Instrs) {
  ListInit *LI = nullptr;

  if (isa<ListInit>(Instr->getValueInit("Pattern")))
    LI = Instr->getValueAsListInit("Pattern");

  // If there is no pattern, only collect minimal information about the
  // instruction for its operand list.  We have to assume that there is one
  // result, as we have no detailed info. A pattern which references the
  // null_frag operator is as-if no pattern were specified. Normally this
  // is from a multiclass expansion w/ a SDPatternOperator passed in as
  // null_frag.
  if (!LI || LI->empty() || hasNullFragReference(LI)) {
    std::vector<Record*> Results;
    std::vector<Record*> Operands;

    CodeGenInstruction &InstInfo = Target.getInstruction(Instr);

    if (InstInfo.Operands.size() != 0) {
      for (unsigned j = 0, e = InstInfo.Operands.NumDefs; j < e; ++j)
        Results.push_back(InstInfo.Operands[j].Rec);

      // The rest are inputs.
      for (unsigned j = InstInfo.Operands.NumDefs,
             e = InstInfo.Operands.size(); j < e; ++j)
        Operands.push_back(InstInfo.Operands[j].Rec);
    }

    // Create and insert the instruction.
    std::vector<Record*> ImpResults;
    Instructions.insert(std::make_pair(Instr,
                          DAGInstruction(Results, Operands, ImpResults)));
    continue;  // no pattern.
  }

  CodeGenInstruction &CGI = Target.getInstruction(Instr);
  parseInstructionPattern(CGI, LI, Instructions);
}

// If we can, convert the instructions to be patterns that are matched!
for (auto &Entry : Instructions) {
  Record *Instr = Entry.first;
  DAGInstruction &TheInst = Entry.second;
  TreePatternNodePtr SrcPattern = TheInst.getSrcPattern();
  TreePatternNodePtr ResultPattern = TheInst.getResultPattern();

  if (SrcPattern && ResultPattern) {
    TreePattern Pattern(Instr, SrcPattern, true, *this);
    TreePattern Result(Instr, ResultPattern, false, *this);
    ParseOnePattern(Instr, Pattern, Result, TheInst.getImpResults());
  }
}
3940}

3942typedef std::pair<TreePatternNode *, unsigned> NameRecord;

3944static void FindNames(TreePatternNode *P,
                    std::map<std::string, NameRecord> &Names,
                    TreePattern *PatternTop) {
if (!P->getName().empty()) {
  NameRecord &Rec = Names[P->getName()];
  // If this is the first instance of the name, remember the node.
  if (Rec.second++ == 0)
    Rec.first = P;
  else if (Rec.first->getExtTypes() != P->getExtTypes())
    PatternTop->error("repetition of value: $" + P->getName() +
                      " where different uses have different types!");
}

if (!P->isLeaf()) {
  for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
    FindNames(P->getChild(i), Names, PatternTop);
}
3961}

3963void CodeGenDAGPatterns::AddPatternToMatch(TreePattern *Pattern,
                                         PatternToMatch &&PTM) {
// Do some sanity checking on the pattern we're about to match.
std::string Reason;
if (!PTM.getSrcPattern()->canPatternMatch(Reason, *this)) {
  PrintWarning(Pattern->getRecord()->getLoc(),
    Twine("Pattern can never match: ") + Reason);
  return;
}

// If the source pattern's root is a complex pattern, that complex pattern
// must specify the nodes it can potentially match.
if (const ComplexPattern *CP =
      PTM.getSrcPattern()->getComplexPatternInfo(*this))
  if (CP->getRootNodes().empty())
    Pattern->error("ComplexPattern at root must specify list of opcodes it"
                   " could match");


// Find all of the named values in the input and output, ensure they have the
// same type.
std::map<std::string, NameRecord> SrcNames, DstNames;
FindNames(PTM.getSrcPattern(), SrcNames, Pattern);
FindNames(PTM.getDstPattern(), DstNames, Pattern);

// Scan all of the named values in the destination pattern, rejecting them if
// they don't exist in the input pattern.
for (const auto &Entry : DstNames) {
  if (SrcNames[Entry.first].first == nullptr)
    Pattern->error("Pattern has input without matching name in output: $" +
                   Entry.first);
}

// Scan all of the named values in the source pattern, rejecting them if the
// name isn't used in the dest, and isn't used to tie two values together.
for (const auto &Entry : SrcNames)
  if (DstNames[Entry.first].first == nullptr &&
      SrcNames[Entry.first].second == 1)
    Pattern->error("Pattern has dead named input: $" + Entry.first);

PatternsToMatch.push_back(std::move(PTM));
4004}

4006void CodeGenDAGPatterns::InferInstructionFlags() {
ArrayRef<const CodeGenInstruction*> Instructions =
  Target.getInstructionsByEnumValue();

unsigned Errors = 0;

// Try to infer flags from all patterns in PatternToMatch.  These include
// both the primary instruction patterns (which always come first) and
// patterns defined outside the instruction.
for (const PatternToMatch &PTM : ptms()) {
  // We can only infer from single-instruction patterns, otherwise we won't
  // know which instruction should get the flags.
  SmallVector<Record*, 8> PatInstrs;
  getInstructionsInTree(PTM.getDstPattern(), PatInstrs);
  if (PatInstrs.size() != 1)
    continue;

  // Get the single instruction.
  CodeGenInstruction &InstInfo = Target.getInstruction(PatInstrs.front());

  // Only infer properties from the first pattern. We'll verify the others.
  if (InstInfo.InferredFrom)
    continue;

  InstAnalyzer PatInfo(*this);
  PatInfo.Analyze(PTM);
  Errors += InferFromPattern(InstInfo, PatInfo, PTM.getSrcRecord());
}

if (Errors)
  PrintFatalError("pattern conflicts");

// If requested by the target, guess any undefined properties.
if (Target.guessInstructionProperties()) {
  for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {
    CodeGenInstruction *InstInfo =
      const_cast<CodeGenInstruction *>(Instructions[i]);
    if (InstInfo->InferredFrom)
      continue;
    // The mayLoad and mayStore flags default to false.
    // Conservatively assume hasSideEffects if it wasn't explicit.
    if (InstInfo->hasSideEffects_Unset)
      InstInfo->hasSideEffects = true;
  }
  return;
}

// Complain about any flags that are still undefined.
for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {
  CodeGenInstruction *InstInfo =
    const_cast<CodeGenInstruction *>(Instructions[i]);
  if (InstInfo->InferredFrom)
    continue;
  if (InstInfo->hasSideEffects_Unset)
    PrintError(InstInfo->TheDef->getLoc(),
               "Can't infer hasSideEffects from patterns");
  if (InstInfo->mayStore_Unset)
    PrintError(InstInfo->TheDef->getLoc(),
               "Can't infer mayStore from patterns");
  if (InstInfo->mayLoad_Unset)
    PrintError(InstInfo->TheDef->getLoc(),
               "Can't infer mayLoad from patterns");
}
4069}


4072/// Verify instruction flags against pattern node properties.
4073void CodeGenDAGPatterns::VerifyInstructionFlags() {
unsigned Errors = 0;
for (const PatternToMatch &PTM : ptms()) {
  SmallVector<Record*, 8> Instrs;
  getInstructionsInTree(PTM.getDstPattern(), Instrs);
  if (Instrs.empty())
    continue;

  // Count the number of instructions with each flag set.
  unsigned NumSideEffects = 0;
  unsigned NumStores = 0;
  unsigned NumLoads = 0;
  for (const Record *Instr : Instrs) {
    const CodeGenInstruction &InstInfo = Target.getInstruction(Instr);
    NumSideEffects += InstInfo.hasSideEffects;
    NumStores += InstInfo.mayStore;
    NumLoads += InstInfo.mayLoad;
  }

  // Analyze the source pattern.
  InstAnalyzer PatInfo(*this);
  PatInfo.Analyze(PTM);

  // Collect error messages.
  SmallVector<std::string, 4> Msgs;

  // Check for missing flags in the output.
  // Permit extra flags for now at least.
  if (PatInfo.hasSideEffects && !NumSideEffects)
    Msgs.push_back("pattern has side effects, but hasSideEffects isn't set");

  // Don't verify store flags on instructions with side effects. At least for
  // intrinsics, side effects implies mayStore.
  if (!PatInfo.hasSideEffects && PatInfo.mayStore && !NumStores)
    Msgs.push_back("pattern may store, but mayStore isn't set");

  // Similarly, mayStore implies mayLoad on intrinsics.
  if (!PatInfo.mayStore && PatInfo.mayLoad && !NumLoads)
    Msgs.push_back("pattern may load, but mayLoad isn't set");

  // Print error messages.
  if (Msgs.empty())
    continue;
  ++Errors;

  for (const std::string &Msg : Msgs)
    PrintError(PTM.getSrcRecord()->getLoc(), Twine(Msg) + " on the " +
               (Instrs.size() == 1 ?
                "instruction" : "output instructions"));
  // Provide the location of the relevant instruction definitions.
  for (const Record *Instr : Instrs) {
    if (Instr != PTM.getSrcRecord())
      PrintError(Instr->getLoc(), "defined here");
    const CodeGenInstruction &InstInfo = Target.getInstruction(Instr);
    if (InstInfo.InferredFrom &&
        InstInfo.InferredFrom != InstInfo.TheDef &&
        InstInfo.InferredFrom != PTM.getSrcRecord())
      PrintError(InstInfo.InferredFrom->getLoc(), "inferred from pattern");
  }
}
if (Errors)
  PrintFatalError("Errors in DAG patterns");
4135}

4137/// Given a pattern result with an unresolved type, see if we can find one
4138/// instruction with an unresolved result type.  Force this result type to an
4139/// arbitrary element if it's possible types to converge results.
4140static bool ForceArbitraryInstResultType(TreePatternNode *N, TreePattern &TP) {
if (N->isLeaf())
  return false;

// Analyze children.
for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
  if (ForceArbitraryInstResultType(N->getChild(i), TP))
    return true;

if (!N->getOperator()->isSubClassOf("Instruction"))
  return false;

// If this type is already concrete or completely unknown we can't do
// anything.
TypeInfer &TI = TP.getInfer();
for (unsigned i = 0, e = N->getNumTypes(); i != e; ++i) {
  if (N->getExtType(i).empty() || TI.isConcrete(N->getExtType(i), false))
    continue;

  // Otherwise, force its type to an arbitrary choice.
  if (TI.forceArbitrary(N->getExtType(i)))
    return true;
}

return false;
4165}

4167// Promote xform function to be an explicit node wherever set.
4168static TreePatternNodePtr PromoteXForms(TreePatternNodePtr N) {
if (Record *Xform = N->getTransformFn()) {
    N->setTransformFn(nullptr);
    std::vector<TreePatternNodePtr> Children;
    Children.push_back(PromoteXForms(N));
    return std::make_shared<TreePatternNode>(Xform, std::move(Children),
                                             N->getNumTypes());
}

if (!N->isLeaf())
  for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
    TreePatternNodePtr Child = N->getChildShared(i);
    N->setChild(i, PromoteXForms(Child));
  }
return N;
4183}

4185void CodeGenDAGPatterns::ParseOnePattern(Record *TheDef,
     TreePattern &Pattern, TreePattern &Result,
     const std::vector<Record *> &InstImpResults) {

// Inline pattern fragments and expand multiple alternatives.
Pattern.InlinePatternFragments();
Result.InlinePatternFragments();

if (Result.getNumTrees() != 1)
  Result.error("Cannot use multi-alternative fragments in result pattern!");

// Infer types.
bool IterateInference;
bool InferredAllPatternTypes, InferredAllResultTypes;
do {
  // Infer as many types as possible.  If we cannot infer all of them, we
  // can never do anything with this pattern: report it to the user.
  InferredAllPatternTypes =
      Pattern.InferAllTypes(&Pattern.getNamedNodesMap());

  // Infer as many types as possible.  If we cannot infer all of them, we
  // can never do anything with this pattern: report it to the user.
  InferredAllResultTypes =
      Result.InferAllTypes(&Pattern.getNamedNodesMap());

  IterateInference = false;

  // Apply the type of the result to the source pattern.  This helps us
  // resolve cases where the input type is known to be a pointer type (which
  // is considered resolved), but the result knows it needs to be 32- or
  // 64-bits.  Infer the other way for good measure.
  for (const auto &T : Pattern.getTrees())
    for (unsigned i = 0, e = std::min(Result.getOnlyTree()->getNumTypes(),
                                      T->getNumTypes());
       i != e; ++i) {
      IterateInference |= T->UpdateNodeType(
          i, Result.getOnlyTree()->getExtType(i), Result);
      IterateInference |= Result.getOnlyTree()->UpdateNodeType(
          i, T->getExtType(i), Result);
    }

  // If our iteration has converged and the input pattern's types are fully
  // resolved but the result pattern is not fully resolved, we may have a
  // situation where we have two instructions in the result pattern and
  // the instructions require a common register class, but don't care about
  // what actual MVT is used.  This is actually a bug in our modelling:
  // output patterns should have register classes, not MVTs.
  //
  // In any case, to handle this, we just go through and disambiguate some
  // arbitrary types to the result pattern's nodes.
  if (!IterateInference && InferredAllPatternTypes &&
      !InferredAllResultTypes)
    IterateInference =
        ForceArbitraryInstResultType(Result.getTree(0).get(), Result);
} while (IterateInference);

// Verify that we inferred enough types that we can do something with the
// pattern and result.  If these fire the user has to add type casts.
if (!InferredAllPatternTypes)
  Pattern.error("Could not infer all types in pattern!");
if (!InferredAllResultTypes) {
  Pattern.dump();
  Result.error("Could not infer all types in pattern result!");
}

// Promote xform function to be an explicit node wherever set.
TreePatternNodePtr DstShared = PromoteXForms(Result.getOnlyTree());

TreePattern Temp(Result.getRecord(), DstShared, false, *this);
Temp.InferAllTypes();

ListInit *Preds = TheDef->getValueAsListInit("Predicates");
int Complexity = TheDef->getValueAsInt("AddedComplexity");

if (PatternRewriter)
  PatternRewriter(&Pattern);

// A pattern may end up with an "impossible" type, i.e. a situation
// where all types have been eliminated for some node in this pattern.
// This could occur for intrinsics that only make sense for a specific
// value type, and use a specific register class. If, for some mode,
// that register class does not accept that type, the type inference
// will lead to a contradiction, which is not an error however, but
// a sign that this pattern will simply never match.
if (Temp.getOnlyTree()->hasPossibleType())
  for (const auto &T : Pattern.getTrees())
    if (T->hasPossibleType())
      AddPatternToMatch(&Pattern,
                        PatternToMatch(TheDef, Preds, T, Temp.getOnlyTree(),
                                       InstImpResults, Complexity,
                                       TheDef->getID()));
4276}

4278void CodeGenDAGPatterns::ParsePatterns() {
std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern");

for (Record *CurPattern : Patterns) {
  DagInit *Tree = CurPattern->getValueAsDag("PatternToMatch");

  // If the pattern references the null_frag, there's nothing to do.
  if (hasNullFragReference(Tree))
    continue;

  TreePattern Pattern(CurPattern, Tree, true, *this);

  ListInit *LI = CurPattern->getValueAsListInit("ResultInstrs");
  if (LI->empty()) continue;  // no pattern.

  // Parse the instruction.
  TreePattern Result(CurPattern, LI, false, *this);

  if (Result.getNumTrees() != 1)
    Result.error("Cannot handle instructions producing instructions "
                 "with temporaries yet!");

  // Validate that the input pattern is correct.
  std::map<std::string, TreePatternNodePtr> InstInputs;
  MapVector<std::string, TreePatternNodePtr, std::map<std::string, unsigned>>
      InstResults;
  std::vector<Record*> InstImpResults;
  for (unsigned j = 0, ee = Pattern.getNumTrees(); j != ee; ++j)
    FindPatternInputsAndOutputs(Pattern, Pattern.getTree(j), InstInputs,
                                InstResults, InstImpResults);

  ParseOnePattern(CurPattern, Pattern, Result, InstImpResults);
}
4311}

4313static void collectModes(std::set<unsigned> &Modes, const TreePatternNode *N) {
for (const TypeSetByHwMode &VTS : N->getExtTypes())
  for (const auto &I : VTS)
    Modes.insert(I.first);

for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
  collectModes(Modes, N->getChild(i));
4320}

4322void CodeGenDAGPatterns::ExpandHwModeBasedTypes() {
const CodeGenHwModes &CGH = getTargetInfo().getHwModes();
std::vector<PatternToMatch> Copy;
PatternsToMatch.swap(Copy);

auto AppendPattern = [this](PatternToMatch &P, unsigned Mode,
                            StringRef Check) {
  TreePatternNodePtr NewSrc = P.getSrcPattern()->clone();
  TreePatternNodePtr NewDst = P.getDstPattern()->clone();
  if (!NewSrc->setDefaultMode(Mode) || !NewDst->setDefaultMode(Mode)) {
    return;
  }

  PatternsToMatch.emplace_back(P.getSrcRecord(), P.getPredicates(),
                               std::move(NewSrc), std::move(NewDst),
                               P.getDstRegs(), P.getAddedComplexity(),
                               Record::getNewUID(), Mode, Check);
};

for (PatternToMatch &P : Copy) {
  TreePatternNodePtr SrcP = nullptr, DstP = nullptr;
  if (P.getSrcPattern()->hasProperTypeByHwMode())
    SrcP = P.getSrcPatternShared();
  if (P.getDstPattern()->hasProperTypeByHwMode())
    DstP = P.getDstPatternShared();
  if (!SrcP && !DstP) {
    PatternsToMatch.push_back(P);
    continue;
  }

  std::set<unsigned> Modes;
  if (SrcP)
    collectModes(Modes, SrcP.get());
  if (DstP)
    collectModes(Modes, DstP.get());

  // The predicate for the default mode needs to be constructed for each
  // pattern separately.
  // Since not all modes must be present in each pattern, if a mode m is
  // absent, then there is no point in constructing a check for m. If such
  // a check was created, it would be equivalent to checking the default
  // mode, except not all modes' predicates would be a part of the checking
  // code. The subsequently generated check for the default mode would then
  // have the exact same patterns, but a different predicate code. To avoid
  // duplicated patterns with different predicate checks, construct the
  // default check as a negation of all predicates that are actually present
  // in the source/destination patterns.
  SmallString<128> DefaultCheck;

  for (unsigned M : Modes) {
    if (M == DefaultMode)
      continue;

    // Fill the map entry for this mode.
    const HwMode &HM = CGH.getMode(M);
    AppendPattern(P, M, "(MF->getSubtarget().checkFeatures(\"" + HM.Features + "\"))");

    // Add negations of the HM's predicates to the default predicate.
    if (!DefaultCheck.empty())
      DefaultCheck += " && ";
    DefaultCheck += "(!(MF->getSubtarget().checkFeatures(\"";
    DefaultCheck += HM.Features;
    DefaultCheck += "\")))";
  }

  bool HasDefault = Modes.count(DefaultMode);
  if (HasDefault)
    AppendPattern(P, DefaultMode, DefaultCheck);
}
4391}

4393/// Dependent variable map for CodeGenDAGPattern variant generation
4394typedef StringMap<int> DepVarMap;

4396static void FindDepVarsOf(TreePatternNode *N, DepVarMap &DepMap) {
if (N->isLeaf()) {
  if (N->hasName() && isa<DefInit>(N->getLeafValue()))
    DepMap[N->getName()]++;
} else {
  for (size_t i = 0, e = N->getNumChildren(); i != e; ++i)
    FindDepVarsOf(N->getChild(i), DepMap);
}
4404}

4406/// Find dependent variables within child patterns
4407static void FindDepVars(TreePatternNode *N, MultipleUseVarSet &DepVars) {
DepVarMap depcounts;
FindDepVarsOf(N, depcounts);
for (const auto &Pair : depcounts) {
  if (Pair.getValue() > 1)
    DepVars.insert(Pair.getKey());
}
4414}

4416#ifndef NDEBUG1
4417/// Dump the dependent variable set:
4418static void DumpDepVars(MultipleUseVarSet &DepVars) {
if (DepVars.empty()) {
  LLVM_DEBUG(errs() << "<empty set>")do { } while (false);
} else {
  LLVM_DEBUG(errs() << "[ ")do { } while (false);
  for (const auto &DepVar : DepVars) {
    LLVM_DEBUG(errs() << DepVar.getKey() << " ")do { } while (false);
  }
  LLVM_DEBUG(errs() << "]")do { } while (false);
}
4428}
4429#endif


4432/// CombineChildVariants - Given a bunch of permutations of each child of the
4433/// 'operator' node, put them together in all possible ways.
4434static void CombineChildVariants(
  TreePatternNodePtr Orig,
  const std::vector<std::vector<TreePatternNodePtr>> &ChildVariants,
  std::vector<TreePatternNodePtr> &OutVariants, CodeGenDAGPatterns &CDP,
  const MultipleUseVarSet &DepVars) {
// Make sure that each operand has at least one variant to choose from.
for (const auto &Variants : ChildVariants)
  if (Variants.empty())
    return;

// The end result is an all-pairs construction of the resultant pattern.
std::vector<unsigned> Idxs;
Idxs.resize(ChildVariants.size());
bool NotDone;
do {
4449#ifndef NDEBUG1
  LLVM_DEBUG(if (!Idxs.empty()) {do { } while (false)
    errs() << Orig->getOperator()->getName() << ": Idxs = [ ";do { } while (false)
    for (unsigned Idx : Idxs) {do { } while (false)
      errs() << Idx << " ";do { } while (false)
    }do { } while (false)
    errs() << "]\n";do { } while (false)
  })do { } while (false);
4457#endif
  // Create the variant and add it to the output list.
  std::vector<TreePatternNodePtr> NewChildren;
  for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
    NewChildren.push_back(ChildVariants[i][Idxs[i]]);
  TreePatternNodePtr R = std::make_shared<TreePatternNode>(
      Orig->getOperator(), std::move(NewChildren), Orig->getNumTypes());

  // Copy over properties.
  R->setName(Orig->getName());
  R->setNamesAsPredicateArg(Orig->getNamesAsPredicateArg());
  R->setPredicateCalls(Orig->getPredicateCalls());
  R->setTransformFn(Orig->getTransformFn());
  for (unsigned i = 0, e = Orig->getNumTypes(); i != e; ++i)
    R->setType(i, Orig->getExtType(i));

  // If this pattern cannot match, do not include it as a variant.
  std::string ErrString;
  // Scan to see if this pattern has already been emitted.  We can get
  // duplication due to things like commuting:
  //   (and GPRC:$a, GPRC:$b) -> (and GPRC:$b, GPRC:$a)
  // which are the same pattern.  Ignore the dups.
  if (R->canPatternMatch(ErrString, CDP) &&
      none_of(OutVariants, [&](TreePatternNodePtr Variant) {
        return R->isIsomorphicTo(Variant.get(), DepVars);
      }))
    OutVariants.push_back(R);

  // Increment indices to the next permutation by incrementing the
  // indices from last index backward, e.g., generate the sequence
  // [0, 0], [0, 1], [1, 0], [1, 1].
  int IdxsIdx;
  for (IdxsIdx = Idxs.size() - 1; IdxsIdx >= 0; --IdxsIdx) {
    if (++Idxs[IdxsIdx] == ChildVariants[IdxsIdx].size())
      Idxs[IdxsIdx] = 0;
    else
      break;
  }
  NotDone = (IdxsIdx >= 0);
} while (NotDone);
4497}

4499/// CombineChildVariants - A helper function for binary operators.
4500///
4501static void CombineChildVariants(TreePatternNodePtr Orig,
                               const std::vector<TreePatternNodePtr> &LHS,
                               const std::vector<TreePatternNodePtr> &RHS,
                               std::vector<TreePatternNodePtr> &OutVariants,
                               CodeGenDAGPatterns &CDP,
                               const MultipleUseVarSet &DepVars) {
std::vector<std::vector<TreePatternNodePtr>> ChildVariants;
ChildVariants.push_back(LHS);
ChildVariants.push_back(RHS);
CombineChildVariants(Orig, ChildVariants, OutVariants, CDP, DepVars);
4511}

4513static void
4514GatherChildrenOfAssociativeOpcode(TreePatternNodePtr N,
                                std::vector<TreePatternNodePtr> &Children) {
assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!")(static_cast<void> (0));
Record *Operator = N->getOperator();

// Only permit raw nodes.
if (!N->getName().empty() || !N->getPredicateCalls().empty() ||
    N->getTransformFn()) {
  Children.push_back(N);
  return;
}

if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
  Children.push_back(N->getChildShared(0));
else
  GatherChildrenOfAssociativeOpcode(N->getChildShared(0), Children);

if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
  Children.push_back(N->getChildShared(1));
else
  GatherChildrenOfAssociativeOpcode(N->getChildShared(1), Children);
4535}

4537/// GenerateVariantsOf - Given a pattern N, generate all permutations we can of
4538/// the (potentially recursive) pattern by using algebraic laws.
4539///
4540static void GenerateVariantsOf(TreePatternNodePtr N,
                             std::vector<TreePatternNodePtr> &OutVariants,
                             CodeGenDAGPatterns &CDP,
                             const MultipleUseVarSet &DepVars) {
// We cannot permute leaves or ComplexPattern uses.
if (N->isLeaf() || N->getOperator()->isSubClassOf("ComplexPattern")) {
  OutVariants.push_back(N);
  return;
}

// Look up interesting info about the node.
const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(N->getOperator());

// If this node is associative, re-associate.
if (NodeInfo.hasProperty(SDNPAssociative)) {
  // Re-associate by pulling together all of the linked operators
  std::vector<TreePatternNodePtr> MaximalChildren;
  GatherChildrenOfAssociativeOpcode(N, MaximalChildren);

  // Only handle child sizes of 3.  Otherwise we'll end up trying too many
  // permutations.
  if (MaximalChildren.size() == 3) {
    // Find the variants of all of our maximal children.
    std::vector<TreePatternNodePtr> AVariants, BVariants, CVariants;
    GenerateVariantsOf(MaximalChildren[0], AVariants, CDP, DepVars);
    GenerateVariantsOf(MaximalChildren[1], BVariants, CDP, DepVars);
    GenerateVariantsOf(MaximalChildren[2], CVariants, CDP, DepVars);

    // There are only two ways we can permute the tree:
    //   (A op B) op C    and    A op (B op C)
    // Within these forms, we can also permute A/B/C.

    // Generate legal pair permutations of A/B/C.
    std::vector<TreePatternNodePtr> ABVariants;
    std::vector<TreePatternNodePtr> BAVariants;
    std::vector<TreePatternNodePtr> ACVariants;
    std::vector<TreePatternNodePtr> CAVariants;
    std::vector<TreePatternNodePtr> BCVariants;
    std::vector<TreePatternNodePtr> CBVariants;
    CombineChildVariants(N, AVariants, BVariants, ABVariants, CDP, DepVars);
    CombineChildVariants(N, BVariants, AVariants, BAVariants, CDP, DepVars);
    CombineChildVariants(N, AVariants, CVariants, ACVariants, CDP, DepVars);
    CombineChildVariants(N, CVariants, AVariants, CAVariants, CDP, DepVars);
    CombineChildVariants(N, BVariants, CVariants, BCVariants, CDP, DepVars);
    CombineChildVariants(N, CVariants, BVariants, CBVariants, CDP, DepVars);

    // Combine those into the result: (x op x) op x
    CombineChildVariants(N, ABVariants, CVariants, OutVariants, CDP, DepVars);
    CombineChildVariants(N, BAVariants, CVariants, OutVariants, CDP, DepVars);
    CombineChildVariants(N, ACVariants, BVariants, OutVariants, CDP, DepVars);
    CombineChildVariants(N, CAVariants, BVariants, OutVariants, CDP, DepVars);
    CombineChildVariants(N, BCVariants, AVariants, OutVariants, CDP, DepVars);
    CombineChildVariants(N, CBVariants, AVariants, OutVariants, CDP, DepVars);

    // Combine those into the result: x op (x op x)
    CombineChildVariants(N, CVariants, ABVariants, OutVariants, CDP, DepVars);
    CombineChildVariants(N, CVariants, BAVariants, OutVariants, CDP, DepVars);
    CombineChildVariants(N, BVariants, ACVariants, OutVariants, CDP, DepVars);
    CombineChildVariants(N, BVariants, CAVariants, OutVariants, CDP, DepVars);
    CombineChildVariants(N, AVariants, BCVariants, OutVariants, CDP, DepVars);
    CombineChildVariants(N, AVariants, CBVariants, OutVariants, CDP, DepVars);
    return;
  }
}

// Compute permutations of all children.
std::vector<std::vector<TreePatternNodePtr>> ChildVariants;
ChildVariants.resize(N->getNumChildren());
for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
  GenerateVariantsOf(N->getChildShared(i), ChildVariants[i], CDP, DepVars);

// Build all permutations based on how the children were formed.
CombineChildVariants(N, ChildVariants, OutVariants, CDP, DepVars);

// If this node is commutative, consider the commuted order.
bool isCommIntrinsic = N->isCommutativeIntrinsic(CDP);
if (NodeInfo.hasProperty(SDNPCommutative) || isCommIntrinsic) {
  assert((N->getNumChildren()>=2 || isCommIntrinsic) &&(static_cast<void> (0))
         "Commutative but doesn't have 2 children!")(static_cast<void> (0));
  // Don't count children which are actually register references.
  unsigned NC = 0;
  for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
    TreePatternNode *Child = N->getChild(i);
    if (Child->isLeaf())
      if (DefInit *DI = dyn_cast<DefInit>(Child->getLeafValue())) {
        Record *RR = DI->getDef();
        if (RR->isSubClassOf("Register"))
          continue;
      }
    NC++;
  }
  // Consider the commuted order.
  if (isCommIntrinsic) {
    // Commutative intrinsic. First operand is the intrinsic id, 2nd and 3rd
    // operands are the commutative operands, and there might be more operands
    // after those.
    assert(NC >= 3 &&(static_cast<void> (0))
           "Commutative intrinsic should have at least 3 children!")(static_cast<void> (0));
    std::vector<std::vector<TreePatternNodePtr>> Variants;
    Variants.push_back(std::move(ChildVariants[0])); // Intrinsic id.
    Variants.push_back(std::move(ChildVariants[2]));
    Variants.push_back(std::move(ChildVariants[1]));
    for (unsigned i = 3; i != NC; ++i)
      Variants.push_back(std::move(ChildVariants[i]));
    CombineChildVariants(N, Variants, OutVariants, CDP, DepVars);
  } else if (NC == N->getNumChildren()) {
    std::vector<std::vector<TreePatternNodePtr>> Variants;
    Variants.push_back(std::move(ChildVariants[1]));
    Variants.push_back(std::move(ChildVariants[0]));
    for (unsigned i = 2; i != NC; ++i)
      Variants.push_back(std::move(ChildVariants[i]));
    CombineChildVariants(N, Variants, OutVariants, CDP, DepVars);
  }
}
4654}


4657// GenerateVariants - Generate variants.  For example, commutative patterns can
4658// match multiple ways.  Add them to PatternsToMatch as well.
4659void CodeGenDAGPatterns::GenerateVariants() {
LLVM_DEBUG(errs() << "Generating instruction variants.\n")do { } while (false);

// Loop over all of the patterns we've collected, checking to see if we can
// generate variants of the instruction, through the exploitation of
// identities.  This permits the target to provide aggressive matching without
// the .td file having to contain tons of variants of instructions.
//
// Note that this loop adds new patterns to the PatternsToMatch list, but we
// intentionally do not reconsider these.  Any variants of added patterns have
// already been added.
//
for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
  MultipleUseVarSet DepVars;
  std::vector<TreePatternNodePtr> Variants;
  FindDepVars(PatternsToMatch[i].getSrcPattern(), DepVars);
  LLVM_DEBUG(errs() << "Dependent/multiply used variables: ")do { } while (false);
  LLVM_DEBUG(DumpDepVars(DepVars))do { } while (false);
  LLVM_DEBUG(errs() << "\n")do { } while (false);
  GenerateVariantsOf(PatternsToMatch[i].getSrcPatternShared(), Variants,
                     *this, DepVars);

  assert(PatternsToMatch[i].getHwModeFeatures().empty() &&(static_cast<void> (0))
         "HwModes should not have been expanded yet!")(static_cast<void> (0));

  assert(!Variants.empty() && "Must create at least original variant!")(static_cast<void> (0));
  if (Variants.size() == 1) // No additional variants for this pattern.
    continue;

  LLVM_DEBUG(errs() << "FOUND VARIANTS OF: ";do { } while (false)
             PatternsToMatch[i].getSrcPattern()->dump(); errs() << "\n")do { } while (false);

  for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
    TreePatternNodePtr Variant = Variants[v];

    LLVM_DEBUG(errs() << "  VAR#" << v << ": "; Variant->dump();do { } while (false)
               errs() << "\n")do { } while (false);

    // Scan to see if an instruction or explicit pattern already matches this.
    bool AlreadyExists = false;
    for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {
      // Skip if the top level predicates do not match.
      if ((i != p) && (PatternsToMatch[i].getPredicates() !=
                       PatternsToMatch[p].getPredicates()))
        continue;
      // Check to see if this variant already exists.
      if (Variant->isIsomorphicTo(PatternsToMatch[p].getSrcPattern(),
                                  DepVars)) {
        LLVM_DEBUG(errs() << "  *** ALREADY EXISTS, ignoring variant.\n")do { } while (false);
        AlreadyExists = true;
        break;
      }
    }
    // If we already have it, ignore the variant.
    if (AlreadyExists) continue;

    // Otherwise, add it to the list of patterns we have.
    PatternsToMatch.emplace_back(
        PatternsToMatch[i].getSrcRecord(), PatternsToMatch[i].getPredicates(),
        Variant, PatternsToMatch[i].getDstPatternShared(),
        PatternsToMatch[i].getDstRegs(),
        PatternsToMatch[i].getAddedComplexity(), Record::getNewUID(),
        PatternsToMatch[i].getForceMode(),
        PatternsToMatch[i].getHwModeFeatures());
  }

  LLVM_DEBUG(errs() << "\n")do { } while (false);
}
4727}

←

/build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/llvm/include/llvm/TableGen/Record.h

→

1//===- llvm/TableGen/Record.h - Classes for Table Records -------*- C++ -*-===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// This file defines the main TableGen data structures, including the TableGen
10// types, values, and high-level data structures.
11//
12//===----------------------------------------------------------------------===//

14#ifndef LLVM_TABLEGEN_RECORD_H
15#define LLVM_TABLEGEN_RECORD_H

17#include "llvm/ADT/ArrayRef.h"
18#include "llvm/ADT/DenseMap.h"
19#include "llvm/ADT/DenseSet.h"
20#include "llvm/ADT/FoldingSet.h"
21#include "llvm/ADT/PointerIntPair.h"
22#include "llvm/ADT/SmallVector.h"
23#include "llvm/ADT/StringExtras.h"
24#include "llvm/ADT/StringRef.h"
25#include "llvm/Support/Casting.h"
26#include "llvm/Support/ErrorHandling.h"
27#include "llvm/Support/SMLoc.h"
28#include "llvm/Support/Timer.h"
29#include "llvm/Support/TrailingObjects.h"
30#include "llvm/Support/raw_ostream.h"
31#include <algorithm>
32#include <cassert>
33#include <cstddef>
34#include <cstdint>
35#include <map>
36#include <memory>
37#include <string>
38#include <utility>
39#include <vector>

41namespace llvm {

43class ListRecTy;
44struct MultiClass;
45class Record;
46class RecordKeeper;
47class RecordVal;
48class Resolver;
49class StringInit;
50class TypedInit;

52//===----------------------------------------------------------------------===//
53//  Type Classes
54//===----------------------------------------------------------------------===//

56class RecTy {
57public:
/// Subclass discriminator (for dyn_cast<> et al.)
enum RecTyKind {
  BitRecTyKind,
  BitsRecTyKind,
  IntRecTyKind,
  StringRecTyKind,
  ListRecTyKind,
  DagRecTyKind,
  RecordRecTyKind
};

69private:
RecTyKind Kind;
/// ListRecTy of the list that has elements of this type.
ListRecTy *ListTy = nullptr;

74public:
RecTy(RecTyKind K) : Kind(K) {}
virtual ~RecTy() = default;

RecTyKind getRecTyKind() const { return Kind; }

virtual std::string getAsString() const = 0;
void print(raw_ostream &OS) const { OS << getAsString(); }
void dump() const;

/// Return true if all values of 'this' type can be converted to the specified
/// type.
virtual bool typeIsConvertibleTo(const RecTy *RHS) const;

/// Return true if 'this' type is equal to or a subtype of RHS. For example,
/// a bit set is not an int, but they are convertible.
virtual bool typeIsA(const RecTy *RHS) const;

/// Returns the type representing list<thistype>.
ListRecTy *getListTy();
94};

96inline raw_ostream &operator<<(raw_ostream &OS, const RecTy &Ty) {
Ty.print(OS);
return OS;
99}

101/// 'bit' - Represent a single bit
102class BitRecTy : public RecTy {
static BitRecTy Shared;

BitRecTy() : RecTy(BitRecTyKind) {}

107public:
static bool classof(const RecTy *RT) {
  return RT->getRecTyKind() == BitRecTyKind;
}

static BitRecTy *get() { return &Shared; }

std::string getAsString() const override { return "bit"; }

bool typeIsConvertibleTo(const RecTy *RHS) const override;
117};

119/// 'bits<n>' - Represent a fixed number of bits
120class BitsRecTy : public RecTy {
unsigned Size;

explicit BitsRecTy(unsigned Sz) : RecTy(BitsRecTyKind), Size(Sz) {}

125public:
static bool classof(const RecTy *RT) {
  return RT->getRecTyKind() == BitsRecTyKind;
}

static BitsRecTy *get(unsigned Sz);

unsigned getNumBits() const { return Size; }

std::string getAsString() const override;

bool typeIsConvertibleTo(const RecTy *RHS) const override;

bool typeIsA(const RecTy *RHS) const override;
139};

141/// 'int' - Represent an integer value of no particular size
142class IntRecTy : public RecTy {
static IntRecTy Shared;

IntRecTy() : RecTy(IntRecTyKind) {}

147public:
static bool classof(const RecTy *RT) {
  return RT->getRecTyKind() == IntRecTyKind;
}

static IntRecTy *get() { return &Shared; }

std::string getAsString() const override { return "int"; }

bool typeIsConvertibleTo(const RecTy *RHS) const override;
157};

159/// 'string' - Represent an string value
160class StringRecTy : public RecTy {
static StringRecTy Shared;

StringRecTy() : RecTy(StringRecTyKind) {}

165public:
static bool classof(const RecTy *RT) {
  return RT->getRecTyKind() == StringRecTyKind;
}

static StringRecTy *get() { return &Shared; }

std::string getAsString() const override;

bool typeIsConvertibleTo(const RecTy *RHS) const override;
175};

177/// 'list<Ty>' - Represent a list of element values, all of which must be of
178/// the specified type. The type is stored in ElementTy.
179class ListRecTy : public RecTy {
friend ListRecTy *RecTy::getListTy();

RecTy *ElementTy;

explicit ListRecTy(RecTy *T) : RecTy(ListRecTyKind), ElementTy(T) {}

186public:
static bool classof(const RecTy *RT) {
  return RT->getRecTyKind() == ListRecTyKind;
}

static ListRecTy *get(RecTy *T) { return T->getListTy(); }
RecTy *getElementType() const { return ElementTy; }

std::string getAsString() const override;

bool typeIsConvertibleTo(const RecTy *RHS) const override;

bool typeIsA(const RecTy *RHS) const override;
199};

201/// 'dag' - Represent a dag fragment
202class DagRecTy : public RecTy {
static DagRecTy Shared;

DagRecTy() : RecTy(DagRecTyKind) {}

207public:
static bool classof(const RecTy *RT) {
  return RT->getRecTyKind() == DagRecTyKind;
}

static DagRecTy *get() { return &Shared; }

std::string getAsString() const override;
215};

217/// '[classname]' - Type of record values that have zero or more superclasses.
218///
219/// The list of superclasses is non-redundant, i.e. only contains classes that
220/// are not the superclass of some other listed class.
221class RecordRecTy final : public RecTy, public FoldingSetNode,
                        public TrailingObjects<RecordRecTy, Record *> {
friend class Record;

unsigned NumClasses;

explicit RecordRecTy(unsigned Num)
    : RecTy(RecordRecTyKind), NumClasses(Num) {}

230public:
RecordRecTy(const RecordRecTy &) = delete;
RecordRecTy &operator=(const RecordRecTy &) = delete;

// Do not use sized deallocation due to trailing objects.
void operator delete(void *p) { ::operator delete(p); }

static bool classof(const RecTy *RT) {
  return RT->getRecTyKind() == RecordRecTyKind;
}

/// Get the record type with the given non-redundant list of superclasses.
static RecordRecTy *get(ArrayRef<Record *> Classes);

void Profile(FoldingSetNodeID &ID) const;

ArrayRef<Record *> getClasses() const {
  return makeArrayRef(getTrailingObjects<Record *>(), NumClasses);
}

using const_record_iterator = Record * const *;

const_record_iterator classes_begin() const { return getClasses().begin(); }
const_record_iterator classes_end() const { return getClasses().end(); }

std::string getAsString() const override;

bool isSubClassOf(Record *Class) const;
bool typeIsConvertibleTo(const RecTy *RHS) const override;

bool typeIsA(const RecTy *RHS) const override;
261};

263/// Find a common type that T1 and T2 convert to.
264/// Return 0 if no such type exists.
265RecTy *resolveTypes(RecTy *T1, RecTy *T2);

267//===----------------------------------------------------------------------===//
268//  Initializer Classes
269//===----------------------------------------------------------------------===//

271class Init {
272protected:
/// Discriminator enum (for isa<>, dyn_cast<>, et al.)
///
/// This enum is laid out by a preorder traversal of the inheritance
/// hierarchy, and does not contain an entry for abstract classes, as per
/// the recommendation in docs/HowToSetUpLLVMStyleRTTI.rst.
///
/// We also explicitly include "first" and "last" values for each
/// interior node of the inheritance tree, to make it easier to read the
/// corresponding classof().
///
/// We could pack these a bit tighter by not having the IK_FirstXXXInit
/// and IK_LastXXXInit be their own values, but that would degrade
/// readability for really no benefit.
enum InitKind : uint8_t {
  IK_First, // unused; silence a spurious warning
  IK_FirstTypedInit,
  IK_BitInit,
  IK_BitsInit,
  IK_DagInit,
  IK_DefInit,
  IK_FieldInit,
  IK_IntInit,
  IK_ListInit,
  IK_FirstOpInit,
  IK_BinOpInit,
  IK_TernOpInit,
  IK_UnOpInit,
  IK_LastOpInit,
  IK_CondOpInit,
  IK_FoldOpInit,
  IK_IsAOpInit,
  IK_AnonymousNameInit,
  IK_StringInit,
  IK_VarInit,
  IK_VarListElementInit,
  IK_VarBitInit,
  IK_VarDefInit,
  IK_LastTypedInit,
  IK_UnsetInit
};

314private:
const InitKind Kind;

317protected:
uint8_t Opc; // Used by UnOpInit, BinOpInit, and TernOpInit

320private:
virtual void anchor();

323public:
/// Get the kind (type) of the value.
InitKind getKind() const { return Kind; }

327protected:
explicit Init(InitKind K, uint8_t Opc = 0) : Kind(K), Opc(Opc) {}

330public:
Init(const Init &) = delete;
Init &operator=(const Init &) = delete;
virtual ~Init() = default;

/// Is this a complete value with no unset (uninitialized) subvalues?
virtual bool isComplete() const { return true; }

/// Is this a concrete and fully resolved value without any references or
/// stuck operations? Unset values are concrete.
virtual bool isConcrete() const { return false; }

/// Print this value.
void print(raw_ostream &OS) const { OS << getAsString(); }

/// Convert this value to a literal form.
virtual std::string getAsString() const = 0;

/// Convert this value to a literal form,
/// without adding quotes around a string.
virtual std::string getAsUnquotedString() const { return getAsString(); }

/// Debugging method that may be called through a debugger; just
/// invokes print on stderr.
void dump() const;

/// If this value is convertible to type \p Ty, return a value whose
/// type is \p Ty, generating a !cast operation if required.
/// Otherwise, return null.
virtual Init *getCastTo(RecTy *Ty) const = 0;

/// Convert to a value whose type is \p Ty, or return null if this
/// is not possible. This can happen if the value's type is convertible
/// to \p Ty, but there are unresolved references.
virtual Init *convertInitializerTo(RecTy *Ty) const = 0;

/// This function is used to implement the bit range
/// selection operator. Given a value, it selects the specified bits,
/// returning them as a new \p Init of type \p bits. If it is not legal
/// to use the bit selection operator on this value, null is returned.
virtual Init *convertInitializerBitRange(ArrayRef<unsigned> Bits) const {
  return nullptr;
}

/// This function is used to implement the list slice
/// selection operator.  Given a value, it selects the specified list
/// elements, returning them as a new \p Init of type \p list. If it
/// is not legal to use the slice operator, null is returned.
virtual Init *convertInitListSlice(ArrayRef<unsigned> Elements) const {
  return nullptr;
}

/// This function is used to implement the FieldInit class.
/// Implementors of this method should return the type of the named
/// field if they are of type record.
virtual RecTy *getFieldType(StringInit *FieldName) const {
  return nullptr;
}

/// This function is used by classes that refer to other
/// variables which may not be defined at the time the expression is formed.
/// If a value is set for the variable later, this method will be called on
/// users of the value to allow the value to propagate out.
virtual Init *resolveReferences(Resolver &R) const {
  return const_cast<Init *>(this);
}

/// Get the \p Init value of the specified bit.
virtual Init *getBit(unsigned Bit) const = 0;
399};

401inline raw_ostream &operator<<(raw_ostream &OS, const Init &I) {
I.print(OS); return OS;
403}

405/// This is the common superclass of types that have a specific,
406/// explicit type, stored in ValueTy.
407class TypedInit : public Init {
RecTy *ValueTy;

410protected:
explicit TypedInit(InitKind K, RecTy *T, uint8_t Opc = 0)
    : Init(K, Opc), ValueTy(T) {}

414public:
TypedInit(const TypedInit &) = delete;
TypedInit &operator=(const TypedInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() >= IK_FirstTypedInit &&
         I->getKind() <= IK_LastTypedInit;
}

/// Get the type of the Init as a RecTy.
RecTy *getType() const { return ValueTy; }

Init *getCastTo(RecTy *Ty) const override;
Init *convertInitializerTo(RecTy *Ty) const override;

Init *convertInitializerBitRange(ArrayRef<unsigned> Bits) const override;
Init *convertInitListSlice(ArrayRef<unsigned> Elements) const override;

/// This method is used to implement the FieldInit class.
/// Implementors of this method should return the type of the named field if
/// they are of type record.
RecTy *getFieldType(StringInit *FieldName) const override;
436};

438/// '?' - Represents an uninitialized value.
439class UnsetInit : public Init {
UnsetInit() : Init(IK_UnsetInit) {}

442public:
UnsetInit(const UnsetInit &) = delete;
UnsetInit &operator=(const UnsetInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_UnsetInit;
}

/// Get the singleton unset Init.
static UnsetInit *get();

Init *getCastTo(RecTy *Ty) const override;
Init *convertInitializerTo(RecTy *Ty) const override;

Init *getBit(unsigned Bit) const override {
  return const_cast<UnsetInit*>(this);
}

/// Is this a complete value with no unset (uninitialized) subvalues?
bool isComplete() const override { return false; }

bool isConcrete() const override { return true; }

/// Get the string representation of the Init.
std::string getAsString() const override { return "?"; }
467};

469/// 'true'/'false' - Represent a concrete initializer for a bit.
470class BitInit final : public TypedInit {
bool Value;

explicit BitInit(bool V) : TypedInit(IK_BitInit, BitRecTy::get()), Value(V) {}

475public:
BitInit(const BitInit &) = delete;
BitInit &operator=(BitInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_BitInit;
}

static BitInit *get(bool V);

bool getValue() const { return Value; }

Init *convertInitializerTo(RecTy *Ty) const override;

Init *getBit(unsigned Bit) const override {
  assert(Bit < 1 && "Bit index out of range!")(static_cast<void> (0));
  return const_cast<BitInit*>(this);
}

bool isConcrete() const override { return true; }
std::string getAsString() const override { return Value ? "1" : "0"; }
496};

498/// '{ a, b, c }' - Represents an initializer for a BitsRecTy value.
499/// It contains a vector of bits, whose size is determined by the type.
500class BitsInit final : public TypedInit, public FoldingSetNode,
                     public TrailingObjects<BitsInit, Init *> {
unsigned NumBits;

BitsInit(unsigned N)
  : TypedInit(IK_BitsInit, BitsRecTy::get(N)), NumBits(N) {}

507public:
BitsInit(const BitsInit &) = delete;
BitsInit &operator=(const BitsInit &) = delete;

// Do not use sized deallocation due to trailing objects.
void operator delete(void *p) { ::operator delete(p); }

static bool classof(const Init *I) {
  return I->getKind() == IK_BitsInit;
}

static BitsInit *get(ArrayRef<Init *> Range);

void Profile(FoldingSetNodeID &ID) const;

unsigned getNumBits() const { return NumBits; }

Init *convertInitializerTo(RecTy *Ty) const override;
Init *convertInitializerBitRange(ArrayRef<unsigned> Bits) const override;

bool isComplete() const override {
  for (unsigned i = 0; i != getNumBits(); ++i)
    if (!getBit(i)->isComplete()) return false;
  return true;
}

bool allInComplete() const {
  for (unsigned i = 0; i != getNumBits(); ++i)
    if (getBit(i)->isComplete()) return false;
  return true;
}

bool isConcrete() const override;
std::string getAsString() const override;

Init *resolveReferences(Resolver &R) const override;

Init *getBit(unsigned Bit) const override {
  assert(Bit < NumBits && "Bit index out of range!")(static_cast<void> (0));
  return getTrailingObjects<Init *>()[Bit];
}
548};

550/// '7' - Represent an initialization by a literal integer value.
551class IntInit : public TypedInit {
int64_t Value;

explicit IntInit(int64_t V)
  : TypedInit(IK_IntInit, IntRecTy::get()), Value(V) {}

557public:
IntInit(const IntInit &) = delete;
IntInit &operator=(const IntInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_IntInit;
}

static IntInit *get(int64_t V);

int64_t getValue() const { return Value; }

Init *convertInitializerTo(RecTy *Ty) const override;
Init *convertInitializerBitRange(ArrayRef<unsigned> Bits) const override;

bool isConcrete() const override { return true; }
std::string getAsString() const override;

Init *getBit(unsigned Bit) const override {
  return BitInit::get((Value & (1ULL << Bit)) != 0);
}
578};

580/// "anonymous_n" - Represent an anonymous record name
581class AnonymousNameInit : public TypedInit {
unsigned Value;

explicit AnonymousNameInit(unsigned V)
    : TypedInit(IK_AnonymousNameInit, StringRecTy::get()), Value(V) {}

587public:
AnonymousNameInit(const AnonymousNameInit &) = delete;
AnonymousNameInit &operator=(const AnonymousNameInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_AnonymousNameInit;
}

static AnonymousNameInit *get(unsigned);

unsigned getValue() const { return Value; }

StringInit *getNameInit() const;

std::string getAsString() const override;

Init *resolveReferences(Resolver &R) const override;

Init *getBit(unsigned Bit) const override {
  llvm_unreachable("Illegal bit reference off string")__builtin_unreachable();
}
608};

610/// "foo" - Represent an initialization by a string value.
611class StringInit : public TypedInit {
612public:
enum StringFormat {
  SF_String, // Format as "text"
  SF_Code,   // Format as [{text}]
};

618private:
StringRef Value;
StringFormat Format;

explicit StringInit(StringRef V, StringFormat Fmt)
    : TypedInit(IK_StringInit, StringRecTy::get()), Value(V), Format(Fmt) {}

625public:
StringInit(const StringInit &) = delete;
StringInit &operator=(const StringInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_StringInit;
}

static StringInit *get(StringRef, StringFormat Fmt = SF_String);

static StringFormat determineFormat(StringFormat Fmt1, StringFormat Fmt2) {
  return (Fmt1 == SF_Code || Fmt2 == SF_Code) ? SF_Code : SF_String;
}

StringRef getValue() const { return Value; }
StringFormat getFormat() const { return Format; }  
bool hasCodeFormat() const { return Format == SF_Code; }

Init *convertInitializerTo(RecTy *Ty) const override;

bool isConcrete() const override { return true; }

std::string getAsString() const override {
  if (Format == SF_String)
    return "\"" + Value.str() + "\"";
  else
    return "[{" + Value.str() + "}]";
}

std::string getAsUnquotedString() const override {
  return std::string(Value);
}

Init *getBit(unsigned Bit) const override {
  llvm_unreachable("Illegal bit reference off string")__builtin_unreachable();
}
661};

663/// [AL, AH, CL] - Represent a list of defs
664///
665class ListInit final : public TypedInit, public FoldingSetNode,
                     public TrailingObjects<ListInit, Init *> {
unsigned NumValues;

669public:
using const_iterator = Init *const *;

672private:
explicit ListInit(unsigned N, RecTy *EltTy)
  : TypedInit(IK_ListInit, ListRecTy::get(EltTy)), NumValues(N) {}

676public:
ListInit(const ListInit &) = delete;
ListInit &operator=(const ListInit &) = delete;

// Do not use sized deallocation due to trailing objects.
void operator delete(void *p) { ::operator delete(p); }

static bool classof(const Init *I) {
  return I->getKind() == IK_ListInit;
}
static ListInit *get(ArrayRef<Init *> Range, RecTy *EltTy);

void Profile(FoldingSetNodeID &ID) const;

Init *getElement(unsigned i) const {
  assert(i < NumValues && "List element index out of range!")(static_cast<void> (0));
  return getTrailingObjects<Init *>()[i];
}
RecTy *getElementType() const {
  return cast<ListRecTy>(getType())->getElementType();
}

Record *getElementAsRecord(unsigned i) const;

Init *convertInitListSlice(ArrayRef<unsigned> Elements) const override;

Init *convertInitializerTo(RecTy *Ty) const override;

/// This method is used by classes that refer to other
/// variables which may not be defined at the time they expression is formed.
/// If a value is set for the variable later, this method will be called on
/// users of the value to allow the value to propagate out.
///
Init *resolveReferences(Resolver &R) const override;

bool isComplete() const override;
bool isConcrete() const override;
std::string getAsString() const override;

ArrayRef<Init*> getValues() const {
  return makeArrayRef(getTrailingObjects<Init *>(), NumValues);
}

const_iterator begin() const { return getTrailingObjects<Init *>(); }
const_iterator end  () const { return begin() + NumValues; }

size_t         size () const { return NumValues;  }
bool           empty() const { return NumValues == 0; }

Init *getBit(unsigned Bit) const override {
  llvm_unreachable("Illegal bit reference off list")__builtin_unreachable();
}
728};

730/// Base class for operators
731///
732class OpInit : public TypedInit {
733protected:
explicit OpInit(InitKind K, RecTy *Type, uint8_t Opc)
  : TypedInit(K, Type, Opc) {}

737public:
OpInit(const OpInit &) = delete;
OpInit &operator=(OpInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() >= IK_FirstOpInit &&
         I->getKind() <= IK_LastOpInit;
}

// Clone - Clone this operator, replacing arguments with the new list
virtual OpInit *clone(ArrayRef<Init *> Operands) const = 0;

virtual unsigned getNumOperands() const = 0;
virtual Init *getOperand(unsigned i) const = 0;

Init *getBit(unsigned Bit) const override;
753};

755/// !op (X) - Transform an init.
756///
757class UnOpInit : public OpInit, public FoldingSetNode {
758public:
enum UnaryOp : uint8_t { CAST, NOT, HEAD, TAIL, SIZE, EMPTY, GETDAGOP };

761private:
Init *LHS;

UnOpInit(UnaryOp opc, Init *lhs, RecTy *Type)
  : OpInit(IK_UnOpInit, Type, opc), LHS(lhs) {}

767public:
UnOpInit(const UnOpInit &) = delete;
UnOpInit &operator=(const UnOpInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_UnOpInit;
}

static UnOpInit *get(UnaryOp opc, Init *lhs, RecTy *Type);

void Profile(FoldingSetNodeID &ID) const;

// Clone - Clone this operator, replacing arguments with the new list
OpInit *clone(ArrayRef<Init *> Operands) const override {
  assert(Operands.size() == 1 &&(static_cast<void> (0))
         "Wrong number of operands for unary operation")(static_cast<void> (0));
  return UnOpInit::get(getOpcode(), *Operands.begin(), getType());
}

unsigned getNumOperands() const override { return 1; }

Init *getOperand(unsigned i) const override {
  assert(i == 0 && "Invalid operand id for unary operator")(static_cast<void> (0));
  return getOperand();
}

UnaryOp getOpcode() const { return (UnaryOp)Opc; }
Init *getOperand() const { return LHS; }

// Fold - If possible, fold this to a simpler init.  Return this if not
// possible to fold.
Init *Fold(Record *CurRec, bool IsFinal = false) const;

Init *resolveReferences(Resolver &R) const override;

std::string getAsString() const override;
803};

805/// !op (X, Y) - Combine two inits.
806class BinOpInit : public OpInit, public FoldingSetNode {
807public:
enum BinaryOp : uint8_t { ADD, SUB, MUL, AND, OR, XOR, SHL, SRA, SRL, LISTCONCAT,
                          LISTSPLAT, STRCONCAT, INTERLEAVE, CONCAT, EQ,
                          NE, LE, LT, GE, GT, SETDAGOP };

812private:
Init *LHS, *RHS;

BinOpInit(BinaryOp opc, Init *lhs, Init *rhs, RecTy *Type) :
    OpInit(IK_BinOpInit, Type, opc), LHS(lhs), RHS(rhs) {}

818public:
BinOpInit(const BinOpInit &) = delete;
BinOpInit &operator=(const BinOpInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_BinOpInit;
}

static BinOpInit *get(BinaryOp opc, Init *lhs, Init *rhs,
                      RecTy *Type);
static Init *getStrConcat(Init *lhs, Init *rhs);
static Init *getListConcat(TypedInit *lhs, Init *rhs);

void Profile(FoldingSetNodeID &ID) const;

// Clone - Clone this operator, replacing arguments with the new list
OpInit *clone(ArrayRef<Init *> Operands) const override {
  assert(Operands.size() == 2 &&(static_cast<void> (0))
         "Wrong number of operands for binary operation")(static_cast<void> (0));
  return BinOpInit::get(getOpcode(), Operands[0], Operands[1], getType());
}

unsigned getNumOperands() const override { return 2; }
Init *getOperand(unsigned i) const override {
  switch (i) {
  default: llvm_unreachable("Invalid operand id for binary operator")__builtin_unreachable();
  case 0: return getLHS();
  case 1: return getRHS();
  }
}

BinaryOp getOpcode() const { return (BinaryOp)Opc; }
Init *getLHS() const { return LHS; }
Init *getRHS() const { return RHS; }

// Fold - If possible, fold this to a simpler init.  Return this if not
// possible to fold.
Init *Fold(Record *CurRec) const;

Init *resolveReferences(Resolver &R) const override;

std::string getAsString() const override;
860};

862/// !op (X, Y, Z) - Combine two inits.
863class TernOpInit : public OpInit, public FoldingSetNode {
864public:
enum TernaryOp : uint8_t { SUBST, FOREACH, FILTER, IF, DAG, SUBSTR, FIND };

867private:
Init *LHS, *MHS, *RHS;

TernOpInit(TernaryOp opc, Init *lhs, Init *mhs, Init *rhs,
           RecTy *Type) :
    OpInit(IK_TernOpInit, Type, opc), LHS(lhs), MHS(mhs), RHS(rhs) {}

874public:
TernOpInit(const TernOpInit &) = delete;
TernOpInit &operator=(const TernOpInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_TernOpInit;
}

static TernOpInit *get(TernaryOp opc, Init *lhs,
                       Init *mhs, Init *rhs,
                       RecTy *Type);

void Profile(FoldingSetNodeID &ID) const;

// Clone - Clone this operator, replacing arguments with the new list
OpInit *clone(ArrayRef<Init *> Operands) const override {
  assert(Operands.size() == 3 &&(static_cast<void> (0))
         "Wrong number of operands for ternary operation")(static_cast<void> (0));
  return TernOpInit::get(getOpcode(), Operands[0], Operands[1], Operands[2],
                         getType());
}

unsigned getNumOperands() const override { return 3; }
Init *getOperand(unsigned i) const override {
  switch (i) {
  default: llvm_unreachable("Invalid operand id for ternary operator")__builtin_unreachable();
  case 0: return getLHS();
  case 1: return getMHS();
  case 2: return getRHS();
  }
}

TernaryOp getOpcode() const { return (TernaryOp)Opc; }
Init *getLHS() const { return LHS; }
Init *getMHS() const { return MHS; }
Init *getRHS() const { return RHS; }

// Fold - If possible, fold this to a simpler init.  Return this if not
// possible to fold.
Init *Fold(Record *CurRec) const;

bool isComplete() const override {
  return LHS->isComplete() && MHS->isComplete() && RHS->isComplete();
}

Init *resolveReferences(Resolver &R) const override;

std::string getAsString() const override;
922};

924/// !cond(condition_1: value1, ... , condition_n: value)
925/// Selects the first value for which condition is true.
926/// Otherwise reports an error.
927class CondOpInit final : public TypedInit, public FoldingSetNode,
                    public TrailingObjects<CondOpInit, Init *> {
unsigned NumConds;
RecTy *ValType;

CondOpInit(unsigned NC, RecTy *Type)
  : TypedInit(IK_CondOpInit, Type),
    NumConds(NC), ValType(Type) {}

size_t numTrailingObjects(OverloadToken<Init *>) const {
  return 2*NumConds;
}

940public:
CondOpInit(const CondOpInit &) = delete;
CondOpInit &operator=(const CondOpInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_CondOpInit;
}

static CondOpInit *get(ArrayRef<Init*> C, ArrayRef<Init*> V,
                      RecTy *Type);

void Profile(FoldingSetNodeID &ID) const;

RecTy *getValType() const { return ValType; }

unsigned getNumConds() const { return NumConds; }

Init *getCond(unsigned Num) const {
  assert(Num < NumConds && "Condition number out of range!")(static_cast<void> (0));
  return getTrailingObjects<Init *>()[Num];
}

Init *getVal(unsigned Num) const {
  assert(Num < NumConds && "Val number out of range!")(static_cast<void> (0));
  return getTrailingObjects<Init *>()[Num+NumConds];
}

ArrayRef<Init *> getConds() const {
  return makeArrayRef(getTrailingObjects<Init *>(), NumConds);
}

ArrayRef<Init *> getVals() const {
  return makeArrayRef(getTrailingObjects<Init *>()+NumConds, NumConds);
}

Init *Fold(Record *CurRec) const;

Init *resolveReferences(Resolver &R) const override;

bool isConcrete() const override;
bool isComplete() const override;
std::string getAsString() const override;

using const_case_iterator = SmallVectorImpl<Init*>::const_iterator;
using const_val_iterator = SmallVectorImpl<Init*>::const_iterator;

inline const_case_iterator  arg_begin() const { return getConds().begin(); }
inline const_case_iterator  arg_end  () const { return getConds().end(); }

inline size_t              case_size () const { return NumConds; }
inline bool                case_empty() const { return NumConds == 0; }

inline const_val_iterator name_begin() const { return getVals().begin();}
inline const_val_iterator name_end  () const { return getVals().end(); }

inline size_t              val_size () const { return NumConds; }
inline bool                val_empty() const { return NumConds == 0; }

Init *getBit(unsigned Bit) const override;
999};

1001/// !foldl (a, b, expr, start, lst) - Fold over a list.
1002class FoldOpInit : public TypedInit, public FoldingSetNode {
1003private:
Init *Start;
Init *List;
Init *A;
Init *B;
Init *Expr;

FoldOpInit(Init *Start, Init *List, Init *A, Init *B, Init *Expr, RecTy *Type)
    : TypedInit(IK_FoldOpInit, Type), Start(Start), List(List), A(A), B(B),
      Expr(Expr) {}

1014public:
FoldOpInit(const FoldOpInit &) = delete;
FoldOpInit &operator=(const FoldOpInit &) = delete;

static bool classof(const Init *I) { return I->getKind() == IK_FoldOpInit; }

static FoldOpInit *get(Init *Start, Init *List, Init *A, Init *B, Init *Expr,
                       RecTy *Type);

void Profile(FoldingSetNodeID &ID) const;

// Fold - If possible, fold this to a simpler init.  Return this if not
// possible to fold.
Init *Fold(Record *CurRec) const;

bool isComplete() const override { return false; }

Init *resolveReferences(Resolver &R) const override;

Init *getBit(unsigned Bit) const override;

std::string getAsString() const override;
1036};

1038/// !isa<type>(expr) - Dynamically determine the type of an expression.
1039class IsAOpInit : public TypedInit, public FoldingSetNode {
1040private:
RecTy *CheckType;
Init *Expr;

IsAOpInit(RecTy *CheckType, Init *Expr)
    : TypedInit(IK_IsAOpInit, IntRecTy::get()), CheckType(CheckType),
      Expr(Expr) {}

1048public:
IsAOpInit(const IsAOpInit &) = delete;
IsAOpInit &operator=(const IsAOpInit &) = delete;

static bool classof(const Init *I) { return I->getKind() == IK_IsAOpInit; }

static IsAOpInit *get(RecTy *CheckType, Init *Expr);

void Profile(FoldingSetNodeID &ID) const;

// Fold - If possible, fold this to a simpler init.  Return this if not
// possible to fold.
Init *Fold() const;

bool isComplete() const override { return false; }

Init *resolveReferences(Resolver &R) const override;

Init *getBit(unsigned Bit) const override;

std::string getAsString() const override;
1069};

1071/// 'Opcode' - Represent a reference to an entire variable object.
1072class VarInit : public TypedInit {
Init *VarName;

explicit VarInit(Init *VN, RecTy *T)
    : TypedInit(IK_VarInit, T), VarName(VN) {}

1078public:
VarInit(const VarInit &) = delete;
VarInit &operator=(const VarInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_VarInit;
}

static VarInit *get(StringRef VN, RecTy *T);
static VarInit *get(Init *VN, RecTy *T);

StringRef getName() const;
Init *getNameInit() const { return VarName; }

std::string getNameInitAsString() const {
  return getNameInit()->getAsUnquotedString();
}

/// This method is used by classes that refer to other
/// variables which may not be defined at the time they expression is formed.
/// If a value is set for the variable later, this method will be called on
/// users of the value to allow the value to propagate out.
///
Init *resolveReferences(Resolver &R) const override;

Init *getBit(unsigned Bit) const override;

std::string getAsString() const override { return std::string(getName()); }
1106};

1108/// Opcode{0} - Represent access to one bit of a variable or field.
1109class VarBitInit final : public TypedInit {
TypedInit *TI;
unsigned Bit;

VarBitInit(TypedInit *T, unsigned B)
    : TypedInit(IK_VarBitInit, BitRecTy::get()), TI(T), Bit(B) {
  assert(T->getType() &&(static_cast<void> (0))
         (isa<IntRecTy>(T->getType()) ||(static_cast<void> (0))
          (isa<BitsRecTy>(T->getType()) &&(static_cast<void> (0))
           cast<BitsRecTy>(T->getType())->getNumBits() > B)) &&(static_cast<void> (0))
         "Illegal VarBitInit expression!")(static_cast<void> (0));
}

1122public:
VarBitInit(const VarBitInit &) = delete;
VarBitInit &operator=(const VarBitInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_VarBitInit;
}

static VarBitInit *get(TypedInit *T, unsigned B);

Init *getBitVar() const { return TI; }
unsigned getBitNum() const { return Bit; }

std::string getAsString() const override;
Init *resolveReferences(Resolver &R) const override;

Init *getBit(unsigned B) const override {
  assert(B < 1 && "Bit index out of range!")(static_cast<void> (0));
  return const_cast<VarBitInit*>(this);
}
1142};

1144/// List[4] - Represent access to one element of a var or
1145/// field.
1146class VarListElementInit : public TypedInit {
TypedInit *TI;
unsigned Element;

VarListElementInit(TypedInit *T, unsigned E)
    : TypedInit(IK_VarListElementInit,
                cast<ListRecTy>(T->getType())->getElementType()),
      TI(T), Element(E) {
  assert(T->getType() && isa<ListRecTy>(T->getType()) &&(static_cast<void> (0))
         "Illegal VarBitInit expression!")(static_cast<void> (0));
}

1158public:
VarListElementInit(const VarListElementInit &) = delete;
VarListElementInit &operator=(const VarListElementInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_VarListElementInit;
}

static VarListElementInit *get(TypedInit *T, unsigned E);

TypedInit *getVariable() const { return TI; }
unsigned getElementNum() const { return Element; }

std::string getAsString() const override;
Init *resolveReferences(Resolver &R) const override;

Init *getBit(unsigned Bit) const override;
1175};

1177/// AL - Represent a reference to a 'def' in the description
1178class DefInit : public TypedInit {
friend class Record;

Record *Def;

explicit DefInit(Record *D);

1185public:
DefInit(const DefInit &) = delete;
DefInit &operator=(const DefInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_DefInit;
}

static DefInit *get(Record*);

Init *convertInitializerTo(RecTy *Ty) const override;

Record *getDef() const { return Def; }

//virtual Init *convertInitializerBitRange(ArrayRef<unsigned> Bits);

RecTy *getFieldType(StringInit *FieldName) const override;

bool isConcrete() const override { return true; }
std::string getAsString() const override;

Init *getBit(unsigned Bit) const override {
  llvm_unreachable("Illegal bit reference off def")__builtin_unreachable();
}
1209};

1211/// classname<targs...> - Represent an uninstantiated anonymous class
1212/// instantiation.
1213class VarDefInit final : public TypedInit, public FoldingSetNode,
                       public TrailingObjects<VarDefInit, Init *> {
Record *Class;
DefInit *Def = nullptr; // after instantiation
unsigned NumArgs;

explicit VarDefInit(Record *Class, unsigned N)
  : TypedInit(IK_VarDefInit, RecordRecTy::get(Class)), Class(Class), NumArgs(N) {}

DefInit *instantiate();

1224public:
VarDefInit(const VarDefInit &) = delete;
VarDefInit &operator=(const VarDefInit &) = delete;

// Do not use sized deallocation due to trailing objects.
void operator delete(void *p) { ::operator delete(p); }

static bool classof(const Init *I) {
  return I->getKind() == IK_VarDefInit;
}
static VarDefInit *get(Record *Class, ArrayRef<Init *> Args);

void Profile(FoldingSetNodeID &ID) const;

Init *resolveReferences(Resolver &R) const override;
Init *Fold() const;

std::string getAsString() const override;

Init *getArg(unsigned i) const {
  assert(i < NumArgs && "Argument index out of range!")(static_cast<void> (0));
  return getTrailingObjects<Init *>()[i];
}

using const_iterator = Init *const *;

const_iterator args_begin() const { return getTrailingObjects<Init *>(); }
const_iterator args_end  () const { return args_begin() + NumArgs; }

size_t         args_size () const { return NumArgs; }
bool           args_empty() const { return NumArgs == 0; }

ArrayRef<Init *> args() const { return makeArrayRef(args_begin(), NumArgs); }

Init *getBit(unsigned Bit) const override {
  llvm_unreachable("Illegal bit reference off anonymous def")__builtin_unreachable();
}
1261};

1263/// X.Y - Represent a reference to a subfield of a variable
1264class FieldInit : public TypedInit {
Init *Rec;                // Record we are referring to
StringInit *FieldName;    // Field we are accessing

FieldInit(Init *R, StringInit *FN)
    : TypedInit(IK_FieldInit, R->getFieldType(FN)), Rec(R), FieldName(FN) {
1270#ifndef NDEBUG1
  if (!getType()) {
    llvm::errs() << "In Record = " << Rec->getAsString()
                 << ", got FieldName = " << *FieldName
                 << " with non-record type!\n";
    llvm_unreachable("FieldInit with non-record type!")__builtin_unreachable();
  }
1277#endif
}

1280public:
FieldInit(const FieldInit &) = delete;
FieldInit &operator=(const FieldInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_FieldInit;
}

static FieldInit *get(Init *R, StringInit *FN);

Init *getRecord() const { return Rec; }
StringInit *getFieldName() const { return FieldName; }

Init *getBit(unsigned Bit) const override;

Init *resolveReferences(Resolver &R) const override;
Init *Fold(Record *CurRec) const;

bool isConcrete() const override;
std::string getAsString() const override {
  return Rec->getAsString() + "." + FieldName->getValue().str();
}
1302};

1304/// (v a, b) - Represent a DAG tree value.  DAG inits are required
1305/// to have at least one value then a (possibly empty) list of arguments.  Each
1306/// argument can have a name associated with it.
1307class DagInit final : public TypedInit, public FoldingSetNode,
                    public TrailingObjects<DagInit, Init *, StringInit *> {
friend TrailingObjects;

Init *Val;
StringInit *ValName;
unsigned NumArgs;
unsigned NumArgNames;

DagInit(Init *V, StringInit *VN, unsigned NumArgs, unsigned NumArgNames)
    : TypedInit(IK_DagInit, DagRecTy::get()), Val(V), ValName(VN),
      NumArgs(NumArgs), NumArgNames(NumArgNames) {}

size_t numTrailingObjects(OverloadToken<Init *>) const { return NumArgs; }

1322public:
DagInit(const DagInit &) = delete;
DagInit &operator=(const DagInit &) = delete;

static bool classof(const Init *I) {
  return I->getKind() == IK_DagInit;
}

static DagInit *get(Init *V, StringInit *VN, ArrayRef<Init *> ArgRange,
                    ArrayRef<StringInit*> NameRange);
static DagInit *get(Init *V, StringInit *VN,
                    ArrayRef<std::pair<Init*, StringInit*>> Args);

void Profile(FoldingSetNodeID &ID) const;

Init *getOperator() const { return Val; }
Record *getOperatorAsDef(ArrayRef<SMLoc> Loc) const;

StringInit *getName() const { return ValName; }

StringRef getNameStr() const {
  return ValName ? ValName->getValue() : StringRef();
}

unsigned getNumArgs() const { return NumArgs; }

Init *getArg(unsigned Num) const {
  assert(Num < NumArgs && "Arg number out of range!")(static_cast<void> (0));
  return getTrailingObjects<Init *>()[Num];
}

StringInit *getArgName(unsigned Num) const {
  assert(Num < NumArgNames && "Arg number out of range!")(static_cast<void> (0));
  return getTrailingObjects<StringInit *>()[Num];
}

StringRef getArgNameStr(unsigned Num) const {
  StringInit *Init = getArgName(Num);
  return Init ? Init->getValue() : StringRef();
}

ArrayRef<Init *> getArgs() const {
  return makeArrayRef(getTrailingObjects<Init *>(), NumArgs);
}

ArrayRef<StringInit *> getArgNames() const {
  return makeArrayRef(getTrailingObjects<StringInit *>(), NumArgNames);
}

Init *resolveReferences(Resolver &R) const override;

bool isConcrete() const override;
std::string getAsString() const override;

using const_arg_iterator = SmallVectorImpl<Init*>::const_iterator;
using const_name_iterator = SmallVectorImpl<StringInit*>::const_iterator;

inline const_arg_iterator  arg_begin() const { return getArgs().begin(); }
inline const_arg_iterator  arg_end  () const { return getArgs().end(); }

inline size_t              arg_size () const { return NumArgs; }
inline bool                arg_empty() const { return NumArgs == 0; }

inline const_name_iterator name_begin() const { return getArgNames().begin();}
inline const_name_iterator name_end  () const { return getArgNames().end(); }

inline size_t              name_size () const { return NumArgNames; }
inline bool                name_empty() const { return NumArgNames == 0; }

Init *getBit(unsigned Bit) const override {
  llvm_unreachable("Illegal bit reference off dag")__builtin_unreachable();
}
1394};

1396//===----------------------------------------------------------------------===//
1397//  High-Level Classes
1398//===----------------------------------------------------------------------===//

1400/// This class represents a field in a record, including its name, type,
1401/// value, and source location.
1402class RecordVal {
friend class Record;

1405public:
enum FieldKind {
  FK_Normal,        // A normal record field.
  FK_NonconcreteOK, // A field that can be nonconcrete ('field' keyword).
  FK_TemplateArg,   // A template argument.
};

1412private:
Init *Name;
SMLoc Loc; // Source location of definition of name.
PointerIntPair<RecTy *, 2, FieldKind> TyAndKind;
Init *Value;

1418public:
RecordVal(Init *N, RecTy *T, FieldKind K);
RecordVal(Init *N, SMLoc Loc, RecTy *T, FieldKind K);

/// Get the name of the field as a StringRef.
StringRef getName() const;

/// Get the name of the field as an Init.
Init *getNameInit() const { return Name; }

/// Get the name of the field as a std::string.
std::string getNameInitAsString() const {
  return getNameInit()->getAsUnquotedString();
}

/// Get the source location of the point where the field was defined.
const SMLoc &getLoc() const { return Loc; }

/// Is this a field where nonconcrete values are okay?
bool isNonconcreteOK() const {
  return TyAndKind.getInt() == FK_NonconcreteOK;
}

/// Is this a template argument?
bool isTemplateArg() const {
  return TyAndKind.getInt() == FK_TemplateArg;
}

/// Get the type of the field value as a RecTy.
RecTy *getType() const { return TyAndKind.getPointer(); }

/// Get the type of the field for printing purposes.
std::string getPrintType() const;

/// Get the value of the field as an Init.
Init *getValue() const { return Value; }

/// Set the value of the field from an Init.
bool setValue(Init *V);

/// Set the value and source location of the field.
bool setValue(Init *V, SMLoc NewLoc);

void dump() const;

/// Print the value to an output stream, possibly with a semicolon.
void print(raw_ostream &OS, bool PrintSem = true) const;
1465};

1467inline raw_ostream &operator<<(raw_ostream &OS, const RecordVal &RV) {
RV.print(OS << "  ");
return OS;
1470}

1472class Record {
1473public:
struct AssertionInfo {
  SMLoc Loc;
  Init *Condition;
  Init *Message;

  // User-defined constructor to support std::make_unique(). It can be
  // removed in C++20 when braced initialization is supported.
  AssertionInfo(SMLoc Loc, Init *Condition, Init *Message)
      : Loc(Loc), Condition(Condition), Message(Message) {}
};

1485private:
static unsigned LastID;

Init *Name;
// Location where record was instantiated, followed by the location of
// multiclass prototypes used.
SmallVector<SMLoc, 4> Locs;
SmallVector<Init *, 0> TemplateArgs;
SmallVector<RecordVal, 0> Values;
SmallVector<AssertionInfo, 0> Assertions;

// All superclasses in the inheritance forest in post-order (yes, it
// must be a forest; diamond-shaped inheritance is not allowed).
SmallVector<std::pair<Record *, SMRange>, 0> SuperClasses;

// Tracks Record instances. Not owned by Record.
RecordKeeper &TrackedRecords;

// The DefInit corresponding to this record.
DefInit *CorrespondingDefInit = nullptr;

// Unique record ID.
unsigned ID;

bool IsAnonymous;
bool IsClass;

void checkName();

1514public:
// Constructs a record.
explicit Record(Init *N, ArrayRef<SMLoc> locs, RecordKeeper &records,
                bool Anonymous = false, bool Class = false)
  : Name(N), Locs(locs.begin(), locs.end()), TrackedRecords(records),
    ID(LastID++), IsAnonymous(Anonymous), IsClass(Class) {
  checkName();
}

explicit Record(StringRef N, ArrayRef<SMLoc> locs, RecordKeeper &records,
                bool Class = false)
    : Record(StringInit::get(N), locs, records, false, Class) {}

// When copy-constructing a Record, we must still guarantee a globally unique
// ID number. Don't copy CorrespondingDefInit either, since it's owned by the
// original record. All other fields can be copied normally.
Record(const Record &O)
  : Name(O.Name), Locs(O.Locs), TemplateArgs(O.TemplateArgs),
    Values(O.Values), Assertions(O.Assertions), SuperClasses(O.SuperClasses),
    TrackedRecords(O.TrackedRecords), ID(LastID++),
    IsAnonymous(O.IsAnonymous), IsClass(O.IsClass) { }

static unsigned getNewUID() { return LastID++; }

unsigned getID() const { return ID; }

StringRef getName() const { return cast<StringInit>(Name)->getValue(); }

Init *getNameInit() const {
  return Name;
}

const std::string getNameInitAsString() const {
  return getNameInit()->getAsUnquotedString();
}

void setName(Init *Name);      // Also updates RecordKeeper.

ArrayRef<SMLoc> getLoc() const { return Locs; }
void appendLoc(SMLoc Loc) { Locs.push_back(Loc); }

// Make the type that this record should have based on its superclasses.
RecordRecTy *getType();

/// get the corresponding DefInit.
DefInit *getDefInit();

bool isClass() const { return IsClass; }

ArrayRef<Init *> getTemplateArgs() const {
  return TemplateArgs;
}

ArrayRef<RecordVal> getValues() const { return Values; }

ArrayRef<AssertionInfo> getAssertions() const { return Assertions; }

ArrayRef<std::pair<Record *, SMRange>>  getSuperClasses() const {
  return SuperClasses;
}

/// Determine whether this record has the specified direct superclass.
bool hasDirectSuperClass(const Record *SuperClass) const;

/// Append the direct superclasses of this record to Classes.
void getDirectSuperClasses(SmallVectorImpl<Record *> &Classes) const;

bool isTemplateArg(Init *Name) const {
  return llvm::is_contained(TemplateArgs, Name);
}

const RecordVal *getValue(const Init *Name) const {
  for (const RecordVal &Val : Values)
    if (Val.Name == Name) return &Val;
  return nullptr;
}

const RecordVal *getValue(StringRef Name) const {
  return getValue(StringInit::get(Name));
}

RecordVal *getValue(const Init *Name) {
  return const_cast<RecordVal *>(static_cast<const Record *>(this)->getValue(Name));
}

RecordVal *getValue(StringRef Name) {
  return const_cast<RecordVal *>(static_cast<const Record *>(this)->getValue(Name));
}

void addTemplateArg(Init *Name) {
  assert(!isTemplateArg(Name) && "Template arg already defined!")(static_cast<void> (0));
  TemplateArgs.push_back(Name);
}

void addValue(const RecordVal &RV) {
  assert(getValue(RV.getNameInit()) == nullptr && "Value already added!")(static_cast<void> (0));
  Values.push_back(RV);
}

void removeValue(Init *Name) {
  for (unsigned i = 0, e = Values.size(); i != e; ++i)
    if (Values[i].getNameInit() == Name) {
      Values.erase(Values.begin()+i);
      return;
    }
  llvm_unreachable("Cannot remove an entry that does not exist!")__builtin_unreachable();
}

void removeValue(StringRef Name) {
  removeValue(StringInit::get(Name));
}

void addAssertion(SMLoc Loc, Init *Condition, Init *Message) {
  Assertions.push_back(AssertionInfo(Loc, Condition, Message));
}

void appendAssertions(const Record *Rec) {
  Assertions.append(Rec->Assertions);
}

void checkRecordAssertions();

bool isSubClassOf(const Record *R) const {
  for (const auto &SCPair : SuperClasses)
    if (SCPair.first == R)
      return true;
  return false;
}

bool isSubClassOf(StringRef Name) const {
  for (const auto &SCPair : SuperClasses) {
14
←
Assuming '__begin2' is equal to '__end2'→
19
←
Assuming '__begin2' is equal to '__end2'→
24
←
Assuming '__begin2' is not equal to '__end2'→
    if (const auto *SI25.1
'SI' is null
1
'SI' is null
1
'SI' is null
1
'SI' is null
 = dyn_cast<StringInit>(SCPair.first->getNameInit())) {
25
←
Assuming the object is not a 'StringInit'→
26
←
Taking false branch→
      if (SI->getValue() == Name)
        return true;
    } else if (SCPair.first->getNameInitAsString() == Name) {
27
←
Assuming the condition is true→
28
←
Taking true branch→
      return true;
29
←
Returning the value 1, which participates in a condition later→
    }
  }
  return false;
15
←
Returning zero, which participates in a condition later→
20
←
Returning zero, which participates in a condition later→
}

void addSuperClass(Record *R, SMRange Range) {
  assert(!CorrespondingDefInit &&(static_cast<void> (0))
         "changing type of record after it has been referenced")(static_cast<void> (0));
  assert(!isSubClassOf(R) && "Already subclassing record!")(static_cast<void> (0));
  SuperClasses.push_back(std::make_pair(R, Range));
}

/// If there are any field references that refer to fields
/// that have been filled in, we can propagate the values now.
///
/// This is a final resolve: any error messages, e.g. due to undefined
/// !cast references, are generated now.
void resolveReferences(Init *NewName = nullptr);

/// Apply the resolver to the name of the record as well as to the
/// initializers of all fields of the record except SkipVal.
///
/// The resolver should not resolve any of the fields itself, to avoid
/// recursion / infinite loops.
void resolveReferences(Resolver &R, const RecordVal *SkipVal = nullptr);

RecordKeeper &getRecords() const {
  return TrackedRecords;
}

bool isAnonymous() const {
  return IsAnonymous;
}

void dump() const;

//===--------------------------------------------------------------------===//
// High-level methods useful to tablegen back-ends
//

///Return the source location for the named field.
SMLoc getFieldLoc(StringRef FieldName) const;

/// Return the initializer for a value with the specified name,
/// or throw an exception if the field does not exist.
Init *getValueInit(StringRef FieldName) const;

/// Return true if the named field is unset.
bool isValueUnset(StringRef FieldName) const {
  return isa<UnsetInit>(getValueInit(FieldName));
}

/// This method looks up the specified field and returns
/// its value as a string, throwing an exception if the field does not exist
/// or if the value is not a string.
StringRef getValueAsString(StringRef FieldName) const;

/// This method looks up the specified field and returns
/// its value as a string, throwing an exception if the field if the value is
/// not a string and llvm::Optional() if the field does not exist.
llvm::Optional<StringRef> getValueAsOptionalString(StringRef FieldName) const;

/// This method looks up the specified field and returns
/// its value as a BitsInit, throwing an exception if the field does not exist
/// or if the value is not the right type.
BitsInit *getValueAsBitsInit(StringRef FieldName) const;

/// This method looks up the specified field and returns
/// its value as a ListInit, throwing an exception if the field does not exist
/// or if the value is not the right type.
ListInit *getValueAsListInit(StringRef FieldName) const;

/// This method looks up the specified field and
/// returns its value as a vector of records, throwing an exception if the
/// field does not exist or if the value is not the right type.
std::vector<Record*> getValueAsListOfDefs(StringRef FieldName) const;

/// This method looks up the specified field and
/// returns its value as a vector of integers, throwing an exception if the
/// field does not exist or if the value is not the right type.
std::vector<int64_t> getValueAsListOfInts(StringRef FieldName) const;

/// This method looks up the specified field and
/// returns its value as a vector of strings, throwing an exception if the
/// field does not exist or if the value is not the right type.
std::vector<StringRef> getValueAsListOfStrings(StringRef FieldName) const;

/// This method looks up the specified field and returns its
/// value as a Record, throwing an exception if the field does not exist or if
/// the value is not the right type.
Record *getValueAsDef(StringRef FieldName) const;

/// This method looks up the specified field and returns its value as a
/// Record, returning null if the field exists but is "uninitialized"
/// (i.e. set to `?`), and throwing an exception if the field does not
/// exist or if its value is not the right type.
Record *getValueAsOptionalDef(StringRef FieldName) const;

/// This method looks up the specified field and returns its
/// value as a bit, throwing an exception if the field does not exist or if
/// the value is not the right type.
bool getValueAsBit(StringRef FieldName) const;

/// This method looks up the specified field and
/// returns its value as a bit. If the field is unset, sets Unset to true and
/// returns false.
bool getValueAsBitOrUnset(StringRef FieldName, bool &Unset) const;

/// This method looks up the specified field and returns its
/// value as an int64_t, throwing an exception if the field does not exist or
/// if the value is not the right type.
int64_t getValueAsInt(StringRef FieldName) const;

/// This method looks up the specified field and returns its
/// value as an Dag, throwing an exception if the field does not exist or if
/// the value is not the right type.
DagInit *getValueAsDag(StringRef FieldName) const;
1767};

1769raw_ostream &operator<<(raw_ostream &OS, const Record &R);

1771class RecordKeeper {
friend class RecordRecTy;

using RecordMap = std::map<std::string, std::unique_ptr<Record>, std::less<>>;
using GlobalMap = std::map<std::string, Init *, std::less<>>;

std::string InputFilename;
RecordMap Classes, Defs;
mutable StringMap<std::vector<Record *>> ClassRecordsMap;
FoldingSet<RecordRecTy> RecordTypePool;
std::map<std::string, Init *, std::less<>> ExtraGlobals;
unsigned AnonCounter = 0;

// These members are for the phase timing feature. We need a timer group,
// the last timer started, and a flag to say whether the last timer
// is the special "backend overall timer."
TimerGroup *TimingGroup = nullptr;
Timer *LastTimer = nullptr;
bool BackendTimer = false;

1791public:
/// Get the main TableGen input file's name.
const std::string getInputFilename() const { return InputFilename; }

/// Get the map of classes.
const RecordMap &getClasses() const { return Classes; }

/// Get the map of records (defs).
const RecordMap &getDefs() const { return Defs; }

/// Get the map of global variables.
const GlobalMap &getGlobals() const { return ExtraGlobals; }

/// Get the class with the specified name.
Record *getClass(StringRef Name) const {
  auto I = Classes.find(Name);
  return I == Classes.end() ? nullptr : I->second.get();
}

/// Get the concrete record with the specified name.
Record *getDef(StringRef Name) const {
  auto I = Defs.find(Name);
  return I == Defs.end() ? nullptr : I->second.get();
}

/// Get the \p Init value of the specified global variable.
Init *getGlobal(StringRef Name) const {
  if (Record *R = getDef(Name))
    return R->getDefInit();
  auto It = ExtraGlobals.find(Name);
  return It == ExtraGlobals.end() ? nullptr : It->second;
}

void saveInputFilename(std::string Filename) {
  InputFilename = Filename;
}

void addClass(std::unique_ptr<Record> R) {
  bool Ins = Classes.insert(std::make_pair(std::string(R->getName()),
                                           std::move(R))).second;
  (void)Ins;
  assert(Ins && "Class already exists")(static_cast<void> (0));
}

void addDef(std::unique_ptr<Record> R) {
  bool Ins = Defs.insert(std::make_pair(std::string(R->getName()),
                                        std::move(R))).second;
  (void)Ins;
  assert(Ins && "Record already exists")(static_cast<void> (0));
}

void addExtraGlobal(StringRef Name, Init *I) {
  bool Ins = ExtraGlobals.insert(std::make_pair(std::string(Name), I)).second;
  (void)Ins;
  assert(!getDef(Name))(static_cast<void> (0));
  assert(Ins && "Global already exists")(static_cast<void> (0));
}

Init *getNewAnonymousName();

/// Start phase timing; called if the --time-phases option is specified.
void startPhaseTiming() {
  TimingGroup = new TimerGroup("TableGen", "TableGen Phase Timing");
}

/// Start timing a phase. Automatically stops any previous phase timer.
void startTimer(StringRef Name);

/// Stop timing a phase.
void stopTimer();

/// Start timing the overall backend. If the backend itself starts a timer,
/// then this timer is cleared.
void startBackendTimer(StringRef Name);

/// Stop timing the overall backend.
void stopBackendTimer();

/// Stop phase timing and print the report.
void stopPhaseTiming() {
  if (TimingGroup)
    delete TimingGroup;
}

//===--------------------------------------------------------------------===//
// High-level helper methods, useful for tablegen backends.

/// Get all the concrete records that inherit from the one specified
/// class. The class must be defined.
std::vector<Record *> getAllDerivedDefinitions(StringRef ClassName) const;

/// Get all the concrete records that inherit from all the specified
/// classes. The classes must be defined.
std::vector<Record *> getAllDerivedDefinitions(
    ArrayRef<StringRef> ClassNames) const;

void dump() const;
1888};

1890/// Sorting predicate to sort record pointers by name.
1891struct LessRecord {
bool operator()(const Record *Rec1, const Record *Rec2) const {
  return StringRef(Rec1->getName()).compare_numeric(Rec2->getName()) < 0;
}
1895};

1897/// Sorting predicate to sort record pointers by their
1898/// unique ID. If you just need a deterministic order, use this, since it
1899/// just compares two `unsigned`; the other sorting predicates require
1900/// string manipulation.
1901struct LessRecordByID {
bool operator()(const Record *LHS, const Record *RHS) const {
  return LHS->getID() < RHS->getID();
}
1905};

1907/// Sorting predicate to sort record pointers by their
1908/// name field.
1909struct LessRecordFieldName {
bool operator()(const Record *Rec1, const Record *Rec2) const {
  return Rec1->getValueAsString("Name") < Rec2->getValueAsString("Name");
}
1913};

1915struct LessRecordRegister {
struct RecordParts {
  SmallVector<std::pair< bool, StringRef>, 4> Parts;

  RecordParts(StringRef Rec) {
    if (Rec.empty())
      return;

    size_t Len = 0;
    const char *Start = Rec.data();
    const char *Curr = Start;
    bool IsDigitPart = isDigit(Curr[0]);
    for (size_t I = 0, E = Rec.size(); I != E; ++I, ++Len) {
      bool IsDigit = isDigit(Curr[I]);
      if (IsDigit != IsDigitPart) {
        Parts.push_back(std::make_pair(IsDigitPart, StringRef(Start, Len)));
        Len = 0;
        Start = &Curr[I];
        IsDigitPart = isDigit(Curr[I]);
      }
    }
    // Push the last part.
    Parts.push_back(std::make_pair(IsDigitPart, StringRef(Start, Len)));
  }

  size_t size() { return Parts.size(); }

  std::pair<bool, StringRef> getPart(size_t i) {
    assert (i < Parts.size() && "Invalid idx!")(static_cast<void> (0));
    return Parts[i];
  }
};

bool operator()(const Record *Rec1, const Record *Rec2) const {
  RecordParts LHSParts(StringRef(Rec1->getName()));
  RecordParts RHSParts(StringRef(Rec2->getName()));

  size_t LHSNumParts = LHSParts.size();
  size_t RHSNumParts = RHSParts.size();
  assert (LHSNumParts && RHSNumParts && "Expected at least one part!")(static_cast<void> (0));

  if (LHSNumParts != RHSNumParts)
    return LHSNumParts < RHSNumParts;

  // We expect the registers to be of the form [_a-zA-Z]+([0-9]*[_a-zA-Z]*)*.
  for (size_t I = 0, E = LHSNumParts; I < E; I+=2) {
    std::pair<bool, StringRef> LHSPart = LHSParts.getPart(I);
    std::pair<bool, StringRef> RHSPart = RHSParts.getPart(I);
    // Expect even part to always be alpha.
    assert (LHSPart.first == false && RHSPart.first == false &&(static_cast<void> (0))
            "Expected both parts to be alpha.")(static_cast<void> (0));
    if (int Res = LHSPart.second.compare(RHSPart.second))
      return Res < 0;
  }
  for (size_t I = 1, E = LHSNumParts; I < E; I+=2) {
    std::pair<bool, StringRef> LHSPart = LHSParts.getPart(I);
    std::pair<bool, StringRef> RHSPart = RHSParts.getPart(I);
    // Expect odd part to always be numeric.
    assert (LHSPart.first == true && RHSPart.first == true &&(static_cast<void> (0))
            "Expected both parts to be numeric.")(static_cast<void> (0));
    if (LHSPart.second.size() != RHSPart.second.size())
      return LHSPart.second.size() < RHSPart.second.size();

    unsigned LHSVal, RHSVal;

    bool LHSFailed = LHSPart.second.getAsInteger(10, LHSVal); (void)LHSFailed;
    assert(!LHSFailed && "Unable to convert LHS to integer.")(static_cast<void> (0));
    bool RHSFailed = RHSPart.second.getAsInteger(10, RHSVal); (void)RHSFailed;
    assert(!RHSFailed && "Unable to convert RHS to integer.")(static_cast<void> (0));

    if (LHSVal != RHSVal)
      return LHSVal < RHSVal;
  }
  return LHSNumParts < RHSNumParts;
}
1990};

1992raw_ostream &operator<<(raw_ostream &OS, const RecordKeeper &RK);

1994//===----------------------------------------------------------------------===//
1995//  Resolvers
1996//===----------------------------------------------------------------------===//

1998/// Interface for looking up the initializer for a variable name, used by
1999/// Init::resolveReferences.
2000class Resolver {
Record *CurRec;
bool IsFinal = false;

2004public:
explicit Resolver(Record *CurRec) : CurRec(CurRec) {}
virtual ~Resolver() {}

Record *getCurrentRecord() const { return CurRec; }

/// Return the initializer for the given variable name (should normally be a
/// StringInit), or nullptr if the name could not be resolved.
virtual Init *resolve(Init *VarName) = 0;

// Whether bits in a BitsInit should stay unresolved if resolving them would
// result in a ? (UnsetInit). This behavior is used to represent instruction
// encodings by keeping references to unset variables within a record.
virtual bool keepUnsetBits() const { return false; }

// Whether this is the final resolve step before adding a record to the
// RecordKeeper. Error reporting during resolve and related constant folding
// should only happen when this is true.
bool isFinal() const { return IsFinal; }

void setFinal(bool Final) { IsFinal = Final; }
2025};

2027/// Resolve arbitrary mappings.
2028class MapResolver final : public Resolver {
struct MappedValue {
  Init *V;
  bool Resolved;

  MappedValue() : V(nullptr), Resolved(false) {}
  MappedValue(Init *V, bool Resolved) : V(V), Resolved(Resolved) {}
};

DenseMap<Init *, MappedValue> Map;

2039public:
explicit MapResolver(Record *CurRec = nullptr) : Resolver(CurRec) {}

void set(Init *Key, Init *Value) { Map[Key] = {Value, false}; }

bool isComplete(Init *VarName) const {
  auto It = Map.find(VarName);
  assert(It != Map.end() && "key must be present in map")(static_cast<void> (0));
  return It->second.V->isComplete();
}

Init *resolve(Init *VarName) override;
2051};

2053/// Resolve all variables from a record except for unset variables.
2054class RecordResolver final : public Resolver {
DenseMap<Init *, Init *> Cache;
SmallVector<Init *, 4> Stack;
Init *Name = nullptr;

2059public:
explicit RecordResolver(Record &R) : Resolver(&R) {}

void setName(Init *NewName) { Name = NewName; }

Init *resolve(Init *VarName) override;

bool keepUnsetBits() const override { return true; }
2067};

2069/// Delegate resolving to a sub-resolver, but shadow some variable names.
2070class ShadowResolver final : public Resolver {
Resolver &R;
DenseSet<Init *> Shadowed;

2074public:
explicit ShadowResolver(Resolver &R)
    : Resolver(R.getCurrentRecord()), R(R) {
  setFinal(R.isFinal());
}

void addShadow(Init *Key) { Shadowed.insert(Key); }

Init *resolve(Init *VarName) override {
  if (Shadowed.count(VarName))
    return nullptr;
  return R.resolve(VarName);
}
2087};

2089/// (Optionally) delegate resolving to a sub-resolver, and keep track whether
2090/// there were unresolved references.
2091class TrackUnresolvedResolver final : public Resolver {
Resolver *R;
bool FoundUnresolved = false;

2095public:
explicit TrackUnresolvedResolver(Resolver *R = nullptr)
    : Resolver(R ? R->getCurrentRecord() : nullptr), R(R) {}

bool foundUnresolved() const { return FoundUnresolved; }

Init *resolve(Init *VarName) override;
2102};

2104/// Do not resolve anything, but keep track of whether a given variable was
2105/// referenced.
2106class HasReferenceResolver final : public Resolver {
Init *VarNameToTrack;
bool Found = false;

2110public:
explicit HasReferenceResolver(Init *VarNameToTrack)
    : Resolver(nullptr), VarNameToTrack(VarNameToTrack) {}

bool found() const { return Found; }

Init *resolve(Init *VarName) override;
2117};

2119void EmitDetailedRecords(RecordKeeper &RK, raw_ostream &OS);
2120void EmitJSON(RecordKeeper &RK, raw_ostream &OS);

2122} // end namespace llvm

2124#endif // LLVM_TABLEGEN_RECORD_H

←

/build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/llvm/utils/TableGen/CodeGenDAGPatterns.h

→

1//===- CodeGenDAGPatterns.h - Read DAG patterns from .td file ---*- C++ -*-===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// This file declares the CodeGenDAGPatterns class, which is used to read and
10// represent the patterns present in a .td file for instructions.
11//
12//===----------------------------------------------------------------------===//

14#ifndef LLVM_UTILS_TABLEGEN_CODEGENDAGPATTERNS_H
15#define LLVM_UTILS_TABLEGEN_CODEGENDAGPATTERNS_H

17#include "CodeGenIntrinsics.h"
18#include "CodeGenTarget.h"
19#include "SDNodeProperties.h"
20#include "llvm/ADT/MapVector.h"
21#include "llvm/ADT/SmallVector.h"
22#include "llvm/ADT/StringMap.h"
23#include "llvm/ADT/StringSet.h"
24#include "llvm/Support/ErrorHandling.h"
25#include "llvm/Support/MathExtras.h"
26#include <algorithm>
27#include <array>
28#include <functional>
29#include <map>
30#include <numeric>
31#include <set>
32#include <vector>

34namespace llvm {

36class Record;
37class Init;
38class ListInit;
39class DagInit;
40class SDNodeInfo;
41class TreePattern;
42class TreePatternNode;
43class CodeGenDAGPatterns;

45/// Shared pointer for TreePatternNode.
46using TreePatternNodePtr = std::shared_ptr<TreePatternNode>;

48/// This represents a set of MVTs. Since the underlying type for the MVT
49/// is uint8_t, there are at most 256 values. To reduce the number of memory
50/// allocations and deallocations, represent the set as a sequence of bits.
51/// To reduce the allocations even further, make MachineValueTypeSet own
52/// the storage and use std::array as the bit container.
53struct MachineValueTypeSet {
static_assert(std::is_same<std::underlying_type<MVT::SimpleValueType>::type,
                           uint8_t>::value,
              "Change uint8_t here to the SimpleValueType's type");
static unsigned constexpr Capacity = std::numeric_limits<uint8_t>::max()+1;
using WordType = uint64_t;
static unsigned constexpr WordWidth = CHAR_BIT8*sizeof(WordType);
static unsigned constexpr NumWords = Capacity/WordWidth;
static_assert(NumWords*WordWidth == Capacity,
              "Capacity should be a multiple of WordWidth");

LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
MachineValueTypeSet() {
  clear();
}

LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
unsigned size() const {
  unsigned Count = 0;
  for (WordType W : Words)
    Count += countPopulation(W);
  return Count;
}
LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
void clear() {
  std::memset(Words.data(), 0, NumWords*sizeof(WordType));
}
LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
bool empty() const {
  for (WordType W : Words)
    if (W != 0)
      return false;
  return true;
}
LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
unsigned count(MVT T) const {
  return (Words[T.SimpleTy / WordWidth] >> (T.SimpleTy % WordWidth)) & 1;
}
std::pair<MachineValueTypeSet&,bool> insert(MVT T) {
  bool V = count(T.SimpleTy);
  Words[T.SimpleTy / WordWidth] |= WordType(1) << (T.SimpleTy % WordWidth);
  return {*this, V};
}
MachineValueTypeSet &insert(const MachineValueTypeSet &S) {
  for (unsigned i = 0; i != NumWords; ++i)
    Words[i] |= S.Words[i];
  return *this;
}
LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
void erase(MVT T) {
  Words[T.SimpleTy / WordWidth] &= ~(WordType(1) << (T.SimpleTy % WordWidth));
}

struct const_iterator {
  // Some implementations of the C++ library require these traits to be
  // defined.
  using iterator_category = std::forward_iterator_tag;
  using value_type = MVT;
  using difference_type = ptrdiff_t;
  using pointer = const MVT*;
  using reference = const MVT&;

  LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
  MVT operator*() const {
    assert(Pos != Capacity)(static_cast<void> (0));
    return MVT::SimpleValueType(Pos);
  }
  LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
  const_iterator(const MachineValueTypeSet *S, bool End) : Set(S) {
    Pos = End ? Capacity : find_from_pos(0);
  }
  LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
  const_iterator &operator++() {
    assert(Pos != Capacity)(static_cast<void> (0));
    Pos = find_from_pos(Pos+1);
    return *this;
  }

  LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
  bool operator==(const const_iterator &It) const {
    return Set == It.Set && Pos == It.Pos;
  }
  LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
  bool operator!=(const const_iterator &It) const {
    return !operator==(It);
  }

private:
  unsigned find_from_pos(unsigned P) const {
    unsigned SkipWords = P / WordWidth;
    unsigned SkipBits = P % WordWidth;
    unsigned Count = SkipWords * WordWidth;

    // If P is in the middle of a word, process it manually here, because
    // the trailing bits need to be masked off to use findFirstSet.
    if (SkipBits != 0) {
      WordType W = Set->Words[SkipWords];
      W &= maskLeadingOnes<WordType>(WordWidth-SkipBits);
      if (W != 0)
        return Count + findFirstSet(W);
      Count += WordWidth;
      SkipWords++;
    }

    for (unsigned i = SkipWords; i != NumWords; ++i) {
      WordType W = Set->Words[i];
      if (W != 0)
        return Count + findFirstSet(W);
      Count += WordWidth;
    }
    return Capacity;
  }

  const MachineValueTypeSet *Set;
  unsigned Pos;
};

LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
const_iterator begin() const { return const_iterator(this, false); }
LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
const_iterator end()   const { return const_iterator(this, true); }

LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
bool operator==(const MachineValueTypeSet &S) const {
  return Words == S.Words;
}
LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
bool operator!=(const MachineValueTypeSet &S) const {
  return !operator==(S);
}

184private:
friend struct const_iterator;
std::array<WordType,NumWords> Words;
187};

189struct TypeSetByHwMode : public InfoByHwMode<MachineValueTypeSet> {
using SetType = MachineValueTypeSet;
SmallVector<unsigned, 16> AddrSpaces;

TypeSetByHwMode() = default;
TypeSetByHwMode(const TypeSetByHwMode &VTS) = default;
TypeSetByHwMode &operator=(const TypeSetByHwMode &) = default;
TypeSetByHwMode(MVT::SimpleValueType VT)
  : TypeSetByHwMode(ValueTypeByHwMode(VT)) {}
TypeSetByHwMode(ValueTypeByHwMode VT)
  : TypeSetByHwMode(ArrayRef<ValueTypeByHwMode>(&VT, 1)) {}
TypeSetByHwMode(ArrayRef<ValueTypeByHwMode> VTList);

SetType &getOrCreate(unsigned Mode) {
  return Map[Mode];
}

bool isValueTypeByHwMode(bool AllowEmpty) const;
ValueTypeByHwMode getValueTypeByHwMode() const;

LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
bool isMachineValueType() const {
  return isDefaultOnly() && Map.begin()->second.size() == 1;
}

LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
MVT getMachineValueType() const {
  assert(isMachineValueType())(static_cast<void> (0));
  return *Map.begin()->second.begin();
}

bool isPossible() const;

LLVM_ATTRIBUTE_ALWAYS_INLINEinline __attribute__((always_inline))
bool isDefaultOnly() const {
  return Map.size() == 1 && Map.begin()->first == DefaultMode;
}

bool isPointer() const {
  return getValueTypeByHwMode().isPointer();
}

unsigned getPtrAddrSpace() const {
  assert(isPointer())(static_cast<void> (0));
  return getValueTypeByHwMode().PtrAddrSpace;
}

bool insert(const ValueTypeByHwMode &VVT);
bool constrain(const TypeSetByHwMode &VTS);
template <typename Predicate> bool constrain(Predicate P);
template <typename Predicate>
bool assign_if(const TypeSetByHwMode &VTS, Predicate P);

void writeToStream(raw_ostream &OS) const;
static void writeToStream(const SetType &S, raw_ostream &OS);

bool operator==(const TypeSetByHwMode &VTS) const;
bool operator!=(const TypeSetByHwMode &VTS) const { return !(*this == VTS); }

void dump() const;
bool validate() const;

251private:
unsigned PtrAddrSpace = std::numeric_limits<unsigned>::max();
/// Intersect two sets. Return true if anything has changed.
bool intersect(SetType &Out, const SetType &In);
255};

257raw_ostream &operator<<(raw_ostream &OS, const TypeSetByHwMode &T);

259struct TypeInfer {
TypeInfer(TreePattern &T) : TP(T), ForceMode(0) {}

bool isConcrete(const TypeSetByHwMode &VTS, bool AllowEmpty) const {
  return VTS.isValueTypeByHwMode(AllowEmpty);
}
ValueTypeByHwMode getConcrete(const TypeSetByHwMode &VTS,
                              bool AllowEmpty) const {
  assert(VTS.isValueTypeByHwMode(AllowEmpty))(static_cast<void> (0));
  return VTS.getValueTypeByHwMode();
}

/// The protocol in the following functions (Merge*, force*, Enforce*,
/// expand*) is to return "true" if a change has been made, "false"
/// otherwise.

bool MergeInTypeInfo(TypeSetByHwMode &Out, const TypeSetByHwMode &In);
bool MergeInTypeInfo(TypeSetByHwMode &Out, MVT::SimpleValueType InVT) {
  return MergeInTypeInfo(Out, TypeSetByHwMode(InVT));
}
bool MergeInTypeInfo(TypeSetByHwMode &Out, ValueTypeByHwMode InVT) {
  return MergeInTypeInfo(Out, TypeSetByHwMode(InVT));
}

/// Reduce the set \p Out to have at most one element for each mode.
bool forceArbitrary(TypeSetByHwMode &Out);

/// The following four functions ensure that upon return the set \p Out
/// will only contain types of the specified kind: integer, floating-point,
/// scalar, or vector.
/// If \p Out is empty, all legal types of the specified kind will be added
/// to it. Otherwise, all types that are not of the specified kind will be
/// removed from \p Out.
bool EnforceInteger(TypeSetByHwMode &Out);
bool EnforceFloatingPoint(TypeSetByHwMode &Out);
bool EnforceScalar(TypeSetByHwMode &Out);
bool EnforceVector(TypeSetByHwMode &Out);

/// If \p Out is empty, fill it with all legal types. Otherwise, leave it
/// unchanged.
bool EnforceAny(TypeSetByHwMode &Out);
/// Make sure that for each type in \p Small, there exists a larger type
/// in \p Big.
bool EnforceSmallerThan(TypeSetByHwMode &Small, TypeSetByHwMode &Big);
/// 1. Ensure that for each type T in \p Vec, T is a vector type, and that
///    for each type U in \p Elem, U is a scalar type.
/// 2. Ensure that for each (scalar) type U in \p Elem, there exists a
///    (vector) type T in \p Vec, such that U is the element type of T.
bool EnforceVectorEltTypeIs(TypeSetByHwMode &Vec, TypeSetByHwMode &Elem);
bool EnforceVectorEltTypeIs(TypeSetByHwMode &Vec,
                            const ValueTypeByHwMode &VVT);
/// Ensure that for each type T in \p Sub, T is a vector type, and there
/// exists a type U in \p Vec such that U is a vector type with the same
/// element type as T and at least as many elements as T.
bool EnforceVectorSubVectorTypeIs(TypeSetByHwMode &Vec,
                                  TypeSetByHwMode &Sub);
/// 1. Ensure that \p V has a scalar type iff \p W has a scalar type.
/// 2. Ensure that for each vector type T in \p V, there exists a vector
///    type U in \p W, such that T and U have the same number of elements.
/// 3. Ensure that for each vector type U in \p W, there exists a vector
///    type T in \p V, such that T and U have the same number of elements
///    (reverse of 2).
bool EnforceSameNumElts(TypeSetByHwMode &V, TypeSetByHwMode &W);
/// 1. Ensure that for each type T in \p A, there exists a type U in \p B,
///    such that T and U have equal size in bits.
/// 2. Ensure that for each type U in \p B, there exists a type T in \p A
///    such that T and U have equal size in bits (reverse of 1).
bool EnforceSameSize(TypeSetByHwMode &A, TypeSetByHwMode &B);

/// For each overloaded type (i.e. of form *Any), replace it with the
/// corresponding subset of legal, specific types.
void expandOverloads(TypeSetByHwMode &VTS);
void expandOverloads(TypeSetByHwMode::SetType &Out,
                     const TypeSetByHwMode::SetType &Legal);

struct ValidateOnExit {
  ValidateOnExit(TypeSetByHwMode &T, TypeInfer &TI) : Infer(TI), VTS(T) {}
#ifndef NDEBUG1
  ~ValidateOnExit();
#else
  ~ValidateOnExit() {}  // Empty destructor with NDEBUG.
#endif
  TypeInfer &Infer;
  TypeSetByHwMode &VTS;
};

struct SuppressValidation {
  SuppressValidation(TypeInfer &TI) : Infer(TI), SavedValidate(TI.Validate) {
    Infer.Validate = false;
  }
  ~SuppressValidation() {
    Infer.Validate = SavedValidate;
  }
  TypeInfer &Infer;
  bool SavedValidate;
};

TreePattern &TP;
unsigned ForceMode;     // Mode to use when set.
bool CodeGen = false;   // Set during generation of matcher code.
bool Validate = true;   // Indicate whether to validate types.

361private:
const TypeSetByHwMode &getLegalTypes();

/// Cached legal types (in default mode).
bool LegalTypesCached = false;
TypeSetByHwMode LegalCache;
367};

369/// Set type used to track multiply used variables in patterns
370typedef StringSet<> MultipleUseVarSet;

372/// SDTypeConstraint - This is a discriminated union of constraints,
373/// corresponding to the SDTypeConstraint tablegen class in Target.td.
374struct SDTypeConstraint {
SDTypeConstraint(Record *R, const CodeGenHwModes &CGH);

unsigned OperandNo;   // The operand # this constraint applies to.
enum {
  SDTCisVT, SDTCisPtrTy, SDTCisInt, SDTCisFP, SDTCisVec, SDTCisSameAs,
  SDTCisVTSmallerThanOp, SDTCisOpSmallerThanOp, SDTCisEltOfVec,
  SDTCisSubVecOfVec, SDTCVecEltisVT, SDTCisSameNumEltsAs, SDTCisSameSizeAs
} ConstraintType;

union {   // The discriminated union.
  struct {
    unsigned OtherOperandNum;
  } SDTCisSameAs_Info;
  struct {
    unsigned OtherOperandNum;
  } SDTCisVTSmallerThanOp_Info;
  struct {
    unsigned BigOperandNum;
  } SDTCisOpSmallerThanOp_Info;
  struct {
    unsigned OtherOperandNum;
  } SDTCisEltOfVec_Info;
  struct {
    unsigned OtherOperandNum;
  } SDTCisSubVecOfVec_Info;
  struct {
    unsigned OtherOperandNum;
  } SDTCisSameNumEltsAs_Info;
  struct {
    unsigned OtherOperandNum;
  } SDTCisSameSizeAs_Info;
} x;

// The VT for SDTCisVT and SDTCVecEltisVT.
// Must not be in the union because it has a non-trivial destructor.
ValueTypeByHwMode VVT;

/// ApplyTypeConstraint - Given a node in a pattern, apply this type
/// constraint to the nodes operands.  This returns true if it makes a
/// change, false otherwise.  If a type contradiction is found, an error
/// is flagged.
bool ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo,
                         TreePattern &TP) const;
418};

420/// ScopedName - A name of a node associated with a "scope" that indicates
421/// the context (e.g. instance of Pattern or PatFrag) in which the name was
422/// used. This enables substitution of pattern fragments while keeping track
423/// of what name(s) were originally given to various nodes in the tree.
424class ScopedName {
unsigned Scope;
std::string Identifier;
427public:
ScopedName(unsigned Scope, StringRef Identifier)
    : Scope(Scope), Identifier(std::string(Identifier)) {
  assert(Scope != 0 &&(static_cast<void> (0))
         "Scope == 0 is used to indicate predicates without arguments")(static_cast<void> (0));
}

unsigned getScope() const { return Scope; }
const std::string &getIdentifier() const { return Identifier; }

bool operator==(const ScopedName &o) const;
bool operator!=(const ScopedName &o) const;
439};

441/// SDNodeInfo - One of these records is created for each SDNode instance in
442/// the target .td file.  This represents the various dag nodes we will be
443/// processing.
444class SDNodeInfo {
Record *Def;
StringRef EnumName;
StringRef SDClassName;
unsigned Properties;
unsigned NumResults;
int NumOperands;
std::vector<SDTypeConstraint> TypeConstraints;
452public:
// Parse the specified record.
SDNodeInfo(Record *R, const CodeGenHwModes &CGH);

unsigned getNumResults() const { return NumResults; }

/// getNumOperands - This is the number of operands required or -1 if
/// variadic.
int getNumOperands() const { return NumOperands; }
Record *getRecord() const { return Def; }
StringRef getEnumName() const { return EnumName; }
StringRef getSDClassName() const { return SDClassName; }

const std::vector<SDTypeConstraint> &getTypeConstraints() const {
  return TypeConstraints;
}

/// getKnownType - If the type constraints on this node imply a fixed type
/// (e.g. all stores return void, etc), then return it as an
/// MVT::SimpleValueType.  Otherwise, return MVT::Other.
MVT::SimpleValueType getKnownType(unsigned ResNo) const;

/// hasProperty - Return true if this node has the specified property.
///
bool hasProperty(enum SDNP Prop) const { return Properties & (1 << Prop); }

/// ApplyTypeConstraints - Given a node in a pattern, apply the type
/// constraints for this node to the operands of the node.  This returns
/// true if it makes a change, false otherwise.  If a type contradiction is
/// found, an error is flagged.
bool ApplyTypeConstraints(TreePatternNode *N, TreePattern &TP) const;
483};

485/// TreePredicateFn - This is an abstraction that represents the predicates on
486/// a PatFrag node.  This is a simple one-word wrapper around a pointer to
487/// provide nice accessors.
488class TreePredicateFn {
/// PatFragRec - This is the TreePattern for the PatFrag that we
/// originally came from.
TreePattern *PatFragRec;
492public:
/// TreePredicateFn constructor.  Here 'N' is a subclass of PatFrag.
TreePredicateFn(TreePattern *N);


TreePattern *getOrigPatFragRecord() const { return PatFragRec; }

/// isAlwaysTrue - Return true if this is a noop predicate.
bool isAlwaysTrue() const;

bool isImmediatePattern() const { return hasImmCode(); }

/// getImmediatePredicateCode - Return the code that evaluates this pattern if
/// this is an immediate predicate.  It is an error to call this on a
/// non-immediate pattern.
std::string getImmediatePredicateCode() const {
  std::string Result = getImmCode();
  assert(!Result.empty() && "Isn't an immediate pattern!")(static_cast<void> (0));
  return Result;
}

bool operator==(const TreePredicateFn &RHS) const {
  return PatFragRec == RHS.PatFragRec;
}

bool operator!=(const TreePredicateFn &RHS) const { return !(*this == RHS); }

/// Return the name to use in the generated code to reference this, this is
/// "Predicate_foo" if from a pattern fragment "foo".
std::string getFnName() const;

/// getCodeToRunOnSDNode - Return the code for the function body that
/// evaluates this predicate.  The argument is expected to be in "Node",
/// not N.  This handles casting and conversion to a concrete node type as
/// appropriate.
std::string getCodeToRunOnSDNode() const;

/// Get the data type of the argument to getImmediatePredicateCode().
StringRef getImmType() const;

/// Get a string that describes the type returned by getImmType() but is
/// usable as part of an identifier.
StringRef getImmTypeIdentifier() const;

// Predicate code uses the PatFrag's captured operands.
bool usesOperands() const;

// Is the desired predefined predicate for a load?
bool isLoad() const;
// Is the desired predefined predicate for a store?
bool isStore() const;
// Is the desired predefined predicate for an atomic?
bool isAtomic() const;

/// Is this predicate the predefined unindexed load predicate?
/// Is this predicate the predefined unindexed store predicate?
bool isUnindexed() const;
/// Is this predicate the predefined non-extending load predicate?
bool isNonExtLoad() const;
/// Is this predicate the predefined any-extend load predicate?
bool isAnyExtLoad() const;
/// Is this predicate the predefined sign-extend load predicate?
bool isSignExtLoad() const;
/// Is this predicate the predefined zero-extend load predicate?
bool isZeroExtLoad() const;
/// Is this predicate the predefined non-truncating store predicate?
bool isNonTruncStore() const;
/// Is this predicate the predefined truncating store predicate?
bool isTruncStore() const;

/// Is this predicate the predefined monotonic atomic predicate?
bool isAtomicOrderingMonotonic() const;
/// Is this predicate the predefined acquire atomic predicate?
bool isAtomicOrderingAcquire() const;
/// Is this predicate the predefined release atomic predicate?
bool isAtomicOrderingRelease() const;
/// Is this predicate the predefined acquire-release atomic predicate?
bool isAtomicOrderingAcquireRelease() const;
/// Is this predicate the predefined sequentially consistent atomic predicate?
bool isAtomicOrderingSequentiallyConsistent() const;

/// Is this predicate the predefined acquire-or-stronger atomic predicate?
bool isAtomicOrderingAcquireOrStronger() const;
/// Is this predicate the predefined weaker-than-acquire atomic predicate?
bool isAtomicOrderingWeakerThanAcquire() const;

/// Is this predicate the predefined release-or-stronger atomic predicate?
bool isAtomicOrderingReleaseOrStronger() const;
/// Is this predicate the predefined weaker-than-release atomic predicate?
bool isAtomicOrderingWeakerThanRelease() const;

/// If non-null, indicates that this predicate is a predefined memory VT
/// predicate for a load/store and returns the ValueType record for the memory VT.
Record *getMemoryVT() const;
/// If non-null, indicates that this predicate is a predefined memory VT
/// predicate (checking only the scalar type) for load/store and returns the
/// ValueType record for the memory VT.
Record *getScalarMemoryVT() const;

ListInit *getAddressSpaces() const;
int64_t getMinAlignment() const;

// If true, indicates that GlobalISel-based C++ code was supplied.
bool hasGISelPredicateCode() const;
std::string getGISelPredicateCode() const;

598private:
bool hasPredCode() const;
bool hasImmCode() const;
std::string getPredCode() const;
std::string getImmCode() const;
bool immCodeUsesAPInt() const;
bool immCodeUsesAPFloat() const;

bool isPredefinedPredicateEqualTo(StringRef Field, bool Value) const;
607};

609struct TreePredicateCall {
TreePredicateFn Fn;

// Scope -- unique identifier for retrieving named arguments. 0 is used when
// the predicate does not use named arguments.
unsigned Scope;

TreePredicateCall(const TreePredicateFn &Fn, unsigned Scope)
  : Fn(Fn), Scope(Scope) {}

bool operator==(const TreePredicateCall &o) const {
  return Fn == o.Fn && Scope == o.Scope;
}
bool operator!=(const TreePredicateCall &o) const {
  return !(*this == o);
}
625};

627class TreePatternNode {
/// The type of each node result.  Before and during type inference, each
/// result may be a set of possible types.  After (successful) type inference,
/// each is a single concrete type.
std::vector<TypeSetByHwMode> Types;

/// The index of each result in results of the pattern.
std::vector<unsigned> ResultPerm;

/// Operator - The Record for the operator if this is an interior node (not
/// a leaf).
Record *Operator;

/// Val - The init value (e.g. the "GPRC" record, or "7") for a leaf.
///
Init *Val;

/// Name - The name given to this node with the :$foo notation.
///
std::string Name;

std::vector<ScopedName> NamesAsPredicateArg;

/// PredicateCalls - The predicate functions to execute on this node to check
/// for a match.  If this list is empty, no predicate is involved.
std::vector<TreePredicateCall> PredicateCalls;

/// TransformFn - The transformation function to execute on this node before
/// it can be substituted into the resulting instruction on a pattern match.
Record *TransformFn;

std::vector<TreePatternNodePtr> Children;

660public:
TreePatternNode(Record *Op, std::vector<TreePatternNodePtr> Ch,
                unsigned NumResults)
    : Operator(Op), Val(nullptr), TransformFn(nullptr),
      Children(std::move(Ch)) {
  Types.resize(NumResults);
  ResultPerm.resize(NumResults);
  std::iota(ResultPerm.begin(), ResultPerm.end(), 0);
}
TreePatternNode(Init *val, unsigned NumResults)    // leaf ctor
  : Operator(nullptr), Val(val), TransformFn(nullptr) {
  Types.resize(NumResults);
  ResultPerm.resize(NumResults);
  std::iota(ResultPerm.begin(), ResultPerm.end(), 0);
}

bool hasName() const { return !Name.empty(); }
const std::string &getName() const { return Name; }
void setName(StringRef N) { Name.assign(N.begin(), N.end()); }

const std::vector<ScopedName> &getNamesAsPredicateArg() const {
  return NamesAsPredicateArg;
}
void setNamesAsPredicateArg(const std::vector<ScopedName>& Names) {
  NamesAsPredicateArg = Names;
}
void addNameAsPredicateArg(const ScopedName &N) {
  NamesAsPredicateArg.push_back(N);
}

bool isLeaf() const { return Val != nullptr; }

// Type accessors.
unsigned getNumTypes() const { return Types.size(); }
ValueTypeByHwMode getType(unsigned ResNo) const {
  return Types[ResNo].getValueTypeByHwMode();
}
const std::vector<TypeSetByHwMode> &getExtTypes() const { return Types; }
const TypeSetByHwMode &getExtType(unsigned ResNo) const {
  return Types[ResNo];
}
TypeSetByHwMode &getExtType(unsigned ResNo) { return Types[ResNo]; }
void setType(unsigned ResNo, const TypeSetByHwMode &T) { Types[ResNo] = T; }
MVT::SimpleValueType getSimpleType(unsigned ResNo) const {
  return Types[ResNo].getMachineValueType().SimpleTy;
}

bool hasConcreteType(unsigned ResNo) const {
  return Types[ResNo].isValueTypeByHwMode(false);
}
bool isTypeCompletelyUnknown(unsigned ResNo, TreePattern &TP) const {
  return Types[ResNo].empty();
}

unsigned getNumResults() const { return ResultPerm.size(); }
unsigned getResultIndex(unsigned ResNo) const { return ResultPerm[ResNo]; }
void setResultIndex(unsigned ResNo, unsigned RI) { ResultPerm[ResNo] = RI; }

Init *getLeafValue() const { assert(isLeaf())(static_cast<void> (0)); return Val; }
Record *getOperator() const { assert(!isLeaf())(static_cast<void> (0)); return Operator; }

unsigned getNumChildren() const { return Children.size(); }
TreePatternNode *getChild(unsigned N) const { return Children[N].get(); }
const TreePatternNodePtr &getChildShared(unsigned N) const {
  return Children[N];
}
void setChild(unsigned i, TreePatternNodePtr N) { Children[i] = N; }

/// hasChild - Return true if N is any of our children.
bool hasChild(const TreePatternNode *N) const {
  for (unsigned i = 0, e = Children.size(); i != e; ++i)
    if (Children[i].get() == N)
      return true;
  return false;
}

bool hasProperTypeByHwMode() const;
bool hasPossibleType() const;
bool setDefaultMode(unsigned Mode);

bool hasAnyPredicate() const { return !PredicateCalls.empty(); }

const std::vector<TreePredicateCall> &getPredicateCalls() const {
  return PredicateCalls;
}
void clearPredicateCalls() { PredicateCalls.clear(); }
void setPredicateCalls(const std::vector<TreePredicateCall> &Calls) {
  assert(PredicateCalls.empty() && "Overwriting non-empty predicate list!")(static_cast<void> (0));
  PredicateCalls = Calls;
}
void addPredicateCall(const TreePredicateCall &Call) {
  assert(!Call.Fn.isAlwaysTrue() && "Empty predicate string!")(static_cast<void> (0));
  assert(!is_contained(PredicateCalls, Call) && "predicate applied recursively")(static_cast<void> (0));
  PredicateCalls.push_back(Call);
}
void addPredicateCall(const TreePredicateFn &Fn, unsigned Scope) {
  assert((Scope != 0) == Fn.usesOperands())(static_cast<void> (0));
  addPredicateCall(TreePredicateCall(Fn, Scope));
}

Record *getTransformFn() const { return TransformFn; }
void setTransformFn(Record *Fn) { TransformFn = Fn; }

/// getIntrinsicInfo - If this node corresponds to an intrinsic, return the
/// CodeGenIntrinsic information for it, otherwise return a null pointer.
const CodeGenIntrinsic *getIntrinsicInfo(const CodeGenDAGPatterns &CDP) const;

/// getComplexPatternInfo - If this node corresponds to a ComplexPattern,
/// return the ComplexPattern information, otherwise return null.
const ComplexPattern *
getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const;

/// Returns the number of MachineInstr operands that would be produced by this
/// node if it mapped directly to an output Instruction's
/// operand. ComplexPattern specifies this explicitly; MIOperandInfo gives it
/// for Operands; otherwise 1.
unsigned getNumMIResults(const CodeGenDAGPatterns &CGP) const;

/// NodeHasProperty - Return true if this node has the specified property.
bool NodeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;

/// TreeHasProperty - Return true if any node in this tree has the specified
/// property.
bool TreeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;

/// isCommutativeIntrinsic - Return true if the node is an intrinsic which is
/// marked isCommutative.
bool isCommutativeIntrinsic(const CodeGenDAGPatterns &CDP) const;

void print(raw_ostream &OS) const;
void dump() const;

792public:   // Higher level manipulation routines.

/// clone - Return a new copy of this tree.
///
TreePatternNodePtr clone() const;

/// RemoveAllTypes - Recursively strip all the types of this tree.
void RemoveAllTypes();

/// isIsomorphicTo - Return true if this node is recursively isomorphic to
/// the specified node.  For this comparison, all of the state of the node
/// is considered, except for the assigned name.  Nodes with differing names
/// that are otherwise identical are considered isomorphic.
bool isIsomorphicTo(const TreePatternNode *N,
                    const MultipleUseVarSet &DepVars) const;

/// SubstituteFormalArguments - Replace the formal arguments in this tree
/// with actual values specified by ArgMap.
void
SubstituteFormalArguments(std::map<std::string, TreePatternNodePtr> &ArgMap);

/// InlinePatternFragments - If this pattern refers to any pattern
/// fragments, return the set of inlined versions (this can be more than
/// one if a PatFrags record has multiple alternatives).
void InlinePatternFragments(TreePatternNodePtr T,
                            TreePattern &TP,
                            std::vector<TreePatternNodePtr> &OutAlternatives);

/// ApplyTypeConstraints - Apply all of the type constraints relevant to
/// this node and its children in the tree.  This returns true if it makes a
/// change, false otherwise.  If a type contradiction is found, flag an error.
bool ApplyTypeConstraints(TreePattern &TP, bool NotRegisters);

/// UpdateNodeType - Set the node type of N to VT if VT contains
/// information.  If N already contains a conflicting type, then flag an
/// error.  This returns true if any information was updated.
///
bool UpdateNodeType(unsigned ResNo, const TypeSetByHwMode &InTy,
                    TreePattern &TP);
bool UpdateNodeType(unsigned ResNo, MVT::SimpleValueType InTy,
                    TreePattern &TP);
bool UpdateNodeType(unsigned ResNo, ValueTypeByHwMode InTy,
                    TreePattern &TP);

// Update node type with types inferred from an instruction operand or result
// def from the ins/outs lists.
// Return true if the type changed.
bool UpdateNodeTypeFromInst(unsigned ResNo, Record *Operand, TreePattern &TP);

/// ContainsUnresolvedType - Return true if this tree contains any
/// unresolved types.
bool ContainsUnresolvedType(TreePattern &TP) const;

/// canPatternMatch - If it is impossible for this pattern to match on this
/// target, fill in Reason and return false.  Otherwise, return true.
bool canPatternMatch(std::string &Reason, const CodeGenDAGPatterns &CDP);
848};

850inline raw_ostream &operator<<(raw_ostream &OS, const TreePatternNode &TPN) {
TPN.print(OS);
return OS;
853}


856/// TreePattern - Represent a pattern, used for instructions, pattern
857/// fragments, etc.
858///
859class TreePattern {
/// Trees - The list of pattern trees which corresponds to this pattern.
/// Note that PatFrag's only have a single tree.
///
std::vector<TreePatternNodePtr> Trees;

/// NamedNodes - This is all of the nodes that have names in the trees in this
/// pattern.
StringMap<SmallVector<TreePatternNode *, 1>> NamedNodes;

/// TheRecord - The actual TableGen record corresponding to this pattern.
///
Record *TheRecord;

/// Args - This is a list of all of the arguments to this pattern (for
/// PatFrag patterns), which are the 'node' markers in this pattern.
std::vector<std::string> Args;

/// CDP - the top-level object coordinating this madness.
///
CodeGenDAGPatterns &CDP;

/// isInputPattern - True if this is an input pattern, something to match.
/// False if this is an output pattern, something to emit.
bool isInputPattern;

/// hasError - True if the currently processed nodes have unresolvable types
/// or other non-fatal errors
bool HasError;

/// It's important that the usage of operands in ComplexPatterns is
/// consistent: each named operand can be defined by at most one
/// ComplexPattern. This records the ComplexPattern instance and the operand
/// number for each operand encountered in a ComplexPattern to aid in that
/// check.
StringMap<std::pair<Record *, unsigned>> ComplexPatternOperands;

TypeInfer Infer;

898public:

/// TreePattern constructor - Parse the specified DagInits into the
/// current record.
TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
            CodeGenDAGPatterns &ise);
TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
            CodeGenDAGPatterns &ise);
TreePattern(Record *TheRec, TreePatternNodePtr Pat, bool isInput,
            CodeGenDAGPatterns &ise);

/// getTrees - Return the tree patterns which corresponds to this pattern.
///
const std::vector<TreePatternNodePtr> &getTrees() const { return Trees; }
unsigned getNumTrees() const { return Trees.size(); }
const TreePatternNodePtr &getTree(unsigned i) const { return Trees[i]; }
void setTree(unsigned i, TreePatternNodePtr Tree) { Trees[i] = Tree; }
const TreePatternNodePtr &getOnlyTree() const {
  assert(Trees.size() == 1 && "Doesn't have exactly one pattern!")(static_cast<void> (0));
  return Trees[0];
}

const StringMap<SmallVector<TreePatternNode *, 1>> &getNamedNodesMap() {
  if (NamedNodes.empty())
    ComputeNamedNodes();
  return NamedNodes;
}

/// getRecord - Return the actual TableGen record corresponding to this
/// pattern.
///
Record *getRecord() const { return TheRecord; }

unsigned getNumArgs() const { return Args.size(); }
const std::string &getArgName(unsigned i) const {
  assert(i < Args.size() && "Argument reference out of range!")(static_cast<void> (0));
  return Args[i];
}
std::vector<std::string> &getArgList() { return Args; }

CodeGenDAGPatterns &getDAGPatterns() const { return CDP; }

/// InlinePatternFragments - If this pattern refers to any pattern
/// fragments, inline them into place, giving us a pattern without any
/// PatFrags references.  This may increase the number of trees in the
/// pattern if a PatFrags has multiple alternatives.
void InlinePatternFragments() {
  std::vector<TreePatternNodePtr> Copy = Trees;
  Trees.clear();
  for (unsigned i = 0, e = Copy.size(); i != e; ++i)
    Copy[i]->InlinePatternFragments(Copy[i], *this, Trees);
}

/// InferAllTypes - Infer/propagate as many types throughout the expression
/// patterns as possible.  Return true if all types are inferred, false
/// otherwise.  Bail out if a type contradiction is found.
bool InferAllTypes(
    const StringMap<SmallVector<TreePatternNode *, 1>> *NamedTypes = nullptr);

/// error - If this is the first error in the current resolution step,
/// print it and set the error flag.  Otherwise, continue silently.
void error(const Twine &Msg);
bool hasError() const {
  return HasError;
}
void resetError() {
  HasError = false;
}

TypeInfer &getInfer() { return Infer; }

void print(raw_ostream &OS) const;
void dump() const;

972private:
TreePatternNodePtr ParseTreePattern(Init *DI, StringRef OpName);
void ComputeNamedNodes();
void ComputeNamedNodes(TreePatternNode *N);
976};


979inline bool TreePatternNode::UpdateNodeType(unsigned ResNo,
                                          const TypeSetByHwMode &InTy,
                                          TreePattern &TP) {
TypeSetByHwMode VTS(InTy);
TP.getInfer().expandOverloads(VTS);
return TP.getInfer().MergeInTypeInfo(Types[ResNo], VTS);
985}

987inline bool TreePatternNode::UpdateNodeType(unsigned ResNo,
                                          MVT::SimpleValueType InTy,
                                          TreePattern &TP) {
TypeSetByHwMode VTS(InTy);
TP.getInfer().expandOverloads(VTS);
return TP.getInfer().MergeInTypeInfo(Types[ResNo], VTS);
993}

995inline bool TreePatternNode::UpdateNodeType(unsigned ResNo,
                                          ValueTypeByHwMode InTy,
                                          TreePattern &TP) {
TypeSetByHwMode VTS(InTy);
TP.getInfer().expandOverloads(VTS);
return TP.getInfer().MergeInTypeInfo(Types[ResNo], VTS);
1001}


1004/// DAGDefaultOperand - One of these is created for each OperandWithDefaultOps
1005/// that has a set ExecuteAlways / DefaultOps field.
1006struct DAGDefaultOperand {
std::vector<TreePatternNodePtr> DefaultOps;
1008};

1010class DAGInstruction {
std::vector<Record*> Results;
std::vector<Record*> Operands;
std::vector<Record*> ImpResults;
TreePatternNodePtr SrcPattern;
TreePatternNodePtr ResultPattern;

1017public:
DAGInstruction(const std::vector<Record*> &results,
               const std::vector<Record*> &operands,
               const std::vector<Record*> &impresults,
               TreePatternNodePtr srcpattern = nullptr,
               TreePatternNodePtr resultpattern = nullptr)
  : Results(results), Operands(operands), ImpResults(impresults),
    SrcPattern(srcpattern), ResultPattern(resultpattern) {}

unsigned getNumResults() const { return Results.size(); }
unsigned getNumOperands() const { return Operands.size(); }
unsigned getNumImpResults() const { return ImpResults.size(); }
const std::vector<Record*>& getImpResults() const { return ImpResults; }

Record *getResult(unsigned RN) const {
  assert(RN < Results.size())(static_cast<void> (0));
  return Results[RN];
}

Record *getOperand(unsigned ON) const {
  assert(ON < Operands.size())(static_cast<void> (0));
  return Operands[ON];
}

Record *getImpResult(unsigned RN) const {
  assert(RN < ImpResults.size())(static_cast<void> (0));
  return ImpResults[RN];
}

TreePatternNodePtr getSrcPattern() const { return SrcPattern; }
TreePatternNodePtr getResultPattern() const { return ResultPattern; }
1048};

1050/// PatternToMatch - Used by CodeGenDAGPatterns to keep tab of patterns
1051/// processed to produce isel.
1052class PatternToMatch {
Record          *SrcRecord;   // Originating Record for the pattern.
ListInit        *Predicates;  // Top level predicate conditions to match.
TreePatternNodePtr SrcPattern;      // Source pattern to match.
TreePatternNodePtr DstPattern;      // Resulting pattern.
std::vector<Record*> Dstregs; // Physical register defs being matched.
std::string      HwModeFeatures;
int              AddedComplexity; // Add to matching pattern complexity.
unsigned         ID;          // Unique ID for the record.
unsigned         ForceMode;   // Force this mode in type inference when set.

1063public:
PatternToMatch(Record *srcrecord, ListInit *preds, TreePatternNodePtr src,
               TreePatternNodePtr dst, std::vector<Record *> dstregs,
               int complexity, unsigned uid, unsigned setmode = 0,
               const Twine &hwmodefeatures = "")
    : SrcRecord(srcrecord), Predicates(preds), SrcPattern(src),
      DstPattern(dst), Dstregs(std::move(dstregs)),
      HwModeFeatures(hwmodefeatures.str()), AddedComplexity(complexity),
      ID(uid), ForceMode(setmode) {}

Record          *getSrcRecord()  const { return SrcRecord; }
ListInit        *getPredicates() const { return Predicates; }
TreePatternNode *getSrcPattern() const { return SrcPattern.get(); }
TreePatternNodePtr getSrcPatternShared() const { return SrcPattern; }
TreePatternNode *getDstPattern() const { return DstPattern.get(); }
TreePatternNodePtr getDstPatternShared() const { return DstPattern; }
const std::vector<Record*> &getDstRegs() const { return Dstregs; }
StringRef   getHwModeFeatures() const { return HwModeFeatures; }
int         getAddedComplexity() const { return AddedComplexity; }
unsigned getID() const { return ID; }
unsigned getForceMode() const { return ForceMode; }

std::string getPredicateCheck() const;
void getPredicateRecords(SmallVectorImpl<Record *> &PredicateRecs) const;

/// Compute the complexity metric for the input pattern.  This roughly
/// corresponds to the number of nodes that are covered.
int getPatternComplexity(const CodeGenDAGPatterns &CGP) const;
1091};

1093class CodeGenDAGPatterns {
RecordKeeper &Records;
CodeGenTarget Target;
CodeGenIntrinsicTable Intrinsics;

std::map<Record*, SDNodeInfo, LessRecordByID> SDNodes;
std::map<Record*, std::pair<Record*, std::string>, LessRecordByID>
    SDNodeXForms;
std::map<Record*, ComplexPattern, LessRecordByID> ComplexPatterns;
std::map<Record *, std::unique_ptr<TreePattern>, LessRecordByID>
    PatternFragments;
std::map<Record*, DAGDefaultOperand, LessRecordByID> DefaultOperands;
std::map<Record*, DAGInstruction, LessRecordByID> Instructions;

// Specific SDNode definitions:
Record *intrinsic_void_sdnode;
Record *intrinsic_w_chain_sdnode, *intrinsic_wo_chain_sdnode;

/// PatternsToMatch - All of the things we are matching on the DAG.  The first
/// value is the pattern to match, the second pattern is the result to
/// emit.
std::vector<PatternToMatch> PatternsToMatch;

TypeSetByHwMode LegalVTS;

using PatternRewriterFn = std::function<void (TreePattern *)>;
PatternRewriterFn PatternRewriter;

unsigned NumScopes = 0;

1123public:
CodeGenDAGPatterns(RecordKeeper &R,
                   PatternRewriterFn PatternRewriter = nullptr);

CodeGenTarget &getTargetInfo() { return Target; }
const CodeGenTarget &getTargetInfo() const { return Target; }
const TypeSetByHwMode &getLegalTypes() const { return LegalVTS; }

Record *getSDNodeNamed(StringRef Name) const;

const SDNodeInfo &getSDNodeInfo(Record *R) const {
  auto F = SDNodes.find(R);
  assert(F != SDNodes.end() && "Unknown node!")(static_cast<void> (0));
  return F->second;
}

// Node transformation lookups.
typedef std::pair<Record*, std::string> NodeXForm;
const NodeXForm &getSDNodeTransform(Record *R) const {
  auto F = SDNodeXForms.find(R);
  assert(F != SDNodeXForms.end() && "Invalid transform!")(static_cast<void> (0));
  return F->second;
}

const ComplexPattern &getComplexPattern(Record *R) const {
  auto F = ComplexPatterns.find(R);
  assert(F != ComplexPatterns.end() && "Unknown addressing mode!")(static_cast<void> (0));
  return F->second;
}

const CodeGenIntrinsic &getIntrinsic(Record *R) const {
  for (unsigned i = 0, e = Intrinsics.size(); i != e; ++i)
    if (Intrinsics[i].TheDef == R) return Intrinsics[i];
  llvm_unreachable("Unknown intrinsic!")__builtin_unreachable();
}

const CodeGenIntrinsic &getIntrinsicInfo(unsigned IID) const {
  if (IID-1 < Intrinsics.size())
    return Intrinsics[IID-1];
  llvm_unreachable("Bad intrinsic ID!")__builtin_unreachable();
}

unsigned getIntrinsicID(Record *R) const {
  for (unsigned i = 0, e = Intrinsics.size(); i != e; ++i)
    if (Intrinsics[i].TheDef == R) return i;
  llvm_unreachable("Unknown intrinsic!")__builtin_unreachable();
}

const DAGDefaultOperand &getDefaultOperand(Record *R) const {
  auto F = DefaultOperands.find(R);
  assert(F != DefaultOperands.end() &&"Isn't an analyzed default operand!")(static_cast<void> (0));
  return F->second;
}

// Pattern Fragment information.
TreePattern *getPatternFragment(Record *R) const {
  auto F = PatternFragments.find(R);
  assert(F != PatternFragments.end() && "Invalid pattern fragment request!")(static_cast<void> (0));
  return F->second.get();
}
TreePattern *getPatternFragmentIfRead(Record *R) const {
  auto F = PatternFragments.find(R);
  if (F == PatternFragments.end())
33
←
Calling 'operator=='→
36
←
Returning from 'operator=='→
37
←
Taking false branch→
    return nullptr;
  return F->second.get();
38
←
Returning pointer, which participates in a condition later→
}

typedef std::map<Record *, std::unique_ptr<TreePattern>,
                 LessRecordByID>::const_iterator pf_iterator;
pf_iterator pf_begin() const { return PatternFragments.begin(); }
pf_iterator pf_end() const { return PatternFragments.end(); }
iterator_range<pf_iterator> ptfs() const { return PatternFragments; }

// Patterns to match information.
typedef std::vector<PatternToMatch>::const_iterator ptm_iterator;
ptm_iterator ptm_begin() const { return PatternsToMatch.begin(); }
ptm_iterator ptm_end() const { return PatternsToMatch.end(); }
iterator_range<ptm_iterator> ptms() const { return PatternsToMatch; }

/// Parse the Pattern for an instruction, and insert the result in DAGInsts.
typedef std::map<Record*, DAGInstruction, LessRecordByID> DAGInstMap;
void parseInstructionPattern(
    CodeGenInstruction &CGI, ListInit *Pattern,
    DAGInstMap &DAGInsts);

const DAGInstruction &getInstruction(Record *R) const {
  auto F = Instructions.find(R);
  assert(F != Instructions.end() && "Unknown instruction!")(static_cast<void> (0));
  return F->second;
}

Record *get_intrinsic_void_sdnode() const {
  return intrinsic_void_sdnode;
}
Record *get_intrinsic_w_chain_sdnode() const {
  return intrinsic_w_chain_sdnode;
}
Record *get_intrinsic_wo_chain_sdnode() const {
  return intrinsic_wo_chain_sdnode;
}

unsigned allocateScope() { return ++NumScopes; }

bool operandHasDefault(Record *Op) const {
  return Op->isSubClassOf("OperandWithDefaultOps") &&
    !getDefaultOperand(Op).DefaultOps.empty();
}

1231private:
void ParseNodeInfo();
void ParseNodeTransforms();
void ParseComplexPatterns();
void ParsePatternFragments(bool OutFrags = false);
void ParseDefaultOperands();
void ParseInstructions();
void ParsePatterns();
void ExpandHwModeBasedTypes();
void InferInstructionFlags();
void GenerateVariants();
void VerifyInstructionFlags();

void ParseOnePattern(Record *TheDef,
                     TreePattern &Pattern, TreePattern &Result,
                     const std::vector<Record *> &InstImpResults);
void AddPatternToMatch(TreePattern *Pattern, PatternToMatch &&PTM);
void FindPatternInputsAndOutputs(
    TreePattern &I, TreePatternNodePtr Pat,
    std::map<std::string, TreePatternNodePtr> &InstInputs,
    MapVector<std::string, TreePatternNodePtr,
              std::map<std::string, unsigned>> &InstResults,
    std::vector<Record *> &InstImpResults);
1254};


1257inline bool SDNodeInfo::ApplyTypeConstraints(TreePatternNode *N,
                                           TreePattern &TP) const {
  bool MadeChange = false;
  for (unsigned i = 0, e = TypeConstraints.size(); i != e; ++i)
    MadeChange |= TypeConstraints[i].ApplyTypeConstraint(N, *this, TP);
  return MadeChange;
}

1265} // end namespace llvm

1267#endif

←

/usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/c++/10/bits/stl_tree.h

1// RB tree implementation -*- C++ -*-

3// Copyright (C) 2001-2020 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/*
*
* Copyright (c) 1996,1997
* Silicon Graphics Computer Systems, Inc.
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,
* provided that the above copyright notice appear in all copies and
* that both that copyright notice and this permission notice appear
* in supporting documentation.  Silicon Graphics makes no
* representations about the suitability of this software for any
* purpose.  It is provided "as is" without express or implied warranty.
*
*
* Copyright (c) 1994
* Hewlett-Packard Company
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,
* provided that the above copyright notice appear in all copies and
* that both that copyright notice and this permission notice appear
* in supporting documentation.  Hewlett-Packard Company makes no
* representations about the suitability of this software for any
* purpose.  It is provided "as is" without express or implied warranty.
*
*
*/

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

58#ifndef _STL_TREE_H1
59#define _STL_TREE_H1 1

61#pragma GCC system_header

63#include <bits/stl_algobase.h>
64#include <bits/allocator.h>
65#include <bits/stl_function.h>
66#include <bits/cpp_type_traits.h>
67#include <ext/alloc_traits.h>
68#if __cplusplus201402L >= 201103L
69# include <ext/aligned_buffer.h>
70#endif
71#if __cplusplus201402L > 201402L
72# include <bits/node_handle.h>
73#endif

75namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
76{
77_GLIBCXX_BEGIN_NAMESPACE_VERSION

79#if __cplusplus201402L > 201103L
80# define __cpp_lib_generic_associative_lookup201304 201304
81#endif

// Red-black tree class, designed for use in implementing STL
// associative containers (set, multiset, map, and multimap). The
// insertion and deletion algorithms are based on those in Cormen,
// Leiserson, and Rivest, Introduction to Algorithms (MIT Press,
// 1990), except that
//
// (1) the header cell is maintained with links not only to the root
// but also to the leftmost node of the tree, to enable constant
// time begin(), and to the rightmost node of the tree, to enable
// linear time performance when used with the generic set algorithms
// (set_union, etc.)
//
// (2) when a node being deleted has two children its successor node
// is relinked into its place, rather than copied, so that the only
// iterators invalidated are those referring to the deleted node.

enum _Rb_tree_color { _S_red = false, _S_black = true };

struct _Rb_tree_node_base
{
  typedef _Rb_tree_node_base* _Base_ptr;
  typedef const _Rb_tree_node_base* _Const_Base_ptr;

  _Rb_tree_color	_M_color;
  _Base_ptr		_M_parent;
  _Base_ptr		_M_left;
  _Base_ptr		_M_right;

  static _Base_ptr
  _S_minimum(_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
  {
    while (__x->_M_left != 0) __x = __x->_M_left;
    return __x;
  }

  static _Const_Base_ptr
  _S_minimum(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
  {
    while (__x->_M_left != 0) __x = __x->_M_left;
    return __x;
  }

  static _Base_ptr
  _S_maximum(_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
  {
    while (__x->_M_right != 0) __x = __x->_M_right;
    return __x;
  }

  static _Const_Base_ptr
  _S_maximum(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
  {
    while (__x->_M_right != 0) __x = __x->_M_right;
    return __x;
  }
};

// Helper type offering value initialization guarantee on the compare functor.
template<typename _Key_compare>
  struct _Rb_tree_key_compare
  {
    _Key_compare		_M_key_compare;

    _Rb_tree_key_compare()
    _GLIBCXX_NOEXCEPT_IF(noexcept(is_nothrow_default_constructible<_Key_compare>
::value)
is_nothrow_default_constructible<_Key_compare>::value)noexcept(is_nothrow_default_constructible<_Key_compare>
::value)
    : _M_key_compare()
    { }

    _Rb_tree_key_compare(const _Key_compare& __comp)
    : _M_key_compare(__comp)
    { }

156#if __cplusplus201402L >= 201103L
    // Copy constructor added for consistency with C++98 mode.
    _Rb_tree_key_compare(const _Rb_tree_key_compare&) = default;

    _Rb_tree_key_compare(_Rb_tree_key_compare&& __x)
noexcept(is_nothrow_copy_constructible<_Key_compare>::value)
    : _M_key_compare(__x._M_key_compare)
    { }
164#endif
  };

// Helper type to manage default initialization of node count and header.
struct _Rb_tree_header
{
  _Rb_tree_node_base	_M_header;
  size_t		_M_node_count; // Keeps track of size of tree.

  _Rb_tree_header() _GLIBCXX_NOEXCEPTnoexcept
  {
    _M_header._M_color = _S_red;
    _M_reset();
  }

179#if __cplusplus201402L >= 201103L
  _Rb_tree_header(_Rb_tree_header&& __x) noexcept
  {
    if (__x._M_header._M_parent != nullptr)
_M_move_data(__x);
    else
{
 _M_header._M_color = _S_red;
 _M_reset();
}
  }
190#endif

  void
  _M_move_data(_Rb_tree_header& __from)
  {
    _M_header._M_color = __from._M_header._M_color;
    _M_header._M_parent = __from._M_header._M_parent;
    _M_header._M_left = __from._M_header._M_left;
    _M_header._M_right = __from._M_header._M_right;
    _M_header._M_parent->_M_parent = &_M_header;
    _M_node_count = __from._M_node_count;

    __from._M_reset();
  }

  void
  _M_reset()
  {
    _M_header._M_parent = 0;
    _M_header._M_left = &_M_header;
    _M_header._M_right = &_M_header;
    _M_node_count = 0;
  }
};

template<typename _Val>
  struct _Rb_tree_node : public _Rb_tree_node_base
  {
    typedef _Rb_tree_node<_Val>* _Link_type;

220#if __cplusplus201402L < 201103L
    _Val _M_value_field;

    _Val*
    _M_valptr()
    { return std::__addressof(_M_value_field); }

    const _Val*
    _M_valptr() const
    { return std::__addressof(_M_value_field); }
230#else
    __gnu_cxx::__aligned_membuf<_Val> _M_storage;

    _Val*
    _M_valptr()
    { return _M_storage._M_ptr(); }

    const _Val*
    _M_valptr() const
    { return _M_storage._M_ptr(); }
240#endif
  };

_GLIBCXX_PURE__attribute__ ((__pure__)) _Rb_tree_node_base*
_Rb_tree_increment(_Rb_tree_node_base* __x) throw ();

_GLIBCXX_PURE__attribute__ ((__pure__)) const _Rb_tree_node_base*
_Rb_tree_increment(const _Rb_tree_node_base* __x) throw ();

_GLIBCXX_PURE__attribute__ ((__pure__)) _Rb_tree_node_base*
_Rb_tree_decrement(_Rb_tree_node_base* __x) throw ();

_GLIBCXX_PURE__attribute__ ((__pure__)) const _Rb_tree_node_base*
_Rb_tree_decrement(const _Rb_tree_node_base* __x) throw ();

template<typename _Tp>
  struct _Rb_tree_iterator
  {
    typedef _Tp  value_type;
    typedef _Tp& reference;
    typedef _Tp* pointer;

    typedef bidirectional_iterator_tag iterator_category;
    typedef ptrdiff_t			 difference_type;

    typedef _Rb_tree_iterator<_Tp>		_Self;
    typedef _Rb_tree_node_base::_Base_ptr	_Base_ptr;
    typedef _Rb_tree_node<_Tp>*		_Link_type;

    _Rb_tree_iterator() _GLIBCXX_NOEXCEPTnoexcept
    : _M_node() { }

    explicit
    _Rb_tree_iterator(_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
    : _M_node(__x) { }

    reference
    operator*() const _GLIBCXX_NOEXCEPTnoexcept
    { return *static_cast<_Link_type>(_M_node)->_M_valptr(); }

    pointer
    operator->() const _GLIBCXX_NOEXCEPTnoexcept
    { return static_cast<_Link_type> (_M_node)->_M_valptr(); }

    _Self&
    operator++() _GLIBCXX_NOEXCEPTnoexcept
    {
_M_node = _Rb_tree_increment(_M_node);
return *this;
    }

    _Self
    operator++(int) _GLIBCXX_NOEXCEPTnoexcept
    {
_Self __tmp = *this;
_M_node = _Rb_tree_increment(_M_node);
return __tmp;
    }

    _Self&
    operator--() _GLIBCXX_NOEXCEPTnoexcept
    {
_M_node = _Rb_tree_decrement(_M_node);
return *this;
    }

    _Self
    operator--(int) _GLIBCXX_NOEXCEPTnoexcept
    {
_Self __tmp = *this;
_M_node = _Rb_tree_decrement(_M_node);
return __tmp;
    }

    friend bool
    operator==(const _Self& __x, const _Self& __y) _GLIBCXX_NOEXCEPTnoexcept
    { return __x._M_node == __y._M_node; }

318#if ! __cpp_lib_three_way_comparison
    friend bool
    operator!=(const _Self& __x, const _Self& __y) _GLIBCXX_NOEXCEPTnoexcept
    { return __x._M_node != __y._M_node; }
322#endif

    _Base_ptr _M_node;
};

template<typename _Tp>
  struct _Rb_tree_const_iterator
  {
    typedef _Tp	 value_type;
    typedef const _Tp& reference;
    typedef const _Tp* pointer;

    typedef _Rb_tree_iterator<_Tp> iterator;

    typedef bidirectional_iterator_tag iterator_category;
    typedef ptrdiff_t			 difference_type;

    typedef _Rb_tree_const_iterator<_Tp>		_Self;
    typedef _Rb_tree_node_base::_Const_Base_ptr	_Base_ptr;
    typedef const _Rb_tree_node<_Tp>*			_Link_type;

    _Rb_tree_const_iterator() _GLIBCXX_NOEXCEPTnoexcept
    : _M_node() { }

    explicit
    _Rb_tree_const_iterator(_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
    : _M_node(__x) { }

    _Rb_tree_const_iterator(const iterator& __it) _GLIBCXX_NOEXCEPTnoexcept
    : _M_node(__it._M_node) { }

    iterator
    _M_const_cast() const _GLIBCXX_NOEXCEPTnoexcept
    { return iterator(const_cast<typename iterator::_Base_ptr>(_M_node)); }

    reference
    operator*() const _GLIBCXX_NOEXCEPTnoexcept
    { return *static_cast<_Link_type>(_M_node)->_M_valptr(); }

    pointer
    operator->() const _GLIBCXX_NOEXCEPTnoexcept
    { return static_cast<_Link_type>(_M_node)->_M_valptr(); }

    _Self&
    operator++() _GLIBCXX_NOEXCEPTnoexcept
    {
_M_node = _Rb_tree_increment(_M_node);
return *this;
    }

    _Self
    operator++(int) _GLIBCXX_NOEXCEPTnoexcept
    {
_Self __tmp = *this;
_M_node = _Rb_tree_increment(_M_node);
return __tmp;
    }

    _Self&
    operator--() _GLIBCXX_NOEXCEPTnoexcept
    {
_M_node = _Rb_tree_decrement(_M_node);
return *this;
    }

    _Self
    operator--(int) _GLIBCXX_NOEXCEPTnoexcept
    {
_Self __tmp = *this;
_M_node = _Rb_tree_decrement(_M_node);
return __tmp;
    }

    friend bool
    operator==(const _Self& __x, const _Self& __y) _GLIBCXX_NOEXCEPTnoexcept
    { return __x._M_node == __y._M_node; }
34
←
Assuming '__x._M_node' is not equal to '__y._M_node'→
35
←
Returning zero, which participates in a condition later→

399#if ! __cpp_lib_three_way_comparison
    friend bool
    operator!=(const _Self& __x, const _Self& __y) _GLIBCXX_NOEXCEPTnoexcept
    { return __x._M_node != __y._M_node; }
403#endif

    _Base_ptr _M_node;
  };

void
_Rb_tree_insert_and_rebalance(const bool __insert_left,
		_Rb_tree_node_base* __x,
		_Rb_tree_node_base* __p,
		_Rb_tree_node_base& __header) throw ();

_Rb_tree_node_base*
_Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
	       _Rb_tree_node_base& __header) throw ();

418#if __cplusplus201402L >= 201402L
template<typename _Cmp, typename _SfinaeType, typename = __void_t<>>
  struct __has_is_transparent
  { };

template<typename _Cmp, typename _SfinaeType>
  struct __has_is_transparent<_Cmp, _SfinaeType,
		__void_t<typename _Cmp::is_transparent>>
  { typedef void type; };

template<typename _Cmp, typename _SfinaeType>
  using __has_is_transparent_t
    = typename __has_is_transparent<_Cmp, _SfinaeType>::type;
431#endif

433#if __cplusplus201402L > 201402L
template<typename _Tree1, typename _Cmp2>
  struct _Rb_tree_merge_helper { };
436#endif

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc = allocator<_Val> >
  class _Rb_tree
  {
    typedef typename __gnu_cxx::__alloc_traits<_Alloc>::template
rebind<_Rb_tree_node<_Val> >::other _Node_allocator;

    typedef __gnu_cxx::__alloc_traits<_Node_allocator> _Alloc_traits;

  protected:
    typedef _Rb_tree_node_base* 		_Base_ptr;
    typedef const _Rb_tree_node_base* 	_Const_Base_ptr;
    typedef _Rb_tree_node<_Val>* 		_Link_type;
    typedef const _Rb_tree_node<_Val>*	_Const_Link_type;

  private:
    // Functor recycling a pool of nodes and using allocation once the pool
    // is empty.
    struct _Reuse_or_alloc_node
    {
_Reuse_or_alloc_node(_Rb_tree& __t)
: _M_root(__t._M_root()), _M_nodes(__t._M_rightmost()), _M_t(__t)
{
 if (_M_root)
   {
     _M_root->_M_parent = 0;

     if (_M_nodes->_M_left)
_M_nodes = _M_nodes->_M_left;
   }
 else
   _M_nodes = 0;
}

472#if __cplusplus201402L >= 201103L
_Reuse_or_alloc_node(const _Reuse_or_alloc_node&) = delete;
474#endif

~_Reuse_or_alloc_node()
{ _M_t._M_erase(static_cast<_Link_type>(_M_root)); }

template<typename _Arg>
 _Link_type
481#if __cplusplus201402L < 201103L
 operator()(const _Arg& __arg)
483#else
 operator()(_Arg&& __arg)
485#endif
 {
   _Link_type __node = static_cast<_Link_type>(_M_extract());
   if (__node)
     {
_M_t._M_destroy_node(__node);
_M_t._M_construct_node(__node, _GLIBCXX_FORWARD(_Arg, __arg)std::forward<_Arg>(__arg));
return __node;
     }

   return _M_t._M_create_node(_GLIBCXX_FORWARD(_Arg, __arg)std::forward<_Arg>(__arg));
 }

    private:
_Base_ptr
_M_extract()
{
 if (!_M_nodes)
   return _M_nodes;

 _Base_ptr __node = _M_nodes;
 _M_nodes = _M_nodes->_M_parent;
 if (_M_nodes)
   {
     if (_M_nodes->_M_right == __node)
{
  _M_nodes->_M_right = 0;

  if (_M_nodes->_M_left)
    {
      _M_nodes = _M_nodes->_M_left;

      while (_M_nodes->_M_right)
	_M_nodes = _M_nodes->_M_right;

      if (_M_nodes->_M_left)
	_M_nodes = _M_nodes->_M_left;
    }
}
     else // __node is on the left.
_M_nodes->_M_left = 0;
   }
 else
   _M_root = 0;

 return __node;
}

_Base_ptr _M_root;
_Base_ptr _M_nodes;
_Rb_tree& _M_t;
    };

    // Functor similar to the previous one but without any pool of nodes to
    // recycle.
    struct _Alloc_node
    {
_Alloc_node(_Rb_tree& __t)
: _M_t(__t) { }

template<typename _Arg>
 _Link_type
547#if __cplusplus201402L < 201103L
 operator()(const _Arg& __arg) const
549#else
 operator()(_Arg&& __arg) const
551#endif
 { return _M_t._M_create_node(_GLIBCXX_FORWARD(_Arg, __arg)std::forward<_Arg>(__arg)); }

    private:
_Rb_tree& _M_t;
    };

  public:
    typedef _Key 				key_type;
    typedef _Val 				value_type;
    typedef value_type* 			pointer;
    typedef const value_type* 		const_pointer;
    typedef value_type& 			reference;
    typedef const value_type& 		const_reference;
    typedef size_t 				size_type;
    typedef ptrdiff_t 			difference_type;
    typedef _Alloc 				allocator_type;

    _Node_allocator&
    _M_get_Node_allocator() _GLIBCXX_NOEXCEPTnoexcept
    { return this->_M_impl; }

    const _Node_allocator&
    _M_get_Node_allocator() const _GLIBCXX_NOEXCEPTnoexcept
    { return this->_M_impl; }

    allocator_type
    get_allocator() const _GLIBCXX_NOEXCEPTnoexcept
    { return allocator_type(_M_get_Node_allocator()); }

  protected:
    _Link_type
    _M_get_node()
    { return _Alloc_traits::allocate(_M_get_Node_allocator(), 1); }

    void
    _M_put_node(_Link_type __p) _GLIBCXX_NOEXCEPTnoexcept
    { _Alloc_traits::deallocate(_M_get_Node_allocator(), __p, 1); }

590#if __cplusplus201402L < 201103L
    void
    _M_construct_node(_Link_type __node, const value_type& __x)
    {
__tryif (true)
 { get_allocator().construct(__node->_M_valptr(), __x); }
__catch(...)if (false)
 {
   _M_put_node(__node);
   __throw_exception_again;
 }
    }

    _Link_type
    _M_create_node(const value_type& __x)
    {
_Link_type __tmp = _M_get_node();
_M_construct_node(__tmp, __x);
return __tmp;
    }
610#else
    template<typename... _Args>
void
_M_construct_node(_Link_type __node, _Args&&... __args)
{
 __tryif (true)
   {
     ::new(__node) _Rb_tree_node<_Val>;
     _Alloc_traits::construct(_M_get_Node_allocator(),
		       __node->_M_valptr(),
		       std::forward<_Args>(__args)...);
   }
 __catch(...)if (false)
   {
     __node->~_Rb_tree_node<_Val>();
     _M_put_node(__node);
     __throw_exception_again;
   }
}

    template<typename... _Args>
_Link_type
_M_create_node(_Args&&... __args)
{
 _Link_type __tmp = _M_get_node();
 _M_construct_node(__tmp, std::forward<_Args>(__args)...);
 return __tmp;
}
638#endif

    void
    _M_destroy_node(_Link_type __p) _GLIBCXX_NOEXCEPTnoexcept
    {
643#if __cplusplus201402L < 201103L
get_allocator().destroy(__p->_M_valptr());
645#else
_Alloc_traits::destroy(_M_get_Node_allocator(), __p->_M_valptr());
__p->~_Rb_tree_node<_Val>();
648#endif
    }

    void
    _M_drop_node(_Link_type __p) _GLIBCXX_NOEXCEPTnoexcept
    {
_M_destroy_node(__p);
_M_put_node(__p);
    }

    template<typename _NodeGen>
_Link_type
_M_clone_node(_Const_Link_type __x, _NodeGen& __node_gen)
{
 _Link_type __tmp = __node_gen(*__x->_M_valptr());
 __tmp->_M_color = __x->_M_color;
 __tmp->_M_left = 0;
 __tmp->_M_right = 0;
 return __tmp;
}

  protected:
670#if _GLIBCXX_INLINE_VERSION0
    template<typename _Key_compare>
672#else
    // Unused _Is_pod_comparator is kept as it is part of mangled name.
    template<typename _Key_compare,
      bool /* _Is_pod_comparator */ = __is_pod(_Key_compare)>
676#endif
struct _Rb_tree_impl
: public _Node_allocator
, public _Rb_tree_key_compare<_Key_compare>
, public _Rb_tree_header
{
 typedef _Rb_tree_key_compare<_Key_compare> _Base_key_compare;

 _Rb_tree_impl()
   _GLIBCXX_NOEXCEPT_IF(noexcept(is_nothrow_default_constructible<_Node_allocator>
::value && is_nothrow_default_constructible<_Base_key_compare
>::value)
is_nothrow_default_constructible<_Node_allocator>::valuenoexcept(is_nothrow_default_constructible<_Node_allocator>
::value && is_nothrow_default_constructible<_Base_key_compare
>::value)
&& is_nothrow_default_constructible<_Base_key_compare>::value )noexcept(is_nothrow_default_constructible<_Node_allocator>
::value && is_nothrow_default_constructible<_Base_key_compare
>::value)
 : _Node_allocator()
 { }

 _Rb_tree_impl(const _Rb_tree_impl& __x)
 : _Node_allocator(_Alloc_traits::_S_select_on_copy(__x))
 , _Base_key_compare(__x._M_key_compare)
 { }

696#if __cplusplus201402L < 201103L
 _Rb_tree_impl(const _Key_compare& __comp, const _Node_allocator& __a)
 : _Node_allocator(__a), _Base_key_compare(__comp)
 { }
700#else
 _Rb_tree_impl(_Rb_tree_impl&&) = default;

 explicit
 _Rb_tree_impl(_Node_allocator&& __a)
 : _Node_allocator(std::move(__a))
 { }

 _Rb_tree_impl(_Rb_tree_impl&& __x, _Node_allocator&& __a)
 : _Node_allocator(std::move(__a)),
   _Base_key_compare(std::move(__x)),
   _Rb_tree_header(std::move(__x))
 { }

 _Rb_tree_impl(const _Key_compare& __comp, _Node_allocator&& __a)
 : _Node_allocator(std::move(__a)), _Base_key_compare(__comp)
 { }
717#endif
};

    _Rb_tree_impl<_Compare> _M_impl;

  protected:
    _Base_ptr&
    _M_root() _GLIBCXX_NOEXCEPTnoexcept
    { return this->_M_impl._M_header._M_parent; }

    _Const_Base_ptr
    _M_root() const _GLIBCXX_NOEXCEPTnoexcept
    { return this->_M_impl._M_header._M_parent; }

    _Base_ptr&
    _M_leftmost() _GLIBCXX_NOEXCEPTnoexcept
    { return this->_M_impl._M_header._M_left; }

    _Const_Base_ptr
    _M_leftmost() const _GLIBCXX_NOEXCEPTnoexcept
    { return this->_M_impl._M_header._M_left; }

    _Base_ptr&
    _M_rightmost() _GLIBCXX_NOEXCEPTnoexcept
    { return this->_M_impl._M_header._M_right; }

    _Const_Base_ptr
    _M_rightmost() const _GLIBCXX_NOEXCEPTnoexcept
    { return this->_M_impl._M_header._M_right; }

    _Link_type
    _M_begin() _GLIBCXX_NOEXCEPTnoexcept
    { return static_cast<_Link_type>(this->_M_impl._M_header._M_parent); }

    _Const_Link_type
    _M_begin() const _GLIBCXX_NOEXCEPTnoexcept
    {
return static_cast<_Const_Link_type>
 (this->_M_impl._M_header._M_parent);
    }

    _Base_ptr
    _M_end() _GLIBCXX_NOEXCEPTnoexcept
    { return &this->_M_impl._M_header; }

    _Const_Base_ptr
    _M_end() const _GLIBCXX_NOEXCEPTnoexcept
    { return &this->_M_impl._M_header; }

    static const _Key&
    _S_key(_Const_Link_type __x)
    {
769#if __cplusplus201402L >= 201103L
// If we're asking for the key we're presumably using the comparison
// object, and so this is a good place to sanity check it.
static_assert(__is_invocable<_Compare&, const _Key&, const _Key&>{},
      "comparison object must be invocable "
      "with two arguments of key type");
775# if __cplusplus201402L >= 201703L
// _GLIBCXX_RESOLVE_LIB_DEFECTS
// 2542. Missing const requirements for associative containers
if constexpr (__is_invocable<_Compare&, const _Key&, const _Key&>{})
 static_assert(
     is_invocable_v<const _Compare&, const _Key&, const _Key&>,
     "comparison object must be invocable as const");
782# endif // C++17
783#endif // C++11

return _KeyOfValue()(*__x->_M_valptr());
    }

    static _Link_type
    _S_left(_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
    { return static_cast<_Link_type>(__x->_M_left); }

    static _Const_Link_type
    _S_left(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
    { return static_cast<_Const_Link_type>(__x->_M_left); }

    static _Link_type
    _S_right(_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
    { return static_cast<_Link_type>(__x->_M_right); }

    static _Const_Link_type
    _S_right(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
    { return static_cast<_Const_Link_type>(__x->_M_right); }

    static const _Key&
    _S_key(_Const_Base_ptr __x)
    { return _S_key(static_cast<_Const_Link_type>(__x)); }

    static _Base_ptr
    _S_minimum(_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
    { return _Rb_tree_node_base::_S_minimum(__x); }

    static _Const_Base_ptr
    _S_minimum(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
    { return _Rb_tree_node_base::_S_minimum(__x); }

    static _Base_ptr
    _S_maximum(_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
    { return _Rb_tree_node_base::_S_maximum(__x); }

    static _Const_Base_ptr
    _S_maximum(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPTnoexcept
    { return _Rb_tree_node_base::_S_maximum(__x); }

  public:
    typedef _Rb_tree_iterator<value_type>       iterator;
    typedef _Rb_tree_const_iterator<value_type> const_iterator;

    typedef std::reverse_iterator<iterator>       reverse_iterator;
    typedef std::reverse_iterator<const_iterator> const_reverse_iterator;

831#if __cplusplus201402L > 201402L
    using node_type = _Node_handle<_Key, _Val, _Node_allocator>;
    using insert_return_type = _Node_insert_return<
conditional_t<is_same_v<_Key, _Val>, const_iterator, iterator>,
node_type>;
836#endif

    pair<_Base_ptr, _Base_ptr>
    _M_get_insert_unique_pos(const key_type& __k);

    pair<_Base_ptr, _Base_ptr>
    _M_get_insert_equal_pos(const key_type& __k);

    pair<_Base_ptr, _Base_ptr>
    _M_get_insert_hint_unique_pos(const_iterator __pos,
		    const key_type& __k);

    pair<_Base_ptr, _Base_ptr>
    _M_get_insert_hint_equal_pos(const_iterator __pos,
		   const key_type& __k);

  private:
853#if __cplusplus201402L >= 201103L
    template<typename _Arg, typename _NodeGen>
iterator
_M_insert_(_Base_ptr __x, _Base_ptr __y, _Arg&& __v, _NodeGen&);

    iterator
    _M_insert_node(_Base_ptr __x, _Base_ptr __y, _Link_type __z);

    template<typename _Arg>
iterator
_M_insert_lower(_Base_ptr __y, _Arg&& __v);

    template<typename _Arg>
iterator
_M_insert_equal_lower(_Arg&& __x);

    iterator
    _M_insert_lower_node(_Base_ptr __p, _Link_type __z);

    iterator
    _M_insert_equal_lower_node(_Link_type __z);
874#else
    template<typename _NodeGen>
iterator
_M_insert_(_Base_ptr __x, _Base_ptr __y,
   const value_type& __v, _NodeGen&);

    // _GLIBCXX_RESOLVE_LIB_DEFECTS
    // 233. Insertion hints in associative containers.
    iterator
    _M_insert_lower(_Base_ptr __y, const value_type& __v);

    iterator
    _M_insert_equal_lower(const value_type& __x);
887#endif

    template<typename _NodeGen>
_Link_type
_M_copy(_Const_Link_type __x, _Base_ptr __p, _NodeGen&);

    template<typename _NodeGen>
_Link_type
_M_copy(const _Rb_tree& __x, _NodeGen& __gen)
{
 _Link_type __root = _M_copy(__x._M_begin(), _M_end(), __gen);
 _M_leftmost() = _S_minimum(__root);
 _M_rightmost() = _S_maximum(__root);
 _M_impl._M_node_count = __x._M_impl._M_node_count;
 return __root;
}

    _Link_type
    _M_copy(const _Rb_tree& __x)
    {
_Alloc_node __an(*this);
return _M_copy(__x, __an);
    }

    void
    _M_erase(_Link_type __x);

    iterator
    _M_lower_bound(_Link_type __x, _Base_ptr __y,
     const _Key& __k);

    const_iterator
    _M_lower_bound(_Const_Link_type __x, _Const_Base_ptr __y,
     const _Key& __k) const;

    iterator
    _M_upper_bound(_Link_type __x, _Base_ptr __y,
     const _Key& __k);

    const_iterator
    _M_upper_bound(_Const_Link_type __x, _Const_Base_ptr __y,
     const _Key& __k) const;

  public:
    // allocation/deallocation
932#if __cplusplus201402L < 201103L
    _Rb_tree() { }
934#else
    _Rb_tree() = default;
936#endif

    _Rb_tree(const _Compare& __comp,
      const allocator_type& __a = allocator_type())
    : _M_impl(__comp, _Node_allocator(__a)) { }

    _Rb_tree(const _Rb_tree& __x)
    : _M_impl(__x._M_impl)
    {
if (__x._M_root() != 0)
 _M_root() = _M_copy(__x);
    }

949#if __cplusplus201402L >= 201103L
    _Rb_tree(const allocator_type& __a)
    : _M_impl(_Node_allocator(__a))
    { }

    _Rb_tree(const _Rb_tree& __x, const allocator_type& __a)
    : _M_impl(__x._M_impl._M_key_compare, _Node_allocator(__a))
    {
if (__x._M_root() != nullptr)
 _M_root() = _M_copy(__x);
    }

    _Rb_tree(_Rb_tree&&) = default;

    _Rb_tree(_Rb_tree&& __x, const allocator_type& __a)
    : _Rb_tree(std::move(__x), _Node_allocator(__a))
    { }

  private:
    _Rb_tree(_Rb_tree&& __x, _Node_allocator&& __a, true_type)
    noexcept(is_nothrow_default_constructible<_Compare>::value)
    : _M_impl(std::move(__x._M_impl), std::move(__a))
    { }

    _Rb_tree(_Rb_tree&& __x, _Node_allocator&& __a, false_type)
    : _M_impl(__x._M_impl._M_key_compare, std::move(__a))
    {
if (__x._M_root() != nullptr)
 _M_move_data(__x, false_type{});
    }

  public:
    _Rb_tree(_Rb_tree&& __x, _Node_allocator&& __a)
    noexcept( noexcept(
_Rb_tree(std::declval<_Rb_tree&&>(), std::declval<_Node_allocator&&>(),
 std::declval<typename _Alloc_traits::is_always_equal>())) )
    : _Rb_tree(std::move(__x), std::move(__a),
 typename _Alloc_traits::is_always_equal{})
    { }
988#endif

    ~_Rb_tree() _GLIBCXX_NOEXCEPTnoexcept
    { _M_erase(_M_begin()); }

    _Rb_tree&
    operator=(const _Rb_tree& __x);

    // Accessors.
    _Compare
    key_comp() const
    { return _M_impl._M_key_compare; }

    iterator
    begin() _GLIBCXX_NOEXCEPTnoexcept
    { return iterator(this->_M_impl._M_header._M_left); }

    const_iterator
    begin() const _GLIBCXX_NOEXCEPTnoexcept
    { return const_iterator(this->_M_impl._M_header._M_left); }

    iterator
    end() _GLIBCXX_NOEXCEPTnoexcept
    { return iterator(&this->_M_impl._M_header); }

    const_iterator
    end() const _GLIBCXX_NOEXCEPTnoexcept
    { return const_iterator(&this->_M_impl._M_header); }

    reverse_iterator
    rbegin() _GLIBCXX_NOEXCEPTnoexcept
    { return reverse_iterator(end()); }

    const_reverse_iterator
    rbegin() const _GLIBCXX_NOEXCEPTnoexcept
    { return const_reverse_iterator(end()); }

    reverse_iterator
    rend() _GLIBCXX_NOEXCEPTnoexcept
    { return reverse_iterator(begin()); }

    const_reverse_iterator
    rend() const _GLIBCXX_NOEXCEPTnoexcept
    { return const_reverse_iterator(begin()); }

    _GLIBCXX_NODISCARD bool
    empty() const _GLIBCXX_NOEXCEPTnoexcept
    { return _M_impl._M_node_count == 0; }

    size_type
    size() const _GLIBCXX_NOEXCEPTnoexcept
    { return _M_impl._M_node_count; }

    size_type
    max_size() const _GLIBCXX_NOEXCEPTnoexcept
    { return _Alloc_traits::max_size(_M_get_Node_allocator()); }

    void
    swap(_Rb_tree& __t)
    _GLIBCXX_NOEXCEPT_IF(__is_nothrow_swappable<_Compare>::value)noexcept(__is_nothrow_swappable<_Compare>::value);

    // Insert/erase.
1050#if __cplusplus201402L >= 201103L
    template<typename _Arg>
pair<iterator, bool>
_M_insert_unique(_Arg&& __x);

    template<typename _Arg>
iterator
_M_insert_equal(_Arg&& __x);

    template<typename _Arg, typename _NodeGen>
iterator
_M_insert_unique_(const_iterator __pos, _Arg&& __x, _NodeGen&);

    template<typename _Arg>
iterator
_M_insert_unique_(const_iterator __pos, _Arg&& __x)
{
 _Alloc_node __an(*this);
 return _M_insert_unique_(__pos, std::forward<_Arg>(__x), __an);
}

    template<typename _Arg, typename _NodeGen>
iterator
_M_insert_equal_(const_iterator __pos, _Arg&& __x, _NodeGen&);

    template<typename _Arg>
iterator
_M_insert_equal_(const_iterator __pos, _Arg&& __x)
{
 _Alloc_node __an(*this);
 return _M_insert_equal_(__pos, std::forward<_Arg>(__x), __an);
}

    template<typename... _Args>
pair<iterator, bool>
_M_emplace_unique(_Args&&... __args);

    template<typename... _Args>
iterator
_M_emplace_equal(_Args&&... __args);

    template<typename... _Args>
iterator
_M_emplace_hint_unique(const_iterator __pos, _Args&&... __args);

    template<typename... _Args>
iterator
_M_emplace_hint_equal(const_iterator __pos, _Args&&... __args);

    template<typename _Iter>
using __same_value_type
 = is_same<value_type, typename iterator_traits<_Iter>::value_type>;

    template<typename _InputIterator>
__enable_if_t<__same_value_type<_InputIterator>::value>
_M_insert_range_unique(_InputIterator __first, _InputIterator __last)
{
 _Alloc_node __an(*this);
 for (; __first != __last; ++__first)
   _M_insert_unique_(end(), *__first, __an);
}

    template<typename _InputIterator>
__enable_if_t<!__same_value_type<_InputIterator>::value>
_M_insert_range_unique(_InputIterator __first, _InputIterator __last)
{
 for (; __first != __last; ++__first)
   _M_emplace_unique(*__first);
}

    template<typename _InputIterator>
__enable_if_t<__same_value_type<_InputIterator>::value>
_M_insert_range_equal(_InputIterator __first, _InputIterator __last)
{
 _Alloc_node __an(*this);
 for (; __first != __last; ++__first)
   _M_insert_equal_(end(), *__first, __an);
}

    template<typename _InputIterator>
__enable_if_t<!__same_value_type<_InputIterator>::value>
_M_insert_range_equal(_InputIterator __first, _InputIterator __last)
{
 _Alloc_node __an(*this);
 for (; __first != __last; ++__first)
   _M_emplace_equal(*__first);
}
1137#else
    pair<iterator, bool>
    _M_insert_unique(const value_type& __x);

    iterator
    _M_insert_equal(const value_type& __x);

    template<typename _NodeGen>
iterator
_M_insert_unique_(const_iterator __pos, const value_type& __x,
	  _NodeGen&);

    iterator
    _M_insert_unique_(const_iterator __pos, const value_type& __x)
    {
_Alloc_node __an(*this);
return _M_insert_unique_(__pos, __x, __an);
    }

    template<typename _NodeGen>
iterator
_M_insert_equal_(const_iterator __pos, const value_type& __x,
	 _NodeGen&);
    iterator
    _M_insert_equal_(const_iterator __pos, const value_type& __x)
    {
_Alloc_node __an(*this);
return _M_insert_equal_(__pos, __x, __an);
    }

    template<typename _InputIterator>
void
_M_insert_range_unique(_InputIterator __first, _InputIterator __last)
{
 _Alloc_node __an(*this);
 for (; __first != __last; ++__first)
   _M_insert_unique_(end(), *__first, __an);
}

    template<typename _InputIterator>
void
_M_insert_range_equal(_InputIterator __first, _InputIterator __last)
{
 _Alloc_node __an(*this);
 for (; __first != __last; ++__first)
   _M_insert_equal_(end(), *__first, __an);
}
1184#endif

  private:
    void
    _M_erase_aux(const_iterator __position);

    void
    _M_erase_aux(const_iterator __first, const_iterator __last);

  public:
1194#if __cplusplus201402L >= 201103L
    // _GLIBCXX_RESOLVE_LIB_DEFECTS
    // DR 130. Associative erase should return an iterator.
    _GLIBCXX_ABI_TAG_CXX11__attribute ((__abi_tag__ ("cxx11")))
    iterator
    erase(const_iterator __position)
    {
__glibcxx_assert(__position != end());
const_iterator __result = __position;
++__result;
_M_erase_aux(__position);
return __result._M_const_cast();
    }

    // LWG 2059.
    _GLIBCXX_ABI_TAG_CXX11__attribute ((__abi_tag__ ("cxx11")))
    iterator
    erase(iterator __position)
    {
__glibcxx_assert(__position != end());
iterator __result = __position;
++__result;
_M_erase_aux(__position);
return __result;
    }
1219#else
    void
    erase(iterator __position)
    {
__glibcxx_assert(__position != end());
_M_erase_aux(__position);
    }

    void
    erase(const_iterator __position)
    {
__glibcxx_assert(__position != end());
_M_erase_aux(__position);
    }
1233#endif

    size_type
    erase(const key_type& __x);

1238#if __cplusplus201402L >= 201103L
    // _GLIBCXX_RESOLVE_LIB_DEFECTS
    // DR 130. Associative erase should return an iterator.
    _GLIBCXX_ABI_TAG_CXX11__attribute ((__abi_tag__ ("cxx11")))
    iterator
    erase(const_iterator __first, const_iterator __last)
    {
_M_erase_aux(__first, __last);
return __last._M_const_cast();
    }
1248#else
    void
    erase(iterator __first, iterator __last)
    { _M_erase_aux(__first, __last); }

    void
    erase(const_iterator __first, const_iterator __last)
    { _M_erase_aux(__first, __last); }
1256#endif

    void
    clear() _GLIBCXX_NOEXCEPTnoexcept
    {
_M_erase(_M_begin());
_M_impl._M_reset();
    }

    // Set operations.
    iterator
    find(const key_type& __k);

    const_iterator
    find(const key_type& __k) const;

    size_type
    count(const key_type& __k) const;

    iterator
    lower_bound(const key_type& __k)
    { return _M_lower_bound(_M_begin(), _M_end(), __k); }

    const_iterator
    lower_bound(const key_type& __k) const
    { return _M_lower_bound(_M_begin(), _M_end(), __k); }

    iterator
    upper_bound(const key_type& __k)
    { return _M_upper_bound(_M_begin(), _M_end(), __k); }

    const_iterator
    upper_bound(const key_type& __k) const
    { return _M_upper_bound(_M_begin(), _M_end(), __k); }

    pair<iterator, iterator>
    equal_range(const key_type& __k);

    pair<const_iterator, const_iterator>
    equal_range(const key_type& __k) const;

1297#if __cplusplus201402L >= 201402L
    template<typename _Kt,
      typename _Req = __has_is_transparent_t<_Compare, _Kt>>
iterator
_M_find_tr(const _Kt& __k)
{
 const _Rb_tree* __const_this = this;
 return __const_this->_M_find_tr(__k)._M_const_cast();
}

    template<typename _Kt,
      typename _Req = __has_is_transparent_t<_Compare, _Kt>>
const_iterator
_M_find_tr(const _Kt& __k) const
{
 auto __j = _M_lower_bound_tr(__k);
 if (__j != end() && _M_impl._M_key_compare(__k, _S_key(__j._M_node)))
   __j = end();
 return __j;
}

    template<typename _Kt,
      typename _Req = __has_is_transparent_t<_Compare, _Kt>>
size_type
_M_count_tr(const _Kt& __k) const
{
 auto __p = _M_equal_range_tr(__k);
 return std::distance(__p.first, __p.second);
}

    template<typename _Kt,
      typename _Req = __has_is_transparent_t<_Compare, _Kt>>
iterator
_M_lower_bound_tr(const _Kt& __k)
{
 const _Rb_tree* __const_this = this;
 return __const_this->_M_lower_bound_tr(__k)._M_const_cast();
}

    template<typename _Kt,
      typename _Req = __has_is_transparent_t<_Compare, _Kt>>
const_iterator
_M_lower_bound_tr(const _Kt& __k) const
{
 auto __x = _M_begin();
 auto __y = _M_end();
 while (__x != 0)
   if (!_M_impl._M_key_compare(_S_key(__x), __k))
     {
__y = __x;
__x = _S_left(__x);
     }
   else
     __x = _S_right(__x);
 return const_iterator(__y);
}

    template<typename _Kt,
      typename _Req = __has_is_transparent_t<_Compare, _Kt>>
iterator
_M_upper_bound_tr(const _Kt& __k)
{
 const _Rb_tree* __const_this = this;
 return __const_this->_M_upper_bound_tr(__k)._M_const_cast();
}

    template<typename _Kt,
      typename _Req = __has_is_transparent_t<_Compare, _Kt>>
const_iterator
_M_upper_bound_tr(const _Kt& __k) const
{
 auto __x = _M_begin();
 auto __y = _M_end();
 while (__x != 0)
   if (_M_impl._M_key_compare(__k, _S_key(__x)))
     {
__y = __x;
__x = _S_left(__x);
     }
   else
     __x = _S_right(__x);
 return const_iterator(__y);
}

    template<typename _Kt,
      typename _Req = __has_is_transparent_t<_Compare, _Kt>>
pair<iterator, iterator>
_M_equal_range_tr(const _Kt& __k)
{
 const _Rb_tree* __const_this = this;
 auto __ret = __const_this->_M_equal_range_tr(__k);
 return { __ret.first._M_const_cast(), __ret.second._M_const_cast() };
}

    template<typename _Kt,
      typename _Req = __has_is_transparent_t<_Compare, _Kt>>
pair<const_iterator, const_iterator>
_M_equal_range_tr(const _Kt& __k) const
{
 auto __low = _M_lower_bound_tr(__k);
 auto __high = __low;
 auto& __cmp = _M_impl._M_key_compare;
 while (__high != end() && !__cmp(__k, _S_key(__high._M_node)))
   ++__high;
 return { __low, __high };
}
1403#endif

    // Debugging.
    bool
    __rb_verify() const;

1409#if __cplusplus201402L >= 201103L
    _Rb_tree&
    operator=(_Rb_tree&&)
    noexcept(_Alloc_traits::_S_nothrow_move()
      && is_nothrow_move_assignable<_Compare>::value);

    template<typename _Iterator>
void
_M_assign_unique(_Iterator, _Iterator);

    template<typename _Iterator>
void
_M_assign_equal(_Iterator, _Iterator);

  private:
    // Move elements from container with equal allocator.
    void
    _M_move_data(_Rb_tree& __x, true_type)
    { _M_impl._M_move_data(__x._M_impl); }

    // Move elements from container with possibly non-equal allocator,
    // which might result in a copy not a move.
    void
    _M_move_data(_Rb_tree&, false_type);

    // Move assignment from container with equal allocator.
    void
    _M_move_assign(_Rb_tree&, true_type);

    // Move assignment from container with possibly non-equal allocator,
    // which might result in a copy not a move.
    void
    _M_move_assign(_Rb_tree&, false_type);
1442#endif

1444#if __cplusplus201402L > 201402L
  public:
    /// Re-insert an extracted node.
    insert_return_type
    _M_reinsert_node_unique(node_type&& __nh)
    {
insert_return_type __ret;
if (__nh.empty())
 __ret.position = end();
else
 {
   __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);

   auto __res = _M_get_insert_unique_pos(__nh._M_key());
   if (__res.second)
     {
__ret.position
  = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
__nh._M_ptr = nullptr;
__ret.inserted = true;
     }
   else
     {
__ret.node = std::move(__nh);
__ret.position = iterator(__res.first);
__ret.inserted = false;
     }
 }
return __ret;
    }

    /// Re-insert an extracted node.
    iterator
    _M_reinsert_node_equal(node_type&& __nh)
    {
iterator __ret;
if (__nh.empty())
 __ret = end();
else
 {
   __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
   auto __res = _M_get_insert_equal_pos(__nh._M_key());
   if (__res.second)
     __ret = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
   else
     __ret = _M_insert_equal_lower_node(__nh._M_ptr);
   __nh._M_ptr = nullptr;
 }
return __ret;
    }

    /// Re-insert an extracted node.
    iterator
    _M_reinsert_node_hint_unique(const_iterator __hint, node_type&& __nh)
    {
iterator __ret;
if (__nh.empty())
 __ret = end();
else
 {
   __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
   auto __res = _M_get_insert_hint_unique_pos(__hint, __nh._M_key());
   if (__res.second)
     {
__ret = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
__nh._M_ptr = nullptr;
     }
   else
     __ret = iterator(__res.first);
 }
return __ret;
    }

    /// Re-insert an extracted node.
    iterator
    _M_reinsert_node_hint_equal(const_iterator __hint, node_type&& __nh)
    {
iterator __ret;
if (__nh.empty())
 __ret = end();
else
 {
   __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
   auto __res = _M_get_insert_hint_equal_pos(__hint, __nh._M_key());
   if (__res.second)
     __ret = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
   else
     __ret = _M_insert_equal_lower_node(__nh._M_ptr);
   __nh._M_ptr = nullptr;
 }
return __ret;
    }

    /// Extract a node.
    node_type
    extract(const_iterator __pos)
    {
auto __ptr = _Rb_tree_rebalance_for_erase(
   __pos._M_const_cast()._M_node, _M_impl._M_header);
--_M_impl._M_node_count;
return { static_cast<_Link_type>(__ptr), _M_get_Node_allocator() };
    }

    /// Extract a node.
    node_type
    extract(const key_type& __k)
    {
node_type __nh;
auto __pos = find(__k);
if (__pos != end())
 __nh = extract(const_iterator(__pos));
return __nh;
    }

    template<typename _Compare2>
using _Compatible_tree
 = _Rb_tree<_Key, _Val, _KeyOfValue, _Compare2, _Alloc>;

    template<typename, typename>
friend class _Rb_tree_merge_helper;

    /// Merge from a compatible container into one with unique keys.
    template<typename _Compare2>
void
_M_merge_unique(_Compatible_tree<_Compare2>& __src) noexcept
{
 using _Merge_helper = _Rb_tree_merge_helper<_Rb_tree, _Compare2>;
 for (auto __i = __src.begin(), __end = __src.end(); __i != __end;)
   {
     auto __pos = __i++;
     auto __res = _M_get_insert_unique_pos(_KeyOfValue()(*__pos));
     if (__res.second)
{
  auto& __src_impl = _Merge_helper::_S_get_impl(__src);
  auto __ptr = _Rb_tree_rebalance_for_erase(
      __pos._M_node, __src_impl._M_header);
  --__src_impl._M_node_count;
  _M_insert_node(__res.first, __res.second,
		 static_cast<_Link_type>(__ptr));
}
   }
}

    /// Merge from a compatible container into one with equivalent keys.
    template<typename _Compare2>
void
_M_merge_equal(_Compatible_tree<_Compare2>& __src) noexcept
{
 using _Merge_helper = _Rb_tree_merge_helper<_Rb_tree, _Compare2>;
 for (auto __i = __src.begin(), __end = __src.end(); __i != __end;)
   {
     auto __pos = __i++;
     auto __res = _M_get_insert_equal_pos(_KeyOfValue()(*__pos));
     if (__res.second)
{
  auto& __src_impl = _Merge_helper::_S_get_impl(__src);
  auto __ptr = _Rb_tree_rebalance_for_erase(
      __pos._M_node, __src_impl._M_header);
  --__src_impl._M_node_count;
  _M_insert_node(__res.first, __res.second,
		 static_cast<_Link_type>(__ptr));
}
   }
}
1608#endif // C++17

    friend bool
    operator==(const _Rb_tree& __x, const _Rb_tree& __y)
    {
return __x.size() == __y.size()
 && std::equal(__x.begin(), __x.end(), __y.begin());
    }

1617#if __cpp_lib_three_way_comparison
    friend auto
    operator<=>(const _Rb_tree& __x, const _Rb_tree& __y)
    {
if constexpr (requires { typename __detail::__synth3way_t<_Val>; })
 return std::lexicographical_compare_three_way(__x.begin(), __x.end(),
					__y.begin(), __y.end(),
					__detail::__synth3way);
    }
1626#else
    friend bool
    operator<(const _Rb_tree& __x, const _Rb_tree& __y)
    {
return std::lexicographical_compare(__x.begin(), __x.end(),
			    __y.begin(), __y.end());
    }

    friend bool _GLIBCXX_DEPRECATED__attribute__ ((__deprecated__))
    operator!=(const _Rb_tree& __x, const _Rb_tree& __y)
    { return !(__x == __y); }

    friend bool _GLIBCXX_DEPRECATED__attribute__ ((__deprecated__))
    operator>(const _Rb_tree& __x, const _Rb_tree& __y)
    { return __y < __x; }

    friend bool _GLIBCXX_DEPRECATED__attribute__ ((__deprecated__))
    operator<=(const _Rb_tree& __x, const _Rb_tree& __y)
    { return !(__y < __x); }

    friend bool _GLIBCXX_DEPRECATED__attribute__ ((__deprecated__))
    operator>=(const _Rb_tree& __x, const _Rb_tree& __y)
    { return !(__x < __y); }
1649#endif
  };

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  inline void
  swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
  { __x.swap(__y); }

1659#if __cplusplus201402L >= 201103L
template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  void
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_move_data(_Rb_tree& __x, false_type)
  {
    if (_M_get_Node_allocator() == __x._M_get_Node_allocator())
_M_move_data(__x, true_type());
    else
{
 _Alloc_node __an(*this);
 auto __lbd =
   [&__an](const value_type& __cval)
   {
     auto& __val = const_cast<value_type&>(__cval);
     return __an(std::move_if_noexcept(__val));
   };
 _M_root() = _M_copy(__x, __lbd);
}
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  inline void
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_move_assign(_Rb_tree& __x, true_type)
  {
    clear();
    if (__x._M_root() != nullptr)
_M_move_data(__x, true_type());
    std::__alloc_on_move(_M_get_Node_allocator(),
	   __x._M_get_Node_allocator());
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  void
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_move_assign(_Rb_tree& __x, false_type)
  {
    if (_M_get_Node_allocator() == __x._M_get_Node_allocator())
return _M_move_assign(__x, true_type{});

    // Try to move each node reusing existing nodes and copying __x nodes
    // structure.
    _Reuse_or_alloc_node __roan(*this);
    _M_impl._M_reset();
    if (__x._M_root() != nullptr)
{
 auto __lbd =
   [&__roan](const value_type& __cval)
   {
     auto& __val = const_cast<value_type&>(__cval);
     return __roan(std::move(__val));
   };
 _M_root() = _M_copy(__x, __lbd);
 __x.clear();
}
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  inline _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  operator=(_Rb_tree&& __x)
  noexcept(_Alloc_traits::_S_nothrow_move()
    && is_nothrow_move_assignable<_Compare>::value)
  {
    _M_impl._M_key_compare = std::move(__x._M_impl._M_key_compare);
    _M_move_assign(__x, __bool_constant<_Alloc_traits::_S_nothrow_move()>());
    return *this;
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  template<typename _Iterator>
    void
    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
    _M_assign_unique(_Iterator __first, _Iterator __last)
    {
_Reuse_or_alloc_node __roan(*this);
_M_impl._M_reset();
for (; __first != __last; ++__first)
 _M_insert_unique_(end(), *__first, __roan);
    }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  template<typename _Iterator>
    void
    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
    _M_assign_equal(_Iterator __first, _Iterator __last)
    {
_Reuse_or_alloc_node __roan(*this);
_M_impl._M_reset();
for (; __first != __last; ++__first)
 _M_insert_equal_(end(), *__first, __roan);
    }
1758#endif

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  operator=(const _Rb_tree& __x)
  {
    if (this != &__x)
{
 // Note that _Key may be a constant type.
1769#if __cplusplus201402L >= 201103L
 if (_Alloc_traits::_S_propagate_on_copy_assign())
   {
     auto& __this_alloc = this->_M_get_Node_allocator();
     auto& __that_alloc = __x._M_get_Node_allocator();
     if (!_Alloc_traits::_S_always_equal()
  && __this_alloc != __that_alloc)
{
  // Replacement allocator cannot free existing storage, we need
  // to erase nodes first.
  clear();
  std::__alloc_on_copy(__this_alloc, __that_alloc);
}
   }
1783#endif

 _Reuse_or_alloc_node __roan(*this);
 _M_impl._M_reset();
 _M_impl._M_key_compare = __x._M_impl._M_key_compare;
 if (__x._M_root() != 0)
   _M_root() = _M_copy(__x, __roan);
}

    return *this;
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
1797#if __cplusplus201402L >= 201103L
  template<typename _Arg, typename _NodeGen>
1799#else
  template<typename _NodeGen>
1801#endif
    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
    _M_insert_(_Base_ptr __x, _Base_ptr __p,
1805#if __cplusplus201402L >= 201103L
 _Arg&& __v,
1807#else
 const _Val& __v,
1809#endif
 _NodeGen& __node_gen)
    {
bool __insert_left = (__x != 0 || __p == _M_end()
	      || _M_impl._M_key_compare(_KeyOfValue()(__v),
					_S_key(__p)));

_Link_type __z = __node_gen(_GLIBCXX_FORWARD(_Arg, __v)std::forward<_Arg>(__v));

_Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
		      this->_M_impl._M_header);
++_M_impl._M_node_count;
return iterator(__z);
    }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
1826#if __cplusplus201402L >= 201103L
  template<typename _Arg>
1828#endif
  typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1831#if __cplusplus201402L >= 201103L
  _M_insert_lower(_Base_ptr __p, _Arg&& __v)
1833#else
  _M_insert_lower(_Base_ptr __p, const _Val& __v)
1835#endif
  {
    bool __insert_left = (__p == _M_end()
	    || !_M_impl._M_key_compare(_S_key(__p),
				       _KeyOfValue()(__v)));

    _Link_type __z = _M_create_node(_GLIBCXX_FORWARD(_Arg, __v)std::forward<_Arg>(__v));

    _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
		    this->_M_impl._M_header);
    ++_M_impl._M_node_count;
    return iterator(__z);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
1851#if __cplusplus201402L >= 201103L
  template<typename _Arg>
1853#endif
  typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1856#if __cplusplus201402L >= 201103L
  _M_insert_equal_lower(_Arg&& __v)
1858#else
  _M_insert_equal_lower(const _Val& __v)
1860#endif
  {
    _Link_type __x = _M_begin();
    _Base_ptr __y = _M_end();
    while (__x != 0)
{
 __y = __x;
 __x = !_M_impl._M_key_compare(_S_key(__x), _KeyOfValue()(__v)) ?
_S_left(__x) : _S_right(__x);
}
    return _M_insert_lower(__y, _GLIBCXX_FORWARD(_Arg, __v)std::forward<_Arg>(__v));
  }

template<typename _Key, typename _Val, typename _KoV,
  typename _Compare, typename _Alloc>
  template<typename _NodeGen>
    typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type
    _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::
    _M_copy(_Const_Link_type __x, _Base_ptr __p, _NodeGen& __node_gen)
    {
// Structural copy. __x and __p must be non-null.
_Link_type __top = _M_clone_node(__x, __node_gen);
__top->_M_parent = __p;

__tryif (true)
 {
   if (__x->_M_right)
     __top->_M_right = _M_copy(_S_right(__x), __top, __node_gen);
   __p = __top;
   __x = _S_left(__x);

   while (__x != 0)
     {
_Link_type __y = _M_clone_node(__x, __node_gen);
__p->_M_left = __y;
__y->_M_parent = __p;
if (__x->_M_right)
  __y->_M_right = _M_copy(_S_right(__x), __y, __node_gen);
__p = __y;
__x = _S_left(__x);
     }
 }
__catch(...)if (false)
 {
   _M_erase(__top);
   __throw_exception_again;
 }
return __top;
    }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  void
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_erase(_Link_type __x)
  {
    // Erase without rebalancing.
    while (__x != 0)
{
 _M_erase(_S_right(__x));
 _Link_type __y = _S_left(__x);
 _M_drop_node(__x);
 __x = __y;
}
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  typename _Rb_tree<_Key, _Val, _KeyOfValue,
      _Compare, _Alloc>::iterator
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_lower_bound(_Link_type __x, _Base_ptr __y,
   const _Key& __k)
  {
    while (__x != 0)
if (!_M_impl._M_key_compare(_S_key(__x), __k))
 __y = __x, __x = _S_left(__x);
else
 __x = _S_right(__x);
    return iterator(__y);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  typename _Rb_tree<_Key, _Val, _KeyOfValue,
      _Compare, _Alloc>::const_iterator
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_lower_bound(_Const_Link_type __x, _Const_Base_ptr __y,
   const _Key& __k) const
  {
    while (__x != 0)
if (!_M_impl._M_key_compare(_S_key(__x), __k))
 __y = __x, __x = _S_left(__x);
else
 __x = _S_right(__x);
    return const_iterator(__y);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  typename _Rb_tree<_Key, _Val, _KeyOfValue,
      _Compare, _Alloc>::iterator
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_upper_bound(_Link_type __x, _Base_ptr __y,
   const _Key& __k)
  {
    while (__x != 0)
if (_M_impl._M_key_compare(__k, _S_key(__x)))
 __y = __x, __x = _S_left(__x);
else
 __x = _S_right(__x);
    return iterator(__y);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  typename _Rb_tree<_Key, _Val, _KeyOfValue,
      _Compare, _Alloc>::const_iterator
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_upper_bound(_Const_Link_type __x, _Const_Base_ptr __y,
   const _Key& __k) const
  {
    while (__x != 0)
if (_M_impl._M_key_compare(__k, _S_key(__x)))
 __y = __x, __x = _S_left(__x);
else
 __x = _S_right(__x);
    return const_iterator(__y);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
	   _Compare, _Alloc>::iterator,
typename _Rb_tree<_Key, _Val, _KeyOfValue,
	   _Compare, _Alloc>::iterator>
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  equal_range(const _Key& __k)
  {
    _Link_type __x = _M_begin();
    _Base_ptr __y = _M_end();
    while (__x != 0)
{
 if (_M_impl._M_key_compare(_S_key(__x), __k))
   __x = _S_right(__x);
 else if (_M_impl._M_key_compare(__k, _S_key(__x)))
   __y = __x, __x = _S_left(__x);
 else
   {
     _Link_type __xu(__x);
     _Base_ptr __yu(__y);
     __y = __x, __x = _S_left(__x);
     __xu = _S_right(__xu);
     return pair<iterator,
	  iterator>(_M_lower_bound(__x, __y, __k),
		    _M_upper_bound(__xu, __yu, __k));
   }
}
    return pair<iterator, iterator>(iterator(__y),
		      iterator(__y));
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
	   _Compare, _Alloc>::const_iterator,
typename _Rb_tree<_Key, _Val, _KeyOfValue,
	   _Compare, _Alloc>::const_iterator>
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  equal_range(const _Key& __k) const
  {
    _Const_Link_type __x = _M_begin();
    _Const_Base_ptr __y = _M_end();
    while (__x != 0)
{
 if (_M_impl._M_key_compare(_S_key(__x), __k))
   __x = _S_right(__x);
 else if (_M_impl._M_key_compare(__k, _S_key(__x)))
   __y = __x, __x = _S_left(__x);
 else
   {
     _Const_Link_type __xu(__x);
     _Const_Base_ptr __yu(__y);
     __y = __x, __x = _S_left(__x);
     __xu = _S_right(__xu);
     return pair<const_iterator,
	  const_iterator>(_M_lower_bound(__x, __y, __k),
			  _M_upper_bound(__xu, __yu, __k));
   }
}
    return pair<const_iterator, const_iterator>(const_iterator(__y),
				  const_iterator(__y));
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  void
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  swap(_Rb_tree& __t)
  _GLIBCXX_NOEXCEPT_IF(__is_nothrow_swappable<_Compare>::value)noexcept(__is_nothrow_swappable<_Compare>::value)
  {
    if (_M_root() == 0)
{
 if (__t._M_root() != 0)
   _M_impl._M_move_data(__t._M_impl);
}
    else if (__t._M_root() == 0)
__t._M_impl._M_move_data(_M_impl);
    else
{
 std::swap(_M_root(),__t._M_root());
 std::swap(_M_leftmost(),__t._M_leftmost());
 std::swap(_M_rightmost(),__t._M_rightmost());

 _M_root()->_M_parent = _M_end();
 __t._M_root()->_M_parent = __t._M_end();
 std::swap(this->_M_impl._M_node_count, __t._M_impl._M_node_count);
}
    // No need to swap header's color as it does not change.
    std::swap(this->_M_impl._M_key_compare, __t._M_impl._M_key_compare);

    _Alloc_traits::_S_on_swap(_M_get_Node_allocator(),
		__t._M_get_Node_allocator());
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
	   _Compare, _Alloc>::_Base_ptr,
typename _Rb_tree<_Key, _Val, _KeyOfValue,
	   _Compare, _Alloc>::_Base_ptr>
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_get_insert_unique_pos(const key_type& __k)
  {
    typedef pair<_Base_ptr, _Base_ptr> _Res;
    _Link_type __x = _M_begin();
    _Base_ptr __y = _M_end();
    bool __comp = true;
    while (__x != 0)
{
 __y = __x;
 __comp = _M_impl._M_key_compare(__k, _S_key(__x));
 __x = __comp ? _S_left(__x) : _S_right(__x);
}
    iterator __j = iterator(__y);
    if (__comp)
{
 if (__j == begin())
   return _Res(__x, __y);
 else
   --__j;
}
    if (_M_impl._M_key_compare(_S_key(__j._M_node), __k))
return _Res(__x, __y);
    return _Res(__j._M_node, 0);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
	   _Compare, _Alloc>::_Base_ptr,
typename _Rb_tree<_Key, _Val, _KeyOfValue,
	   _Compare, _Alloc>::_Base_ptr>
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_get_insert_equal_pos(const key_type& __k)
  {
    typedef pair<_Base_ptr, _Base_ptr> _Res;
    _Link_type __x = _M_begin();
    _Base_ptr __y = _M_end();
    while (__x != 0)
{
 __y = __x;
 __x = _M_impl._M_key_compare(__k, _S_key(__x)) ?
_S_left(__x) : _S_right(__x);
}
    return _Res(__x, __y);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
2140#if __cplusplus201402L >= 201103L
  template<typename _Arg>
2142#endif
  pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
	   _Compare, _Alloc>::iterator, bool>
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2146#if __cplusplus201402L >= 201103L
  _M_insert_unique(_Arg&& __v)
2148#else
  _M_insert_unique(const _Val& __v)
2150#endif
  {
    typedef pair<iterator, bool> _Res;
    pair<_Base_ptr, _Base_ptr> __res
= _M_get_insert_unique_pos(_KeyOfValue()(__v));

    if (__res.second)
{
 _Alloc_node __an(*this);
 return _Res(_M_insert_(__res.first, __res.second,
		 _GLIBCXX_FORWARD(_Arg, __v)std::forward<_Arg>(__v), __an),
      true);
}

    return _Res(iterator(__res.first), false);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
2169#if __cplusplus201402L >= 201103L
  template<typename _Arg>
2171#endif
  typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2174#if __cplusplus201402L >= 201103L
  _M_insert_equal(_Arg&& __v)
2176#else
  _M_insert_equal(const _Val& __v)
2178#endif
  {
    pair<_Base_ptr, _Base_ptr> __res
= _M_get_insert_equal_pos(_KeyOfValue()(__v));
    _Alloc_node __an(*this);
    return _M_insert_(__res.first, __res.second,
	_GLIBCXX_FORWARD(_Arg, __v)std::forward<_Arg>(__v), __an);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
	   _Compare, _Alloc>::_Base_ptr,
typename _Rb_tree<_Key, _Val, _KeyOfValue,
	   _Compare, _Alloc>::_Base_ptr>
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_get_insert_hint_unique_pos(const_iterator __position,
		  const key_type& __k)
  {
    iterator __pos = __position._M_const_cast();
    typedef pair<_Base_ptr, _Base_ptr> _Res;

    // end()
    if (__pos._M_node == _M_end())
{
 if (size() > 0
     && _M_impl._M_key_compare(_S_key(_M_rightmost()), __k))
   return _Res(0, _M_rightmost());
 else
   return _M_get_insert_unique_pos(__k);
}
    else if (_M_impl._M_key_compare(__k, _S_key(__pos._M_node)))
{
 // First, try before...
 iterator __before = __pos;
 if (__pos._M_node == _M_leftmost()) // begin()
   return _Res(_M_leftmost(), _M_leftmost());
 else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), __k))
   {
     if (_S_right(__before._M_node) == 0)
return _Res(0, __before._M_node);
     else
return _Res(__pos._M_node, __pos._M_node);
   }
 else
   return _M_get_insert_unique_pos(__k);
}
    else if (_M_impl._M_key_compare(_S_key(__pos._M_node), __k))
{
 // ... then try after.
 iterator __after = __pos;
 if (__pos._M_node == _M_rightmost())
   return _Res(0, _M_rightmost());
 else if (_M_impl._M_key_compare(__k, _S_key((++__after)._M_node)))
   {
     if (_S_right(__pos._M_node) == 0)
return _Res(0, __pos._M_node);
     else
return _Res(__after._M_node, __after._M_node);
   }
 else
   return _M_get_insert_unique_pos(__k);
}
    else
// Equivalent keys.
return _Res(__pos._M_node, 0);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
2248#if __cplusplus201402L >= 201103L
  template<typename _Arg, typename _NodeGen>
2250#else
  template<typename _NodeGen>
2252#endif
    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
    _M_insert_unique_(const_iterator __position,
2256#if __cplusplus201402L >= 201103L
	_Arg&& __v,
2258#else
	const _Val& __v,
2260#endif
	_NodeGen& __node_gen)
  {
    pair<_Base_ptr, _Base_ptr> __res
= _M_get_insert_hint_unique_pos(__position, _KeyOfValue()(__v));

    if (__res.second)
return _M_insert_(__res.first, __res.second,
	  _GLIBCXX_FORWARD(_Arg, __v)std::forward<_Arg>(__v),
	  __node_gen);
    return iterator(__res.first);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
	   _Compare, _Alloc>::_Base_ptr,
typename _Rb_tree<_Key, _Val, _KeyOfValue,
	   _Compare, _Alloc>::_Base_ptr>
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_get_insert_hint_equal_pos(const_iterator __position, const key_type& __k)
  {
    iterator __pos = __position._M_const_cast();
    typedef pair<_Base_ptr, _Base_ptr> _Res;

    // end()
    if (__pos._M_node == _M_end())
{
 if (size() > 0
     && !_M_impl._M_key_compare(__k, _S_key(_M_rightmost())))
   return _Res(0, _M_rightmost());
 else
   return _M_get_insert_equal_pos(__k);
}
    else if (!_M_impl._M_key_compare(_S_key(__pos._M_node), __k))
{
 // First, try before...
 iterator __before = __pos;
 if (__pos._M_node == _M_leftmost()) // begin()
   return _Res(_M_leftmost(), _M_leftmost());
 else if (!_M_impl._M_key_compare(__k, _S_key((--__before)._M_node)))
   {
     if (_S_right(__before._M_node) == 0)
return _Res(0, __before._M_node);
     else
return _Res(__pos._M_node, __pos._M_node);
   }
 else
   return _M_get_insert_equal_pos(__k);
}
    else
{
 // ... then try after.
 iterator __after = __pos;
 if (__pos._M_node == _M_rightmost())
   return _Res(0, _M_rightmost());
 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node), __k))
   {
     if (_S_right(__pos._M_node) == 0)
return _Res(0, __pos._M_node);
     else
return _Res(__after._M_node, __after._M_node);
   }
 else
   return _Res(0, 0);
}
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
2330#if __cplusplus201402L >= 201103L
  template<typename _Arg, typename _NodeGen>
2332#else
  template<typename _NodeGen>
2334#endif
    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
    _M_insert_equal_(const_iterator __position,
2338#if __cplusplus201402L >= 201103L
       _Arg&& __v,
2340#else
       const _Val& __v,
2342#endif
       _NodeGen& __node_gen)
    {
pair<_Base_ptr, _Base_ptr> __res
 = _M_get_insert_hint_equal_pos(__position, _KeyOfValue()(__v));

if (__res.second)
 return _M_insert_(__res.first, __res.second,
	    _GLIBCXX_FORWARD(_Arg, __v)std::forward<_Arg>(__v),
	    __node_gen);

return _M_insert_equal_lower(_GLIBCXX_FORWARD(_Arg, __v)std::forward<_Arg>(__v));
    }

2356#if __cplusplus201402L >= 201103L
template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_insert_node(_Base_ptr __x, _Base_ptr __p, _Link_type __z)
  {
    bool __insert_left = (__x != 0 || __p == _M_end()
	    || _M_impl._M_key_compare(_S_key(__z),
				      _S_key(__p)));

    _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
		    this->_M_impl._M_header);
    ++_M_impl._M_node_count;
    return iterator(__z);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_insert_lower_node(_Base_ptr __p, _Link_type __z)
  {
    bool __insert_left = (__p == _M_end()
	    || !_M_impl._M_key_compare(_S_key(__p),
				       _S_key(__z)));

    _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
		    this->_M_impl._M_header);
    ++_M_impl._M_node_count;
    return iterator(__z);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_insert_equal_lower_node(_Link_type __z)
  {
    _Link_type __x = _M_begin();
    _Base_ptr __y = _M_end();
    while (__x != 0)
{
 __y = __x;
 __x = !_M_impl._M_key_compare(_S_key(__x), _S_key(__z)) ?
_S_left(__x) : _S_right(__x);
}
    return _M_insert_lower_node(__y, __z);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  template<typename... _Args>
    pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
	     _Compare, _Alloc>::iterator, bool>
    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
    _M_emplace_unique(_Args&&... __args)
    {
_Link_type __z = _M_create_node(std::forward<_Args>(__args)...);

__tryif (true)
 {
   typedef pair<iterator, bool> _Res;
   auto __res = _M_get_insert_unique_pos(_S_key(__z));
   if (__res.second)
     return _Res(_M_insert_node(__res.first, __res.second, __z), true);

   _M_drop_node(__z);
   return _Res(iterator(__res.first), false);
 }
__catch(...)if (false)
 {
   _M_drop_node(__z);
   __throw_exception_again;
 }
    }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  template<typename... _Args>
    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
    _M_emplace_equal(_Args&&... __args)
    {
_Link_type __z = _M_create_node(std::forward<_Args>(__args)...);

__tryif (true)
 {
   auto __res = _M_get_insert_equal_pos(_S_key(__z));
   return _M_insert_node(__res.first, __res.second, __z);
 }
__catch(...)if (false)
 {
   _M_drop_node(__z);
   __throw_exception_again;
 }
    }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  template<typename... _Args>
    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
    _M_emplace_hint_unique(const_iterator __pos, _Args&&... __args)
    {
_Link_type __z = _M_create_node(std::forward<_Args>(__args)...);

__tryif (true)
 {
   auto __res = _M_get_insert_hint_unique_pos(__pos, _S_key(__z));

   if (__res.second)
     return _M_insert_node(__res.first, __res.second, __z);

   _M_drop_node(__z);
   return iterator(__res.first);
 }
__catch(...)if (false)
 {
   _M_drop_node(__z);
   __throw_exception_again;
 }
    }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  template<typename... _Args>
    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
    _M_emplace_hint_equal(const_iterator __pos, _Args&&... __args)
    {
_Link_type __z = _M_create_node(std::forward<_Args>(__args)...);

__tryif (true)
 {
   auto __res = _M_get_insert_hint_equal_pos(__pos, _S_key(__z));

   if (__res.second)
     return _M_insert_node(__res.first, __res.second, __z);

   return _M_insert_equal_lower_node(__z);
 }
__catch(...)if (false)
 {
   _M_drop_node(__z);
   __throw_exception_again;
 }
    }
2504#endif


template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  void
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_erase_aux(const_iterator __position)
  {
    _Link_type __y =
static_cast<_Link_type>(_Rb_tree_rebalance_for_erase
		(const_cast<_Base_ptr>(__position._M_node),
		 this->_M_impl._M_header));
    _M_drop_node(__y);
    --_M_impl._M_node_count;
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  void
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  _M_erase_aux(const_iterator __first, const_iterator __last)
  {
    if (__first == begin() && __last == end())
clear();
    else
while (__first != __last)
 _M_erase_aux(__first++);
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  erase(const _Key& __x)
  {
    pair<iterator, iterator> __p = equal_range(__x);
    const size_type __old_size = size();
    _M_erase_aux(__p.first, __p.second);
    return __old_size - size();
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  typename _Rb_tree<_Key, _Val, _KeyOfValue,
      _Compare, _Alloc>::iterator
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  find(const _Key& __k)
  {
    iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);
    return (__j == end()
     || _M_impl._M_key_compare(__k,
			_S_key(__j._M_node))) ? end() : __j;
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  typename _Rb_tree<_Key, _Val, _KeyOfValue,
      _Compare, _Alloc>::const_iterator
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  find(const _Key& __k) const
  {
    const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);
    return (__j == end()
     || _M_impl._M_key_compare(__k,
			_S_key(__j._M_node))) ? end() : __j;
  }

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
  count(const _Key& __k) const
  {
    pair<const_iterator, const_iterator> __p = equal_range(__k);
    const size_type __n = std::distance(__p.first, __p.second);
    return __n;
  }

_GLIBCXX_PURE__attribute__ ((__pure__)) unsigned int
_Rb_tree_black_count(const _Rb_tree_node_base* __node,
       const _Rb_tree_node_base* __root) throw ();

template<typename _Key, typename _Val, typename _KeyOfValue,
  typename _Compare, typename _Alloc>
  bool
  _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify() const
  {
    if (_M_impl._M_node_count == 0 || begin() == end())
return _M_impl._M_node_count == 0 && begin() == end()
      && this->_M_impl._M_header._M_left == _M_end()
      && this->_M_impl._M_header._M_right == _M_end();

    unsigned int __len = _Rb_tree_black_count(_M_leftmost(), _M_root());
    for (const_iterator __it = begin(); __it != end(); ++__it)
{
 _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node);
 _Const_Link_type __L = _S_left(__x);
 _Const_Link_type __R = _S_right(__x);

 if (__x->_M_color == _S_red)
   if ((__L && __L->_M_color == _S_red)
|| (__R && __R->_M_color == _S_red))
     return false;

 if (__L && _M_impl._M_key_compare(_S_key(__x), _S_key(__L)))
   return false;
 if (__R && _M_impl._M_key_compare(_S_key(__R), _S_key(__x)))
   return false;

 if (!__L && !__R && _Rb_tree_black_count(__x, _M_root()) != __len)
   return false;
}

    if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
return false;
    if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))
return false;
    return true;
  }

2625#if __cplusplus201402L > 201402L
// Allow access to internals of compatible _Rb_tree specializations.
template<typename _Key, typename _Val, typename _Sel, typename _Cmp1,
  typename _Alloc, typename _Cmp2>
  struct _Rb_tree_merge_helper<_Rb_tree<_Key, _Val, _Sel, _Cmp1, _Alloc>,
		 _Cmp2>
  {
  private:
    friend class _Rb_tree<_Key, _Val, _Sel, _Cmp1, _Alloc>;

    static auto&
    _S_get_impl(_Rb_tree<_Key, _Val, _Sel, _Cmp2, _Alloc>& __tree)
    { return __tree._M_impl; }
  };
2639#endif // C++17

2641_GLIBCXX_END_NAMESPACE_VERSION
2642} // namespace

2644#endif