/build/source/clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp

Bug Summary

File:	build/source/clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp
Warning:	line 1547, column 17 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 -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name CStringChecker.cpp -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 -relaxed-aliasing -fmath-errno -ffp-contract=on -fno-rounding-math -mconstructor-aliases -funwind-tables=2 -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -ffunction-sections -fdata-sections -fcoverage-compilation-dir=/build/source/build-llvm/tools/clang/stage2-bins -resource-dir /usr/lib/llvm-17/lib/clang/17 -I tools/clang/lib/StaticAnalyzer/Checkers -I /build/source/clang/lib/StaticAnalyzer/Checkers -I /build/source/clang/include -I tools/clang/include -I include -I /build/source/llvm/include -D CLANG_REPOSITORY_STRING="++20230206101206+d453d73d0d04-1~exp1~20230206221324.1090" -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -D _FORTIFY_SOURCE=2 -D NDEBUG -U 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-17/lib/clang/17/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 -fmacro-prefix-map=/build/source/build-llvm/tools/clang/stage2-bins=build-llvm/tools/clang/stage2-bins -fmacro-prefix-map=/build/source/= -fcoverage-prefix-map=/build/source/build-llvm/tools/clang/stage2-bins=build-llvm/tools/clang/stage2-bins -fcoverage-prefix-map=/build/source/= -source-date-epoch 1675721604 -O2 -Wno-unused-command-line-argument -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 -Wno-misleading-indentation -std=c++17 -fdeprecated-macro -fdebug-compilation-dir=/build/source/build-llvm/tools/clang/stage2-bins -fdebug-prefix-map=/build/source/build-llvm/tools/clang/stage2-bins=build-llvm/tools/clang/stage2-bins -fdebug-prefix-map=/build/source/= -ferror-limit 19 -fvisibility-inlines-hidden -stack-protector 2 -fgnuc-version=4.2.1 -fcolor-diagnostics -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-2023-02-07-030702-17298-1 -x c++ /build/source/clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp

/build/source/clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp

→

1//= CStringChecker.cpp - Checks calls to C string functions --------*- 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 defines CStringChecker, which is an assortment of checks on calls
10// to functions in <string.h>.
11//
12//===----------------------------------------------------------------------===//

14#include "InterCheckerAPI.h"
15#include "clang/Basic/CharInfo.h"
16#include "clang/StaticAnalyzer/Checkers/BuiltinCheckerRegistration.h"
17#include "clang/StaticAnalyzer/Core/BugReporter/BugType.h"
18#include "clang/StaticAnalyzer/Core/Checker.h"
19#include "clang/StaticAnalyzer/Core/CheckerManager.h"
20#include "clang/StaticAnalyzer/Core/PathSensitive/CallDescription.h"
21#include "clang/StaticAnalyzer/Core/PathSensitive/CallEvent.h"
22#include "clang/StaticAnalyzer/Core/PathSensitive/CheckerContext.h"
23#include "clang/StaticAnalyzer/Core/PathSensitive/DynamicExtent.h"
24#include "clang/StaticAnalyzer/Core/PathSensitive/ProgramStateTrait.h"
25#include "llvm/ADT/STLExtras.h"
26#include "llvm/ADT/SmallString.h"
27#include "llvm/ADT/StringExtras.h"
28#include "llvm/Support/raw_ostream.h"
29#include <functional>
30#include <optional>

32using namespace clang;
33using namespace ento;
34using namespace std::placeholders;

36namespace {
37struct AnyArgExpr {
// FIXME: Remove constructor in C++17 to turn it into an aggregate.
AnyArgExpr(const Expr *Expression, unsigned ArgumentIndex)
    : Expression{Expression}, ArgumentIndex{ArgumentIndex} {}
const Expr *Expression;
unsigned ArgumentIndex;
43};

45struct SourceArgExpr : AnyArgExpr {
using AnyArgExpr::AnyArgExpr; // FIXME: Remove using in C++17.
47};

49struct DestinationArgExpr : AnyArgExpr {
using AnyArgExpr::AnyArgExpr; // FIXME: Same.
51};

53struct SizeArgExpr : AnyArgExpr {
using AnyArgExpr::AnyArgExpr; // FIXME: Same.
55};

57using ErrorMessage = SmallString<128>;
58enum class AccessKind { write, read };

60static ErrorMessage createOutOfBoundErrorMsg(StringRef FunctionDescription,
                                           AccessKind Access) {
ErrorMessage Message;
llvm::raw_svector_ostream Os(Message);

// Function classification like: Memory copy function
Os << toUppercase(FunctionDescription.front())
   << &FunctionDescription.data()[1];

if (Access == AccessKind::write) {
  Os << " overflows the destination buffer";
} else { // read access
  Os << " accesses out-of-bound array element";
}

return Message;
76}

78enum class ConcatFnKind { none = 0, strcat = 1, strlcat = 2 };

80enum class CharKind { Regular = 0, Wide };
81constexpr CharKind CK_Regular = CharKind::Regular;
82constexpr CharKind CK_Wide = CharKind::Wide;

84static QualType getCharPtrType(ASTContext &Ctx, CharKind CK) {
return Ctx.getPointerType(CK == CharKind::Regular ? Ctx.CharTy
                                                  : Ctx.WideCharTy);
87}

89class CStringChecker : public Checker< eval::Call,
                                       check::PreStmt<DeclStmt>,
                                       check::LiveSymbols,
                                       check::DeadSymbols,
                                       check::RegionChanges
                                       > {
mutable std::unique_ptr<BugType> BT_Null, BT_Bounds, BT_Overlap,
    BT_NotCString, BT_AdditionOverflow, BT_UninitRead;

mutable const char *CurrentFunctionDescription;

100public:
/// The filter is used to filter out the diagnostics which are not enabled by
/// the user.
struct CStringChecksFilter {
  bool CheckCStringNullArg = false;
  bool CheckCStringOutOfBounds = false;
  bool CheckCStringBufferOverlap = false;
  bool CheckCStringNotNullTerm = false;
  bool CheckCStringUninitializedRead = false;

  CheckerNameRef CheckNameCStringNullArg;
  CheckerNameRef CheckNameCStringOutOfBounds;
  CheckerNameRef CheckNameCStringBufferOverlap;
  CheckerNameRef CheckNameCStringNotNullTerm;
  CheckerNameRef CheckNameCStringUninitializedRead;
};

CStringChecksFilter Filter;

static void *getTag() { static int tag; return &tag; }

bool evalCall(const CallEvent &Call, CheckerContext &C) const;
void checkPreStmt(const DeclStmt *DS, CheckerContext &C) const;
void checkLiveSymbols(ProgramStateRef state, SymbolReaper &SR) const;
void checkDeadSymbols(SymbolReaper &SR, CheckerContext &C) const;

ProgramStateRef
  checkRegionChanges(ProgramStateRef state,
                     const InvalidatedSymbols *,
                     ArrayRef<const MemRegion *> ExplicitRegions,
                     ArrayRef<const MemRegion *> Regions,
                     const LocationContext *LCtx,
                     const CallEvent *Call) const;

using FnCheck = std::function<void(const CStringChecker *, CheckerContext &,
                                   const CallExpr *)>;

CallDescriptionMap<FnCheck> Callbacks = {
    {{CDF_MaybeBuiltin, {"memcpy"}, 3},
     std::bind(&CStringChecker::evalMemcpy, _1, _2, _3, CK_Regular)},
    {{CDF_MaybeBuiltin, {"wmemcpy"}, 3},
     std::bind(&CStringChecker::evalMemcpy, _1, _2, _3, CK_Wide)},
    {{CDF_MaybeBuiltin, {"mempcpy"}, 3},
     std::bind(&CStringChecker::evalMempcpy, _1, _2, _3, CK_Regular)},
    {{CDF_None, {"wmempcpy"}, 3},
     std::bind(&CStringChecker::evalMempcpy, _1, _2, _3, CK_Wide)},
    {{CDF_MaybeBuiltin, {"memcmp"}, 3},
     std::bind(&CStringChecker::evalMemcmp, _1, _2, _3, CK_Regular)},
    {{CDF_MaybeBuiltin, {"wmemcmp"}, 3},
     std::bind(&CStringChecker::evalMemcmp, _1, _2, _3, CK_Wide)},
    {{CDF_MaybeBuiltin, {"memmove"}, 3},
     std::bind(&CStringChecker::evalMemmove, _1, _2, _3, CK_Regular)},
    {{CDF_MaybeBuiltin, {"wmemmove"}, 3},
     std::bind(&CStringChecker::evalMemmove, _1, _2, _3, CK_Wide)},
    {{CDF_MaybeBuiltin, {"memset"}, 3}, &CStringChecker::evalMemset},
    {{CDF_MaybeBuiltin, {"explicit_memset"}, 3}, &CStringChecker::evalMemset},
    {{CDF_MaybeBuiltin, {"strcpy"}, 2}, &CStringChecker::evalStrcpy},
    {{CDF_MaybeBuiltin, {"strncpy"}, 3}, &CStringChecker::evalStrncpy},
    {{CDF_MaybeBuiltin, {"stpcpy"}, 2}, &CStringChecker::evalStpcpy},
    {{CDF_MaybeBuiltin, {"strlcpy"}, 3}, &CStringChecker::evalStrlcpy},
    {{CDF_MaybeBuiltin, {"strcat"}, 2}, &CStringChecker::evalStrcat},
    {{CDF_MaybeBuiltin, {"strncat"}, 3}, &CStringChecker::evalStrncat},
    {{CDF_MaybeBuiltin, {"strlcat"}, 3}, &CStringChecker::evalStrlcat},
    {{CDF_MaybeBuiltin, {"strlen"}, 1}, &CStringChecker::evalstrLength},
    {{CDF_MaybeBuiltin, {"wcslen"}, 1}, &CStringChecker::evalstrLength},
    {{CDF_MaybeBuiltin, {"strnlen"}, 2}, &CStringChecker::evalstrnLength},
    {{CDF_MaybeBuiltin, {"wcsnlen"}, 2}, &CStringChecker::evalstrnLength},
    {{CDF_MaybeBuiltin, {"strcmp"}, 2}, &CStringChecker::evalStrcmp},
    {{CDF_MaybeBuiltin, {"strncmp"}, 3}, &CStringChecker::evalStrncmp},
    {{CDF_MaybeBuiltin, {"strcasecmp"}, 2}, &CStringChecker::evalStrcasecmp},
    {{CDF_MaybeBuiltin, {"strncasecmp"}, 3},
     &CStringChecker::evalStrncasecmp},
    {{CDF_MaybeBuiltin, {"strsep"}, 2}, &CStringChecker::evalStrsep},
    {{CDF_MaybeBuiltin, {"bcopy"}, 3}, &CStringChecker::evalBcopy},
    {{CDF_MaybeBuiltin, {"bcmp"}, 3},
     std::bind(&CStringChecker::evalMemcmp, _1, _2, _3, CK_Regular)},
    {{CDF_MaybeBuiltin, {"bzero"}, 2}, &CStringChecker::evalBzero},
    {{CDF_MaybeBuiltin, {"explicit_bzero"}, 2}, &CStringChecker::evalBzero},
};

// These require a bit of special handling.
CallDescription StdCopy{{"std", "copy"}, 3},
    StdCopyBackward{{"std", "copy_backward"}, 3};

FnCheck identifyCall(const CallEvent &Call, CheckerContext &C) const;
void evalMemcpy(CheckerContext &C, const CallExpr *CE, CharKind CK) const;
void evalMempcpy(CheckerContext &C, const CallExpr *CE, CharKind CK) const;
void evalMemmove(CheckerContext &C, const CallExpr *CE, CharKind CK) const;
void evalBcopy(CheckerContext &C, const CallExpr *CE) const;
void evalCopyCommon(CheckerContext &C, const CallExpr *CE,
                    ProgramStateRef state, SizeArgExpr Size,
                    DestinationArgExpr Dest, SourceArgExpr Source,
                    bool Restricted, bool IsMempcpy, CharKind CK) const;

void evalMemcmp(CheckerContext &C, const CallExpr *CE, CharKind CK) const;

void evalstrLength(CheckerContext &C, const CallExpr *CE) const;
void evalstrnLength(CheckerContext &C, const CallExpr *CE) const;
void evalstrLengthCommon(CheckerContext &C,
                         const CallExpr *CE,
                         bool IsStrnlen = false) const;

void evalStrcpy(CheckerContext &C, const CallExpr *CE) const;
void evalStrncpy(CheckerContext &C, const CallExpr *CE) const;
void evalStpcpy(CheckerContext &C, const CallExpr *CE) const;
void evalStrlcpy(CheckerContext &C, const CallExpr *CE) const;
void evalStrcpyCommon(CheckerContext &C, const CallExpr *CE, bool ReturnEnd,
                      bool IsBounded, ConcatFnKind appendK,
                      bool returnPtr = true) const;

void evalStrcat(CheckerContext &C, const CallExpr *CE) const;
void evalStrncat(CheckerContext &C, const CallExpr *CE) const;
void evalStrlcat(CheckerContext &C, const CallExpr *CE) const;

void evalStrcmp(CheckerContext &C, const CallExpr *CE) const;
void evalStrncmp(CheckerContext &C, const CallExpr *CE) const;
void evalStrcasecmp(CheckerContext &C, const CallExpr *CE) const;
void evalStrncasecmp(CheckerContext &C, const CallExpr *CE) const;
void evalStrcmpCommon(CheckerContext &C,
                      const CallExpr *CE,
                      bool IsBounded = false,
                      bool IgnoreCase = false) const;

void evalStrsep(CheckerContext &C, const CallExpr *CE) const;

void evalStdCopy(CheckerContext &C, const CallExpr *CE) const;
void evalStdCopyBackward(CheckerContext &C, const CallExpr *CE) const;
void evalStdCopyCommon(CheckerContext &C, const CallExpr *CE) const;
void evalMemset(CheckerContext &C, const CallExpr *CE) const;
void evalBzero(CheckerContext &C, const CallExpr *CE) const;

// Utility methods
std::pair<ProgramStateRef , ProgramStateRef >
static assumeZero(CheckerContext &C,
                  ProgramStateRef state, SVal V, QualType Ty);

static ProgramStateRef setCStringLength(ProgramStateRef state,
                                            const MemRegion *MR,
                                            SVal strLength);
static SVal getCStringLengthForRegion(CheckerContext &C,
                                      ProgramStateRef &state,
                                      const Expr *Ex,
                                      const MemRegion *MR,
                                      bool hypothetical);
SVal getCStringLength(CheckerContext &C,
                      ProgramStateRef &state,
                      const Expr *Ex,
                      SVal Buf,
                      bool hypothetical = false) const;

const StringLiteral *getCStringLiteral(CheckerContext &C,
                                       ProgramStateRef &state,
                                       const Expr *expr,
                                       SVal val) const;

static ProgramStateRef InvalidateBuffer(CheckerContext &C,
                                        ProgramStateRef state,
                                        const Expr *Ex, SVal V,
                                        bool IsSourceBuffer,
                                        const Expr *Size);

static bool SummarizeRegion(raw_ostream &os, ASTContext &Ctx,
                            const MemRegion *MR);

static bool memsetAux(const Expr *DstBuffer, SVal CharE,
                      const Expr *Size, CheckerContext &C,
                      ProgramStateRef &State);

// Re-usable checks
ProgramStateRef checkNonNull(CheckerContext &C, ProgramStateRef State,
                             AnyArgExpr Arg, SVal l) const;
ProgramStateRef CheckLocation(CheckerContext &C, ProgramStateRef state,
                              AnyArgExpr Buffer, SVal Element,
                              AccessKind Access,
                              CharKind CK = CharKind::Regular) const;
ProgramStateRef CheckBufferAccess(CheckerContext &C, ProgramStateRef State,
                                  AnyArgExpr Buffer, SizeArgExpr Size,
                                  AccessKind Access,
                                  CharKind CK = CharKind::Regular) const;
ProgramStateRef CheckOverlap(CheckerContext &C, ProgramStateRef state,
                             SizeArgExpr Size, AnyArgExpr First,
                             AnyArgExpr Second,
                             CharKind CK = CharKind::Regular) const;
void emitOverlapBug(CheckerContext &C,
                    ProgramStateRef state,
                    const Stmt *First,
                    const Stmt *Second) const;

void emitNullArgBug(CheckerContext &C, ProgramStateRef State, const Stmt *S,
                    StringRef WarningMsg) const;
void emitOutOfBoundsBug(CheckerContext &C, ProgramStateRef State,
                        const Stmt *S, StringRef WarningMsg) const;
void emitNotCStringBug(CheckerContext &C, ProgramStateRef State,
                       const Stmt *S, StringRef WarningMsg) const;
void emitAdditionOverflowBug(CheckerContext &C, ProgramStateRef State) const;
void emitUninitializedReadBug(CheckerContext &C, ProgramStateRef State,
                           const Expr *E) const;
ProgramStateRef checkAdditionOverflow(CheckerContext &C,
                                          ProgramStateRef state,
                                          NonLoc left,
                                          NonLoc right) const;

// Return true if the destination buffer of the copy function may be in bound.
// Expects SVal of Size to be positive and unsigned.
// Expects SVal of FirstBuf to be a FieldRegion.
static bool IsFirstBufInBound(CheckerContext &C,
                              ProgramStateRef state,
                              const Expr *FirstBuf,
                              const Expr *Size);
309};

311} //end anonymous namespace

313REGISTER_MAP_WITH_PROGRAMSTATE(CStringLength, const MemRegion *, SVal)namespace { class CStringLength {}; using CStringLengthTy = llvm
::ImmutableMap<const MemRegion *, SVal>; } namespace clang
 { namespace ento { template <> struct ProgramStateTrait
<CStringLength> : public ProgramStatePartialTrait<CStringLengthTy
> { static void *GDMIndex() { static int Index; return &
Index; } }; } }

315//===----------------------------------------------------------------------===//
316// Individual checks and utility methods.
317//===----------------------------------------------------------------------===//

319std::pair<ProgramStateRef , ProgramStateRef >
320CStringChecker::assumeZero(CheckerContext &C, ProgramStateRef state, SVal V,
                         QualType Ty) {
std::optional<DefinedSVal> val = V.getAs<DefinedSVal>();
if (!val)
  return std::pair<ProgramStateRef , ProgramStateRef >(state, state);

SValBuilder &svalBuilder = C.getSValBuilder();
DefinedOrUnknownSVal zero = svalBuilder.makeZeroVal(Ty);
return state->assume(svalBuilder.evalEQ(state, *val, zero));
329}

331ProgramStateRef CStringChecker::checkNonNull(CheckerContext &C,
                                           ProgramStateRef State,
                                           AnyArgExpr Arg, SVal l) const {
// If a previous check has failed, propagate the failure.
if (!State)
  return nullptr;

ProgramStateRef stateNull, stateNonNull;
std::tie(stateNull, stateNonNull) =
    assumeZero(C, State, l, Arg.Expression->getType());

if (stateNull && !stateNonNull) {
  if (Filter.CheckCStringNullArg) {
    SmallString<80> buf;
    llvm::raw_svector_ostream OS(buf);
    assert(CurrentFunctionDescription)(static_cast <bool> (CurrentFunctionDescription) ? void
 (0) : __assert_fail ("CurrentFunctionDescription", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 346, __extension__ __PRETTY_FUNCTION__));
    OS << "Null pointer passed as " << (Arg.ArgumentIndex + 1)
       << llvm::getOrdinalSuffix(Arg.ArgumentIndex + 1) << " argument to "
       << CurrentFunctionDescription;

    emitNullArgBug(C, stateNull, Arg.Expression, OS.str());
  }
  return nullptr;
}

// From here on, assume that the value is non-null.
assert(stateNonNull)(static_cast <bool> (stateNonNull) ? void (0) : __assert_fail
 ("stateNonNull", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 357, __extension__ __PRETTY_FUNCTION__));
return stateNonNull;
359}

