Searched refs:heap (Results 1 – 11 of 11) sorted by relevance
| /mbedtls-latest/library/ |
| D | memory_buffer_alloc.c | 68 static buffer_alloc_ctx heap; variable
95 memory_header *cur = heap.first; in debug_chain()
104 cur = heap.first_free; in debug_chain()
155 memory_header *prv = heap.first, *cur; in verify_chain()
165 if (heap.first->prev != NULL) { in verify_chain()
173 cur = heap.first->next; in verify_chain()
201 memory_header *new, *cur = heap.first_free; in buffer_alloc_calloc()
210 if (heap.buf == NULL || heap.first == NULL) { in buffer_alloc_calloc()
250 heap.alloc_count++; in buffer_alloc_calloc()
264 heap.first_free = cur->next_free; in buffer_alloc_calloc()
[all …]
|
| /mbedtls-latest/scripts/ |
| D | massif_max.pl | 24 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);
|
| /mbedtls-latest/docs/architecture/ |
| D | psa-keystore-design.md | 69 …s, of size `MBEDTLS_PSA_KEY_SLOT_COUNT`. Key material is allocated on the heap. This is the histor…
70 …KEY_SLOT_BUFFER_SIZE` bytes. This is intended for very constrained devices that do not have a heap.
71 …d as multiple slices on the heap, with a size that adjusts to the application's usage. Key materia…
79 …e decision, where only keys larger than some threshold require the use of heap memory. The reasons…
88 …s. The index of a slice is the index in that array. The slices are allocated on the heap as needed.
98 … the hybrid key store, the slot contains a pointer to the key data, which is allocated on the heap.
|
| D | alternative-implementations.md | 54 … a language with automatic memory management that can move objects on the heap.) That is, call seq…
|
| D | psa-shared-memory.md | 134 … 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:
|
| /mbedtls-latest/tests/suites/ |
| D | test_suite_memory_buffer_alloc.data | 19 Memory buffer: heap too small (header verification should fail)
|
| D | test_suite_asn1write.function | 287 * a small-heap environment. The boundary is somewhat arbitrary. */
|
| D | test_suite_psa_crypto.function | 1658 * accommodate large keys due to heap size constraints */
|
| /mbedtls-latest/ |
| D | ChangeLog | 429 * Use heap memory to allocate DER encoded public/private key.
471 the buffer, causing a heap buffer overflow.
661 * Fix a remotely exploitable heap buffer overflow in TLS handshake parsing.
756 * Use heap memory to allocate DER encoded RSA private key.
875 * Fix a potential heap buffer overread in TLS 1.3 client-side when
1093 * Fix potential heap buffer overread and overwrite in DTLS if
1320 could thus potentially leak the key through freed heap.
1327 * Fix a potential heap buffer overread in TLS 1.2 server-side when
1455 temporary variable on the heap. Suggested by Sergey Kanatov in #5304.
3774 * Fix a 1-byte heap buffer overflow (read-only) during private key parsing.
[all …]
|
| /mbedtls-latest/3rdparty/p256-m/p256-m/ |
| D | README.md | 151 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
|
| /mbedtls-latest/docs/ |
| D | psa-transition.md | 100 Note that a key consumes a key store entry, which is distinct from heap memory, until it is destroy…
|
