| | 1 | /* |
| | 2 | * Copyright (c) 2011 Vojtech Horky |
| | 3 | * All rights reserved. |
| | 4 | * |
| | 5 | * Redistribution and use in source and binary forms, with or without |
| | 6 | * modification, are permitted provided that the following conditions |
| | 7 | * are met: |
| | 8 | * |
| | 9 | * - Redistributions of source code must retain the above copyright |
| | 10 | * notice, this list of conditions and the following disclaimer. |
| | 11 | * - Redistributions in binary form must reproduce the above copyright |
| | 12 | * notice, this list of conditions and the following disclaimer in the |
| | 13 | * documentation and/or other materials provided with the distribution. |
| | 14 | * - The name of the author may not be used to endorse or promote products |
| | 15 | * derived from this software without specific prior written permission. |
| | 16 | * |
| | 17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
| | 18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| | 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
| | 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
| | 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| | 22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| | 23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| | 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| | 25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
| | 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| | 27 | */ |
| | 28 | |
| | 29 | #include <stdio.h> |
| | 30 | #include <stdlib.h> |
| | 31 | #include <stdint.h> |
| | 32 | #include <malloc.h> |
| | 33 | |
| | 34 | #define ALLOC_ORDER_MAX 30 |
| | 35 | |
| | 36 | static void touch_buffer(uint8_t *buffer, size_t size) |
| | 37 | { |
| | 38 | while (size > 0) { |
| | 39 | *buffer = 0xAA; |
| | 40 | buffer++; |
| | 41 | size--; |
| | 42 | } |
| | 43 | } |
| | 44 | |
| | 45 | static int try_malloc(size_t size) |
| | 46 | { |
| | 47 | void *ptr = malloc(size); |
| | 48 | if (ptr == NULL) { |
| | 49 | return 0; |
| | 50 | } |
| | 51 | touch_buffer((uint8_t *) ptr, size); |
| | 52 | free(ptr); |
| | 53 | return 1; |
| | 54 | } |
| | 55 | |
| | 56 | static int try_memalign(size_t align, size_t size) |
| | 57 | { |
| | 58 | void *ptr = memalign(align, size); |
| | 59 | if (ptr == NULL) { |
| | 60 | return 0; |
| | 61 | } |
| | 62 | touch_buffer((uint8_t *) ptr, size); |
| | 63 | free(ptr); |
| | 64 | return 1; |
| | 65 | } |
| | 66 | |
| | 67 | static void run_malloc(void) |
| | 68 | { |
| | 69 | printf("malloc: "); |
| | 70 | for (size_t i = 0; i < ALLOC_ORDER_MAX; i++) { |
| | 71 | int ok = try_malloc(1 << i); |
| | 72 | if (ok) { |
| | 73 | printf(" %2zu", i); |
| | 74 | } else { |
| | 75 | printf(" -"); |
| | 76 | } |
| | 77 | } |
| | 78 | printf("\n"); |
| | 79 | } |
| | 80 | |
| | 81 | static void run_memalign(void) |
| | 82 | { |
| | 83 | printf("memalign:"); |
| | 84 | for (size_t i = 0; i < ALLOC_ORDER_MAX; i++) { |
| | 85 | int ok = try_memalign(1 << i, 32); |
| | 86 | if (ok) { |
| | 87 | printf(" %2zu", i); |
| | 88 | } else { |
| | 89 | printf(" -"); |
| | 90 | } |
| | 91 | } |
| | 92 | printf("\n"); |
| | 93 | } |
| | 94 | |
| | 95 | int main(int argc, char *argv[]) |
| | 96 | { |
| | 97 | setvbuf(stdout, NULL, _IONBF, 0); |
| | 98 | |
| | 99 | run_memalign(); |
| | 100 | run_malloc(); |
| | 101 | run_malloc(); |
| | 102 | run_memalign(); |
| | 103 | run_memalign(); |
| | 104 | run_memalign(); |
| | 105 | run_memalign(); |
| | 106 | run_memalign(); |
| | 107 | run_memalign(); |
| | 108 | run_memalign(); |
| | 109 | run_memalign(); |
| | 110 | run_malloc(); |
| | 111 | |
| | 112 | return 0; |
| | 113 | } |
| | 114 | |
| | 115 | /** @} |
| | 116 | */ |