1/*
2 * Copyright (c) 2002 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#include <sys/types.h>
37#ifdef HAVE_SYS_MMAN_H
38#include <sys/mman.h>
39#endif
40#include <fcntl.h>
41
42#include "roken.h"
43#include "resolve.h"
44
45struct dns_reply*
46parse_reply(const unsigned char *, size_t);
47
48enum { MAX_BUF = 36};
49
50static struct testcase {
51    unsigned char buf[MAX_BUF];
52    size_t buf_len;
53} tests[] = {
54    {{0x12, 0x67, 0x84, 0x00, 0x00, 0x01, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00,
55     0x03, 'f', 'o', 'o', 0x00,
56     0x00, 0x10, 0x00, 0x01,
57     0x03, 'f', 'o', 'o', 0x00,
58     0x00, 0x10, 0x00, 0x01,
59      0x00, 0x00, 0x12, 0x67, 0xff, 0xff}, 36}
60};
61
62#ifndef MAP_FAILED
63#define MAP_FAILED (-1)
64#endif
65
66static sig_atomic_t val = 0;
67
68static RETSIGTYPE
69segv_handler(int sig)
70{
71    val = 1;
72}
73
74int
75main(int argc, char **argv)
76{
77#ifndef HAVE_MMAP
78    return 77;			/* signal to automake that this test
79                                   cannot be run */
80#else /* HAVE_MMAP */
81    int ret;
82    int i;
83    struct sigaction sa;
84
85    sigemptyset (&sa.sa_mask);
86    sa.sa_flags = 0;
87    sa.sa_handler = segv_handler;
88    sigaction (SIGSEGV, &sa, NULL);
89
90    for (i = 0; val == 0 && i < sizeof(tests)/sizeof(tests[0]); ++i) {
91	const struct testcase *t = &tests[i];
92	unsigned char *p1, *p2;
93	int flags;
94	int fd;
95	size_t pagesize = getpagesize();
96	unsigned char *buf;
97
98#ifdef MAP_ANON
99	flags = MAP_ANON;
100	fd = -1;
101#else
102	flags = 0;
103	fd = open ("/dev/zero", O_RDONLY);
104	if(fd < 0)
105	    err (1, "open /dev/zero");
106#endif
107	flags |= MAP_PRIVATE;
108
109	p1 = (unsigned char *)mmap(0, 2 * pagesize, PROT_READ | PROT_WRITE,
110		  flags, fd, 0);
111	if (p1 == (unsigned char *)MAP_FAILED)
112	    err (1, "mmap");
113	p2 = p1 + pagesize;
114	ret = mprotect ((void *)p2, pagesize, 0);
115	if (ret < 0)
116	    err (1, "mprotect");
117	buf = p2 - t->buf_len;
118	memcpy (buf, t->buf, t->buf_len);
119	parse_reply (buf, t->buf_len);
120	ret = munmap ((void *)p1, 2 * pagesize);
121	if (ret < 0)
122	    err (1, "munmap");
123    }
124    return val;
125#endif /* HAVE_MMAP */
126}
127