2 * Copyright (c) 1999 - 2006 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 #ifdef HAVE_SYS_MMAN_H
45 #include "check-common.h"
47 RCSID("$Id: check-common.c 18751 2006-10-21 14:49:13Z lha $");
57 /* #undef HAVE_MMAP */
60 map_alloc(enum map_type type, const void *buf,
61 size_t size, struct map_page **map)
65 size_t len = size + sizeof(long) * 2;
68 *map = ecalloc(1, sizeof(**map));
74 (*map)->data_start = p + sizeof(long);
75 for (i = sizeof(long); i > 0; i--)
76 p[sizeof(long) - i] = 0xff - i;
77 for (i = sizeof(long); i > 0; i--)
78 p[len - i] = 0xff - i;
82 size_t pagesize = getpagesize();
84 *map = ecalloc(1, sizeof(**map));
93 fd = open ("/dev/zero", O_RDONLY);
95 err (1, "open /dev/zero");
99 (*map)->size = size + pagesize - (size % pagesize) + pagesize * 2;
101 p = (unsigned char *)mmap(0, (*map)->size, PROT_READ | PROT_WRITE,
103 if (p == (unsigned char *)MAP_FAILED)
108 ret = mprotect (p, pagesize, 0);
112 ret = mprotect (p + (*map)->size - pagesize, pagesize, 0);
118 (*map)->data_start = p + (*map)->size - pagesize - size;
121 (*map)->data_start = p + pagesize;
127 (*map)->data_size = size;
129 memcpy((*map)->data_start, buf, size);
130 return (*map)->data_start;
134 map_free(struct map_page *map, const char *test_name, const char *map_name)
137 unsigned char *p = map->start;
140 for (i = sizeof(long); i > 0; i--)
141 if (p[sizeof(long) - i] != 0xff - i)
142 errx(1, "%s: %s underrun %d\n", test_name, map_name, i);
143 for (i = sizeof(long); i > 0; i--)
144 if (p[map->size - i] != 0xff - i)
145 errx(1, "%s: %s overrun %lu\n", test_name, map_name,
146 (unsigned long)map->size - i);
151 ret = munmap (map->start, map->size);
159 print_bytes (unsigned const char *buf, size_t len)
163 for (i = 0; i < len; ++i)
164 printf ("%02x ", buf[i]);
168 #define MAP_FAILED (-1)
171 static char *current_test = "<uninit>";
172 static char *current_state = "<uninit>";
175 segv_handler(int sig)
178 char msg[] = "SIGSEGV i current test: ";
180 fd = open("/dev/stdout", O_WRONLY, 0600);
182 write(fd, msg, sizeof(msg));
183 write(fd, current_test, strlen(current_test));
185 write(fd, current_state, strlen(current_state));
193 generic_test (const struct test_case *tests,
196 int (*encode)(unsigned char *, size_t, void *, size_t *),
197 int (*length)(void *),
198 int (*decode)(unsigned char *, size_t, void *, size_t *),
199 int (*free_data)(void *),
200 int (*cmp)(void *a, void *b))
202 unsigned char *buf, *buf2;
206 struct map_page *data_map, *buf_map, *buf2_map;
208 struct sigaction sa, osa;
210 for (i = 0; i < ntests; ++i) {
212 size_t sz, consumed_sz, length_sz, buf_sz;
214 current_test = tests[i].name;
216 current_state = "init";
218 sigemptyset (&sa.sa_mask);
221 sa.sa_flags |= SA_RESETHAND;
223 sa.sa_handler = segv_handler;
224 sigaction (SIGSEGV, &sa, &osa);
226 data = map_alloc(OVERRUN, NULL, data_size, &data_map);
228 buf_sz = tests[i].byte_len;
229 buf = map_alloc(UNDERRUN, NULL, buf_sz, &buf_map);
231 current_state = "encode";
232 ret = (*encode) (buf + buf_sz - 1, buf_sz,
235 printf ("encoding of %s failed %d\n", tests[i].name, ret);
239 if (sz != tests[i].byte_len) {
240 printf ("encoding of %s has wrong len (%lu != %lu)\n",
242 (unsigned long)sz, (unsigned long)tests[i].byte_len);
247 current_state = "length";
248 length_sz = (*length) (tests[i].val);
249 if (sz != length_sz) {
250 printf ("length for %s is bad (%lu != %lu)\n",
251 tests[i].name, (unsigned long)length_sz, (unsigned long)sz);
256 current_state = "memcmp";
257 if (memcmp (buf, tests[i].bytes, tests[i].byte_len) != 0) {
258 printf ("encoding of %s has bad bytes:\n"
259 "correct: ", tests[i].name);
260 print_bytes ((unsigned char *)tests[i].bytes, tests[i].byte_len);
261 printf ("\nactual: ");
262 print_bytes (buf, sz);
268 buf2 = map_alloc(OVERRUN, buf, sz, &buf2_map);
270 current_state = "decode";
271 ret = (*decode) (buf2, sz, data, &consumed_sz);
273 printf ("decoding of %s failed %d\n", tests[i].name, ret);
277 if (sz != consumed_sz) {
278 printf ("different length decoding %s (%ld != %ld)\n",
280 (unsigned long)sz, (unsigned long)consumed_sz);
284 current_state = "cmp";
285 if ((*cmp)(data, tests[i].val) != 0) {
286 printf ("%s: comparison failed\n", tests[i].name);
290 current_state = "free";
294 current_state = "free";
295 map_free(buf_map, tests[i].name, "encode");
296 map_free(buf2_map, tests[i].name, "decode");
297 map_free(data_map, tests[i].name, "data");
299 sigaction (SIGSEGV, &osa, NULL);
301 current_state = "done";
308 * a test size (byte_len) of -1 means that the test tries to trigger a
309 * integer overflow (and later a malloc of to little memory), just
310 * allocate some memory and hope that is enough for that test.
314 generic_decode_fail (const struct test_case *tests,
317 int (*decode)(unsigned char *, size_t, void *, size_t *))
323 struct map_page *data_map, *buf_map;
325 struct sigaction sa, osa;
327 for (i = 0; i < ntests; ++i) {
332 current_test = tests[i].name;
334 current_state = "init";
336 sigemptyset (&sa.sa_mask);
339 sa.sa_flags |= SA_RESETHAND;
341 sa.sa_handler = segv_handler;
342 sigaction (SIGSEGV, &sa, &osa);
344 data = map_alloc(OVERRUN, NULL, data_size, &data_map);
346 if (tests[i].byte_len < 0xffffff && tests[i].byte_len >= 0) {
347 sz = tests[i].byte_len;
348 bytes = tests[i].bytes;
354 buf = map_alloc(OVERRUN, bytes, sz, &buf_map);
356 if (tests[i].byte_len == -1)
359 current_state = "decode";
360 ret = (*decode) (buf, tests[i].byte_len, data, &sz);
362 printf ("sucessfully decoded %s\n", tests[i].name);
367 current_state = "free";
369 map_free(buf_map, tests[i].name, "encode");
370 map_free(data_map, tests[i].name, "data");
372 sigaction (SIGSEGV, &osa, NULL);
374 current_state = "done";