/usr/src/gnu/usr.bin/clang/libclangBasic/../../../llvm/clang/lib/Basic/Diagnostic.cpp

Bug Summary

File:	src/gnu/usr.bin/clang/libclangBasic/../../../llvm/clang/lib/Basic/Diagnostic.cpp
Warning:	line 824, column 9 Array access (from variable 'DiagStr') results in a null pointer dereference

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple amd64-unknown-openbsd7.0 -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name Diagnostic.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 -mrelocation-model static -mframe-pointer=all -relaxed-aliasing -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/usr/src/gnu/usr.bin/clang/libclangBasic/obj -resource-dir /usr/local/lib/clang/13.0.0 -I /usr/src/gnu/usr.bin/clang/libclangBasic/../../../llvm/clang/include -I /usr/src/gnu/usr.bin/clang/libclangBasic/../../../llvm/clang/lib/Basic -I /usr/src/gnu/usr.bin/clang/libclangBasic/../../../llvm/clang/lib/Basic/Targets -I /usr/src/gnu/usr.bin/clang/libclangBasic/../../../llvm/llvm/include -I /usr/src/gnu/usr.bin/clang/libclangBasic/../include -I /usr/src/gnu/usr.bin/clang/libclangBasic/obj -I /usr/src/gnu/usr.bin/clang/libclangBasic/obj/../include -D NDEBUG -D __STDC_LIMIT_MACROS -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D LLVM_PREFIX="/usr" -internal-isystem /usr/include/c++/v1 -internal-isystem /usr/local/lib/clang/13.0.0/include -internal-externc-isystem /usr/include -O2 -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-comment -std=c++14 -fdeprecated-macro -fdebug-compilation-dir=/usr/src/gnu/usr.bin/clang/libclangBasic/obj -ferror-limit 19 -fvisibility-inlines-hidden -fwrapv -stack-protector 2 -fno-rtti -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -fno-builtin-malloc -fno-builtin-calloc -fno-builtin-realloc -fno-builtin-valloc -fno-builtin-free -fno-builtin-strdup -fno-builtin-strndup -analyzer-output=html -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /home/ben/Projects/vmm/scan-build/2022-01-12-194120-40624-1 -x c++ /usr/src/gnu/usr.bin/clang/libclangBasic/../../../llvm/clang/lib/Basic/Diagnostic.cpp

/usr/src/gnu/usr.bin/clang/libclangBasic/../../../llvm/clang/lib/Basic/Diagnostic.cpp

→

1//===- Diagnostic.cpp - C Language Family Diagnostic Handling -------------===//
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 Diagnostic-related interfaces.
10//
11//===----------------------------------------------------------------------===//

13#include "clang/Basic/Diagnostic.h"
14#include "clang/Basic/CharInfo.h"
15#include "clang/Basic/DiagnosticError.h"
16#include "clang/Basic/DiagnosticIDs.h"
17#include "clang/Basic/DiagnosticOptions.h"
18#include "clang/Basic/IdentifierTable.h"
19#include "clang/Basic/PartialDiagnostic.h"
20#include "clang/Basic/SourceLocation.h"
21#include "clang/Basic/SourceManager.h"
22#include "clang/Basic/Specifiers.h"
23#include "clang/Basic/TokenKinds.h"
24#include "llvm/ADT/SmallString.h"
25#include "llvm/ADT/SmallVector.h"
26#include "llvm/ADT/StringExtras.h"
27#include "llvm/ADT/StringRef.h"
28#include "llvm/Support/CrashRecoveryContext.h"
29#include "llvm/Support/Locale.h"
30#include "llvm/Support/raw_ostream.h"
31#include <algorithm>
32#include <cassert>
33#include <cstddef>
34#include <cstdint>
35#include <cstring>
36#include <limits>
37#include <string>
38#include <utility>
39#include <vector>

41using namespace clang;

43const StreamingDiagnostic &clang::operator<<(const StreamingDiagnostic &DB,
                                           DiagNullabilityKind nullability) {
StringRef string;
switch (nullability.first) {
case NullabilityKind::NonNull:
  string = nullability.second ? "'nonnull'" : "'_Nonnull'";
  break;

case NullabilityKind::Nullable:
  string = nullability.second ? "'nullable'" : "'_Nullable'";
  break;

case NullabilityKind::Unspecified:
  string = nullability.second ? "'null_unspecified'" : "'_Null_unspecified'";
  break;

case NullabilityKind::NullableResult:
  assert(!nullability.second &&((void)0)
         "_Nullable_result isn't supported as context-sensitive keyword")((void)0);
  string = "_Nullable_result";
  break;
}

DB.AddString(string);
return DB;
68}

70const StreamingDiagnostic &clang::operator<<(const StreamingDiagnostic &DB,
                                           llvm::Error &&E) {
DB.AddString(toString(std::move(E)));
return DB;
74}

76static void DummyArgToStringFn(DiagnosticsEngine::ArgumentKind AK, intptr_t QT,
                          StringRef Modifier, StringRef Argument,
                          ArrayRef<DiagnosticsEngine::ArgumentValue> PrevArgs,
                          SmallVectorImpl<char> &Output,
                          void *Cookie,
                          ArrayRef<intptr_t> QualTypeVals) {
StringRef Str = "<can't format argument>";
Output.append(Str.begin(), Str.end());
84}

86DiagnosticsEngine::DiagnosticsEngine(
  IntrusiveRefCntPtr<DiagnosticIDs> diags,
  IntrusiveRefCntPtr<DiagnosticOptions> DiagOpts, DiagnosticConsumer *client,
  bool ShouldOwnClient)
  : Diags(std::move(diags)), DiagOpts(std::move(DiagOpts)) {
setClient(client, ShouldOwnClient);
ArgToStringFn = DummyArgToStringFn;

Reset();
95}

97DiagnosticsEngine::~DiagnosticsEngine() {
// If we own the diagnostic client, destroy it first so that it can access the
// engine from its destructor.
setClient(nullptr);
101}

103void DiagnosticsEngine::dump() const {
DiagStatesByLoc.dump(*SourceMgr);
105}

107void DiagnosticsEngine::dump(StringRef DiagName) const {
DiagStatesByLoc.dump(*SourceMgr, DiagName);
109}

111void DiagnosticsEngine::setClient(DiagnosticConsumer *client,
                                bool ShouldOwnClient) {
Owner.reset(ShouldOwnClient ? client : nullptr);
Client = client;
115}

117void DiagnosticsEngine::pushMappings(SourceLocation Loc) {
DiagStateOnPushStack.push_back(GetCurDiagState());
119}

121bool DiagnosticsEngine::popMappings(SourceLocation Loc) {
if (DiagStateOnPushStack.empty())
  return false;

if (DiagStateOnPushStack.back() != GetCurDiagState()) {
  // State changed at some point between push/pop.
  PushDiagStatePoint(DiagStateOnPushStack.back(), Loc);
}
DiagStateOnPushStack.pop_back();
return true;
131}

133void DiagnosticsEngine::Reset() {
ErrorOccurred = false;
UncompilableErrorOccurred = false;
FatalErrorOccurred = false;
UnrecoverableErrorOccurred = false;

NumWarnings = 0;
NumErrors = 0;
TrapNumErrorsOccurred = 0;
TrapNumUnrecoverableErrorsOccurred = 0;

CurDiagID = std::numeric_limits<unsigned>::max();
LastDiagLevel = DiagnosticIDs::Ignored;
DelayedDiagID = 0;

// Clear state related to #pragma diagnostic.
DiagStates.clear();
DiagStatesByLoc.clear();
DiagStateOnPushStack.clear();

// Create a DiagState and DiagStatePoint representing diagnostic changes
// through command-line.
DiagStates.emplace_back();
DiagStatesByLoc.appendFirst(&DiagStates.back());
157}

159void DiagnosticsEngine::SetDelayedDiagnostic(unsigned DiagID, StringRef Arg1,
                                           StringRef Arg2, StringRef Arg3) {
if (DelayedDiagID)
  return;

DelayedDiagID = DiagID;
DelayedDiagArg1 = Arg1.str();
DelayedDiagArg2 = Arg2.str();
DelayedDiagArg3 = Arg3.str();
168}

170void DiagnosticsEngine::ReportDelayed() {
unsigned ID = DelayedDiagID;
DelayedDiagID = 0;
Report(ID) << DelayedDiagArg1 << DelayedDiagArg2 << DelayedDiagArg3;
174}

176void DiagnosticsEngine::DiagStateMap::appendFirst(DiagState *State) {
assert(Files.empty() && "not first")((void)0);
FirstDiagState = CurDiagState = State;
CurDiagStateLoc = SourceLocation();
180}

182void DiagnosticsEngine::DiagStateMap::append(SourceManager &SrcMgr,
                                           SourceLocation Loc,
                                           DiagState *State) {
CurDiagState = State;
CurDiagStateLoc = Loc;

std::pair<FileID, unsigned> Decomp = SrcMgr.getDecomposedLoc(Loc);
unsigned Offset = Decomp.second;
for (File *F = getFile(SrcMgr, Decomp.first); F;
     Offset = F->ParentOffset, F = F->Parent) {
  F->HasLocalTransitions = true;
  auto &Last = F->StateTransitions.back();
  assert(Last.Offset <= Offset && "state transitions added out of order")((void)0);

  if (Last.Offset == Offset) {
    if (Last.State == State)
      break;
    Last.State = State;
    continue;
  }

  F->StateTransitions.push_back({State, Offset});
}
205}

207DiagnosticsEngine::DiagState *
208DiagnosticsEngine::DiagStateMap::lookup(SourceManager &SrcMgr,
                                      SourceLocation Loc) const {
// Common case: we have not seen any diagnostic pragmas.
if (Files.empty())
  return FirstDiagState;

std::pair<FileID, unsigned> Decomp = SrcMgr.getDecomposedLoc(Loc);
const File *F = getFile(SrcMgr, Decomp.first);
return F->lookup(Decomp.second);
217}

219DiagnosticsEngine::DiagState *
220DiagnosticsEngine::DiagStateMap::File::lookup(unsigned Offset) const {
auto OnePastIt =
    llvm::partition_point(StateTransitions, [=](const DiagStatePoint &P) {
      return P.Offset <= Offset;
    });
assert(OnePastIt != StateTransitions.begin() && "missing initial state")((void)0);
return OnePastIt[-1].State;
227}

229DiagnosticsEngine::DiagStateMap::File *
230DiagnosticsEngine::DiagStateMap::getFile(SourceManager &SrcMgr,
                                       FileID ID) const {
// Get or insert the File for this ID.
auto Range = Files.equal_range(ID);
if (Range.first != Range.second)
  return &Range.first->second;
auto &F = Files.insert(Range.first, std::make_pair(ID, File()))->second;

// We created a new File; look up the diagnostic state at the start of it and
// initialize it.
if (ID.isValid()) {
  std::pair<FileID, unsigned> Decomp = SrcMgr.getDecomposedIncludedLoc(ID);
  F.Parent = getFile(SrcMgr, Decomp.first);
  F.ParentOffset = Decomp.second;
  F.StateTransitions.push_back({F.Parent->lookup(Decomp.second), 0});
} else {
  // This is the (imaginary) root file into which we pretend all top-level
  // files are included; it descends from the initial state.
  //
  // FIXME: This doesn't guarantee that we use the same ordering as
  // isBeforeInTranslationUnit in the cases where someone invented another
  // top-level file and added diagnostic pragmas to it. See the code at the
  // end of isBeforeInTranslationUnit for the quirks it deals with.
  F.StateTransitions.push_back({FirstDiagState, 0});
}
return &F;
256}