361// FIXME: This was originally copied from ArrayBoundChecker.cpp. Refactor?
362ProgramStateRef CStringChecker::CheckLocation(CheckerContext &C,
                                            ProgramStateRef state,
                                            AnyArgExpr Buffer, SVal Element,
                                            AccessKind Access,
                                            CharKind CK) const {

// If a previous check has failed, propagate the failure.
if (!state)
  return nullptr;

// Check for out of bound array element access.
const MemRegion *R = Element.getAsRegion();
if (!R)
  return state;

const auto *ER = dyn_cast<ElementRegion>(R);
if (!ER)
  return state;

SValBuilder &svalBuilder = C.getSValBuilder();
ASTContext &Ctx = svalBuilder.getContext();

// Get the index of the accessed element.
NonLoc Idx = ER->getIndex();

if (CK == CharKind::Regular) {
  if (ER->getValueType() != Ctx.CharTy)
    return state;
} else {
  if (ER->getValueType() != Ctx.WideCharTy)
    return state;

  QualType SizeTy = Ctx.getSizeType();
  NonLoc WideSize =
      svalBuilder
          .makeIntVal(Ctx.getTypeSizeInChars(Ctx.WideCharTy).getQuantity(),
                      SizeTy)
          .castAs<NonLoc>();
  SVal Offset = svalBuilder.evalBinOpNN(state, BO_Mul, Idx, WideSize, SizeTy);
  if (Offset.isUnknown())
    return state;
  Idx = Offset.castAs<NonLoc>();
}

// Get the size of the array.
const auto *superReg = cast<SubRegion>(ER->getSuperRegion());
DefinedOrUnknownSVal Size =
    getDynamicExtent(state, superReg, C.getSValBuilder());

ProgramStateRef StInBound, StOutBound;
std::tie(StInBound, StOutBound) = state->assumeInBoundDual(Idx, Size);
if (StOutBound && !StInBound) {
  // These checks are either enabled by the CString out-of-bounds checker
  // explicitly or implicitly by the Malloc checker.
  // In the latter case we only do modeling but do not emit warning.
  if (!Filter.CheckCStringOutOfBounds)
    return nullptr;

  // Emit a bug report.
  ErrorMessage Message =
      createOutOfBoundErrorMsg(CurrentFunctionDescription, Access);
  emitOutOfBoundsBug(C, StOutBound, Buffer.Expression, Message);
  return nullptr;
}

// Ensure that we wouldn't read uninitialized value.
if (Access == AccessKind::read) {
  if (Filter.CheckCStringUninitializedRead &&
      StInBound->getSVal(ER).isUndef()) {
    emitUninitializedReadBug(C, StInBound, Buffer.Expression);
    return nullptr;
  }
}

// Array bound check succeeded.  From this point forward the array bound
// should always succeed.
return StInBound;
439}

441ProgramStateRef
442CStringChecker::CheckBufferAccess(CheckerContext &C, ProgramStateRef State,
                                AnyArgExpr Buffer, SizeArgExpr Size,
                                AccessKind Access, CharKind CK) const {
// If a previous check has failed, propagate the failure.
if (!State)
  return nullptr;

SValBuilder &svalBuilder = C.getSValBuilder();
ASTContext &Ctx = svalBuilder.getContext();

QualType SizeTy = Size.Expression->getType();
QualType PtrTy = getCharPtrType(Ctx, CK);

// Check that the first buffer is non-null.
SVal BufVal = C.getSVal(Buffer.Expression);
State = checkNonNull(C, State, Buffer, BufVal);
if (!State)
  return nullptr;

// If out-of-bounds checking is turned off, skip the rest.
if (!Filter.CheckCStringOutOfBounds)
  return State;

// Get the access length and make sure it is known.
// FIXME: This assumes the caller has already checked that the access length
// is positive. And that it's unsigned.
SVal LengthVal = C.getSVal(Size.Expression);
std::optional<NonLoc> Length = LengthVal.getAs<NonLoc>();
if (!Length)
  return State;

// Compute the offset of the last element to be accessed: size-1.
NonLoc One = svalBuilder.makeIntVal(1, SizeTy).castAs<NonLoc>();
SVal Offset = svalBuilder.evalBinOpNN(State, BO_Sub, *Length, One, SizeTy);
if (Offset.isUnknown())
  return nullptr;
NonLoc LastOffset = Offset.castAs<NonLoc>();

// Check that the first buffer is sufficiently long.
SVal BufStart =
    svalBuilder.evalCast(BufVal, PtrTy, Buffer.Expression->getType());
if (std::optional<Loc> BufLoc = BufStart.getAs<Loc>()) {

  SVal BufEnd =
      svalBuilder.evalBinOpLN(State, BO_Add, *BufLoc, LastOffset, PtrTy);
  State = CheckLocation(C, State, Buffer, BufEnd, Access, CK);

  // If the buffer isn't large enough, abort.
  if (!State)
    return nullptr;
}

// Large enough or not, return this state!
return State;
496}

498ProgramStateRef CStringChecker::CheckOverlap(CheckerContext &C,
                                           ProgramStateRef state,
                                           SizeArgExpr Size, AnyArgExpr First,
                                           AnyArgExpr Second,
                                           CharKind CK) const {
if (!Filter.CheckCStringBufferOverlap)
  return state;

// Do a simple check for overlap: if the two arguments are from the same
// buffer, see if the end of the first is greater than the start of the second
// or vice versa.

// If a previous check has failed, propagate the failure.
if (!state)
  return nullptr;

ProgramStateRef stateTrue, stateFalse;

// Assume different address spaces cannot overlap.
if (First.Expression->getType()->getPointeeType().getAddressSpace() !=
    Second.Expression->getType()->getPointeeType().getAddressSpace())
  return state;

// Get the buffer values and make sure they're known locations.
const LocationContext *LCtx = C.getLocationContext();
SVal firstVal = state->getSVal(First.Expression, LCtx);
SVal secondVal = state->getSVal(Second.Expression, LCtx);

std::optional<Loc> firstLoc = firstVal.getAs<Loc>();
if (!firstLoc)
  return state;

std::optional<Loc> secondLoc = secondVal.getAs<Loc>();
if (!secondLoc)
  return state;

// Are the two values the same?
SValBuilder &svalBuilder = C.getSValBuilder();
std::tie(stateTrue, stateFalse) =
    state->assume(svalBuilder.evalEQ(state, *firstLoc, *secondLoc));

if (stateTrue && !stateFalse) {
  // If the values are known to be equal, that's automatically an overlap.
  emitOverlapBug(C, stateTrue, First.Expression, Second.Expression);
  return nullptr;
}

// assume the two expressions are not equal.
assert(stateFalse)(static_cast <bool> (stateFalse) ? void (0) : __assert_fail
 ("stateFalse", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 546, __extension__ __PRETTY_FUNCTION__));
state = stateFalse;

// Which value comes first?
QualType cmpTy = svalBuilder.getConditionType();
SVal reverse =
    svalBuilder.evalBinOpLL(state, BO_GT, *firstLoc, *secondLoc, cmpTy);
std::optional<DefinedOrUnknownSVal> reverseTest =
    reverse.getAs<DefinedOrUnknownSVal>();
if (!reverseTest)
  return state;

std::tie(stateTrue, stateFalse) = state->assume(*reverseTest);
if (stateTrue) {
  if (stateFalse) {
    // If we don't know which one comes first, we can't perform this test.
    return state;
  } else {
    // Switch the values so that firstVal is before secondVal.
    std::swap(firstLoc, secondLoc);

    // Switch the Exprs as well, so that they still correspond.
    std::swap(First, Second);
  }
}

// Get the length, and make sure it too is known.
SVal LengthVal = state->getSVal(Size.Expression, LCtx);
std::optional<NonLoc> Length = LengthVal.getAs<NonLoc>();
if (!Length)
  return state;

// Convert the first buffer's start address to char*.
// Bail out if the cast fails.
ASTContext &Ctx = svalBuilder.getContext();
QualType CharPtrTy = getCharPtrType(Ctx, CK);
SVal FirstStart =
    svalBuilder.evalCast(*firstLoc, CharPtrTy, First.Expression->getType());
std::optional<Loc> FirstStartLoc = FirstStart.getAs<Loc>();
if (!FirstStartLoc)
  return state;

// Compute the end of the first buffer. Bail out if THAT fails.
SVal FirstEnd = svalBuilder.evalBinOpLN(state, BO_Add, *FirstStartLoc,
                                        *Length, CharPtrTy);
std::optional<Loc> FirstEndLoc = FirstEnd.getAs<Loc>();
if (!FirstEndLoc)
  return state;

// Is the end of the first buffer past the start of the second buffer?
SVal Overlap =
    svalBuilder.evalBinOpLL(state, BO_GT, *FirstEndLoc, *secondLoc, cmpTy);
std::optional<DefinedOrUnknownSVal> OverlapTest =
    Overlap.getAs<DefinedOrUnknownSVal>();
if (!OverlapTest)
  return state;

std::tie(stateTrue, stateFalse) = state->assume(*OverlapTest);

if (stateTrue && !stateFalse) {
  // Overlap!
  emitOverlapBug(C, stateTrue, First.Expression, Second.Expression);
  return nullptr;
}

// assume the two expressions don't overlap.
assert(stateFalse)(static_cast <bool> (stateFalse) ? void (0) : __assert_fail
 ("stateFalse", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 612, __extension__ __PRETTY_FUNCTION__));
return stateFalse;
614}

616void CStringChecker::emitOverlapBug(CheckerContext &C, ProgramStateRef state,
                                const Stmt *First, const Stmt *Second) const {
ExplodedNode *N = C.generateErrorNode(state);
if (!N)
  return;

if (!BT_Overlap)
  BT_Overlap.reset(new BugType(Filter.CheckNameCStringBufferOverlap,
                               categories::UnixAPI, "Improper arguments"));

// Generate a report for this bug.
auto report = std::make_unique<PathSensitiveBugReport>(
    *BT_Overlap, "Arguments must not be overlapping buffers", N);
report->addRange(First->getSourceRange());
report->addRange(Second->getSourceRange());

C.emitReport(std::move(report));
633}

635void CStringChecker::emitNullArgBug(CheckerContext &C, ProgramStateRef State,
                                  const Stmt *S, StringRef WarningMsg) const {
if (ExplodedNode *N = C.generateErrorNode(State)) {
  if (!BT_Null)
    BT_Null.reset(new BuiltinBug(
        Filter.CheckNameCStringNullArg, categories::UnixAPI,
        "Null pointer argument in call to byte string function"));

  BuiltinBug *BT = static_cast<BuiltinBug *>(BT_Null.get());
  auto Report = std::make_unique<PathSensitiveBugReport>(*BT, WarningMsg, N);
  Report->addRange(S->getSourceRange());
  if (const auto *Ex = dyn_cast<Expr>(S))
    bugreporter::trackExpressionValue(N, Ex, *Report);
  C.emitReport(std::move(Report));
}
650}

652void CStringChecker::emitUninitializedReadBug(CheckerContext &C,
                                            ProgramStateRef State,
                                            const Expr *E) const {
if (ExplodedNode *N = C.generateErrorNode(State)) {
  const char *Msg =
      "Bytes string function accesses uninitialized/garbage values";
  if (!BT_UninitRead)
    BT_UninitRead.reset(
        new BuiltinBug(Filter.CheckNameCStringUninitializedRead,
                       "Accessing unitialized/garbage values", Msg));

  BuiltinBug *BT = static_cast<BuiltinBug *>(BT_UninitRead.get());

  auto Report = std::make_unique<PathSensitiveBugReport>(*BT, Msg, N);
  Report->addRange(E->getSourceRange());
  bugreporter::trackExpressionValue(N, E, *Report);
  C.emitReport(std::move(Report));
}
670}

672void CStringChecker::emitOutOfBoundsBug(CheckerContext &C,
                                      ProgramStateRef State, const Stmt *S,
                                      StringRef WarningMsg) const {
if (ExplodedNode *N = C.generateErrorNode(State)) {
  if (!BT_Bounds)
    BT_Bounds.reset(new BuiltinBug(
        Filter.CheckCStringOutOfBounds ? Filter.CheckNameCStringOutOfBounds
                                       : Filter.CheckNameCStringNullArg,
        "Out-of-bound array access",
        "Byte string function accesses out-of-bound array element"));

  BuiltinBug *BT = static_cast<BuiltinBug *>(BT_Bounds.get());

  // FIXME: It would be nice to eventually make this diagnostic more clear,
  // e.g., by referencing the original declaration or by saying *why* this
  // reference is outside the range.
  auto Report = std::make_unique<PathSensitiveBugReport>(*BT, WarningMsg, N);
  Report->addRange(S->getSourceRange());
  C.emitReport(std::move(Report));
}
692}

694void CStringChecker::emitNotCStringBug(CheckerContext &C, ProgramStateRef State,
                                     const Stmt *S,
                                     StringRef WarningMsg) const {
if (ExplodedNode *N = C.generateNonFatalErrorNode(State)) {
  if (!BT_NotCString)
    BT_NotCString.reset(new BuiltinBug(
        Filter.CheckNameCStringNotNullTerm, categories::UnixAPI,
        "Argument is not a null-terminated string."));

  auto Report =
      std::make_unique<PathSensitiveBugReport>(*BT_NotCString, WarningMsg, N);

  Report->addRange(S->getSourceRange());
  C.emitReport(std::move(Report));
}
709}

711void CStringChecker::emitAdditionOverflowBug(CheckerContext &C,
                                           ProgramStateRef State) const {
if (ExplodedNode *N = C.generateErrorNode(State)) {
  if (!BT_AdditionOverflow)
    BT_AdditionOverflow.reset(
        new BuiltinBug(Filter.CheckNameCStringOutOfBounds, "API",
                       "Sum of expressions causes overflow."));

  // This isn't a great error message, but this should never occur in real
  // code anyway -- you'd have to create a buffer longer than a size_t can
  // represent, which is sort of a contradiction.
  const char *WarningMsg =
      "This expression will create a string whose length is too big to "
      "be represented as a size_t";

  auto Report = std::make_unique<PathSensitiveBugReport>(*BT_AdditionOverflow,
                                                         WarningMsg, N);
  C.emitReport(std::move(Report));
}
730}

732ProgramStateRef CStringChecker::checkAdditionOverflow(CheckerContext &C,
                                                   ProgramStateRef state,
                                                   NonLoc left,
                                                   NonLoc right) const {
// If out-of-bounds checking is turned off, skip the rest.
if (!Filter.CheckCStringOutOfBounds)
  return state;

// If a previous check has failed, propagate the failure.
if (!state)
  return nullptr;

SValBuilder &svalBuilder = C.getSValBuilder();
BasicValueFactory &BVF = svalBuilder.getBasicValueFactory();

QualType sizeTy = svalBuilder.getContext().getSizeType();
const llvm::APSInt &maxValInt = BVF.getMaxValue(sizeTy);
NonLoc maxVal = svalBuilder.makeIntVal(maxValInt);

SVal maxMinusRight;
if (isa<nonloc::ConcreteInt>(right)) {
  maxMinusRight = svalBuilder.evalBinOpNN(state, BO_Sub, maxVal, right,
                                               sizeTy);
} else {
  // Try switching the operands. (The order of these two assignments is
  // important!)
  maxMinusRight = svalBuilder.evalBinOpNN(state, BO_Sub, maxVal, left,
                                          sizeTy);
  left = right;
}

if (std::optional<NonLoc> maxMinusRightNL = maxMinusRight.getAs<NonLoc>()) {
  QualType cmpTy = svalBuilder.getConditionType();
  // If left > max - right, we have an overflow.
  SVal willOverflow = svalBuilder.evalBinOpNN(state, BO_GT, left,
                                              *maxMinusRightNL, cmpTy);

  ProgramStateRef stateOverflow, stateOkay;
  std::tie(stateOverflow, stateOkay) =
    state->assume(willOverflow.castAs<DefinedOrUnknownSVal>());

  if (stateOverflow && !stateOkay) {
    // We have an overflow. Emit a bug report.
    emitAdditionOverflowBug(C, stateOverflow);
    return nullptr;
  }

  // From now on, assume an overflow didn't occur.
  assert(stateOkay)(static_cast <bool> (stateOkay) ? void (0) : __assert_fail
 ("stateOkay", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 780, __extension__ __PRETTY_FUNCTION__));
  state = stateOkay;
}

return state;
785}

787ProgramStateRef CStringChecker::setCStringLength(ProgramStateRef state,
                                              const MemRegion *MR,
                                              SVal strLength) {
assert(!strLength.isUndef() && "Attempt to set an undefined string length")(static_cast <bool> (!strLength.isUndef() && "Attempt to set an undefined string length"
) ? void (0) : __assert_fail ("!strLength.isUndef() && \"Attempt to set an undefined string length\""
, "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp", 790
, __extension__ __PRETTY_FUNCTION__));

MR = MR->StripCasts();

switch (MR->getKind()) {
case MemRegion::StringRegionKind:
  // FIXME: This can happen if we strcpy() into a string region. This is
  // undefined [C99 6.4.5p6], but we should still warn about it.
  return state;

case MemRegion::SymbolicRegionKind:
case MemRegion::AllocaRegionKind:
case MemRegion::NonParamVarRegionKind:
case MemRegion::ParamVarRegionKind:
case MemRegion::FieldRegionKind:
case MemRegion::ObjCIvarRegionKind:
  // These are the types we can currently track string lengths for.
  break;

case MemRegion::ElementRegionKind:
  // FIXME: Handle element regions by upper-bounding the parent region's
  // string length.
  return state;

default:
  // Other regions (mostly non-data) can't have a reliable C string length.
  // For now, just ignore the change.
  // FIXME: These are rare but not impossible. We should output some kind of
  // warning for things like strcpy((char[]){'a', 0}, "b");
  return state;
}

if (strLength.isUnknown())
  return state->remove<CStringLength>(MR);

return state->set<CStringLength>(MR, strLength);
826}

828SVal CStringChecker::getCStringLengthForRegion(CheckerContext &C,
                                             ProgramStateRef &state,
                                             const Expr *Ex,
                                             const MemRegion *MR,
                                             bool hypothetical) {
if (!hypothetical) {
  // If there's a recorded length, go ahead and return it.
  const SVal *Recorded = state->get<CStringLength>(MR);
  if (Recorded)
    return *Recorded;
}

// Otherwise, get a new symbol and update the state.
SValBuilder &svalBuilder = C.getSValBuilder();
QualType sizeTy = svalBuilder.getContext().getSizeType();
SVal strLength = svalBuilder.getMetadataSymbolVal(CStringChecker::getTag(),
                                                  MR, Ex, sizeTy,
                                                  C.getLocationContext(),
                                                  C.blockCount());

if (!hypothetical) {
  if (std::optional<NonLoc> strLn = strLength.getAs<NonLoc>()) {
    // In case of unbounded calls strlen etc bound the range to SIZE_MAX/4
    BasicValueFactory &BVF = svalBuilder.getBasicValueFactory();
    const llvm::APSInt &maxValInt = BVF.getMaxValue(sizeTy);
    llvm::APSInt fourInt = APSIntType(maxValInt).getValue(4);
    const llvm::APSInt *maxLengthInt = BVF.evalAPSInt(BO_Div, maxValInt,
                                                      fourInt);
    NonLoc maxLength = svalBuilder.makeIntVal(*maxLengthInt);
    SVal evalLength = svalBuilder.evalBinOpNN(state, BO_LE, *strLn,
                                              maxLength, sizeTy);
    state = state->assume(evalLength.castAs<DefinedOrUnknownSVal>(), true);
  }
  state = state->set<CStringLength>(MR, strLength);
}

return strLength;
865}

