Lines Matching +full:run +full:- +full:time
1 /*-
27 * Note: it is a good idea to run this against a physical drive to
33 #include <sys/time.h>
58 int i, result, run, error, j, k, max_queue_per_proc; in main() local
99 for (run = 0; run < MAX_RUNS; run++) { in main()
101 printf("Run %d\n", run); in main()
110 iocb[k]->aio_nbytes = sizeof(buffer); in main()
111 iocb[k]->aio_buf = buffer; in main()
112 iocb[k]->aio_fildes = fd; in main()
113 iocb[k]->aio_offset in main()
114 = iocb[k]->aio_nbytes * k * (run + 1); in main()
118 (intmax_t)iocb[k]->aio_offset); in main()
120 iocb[k]->aio_lio_opcode = LIO_WRITE; in main()
125 time(&time1); in main()
129 time(&time2); in main()
131 printf("Time %jd %jd %jd result -> %d\n", in main()
133 (intmax_t)time2-time1, result); in main()
146 for (j = LIO_MAX - 1; j >=0; j--) { in main()
156 printf("FOO lio %d -> %p\n", j, lio[j]); in main()
197 printf("FAIL: run %d, operation %d result %d \n", run, LIO_MAX - i -1, result); in main()
200 printf("PASS: run %d, operation %d result %d \n", run, LIO_MAX - i -1, result); in main()
207 printf("FAIL: run %d, operation %d sub-opt %d result %d (errno=%d) should be %zu\n", in main()
208 run, LIO_MAX - i -1, k, result, errno, sizeof(buffer)); in main()
210 printf("PASS: run %d, operation %d sub-opt %d result %d\n", in main()
211 run, LIO_MAX - i -1, k, result); in main()