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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
/*
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright © 2020 Keith Packard
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#define _GNU_SOURCE
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>
#include <malloc.h>
#include <stdlib.h>
#include <stdint.h>
#if ((__GNUC__ == 4 && __GNUC_MINOR__ >= 2) || __GNUC__ > 4)
#pragma GCC diagnostic ignored "-Wpragmas"
#pragma GCC diagnostic ignored "-Wunknown-warning-option"
#pragma GCC diagnostic ignored "-Walloc-size-larger-than="
#pragma GCC diagnostic ignored "-Wanalyzer-use-of-uninitialized-value"
#pragma GCC diagnostic ignored "-Wanalyzer-use-after-free"
#pragma GCC diagnostic ignored "-Wanalyzer-out-of-bounds"
#pragma GCC diagnostic ignored "-Wuse-after-free"
#pragma GCC diagnostic ignored "-Warray-bounds"
#endif
#ifdef __clang__
#define CHECK_ERRNO() 0
#else
#define CHECK_ERRNO() (errno != ENOMEM)
#endif
#ifndef __disable_sanitizer
#define __disable_sanitizer
#endif
int __disable_sanitizer
main(void)
{
void *r, *q;
int result = 0;
int err, pow;
errno = 0;
r = malloc(0);
// printf("malloc(0): %p\n", r);
if (errno != 0) {
printf("malloc(0) failed: %s. got %p\n", strerror(errno), r);
result = 1;
}
free(r);
r = memalign(128, 237);
// printf("memalign(128, 237): %p\n", r);
if ((uintptr_t)r & 127) {
printf("memalign(128, 237) unaligned (%p)\n", r);
result = 1;
}
free(r);
r = NULL;
err = posix_memalign(&r, 128, 237);
// printf("posix_memalign(128, 237): %p, err=%d\n", r, err);
if ((uintptr_t)r & 127) {
printf("posix_memalign(128, 237) unaligned (%p)\n", r);
err++;
}
free(r);
r = NULL;
err = posix_memalign(&r, 0, 237);
// printf("posix_memalign(0, 237): %p, err=%d\n", r, err);
if (err != EINVAL) {
printf("posix_memalign(0, 237) should return EINVAL\n");
err++;
}
free(r);
r = NULL;
err = posix_memalign(&r, 129, 237);
// printf("posix_memalign(129, 237): %p, err=%d\n", r, err);
if (err != EINVAL) {
printf("posix_memalign(129, 237) should return EINVAL\n");
err++;
}
free(r);
r = NULL;
err = posix_memalign(&r, 128, PTRDIFF_MAX);
// printf("posix_memalign(128, PTRDIFF_MAX): %p, err=%d\n", r, err);
if (err != ENOMEM) {
printf("posix_memalign(128, PTRDIFF_MAX) should return ENOMEM\n");
err++;
}
free(r);
errno = 0;
r = malloc(PTRDIFF_MAX);
q = NULL;
if (r)
q = malloc(PTRDIFF_MAX);
// printf("malloc(PTRDIFF_MAX: %p %p\n", r, q);
if ((r && q) || CHECK_ERRNO()) {
printf("2*malloc(PTRDIFF_MAX) should have failed. got %p,%p error %s\n", r, q,
strerror(errno));
result = 1;
}
free(r);
free(q);
errno = 0;
r = malloc(SIZE_MAX);
// printf("malloc(SIZE_MAX): %p\n", r);
if (r || CHECK_ERRNO()) {
printf("malloc(SIZE_MAX) should have failed. got %p error %s\n", r, strerror(errno));
result = 1;
}
errno = 0;
r = calloc(1, SIZE_MAX);
// printf("calloc(1, SIZE_MAX): %p\n", r);
if (r || CHECK_ERRNO()) {
printf("calloc(1, SIZE_MAX) should have failed. got %p error %s\n", r, strerror(errno));
result = 1;
}
free(r);
errno = 0;
r = reallocarray(NULL, 1, SIZE_MAX);
// printf("reallocarray(NULL, 1, SIZE_MAX): %p\n", r);
if (r || CHECK_ERRNO()) {
printf("reallocarray(NULL, 1, SIZE_MAX) should have failed. got %p error %s\n", r,
strerror(errno));
result = 1;
}
for (pow = 0; pow < 4; pow++) {
errno = 0;
r = calloc(SIZE_MAX >> pow, SIZE_MAX >> pow);
// printf("calloc(SIZE_MAX >> %d, SIZE_MAX >> %d): %p\n", pow, pow, r);
if (r || CHECK_ERRNO()) {
printf("calloc(SIZE_MAX >> %d, SIZE_MAX >> %d) should have failed. got %p error %s\n",
pow, pow, r, strerror(errno));
result = 1;
}
free(r);
r = reallocarray(NULL, SIZE_MAX >> pow, SIZE_MAX >> pow);
// printf("reallocarray(SIZE_MAX >> %d, SIZE_MAX >> %d): %p\n", pow, pow, r);
if (r || CHECK_ERRNO()) {
printf("reallocarray(NULL, SIZE_MAX >> %d, SIZE_MAX >> %d) should have failed. got %p "
"error %s\n",
pow, pow, r, strerror(errno));
result = 1;
}
free(r);
}
char *fzero = malloc(128);
int wrong = 0;
if (fzero) {
for (pow = 0; pow < 128; pow++)
fzero[pow] = pow + 2;
#ifndef __MALLOC_CLEAR_FREED
#ifdef __GLIBC__
explicit_bzero(fzero, 128);
#else
memset_explicit(fzero, 0, 128);
#endif
#endif
free(fzero);
for (pow = 0; pow < 128; pow++)
if (fzero[pow] == pow + 2) {
wrong++;
break;
}
}
if (wrong > 3) {
printf("free: %d bytes of memory not cleared\n", wrong);
result = 1;
}
#ifdef __PICOLIBC__
wrong = 0;
char *rzero = malloc(128);
if (rzero) {
for (pow = 0; pow < 128; pow++)
rzero[pow] = pow + 2;
#ifndef __MALLOC_CLEAR_FREED
#ifdef __GLIBC__
explicit_bzero(rzero + 16, 128 - 16);
#else
memset_explicit(rzero + 16, 0, 128 - 16);
#endif
#endif
char *newrzero = realloc(rzero, 16);
if (newrzero) {
rzero = newrzero;
for (pow = 16; pow < 128; pow++) {
if (rzero[pow] == pow + 2) {
wrong++;
break;
}
}
}
}
free(rzero);
if (wrong > 3) {
printf("realloc: %d bytes of memory not cleared\n", wrong);
result = 1;
}
#endif
/* make sure realloc doesn't read past the source */
void *big = malloc(1024);
// printf("big %p\n", big);
if (big) {
memset(big, '1', 1024);
void *small = malloc(128);
// printf("small %p\n", small);
if (small) {
memset(small, '2', 128);
(void)atoi(small);
free(big);
char *med = realloc(small, 1024);
if (med) {
// printf("med %p\n", med);
#ifdef __NANO_MALLOC
int i;
for (i = 128; i < 1024; i++)
if (med[i] != 0) {
printf("looks like realloc read past old at %d (saw %d)\n", i, med[i]);
++result;
}
#endif
free(med);
small = NULL;
}
free(small);
}
}
malloc_stats();
return result;
}