Changes in src/tests/alloc.c [6065b3aa:fab700b]
- File:
-
- 1 edited
-
src/tests/alloc.c (modified) (12 diffs)
Legend:
- Unmodified
- Added
- Removed
-
src/tests/alloc.c
r6065b3aa rfab700b 10 10 // Created On : Wed Feb 3 07:56:22 2016 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Jun 1 21:33:49201713 // Update Count : 31512 // Last Modified On : Mon May 29 11:33:15 2017 13 // Update Count : 228 14 14 // 15 15 … … 18 18 #include <malloc.h> // malloc_usable_size 19 19 #include <stdint.h> // uintptr_t 20 #include <stdlib.h> // posix_memalign21 20 } // extern 22 21 #include <fstream> … … 29 28 int main( void ) { 30 29 size_t dim = 10; 30 struct S { int x; double y; } * s; 31 31 int * p; 32 char fill = '\1';33 32 34 33 // allocation, non-array types … … 36 35 p = (void *)malloc( sizeof(*p) ); // C malloc, type unsafe 37 36 *p = 0xdeadbeef; 38 printf( "C malloc % #x\n", *p );37 printf( "C malloc %x\n", *p ); 39 38 free( p ); 40 39 41 40 p = malloc(); // CFA malloc, type safe 42 *p = 0xdeadbeef; 43 printf( "CFA malloc %#x\n", *p ); 44 free( p ); 45 46 p = alloc(); // CFA alloc, type safe 47 *p = 0xdeadbeef; 48 printf( "CFA alloc %#x\n", *p ); 49 free( p ); 50 51 p = alloc( fill ); // CFA alloc, fill 52 printf( "CFA alloc, fill %08x\n", *p ); 41 printf( "CFA malloc %d\n", *p ); 42 free( p ); 43 44 p = malloc( '\1' ); // CFA malloc, fill 45 printf( "CFA malloc, fill %08x\n", *p ); 53 46 54 47 … … 57 50 58 51 p = calloc( dim, sizeof( *p ) ); // C array calloc, type unsafe 59 printf( "C array calloc, fill 0\n" );60 for ( int i = 0; i < dim; i += 1 ) { printf( "% #x ", p[i] ); }52 printf( "C calloc\n" ); 53 for ( int i = 0; i < dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 61 54 printf( "\n" ); 62 55 free( p ); 63 56 64 57 p = calloc( dim ); // CFA array calloc, type safe 65 printf( "CFA array calloc, fill 0\n" ); 66 for ( int i = 0; i < dim; i += 1 ) { printf( "%#x ", p[i] ); } 67 printf( "\n" ); 68 free( p ); 69 70 p = alloc( dim ); // CFA array alloc, type safe 71 for ( int i = 0; i < dim; i += 1 ) { p[i] = 0xdeadbeef; } 72 printf( "CFA array alloc, no fill\n" ); 73 for ( int i = 0; i < dim; i += 1 ) { printf( "%#x ", p[i] ); } 74 printf( "\n" ); 75 free( p ); 76 77 p = alloc( 2 * dim, fill ); // CFA array alloc, fill 78 printf( "CFA array alloc, fill %#x\n", fill ); 79 for ( int i = 0; i < 2 * dim; i += 1 ) { printf( "%#x ", p[i] ); } 58 printf( "CFA calloc\n" ); 59 for ( int i = 0; i < dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 60 printf( "\n" ); 61 free( p ); 62 63 p = amalloc( dim ); // CFA array malloc, type safe 64 printf( "CFA array malloc\n" ); 65 for ( int i = 0; i < dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 66 printf( "\n" ); 67 free( p ); 68 69 p = amalloc( 2 * dim, '\1' ); // CFA array malloc, fill 70 printf( "CFA array malloc\n" ); 71 for ( int i = 0; i < 2 * dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 80 72 printf( "\n" ); 81 73 // do not free … … 85 77 printf( "\n" ); 86 78 87 p = (void *)realloc( p, dim * sizeof(*p) ); // C realloc 88 for ( int i = 0; i < dim; i += 1 ) { p[i] = 0xdeadbeef; } 89 printf( "C realloc %ld\n", malloc_usable_size( p ) ); 90 for ( int i = 0; i < dim; i += 1 ) { printf( "%#x ", p[i] ); } 79 p = (void *)realloc( p, dim * sizeof(*p) ); // CFA realloc 80 printf( "C realloc\n" ); 81 for ( int i = 0; i < dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 91 82 printf( "\n" ); 92 83 93 84 p = realloc( p, 2 * dim * sizeof(*p) ); // CFA realloc 94 for ( int i = dim; i < 2 * dim; i += 1 ) { p[i] = 0x1010101; } 95 printf( "CFA realloc %ld\n", malloc_usable_size( p ) ); 96 for ( int i = 0; i < 2 * dim; i += 1 ) { printf( "%#x ", p[i] ); } 85 printf( "CFA realloc\n" ); 86 for ( int i = 0; i < 2 * dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 87 printf( "\n" ); 88 89 p = realloc( p, dim * sizeof(*p), '\1' ); // CFA realloc 90 printf( "CFA realloc\n" ); 91 for ( int i = 0; i < dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 92 printf( "\n" ); 93 94 p = malloc( p, dim * sizeof(*p) ); // CFA malloc 95 printf( "CFA resize malloc\n" ); 96 for ( int i = 0; i < dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 97 printf( "\n" ); 98 99 p = malloc( p, 2 * dim * sizeof(*p), '\1' ); // CFA malloc, fill 100 printf( "CFA resize malloc, fill\n" ); 101 for ( int i = 0; i < 2 * dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 102 printf( "\n" ); 103 104 p = malloc( p, dim * sizeof(*p), '\1' ); // CFA malloc, fill 105 printf( "CFA resize malloc, fill\n" ); 106 for ( int i = 0; i < dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 97 107 printf( "\n" ); 98 108 // do not free … … 102 112 printf( "\n" ); 103 113 104 p = alloc( p, dim ); // CFA resize array alloc 105 for ( int i = 0; i < dim; i += 1 ) { p[i] = 0xdeadbeef; } 106 printf( "CFA resize alloc %ld\n", malloc_usable_size( p ) ); 107 for ( int i = 0; i < dim; i += 1 ) { printf( "%#x ", p[i] ); } 108 printf( "\n" ); 109 110 p = alloc( p, 2 * dim ); // CFA resize array alloc 111 for ( int i = dim; i < 2 * dim; i += 1 ) { p[i] = 0x1010101; } 112 printf( "CFA resize array alloc %ld\n", malloc_usable_size( p ) ); 113 for ( int i = 0; i < 2 * dim; i += 1 ) { printf( "%#x ", p[i] ); } 114 printf( "\n" ); 115 116 p = alloc( p, dim ); // CFA array alloc 117 printf( "CFA resize array alloc %ld\n", malloc_usable_size( p ) ); 118 for ( int i = 0; i < dim; i += 1 ) { printf( "%#x ", p[i] ); } 119 printf( "\n" ); 120 114 p = amalloc( p, 2 * dim ); // CFA array malloc 115 printf( "CFA resize array malloc\n" ); 116 for ( int i = 0; i < 2 * dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 117 printf( "\n" ); 118 119 p = amalloc( p, dim ); // CFA array malloc 120 printf( "CFA resize array malloc\n" ); 121 for ( int i = 0; i < dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 122 printf( "\n" ); 123 124 p = amalloc( p, 2 * dim, '\1' ); // CFA array malloc, fill 125 printf( "CFA resize array malloc, fill\n" ); 126 for ( int i = 0; i < 2 * dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 127 printf( "\n" ); 128 129 p = amalloc( p, dim, '\1' ); // CFA array malloc, fill 130 printf( "CFA resize array malloc, fill\n" ); 131 for ( int i = 0; i < dim; i += 1 ) { printf( "%x ", p[i] ); p[i] = 0Xdeadbeef; } 121 132 free( p ); 122 p = 0; 123 124 p = alloc( p, dim, fill ); // CFA array alloc, fill 125 printf( "CFA resize array alloc %ld, fill\n", malloc_usable_size( p ) ); 126 for ( int i = 0; i < dim; i += 1 ) { printf( "%#x ", p[i] ); } 127 printf( "\n" ); 128 129 p = alloc( p, 2 * dim, fill ); // CFA array alloc, fill 130 printf( "CFA resize array alloc %ld, fill\n", malloc_usable_size( p ) ); 131 for ( int i = 0; i < 2 * dim; i += 1 ) { printf( "%#x ", p[i] ); } 132 printf( "\n" ); 133 134 p = alloc( p, dim, fill ); // CFA array alloc, fill 135 printf( "CFA resize array alloc %ld, fill\n", malloc_usable_size( p ) ); 136 for ( int i = 0; i < dim; i += 1 ) { printf( "%#x ", p[i] );; } 137 printf( "\n" ); 138 free( p ); 139 133 printf( "\n" ); 140 134 141 135 struct Struct { int x; double y; }; 142 Struct st, st1, sta[dim], sta1[dim], * stp, * stp1; 136 Struct st, st1, sta[dim], sta1[dim], * stp; 137 143 138 144 139 // alignment, non-array types 145 140 printf( "\n" ); 141 146 142 enum { Alignment = 128 }; 147 148 stp = (memalign( Alignment, sizeof( *stp ) ) ){ 42, 42.5 }; // C memalign 149 assert( (uintptr_t)stp % Alignment == 0 ); 150 printf( "C memalign %d %g\n", stp->x, stp->y ); 151 free( stp ); 152 153 stp = (memalign( Alignment )){ 42, 42.5 }; // CFA memalign 143 stp = aligned_alloc( Alignment ); // CFA aligned_alloc 144 *stp = (Struct){ 42, 42.5 }; 145 assert( (uintptr_t)stp % Alignment == 0 ); 146 printf( "CFA aligned_alloc %d %g\n", stp->x, stp->y ); 147 free( stp ); 148 149 stp = memalign( Alignment ); // CFA memalign 150 *stp = (Struct){ 42, 42.5 }; 154 151 assert( (uintptr_t)stp % Alignment == 0 ); 155 152 printf( "CFA memalign %d %g\n", stp->x, stp->y ); 156 free( stp );157 158 posix_memalign( (void **)&stp, Alignment, sizeof( *stp ) ); // C posix_memalign159 *stp = (Struct){ 42, 42.5 };160 assert( (uintptr_t)stp % Alignment == 0 );161 printf( "CFA posix_memalign %d %g\n", stp->x, stp->y );162 153 free( stp ); 163 154 … … 168 159 free( stp ); 169 160 170 stp = (aligned_alloc( Alignment )){ 42, 42.5 }; // CFA aligned_alloc 171 assert( (uintptr_t)stp % Alignment == 0 ); 172 printf( "CFA aligned_alloc %d %g\n", stp->x, stp->y ); 173 free( stp ); 174 175 stp = (align_alloc( Alignment )){ 42, 42.5 }; // CFA align_alloc 176 assert( (uintptr_t)stp % Alignment == 0 ); 177 printf( "CFA align_alloc %d %g\n", stp->x, stp->y ); 178 free( stp ); 179 180 stp = align_alloc( Alignment, fill ); // CFA memalign, fill 181 assert( (uintptr_t)stp % Alignment == 0 ); 182 printf( "CFA align_alloc fill %#x %a\n", stp->x, stp->y ); 161 stp = memalign( Alignment, '\1' ); // CFA memalign, fill 162 assert( (uintptr_t)stp % Alignment == 0 ); 163 printf( "CFA memalign fill %d %g\n", stp->x, stp->y ); 183 164 free( stp ); 184 165 … … 187 168 printf( "\n" ); 188 169 189 stp = align_alloc( Alignment, dim ); // CFA array memalign 190 assert( (uintptr_t)stp % Alignment == 0 ); 191 for ( int i = 0; i < dim; i += 1 ) { stp[i] = (Struct){ 42, 42.5 }; } 192 printf( "CFA array align_alloc\n" ); 193 for ( int i = 0; i < dim; i += 1 ) { printf( "%d %g, ", stp[i].x, stp[i].y ); } 194 printf( "\n" ); 195 free( stp ); 196 197 stp = align_alloc( Alignment, dim, fill ); // CFA array memalign, fill 198 assert( (uintptr_t)stp % Alignment == 0 ); 199 printf( "CFA array align_alloc, fill\n" ); 200 for ( int i = 0; i < dim; i += 1 ) { printf( "%#x %a, ", stp[i].x, stp[i].y ); } 170 stp = amemalign( Alignment, 2 * dim ); // CFA array memalign 171 assert( (uintptr_t)stp % Alignment == 0 ); 172 printf( "CFA memalign array\n" ); 173 for ( int i = 0; i < 2 * dim; i += 1 ) { printf( "%x %g, ", stp[i].x, stp[i].y ); stp[i].x = 0Xdeadbeef, stp[i].y = -17.2; } 174 printf( "\n" ); 175 free( stp ); 176 177 stp = amemalign( Alignment, dim, '\1' ); // CFA array memalign, fill 178 assert( (uintptr_t)stp % Alignment == 0 ); 179 printf( "CFA memalign array\n" ); 180 for ( int i = 0; i < dim; i += 1 ) { printf( "%x %g, ", stp[i].x, stp[i].y ); stp[i].x = 0Xdeadbeef, stp[i].y = -17.2; } 201 181 printf( "\n" ); 202 182 free( stp ); … … 206 186 printf( "\n" ); 207 187 208 memset( &st, fill );// CFA memset, type safe209 printf( "CFA memset % #x %a\n", st.x, st.y );210 memcpy( &st1, &st );// CFA memcpy, type safe211 printf( "CFA memcpy % #x %a\n", st1.x, st1.y );188 stp = memset( &st, '\xff' ); // CFA memset, type safe 189 printf( "CFA memset %x %g\n", st.x, st.y ); 190 stp = memcpy( &st1, &st ); // CFA memcpy, type safe 191 printf( "CFA memcpy %x %g\n", st1.x, st1.y ); 212 192 213 193 … … 215 195 printf( "\n" ); 216 196 217 memset( sta, dim, fill );// CFA array memset, type safe197 stp = amemset( sta, dim, '\xff' ); // CFA array memset, type safe 218 198 printf( "CFA array memset\n" ); 219 for ( int i = 0; i < dim; i += 1 ) { printf( "% #x %a, ", sta[i].x, sta[i].y ); }220 printf( "\n" ); 221 222 memcpy( sta1, sta, dim );// CFA array memcpy, type safe199 for ( int i = 0; i < dim; i += 1 ) { printf( "%x %g, ", sta[i].x, sta[i].y ); sta[i].x = 0Xdeadbeef, sta[i].y = -17.2; } 200 printf( "\n" ); 201 202 stp = amemcpy( sta1, sta, dim ); // CFA array memcpy, type safe 223 203 printf( "CFA memcpy\n" ); 224 for ( int i = 0; i < dim; i += 1 ) { printf( "%#x %a, ", sta1[i].x, sta1[i].y ); } 225 printf( "\n" ); 226 227 228 // new, non-array types 229 printf( "\n" ); 230 231 stp = new( 42, 42.5 ); 232 stp1 = new( 42, 42.5 ); 233 printf( "CFA new initialize\n%d %g %d %g\n", stp->x, stp->y, stp1->x, stp1->y ); 234 delete( stp, stp1 ); 235 236 // new, array types 237 stp = anew( dim, 42, 42.5 ); 238 printf( "CFA array new initialize\n" ); 239 for ( int i = 0; i < dim; i += 1 ) { printf( "%d %g, ", stp[i].x, stp[i].y ); } 240 printf( "\n" ); 241 stp1 = anew( dim, 42, 42.5 ); 242 for ( int i = 0; i < dim; i += 1 ) { printf( "%d %g, ", stp1[i].x, stp1[i].y ); } 243 printf( "\n" ); 244 adelete( dim, stp, dim, stp1 ); 245 246 // extras 204 for ( int i = 0; i < dim; i += 1 ) { printf( "%x %g, ", sta1[i].x, sta1[i].y ); sta1[i].x = 0Xdeadbeef, sta1[i].y = -17.2; } 247 205 printf( "\n" ); 248 206 … … 253 211 p = foo( bar( baz( malloc(), 0 ), 0 ), 0 ); 254 212 *p = 0xdeadbeef; 255 printf( "CFA deep malloc % #x\n", *p );213 printf( "CFA deep malloc %x\n", *p ); 256 214 free( p ); 257 215 258 216 stp = malloc(); 259 217 printf( "\nSHOULD FAIL\n" ); 260 p = alloc( stp, dim * sizeof(*stp) );218 p = malloc( stp, dim * sizeof(*stp) ); 261 219 p = memset( stp, 10 ); 262 220 p = memcpy( &st1, &st );
Note:
See TracChangeset
for help on using the changeset viewer.
