17 #ifndef LLVM_CLANG_STATICANALYZER_CORE_PATHSENSITIVE_PROGRAMSTATETRAIT_H 18 #define LLVM_CLANG_STATICANALYZER_CORE_PATHSENSITIVE_PROGRAMSTATETRAIT_H 20 #include "llvm/ADT/ImmutableList.h" 21 #include "llvm/ADT/ImmutableMap.h" 22 #include "llvm/ADT/ImmutableSet.h" 23 #include "llvm/Support/Allocator.h" 29 template <
typename T>
struct ProgramStatePartialTrait;
35 #define REGISTER_TRAIT_WITH_PROGRAMSTATE(Name, Type) \ 38 using Name ## Ty = Type; \ 43 struct ProgramStateTrait<Name> \ 44 : public ProgramStatePartialTrait<Name ## Ty> { \ 45 static void *GDMIndex() { static int Index; return &Index; } \ 51 template <
typename Key,
typename Data,
typename Info>
53 using data_type = llvm::ImmutableMap<Key, Data, Info>;
60 return p ?
data_type((
typename data_type::TreeTy *) *p)
74 return F.add(B, K, E);
78 return F.remove(B, K);
86 return *((
typename data_type::Factory *) p);
90 return new typename data_type::Factory(Alloc);
94 delete (
typename data_type::Factory *) Ctx;
105 #define CLANG_ENTO_PROGRAMSTATE_MAP(Key, Value) llvm::ImmutableMap<Key, Value> 108 template <
typename Key,
typename Info>
115 return p ?
data_type((
typename data_type::TreeTy *) *p)
116 : data_type(
nullptr);
128 return F.remove(B, K);
132 return B.contains(K);
136 return *((
typename data_type::Factory *) p);
140 return new typename data_type::Factory(Alloc);
144 delete (
typename data_type::Factory *) Ctx;
149 template <
typename T>
160 return L.contains(K);
164 return p ?
data_type((
const llvm::ImmutableListImpl<T> *) *p)
165 : data_type(
nullptr);
169 return const_cast<llvm::ImmutableListImpl<T> *
>(D.getInternalPointer());
173 return *((
typename data_type::Factory *) p);
177 return new typename data_type::Factory(Alloc);
181 delete (
typename data_type::Factory *) Ctx;
236 return const_cast<void *
>(d);
243 #endif // LLVM_CLANG_STATICANALYZER_CORE_PATHSENSITIVE_PROGRAMSTATETRAIT_H static context_type MakeContext(void *p)
static bool Contains(data_type L, key_type K)
static void * CreateContext(llvm::BumpPtrAllocator &Alloc)
llvm::ImmutableMap< Key, Data, Info > data_type
static void * MakeVoidPtr(data_type B)
DominatorTree GraphTraits specialization so the DominatorTree can be iterable by generic graph iterat...
static void * MakeVoidPtr(data_type d)
static data_type Add(data_type L, key_type K, context_type F)
static data_type MakeData(void *const *p)
static void * CreateContext(llvm::BumpPtrAllocator &Alloc)
static data_type Remove(data_type B, key_type K, context_type F)
typename data_type::Factory & context_type
static data_type MakeData(void *const *p)
const value_type * lookup_type
typename data_type::Factory & context_type
static void * CreateContext(llvm::BumpPtrAllocator &Alloc)
static context_type MakeContext(void *p)
typename data_type::Factory & context_type
static data_type MakeData(void *const *p)
static data_type MakeData(void *const *p)
const FunctionProtoType * T
static void DeleteContext(void *Ctx)
static void * MakeVoidPtr(data_type B)
static context_type MakeContext(void *p)
__UINTPTR_TYPE__ uintptr_t
An unsigned integer type with the property that any valid pointer to void can be converted to this ty...
static void DeleteContext(void *Ctx)
static bool Contains(data_type B, key_type K)
static data_type MakeData(void *const *p)
static data_type Set(data_type B, key_type K, value_type E, context_type F)
static void * MakeVoidPtr(data_type D)
static data_type Remove(data_type B, key_type K, context_type F)
llvm::ImmutableList< T > data_type
Dataflow Directional Tag Classes.
static void DeleteContext(void *Ctx)
static data_type MakeData(void *const *p)
static void * MakeVoidPtr(data_type d)
static data_type Add(data_type B, key_type K, context_type F)
static lookup_type Lookup(data_type B, key_type K)
static void * MakeVoidPtr(data_type d)
static bool Contains(data_type B, key_type K)
static void * MakeVoidPtr(data_type d)
static data_type MakeData(void *const *p)
llvm::ImmutableSet< Key, Info > data_type