HomeSort by relevance Sort by last modified time
    Searched full:freelist (Results 1 - 25 of 143) sorted by null

1 2 3 4 5 6

  /external/valgrind/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/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...]
  /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/coregrind/
m_poolalloc.c 89 /* The freelist is empty. Allocate a new pool and put all the new
90 elements in it onto the freelist. */
99 /* extend the freelist through the new pool. Place the freelist
m_mallocfree.c 88 freelist previous ptr (sizeof(void*) bytes)
92 freelist next ptr (sizeof(void*) bytes)
190 // An arena. 'freelist' is a circular, doubly-linked list. 'rz_szB' is
208 Block* freelist[N_MALLOC_LISTS]; member in struct:__anon20330
240 ULong stats__nsearches; /* total # freelist checks */
597 for (i = 0; i < N_MALLOC_LISTS; i++) a->freelist[i] = NULL;
    [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];
  /ndk/tests/build/issue56508-gcc4.7-ICE/jni/
extraMachine.c 34 Uint8 handlev; /* VM level of this handle; used to maintain freelist */
49 struct hdl *nextfree; /* next handle on freelist */
  /art/runtime/gc/space/
valgrind_malloc_space.h 50 size_t FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) OVERRIDE
zygote_space.h 55 size_t FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) OVERRIDE;
zygote_space.cc 95 size_t ZygoteSpace::FreeList(Thread*, size_t, mirror::Object**) {
  /external/clang/include/clang/Basic/
PartialDiagnostic.h 81 Storage *FreeList[NumCached];
93 Storage *Result = FreeList[--NumFreeListEntries];
103 FreeList[NumFreeListEntries++] = S;
  /external/compiler-rt/lib/tsan/rtl/
tsan_sync.h 31 uptr addr; // overwritten by DenseSlabAlloc freelist
  /external/mesa3d/src/mesa/drivers/dri/i965/
brw_clip.h 93 struct brw_reg freelist; member in struct:brw_clip_compile::__anon16895
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/
mt_allocator.h 104 // _M_freelist_headroom % of used memory on the freelist. If
106 // _M_freelist_headroom % of the freelist, we move these
304 // blocks that are on the freelist/used for each thread id.
628 * compiled with thread support - will maintain one freelist per
630 * the per thread freelist sizes (by returning excess back to
710 // Find out if we have blocks on our freelist. If so, go ahead
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/
mt_allocator.h 104 // _M_freelist_headroom % of used memory on the freelist. If
106 // _M_freelist_headroom % of the freelist, we move these
304 // blocks that are on the freelist/used for each thread id.
628 * compiled with thread support - will maintain one freelist per
630 * the per thread freelist sizes (by returning excess back to
710 // Find out if we have blocks on our freelist. If so, go ahead
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/
mt_allocator.h 104 // _M_freelist_headroom % of used memory on the freelist. If
106 // _M_freelist_headroom % of the freelist, we move these
304 // blocks that are on the freelist/used for each thread id.
628 * compiled with thread support - will maintain one freelist per
630 * the per thread freelist sizes (by returning excess back to
710 // Find out if we have blocks on our freelist. If so, go ahead

Completed in 3537 milliseconds

1 2 3 4 5 6