867SVal CStringChecker::getCStringLength(CheckerContext &C, ProgramStateRef &state,
                                    const Expr *Ex, SVal Buf,
                                    bool hypothetical) const {
const MemRegion *MR = Buf.getAsRegion();
if (!MR) {
  // If we can't get a region, see if it's something we /know/ isn't a
  // C string. In the context of locations, the only time we can issue such
  // a warning is for labels.
  if (std::optional<loc::GotoLabel> Label = Buf.getAs<loc::GotoLabel>()) {
    if (Filter.CheckCStringNotNullTerm) {
      SmallString<120> buf;
      llvm::raw_svector_ostream os(buf);
      assert(CurrentFunctionDescription)(static_cast <bool> (CurrentFunctionDescription) ? void
 (0) : __assert_fail ("CurrentFunctionDescription", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 879, __extension__ __PRETTY_FUNCTION__));
      os << "Argument to " << CurrentFunctionDescription
         << " is the address of the label '" << Label->getLabel()->getName()
         << "', which is not a null-terminated string";

      emitNotCStringBug(C, state, Ex, os.str());
    }
    return UndefinedVal();
  }

  // If it's not a region and not a label, give up.
  return UnknownVal();
}

// If we have a region, strip casts from it and see if we can figure out
// its length. For anything we can't figure out, just return UnknownVal.
MR = MR->StripCasts();

switch (MR->getKind()) {
case MemRegion::StringRegionKind: {
  // Modifying the contents of string regions is undefined [C99 6.4.5p6],
  // so we can assume that the byte length is the correct C string length.
  SValBuilder &svalBuilder = C.getSValBuilder();
  QualType sizeTy = svalBuilder.getContext().getSizeType();
  const StringLiteral *strLit = cast<StringRegion>(MR)->getStringLiteral();
  return svalBuilder.makeIntVal(strLit->getLength(), sizeTy);
}
case MemRegion::SymbolicRegionKind:
case MemRegion::AllocaRegionKind:
case MemRegion::NonParamVarRegionKind:
case MemRegion::ParamVarRegionKind:
case MemRegion::FieldRegionKind:
case MemRegion::ObjCIvarRegionKind:
  return getCStringLengthForRegion(C, state, Ex, MR, hypothetical);
case MemRegion::CompoundLiteralRegionKind:
  // FIXME: Can we track this? Is it necessary?
  return UnknownVal();
case MemRegion::ElementRegionKind:
  // FIXME: How can we handle this? It's not good enough to subtract the
  // offset from the base string length; consider "123\x00567" and &a[5].
  return UnknownVal();
default:
  // Other regions (mostly non-data) can't have a reliable C string length.
  // In this case, an error is emitted and UndefinedVal is returned.
  // The caller should always be prepared to handle this case.
  if (Filter.CheckCStringNotNullTerm) {
    SmallString<120> buf;
    llvm::raw_svector_ostream os(buf);

    assert(CurrentFunctionDescription)(static_cast <bool> (CurrentFunctionDescription) ? void
 (0) : __assert_fail ("CurrentFunctionDescription", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 928, __extension__ __PRETTY_FUNCTION__));
    os << "Argument to " << CurrentFunctionDescription << " is ";

    if (SummarizeRegion(os, C.getASTContext(), MR))
      os << ", which is not a null-terminated string";
    else
      os << "not a null-terminated string";

    emitNotCStringBug(C, state, Ex, os.str());
  }
  return UndefinedVal();
}
940}

942const StringLiteral *CStringChecker::getCStringLiteral(CheckerContext &C,
ProgramStateRef &state, const Expr *expr, SVal val) const {

// Get the memory region pointed to by the val.
const MemRegion *bufRegion = val.getAsRegion();
if (!bufRegion)
  return nullptr;

// Strip casts off the memory region.
bufRegion = bufRegion->StripCasts();

// Cast the memory region to a string region.
const StringRegion *strRegion= dyn_cast<StringRegion>(bufRegion);
if (!strRegion)
  return nullptr;

// Return the actual string in the string region.
return strRegion->getStringLiteral();
960}

962bool CStringChecker::IsFirstBufInBound(CheckerContext &C,
                                     ProgramStateRef state,
                                     const Expr *FirstBuf,
                                     const Expr *Size) {
// If we do not know that the buffer is long enough we return 'true'.
// Otherwise the parent region of this field region would also get
// invalidated, which would lead to warnings based on an unknown state.

// Originally copied from CheckBufferAccess and CheckLocation.
SValBuilder &svalBuilder = C.getSValBuilder();
ASTContext &Ctx = svalBuilder.getContext();
const LocationContext *LCtx = C.getLocationContext();

QualType sizeTy = Size->getType();
QualType PtrTy = Ctx.getPointerType(Ctx.CharTy);
SVal BufVal = state->getSVal(FirstBuf, LCtx);

SVal LengthVal = state->getSVal(Size, LCtx);
std::optional<NonLoc> Length = LengthVal.getAs<NonLoc>();
if (!Length)
  return true; // cf top comment.

// Compute the offset of the last element to be accessed: size-1.
NonLoc One = svalBuilder.makeIntVal(1, sizeTy).castAs<NonLoc>();
SVal Offset = svalBuilder.evalBinOpNN(state, BO_Sub, *Length, One, sizeTy);
if (Offset.isUnknown())
  return true; // cf top comment
NonLoc LastOffset = Offset.castAs<NonLoc>();

// Check that the first buffer is sufficiently long.
SVal BufStart = svalBuilder.evalCast(BufVal, PtrTy, FirstBuf->getType());
std::optional<Loc> BufLoc = BufStart.getAs<Loc>();
if (!BufLoc)
  return true; // cf top comment.

SVal BufEnd =
    svalBuilder.evalBinOpLN(state, BO_Add, *BufLoc, LastOffset, PtrTy);

// Check for out of bound array element access.
const MemRegion *R = BufEnd.getAsRegion();
if (!R)
  return true; // cf top comment.

const ElementRegion *ER = dyn_cast<ElementRegion>(R);
if (!ER)
  return true; // cf top comment.

// FIXME: Does this crash when a non-standard definition
// of a library function is encountered?
assert(ER->getValueType() == C.getASTContext().CharTy &&(static_cast <bool> (ER->getValueType() == C.getASTContext
().CharTy && "IsFirstBufInBound should only be called with char* ElementRegions"
) ? void (0) : __assert_fail ("ER->getValueType() == C.getASTContext().CharTy && \"IsFirstBufInBound should only be called with char* ElementRegions\""
, "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp", 1012
, __extension__ __PRETTY_FUNCTION__))
       "IsFirstBufInBound should only be called with char* ElementRegions")(static_cast <bool> (ER->getValueType() == C.getASTContext
().CharTy && "IsFirstBufInBound should only be called with char* ElementRegions"
) ? void (0) : __assert_fail ("ER->getValueType() == C.getASTContext().CharTy && \"IsFirstBufInBound should only be called with char* ElementRegions\""
, "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp", 1012
, __extension__ __PRETTY_FUNCTION__));

// Get the size of the array.
const SubRegion *superReg = cast<SubRegion>(ER->getSuperRegion());
DefinedOrUnknownSVal SizeDV = getDynamicExtent(state, superReg, svalBuilder);

// Get the index of the accessed element.
DefinedOrUnknownSVal Idx = ER->getIndex().castAs<DefinedOrUnknownSVal>();

ProgramStateRef StInBound = state->assumeInBound(Idx, SizeDV, true);

return static_cast<bool>(StInBound);
1024}

1026ProgramStateRef CStringChecker::InvalidateBuffer(CheckerContext &C,
                                               ProgramStateRef state,
                                               const Expr *E, SVal V,
                                               bool IsSourceBuffer,
                                               const Expr *Size) {
std::optional<Loc> L = V.getAs<Loc>();
if (!L)
  return state;

// FIXME: This is a simplified version of what's in CFRefCount.cpp -- it makes
// some assumptions about the value that CFRefCount can't. Even so, it should
// probably be refactored.
if (std::optional<loc::MemRegionVal> MR = L->getAs<loc::MemRegionVal>()) {
  const MemRegion *R = MR->getRegion()->StripCasts();

  // Are we dealing with an ElementRegion?  If so, we should be invalidating
  // the super-region.
  if (const ElementRegion *ER = dyn_cast<ElementRegion>(R)) {
    R = ER->getSuperRegion();
    // FIXME: What about layers of ElementRegions?
  }

  // Invalidate this region.
  const LocationContext *LCtx = C.getPredecessor()->getLocationContext();

  bool CausesPointerEscape = false;
  RegionAndSymbolInvalidationTraits ITraits;
  // Invalidate and escape only indirect regions accessible through the source
  // buffer.
  if (IsSourceBuffer) {
    ITraits.setTrait(R->getBaseRegion(),
                     RegionAndSymbolInvalidationTraits::TK_PreserveContents);
    ITraits.setTrait(R, RegionAndSymbolInvalidationTraits::TK_SuppressEscape);
    CausesPointerEscape = true;
  } else {
    const MemRegion::Kind& K = R->getKind();
    if (K == MemRegion::FieldRegionKind)
      if (Size && IsFirstBufInBound(C, state, E, Size)) {
        // If destination buffer is a field region and access is in bound,
        // do not invalidate its super region.
        ITraits.setTrait(
            R,
            RegionAndSymbolInvalidationTraits::TK_DoNotInvalidateSuperRegion);
      }
  }

  return state->invalidateRegions(R, E, C.blockCount(), LCtx,
                                  CausesPointerEscape, nullptr, nullptr,
                                  &ITraits);
}

// If we have a non-region value by chance, just remove the binding.
// FIXME: is this necessary or correct? This handles the non-Region
//  cases.  Is it ever valid to store to these?
return state->killBinding(*L);
1081}

1083bool CStringChecker::SummarizeRegion(raw_ostream &os, ASTContext &Ctx,
                                   const MemRegion *MR) {
switch (MR->getKind()) {
case MemRegion::FunctionCodeRegionKind: {
  if (const auto *FD = cast<FunctionCodeRegion>(MR)->getDecl())
    os << "the address of the function '" << *FD << '\'';
  else
    os << "the address of a function";
  return true;
}
case MemRegion::BlockCodeRegionKind:
  os << "block text";
  return true;
case MemRegion::BlockDataRegionKind:
  os << "a block";
  return true;
case MemRegion::CXXThisRegionKind:
case MemRegion::CXXTempObjectRegionKind:
  os << "a C++ temp object of type "
     << cast<TypedValueRegion>(MR)->getValueType();
  return true;
case MemRegion::NonParamVarRegionKind:
  os << "a variable of type" << cast<TypedValueRegion>(MR)->getValueType();
  return true;
case MemRegion::ParamVarRegionKind:
  os << "a parameter of type" << cast<TypedValueRegion>(MR)->getValueType();
  return true;
case MemRegion::FieldRegionKind:
  os << "a field of type " << cast<TypedValueRegion>(MR)->getValueType();
  return true;
case MemRegion::ObjCIvarRegionKind:
  os << "an instance variable of type "
     << cast<TypedValueRegion>(MR)->getValueType();
  return true;
default:
  return false;
}
1120}

1122bool CStringChecker::memsetAux(const Expr *DstBuffer, SVal CharVal,
                             const Expr *Size, CheckerContext &C,
                             ProgramStateRef &State) {
SVal MemVal = C.getSVal(DstBuffer);
SVal SizeVal = C.getSVal(Size);
const MemRegion *MR = MemVal.getAsRegion();
if (!MR)
  return false;

// We're about to model memset by producing a "default binding" in the Store.
// Our current implementation - RegionStore - doesn't support default bindings
// that don't cover the whole base region. So we should first get the offset
// and the base region to figure out whether the offset of buffer is 0.
RegionOffset Offset = MR->getAsOffset();
const MemRegion *BR = Offset.getRegion();

std::optional<NonLoc> SizeNL = SizeVal.getAs<NonLoc>();
if (!SizeNL)
  return false;

SValBuilder &svalBuilder = C.getSValBuilder();
ASTContext &Ctx = C.getASTContext();

// void *memset(void *dest, int ch, size_t count);
// For now we can only handle the case of offset is 0 and concrete char value.
if (Offset.isValid() && !Offset.hasSymbolicOffset() &&
    Offset.getOffset() == 0) {
  // Get the base region's size.
  DefinedOrUnknownSVal SizeDV = getDynamicExtent(State, BR, svalBuilder);

  ProgramStateRef StateWholeReg, StateNotWholeReg;
  std::tie(StateWholeReg, StateNotWholeReg) =
      State->assume(svalBuilder.evalEQ(State, SizeDV, *SizeNL));

  // With the semantic of 'memset()', we should convert the CharVal to
  // unsigned char.
  CharVal = svalBuilder.evalCast(CharVal, Ctx.UnsignedCharTy, Ctx.IntTy);

  ProgramStateRef StateNullChar, StateNonNullChar;
  std::tie(StateNullChar, StateNonNullChar) =
      assumeZero(C, State, CharVal, Ctx.UnsignedCharTy);

  if (StateWholeReg && !StateNotWholeReg && StateNullChar &&
      !StateNonNullChar) {
    // If the 'memset()' acts on the whole region of destination buffer and
    // the value of the second argument of 'memset()' is zero, bind the second
    // argument's value to the destination buffer with 'default binding'.
    // FIXME: Since there is no perfect way to bind the non-zero character, we
    // can only deal with zero value here. In the future, we need to deal with
    // the binding of non-zero value in the case of whole region.
    State = State->bindDefaultZero(svalBuilder.makeLoc(BR),
                                   C.getLocationContext());
  } else {
    // If the destination buffer's extent is not equal to the value of
    // third argument, just invalidate buffer.
    State = InvalidateBuffer(C, State, DstBuffer, MemVal,
                             /*IsSourceBuffer*/ false, Size);
  }

  if (StateNullChar && !StateNonNullChar) {
    // If the value of the second argument of 'memset()' is zero, set the
    // string length of destination buffer to 0 directly.
    State = setCStringLength(State, MR,
                             svalBuilder.makeZeroVal(Ctx.getSizeType()));
  } else if (!StateNullChar && StateNonNullChar) {
    SVal NewStrLen = svalBuilder.getMetadataSymbolVal(
        CStringChecker::getTag(), MR, DstBuffer, Ctx.getSizeType(),
        C.getLocationContext(), C.blockCount());

    // If the value of second argument is not zero, then the string length
    // is at least the size argument.
    SVal NewStrLenGESize = svalBuilder.evalBinOp(
        State, BO_GE, NewStrLen, SizeVal, svalBuilder.getConditionType());

    State = setCStringLength(
        State->assume(NewStrLenGESize.castAs<DefinedOrUnknownSVal>(), true),
        MR, NewStrLen);
  }
} else {
  // If the offset is not zero and char value is not concrete, we can do
  // nothing but invalidate the buffer.
  State = InvalidateBuffer(C, State, DstBuffer, MemVal,
                           /*IsSourceBuffer*/ false, Size);
}
return true;
1207}

1209//===----------------------------------------------------------------------===//
1210// evaluation of individual function calls.
1211//===----------------------------------------------------------------------===//

1213void CStringChecker::evalCopyCommon(CheckerContext &C, const CallExpr *CE,
                                  ProgramStateRef state, SizeArgExpr Size,
                                  DestinationArgExpr Dest,
                                  SourceArgExpr Source, bool Restricted,
                                  bool IsMempcpy, CharKind CK) const {
CurrentFunctionDescription = "memory copy function";

// See if the size argument is zero.
const LocationContext *LCtx = C.getLocationContext();
SVal sizeVal = state->getSVal(Size.Expression, LCtx);
QualType sizeTy = Size.Expression->getType();

ProgramStateRef stateZeroSize, stateNonZeroSize;
std::tie(stateZeroSize, stateNonZeroSize) =
    assumeZero(C, state, sizeVal, sizeTy);

// Get the value of the Dest.
SVal destVal = state->getSVal(Dest.Expression, LCtx);

// If the size is zero, there won't be any actual memory access, so
// just bind the return value to the destination buffer and return.
if (stateZeroSize && !stateNonZeroSize) {
  stateZeroSize = stateZeroSize->BindExpr(CE, LCtx, destVal);
  C.addTransition(stateZeroSize);
  return;
}

// If the size can be nonzero, we have to check the other arguments.
if (stateNonZeroSize) {
  state = stateNonZeroSize;

  // Ensure the destination is not null. If it is NULL there will be a
  // NULL pointer dereference.
  state = checkNonNull(C, state, Dest, destVal);
  if (!state)
    return;

  // Get the value of the Src.
  SVal srcVal = state->getSVal(Source.Expression, LCtx);

  // Ensure the source is not null. If it is NULL there will be a
  // NULL pointer dereference.
  state = checkNonNull(C, state, Source, srcVal);
  if (!state)
    return;

  // Ensure the accesses are valid and that the buffers do not overlap.
  state = CheckBufferAccess(C, state, Dest, Size, AccessKind::write, CK);
  state = CheckBufferAccess(C, state, Source, Size, AccessKind::read, CK);

  if (Restricted)
    state = CheckOverlap(C, state, Size, Dest, Source, CK);

  if (!state)
    return;

  // If this is mempcpy, get the byte after the last byte copied and
  // bind the expr.
  if (IsMempcpy) {
    // Get the byte after the last byte copied.
    SValBuilder &SvalBuilder = C.getSValBuilder();
    ASTContext &Ctx = SvalBuilder.getContext();
    QualType CharPtrTy = getCharPtrType(Ctx, CK);
    SVal DestRegCharVal =
        SvalBuilder.evalCast(destVal, CharPtrTy, Dest.Expression->getType());
    SVal lastElement = C.getSValBuilder().evalBinOp(
        state, BO_Add, DestRegCharVal, sizeVal, Dest.Expression->getType());
    // If we don't know how much we copied, we can at least
    // conjure a return value for later.
    if (lastElement.isUnknown())
      lastElement = C.getSValBuilder().conjureSymbolVal(nullptr, CE, LCtx,
                                                        C.blockCount());

    // The byte after the last byte copied is the return value.
    state = state->BindExpr(CE, LCtx, lastElement);
  } else {
    // All other copies return the destination buffer.
    // (Well, bcopy() has a void return type, but this won't hurt.)
    state = state->BindExpr(CE, LCtx, destVal);
  }

  // Invalidate the destination (regular invalidation without pointer-escaping
  // the address of the top-level region).
  // FIXME: Even if we can't perfectly model the copy, we should see if we
  // can use LazyCompoundVals to copy the source values into the destination.
  // This would probably remove any existing bindings past the end of the
  // copied region, but that's still an improvement over blank invalidation.
  state =
      InvalidateBuffer(C, state, Dest.Expression, C.getSVal(Dest.Expression),
                       /*IsSourceBuffer*/ false, Size.Expression);

  // Invalidate the source (const-invalidation without const-pointer-escaping
  // the address of the top-level region).
  state = InvalidateBuffer(C, state, Source.Expression,
                           C.getSVal(Source.Expression),
                           /*IsSourceBuffer*/ true, nullptr);

  C.addTransition(state);
}
1312}

1314void CStringChecker::evalMemcpy(CheckerContext &C, const CallExpr *CE,
                              CharKind CK) const {
// void *memcpy(void *restrict dst, const void *restrict src, size_t n);
// The return value is the address of the destination buffer.
DestinationArgExpr Dest = {CE->getArg(0), 0};
SourceArgExpr Src = {CE->getArg(1), 1};
SizeArgExpr Size = {CE->getArg(2), 2};

ProgramStateRef State = C.getState();

constexpr bool IsRestricted = true;
constexpr bool IsMempcpy = false;
evalCopyCommon(C, CE, State, Size, Dest, Src, IsRestricted, IsMempcpy, CK);
1327}

1329void CStringChecker::evalMempcpy(CheckerContext &C, const CallExpr *CE,
                               CharKind CK) const {
// void *mempcpy(void *restrict dst, const void *restrict src, size_t n);
// The return value is a pointer to the byte following the last written byte.
DestinationArgExpr Dest = {CE->getArg(0), 0};
SourceArgExpr Src = {CE->getArg(1), 1};
SizeArgExpr Size = {CE->getArg(2), 2};

constexpr bool IsRestricted = true;
constexpr bool IsMempcpy = true;
evalCopyCommon(C, CE, C.getState(), Size, Dest, Src, IsRestricted, IsMempcpy,
               CK);
1341}

