| /external/llvm/include/llvm/Support/ |
| H A D | Recycler.h | 67 /// FreeList - Doubly-linked list of nodes that have deleted contents and
70 iplist<RecyclerStruct> FreeList; member in class:llvm::Recycler
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
[all...] |
| H A D | ArrayRecycler.h | 33 struct FreeList { struct in class:llvm::ArrayRecycler
34 FreeList *Next;
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];
58 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr);
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| H A D | thread_cache.h | 136 class FreeList { class in class:tcmalloc::ThreadCache
236 void ListTooLong(FreeList* src, size_t cl);
239 void ReleaseToCentralCache(FreeList* src, size_t cl, int N);
325 FreeList list_[kNumClasses]; // Array indexed by size-class
366 FreeList* list = &list_[cl];
375 FreeList* list = &list_[cl];
|
| H A D | thread_cache.cc | 158 FreeList* list = &list_[cl];
197 void ThreadCache::ListTooLong(FreeList* list, size_t cl) {
222 void ThreadCache::ReleaseToCentralCache(FreeList* src, size_t cl, int N) {
252 FreeList* list = &list_[cl];
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| H A D | thread_cache.h | 131 class FreeList { class in class:tcmalloc::ThreadCache
230 void ListTooLong(FreeList* src, size_t cl);
233 void ReleaseToCentralCache(FreeList* src, size_t cl, int N);
302 FreeList list_[kNumClasses]; // Array indexed by size-class
339 FreeList* list = &list_[cl];
348 FreeList* list = &list_[cl];
|
| H A D | thread_cache.cc | 155 FreeList* list = &list_[cl];
191 void ThreadCache::ListTooLong(FreeList* list, size_t cl) {
216 void ThreadCache::ReleaseToCentralCache(FreeList* src, size_t cl, int N) {
246 FreeList* list = &list_[cl];
|
| /external/llvm/lib/ExecutionEngine/JIT/ |
| H A D | JITMemoryManager.cpp | 94 FreeRangeHeader *FreeBlock(FreeRangeHeader *FreeList);
99 FreeRangeHeader *TrimAllocationToSize(FreeRangeHeader *FreeList,
129 void AddToFreeList(FreeRangeHeader *FreeList) { argument
130 Next = FreeList;
131 Prev = FreeList->Prev;
164 FreeRangeHeader *MemoryRangeHeader::FreeBlock(FreeRangeHeader *FreeList) { argument
169 FreeRangeHeader *FreeListToReturn = FreeList;
174 // "FreeList" always needs to be a valid free block. If we're about to
176 if (&FollowingFreeBlock == FreeList) {
177 FreeList
226 TrimAllocationToSize(FreeRangeHeader *FreeList, uint64_t NewSize) argument
[all...] |
| /external/lzma/C/ |
| H A D | Ppmd7.c | 120 *((CPpmd_Void_Ref *)node) = p->FreeList[indx];
121 p->FreeList[indx] = REF(node);
126 CPpmd_Void_Ref *node = (CPpmd_Void_Ref *)Ppmd7_GetPtr(p, p->FreeList[indx]);
127 p->FreeList[indx] = *node;
161 CPpmd7_Node_Ref next = (CPpmd7_Node_Ref)p->FreeList[i];
162 p->FreeList[i] = 0;
222 if (p->FreeList[indx] != 0)
235 while (p->FreeList[i] == 0);
244 if (p->FreeList[indx] != 0)
266 if (p->FreeList[i
[all...] |
| H A D | Ppmd7.h | 56 CPpmd_Void_Ref FreeList[PPMD_NUM_INDEXES];
member in struct:__anon26722
|
| /external/clang/include/clang/Basic/ |
| H A D | PartialDiagnostic.h | 81 Storage *FreeList[NumCached]; member in class:clang::PartialDiagnostic::StorageAllocator
93 Storage *Result = FreeList[--NumFreeListEntries];
103 FreeList[NumFreeListEntries++] = S;
|
| /external/chromium_org/v8/src/heap/ |
| H A D | spaces.cc | 2154 FreeList::FreeList(PagedSpace* owner) : owner_(owner), heap_(owner->heap()) { function in class:v8::FreeList
2159 intptr_t FreeList::Concatenate(FreeList* free_list) {
2169 void FreeList::Reset() {
2177 int FreeList::Free(Address start, int size_in_bytes) {
2211 FreeListNode* FreeList::FindNodeFor(int size_in_bytes, int* node_size) {
2326 HeapObject* FreeList::Allocate(int size_in_bytes) {
2401 intptr_t FreeList::EvictFreeListItems(Page* p) {
2418 bool FreeList
[all...] |
| H A D | mark-compact.h | 890 SmartPointer<FreeList> free_list_old_data_space_;
891 SmartPointer<FreeList> free_list_old_pointer_space_;
|
| H A D | spaces.h | 98 class FreeList;
1511 class FreeList { class in namespace:v8::internal
1513 explicit FreeList(PagedSpace* owner);
1515 intptr_t Concatenate(FreeList* free_list);
1599 DISALLOW_IMPLICIT_CONSTRUCTORS(FreeList);
1878 FreeList* free_list() { return &free_list_; }
1894 FreeList free_list_;
|
| H A D | mark-compact.cc | 329 free_list_old_data_space_.Reset(new FreeList(heap_->old_data_space()));
330 free_list_old_pointer_space_.Reset(new FreeList(heap_->old_pointer_space()));
628 FreeList* free_list;
3278 static intptr_t Free(PagedSpace* space, FreeList* free_list, Address start,
3298 static int Sweep(PagedSpace* space, FreeList* free_list, Page* p,
3383 return FreeList::GuaranteedAllocatable(static_cast<int>(max_freed_bytes));
4140 FreeList* free_list = space == heap()->old_pointer_space()
4143 FreeList private_free_list(space);
|
| /external/clang/lib/Basic/ |
| H A D | Diagnostic.cpp | 983 FreeList[I] = Cached + I;
|