| /device/linaro/bootloader/arm-trusted-firmware/drivers/auth/mbedtls/ |
| mbedtls_common.c | 15 * mbed TLS heap
23 static unsigned char heap[MBEDTLS_HEAP_SIZE]; variable
33 /* Initialize the mbed TLS heap */
34 mbedtls_memory_buffer_alloc_init(heap, MBEDTLS_HEAP_SIZE);
|
| /external/compiler-rt/test/asan/TestCases/ |
| describe_address.cc | 9 int *heap = new int[100]; local
10 __asan_describe_address(heap);
17 delete[] heap;
|
| /external/compiler-rt/lib/tsan/tests/unit/ |
| tsan_shadow_test.cc | 52 void *heap = malloc(0); local
53 free(heap);
57 CHECK(IsAppMem((uptr)heap));
61 CHECK(IsShadowMem(MemToShadow((uptr)heap)));
|
| /external/libevent/test/ |
| regress_minheap.c | 44 check_heap(struct min_heap *heap)
47 for (i = 1; i < heap->n; ++i) {
49 tt_want(evutil_timercmp(&heap->p[i]->ev_timeout,
50 &heap->p[parent_idx]->ev_timeout, >=));
57 struct min_heap heap; local
62 min_heap_ctor_(&heap);
67 min_heap_push_(&heap, inserted[i]);
69 check_heap(&heap);
71 tt_assert(min_heap_size_(&heap) == 1024);
74 min_heap_erase_(&heap, inserted[i])
[all...] |
| /prebuilts/go/darwin-x86/src/container/heap/ |
| heap.go | 5 // Package heap provides heap operations for any type that implements
6 // heap.Interface. A heap is a tree with the property that each node is the
11 // A heap is a common way to implement a priority queue. To build a priority
12 // queue, implement the Heap interface with the (negative) priority as the
17 package heap package
21 // Any type that implements heap.Interface may be used as a
22 // min-heap with the following invariants (established after
27 // Note that Push and Pop in this interface are for package heap'
[all...] |
| heap_test.go | 5 package heap package
42 t.Errorf("heap invariant invalidated [%d] = %d > [%d] = %d", i, h[i], j1, h[j1])
49 t.Errorf("heap invariant invalidated [%d] = %d > [%d] = %d", i, h[i], j1, h[j2])
|
| /prebuilts/go/linux-x86/src/container/heap/ |
| heap.go | 5 // Package heap provides heap operations for any type that implements
6 // heap.Interface. A heap is a tree with the property that each node is the
11 // A heap is a common way to implement a priority queue. To build a priority
12 // queue, implement the Heap interface with the (negative) priority as the
17 package heap package
21 // Any type that implements heap.Interface may be used as a
22 // min-heap with the following invariants (established after
27 // Note that Push and Pop in this interface are for package heap'
[all...] |
| heap_test.go | 5 package heap package
42 t.Errorf("heap invariant invalidated [%d] = %d > [%d] = %d", i, h[i], j1, h[j1])
49 t.Errorf("heap invariant invalidated [%d] = %d > [%d] = %d", i, h[i], j1, h[j2])
|
| /cts/hostsidetests/security/securityPatch/CVE-2017-13253/ |
| poc.cpp | 56 sp<MemoryHeapBase> heap = new MemoryHeapBase(0x2000); local
57 memset(heap->getBase(), 'A', 0x2000);
58 sp<MemoryBase> sourceMemory = new MemoryBase(heap, 0, 0x2000);
59 sp<MemoryBase> destMemory = new MemoryBase(heap, 0x1fff, 1);
60 int heapSeqNum = crypto->setHeap(heap);
|
| /external/compiler-rt/test/asan/TestCases/Linux/ |
| swapcontext_test.cc | 80 char *heap = new char[kStackSize + 1]; local
81 ret += Run(argc - 1, 0, heap);
84 ret += Run(argc - 1, 1, heap);
88 delete [] heap;
|
| /external/deqp/framework/delibs/depool/ |
| dePoolHeap.c | 21 * \brief Memory pool heap class.
57 * \brief Test heap functionality.
62 TestHeap* heap = TestHeap_create(pool); local
65 TestHeap_push(heap, HeapItem_create(10, 10));
66 TestHeap_push(heap, HeapItem_create(0, 10));
67 TestHeap_push(heap, HeapItem_create(20, 10));
68 DE_TEST_ASSERT(TestHeap_getNumElements(heap) == 3);
70 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 0);
71 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 10);
72 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 20)
[all...] |
| /external/icu/icu4c/source/i18n/ |
| number_stringbuilder.h | 31 } heap; member in union:number::impl::NumberStringBuilder::ValueOrHeapArray
104 return fUsingHeap ? fChars.heap.ptr : fChars.value;
108 return fUsingHeap ? fChars.heap.ptr : fChars.value;
112 return fUsingHeap ? fFields.heap.ptr : fFields.value;
116 return fUsingHeap ? fFields.heap.ptr : fFields.value;
120 return fUsingHeap ? fChars.heap.capacity : DEFAULT_CAPACITY;
|
| /external/libdrm/intel/ |
| mm.c | 36 drm_private void mmDumpMemInfo(const struct mem_block *heap)
38 drmMsg("Memory heap %p:\n", (void *)heap);
39 if (heap == 0) {
40 drmMsg(" heap == 0\n");
44 for (p = heap->next; p != heap; p = p->next) {
52 for (p = heap->next_free; p != heap; p = p->next_free) {
64 struct mem_block *heap, *block local
[all...] |
| mm.h | 41 struct mem_block *heap; member in struct:mem_block
49 * return: a heap pointer if OK, NULL if error
60 * startSearch = linear offset from start of heap to begin search
63 drm_private extern struct mem_block *mmAllocMem(struct mem_block *heap,
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_mm.h | 40 struct mem_block *heap; member in struct:mem_block
50 * return: a heap pointer if OK, NULL if error
61 * startSearch = linear offset from start of heap to begin search
64 extern struct mem_block *u_mmAllocMem(struct mem_block *heap, int size, int align2,
76 * input: pointer to a heap, start offset
79 extern struct mem_block *u_mmFindBlock(struct mem_block *heap, int start);
|
| /external/mesa3d/src/mesa/main/ |
| mm.h | 38 struct mem_block *heap; member in struct:mem_block
49 * return: a heap pointer if OK, NULL if error
60 * startSearch = linear offset from start of heap to begin search
63 extern struct mem_block *mmAllocMem(struct mem_block *heap, unsigned size,
75 * input: pointer to a heap, start offset
78 extern struct mem_block *mmFindBlock(struct mem_block *heap, unsigned start);
|
| /external/v8/src/heap/ |
| incremental-marking-job.cc | 5 #include "src/heap/incremental-marking-job.h"
8 #include "src/heap/heap-inl.h"
9 #include "src/heap/heap.h"
10 #include "src/heap/incremental-marking.h"
17 void IncrementalMarkingJob::Start(Heap* heap) {
18 DCHECK(!heap->incremental_marking()->IsStopped());
19 ScheduleTask(heap);
45 Heap* heap = isolate()->heap(); local
[all...] |
| scavenger.h | 8 #include "src/heap/objects-visiting.h"
9 #include "src/heap/slot-set.h"
19 explicit Scavenger(Heap* heap) : heap_(heap) {}
24 // Callback function passed to Heap::Iterate etc. Copies an object if
26 // ensure the precondition that the object is (a) a heap object and (b) in
27 // the heap's from space.
29 static inline SlotCallbackResult CheckAndScavengeObject(Heap* heap,
40 Heap* heap() { return heap_; } function in class:v8::internal::Scavenger
[all...] |
| /external/v8/src/ |
| objects-body-descriptors.h | 43 static inline void IteratePointers(Heap* heap, HeapObject* obj,
51 static inline void IteratePointer(Heap* heap, HeapObject* obj, int offset);
64 static inline void IterateBodyImpl(Heap* heap, HeapObject* obj,
96 Heap* heap = obj->GetHeap(); local
97 IterateBodyImpl<StaticVisitor>(heap, obj, start_offset, end_offset);
128 Heap* heap = obj->GetHeap() local
[all...] |
| /prebuilts/go/darwin-x86/test/bench/garbage/ |
| tree2.go | 26 heapsize = flag.Int64("heapsize", 100*1024*1024, "size of the heap in bytes")
31 heap *Object
39 heap, _ = buildTree(float64(objsize), float64(*heapsize), 0)
40 fmt.Printf("*** built heap: %.0f MB; (%d objects * %d bytes)\n",
30 heap *Object var
|
| /prebuilts/go/linux-x86/test/bench/garbage/ |
| tree2.go | 26 heapsize = flag.Int64("heapsize", 100*1024*1024, "size of the heap in bytes")
31 heap *Object
39 heap, _ = buildTree(float64(objsize), float64(*heapsize), 0)
40 fmt.Printf("*** built heap: %.0f MB; (%d objects * %d bytes)\n",
30 heap *Object var
|
| /packages/apps/SettingsIntelligence/src/com/android/settings/intelligence/search/ |
| SearchResultAggregator.java | 97 // Merge the rest into result list: add everything to heap then pop them out one by one.
98 final PriorityQueue<SearchResult> heap = new PriorityQueue<>(); local
100 heap.addAll(taskResult);
102 while (!heap.isEmpty()) {
103 searchResults.add(heap.poll());
|
| /art/runtime/gc/ |
| heap_test.cc | 35 // Reserve the preferred address to force the heap to use another one for testing.
37 gc::Heap::kPreferredAllocSpaceBegin,
52 Heap* heap = Runtime::Current()->GetHeap(); local
53 int64_t max_memory_before = heap->GetMaxMemory();
54 int64_t total_memory_before = heap->GetTotalMemory();
55 heap->ClearGrowthLimit();
56 int64_t max_memory_after = heap->GetMaxMemory();
57 int64_t total_memory_after = heap->GetTotalMemory();
107 // Exercise Heap::PreZygoteFork() to check it does not crash
[all...] |
| /art/runtime/mirror/ |
| array.cc | 135 auto* heap = Runtime::Current()->GetHeap(); local
136 gc::AllocatorType allocator_type = heap->IsMovableObject(this) ? heap->GetCurrentAllocator() :
137 heap->GetCurrentNonMovingAllocator();
|
| /art/runtime/ |
| read_barrier-inl.h | 25 #include "gc/heap.h"
79 // The heap or the collector can be null at startup. TODO: avoid the need for this null check.
80 gc::Heap* heap = Runtime::Current()->GetHeap(); local
81 if (heap != nullptr && heap->GetReadBarrierTable()->IsSet(old_ref)) {
208 gc::Heap* heap = Runtime::Current()->GetHeap(); local
209 if (heap == nullptr) {
210 // During startup, the heap can be null
[all...] |