1343void CStringChecker::evalMemmove(CheckerContext &C, const CallExpr *CE,
                               CharKind CK) const {
// void *memmove(void *dst, const void *src, size_t n);
// The return value is the address of the destination buffer.
DestinationArgExpr Dest = {CE->getArg(0), 0};
SourceArgExpr Src = {CE->getArg(1), 1};
SizeArgExpr Size = {CE->getArg(2), 2};

constexpr bool IsRestricted = false;
constexpr bool IsMempcpy = false;
evalCopyCommon(C, CE, C.getState(), Size, Dest, Src, IsRestricted, IsMempcpy,
               CK);
1355}

1357void CStringChecker::evalBcopy(CheckerContext &C, const CallExpr *CE) const {
// void bcopy(const void *src, void *dst, size_t n);
SourceArgExpr Src(CE->getArg(0), 0);
DestinationArgExpr Dest = {CE->getArg(1), 1};
SizeArgExpr Size = {CE->getArg(2), 2};

constexpr bool IsRestricted = false;
constexpr bool IsMempcpy = false;
evalCopyCommon(C, CE, C.getState(), Size, Dest, Src, IsRestricted, IsMempcpy,
               CharKind::Regular);
1367}

1369void CStringChecker::evalMemcmp(CheckerContext &C, const CallExpr *CE,
                              CharKind CK) const {
// int memcmp(const void *s1, const void *s2, size_t n);
CurrentFunctionDescription = "memory comparison function";

AnyArgExpr Left = {CE->getArg(0), 0};
AnyArgExpr Right = {CE->getArg(1), 1};
SizeArgExpr Size = {CE->getArg(2), 2};

ProgramStateRef State = C.getState();
SValBuilder &Builder = C.getSValBuilder();
const LocationContext *LCtx = C.getLocationContext();

// See if the size argument is zero.
SVal sizeVal = State->getSVal(Size.Expression, LCtx);
QualType sizeTy = Size.Expression->getType();

ProgramStateRef stateZeroSize, stateNonZeroSize;
std::tie(stateZeroSize, stateNonZeroSize) =
    assumeZero(C, State, sizeVal, sizeTy);

// If the size can be zero, the result will be 0 in that case, and we don't
// have to check either of the buffers.
if (stateZeroSize) {
  State = stateZeroSize;
  State = State->BindExpr(CE, LCtx, Builder.makeZeroVal(CE->getType()));
  C.addTransition(State);
}

// If the size can be nonzero, we have to check the other arguments.
if (stateNonZeroSize) {
  State = stateNonZeroSize;
  // If we know the two buffers are the same, we know the result is 0.
  // First, get the two buffers' addresses. Another checker will have already
  // made sure they're not undefined.
  DefinedOrUnknownSVal LV =
      State->getSVal(Left.Expression, LCtx).castAs<DefinedOrUnknownSVal>();
  DefinedOrUnknownSVal RV =
      State->getSVal(Right.Expression, LCtx).castAs<DefinedOrUnknownSVal>();

  // See if they are the same.
  ProgramStateRef SameBuffer, NotSameBuffer;
  std::tie(SameBuffer, NotSameBuffer) =
      State->assume(Builder.evalEQ(State, LV, RV));

  // If the two arguments are the same buffer, we know the result is 0,
  // and we only need to check one size.
  if (SameBuffer && !NotSameBuffer) {
    State = SameBuffer;
    State = CheckBufferAccess(C, State, Left, Size, AccessKind::read);
    if (State) {
      State =
          SameBuffer->BindExpr(CE, LCtx, Builder.makeZeroVal(CE->getType()));
      C.addTransition(State);
    }
    return;
  }

  // If the two arguments might be different buffers, we have to check
  // the size of both of them.
  assert(NotSameBuffer)(static_cast <bool> (NotSameBuffer) ? void (0) : __assert_fail
 ("NotSameBuffer", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 1429, __extension__ __PRETTY_FUNCTION__));
  State = CheckBufferAccess(C, State, Right, Size, AccessKind::read, CK);
  State = CheckBufferAccess(C, State, Left, Size, AccessKind::read, CK);
  if (State) {
    // The return value is the comparison result, which we don't know.
    SVal CmpV = Builder.conjureSymbolVal(nullptr, CE, LCtx, C.blockCount());
    State = State->BindExpr(CE, LCtx, CmpV);
    C.addTransition(State);
  }
}
1439}

1441void CStringChecker::evalstrLength(CheckerContext &C,
                                 const CallExpr *CE) const {
// size_t strlen(const char *s);
evalstrLengthCommon(C, CE, /* IsStrnlen = */ false);
1445}

1447void CStringChecker::evalstrnLength(CheckerContext &C,
                                  const CallExpr *CE) const {
// size_t strnlen(const char *s, size_t maxlen);
evalstrLengthCommon(C, CE, /* IsStrnlen = */ true);
1
Calling 'CStringChecker::evalstrLengthCommon'→
1451}

1453void CStringChecker::evalstrLengthCommon(CheckerContext &C, const CallExpr *CE,
                                       bool IsStrnlen) const {
CurrentFunctionDescription = "string length function";
ProgramStateRef state = C.getState();
const LocationContext *LCtx = C.getLocationContext();

if (IsStrnlen1.1
'IsStrnlen' is true
1
'IsStrnlen' is true
1
'IsStrnlen' is true
) {
2
←
Taking true branch→
  const Expr *maxlenExpr = CE->getArg(1);
  SVal maxlenVal = state->getSVal(maxlenExpr, LCtx);

  ProgramStateRef stateZeroSize, stateNonZeroSize;
  std::tie(stateZeroSize, stateNonZeroSize) =
    assumeZero(C, state, maxlenVal, maxlenExpr->getType());

  // If the size can be zero, the result will be 0 in that case, and we don't
  // have to check the string itself.
  if (stateZeroSize) {
3
←
Assuming the condition is false→
4
←
Taking false branch→
    SVal zero = C.getSValBuilder().makeZeroVal(CE->getType());
    stateZeroSize = stateZeroSize->BindExpr(CE, LCtx, zero);
    C.addTransition(stateZeroSize);
  }

  // If the size is GUARANTEED to be zero, we're done!
  if (!stateNonZeroSize)
5
←
Assuming the condition is false→
6
←
Taking false branch→
    return;

  // Otherwise, record the assumption that the size is nonzero.
  state = stateNonZeroSize;
}

// Check that the string argument is non-null.
AnyArgExpr Arg = {CE->getArg(0), 0};
SVal ArgVal = state->getSVal(Arg.Expression, LCtx);
state = checkNonNull(C, state, Arg, ArgVal);

if (!state)
7
←
Assuming the condition is false→
8
←
Taking false branch→
  return;

SVal strLength = getCStringLength(C, state, Arg.Expression, ArgVal);

// If the argument isn't a valid C string, there's no valid state to
// transition to.
if (strLength.isUndef())
9
←
Taking false branch→
  return;

DefinedOrUnknownSVal result = UnknownVal();

// If the check is for strnlen() then bind the return value to no more than
// the maxlen value.
if (IsStrnlen9.1
'IsStrnlen' is true
1
'IsStrnlen' is true
1
'IsStrnlen' is true
) {
10
←
Taking true branch→
  QualType cmpTy = C.getSValBuilder().getConditionType();

  // It's a little unfortunate to be getting this again,
  // but it's not that expensive...
  const Expr *maxlenExpr = CE->getArg(1);
  SVal maxlenVal = state->getSVal(maxlenExpr, LCtx);

  std::optional<NonLoc> strLengthNL = strLength.getAs<NonLoc>();
  std::optional<NonLoc> maxlenValNL = maxlenVal.getAs<NonLoc>();

  if (strLengthNL && maxlenValNL) {
11
←
Assuming the condition is true→
12
←
Assuming the condition is true→
13
←
Taking true branch→
    ProgramStateRef stateStringTooLong, stateStringNotTooLong;

    // Check if the strLength is greater than the maxlen.
    std::tie(stateStringTooLong, stateStringNotTooLong) = state->assume(
        C.getSValBuilder()
            .evalBinOpNN(state, BO_GT, *strLengthNL, *maxlenValNL, cmpTy)
            .castAs<DefinedOrUnknownSVal>());

    if (stateStringTooLong && !stateStringNotTooLong) {
14
←
Assuming the condition is false→
      // If the string is longer than maxlen, return maxlen.
      result = *maxlenValNL;
    } else if (stateStringNotTooLong && !stateStringTooLong) {
15
←
Assuming the condition is false→
      // If the string is shorter than maxlen, return its length.
      result = *strLengthNL;
    }
  }

  if (result.isUnknown()) {
16
←
Taking true branch→
    // If we don't have enough information for a comparison, there's
    // no guarantee the full string length will actually be returned.
    // All we know is the return value is the min of the string length
    // and the limit. This is better than nothing.
    result = C.getSValBuilder().conjureSymbolVal(nullptr, CE, LCtx,
                                                 C.blockCount());
    NonLoc resultNL = result.castAs<NonLoc>();

    if (strLengthNL) {
17
←
Taking true branch→
      state = state->assume(C.getSValBuilder().evalBinOpNN(
18
←
Calling 'ProgramState::assume'→
21
←
Returning from 'ProgramState::assume'→
22
←
Calling copy assignment operator for 'IntrusiveRefCntPtr<const clang::ento::ProgramState>'→
27
←
Returning from copy assignment operator for 'IntrusiveRefCntPtr<const clang::ento::ProgramState>'→
                                state, BO_LE, resultNL, *strLengthNL, cmpTy)
                                .castAs<DefinedOrUnknownSVal>(), true);
    }

    if (maxlenValNL) {
28
←
Taking true branch→
      state = state->assume(C.getSValBuilder().evalBinOpNN(
29
←
Called C++ object pointer is null
                                state, BO_LE, resultNL, *maxlenValNL, cmpTy)
                                .castAs<DefinedOrUnknownSVal>(), true);
    }
  }

} else {
  // This is a plain strlen(), not strnlen().
  result = strLength.castAs<DefinedOrUnknownSVal>();

  // If we don't know the length of the string, conjure a return
  // value, so it can be used in constraints, at least.
  if (result.isUnknown()) {
    result = C.getSValBuilder().conjureSymbolVal(nullptr, CE, LCtx,
                                                 C.blockCount());
  }
}

// Bind the return value.
assert(!result.isUnknown() && "Should have conjured a value by now")(static_cast <bool> (!result.isUnknown() && "Should have conjured a value by now"
) ? void (0) : __assert_fail ("!result.isUnknown() && \"Should have conjured a value by now\""
, "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp", 1566
, __extension__ __PRETTY_FUNCTION__));
state = state->BindExpr(CE, LCtx, result);
C.addTransition(state);
1569}

1571void CStringChecker::evalStrcpy(CheckerContext &C, const CallExpr *CE) const {
// char *strcpy(char *restrict dst, const char *restrict src);
evalStrcpyCommon(C, CE,
                 /* ReturnEnd = */ false,
                 /* IsBounded = */ false,
                 /* appendK = */ ConcatFnKind::none);
1577}

1579void CStringChecker::evalStrncpy(CheckerContext &C, const CallExpr *CE) const {
// char *strncpy(char *restrict dst, const char *restrict src, size_t n);
evalStrcpyCommon(C, CE,
                 /* ReturnEnd = */ false,
                 /* IsBounded = */ true,
                 /* appendK = */ ConcatFnKind::none);
1585}

1587void CStringChecker::evalStpcpy(CheckerContext &C, const CallExpr *CE) const {
// char *stpcpy(char *restrict dst, const char *restrict src);
evalStrcpyCommon(C, CE,
                 /* ReturnEnd = */ true,
                 /* IsBounded = */ false,
                 /* appendK = */ ConcatFnKind::none);
1593}

1595void CStringChecker::evalStrlcpy(CheckerContext &C, const CallExpr *CE) const {
// size_t strlcpy(char *dest, const char *src, size_t size);
evalStrcpyCommon(C, CE,
                 /* ReturnEnd = */ true,
                 /* IsBounded = */ true,
                 /* appendK = */ ConcatFnKind::none,
                 /* returnPtr = */ false);
1602}

1604void CStringChecker::evalStrcat(CheckerContext &C, const CallExpr *CE) const {
// char *strcat(char *restrict s1, const char *restrict s2);
evalStrcpyCommon(C, CE,
                 /* ReturnEnd = */ false,
                 /* IsBounded = */ false,
                 /* appendK = */ ConcatFnKind::strcat);
1610}

1612void CStringChecker::evalStrncat(CheckerContext &C, const CallExpr *CE) const {
// char *strncat(char *restrict s1, const char *restrict s2, size_t n);
evalStrcpyCommon(C, CE,
                 /* ReturnEnd = */ false,
                 /* IsBounded = */ true,
                 /* appendK = */ ConcatFnKind::strcat);
1618}

1620void CStringChecker::evalStrlcat(CheckerContext &C, const CallExpr *CE) const {
// size_t strlcat(char *dst, const char *src, size_t size);
// It will append at most size - strlen(dst) - 1 bytes,
// NULL-terminating the result.
evalStrcpyCommon(C, CE,
                 /* ReturnEnd = */ false,
                 /* IsBounded = */ true,
                 /* appendK = */ ConcatFnKind::strlcat,
                 /* returnPtr = */ false);
1629}

