1 /*-
14  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27  * Note: it is a good idea to run this against a physical drive to
59 	int i, result, run, error, j, k, max_queue_per_proc;  in main()  local
105 		for (j = 0; j < LIO_MAX; j++) {  in main()
106 			lio[j] =  in main()
109 				k = (iocbs_per_lio * j) + i;  in main()
110 				lio[j][i] = iocb[k] =  in main()
112 				iocb[k]->aio_nbytes = sizeof(buffer);  in main()
113 				iocb[k]->aio_buf = buffer;  in main()
114 				iocb[k]->aio_fildes = fd;  in main()
115 				iocb[k]->aio_offset  in main()
116 				    = iocb[k]->aio_nbytes * k * (run + 1);  in main()
119 				printf("hello iocb[k] %jd\n",  in main()
120 				       (intmax_t)iocb[k]->aio_offset);  in main()
122 				iocb[k]->aio_lio_opcode = LIO_WRITE;  in main()
125 			sig.sigev_value.sival_ptr = lio[j];  in main()
128 			result = lio_listio(LIO_NOWAIT, lio[j],  in main()
133 			printf("Time %jd %jd %jd result -> %d\n",  in main()
135 			    (intmax_t)time2-time1, result);  in main()
140 				    result, j);  in main()
143 			printf("write %d is at %p\n", j, lio[j]);  in main()
148 			for (j = LIO_MAX - 1; j >=0; j--) {  in main()
149 				if (lio[j])  in main()
158 				printf("FOO lio %d -> %p\n", j, lio[j]);  in main()
174 				       lio[j]);  in main()
188 			for (j = 0; j < LIO_MAX; j++) {  in main()
189 				if (lio[j] == kq_lio)  in main()
192 			if (j == LIO_MAX)  in main()
196 			printf("Error Result for %d is %d\n", j, result);  in main()
199 				printf("FAIL: run %d, operation %d result %d \n", run, LIO_MAX - i -1, result);  in main()
202 				printf("PASS: run %d, operation %d result %d \n", run, LIO_MAX - i -1, result);  in main()
203 			for (k = 0; k < max_iocbs / LIO_MAX; k++) {  in main()
204 				result = aio_return(kq_lio[k]);  in main()
206 				printf("Return Result for %d %d is %d\n", j, k, result);  in main()
209 					printf("FAIL: run %d, operation %d sub-opt %d  result %d (errno=%d) should be %zu\n",  in main()
210 					   run, LIO_MAX - i -1, k, result, errno, sizeof(buffer));  in main()
212 					printf("PASS: run %d, operation %d sub-opt %d  result %d\n",  in main()
213 					   run, LIO_MAX - i -1, k, result);  in main()
220 			for (k = 0; k < max_iocbs / LIO_MAX; k++)  in main()
221 				free(lio[j][k]);  in main()
222 			free(lio[j]);  in main()
223 			lio[j] = NULL;  in main()