Kev Mann / mbed-dev-OS5_10_4

Important changes to repositories hosted on mbed.com

Mbed hosted mercurial repositories are deprecated and are due to be permanently deleted in July 2026.

To keep a copy of this software download the repository Zip archive or clone locally using Mercurial.

It is also possible to export all your personal repositories from the account settings page.

features/mbedtls/src/memory_buffer_alloc.c@2:7aab896b1a3b, 2019-03-13 (annotated)

Committer:
kevman
Date:
Wed Mar 13 11:03:24 2019 +0000
Revision:
2:7aab896b1a3b
Parent:
0:38ceb79fef03 
2019-03-13

Who changed what in which revision?

UserRevisionLine numberNew contents of line
kevman 0:38ceb79fef03 1 /*
kevman 0:38ceb79fef03 2 * Buffer-based memory allocator
kevman 0:38ceb79fef03 3 *
kevman 0:38ceb79fef03 4 * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved
kevman 0:38ceb79fef03 5 * SPDX-License-Identifier: Apache-2.0
kevman 0:38ceb79fef03 6 *
kevman 0:38ceb79fef03 7 * Licensed under the Apache License, Version 2.0 (the "License"); you may
kevman 0:38ceb79fef03 8 * not use this file except in compliance with the License.
kevman 0:38ceb79fef03 9 * You may obtain a copy of the License at
kevman 0:38ceb79fef03 10 *
kevman 0:38ceb79fef03 11 * http://www.apache.org/licenses/LICENSE-2.0
kevman 0:38ceb79fef03 12 *
kevman 0:38ceb79fef03 13 * Unless required by applicable law or agreed to in writing, software
kevman 0:38ceb79fef03 14 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
kevman 0:38ceb79fef03 15 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
kevman 0:38ceb79fef03 16 * See the License for the specific language governing permissions and
kevman 0:38ceb79fef03 17 * limitations under the License.
kevman 0:38ceb79fef03 18 *
kevman 0:38ceb79fef03 19 * This file is part of mbed TLS (https://tls.mbed.org)
kevman 0:38ceb79fef03 20 */
kevman 0:38ceb79fef03 21
kevman 0:38ceb79fef03 22 #if !defined(MBEDTLS_CONFIG_FILE)
kevman 0:38ceb79fef03 23 #include "mbedtls/config.h"
kevman 0:38ceb79fef03 24 #else
kevman 0:38ceb79fef03 25 #include MBEDTLS_CONFIG_FILE
kevman 0:38ceb79fef03 26 #endif
kevman 0:38ceb79fef03 27
kevman 0:38ceb79fef03 28 #if defined(MBEDTLS_MEMORY_BUFFER_ALLOC_C)
kevman 0:38ceb79fef03 29 #include "mbedtls/memory_buffer_alloc.h"
kevman 0:38ceb79fef03 30
kevman 0:38ceb79fef03 31 /* No need for the header guard as MBEDTLS_MEMORY_BUFFER_ALLOC_C
kevman 0:38ceb79fef03 32 is dependent upon MBEDTLS_PLATFORM_C */
kevman 0:38ceb79fef03 33 #include "mbedtls/platform.h"
kevman 0:38ceb79fef03 34 #include "mbedtls/platform_util.h"
kevman 0:38ceb79fef03 35
kevman 0:38ceb79fef03 36 #include <string.h>
kevman 0:38ceb79fef03 37
kevman 0:38ceb79fef03 38 #if defined(MBEDTLS_MEMORY_BACKTRACE)
kevman 0:38ceb79fef03 39 #include <execinfo.h>
kevman 0:38ceb79fef03 40 #endif
kevman 0:38ceb79fef03 41
kevman 0:38ceb79fef03 42 #if defined(MBEDTLS_THREADING_C)
kevman 0:38ceb79fef03 43 #include "mbedtls/threading.h"
kevman 0:38ceb79fef03 44 #endif
kevman 0:38ceb79fef03 45
kevman 0:38ceb79fef03 46 #define MAGIC1 0xFF00AA55
kevman 0:38ceb79fef03 47 #define MAGIC2 0xEE119966
kevman 0:38ceb79fef03 48 #define MAX_BT 20
kevman 0:38ceb79fef03 49
kevman 0:38ceb79fef03 50 typedef struct _memory_header memory_header;
kevman 0:38ceb79fef03 51 struct _memory_header
kevman 0:38ceb79fef03 52 {
kevman 0:38ceb79fef03 53 size_t magic1;
kevman 0:38ceb79fef03 54 size_t size;
kevman 0:38ceb79fef03 55 size_t alloc;
kevman 0:38ceb79fef03 56 memory_header *prev;
kevman 0:38ceb79fef03 57 memory_header *next;
kevman 0:38ceb79fef03 58 memory_header *prev_free;
kevman 0:38ceb79fef03 59 memory_header *next_free;
kevman 0:38ceb79fef03 60 #if defined(MBEDTLS_MEMORY_BACKTRACE)
kevman 0:38ceb79fef03 61 char **trace;
kevman 0:38ceb79fef03 62 size_t trace_count;
kevman 0:38ceb79fef03 63 #endif
kevman 0:38ceb79fef03 64 size_t magic2;
kevman 0:38ceb79fef03 65 };
kevman 0:38ceb79fef03 66
kevman 0:38ceb79fef03 67 typedef struct
kevman 0:38ceb79fef03 68 {
kevman 0:38ceb79fef03 69 unsigned char *buf;
kevman 0:38ceb79fef03 70 size_t len;
kevman 0:38ceb79fef03 71 memory_header *first;
kevman 0:38ceb79fef03 72 memory_header *first_free;
kevman 0:38ceb79fef03 73 int verify;
kevman 0:38ceb79fef03 74 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 75 size_t alloc_count;
kevman 0:38ceb79fef03 76 size_t free_count;
kevman 0:38ceb79fef03 77 size_t total_used;
kevman 0:38ceb79fef03 78 size_t maximum_used;
kevman 0:38ceb79fef03 79 size_t header_count;
kevman 0:38ceb79fef03 80 size_t maximum_header_count;
kevman 0:38ceb79fef03 81 #endif
kevman 0:38ceb79fef03 82 #if defined(MBEDTLS_THREADING_C)
kevman 0:38ceb79fef03 83 mbedtls_threading_mutex_t mutex;
kevman 0:38ceb79fef03 84 #endif
kevman 0:38ceb79fef03 85 }
kevman 0:38ceb79fef03 86 buffer_alloc_ctx;
kevman 0:38ceb79fef03 87
kevman 0:38ceb79fef03 88 static buffer_alloc_ctx heap;
kevman 0:38ceb79fef03 89
kevman 0:38ceb79fef03 90 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 91 static void debug_header( memory_header *hdr )
kevman 0:38ceb79fef03 92 {
kevman 0:38ceb79fef03 93 #if defined(MBEDTLS_MEMORY_BACKTRACE)
kevman 0:38ceb79fef03 94 size_t i;
kevman 0:38ceb79fef03 95 #endif
kevman 0:38ceb79fef03 96
kevman 0:38ceb79fef03 97 mbedtls_fprintf( stderr, "HDR: PTR(%10zu), PREV(%10zu), NEXT(%10zu), "
kevman 0:38ceb79fef03 98 "ALLOC(%zu), SIZE(%10zu)\n",
kevman 0:38ceb79fef03 99 (size_t) hdr, (size_t) hdr->prev, (size_t) hdr->next,
kevman 0:38ceb79fef03 100 hdr->alloc, hdr->size );
kevman 0:38ceb79fef03 101 mbedtls_fprintf( stderr, " FPREV(%10zu), FNEXT(%10zu)\n",
kevman 0:38ceb79fef03 102 (size_t) hdr->prev_free, (size_t) hdr->next_free );
kevman 0:38ceb79fef03 103
kevman 0:38ceb79fef03 104 #if defined(MBEDTLS_MEMORY_BACKTRACE)
kevman 0:38ceb79fef03 105 mbedtls_fprintf( stderr, "TRACE: \n" );
kevman 0:38ceb79fef03 106 for( i = 0; i < hdr->trace_count; i++ )
kevman 0:38ceb79fef03 107 mbedtls_fprintf( stderr, "%s\n", hdr->trace[i] );
kevman 0:38ceb79fef03 108 mbedtls_fprintf( stderr, "\n" );
kevman 0:38ceb79fef03 109 #endif
kevman 0:38ceb79fef03 110 }
kevman 0:38ceb79fef03 111
kevman 0:38ceb79fef03 112 static void debug_chain( void )
kevman 0:38ceb79fef03 113 {
kevman 0:38ceb79fef03 114 memory_header *cur = heap.first;
kevman 0:38ceb79fef03 115
kevman 0:38ceb79fef03 116 mbedtls_fprintf( stderr, "\nBlock list\n" );
kevman 0:38ceb79fef03 117 while( cur != NULL )
kevman 0:38ceb79fef03 118 {
kevman 0:38ceb79fef03 119 debug_header( cur );
kevman 0:38ceb79fef03 120 cur = cur->next;
kevman 0:38ceb79fef03 121 }
kevman 0:38ceb79fef03 122
kevman 0:38ceb79fef03 123 mbedtls_fprintf( stderr, "Free list\n" );
kevman 0:38ceb79fef03 124 cur = heap.first_free;
kevman 0:38ceb79fef03 125
kevman 0:38ceb79fef03 126 while( cur != NULL )
kevman 0:38ceb79fef03 127 {
kevman 0:38ceb79fef03 128 debug_header( cur );
kevman 0:38ceb79fef03 129 cur = cur->next_free;
kevman 0:38ceb79fef03 130 }
kevman 0:38ceb79fef03 131 }
kevman 0:38ceb79fef03 132 #endif /* MBEDTLS_MEMORY_DEBUG */
kevman 0:38ceb79fef03 133
kevman 0:38ceb79fef03 134 static int verify_header( memory_header *hdr )
kevman 0:38ceb79fef03 135 {
kevman 0:38ceb79fef03 136 if( hdr->magic1 != MAGIC1 )
kevman 0:38ceb79fef03 137 {
kevman 0:38ceb79fef03 138 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 139 mbedtls_fprintf( stderr, "FATAL: MAGIC1 mismatch\n" );
kevman 0:38ceb79fef03 140 #endif
kevman 0:38ceb79fef03 141 return( 1 );
kevman 0:38ceb79fef03 142 }
kevman 0:38ceb79fef03 143
kevman 0:38ceb79fef03 144 if( hdr->magic2 != MAGIC2 )
kevman 0:38ceb79fef03 145 {
kevman 0:38ceb79fef03 146 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 147 mbedtls_fprintf( stderr, "FATAL: MAGIC2 mismatch\n" );
kevman 0:38ceb79fef03 148 #endif
kevman 0:38ceb79fef03 149 return( 1 );
kevman 0:38ceb79fef03 150 }
kevman 0:38ceb79fef03 151
kevman 0:38ceb79fef03 152 if( hdr->alloc > 1 )
kevman 0:38ceb79fef03 153 {
kevman 0:38ceb79fef03 154 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 155 mbedtls_fprintf( stderr, "FATAL: alloc has illegal value\n" );
kevman 0:38ceb79fef03 156 #endif
kevman 0:38ceb79fef03 157 return( 1 );
kevman 0:38ceb79fef03 158 }
kevman 0:38ceb79fef03 159
kevman 0:38ceb79fef03 160 if( hdr->prev != NULL && hdr->prev == hdr->next )
kevman 0:38ceb79fef03 161 {
kevman 0:38ceb79fef03 162 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 163 mbedtls_fprintf( stderr, "FATAL: prev == next\n" );
kevman 0:38ceb79fef03 164 #endif
kevman 0:38ceb79fef03 165 return( 1 );
kevman 0:38ceb79fef03 166 }
kevman 0:38ceb79fef03 167
kevman 0:38ceb79fef03 168 if( hdr->prev_free != NULL && hdr->prev_free == hdr->next_free )
kevman 0:38ceb79fef03 169 {
kevman 0:38ceb79fef03 170 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 171 mbedtls_fprintf( stderr, "FATAL: prev_free == next_free\n" );
kevman 0:38ceb79fef03 172 #endif
kevman 0:38ceb79fef03 173 return( 1 );
kevman 0:38ceb79fef03 174 }
kevman 0:38ceb79fef03 175
kevman 0:38ceb79fef03 176 return( 0 );
kevman 0:38ceb79fef03 177 }
kevman 0:38ceb79fef03 178
kevman 0:38ceb79fef03 179 static int verify_chain( void )
kevman 0:38ceb79fef03 180 {
kevman 0:38ceb79fef03 181 memory_header *prv = heap.first, *cur;
kevman 0:38ceb79fef03 182
kevman 0:38ceb79fef03 183 if( prv == NULL || verify_header( prv ) != 0 )
kevman 0:38ceb79fef03 184 {
kevman 0:38ceb79fef03 185 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 186 mbedtls_fprintf( stderr, "FATAL: verification of first header "
kevman 0:38ceb79fef03 187 "failed\n" );
kevman 0:38ceb79fef03 188 #endif
kevman 0:38ceb79fef03 189 return( 1 );
kevman 0:38ceb79fef03 190 }
kevman 0:38ceb79fef03 191
kevman 0:38ceb79fef03 192 if( heap.first->prev != NULL )
kevman 0:38ceb79fef03 193 {
kevman 0:38ceb79fef03 194 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 195 mbedtls_fprintf( stderr, "FATAL: verification failed: "
kevman 0:38ceb79fef03 196 "first->prev != NULL\n" );
kevman 0:38ceb79fef03 197 #endif
kevman 0:38ceb79fef03 198 return( 1 );
kevman 0:38ceb79fef03 199 }
kevman 0:38ceb79fef03 200
kevman 0:38ceb79fef03 201 cur = heap.first->next;
kevman 0:38ceb79fef03 202
kevman 0:38ceb79fef03 203 while( cur != NULL )
kevman 0:38ceb79fef03 204 {
kevman 0:38ceb79fef03 205 if( verify_header( cur ) != 0 )
kevman 0:38ceb79fef03 206 {
kevman 0:38ceb79fef03 207 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 208 mbedtls_fprintf( stderr, "FATAL: verification of header "
kevman 0:38ceb79fef03 209 "failed\n" );
kevman 0:38ceb79fef03 210 #endif
kevman 0:38ceb79fef03 211 return( 1 );
kevman 0:38ceb79fef03 212 }
kevman 0:38ceb79fef03 213
kevman 0:38ceb79fef03 214 if( cur->prev != prv )
kevman 0:38ceb79fef03 215 {
kevman 0:38ceb79fef03 216 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 217 mbedtls_fprintf( stderr, "FATAL: verification failed: "
kevman 0:38ceb79fef03 218 "cur->prev != prv\n" );
kevman 0:38ceb79fef03 219 #endif
kevman 0:38ceb79fef03 220 return( 1 );
kevman 0:38ceb79fef03 221 }
kevman 0:38ceb79fef03 222
kevman 0:38ceb79fef03 223 prv = cur;
kevman 0:38ceb79fef03 224 cur = cur->next;
kevman 0:38ceb79fef03 225 }
kevman 0:38ceb79fef03 226
kevman 0:38ceb79fef03 227 return( 0 );
kevman 0:38ceb79fef03 228 }
kevman 0:38ceb79fef03 229
kevman 0:38ceb79fef03 230 static void *buffer_alloc_calloc( size_t n, size_t size )
kevman 0:38ceb79fef03 231 {
kevman 0:38ceb79fef03 232 memory_header *new, *cur = heap.first_free;
kevman 0:38ceb79fef03 233 unsigned char *p;
kevman 0:38ceb79fef03 234 void *ret;
kevman 0:38ceb79fef03 235 size_t original_len, len;
kevman 0:38ceb79fef03 236 #if defined(MBEDTLS_MEMORY_BACKTRACE)
kevman 0:38ceb79fef03 237 void *trace_buffer[MAX_BT];
kevman 0:38ceb79fef03 238 size_t trace_cnt;
kevman 0:38ceb79fef03 239 #endif
kevman 0:38ceb79fef03 240
kevman 0:38ceb79fef03 241 if( heap.buf == NULL || heap.first == NULL )
kevman 0:38ceb79fef03 242 return( NULL );
kevman 0:38ceb79fef03 243
kevman 0:38ceb79fef03 244 original_len = len = n * size;
kevman 0:38ceb79fef03 245
kevman 0:38ceb79fef03 246 if( n == 0 || size == 0 || len / n != size )
kevman 0:38ceb79fef03 247 return( NULL );
kevman 0:38ceb79fef03 248 else if( len > (size_t)-MBEDTLS_MEMORY_ALIGN_MULTIPLE )
kevman 0:38ceb79fef03 249 return( NULL );
kevman 0:38ceb79fef03 250
kevman 0:38ceb79fef03 251 if( len % MBEDTLS_MEMORY_ALIGN_MULTIPLE )
kevman 0:38ceb79fef03 252 {
kevman 0:38ceb79fef03 253 len -= len % MBEDTLS_MEMORY_ALIGN_MULTIPLE;
kevman 0:38ceb79fef03 254 len += MBEDTLS_MEMORY_ALIGN_MULTIPLE;
kevman 0:38ceb79fef03 255 }
kevman 0:38ceb79fef03 256
kevman 0:38ceb79fef03 257 // Find block that fits
kevman 0:38ceb79fef03 258 //
kevman 0:38ceb79fef03 259 while( cur != NULL )
kevman 0:38ceb79fef03 260 {
kevman 0:38ceb79fef03 261 if( cur->size >= len )
kevman 0:38ceb79fef03 262 break;
kevman 0:38ceb79fef03 263
kevman 0:38ceb79fef03 264 cur = cur->next_free;
kevman 0:38ceb79fef03 265 }
kevman 0:38ceb79fef03 266
kevman 0:38ceb79fef03 267 if( cur == NULL )
kevman 0:38ceb79fef03 268 return( NULL );
kevman 0:38ceb79fef03 269
kevman 0:38ceb79fef03 270 if( cur->alloc != 0 )
kevman 0:38ceb79fef03 271 {
kevman 0:38ceb79fef03 272 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 273 mbedtls_fprintf( stderr, "FATAL: block in free_list but allocated "
kevman 0:38ceb79fef03 274 "data\n" );
kevman 0:38ceb79fef03 275 #endif
kevman 0:38ceb79fef03 276 mbedtls_exit( 1 );
kevman 0:38ceb79fef03 277 }
kevman 0:38ceb79fef03 278
kevman 0:38ceb79fef03 279 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 280 heap.alloc_count++;
kevman 0:38ceb79fef03 281 #endif
kevman 0:38ceb79fef03 282
kevman 0:38ceb79fef03 283 // Found location, split block if > memory_header + 4 room left
kevman 0:38ceb79fef03 284 //
kevman 0:38ceb79fef03 285 if( cur->size - len < sizeof(memory_header) +
kevman 0:38ceb79fef03 286 MBEDTLS_MEMORY_ALIGN_MULTIPLE )
kevman 0:38ceb79fef03 287 {
kevman 0:38ceb79fef03 288 cur->alloc = 1;
kevman 0:38ceb79fef03 289
kevman 0:38ceb79fef03 290 // Remove from free_list
kevman 0:38ceb79fef03 291 //
kevman 0:38ceb79fef03 292 if( cur->prev_free != NULL )
kevman 0:38ceb79fef03 293 cur->prev_free->next_free = cur->next_free;
kevman 0:38ceb79fef03 294 else
kevman 0:38ceb79fef03 295 heap.first_free = cur->next_free;
kevman 0:38ceb79fef03 296
kevman 0:38ceb79fef03 297 if( cur->next_free != NULL )
kevman 0:38ceb79fef03 298 cur->next_free->prev_free = cur->prev_free;
kevman 0:38ceb79fef03 299
kevman 0:38ceb79fef03 300 cur->prev_free = NULL;
kevman 0:38ceb79fef03 301 cur->next_free = NULL;
kevman 0:38ceb79fef03 302
kevman 0:38ceb79fef03 303 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 304 heap.total_used += cur->size;
kevman 0:38ceb79fef03 305 if( heap.total_used > heap.maximum_used )
kevman 0:38ceb79fef03 306 heap.maximum_used = heap.total_used;
kevman 0:38ceb79fef03 307 #endif
kevman 0:38ceb79fef03 308 #if defined(MBEDTLS_MEMORY_BACKTRACE)
kevman 0:38ceb79fef03 309 trace_cnt = backtrace( trace_buffer, MAX_BT );
kevman 0:38ceb79fef03 310 cur->trace = backtrace_symbols( trace_buffer, trace_cnt );
kevman 0:38ceb79fef03 311 cur->trace_count = trace_cnt;
kevman 0:38ceb79fef03 312 #endif
kevman 0:38ceb79fef03 313
kevman 0:38ceb79fef03 314 if( ( heap.verify & MBEDTLS_MEMORY_VERIFY_ALLOC ) && verify_chain() != 0 )
kevman 0:38ceb79fef03 315 mbedtls_exit( 1 );
kevman 0:38ceb79fef03 316
kevman 0:38ceb79fef03 317 ret = (unsigned char *) cur + sizeof( memory_header );
kevman 0:38ceb79fef03 318 memset( ret, 0, original_len );
kevman 0:38ceb79fef03 319
kevman 0:38ceb79fef03 320 return( ret );
kevman 0:38ceb79fef03 321 }
kevman 0:38ceb79fef03 322
kevman 0:38ceb79fef03 323 p = ( (unsigned char *) cur ) + sizeof(memory_header) + len;
kevman 0:38ceb79fef03 324 new = (memory_header *) p;
kevman 0:38ceb79fef03 325
kevman 0:38ceb79fef03 326 new->size = cur->size - len - sizeof(memory_header);
kevman 0:38ceb79fef03 327 new->alloc = 0;
kevman 0:38ceb79fef03 328 new->prev = cur;
kevman 0:38ceb79fef03 329 new->next = cur->next;
kevman 0:38ceb79fef03 330 #if defined(MBEDTLS_MEMORY_BACKTRACE)
kevman 0:38ceb79fef03 331 new->trace = NULL;
kevman 0:38ceb79fef03 332 new->trace_count = 0;
kevman 0:38ceb79fef03 333 #endif
kevman 0:38ceb79fef03 334 new->magic1 = MAGIC1;
kevman 0:38ceb79fef03 335 new->magic2 = MAGIC2;
kevman 0:38ceb79fef03 336
kevman 0:38ceb79fef03 337 if( new->next != NULL )
kevman 0:38ceb79fef03 338 new->next->prev = new;
kevman 0:38ceb79fef03 339
kevman 0:38ceb79fef03 340 // Replace cur with new in free_list
kevman 0:38ceb79fef03 341 //
kevman 0:38ceb79fef03 342 new->prev_free = cur->prev_free;
kevman 0:38ceb79fef03 343 new->next_free = cur->next_free;
kevman 0:38ceb79fef03 344 if( new->prev_free != NULL )
kevman 0:38ceb79fef03 345 new->prev_free->next_free = new;
kevman 0:38ceb79fef03 346 else
kevman 0:38ceb79fef03 347 heap.first_free = new;
kevman 0:38ceb79fef03 348
kevman 0:38ceb79fef03 349 if( new->next_free != NULL )
kevman 0:38ceb79fef03 350 new->next_free->prev_free = new;
kevman 0:38ceb79fef03 351
kevman 0:38ceb79fef03 352 cur->alloc = 1;
kevman 0:38ceb79fef03 353 cur->size = len;
kevman 0:38ceb79fef03 354 cur->next = new;
kevman 0:38ceb79fef03 355 cur->prev_free = NULL;
kevman 0:38ceb79fef03 356 cur->next_free = NULL;
kevman 0:38ceb79fef03 357
kevman 0:38ceb79fef03 358 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 359 heap.header_count++;
kevman 0:38ceb79fef03 360 if( heap.header_count > heap.maximum_header_count )
kevman 0:38ceb79fef03 361 heap.maximum_header_count = heap.header_count;
kevman 0:38ceb79fef03 362 heap.total_used += cur->size;
kevman 0:38ceb79fef03 363 if( heap.total_used > heap.maximum_used )
kevman 0:38ceb79fef03 364 heap.maximum_used = heap.total_used;
kevman 0:38ceb79fef03 365 #endif
kevman 0:38ceb79fef03 366 #if defined(MBEDTLS_MEMORY_BACKTRACE)
kevman 0:38ceb79fef03 367 trace_cnt = backtrace( trace_buffer, MAX_BT );
kevman 0:38ceb79fef03 368 cur->trace = backtrace_symbols( trace_buffer, trace_cnt );
kevman 0:38ceb79fef03 369 cur->trace_count = trace_cnt;
kevman 0:38ceb79fef03 370 #endif
kevman 0:38ceb79fef03 371
kevman 0:38ceb79fef03 372 if( ( heap.verify & MBEDTLS_MEMORY_VERIFY_ALLOC ) && verify_chain() != 0 )
kevman 0:38ceb79fef03 373 mbedtls_exit( 1 );
kevman 0:38ceb79fef03 374
kevman 0:38ceb79fef03 375 ret = (unsigned char *) cur + sizeof( memory_header );
kevman 0:38ceb79fef03 376 memset( ret, 0, original_len );
kevman 0:38ceb79fef03 377
kevman 0:38ceb79fef03 378 return( ret );
kevman 0:38ceb79fef03 379 }
kevman 0:38ceb79fef03 380
kevman 0:38ceb79fef03 381 static void buffer_alloc_free( void *ptr )
kevman 0:38ceb79fef03 382 {
kevman 0:38ceb79fef03 383 memory_header *hdr, *old = NULL;
kevman 0:38ceb79fef03 384 unsigned char *p = (unsigned char *) ptr;
kevman 0:38ceb79fef03 385
kevman 0:38ceb79fef03 386 if( ptr == NULL || heap.buf == NULL || heap.first == NULL )
kevman 0:38ceb79fef03 387 return;
kevman 0:38ceb79fef03 388
kevman 0:38ceb79fef03 389 if( p < heap.buf || p >= heap.buf + heap.len )
kevman 0:38ceb79fef03 390 {
kevman 0:38ceb79fef03 391 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 392 mbedtls_fprintf( stderr, "FATAL: mbedtls_free() outside of managed "
kevman 0:38ceb79fef03 393 "space\n" );
kevman 0:38ceb79fef03 394 #endif
kevman 0:38ceb79fef03 395 mbedtls_exit( 1 );
kevman 0:38ceb79fef03 396 }
kevman 0:38ceb79fef03 397
kevman 0:38ceb79fef03 398 p -= sizeof(memory_header);
kevman 0:38ceb79fef03 399 hdr = (memory_header *) p;
kevman 0:38ceb79fef03 400
kevman 0:38ceb79fef03 401 if( verify_header( hdr ) != 0 )
kevman 0:38ceb79fef03 402 mbedtls_exit( 1 );
kevman 0:38ceb79fef03 403
kevman 0:38ceb79fef03 404 if( hdr->alloc != 1 )
kevman 0:38ceb79fef03 405 {
kevman 0:38ceb79fef03 406 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 407 mbedtls_fprintf( stderr, "FATAL: mbedtls_free() on unallocated "
kevman 0:38ceb79fef03 408 "data\n" );
kevman 0:38ceb79fef03 409 #endif
kevman 0:38ceb79fef03 410 mbedtls_exit( 1 );
kevman 0:38ceb79fef03 411 }
kevman 0:38ceb79fef03 412
kevman 0:38ceb79fef03 413 hdr->alloc = 0;
kevman 0:38ceb79fef03 414
kevman 0:38ceb79fef03 415 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 416 heap.free_count++;
kevman 0:38ceb79fef03 417 heap.total_used -= hdr->size;
kevman 0:38ceb79fef03 418 #endif
kevman 0:38ceb79fef03 419
kevman 0:38ceb79fef03 420 #if defined(MBEDTLS_MEMORY_BACKTRACE)
kevman 0:38ceb79fef03 421 free( hdr->trace );
kevman 0:38ceb79fef03 422 hdr->trace = NULL;
kevman 0:38ceb79fef03 423 hdr->trace_count = 0;
kevman 0:38ceb79fef03 424 #endif
kevman 0:38ceb79fef03 425
kevman 0:38ceb79fef03 426 // Regroup with block before
kevman 0:38ceb79fef03 427 //
kevman 0:38ceb79fef03 428 if( hdr->prev != NULL && hdr->prev->alloc == 0 )
kevman 0:38ceb79fef03 429 {
kevman 0:38ceb79fef03 430 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 431 heap.header_count--;
kevman 0:38ceb79fef03 432 #endif
kevman 0:38ceb79fef03 433 hdr->prev->size += sizeof(memory_header) + hdr->size;
kevman 0:38ceb79fef03 434 hdr->prev->next = hdr->next;
kevman 0:38ceb79fef03 435 old = hdr;
kevman 0:38ceb79fef03 436 hdr = hdr->prev;
kevman 0:38ceb79fef03 437
kevman 0:38ceb79fef03 438 if( hdr->next != NULL )
kevman 0:38ceb79fef03 439 hdr->next->prev = hdr;
kevman 0:38ceb79fef03 440
kevman 0:38ceb79fef03 441 memset( old, 0, sizeof(memory_header) );
kevman 0:38ceb79fef03 442 }
kevman 0:38ceb79fef03 443
kevman 0:38ceb79fef03 444 // Regroup with block after
kevman 0:38ceb79fef03 445 //
kevman 0:38ceb79fef03 446 if( hdr->next != NULL && hdr->next->alloc == 0 )
kevman 0:38ceb79fef03 447 {
kevman 0:38ceb79fef03 448 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 449 heap.header_count--;
kevman 0:38ceb79fef03 450 #endif
kevman 0:38ceb79fef03 451 hdr->size += sizeof(memory_header) + hdr->next->size;
kevman 0:38ceb79fef03 452 old = hdr->next;
kevman 0:38ceb79fef03 453 hdr->next = hdr->next->next;
kevman 0:38ceb79fef03 454
kevman 0:38ceb79fef03 455 if( hdr->prev_free != NULL || hdr->next_free != NULL )
kevman 0:38ceb79fef03 456 {
kevman 0:38ceb79fef03 457 if( hdr->prev_free != NULL )
kevman 0:38ceb79fef03 458 hdr->prev_free->next_free = hdr->next_free;
kevman 0:38ceb79fef03 459 else
kevman 0:38ceb79fef03 460 heap.first_free = hdr->next_free;
kevman 0:38ceb79fef03 461
kevman 0:38ceb79fef03 462 if( hdr->next_free != NULL )
kevman 0:38ceb79fef03 463 hdr->next_free->prev_free = hdr->prev_free;
kevman 0:38ceb79fef03 464 }
kevman 0:38ceb79fef03 465
kevman 0:38ceb79fef03 466 hdr->prev_free = old->prev_free;
kevman 0:38ceb79fef03 467 hdr->next_free = old->next_free;
kevman 0:38ceb79fef03 468
kevman 0:38ceb79fef03 469 if( hdr->prev_free != NULL )
kevman 0:38ceb79fef03 470 hdr->prev_free->next_free = hdr;
kevman 0:38ceb79fef03 471 else
kevman 0:38ceb79fef03 472 heap.first_free = hdr;
kevman 0:38ceb79fef03 473
kevman 0:38ceb79fef03 474 if( hdr->next_free != NULL )
kevman 0:38ceb79fef03 475 hdr->next_free->prev_free = hdr;
kevman 0:38ceb79fef03 476
kevman 0:38ceb79fef03 477 if( hdr->next != NULL )
kevman 0:38ceb79fef03 478 hdr->next->prev = hdr;
kevman 0:38ceb79fef03 479
kevman 0:38ceb79fef03 480 memset( old, 0, sizeof(memory_header) );
kevman 0:38ceb79fef03 481 }
kevman 0:38ceb79fef03 482
kevman 0:38ceb79fef03 483 // Prepend to free_list if we have not merged
kevman 0:38ceb79fef03 484 // (Does not have to stay in same order as prev / next list)
kevman 0:38ceb79fef03 485 //
kevman 0:38ceb79fef03 486 if( old == NULL )
kevman 0:38ceb79fef03 487 {
kevman 0:38ceb79fef03 488 hdr->next_free = heap.first_free;
kevman 0:38ceb79fef03 489 if( heap.first_free != NULL )
kevman 0:38ceb79fef03 490 heap.first_free->prev_free = hdr;
kevman 0:38ceb79fef03 491 heap.first_free = hdr;
kevman 0:38ceb79fef03 492 }
kevman 0:38ceb79fef03 493
kevman 0:38ceb79fef03 494 if( ( heap.verify & MBEDTLS_MEMORY_VERIFY_FREE ) && verify_chain() != 0 )
kevman 0:38ceb79fef03 495 mbedtls_exit( 1 );
kevman 0:38ceb79fef03 496 }
kevman 0:38ceb79fef03 497
kevman 0:38ceb79fef03 498 void mbedtls_memory_buffer_set_verify( int verify )
kevman 0:38ceb79fef03 499 {
kevman 0:38ceb79fef03 500 heap.verify = verify;
kevman 0:38ceb79fef03 501 }
kevman 0:38ceb79fef03 502
kevman 0:38ceb79fef03 503 int mbedtls_memory_buffer_alloc_verify( void )
kevman 0:38ceb79fef03 504 {
kevman 0:38ceb79fef03 505 return verify_chain();
kevman 0:38ceb79fef03 506 }
kevman 0:38ceb79fef03 507
kevman 0:38ceb79fef03 508 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 509 void mbedtls_memory_buffer_alloc_status( void )
kevman 0:38ceb79fef03 510 {
kevman 0:38ceb79fef03 511 mbedtls_fprintf( stderr,
kevman 0:38ceb79fef03 512 "Current use: %zu blocks / %zu bytes, max: %zu blocks / "
kevman 0:38ceb79fef03 513 "%zu bytes (total %zu bytes), alloc / free: %zu / %zu\n",
kevman 0:38ceb79fef03 514 heap.header_count, heap.total_used,
kevman 0:38ceb79fef03 515 heap.maximum_header_count, heap.maximum_used,
kevman 0:38ceb79fef03 516 heap.maximum_header_count * sizeof( memory_header )
kevman 0:38ceb79fef03 517 + heap.maximum_used,
kevman 0:38ceb79fef03 518 heap.alloc_count, heap.free_count );
kevman 0:38ceb79fef03 519
kevman 0:38ceb79fef03 520 if( heap.first->next == NULL )
kevman 0:38ceb79fef03 521 {
kevman 0:38ceb79fef03 522 mbedtls_fprintf( stderr, "All memory de-allocated in stack buffer\n" );
kevman 0:38ceb79fef03 523 }
kevman 0:38ceb79fef03 524 else
kevman 0:38ceb79fef03 525 {
kevman 0:38ceb79fef03 526 mbedtls_fprintf( stderr, "Memory currently allocated:\n" );
kevman 0:38ceb79fef03 527 debug_chain();
kevman 0:38ceb79fef03 528 }
kevman 0:38ceb79fef03 529 }
kevman 0:38ceb79fef03 530
kevman 0:38ceb79fef03 531 void mbedtls_memory_buffer_alloc_max_get( size_t *max_used, size_t *max_blocks )
kevman 0:38ceb79fef03 532 {
kevman 0:38ceb79fef03 533 *max_used = heap.maximum_used;
kevman 0:38ceb79fef03 534 *max_blocks = heap.maximum_header_count;
kevman 0:38ceb79fef03 535 }
kevman 0:38ceb79fef03 536
kevman 0:38ceb79fef03 537 void mbedtls_memory_buffer_alloc_max_reset( void )
kevman 0:38ceb79fef03 538 {
kevman 0:38ceb79fef03 539 heap.maximum_used = 0;
kevman 0:38ceb79fef03 540 heap.maximum_header_count = 0;
kevman 0:38ceb79fef03 541 }
kevman 0:38ceb79fef03 542
kevman 0:38ceb79fef03 543 void mbedtls_memory_buffer_alloc_cur_get( size_t *cur_used, size_t *cur_blocks )
kevman 0:38ceb79fef03 544 {
kevman 0:38ceb79fef03 545 *cur_used = heap.total_used;
kevman 0:38ceb79fef03 546 *cur_blocks = heap.header_count;
kevman 0:38ceb79fef03 547 }
kevman 0:38ceb79fef03 548 #endif /* MBEDTLS_MEMORY_DEBUG */
kevman 0:38ceb79fef03 549
kevman 0:38ceb79fef03 550 #if defined(MBEDTLS_THREADING_C)
kevman 0:38ceb79fef03 551 static void *buffer_alloc_calloc_mutexed( size_t n, size_t size )
kevman 0:38ceb79fef03 552 {
kevman 0:38ceb79fef03 553 void *buf;
kevman 0:38ceb79fef03 554 if( mbedtls_mutex_lock( &heap.mutex ) != 0 )
kevman 0:38ceb79fef03 555 return( NULL );
kevman 0:38ceb79fef03 556 buf = buffer_alloc_calloc( n, size );
kevman 0:38ceb79fef03 557 if( mbedtls_mutex_unlock( &heap.mutex ) )
kevman 0:38ceb79fef03 558 return( NULL );
kevman 0:38ceb79fef03 559 return( buf );
kevman 0:38ceb79fef03 560 }
kevman 0:38ceb79fef03 561
kevman 0:38ceb79fef03 562 static void buffer_alloc_free_mutexed( void *ptr )
kevman 0:38ceb79fef03 563 {
kevman 0:38ceb79fef03 564 /* We have to good option here, but corrupting the heap seems
kevman 0:38ceb79fef03 565 * worse than loosing memory. */
kevman 0:38ceb79fef03 566 if( mbedtls_mutex_lock( &heap.mutex ) )
kevman 0:38ceb79fef03 567 return;
kevman 0:38ceb79fef03 568 buffer_alloc_free( ptr );
kevman 0:38ceb79fef03 569 (void) mbedtls_mutex_unlock( &heap.mutex );
kevman 0:38ceb79fef03 570 }
kevman 0:38ceb79fef03 571 #endif /* MBEDTLS_THREADING_C */
kevman 0:38ceb79fef03 572
kevman 0:38ceb79fef03 573 void mbedtls_memory_buffer_alloc_init( unsigned char *buf, size_t len )
kevman 0:38ceb79fef03 574 {
kevman 0:38ceb79fef03 575 memset( &heap, 0, sizeof( buffer_alloc_ctx ) );
kevman 0:38ceb79fef03 576
kevman 0:38ceb79fef03 577 #if defined(MBEDTLS_THREADING_C)
kevman 0:38ceb79fef03 578 mbedtls_mutex_init( &heap.mutex );
kevman 0:38ceb79fef03 579 mbedtls_platform_set_calloc_free( buffer_alloc_calloc_mutexed,
kevman 0:38ceb79fef03 580 buffer_alloc_free_mutexed );
kevman 0:38ceb79fef03 581 #else
kevman 0:38ceb79fef03 582 mbedtls_platform_set_calloc_free( buffer_alloc_calloc, buffer_alloc_free );
kevman 0:38ceb79fef03 583 #endif
kevman 0:38ceb79fef03 584
kevman 0:38ceb79fef03 585 if( len < sizeof( memory_header ) + MBEDTLS_MEMORY_ALIGN_MULTIPLE )
kevman 0:38ceb79fef03 586 return;
kevman 0:38ceb79fef03 587 else if( (size_t)buf % MBEDTLS_MEMORY_ALIGN_MULTIPLE )
kevman 0:38ceb79fef03 588 {
kevman 0:38ceb79fef03 589 /* Adjust len first since buf is used in the computation */
kevman 0:38ceb79fef03 590 len -= MBEDTLS_MEMORY_ALIGN_MULTIPLE
kevman 0:38ceb79fef03 591 - (size_t)buf % MBEDTLS_MEMORY_ALIGN_MULTIPLE;
kevman 0:38ceb79fef03 592 buf += MBEDTLS_MEMORY_ALIGN_MULTIPLE
kevman 0:38ceb79fef03 593 - (size_t)buf % MBEDTLS_MEMORY_ALIGN_MULTIPLE;
kevman 0:38ceb79fef03 594 }
kevman 0:38ceb79fef03 595
kevman 0:38ceb79fef03 596 memset( buf, 0, len );
kevman 0:38ceb79fef03 597
kevman 0:38ceb79fef03 598 heap.buf = buf;
kevman 0:38ceb79fef03 599 heap.len = len;
kevman 0:38ceb79fef03 600
kevman 0:38ceb79fef03 601 heap.first = (memory_header *)buf;
kevman 0:38ceb79fef03 602 heap.first->size = len - sizeof( memory_header );
kevman 0:38ceb79fef03 603 heap.first->magic1 = MAGIC1;
kevman 0:38ceb79fef03 604 heap.first->magic2 = MAGIC2;
kevman 0:38ceb79fef03 605 heap.first_free = heap.first;
kevman 0:38ceb79fef03 606 }
kevman 0:38ceb79fef03 607
kevman 0:38ceb79fef03 608 void mbedtls_memory_buffer_alloc_free( void )
kevman 0:38ceb79fef03 609 {
kevman 0:38ceb79fef03 610 #if defined(MBEDTLS_THREADING_C)
kevman 0:38ceb79fef03 611 mbedtls_mutex_free( &heap.mutex );
kevman 0:38ceb79fef03 612 #endif
kevman 0:38ceb79fef03 613 mbedtls_platform_zeroize( &heap, sizeof(buffer_alloc_ctx) );
kevman 0:38ceb79fef03 614 }
kevman 0:38ceb79fef03 615
kevman 0:38ceb79fef03 616 #if defined(MBEDTLS_SELF_TEST)
kevman 0:38ceb79fef03 617 static int check_pointer( void *p )
kevman 0:38ceb79fef03 618 {
kevman 0:38ceb79fef03 619 if( p == NULL )
kevman 0:38ceb79fef03 620 return( -1 );
kevman 0:38ceb79fef03 621
kevman 0:38ceb79fef03 622 if( (size_t) p % MBEDTLS_MEMORY_ALIGN_MULTIPLE != 0 )
kevman 0:38ceb79fef03 623 return( -1 );
kevman 0:38ceb79fef03 624
kevman 0:38ceb79fef03 625 return( 0 );
kevman 0:38ceb79fef03 626 }
kevman 0:38ceb79fef03 627
kevman 0:38ceb79fef03 628 static int check_all_free( void )
kevman 0:38ceb79fef03 629 {
kevman 0:38ceb79fef03 630 if(
kevman 0:38ceb79fef03 631 #if defined(MBEDTLS_MEMORY_DEBUG)
kevman 0:38ceb79fef03 632 heap.total_used != 0 ||
kevman 0:38ceb79fef03 633 #endif
kevman 0:38ceb79fef03 634 heap.first != heap.first_free ||
kevman 0:38ceb79fef03 635 (void *) heap.first != (void *) heap.buf )
kevman 0:38ceb79fef03 636 {
kevman 0:38ceb79fef03 637 return( -1 );
kevman 0:38ceb79fef03 638 }
kevman 0:38ceb79fef03 639
kevman 0:38ceb79fef03 640 return( 0 );
kevman 0:38ceb79fef03 641 }
kevman 0:38ceb79fef03 642
kevman 0:38ceb79fef03 643 #define TEST_ASSERT( condition ) \
kevman 0:38ceb79fef03 644 if( ! (condition) ) \
kevman 0:38ceb79fef03 645 { \
kevman 0:38ceb79fef03 646 if( verbose != 0 ) \
kevman 0:38ceb79fef03 647 mbedtls_printf( "failed\n" ); \
kevman 0:38ceb79fef03 648 \
kevman 0:38ceb79fef03 649 ret = 1; \
kevman 0:38ceb79fef03 650 goto cleanup; \
kevman 0:38ceb79fef03 651 }
kevman 0:38ceb79fef03 652
kevman 0:38ceb79fef03 653 int mbedtls_memory_buffer_alloc_self_test( int verbose )
kevman 0:38ceb79fef03 654 {
kevman 0:38ceb79fef03 655 unsigned char buf[1024];
kevman 0:38ceb79fef03 656 unsigned char *p, *q, *r, *end;
kevman 0:38ceb79fef03 657 int ret = 0;
kevman 0:38ceb79fef03 658
kevman 0:38ceb79fef03 659 if( verbose != 0 )
kevman 0:38ceb79fef03 660 mbedtls_printf( " MBA test #1 (basic alloc-free cycle): " );
kevman 0:38ceb79fef03 661
kevman 0:38ceb79fef03 662 mbedtls_memory_buffer_alloc_init( buf, sizeof( buf ) );
kevman 0:38ceb79fef03 663
kevman 0:38ceb79fef03 664 p = mbedtls_calloc( 1, 1 );
kevman 0:38ceb79fef03 665 q = mbedtls_calloc( 1, 128 );
kevman 0:38ceb79fef03 666 r = mbedtls_calloc( 1, 16 );
kevman 0:38ceb79fef03 667
kevman 0:38ceb79fef03 668 TEST_ASSERT( check_pointer( p ) == 0 &&
kevman 0:38ceb79fef03 669 check_pointer( q ) == 0 &&
kevman 0:38ceb79fef03 670 check_pointer( r ) == 0 );
kevman 0:38ceb79fef03 671
kevman 0:38ceb79fef03 672 mbedtls_free( r );
kevman 0:38ceb79fef03 673 mbedtls_free( q );
kevman 0:38ceb79fef03 674 mbedtls_free( p );
kevman 0:38ceb79fef03 675
kevman 0:38ceb79fef03 676 TEST_ASSERT( check_all_free( ) == 0 );
kevman 0:38ceb79fef03 677
kevman 0:38ceb79fef03 678 /* Memorize end to compare with the next test */
kevman 0:38ceb79fef03 679 end = heap.buf + heap.len;
kevman 0:38ceb79fef03 680
kevman 0:38ceb79fef03 681 mbedtls_memory_buffer_alloc_free( );
kevman 0:38ceb79fef03 682
kevman 0:38ceb79fef03 683 if( verbose != 0 )
kevman 0:38ceb79fef03 684 mbedtls_printf( "passed\n" );
kevman 0:38ceb79fef03 685
kevman 0:38ceb79fef03 686 if( verbose != 0 )
kevman 0:38ceb79fef03 687 mbedtls_printf( " MBA test #2 (buf not aligned): " );
kevman 0:38ceb79fef03 688
kevman 0:38ceb79fef03 689 mbedtls_memory_buffer_alloc_init( buf + 1, sizeof( buf ) - 1 );
kevman 0:38ceb79fef03 690
kevman 0:38ceb79fef03 691 TEST_ASSERT( heap.buf + heap.len == end );
kevman 0:38ceb79fef03 692
kevman 0:38ceb79fef03 693 p = mbedtls_calloc( 1, 1 );
kevman 0:38ceb79fef03 694 q = mbedtls_calloc( 1, 128 );
kevman 0:38ceb79fef03 695 r = mbedtls_calloc( 1, 16 );
kevman 0:38ceb79fef03 696
kevman 0:38ceb79fef03 697 TEST_ASSERT( check_pointer( p ) == 0 &&
kevman 0:38ceb79fef03 698 check_pointer( q ) == 0 &&
kevman 0:38ceb79fef03 699 check_pointer( r ) == 0 );
kevman 0:38ceb79fef03 700
kevman 0:38ceb79fef03 701 mbedtls_free( r );
kevman 0:38ceb79fef03 702 mbedtls_free( q );
kevman 0:38ceb79fef03 703 mbedtls_free( p );
kevman 0:38ceb79fef03 704
kevman 0:38ceb79fef03 705 TEST_ASSERT( check_all_free( ) == 0 );
kevman 0:38ceb79fef03 706
kevman 0:38ceb79fef03 707 mbedtls_memory_buffer_alloc_free( );
kevman 0:38ceb79fef03 708
kevman 0:38ceb79fef03 709 if( verbose != 0 )
kevman 0:38ceb79fef03 710 mbedtls_printf( "passed\n" );
kevman 0:38ceb79fef03 711
kevman 0:38ceb79fef03 712 if( verbose != 0 )
kevman 0:38ceb79fef03 713 mbedtls_printf( " MBA test #3 (full): " );
kevman 0:38ceb79fef03 714
kevman 0:38ceb79fef03 715 mbedtls_memory_buffer_alloc_init( buf, sizeof( buf ) );
kevman 0:38ceb79fef03 716
kevman 0:38ceb79fef03 717 p = mbedtls_calloc( 1, sizeof( buf ) - sizeof( memory_header ) );
kevman 0:38ceb79fef03 718
kevman 0:38ceb79fef03 719 TEST_ASSERT( check_pointer( p ) == 0 );
kevman 0:38ceb79fef03 720 TEST_ASSERT( mbedtls_calloc( 1, 1 ) == NULL );
kevman 0:38ceb79fef03 721
kevman 0:38ceb79fef03 722 mbedtls_free( p );
kevman 0:38ceb79fef03 723
kevman 0:38ceb79fef03 724 p = mbedtls_calloc( 1, sizeof( buf ) - 2 * sizeof( memory_header ) - 16 );
kevman 0:38ceb79fef03 725 q = mbedtls_calloc( 1, 16 );
kevman 0:38ceb79fef03 726
kevman 0:38ceb79fef03 727 TEST_ASSERT( check_pointer( p ) == 0 && check_pointer( q ) == 0 );
kevman 0:38ceb79fef03 728 TEST_ASSERT( mbedtls_calloc( 1, 1 ) == NULL );
kevman 0:38ceb79fef03 729
kevman 0:38ceb79fef03 730 mbedtls_free( q );
kevman 0:38ceb79fef03 731
kevman 0:38ceb79fef03 732 TEST_ASSERT( mbedtls_calloc( 1, 17 ) == NULL );
kevman 0:38ceb79fef03 733
kevman 0:38ceb79fef03 734 mbedtls_free( p );
kevman 0:38ceb79fef03 735
kevman 0:38ceb79fef03 736 TEST_ASSERT( check_all_free( ) == 0 );
kevman 0:38ceb79fef03 737
kevman 0:38ceb79fef03 738 mbedtls_memory_buffer_alloc_free( );
kevman 0:38ceb79fef03 739
kevman 0:38ceb79fef03 740 if( verbose != 0 )
kevman 0:38ceb79fef03 741 mbedtls_printf( "passed\n" );
kevman 0:38ceb79fef03 742
kevman 0:38ceb79fef03 743 cleanup:
kevman 0:38ceb79fef03 744 mbedtls_memory_buffer_alloc_free( );
kevman 0:38ceb79fef03 745
kevman 0:38ceb79fef03 746 return( ret );
kevman 0:38ceb79fef03 747 }
kevman 0:38ceb79fef03 748 #endif /* MBEDTLS_SELF_TEST */
kevman 0:38ceb79fef03 749
kevman 0:38ceb79fef03 750 #endif /* MBEDTLS_MEMORY_BUFFER_ALLOC_C */