Home
last modified time | relevance | path

Searched refs:TreeTy (Results 1 – 5 of 5) sorted by relevance

/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DImmutableSet.h403 TreeTy* add(TreeTy* T, value_type_ref V) { in add()
410 TreeTy* remove(TreeTy* T, key_type_ref V) { in remove()
463 TreeTy* createNode(TreeTy* L, value_type_ref V, TreeTy* R) { in createNode()
472 T = (TreeTy*) A.Allocate<TreeTy>(); in createNode()
479 TreeTy* createNode(TreeTy* newLeft, TreeTy* oldTree, TreeTy* newRight) { in createNode()
494 TreeTy* balanceTree(TreeTy* L, value_type_ref V, TreeTy* R) { in balanceTree()
538 TreeTy* add_internal(value_type_ref V, TreeTy* T) { in add_internal()
558 TreeTy* remove_internal(key_type_ref K, TreeTy* T) { in remove_internal()
577 TreeTy* combineTrees(TreeTy* L, TreeTy* R) { in combineTrees()
587 TreeTy* removeMinBinding(TreeTy* T, TreeTy*& Noderemoved) { in removeMinBinding()
[all …]
H A DImmutableMap.h71 using TreeTy = ImutAVLTree<ValInfo>; variable
74 TreeTy* Root;
81 explicit ImmutableMap(const TreeTy* R) : Root(const_cast<TreeTy*>(R)) { in ImmutableMap()
103 typename TreeTy::Factory F;
124 TreeTy *T = F.remove(Old.Root,K); in remove()
145 TreeTy *getRoot() const { in getRoot()
226 TreeTy* T = Root->find(K); in lookup()
266 using TreeTy = ImutAVLTree<ValInfo>; variable
270 TreeTy *Root;
335 TreeTy *NewT = Factory->remove(Root, K); in remove()
[all …]
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DProgramStateTrait.h155 return p ? data_type((typename data_type::TreeTy *) *p)
201 return p ? data_type((typename data_type::TreeTy *) *p)
/freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DBlockCounter.cpp51 return CountMap(static_cast<CountMap::TreeTy*>(D)); in GetMap()
H A DRegionStore.cpp165 const RegionBindings::TreeTy *T, in RegionBindingsRef()
166 RegionBindings::TreeTy::Factory *F) in RegionBindingsRef()
598 static_cast<const RegionBindings::TreeTy*>(store), in getRegionBindings()