Searched refs:FreeList (Results 1 - 11 of 11) sorted by relevance

/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DRecycler.h40 FreeNode *FreeList = nullptr; member in class:llvm::Recycler
43 auto *Val = FreeList;
45 FreeList = FreeList->Next;
51 N->Next = FreeList;
52 FreeList = N;
61 assert(!FreeList && "Non-empty recycler deleted!");
69 while (FreeList) {
80 void clear(BumpPtrAllocator &) { FreeList = nullptr; }
88 return FreeList
[all...]
H A DArrayRecycler.h31 struct FreeList { struct in class:llvm::ArrayRecycler
32 FreeList *Next;
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];
58 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr);
/freebsd-13-stable/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dprimary32.h110 TransferBatch *B = Sci->FreeList.front();
112 Sci->FreeList.pop_front();
128 Sci->FreeList.push_front(B);
239 SinglyLinkedList<TransferBatch> FreeList; variable
315 Sci->FreeList.push_back(B);
390 if (!Sci->FreeList.empty()) {
391 Sci->FreeList.push_back(B);
392 B = Sci->FreeList.front();
393 Sci->FreeList.pop_front();
472 releaseFreeMemoryToOS(Sci->FreeList, Regio
[all...]
H A Dprimary64.h112 TransferBatch *B = Region->FreeList.front();
114 Region->FreeList.pop_front();
129 Region->FreeList.push_front(B);
288 SinglyLinkedList<TransferBatch> FreeList; member in struct:scudo::SizeClassAllocator64::UnpaddedRegionInfo
329 Region->FreeList.push_back(B);
409 if (!Region->FreeList.empty()) {
410 Region->FreeList.push_back(B);
411 B = Region->FreeList.front();
412 Region->FreeList.pop_front();
473 releaseFreeMemoryToOS(Region->FreeList, Regio
[all...]
H A Drelease.h169 releaseFreeMemoryToOS(const IntrusiveList<TransferBatchT> &FreeList, uptr Base, argument
219 for (const auto &It : FreeList) {
237 for (const auto &It : FreeList) {
/freebsd-13-stable/contrib/libarchive/libarchive/
H A Darchive_ppmd7.c154 *((CPpmd_Void_Ref *)node) = p->FreeList[indx];
155 p->FreeList[indx] = REF(node);
160 CPpmd_Void_Ref *node = (CPpmd_Void_Ref *)Ppmd7_GetPtr(p, p->FreeList[indx]);
161 p->FreeList[indx] = *node;
195 CPpmd7_Node_Ref next = (CPpmd7_Node_Ref)p->FreeList[i];
196 p->FreeList[i] = 0;
256 if (p->FreeList[indx] != 0)
269 while (p->FreeList[i] == 0);
278 if (p->FreeList[indx] != 0)
300 if (p->FreeList[i
[all...]
H A Darchive_ppmd7_private.h58 CPpmd_Void_Ref FreeList[PPMD_NUM_INDEXES]; member in struct:__anon1080
H A Darchive_ppmd8.c120 ((CPpmd8_Node *)node)->Next = (CPpmd8_Node_Ref)p->FreeList[indx];
122 p->FreeList[indx] = REF(node);
128 CPpmd8_Node *node = NODE((CPpmd8_Node_Ref)p->FreeList[indx]);
129 p->FreeList[indx] = node->Next;
163 CPpmd8_Node_Ref next = (CPpmd8_Node_Ref)p->FreeList[i];
164 p->FreeList[i] = 0;
211 if (p->FreeList[indx] != 0)
224 while (p->FreeList[i] == 0);
233 if (p->FreeList[indx] != 0)
255 if (p->FreeList[i
[all...]
H A Darchive_ppmd8_private.h78 CPpmd_Void_Ref FreeList[PPMD_NUM_INDEXES]; member in struct:__anon1086
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/Basic/
H A DPartialDiagnostic.h87 Storage *FreeList[NumCached]; member in class:clang::PartialDiagnostic::StorageAllocator
99 Storage *Result = FreeList[--NumFreeListEntries];
109 FreeList[NumFreeListEntries++] = S;
/freebsd-13-stable/contrib/llvm-project/clang/lib/Basic/
H A DDiagnostic.cpp1145 FreeList[I] = Cached + I;

Completed in 102 milliseconds