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$ 26 */ 27 28 /* 29 * Note: it is a good idea to run this against a physical drive to 30 * exercise the physio fast path (ie. lio_kqueue /dev/<something safe>) 31 * This will ensure op's counting is correct. It is currently broken. 32 * 33 * Also note that LIO & kqueue is not implemented in FreeBSD yet, LIO 34 * is also broken with respect to op's and some paths. 35 * 36 * A patch to make this work is at: 37 * http://www.ambrisko.com/doug/listio_kqueue/listio_kqueue.patch 38 */ 39 40 #include <sys/types.h> 41 #include <sys/event.h> 42 #include <sys/time.h> 43 #include <aio.h> 44 #include <fcntl.h> 45 #include <err.h> 46 #include <errno.h> 47 #include <stdio.h> 48 #include <stdlib.h> 49 #include <string.h> 50 #include <unistd.h> 51 52 #include "freebsd_test_suite/macros.h" 53 #include "local.h" 54 55 #define PATH_TEMPLATE "aio.XXXXXXXXXX" 56 57 #define LIO_MAX 5 58 #define MAX_IOCBS LIO_MAX * 16 59 #define MAX_RUNS 300 60 61 int 62 main(int argc, char *argv[]) 63 { 64 int fd; 65 struct aiocb *iocb[MAX_IOCBS]; 66 struct aiocb **lio[LIO_MAX], **kq_lio; 67 int i, result, run, error, j, k; 68 char buffer[32768]; 69 int kq; 70 struct kevent ke, kq_returned; 71 struct timespec ts; 72 struct sigevent sig; 73 time_t time1, time2; 74 char *file, pathname[sizeof(PATH_TEMPLATE)]; 75 int tmp_file = 0, failed = 0; 76 77 PLAIN_REQUIRE_KERNEL_MODULE("aio", 0); 78 PLAIN_REQUIRE_UNSAFE_AIO(0); 79 80 kq = kqueue(); 81 if (kq < 0) 82 err(1, "kqeueue(2) failed"); 83 84 if (argc == 1) { 85 strcpy(pathname, PATH_TEMPLATE); 86 fd = mkstemp(pathname); 87 file = pathname; 88 tmp_file = 1; 89 } else { 90 file = argv[1]; 91 fd = open(file, O_RDWR|O_CREAT, 0666); 92 } 93 if (fd < 0) 94 err(1, "can't open %s", argv[1]); 95 96 #ifdef DEBUG 97 printf("Hello kq %d fd %d\n", kq, fd); 98 #endif 99 100 for (run = 0; run < MAX_RUNS; run++) { 101 #ifdef DEBUG 102 printf("Run %d\n", run); 103 #endif 104 for (j = 0; j < LIO_MAX; j++) { 105 lio[j] = 106 malloc(sizeof(struct aiocb *) * MAX_IOCBS/LIO_MAX); 107 for (i = 0; i < MAX_IOCBS / LIO_MAX; i++) { 108 k = (MAX_IOCBS / LIO_MAX * j) + i; 109 lio[j][i] = iocb[k] = 110 calloc(1, sizeof(struct aiocb)); 111 iocb[k]->aio_nbytes = sizeof(buffer); 112 iocb[k]->aio_buf = buffer; 113 iocb[k]->aio_fildes = fd; 114 iocb[k]->aio_offset 115 = iocb[k]->aio_nbytes * k * (run + 1); 116 117 #ifdef DEBUG 118 printf("hello iocb[k] %d\n", 119 iocb[k]->aio_offset); 120 #endif 121 iocb[k]->aio_lio_opcode = LIO_WRITE; 122 } 123 sig.sigev_notify_kqueue = kq; 124 sig.sigev_value.sival_ptr = lio[j]; 125 sig.sigev_notify = SIGEV_KEVENT; 126 time(&time1); 127 result = lio_listio(LIO_NOWAIT, lio[j], 128 MAX_IOCBS / LIO_MAX, &sig); 129 error = errno; 130 time(&time2); 131 #ifdef DEBUG 132 printf("Time %d %d %d result -> %d\n", 133 time1, time2, time2-time1, result); 134 #endif 135 if (result != 0) { 136 errno = error; 137 err(1, "FAIL: Result %d iteration %d\n", 138 result, j); 139 } 140 #ifdef DEBUG 141 printf("write %d is at %p\n", j, lio[j]); 142 #endif 143 } 144 145 for (i = 0; i < LIO_MAX; i++) { 146 for (j = LIO_MAX - 1; j >=0; j--) { 147 if (lio[j]) 148 break; 149 } 150 151 for (;;) { 152 bzero(&ke, sizeof(ke)); 153 bzero(&kq_returned, sizeof(ke)); 154 ts.tv_sec = 0; 155 ts.tv_nsec = 1; 156 #ifdef DEBUG 157 printf("FOO lio %d -> %p\n", j, lio[j]); 158 #endif 159 EV_SET(&ke, (uintptr_t)lio[j], 160 EVFILT_LIO, EV_ONESHOT, 0, 0, iocb[j]); 161 result = kevent(kq, NULL, 0, 162 &kq_returned, 1, &ts); 163 error = errno; 164 if (result < 0) { 165 perror("kevent error: "); 166 } 167 kq_lio = kq_returned.udata; 168 #ifdef DEBUG 169 printf("kevent %d %d errno %d return.ident %p " 170 "return.data %p return.udata %p %p\n", 171 i, result, error, 172 kq_returned.ident, 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 Resulto 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