1631void CStringChecker::evalStrcpyCommon(CheckerContext &C, const CallExpr *CE,
                                    bool ReturnEnd, bool IsBounded,
                                    ConcatFnKind appendK,
                                    bool returnPtr) const {
if (appendK == ConcatFnKind::none)
  CurrentFunctionDescription = "string copy function";
else
  CurrentFunctionDescription = "string concatenation function";

ProgramStateRef state = C.getState();
const LocationContext *LCtx = C.getLocationContext();

// Check that the destination is non-null.
DestinationArgExpr Dst = {CE->getArg(0), 0};
SVal DstVal = state->getSVal(Dst.Expression, LCtx);
state = checkNonNull(C, state, Dst, DstVal);
if (!state)
  return;

// Check that the source is non-null.
SourceArgExpr srcExpr = {CE->getArg(1), 1};
SVal srcVal = state->getSVal(srcExpr.Expression, LCtx);
state = checkNonNull(C, state, srcExpr, srcVal);
if (!state)
  return;

// Get the string length of the source.
SVal strLength = getCStringLength(C, state, srcExpr.Expression, srcVal);
std::optional<NonLoc> strLengthNL = strLength.getAs<NonLoc>();

// Get the string length of the destination buffer.
SVal dstStrLength = getCStringLength(C, state, Dst.Expression, DstVal);
std::optional<NonLoc> dstStrLengthNL = dstStrLength.getAs<NonLoc>();

// If the source isn't a valid C string, give up.
if (strLength.isUndef())
  return;

SValBuilder &svalBuilder = C.getSValBuilder();
QualType cmpTy = svalBuilder.getConditionType();
QualType sizeTy = svalBuilder.getContext().getSizeType();

// These two values allow checking two kinds of errors:
// - actual overflows caused by a source that doesn't fit in the destination
// - potential overflows caused by a bound that could exceed the destination
SVal amountCopied = UnknownVal();
SVal maxLastElementIndex = UnknownVal();
const char *boundWarning = nullptr;

// FIXME: Why do we choose the srcExpr if the access has no size?
//  Note that the 3rd argument of the call would be the size parameter.
SizeArgExpr SrcExprAsSizeDummy = {srcExpr.Expression, srcExpr.ArgumentIndex};
state = CheckOverlap(
    C, state,
    (IsBounded ? SizeArgExpr{CE->getArg(2), 2} : SrcExprAsSizeDummy), Dst,
    srcExpr);

if (!state)
  return;

// If the function is strncpy, strncat, etc... it is bounded.
if (IsBounded) {
  // Get the max number of characters to copy.
  SizeArgExpr lenExpr = {CE->getArg(2), 2};
  SVal lenVal = state->getSVal(lenExpr.Expression, LCtx);

  // Protect against misdeclared strncpy().
  lenVal =
      svalBuilder.evalCast(lenVal, sizeTy, lenExpr.Expression->getType());

  std::optional<NonLoc> lenValNL = lenVal.getAs<NonLoc>();

  // If we know both values, we might be able to figure out how much
  // we're copying.
  if (strLengthNL && lenValNL) {
    switch (appendK) {
    case ConcatFnKind::none:
    case ConcatFnKind::strcat: {
      ProgramStateRef stateSourceTooLong, stateSourceNotTooLong;
      // Check if the max number to copy is less than the length of the src.
      // If the bound is equal to the source length, strncpy won't null-
      // terminate the result!
      std::tie(stateSourceTooLong, stateSourceNotTooLong) = state->assume(
          svalBuilder
              .evalBinOpNN(state, BO_GE, *strLengthNL, *lenValNL, cmpTy)
              .castAs<DefinedOrUnknownSVal>());

      if (stateSourceTooLong && !stateSourceNotTooLong) {
        // Max number to copy is less than the length of the src, so the
        // actual strLength copied is the max number arg.
        state = stateSourceTooLong;
        amountCopied = lenVal;

      } else if (!stateSourceTooLong && stateSourceNotTooLong) {
        // The source buffer entirely fits in the bound.
        state = stateSourceNotTooLong;
        amountCopied = strLength;
      }
      break;
    }
    case ConcatFnKind::strlcat:
      if (!dstStrLengthNL)
        return;

      // amountCopied = min (size - dstLen - 1 , srcLen)
      SVal freeSpace = svalBuilder.evalBinOpNN(state, BO_Sub, *lenValNL,
                                               *dstStrLengthNL, sizeTy);
      if (!isa<NonLoc>(freeSpace))
        return;
      freeSpace =
          svalBuilder.evalBinOp(state, BO_Sub, freeSpace,
                                svalBuilder.makeIntVal(1, sizeTy), sizeTy);
      std::optional<NonLoc> freeSpaceNL = freeSpace.getAs<NonLoc>();

      // While unlikely, it is possible that the subtraction is
      // too complex to compute, let's check whether it succeeded.
      if (!freeSpaceNL)
        return;
      SVal hasEnoughSpace = svalBuilder.evalBinOpNN(
          state, BO_LE, *strLengthNL, *freeSpaceNL, cmpTy);

      ProgramStateRef TrueState, FalseState;
      std::tie(TrueState, FalseState) =
          state->assume(hasEnoughSpace.castAs<DefinedOrUnknownSVal>());

      // srcStrLength <= size - dstStrLength -1
      if (TrueState && !FalseState) {
        amountCopied = strLength;
      }

      // srcStrLength > size - dstStrLength -1
      if (!TrueState && FalseState) {
        amountCopied = freeSpace;
      }

      if (TrueState && FalseState)
        amountCopied = UnknownVal();
      break;
    }
  }
  // We still want to know if the bound is known to be too large.
  if (lenValNL) {
    switch (appendK) {
    case ConcatFnKind::strcat:
      // For strncat, the check is strlen(dst) + lenVal < sizeof(dst)

      // Get the string length of the destination. If the destination is
      // memory that can't have a string length, we shouldn't be copying
      // into it anyway.
      if (dstStrLength.isUndef())
        return;

      if (dstStrLengthNL) {
        maxLastElementIndex = svalBuilder.evalBinOpNN(
            state, BO_Add, *lenValNL, *dstStrLengthNL, sizeTy);

        boundWarning = "Size argument is greater than the free space in the "
                       "destination buffer";
      }
      break;
    case ConcatFnKind::none:
    case ConcatFnKind::strlcat:
      // For strncpy and strlcat, this is just checking
      //  that lenVal <= sizeof(dst).
      // (Yes, strncpy and strncat differ in how they treat termination.
      // strncat ALWAYS terminates, but strncpy doesn't.)

      // We need a special case for when the copy size is zero, in which
      // case strncpy will do no work at all. Our bounds check uses n-1
      // as the last element accessed, so n == 0 is problematic.
      ProgramStateRef StateZeroSize, StateNonZeroSize;
      std::tie(StateZeroSize, StateNonZeroSize) =
          assumeZero(C, state, *lenValNL, sizeTy);

      // If the size is known to be zero, we're done.
      if (StateZeroSize && !StateNonZeroSize) {
        if (returnPtr) {
          StateZeroSize = StateZeroSize->BindExpr(CE, LCtx, DstVal);
        } else {
          if (appendK == ConcatFnKind::none) {
            // strlcpy returns strlen(src)
            StateZeroSize = StateZeroSize->BindExpr(CE, LCtx, strLength);
          } else {
            // strlcat returns strlen(src) + strlen(dst)
            SVal retSize = svalBuilder.evalBinOp(
                state, BO_Add, strLength, dstStrLength, sizeTy);
            StateZeroSize = StateZeroSize->BindExpr(CE, LCtx, retSize);
          }
        }
        C.addTransition(StateZeroSize);
        return;
      }

      // Otherwise, go ahead and figure out the last element we'll touch.
      // We don't record the non-zero assumption here because we can't
      // be sure. We won't warn on a possible zero.
      NonLoc one = svalBuilder.makeIntVal(1, sizeTy).castAs<NonLoc>();
      maxLastElementIndex =
          svalBuilder.evalBinOpNN(state, BO_Sub, *lenValNL, one, sizeTy);
      boundWarning = "Size argument is greater than the length of the "
                     "destination buffer";
      break;
    }
  }
} else {
  // The function isn't bounded. The amount copied should match the length
  // of the source buffer.
  amountCopied = strLength;
}

assert(state)(static_cast <bool> (state) ? void (0) : __assert_fail (
"state", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 1841, __extension__ __PRETTY_FUNCTION__));

// This represents the number of characters copied into the destination
// buffer. (It may not actually be the strlen if the destination buffer
// is not terminated.)
SVal finalStrLength = UnknownVal();
SVal strlRetVal = UnknownVal();

if (appendK == ConcatFnKind::none && !returnPtr) {
  // strlcpy returns the sizeof(src)
  strlRetVal = strLength;
}

// If this is an appending function (strcat, strncat...) then set the
// string length to strlen(src) + strlen(dst) since the buffer will
// ultimately contain both.
if (appendK != ConcatFnKind::none) {
  // Get the string length of the destination. If the destination is memory
  // that can't have a string length, we shouldn't be copying into it anyway.
  if (dstStrLength.isUndef())
    return;

  if (appendK == ConcatFnKind::strlcat && dstStrLengthNL && strLengthNL) {
    strlRetVal = svalBuilder.evalBinOpNN(state, BO_Add, *strLengthNL,
                                         *dstStrLengthNL, sizeTy);
  }

  std::optional<NonLoc> amountCopiedNL = amountCopied.getAs<NonLoc>();

  // If we know both string lengths, we might know the final string length.
  if (amountCopiedNL && dstStrLengthNL) {
    // Make sure the two lengths together don't overflow a size_t.
    state = checkAdditionOverflow(C, state, *amountCopiedNL, *dstStrLengthNL);
    if (!state)
      return;

    finalStrLength = svalBuilder.evalBinOpNN(state, BO_Add, *amountCopiedNL,
                                             *dstStrLengthNL, sizeTy);
  }

  // If we couldn't get a single value for the final string length,
  // we can at least bound it by the individual lengths.
  if (finalStrLength.isUnknown()) {
    // Try to get a "hypothetical" string length symbol, which we can later
    // set as a real value if that turns out to be the case.
    finalStrLength = getCStringLength(C, state, CE, DstVal, true);
    assert(!finalStrLength.isUndef())(static_cast <bool> (!finalStrLength.isUndef()) ? void (
0) : __assert_fail ("!finalStrLength.isUndef()", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 1887, __extension__ __PRETTY_FUNCTION__));

    if (std::optional<NonLoc> finalStrLengthNL =
            finalStrLength.getAs<NonLoc>()) {
      if (amountCopiedNL && appendK == ConcatFnKind::none) {
        // we overwrite dst string with the src
        // finalStrLength >= srcStrLength
        SVal sourceInResult = svalBuilder.evalBinOpNN(
            state, BO_GE, *finalStrLengthNL, *amountCopiedNL, cmpTy);
        state = state->assume(sourceInResult.castAs<DefinedOrUnknownSVal>(),
                              true);
        if (!state)
          return;
      }

      if (dstStrLengthNL && appendK != ConcatFnKind::none) {
        // we extend the dst string with the src
        // finalStrLength >= dstStrLength
        SVal destInResult = svalBuilder.evalBinOpNN(state, BO_GE,
                                                    *finalStrLengthNL,
                                                    *dstStrLengthNL,
                                                    cmpTy);
        state =
            state->assume(destInResult.castAs<DefinedOrUnknownSVal>(), true);
        if (!state)
          return;
      }
    }
  }

} else {
  // Otherwise, this is a copy-over function (strcpy, strncpy, ...), and
  // the final string length will match the input string length.
  finalStrLength = amountCopied;
}

SVal Result;

if (returnPtr) {
  // The final result of the function will either be a pointer past the last
  // copied element, or a pointer to the start of the destination buffer.
  Result = (ReturnEnd ? UnknownVal() : DstVal);
} else {
  if (appendK == ConcatFnKind::strlcat || appendK == ConcatFnKind::none)
    //strlcpy, strlcat
    Result = strlRetVal;
  else
    Result = finalStrLength;
}

assert(state)(static_cast <bool> (state) ? void (0) : __assert_fail (
"state", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 1937, __extension__ __PRETTY_FUNCTION__));

// If the destination is a MemRegion, try to check for a buffer overflow and
// record the new string length.
if (std::optional<loc::MemRegionVal> dstRegVal =
        DstVal.getAs<loc::MemRegionVal>()) {
  QualType ptrTy = Dst.Expression->getType();

  // If we have an exact value on a bounded copy, use that to check for
  // overflows, rather than our estimate about how much is actually copied.
  if (std::optional<NonLoc> maxLastNL = maxLastElementIndex.getAs<NonLoc>()) {
    SVal maxLastElement =
        svalBuilder.evalBinOpLN(state, BO_Add, *dstRegVal, *maxLastNL, ptrTy);

    state = CheckLocation(C, state, Dst, maxLastElement, AccessKind::write);
    if (!state)
      return;
  }

  // Then, if the final length is known...
  if (std::optional<NonLoc> knownStrLength = finalStrLength.getAs<NonLoc>()) {
    SVal lastElement = svalBuilder.evalBinOpLN(state, BO_Add, *dstRegVal,
        *knownStrLength, ptrTy);

    // ...and we haven't checked the bound, we'll check the actual copy.
    if (!boundWarning) {
      state = CheckLocation(C, state, Dst, lastElement, AccessKind::write);
      if (!state)
        return;
    }

    // If this is a stpcpy-style copy, the last element is the return value.
    if (returnPtr && ReturnEnd)
      Result = lastElement;
  }

  // Invalidate the destination (regular invalidation without pointer-escaping
  // the address of the top-level region). This must happen before we set the
  // C string length because invalidation will clear the length.
  // FIXME: Even if we can't perfectly model the copy, we should see if we
  // can use LazyCompoundVals to copy the source values into the destination.
  // This would probably remove any existing bindings past the end of the
  // string, but that's still an improvement over blank invalidation.
  state = InvalidateBuffer(C, state, Dst.Expression, *dstRegVal,
                           /*IsSourceBuffer*/ false, nullptr);

  // Invalidate the source (const-invalidation without const-pointer-escaping
  // the address of the top-level region).
  state = InvalidateBuffer(C, state, srcExpr.Expression, srcVal,
                           /*IsSourceBuffer*/ true, nullptr);

  // Set the C string length of the destination, if we know it.
  if (IsBounded && (appendK == ConcatFnKind::none)) {
    // strncpy is annoying in that it doesn't guarantee to null-terminate
    // the result string. If the original string didn't fit entirely inside
    // the bound (including the null-terminator), we don't know how long the
    // result is.
    if (amountCopied != strLength)
      finalStrLength = UnknownVal();
  }
  state = setCStringLength(state, dstRegVal->getRegion(), finalStrLength);
}

assert(state)(static_cast <bool> (state) ? void (0) : __assert_fail (
"state", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 2000, __extension__ __PRETTY_FUNCTION__));

if (returnPtr) {
  // If this is a stpcpy-style copy, but we were unable to check for a buffer
  // overflow, we still need a result. Conjure a return value.
  if (ReturnEnd && Result.isUnknown()) {
    Result = svalBuilder.conjureSymbolVal(nullptr, CE, LCtx, C.blockCount());
  }
}
// Set the return value.
state = state->BindExpr(CE, LCtx, Result);
C.addTransition(state);
2012}

2014void CStringChecker::evalStrcmp(CheckerContext &C, const CallExpr *CE) const {
//int strcmp(const char *s1, const char *s2);
evalStrcmpCommon(C, CE, /* IsBounded = */ false, /* IgnoreCase = */ false);
2017}

2019void CStringChecker::evalStrncmp(CheckerContext &C, const CallExpr *CE) const {
//int strncmp(const char *s1, const char *s2, size_t n);
evalStrcmpCommon(C, CE, /* IsBounded = */ true, /* IgnoreCase = */ false);
2022}

2024void CStringChecker::evalStrcasecmp(CheckerContext &C,
  const CallExpr *CE) const {
//int strcasecmp(const char *s1, const char *s2);
evalStrcmpCommon(C, CE, /* IsBounded = */ false, /* IgnoreCase = */ true);
2028}

2030void CStringChecker::evalStrncasecmp(CheckerContext &C,
  const CallExpr *CE) const {
//int strncasecmp(const char *s1, const char *s2, size_t n);
evalStrcmpCommon(C, CE, /* IsBounded = */ true, /* IgnoreCase = */ true);
2034}

2036void CStringChecker::evalStrcmpCommon(CheckerContext &C, const CallExpr *CE,
  bool IsBounded, bool IgnoreCase) const {
CurrentFunctionDescription = "string comparison function";
ProgramStateRef state = C.getState();
const LocationContext *LCtx = C.getLocationContext();

// Check that the first string is non-null
AnyArgExpr Left = {CE->getArg(0), 0};
SVal LeftVal = state->getSVal(Left.Expression, LCtx);
state = checkNonNull(C, state, Left, LeftVal);
if (!state)
  return;

// Check that the second string is non-null.
AnyArgExpr Right = {CE->getArg(1), 1};
SVal RightVal = state->getSVal(Right.Expression, LCtx);
state = checkNonNull(C, state, Right, RightVal);
if (!state)
  return;

// Get the string length of the first string or give up.
SVal LeftLength = getCStringLength(C, state, Left.Expression, LeftVal);
if (LeftLength.isUndef())
  return;

// Get the string length of the second string or give up.
SVal RightLength = getCStringLength(C, state, Right.Expression, RightVal);
if (RightLength.isUndef())
  return;

// If we know the two buffers are the same, we know the result is 0.
// First, get the two buffers' addresses. Another checker will have already
// made sure they're not undefined.
DefinedOrUnknownSVal LV = LeftVal.castAs<DefinedOrUnknownSVal>();
DefinedOrUnknownSVal RV = RightVal.castAs<DefinedOrUnknownSVal>();

// See if they are the same.
SValBuilder &svalBuilder = C.getSValBuilder();
DefinedOrUnknownSVal SameBuf = svalBuilder.evalEQ(state, LV, RV);
ProgramStateRef StSameBuf, StNotSameBuf;
std::tie(StSameBuf, StNotSameBuf) = state->assume(SameBuf);

// If the two arguments might be the same buffer, we know the result is 0,
// and we only need to check one size.
if (StSameBuf) {
  StSameBuf = StSameBuf->BindExpr(CE, LCtx,
      svalBuilder.makeZeroVal(CE->getType()));
  C.addTransition(StSameBuf);

  // If the two arguments are GUARANTEED to be the same, we're done!
  if (!StNotSameBuf)
    return;
}

assert(StNotSameBuf)(static_cast <bool> (StNotSameBuf) ? void (0) : __assert_fail
 ("StNotSameBuf", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 2090, __extension__ __PRETTY_FUNCTION__));
state = StNotSameBuf;

// At this point we can go about comparing the two buffers.
// For now, we only do this if they're both known string literals.

// Attempt to extract string literals from both expressions.
const StringLiteral *LeftStrLiteral =
    getCStringLiteral(C, state, Left.Expression, LeftVal);
const StringLiteral *RightStrLiteral =
    getCStringLiteral(C, state, Right.Expression, RightVal);
bool canComputeResult = false;
SVal resultVal = svalBuilder.conjureSymbolVal(nullptr, CE, LCtx,
    C.blockCount());

if (LeftStrLiteral && RightStrLiteral) {
  StringRef LeftStrRef = LeftStrLiteral->getString();
  StringRef RightStrRef = RightStrLiteral->getString();

  if (IsBounded) {
    // Get the max number of characters to compare.
    const Expr *lenExpr = CE->getArg(2);
    SVal lenVal = state->getSVal(lenExpr, LCtx);

    // If the length is known, we can get the right substrings.
    if (const llvm::APSInt *len = svalBuilder.getKnownValue(state, lenVal)) {
      // Create substrings of each to compare the prefix.
      LeftStrRef = LeftStrRef.substr(0, (size_t)len->getZExtValue());
      RightStrRef = RightStrRef.substr(0, (size_t)len->getZExtValue());
      canComputeResult = true;
    }
  } else {
    // This is a normal, unbounded strcmp.
    canComputeResult = true;
  }

  if (canComputeResult) {
    // Real strcmp stops at null characters.
    size_t s1Term = LeftStrRef.find('\0');
    if (s1Term != StringRef::npos)
      LeftStrRef = LeftStrRef.substr(0, s1Term);

    size_t s2Term = RightStrRef.find('\0');
    if (s2Term != StringRef::npos)
      RightStrRef = RightStrRef.substr(0, s2Term);

    // Use StringRef's comparison methods to compute the actual result.
    int compareRes = IgnoreCase ? LeftStrRef.compare_insensitive(RightStrRef)
                                : LeftStrRef.compare(RightStrRef);

    // The strcmp function returns an integer greater than, equal to, or less
    // than zero, [c11, p7.24.4.2].
    if (compareRes == 0) {
      resultVal = svalBuilder.makeIntVal(compareRes, CE->getType());
    }
    else {
      DefinedSVal zeroVal = svalBuilder.makeIntVal(0, CE->getType());
      // Constrain strcmp's result range based on the result of StringRef's
      // comparison methods.
      BinaryOperatorKind op = (compareRes > 0) ? BO_GT : BO_LT;
      SVal compareWithZero =
        svalBuilder.evalBinOp(state, op, resultVal, zeroVal,
            svalBuilder.getConditionType());
      DefinedSVal compareWithZeroVal = compareWithZero.castAs<DefinedSVal>();
      state = state->assume(compareWithZeroVal, true);
    }
  }
}

state = state->BindExpr(CE, LCtx, resultVal);

// Record this as a possible path.
C.addTransition(state);
2163}

2165void CStringChecker::evalStrsep(CheckerContext &C, const CallExpr *CE) const {
// char *strsep(char **stringp, const char *delim);
// Verify whether the search string parameter matches the return type.
SourceArgExpr SearchStrPtr = {CE->getArg(0), 0};

QualType CharPtrTy = SearchStrPtr.Expression->getType()->getPointeeType();
if (CharPtrTy.isNull() ||
    CE->getType().getUnqualifiedType() != CharPtrTy.getUnqualifiedType())
  return;

CurrentFunctionDescription = "strsep()";
ProgramStateRef State = C.getState();
const LocationContext *LCtx = C.getLocationContext();

// Check that the search string pointer is non-null (though it may point to
// a null string).
SVal SearchStrVal = State->getSVal(SearchStrPtr.Expression, LCtx);
State = checkNonNull(C, State, SearchStrPtr, SearchStrVal);
if (!State)
  return;

// Check that the delimiter string is non-null.
AnyArgExpr DelimStr = {CE->getArg(1), 1};
SVal DelimStrVal = State->getSVal(DelimStr.Expression, LCtx);
State = checkNonNull(C, State, DelimStr, DelimStrVal);
if (!State)
  return;

SValBuilder &SVB = C.getSValBuilder();
SVal Result;
if (std::optional<Loc> SearchStrLoc = SearchStrVal.getAs<Loc>()) {
  // Get the current value of the search string pointer, as a char*.
  Result = State->getSVal(*SearchStrLoc, CharPtrTy);

  // Invalidate the search string, representing the change of one delimiter
  // character to NUL.
  State = InvalidateBuffer(C, State, SearchStrPtr.Expression, Result,
                           /*IsSourceBuffer*/ false, nullptr);

  // Overwrite the search string pointer. The new value is either an address
  // further along in the same string, or NULL if there are no more tokens.
  State = State->bindLoc(*SearchStrLoc,
      SVB.conjureSymbolVal(getTag(),
        CE,
        LCtx,
        CharPtrTy,
        C.blockCount()),
      LCtx);
} else {
  assert(SearchStrVal.isUnknown())(static_cast <bool> (SearchStrVal.isUnknown()) ? void (
0) : __assert_fail ("SearchStrVal.isUnknown()", "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp"
, 2214, __extension__ __PRETTY_FUNCTION__));
  // Conjure a symbolic value. It's the best we can do.
  Result = SVB.conjureSymbolVal(nullptr, CE, LCtx, C.blockCount());
}

// Set the return value, and finish.
State = State->BindExpr(CE, LCtx, Result);
C.addTransition(State);
2222}

2224// These should probably be moved into a C++ standard library checker.
2225void CStringChecker::evalStdCopy(CheckerContext &C, const CallExpr *CE) const {
evalStdCopyCommon(C, CE);
2227}

2229void CStringChecker::evalStdCopyBackward(CheckerContext &C,
  const CallExpr *CE) const {
evalStdCopyCommon(C, CE);
2232}

2234void CStringChecker::evalStdCopyCommon(CheckerContext &C,
  const CallExpr *CE) const {
if (!CE->getArg(2)->getType()->isPointerType())
  return;

ProgramStateRef State = C.getState();

const LocationContext *LCtx = C.getLocationContext();

// template <class _InputIterator, class _OutputIterator>
// _OutputIterator
// copy(_InputIterator __first, _InputIterator __last,
//        _OutputIterator __result)

// Invalidate the destination buffer
const Expr *Dst = CE->getArg(2);
SVal DstVal = State->getSVal(Dst, LCtx);
State = InvalidateBuffer(C, State, Dst, DstVal, /*IsSource=*/false,
    /*Size=*/nullptr);

SValBuilder &SVB = C.getSValBuilder();

SVal ResultVal = SVB.conjureSymbolVal(nullptr, CE, LCtx, C.blockCount());
State = State->BindExpr(CE, LCtx, ResultVal);

C.addTransition(State);
2260}

2262void CStringChecker::evalMemset(CheckerContext &C, const CallExpr *CE) const {
// void *memset(void *s, int c, size_t n);
CurrentFunctionDescription = "memory set function";

DestinationArgExpr Buffer = {CE->getArg(0), 0};
AnyArgExpr CharE = {CE->getArg(1), 1};
SizeArgExpr Size = {CE->getArg(2), 2};

ProgramStateRef State = C.getState();

// See if the size argument is zero.
const LocationContext *LCtx = C.getLocationContext();
SVal SizeVal = C.getSVal(Size.Expression);
QualType SizeTy = Size.Expression->getType();

ProgramStateRef ZeroSize, NonZeroSize;
std::tie(ZeroSize, NonZeroSize) = assumeZero(C, State, SizeVal, SizeTy);

// Get the value of the memory area.
SVal BufferPtrVal = C.getSVal(Buffer.Expression);

// If the size is zero, there won't be any actual memory access, so
// just bind the return value to the buffer and return.
if (ZeroSize && !NonZeroSize) {
  ZeroSize = ZeroSize->BindExpr(CE, LCtx, BufferPtrVal);
  C.addTransition(ZeroSize);
  return;
}

// Ensure the memory area is not null.
// If it is NULL there will be a NULL pointer dereference.
State = checkNonNull(C, NonZeroSize, Buffer, BufferPtrVal);
if (!State)
  return;

State = CheckBufferAccess(C, State, Buffer, Size, AccessKind::write);
if (!State)
  return;

// According to the values of the arguments, bind the value of the second
// argument to the destination buffer and set string length, or just
// invalidate the destination buffer.
if (!memsetAux(Buffer.Expression, C.getSVal(CharE.Expression),
               Size.Expression, C, State))
  return;

State = State->BindExpr(CE, LCtx, BufferPtrVal);
C.addTransition(State);
2310}