258void DiagnosticsEngine::DiagStateMap::dump(SourceManager &SrcMgr,
                                         StringRef DiagName) const {
llvm::errs() << "diagnostic state at ";
CurDiagStateLoc.print(llvm::errs(), SrcMgr);
llvm::errs() << ": " << CurDiagState << "\n";

for (auto &F : Files) {
  FileID ID = F.first;
  File &File = F.second;

  bool PrintedOuterHeading = false;
  auto PrintOuterHeading = [&] {
    if (PrintedOuterHeading) return;
    PrintedOuterHeading = true;

    llvm::errs() << "File " << &File << " <FileID " << ID.getHashValue()
                 << ">: " << SrcMgr.getBufferOrFake(ID).getBufferIdentifier();

    if (F.second.Parent) {
      std::pair<FileID, unsigned> Decomp =
          SrcMgr.getDecomposedIncludedLoc(ID);
      assert(File.ParentOffset == Decomp.second)((void)0);
      llvm::errs() << " parent " << File.Parent << " <FileID "
                   << Decomp.first.getHashValue() << "> ";
      SrcMgr.getLocForStartOfFile(Decomp.first)
            .getLocWithOffset(Decomp.second)
            .print(llvm::errs(), SrcMgr);
    }
    if (File.HasLocalTransitions)
      llvm::errs() << " has_local_transitions";
    llvm::errs() << "\n";
  };

  if (DiagName.empty())
    PrintOuterHeading();

  for (DiagStatePoint &Transition : File.StateTransitions) {
    bool PrintedInnerHeading = false;
    auto PrintInnerHeading = [&] {
      if (PrintedInnerHeading) return;
      PrintedInnerHeading = true;

      PrintOuterHeading();
      llvm::errs() << "  ";
      SrcMgr.getLocForStartOfFile(ID)
            .getLocWithOffset(Transition.Offset)
            .print(llvm::errs(), SrcMgr);
      llvm::errs() << ": state " << Transition.State << ":\n";
    };

    if (DiagName.empty())
      PrintInnerHeading();

    for (auto &Mapping : *Transition.State) {
      StringRef Option =
          DiagnosticIDs::getWarningOptionForDiag(Mapping.first);
      if (!DiagName.empty() && DiagName != Option)
        continue;

      PrintInnerHeading();
      llvm::errs() << "    ";
      if (Option.empty())
        llvm::errs() << "<unknown " << Mapping.first << ">";
      else
        llvm::errs() << Option;
      llvm::errs() << ": ";

      switch (Mapping.second.getSeverity()) {
      case diag::Severity::Ignored: llvm::errs() << "ignored"; break;
      case diag::Severity::Remark: llvm::errs() << "remark"; break;
      case diag::Severity::Warning: llvm::errs() << "warning"; break;
      case diag::Severity::Error: llvm::errs() << "error"; break;
      case diag::Severity::Fatal: llvm::errs() << "fatal"; break;
      }

      if (!Mapping.second.isUser())
        llvm::errs() << " default";
      if (Mapping.second.isPragma())
        llvm::errs() << " pragma";
      if (Mapping.second.hasNoWarningAsError())
        llvm::errs() << " no-error";
      if (Mapping.second.hasNoErrorAsFatal())
        llvm::errs() << " no-fatal";
      if (Mapping.second.wasUpgradedFromWarning())
        llvm::errs() << " overruled";
      llvm::errs() << "\n";
    }
  }
}
347}

349void DiagnosticsEngine::PushDiagStatePoint(DiagState *State,
                                         SourceLocation Loc) {
assert(Loc.isValid() && "Adding invalid loc point")((void)0);
DiagStatesByLoc.append(*SourceMgr, Loc, State);
353}

355void DiagnosticsEngine::setSeverity(diag::kind Diag, diag::Severity Map,
                                  SourceLocation L) {
assert(Diag < diag::DIAG_UPPER_LIMIT &&((void)0)
       "Can only map builtin diagnostics")((void)0);
assert((Diags->isBuiltinWarningOrExtension(Diag) ||((void)0)
        (Map == diag::Severity::Fatal || Map == diag::Severity::Error)) &&((void)0)
       "Cannot map errors into warnings!")((void)0);
assert((L.isInvalid() || SourceMgr) && "No SourceMgr for valid location")((void)0);

// Don't allow a mapping to a warning override an error/fatal mapping.
bool WasUpgradedFromWarning = false;
if (Map == diag::Severity::Warning) {
  DiagnosticMapping &Info = GetCurDiagState()->getOrAddMapping(Diag);
  if (Info.getSeverity() == diag::Severity::Error ||
      Info.getSeverity() == diag::Severity::Fatal) {
    Map = Info.getSeverity();
    WasUpgradedFromWarning = true;
  }
}
DiagnosticMapping Mapping = makeUserMapping(Map, L);
Mapping.setUpgradedFromWarning(WasUpgradedFromWarning);

// Common case; setting all the diagnostics of a group in one place.
if ((L.isInvalid() || L == DiagStatesByLoc.getCurDiagStateLoc()) &&
    DiagStatesByLoc.getCurDiagState()) {
  // FIXME: This is theoretically wrong: if the current state is shared with
  // some other location (via push/pop) we will change the state for that
  // other location as well. This cannot currently happen, as we can't update
  // the diagnostic state at the same location at which we pop.
  DiagStatesByLoc.getCurDiagState()->setMapping(Diag, Mapping);
  return;
}

// A diagnostic pragma occurred, create a new DiagState initialized with
// the current one and a new DiagStatePoint to record at which location
// the new state became active.
DiagStates.push_back(*GetCurDiagState());
DiagStates.back().setMapping(Diag, Mapping);
PushDiagStatePoint(&DiagStates.back(), L);
394}

396bool DiagnosticsEngine::setSeverityForGroup(diag::Flavor Flavor,
                                          StringRef Group, diag::Severity Map,
                                          SourceLocation Loc) {
// Get the diagnostics in this group.
SmallVector<diag::kind, 256> GroupDiags;
if (Diags->getDiagnosticsInGroup(Flavor, Group, GroupDiags))
  return true;

// Set the mapping.
for (diag::kind Diag : GroupDiags)
  setSeverity(Diag, Map, Loc);

return false;
409}

411bool DiagnosticsEngine::setDiagnosticGroupWarningAsError(StringRef Group,
                                                       bool Enabled) {
// If we are enabling this feature, just set the diagnostic mappings to map to
// errors.
if (Enabled)
  return setSeverityForGroup(diag::Flavor::WarningOrError, Group,
                             diag::Severity::Error);

// Otherwise, we want to set the diagnostic mapping's "no Werror" bit, and
// potentially downgrade anything already mapped to be a warning.

// Get the diagnostics in this group.
SmallVector<diag::kind, 8> GroupDiags;
if (Diags->getDiagnosticsInGroup(diag::Flavor::WarningOrError, Group,
                                 GroupDiags))
  return true;

// Perform the mapping change.
for (diag::kind Diag : GroupDiags) {
  DiagnosticMapping &Info = GetCurDiagState()->getOrAddMapping(Diag);

  if (Info.getSeverity() == diag::Severity::Error ||
      Info.getSeverity() == diag::Severity::Fatal)
    Info.setSeverity(diag::Severity::Warning);

  Info.setNoWarningAsError(true);
}

return false;
440}

442bool DiagnosticsEngine::setDiagnosticGroupErrorAsFatal(StringRef Group,
                                                     bool Enabled) {
// If we are enabling this feature, just set the diagnostic mappings to map to
// fatal errors.
if (Enabled)
  return setSeverityForGroup(diag::Flavor::WarningOrError, Group,
                             diag::Severity::Fatal);

// Otherwise, we want to set the diagnostic mapping's "no Wfatal-errors" bit,
// and potentially downgrade anything already mapped to be a fatal error.

// Get the diagnostics in this group.
SmallVector<diag::kind, 8> GroupDiags;
if (Diags->getDiagnosticsInGroup(diag::Flavor::WarningOrError, Group,
                                 GroupDiags))
  return true;

// Perform the mapping change.
for (diag::kind Diag : GroupDiags) {
  DiagnosticMapping &Info = GetCurDiagState()->getOrAddMapping(Diag);

  if (Info.getSeverity() == diag::Severity::Fatal)
    Info.setSeverity(diag::Severity::Error);

  Info.setNoErrorAsFatal(true);
}

return false;
470}

472void DiagnosticsEngine::setSeverityForAll(diag::Flavor Flavor,
                                        diag::Severity Map,
                                        SourceLocation Loc) {
// Get all the diagnostics.
std::vector<diag::kind> AllDiags;
DiagnosticIDs::getAllDiagnostics(Flavor, AllDiags);

// Set the mapping.
for (diag::kind Diag : AllDiags)
  if (Diags->isBuiltinWarningOrExtension(Diag))
    setSeverity(Diag, Map, Loc);
483}

485void DiagnosticsEngine::Report(const StoredDiagnostic &storedDiag) {
assert(CurDiagID == std::numeric_limits<unsigned>::max() &&((void)0)
       "Multiple diagnostics in flight at once!")((void)0);

CurDiagLoc = storedDiag.getLocation();
CurDiagID = storedDiag.getID();
DiagStorage.NumDiagArgs = 0;

DiagStorage.DiagRanges.clear();
DiagStorage.DiagRanges.append(storedDiag.range_begin(),
                              storedDiag.range_end());

DiagStorage.FixItHints.clear();
DiagStorage.FixItHints.append(storedDiag.fixit_begin(),
                              storedDiag.fixit_end());

assert(Client && "DiagnosticConsumer not set!")((void)0);
Level DiagLevel = storedDiag.getLevel();
Diagnostic Info(this, storedDiag.getMessage());
Client->HandleDiagnostic(DiagLevel, Info);
if (Client->IncludeInDiagnosticCounts()) {
  if (DiagLevel == DiagnosticsEngine::Warning)
    ++NumWarnings;
}

CurDiagID = std::numeric_limits<unsigned>::max();
511}

513bool DiagnosticsEngine::EmitCurrentDiagnostic(bool Force) {
assert(getClient() && "DiagnosticClient not set!")((void)0);

bool Emitted;
if (Force) {
  Diagnostic Info(this);

  // Figure out the diagnostic level of this message.
  DiagnosticIDs::Level DiagLevel
    = Diags->getDiagnosticLevel(Info.getID(), Info.getLocation(), *this);

  Emitted = (DiagLevel != DiagnosticIDs::Ignored);
  if (Emitted) {
    // Emit the diagnostic regardless of suppression level.
    Diags->EmitDiag(*this, DiagLevel);
  }
} else {
  // Process the diagnostic, sending the accumulated information to the
  // DiagnosticConsumer.
  Emitted = ProcessDiag();
}

// Clear out the current diagnostic object.
Clear();

// If there was a delayed diagnostic, emit it now.
if (!Force && DelayedDiagID)
  ReportDelayed();

return Emitted;
543}

545DiagnosticConsumer::~DiagnosticConsumer() = default;

547void DiagnosticConsumer::HandleDiagnostic(DiagnosticsEngine::Level DiagLevel,
                                      const Diagnostic &Info) {
if (!IncludeInDiagnosticCounts())
  return;

if (DiagLevel == DiagnosticsEngine::Warning)
  ++NumWarnings;
else if (DiagLevel >= DiagnosticsEngine::Error)
  ++NumErrors;
556}

558/// ModifierIs - Return true if the specified modifier matches specified string.
559template <std::size_t StrLen>
560static bool ModifierIs(const char *Modifier, unsigned ModifierLen,
                     const char (&Str)[StrLen]) {
return StrLen-1 == ModifierLen && memcmp(Modifier, Str, StrLen-1) == 0;
43
←
Returning zero, which participates in a condition later→
563}

565/// ScanForward - Scans forward, looking for the given character, skipping
566/// nested clauses and escaped characters.
567static const char *ScanFormat(const char *I, const char *E, char Target) {
unsigned Depth = 0;

for ( ; I != E; ++I) {
  if (Depth == 0 && *I == Target) return I;
  if (Depth != 0 && *I == '}') Depth--;

  if (*I == '%') {
    I++;
    if (I == E) break;

    // Escaped characters get implicitly skipped here.

    // Format specifier.
    if (!isDigit(*I) && !isPunctuation(*I)) {
      for (I++; I != E && !isDigit(*I) && *I != '{'; I++) ;
      if (I == E) break;
      if (*I == '{')
        Depth++;
    }
  }
}
return E;
590}

