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 275 276 277 278 279 280 281
|
/*
* Copyright (c) 2009 Mark Heily <mark@heily.com>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include "common.h"
/* Maximum number of threads that can be created */
#define MAX_THREADS 100
void
test_kqueue_descriptor_is_pollable(void)
{
int kq, rv;
struct kevent kev;
fd_set fds;
struct timeval tv;
if ((kq = kqueue()) < 0)
die("kqueue()");
test_no_kevents(kq);
kevent_add(kq, &kev, 2, EVFILT_TIMER, EV_ADD | EV_ONESHOT, 0, 1000, NULL);
test_no_kevents(kq);
FD_ZERO(&fds);
FD_SET(kq, &fds);
tv.tv_sec = 5;
tv.tv_usec = 0;
rv = select(1, &fds, NULL, NULL, &tv);
if (rv < 0)
die("select() error");
if (rv == 0)
die("select() no events");
if (!FD_ISSET(kq, &fds)) {
die("descriptor is not ready for reading");
}
close(kq);
}
/*
* Test the method for detecting when one end of a socketpair
* has been closed. This technique is used in kqueue_validate()
*/
static void
test_peer_close_detection(void *unused)
{
#ifdef _WIN32
return;
//FIXME
#else
int sockfd[2];
char buf[1];
struct pollfd pfd;
if (socketpair(AF_UNIX, SOCK_STREAM, 0, sockfd) < 0)
die("socketpair");
pfd.fd = sockfd[0];
pfd.events = POLLIN | POLLHUP;
pfd.revents = 0;
if (poll(&pfd, 1, 0) > 0)
die("unexpected data");
if (close(sockfd[1]) < 0)
die("close");
if (poll(&pfd, 1, 0) > 0) {
if (recv(sockfd[0], buf, sizeof(buf), MSG_PEEK | MSG_DONTWAIT) != 0)
die("failed to detect peer shutdown");
}
#endif
}
void
test_kqueue(void *unused)
{
int kqfd;
if ((kqfd = kqueue()) < 0)
die("kqueue()");
test_no_kevents(kqfd);
if (close(kqfd) < 0)
die("close()");
}
void
test_kevent(void *unused)
{
struct kevent kev;
memset(&kev, 0, sizeof(kev));
/* Provide an invalid kqueue descriptor */
if (kevent(-1, &kev, 1, NULL, 0, NULL) == 0)
die("invalid kq parameter");
}
void
test_ev_receipt(void *unused)
{
int kq;
struct kevent kev;
if ((kq = kqueue()) < 0)
die("kqueue()");
#if !defined(_WIN32)
EV_SET(&kev, SIGUSR2, EVFILT_SIGNAL, EV_ADD | EV_RECEIPT, 0, 0, NULL);
if (kevent(kq, &kev, 1, &kev, 1, NULL) < 0)
die("kevent");
/* TODO: check the receipt */
close(kq);
#else
memset(&kev, 0, sizeof(kev));
puts("Skipped -- EV_RECEIPT is not available or running on Win32");
#endif
}
void
run_iteration(struct test_context *ctx)
{
struct unit_test *test;
for (test = &ctx->tests[0]; test->ut_name != NULL; test++) {
if (test->ut_enabled)
test->ut_func(ctx);
}
free(ctx);
}
void
test_harness(struct unit_test tests[MAX_TESTS], int iterations)
{
int i, n, kqfd;
struct test_context *ctx;
printf("Running %d iterations\n", iterations);
testing_begin();
ctx = calloc(1, sizeof(*ctx));
test(peer_close_detection, ctx);
test(kqueue, ctx);
test(kevent, ctx);
if ((kqfd = kqueue()) < 0)
die("kqueue()");
test(ev_receipt, ctx);
/* TODO: this fails now, but would be good later
test(kqueue_descriptor_is_pollable);
*/
free(ctx);
n = 0;
for (i = 0; i < iterations; i++) {
ctx = calloc(1, sizeof(*ctx));
if (ctx == NULL)
abort();
ctx->iteration = n++;
ctx->kqfd = kqfd;
memcpy(&ctx->tests, tests, sizeof(ctx->tests));
ctx->iterations = iterations;
run_iteration(ctx);
}
testing_end();
close(kqfd);
}
void
usage(void)
{
printf("usage: [-hn] [testclass ...]\n"
" -h This message\n"
" -n Number of iterations (default: 1)\n"
" testclass Tests suites to run: [socket signal timer vnode user]\n"
" All tests are run by default\n"
"\n"
);
exit(1);
}
int
main(int argc, char **argv)
{
struct unit_test tests[MAX_TESTS] = {
{ "socket", 1, test_evfilt_read },
#if !defined(_WIN32) && !defined(__ANDROID__)
// XXX-FIXME -- BROKEN ON LINUX WHEN RUN IN A SEPARATE THREAD
{ "signal", 1, test_evfilt_signal },
#endif
#if FIXME
{ "proc", 1, test_evfilt_proc },
#endif
{ "timer", 1, test_evfilt_timer },
#ifndef _WIN32
{ "vnode", 1, test_evfilt_vnode },
#endif
#ifdef EVFILT_USER
{ "user", 1, test_evfilt_user },
#endif
{ NULL, 0, NULL },
};
struct unit_test *test;
int c, i, iterations;
char *arg;
int match;
#ifdef _WIN32
/* Initialize the Winsock library */
WSADATA wsaData;
if (WSAStartup(MAKEWORD(2,2), &wsaData) != 0)
err(1, "WSAStartup failed");
#endif
iterations = 1;
/* Windows does not provide a POSIX-compatible getopt */
#ifndef _WIN32
while ((c = getopt (argc, argv, "hn:")) != -1) {
switch (c) {
case 'h':
usage();
break;
case 'n':
iterations = atoi(optarg);
break;
default:
usage();
}
}
/* If specific tests are requested, disable all tests by default */
if (optind < argc) {
for (test = &tests[0]; test->ut_name != NULL; test++) {
test->ut_enabled = 0;
}
}
for (i = optind; i < argc; i++) {
match = 0;
arg = argv[i];
for (test = &tests[0]; test->ut_name != NULL; test++) {
if (strcmp(arg, test->ut_name) == 0) {
test->ut_enabled = 1;
match = 1;
break;
}
}
if (!match) {
printf("ERROR: invalid option: %s\n", arg);
exit(1);
} else {
printf("enabled test: %s\n", arg);
}
}
#endif
test_harness(tests, iterations);
return (0);
}
|