2312void CStringChecker::evalBzero(CheckerContext &C, const CallExpr *CE) const {
CurrentFunctionDescription = "memory clearance function";

DestinationArgExpr Buffer = {CE->getArg(0), 0};
SizeArgExpr Size = {CE->getArg(1), 1};
SVal Zero = C.getSValBuilder().makeZeroVal(C.getASTContext().IntTy);

ProgramStateRef State = C.getState();

// See if the size argument is zero.
SVal SizeVal = C.getSVal(Size.Expression);
QualType SizeTy = Size.Expression->getType();

ProgramStateRef StateZeroSize, StateNonZeroSize;
std::tie(StateZeroSize, StateNonZeroSize) =
  assumeZero(C, State, SizeVal, SizeTy);

// If the size is zero, there won't be any actual memory access,
// In this case we just return.
if (StateZeroSize && !StateNonZeroSize) {
  C.addTransition(StateZeroSize);
  return;
}

// Get the value of the memory area.
SVal MemVal = C.getSVal(Buffer.Expression);

// Ensure the memory area is not null.
// If it is NULL there will be a NULL pointer dereference.
State = checkNonNull(C, StateNonZeroSize, Buffer, MemVal);
if (!State)
  return;

State = CheckBufferAccess(C, State, Buffer, Size, AccessKind::write);
if (!State)
  return;

if (!memsetAux(Buffer.Expression, Zero, Size.Expression, C, State))
  return;

C.addTransition(State);
2353}

2355//===----------------------------------------------------------------------===//
2356// The driver method, and other Checker callbacks.
2357//===----------------------------------------------------------------------===//

2359CStringChecker::FnCheck CStringChecker::identifyCall(const CallEvent &Call,
                                                   CheckerContext &C) const {
const auto *CE = dyn_cast_or_null<CallExpr>(Call.getOriginExpr());
if (!CE)
  return nullptr;

const FunctionDecl *FD = dyn_cast_or_null<FunctionDecl>(Call.getDecl());
if (!FD)
  return nullptr;

if (StdCopy.matches(Call))
  return &CStringChecker::evalStdCopy;
if (StdCopyBackward.matches(Call))
  return &CStringChecker::evalStdCopyBackward;

// Pro-actively check that argument types are safe to do arithmetic upon.
// We do not want to crash if someone accidentally passes a structure
// into, say, a C++ overload of any of these functions. We could not check
// that for std::copy because they may have arguments of other types.
for (auto I : CE->arguments()) {
  QualType T = I->getType();
  if (!T->isIntegralOrEnumerationType() && !T->isPointerType())
    return nullptr;
}

const FnCheck *Callback = Callbacks.lookup(Call);
if (Callback)
  return *Callback;

return nullptr;
2389}

2391bool CStringChecker::evalCall(const CallEvent &Call, CheckerContext &C) const {
FnCheck Callback = identifyCall(Call, C);

// If the callee isn't a string function, let another checker handle it.
if (!Callback)
  return false;

// Check and evaluate the call.
const auto *CE = cast<CallExpr>(Call.getOriginExpr());
Callback(this, C, CE);

// If the evaluate call resulted in no change, chain to the next eval call
// handler.
// Note, the custom CString evaluation calls assume that basic safety
// properties are held. However, if the user chooses to turn off some of these
// checks, we ignore the issues and leave the call evaluation to a generic
// handler.
return C.isDifferent();
2409}

2411void CStringChecker::checkPreStmt(const DeclStmt *DS, CheckerContext &C) const {
// Record string length for char a[] = "abc";
ProgramStateRef state = C.getState();

for (const auto *I : DS->decls()) {
  const VarDecl *D = dyn_cast<VarDecl>(I);
  if (!D)
    continue;

  // FIXME: Handle array fields of structs.
  if (!D->getType()->isArrayType())
    continue;

  const Expr *Init = D->getInit();
  if (!Init)
    continue;
  if (!isa<StringLiteral>(Init))
    continue;

  Loc VarLoc = state->getLValue(D, C.getLocationContext());
  const MemRegion *MR = VarLoc.getAsRegion();
  if (!MR)
    continue;

  SVal StrVal = C.getSVal(Init);
  assert(StrVal.isValid() && "Initializer string is unknown or undefined")(static_cast <bool> (StrVal.isValid() && "Initializer string is unknown or undefined"
) ? void (0) : __assert_fail ("StrVal.isValid() && \"Initializer string is unknown or undefined\""
, "clang/lib/StaticAnalyzer/Checkers/CStringChecker.cpp", 2436
, __extension__ __PRETTY_FUNCTION__));
  DefinedOrUnknownSVal strLength =
    getCStringLength(C, state, Init, StrVal).castAs<DefinedOrUnknownSVal>();

  state = state->set<CStringLength>(MR, strLength);
}

C.addTransition(state);
2444}

2446ProgramStateRef
2447CStringChecker::checkRegionChanges(ProgramStateRef state,
  const InvalidatedSymbols *,
  ArrayRef<const MemRegion *> ExplicitRegions,
  ArrayRef<const MemRegion *> Regions,
  const LocationContext *LCtx,
  const CallEvent *Call) const {
CStringLengthTy Entries = state->get<CStringLength>();
if (Entries.isEmpty())
  return state;

llvm::SmallPtrSet<const MemRegion *, 8> Invalidated;
llvm::SmallPtrSet<const MemRegion *, 32> SuperRegions;

// First build sets for the changed regions and their super-regions.
for (ArrayRef<const MemRegion *>::iterator
    I = Regions.begin(), E = Regions.end(); I != E; ++I) {
  const MemRegion *MR = *I;
  Invalidated.insert(MR);

  SuperRegions.insert(MR);
  while (const SubRegion *SR = dyn_cast<SubRegion>(MR)) {
    MR = SR->getSuperRegion();
    SuperRegions.insert(MR);
  }
}

CStringLengthTy::Factory &F = state->get_context<CStringLength>();

// Then loop over the entries in the current state.
for (CStringLengthTy::iterator I = Entries.begin(),
    E = Entries.end(); I != E; ++I) {
  const MemRegion *MR = I.getKey();

  // Is this entry for a super-region of a changed region?
  if (SuperRegions.count(MR)) {
    Entries = F.remove(Entries, MR);
    continue;
  }

  // Is this entry for a sub-region of a changed region?
  const MemRegion *Super = MR;
  while (const SubRegion *SR = dyn_cast<SubRegion>(Super)) {
    Super = SR->getSuperRegion();
    if (Invalidated.count(Super)) {
      Entries = F.remove(Entries, MR);
      break;
    }
  }
}

return state->set<CStringLength>(Entries);
2498}

2500void CStringChecker::checkLiveSymbols(ProgramStateRef state,
  SymbolReaper &SR) const {
// Mark all symbols in our string length map as valid.
CStringLengthTy Entries = state->get<CStringLength>();

for (CStringLengthTy::iterator I = Entries.begin(), E = Entries.end();
    I != E; ++I) {
  SVal Len = I.getData();

  for (SymExpr::symbol_iterator si = Len.symbol_begin(),
      se = Len.symbol_end(); si != se; ++si)
    SR.markInUse(*si);
}
2513}

2515void CStringChecker::checkDeadSymbols(SymbolReaper &SR,
  CheckerContext &C) const {
ProgramStateRef state = C.getState();
CStringLengthTy Entries = state->get<CStringLength>();
if (Entries.isEmpty())
  return;

CStringLengthTy::Factory &F = state->get_context<CStringLength>();
for (CStringLengthTy::iterator I = Entries.begin(), E = Entries.end();
    I != E; ++I) {
  SVal Len = I.getData();
  if (SymbolRef Sym = Len.getAsSymbol()) {
    if (SR.isDead(Sym))
      Entries = F.remove(Entries, I.getKey());
  }
}

state = state->set<CStringLength>(Entries);
C.addTransition(state);
2534}

2536void ento::registerCStringModeling(CheckerManager &Mgr) {
Mgr.registerChecker<CStringChecker>();
2538}

2540bool ento::shouldRegisterCStringModeling(const CheckerManager &mgr) {
return true;
2542}

2544#define REGISTER_CHECKER(name)void ento::registername(CheckerManager &mgr) { CStringChecker
 *checker = mgr.getChecker<CStringChecker>(); checker->
Filter.Checkname = true; checker->Filter.CheckNamename = mgr
.getCurrentCheckerName(); } bool ento::shouldRegistername(const
 CheckerManager &mgr) { return true; }                                                 \
void ento::register##name(CheckerManager &mgr) {                             \
  CStringChecker *checker = mgr.getChecker<CStringChecker>();                \
  checker->Filter.Check##name = true;                                        \
  checker->Filter.CheckName##name = mgr.getCurrentCheckerName();             \
}                                                                            \
                                                                             \
bool ento::shouldRegister##name(const CheckerManager &mgr) { return true; }

2553REGISTER_CHECKER(CStringNullArg)void ento::registerCStringNullArg(CheckerManager &mgr) { CStringChecker
 *checker = mgr.getChecker<CStringChecker>(); checker->
Filter.CheckCStringNullArg = true; checker->Filter.CheckNameCStringNullArg
 = mgr.getCurrentCheckerName(); } bool ento::shouldRegisterCStringNullArg
(const CheckerManager &mgr) { return true; }
2554REGISTER_CHECKER(CStringOutOfBounds)void ento::registerCStringOutOfBounds(CheckerManager &mgr
) { CStringChecker *checker = mgr.getChecker<CStringChecker
>(); checker->Filter.CheckCStringOutOfBounds = true; checker
->Filter.CheckNameCStringOutOfBounds = mgr.getCurrentCheckerName
(); } bool ento::shouldRegisterCStringOutOfBounds(const CheckerManager
 &mgr) { return true; }
2555REGISTER_CHECKER(CStringBufferOverlap)void ento::registerCStringBufferOverlap(CheckerManager &mgr
) { CStringChecker *checker = mgr.getChecker<CStringChecker
>(); checker->Filter.CheckCStringBufferOverlap = true; checker
->Filter.CheckNameCStringBufferOverlap = mgr.getCurrentCheckerName
(); } bool ento::shouldRegisterCStringBufferOverlap(const CheckerManager
 &mgr) { return true; }
2556REGISTER_CHECKER(CStringNotNullTerm)void ento::registerCStringNotNullTerm(CheckerManager &mgr
) { CStringChecker *checker = mgr.getChecker<CStringChecker
>(); checker->Filter.CheckCStringNotNullTerm = true; checker
->Filter.CheckNameCStringNotNullTerm = mgr.getCurrentCheckerName
(); } bool ento::shouldRegisterCStringNotNullTerm(const CheckerManager
 &mgr) { return true; }
2557REGISTER_CHECKER(CStringUninitializedRead)void ento::registerCStringUninitializedRead(CheckerManager &
mgr) { CStringChecker *checker = mgr.getChecker<CStringChecker
>(); checker->Filter.CheckCStringUninitializedRead = true
; checker->Filter.CheckNameCStringUninitializedRead = mgr.
getCurrentCheckerName(); } bool ento::shouldRegisterCStringUninitializedRead
(const CheckerManager &mgr) { return true; }

←

/build/source/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ProgramState.h

→

1//== ProgramState.h - Path-sensitive "State" for tracking values -*- 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 state of the program along the analysisa path.
10//
11//===----------------------------------------------------------------------===//

13#ifndef LLVM_CLANG_STATICANALYZER_CORE_PATHSENSITIVE_PROGRAMSTATE_H
14#define LLVM_CLANG_STATICANALYZER_CORE_PATHSENSITIVE_PROGRAMSTATE_H

16#include "clang/Basic/LLVM.h"
17#include "clang/StaticAnalyzer/Core/PathSensitive/ConstraintManager.h"
18#include "clang/StaticAnalyzer/Core/PathSensitive/DynamicTypeInfo.h"
19#include "clang/StaticAnalyzer/Core/PathSensitive/Environment.h"
20#include "clang/StaticAnalyzer/Core/PathSensitive/ProgramState_Fwd.h"
21#include "clang/StaticAnalyzer/Core/PathSensitive/SValBuilder.h"
22#include "clang/StaticAnalyzer/Core/PathSensitive/Store.h"
23#include "llvm/ADT/FoldingSet.h"
24#include "llvm/ADT/ImmutableMap.h"
25#include "llvm/Support/Allocator.h"
26#include <optional>
27#include <utility>

29namespace llvm {
30class APSInt;
31}

