| 1 |
/* |
| 2 |
* Copyright (c) 1999 - 2004 Kungliga Tekniska Högskolan |
| 3 |
* (Royal Institute of Technology, Stockholm, Sweden). |
| 4 |
* All rights reserved. |
| 5 |
* |
| 6 |
* Redistribution and use in source and binary forms, with or without |
| 7 |
* modification, are permitted provided that the following conditions |
| 8 |
* are met: |
| 9 |
* |
| 10 |
* 1. Redistributions of source code must retain the above copyright |
| 11 |
* notice, this list of conditions and the following disclaimer. |
| 12 |
* |
| 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. |
| 16 |
* |
| 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. |
| 20 |
* |
| 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 |
| 31 |
* SUCH DAMAGE. |
| 32 |
*/ |
| 33 |
|
| 34 |
#include <config.h> |
| 35 |
|
| 36 |
#ifdef HAVE_SYS_MMAN_H |
| 37 |
#include <sys/mman.h> |
| 38 |
#endif |
| 39 |
#include <stdio.h> |
| 40 |
#include <string.h> |
| 41 |
#include <err.h> |
| 42 |
#include "roken.h" |
| 43 |
|
| 44 |
#include "test-mem.h" |
| 45 |
|
| 46 |
/* #undef HAVE_MMAP */ |
| 47 |
|
| 48 |
struct { |
| 49 |
void *start; |
| 50 |
size_t size; |
| 51 |
void *data_start; |
| 52 |
size_t data_size; |
| 53 |
enum rk_test_mem_type type; |
| 54 |
int fd; |
| 55 |
} map; |
| 56 |
|
| 57 |
#ifdef HAVE_SIGACTION |
| 58 |
|
| 59 |
struct sigaction sa, osa; |
| 60 |
|
| 61 |
#else |
| 62 |
|
| 63 |
void (* osigh)(int); |
| 64 |
|
| 65 |
#endif |
| 66 |
|
| 67 |
char *testname; |
| 68 |
|
| 69 |
static RETSIGTYPE |
| 70 |
segv_handler(int sig) |
| 71 |
{ |
| 72 |
int fd; |
| 73 |
ssize_t ret; |
| 74 |
char msg[] = "SIGSEGV i current test: "; |
| 75 |
|
| 76 |
fd = open("/dev/stdout", O_WRONLY, 0600); |
| 77 |
if (fd >= 0) { |
| 78 |
ret = write(fd, msg, sizeof(msg) - 1); |
| 79 |
if (ret != -1) |
| 80 |
ret = write(fd, testname, strlen(testname)); |
| 81 |
if (ret != -1) |
| 82 |
ret = write(fd, "\n", 1); |
| 83 |
close(fd); |
| 84 |
} |
| 85 |
_exit(1); |
| 86 |
} |
| 87 |
|
| 88 |
#define TESTREC() \ |
| 89 |
if (testname) \ |
| 90 |
errx(1, "test %s run recursively on %s", name, testname); \ |
| 91 |
testname = strdup(name); \ |
| 92 |
if (testname == NULL) \ |
| 93 |
errx(1, "malloc"); |
| 94 |
|
| 95 |
|
| 96 |
ROKEN_LIB_FUNCTION void * ROKEN_LIB_CALL |
| 97 |
rk_test_mem_alloc(enum rk_test_mem_type type, const char *name, |
| 98 |
void *buf, size_t size) |
| 99 |
{ |
| 100 |
#ifndef HAVE_MMAP |
| 101 |
unsigned char *p; |
| 102 |
|
| 103 |
TESTREC(); |
| 104 |
|
| 105 |
p = malloc(size + 2); |
| 106 |
if (p == NULL) |
| 107 |
errx(1, "malloc"); |
| 108 |
map.type = type; |
| 109 |
map.start = p; |
| 110 |
map.size = size + 2; |
| 111 |
p[0] = 0xff; |
| 112 |
p[map.size-1] = 0xff; |
| 113 |
map.data_start = p + 1; |
| 114 |
#else |
| 115 |
unsigned char *p; |
| 116 |
int flags, ret, fd; |
| 117 |
size_t pagesize = getpagesize(); |
| 118 |
|
| 119 |
TESTREC(); |
| 120 |
|
| 121 |
map.type = type; |
| 122 |
|
| 123 |
#ifdef MAP_ANON |
| 124 |
flags = MAP_ANON; |
| 125 |
fd = -1; |
| 126 |
#else |
| 127 |
flags = 0; |
| 128 |
fd = open ("/dev/zero", O_RDONLY); |
| 129 |
if(fd < 0) |
| 130 |
err (1, "open /dev/zero"); |
| 131 |
#endif |
| 132 |
map.fd = fd; |
| 133 |
flags |= MAP_PRIVATE; |
| 134 |
|
| 135 |
map.size = size + pagesize - (size % pagesize) + pagesize * 2; |
| 136 |
|
| 137 |
p = (unsigned char *)mmap(0, map.size, PROT_READ | PROT_WRITE, |
| 138 |
flags, fd, 0); |
| 139 |
if (p == (unsigned char *)MAP_FAILED) |
| 140 |
err (1, "mmap"); |
| 141 |
|
| 142 |
map.start = p; |
| 143 |
|
| 144 |
ret = mprotect ((void *)p, pagesize, 0); |
| 145 |
if (ret < 0) |
| 146 |
err (1, "mprotect"); |
| 147 |
|
| 148 |
ret = mprotect (p + map.size - pagesize, pagesize, 0); |
| 149 |
if (ret < 0) |
| 150 |
err (1, "mprotect"); |
| 151 |
|
| 152 |
switch (type) { |
| 153 |
case RK_TM_OVERRUN: |
| 154 |
map.data_start = p + map.size - pagesize - size; |
| 155 |
break; |
| 156 |
case RK_TM_UNDERRUN: |
| 157 |
map.data_start = p + pagesize; |
| 158 |
break; |
| 159 |
default: |
| 160 |
abort(); |
| 161 |
} |
| 162 |
#endif |
| 163 |
#ifdef HAVE_SIGACTION |
| 164 |
sigemptyset (&sa.sa_mask); |
| 165 |
sa.sa_flags = 0; |
| 166 |
#ifdef SA_RESETHAND |
| 167 |
sa.sa_flags |= SA_RESETHAND; |
| 168 |
#endif |
| 169 |
sa.sa_handler = segv_handler; |
| 170 |
sigaction (SIGSEGV, &sa, &osa); |
| 171 |
#else |
| 172 |
osigh = signal(SIGSEGV, segv_handler); |
| 173 |
#endif |
| 174 |
|
| 175 |
map.data_size = size; |
| 176 |
if (buf) |
| 177 |
memcpy(map.data_start, buf, size); |
| 178 |
return map.data_start; |
| 179 |
} |
| 180 |
|
| 181 |
ROKEN_LIB_FUNCTION void ROKEN_LIB_CALL |
| 182 |
rk_test_mem_free(const char *map_name) |
| 183 |
{ |
| 184 |
#ifndef HAVE_MMAP |
| 185 |
unsigned char *p = map.start; |
| 186 |
|
| 187 |
if (testname == NULL) |
| 188 |
errx(1, "test_mem_free call on no free"); |
| 189 |
|
| 190 |
if (p[0] != 0xff) |
| 191 |
errx(1, "%s: %s underrun %x\n", testname, map_name, p[0]); |
| 192 |
if (p[map.size-1] != 0xff) |
| 193 |
errx(1, "%s: %s overrun %x\n", testname, map_name, p[map.size - 1]); |
| 194 |
free(map.start); |
| 195 |
#else |
| 196 |
int ret; |
| 197 |
|
| 198 |
if (testname == NULL) |
| 199 |
errx(1, "test_mem_free call on no free"); |
| 200 |
|
| 201 |
ret = munmap (map.start, map.size); |
| 202 |
if (ret < 0) |
| 203 |
err (1, "munmap"); |
| 204 |
if (map.fd > 0) |
| 205 |
close(map.fd); |
| 206 |
#endif |
| 207 |
free(testname); |
| 208 |
testname = NULL; |
| 209 |
|
| 210 |
#ifdef HAVE_SIGACTION |
| 211 |
sigaction (SIGSEGV, &osa, NULL); |
| 212 |
#else |
| 213 |
signal (SIGSEGV, osigh); |
| 214 |
#endif |
| 215 |
} |