HomeSort by relevance Sort by last modified time
    Searched defs:FreeList (Results 1 - 14 of 14) sorted by null

  /art/runtime/gc/space/
valgrind_malloc_space-inl.h 85 size_t ValgrindMallocSpace<S, A>::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
zygote_space.cc 94 size_t ZygoteSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
dlmalloc_space.cc 173 size_t DlMallocSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
200 LOG(ERROR) << "FreeList[" << i << "] (" << ptrs[i] << ") not in bounds of heap " << *this;
rosalloc_space.cc 186 size_t RosAllocSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
211 LOG(ERROR) << "FreeList[" << i << "] (" << ptrs[i] << ") not in bounds of heap " << *this;
large_object_space.cc 164 size_t LargeObjectSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
505 context->freed.bytes += space->FreeList(self, num_ptrs, ptrs);
  /external/llvm/include/llvm/Support/
ArrayRecycler.h 33 struct FreeList {
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);
Recycler.h 67 /// FreeList - Doubly-linked list of nodes that have deleted contents and
70 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()))
    [all...]
  /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.
  /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.
  /external/clang/include/clang/Basic/
PartialDiagnostic.h 81 Storage *FreeList[NumCached];
93 Storage *Result = FreeList[--NumFreeListEntries];
103 FreeList[NumFreeListEntries++] = S;
  /external/lzma/C/
Ppmd7.h 56 CPpmd_Void_Ref FreeList[PPMD_NUM_INDEXES];
  /external/chromium_org/v8/src/
spaces.cc     [all...]
spaces.h 98 class FreeList;
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/
ntddk.h 102 SINGLE_LIST_ENTRY FreeList;
    [all...]

Completed in 618 milliseconds