| /external/valgrind/main/memcheck/tests/ |
| big_blocks_freed_list.vgtest | 2 vgopts: --freelist-vol=1000000 --freelist-big-blocks=50000
|
| memalign2.vgtest | 2 vgopts: -q --freelist-vol=100000 --freelist-big-blocks=0
|
| big_blocks_freed_list.c | 2 /* To be run with --freelist-vol=1000000 --freelist-big-blocks=50000 */
|
| /external/libcxxabi/src/ |
| fallback_malloc.ipp | 65 static heap_node *freelist = NULL;
74 freelist = (heap_node *) heap;
75 freelist->next_node = offset_from_node ( list_end );
76 freelist->len = HEAP_SIZE / sizeof (heap_node);
91 if ( NULL == freelist )
95 for (p = freelist, prev = 0;
110 freelist = node_from_offset(p->next_node);
133 for (p = freelist, prev = 0;
155 freelist = cp;
167 cp->next_node = offset_from_node ( freelist );
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++abi/libcxxabi/src/ |
| fallback_malloc.ipp | 65 static heap_node *freelist = NULL;
74 freelist = (heap_node *) heap;
75 freelist->next_node = offset_from_node ( list_end );
76 freelist->len = HEAP_SIZE / sizeof (heap_node);
91 if ( NULL == freelist )
95 for (p = freelist, prev = 0;
110 freelist = node_from_offset(p->next_node);
133 for (p = freelist, prev = 0;
155 freelist = cp;
167 cp->next_node = offset_from_node ( freelist );
[all...] |
| /external/e2fsprogs/lib/ext2fs/tdb/patches/ |
| static-functions | 6 /* file: freelist.c */
8 /* read a freelist record and check for simple errors */
|
| /external/llvm/include/llvm/Support/ |
| 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...] |
| 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);
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| corrupt4.test | 33 # Create a database with a freelist containing at least two pages.
49 # Verify that there are two pages on the freelist.
55 # Get the page number for the trunk of the freelist.
60 # Verify that the trunk of the freelist has exactly one
68 # Then try to add a new element to the freelist.
|
| corrupt9.test | 15 # on corruption in the form of duplicate entries on the freelist.
34 # Return the offset to the first (trunk) page of the freelist. Return
35 # zero of the freelist is empty.
43 # This procedure looks at the first trunk page of the freelist and
49 if {$offset==0} {error "Freelist is empty"}
58 # entries on the freelist.
85 # Corrupt the freelist by adding duplicate entries to the freelist.
|
| pageropt.test | 108 # Pages written are page 1 (for the freelist pointer), the root page
110 # becomes the trunk of the freelist. Total 3.
120 # When pulling pages off of the freelist, there is no reason
137 # freelist we do not read the content of that page.
168 # There are now 11 pages on the freelist. Move them all into an
171 # of the freelist need to be read (3 pages). And only those three
184 # empty freelist. The first 10 of the 11 pages overflow chain have
187 # freelist need to be journalled and written back.
|
| corrupt5.test | 29 # Create a database with a freelist containing at least two pages.
|
| /external/opencv/cvaux/src/ |
| cvbgfg_codebook.cpp | 98 CvBGCodeBookElem* freeList;
118 model->freeList = 0;
133 freeList = model->freeList;
134 nblocks = (int)((model->storage->block_size - sizeof(CvMemBlock))/sizeof(*freeList));
195 if( !freeList )
197 freeList = (CvBGCodeBookElem*)cvMemStorageAlloc(model->storage,
198 nblocks*sizeof(*freeList));
200 freeList[i].next = &freeList[i+1]
[all...] |
| /external/chromium_org/third_party/angle/src/compiler/translator/ |
| PoolAlloc.cpp | 56 freeList(0),
110 while (freeList) {
111 tHeader* next = freeList->nextPage;
112 delete [] reinterpret_cast<char*>(freeList);
113 freeList = next;
188 inUseList->nextPage = freeList;
189 freeList = inUseList;
268 if (freeList) {
269 memory = freeList;
270 freeList = freeList->nextPage
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
| low_level_alloc.cc | 75 // Next two fields: in unallocated blocks: freelist skiplist data
88 // A trivial skiplist implementation. This is used to keep the freelist
171 RAW_CHECK(e == found, "element not in freelist");
188 SpinLock mu; // protects freelist, allocation_count,
190 AllocList freelist; // head of free list; sorted by addr (under mu) member in struct:LowLevelAlloc::Arena
268 while (arena->roundup < sizeof (arena->freelist.header)) {
274 arena->freelist.header.size = 0;
275 arena->freelist.header.magic =
276 Magic(kMagicUnallocated, &arena->freelist.header);
277 arena->freelist.header.arena = arena
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
| low_level_alloc.cc | 75 // Next two fields: in unallocated blocks: freelist skiplist data
88 // A trivial skiplist implementation. This is used to keep the freelist
171 RAW_CHECK(e == found, "element not in freelist");
188 SpinLock mu; // protects freelist, allocation_count,
190 AllocList freelist; // head of free list; sorted by addr (under mu) member in struct:LowLevelAlloc::Arena
268 while (arena->roundup < sizeof (arena->freelist.header)) {
274 arena->freelist.header.size = 0;
275 arena->freelist.header.magic =
276 Magic(kMagicUnallocated, &arena->freelist.header);
277 arena->freelist.header.arena = arena
[all...] |
| /external/stlport/src/ |
| lock_free_slist.h | 29 * Class that implements a non-blocking and thread-safe freelist.
37 * Type representing items of the freelist
51 * Atomically pushes the specified item onto the freelist.
83 * Atomically removes the topmost item from the freelist and returns a
135 item* _M_top; // Topmost element in the freelist
175 * Class that implements a non-blocking and thread-safe freelist.
183 * Type representing items of the freelist
205 * Atomically pushes the specified item onto the freelist.
228 * Atomically removes the topmost item from the freelist and returns a
285 item* _M_top; // Topmost element in the freelist
[all...] |
| /ndk/sources/cxx-stl/stlport/src/ |
| lock_free_slist.h | 29 * Class that implements a non-blocking and thread-safe freelist.
37 * Type representing items of the freelist
51 * Atomically pushes the specified item onto the freelist.
83 * Atomically removes the topmost item from the freelist and returns a
135 item* _M_top; // Topmost element in the freelist
175 * Class that implements a non-blocking and thread-safe freelist.
183 * Type representing items of the freelist
205 * Atomically pushes the specified item onto the freelist.
228 * Atomically removes the topmost item from the freelist and returns a
285 item* _M_top; // Topmost element in the freelist
[all...] |
| /external/e2fsprogs/lib/ext2fs/tdb/ |
| build-tdb | 11 FILES="error.c lock.c io.c transaction.c freelist.c \
|
| /external/valgrind/main/coregrind/ |
| m_poolalloc.c | 90 /* The freelist is empty. Allocate a new pool and put all the new
91 elements in it onto the freelist. */
101 /* extend the freelist through the new pool. Place the freelist
|
| /external/srec/portable/src/ |
| phashtable.c | 63 PHashTableEntry *freeList;
122 tmp->freeList = NULL;
202 entry->next = entry->table->freeList;
203 entry->table->freeList = entry;
368 if (table->freeList == NULL)
394 entry->next = table->freeList;
397 table->freeList = block->entries;
400 /* Get an entry from the freeList. */
401 entry = table->freeList;
402 table->freeList = entry->next
[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...] |
| /external/chromium_org/third_party/sqlite/src/doc/ |
| pager-invariants.txt | 13 (b) The page was a freelist leaf page at the start of the transaction.
47 all queries. Note in particular the the content of freelist leaf
|
| /external/chromium_org/third_party/sqlite/src/tool/ |
| showdb.c | 165 print_decode_line(aData, 32, 4, "Page number of first freelist page");
166 print_decode_line(aData, 36, 4, "Number of freelist pages");
418 ** Decode a freelist trunk page.
430 printf("Decode of freelist trunk page %d:\n", pgno);
431 print_decode_line(a, 0, 4, "Next freelist trunk page");
466 " NNNt Decode freelist trunk page NNN\n"
467 " NNNtd Show leave freelist pages on the decode\n"
468 " NNNtr Recurisvely decode freelist starting at NNN\n"
|
| /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.
|