592/// HandleSelectModifier - Handle the integer 'select' modifier.  This is used
593/// like this:  %select{foo|bar|baz}2.  This means that the integer argument
594/// "%2" has a value from 0-2.  If the value is 0, the diagnostic prints 'foo'.
595/// If the value is 1, it prints 'bar'.  If it has the value 2, it prints 'baz'.
596/// This is very useful for certain classes of variant diagnostics.
597static void HandleSelectModifier(const Diagnostic &DInfo, unsigned ValNo,
                               const char *Argument, unsigned ArgumentLen,
                               SmallVectorImpl<char> &OutStr) {
const char *ArgumentEnd = Argument+ArgumentLen;

// Skip over 'ValNo' |'s.
while (ValNo) {
  const char *NextVal = ScanFormat(Argument, ArgumentEnd, '|');
  assert(NextVal != ArgumentEnd && "Value for integer select modifier was"((void)0)
         " larger than the number of options in the diagnostic string!")((void)0);
  Argument = NextVal+1;  // Skip this string.
  --ValNo;
}

// Get the end of the value.  This is either the } or the |.
const char *EndPtr = ScanFormat(Argument, ArgumentEnd, '|');

// Recursively format the result of the select clause into the output string.
DInfo.FormatDiagnostic(Argument, EndPtr, OutStr);
616}

618/// HandleIntegerSModifier - Handle the integer 's' modifier.  This adds the
619/// letter 's' to the string if the value is not 1.  This is used in cases like
620/// this:  "you idiot, you have %4 parameter%s4!".
621static void HandleIntegerSModifier(unsigned ValNo,
                                 SmallVectorImpl<char> &OutStr) {
if (ValNo != 1)
  OutStr.push_back('s');
625}

627/// HandleOrdinalModifier - Handle the integer 'ord' modifier.  This
628/// prints the ordinal form of the given integer, with 1 corresponding
629/// to the first ordinal.  Currently this is hard-coded to use the
630/// English form.
631static void HandleOrdinalModifier(unsigned ValNo,
                                SmallVectorImpl<char> &OutStr) {
assert(ValNo != 0 && "ValNo must be strictly positive!")((void)0);

llvm::raw_svector_ostream Out(OutStr);

// We could use text forms for the first N ordinals, but the numeric
// forms are actually nicer in diagnostics because they stand out.
Out << ValNo << llvm::getOrdinalSuffix(ValNo);
640}

642/// PluralNumber - Parse an unsigned integer and advance Start.
643static unsigned PluralNumber(const char *&Start, const char *End) {
// Programming 101: Parse a decimal number :-)
unsigned Val = 0;
while (Start != End && *Start >= '0' && *Start <= '9') {
  Val *= 10;
  Val += *Start - '0';
  ++Start;
}
return Val;
652}

654/// TestPluralRange - Test if Val is in the parsed range. Modifies Start.
655static bool TestPluralRange(unsigned Val, const char *&Start, const char *End) {
if (*Start != '[') {
  unsigned Ref = PluralNumber(Start, End);
  return Ref == Val;
}

++Start;
unsigned Low = PluralNumber(Start, End);
assert(*Start == ',' && "Bad plural expression syntax: expected ,")((void)0);
++Start;
unsigned High = PluralNumber(Start, End);
assert(*Start == ']' && "Bad plural expression syntax: expected )")((void)0);
++Start;
return Low <= Val && Val <= High;
669}

671/// EvalPluralExpr - Actual expression evaluator for HandlePluralModifier.
672static bool EvalPluralExpr(unsigned ValNo, const char *Start, const char *End) {
// Empty condition?
if (*Start == ':')
  return true;

while (true) {
  char C = *Start;
  if (C == '%') {
    // Modulo expression
    ++Start;
    unsigned Arg = PluralNumber(Start, End);
    assert(*Start == '=' && "Bad plural expression syntax: expected =")((void)0);
    ++Start;
    unsigned ValMod = ValNo % Arg;
    if (TestPluralRange(ValMod, Start, End))
      return true;
  } else {
    assert((C == '[' || (C >= '0' && C <= '9')) &&((void)0)
           "Bad plural expression syntax: unexpected character")((void)0);
    // Range expression
    if (TestPluralRange(ValNo, Start, End))
      return true;
  }

  // Scan for next or-expr part.
  Start = std::find(Start, End, ',');
  if (Start == End)
    break;
  ++Start;
}
return false;
703}

705/// HandlePluralModifier - Handle the integer 'plural' modifier. This is used
706/// for complex plural forms, or in languages where all plurals are complex.
707/// The syntax is: %plural{cond1:form1|cond2:form2|:form3}, where condn are
708/// conditions that are tested in order, the form corresponding to the first
709/// that applies being emitted. The empty condition is always true, making the
710/// last form a default case.
711/// Conditions are simple boolean expressions, where n is the number argument.
712/// Here are the rules.
713/// condition  := expression | empty
714/// empty      :=                             -> always true
715/// expression := numeric [',' expression]    -> logical or
716/// numeric    := range                       -> true if n in range
717///             | '%' number '=' range        -> true if n % number in range
718/// range      := number
719///             | '[' number ',' number ']'   -> ranges are inclusive both ends
720///
721/// Here are some examples from the GNU gettext manual written in this form:
722/// English:
723/// {1:form0|:form1}
724/// Latvian:
725/// {0:form2|%100=11,%10=0,%10=[2,9]:form1|:form0}
726/// Gaeilge:
727/// {1:form0|2:form1|:form2}
728/// Romanian:
729/// {1:form0|0,%100=[1,19]:form1|:form2}
730/// Lithuanian:
731/// {%10=0,%100=[10,19]:form2|%10=1:form0|:form1}
732/// Russian (requires repeated form):
733/// {%100=[11,14]:form2|%10=1:form0|%10=[2,4]:form1|:form2}
734/// Slovak
735/// {1:form0|[2,4]:form1|:form2}
736/// Polish (requires repeated form):
737/// {1:form0|%100=[10,20]:form2|%10=[2,4]:form1|:form2}
738static void HandlePluralModifier(const Diagnostic &DInfo, unsigned ValNo,
                               const char *Argument, unsigned ArgumentLen,
                               SmallVectorImpl<char> &OutStr) {
const char *ArgumentEnd = Argument + ArgumentLen;
while (true) {
  assert(Argument < ArgumentEnd && "Plural expression didn't match.")((void)0);
  const char *ExprEnd = Argument;
  while (*ExprEnd != ':') {
    assert(ExprEnd != ArgumentEnd && "Plural missing expression end")((void)0);
    ++ExprEnd;
  }
  if (EvalPluralExpr(ValNo, Argument, ExprEnd)) {
    Argument = ExprEnd + 1;
    ExprEnd = ScanFormat(Argument, ArgumentEnd, '|');

    // Recursively format the result of the plural clause into the
    // output string.
    DInfo.FormatDiagnostic(Argument, ExprEnd, OutStr);
    return;
  }
  Argument = ScanFormat(Argument, ArgumentEnd - 1, '|') + 1;
}
760}

762/// Returns the friendly description for a token kind that will appear
763/// without quotes in diagnostic messages. These strings may be translatable in
764/// future.
765static const char *getTokenDescForDiagnostic(tok::TokenKind Kind) {
switch (Kind) {
case tok::identifier:
  return "identifier";
default:
  return nullptr;
}
772}

774/// FormatDiagnostic - Format this diagnostic into a string, substituting the
775/// formal arguments into the %0 slots.  The result is appended onto the Str
776/// array.
777void Diagnostic::
778FormatDiagnostic(SmallVectorImpl<char> &OutStr) const {
if (!StoredDiagMessage.empty()) {
3
←
Assuming the condition is false→
4
←
Taking false branch→
  OutStr.append(StoredDiagMessage.begin(), StoredDiagMessage.end());
  return;
}

StringRef Diag =
  getDiags()->getDiagnosticIDs()->getDescription(getID());

FormatDiagnostic(Diag.begin(), Diag.end(), OutStr);
5
←
Calling 'Diagnostic::FormatDiagnostic'→
788}

