1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
|
/* Test of allocating memory with given alignment.
Copyright (C) 2020-2022 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>. */
/* Written by Bruno Haible <bruno@clisp.org>, 2020. */
#include <config.h>
/* Specification. */
#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include "macros.h"
int
main (int argc, char *argv[])
{
#if HAVE_POSIX_MEMALIGN
static size_t sizes[] =
{ 13, 8, 17, 450, 320, 1, 99, 4, 15, 16, 2, 76, 37, 127, 2406, 641, 5781 };
void *aligned2_blocks[SIZEOF (sizes)];
void *aligned4_blocks[SIZEOF (sizes)];
void *aligned8_blocks[SIZEOF (sizes)];
void *aligned16_blocks[SIZEOF (sizes)];
void *aligned32_blocks[SIZEOF (sizes)];
void *aligned64_blocks[SIZEOF (sizes)];
size_t i;
for (i = 0; i < SIZEOF (sizes); i++)
{
size_t size = sizes[i];
if (sizeof (void *) <= 2)
{
ASSERT (posix_memalign (&aligned2_blocks[i], 2, size) == 0);
ASSERT (aligned2_blocks[i] != NULL);
ASSERT (((uintptr_t) aligned2_blocks[i] % 2) == 0);
memset (aligned2_blocks[i], 'u', size);
}
if (sizeof (void *) <= 4)
{
ASSERT (posix_memalign (&aligned4_blocks[i], 4, size) == 0);
ASSERT (aligned4_blocks[i] != NULL);
ASSERT (((uintptr_t) aligned4_blocks[i] % 4) == 0);
memset (aligned4_blocks[i], 'v', size);
}
ASSERT (posix_memalign (&aligned8_blocks[i], 8, size) == 0);
ASSERT (aligned8_blocks[i] != NULL);
ASSERT (((uintptr_t) aligned8_blocks[i] % 8) == 0);
memset (aligned8_blocks[i], 'w', size);
ASSERT (posix_memalign (&aligned16_blocks[i], 16, size) == 0);
ASSERT (aligned16_blocks[i] != NULL);
ASSERT (((uintptr_t) aligned16_blocks[i] % 16) == 0);
memset (aligned16_blocks[i], 'x', size);
ASSERT (posix_memalign (&aligned32_blocks[i], 32, size) == 0);
ASSERT (aligned32_blocks[i] != NULL);
ASSERT (((uintptr_t) aligned32_blocks[i] % 32) == 0);
memset (aligned32_blocks[i], 'y', size);
ASSERT (posix_memalign (&aligned64_blocks[i], 64, size) == 0);
ASSERT (aligned64_blocks[i] != NULL);
ASSERT (((uintptr_t) aligned64_blocks[i] % 64) == 0);
memset (aligned64_blocks[i], 'z', size);
}
for (i = 0; i < SIZEOF (sizes); i++)
{
if (sizeof (void *) <= 2)
free (aligned2_blocks[i]);
if (sizeof (void *) <= 4)
free (aligned4_blocks[i]);
free (aligned8_blocks[i]);
free (aligned16_blocks[i]);
free (aligned32_blocks[i]);
free (aligned64_blocks[i]);
}
return 0;
#else
fputs ("Skipping test: function 'aligned_alloc' does not exist\n", stderr);
return 77;
#endif
}
|
