| /external/pigweed/pw_allocator/public/pw_allocator/ |
| D | freelist.h | 55 class FreeList {
58 FreeList(const FreeList& other) = delete;
59 FreeList(FreeList&& other) = delete;
60 FreeList& operator=(const FreeList& other) = delete;
61 FreeList& operator=(FreeList&& other) = delete;
96 constexpr FreeList(Vector<FreeListNode*>& chunks, Vector<size_t>& sizes) in FreeList() function
105 class FreeListBuffer : public FreeList {
110 : FreeList(chunks_, sizes_), sizes_(sizes), chunks_(kNumBuckets + 1, 0) {} in FreeListBuffer()
112 : FreeList(chunks_, sizes_), in FreeListBuffer()
118 Vector<FreeList::FreeListNode*, kNumBuckets + 1> chunks_;
|
| D | freelist_heap.h | 37 FreeListHeap(std::span<std::byte> region, FreeList& freelist);
54 FreeList& freelist_;
|
| /external/llvm/include/llvm/Support/ |
| D | Recycler.h | 42 FreeNode *FreeList = nullptr; variable
45 auto *Val = FreeList; in pop_val()
46 FreeList = FreeList->Next; in pop_val()
51 N->Next = FreeList; in push()
52 FreeList = N; in push()
60 assert(!FreeList && "Non-empty recycler deleted!"); in ~Recycler()
68 while (FreeList) { in clear()
79 void clear(BumpPtrAllocator &) { FreeList = nullptr; } in clear()
87 return FreeList ? reinterpret_cast<SubClass *>(pop_val()) in Allocate()
107 for (auto *I = FreeList; I; I = I->Next) in PrintStats()
|
| D | ArrayRecycler.h | 33 struct FreeList { struct
34 FreeList *Next; argument
37 static_assert(Align >= AlignOf<FreeList>::Alignment, "Object underaligned");
38 static_assert(sizeof(T) >= sizeof(FreeList), "Objects are too small");
41 SmallVector<FreeList*, 8> Bucket;
48 FreeList *Entry = Bucket[Idx]; in pop()
58 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr); in push()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/ |
| D | Recycler.h | 40 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()
|
| D | ArrayRecycler.h | 31 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()
|
| /external/llvm-project/llvm/include/llvm/Support/ |
| D | Recycler.h | 40 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()
|
| D | ArrayRecycler.h | 31 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()
|
| /external/pigweed/pw_allocator/ |
| D | freelist_test.cc | 30 TEST(FreeList, EmptyListHasNoMembers) { in TEST() argument
39 TEST(FreeList, CanRetrieveAddedMember) { in TEST() argument
53 TEST(FreeList, CanRetrieveAddedMemberForSmallerSize) { in TEST() argument
65 TEST(FreeList, CanRemoveItem) { in TEST() argument
79 TEST(FreeList, FindReturnsSmallestChunk) { in TEST() argument
103 TEST(FreeList, FindReturnsCorrectChunkInSameBucket) { in TEST() argument
121 TEST(FreeList, FindCanMoveUpThroughBuckets) { in TEST() argument
142 TEST(FreeList, RemoveUnknownChunkReturnsNotFound) { in TEST() argument
154 TEST(FreeList, CanStoreMultipleChunksPerBucket) { in TEST() argument
|
| D | freelist.cc | 19 Status FreeList::AddChunk(std::span<std::byte> chunk) { in AddChunk()
42 std::span<std::byte> FreeList::FindChunk(size_t size) const { in FindChunk()
77 Status FreeList::RemoveChunk(std::span<std::byte> chunk) { in RemoveChunk()
115 size_t FreeList::FindChunkPtrForSize(size_t size, bool non_null) const { in FindChunkPtrForSize()
|
| D | freelist_heap.cc | 24 FreeListHeap::FreeListHeap(std::span<std::byte> region, FreeList& freelist) in FreeListHeap()
|
| /external/llvm-project/compiler-rt/lib/scudo/standalone/tests/ |
| D | release_test.cpp | 178 scudo::SinglyLinkedList<Batch> FreeList; in testReleaseFreeMemoryToOS() local
179 FreeList.clear(); in testReleaseFreeMemoryToOS()
185 FreeList.push_back(CurrentBatch); in testReleaseFreeMemoryToOS()
195 releaseFreeMemoryToOS(FreeList, 0, MaxBlocks * BlockSize, 1U, BlockSize, in testReleaseFreeMemoryToOS()
258 while (!FreeList.empty()) { in testReleaseFreeMemoryToOS()
259 CurrentBatch = FreeList.front(); in testReleaseFreeMemoryToOS()
260 FreeList.pop_front(); in testReleaseFreeMemoryToOS()
|
| /external/scudo/standalone/tests/ |
| D | release_test.cpp | 180 scudo::SinglyLinkedList<Batch> FreeList; in testReleaseFreeMemoryToOS() local
181 FreeList.clear(); in testReleaseFreeMemoryToOS()
187 FreeList.push_back(CurrentBatch); in testReleaseFreeMemoryToOS()
198 releaseFreeMemoryToOS(FreeList, MaxBlocks * BlockSize, 1U, BlockSize, in testReleaseFreeMemoryToOS()
261 while (!FreeList.empty()) { in testReleaseFreeMemoryToOS()
262 CurrentBatch = FreeList.front(); in testReleaseFreeMemoryToOS()
263 FreeList.pop_front(); in testReleaseFreeMemoryToOS()
|
| /external/lzma/C/ |
| D | Ppmd7.c | 124 *((CPpmd_Void_Ref *)node) = p->FreeList[indx]; in InsertNode()
125 p->FreeList[indx] = REF(node); in InsertNode()
130 CPpmd_Void_Ref *node = (CPpmd_Void_Ref *)Ppmd7_GetPtr(p, p->FreeList[indx]); in RemoveNode()
131 p->FreeList[indx] = *node; in RemoveNode()
165 CPpmd7_Node_Ref next = (CPpmd7_Node_Ref)p->FreeList[i]; in GlueFreeBlocks()
166 p->FreeList[i] = 0; in GlueFreeBlocks()
226 if (p->FreeList[indx] != 0) in AllocUnitsRare()
239 while (p->FreeList[i] == 0); in AllocUnitsRare()
248 if (p->FreeList[indx] != 0) in AllocUnits()
270 if (p->FreeList[i1] != 0) in ShrinkUnits()
[all …]
|
| D | Ppmd7.h | 56 CPpmd_Void_Ref FreeList[PPMD_NUM_INDEXES]; member
|
| /external/llvm-project/compiler-rt/lib/scudo/standalone/ |
| D | primary64.h | 113 TransferBatch *B = Region->FreeList.front(); in popBatch()
115 Region->FreeList.pop_front(); in popBatch()
130 Region->FreeList.push_front(B); in pushBatch()
292 SinglyLinkedList<TransferBatch> FreeList; member
383 Region->FreeList.push_back(B); in populateFreeList()
386 TransferBatch *B = Region->FreeList.front(); in populateFreeList()
387 Region->FreeList.pop_front(); in populateFreeList()
457 releaseFreeMemoryToOS(Region->FreeList, Region->RegionBeg,
|
| D | primary32.h | 120 TransferBatch *B = Sci->FreeList.front(); in popBatch()
122 Sci->FreeList.pop_front(); in popBatch()
138 Sci->FreeList.push_front(B); in pushBatch()
261 SinglyLinkedList<TransferBatch> FreeList; member
389 Sci->FreeList.push_back(B); in populateFreeList()
392 TransferBatch *B = Sci->FreeList.front(); in populateFreeList()
393 Sci->FreeList.pop_front(); in populateFreeList()
478 releaseFreeMemoryToOS(Sci->FreeList, Base, RegionSize, NumberOfRegions,
|
| D | release.h | 184 releaseFreeMemoryToOS(const IntrusiveList<TransferBatchT> &FreeList, uptr Base, in releaseFreeMemoryToOS() argument
237 for (const auto &It : FreeList) { in releaseFreeMemoryToOS()
258 for (const auto &It : FreeList) { in releaseFreeMemoryToOS()
|
| /external/scudo/standalone/ |
| D | primary64.h | 93 TransferBatch *B = Region->FreeList.front(); in popBatch()
95 Region->FreeList.pop_front(); in popBatch()
110 Region->FreeList.push_front(B); in pushBatch()
287 SinglyLinkedList<TransferBatch> FreeList; member
389 Region->FreeList.push_back(B); in populateFreeList()
392 TransferBatch *B = Region->FreeList.front(); in populateFreeList()
393 Region->FreeList.pop_front(); in populateFreeList()
467 releaseFreeMemoryToOS(Region->FreeList, Region->AllocatedUser, 1U,
|
| D | primary32.h | 118 TransferBatch *B = Sci->FreeList.front(); in popBatch()
120 Sci->FreeList.pop_front(); in popBatch()
136 Sci->FreeList.push_front(B); in pushBatch()
259 SinglyLinkedList<TransferBatch> FreeList; member
387 Sci->FreeList.push_back(B); in populateFreeList()
390 TransferBatch *B = Sci->FreeList.front(); in populateFreeList()
391 Sci->FreeList.pop_front(); in populateFreeList()
479 releaseFreeMemoryToOS(Sci->FreeList, RegionSize, NumberOfRegions, BlockSize,
|
| D | release.h | 189 releaseFreeMemoryToOS(const IntrusiveList<TransferBatchT> &FreeList, in releaseFreeMemoryToOS() argument
243 for (const auto &It : FreeList) { in releaseFreeMemoryToOS()
257 for (const auto &It : FreeList) { in releaseFreeMemoryToOS()
|
| /external/icing/icing/index/main/ |
| D | flash-index-storage.h | 257 struct FreeList { struct
279 std::vector<FreeList> in_memory_freelists_; argument
|
| D | flash-index-storage.cc | 478 FreeList& freelist = in_memory_freelists_.at(i); in FlushInMemoryFreeList()
552 void FlashIndexStorage::FreeList::Push(PostingListIdentifier id) { in Push()
570 FlashIndexStorage::FreeList::TryPop() { in TryPop()
580 std::string FlashIndexStorage::FreeList::DebugString() const { in DebugString()
|
| /external/llvm-project/polly/test/Isl/CodeGen/ |
| D | non-hoisted-load-needed-as-base-ptr.ll | 23 %FreeList.i = getelementptr inbounds %struct.1, %struct.1* %p, i32 0, i32 20
24 %arrayidx.i = getelementptr inbounds [38 x i32], [38 x i32]* %FreeList.i, i64 0, i64 %idxprom.i
|
| /external/clang/include/clang/Basic/ |
| D | PartialDiagnostic.h | 81 Storage *FreeList[NumCached]; variable
93 Storage *Result = FreeList[--NumFreeListEntries]; in Allocate()
103 FreeList[NumFreeListEntries++] = S; in Deallocate()
|