Home
last modified time | relevance | path

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

/external/llvm/include/llvm/Support/
DRecycler.h70 iplist<RecyclerStruct> FreeList;
77 assert(FreeList.empty() && "Non-empty recycler deleted!");
85 while (!FreeList.empty()) {
86 T *t = reinterpret_cast<T *>(FreeList.remove(FreeList.begin()));
97 FreeList.clearAndLeakNodesUnsafely();
106 return !FreeList.empty() ?
107 reinterpret_cast<SubClass *>(FreeList.remove(FreeList.begin())) :
118 FreeList.push_front(reinterpret_cast<RecyclerStruct *>(Element));
122 PrintRecyclerStats(Size, Align, FreeList.size());
DArrayRecycler.h33 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/lzma/C/
DPpmd7.c120 *((CPpmd_Void_Ref *)node) = p->FreeList[indx]; in InsertNode()
121 p->FreeList[indx] = REF(node); in InsertNode()
126 CPpmd_Void_Ref *node = (CPpmd_Void_Ref *)Ppmd7_GetPtr(p, p->FreeList[indx]); in RemoveNode()
127 p->FreeList[indx] = *node; in RemoveNode()
161 CPpmd7_Node_Ref next = (CPpmd7_Node_Ref)p->FreeList[i]; in GlueFreeBlocks()
162 p->FreeList[i] = 0; in GlueFreeBlocks()
222 if (p->FreeList[indx] != 0) in AllocUnitsRare()
235 while (p->FreeList[i] == 0); in AllocUnitsRare()
244 if (p->FreeList[indx] != 0) in AllocUnits()
266 if (p->FreeList[i1] != 0) in ShrinkUnits()
[all …]
DPpmd7.h56 CPpmd_Void_Ref FreeList[PPMD_NUM_INDEXES]; member
/external/clang/include/clang/Basic/
DPartialDiagnostic.h81 Storage *FreeList[NumCached]; variable
93 Storage *Result = FreeList[--NumFreeListEntries]; in Allocate()
103 FreeList[NumFreeListEntries++] = S; in Deallocate()
/external/v8/src/heap/
Dspaces.cc2154 FreeList::FreeList(PagedSpace* owner) : owner_(owner), heap_(owner->heap()) { in FreeList() function in v8::internal::FreeList
2159 intptr_t FreeList::Concatenate(FreeList* free_list) { in Concatenate()
2169 void FreeList::Reset() { in Reset()
2177 int FreeList::Free(Address start, int size_in_bytes) { in Free()
2211 FreeListNode* FreeList::FindNodeFor(int size_in_bytes, int* node_size) { in FindNodeFor()
2326 HeapObject* FreeList::Allocate(int size_in_bytes) { in Allocate()
2401 intptr_t FreeList::EvictFreeListItems(Page* p) { in EvictFreeListItems()
2418 bool FreeList::ContainsPageFreeListItems(Page* p) { in ContainsPageFreeListItems()
2426 void FreeList::RepairLists(Heap* heap) { in RepairLists()
2463 bool FreeList::IsVeryLong() { in IsVeryLong()
[all …]
Dspaces.h98 class FreeList; variable
1511 class FreeList {
1513 explicit FreeList(PagedSpace* owner);
1515 intptr_t Concatenate(FreeList* free_list);
1599 DISALLOW_IMPLICIT_CONSTRUCTORS(FreeList);
1878 FreeList* free_list() { return &free_list_; } in free_list()
1894 FreeList free_list_;
Dmark-compact.h890 SmartPointer<FreeList> free_list_old_data_space_;
891 SmartPointer<FreeList> free_list_old_pointer_space_;
Dmark-compact.cc329 free_list_old_data_space_.Reset(new FreeList(heap_->old_data_space())); in SetUp()
330 free_list_old_pointer_space_.Reset(new FreeList(heap_->old_pointer_space())); in SetUp()
628 FreeList* free_list; in RefillFreeList()
3278 static intptr_t Free(PagedSpace* space, FreeList* free_list, Address start, in Free()
3298 static int Sweep(PagedSpace* space, FreeList* free_list, Page* p, in Sweep()
3383 return FreeList::GuaranteedAllocatable(static_cast<int>(max_freed_bytes)); in Sweep()
4140 FreeList* free_list = space == heap()->old_pointer_space() in SweepInParallel()
4143 FreeList private_free_list(space); in SweepInParallel()
/external/llvm/test/CodeGen/PowerPC/
Dpr15031.ll269 …Recycler<llvm::MachineOperand, 8>::FreeList" = type { %"struct.llvm::ArrayRecycler<llvm::MachineOp…
/external/clang/lib/Basic/
DDiagnostic.cpp994 FreeList[I] = Cached + I; in StorageAllocator()