2 * Copyright (C) 2005 IronPort Systems, Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
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.
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
29 * Note: it is a good idea to run this against a physical drive to
30 * exercise the physio fast path (ie. lio_kqueue_test /dev/<something safe>)
33 #include <sys/types.h>
34 #include <sys/event.h>
45 #include "freebsd_test_suite/macros.h"
48 #define PATH_TEMPLATE "aio.XXXXXXXXXX"
51 #define MAX_IOCBS_PER_LIO 64
52 #define MAX_IOCBS (LIO_MAX * MAX_IOCBS_PER_LIO)
56 main(int argc, char *argv[])
59 struct aiocb *iocb[MAX_IOCBS];
60 struct aiocb **lio[LIO_MAX], **kq_lio;
61 int i, result, run, error, j, k, max_queue_per_proc;
62 int max_iocbs, iocbs_per_lio;
63 size_t max_queue_per_proc_size;
66 struct kevent kq_returned;
70 char *file, pathname[sizeof(PATH_TEMPLATE)];
71 int tmp_file = 0, failed = 0;
73 PLAIN_REQUIRE_KERNEL_MODULE("aio", 0);
74 PLAIN_REQUIRE_UNSAFE_AIO(0);
76 max_queue_per_proc_size = sizeof(max_queue_per_proc);
77 if (sysctlbyname("vfs.aio.max_aio_queue_per_proc",
78 &max_queue_per_proc, &max_queue_per_proc_size, NULL, 0) != 0)
79 err(1, "sysctlbyname");
80 iocbs_per_lio = max_queue_per_proc / LIO_MAX;
81 max_iocbs = LIO_MAX * iocbs_per_lio;
85 err(1, "kqeueue(2) failed");
88 strcpy(pathname, PATH_TEMPLATE);
89 fd = mkstemp(pathname);
94 fd = open(file, O_RDWR|O_CREAT, 0666);
97 err(1, "can't open %s", argv[1]);
100 printf("Hello kq %d fd %d\n", kq, fd);
103 for (run = 0; run < MAX_RUNS; run++) {
105 printf("Run %d\n", run);
107 for (j = 0; j < LIO_MAX; j++) {
109 malloc(sizeof(struct aiocb *) * iocbs_per_lio);
110 for (i = 0; i < iocbs_per_lio; i++) {
111 k = (iocbs_per_lio * j) + i;
112 lio[j][i] = iocb[k] =
113 calloc(1, sizeof(struct aiocb));
114 iocb[k]->aio_nbytes = sizeof(buffer);
115 iocb[k]->aio_buf = buffer;
116 iocb[k]->aio_fildes = fd;
118 = iocb[k]->aio_nbytes * k * (run + 1);
121 printf("hello iocb[k] %jd\n",
122 (intmax_t)iocb[k]->aio_offset);
124 iocb[k]->aio_lio_opcode = LIO_WRITE;
126 sig.sigev_notify_kqueue = kq;
127 sig.sigev_value.sival_ptr = lio[j];
128 sig.sigev_notify = SIGEV_KEVENT;
130 result = lio_listio(LIO_NOWAIT, lio[j],
131 iocbs_per_lio, &sig);
135 printf("Time %jd %jd %jd result -> %d\n",
136 (intmax_t)time1, (intmax_t)time2,
137 (intmax_t)time2-time1, result);
141 err(1, "FAIL: Result %d iteration %d\n",
145 printf("write %d is at %p\n", j, lio[j]);
149 for (i = 0; i < LIO_MAX; i++) {
150 for (j = LIO_MAX - 1; j >=0; j--) {
156 bzero(&kq_returned, sizeof(kq_returned));
160 printf("FOO lio %d -> %p\n", j, lio[j]);
162 result = kevent(kq, NULL, 0,
163 &kq_returned, 1, &ts);
166 perror("kevent error: ");
168 kq_lio = kq_returned.udata;
170 printf("kevent %d %d errno %d return.ident %p "
171 "return.data %p return.udata %p %p\n",
173 (void*)kq_returned.ident,
174 (void*)kq_returned.data,
182 printf("Try again\n");
187 printf("lio %p\n", lio);
190 for (j = 0; j < LIO_MAX; j++) {
191 if (lio[j] == kq_lio)
198 printf("Error Result for %d is %d\n", j, result);
201 printf("FAIL: run %d, operation %d result %d \n", run, LIO_MAX - i -1, result);
204 printf("PASS: run %d, operation %d result %d \n", run, LIO_MAX - i -1, result);
205 for (k = 0; k < max_iocbs / LIO_MAX; k++) {
206 result = aio_return(kq_lio[k]);
208 printf("Return Result for %d %d is %d\n", j, k, result);
210 if (result != sizeof(buffer)) {
211 printf("FAIL: run %d, operation %d sub-opt %d result %d (errno=%d) should be %zu\n",
212 run, LIO_MAX - i -1, k, result, errno, sizeof(buffer));
214 printf("PASS: run %d, operation %d sub-opt %d result %d\n",
215 run, LIO_MAX - i -1, k, result);
222 for (k = 0; k < max_iocbs / LIO_MAX; k++)
236 errx(1, "FAIL: %d testcases failed", failed);
238 errx(0, "PASS: All\n");