Home
last modified time | relevance | path

Searched refs:heap (Results 1 – 15 of 15) sorted by relevance

/lib/mbedtls/external/mbedtls/library/
A Dmemory_buffer_alloc.c210 if (heap.buf == NULL || heap.first == NULL) { in buffer_alloc_calloc()
276 if (heap.total_used > heap.maximum_used) { in buffer_alloc_calloc()
277 heap.maximum_used = heap.total_used; in buffer_alloc_calloc()
340 if (heap.total_used > heap.maximum_used) { in buffer_alloc_calloc()
341 heap.maximum_used = heap.total_used; in buffer_alloc_calloc()
369 if (p < heap.buf || p >= heap.buf + heap.len) { in buffer_alloc_free()
593 heap.first_free = heap.first; in mbedtls_memory_buffer_alloc_init()
624 heap.first != heap.first_free || in check_all_free()
625 (void *) heap.first != (void *) heap.buf) { in check_all_free()
669 end = heap.buf + heap.len; in mbedtls_memory_buffer_alloc_self_test()
[all …]
/lib/bzip2/
A Dbzlib_huffman.c76 zz = z; tmp = heap[zz]; \
77 while (weight[tmp] < weight[heap[zz >> 1]]) { \
78 heap[zz] = heap[zz >> 1]; \
92 weight[heap[yy+1]] < weight[heap[yy]]) \
95 heap[zz] = heap[yy]; \
114 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; in BZ2_hbMakeCodeLengths() local
126 heap[0] = 0; in BZ2_hbMakeCodeLengths()
133 heap[nHeap] = i; in BZ2_hbMakeCodeLengths()
140 n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1); in BZ2_hbMakeCodeLengths()
141 n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1); in BZ2_hbMakeCodeLengths()
[all …]
/lib/mbedtls/external/mbedtls/scripts/
A Dmassif_max.pl24 my ($heap, $heap_extra, $stack) = m{
29 next unless defined $heap;
30 my $total = $heap + $heap_extra + $stack;
32 ($max, $max_heap, $max_he, $max_stack) = ($total, $heap, $heap_extra, $stack);
/lib/zlib/
A Dtrees.c439 top = s->heap[SMALLEST]; \
440 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
463 int v = s->heap[k];
468 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
475 s->heap[k] = s->heap[j]; k = j;
480 s->heap[k] = v;
518 n = s->heap[h];
559 m = s->heap[--h];
676 s->heap[--(s->heap_max)] = m;
690 s->heap[SMALLEST] = node++;
[all …]
A Ddeflate.h202 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member
/lib/mbedtls/external/mbedtls/tests/suites/
A Dtest_suite_memory_buffer_alloc.data19 Memory buffer: heap too small (header verification should fail)
A Dtest_suite_asn1write.function287 * a small-heap environment. The boundary is somewhat arbitrary. */
A Dtest_suite_psa_crypto.function1678 * accommodate large keys due to heap size constraints */
/lib/lwip/lwip/
A DUPGRADING33 source heap/pool/etc.). As a consequence, applications can't test pbuf->type any more.
232 * DNS_LOCAL_HOSTLIST_IS_DYNAMIC uses a memp pool instead of the heap, so
235 * Snmp-agent uses a memp pools instead of the heap, so MEMP_NUM_SNMP_* have
238 * PPPoE uses a MEMP pool instead of the heap, so MEMP_NUM_PPPOE_INTERFACES
249 * The heap now may be moved to user-defined memory by defining
A DCHANGELOG1632 instead of the heap (moved struct pppoe_softc from ppp_oe.c to ppp_oe.h)
1636 MEMP pool instead of the heap
1795 * snmp: Use memp pools for snmp instead of the heap; added 4 new pools.
1802 * mem.c: The heap now may be moved to user-defined memory by defining
2773 or heap memory from interrupt context
3153 heap. This both prevents memory fragmentation and gives a higher speed
3738 for the heap. This fixes bug #19167.
4533 allocating memory from a shared heap, memory for objects that are
4536 heap is still present but is used less frequently.
/lib/mbedtls/external/mbedtls/
A DChangeLog234 * Use heap memory to allocate DER encoded public/private key.
276 the buffer, causing a heap buffer overflow.
561 * Use heap memory to allocate DER encoded RSA private key.
898 * Fix potential heap buffer overread and overwrite in DTLS if
1125 could thus potentially leak the key through freed heap.
4196 * Fix potential heap corruption on Windows when
4569 speed and RAM (heap only for now) usage.
5500 * Fixed potential heap corruption in x509_name allocation
5526 * Potential heap buffer overflow on large hostname setting
5587 * Fixed potential heap corruption in x509_name allocation
[all …]
/lib/mbedtls/external/mbedtls/docs/architecture/
A Dalternative-implementations.md54 … a language with automatic memory management that can move objects on the heap.) That is, call seq…
A Dpsa-shared-memory.md134 … be copied into or out of a buffer in memory owned by the crypto service (heap or stack). This add…
525 Given that the majority of functions will be allocating memory on the heap to copy, it is helpful t…
527 In order to keep track of allocated copies on the heap, we can create new structs:
/lib/mbedtls/external/mbedtls/3rdparty/p256-m/p256-m/
A DREADME.md151 p256-m doesn't use any dynamic memory (on the heap), only the stack. Here's
216 TinyCrypto also uses no heap, only the stack. Here's the RAM used by each
/lib/mbedtls/external/mbedtls/docs/
A Dpsa-transition.md100 Note that a key consumes a key store entry, which is distinct from heap memory, until it is destroy…

Completed in 60 milliseconds