790void Diagnostic::
791FormatDiagnostic(const char *DiagStr, const char *DiagEnd,
               SmallVectorImpl<char> &OutStr) const {
// When the diagnostic string is only "%0", the entire string is being given
// by an outside source.  Remove unprintable characters from this string
// and skip all the other string processing.
if (DiagEnd - DiagStr == 2 &&
6
←
Assuming the condition is false→
7
←
Taking false branch→
30
←
Assuming the condition is false→
31
←
Taking false branch→
54
←
Assuming the condition is false→
55
←
Taking false branch→
    StringRef(DiagStr, DiagEnd - DiagStr).equals("%0") &&
    getArgKind(0) == DiagnosticsEngine::ak_std_string) {
  const std::string &S = getArgStdStr(0);
  for (char c : S) {
    if (llvm::sys::locale::isPrint(c) || c == '\t') {
      OutStr.push_back(c);
    }
  }
  return;
}

/// FormattedArgs - Keep track of all of the arguments formatted by
/// ConvertArgToString and pass them into subsequent calls to
/// ConvertArgToString, allowing the implementation to avoid redundancies in
/// obvious cases.
SmallVector<DiagnosticsEngine::ArgumentValue, 8> FormattedArgs;

/// QualTypeVals - Pass a vector of arrays so that QualType names can be
/// compared to see if more information is needed to be printed.
SmallVector<intptr_t, 2> QualTypeVals;
SmallString<64> Tree;

for (unsigned i = 0, e = getNumArgs(); i < e; ++i)
8
←
Assuming 'i' is >= 'e'→
9
←
Loop condition is false. Execution continues on line 823→
32
←
Loop condition is false. Execution continues on line 823→
56
←
Loop condition is false. Execution continues on line 823→
  if (getArgKind(i) == DiagnosticsEngine::ak_qualtype)
    QualTypeVals.push_back(getRawArg(i));

while (DiagStr != DiagEnd) {
10
←
Assuming 'DiagStr' is not equal to 'DiagEnd'→
11
←
Loop condition is true.  Entering loop body→
33
←
Assuming 'DiagStr' is not equal to 'DiagEnd'→
34
←
Loop condition is true.  Entering loop body→
57
←
Assuming 'DiagStr' is not equal to 'DiagEnd'→
58
←
Loop condition is true.  Entering loop body→
  if (DiagStr[0] != '%') {
12
←
Assuming the condition is false→
13
←
Taking false branch→
35
←
Assuming the condition is false→
36
←
Taking false branch→
59
←
Array access (from variable 'DiagStr') results in a null pointer dereference
    // Append non-%0 substrings to Str if we have one.
    const char *StrEnd = std::find(DiagStr, DiagEnd, '%');
    OutStr.append(DiagStr, StrEnd);
    DiagStr = StrEnd;
    continue;
  } else if (isPunctuation(DiagStr[1])) {
14
←
Assuming the condition is false→
15
←
Taking false branch→
37
←
Assuming the condition is false→
38
←
Taking false branch→
    OutStr.push_back(DiagStr[1]);  // %% -> %.
    DiagStr += 2;
    continue;
  }

  // Skip the %.
  ++DiagStr;

  // This must be a placeholder for a diagnostic argument.  The format for a
  // placeholder is one of "%0", "%modifier0", or "%modifier{arguments}0".
  // The digit is a number from 0-9 indicating which argument this comes from.
  // The modifier is a string of digits from the set [-a-z]+, arguments is a
  // brace enclosed string.
  const char *Modifier = nullptr, *Argument = nullptr;
39
←
'Argument' initialized to a null pointer value→
  unsigned ModifierLen = 0, ArgumentLen = 0;

  // Check to see if we have a modifier.  If so eat it.
  if (!isDigit(DiagStr[0])) {
16
←
Assuming the condition is true→
17
←
Taking true branch→
40
←
Assuming the condition is false→
41
←
Taking false branch→
    Modifier = DiagStr;
    while (DiagStr[0] == '-' ||
18
←
Assuming the condition is false→
21
←
Loop condition is false. Execution continues on line 853→
           (DiagStr[0] >= 'a' && DiagStr[0] <= 'z'))
19
←
Assuming the condition is true→
20
←
Assuming the condition is false→
      ++DiagStr;
    ModifierLen = DiagStr-Modifier;

    // If we have an argument, get it next.
    if (DiagStr[0] == '{') {
22
←
Assuming the condition is true→
23
←
Taking true branch→
      ++DiagStr; // Skip {.
      Argument = DiagStr;

      DiagStr = ScanFormat(DiagStr, DiagEnd, '}');
      assert(DiagStr != DiagEnd && "Mismatched {}'s in diagnostic string!")((void)0);
      ArgumentLen = DiagStr-Argument;
      ++DiagStr;  // Skip }.
    }
  }

  assert(isDigit(*DiagStr) && "Invalid format for argument in diagnostic")((void)0);
  unsigned ArgNo = *DiagStr++ - '0';

  // Only used for type diffing.
  unsigned ArgNo2 = ArgNo;

  DiagnosticsEngine::ArgumentKind Kind = getArgKind(ArgNo);
  if (ModifierIs(Modifier, ModifierLen, "diff")) {
24
←
Taking false branch→
42
←
Calling 'ModifierIs<5UL>'→
44
←
Returning from 'ModifierIs<5UL>'→
45
←
Taking false branch→
    assert(*DiagStr == ',' && isDigit(*(DiagStr + 1)) &&((void)0)
           "Invalid format for diff modifier")((void)0);
    ++DiagStr;  // Comma.
    ArgNo2 = *DiagStr++ - '0';
    DiagnosticsEngine::ArgumentKind Kind2 = getArgKind(ArgNo2);
    if (Kind == DiagnosticsEngine::ak_qualtype &&
        Kind2 == DiagnosticsEngine::ak_qualtype)
      Kind = DiagnosticsEngine::ak_qualtype_pair;
    else {
      // %diff only supports QualTypes.  For other kinds of arguments,
      // use the default printing.  For example, if the modifier is:
      //   "%diff{compare $ to $|other text}1,2"
      // treat it as:
      //   "compare %1 to %2"
      const char *ArgumentEnd = Argument + ArgumentLen;
      const char *Pipe = ScanFormat(Argument, ArgumentEnd, '|');
      assert(ScanFormat(Pipe + 1, ArgumentEnd, '|') == ArgumentEnd &&((void)0)
             "Found too many '|'s in a %diff modifier!")((void)0);
      const char *FirstDollar = ScanFormat(Argument, Pipe, '$');
      const char *SecondDollar = ScanFormat(FirstDollar + 1, Pipe, '$');
      const char ArgStr1[] = { '%', static_cast<char>('0' + ArgNo) };
      const char ArgStr2[] = { '%', static_cast<char>('0' + ArgNo2) };
      FormatDiagnostic(Argument, FirstDollar, OutStr);
      FormatDiagnostic(ArgStr1, ArgStr1 + 2, OutStr);
      FormatDiagnostic(FirstDollar + 1, SecondDollar, OutStr);
      FormatDiagnostic(ArgStr2, ArgStr2 + 2, OutStr);
      FormatDiagnostic(SecondDollar + 1, Pipe, OutStr);
      continue;
    }
  }

  switch (Kind) {
25
←
Control jumps to 'case ak_qualtype_pair:'  at line 1014→
46
←
Control jumps to 'case ak_qualtype_pair:'  at line 1014→
  // ---- STRINGS ----
  case DiagnosticsEngine::ak_std_string: {
    const std::string &S = getArgStdStr(ArgNo);
    assert(ModifierLen == 0 && "No modifiers for strings yet")((void)0);
    OutStr.append(S.begin(), S.end());
    break;
  }
  case DiagnosticsEngine::ak_c_string: {
    const char *S = getArgCStr(ArgNo);
    assert(ModifierLen == 0 && "No modifiers for strings yet")((void)0);

    // Don't crash if get passed a null pointer by accident.
    if (!S)
      S = "(null)";

    OutStr.append(S, S + strlen(S));
    break;
  }
  // ---- INTEGERS ----
  case DiagnosticsEngine::ak_sint: {
    int Val = getArgSInt(ArgNo);

    if (ModifierIs(Modifier, ModifierLen, "select")) {
      HandleSelectModifier(*this, (unsigned)Val, Argument, ArgumentLen,
                           OutStr);
    } else if (ModifierIs(Modifier, ModifierLen, "s")) {
      HandleIntegerSModifier(Val, OutStr);
    } else if (ModifierIs(Modifier, ModifierLen, "plural")) {
      HandlePluralModifier(*this, (unsigned)Val, Argument, ArgumentLen,
                           OutStr);
    } else if (ModifierIs(Modifier, ModifierLen, "ordinal")) {
      HandleOrdinalModifier((unsigned)Val, OutStr);
    } else {
      assert(ModifierLen == 0 && "Unknown integer modifier")((void)0);
      llvm::raw_svector_ostream(OutStr) << Val;
    }
    break;
  }
  case DiagnosticsEngine::ak_uint: {
    unsigned Val = getArgUInt(ArgNo);

    if (ModifierIs(Modifier, ModifierLen, "select")) {
      HandleSelectModifier(*this, Val, Argument, ArgumentLen, OutStr);
    } else if (ModifierIs(Modifier, ModifierLen, "s")) {
      HandleIntegerSModifier(Val, OutStr);
    } else if (ModifierIs(Modifier, ModifierLen, "plural")) {
      HandlePluralModifier(*this, (unsigned)Val, Argument, ArgumentLen,
                           OutStr);
    } else if (ModifierIs(Modifier, ModifierLen, "ordinal")) {
      HandleOrdinalModifier(Val, OutStr);
    } else {
      assert(ModifierLen == 0 && "Unknown integer modifier")((void)0);
      llvm::raw_svector_ostream(OutStr) << Val;
    }
    break;
  }
  // ---- TOKEN SPELLINGS ----
  case DiagnosticsEngine::ak_tokenkind: {
    tok::TokenKind Kind = static_cast<tok::TokenKind>(getRawArg(ArgNo));
    assert(ModifierLen == 0 && "No modifiers for token kinds yet")((void)0);

    llvm::raw_svector_ostream Out(OutStr);
    if (const char *S = tok::getPunctuatorSpelling(Kind))
      // Quoted token spelling for punctuators.
      Out << '\'' << S << '\'';
    else if (const char *S = tok::getKeywordSpelling(Kind))
      // Unquoted token spelling for keywords.
      Out << S;
    else if (const char *S = getTokenDescForDiagnostic(Kind))
      // Unquoted translatable token name.
      Out << S;
    else if (const char *S = tok::getTokenName(Kind))
      // Debug name, shouldn't appear in user-facing diagnostics.
      Out << '<' << S << '>';
    else
      Out << "(null)";
    break;
  }
  // ---- NAMES and TYPES ----
  case DiagnosticsEngine::ak_identifierinfo: {
    const IdentifierInfo *II = getArgIdentifier(ArgNo);
    assert(ModifierLen == 0 && "No modifiers for strings yet")((void)0);

    // Don't crash if get passed a null pointer by accident.
    if (!II) {
      const char *S = "(null)";
      OutStr.append(S, S + strlen(S));
      continue;
    }

    llvm::raw_svector_ostream(OutStr) << '\'' << II->getName() << '\'';
    break;
  }
  case DiagnosticsEngine::ak_addrspace:
  case DiagnosticsEngine::ak_qual:
  case DiagnosticsEngine::ak_qualtype:
  case DiagnosticsEngine::ak_declarationname:
  case DiagnosticsEngine::ak_nameddecl:
  case DiagnosticsEngine::ak_nestednamespec:
  case DiagnosticsEngine::ak_declcontext:
  case DiagnosticsEngine::ak_attr:
    getDiags()->ConvertArgToString(Kind, getRawArg(ArgNo),
                                   StringRef(Modifier, ModifierLen),
                                   StringRef(Argument, ArgumentLen),
                                   FormattedArgs,
                                   OutStr, QualTypeVals);
    break;
  case DiagnosticsEngine::ak_qualtype_pair: {
    // Create a struct with all the info needed for printing.
    TemplateDiffTypes TDT;
    TDT.FromType = getRawArg(ArgNo);
    TDT.ToType = getRawArg(ArgNo2);
    TDT.ElideType = getDiags()->ElideType;
    TDT.ShowColors = getDiags()->ShowColors;
    TDT.TemplateDiffUsed = false;
    intptr_t val = reinterpret_cast<intptr_t>(&TDT);

    const char *ArgumentEnd = Argument + ArgumentLen;
    const char *Pipe = ScanFormat(Argument, ArgumentEnd, '|');

    // Print the tree.  If this diagnostic already has a tree, skip the
    // second tree.
    if (getDiags()->PrintTemplateTree46.1
Field 'PrintTemplateTree' is true
1
Field 'PrintTemplateTree' is true
 && Tree.empty()) {
26
←
Assuming field 'PrintTemplateTree' is true→
27
←
Taking true branch→
47
←
Calling 'SmallVectorBase::empty'→
50
←
Returning from 'SmallVectorBase::empty'→
51
←
Taking false branch→
      TDT.PrintFromType = true;
      TDT.PrintTree = true;
      getDiags()->ConvertArgToString(Kind, val,
                                     StringRef(Modifier, ModifierLen),
                                     StringRef(Argument, ArgumentLen),
                                     FormattedArgs,
                                     Tree, QualTypeVals);
      // If there is no tree information, fall back to regular printing.
      if (!Tree.empty()) {
28
←
Taking true branch→
        FormatDiagnostic(Pipe + 1, ArgumentEnd, OutStr);
29
←
Calling 'Diagnostic::FormatDiagnostic'→
        break;
      }
    }

    // Non-tree printing, also the fall-back when tree printing fails.
    // The fall-back is triggered when the types compared are not templates.
    const char *FirstDollar = ScanFormat(Argument, ArgumentEnd, '$');
    const char *SecondDollar = ScanFormat(FirstDollar + 1, ArgumentEnd, '$');

    // Append before text
    FormatDiagnostic(Argument, FirstDollar, OutStr);
52
←
Passing null pointer value via 1st parameter 'DiagStr'→
53
←
Calling 'Diagnostic::FormatDiagnostic'→

    // Append first type
    TDT.PrintTree = false;
    TDT.PrintFromType = true;
    getDiags()->ConvertArgToString(Kind, val,
                                   StringRef(Modifier, ModifierLen),
                                   StringRef(Argument, ArgumentLen),
                                   FormattedArgs,
                                   OutStr, QualTypeVals);
    if (!TDT.TemplateDiffUsed)
      FormattedArgs.push_back(std::make_pair(DiagnosticsEngine::ak_qualtype,
                                             TDT.FromType));

    // Append middle text
    FormatDiagnostic(FirstDollar + 1, SecondDollar, OutStr);

    // Append second type
    TDT.PrintFromType = false;
    getDiags()->ConvertArgToString(Kind, val,
                                   StringRef(Modifier, ModifierLen),
                                   StringRef(Argument, ArgumentLen),
                                   FormattedArgs,
                                   OutStr, QualTypeVals);
    if (!TDT.TemplateDiffUsed)
      FormattedArgs.push_back(std::make_pair(DiagnosticsEngine::ak_qualtype,
                                             TDT.ToType));

    // Append end text
    FormatDiagnostic(SecondDollar + 1, Pipe, OutStr);
    break;
  }
  }

  // Remember this argument info for subsequent formatting operations.  Turn
  // std::strings into a null terminated string to make it be the same case as
  // all the other ones.
  if (Kind == DiagnosticsEngine::ak_qualtype_pair)
    continue;
  else if (Kind != DiagnosticsEngine::ak_std_string)
    FormattedArgs.push_back(std::make_pair(Kind, getRawArg(ArgNo)));
  else
    FormattedArgs.push_back(std::make_pair(DiagnosticsEngine::ak_c_string,
                                      (intptr_t)getArgStdStr(ArgNo).c_str()));
}

// Append the type tree to the end of the diagnostics.
OutStr.append(Tree.begin(), Tree.end());
1098}

1100StoredDiagnostic::StoredDiagnostic(DiagnosticsEngine::Level Level, unsigned ID,
                                 StringRef Message)
  : ID(ID), Level(Level), Message(Message) {}

1104StoredDiagnostic::StoredDiagnostic(DiagnosticsEngine::Level Level,
                                 const Diagnostic &Info)
  : ID(Info.getID()), Level(Level) {
assert((Info.getLocation().isInvalid() || Info.hasSourceManager()) &&((void)0)
     "Valid source location without setting a source manager for diagnostic")((void)0);
if (Info.getLocation().isValid())
1
Taking false branch→
  Loc = FullSourceLoc(Info.getLocation(), Info.getSourceManager());
SmallString<64> Message;
Info.FormatDiagnostic(Message);
2
←
Calling 'Diagnostic::FormatDiagnostic'→
this->Message.assign(Message.begin(), Message.end());
this->Ranges.assign(Info.getRanges().begin(), Info.getRanges().end());
this->FixIts.assign(Info.getFixItHints().begin(), Info.getFixItHints().end());
1116}

