memory_buffer_alloc.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746
  1. /*
  2. * Buffer-based memory allocator
  3. *
  4. * Copyright The Mbed TLS Contributors
  5. * SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later
  6. */
  7. #include "common.h"
  8. #if defined(MBEDTLS_MEMORY_BUFFER_ALLOC_C)
  9. #include "mbedtls/memory_buffer_alloc.h"
  10. /* No need for the header guard as MBEDTLS_MEMORY_BUFFER_ALLOC_C
  11. is dependent upon MBEDTLS_PLATFORM_C */
  12. #include "mbedtls/platform.h"
  13. #include "mbedtls/platform_util.h"
  14. #include <string.h>
  15. #if defined(MBEDTLS_MEMORY_BACKTRACE)
  16. #include <execinfo.h>
  17. #endif
  18. #if defined(MBEDTLS_THREADING_C)
  19. #include "mbedtls/threading.h"
  20. #endif
  21. #define MAGIC1 0xFF00AA55
  22. #define MAGIC2 0xEE119966
  23. #define MAX_BT 20
  24. typedef struct _memory_header memory_header;
  25. struct _memory_header {
  26. size_t magic1;
  27. size_t size;
  28. size_t alloc;
  29. memory_header *prev;
  30. memory_header *next;
  31. memory_header *prev_free;
  32. memory_header *next_free;
  33. #if defined(MBEDTLS_MEMORY_BACKTRACE)
  34. char **trace;
  35. size_t trace_count;
  36. #endif
  37. size_t magic2;
  38. };
  39. typedef struct {
  40. unsigned char *buf;
  41. size_t len;
  42. memory_header *first;
  43. memory_header *first_free;
  44. int verify;
  45. #if defined(MBEDTLS_MEMORY_DEBUG)
  46. size_t alloc_count;
  47. size_t free_count;
  48. size_t total_used;
  49. size_t maximum_used;
  50. size_t header_count;
  51. size_t maximum_header_count;
  52. #endif
  53. #if defined(MBEDTLS_THREADING_C)
  54. mbedtls_threading_mutex_t mutex;
  55. #endif
  56. }
  57. buffer_alloc_ctx;
  58. static buffer_alloc_ctx heap;
  59. #if defined(MBEDTLS_MEMORY_DEBUG)
  60. static void debug_header(memory_header *hdr)
  61. {
  62. #if defined(MBEDTLS_MEMORY_BACKTRACE)
  63. size_t i;
  64. #endif
  65. mbedtls_fprintf(stderr, "HDR: PTR(%10zu), PREV(%10zu), NEXT(%10zu), "
  66. "ALLOC(%zu), SIZE(%10zu)\n",
  67. (size_t) hdr, (size_t) hdr->prev, (size_t) hdr->next,
  68. hdr->alloc, hdr->size);
  69. mbedtls_fprintf(stderr, " FPREV(%10zu), FNEXT(%10zu)\n",
  70. (size_t) hdr->prev_free, (size_t) hdr->next_free);
  71. #if defined(MBEDTLS_MEMORY_BACKTRACE)
  72. mbedtls_fprintf(stderr, "TRACE: \n");
  73. for (i = 0; i < hdr->trace_count; i++) {
  74. mbedtls_fprintf(stderr, "%s\n", hdr->trace[i]);
  75. }
  76. mbedtls_fprintf(stderr, "\n");
  77. #endif
  78. }
  79. static void debug_chain(void)
  80. {
  81. memory_header *cur = heap.first;
  82. mbedtls_fprintf(stderr, "\nBlock list\n");
  83. while (cur != NULL) {
  84. debug_header(cur);
  85. cur = cur->next;
  86. }
  87. mbedtls_fprintf(stderr, "Free list\n");
  88. cur = heap.first_free;
  89. while (cur != NULL) {
  90. debug_header(cur);
  91. cur = cur->next_free;
  92. }
  93. }
  94. #endif /* MBEDTLS_MEMORY_DEBUG */
  95. static int verify_header(memory_header *hdr)
  96. {
  97. if (hdr->magic1 != MAGIC1) {
  98. #if defined(MBEDTLS_MEMORY_DEBUG)
  99. mbedtls_fprintf(stderr, "FATAL: MAGIC1 mismatch\n");
  100. #endif
  101. return 1;
  102. }
  103. if (hdr->magic2 != MAGIC2) {
  104. #if defined(MBEDTLS_MEMORY_DEBUG)
  105. mbedtls_fprintf(stderr, "FATAL: MAGIC2 mismatch\n");
  106. #endif
  107. return 1;
  108. }
  109. if (hdr->alloc > 1) {
  110. #if defined(MBEDTLS_MEMORY_DEBUG)
  111. mbedtls_fprintf(stderr, "FATAL: alloc has illegal value\n");
  112. #endif
  113. return 1;
  114. }
  115. if (hdr->prev != NULL && hdr->prev == hdr->next) {
  116. #if defined(MBEDTLS_MEMORY_DEBUG)
  117. mbedtls_fprintf(stderr, "FATAL: prev == next\n");
  118. #endif
  119. return 1;
  120. }
  121. if (hdr->prev_free != NULL && hdr->prev_free == hdr->next_free) {
  122. #if defined(MBEDTLS_MEMORY_DEBUG)
  123. mbedtls_fprintf(stderr, "FATAL: prev_free == next_free\n");
  124. #endif
  125. return 1;
  126. }
  127. return 0;
  128. }
  129. static int verify_chain(void)
  130. {
  131. memory_header *prv = heap.first, *cur;
  132. if (prv == NULL || verify_header(prv) != 0) {
  133. #if defined(MBEDTLS_MEMORY_DEBUG)
  134. mbedtls_fprintf(stderr, "FATAL: verification of first header "
  135. "failed\n");
  136. #endif
  137. return 1;
  138. }
  139. if (heap.first->prev != NULL) {
  140. #if defined(MBEDTLS_MEMORY_DEBUG)
  141. mbedtls_fprintf(stderr, "FATAL: verification failed: "
  142. "first->prev != NULL\n");
  143. #endif
  144. return 1;
  145. }
  146. cur = heap.first->next;
  147. while (cur != NULL) {
  148. if (verify_header(cur) != 0) {
  149. #if defined(MBEDTLS_MEMORY_DEBUG)
  150. mbedtls_fprintf(stderr, "FATAL: verification of header "
  151. "failed\n");
  152. #endif
  153. return 1;
  154. }
  155. if (cur->prev != prv) {
  156. #if defined(MBEDTLS_MEMORY_DEBUG)
  157. mbedtls_fprintf(stderr, "FATAL: verification failed: "
  158. "cur->prev != prv\n");
  159. #endif
  160. return 1;
  161. }
  162. prv = cur;
  163. cur = cur->next;
  164. }
  165. return 0;
  166. }
  167. static void *buffer_alloc_calloc(size_t n, size_t size)
  168. {
  169. memory_header *new, *cur = heap.first_free;
  170. unsigned char *p;
  171. void *ret;
  172. size_t original_len, len;
  173. #if defined(MBEDTLS_MEMORY_BACKTRACE)
  174. void *trace_buffer[MAX_BT];
  175. size_t trace_cnt;
  176. #endif
  177. if (heap.buf == NULL || heap.first == NULL) {
  178. return NULL;
  179. }
  180. original_len = len = n * size;
  181. if (n == 0 || size == 0 || len / n != size) {
  182. return NULL;
  183. } else if (len > (size_t) -MBEDTLS_MEMORY_ALIGN_MULTIPLE) {
  184. return NULL;
  185. }
  186. if (len % MBEDTLS_MEMORY_ALIGN_MULTIPLE) {
  187. len -= len % MBEDTLS_MEMORY_ALIGN_MULTIPLE;
  188. len += MBEDTLS_MEMORY_ALIGN_MULTIPLE;
  189. }
  190. // Find block that fits
  191. //
  192. while (cur != NULL) {
  193. if (cur->size >= len) {
  194. break;
  195. }
  196. cur = cur->next_free;
  197. }
  198. if (cur == NULL) {
  199. return NULL;
  200. }
  201. if (cur->alloc != 0) {
  202. #if defined(MBEDTLS_MEMORY_DEBUG)
  203. mbedtls_fprintf(stderr, "FATAL: block in free_list but allocated "
  204. "data\n");
  205. #endif
  206. mbedtls_exit(1);
  207. }
  208. #if defined(MBEDTLS_MEMORY_DEBUG)
  209. heap.alloc_count++;
  210. #endif
  211. // Found location, split block if > memory_header + 4 room left
  212. //
  213. if (cur->size - len < sizeof(memory_header) +
  214. MBEDTLS_MEMORY_ALIGN_MULTIPLE) {
  215. cur->alloc = 1;
  216. // Remove from free_list
  217. //
  218. if (cur->prev_free != NULL) {
  219. cur->prev_free->next_free = cur->next_free;
  220. } else {
  221. heap.first_free = cur->next_free;
  222. }
  223. if (cur->next_free != NULL) {
  224. cur->next_free->prev_free = cur->prev_free;
  225. }
  226. cur->prev_free = NULL;
  227. cur->next_free = NULL;
  228. #if defined(MBEDTLS_MEMORY_DEBUG)
  229. heap.total_used += cur->size;
  230. if (heap.total_used > heap.maximum_used) {
  231. heap.maximum_used = heap.total_used;
  232. }
  233. #endif
  234. #if defined(MBEDTLS_MEMORY_BACKTRACE)
  235. trace_cnt = backtrace(trace_buffer, MAX_BT);
  236. cur->trace = backtrace_symbols(trace_buffer, trace_cnt);
  237. cur->trace_count = trace_cnt;
  238. #endif
  239. if ((heap.verify & MBEDTLS_MEMORY_VERIFY_ALLOC) && verify_chain() != 0) {
  240. mbedtls_exit(1);
  241. }
  242. ret = (unsigned char *) cur + sizeof(memory_header);
  243. memset(ret, 0, original_len);
  244. return ret;
  245. }
  246. p = ((unsigned char *) cur) + sizeof(memory_header) + len;
  247. new = (memory_header *) p;
  248. new->size = cur->size - len - sizeof(memory_header);
  249. new->alloc = 0;
  250. new->prev = cur;
  251. new->next = cur->next;
  252. #if defined(MBEDTLS_MEMORY_BACKTRACE)
  253. new->trace = NULL;
  254. new->trace_count = 0;
  255. #endif
  256. new->magic1 = MAGIC1;
  257. new->magic2 = MAGIC2;
  258. if (new->next != NULL) {
  259. new->next->prev = new;
  260. }
  261. // Replace cur with new in free_list
  262. //
  263. new->prev_free = cur->prev_free;
  264. new->next_free = cur->next_free;
  265. if (new->prev_free != NULL) {
  266. new->prev_free->next_free = new;
  267. } else {
  268. heap.first_free = new;
  269. }
  270. if (new->next_free != NULL) {
  271. new->next_free->prev_free = new;
  272. }
  273. cur->alloc = 1;
  274. cur->size = len;
  275. cur->next = new;
  276. cur->prev_free = NULL;
  277. cur->next_free = NULL;
  278. #if defined(MBEDTLS_MEMORY_DEBUG)
  279. heap.header_count++;
  280. if (heap.header_count > heap.maximum_header_count) {
  281. heap.maximum_header_count = heap.header_count;
  282. }
  283. heap.total_used += cur->size;
  284. if (heap.total_used > heap.maximum_used) {
  285. heap.maximum_used = heap.total_used;
  286. }
  287. #endif
  288. #if defined(MBEDTLS_MEMORY_BACKTRACE)
  289. trace_cnt = backtrace(trace_buffer, MAX_BT);
  290. cur->trace = backtrace_symbols(trace_buffer, trace_cnt);
  291. cur->trace_count = trace_cnt;
  292. #endif
  293. if ((heap.verify & MBEDTLS_MEMORY_VERIFY_ALLOC) && verify_chain() != 0) {
  294. mbedtls_exit(1);
  295. }
  296. ret = (unsigned char *) cur + sizeof(memory_header);
  297. memset(ret, 0, original_len);
  298. return ret;
  299. }
  300. static void buffer_alloc_free(void *ptr)
  301. {
  302. memory_header *hdr, *old = NULL;
  303. unsigned char *p = (unsigned char *) ptr;
  304. if (ptr == NULL || heap.buf == NULL || heap.first == NULL) {
  305. return;
  306. }
  307. if (p < heap.buf || p >= heap.buf + heap.len) {
  308. #if defined(MBEDTLS_MEMORY_DEBUG)
  309. mbedtls_fprintf(stderr, "FATAL: mbedtls_free() outside of managed "
  310. "space\n");
  311. #endif
  312. mbedtls_exit(1);
  313. }
  314. p -= sizeof(memory_header);
  315. hdr = (memory_header *) p;
  316. if (verify_header(hdr) != 0) {
  317. mbedtls_exit(1);
  318. }
  319. if (hdr->alloc != 1) {
  320. #if defined(MBEDTLS_MEMORY_DEBUG)
  321. mbedtls_fprintf(stderr, "FATAL: mbedtls_free() on unallocated "
  322. "data\n");
  323. #endif
  324. mbedtls_exit(1);
  325. }
  326. hdr->alloc = 0;
  327. #if defined(MBEDTLS_MEMORY_DEBUG)
  328. heap.free_count++;
  329. heap.total_used -= hdr->size;
  330. #endif
  331. #if defined(MBEDTLS_MEMORY_BACKTRACE)
  332. free(hdr->trace);
  333. hdr->trace = NULL;
  334. hdr->trace_count = 0;
  335. #endif
  336. // Regroup with block before
  337. //
  338. if (hdr->prev != NULL && hdr->prev->alloc == 0) {
  339. #if defined(MBEDTLS_MEMORY_DEBUG)
  340. heap.header_count--;
  341. #endif
  342. hdr->prev->size += sizeof(memory_header) + hdr->size;
  343. hdr->prev->next = hdr->next;
  344. old = hdr;
  345. hdr = hdr->prev;
  346. if (hdr->next != NULL) {
  347. hdr->next->prev = hdr;
  348. }
  349. memset(old, 0, sizeof(memory_header));
  350. }
  351. // Regroup with block after
  352. //
  353. if (hdr->next != NULL && hdr->next->alloc == 0) {
  354. #if defined(MBEDTLS_MEMORY_DEBUG)
  355. heap.header_count--;
  356. #endif
  357. hdr->size += sizeof(memory_header) + hdr->next->size;
  358. old = hdr->next;
  359. hdr->next = hdr->next->next;
  360. if (hdr->prev_free != NULL || hdr->next_free != NULL) {
  361. if (hdr->prev_free != NULL) {
  362. hdr->prev_free->next_free = hdr->next_free;
  363. } else {
  364. heap.first_free = hdr->next_free;
  365. }
  366. if (hdr->next_free != NULL) {
  367. hdr->next_free->prev_free = hdr->prev_free;
  368. }
  369. }
  370. hdr->prev_free = old->prev_free;
  371. hdr->next_free = old->next_free;
  372. if (hdr->prev_free != NULL) {
  373. hdr->prev_free->next_free = hdr;
  374. } else {
  375. heap.first_free = hdr;
  376. }
  377. if (hdr->next_free != NULL) {
  378. hdr->next_free->prev_free = hdr;
  379. }
  380. if (hdr->next != NULL) {
  381. hdr->next->prev = hdr;
  382. }
  383. memset(old, 0, sizeof(memory_header));
  384. }
  385. // Prepend to free_list if we have not merged
  386. // (Does not have to stay in same order as prev / next list)
  387. //
  388. if (old == NULL) {
  389. hdr->next_free = heap.first_free;
  390. if (heap.first_free != NULL) {
  391. heap.first_free->prev_free = hdr;
  392. }
  393. heap.first_free = hdr;
  394. }
  395. if ((heap.verify & MBEDTLS_MEMORY_VERIFY_FREE) && verify_chain() != 0) {
  396. mbedtls_exit(1);
  397. }
  398. }
  399. void mbedtls_memory_buffer_set_verify(int verify)
  400. {
  401. heap.verify = verify;
  402. }
  403. int mbedtls_memory_buffer_alloc_verify(void)
  404. {
  405. return verify_chain();
  406. }
  407. #if defined(MBEDTLS_MEMORY_DEBUG)
  408. void mbedtls_memory_buffer_alloc_status(void)
  409. {
  410. mbedtls_fprintf(stderr,
  411. "Current use: %zu blocks / %zu bytes, max: %zu blocks / "
  412. "%zu bytes (total %zu bytes), alloc / free: %zu / %zu\n",
  413. heap.header_count, heap.total_used,
  414. heap.maximum_header_count, heap.maximum_used,
  415. heap.maximum_header_count * sizeof(memory_header)
  416. + heap.maximum_used,
  417. heap.alloc_count, heap.free_count);
  418. if (heap.first->next == NULL) {
  419. mbedtls_fprintf(stderr, "All memory de-allocated in stack buffer\n");
  420. } else {
  421. mbedtls_fprintf(stderr, "Memory currently allocated:\n");
  422. debug_chain();
  423. }
  424. }
  425. void mbedtls_memory_buffer_alloc_count_get(size_t *alloc_count, size_t *free_count)
  426. {
  427. *alloc_count = heap.alloc_count;
  428. *free_count = heap.free_count;
  429. }
  430. void mbedtls_memory_buffer_alloc_max_get(size_t *max_used, size_t *max_blocks)
  431. {
  432. *max_used = heap.maximum_used;
  433. *max_blocks = heap.maximum_header_count;
  434. }
  435. void mbedtls_memory_buffer_alloc_max_reset(void)
  436. {
  437. heap.maximum_used = 0;
  438. heap.maximum_header_count = 0;
  439. }
  440. void mbedtls_memory_buffer_alloc_cur_get(size_t *cur_used, size_t *cur_blocks)
  441. {
  442. *cur_used = heap.total_used;
  443. *cur_blocks = heap.header_count;
  444. }
  445. #endif /* MBEDTLS_MEMORY_DEBUG */
  446. #if defined(MBEDTLS_THREADING_C)
  447. static void *buffer_alloc_calloc_mutexed(size_t n, size_t size)
  448. {
  449. void *buf;
  450. if (mbedtls_mutex_lock(&heap.mutex) != 0) {
  451. return NULL;
  452. }
  453. buf = buffer_alloc_calloc(n, size);
  454. if (mbedtls_mutex_unlock(&heap.mutex)) {
  455. return NULL;
  456. }
  457. return buf;
  458. }
  459. static void buffer_alloc_free_mutexed(void *ptr)
  460. {
  461. /* We have no good option here, but corrupting the heap seems
  462. * worse than losing memory. */
  463. if (mbedtls_mutex_lock(&heap.mutex)) {
  464. return;
  465. }
  466. buffer_alloc_free(ptr);
  467. (void) mbedtls_mutex_unlock(&heap.mutex);
  468. }
  469. #endif /* MBEDTLS_THREADING_C */
  470. void mbedtls_memory_buffer_alloc_init(unsigned char *buf, size_t len)
  471. {
  472. memset(&heap, 0, sizeof(buffer_alloc_ctx));
  473. #if defined(MBEDTLS_THREADING_C)
  474. mbedtls_mutex_init(&heap.mutex);
  475. mbedtls_platform_set_calloc_free(buffer_alloc_calloc_mutexed,
  476. buffer_alloc_free_mutexed);
  477. #else
  478. mbedtls_platform_set_calloc_free(buffer_alloc_calloc, buffer_alloc_free);
  479. #endif
  480. if (len < sizeof(memory_header) + MBEDTLS_MEMORY_ALIGN_MULTIPLE) {
  481. return;
  482. } else if ((size_t) buf % MBEDTLS_MEMORY_ALIGN_MULTIPLE) {
  483. /* Adjust len first since buf is used in the computation */
  484. len -= MBEDTLS_MEMORY_ALIGN_MULTIPLE
  485. - (size_t) buf % MBEDTLS_MEMORY_ALIGN_MULTIPLE;
  486. buf += MBEDTLS_MEMORY_ALIGN_MULTIPLE
  487. - (size_t) buf % MBEDTLS_MEMORY_ALIGN_MULTIPLE;
  488. }
  489. memset(buf, 0, len);
  490. heap.buf = buf;
  491. heap.len = len;
  492. heap.first = (memory_header *) buf;
  493. heap.first->size = len - sizeof(memory_header);
  494. heap.first->magic1 = MAGIC1;
  495. heap.first->magic2 = MAGIC2;
  496. heap.first_free = heap.first;
  497. }
  498. void mbedtls_memory_buffer_alloc_free(void)
  499. {
  500. #if defined(MBEDTLS_THREADING_C)
  501. mbedtls_mutex_free(&heap.mutex);
  502. #endif
  503. mbedtls_platform_zeroize(&heap, sizeof(buffer_alloc_ctx));
  504. }
  505. #if defined(MBEDTLS_SELF_TEST)
  506. static int check_pointer(void *p)
  507. {
  508. if (p == NULL) {
  509. return -1;
  510. }
  511. if ((size_t) p % MBEDTLS_MEMORY_ALIGN_MULTIPLE != 0) {
  512. return -1;
  513. }
  514. return 0;
  515. }
  516. static int check_all_free(void)
  517. {
  518. if (
  519. #if defined(MBEDTLS_MEMORY_DEBUG)
  520. heap.total_used != 0 ||
  521. #endif
  522. heap.first != heap.first_free ||
  523. (void *) heap.first != (void *) heap.buf) {
  524. return -1;
  525. }
  526. return 0;
  527. }
  528. #define TEST_ASSERT(condition) \
  529. if (!(condition)) \
  530. { \
  531. if (verbose != 0) \
  532. mbedtls_printf("failed\n"); \
  533. \
  534. ret = 1; \
  535. goto cleanup; \
  536. }
  537. int mbedtls_memory_buffer_alloc_self_test(int verbose)
  538. {
  539. unsigned char buf[1024];
  540. unsigned char *p, *q, *r, *end;
  541. int ret = 0;
  542. if (verbose != 0) {
  543. mbedtls_printf(" MBA test #1 (basic alloc-free cycle): ");
  544. }
  545. mbedtls_memory_buffer_alloc_init(buf, sizeof(buf));
  546. p = mbedtls_calloc(1, 1);
  547. q = mbedtls_calloc(1, 128);
  548. r = mbedtls_calloc(1, 16);
  549. TEST_ASSERT(check_pointer(p) == 0 &&
  550. check_pointer(q) == 0 &&
  551. check_pointer(r) == 0);
  552. mbedtls_free(r);
  553. mbedtls_free(q);
  554. mbedtls_free(p);
  555. TEST_ASSERT(check_all_free() == 0);
  556. /* Memorize end to compare with the next test */
  557. end = heap.buf + heap.len;
  558. mbedtls_memory_buffer_alloc_free();
  559. if (verbose != 0) {
  560. mbedtls_printf("passed\n");
  561. }
  562. if (verbose != 0) {
  563. mbedtls_printf(" MBA test #2 (buf not aligned): ");
  564. }
  565. mbedtls_memory_buffer_alloc_init(buf + 1, sizeof(buf) - 1);
  566. TEST_ASSERT(heap.buf + heap.len == end);
  567. p = mbedtls_calloc(1, 1);
  568. q = mbedtls_calloc(1, 128);
  569. r = mbedtls_calloc(1, 16);
  570. TEST_ASSERT(check_pointer(p) == 0 &&
  571. check_pointer(q) == 0 &&
  572. check_pointer(r) == 0);
  573. mbedtls_free(r);
  574. mbedtls_free(q);
  575. mbedtls_free(p);
  576. TEST_ASSERT(check_all_free() == 0);
  577. mbedtls_memory_buffer_alloc_free();
  578. if (verbose != 0) {
  579. mbedtls_printf("passed\n");
  580. }
  581. if (verbose != 0) {
  582. mbedtls_printf(" MBA test #3 (full): ");
  583. }
  584. mbedtls_memory_buffer_alloc_init(buf, sizeof(buf));
  585. p = mbedtls_calloc(1, sizeof(buf) - sizeof(memory_header));
  586. TEST_ASSERT(check_pointer(p) == 0);
  587. TEST_ASSERT(mbedtls_calloc(1, 1) == NULL);
  588. mbedtls_free(p);
  589. p = mbedtls_calloc(1, sizeof(buf) - 2 * sizeof(memory_header) - 16);
  590. q = mbedtls_calloc(1, 16);
  591. TEST_ASSERT(check_pointer(p) == 0 && check_pointer(q) == 0);
  592. TEST_ASSERT(mbedtls_calloc(1, 1) == NULL);
  593. mbedtls_free(q);
  594. TEST_ASSERT(mbedtls_calloc(1, 17) == NULL);
  595. mbedtls_free(p);
  596. TEST_ASSERT(check_all_free() == 0);
  597. mbedtls_memory_buffer_alloc_free();
  598. if (verbose != 0) {
  599. mbedtls_printf("passed\n");
  600. }
  601. cleanup:
  602. mbedtls_memory_buffer_alloc_free();
  603. return ret;
  604. }
  605. #endif /* MBEDTLS_SELF_TEST */
  606. #endif /* MBEDTLS_MEMORY_BUFFER_ALLOC_C */