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 26 /* 27 * Note: it is a good idea to run this against a physical drive to 28 * exercise the physio fast path (ie. lio_kqueue_test /dev/<something safe>) 29 */ 30 31 #include <sys/types.h> 32 #include <sys/event.h> 33 #include <sys/time.h> 34 #include <aio.h> 35 #include <fcntl.h> 36 #include <err.h> 37 #include <errno.h> 38 #include <stdio.h> 39 #include <stdlib.h> 40 #include <string.h> 41 #include <unistd.h> 42 43 #include "freebsd_test_suite/macros.h" 44 #include "local.h" 45 46 #define PATH_TEMPLATE "aio.XXXXXXXXXX" 47 48 #define LIO_MAX 5 49 #define MAX_IOCBS_PER_LIO 64 50 #define MAX_IOCBS (LIO_MAX * MAX_IOCBS_PER_LIO) 51 #define MAX_RUNS 300 52 53 int 54 main(int argc, char *argv[]) 55 { 56 int fd; 57 struct aiocb *iocb[MAX_IOCBS]; 58 struct aiocb **lio[LIO_MAX], **kq_lio; 59 int i, result, run, error, j, k, max_queue_per_proc; 60 int max_iocbs, iocbs_per_lio; 61 size_t max_queue_per_proc_size; 62 char buffer[32768]; 63 int kq; 64 struct kevent kq_returned; 65 struct timespec ts; 66 struct sigevent sig; 67 time_t time1, time2; 68 char *file, pathname[sizeof(PATH_TEMPLATE)]; 69 int tmp_file = 0, failed = 0; 70 71 PLAIN_REQUIRE_KERNEL_MODULE("aio", 0); 72 PLAIN_REQUIRE_UNSAFE_AIO(0); 73 74 max_queue_per_proc_size = sizeof(max_queue_per_proc); 75 if (sysctlbyname("vfs.aio.max_aio_queue_per_proc", 76 &max_queue_per_proc, &max_queue_per_proc_size, NULL, 0) != 0) 77 err(1, "sysctlbyname"); 78 iocbs_per_lio = max_queue_per_proc / LIO_MAX; 79 max_iocbs = LIO_MAX * iocbs_per_lio; 80 81 kq = kqueue(); 82 if (kq < 0) 83 err(1, "kqeueue(2) failed"); 84 85 if (argc == 1) { 86 strcpy(pathname, PATH_TEMPLATE); 87 fd = mkstemp(pathname); 88 file = pathname; 89 tmp_file = 1; 90 } else { 91 file = argv[1]; 92 fd = open(file, O_RDWR|O_CREAT, 0666); 93 } 94 if (fd < 0) 95 err(1, "can't open %s", argv[1]); 96 97 #ifdef DEBUG 98 printf("Hello kq %d fd %d\n", kq, fd); 99 #endif 100 101 for (run = 0; run < MAX_RUNS; run++) { 102 #ifdef DEBUG 103 printf("Run %d\n", run); 104 #endif 105 for (j = 0; j < LIO_MAX; j++) { 106 lio[j] = 107 malloc(sizeof(struct aiocb *) * iocbs_per_lio); 108 for (i = 0; i < iocbs_per_lio; i++) { 109 k = (iocbs_per_lio * j) + i; 110 lio[j][i] = iocb[k] = 111 calloc(1, sizeof(struct aiocb)); 112 iocb[k]->aio_nbytes = sizeof(buffer); 113 iocb[k]->aio_buf = buffer; 114 iocb[k]->aio_fildes = fd; 115 iocb[k]->aio_offset 116 = iocb[k]->aio_nbytes * k * (run + 1); 117 118 #ifdef DEBUG 119 printf("hello iocb[k] %jd\n", 120 (intmax_t)iocb[k]->aio_offset); 121 #endif 122 iocb[k]->aio_lio_opcode = LIO_WRITE; 123 } 124 sig.sigev_notify_kqueue = kq; 125 sig.sigev_value.sival_ptr = lio[j]; 126 sig.sigev_notify = SIGEV_KEVENT; 127 time(&time1); 128 result = lio_listio(LIO_NOWAIT, lio[j], 129 iocbs_per_lio, &sig); 130 error = errno; 131 time(&time2); 132 #ifdef DEBUG 133 printf("Time %jd %jd %jd result -> %d\n", 134 (intmax_t)time1, (intmax_t)time2, 135 (intmax_t)time2-time1, result); 136 #endif 137 if (result != 0) { 138 errno = error; 139 err(1, "FAIL: Result %d iteration %d\n", 140 result, j); 141 } 142 #ifdef DEBUG 143 printf("write %d is at %p\n", j, lio[j]); 144 #endif 145 } 146 147 for (i = 0; i < LIO_MAX; i++) { 148 for (j = LIO_MAX - 1; j >=0; j--) { 149 if (lio[j]) 150 break; 151 } 152 153 for (;;) { 154 bzero(&kq_returned, sizeof(kq_returned)); 155 ts.tv_sec = 0; 156 ts.tv_nsec = 1; 157 #ifdef DEBUG 158 printf("FOO lio %d -> %p\n", j, lio[j]); 159 #endif 160 result = kevent(kq, NULL, 0, 161 &kq_returned, 1, &ts); 162 error = errno; 163 if (result < 0) { 164 perror("kevent error: "); 165 } 166 kq_lio = kq_returned.udata; 167 #ifdef DEBUG 168 printf("kevent %d %d errno %d return.ident %p " 169 "return.data %p return.udata %p %p\n", 170 i, result, error, 171 (void*)kq_returned.ident, 172 (void*)kq_returned.data, 173 kq_returned.udata, 174 lio[j]); 175 #endif 176 177 if (kq_lio) 178 break; 179 #ifdef DEBUG 180 printf("Try again\n"); 181 #endif 182 } 183 184 #ifdef DEBUG 185 printf("lio %p\n", lio); 186 #endif 187 188 for (j = 0; j < LIO_MAX; j++) { 189 if (lio[j] == kq_lio) 190 break; 191 } 192 if (j == LIO_MAX) 193 errx(1, "FAIL: "); 194 195 #ifdef DEBUG 196 printf("Error Result for %d is %d\n", j, result); 197 #endif 198 if (result < 0) { 199 printf("FAIL: run %d, operation %d result %d \n", run, LIO_MAX - i -1, result); 200 failed++; 201 } else 202 printf("PASS: run %d, operation %d result %d \n", run, LIO_MAX - i -1, result); 203 for (k = 0; k < max_iocbs / LIO_MAX; k++) { 204 result = aio_return(kq_lio[k]); 205 #ifdef DEBUG 206 printf("Return Result for %d %d is %d\n", j, k, result); 207 #endif 208 if (result != sizeof(buffer)) { 209 printf("FAIL: run %d, operation %d sub-opt %d result %d (errno=%d) should be %zu\n", 210 run, LIO_MAX - i -1, k, result, errno, sizeof(buffer)); 211 } else { 212 printf("PASS: run %d, operation %d sub-opt %d result %d\n", 213 run, LIO_MAX - i -1, k, result); 214 } 215 } 216 #ifdef DEBUG 217 printf("\n"); 218 #endif 219 220 for (k = 0; k < max_iocbs / LIO_MAX; k++) 221 free(lio[j][k]); 222 free(lio[j]); 223 lio[j] = NULL; 224 } 225 } 226 #ifdef DEBUG 227 printf("Done\n"); 228 #endif 229 230 if (tmp_file) 231 unlink(pathname); 232 233 if (failed) 234 errx(1, "FAIL: %d testcases failed", failed); 235 else 236 errx(0, "PASS: All\n"); 237 238 } 239