1118StoredDiagnostic::StoredDiagnostic(DiagnosticsEngine::Level Level, unsigned ID,
                                 StringRef Message, FullSourceLoc Loc,
                                 ArrayRef<CharSourceRange> Ranges,
                                 ArrayRef<FixItHint> FixIts)
  : ID(ID), Level(Level), Loc(Loc), Message(Message),
    Ranges(Ranges.begin(), Ranges.end()), FixIts(FixIts.begin(), FixIts.end())
1124{
1125}

1127/// IncludeInDiagnosticCounts - This method (whose default implementation
1128///  returns true) indicates whether the diagnostics handled by this
1129///  DiagnosticConsumer should be included in the number of diagnostics
1130///  reported by DiagnosticsEngine.
1131bool DiagnosticConsumer::IncludeInDiagnosticCounts() const { return true; }

1133void IgnoringDiagConsumer::anchor() {}

1135ForwardingDiagnosticConsumer::~ForwardingDiagnosticConsumer() = default;

1137void ForwardingDiagnosticConsumer::HandleDiagnostic(
     DiagnosticsEngine::Level DiagLevel,
     const Diagnostic &Info) {
Target.HandleDiagnostic(DiagLevel, Info);
1141}

1143void ForwardingDiagnosticConsumer::clear() {
DiagnosticConsumer::clear();
Target.clear();
1146}

1148bool ForwardingDiagnosticConsumer::IncludeInDiagnosticCounts() const {
return Target.IncludeInDiagnosticCounts();
1150}

1152PartialDiagnostic::DiagStorageAllocator::DiagStorageAllocator() {
for (unsigned I = 0; I != NumCached; ++I)
  FreeList[I] = Cached + I;
NumFreeListEntries = NumCached;
1156}

1158PartialDiagnostic::DiagStorageAllocator::~DiagStorageAllocator() {
// Don't assert if we are in a CrashRecovery context, as this invariant may
// be invalidated during a crash.
assert((NumFreeListEntries == NumCached ||((void)0)
        llvm::CrashRecoveryContext::isRecoveringFromCrash()) &&((void)0)
       "A partial is on the lam")((void)0);
1164}

1166char DiagnosticError::ID;

←

/usr/src/gnu/usr.bin/clang/libclangBasic/../../../llvm/llvm/include/llvm/ADT/SmallVector.h

1//===- llvm/ADT/SmallVector.h - 'Normally small' vectors --------*- 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 SmallVector class.
10//
11//===----------------------------------------------------------------------===//

13#ifndef LLVM_ADT_SMALLVECTOR_H
14#define LLVM_ADT_SMALLVECTOR_H

16#include "llvm/ADT/iterator_range.h"
17#include "llvm/Support/Compiler.h"
18#include "llvm/Support/ErrorHandling.h"
19#include "llvm/Support/MemAlloc.h"
20#include "llvm/Support/type_traits.h"
21#include <algorithm>
22#include <cassert>
23#include <cstddef>
24#include <cstdlib>
25#include <cstring>
26#include <functional>
27#include <initializer_list>
28#include <iterator>
29#include <limits>
30#include <memory>
31#include <new>
32#include <type_traits>
33#include <utility>