33namespace clang {
34class ASTContext;

36namespace ento {

38class AnalysisManager;
39class CallEvent;
40class CallEventManager;

42typedef std::unique_ptr<ConstraintManager>(*ConstraintManagerCreator)(
  ProgramStateManager &, ExprEngine *);
44typedef std::unique_ptr<StoreManager>(*StoreManagerCreator)(
  ProgramStateManager &);

47//===----------------------------------------------------------------------===//
48// ProgramStateTrait - Traits used by the Generic Data Map of a ProgramState.
49//===----------------------------------------------------------------------===//

51template <typename T> struct ProgramStateTrait {
typedef typename T::data_type data_type;
static inline void *MakeVoidPtr(data_type D) { return (void*) D; }
static inline data_type MakeData(void *const* P) {
  return P ? (data_type) *P : (data_type) 0;
}
57};

59/// \class ProgramState
60/// ProgramState - This class encapsulates:
61///
62///    1. A mapping from expressions to values (Environment)
63///    2. A mapping from locations to values (Store)
64///    3. Constraints on symbolic values (GenericDataMap)
65///
66///  Together these represent the "abstract state" of a program.
67///
68///  ProgramState is intended to be used as a functional object; that is,
69///  once it is created and made "persistent" in a FoldingSet, its
70///  values will never change.
71class ProgramState : public llvm::FoldingSetNode {
72public:
typedef llvm::ImmutableSet<llvm::APSInt*>                IntSetTy;
typedef llvm::ImmutableMap<void*, void*>                 GenericDataMap;

76private:
void operator=(const ProgramState& R) = delete;

friend class ProgramStateManager;
friend class ExplodedGraph;
friend class ExplodedNode;
friend class NodeBuilder;

ProgramStateManager *stateMgr;
Environment Env;           // Maps a Stmt to its current SVal.
Store store;               // Maps a location to its current value.
GenericDataMap   GDM;      // Custom data stored by a client of this class.

// A state is infeasible if there is a contradiction among the constraints.
// An infeasible state is represented by a `nullptr`.
// In the sense of `assumeDual`, a state can have two children by adding a
// new constraint and the negation of that new constraint. A parent state is
// over-constrained if both of its children are infeasible. In the
// mathematical sense, it means that the parent is infeasible and we should
// have realized that at the moment when we have created it. However, we
// could not recognize that because of the imperfection of the underlying
// constraint solver. We say it is posteriorly over-constrained because we
// recognize that a parent is infeasible only *after* a new and more specific
// constraint and its negation are evaluated.
//
// Example:
//
// x * x = 4 and x is in the range [0, 1]
// This is an already infeasible state, but the constraint solver is not
// capable of handling sqrt, thus we don't know it yet.
//
// Then a new constraint `x = 0` is added. At this moment the constraint
// solver re-evaluates the existing constraints and realizes the
// contradiction `0 * 0 = 4`.
// We also evaluate the negated constraint `x != 0`;  the constraint solver
// deduces `x = 1` and then realizes the contradiction `1 * 1 = 4`.
// Both children are infeasible, thus the parent state is marked as
// posteriorly over-constrained. These parents are handled with special care:
// we do not allow transitions to exploded nodes with such states.
bool PosteriorlyOverconstrained = false;
// Make internal constraint solver entities friends so they can access the
// overconstrained-related functions. We want to keep this API inaccessible
// for Checkers.
friend class ConstraintManager;
bool isPosteriorlyOverconstrained() const {
  return PosteriorlyOverconstrained;
}
ProgramStateRef cloneAsPosteriorlyOverconstrained() const;

unsigned refCount;

/// makeWithStore - Return a ProgramState with the same values as the current
///  state with the exception of using the specified Store.
ProgramStateRef makeWithStore(const StoreRef &store) const;

void setStore(const StoreRef &storeRef);

133public:
/// This ctor is used when creating the first ProgramState object.
ProgramState(ProgramStateManager *mgr, const Environment& env,
        StoreRef st, GenericDataMap gdm);

/// Copy ctor - We must explicitly define this or else the "Next" ptr
///  in FoldingSetNode will also get copied.
ProgramState(const ProgramState &RHS);

~ProgramState();

int64_t getID() const;

/// Return the ProgramStateManager associated with this state.
ProgramStateManager &getStateManager() const {
  return *stateMgr;
}

AnalysisManager &getAnalysisManager() const;

/// Return the ConstraintManager.
ConstraintManager &getConstraintManager() const;

/// getEnvironment - Return the environment associated with this state.
///  The environment is the mapping from expressions to values.
const Environment& getEnvironment() const { return Env; }

/// Return the store associated with this state.  The store
///  is a mapping from locations to values.
Store getStore() const { return store; }


/// getGDM - Return the generic data map associated with this state.
GenericDataMap getGDM() const { return GDM; }

void setGDM(GenericDataMap gdm) { GDM = gdm; }

/// Profile - Profile the contents of a ProgramState object for use in a
///  FoldingSet.  Two ProgramState objects are considered equal if they
///  have the same Environment, Store, and GenericDataMap.
static void Profile(llvm::FoldingSetNodeID& ID, const ProgramState *V) {
  V->Env.Profile(ID);
  ID.AddPointer(V->store);
  V->GDM.Profile(ID);
  ID.AddBoolean(V->PosteriorlyOverconstrained);
}

/// Profile - Used to profile the contents of this object for inclusion
///  in a FoldingSet.
void Profile(llvm::FoldingSetNodeID& ID) const {
  Profile(ID, this);
}

BasicValueFactory &getBasicVals() const;
SymbolManager &getSymbolManager() const;

//==---------------------------------------------------------------------==//
// Constraints on values.
//==---------------------------------------------------------------------==//
//
// Each ProgramState records constraints on symbolic values.  These constraints
// are managed using the ConstraintManager associated with a ProgramStateManager.
// As constraints gradually accrue on symbolic values, added constraints
// may conflict and indicate that a state is infeasible (as no real values
// could satisfy all the constraints).  This is the principal mechanism
// for modeling path-sensitivity in ExprEngine/ProgramState.
//
// Various "assume" methods form the interface for adding constraints to
// symbolic values.  A call to 'assume' indicates an assumption being placed
// on one or symbolic values.  'assume' methods take the following inputs:
//
//  (1) A ProgramState object representing the current state.
//
//  (2) The assumed constraint (which is specific to a given "assume" method).
//
//  (3) A binary value "Assumption" that indicates whether the constraint is
//      assumed to be true or false.
//
// The output of "assume*" is a new ProgramState object with the added constraints.
// If no new state is feasible, NULL is returned.
//

/// Assumes that the value of \p cond is zero (if \p assumption is "false")
/// or non-zero (if \p assumption is "true").
///
/// This returns a new state with the added constraint on \p cond.
/// If no new state is feasible, NULL is returned.
[[nodiscard]] ProgramStateRef assume(DefinedOrUnknownSVal cond,
                                     bool assumption) const;

/// Assumes both "true" and "false" for \p cond, and returns both
/// corresponding states (respectively).
///
/// This is more efficient than calling assume() twice. Note that one (but not
/// both) of the returned states may be NULL.
[[nodiscard]] std::pair<ProgramStateRef, ProgramStateRef>
assume(DefinedOrUnknownSVal cond) const;

[[nodiscard]] std::pair<ProgramStateRef, ProgramStateRef>
assumeInBoundDual(DefinedOrUnknownSVal idx, DefinedOrUnknownSVal upperBound,
                  QualType IndexType = QualType()) const;

[[nodiscard]] ProgramStateRef
assumeInBound(DefinedOrUnknownSVal idx, DefinedOrUnknownSVal upperBound,
              bool assumption, QualType IndexType = QualType()) const;

/// Assumes that the value of \p Val is bounded with [\p From; \p To]
/// (if \p assumption is "true") or it is fully out of this range
/// (if \p assumption is "false").
///
/// This returns a new state with the added constraint on \p cond.
/// If no new state is feasible, NULL is returned.
[[nodiscard]] ProgramStateRef assumeInclusiveRange(DefinedOrUnknownSVal Val,
                                                   const llvm::APSInt &From,
                                                   const llvm::APSInt &To,
                                                   bool assumption) const;

/// Assumes given range both "true" and "false" for \p Val, and returns both
/// corresponding states (respectively).
///
/// This is more efficient than calling assume() twice. Note that one (but not
/// both) of the returned states may be NULL.
[[nodiscard]] std::pair<ProgramStateRef, ProgramStateRef>
assumeInclusiveRange(DefinedOrUnknownSVal Val, const llvm::APSInt &From,
                     const llvm::APSInt &To) const;

/// Check if the given SVal is not constrained to zero and is not
///        a zero constant.
ConditionTruthVal isNonNull(SVal V) const;

/// Check if the given SVal is constrained to zero or is a zero
///        constant.
ConditionTruthVal isNull(SVal V) const;

/// \return Whether values \p Lhs and \p Rhs are equal.
ConditionTruthVal areEqual(SVal Lhs, SVal Rhs) const;

/// Utility method for getting regions.
LLVM_ATTRIBUTE_RETURNS_NONNULL__attribute__((returns_nonnull))
const VarRegion* getRegion(const VarDecl *D, const LocationContext *LC) const;

//==---------------------------------------------------------------------==//
// Binding and retrieving values to/from the environment and symbolic store.
//==---------------------------------------------------------------------==//

/// Create a new state by binding the value 'V' to the statement 'S' in the
/// state's environment.
[[nodiscard]] ProgramStateRef BindExpr(const Stmt *S,
                                       const LocationContext *LCtx, SVal V,
                                       bool Invalidate = true) const;

[[nodiscard]] ProgramStateRef bindLoc(Loc location, SVal V,
                                      const LocationContext *LCtx,
                                      bool notifyChanges = true) const;

[[nodiscard]] ProgramStateRef bindLoc(SVal location, SVal V,
                                      const LocationContext *LCtx) const;

/// Initializes the region of memory represented by \p loc with an initial
/// value. Once initialized, all values loaded from any sub-regions of that
/// region will be equal to \p V, unless overwritten later by the program.
/// This method should not be used on regions that are already initialized.
/// If you need to indicate that memory contents have suddenly become unknown
/// within a certain region of memory, consider invalidateRegions().
[[nodiscard]] ProgramStateRef
bindDefaultInitial(SVal loc, SVal V, const LocationContext *LCtx) const;

/// Performs C++ zero-initialization procedure on the region of memory
/// represented by \p loc.
[[nodiscard]] ProgramStateRef
bindDefaultZero(SVal loc, const LocationContext *LCtx) const;

[[nodiscard]] ProgramStateRef killBinding(Loc LV) const;

/// Returns the state with bindings for the given regions
///  cleared from the store.
///
/// Optionally invalidates global regions as well.
///
/// \param Regions the set of regions to be invalidated.
/// \param E the expression that caused the invalidation.
/// \param BlockCount The number of times the current basic block has been
//         visited.
/// \param CausesPointerEscape the flag is set to true when
///        the invalidation entails escape of a symbol (representing a
///        pointer). For example, due to it being passed as an argument in a
///        call.
/// \param IS the set of invalidated symbols.
/// \param Call if non-null, the invalidated regions represent parameters to
///        the call and should be considered directly invalidated.
/// \param ITraits information about special handling for a particular
///        region/symbol.
[[nodiscard]] ProgramStateRef
invalidateRegions(ArrayRef<const MemRegion *> Regions, const Expr *E,
                  unsigned BlockCount, const LocationContext *LCtx,
                  bool CausesPointerEscape, InvalidatedSymbols *IS = nullptr,
                  const CallEvent *Call = nullptr,
                  RegionAndSymbolInvalidationTraits *ITraits = nullptr) const;

[[nodiscard]] ProgramStateRef
invalidateRegions(ArrayRef<SVal> Regions, const Expr *E, unsigned BlockCount,
                  const LocationContext *LCtx, bool CausesPointerEscape,
                  InvalidatedSymbols *IS = nullptr,
                  const CallEvent *Call = nullptr,
                  RegionAndSymbolInvalidationTraits *ITraits = nullptr) const;

/// enterStackFrame - Returns the state for entry to the given stack frame,
///  preserving the current state.
[[nodiscard]] ProgramStateRef
enterStackFrame(const CallEvent &Call,
                const StackFrameContext *CalleeCtx) const;

/// Return the value of 'self' if available in the given context.
SVal getSelfSVal(const LocationContext *LC) const;

/// Get the lvalue for a base class object reference.
Loc getLValue(const CXXBaseSpecifier &BaseSpec, const SubRegion *Super) const;

/// Get the lvalue for a base class object reference.
Loc getLValue(const CXXRecordDecl *BaseClass, const SubRegion *Super,
              bool IsVirtual) const;

/// Get the lvalue for a variable reference.
Loc getLValue(const VarDecl *D, const LocationContext *LC) const;

Loc getLValue(const CompoundLiteralExpr *literal,
              const LocationContext *LC) const;

/// Get the lvalue for an ivar reference.
SVal getLValue(const ObjCIvarDecl *decl, SVal base) const;

/// Get the lvalue for a field reference.
SVal getLValue(const FieldDecl *decl, SVal Base) const;

/// Get the lvalue for an indirect field reference.
SVal getLValue(const IndirectFieldDecl *decl, SVal Base) const;

/// Get the lvalue for an array index.
SVal getLValue(QualType ElementType, SVal Idx, SVal Base) const;

/// Returns the SVal bound to the statement 'S' in the state's environment.
SVal getSVal(const Stmt *S, const LocationContext *LCtx) const;

SVal getSValAsScalarOrLoc(const Stmt *Ex, const LocationContext *LCtx) const;

/// Return the value bound to the specified location.
/// Returns UnknownVal() if none found.
SVal getSVal(Loc LV, QualType T = QualType()) const;

/// Returns the "raw" SVal bound to LV before any value simplfication.
SVal getRawSVal(Loc LV, QualType T= QualType()) const;

/// Return the value bound to the specified location.
/// Returns UnknownVal() if none found.
SVal getSVal(const MemRegion* R, QualType T = QualType()) const;

/// Return the value bound to the specified location, assuming
/// that the value is a scalar integer or an enumeration or a pointer.
/// Returns UnknownVal() if none found or the region is not known to hold
/// a value of such type.
SVal getSValAsScalarOrLoc(const MemRegion *R) const;

using region_iterator = const MemRegion **;

/// Visits the symbols reachable from the given SVal using the provided
/// SymbolVisitor.
///
/// This is a convenience API. Consider using ScanReachableSymbols class
/// directly when making multiple scans on the same state with the same
/// visitor to avoid repeated initialization cost.
/// \sa ScanReachableSymbols
bool scanReachableSymbols(SVal val, SymbolVisitor& visitor) const;

/// Visits the symbols reachable from the regions in the given
/// MemRegions range using the provided SymbolVisitor.
bool scanReachableSymbols(llvm::iterator_range<region_iterator> Reachable,
                          SymbolVisitor &visitor) const;

template <typename CB> CB scanReachableSymbols(SVal val) const;
template <typename CB> CB
scanReachableSymbols(llvm::iterator_range<region_iterator> Reachable) const;

//==---------------------------------------------------------------------==//
// Accessing the Generic Data Map (GDM).
//==---------------------------------------------------------------------==//

void *const* FindGDM(void *K) const;

template <typename T>
[[nodiscard]] ProgramStateRef
add(typename ProgramStateTrait<T>::key_type K) const;

template <typename T>
typename ProgramStateTrait<T>::data_type
get() const {
  return ProgramStateTrait<T>::MakeData(FindGDM(ProgramStateTrait<T>::GDMIndex()));
}

template<typename T>
typename ProgramStateTrait<T>::lookup_type
get(typename ProgramStateTrait<T>::key_type key) const {
  void *const* d = FindGDM(ProgramStateTrait<T>::GDMIndex());
  return ProgramStateTrait<T>::Lookup(ProgramStateTrait<T>::MakeData(d), key);
}

template <typename T>
typename ProgramStateTrait<T>::context_type get_context() const;

template <typename T>
[[nodiscard]] ProgramStateRef
remove(typename ProgramStateTrait<T>::key_type K) const;

template <typename T>
[[nodiscard]] ProgramStateRef
remove(typename ProgramStateTrait<T>::key_type K,
       typename ProgramStateTrait<T>::context_type C) const;

template <typename T> [[nodiscard]] ProgramStateRef remove() const;

template <typename T>
[[nodiscard]] ProgramStateRef
set(typename ProgramStateTrait<T>::data_type D) const;

template <typename T>
[[nodiscard]] ProgramStateRef
set(typename ProgramStateTrait<T>::key_type K,
    typename ProgramStateTrait<T>::value_type E) const;

template <typename T>
[[nodiscard]] ProgramStateRef
set(typename ProgramStateTrait<T>::key_type K,
    typename ProgramStateTrait<T>::value_type E,
    typename ProgramStateTrait<T>::context_type C) const;

template<typename T>
bool contains(typename ProgramStateTrait<T>::key_type key) const {
  void *const* d = FindGDM(ProgramStateTrait<T>::GDMIndex());
  return ProgramStateTrait<T>::Contains(ProgramStateTrait<T>::MakeData(d), key);
}

// Pretty-printing.
void printJson(raw_ostream &Out, const LocationContext *LCtx = nullptr,
               const char *NL = "\n", unsigned int Space = 0,
               bool IsDot = false) const;

void printDOT(raw_ostream &Out, const LocationContext *LCtx = nullptr,
              unsigned int Space = 0) const;

void dump() const;

483private:
friend void ProgramStateRetain(const ProgramState *state);
friend void ProgramStateRelease(const ProgramState *state);

/// \sa invalidateValues()
/// \sa invalidateRegions()
ProgramStateRef
invalidateRegionsImpl(ArrayRef<SVal> Values,
                      const Expr *E, unsigned BlockCount,
                      const LocationContext *LCtx,
                      bool ResultsInSymbolEscape,
                      InvalidatedSymbols *IS,
                      RegionAndSymbolInvalidationTraits *HTraits,
                      const CallEvent *Call) const;
497};

499//===----------------------------------------------------------------------===//
500// ProgramStateManager - Factory object for ProgramStates.
501//===----------------------------------------------------------------------===//

503class ProgramStateManager {
friend class ProgramState;
friend void ProgramStateRelease(const ProgramState *state);
506private:
/// Eng - The ExprEngine that owns this state manager.
ExprEngine *Eng; /* Can be null. */

EnvironmentManager                   EnvMgr;
std::unique_ptr<StoreManager>        StoreMgr;
std::unique_ptr<ConstraintManager>   ConstraintMgr;

ProgramState::GenericDataMap::Factory     GDMFactory;

typedef llvm::DenseMap<void*,std::pair<void*,void (*)(void*)> > GDMContextsTy;
GDMContextsTy GDMContexts;

/// StateSet - FoldingSet containing all the states created for analyzing
///  a particular function.  This is used to unique states.
llvm::FoldingSet<ProgramState> StateSet;

/// Object that manages the data for all created SVals.
std::unique_ptr<SValBuilder> svalBuilder;

/// Manages memory for created CallEvents.
std::unique_ptr<CallEventManager> CallEventMgr;

/// A BumpPtrAllocator to allocate states.
llvm::BumpPtrAllocator &Alloc;

/// A vector of ProgramStates that we can reuse.
std::vector<ProgramState *> freeStates;

535public:
ProgramStateManager(ASTContext &Ctx,
               StoreManagerCreator CreateStoreManager,
               ConstraintManagerCreator CreateConstraintManager,
               llvm::BumpPtrAllocator& alloc,
               ExprEngine *expreng);

~ProgramStateManager();

ProgramStateRef getInitialState(const LocationContext *InitLoc);

ASTContext &getContext() { return svalBuilder->getContext(); }
const ASTContext &getContext() const { return svalBuilder->getContext(); }

BasicValueFactory &getBasicVals() {
  return svalBuilder->getBasicValueFactory();
}

SValBuilder &getSValBuilder() {
  return *svalBuilder;
}

const SValBuilder &getSValBuilder() const {
  return *svalBuilder;
}

SymbolManager &getSymbolManager() {
  return svalBuilder->getSymbolManager();
}
const SymbolManager &getSymbolManager() const {
  return svalBuilder->getSymbolManager();
}

llvm::BumpPtrAllocator& getAllocator() { return Alloc; }

MemRegionManager& getRegionManager() {
  return svalBuilder->getRegionManager();
}
const MemRegionManager &getRegionManager() const {
  return svalBuilder->getRegionManager();
}

CallEventManager &getCallEventManager() { return *CallEventMgr; }

StoreManager &getStoreManager() { return *StoreMgr; }
ConstraintManager &getConstraintManager() { return *ConstraintMgr; }
ExprEngine &getOwningEngine() { return *Eng; }

ProgramStateRef
removeDeadBindingsFromEnvironmentAndStore(ProgramStateRef St,
                                          const StackFrameContext *LCtx,
                                          SymbolReaper &SymReaper);

588public:

SVal ArrayToPointer(Loc Array, QualType ElementTy) {
  return StoreMgr->ArrayToPointer(Array, ElementTy);
}

// Methods that manipulate the GDM.
ProgramStateRef addGDM(ProgramStateRef St, void *Key, void *Data);
ProgramStateRef removeGDM(ProgramStateRef state, void *Key);

// Methods that query & manipulate the Store.

void iterBindings(ProgramStateRef state, StoreManager::BindingsHandler& F) {
  StoreMgr->iterBindings(state->getStore(), F);
}

ProgramStateRef getPersistentState(ProgramState &Impl);
ProgramStateRef getPersistentStateWithGDM(ProgramStateRef FromState,
                                         ProgramStateRef GDMState);

bool haveEqualConstraints(ProgramStateRef S1, ProgramStateRef S2) const {
  return ConstraintMgr->haveEqualConstraints(S1, S2);
}

bool haveEqualEnvironments(ProgramStateRef S1, ProgramStateRef S2) const {
  return S1->Env == S2->Env;
}

bool haveEqualStores(ProgramStateRef S1, ProgramStateRef S2) const {
  return S1->store == S2->store;
}

//==---------------------------------------------------------------------==//
// Generic Data Map methods.
//==---------------------------------------------------------------------==//
//
// ProgramStateManager and ProgramState support a "generic data map" that allows
// different clients of ProgramState objects to embed arbitrary data within a
// ProgramState object.  The generic data map is essentially an immutable map
// from a "tag" (that acts as the "key" for a client) and opaque values.
// Tags/keys and values are simply void* values.  The typical way that clients
// generate unique tags are by taking the address of a static variable.
// Clients are responsible for ensuring that data values referred to by a
// the data pointer are immutable (and thus are essentially purely functional
// data).
//
// The templated methods below use the ProgramStateTrait<T> class
// to resolve keys into the GDM and to return data values to clients.
//

// Trait based GDM dispatch.
template <typename T>
ProgramStateRef set(ProgramStateRef st, typename ProgramStateTrait<T>::data_type D) {
  return addGDM(st, ProgramStateTrait<T>::GDMIndex(),
                ProgramStateTrait<T>::MakeVoidPtr(D));
}

template<typename T>
ProgramStateRef set(ProgramStateRef st,
                   typename ProgramStateTrait<T>::key_type K,
                   typename ProgramStateTrait<T>::value_type V,
                   typename ProgramStateTrait<T>::context_type C) {

  return addGDM(st, ProgramStateTrait<T>::GDMIndex(),
   ProgramStateTrait<T>::MakeVoidPtr(ProgramStateTrait<T>::Set(st->get<T>(), K, V, C)));
}

template <typename T>
ProgramStateRef add(ProgramStateRef st,
                   typename ProgramStateTrait<T>::key_type K,
                   typename ProgramStateTrait<T>::context_type C) {
  return addGDM(st, ProgramStateTrait<T>::GDMIndex(),
      ProgramStateTrait<T>::MakeVoidPtr(ProgramStateTrait<T>::Add(st->get<T>(), K, C)));
}

template <typename T>
ProgramStateRef remove(ProgramStateRef st,
                      typename ProgramStateTrait<T>::key_type K,
                      typename ProgramStateTrait<T>::context_type C) {

  return addGDM(st, ProgramStateTrait<T>::GDMIndex(),
   ProgramStateTrait<T>::MakeVoidPtr(ProgramStateTrait<T>::Remove(st->get<T>(), K, C)));
}

template <typename T>
ProgramStateRef remove(ProgramStateRef st) {
  return removeGDM(st, ProgramStateTrait<T>::GDMIndex());
}

void *FindGDMContext(void *index,
                     void *(*CreateContext)(llvm::BumpPtrAllocator&),
                     void  (*DeleteContext)(void*));

template <typename T>
typename ProgramStateTrait<T>::context_type get_context() {
  void *p = FindGDMContext(ProgramStateTrait<T>::GDMIndex(),
                           ProgramStateTrait<T>::CreateContext,
                           ProgramStateTrait<T>::DeleteContext);

  return ProgramStateTrait<T>::MakeContext(p);
}
689};


692//===----------------------------------------------------------------------===//
693// Out-of-line method definitions for ProgramState.
694//===----------------------------------------------------------------------===//

696inline ConstraintManager &ProgramState::getConstraintManager() const {
return stateMgr->getConstraintManager();
698}

700inline const VarRegion* ProgramState::getRegion(const VarDecl *D,
                                              const LocationContext *LC) const
702{
return getStateManager().getRegionManager().getVarRegion(D, LC);
704}

706inline ProgramStateRef ProgramState::assume(DefinedOrUnknownSVal Cond,
                                    bool Assumption) const {
if (Cond.isUnknown())
19
←
Taking false branch→
  return this;

return getStateManager().ConstraintMgr
20
←
Value assigned to 'S.Obj'→
    ->assume(this, Cond.castAs<DefinedSVal>(), Assumption);
713}

715inline std::pair<ProgramStateRef , ProgramStateRef >
716ProgramState::assume(DefinedOrUnknownSVal Cond) const {
if (Cond.isUnknown())
  return std::make_pair(this, this);

return getStateManager().ConstraintMgr
    ->assumeDual(this, Cond.castAs<DefinedSVal>());
722}

724inline ProgramStateRef ProgramState::assumeInclusiveRange(
  DefinedOrUnknownSVal Val, const llvm::APSInt &From, const llvm::APSInt &To,
  bool Assumption) const {
if (Val.isUnknown())
  return this;

assert(isa<NonLoc>(Val) && "Only NonLocs are supported!")(static_cast <bool> (isa<NonLoc>(Val) && "Only NonLocs are supported!"
) ? void (0) : __assert_fail ("isa<NonLoc>(Val) && \"Only NonLocs are supported!\""
, "clang/include/clang/StaticAnalyzer/Core/PathSensitive/ProgramState.h"
, 730, __extension__ __PRETTY_FUNCTION__));

return getStateManager().ConstraintMgr->assumeInclusiveRange(
    this, Val.castAs<NonLoc>(), From, To, Assumption);
734}

736inline std::pair<ProgramStateRef, ProgramStateRef>
737ProgramState::assumeInclusiveRange(DefinedOrUnknownSVal Val,
                                 const llvm::APSInt &From,
                                 const llvm::APSInt &To) const {
if (Val.isUnknown())
  return std::make_pair(this, this);

assert(isa<NonLoc>(Val) && "Only NonLocs are supported!")(static_cast <bool> (isa<NonLoc>(Val) && "Only NonLocs are supported!"
) ? void (0) : __assert_fail ("isa<NonLoc>(Val) && \"Only NonLocs are supported!\""
, "clang/include/clang/StaticAnalyzer/Core/PathSensitive/ProgramState.h"
, 743, __extension__ __PRETTY_FUNCTION__));

return getStateManager().ConstraintMgr->assumeInclusiveRangeDual(
    this, Val.castAs<NonLoc>(), From, To);
747}

749inline ProgramStateRef ProgramState::bindLoc(SVal LV, SVal V, const LocationContext *LCtx) const {
if (std::optional<Loc> L = LV.getAs<Loc>())
  return bindLoc(*L, V, LCtx);
return this;
753}

755inline Loc ProgramState::getLValue(const CXXBaseSpecifier &BaseSpec,
                                 const SubRegion *Super) const {
const auto *Base = BaseSpec.getType()->getAsCXXRecordDecl();
return loc::MemRegionVal(
         getStateManager().getRegionManager().getCXXBaseObjectRegion(
                                          Base, Super, BaseSpec.isVirtual()));
761}

763inline Loc ProgramState::getLValue(const CXXRecordDecl *BaseClass,
                                 const SubRegion *Super,
                                 bool IsVirtual) const {
return loc::MemRegionVal(
         getStateManager().getRegionManager().getCXXBaseObjectRegion(
                                                BaseClass, Super, IsVirtual));
769}

771inline Loc ProgramState::getLValue(const VarDecl *VD,
                             const LocationContext *LC) const {
return getStateManager().StoreMgr->getLValueVar(VD, LC);
774}

776inline Loc ProgramState::getLValue(const CompoundLiteralExpr *literal,
                             const LocationContext *LC) const {
return getStateManager().StoreMgr->getLValueCompoundLiteral(literal, LC);
779}

781inline SVal ProgramState::getLValue(const ObjCIvarDecl *D, SVal Base) const {
return getStateManager().StoreMgr->getLValueIvar(D, Base);
783}

785inline SVal ProgramState::getLValue(const FieldDecl *D, SVal Base) const {
return getStateManager().StoreMgr->getLValueField(D, Base);
787}

789inline SVal ProgramState::getLValue(const IndirectFieldDecl *D,
                                  SVal Base) const {
StoreManager &SM = *getStateManager().StoreMgr;
for (const auto *I : D->chain()) {
  Base = SM.getLValueField(cast<FieldDecl>(I), Base);
}

return Base;
797}

799inline SVal ProgramState::getLValue(QualType ElementType, SVal Idx, SVal Base) const{
if (std::optional<NonLoc> N = Idx.getAs<NonLoc>())
  return getStateManager().StoreMgr->getLValueElement(ElementType, *N, Base);
return UnknownVal();
803}

805inline SVal ProgramState::getSVal(const Stmt *Ex,
                                const LocationContext *LCtx) const{
return Env.getSVal(EnvironmentEntry(Ex, LCtx),
                   *getStateManager().svalBuilder);
809}

811inline SVal
812ProgramState::getSValAsScalarOrLoc(const Stmt *S,
                                 const LocationContext *LCtx) const {
if (const Expr *Ex = dyn_cast<Expr>(S)) {
  QualType T = Ex->getType();
  if (Ex->isGLValue() || Loc::isLocType(T) ||
      T->isIntegralOrEnumerationType())
    return getSVal(S, LCtx);
}

return UnknownVal();
822}

824inline SVal ProgramState::getRawSVal(Loc LV, QualType T) const {
return getStateManager().StoreMgr->getBinding(getStore(), LV, T);
826}

828inline SVal ProgramState::getSVal(const MemRegion* R, QualType T) const {
return getStateManager().StoreMgr->getBinding(getStore(),
                                              loc::MemRegionVal(R),
                                              T);
832}

834inline BasicValueFactory &ProgramState::getBasicVals() const {
return getStateManager().getBasicVals();
836}

838inline SymbolManager &ProgramState::getSymbolManager() const {
return getStateManager().getSymbolManager();
840}

842template<typename T>
843ProgramStateRef ProgramState::add(typename ProgramStateTrait<T>::key_type K) const {
return getStateManager().add<T>(this, K, get_context<T>());
845}

847template <typename T>
848typename ProgramStateTrait<T>::context_type ProgramState::get_context() const {
return getStateManager().get_context<T>();
850}

852template<typename T>
853ProgramStateRef ProgramState::remove(typename ProgramStateTrait<T>::key_type K) const {
return getStateManager().remove<T>(this, K, get_context<T>());
855}

857template<typename T>
858ProgramStateRef ProgramState::remove(typename ProgramStateTrait<T>::key_type K,
                             typename ProgramStateTrait<T>::context_type C) const {
return getStateManager().remove<T>(this, K, C);
861}

863template <typename T>
864ProgramStateRef ProgramState::remove() const {
return getStateManager().remove<T>(this);
866}

868template<typename T>
869ProgramStateRef ProgramState::set(typename ProgramStateTrait<T>::data_type D) const {
return getStateManager().set<T>(this, D);
871}

873template<typename T>
874ProgramStateRef ProgramState::set(typename ProgramStateTrait<T>::key_type K,
                          typename ProgramStateTrait<T>::value_type E) const {
return getStateManager().set<T>(this, K, E, get_context<T>());
877}

879template<typename T>
880ProgramStateRef ProgramState::set(typename ProgramStateTrait<T>::key_type K,
                          typename ProgramStateTrait<T>::value_type E,
                          typename ProgramStateTrait<T>::context_type C) const {
return getStateManager().set<T>(this, K, E, C);
884}

886template <typename CB>
887CB ProgramState::scanReachableSymbols(SVal val) const {
CB cb(this);
scanReachableSymbols(val, cb);
return cb;
891}

893template <typename CB>
894CB ProgramState::scanReachableSymbols(
  llvm::iterator_range<region_iterator> Reachable) const {
CB cb(this);
scanReachableSymbols(Reachable, cb);
return cb;
899}

901/// \class ScanReachableSymbols
902/// A utility class that visits the reachable symbols using a custom
903/// SymbolVisitor. Terminates recursive traversal when the visitor function
904/// returns false.
905class ScanReachableSymbols {
typedef llvm::DenseSet<const void*> VisitedItems;

VisitedItems visited;
ProgramStateRef state;
SymbolVisitor &visitor;
911public:
ScanReachableSymbols(ProgramStateRef st, SymbolVisitor &v)
    : state(std::move(st)), visitor(v) {}

bool scan(nonloc::LazyCompoundVal val);
bool scan(nonloc::CompoundVal val);
bool scan(SVal val);
bool scan(const MemRegion *R);
bool scan(const SymExpr *sym);
920};

922} // end ento namespace

924} // end clang namespace

