1/*-
2 * Copyright (C) 2005 IronPort Systems, Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 * 1. Redistributions of source code must retain the above copyright
8 *    notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 *    notice, this list of conditions and the following disclaimer in the
11 *    documentation and/or other materials provided with the distribution.
12 *
13 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
14 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
16 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
17 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
18 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
19 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
20 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
21 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
22 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
23 * SUCH DAMAGE.
24 *
25 * $FreeBSD: stable/11/tests/sys/aio/aio_kqueue_test.c 326677 2017-12-08 05:20:54Z asomers $
26 */
27
28/*
29 * Prerequisities:
30 * - AIO support must be compiled into the kernel (see sys/<arch>/NOTES for
31 *   more details).
32 *
33 * Note: it is a good idea to run this against a physical drive to
34 * exercise the physio fast path (ie. aio_kqueue /dev/<something safe>)
35 */
36
37#include <sys/types.h>
38#include <sys/event.h>
39#include <sys/time.h>
40#include <aio.h>
41#include <err.h>
42#include <errno.h>
43#include <fcntl.h>
44#include <stdlib.h>
45#include <stdio.h>
46#include <string.h>
47#include <unistd.h>
48
49#include "freebsd_test_suite/macros.h"
50#include "local.h"
51
52#define PATH_TEMPLATE   "aio.XXXXXXXXXX"
53
54#define MAX_RUNS 300
55/* #define DEBUG */
56
57int
58main (int argc, char *argv[])
59{
60	struct aiocb **iocb, *kq_iocb;
61	char *file, pathname[sizeof(PATH_TEMPLATE)+1];
62	struct kevent ke, kq_returned;
63	struct timespec ts;
64	char buffer[32768];
65	int max_queue_per_proc;
66	size_t max_queue_per_proc_size;
67#ifdef DEBUG
68	int cancel, error;
69#endif
70	int failed = 0, fd, kq, pending, result, run;
71	int tmp_file = 0;
72	int i, j;
73
74	PLAIN_REQUIRE_KERNEL_MODULE("aio", 0);
75	PLAIN_REQUIRE_UNSAFE_AIO(0);
76
77	max_queue_per_proc_size = sizeof(max_queue_per_proc);
78	if (sysctlbyname("vfs.aio.max_aio_queue_per_proc",
79	    &max_queue_per_proc, &max_queue_per_proc_size, NULL, 0) != 0)
80		err(1, "sysctlbyname");
81	iocb = calloc(max_queue_per_proc, sizeof(struct aiocb*));
82	if (iocb == NULL)
83		err(1, "calloc");
84
85	kq = kqueue();
86	if (kq < 0) {
87		perror("No kqeueue\n");
88		exit(1);
89	}
90
91	if (argc == 1) {
92		strcpy(pathname, PATH_TEMPLATE);
93		fd = mkstemp(pathname);
94		file = pathname;
95		tmp_file = 1;
96	} else {
97		file = argv[1];
98		fd = open(file, O_RDWR|O_CREAT, 0666);
99	}
100	if (fd == -1)
101		err(1, "Can't open %s\n", file);
102
103	for (run = 0; run < MAX_RUNS; run++){
104#ifdef DEBUG
105		printf("Run %d\n", run);
106#endif
107		for (i = 0; i < max_queue_per_proc; i++) {
108			iocb[i] = (struct aiocb *)calloc(1,
109			    sizeof(struct aiocb));
110			if (iocb[i] == NULL)
111				err(1, "calloc");
112		}
113
114		pending = 0;
115		for (i = 0; i < max_queue_per_proc; i++) {
116			pending++;
117			iocb[i]->aio_nbytes = sizeof(buffer);
118			iocb[i]->aio_buf = buffer;
119			iocb[i]->aio_fildes = fd;
120			iocb[i]->aio_offset = iocb[i]->aio_nbytes * i * run;
121
122			iocb[i]->aio_sigevent.sigev_notify_kqueue = kq;
123			iocb[i]->aio_sigevent.sigev_value.sival_ptr = iocb[i];
124			iocb[i]->aio_sigevent.sigev_notify = SIGEV_KEVENT;
125
126			result = aio_write(iocb[i]);
127			if (result != 0) {
128				perror("aio_write");
129				printf("Result %d iteration %d\n", result, i);
130				exit(1);
131			}
132#ifdef DEBUG
133			printf("WRITE %d is at %p\n", i, iocb[i]);
134#endif
135			result = rand();
136			if (result < RAND_MAX/32) {
137				if (result > RAND_MAX/64) {
138					result = aio_cancel(fd, iocb[i]);
139#ifdef DEBUG
140					printf("Cancel %d %p result %d\n", i, iocb[i], result);
141#endif
142					if (result == AIO_CANCELED) {
143						aio_return(iocb[i]);
144						iocb[i] = NULL;
145						pending--;
146					}
147				}
148			}
149		}
150#ifdef DEBUG
151		cancel = max_queue_per_proc - pending;
152#endif
153
154		i = 0;
155		while (pending) {
156
157			for (;;) {
158
159				bzero(&ke, sizeof(ke));
160				bzero(&kq_returned, sizeof(ke));
161				ts.tv_sec = 0;
162				ts.tv_nsec = 1;
163				result = kevent(kq, NULL, 0,
164						&kq_returned, 1, &ts);
165#ifdef DEBUG
166				error = errno;
167#endif
168				if (result < 0)
169					perror("kevent error: ");
170				kq_iocb = kq_returned.udata;
171#ifdef DEBUG
172				printf("kevent %d %d errno %d return.ident %p "
173				       "return.data %p return.udata %p %p\n",
174				       i, result, error,
175				       (void*)kq_returned.ident,
176				       (void*)kq_returned.data,
177				       kq_returned.udata,
178				       kq_iocb);
179#endif
180
181				if (kq_iocb)
182					break;
183#ifdef DEBUG
184				printf("Try again left %d out of %lu %d\n",
185				    pending, max_queue_per_proc, cancel);
186#endif
187			}
188
189			for (j = 0; j < max_queue_per_proc && iocb[j] != kq_iocb;
190			   j++) ;
191#ifdef DEBUG
192			printf("kq_iocb %p\n", kq_iocb);
193
194			printf("Error Result for %d is %d pending %d\n",
195			    j, result, pending);
196#endif
197			result = aio_return(kq_iocb);
198#ifdef DEBUG
199			printf("Return Result for %d is %d\n\n", j, result);
200#endif
201			if (result != sizeof(buffer)) {
202				printf("FAIL: run %d, operation %d, result %d "
203				    " (errno=%d) should be %zu\n", run, pending,
204				    result, errno, sizeof(buffer));
205				failed++;
206			} else
207				printf("PASS: run %d, left %d\n", run,
208				    pending - 1);
209
210			free(kq_iocb);
211			iocb[j] = NULL;
212			pending--;
213			i++;
214		}
215
216		for (i = 0; i < max_queue_per_proc; i++)
217			free(iocb[i]);
218
219	}
220
221	if (tmp_file)
222		unlink(pathname);
223
224	if (failed != 0)
225		printf("FAIL: %d tests failed\n", failed);
226	else
227		printf("PASS: All tests passed\n");
228
229	exit (failed == 0 ? 0 : 1);
230}
231