HomeSort by relevance Sort by last modified time
    Searched refs:heaps (Results 1 - 4 of 4) sorted by null

  /dalvik/vm/alloc/
HeapSource.cpp 135 /* The heaps; heaps[0] is always the active heap,
138 Heap heaps[HEAP_SOURCE_MAX_HEAP_COUNT]; member in struct:HeapSource
140 /* The current number of heaps.
179 #define hs2heap(hs_) (&((hs_)->heaps[0]))
209 * Returns the current footprint of all heaps. If includeActive
224 footprint += mspace_footprint(hs->heaps[i].msp);
239 const Heap *const heap = &hs->heaps[i];
331 hs->heaps[0].msp = msp;
332 hs->heaps[0].maximumSize = maximumSize
    [all...]
  /external/kernel-headers/original/linux/
ion.h 24 * enum ion_heap_types - list of all possible types of heaps
30 * @ION_HEAP_END: helper for iterating over heaps
36 ION_HEAP_TYPE_CUSTOM, /* must be last so device specific heaps always
78 * struct ion_platform_data - array of platform heaps passed from board file
80 * @heaps: array of platform_heap structions
86 struct ion_platform_heap heaps[]; member in struct:ion_platform_data
92 * @heap_mask: mask of heaps this client can allocate from
113 * @flags: mask of heaps to allocate from, if multiple bits are set
114 * heaps will be tried in order from lowest to highest order bit
116 * Allocate memory in one of the heaps provided in heap mask and retur
    [all...]
  /external/chromium/base/
process_util_win.cc 832 // Gives us some extra space in the array in case a thread is creating heaps
835 scoped_array<HANDLE> heaps(new HANDLE[number_heaps + MARGIN]);
836 number_heaps = GetProcessHeaps(number_heaps + MARGIN, heaps.get());
842 // Don't bother with the result code. It may fails on heaps that have the
844 heap_set(heaps[i],
process_util_unittest.cc 280 HANDLE heaps[1024] = { 0 }; local
281 unsigned number_heaps = GetProcessHeaps(1024, heaps);
286 ASSERT_NE(0, HeapQueryInformation(heaps[i],

Completed in 713 milliseconds