Searched refs:FreeList (Results 1 – 14 of 14) sorted by relevance
42 FreeNode *FreeList = nullptr; variable45 auto *Val = FreeList; in pop_val()47 FreeList = FreeList->Next; in pop_val()53 N->Next = FreeList; in push()54 FreeList = N; in push()63 assert(!FreeList && "Non-empty recycler deleted!"); in ~Recycler()67 : FreeList(std::exchange(Other.FreeList, nullptr)) {} in Recycler()75 while (FreeList) { in clear()86 void clear(BumpPtrAllocator &) { FreeList = nullptr; } in clear()96 return FreeList ? reinterpret_cast<SubClass *>(pop_val()) in Allocate()[all …]
31 struct FreeList { struct32 FreeList *Next; argument35 static_assert(Align >= alignof(FreeList), "Object underaligned");36 static_assert(sizeof(T) >= sizeof(FreeList), "Objects are too small");39 SmallVector<FreeList*, 8> Bucket;46 FreeList *Entry = Bucket[Idx]; in pop()58 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr); in push()
44 align_up(sizeof(Block) + sizeof(FreeList::Node), alignof(max_align_t));57 FreeList &small_list(Block *block);58 FreeList *find_best_small_fit(size_t size);60 cpp::array<FreeList, NUM_SMALL_SIZES> small_lists;78 reinterpret_cast<FreeList::Node *>(block->usable_space())); in remove()86 if (FreeList *list = find_best_small_fit(size)) { in remove_best_fit()99 LIBC_INLINE FreeList &FreeStore::small_list(Block *block) { in small_list()105 LIBC_INLINE FreeList *FreeStore::find_best_small_fit(size_t size) { in find_best_small_fit()106 for (FreeList &list : small_lists) in find_best_small_fit()
24 class FreeList {43 friend class FreeList; variable46 LIBC_INLINE constexpr FreeList() : FreeList(nullptr) {} in FreeList() function47 LIBC_INLINE constexpr FreeList(Node *begin) : begin_(begin) {} in FreeList() function68 LIBC_ASSERT(block->inner_size_free() >= sizeof(FreeList) && in push()
13 void FreeList::push(Node *node) { in push()28 void FreeList::remove(Node *node) { in remove()
46 class Node : public FreeList::Node {143 FreeList list = *cur; in push()
15 FreeList list = node; in remove()
120 ((CPpmd8_Node *)node)->Next = (CPpmd8_Node_Ref)p->FreeList[indx]; in InsertNode()122 p->FreeList[indx] = REF(node); in InsertNode()128 CPpmd8_Node *node = NODE((CPpmd8_Node_Ref)p->FreeList[indx]); in RemoveNode()129 p->FreeList[indx] = node->Next; in RemoveNode()163 CPpmd8_Node_Ref next = (CPpmd8_Node_Ref)p->FreeList[i]; in GlueFreeBlocks()164 p->FreeList[i] = 0; in GlueFreeBlocks()211 if (p->FreeList[indx] != 0) in AllocUnitsRare()224 while (p->FreeList[i] == 0); in AllocUnitsRare()233 if (p->FreeList[indx] != 0) in AllocUnits()260 if (p->FreeList[i1] != 0) in ShrinkUnits()[all …]
154 *((CPpmd_Void_Ref *)node) = p->FreeList[indx]; in InsertNode()155 p->FreeList[indx] = REF(node); in InsertNode()160 CPpmd_Void_Ref *node = (CPpmd_Void_Ref *)Ppmd7_GetPtr(p, p->FreeList[indx]); in RemoveNode()161 p->FreeList[indx] = *node; in RemoveNode()195 CPpmd7_Node_Ref next = (CPpmd7_Node_Ref)p->FreeList[i]; in GlueFreeBlocks()196 p->FreeList[i] = 0; in GlueFreeBlocks()256 if (p->FreeList[indx] != 0) in AllocUnitsRare()269 while (p->FreeList[i] == 0); in AllocUnitsRare()278 if (p->FreeList[indx] != 0) in AllocUnits()305 if (p->FreeList[i1] != 0) in ShrinkUnits()[all …]
58 CPpmd_Void_Ref FreeList[PPMD_NUM_INDEXES]; member
78 CPpmd_Void_Ref FreeList[PPMD_NUM_INDEXES]; member
549 bool markFreeBlocksInRegion(const IntrusiveList<TransferBatchT> &FreeList, in markFreeBlocksInRegion()596 for (const auto &It : FreeList) { in markFreeBlocksInRegion()606 for (const auto &It : FreeList) { in markFreeBlocksInRegion()
194 DiagnosticStorage *FreeList[NumCached]; variable206 DiagnosticStorage *Result = FreeList[--NumFreeListEntries]; in Allocate()216 FreeList[NumFreeListEntries++] = S; in Deallocate()
1502 FreeList[I] = Cached + I; in DiagStorageAllocator()