35namespace llvm {

37/// This is all the stuff common to all SmallVectors.
38///
39/// The template parameter specifies the type which should be used to hold the
40/// Size and Capacity of the SmallVector, so it can be adjusted.
41/// Using 32 bit size is desirable to shrink the size of the SmallVector.
42/// Using 64 bit size is desirable for cases like SmallVector<char>, where a
43/// 32 bit size would limit the vector to ~4GB. SmallVectors are used for
44/// buffering bitcode output - which can exceed 4GB.
45template <class Size_T> class SmallVectorBase {
46protected:
void *BeginX;
Size_T Size = 0, Capacity;

/// The maximum value of the Size_T used.
static constexpr size_t SizeTypeMax() {
  return std::numeric_limits<Size_T>::max();
}

SmallVectorBase() = delete;
SmallVectorBase(void *FirstEl, size_t TotalCapacity)
    : BeginX(FirstEl), Capacity(TotalCapacity) {}

/// This is a helper for \a grow() that's out of line to reduce code
/// duplication.  This function will report a fatal error if it can't grow at
/// least to \p MinSize.
void *mallocForGrow(size_t MinSize, size_t TSize, size_t &NewCapacity);

/// This is an implementation of the grow() method which only works
/// on POD-like data types and is out of line to reduce code duplication.
/// This function will report a fatal error if it cannot increase capacity.
void grow_pod(void *FirstEl, size_t MinSize, size_t TSize);

69public:
size_t size() const { return Size; }
size_t capacity() const { return Capacity; }

LLVM_NODISCARD[[clang::warn_unused_result]] bool empty() const { return !Size; }
48
←
Assuming field 'Size' is not equal to 0→
49
←
Returning zero, which participates in a condition later→

/// Set the array size to \p N, which the current array must have enough
/// capacity for.
///
/// This does not construct or destroy any elements in the vector.
///
/// Clients can use this in conjunction with capacity() to write past the end
/// of the buffer when they know that more elements are available, and only
/// update the size later. This avoids the cost of value initializing elements
/// which will only be overwritten.
void set_size(size_t N) {
  assert(N <= capacity())((void)0);
  Size = N;
}
88};

90template <class T>
91using SmallVectorSizeType =
  typename std::conditional<sizeof(T) < 4 && sizeof(void *) >= 8, uint64_t,
                            uint32_t>::type;

95/// Figure out the offset of the first element.
96template <class T, typename = void> struct SmallVectorAlignmentAndSize {
alignas(SmallVectorBase<SmallVectorSizeType<T>>) char Base[sizeof(
    SmallVectorBase<SmallVectorSizeType<T>>)];
alignas(T) char FirstEl[sizeof(T)];
100};

102/// This is the part of SmallVectorTemplateBase which does not depend on whether
103/// the type T is a POD. The extra dummy template argument is used by ArrayRef
104/// to avoid unnecessarily requiring T to be complete.
105template <typename T, typename = void>
106class SmallVectorTemplateCommon
  : public SmallVectorBase<SmallVectorSizeType<T>> {
using Base = SmallVectorBase<SmallVectorSizeType<T>>;

/// Find the address of the first element.  For this pointer math to be valid
/// with small-size of 0 for T with lots of alignment, it's important that
/// SmallVectorStorage is properly-aligned even for small-size of 0.
void *getFirstEl() const {
  return const_cast<void *>(reinterpret_cast<const void *>(
      reinterpret_cast<const char *>(this) +
      offsetof(SmallVectorAlignmentAndSize<T>, FirstEl)__builtin_offsetof(SmallVectorAlignmentAndSize<T>, FirstEl
)));
}
// Space after 'FirstEl' is clobbered, do not add any instance vars after it.

120protected:
SmallVectorTemplateCommon(size_t Size) : Base(getFirstEl(), Size) {}

void grow_pod(size_t MinSize, size_t TSize) {
  Base::grow_pod(getFirstEl(), MinSize, TSize);
}

/// Return true if this is a smallvector which has not had dynamic
/// memory allocated for it.
bool isSmall() const { return this->BeginX == getFirstEl(); }

/// Put this vector in a state of being small.
void resetToSmall() {
  this->BeginX = getFirstEl();
  this->Size = this->Capacity = 0; // FIXME: Setting Capacity to 0 is suspect.
}

/// Return true if V is an internal reference to the given range.
bool isReferenceToRange(const void *V, const void *First, const void *Last) const {
  // Use std::less to avoid UB.
  std::less<> LessThan;
  return !LessThan(V, First) && LessThan(V, Last);
}

/// Return true if V is an internal reference to this vector.
bool isReferenceToStorage(const void *V) const {
  return isReferenceToRange(V, this->begin(), this->end());
}

/// Return true if First and Last form a valid (possibly empty) range in this
/// vector's storage.
bool isRangeInStorage(const void *First, const void *Last) const {
  // Use std::less to avoid UB.
  std::less<> LessThan;
  return !LessThan(First, this->begin()) && !LessThan(Last, First) &&
         !LessThan(this->end(), Last);
}

/// Return true unless Elt will be invalidated by resizing the vector to
/// NewSize.
bool isSafeToReferenceAfterResize(const void *Elt, size_t NewSize) {
  // Past the end.
  if (LLVM_LIKELY(!isReferenceToStorage(Elt))__builtin_expect((bool)(!isReferenceToStorage(Elt)), true))
    return true;

  // Return false if Elt will be destroyed by shrinking.
  if (NewSize <= this->size())
    return Elt < this->begin() + NewSize;

  // Return false if we need to grow.
  return NewSize <= this->capacity();
}

/// Check whether Elt will be invalidated by resizing the vector to NewSize.
void assertSafeToReferenceAfterResize(const void *Elt, size_t NewSize) {
  assert(isSafeToReferenceAfterResize(Elt, NewSize) &&((void)0)
         "Attempting to reference an element of the vector in an operation "((void)0)
         "that invalidates it")((void)0);
}

/// Check whether Elt will be invalidated by increasing the size of the
/// vector by N.
void assertSafeToAdd(const void *Elt, size_t N = 1) {
  this->assertSafeToReferenceAfterResize(Elt, this->size() + N);
}

/// Check whether any part of the range will be invalidated by clearing.
void assertSafeToReferenceAfterClear(const T *From, const T *To) {
  if (From == To)
    return;
  this->assertSafeToReferenceAfterResize(From, 0);
  this->assertSafeToReferenceAfterResize(To - 1, 0);
}
template <
    class ItTy,
    std::enable_if_t<!std::is_same<std::remove_const_t<ItTy>, T *>::value,
                     bool> = false>
void assertSafeToReferenceAfterClear(ItTy, ItTy) {}

/// Check whether any part of the range will be invalidated by growing.
void assertSafeToAddRange(const T *From, const T *To) {
  if (From == To)
    return;
  this->assertSafeToAdd(From, To - From);
  this->assertSafeToAdd(To - 1, To - From);
}
template <
    class ItTy,
    std::enable_if_t<!std::is_same<std::remove_const_t<ItTy>, T *>::value,
                     bool> = false>
void assertSafeToAddRange(ItTy, ItTy) {}

/// Reserve enough space to add one element, and return the updated element
/// pointer in case it was a reference to the storage.
template <class U>
static const T *reserveForParamAndGetAddressImpl(U *This, const T &Elt,
                                                 size_t N) {
  size_t NewSize = This->size() + N;
  if (LLVM_LIKELY(NewSize <= This->capacity())__builtin_expect((bool)(NewSize <= This->capacity()), true
))
    return &Elt;

  bool ReferencesStorage = false;
  int64_t Index = -1;
  if (!U::TakesParamByValue) {
    if (LLVM_UNLIKELY(This->isReferenceToStorage(&Elt))__builtin_expect((bool)(This->isReferenceToStorage(&Elt
)), false)) {
      ReferencesStorage = true;
      Index = &Elt - This->begin();
    }
  }
  This->grow(NewSize);
  return ReferencesStorage ? This->begin() + Index : &Elt;
}

233public:
using size_type = size_t;
using difference_type = ptrdiff_t;
using value_type = T;
using iterator = T *;
using const_iterator = const T *;

using const_reverse_iterator = std::reverse_iterator<const_iterator>;
using reverse_iterator = std::reverse_iterator<iterator>;

using reference = T &;
using const_reference = const T &;
using pointer = T *;
using const_pointer = const T *;

using Base::capacity;
using Base::empty;
using Base::size;

// forward iterator creation methods.
iterator begin() { return (iterator)this->BeginX; }
const_iterator begin() const { return (const_iterator)this->BeginX; }
iterator end() { return begin() + size(); }
const_iterator end() const { return begin() + size(); }

// reverse iterator creation methods.
reverse_iterator rbegin()            { return reverse_iterator(end()); }
const_reverse_iterator rbegin() const{ return const_reverse_iterator(end()); }
reverse_iterator rend()              { return reverse_iterator(begin()); }
const_reverse_iterator rend() const { return const_reverse_iterator(begin());}

size_type size_in_bytes() const { return size() * sizeof(T); }
size_type max_size() const {
  return std::min(this->SizeTypeMax(), size_type(-1) / sizeof(T));
}

size_t capacity_in_bytes() const { return capacity() * sizeof(T); }

/// Return a pointer to the vector's buffer, even if empty().
pointer data() { return pointer(begin()); }
/// Return a pointer to the vector's buffer, even if empty().
const_pointer data() const { return const_pointer(begin()); }

reference operator[](size_type idx) {
  assert(idx < size())((void)0);
  return begin()[idx];
}
const_reference operator[](size_type idx) const {
  assert(idx < size())((void)0);
  return begin()[idx];
}

reference front() {
  assert(!empty())((void)0);
  return begin()[0];
}
const_reference front() const {
  assert(!empty())((void)0);
  return begin()[0];
}

reference back() {
  assert(!empty())((void)0);
  return end()[-1];
}
const_reference back() const {
  assert(!empty())((void)0);
  return end()[-1];
}
302};

304/// SmallVectorTemplateBase<TriviallyCopyable = false> - This is where we put
305/// method implementations that are designed to work with non-trivial T's.
306///
307/// We approximate is_trivially_copyable with trivial move/copy construction and
308/// trivial destruction. While the standard doesn't specify that you're allowed
309/// copy these types with memcpy, there is no way for the type to observe this.
310/// This catches the important case of std::pair<POD, POD>, which is not
311/// trivially assignable.
312template <typename T, bool = (is_trivially_copy_constructible<T>::value) &&
                           (is_trivially_move_constructible<T>::value) &&
                           std::is_trivially_destructible<T>::value>
315class SmallVectorTemplateBase : public SmallVectorTemplateCommon<T> {
friend class SmallVectorTemplateCommon<T>;

318protected:
static constexpr bool TakesParamByValue = false;
using ValueParamT = const T &;

SmallVectorTemplateBase(size_t Size) : SmallVectorTemplateCommon<T>(Size) {}

static void destroy_range(T *S, T *E) {
  while (S != E) {
    --E;
    E->~T();
  }
}

/// Move the range [I, E) into the uninitialized memory starting with "Dest",
/// constructing elements as needed.
template<typename It1, typename It2>
static void uninitialized_move(It1 I, It1 E, It2 Dest) {
  std::uninitialized_copy(std::make_move_iterator(I),
                          std::make_move_iterator(E), Dest);
}

/// Copy the range [I, E) onto the uninitialized memory starting with "Dest",
/// constructing elements as needed.
template<typename It1, typename It2>
static void uninitialized_copy(It1 I, It1 E, It2 Dest) {
  std::uninitialized_copy(I, E, Dest);
}

/// Grow the allocated memory (without initializing new elements), doubling
/// the size of the allocated memory. Guarantees space for at least one more
/// element, or MinSize more elements if specified.
void grow(size_t MinSize = 0);

/// Create a new allocation big enough for \p MinSize and pass back its size
/// in \p NewCapacity. This is the first section of \a grow().
T *mallocForGrow(size_t MinSize, size_t &NewCapacity) {
  return static_cast<T *>(
      SmallVectorBase<SmallVectorSizeType<T>>::mallocForGrow(
          MinSize, sizeof(T), NewCapacity));
}

/// Move existing elements over to the new allocation \p NewElts, the middle
/// section of \a grow().
void moveElementsForGrow(T *NewElts);

/// Transfer ownership of the allocation, finishing up \a grow().
void takeAllocationForGrow(T *NewElts, size_t NewCapacity);

/// Reserve enough space to add one element, and return the updated element
/// pointer in case it was a reference to the storage.
const T *reserveForParamAndGetAddress(const T &Elt, size_t N = 1) {
  return this->reserveForParamAndGetAddressImpl(this, Elt, N);
}

/// Reserve enough space to add one element, and return the updated element
/// pointer in case it was a reference to the storage.
T *reserveForParamAndGetAddress(T &Elt, size_t N = 1) {
  return const_cast<T *>(
      this->reserveForParamAndGetAddressImpl(this, Elt, N));
}

static T &&forward_value_param(T &&V) { return std::move(V); }
static const T &forward_value_param(const T &V) { return V; }

void growAndAssign(size_t NumElts, const T &Elt) {
  // Grow manually in case Elt is an internal reference.
  size_t NewCapacity;
  T *NewElts = mallocForGrow(NumElts, NewCapacity);
  std::uninitialized_fill_n(NewElts, NumElts, Elt);
  this->destroy_range(this->begin(), this->end());
  takeAllocationForGrow(NewElts, NewCapacity);
  this->set_size(NumElts);
}

template <typename... ArgTypes> T &growAndEmplaceBack(ArgTypes &&... Args) {
  // Grow manually in case one of Args is an internal reference.
  size_t NewCapacity;
  T *NewElts = mallocForGrow(0, NewCapacity);
  ::new ((void *)(NewElts + this->size())) T(std::forward<ArgTypes>(Args)...);
  moveElementsForGrow(NewElts);
  takeAllocationForGrow(NewElts, NewCapacity);
  this->set_size(this->size() + 1);
  return this->back();
}

403public:
void push_back(const T &Elt) {
  const T *EltPtr = reserveForParamAndGetAddress(Elt);
  ::new ((void *)this->end()) T(*EltPtr);
  this->set_size(this->size() + 1);
}

void push_back(T &&Elt) {
  T *EltPtr = reserveForParamAndGetAddress(Elt);
  ::new ((void *)this->end()) T(::std::move(*EltPtr));
  this->set_size(this->size() + 1);
}

void pop_back() {
  this->set_size(this->size() - 1);
  this->end()->~T();
}
420};

422// Define this out-of-line to dissuade the C++ compiler from inlining it.
423template <typename T, bool TriviallyCopyable>
424void SmallVectorTemplateBase<T, TriviallyCopyable>::grow(size_t MinSize) {
size_t NewCapacity;
T *NewElts = mallocForGrow(MinSize, NewCapacity);
moveElementsForGrow(NewElts);
takeAllocationForGrow(NewElts, NewCapacity);
429}

431// Define this out-of-line to dissuade the C++ compiler from inlining it.
432template <typename T, bool TriviallyCopyable>
433void SmallVectorTemplateBase<T, TriviallyCopyable>::moveElementsForGrow(
  T *NewElts) {
// Move the elements over.
this->uninitialized_move(this->begin(), this->end(), NewElts);

// Destroy the original elements.
destroy_range(this->begin(), this->end());
440}

442// Define this out-of-line to dissuade the C++ compiler from inlining it.
443template <typename T, bool TriviallyCopyable>
444void SmallVectorTemplateBase<T, TriviallyCopyable>::takeAllocationForGrow(
  T *NewElts, size_t NewCapacity) {
// If this wasn't grown from the inline copy, deallocate the old space.
if (!this->isSmall())
  free(this->begin());

this->BeginX = NewElts;
this->Capacity = NewCapacity;
452}

454/// SmallVectorTemplateBase<TriviallyCopyable = true> - This is where we put
455/// method implementations that are designed to work with trivially copyable
456/// T's. This allows using memcpy in place of copy/move construction and
457/// skipping destruction.
458template <typename T>
459class SmallVectorTemplateBase<T, true> : public SmallVectorTemplateCommon<T> {
friend class SmallVectorTemplateCommon<T>;

462protected:
/// True if it's cheap enough to take parameters by value. Doing so avoids
/// overhead related to mitigations for reference invalidation.
static constexpr bool TakesParamByValue = sizeof(T) <= 2 * sizeof(void *);

/// Either const T& or T, depending on whether it's cheap enough to take
/// parameters by value.
using ValueParamT =
    typename std::conditional<TakesParamByValue, T, const T &>::type;

SmallVectorTemplateBase(size_t Size) : SmallVectorTemplateCommon<T>(Size) {}

// No need to do a destroy loop for POD's.
static void destroy_range(T *, T *) {}

/// Move the range [I, E) onto the uninitialized memory
/// starting with "Dest", constructing elements into it as needed.
template<typename It1, typename It2>
static void uninitialized_move(It1 I, It1 E, It2 Dest) {
  // Just do a copy.
  uninitialized_copy(I, E, Dest);
}

/// Copy the range [I, E) onto the uninitialized memory
/// starting with "Dest", constructing elements into it as needed.
template<typename It1, typename It2>
static void uninitialized_copy(It1 I, It1 E, It2 Dest) {
  // Arbitrary iterator types; just use the basic implementation.
  std::uninitialized_copy(I, E, Dest);
}

/// Copy the range [I, E) onto the uninitialized memory
/// starting with "Dest", constructing elements into it as needed.
template <typename T1, typename T2>
static void uninitialized_copy(
    T1 *I, T1 *E, T2 *Dest,
    std::enable_if_t<std::is_same<typename std::remove_const<T1>::type,
                                  T2>::value> * = nullptr) {
  // Use memcpy for PODs iterated by pointers (which includes SmallVector
  // iterators): std::uninitialized_copy optimizes to memmove, but we can
  // use memcpy here. Note that I and E are iterators and thus might be
  // invalid for memcpy if they are equal.
  if (I != E)
    memcpy(reinterpret_cast<void *>(Dest), I, (E - I) * sizeof(T));
}

/// Double the size of the allocated memory, guaranteeing space for at
/// least one more element or MinSize if specified.
void grow(size_t MinSize = 0) { this->grow_pod(MinSize, sizeof(T)); }

/// Reserve enough space to add one element, and return the updated element
/// pointer in case it was a reference to the storage.
const T *reserveForParamAndGetAddress(const T &Elt, size_t N = 1) {
  return this->reserveForParamAndGetAddressImpl(this, Elt, N);
}

/// Reserve enough space to add one element, and return the updated element
/// pointer in case it was a reference to the storage.
T *reserveForParamAndGetAddress(T &Elt, size_t N = 1) {
  return const_cast<T *>(
      this->reserveForParamAndGetAddressImpl(this, Elt, N));
}

/// Copy \p V or return a reference, depending on \a ValueParamT.
static ValueParamT forward_value_param(ValueParamT V) { return V; }

void growAndAssign(size_t NumElts, T Elt) {
  // Elt has been copied in case it's an internal reference, side-stepping
  // reference invalidation problems without losing the realloc optimization.
  this->set_size(0);
  this->grow(NumElts);
  std::uninitialized_fill_n(this->begin(), NumElts, Elt);
  this->set_size(NumElts);
}

template <typename... ArgTypes> T &growAndEmplaceBack(ArgTypes &&... Args) {
  // Use push_back with a copy in case Args has an internal reference,
  // side-stepping reference invalidation problems without losing the realloc
  // optimization.
  push_back(T(std::forward<ArgTypes>(Args)...));
  return this->back();
}

545public:
void push_back(ValueParamT Elt) {
  const T *EltPtr = reserveForParamAndGetAddress(Elt);
  memcpy(reinterpret_cast<void *>(this->end()), EltPtr, sizeof(T));
  this->set_size(this->size() + 1);
}

void pop_back() { this->set_size(this->size() - 1); }
553};

555/// This class consists of common code factored out of the SmallVector class to
556/// reduce code duplication based on the SmallVector 'N' template parameter.
557template <typename T>
558class SmallVectorImpl : public SmallVectorTemplateBase<T> {
using SuperClass = SmallVectorTemplateBase<T>;

561public:
using iterator = typename SuperClass::iterator;
using const_iterator = typename SuperClass::const_iterator;
using reference = typename SuperClass::reference;
using size_type = typename SuperClass::size_type;

567protected:
using SmallVectorTemplateBase<T>::TakesParamByValue;
using ValueParamT = typename SuperClass::ValueParamT;

// Default ctor - Initialize to empty.
explicit SmallVectorImpl(unsigned N)
    : SmallVectorTemplateBase<T>(N) {}

575public:
SmallVectorImpl(const SmallVectorImpl &) = delete;

~SmallVectorImpl() {
  // Subclass has already destructed this vector's elements.
  // If this wasn't grown from the inline copy, deallocate the old space.
  if (!this->isSmall())
    free(this->begin());
}

void clear() {
  this->destroy_range(this->begin(), this->end());
  this->Size = 0;
}

590private:
template <bool ForOverwrite> void resizeImpl(size_type N) {
  if (N < this->size()) {
    this->pop_back_n(this->size() - N);
  } else if (N > this->size()) {
    this->reserve(N);
    for (auto I = this->end(), E = this->begin() + N; I != E; ++I)
      if (ForOverwrite)
        new (&*I) T;
      else
        new (&*I) T();
    this->set_size(N);
  }
}

605public:
void resize(size_type N) { resizeImpl<false>(N); }

/// Like resize, but \ref T is POD, the new values won't be initialized.
void resize_for_overwrite(size_type N) { resizeImpl<true>(N); }

void resize(size_type N, ValueParamT NV) {
  if (N == this->size())
    return;

  if (N < this->size()) {
    this->pop_back_n(this->size() - N);
    return;
  }

  // N > this->size(). Defer to append.
  this->append(N - this->size(), NV);
}

void reserve(size_type N) {
  if (this->capacity() < N)
    this->grow(N);
}

void pop_back_n(size_type NumItems) {
  assert(this->size() >= NumItems)((void)0);
  this->destroy_range(this->end() - NumItems, this->end());
  this->set_size(this->size() - NumItems);
}

LLVM_NODISCARD[[clang::warn_unused_result]] T pop_back_val() {
  T Result = ::std::move(this->back());
  this->pop_back();
  return Result;
}

void swap(SmallVectorImpl &RHS);

/// Add the specified range to the end of the SmallVector.
template <typename in_iter,
          typename = std::enable_if_t<std::is_convertible<
              typename std::iterator_traits<in_iter>::iterator_category,
              std::input_iterator_tag>::value>>
void append(in_iter in_start, in_iter in_end) {
  this->assertSafeToAddRange(in_start, in_end);
  size_type NumInputs = std::distance(in_start, in_end);
  this->reserve(this->size() + NumInputs);
  this->uninitialized_copy(in_start, in_end, this->end());
  this->set_size(this->size() + NumInputs);
}

/// Append \p NumInputs copies of \p Elt to the end.
void append(size_type NumInputs, ValueParamT Elt) {
  const T *EltPtr = this->reserveForParamAndGetAddress(Elt, NumInputs);
  std::uninitialized_fill_n(this->end(), NumInputs, *EltPtr);
  this->set_size(this->size() + NumInputs);
}

void append(std::initializer_list<T> IL) {
  append(IL.begin(), IL.end());
}

void append(const SmallVectorImpl &RHS) { append(RHS.begin(), RHS.end()); }

void assign(size_type NumElts, ValueParamT Elt) {
  // Note that Elt could be an internal reference.
  if (NumElts > this->capacity()) {
    this->growAndAssign(NumElts, Elt);
    return;
  }

  // Assign over existing elements.
  std::fill_n(this->begin(), std::min(NumElts, this->size()), Elt);
  if (NumElts > this->size())
    std::uninitialized_fill_n(this->end(), NumElts - this->size(), Elt);
  else if (NumElts < this->size())
    this->destroy_range(this->begin() + NumElts, this->end());
  this->set_size(NumElts);
}

// FIXME: Consider assigning over existing elements, rather than clearing &
// re-initializing them - for all assign(...) variants.

template <typename in_iter,
          typename = std::enable_if_t<std::is_convertible<
              typename std::iterator_traits<in_iter>::iterator_category,
              std::input_iterator_tag>::value>>
void assign(in_iter in_start, in_iter in_end) {
  this->assertSafeToReferenceAfterClear(in_start, in_end);
  clear();
  append(in_start, in_end);
}

void assign(std::initializer_list<T> IL) {
  clear();
  append(IL);
}

void assign(const SmallVectorImpl &RHS) { assign(RHS.begin(), RHS.end()); }

iterator erase(const_iterator CI) {
  // Just cast away constness because this is a non-const member function.
  iterator I = const_cast<iterator>(CI);

  assert(this->isReferenceToStorage(CI) && "Iterator to erase is out of bounds.")((void)0);

  iterator N = I;
  // Shift all elts down one.
  std::move(I+1, this->end(), I);
  // Drop the last elt.
  this->pop_back();
  return(N);
}

iterator erase(const_iterator CS, const_iterator CE) {
  // Just cast away constness because this is a non-const member function.
  iterator S = const_cast<iterator>(CS);
  iterator E = const_cast<iterator>(CE);

  assert(this->isRangeInStorage(S, E) && "Range to erase is out of bounds.")((void)0);

  iterator N = S;
  // Shift all elts down.
  iterator I = std::move(E, this->end(), S);
  // Drop the last elts.
  this->destroy_range(I, this->end());
  this->set_size(I - this->begin());
  return(N);
}

735private:
template <class ArgType> iterator insert_one_impl(iterator I, ArgType &&Elt) {
  // Callers ensure that ArgType is derived from T.
  static_assert(
      std::is_same<std::remove_const_t<std::remove_reference_t<ArgType>>,
                   T>::value,
      "ArgType must be derived from T!");

  if (I == this->end()) {  // Important special case for empty vector.
    this->push_back(::std::forward<ArgType>(Elt));
    return this->end()-1;
  }

  assert(this->isReferenceToStorage(I) && "Insertion iterator is out of bounds.")((void)0);

  // Grow if necessary.
  size_t Index = I - this->begin();
  std::remove_reference_t<ArgType> *EltPtr =
      this->reserveForParamAndGetAddress(Elt);
  I = this->begin() + Index;

  ::new ((void*) this->end()) T(::std::move(this->back()));
  // Push everything else over.
  std::move_backward(I, this->end()-1, this->end());
  this->set_size(this->size() + 1);

  // If we just moved the element we're inserting, be sure to update
  // the reference (never happens if TakesParamByValue).
  static_assert(!TakesParamByValue || std::is_same<ArgType, T>::value,
                "ArgType must be 'T' when taking by value!");
  if (!TakesParamByValue && this->isReferenceToRange(EltPtr, I, this->end()))
    ++EltPtr;

  *I = ::std::forward<ArgType>(*EltPtr);
  return I;
}

772public:
iterator insert(iterator I, T &&Elt) {
  return insert_one_impl(I, this->forward_value_param(std::move(Elt)));
}

iterator insert(iterator I, const T &Elt) {
  return insert_one_impl(I, this->forward_value_param(Elt));
}

iterator insert(iterator I, size_type NumToInsert, ValueParamT Elt) {
  // Convert iterator to elt# to avoid invalidating iterator when we reserve()
  size_t InsertElt = I - this->begin();

  if (I == this->end()) {  // Important special case for empty vector.
    append(NumToInsert, Elt);
    return this->begin()+InsertElt;
  }

  assert(this->isReferenceToStorage(I) && "Insertion iterator is out of bounds.")((void)0);

  // Ensure there is enough space, and get the (maybe updated) address of
  // Elt.
  const T *EltPtr = this->reserveForParamAndGetAddress(Elt, NumToInsert);

  // Uninvalidate the iterator.
  I = this->begin()+InsertElt;

  // If there are more elements between the insertion point and the end of the
  // range than there are being inserted, we can use a simple approach to
  // insertion.  Since we already reserved space, we know that this won't
  // reallocate the vector.
  if (size_t(this->end()-I) >= NumToInsert) {
    T *OldEnd = this->end();
    append(std::move_iterator<iterator>(this->end() - NumToInsert),
           std::move_iterator<iterator>(this->end()));

    // Copy the existing elements that get replaced.
    std::move_backward(I, OldEnd-NumToInsert, OldEnd);

    // If we just moved the element we're inserting, be sure to update
    // the reference (never happens if TakesParamByValue).
    if (!TakesParamByValue && I <= EltPtr && EltPtr < this->end())
      EltPtr += NumToInsert;

    std::fill_n(I, NumToInsert, *EltPtr);
    return I;
  }

  // Otherwise, we're inserting more elements than exist already, and we're
  // not inserting at the end.

  // Move over the elements that we're about to overwrite.
  T *OldEnd = this->end();
  this->set_size(this->size() + NumToInsert);
  size_t NumOverwritten = OldEnd-I;
  this->uninitialized_move(I, OldEnd, this->end()-NumOverwritten);

  // If we just moved the element we're inserting, be sure to update
  // the reference (never happens if TakesParamByValue).
  if (!TakesParamByValue && I <= EltPtr && EltPtr < this->end())
    EltPtr += NumToInsert;

  // Replace the overwritten part.
  std::fill_n(I, NumOverwritten, *EltPtr);

  // Insert the non-overwritten middle part.
  std::uninitialized_fill_n(OldEnd, NumToInsert - NumOverwritten, *EltPtr);
  return I;
}

template <typename ItTy,
          typename = std::enable_if_t<std::is_convertible<
              typename std::iterator_traits<ItTy>::iterator_category,
              std::input_iterator_tag>::value>>
iterator insert(iterator I, ItTy From, ItTy To) {
  // Convert iterator to elt# to avoid invalidating iterator when we reserve()
  size_t InsertElt = I - this->begin();

  if (I == this->end()) {  // Important special case for empty vector.
    append(From, To);
    return this->begin()+InsertElt;
  }

  assert(this->isReferenceToStorage(I) && "Insertion iterator is out of bounds.")((void)0);

  // Check that the reserve that follows doesn't invalidate the iterators.
  this->assertSafeToAddRange(From, To);

  size_t NumToInsert = std::distance(From, To);

  // Ensure there is enough space.
  reserve(this->size() + NumToInsert);

  // Uninvalidate the iterator.
  I = this->begin()+InsertElt;

  // If there are more elements between the insertion point and the end of the
  // range than there are being inserted, we can use a simple approach to
  // insertion.  Since we already reserved space, we know that this won't
  // reallocate the vector.
  if (size_t(this->end()-I) >= NumToInsert) {
    T *OldEnd = this->end();
    append(std::move_iterator<iterator>(this->end() - NumToInsert),
           std::move_iterator<iterator>(this->end()));

    // Copy the existing elements that get replaced.
    std::move_backward(I, OldEnd-NumToInsert, OldEnd);

    std::copy(From, To, I);
    return I;
  }

  // Otherwise, we're inserting more elements than exist already, and we're
  // not inserting at the end.

  // Move over the elements that we're about to overwrite.
  T *OldEnd = this->end();
  this->set_size(this->size() + NumToInsert);
  size_t NumOverwritten = OldEnd-I;
  this->uninitialized_move(I, OldEnd, this->end()-NumOverwritten);

  // Replace the overwritten part.
  for (T *J = I; NumOverwritten > 0; --NumOverwritten) {
    *J = *From;
    ++J; ++From;
  }

  // Insert the non-overwritten middle part.
  this->uninitialized_copy(From, To, OldEnd);
  return I;
}

void insert(iterator I, std::initializer_list<T> IL) {
  insert(I, IL.begin(), IL.end());
}

template <typename... ArgTypes> reference emplace_back(ArgTypes &&... Args) {
  if (LLVM_UNLIKELY(this->size() >= this->capacity())__builtin_expect((bool)(this->size() >= this->capacity
()), false))
    return this->growAndEmplaceBack(std::forward<ArgTypes>(Args)...);

  ::new ((void *)this->end()) T(std::forward<ArgTypes>(Args)...);
  this->set_size(this->size() + 1);
  return this->back();
}

SmallVectorImpl &operator=(const SmallVectorImpl &RHS);

SmallVectorImpl &operator=(SmallVectorImpl &&RHS);

bool operator==(const SmallVectorImpl &RHS) const {
  if (this->size() != RHS.size()) return false;
  return std::equal(this->begin(), this->end(), RHS.begin());
}
bool operator!=(const SmallVectorImpl &RHS) const {
  return !(*this == RHS);
}

bool operator<(const SmallVectorImpl &RHS) const {
  return std::lexicographical_compare(this->begin(), this->end(),
                                      RHS.begin(), RHS.end());
}
933};

935template <typename T>
936void SmallVectorImpl<T>::swap(SmallVectorImpl<T> &RHS) {
if (this == &RHS) return;

// We can only avoid copying elements if neither vector is small.
if (!this->isSmall() && !RHS.isSmall()) {
  std::swap(this->BeginX, RHS.BeginX);
  std::swap(this->Size, RHS.Size);
  std::swap(this->Capacity, RHS.Capacity);
  return;
}
this->reserve(RHS.size());
RHS.reserve(this->size());

// Swap the shared elements.
size_t NumShared = this->size();
if (NumShared > RHS.size()) NumShared = RHS.size();
for (size_type i = 0; i != NumShared; ++i)
  std::swap((*this)[i], RHS[i]);

// Copy over the extra elts.
if (this->size() > RHS.size()) {
  size_t EltDiff = this->size() - RHS.size();
  this->uninitialized_copy(this->begin()+NumShared, this->end(), RHS.end());
  RHS.set_size(RHS.size() + EltDiff);
  this->destroy_range(this->begin()+NumShared, this->end());
  this->set_size(NumShared);
} else if (RHS.size() > this->size()) {
  size_t EltDiff = RHS.size() - this->size();
  this->uninitialized_copy(RHS.begin()+NumShared, RHS.end(), this->end());
  this->set_size(this->size() + EltDiff);
  this->destroy_range(RHS.begin()+NumShared, RHS.end());
  RHS.set_size(NumShared);
}
969}

971template <typename T>
972SmallVectorImpl<T> &SmallVectorImpl<T>::
operator=(const SmallVectorImpl<T> &RHS) {
// Avoid self-assignment.
if (this == &RHS) return *this;

// If we already have sufficient space, assign the common elements, then
// destroy any excess.
size_t RHSSize = RHS.size();
size_t CurSize = this->size();
if (CurSize >= RHSSize) {
  // Assign common elements.
  iterator NewEnd;
  if (RHSSize)
    NewEnd = std::copy(RHS.begin(), RHS.begin()+RHSSize, this->begin());
  else
    NewEnd = this->begin();

  // Destroy excess elements.
  this->destroy_range(NewEnd, this->end());

  // Trim.
  this->set_size(RHSSize);
  return *this;
}

// If we have to grow to have enough elements, destroy the current elements.
// This allows us to avoid copying them during the grow.
// FIXME: don't do this if they're efficiently moveable.
if (this->capacity() < RHSSize) {
  // Destroy current elements.
  this->clear();
  CurSize = 0;
  this->grow(RHSSize);
} else if (CurSize) {
  // Otherwise, use assignment for the already-constructed elements.
  std::copy(RHS.begin(), RHS.begin()+CurSize, this->begin());
}

// Copy construct the new elements in place.
this->uninitialized_copy(RHS.begin()+CurSize, RHS.end(),
                         this->begin()+CurSize);

// Set end.
this->set_size(RHSSize);
return *this;
1017}

1019template <typename T>
1020SmallVectorImpl<T> &SmallVectorImpl<T>::operator=(SmallVectorImpl<T> &&RHS) {
// Avoid self-assignment.
if (this == &RHS) return *this;

// If the RHS isn't small, clear this vector and then steal its buffer.
if (!RHS.isSmall()) {
  this->destroy_range(this->begin(), this->end());
  if (!this->isSmall()) free(this->begin());
  this->BeginX = RHS.BeginX;
  this->Size = RHS.Size;
  this->Capacity = RHS.Capacity;
  RHS.resetToSmall();
  return *this;
}

// If we already have sufficient space, assign the common elements, then
// destroy any excess.
size_t RHSSize = RHS.size();
size_t CurSize = this->size();
if (CurSize >= RHSSize) {
  // Assign common elements.
  iterator NewEnd = this->begin();
  if (RHSSize)
    NewEnd = std::move(RHS.begin(), RHS.end(), NewEnd);

  // Destroy excess elements and trim the bounds.
  this->destroy_range(NewEnd, this->end());
  this->set_size(RHSSize);

  // Clear the RHS.
  RHS.clear();

  return *this;
}

// If we have to grow to have enough elements, destroy the current elements.
// This allows us to avoid copying them during the grow.
// FIXME: this may not actually make any sense if we can efficiently move
// elements.
if (this->capacity() < RHSSize) {
  // Destroy current elements.
  this->clear();
  CurSize = 0;
  this->grow(RHSSize);
} else if (CurSize) {
  // Otherwise, use assignment for the already-constructed elements.
  std::move(RHS.begin(), RHS.begin()+CurSize, this->begin());
}

// Move-construct the new elements in place.
this->uninitialized_move(RHS.begin()+CurSize, RHS.end(),
                         this->begin()+CurSize);

// Set end.
this->set_size(RHSSize);

RHS.clear();
return *this;
1078}

1080/// Storage for the SmallVector elements.  This is specialized for the N=0 case
1081/// to avoid allocating unnecessary storage.
1082template <typename T, unsigned N>
1083struct SmallVectorStorage {
alignas(T) char InlineElts[N * sizeof(T)];
1085};

1087/// We need the storage to be properly aligned even for small-size of 0 so that
1088/// the pointer math in \a SmallVectorTemplateCommon::getFirstEl() is
1089/// well-defined.
1090template <typename T> struct alignas(T) SmallVectorStorage<T, 0> {};

1092/// Forward declaration of SmallVector so that
1093/// calculateSmallVectorDefaultInlinedElements can reference
1094/// `sizeof(SmallVector<T, 0>)`.
1095template <typename T, unsigned N> class LLVM_GSL_OWNER[[gsl::Owner]] SmallVector;

1097/// Helper class for calculating the default number of inline elements for
1098/// `SmallVector<T>`.
1099///
1100/// This should be migrated to a constexpr function when our minimum
1101/// compiler support is enough for multi-statement constexpr functions.
1102template <typename T> struct CalculateSmallVectorDefaultInlinedElements {
// Parameter controlling the default number of inlined elements
// for `SmallVector<T>`.
//
// The default number of inlined elements ensures that
// 1. There is at least one inlined element.
// 2. `sizeof(SmallVector<T>) <= kPreferredSmallVectorSizeof` unless
// it contradicts 1.
static constexpr size_t kPreferredSmallVectorSizeof = 64;

// static_assert that sizeof(T) is not "too big".
//
// Because our policy guarantees at least one inlined element, it is possible
// for an arbitrarily large inlined element to allocate an arbitrarily large
// amount of inline storage. We generally consider it an antipattern for a
// SmallVector to allocate an excessive amount of inline storage, so we want
// to call attention to these cases and make sure that users are making an
// intentional decision if they request a lot of inline storage.
//
// We want this assertion to trigger in pathological cases, but otherwise
// not be too easy to hit. To accomplish that, the cutoff is actually somewhat
// larger than kPreferredSmallVectorSizeof (otherwise,
// `SmallVector<SmallVector<T>>` would be one easy way to trip it, and that
// pattern seems useful in practice).
//
// One wrinkle is that this assertion is in theory non-portable, since
// sizeof(T) is in general platform-dependent. However, we don't expect this
// to be much of an issue, because most LLVM development happens on 64-bit
// hosts, and therefore sizeof(T) is expected to *decrease* when compiled for
// 32-bit hosts, dodging the issue. The reverse situation, where development
// happens on a 32-bit host and then fails due to sizeof(T) *increasing* on a
// 64-bit host, is expected to be very rare.
static_assert(
    sizeof(T) <= 256,
    "You are trying to use a default number of inlined elements for "
    "`SmallVector<T>` but `sizeof(T)` is really big! Please use an "
    "explicit number of inlined elements with `SmallVector<T, N>` to make "
    "sure you really want that much inline storage.");

// Discount the size of the header itself when calculating the maximum inline
// bytes.
static constexpr size_t PreferredInlineBytes =
    kPreferredSmallVectorSizeof - sizeof(SmallVector<T, 0>);
static constexpr size_t NumElementsThatFit = PreferredInlineBytes / sizeof(T);
static constexpr size_t value =
    NumElementsThatFit == 0 ? 1 : NumElementsThatFit;
1148};

1150/// This is a 'vector' (really, a variable-sized array), optimized
1151/// for the case when the array is small.  It contains some number of elements
1152/// in-place, which allows it to avoid heap allocation when the actual number of
1153/// elements is below that threshold.  This allows normal "small" cases to be
1154/// fast without losing generality for large inputs.
1155///
1156/// \note
1157/// In the absence of a well-motivated choice for the number of inlined
1158/// elements \p N, it is recommended to use \c SmallVector<T> (that is,
1159/// omitting the \p N). This will choose a default number of inlined elements
1160/// reasonable for allocation on the stack (for example, trying to keep \c
1161/// sizeof(SmallVector<T>) around 64 bytes).
1162///
1163/// \warning This does not attempt to be exception safe.
1164///
1165/// \see https://llvm.org/docs/ProgrammersManual.html#llvm-adt-smallvector-h
1166template <typename T,
        unsigned N = CalculateSmallVectorDefaultInlinedElements<T>::value>
1168class LLVM_GSL_OWNER[[gsl::Owner]] SmallVector : public SmallVectorImpl<T>,
                                 SmallVectorStorage<T, N> {
1170public:
SmallVector() : SmallVectorImpl<T>(N) {}

~SmallVector() {
  // Destroy the constructed elements in the vector.
  this->destroy_range(this->begin(), this->end());
}

explicit SmallVector(size_t Size, const T &Value = T())
  : SmallVectorImpl<T>(N) {
  this->assign(Size, Value);
}

template <typename ItTy,
          typename = std::enable_if_t<std::is_convertible<
              typename std::iterator_traits<ItTy>::iterator_category,
              std::input_iterator_tag>::value>>
SmallVector(ItTy S, ItTy E) : SmallVectorImpl<T>(N) {
  this->append(S, E);
}

template <typename RangeTy>
explicit SmallVector(const iterator_range<RangeTy> &R)
    : SmallVectorImpl<T>(N) {
  this->append(R.begin(), R.end());
}

SmallVector(std::initializer_list<T> IL) : SmallVectorImpl<T>(N) {
  this->assign(IL);
}

SmallVector(const SmallVector &RHS) : SmallVectorImpl<T>(N) {
  if (!RHS.empty())
    SmallVectorImpl<T>::operator=(RHS);
}

SmallVector &operator=(const SmallVector &RHS) {
  SmallVectorImpl<T>::operator=(RHS);
  return *this;
}

SmallVector(SmallVector &&RHS) : SmallVectorImpl<T>(N) {
  if (!RHS.empty())
    SmallVectorImpl<T>::operator=(::std::move(RHS));
}

SmallVector(SmallVectorImpl<T> &&RHS) : SmallVectorImpl<T>(N) {
  if (!RHS.empty())
    SmallVectorImpl<T>::operator=(::std::move(RHS));
}

SmallVector &operator=(SmallVector &&RHS) {
  SmallVectorImpl<T>::operator=(::std::move(RHS));
  return *this;
}

SmallVector &operator=(SmallVectorImpl<T> &&RHS) {
  SmallVectorImpl<T>::operator=(::std::move(RHS));
  return *this;
}

SmallVector &operator=(std::initializer_list<T> IL) {
  this->assign(IL);
  return *this;
}
1235};

1237template <typename T, unsigned N>
1238inline size_t capacity_in_bytes(const SmallVector<T, N> &X) {
return X.capacity_in_bytes();
1240}

1242/// Given a range of type R, iterate the entire range and return a
1243/// SmallVector with elements of the vector.  This is useful, for example,
1244/// when you want to iterate a range and then sort the results.
1245template <unsigned Size, typename R>
1246SmallVector<typename std::remove_const<typename std::remove_reference<
              decltype(*std::begin(std::declval<R &>()))>::type>::type,
          Size>
1249to_vector(R &&Range) {
return {std::begin(Range), std::end(Range)};
1251}

1253} // end namespace llvm

1255namespace std {

/// Implement std::swap in terms of SmallVector swap.
template<typename T>
inline void
swap(llvm::SmallVectorImpl<T> &LHS, llvm::SmallVectorImpl<T> &RHS) {
  LHS.swap(RHS);
}

/// Implement std::swap in terms of SmallVector swap.
template<typename T, unsigned N>
inline void
swap(llvm::SmallVector<T, N> &LHS, llvm::SmallVector<T, N> &RHS) {
  LHS.swap(RHS);
}

1271} // end namespace std

1273#endif // LLVM_ADT_SMALLVECTOR_H