Iterator.h 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187
  1. //=== Iterator.h - Common functions for iterator checkers. ---------*- 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. // Defines common functions to be used by the itertor checkers .
  10. //
  11. //===----------------------------------------------------------------------===//
  12. #ifndef LLVM_CLANG_LIB_STATICANALYZER_CHECKERS_ITERATOR_H
  13. #define LLVM_CLANG_LIB_STATICANALYZER_CHECKERS_ITERATOR_H
  14. #include "clang/StaticAnalyzer/Core/PathSensitive/DynamicType.h"
  15. #include "clang/StaticAnalyzer/Core/PathSensitive/ProgramState.h"
  16. #include "clang/StaticAnalyzer/Core/PathSensitive/SymExpr.h"
  17. namespace clang {
  18. namespace ento {
  19. namespace iterator {
  20. // Abstract position of an iterator. This helps to handle all three kinds
  21. // of operators in a common way by using a symbolic position.
  22. struct IteratorPosition {
  23. private:
  24. // Container the iterator belongs to
  25. const MemRegion *Cont;
  26. // Whether iterator is valid
  27. const bool Valid;
  28. // Abstract offset
  29. const SymbolRef Offset;
  30. IteratorPosition(const MemRegion *C, bool V, SymbolRef Of)
  31. : Cont(C), Valid(V), Offset(Of) {}
  32. public:
  33. const MemRegion *getContainer() const { return Cont; }
  34. bool isValid() const { return Valid; }
  35. SymbolRef getOffset() const { return Offset; }
  36. IteratorPosition invalidate() const {
  37. return IteratorPosition(Cont, false, Offset);
  38. }
  39. static IteratorPosition getPosition(const MemRegion *C, SymbolRef Of) {
  40. return IteratorPosition(C, true, Of);
  41. }
  42. IteratorPosition setTo(SymbolRef NewOf) const {
  43. return IteratorPosition(Cont, Valid, NewOf);
  44. }
  45. IteratorPosition reAssign(const MemRegion *NewCont) const {
  46. return IteratorPosition(NewCont, Valid, Offset);
  47. }
  48. bool operator==(const IteratorPosition &X) const {
  49. return Cont == X.Cont && Valid == X.Valid && Offset == X.Offset;
  50. }
  51. bool operator!=(const IteratorPosition &X) const { return !(*this == X); }
  52. void Profile(llvm::FoldingSetNodeID &ID) const {
  53. ID.AddPointer(Cont);
  54. ID.AddInteger(Valid);
  55. ID.Add(Offset);
  56. }
  57. };
  58. // Structure to record the symbolic begin and end position of a container
  59. struct ContainerData {
  60. private:
  61. const SymbolRef Begin, End;
  62. ContainerData(SymbolRef B, SymbolRef E) : Begin(B), End(E) {}
  63. public:
  64. static ContainerData fromBegin(SymbolRef B) {
  65. return ContainerData(B, nullptr);
  66. }
  67. static ContainerData fromEnd(SymbolRef E) {
  68. return ContainerData(nullptr, E);
  69. }
  70. SymbolRef getBegin() const { return Begin; }
  71. SymbolRef getEnd() const { return End; }
  72. ContainerData newBegin(SymbolRef B) const { return ContainerData(B, End); }
  73. ContainerData newEnd(SymbolRef E) const { return ContainerData(Begin, E); }
  74. bool operator==(const ContainerData &X) const {
  75. return Begin == X.Begin && End == X.End;
  76. }
  77. bool operator!=(const ContainerData &X) const { return !(*this == X); }
  78. void Profile(llvm::FoldingSetNodeID &ID) const {
  79. ID.Add(Begin);
  80. ID.Add(End);
  81. }
  82. };
  83. class IteratorSymbolMap {};
  84. class IteratorRegionMap {};
  85. class ContainerMap {};
  86. using IteratorSymbolMapTy =
  87. CLANG_ENTO_PROGRAMSTATE_MAP(SymbolRef, IteratorPosition);
  88. using IteratorRegionMapTy =
  89. CLANG_ENTO_PROGRAMSTATE_MAP(const MemRegion *, IteratorPosition);
  90. using ContainerMapTy =
  91. CLANG_ENTO_PROGRAMSTATE_MAP(const MemRegion *, ContainerData);
  92. } // namespace iterator
  93. template<>
  94. struct ProgramStateTrait<iterator::IteratorSymbolMap>
  95. : public ProgramStatePartialTrait<iterator::IteratorSymbolMapTy> {
  96. static void *GDMIndex() { static int Index; return &Index; }
  97. };
  98. template<>
  99. struct ProgramStateTrait<iterator::IteratorRegionMap>
  100. : public ProgramStatePartialTrait<iterator::IteratorRegionMapTy> {
  101. static void *GDMIndex() { static int Index; return &Index; }
  102. };
  103. template<>
  104. struct ProgramStateTrait<iterator::ContainerMap>
  105. : public ProgramStatePartialTrait<iterator::ContainerMapTy> {
  106. static void *GDMIndex() { static int Index; return &Index; }
  107. };
  108. namespace iterator {
  109. bool isIteratorType(const QualType &Type);
  110. bool isIterator(const CXXRecordDecl *CRD);
  111. bool isComparisonOperator(OverloadedOperatorKind OK);
  112. bool isInsertCall(const FunctionDecl *Func);
  113. bool isEraseCall(const FunctionDecl *Func);
  114. bool isEraseAfterCall(const FunctionDecl *Func);
  115. bool isEmplaceCall(const FunctionDecl *Func);
  116. bool isAccessOperator(OverloadedOperatorKind OK);
  117. bool isAccessOperator(UnaryOperatorKind OK);
  118. bool isAccessOperator(BinaryOperatorKind OK);
  119. bool isDereferenceOperator(OverloadedOperatorKind OK);
  120. bool isDereferenceOperator(UnaryOperatorKind OK);
  121. bool isDereferenceOperator(BinaryOperatorKind OK);
  122. bool isIncrementOperator(OverloadedOperatorKind OK);
  123. bool isIncrementOperator(UnaryOperatorKind OK);
  124. bool isDecrementOperator(OverloadedOperatorKind OK);
  125. bool isDecrementOperator(UnaryOperatorKind OK);
  126. bool isRandomIncrOrDecrOperator(OverloadedOperatorKind OK);
  127. bool isRandomIncrOrDecrOperator(BinaryOperatorKind OK);
  128. const ContainerData *getContainerData(ProgramStateRef State,
  129. const MemRegion *Cont);
  130. const IteratorPosition *getIteratorPosition(ProgramStateRef State,
  131. const SVal &Val);
  132. ProgramStateRef setIteratorPosition(ProgramStateRef State, const SVal &Val,
  133. const IteratorPosition &Pos);
  134. ProgramStateRef createIteratorPosition(ProgramStateRef State, const SVal &Val,
  135. const MemRegion *Cont, const Stmt* S,
  136. const LocationContext *LCtx,
  137. unsigned blockCount);
  138. ProgramStateRef advancePosition(ProgramStateRef State,
  139. const SVal &Iter,
  140. OverloadedOperatorKind Op,
  141. const SVal &Distance);
  142. ProgramStateRef assumeNoOverflow(ProgramStateRef State, SymbolRef Sym,
  143. long Scale);
  144. bool compare(ProgramStateRef State, SymbolRef Sym1, SymbolRef Sym2,
  145. BinaryOperator::Opcode Opc);
  146. bool compare(ProgramStateRef State, NonLoc NL1, NonLoc NL2,
  147. BinaryOperator::Opcode Opc);
  148. } // namespace iterator
  149. } // namespace ento
  150. } // namespace clang
  151. #endif