| /external/chromium_org/v8/src/ |
| sweeper-thread.h | 66 FreeList free_list_old_data_space_;
67 FreeList free_list_old_pointer_space_;
68 FreeList private_free_list_old_data_space_;
69 FreeList private_free_list_old_pointer_space_;
|
| mark-compact.h | 648 FreeList* free_list,
719 FreeList* private_free_list,
720 FreeList* free_list);
|
| spaces.h | 119 class FreeList;
[all...] |
| spaces.cc | [all...] |
| /external/llvm/include/llvm/Support/ |
| Recycler.h | 68 /// FreeList - Doubly-linked list of nodes that have deleted contents and
71 iplist<RecyclerStruct> FreeList;
78 assert(FreeList.empty() && "Non-empty recycler deleted!");
86 while (!FreeList.empty()) {
87 T *t = reinterpret_cast<T *>(FreeList.remove(FreeList.begin()));
98 FreeList.clearAndLeakNodesUnsafely();
107 return !FreeList.empty() ?
108 reinterpret_cast<SubClass *>(FreeList.remove(FreeList.begin()))
[all...] |
| ArrayRecycler.h | 34 struct FreeList {
35 FreeList *Next;
39 SmallVector<FreeList*, 8> Bucket;
46 FreeList *Entry = Bucket[Idx];
56 assert(sizeof(T) >= sizeof(FreeList) && "Objects are too small");
57 assert(Align >= AlignOf<FreeList>::Alignment && "Object underaligned");
58 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr);
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| thread_cache.h | 122 // items on the corresponding freelist. class_count may be NULL.
136 class FreeList {
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];
381 // the entire freelist. But this might be enough to find some bugs.
|
| thread_cache.cc | 158 FreeList* list = &list_[cl];
170 // Pop the top of the list and add the rest to the freelist.
197 void ThreadCache::ListTooLong(FreeList* list, size_t cl) {
211 // shrink it, some amount of memory will always stay in this freelist.
222 void ThreadCache::ReleaseToCentralCache(FreeList* src, size_t cl, int N) {
252 FreeList* list = &list_[cl];
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| thread_cache.h | 117 // items on the corresponding freelist. class_count may be NULL.
131 class FreeList {
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];
354 // the entire freelist. But this might be enough to find some bugs.
|
| thread_cache.cc | 155 FreeList* list = &list_[cl];
191 void ThreadCache::ListTooLong(FreeList* list, size_t cl) {
205 // shrink it, some amount of memory will always stay in this freelist.
216 void ThreadCache::ReleaseToCentralCache(FreeList* src, size_t cl, int N) {
246 FreeList* list = &list_[cl];
|
| /external/llvm/lib/ExecutionEngine/JIT/ |
| JITMemoryManager.cpp | 93 FreeRangeHeader *FreeBlock(FreeRangeHeader *FreeList);
98 FreeRangeHeader *TrimAllocationToSize(FreeRangeHeader *FreeList,
123 assert(Next->Prev == this && Prev->Next == this && "Freelist broken!");
128 void AddToFreeList(FreeRangeHeader *FreeList) {
129 Next = FreeList;
130 Prev = FreeList->Prev;
163 FreeRangeHeader *MemoryRangeHeader::FreeBlock(FreeRangeHeader *FreeList) {
168 FreeRangeHeader *FreeListToReturn = FreeList;
173 // "FreeList" always needs to be a valid free block. If we're about to
175 if (&FollowingFreeBlock == FreeList) {
[all...] |
| /external/lzma/C/ |
| 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[i1] != 0)
[all...] |
| Ppmd7.h | 56 CPpmd_Void_Ref FreeList[PPMD_NUM_INDEXES];
|
| /external/clang/include/clang/Basic/ |
| PartialDiagnostic.h | 86 Storage *FreeList[NumCached];
98 Storage *Result = FreeList[--NumFreeListEntries];
108 FreeList[NumFreeListEntries++] = S;
|
| /external/chromium_org/chrome_frame/crash_reporting/ |
| nt_loader.h | 66 _PEB_FREE_BLOCK* FreeList; // 0x038
|
| /art/runtime/gc/space/ |
| dlmalloc_space.h | 62 virtual size_t FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs);
|
| space.h | 169 virtual size_t FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) = 0;
|
| large_object_space.h | 60 size_t FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs);
|
| dlmalloc_space.cc | 96 virtual size_t FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
365 size_t DlMallocSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
392 LOG(ERROR) << "FreeList[" << i << "] (" << ptrs[i] << ") not in bounds of heap " << *this;
|
| space_test.cc | 286 space->FreeList(self, arraysize(lots_of_objects), lots_of_objects);
300 space->FreeList(self, arraysize(lots_of_objects), lots_of_objects);
|
| large_object_space.cc | 98 size_t LargeObjectSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
|
| /external/v8/src/ |
| spaces.cc | 936 FreeList::SizeStats sizes;
[all...] |
| spaces.h | 121 class FreeList;
[all...] |
| /art/runtime/gc/collector/ |
| mark_sweep.cc | [all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| FastMalloc.cpp | 388 * freelist manipulation much more difficult.
634 // A central cache freelist can have anywhere from 0 to kNumTransferEntries
[all...] |
