| /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 | 42 FreeNode *FreeList = nullptr;
45 auto *Val = FreeList;
46 FreeList = FreeList->Next;
51 N->Next = FreeList;
52 FreeList = N;
60 assert(!FreeList && "Non-empty recycler deleted!");
68 while (FreeList) {
79 void clear(BumpPtrAllocator &) { FreeList = nullptr; }
87 return FreeList ? reinterpret_cast<SubClass *>(pop_val()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 32 struct FreeList {
33 FreeList *Next;
36 static_assert(Align >= alignof(FreeList), "Object underaligned");
37 static_assert(sizeof(T) >= sizeof(FreeList), "Objects are too small");
40 SmallVector<FreeList*, 8> Bucket;
47 FreeList *Entry = Bucket[Idx];
57 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr);
|
| Recycler.h | 41 FreeNode *FreeList = nullptr;
44 auto *Val = FreeList;
45 FreeList = FreeList->Next;
50 N->Next = FreeList;
51 FreeList = N;
59 assert(!FreeList && "Non-empty recycler deleted!");
67 while (FreeList) {
78 void clear(BumpPtrAllocator &) { FreeList = nullptr; }
86 return FreeList ? reinterpret_cast<SubClass *>(pop_val()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 32 struct FreeList {
33 FreeList *Next;
36 static_assert(Align >= alignof(FreeList), "Object underaligned");
37 static_assert(sizeof(T) >= sizeof(FreeList), "Objects are too small");
40 SmallVector<FreeList*, 8> Bucket;
47 FreeList *Entry = Bucket[Idx];
57 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr);
|
| Recycler.h | 41 FreeNode *FreeList = nullptr;
44 auto *Val = FreeList;
45 FreeList = FreeList->Next;
50 N->Next = FreeList;
51 FreeList = N;
59 assert(!FreeList && "Non-empty recycler deleted!");
67 while (FreeList) {
78 void clear(BumpPtrAllocator &) { FreeList = nullptr; }
86 return FreeList ? reinterpret_cast<SubClass *>(pop_val()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 32 struct FreeList {
33 FreeList *Next;
36 static_assert(Align >= alignof(FreeList), "Object underaligned");
37 static_assert(sizeof(T) >= sizeof(FreeList), "Objects are too small");
40 SmallVector<FreeList*, 8> Bucket;
47 FreeList *Entry = Bucket[Idx];
57 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr);
|
| Recycler.h | 41 FreeNode *FreeList = nullptr;
44 auto *Val = FreeList;
45 FreeList = FreeList->Next;
50 N->Next = FreeList;
51 FreeList = N;
59 assert(!FreeList && "Non-empty recycler deleted!");
67 while (FreeList) {
78 void clear(BumpPtrAllocator &) { FreeList = nullptr; }
86 return FreeList ? reinterpret_cast<SubClass *>(pop_val()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 32 struct FreeList {
33 FreeList *Next;
36 static_assert(Align >= alignof(FreeList), "Object underaligned");
37 static_assert(sizeof(T) >= sizeof(FreeList), "Objects are too small");
40 SmallVector<FreeList*, 8> Bucket;
47 FreeList *Entry = Bucket[Idx];
57 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr);
|
| Recycler.h | 41 FreeNode *FreeList = nullptr;
44 auto *Val = FreeList;
45 FreeList = FreeList->Next;
50 N->Next = FreeList;
51 FreeList = N;
59 assert(!FreeList && "Non-empty recycler deleted!");
67 while (FreeList) {
78 void clear(BumpPtrAllocator &) { FreeList = nullptr; }
86 return FreeList ? reinterpret_cast<SubClass *>(pop_val()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 32 struct FreeList {
33 FreeList *Next;
36 static_assert(Align >= alignof(FreeList), "Object underaligned");
37 static_assert(sizeof(T) >= sizeof(FreeList), "Objects are too small");
40 SmallVector<FreeList*, 8> Bucket;
47 FreeList *Entry = Bucket[Idx];
57 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr);
|
| Recycler.h | 41 FreeNode *FreeList = nullptr;
44 auto *Val = FreeList;
45 FreeList = FreeList->Next;
50 N->Next = FreeList;
51 FreeList = N;
59 assert(!FreeList && "Non-empty recycler deleted!");
67 while (FreeList) {
78 void clear(BumpPtrAllocator &) { FreeList = nullptr; }
86 return FreeList ? reinterpret_cast<SubClass *>(pop_val()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 32 struct FreeList {
33 FreeList *Next;
36 static_assert(Align >= alignof(FreeList), "Object underaligned");
37 static_assert(sizeof(T) >= sizeof(FreeList), "Objects are too small");
40 SmallVector<FreeList*, 8> Bucket;
47 FreeList *Entry = Bucket[Idx];
57 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr);
|
| Recycler.h | 41 FreeNode *FreeList = nullptr;
44 auto *Val = FreeList;
45 FreeList = FreeList->Next;
50 N->Next = FreeList;
51 FreeList = N;
59 assert(!FreeList && "Non-empty recycler deleted!");
67 while (FreeList) {
78 void clear(BumpPtrAllocator &) { FreeList = nullptr; }
86 return FreeList ? reinterpret_cast<SubClass *>(pop_val()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 32 struct FreeList {
33 FreeList *Next;
36 static_assert(Align >= alignof(FreeList), "Object underaligned");
37 static_assert(sizeof(T) >= sizeof(FreeList), "Objects are too small");
40 SmallVector<FreeList*, 8> Bucket;
47 FreeList *Entry = Bucket[Idx];
57 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr);
|
| Recycler.h | 41 FreeNode *FreeList = nullptr;
44 auto *Val = FreeList;
45 FreeList = FreeList->Next;
50 N->Next = FreeList;
51 FreeList = N;
59 assert(!FreeList && "Non-empty recycler deleted!");
67 while (FreeList) {
78 void clear(BumpPtrAllocator &) { FreeList = nullptr; }
86 return FreeList ? reinterpret_cast<SubClass *>(pop_val()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 32 struct FreeList {
33 FreeList *Next;
36 static_assert(Align >= alignof(FreeList), "Object underaligned");
37 static_assert(sizeof(T) >= sizeof(FreeList), "Objects are too small");
40 SmallVector<FreeList*, 8> Bucket;
47 FreeList *Entry = Bucket[Idx];
57 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr);
|
| Recycler.h | 41 FreeNode *FreeList = nullptr;
44 auto *Val = FreeList;
45 FreeList = FreeList->Next;
50 N->Next = FreeList;
51 FreeList = N;
59 assert(!FreeList && "Non-empty recycler deleted!");
67 while (FreeList) {
78 void clear(BumpPtrAllocator &) { FreeList = nullptr; }
86 return FreeList ? reinterpret_cast<SubClass *>(pop_val()
[all...] |
| /art/runtime/gc/space/ |
| memory_tool_malloc_space-inl.h | 223 kUseObjSizeForUsable>::FreeList(
|
| zygote_space.cc | 96 size_t ZygoteSpace::FreeList(Thread*, size_t, mirror::Object**) {
|
| dlmalloc_space.cc | 182 size_t DlMallocSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
209 LOG(ERROR) << "FreeList[" << i << "] (" << ptrs[i] << ") not in bounds of heap " << *this;
|
| rosalloc_space.cc | 204 size_t RosAllocSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
229 LOG(ERROR) << "FreeList[" << i << "] (" << ptrs[i] << ") not in bounds of heap " << *this;
|
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| Recycler.h | 65 /// FreeList - Doubly-linked list of nodes that have deleted contents and
68 iplist<RecyclerStruct> FreeList;
75 assert(FreeList.empty() && "Non-empty recycler deleted!");
83 while (!FreeList.empty()) {
84 T *t = reinterpret_cast<T *>(FreeList.remove(FreeList.begin()));
95 return !FreeList.empty() ?
96 reinterpret_cast<SubClass *>(FreeList.remove(FreeList.begin())) :
107 FreeList.push_front(reinterpret_cast<RecyclerStruct *>(Element))
[all...] |
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
| build.c | 640 static TokNode *FreeList = NULL;
643 if ( FreeList == NULL )
650 p->next = (Node *)FreeList; /* add all new token nodes to FreeList */
651 FreeList = p;
654 p = FreeList;
655 FreeList = (TokNode *)FreeList->next;/* remove a TokNode node */
674 static RuleRefNode *FreeList = NULL;
677 if ( FreeList == NULL )
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Core/Dxe/Mem/ |
| Pool.c | 74 LIST_ENTRY FreeList[MAX_POOL_LIST];
129 InitializeListHead (&mPoolHead[Type].FreeList[Index]);
179 InitializeListHead (&Pool->FreeList[Index]);
354 if (IsListEmpty (&Pool->FreeList[Index])) {
363 if (!IsListEmpty (&Pool->FreeList[Index])) {
364 Free = CR (Pool->FreeList[Index].ForwardLink, POOL_FREE, Link, POOL_FREE_SIGNATURE);
398 InsertHeadList (&Pool->FreeList[Index], &Free->Link);
411 Free = CR (Pool->FreeList[Index].ForwardLink, POOL_FREE, Link, POOL_FREE_SIGNATURE);
610 InsertHeadList (&Pool->FreeList[Index], &Free->Link);
|
