/external/python/cpython2/Lib/multiprocessing/ |
heap.py | 4 # multiprocessing/heap.py 90 class Heap(object): 239 _heap = Heap()
|
/prebuilts/gdb/darwin-x86/lib/python2.7/multiprocessing/ |
heap.py | 4 # multiprocessing/heap.py 90 class Heap(object): 239 _heap = Heap()
|
/prebuilts/gdb/linux-x86/lib/python2.7/multiprocessing/ |
heap.py | 4 # multiprocessing/heap.py 90 class Heap(object): 239 _heap = Heap()
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/multiprocessing/ |
heap.py | 4 # multiprocessing/heap.py 90 class Heap(object): 239 _heap = Heap()
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/multiprocessing/ |
heap.py | 4 # multiprocessing/heap.py 90 class Heap(object): 239 _heap = Heap()
|
/system/core/libmemunreachable/ |
Allocator.h | 42 class Heap { 44 Heap(); 45 ~Heap(); 48 Heap(const Heap& other) : impl_(other.impl_), owns_impl_(false) {} 51 Heap& operator=(const Heap&) = delete; 70 bool operator==(const Heap& other) const { return impl_ == other.impl_; } 71 bool operator!=(const Heap& other) const { return !(*this == other); } 100 // STLAllocator implements the std allocator interface on top of a Heap [all...] |
Allocator.cpp | 168 Chunk(HeapImpl* heap, int bucket); 184 HeapImpl* heap() { return heap_; } function in class:android::Chunk 230 Chunk::Chunk(HeapImpl* heap, int bucket) 232 heap_(heap), 382 assert(chunk->heap() == this); 437 Heap::Heap() { 446 Heap::~Heap() { 452 void* Heap::allocate(size_t size) [all...] |
/device/linaro/bootloader/edk2/NetworkPkg/IScsiDxe/ |
IScsiIbft.c | 94 Add one item into the heap.
96 @param[in, out] Heap On input, the current address of the heap. On output, the address of
97 the heap after the item is added.
98 @param[in] Data The data to add into the heap.
104 IN OUT UINT8 **Heap,
112 *Heap -= Len + 1;
114 CopyMem (*Heap, Data, Len);
115 *(*Heap + Len) = 0;
123 @param[in, out] Heap The heap. [all...] |
/frameworks/base/libs/hwui/hwui/ |
Bitmap.h | 31 Heap, 126 } heap; member in union:android::Bitmap::__anon40786
|
/device/linaro/bootloader/edk2/MdeModulePkg/Universal/Network/IScsiDxe/ |
IScsiIbft.c | 84 Add one item into the heap.
86 @param[in, out] Heap On input, the current address of the heap; On output, the address of
87 the heap after the item is added.
88 @param[in] Data The data to add into the heap.
93 IN OUT UINT8 **Heap,
101 *Heap -= Len + 1;
103 CopyMem (*Heap, Data, Len);
104 *(*Heap + Len) = 0;
111 @param[in, out] Heap The heap. [all...] |
/external/compiler-rt/lib/asan/tests/ |
asan_str_test.cc | 38 Heap, 81 // Check heap-allocated string 92 StrLenOOBTestTemplate(heap_string, length, OOBKind::Heap);
|
/external/deqp/external/vulkancts/modules/vulkan/memory/ |
vktMemoryAllocationTests.cpp | 122 log << TestLog::Message << "Single allocation size: " << (m_config.memorySize ? de::toString(*m_config.memorySize) : de::toString(100.0f * (*m_config.memoryPercentage)) + " percent of the heap size.") << TestLog::EndMessage; 145 m_result.fail("Invalid heap index defined for memory type."); 149 log << TestLog::Message << "Memory heap: " << memoryHeap << TestLog::EndMessage; 152 TCU_THROW(NotSupportedError, "Memory heap doesn't have enough memory."); 281 struct Heap 283 VkMemoryHeap heap; member in struct:vkt::memory::__anon16596::Heap 306 vector<Heap> m_heaps; 334 m_heaps[heapNdx].heap = memoryProperties.memoryHeaps[heapNdx]; 336 m_heaps[heapNdx].maxMemoryUsage = m_heaps[heapNdx].heap.size / 2; /* Use at maximum 50% of heap */ 362 const Heap& heap = m_heaps[heapNdx]; local [all...] |
/external/skia/src/gpu/vk/ |
GrVkGpu.h | 147 enum Heap { 150 // in the main heap. 166 GrVkHeap* getHeap(Heap heap) const { return fHeaps[heap].get(); }
|
/device/linaro/bootloader/edk2/MdeModulePkg/Universal/Network/Ip4Dxe/ |
Ip4Config2Impl.c | 322 CHAR8 *Heap;
341 Heap = (CHAR8 *) Variable + VarSize;
349 Heap -= DataItem->DataSize;
350 CopyMem (Heap, DataItem->Data.Ptr, DataItem->DataSize);
355 DataRecord->Offset = (UINT16) (Heap - (CHAR8 *) Variable);
[all...] |
/external/valgrind/exp-sgcheck/ |
pc_common.c | 139 } Heap; 184 xe.XE.Heap.addr = a; 185 xe.XE.Heap.sszB = is_write ? -size : size; 186 xe.XE.Heap.vseg = vseg; 352 Addr a = xe->XE.Heap.addr; 353 Seg* vseg = xe->XE.Heap.vseg; 363 readwrite(xe->XE.Heap.sszB), 364 Word__abs(xe->XE.Heap.sszB) ); 373 readwrite(xe->XE.Heap.sszB), 374 Word__abs(xe->XE.Heap.sszB) ) [all...] |
/device/linaro/bootloader/edk2/NetworkPkg/Ip6Dxe/ |
Ip6ConfigImpl.c | 452 CHAR8 *Heap;
472 Heap = (CHAR8 *) Variable + VarSize;
480 Heap -= DataItem->DataSize;
481 CopyMem (Heap, DataItem->Data.Ptr, DataItem->DataSize);
486 DataRecord->Offset = (UINT16) (Heap - (CHAR8 *) Variable);
[all...] |
/external/opencv/cv/src/ |
cvinpaint.cpp | 207 //HEAP::iterator Heap_Iterator; 208 //HEAP Heap; 237 icvCalcFMM(const CvMat *f, CvMat *t, CvPriorityQueueFloat *Heap, bool negate) { 241 while (Heap->Pop(&ii,&jj)) { 261 Heap->Push(i,j,dist); 280 icvTeleaInpaintFMM(const CvMat *f, CvMat *t, CvMat *out, int range, CvPriorityQueueFloat *Heap ) { 286 while (Heap->Pop(&ii,&jj)) { 392 Heap->Push(i,j,dist); 399 while (Heap->Pop(&ii,&jj)) [all...] |
/external/guava/guava/src/com/google/common/collect/ |
MinMaxPriorityQueue.java | 63 * <a href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> 65 * it stores elements in a single array, as compact as the traditional heap data 220 private final Heap minHeap; 221 private final Heap maxHeap; 229 this.minHeap = new Heap(ordering); 230 this.maxHeap = new Heap(ordering.reverse()); 278 // Adds the element to the end of the heap and bubbles it up to the correct 372 * <p>Occasionally, in order to maintain the heap invariant, it must swap a 375 * first one is the element that was previously at the end of the heap and is 411 Heap heap = heapForIndex(index) local 539 Heap heap; local [all...] |
/art/runtime/gc/ |
heap.cc | 17 #include "heap.h" 68 #include "heap-inl.h" 69 #include "heap-visit-objects-inl.h" 130 // For deterministic compilation, we need the heap to be at a well-known address. 147 reinterpret_cast<uint8_t*>(300 * MB - Heap::kDefaultNonMovingSpaceCapacity); 162 Heap::Heap(size_t initial_size, 239 * causes a lot of GC since we do a GC for alloc whenever the stack is full. When heap 285 if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) { 286 LOG(INFO) << "Heap() entering" 3569 gc::Heap* heap = Runtime::Current()->GetHeap(); variable 3627 gc::Heap* heap = Runtime::Current()->GetHeap(); variable 3669 gc::Heap* heap = Runtime::Current()->GetHeap(); variable [all...] |
heap.h | 123 class Heap { 153 // How often we allow heap trimming to happen (nanoseconds). 158 // Create a heap with the requested sizes. The possible empty 161 Heap(size_t initial_size, 193 ~Heap(); 250 // Visit all of the live objects in the heap. 277 // The given reference is believed to be to an object in the Java heap, check the soundness of it. 290 // A weaker test than IsLiveObject or VerifyObject that doesn't require the heap lock, 300 // Returns true if 'obj' is a live heap object, false otherwise (including for invalid addresses). 301 // Requires the heap lock to be held [all...] |
/external/v8/src/heap/ |
heap.h | 11 // Clients of this interface shouldn't depend on lots of heap internals. 12 // Do not include anything from src/heap here! 19 #include "src/heap-symbols.h" 28 // Defines all the roots in Heap. 254 // Heap roots that are known to be immortal immovable, for which we can safely 398 explicit PromotionQueue(Heap* heap) 403 heap_(heap) {} 440 Heap* heap_; 529 class Heap { [all...] |
heap.cc | 5 #include "src/heap/heap.h" 23 #include "src/heap/array-buffer-tracker-inl.h" 24 #include "src/heap/code-stats.h" 25 #include "src/heap/embedder-tracing.h" 26 #include "src/heap/gc-idle-time-handler.h" 27 #include "src/heap/gc-tracer.h" 28 #include "src/heap/incremental-marking.h" 29 #include "src/heap/mark-compact-inl.h" 30 #include "src/heap/mark-compact.h [all...] |
/prebuilts/gradle-plugin/com/android/tools/perflib/perflib/24.4.0-beta3/ |
perflib-24.4.0-beta3.jar | |
/prebuilts/gradle-plugin/com/android/tools/perflib/perflib/24.4.0-beta6/ |
perflib-24.4.0-beta6.jar | |
/prebuilts/gradle-plugin/com/android/tools/perflib/perflib/24.5.0/ |
perflib-24.5.0.jar | |