Home
last modified time | relevance | path

Searched refs:FreeList (Results 1 – 8 of 8) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DRecycler.h40 FreeNode *FreeList = nullptr; variable
43 auto *Val = FreeList; in pop_val()
45 FreeList = FreeList->Next; in pop_val()
51 N->Next = FreeList; in push()
52 FreeList = N; in push()
61 assert(!FreeList && "Non-empty recycler deleted!"); in ~Recycler()
69 while (FreeList) { in clear()
80 void clear(BumpPtrAllocator &) { FreeList = nullptr; } in clear()
88 return FreeList ? reinterpret_cast<SubClass *>(pop_val()) in Allocate()
108 for (auto *I = FreeList; I; I = I->Next) in PrintStats()
H A DArrayRecycler.h31 struct FreeList { struct
32 FreeList *Next; argument
35 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()
/freebsd/contrib/libarchive/libarchive/
H A Darchive_ppmd8.c120 ((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()
255 if (p->FreeList[i1] != 0) in ShrinkUnits()
[all …]
H A Darchive_ppmd7.c154 *((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()
300 if (p->FreeList[i1] != 0) in ShrinkUnits()
[all …]
H A Darchive_ppmd7_private.h58 CPpmd_Void_Ref FreeList[PPMD_NUM_INDEXES]; member
H A Darchive_ppmd8_private.h78 CPpmd_Void_Ref FreeList[PPMD_NUM_INDEXES]; member
/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Drelease.h540 bool markFreeBlocksInRegion(const IntrusiveList<TransferBatchT> &FreeList, in markFreeBlocksInRegion()
586 for (const auto &It : FreeList) { in markFreeBlocksInRegion()
596 for (const auto &It : FreeList) {
/freebsd/contrib/llvm-project/clang/lib/Basic/
H A DDiagnostic.cpp1215 FreeList[I] = Cached + I; in DiagStorageAllocator()