926#endif

←

/build/source/llvm/include/llvm/ADT/IntrusiveRefCntPtr.h

1//==- llvm/ADT/IntrusiveRefCntPtr.h - Smart Refcounting Pointer --*- 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/// \file
10/// This file defines the RefCountedBase, ThreadSafeRefCountedBase, and
11/// IntrusiveRefCntPtr classes.
12///
13/// IntrusiveRefCntPtr is a smart pointer to an object which maintains a
14/// reference count.  (ThreadSafe)RefCountedBase is a mixin class that adds a
15/// refcount member variable and methods for updating the refcount.  An object
16/// that inherits from (ThreadSafe)RefCountedBase deletes itself when its
17/// refcount hits zero.
18///
19/// For example:
20///
21/// ```
22///   class MyClass : public RefCountedBase<MyClass> {};
23///
24///   void foo() {
25///     // Constructing an IntrusiveRefCntPtr increases the pointee's refcount
26///     // by 1 (from 0 in this case).
27///     IntrusiveRefCntPtr<MyClass> Ptr1(new MyClass());
28///
29///     // Copying an IntrusiveRefCntPtr increases the pointee's refcount by 1.
30///     IntrusiveRefCntPtr<MyClass> Ptr2(Ptr1);
31///
32///     // Constructing an IntrusiveRefCntPtr has no effect on the object's
33///     // refcount.  After a move, the moved-from pointer is null.
34///     IntrusiveRefCntPtr<MyClass> Ptr3(std::move(Ptr1));
35///     assert(Ptr1 == nullptr);
36///
37///     // Clearing an IntrusiveRefCntPtr decreases the pointee's refcount by 1.
38///     Ptr2.reset();
39///
40///     // The object deletes itself when we return from the function, because
41///     // Ptr3's destructor decrements its refcount to 0.
42///   }
43/// ```
44///
45/// You can use IntrusiveRefCntPtr with isa<T>(), dyn_cast<T>(), etc.:
46///
47/// ```
48///   IntrusiveRefCntPtr<MyClass> Ptr(new MyClass());
49///   OtherClass *Other = dyn_cast<OtherClass>(Ptr);  // Ptr.get() not required
50/// ```
51///
52/// IntrusiveRefCntPtr works with any class that
53///
54///  - inherits from (ThreadSafe)RefCountedBase,
55///  - has Retain() and Release() methods, or
56///  - specializes IntrusiveRefCntPtrInfo.
57///
58//===----------------------------------------------------------------------===//
59 
60#ifndef LLVM_ADT_INTRUSIVEREFCNTPTR_H
61#define LLVM_ADT_INTRUSIVEREFCNTPTR_H
62 
63#include <atomic>
64#include <cassert>
65#include <cstddef>
66#include <memory>
67 
68namespace llvm {
69 
70/// A CRTP mixin class that adds reference counting to a type.
71///
72/// The lifetime of an object which inherits from RefCountedBase is managed by
73/// calls to Release() and Retain(), which increment and decrement the object's
74/// refcount, respectively.  When a Release() call decrements the refcount to 0,
75/// the object deletes itself.
76template <class Derived> class RefCountedBase {
77  mutable unsigned RefCount = 0;
78 
79protected:
80  RefCountedBase() = default;
81  RefCountedBase(const RefCountedBase &) {}
82  RefCountedBase &operator=(const RefCountedBase &) = delete;
83 
84#ifndef NDEBUG
85  ~RefCountedBase() {
86    assert(RefCount == 0 &&(static_cast <bool> (RefCount == 0 && "Destruction occurred when there are still references to this."
) ? void (0) : __assert_fail ("RefCount == 0 && \"Destruction occurred when there are still references to this.\""
, "llvm/include/llvm/ADT/IntrusiveRefCntPtr.h", 87, __extension__
 __PRETTY_FUNCTION__))
87           "Destruction occurred when there are still references to this.")(static_cast <bool> (RefCount == 0 && "Destruction occurred when there are still references to this."
) ? void (0) : __assert_fail ("RefCount == 0 && \"Destruction occurred when there are still references to this.\""
, "llvm/include/llvm/ADT/IntrusiveRefCntPtr.h", 87, __extension__
 __PRETTY_FUNCTION__));
88  }
89#else
90  // Default the destructor in release builds, A trivial destructor may enable
91  // better codegen.
92  ~RefCountedBase() = default;
93#endif
94 
95public:
96  void Retain() const { ++RefCount; }
97 
98  void Release() const {
99    assert(RefCount > 0 && "Reference count is already zero.")(static_cast <bool> (RefCount > 0 && "Reference count is already zero."
) ? void (0) : __assert_fail ("RefCount > 0 && \"Reference count is already zero.\""
, "llvm/include/llvm/ADT/IntrusiveRefCntPtr.h", 99, __extension__
 __PRETTY_FUNCTION__));
100    if (--RefCount == 0)
101      delete static_cast<const Derived *>(this);
102  }
103};
104 
105/// A thread-safe version of \c RefCountedBase.
106template <class Derived> class ThreadSafeRefCountedBase {
107  mutable std::atomic<int> RefCount{0};
108 
109protected:
110  ThreadSafeRefCountedBase() = default;
111  ThreadSafeRefCountedBase(const ThreadSafeRefCountedBase &) {}
112  ThreadSafeRefCountedBase &
113  operator=(const ThreadSafeRefCountedBase &) = delete;
114 
115#ifndef NDEBUG
116  ~ThreadSafeRefCountedBase() {
117    assert(RefCount == 0 &&(static_cast <bool> (RefCount == 0 && "Destruction occurred when there are still references to this."
) ? void (0) : __assert_fail ("RefCount == 0 && \"Destruction occurred when there are still references to this.\""
, "llvm/include/llvm/ADT/IntrusiveRefCntPtr.h", 118, __extension__
 __PRETTY_FUNCTION__))
118           "Destruction occurred when there are still references to this.")(static_cast <bool> (RefCount == 0 && "Destruction occurred when there are still references to this."
) ? void (0) : __assert_fail ("RefCount == 0 && \"Destruction occurred when there are still references to this.\""
, "llvm/include/llvm/ADT/IntrusiveRefCntPtr.h", 118, __extension__
 __PRETTY_FUNCTION__));
119  }
120#else
121  // Default the destructor in release builds, A trivial destructor may enable
122  // better codegen.
123  ~ThreadSafeRefCountedBase() = default;
124#endif
125 
126public:
127  void Retain() const { RefCount.fetch_add(1, std::memory_order_relaxed); }
128 
129  void Release() const {
130    int NewRefCount = RefCount.fetch_sub(1, std::memory_order_acq_rel) - 1;
131    assert(NewRefCount >= 0 && "Reference count was already zero.")(static_cast <bool> (NewRefCount >= 0 && "Reference count was already zero."
) ? void (0) : __assert_fail ("NewRefCount >= 0 && \"Reference count was already zero.\""
, "llvm/include/llvm/ADT/IntrusiveRefCntPtr.h", 131, __extension__
 __PRETTY_FUNCTION__));
132    if (NewRefCount == 0)
133      delete static_cast<const Derived *>(this);
134  }
135};
136 
137/// Class you can specialize to provide custom retain/release functionality for
138/// a type.
139///
140/// Usually specializing this class is not necessary, as IntrusiveRefCntPtr
141/// works with any type which defines Retain() and Release() functions -- you
142/// can define those functions yourself if RefCountedBase doesn't work for you.
143///
144/// One case when you might want to specialize this type is if you have
145///  - Foo.h defines type Foo and includes Bar.h, and
146///  - Bar.h uses IntrusiveRefCntPtr<Foo> in inline functions.
147///
148/// Because Foo.h includes Bar.h, Bar.h can't include Foo.h in order to pull in
149/// the declaration of Foo.  Without the declaration of Foo, normally Bar.h
150/// wouldn't be able to use IntrusiveRefCntPtr<Foo>, which wants to call
151/// T::Retain and T::Release.
152///
153/// To resolve this, Bar.h could include a third header, FooFwd.h, which
154/// forward-declares Foo and specializes IntrusiveRefCntPtrInfo<Foo>.  Then
155/// Bar.h could use IntrusiveRefCntPtr<Foo>, although it still couldn't call any
156/// functions on Foo itself, because Foo would be an incomplete type.
157template <typename T> struct IntrusiveRefCntPtrInfo {
158  static void retain(T *obj) { obj->Retain(); }
159  static void release(T *obj) { obj->Release(); }
160};
161 
162/// A smart pointer to a reference-counted object that inherits from
163/// RefCountedBase or ThreadSafeRefCountedBase.
164///
165/// This class increments its pointee's reference count when it is created, and
166/// decrements its refcount when it's destroyed (or is changed to point to a
167/// different object).
168template <typename T> class IntrusiveRefCntPtr {
169  T *Obj = nullptr;
170 
171public:
172  using element_type = T;
173 
174  explicit IntrusiveRefCntPtr() = default;
175  IntrusiveRefCntPtr(T *obj) : Obj(obj) { retain(); }
176  IntrusiveRefCntPtr(const IntrusiveRefCntPtr &S) : Obj(S.Obj) { retain(); }
177  IntrusiveRefCntPtr(IntrusiveRefCntPtr &&S) : Obj(S.Obj) { S.Obj = nullptr; }
178 
179  template <class X,
180            std::enable_if_t<std::is_convertible<X *, T *>::value, bool> = true>
181  IntrusiveRefCntPtr(IntrusiveRefCntPtr<X> S) : Obj(S.get()) {
182    S.Obj = nullptr;
183  }
184 
185  template <class X,
186            std::enable_if_t<std::is_convertible<X *, T *>::value, bool> = true>
187  IntrusiveRefCntPtr(std::unique_ptr<X> S) : Obj(S.release()) {
188    retain();
189  }
190 
191  ~IntrusiveRefCntPtr() { release(); }
192 
193  IntrusiveRefCntPtr &operator=(IntrusiveRefCntPtr S) {
194    swap(S);
23
←
Calling 'IntrusiveRefCntPtr::swap'→
26
←
Returning from 'IntrusiveRefCntPtr::swap'→
195    return *this;
196  }
197 
198  T &operator*() const { return *Obj; }
199  T *operator->() const { return Obj; }
200  T *get() const { return Obj; }
201  explicit operator bool() const { return Obj; }
202 
203  void swap(IntrusiveRefCntPtr &other) {
204    T *tmp = other.Obj;
24
←
'tmp' initialized here→
205    other.Obj = Obj;
206    Obj = tmp;
25
←
The value of 'tmp' is assigned to 'state.Obj'→
207  }
208 
209  void reset() {
210    release();
211    Obj = nullptr;
212  }
213 
214  void resetWithoutRelease() { Obj = nullptr; }
215 
216private:
217  void retain() {
218    if (Obj)
219      IntrusiveRefCntPtrInfo<T>::retain(Obj);
220  }
221 
222  void release() {
223    if (Obj)
224      IntrusiveRefCntPtrInfo<T>::release(Obj);
225  }
226 
227  template <typename X> friend class IntrusiveRefCntPtr;
228};
229 
230template <class T, class U>
231inline bool operator==(const IntrusiveRefCntPtr<T> &A,
232                       const IntrusiveRefCntPtr<U> &B) {
233  return A.get() == B.get();
234}
235 
236template <class T, class U>
237inline bool operator!=(const IntrusiveRefCntPtr<T> &A,
238                       const IntrusiveRefCntPtr<U> &B) {
239  return A.get() != B.get();
240}
241 
242template <class T, class U>
243inline bool operator==(const IntrusiveRefCntPtr<T> &A, U *B) {
244  return A.get() == B;
245}
246 
247template <class T, class U>
248inline bool operator!=(const IntrusiveRefCntPtr<T> &A, U *B) {
249  return A.get() != B;
250}
251 
252template <class T, class U>
253inline bool operator==(T *A, const IntrusiveRefCntPtr<U> &B) {
254  return A == B.get();
255}
256 
257template <class T, class U>
258inline bool operator!=(T *A, const IntrusiveRefCntPtr<U> &B) {
259  return A != B.get();
260}
261 
262template <class T>
263bool operator==(std::nullptr_t, const IntrusiveRefCntPtr<T> &B) {
264  return !B;
265}
266 
267template <class T>
268bool operator==(const IntrusiveRefCntPtr<T> &A, std::nullptr_t B) {
269  return B == A;
270}
271 
272template <class T>
273bool operator!=(std::nullptr_t A, const IntrusiveRefCntPtr<T> &B) {
274  return !(A == B);
275}
276 
277template <class T>
278bool operator!=(const IntrusiveRefCntPtr<T> &A, std::nullptr_t B) {
279  return !(A == B);
280}
281 
282// Make IntrusiveRefCntPtr work with dyn_cast, isa, and the other idioms from
283// Casting.h.
284template <typename From> struct simplify_type;
285 
286template <class T> struct simplify_type<IntrusiveRefCntPtr<T>> {
287  using SimpleType = T *;
288 
289  static SimpleType getSimplifiedValue(IntrusiveRefCntPtr<T> &Val) {
290    return Val.get();
291  }
292};
293 
294template <class T> struct simplify_type<const IntrusiveRefCntPtr<T>> {
295  using SimpleType = /*const*/ T *;
296 
297  static SimpleType getSimplifiedValue(const IntrusiveRefCntPtr<T> &Val) {
298    return Val.get();
299  }
300};
301 
302/// Factory function for creating intrusive ref counted pointers.
303template <typename T, typename... Args>
304IntrusiveRefCntPtr<T> makeIntrusiveRefCnt(Args &&...A) {
305  return IntrusiveRefCntPtr<T>(new T(std::forward<Args>(A)...));
306}
307 
308} // end namespace llvm
309 
310#endif // LLVM_ADT_INTRUSIVEREFCNTPTR_H