[PATCH] fio: some verify fixes
[disktools.git] / fio.c
CommitLineData
abe4da87
JA
1/*
2 * fio - the flexible io tester
3 *
4 * Copyright (C) 2005 Jens Axboe <axboe@suse.de>
5 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19 *
20 */
892199bd
JA
21#include <stdio.h>
22#include <stdlib.h>
23#include <unistd.h>
24#include <fcntl.h>
25#include <string.h>
26#include <errno.h>
27#include <signal.h>
28#include <time.h>
7dd1389e 29#include <ctype.h>
18e0b78c 30#include <sched.h>
43000118 31#include <libaio.h>
e128065d 32#include <math.h>
02983297 33#include <limits.h>
892199bd
JA
34#include <sys/time.h>
35#include <sys/types.h>
36#include <sys/stat.h>
37#include <sys/wait.h>
38#include <semaphore.h>
39#include <sys/ipc.h>
40#include <sys/shm.h>
41#include <asm/unistd.h>
946d8870 42#include <asm/types.h>
892199bd 43
2c83567e 44#include "list.h"
e8457004 45#include "md5.h"
2c83567e 46
4240cfa1
JA
47#define MAX_JOBS (1024)
48
892199bd
JA
49/*
50 * assume we don't have _get either, if _set isn't defined
51 */
52#ifndef __NR_ioprio_set
892199bd
JA
53#if defined(__i386__)
54#define __NR_ioprio_set 289
55#define __NR_ioprio_get 290
56#elif defined(__powerpc__) || defined(__powerpc64__)
57#define __NR_ioprio_set 273
58#define __NR_ioprio_get 274
59#elif defined(__x86_64__)
60#define __NR_ioprio_set 251
61#define __NR_ioprio_get 252
62#elif defined(__ia64__)
63#define __NR_ioprio_set 1274
64#define __NR_ioprio_get 1275
65#elif defined(__alpha__)
66#define __NR_ioprio_set 442
67#define __NR_ioprio_get 443
68#elif defined(__s390x__) || defined(__s390__)
69#define __NR_ioprio_set 282
70#define __NR_ioprio_get 283
71#else
72#error "Unsupported arch"
73#endif
b95799ca 74#endif
892199bd 75
b95799ca
JA
76#ifndef __NR_fadvise64
77#if defined(__i386__)
78#define __NR_fadvise64 250
79#elif defined(__powerpc__) || defined(__powerpc64__)
80#define __NR_fadvise64 233
81#elif defined(__x86_64__)
82#define __NR_fadvise64 221
83#elif defined(__ia64__)
84#define __NR_fadvise64 1234
85#elif defined(__alpha__)
86#define __NR_fadvise64 413
87#elif defined(__s390x__) || defined(__s390__)
88#define __NR_fadvise64 253
89#else
90#error "Unsupported arch"
91#endif
892199bd
JA
92#endif
93
94static int ioprio_set(int which, int who, int ioprio)
95{
96 return syscall(__NR_ioprio_set, which, who, ioprio);
97}
98
b95799ca
JA
99/*
100 * we want fadvise64 really, but it's so tangled... later
101 */
102static int fadvise(int fd, loff_t offset, size_t len, int advice)
103{
104#if 0
105 return syscall(__NR_fadvise64, fd, offset, offset >> 32, len, advice);
106#else
107 return posix_fadvise(fd, (off_t) offset, len, advice);
108#endif
109}
110
892199bd
JA
111enum {
112 IOPRIO_WHO_PROCESS = 1,
113 IOPRIO_WHO_PGRP,
114 IOPRIO_WHO_USER,
115};
116
117#define IOPRIO_CLASS_SHIFT 13
118
892199bd
JA
119#define MASK (4095)
120
4240cfa1
JA
121#define DEF_BS (4096)
122#define DEF_TIMEOUT (30)
123#define DEF_RATE_CYCLE (1000)
124#define DEF_ODIRECT (1)
125#define DEF_SEQUENTIAL (1)
4240cfa1 126#define DEF_RAND_REPEAT (1)
02983297
JA
127#define DEF_OVERWRITE (0)
128#define DEF_CREATE (1)
b95799ca 129#define DEF_INVALIDATE (1)
99c6704f 130#define DEF_SYNCIO (0)
eb39963f 131#define DEF_RANDSEED (0xb1899bedUL)
1d035750 132#define DEF_BWAVGTIME (500)
fc097bfe
JA
133#define DEF_CREATE_SER (1)
134#define DEF_CREATE_FSYNC (1)
b6794fbf 135#define DEF_LOOPS (1)
cfc702bd 136#define DEF_VERIFY (0)
4240cfa1
JA
137
138#define ALIGN(buf) (char *) (((unsigned long) (buf) + MASK) & ~(MASK))
892199bd 139
4240cfa1 140static int repeatable = DEF_RAND_REPEAT;
02bdd9ba 141static int rate_quit = 1;
a0a9b35b
JA
142static int write_lat_log;
143static int write_bw_log;
98dd52d6 144static int exitall_on_terminate;
892199bd 145
892199bd 146static int thread_number;
7dd1389e 147static char *ini_file;
892199bd 148
8867c0a8
JA
149static int max_jobs = MAX_JOBS;
150
8dbff0b1
JA
151static char run_str[MAX_JOBS + 1];
152
892199bd
JA
153static int shm_id;
154
4240cfa1
JA
155enum {
156 DDIR_READ = 0,
157 DDIR_WRITE,
158};
892199bd 159
02bdd9ba
JA
160/*
161 * thread life cycle
162 */
163enum {
164 TD_NOT_CREATED = 0,
165 TD_CREATED,
e8457004
JA
166 TD_RUNNING,
167 TD_VERIFYING,
02bdd9ba
JA
168 TD_EXITED,
169 TD_REAPED,
170};
171
99c6704f
JA
172enum {
173 MEM_MALLOC,
174 MEM_SHM,
175};
176
2c83567e
JA
177/*
178 * The io unit
179 */
180struct io_u {
181 struct iocb iocb;
57d753e3 182 struct timeval start_time;
2c83567e
JA
183 struct timeval issue_time;
184
2c83567e
JA
185 char *buf;
186 unsigned int buflen;
4ac89145 187 unsigned long long offset;
2c83567e
JA
188
189 struct list_head list;
190};
191
57d753e3
JA
192struct io_stat {
193 unsigned long val;
194 unsigned long val_sq;
195 unsigned long max_val;
196 unsigned long min_val;
197 unsigned long samples;
198};
199
a0a9b35b
JA
200struct io_sample {
201 unsigned long time;
202 unsigned long val;
203};
204
205struct io_log {
206 unsigned long nr_samples;
207 unsigned long max_samples;
208 struct io_sample *log;
209};
210
e8457004
JA
211#define FIO_HDR_MAGIC 0xf00baaef
212
213struct verify_header {
214 unsigned int fio_magic;
215 unsigned int len;
216 char md5_digest[MD5_HASH_WORDS * 4];
217};
218
02983297
JA
219#define td_read(td) ((td)->ddir == DDIR_READ)
220#define should_fsync(td) (!td_read(td) && !(td)->odirect)
221
892199bd
JA
222struct thread_data {
223 char file_name[256];
224 int thread_number;
225 int error;
226 int fd;
892199bd 227 pid_t pid;
6b71c826 228 char *orig_buffer;
4240cfa1 229 volatile int terminate;
02bdd9ba 230 volatile int runstate;
f737299d
JA
231 unsigned int ddir;
232 unsigned int ioprio;
233 unsigned int sequential;
234 unsigned int bs;
8c033f93
JA
235 unsigned int min_bs;
236 unsigned int max_bs;
f737299d 237 unsigned int odirect;
e97712ed 238 unsigned int thinktime;
4240cfa1 239 unsigned int fsync_blocks;
fc24389f 240 unsigned int start_delay;
47d45203 241 unsigned int timeout;
43000118 242 unsigned int use_aio;
02983297
JA
243 unsigned int create_file;
244 unsigned int overwrite;
b95799ca 245 unsigned int invalidate_cache;
1d035750 246 unsigned int bw_avg_time;
fc097bfe
JA
247 unsigned int create_serialize;
248 unsigned int create_fsync;
b6794fbf 249 unsigned int loops;
02983297
JA
250 unsigned long long file_size;
251 unsigned long long file_offset;
74b4b5fb 252 unsigned int sync_io;
99c6704f 253 unsigned int mem_type;
cfc702bd 254 unsigned int verify;
18e0b78c 255 cpu_set_t cpumask;
86184d14 256
7889f07b 257 struct drand48_data bsrange_state;
e8457004 258 struct drand48_data verify_state;
7889f07b 259
99c6704f
JA
260 int shm_id;
261
63a09e51
JA
262 off_t cur_off;
263
254605cd 264 io_context_t aio_ctx;
43000118 265 unsigned int aio_depth;
43000118 266 struct io_event *aio_events;
2c83567e
JA
267
268 unsigned int cur_depth;
269 struct list_head io_u_freelist;
270 struct list_head io_u_busylist;
43000118 271
7dd1389e 272 unsigned int rate;
4240cfa1
JA
273 unsigned int ratemin;
274 unsigned int ratecycle;
275 unsigned long rate_usec_cycle;
276 long rate_pending_usleep;
8c033f93 277 unsigned long rate_kb;
4240cfa1 278 struct timeval lastrate;
86184d14 279
892199bd 280 unsigned long runtime; /* sec */
7889f07b 281 unsigned long kb;
4240cfa1 282 unsigned long io_blocks;
8c033f93 283 unsigned long io_kb;
f8e3d840 284 unsigned long this_io_kb;
7889f07b 285 unsigned long last_kb;
892199bd 286 sem_t mutex;
892199bd
JA
287 struct drand48_data random_state;
288
289 /*
e128065d 290 * bandwidth and latency stats
892199bd 291 */
57d753e3
JA
292 struct io_stat clat_stat; /* completion latency */
293 struct io_stat slat_stat; /* submission latency */
294
295 struct io_stat bw_stat; /* bandwidth stats */
8c033f93 296 unsigned long stat_io_kb;
fd1ae4c9 297 struct timeval stat_sample_time;
4240cfa1 298
a0a9b35b
JA
299 struct io_log *lat_log;
300 struct io_log *bw_log;
301
4240cfa1 302 struct timeval start;
892199bd
JA
303};
304
305static struct thread_data *threads;
47d45203 306static struct thread_data def_thread;
892199bd
JA
307
308static sem_t startup_sem;
309
5c24b2c4 310static void sig_handler(int sig)
892199bd
JA
311{
312 int i;
313
213b446c
JA
314 for (i = 0; i < thread_number; i++) {
315 struct thread_data *td = &threads[i];
316
317 td->terminate = 1;
318 td->start_delay = 0;
319 }
02bdd9ba
JA
320}
321
e8457004 322static int init_random_state(struct thread_data *td)
946d8870 323{
e8457004
JA
324 unsigned long seed;
325 int fd;
946d8870 326
e8457004
JA
327 fd = open("/dev/random", O_RDONLY);
328 if (fd == -1) {
329 td->error = errno;
330 return 1;
946d8870
JA
331 }
332
e8457004
JA
333 if (read(fd, &seed, sizeof(seed)) < (int) sizeof(seed)) {
334 td->error = EIO;
335 close(fd);
336 return 1;
946d8870
JA
337 }
338
e8457004 339 close(fd);
7889f07b
JA
340
341 srand48_r(seed, &td->bsrange_state);
e8457004 342 srand48_r(seed, &td->verify_state);
892199bd
JA
343
344 if (td->sequential)
345 return 0;
346
e8457004
JA
347 if (repeatable)
348 seed = DEF_RANDSEED;
892199bd
JA
349
350 srand48_r(seed, &td->random_state);
351 return 0;
352}
353
5c24b2c4 354static unsigned long utime_since(struct timeval *s, struct timeval *e)
892199bd
JA
355{
356 double sec, usec;
357
358 sec = e->tv_sec - s->tv_sec;
359 usec = e->tv_usec - s->tv_usec;
360 if (sec > 0 && usec < 0) {
361 sec--;
362 usec += 1000000;
363 }
364
365 sec *= (double) 1000000;
366
367 return sec + usec;
368}
369
5c24b2c4 370static unsigned long mtime_since(struct timeval *s, struct timeval *e)
892199bd
JA
371{
372 double sec, usec;
373
374 sec = e->tv_sec - s->tv_sec;
375 usec = e->tv_usec - s->tv_usec;
376 if (sec > 0 && usec < 0) {
377 sec--;
378 usec += 1000000;
379 }
380
381 sec *= (double) 1000;
382 usec /= (double) 1000;
383
384 return sec + usec;
385}
386
be33abe4
JA
387static unsigned long mtime_since_now(struct timeval *s)
388{
389 struct timeval t;
390
391 gettimeofday(&t, NULL);
392 return mtime_since(s, &t);
393}
394
98168d55
JA
395static inline unsigned long msec_now(struct timeval *s)
396{
397 return s->tv_sec * 1000 + s->tv_usec / 1000;
398}
399
4ac89145 400static unsigned long long get_next_offset(struct thread_data *td)
892199bd 401{
f31fd9c8 402 unsigned long long kb;
892199bd
JA
403 long r;
404
405 if (!td->sequential) {
406 lrand48_r(&td->random_state, &r);
f31fd9c8 407 kb = (1+(double) (td->kb-1) * r / (RAND_MAX+1.0));
7889f07b 408 } else
f31fd9c8 409 kb = td->last_kb;
7889f07b 410
f31fd9c8 411 return (kb << 10) + td->file_offset;
7889f07b
JA
412}
413
414static unsigned int get_next_buflen(struct thread_data *td)
415{
416 unsigned int buflen;
417 long r;
418
419 if (td->min_bs == td->max_bs)
420 buflen = td->min_bs;
421 else {
422 lrand48_r(&td->bsrange_state, &r);
423 buflen = (1 + (double) (td->max_bs - 1) * r / (RAND_MAX + 1.0));
424 buflen = (buflen + td->min_bs - 1) & ~(td->min_bs - 1);
892199bd
JA
425 }
426
f8e3d840
JA
427 if (buflen > ((td->kb - td->this_io_kb) << 10))
428 buflen = (td->kb - td->this_io_kb) << 10;
7889f07b
JA
429
430 td->last_kb += buflen >> 10;
431 return buflen;
892199bd
JA
432}
433
57d753e3
JA
434static inline void add_stat_sample(struct thread_data *td, struct io_stat *is,
435 unsigned long val)
892199bd 436{
57d753e3
JA
437 if (val > is->max_val)
438 is->max_val = val;
439 if (val < is->min_val)
440 is->min_val = val;
441
442 is->val += val;
443 is->val_sq += val * val;
444 is->samples++;
445}
fd1ae4c9 446
a0a9b35b
JA
447static void add_log_sample(struct thread_data *td, struct io_log *log,
448 unsigned long val)
449{
450 if (log->nr_samples == log->max_samples) {
451 int new_size = sizeof(struct io_sample) * log->max_samples * 2;
452
453 log->log = realloc(log->log, new_size);
454 log->max_samples <<= 1;
455 }
456
457 log->log[log->nr_samples].val = val;
458 log->log[log->nr_samples].time = mtime_since_now(&td->start);
459 log->nr_samples++;
460}
461
57d753e3
JA
462static void add_clat_sample(struct thread_data *td, unsigned long msec)
463{
464 add_stat_sample(td, &td->clat_stat, msec);
a0a9b35b
JA
465
466 if (td->lat_log)
467 add_log_sample(td, td->lat_log, msec);
57d753e3 468}
fd1ae4c9 469
57d753e3
JA
470static void add_slat_sample(struct thread_data *td, unsigned long msec)
471{
472 add_stat_sample(td, &td->slat_stat, msec);
473}
fd1ae4c9 474
57d753e3
JA
475static void add_bw_sample(struct thread_data *td, unsigned long msec)
476{
477 unsigned long spent = mtime_since_now(&td->stat_sample_time);
478 unsigned long rate;
479
1d035750 480 if (spent < td->bw_avg_time)
57d753e3
JA
481 return;
482
f8e3d840 483 rate = ((td->this_io_kb - td->stat_io_kb) * 1024) / spent;
57d753e3
JA
484 add_stat_sample(td, &td->bw_stat, rate);
485
a0a9b35b
JA
486 if (td->bw_log)
487 add_log_sample(td, td->bw_log, rate);
488
57d753e3 489 gettimeofday(&td->stat_sample_time, NULL);
f8e3d840 490 td->stat_io_kb = td->this_io_kb;
892199bd
JA
491}
492
5c24b2c4 493static void usec_sleep(int usec)
892199bd 494{
86184d14
JA
495 struct timespec req = { .tv_sec = 0, .tv_nsec = usec * 1000 };
496 struct timespec rem;
892199bd
JA
497
498 do {
86184d14
JA
499 rem.tv_sec = rem.tv_nsec = 0;
500 nanosleep(&req, &rem);
501 if (!rem.tv_nsec)
892199bd 502 break;
86184d14
JA
503
504 req.tv_nsec = rem.tv_nsec;
892199bd
JA
505 } while (1);
506}
507
9e850933
JA
508static void rate_throttle(struct thread_data *td, unsigned long time_spent,
509 unsigned int bytes)
86184d14 510{
9e850933
JA
511 unsigned long usec_cycle;
512
4240cfa1
JA
513 if (!td->rate)
514 return;
515
9e850933
JA
516 usec_cycle = td->rate_usec_cycle * (bytes / td->min_bs);
517
518 if (time_spent < usec_cycle) {
519 unsigned long s = usec_cycle - time_spent;
86184d14
JA
520
521 td->rate_pending_usleep += s;
fad86e6a 522 if (td->rate_pending_usleep >= 100000) {
86184d14
JA
523 usec_sleep(td->rate_pending_usleep);
524 td->rate_pending_usleep = 0;
525 }
4240cfa1 526 } else {
9e850933 527 long overtime = time_spent - usec_cycle;
42b2b9fe 528
4240cfa1
JA
529 td->rate_pending_usleep -= overtime;
530 }
531}
532
5c24b2c4 533static int check_min_rate(struct thread_data *td, struct timeval *now)
4240cfa1 534{
7607bc6b 535 unsigned long spent;
4240cfa1
JA
536 unsigned long rate;
537
538 /*
539 * allow a 2 second settle period in the beginning
540 */
7607bc6b 541 if (mtime_since(&td->start, now) < 2000)
4240cfa1
JA
542 return 0;
543
544 /*
545 * if rate blocks is set, sample is running
546 */
8c033f93 547 if (td->rate_kb) {
4240cfa1
JA
548 spent = mtime_since(&td->lastrate, now);
549 if (spent < td->ratecycle)
550 return 0;
551
f8e3d840 552 rate = ((td->this_io_kb - td->rate_kb) * 1024) / spent;
4240cfa1
JA
553 if (rate < td->ratemin) {
554 printf("Client%d: min rate %d not met, got %ldKiB/sec\n", td->thread_number, td->ratemin, rate);
02bdd9ba 555 if (rate_quit)
e6402082 556 sig_handler(0);
4240cfa1
JA
557 return 1;
558 }
86184d14 559 }
4240cfa1 560
f8e3d840 561 td->rate_kb = td->this_io_kb;
4240cfa1
JA
562 memcpy(&td->lastrate, now, sizeof(*now));
563 return 0;
86184d14
JA
564}
565
67903a2e
JA
566static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
567{
568 if (mtime_since(&td->start, t) >= td->timeout * 1000)
569 return 1;
570
571 return 0;
572}
573
e8457004
JA
574static void fill_random_bytes(struct thread_data *td,
575 unsigned char *p, unsigned int len)
576{
577 int todo;
578 long r;
579
580 while (len) {
581 lrand48_r(&td->verify_state, &r);
582
583 todo = sizeof(long);
584 if (todo > len)
585 todo = len;
586
587 memcpy(p, &r, todo);
588
589 len -= todo;
590 p += todo;
591 }
592}
593
594static int verify_io_u(struct thread_data *td, struct io_u *io_u)
595{
596 struct verify_header *hdr = (struct verify_header *) io_u->buf;
597 unsigned char *p = (unsigned char *) io_u->buf;
598 struct md5_ctx md5_ctx;
599
600 if (hdr->fio_magic != FIO_HDR_MAGIC)
601 return 1;
602
603 memset(&md5_ctx, 0, sizeof(md5_ctx));
604 p += sizeof(*hdr);
605 md5_update(&md5_ctx, p, hdr->len - sizeof(*hdr));
606
607 return memcmp(hdr->md5_digest, md5_ctx.hash, sizeof(md5_ctx.hash));
608}
609
610static int verify_io_us(struct thread_data *td, struct io_u *io_u, int *back)
611{
612 struct verify_header *hdr;
613 unsigned int left;
614 struct io_u i;
615 char *buf;
616 off_t off;
617
618 *back = 0;
619
620 left = io_u->buflen;
621 buf = io_u->buf;
622 off = io_u->offset;
623 while (left) {
624 hdr = (struct verify_header *) buf;
625 i.buf = buf;
626 i.buflen = hdr->len;
627
628 if (hdr->len > left) {
629 *back = left;
630 return 0;
631 }
632
633 if (verify_io_u(td, &i)) {
634 printf("failed verify at offset %lu\n", (unsigned long) off);
635 return 1;
636 }
637
638 buf += hdr->len;
639 left -= hdr->len;
640 off += hdr->len;
641 }
642
643 return 0;
644}
645
cfc702bd
JA
646/*
647 * fill body of io_u->buf with random data and add a header with the
648 * (eg) sha1sum of that data.
649 */
e8457004 650static void populate_io_u(struct thread_data *td, struct io_u *io_u)
cfc702bd 651{
e8457004
JA
652 struct md5_ctx md5_ctx;
653 struct verify_header hdr;
654 unsigned char *p = (unsigned char *) io_u->buf;
655
656 hdr.fio_magic = FIO_HDR_MAGIC;
657 hdr.len = io_u->buflen;
658 p += sizeof(hdr);
659 fill_random_bytes(td, p, io_u->buflen - sizeof(hdr));
660
661 memset(&md5_ctx, 0, sizeof(md5_ctx));
662 md5_update(&md5_ctx, p, io_u->buflen - sizeof(hdr));
663 memcpy(hdr.md5_digest, md5_ctx.hash, sizeof(md5_ctx.hash));
664 memcpy(io_u->buf, &hdr, sizeof(hdr));
cfc702bd
JA
665}
666
2c83567e
JA
667static void put_io_u(struct thread_data *td, struct io_u *io_u)
668{
669 list_del(&io_u->list);
670 list_add(&io_u->list, &td->io_u_freelist);
671 td->cur_depth--;
672}
673
e8457004
JA
674static struct io_u *__get_io_u(struct thread_data *td)
675{
676 struct io_u *io_u;
677
678 if (list_empty(&td->io_u_freelist))
679 return NULL;
680
681 io_u = list_entry(td->io_u_freelist.next, struct io_u, list);
682 list_del(&io_u->list);
683 list_add(&io_u->list, &td->io_u_busylist);
684 return io_u;
685}
686
2c83567e
JA
687static struct io_u *get_io_u(struct thread_data *td)
688{
689 struct io_u *io_u;
7889f07b
JA
690 unsigned int len;
691 unsigned long long off;
2c83567e 692
e8457004
JA
693 io_u = __get_io_u(td);
694 if (!io_u)
2c83567e
JA
695 return NULL;
696
7889f07b
JA
697 off = get_next_offset(td);
698 len = get_next_buflen(td);
e8457004
JA
699 if (!len) {
700 put_io_u(td, io_u);
7889f07b 701 return NULL;
e8457004 702 }
2c83567e 703
7889f07b
JA
704 io_u->offset = off;
705 io_u->buflen = len;
2c83567e 706
cfc702bd 707 if (!td_read(td) && td->verify)
e8457004 708 populate_io_u(td, io_u);
cfc702bd 709
2c83567e
JA
710 if (td->use_aio) {
711 if (td_read(td))
712 io_prep_pread(&io_u->iocb, td->fd, io_u->buf, io_u->buflen, io_u->offset);
713 else
714 io_prep_pwrite(&io_u->iocb, td->fd, io_u->buf, io_u->buflen, io_u->offset);
715 }
716
57d753e3 717 gettimeofday(&io_u->start_time, NULL);
2c83567e
JA
718 td->cur_depth++;
719 return io_u;
720}
721
cfc702bd
JA
722static int do_sync_verify(struct thread_data *td)
723{
e8457004
JA
724 struct io_u *io_u = NULL;
725 loff_t off = 0;
726 int back, ret;
727
728 td->runstate = TD_VERIFYING;
729
730 io_u = __get_io_u(td);
731
732 if (lseek(td->fd, 0, SEEK_SET) < 0) {
733 td->error = errno;
734 goto out;
735 }
736
737 do {
738 if (td->terminate)
739 break;
740
741 io_u->offset = off;
742 io_u->buflen = td->max_bs;
743
744 ret = read(td->fd, io_u->buf, io_u->buflen);
745 if (ret < (int) io_u->buflen) {
746 if (ret == -1) {
747 td->error = errno;
748 break;
749 } else if (!ret)
750 break;
751 else
752 io_u->buflen = ret;
753 }
754
755 if (verify_io_us(td, io_u, &back))
756 break;
757
758 if (back) {
f8e3d840 759 ret -= back;
e8457004
JA
760 if (lseek(td->fd, -back, SEEK_CUR) < 0) {
761 td->error = errno;
762 break;
763 }
764 }
765
766 off += ret;
767 } while (1);
768
769out:
770 td->runstate = TD_RUNNING;
771 put_io_u(td, io_u);
772
773 return td->error == 0;
cfc702bd
JA
774}
775
43000118 776static void do_sync_io(struct thread_data *td)
892199bd 777{
7889f07b 778 unsigned long msec, usec;
e8457004 779 struct io_u *io_u = NULL;
2c83567e 780 struct timeval e;
892199bd 781
63a09e51 782 td->cur_off = 0;
e8457004 783 td->last_kb = 0;
63a09e51 784
f8e3d840 785 for (td->this_io_kb = 0; td->this_io_kb < td->kb;) {
892199bd
JA
786 int ret;
787
788 if (td->terminate)
789 break;
790
2c83567e 791 io_u = get_io_u(td);
7889f07b
JA
792 if (!io_u)
793 break;
2c83567e 794
63a09e51
JA
795 if (td->cur_off != io_u->offset) {
796 if (lseek(td->fd, io_u->offset, SEEK_SET) == -1) {
797 td->error = errno;
798 break;
799 }
892199bd
JA
800 }
801
02983297 802 if (td_read(td))
2c83567e 803 ret = read(td->fd, io_u->buf, io_u->buflen);
892199bd 804 else
2c83567e 805 ret = write(td->fd, io_u->buf, io_u->buflen);
892199bd 806
2c83567e 807 if (ret < (int) io_u->buflen) {
892199bd
JA
808 if (ret == -1)
809 td->error = errno;
810 break;
811 }
812
4240cfa1 813 td->io_blocks++;
8c033f93 814 td->io_kb += io_u->buflen >> 10;
f8e3d840 815 td->this_io_kb += io_u->buflen >> 10;
63a09e51 816 td->cur_off = io_u->offset + io_u->buflen;
4240cfa1 817
86184d14
JA
818 gettimeofday(&e, NULL);
819
57d753e3 820 usec = utime_since(&io_u->start_time, &e);
86184d14 821
9e850933 822 rate_throttle(td, usec, io_u->buflen);
892199bd 823
4240cfa1
JA
824 if (check_min_rate(td, &e)) {
825 td->error = ENODATA;
826 break;
827 }
892199bd 828
4240cfa1 829 msec = usec / 1000;
57d753e3
JA
830 add_clat_sample(td, msec);
831 add_bw_sample(td, msec);
67903a2e
JA
832
833 if (runtime_exceeded(td, &e))
834 break;
2c83567e 835
cdf92433 836 put_io_u(td, io_u);
e8457004 837 io_u = NULL;
cdf92433 838
e97712ed
JA
839 if (td->thinktime)
840 usec_sleep(td->thinktime);
841
cdf92433
JA
842 if (should_fsync(td) && td->fsync_blocks &&
843 (td->io_blocks % td->fsync_blocks) == 0)
844 fsync(td->fd);
892199bd
JA
845 }
846
e8457004
JA
847 if (io_u)
848 put_io_u(td, io_u);
849
4240cfa1 850 if (should_fsync(td))
892199bd 851 fsync(td->fd);
892199bd 852}
43000118 853
2c83567e 854static int io_u_queue(struct thread_data *td, struct io_u *io_u)
56b0eff0 855{
2c83567e 856 struct iocb *iocb = &io_u->iocb;
56b0eff0
JA
857 int ret;
858
859 do {
254605cd 860 ret = io_submit(td->aio_ctx, 1, &iocb);
56b0eff0
JA
861 if (ret == 1)
862 return 0;
a592bd33 863 else if (ret == EAGAIN)
56b0eff0 864 usleep(100);
a592bd33
JA
865 else if (ret == EINTR)
866 continue;
56b0eff0
JA
867 else
868 break;
869 } while (1);
870
a592bd33 871 return ret;
56b0eff0
JA
872}
873
98168d55 874#define iocb_time(iocb) ((unsigned long) (iocb)->data)
2c83567e
JA
875#define ev_to_iou(ev) (struct io_u *) ((unsigned long) (ev)->obj)
876
9e850933 877static int ios_completed(struct thread_data *td, int nr)
2c83567e
JA
878{
879 unsigned long msec;
880 struct io_u *io_u;
881 struct timeval e;
9e850933 882 int i, bytes_done;
2c83567e
JA
883
884 gettimeofday(&e, NULL);
885
9e850933 886 for (i = 0, bytes_done = 0; i < nr; i++) {
2c83567e
JA
887 io_u = ev_to_iou(td->aio_events + i);
888
8c033f93
JA
889 td->io_blocks++;
890 td->io_kb += io_u->buflen >> 10;
f8e3d840 891 td->this_io_kb += io_u->buflen >> 10;
9e850933 892 bytes_done += io_u->buflen;
8c033f93 893
2c83567e
JA
894 msec = mtime_since(&io_u->issue_time, &e);
895
57d753e3
JA
896 add_clat_sample(td, msec);
897 add_bw_sample(td, msec);
2c83567e
JA
898
899 put_io_u(td, io_u);
900 }
9e850933
JA
901
902 return bytes_done;
2c83567e
JA
903}
904
905static void cleanup_pending_aio(struct thread_data *td)
906{
907 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0};
908 struct list_head *entry, *n;
909 struct io_u *io_u;
910 int r;
911
912 /*
913 * get immediately available events, if any
914 */
915 r = io_getevents(td->aio_ctx, 0, td->cur_depth, td->aio_events, &ts);
916 if (r > 0)
917 ios_completed(td, r);
918
919 /*
920 * now cancel remaining active events
921 */
922 list_for_each_safe(entry, n, &td->io_u_busylist) {
923 io_u = list_entry(entry, struct io_u, list);
924
925 r = io_cancel(td->aio_ctx, &io_u->iocb, td->aio_events);
926 if (!r)
927 put_io_u(td, io_u);
928 }
929
930 if (td->cur_depth) {
931 r = io_getevents(td->aio_ctx, td->cur_depth, td->cur_depth, td->aio_events, NULL);
932 if (r > 0)
933 ios_completed(td, r);
934 }
935}
98168d55 936
cfc702bd
JA
937static int do_async_verify(struct thread_data *td)
938{
e8457004
JA
939 /*
940 * need to implement the async version
941 */
942 return do_sync_verify(td);
cfc702bd
JA
943}
944
43000118
JA
945static void do_async_io(struct thread_data *td)
946{
947 struct timeval s, e;
7889f07b 948 unsigned long usec;
43000118 949
e8457004
JA
950 td->cur_off = 0;
951 td->last_kb = 0;
952
f8e3d840 953 for (td->this_io_kb = 0; td->this_io_kb < td->kb;) {
43000118
JA
954 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0};
955 struct timespec *timeout;
2c83567e
JA
956 int ret, min_evts = 0;
957 struct io_u *io_u;
9e850933 958 unsigned int bytes_done;
43000118
JA
959
960 if (td->terminate)
961 break;
962
2c83567e 963 io_u = get_io_u(td);
7889f07b
JA
964 if (!io_u)
965 break;
43000118 966
57d753e3 967 memcpy(&s, &io_u->start_time, sizeof(s));
8baf1bcc 968
2c83567e 969 ret = io_u_queue(td, io_u);
56b0eff0 970 if (ret) {
a3fdb993 971 put_io_u(td, io_u);
a592bd33 972 td->error = ret;
43000118
JA
973 break;
974 }
975
57d753e3
JA
976 gettimeofday(&io_u->issue_time, NULL);
977 add_slat_sample(td, mtime_since(&io_u->start_time, &io_u->issue_time));
2c83567e 978 if (td->cur_depth < td->aio_depth) {
43000118
JA
979 timeout = &ts;
980 min_evts = 0;
981 } else {
982 timeout = NULL;
983 min_evts = 1;
984 }
985
2c83567e 986 ret = io_getevents(td->aio_ctx, min_evts, td->cur_depth, td->aio_events, timeout);
43000118
JA
987 if (ret < 0) {
988 td->error = errno;
989 break;
990 } else if (!ret)
991 continue;
992
9e850933 993 bytes_done = ios_completed(td, ret);
43000118 994
98168d55
JA
995 /*
996 * the rate is batched for now, it should work for batches
997 * of completions except the very first one which may look
998 * a little bursty
999 */
2c83567e 1000 gettimeofday(&e, NULL);
43000118
JA
1001 usec = utime_since(&s, &e);
1002
9e850933 1003 rate_throttle(td, usec, bytes_done);
43000118
JA
1004
1005 if (check_min_rate(td, &e)) {
1006 td->error = ENODATA;
1007 break;
1008 }
67903a2e
JA
1009
1010 if (runtime_exceeded(td, &e))
1011 break;
765d9223
JA
1012
1013 if (td->thinktime)
1014 usec_sleep(td->thinktime);
cdf92433
JA
1015
1016 if (should_fsync(td) && td->fsync_blocks &&
1017 (td->io_blocks % td->fsync_blocks) == 0)
1018 fsync(td->fd);
43000118 1019 }
56b0eff0 1020
2c83567e
JA
1021 if (td->cur_depth)
1022 cleanup_pending_aio(td);
4ac89145
JA
1023
1024 if (should_fsync(td))
1025 fsync(td->fd);
56b0eff0
JA
1026}
1027
1028static void cleanup_aio(struct thread_data *td)
1029{
254605cd
JA
1030 io_destroy(td->aio_ctx);
1031
43000118
JA
1032 if (td->aio_events)
1033 free(td->aio_events);
43000118
JA
1034}
1035
1036static int init_aio(struct thread_data *td)
1037{
254605cd 1038 if (io_queue_init(td->aio_depth, &td->aio_ctx)) {
43000118
JA
1039 td->error = errno;
1040 return 1;
1041 }
1042
43000118 1043 td->aio_events = malloc(td->aio_depth * sizeof(struct io_event));
43000118
JA
1044 return 0;
1045}
1046
2c83567e
JA
1047static void cleanup_io_u(struct thread_data *td)
1048{
1049 struct list_head *entry, *n;
1050 struct io_u *io_u;
1051
1052 list_for_each_safe(entry, n, &td->io_u_freelist) {
1053 io_u = list_entry(entry, struct io_u, list);
1054
1055 list_del(&io_u->list);
2c83567e
JA
1056 free(io_u);
1057 }
6b71c826 1058
99c6704f
JA
1059 if (td->mem_type == MEM_MALLOC)
1060 free(td->orig_buffer);
1061 else if (td->mem_type == MEM_SHM) {
1062 struct shmid_ds sbuf;
1063
1064 shmdt(td->orig_buffer);
1065 shmctl(td->shm_id, IPC_RMID, &sbuf);
1066 }
2c83567e
JA
1067}
1068
99c6704f 1069static int init_io_u(struct thread_data *td)
2c83567e
JA
1070{
1071 struct io_u *io_u;
99c6704f 1072 int i, max_units, mem_size;
6b71c826 1073 char *p;
2c83567e
JA
1074
1075 if (!td->use_aio)
1076 max_units = 1;
1077 else
1078 max_units = td->aio_depth;
1079
7889f07b 1080 mem_size = td->max_bs * max_units + MASK;
99c6704f
JA
1081
1082 if (td->mem_type == MEM_MALLOC)
1083 td->orig_buffer = malloc(mem_size);
1084 else if (td->mem_type == MEM_SHM) {
1085 td->shm_id = shmget(IPC_PRIVATE, mem_size, IPC_CREAT | 0600);
1086 if (td->shm_id < 0) {
1087 td->error = errno;
1088 perror("shmget");
1089 return 1;
1090 }
1091
1092 td->orig_buffer = shmat(td->shm_id, NULL, 0);
1093 if (td->orig_buffer == (void *) -1) {
1094 td->error = errno;
1095 perror("shmat");
1096 return 1;
1097 }
1098 }
6b71c826 1099
2c83567e
JA
1100 INIT_LIST_HEAD(&td->io_u_freelist);
1101 INIT_LIST_HEAD(&td->io_u_busylist);
1102
99c6704f 1103 p = ALIGN(td->orig_buffer);
2c83567e
JA
1104 for (i = 0; i < max_units; i++) {
1105 io_u = malloc(sizeof(*io_u));
1106 memset(io_u, 0, sizeof(*io_u));
1107 INIT_LIST_HEAD(&io_u->list);
1108
7889f07b 1109 io_u->buf = p + td->max_bs * i;
2c83567e
JA
1110 list_add(&io_u->list, &td->io_u_freelist);
1111 }
99c6704f
JA
1112
1113 return 0;
2c83567e
JA
1114}
1115
a0a9b35b
JA
1116static void setup_log(struct io_log **log)
1117{
1118 struct io_log *l = malloc(sizeof(*l));
1119
1120 l->nr_samples = 0;
1121 l->max_samples = 1024;
1122 l->log = malloc(l->max_samples * sizeof(struct io_sample));
1123 *log = l;
1124}
1125
1126static void finish_log(struct thread_data *td, struct io_log *log, char *name)
1127{
1128 char file_name[128];
1129 FILE *f;
1130 int i;
1131
1132 sprintf(file_name, "client%d_%s.log", td->thread_number, name);
1133 f = fopen(file_name, "w");
1134 if (!f) {
1135 perror("fopen log");
1136 return;
1137 }
1138
1139 for (i = 0; i < log->nr_samples; i++)
1140 fprintf(f, "%lu, %lu\n", log->log[i].time, log->log[i].val);
1141
1142 fclose(f);
1143 free(log->log);
1144 free(log);
1145}
1146
02983297
JA
1147static int create_file(struct thread_data *td)
1148{
7889f07b 1149 unsigned long long left;
02983297 1150 char *b;
7889f07b 1151 int r, bs;
02983297 1152
02983297
JA
1153 /*
1154 * unless specifically asked for overwrite, let normal io extend it
1155 */
1156 if (!td_read(td) && !td->overwrite)
1157 return 0;
1158
57d753e3
JA
1159 if (!td->file_size) {
1160 fprintf(stderr, "Need size for create\n");
1161 td->error = EINVAL;
1162 return 1;
1163 }
1164
42fd89a7
JA
1165 printf("Client%d: Laying out IO file\n", td->thread_number);
1166
02983297
JA
1167 td->fd = open(td->file_name, O_WRONLY | O_CREAT | O_TRUNC, 0644);
1168 if (td->fd < 0) {
1169 td->error = errno;
1170 return 1;
1171 }
1172
7889f07b
JA
1173 td->kb = td->file_size >> 10;
1174 b = malloc(td->max_bs);
1175 memset(b, 0, td->max_bs);
1176
1177 left = td->file_size;
1178 while (left) {
1179 bs = td->max_bs;
1180 if (bs > left)
1181 bs = left;
02983297 1182
7889f07b 1183 r = write(td->fd, b, bs);
02983297 1184
7889f07b
JA
1185 if (r == bs) {
1186 left -= bs;
02983297 1187 continue;
7889f07b 1188 } else {
02983297
JA
1189 if (r < 0)
1190 td->error = errno;
1191 else
1192 td->error = EIO;
1193
1194 break;
1195 }
1196 }
1197
fc097bfe
JA
1198 if (td->create_fsync)
1199 fsync(td->fd);
1200
02983297
JA
1201 close(td->fd);
1202 td->fd = -1;
1203 free(b);
1204 return 0;
1205}
1206
1207static int file_exists(struct thread_data *td)
1208{
1209 struct stat st;
1210
1211 if (stat(td->file_name, &st) != -1)
1212 return 1;
1213
1214 return errno != ENOENT;
1215}
1216
1217static int setup_file(struct thread_data *td)
1218{
1219 struct stat st;
1220 int flags = 0;
1221
1222 if (!file_exists(td)) {
1223 if (!td->create_file) {
1224 td->error = ENOENT;
1225 return 1;
1226 }
1227 if (create_file(td))
1228 return 1;
1229 }
1230
1231 if (td->odirect)
1232 flags |= O_DIRECT;
1233
1234 if (td_read(td))
1235 td->fd = open(td->file_name, flags | O_RDONLY);
1236 else {
1237 if (!td->overwrite)
1238 flags |= O_TRUNC;
74b4b5fb
JA
1239 if (td->sync_io)
1240 flags |= O_SYNC;
e8457004
JA
1241 if (td->verify)
1242 flags |= O_RDWR;
1243 else
1244 flags |= O_WRONLY;
02983297 1245
e8457004 1246 td->fd = open(td->file_name, flags | O_CREAT, 0600);
02983297
JA
1247 }
1248
1249 if (td->fd == -1) {
1250 td->error = errno;
1251 return 1;
1252 }
1253
1254 if (td_read(td)) {
1255 if (fstat(td->fd, &st) == -1) {
1256 td->error = errno;
1257 return 1;
1258 }
1259
1260 if (td->file_size > st.st_size)
1261 st.st_size = td->file_size;
1262 } else {
1263 if (!td->file_size)
1264 td->file_size = 1024 * 1024 * 1024;
1265
1266 st.st_size = td->file_size;
1267 }
1268
7889f07b
JA
1269 td->kb = (st.st_size - td->file_offset) / 1024;
1270 if (!td->kb) {
02983297
JA
1271 fprintf(stderr, "Client%d: no io blocks\n", td->thread_number);
1272 td->error = EINVAL;
1273 return 1;
1274 }
1275
b95799ca
JA
1276 if (td->invalidate_cache) {
1277 if (fadvise(td->fd, 0, st.st_size, POSIX_FADV_DONTNEED) < 0) {
1278 td->error = errno;
1279 return 1;
1280 }
1281 }
1282
02983297
JA
1283 return 0;
1284}
1285
5c24b2c4 1286static void *thread_main(int shm_id, int offset, char *argv[])
892199bd
JA
1287{
1288 struct thread_data *td;
02983297 1289 int ret = 1;
2c83567e 1290 void *data;
892199bd 1291
7292613b
JA
1292 setsid();
1293
892199bd 1294 data = shmat(shm_id, NULL, 0);
4ac89145
JA
1295 if (data == (void *) -1) {
1296 perror("shmat");
1297 return NULL;
1298 }
1299
892199bd
JA
1300 td = data + offset * sizeof(struct thread_data);
1301 td->pid = getpid();
1302
99c6704f
JA
1303 if (init_io_u(td))
1304 goto err;
2c83567e 1305
18e0b78c
JA
1306 if (sched_setaffinity(td->pid, sizeof(td->cpumask), &td->cpumask) == -1) {
1307 td->error = errno;
1308 goto err;
1309 }
1310
4240cfa1 1311 sprintf(argv[0], "fio%d", offset);
892199bd 1312
43000118
JA
1313 if (td->use_aio && init_aio(td))
1314 goto err;
1315
892199bd 1316 if (init_random_state(td))
599002b3 1317 goto err;
892199bd 1318
f737299d 1319 if (td->ioprio) {
892199bd
JA
1320 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
1321 td->error = errno;
599002b3 1322 goto err;
892199bd
JA
1323 }
1324 }
1325
1326 sem_post(&startup_sem);
1327 sem_wait(&td->mutex);
43000118 1328
fc097bfe
JA
1329 if (!td->create_serialize && setup_file(td))
1330 goto err;
1331
7292613b
JA
1332 gettimeofday(&td->start, NULL);
1333
1334 if (td->ratemin)
1335 memcpy(&td->lastrate, &td->start, sizeof(td->start));
1336
fd1ae4c9
JA
1337 memcpy(&td->stat_sample_time, &td->start, sizeof(td->start));
1338
b6794fbf 1339 while (td->loops--) {
cfc702bd 1340 if (!td->use_aio) {
b6794fbf 1341 do_sync_io(td);
cfc702bd
JA
1342
1343 if (td->verify) {
f8e3d840 1344 if (!do_sync_verify(td))
cfc702bd
JA
1345 break;
1346 }
1347 } else {
b6794fbf 1348 do_async_io(td);
cfc702bd
JA
1349
1350 if (td->verify) {
f8e3d840 1351 if (!do_async_verify(td))
cfc702bd
JA
1352 break;
1353 }
1354 }
b6794fbf 1355 }
7292613b 1356
be33abe4 1357 td->runtime = mtime_since_now(&td->start);
892199bd 1358 ret = 0;
a0a9b35b
JA
1359
1360 if (td->bw_log)
1361 finish_log(td, td->bw_log, "bw");
1362 if (td->lat_log)
1363 finish_log(td, td->lat_log, "lat");
4ac89145 1364
98dd52d6
JA
1365 if (exitall_on_terminate)
1366 sig_handler(0);
1367
892199bd 1368err:
7292613b
JA
1369 if (td->fd != -1) {
1370 close(td->fd);
1371 td->fd = -1;
1372 }
4ac89145
JA
1373 if (td->use_aio)
1374 cleanup_aio(td);
2c83567e 1375 cleanup_io_u(td);
599002b3 1376 if (ret) {
892199bd 1377 sem_post(&startup_sem);
599002b3
JA
1378 sem_wait(&td->mutex);
1379 }
02bdd9ba 1380 td->runstate = TD_EXITED;
4240cfa1 1381 shmdt(data);
892199bd
JA
1382 return NULL;
1383}
1384
5c24b2c4 1385static void free_shm(void)
892199bd 1386{
c269123b
JA
1387 struct shmid_ds sbuf;
1388
1389 if (threads) {
1390 shmdt(threads);
1391 threads = NULL;
1392 shmctl(shm_id, IPC_RMID, &sbuf);
1393 }
892199bd
JA
1394}
1395
57d753e3
JA
1396static int calc_lat(struct io_stat *is, unsigned long *min, unsigned long *max,
1397 double *mean, double *dev)
1398{
1399 double n;
1400
1401 if (is->samples == 0)
1402 return 0;
1403
1404 *min = is->min_val;
1405 *max = is->max_val;
1406
1407 n = (double) is->samples;
1408 *mean = (double) is->val / n;
1409 *dev = sqrt(((double) is->val_sq - (*mean * *mean) / n) / (n - 1));
1410 return 1;
1411}
1412
5c24b2c4 1413static void show_thread_status(struct thread_data *td)
892199bd
JA
1414{
1415 int prio, prio_class;
57d753e3
JA
1416 unsigned long min, max, bw = 0;
1417 double mean, dev;
892199bd 1418
8c033f93 1419 if (!td->io_kb && !td->error)
213b446c
JA
1420 return;
1421
892199bd 1422 if (td->runtime)
7889f07b 1423 bw = td->io_kb * 1024 / td->runtime;
892199bd
JA
1424
1425 prio = td->ioprio & 0xff;
1426 prio_class = td->ioprio >> IOPRIO_CLASS_SHIFT;
1427
396fe7cd 1428 printf("Client%d: err=%2d, io=%6luMiB, bw=%6luKiB/s, runt=%6lumsec\n", td->thread_number, td->error, td->io_kb >> 10, bw, td->runtime);
fd1ae4c9 1429
57d753e3
JA
1430 if (calc_lat(&td->slat_stat, &min, &max, &mean, &dev))
1431 printf(" slat (msec): min=%5lu, max=%5lu, avg=%5.02f, dev=%5.02f\n", min, max, mean, dev);
1432 if (calc_lat(&td->clat_stat, &min, &max, &mean, &dev))
1433 printf(" clat (msec): min=%5lu, max=%5lu, avg=%5.02f, dev=%5.02f\n", min, max, mean, dev);
1434 if (calc_lat(&td->bw_stat, &min, &max, &mean, &dev))
1435 printf(" bw (KiB/s) : min=%5lu, max=%5lu, avg=%5.02f, dev=%5.02f\n", min, max, mean, dev);
892199bd
JA
1436}
1437
5c24b2c4 1438static int setup_rate(struct thread_data *td)
86184d14 1439{
4240cfa1
JA
1440 int nr_reads_per_sec;
1441
1442 if (!td->rate)
1443 return 0;
1444
1445 if (td->rate < td->ratemin) {
1446 fprintf(stderr, "min rate larger than nominal rate\n");
1447 return -1;
1448 }
86184d14 1449
7889f07b 1450 nr_reads_per_sec = td->rate * 1024 / td->min_bs;
86184d14
JA
1451 td->rate_usec_cycle = 1000000 / nr_reads_per_sec;
1452 td->rate_pending_usleep = 0;
4240cfa1 1453 return 0;
86184d14
JA
1454}
1455
47d45203 1456static struct thread_data *get_new_job(int global)
892199bd 1457{
4240cfa1
JA
1458 struct thread_data *td;
1459
47d45203
JA
1460 if (global)
1461 return &def_thread;
8867c0a8 1462 if (thread_number >= max_jobs)
4240cfa1
JA
1463 return NULL;
1464
1465 td = &threads[thread_number++];
fc24389f 1466 memset(td, 0, sizeof(*td));
892199bd 1467
e4ed35c3 1468 td->fd = -1;
86184d14 1469 td->thread_number = thread_number;
76cb7b42 1470
47d45203 1471 td->ddir = def_thread.ddir;
76cb7b42
JA
1472 td->ioprio = def_thread.ioprio;
1473 td->sequential = def_thread.sequential;
47d45203 1474 td->bs = def_thread.bs;
8c033f93
JA
1475 td->min_bs = def_thread.min_bs;
1476 td->max_bs = def_thread.max_bs;
47d45203 1477 td->odirect = def_thread.odirect;
e97712ed 1478 td->thinktime = def_thread.thinktime;
76cb7b42
JA
1479 td->fsync_blocks = def_thread.fsync_blocks;
1480 td->start_delay = def_thread.start_delay;
67903a2e 1481 td->timeout = def_thread.timeout;
76cb7b42 1482 td->use_aio = def_thread.use_aio;
02983297
JA
1483 td->create_file = def_thread.create_file;
1484 td->overwrite = def_thread.overwrite;
b95799ca 1485 td->invalidate_cache = def_thread.invalidate_cache;
76cb7b42 1486 td->file_size = def_thread.file_size;
9b5cf6c0 1487 td->file_offset = def_thread.file_offset;
76cb7b42
JA
1488 td->rate = def_thread.rate;
1489 td->ratemin = def_thread.ratemin;
1490 td->ratecycle = def_thread.ratecycle;
1491 td->aio_depth = def_thread.aio_depth;
99c6704f
JA
1492 td->sync_io = def_thread.sync_io;
1493 td->mem_type = def_thread.mem_type;
1d035750 1494 td->bw_avg_time = def_thread.bw_avg_time;
fc097bfe
JA
1495 td->create_serialize = def_thread.create_serialize;
1496 td->create_fsync = def_thread.create_fsync;
b6794fbf 1497 td->loops = def_thread.loops;
cfc702bd 1498 td->verify = def_thread.verify;
47d45203 1499 memcpy(&td->cpumask, &def_thread.cpumask, sizeof(td->cpumask));
f737299d
JA
1500
1501 return td;
1502}
1503
4240cfa1
JA
1504static void put_job(struct thread_data *td)
1505{
1506 memset(&threads[td->thread_number - 1], 0, sizeof(*td));
1507 thread_number--;
1508}
1509
5c24b2c4
JA
1510static int add_job(struct thread_data *td, const char *filename, int prioclass,
1511 int prio)
f737299d 1512{
47d45203
JA
1513 if (td == &def_thread)
1514 return 0;
1515
f737299d 1516 strcpy(td->file_name, filename);
4240cfa1 1517 sem_init(&td->mutex, 1, 0);
f737299d
JA
1518 td->ioprio = (prioclass << IOPRIO_CLASS_SHIFT) | prio;
1519
57d753e3
JA
1520 td->clat_stat.min_val = ULONG_MAX;
1521 td->slat_stat.min_val = ULONG_MAX;
1522 td->bw_stat.min_val = ULONG_MAX;
1523
8dbff0b1
JA
1524 run_str[td->thread_number - 1] = 'P';
1525
4ac89145
JA
1526 if (td->use_aio && !td->aio_depth)
1527 td->aio_depth = 1;
43000118 1528
8bdcfab5
JA
1529 if (td->min_bs == -1)
1530 td->min_bs = td->bs;
1531 if (td->max_bs == -1)
1532 td->max_bs = td->bs;
1533
4240cfa1
JA
1534 if (setup_rate(td))
1535 return -1;
f737299d 1536
a0a9b35b
JA
1537 if (write_lat_log)
1538 setup_log(&td->lat_log);
1539 if (write_bw_log)
1540 setup_log(&td->bw_log);
1541
7889f07b 1542 printf("Client%d: file=%s, rw=%d, prio=%d/%d, seq=%d, odir=%d, bs=%d-%d, rate=%d, aio=%d, aio_depth=%d\n", td->thread_number, filename, td->ddir, prioclass, prio, td->sequential, td->odirect, td->min_bs, td->max_bs, td->rate, td->use_aio, td->aio_depth);
4240cfa1 1543 return 0;
892199bd
JA
1544}
1545
18e0b78c
JA
1546static void fill_cpu_mask(cpu_set_t cpumask, int cpu)
1547{
f737299d 1548 unsigned int i;
18e0b78c
JA
1549
1550 CPU_ZERO(&cpumask);
1551
1552 for (i = 0; i < sizeof(int) * 8; i++) {
1553 if ((1 << i) & cpu)
1554 CPU_SET(i, &cpumask);
1555 }
1556}
1557
7889f07b
JA
1558unsigned long get_mult(char c)
1559{
1560 switch (c) {
1561 case 'k':
1562 case 'K':
1563 return 1024;
1564 case 'm':
1565 case 'M':
1566 return 1024 * 1024;
1567 case 'g':
1568 case 'G':
1569 return 1024 * 1024 * 1024;
1570 default:
1571 return 1;
1572 }
1573}
1574
02983297
JA
1575/*
1576 * convert string after '=' into decimal value, noting any size suffix
1577 */
1578static int str_cnv(char *p, unsigned long long *val)
1579{
02983297
JA
1580 char *str;
1581 int len;
1582
1583 str = strstr(p, "=");
1584 if (!str)
1585 return 1;
1586
1587 str++;
1588 len = strlen(str);
02983297
JA
1589
1590 *val = strtoul(str, NULL, 10);
1591 if (*val == ULONG_MAX && errno == ERANGE)
1592 return 1;
1593
7889f07b 1594 *val *= get_mult(str[len - 2]);
02983297 1595 return 0;
02983297
JA
1596}
1597
02983297
JA
1598static int check_strcnv(char *p, char *name, unsigned long long *val)
1599{
1600 if (!strstr(p, name))
1601 return 1;
1602
1603 return str_cnv(p, val);
1604}
1605
99c6704f
JA
1606static int check_str(char *p, char *name, char *option)
1607{
1608 char *s = strstr(p, name);
1609
1610 if (!s)
1611 return 1;
1612
1613 s += strlen(name);
1614 if (strstr(s, option))
1615 return 0;
1616
1617 return 1;
1618}
1619
7889f07b
JA
1620static int check_range(char *p, char *name, unsigned long *s, unsigned long *e)
1621{
1622 char str[128];
1623 char s1, s2;
1624
1625 sprintf(str, "%s=%%lu%%c-%%lu%%c", name);
1626 if (sscanf(p, str, s, &s1, e, &s2) == 4) {
1627 *s *= get_mult(s1);
1628 *e *= get_mult(s2);
1629 return 0;
1630 }
1631
1632 sprintf(str, "%s = %%lu%%c-%%lu%%c", name);
1633 if (sscanf(p, str, s, &s1, e, &s2) == 4) {
1634 *s *= get_mult(s1);
1635 *e *= get_mult(s2);
1636 return 0;
1637 }
1638
1639 sprintf(str, "%s=%%lu-%%lu", name);
1640 if (sscanf(p, str, s, e) == 2)
1641 return 0;
1642
1643 sprintf(str, "%s = %%lu-%%lu", name);
1644 if (sscanf(p, str, s, e) == 2)
1645 return 0;
1646
1647 return 1;
1648
1649}
1650
5c24b2c4 1651static int check_int(char *p, char *name, unsigned int *val)
7dd1389e
JA
1652{
1653 char str[128];
1654
1655 sprintf(str, "%s=%%d", name);
1656 if (sscanf(p, str, val) == 1)
1657 return 0;
1658
1659 sprintf(str, "%s = %%d", name);
1660 if (sscanf(p, str, val) == 1)
1661 return 0;
1662
1663 return 1;
1664}
1665
7292613b 1666static int is_empty_or_comment(char *line)
7dd1389e
JA
1667{
1668 unsigned int i;
1669
7292613b 1670 for (i = 0; i < strlen(line); i++) {
7292613b 1671 if (line[i] == ';')
47d45203
JA
1672 return 1;
1673 if (!isspace(line[i]) && !iscntrl(line[i]))
7292613b
JA
1674 return 0;
1675 }
7dd1389e
JA
1676
1677 return 1;
1678}
1679
5c24b2c4 1680static int parse_jobs_ini(char *file)
7dd1389e 1681{
47d45203 1682 unsigned int prioclass, prio, cpu, global;
8c033f93 1683 unsigned long long ull;
7889f07b 1684 unsigned long ul1, ul2;
f737299d 1685 struct thread_data *td;
7dd1389e
JA
1686 char *string, *name;
1687 fpos_t off;
1688 FILE *f;
1689 char *p;
1690
1691 f = fopen(file, "r");
1692 if (!f) {
1693 perror("fopen");
4240cfa1 1694 return 1;
7dd1389e
JA
1695 }
1696
1697 string = malloc(4096);
1698 name = malloc(256);
1699
7dd1389e 1700 while ((p = fgets(string, 4096, f)) != NULL) {
7292613b
JA
1701 if (is_empty_or_comment(p))
1702 continue;
7dd1389e
JA
1703 if (sscanf(p, "[%s]", name) != 1)
1704 continue;
1705
47d45203
JA
1706 global = !strncmp(name, "global", 6);
1707
7dd1389e
JA
1708 name[strlen(name) - 1] = '\0';
1709
47d45203 1710 td = get_new_job(global);
4240cfa1
JA
1711 if (!td)
1712 break;
f737299d 1713
7dd1389e 1714 prioclass = 2;
f737299d 1715 prio = 4;
7dd1389e
JA
1716
1717 fgetpos(f, &off);
1718 while ((p = fgets(string, 4096, f)) != NULL) {
7292613b 1719 if (is_empty_or_comment(p))
e6402082
JA
1720 continue;
1721 if (strstr(p, "["))
7dd1389e 1722 break;
f737299d 1723 if (!check_int(p, "rw", &td->ddir)) {
7dd1389e
JA
1724 fgetpos(f, &off);
1725 continue;
1726 }
1727 if (!check_int(p, "prio", &prio)) {
1728 fgetpos(f, &off);
1729 continue;
1730 }
1731 if (!check_int(p, "prioclass", &prioclass)) {
1732 fgetpos(f, &off);
1733 continue;
1734 }
f737299d 1735 if (!check_int(p, "direct", &td->odirect)) {
7dd1389e
JA
1736 fgetpos(f, &off);
1737 continue;
1738 }
f737299d 1739 if (!check_int(p, "rate", &td->rate)) {
7dd1389e
JA
1740 fgetpos(f, &off);
1741 continue;
1742 }
4240cfa1
JA
1743 if (!check_int(p, "ratemin", &td->ratemin)) {
1744 fgetpos(f, &off);
1745 continue;
1746 }
1747 if (!check_int(p, "ratecycle", &td->ratecycle)) {
1748 fgetpos(f, &off);
1749 continue;
1750 }
e97712ed 1751 if (!check_int(p, "thinktime", &td->thinktime)) {
7dd1389e
JA
1752 fgetpos(f, &off);
1753 continue;
1754 }
18e0b78c 1755 if (!check_int(p, "cpumask", &cpu)) {
f737299d 1756 fill_cpu_mask(td->cpumask, cpu);
18e0b78c
JA
1757 fgetpos(f, &off);
1758 continue;
1759 }
4240cfa1
JA
1760 if (!check_int(p, "fsync", &td->fsync_blocks)) {
1761 fgetpos(f, &off);
1762 continue;
1763 }
fc24389f
JA
1764 if (!check_int(p, "startdelay", &td->start_delay)) {
1765 fgetpos(f, &off);
1766 continue;
1767 }
67903a2e
JA
1768 if (!check_int(p, "timeout", &td->timeout)) {
1769 fgetpos(f, &off);
1770 continue;
1771 }
b95799ca
JA
1772 if (!check_int(p, "invalidate",&td->invalidate_cache)) {
1773 fgetpos(f, &off);
1774 continue;
1775 }
43000118
JA
1776 if (!check_int(p, "aio_depth", &td->aio_depth)) {
1777 fgetpos(f, &off);
1778 continue;
1779 }
74b4b5fb
JA
1780 if (!check_int(p, "sync", &td->sync_io)) {
1781 fgetpos(f, &off);
1782 continue;
1783 }
1d035750
JA
1784 if (!check_int(p, "bwavgtime", &td->bw_avg_time)) {
1785 fgetpos(f, &off);
1786 continue;
1787 }
fc097bfe
JA
1788 if (!check_int(p, "create_serialize", &td->create_serialize)) {
1789 fgetpos(f, &off);
1790 continue;
1791 }
1792 if (!check_int(p, "create_fsync", &td->create_fsync)) {
1793 fgetpos(f, &off);
1794 continue;
1795 }
b6794fbf
JA
1796 if (!check_int(p, "loops", &td->loops)) {
1797 fgetpos(f, &off);
1798 continue;
1799 }
e8457004
JA
1800 if (!check_int(p, "verify", &td->verify)) {
1801 fgetpos(f, &off);
1802 continue;
1803 }
7889f07b
JA
1804 if (!check_range(p, "bsrange", &ul1, &ul2)) {
1805 td->min_bs = ul1;
1806 td->max_bs = ul2;
1807 fgetpos(f, &off);
1808 continue;
1809 }
8c033f93
JA
1810 if (!check_strcnv(p, "bs", &ull)) {
1811 td->bs = ull;
1812 fgetpos(f, &off);
1813 continue;
1814 }
02983297
JA
1815 if (!check_strcnv(p, "size", &td->file_size)) {
1816 fgetpos(f, &off);
1817 continue;
1818 }
1819 if (!check_strcnv(p, "offset", &td->file_offset)) {
1820 fgetpos(f, &off);
1821 continue;
1822 }
99c6704f 1823 if (!check_str(p, "mem", "malloc")) {
99c6704f
JA
1824 td->mem_type = MEM_MALLOC;
1825 fgetpos(f, &off);
1826 continue;
1827 }
1828 if (!check_str(p, "mem", "shm")) {
99c6704f
JA
1829 td->mem_type = MEM_SHM;
1830 fgetpos(f, &off);
1831 continue;
1832 }
43000118 1833 if (!strncmp(p, "sequential", 10)) {
f737299d 1834 td->sequential = 1;
7dd1389e
JA
1835 fgetpos(f, &off);
1836 continue;
1837 }
43000118 1838 if (!strncmp(p, "random", 6)) {
f737299d 1839 td->sequential = 0;
7dd1389e
JA
1840 fgetpos(f, &off);
1841 continue;
1842 }
43000118
JA
1843 if (!strncmp(p, "aio", 3)) {
1844 td->use_aio = 1;
1845 fgetpos(f, &off);
1846 continue;
1847 }
02983297
JA
1848 if (!strncmp(p, "create", 6)) {
1849 td->create_file = 1;
1850 fgetpos(f, &off);
1851 continue;
1852 }
1853 if (!strncmp(p, "overwrite", 9)) {
1854 td->overwrite = 1;
1855 fgetpos(f, &off);
1856 continue;
1857 }
98dd52d6
JA
1858 if (!strncmp(p, "exitall", 7)) {
1859 exitall_on_terminate = 1;
1860 fgetpos(f, &off);
1861 continue;
1862 }
e6402082 1863 printf("Client%d: bad option %s\n",td->thread_number,p);
7dd1389e
JA
1864 }
1865 fsetpos(f, &off);
1866
4240cfa1
JA
1867 if (add_job(td, name, prioclass, prio))
1868 put_job(td);
7dd1389e
JA
1869 }
1870
1871 free(string);
1872 free(name);
fc7d63df 1873 fclose(f);
4240cfa1 1874 return 0;
7dd1389e
JA
1875}
1876
5c24b2c4 1877static int parse_options(int argc, char *argv[])
892199bd 1878{
01c4d8de 1879 int i;
892199bd
JA
1880
1881 for (i = 1; i < argc; i++) {
1882 char *parm = argv[i];
1883
1884 if (parm[0] != '-')
1885 break;
1886
1887 parm++;
1888 switch (*parm) {
1889 case 's':
1890 parm++;
47d45203 1891 def_thread.sequential = !!atoi(parm);
892199bd
JA
1892 break;
1893 case 'b':
1894 parm++;
47d45203
JA
1895 def_thread.bs = atoi(parm);
1896 def_thread.bs <<= 10;
1897 if (!def_thread.bs) {
4240cfa1 1898 printf("bad block size\n");
47d45203 1899 def_thread.bs = DEF_BS;
4240cfa1 1900 }
892199bd
JA
1901 break;
1902 case 't':
1903 parm++;
47d45203 1904 def_thread.timeout = atoi(parm);
892199bd 1905 break;
892199bd
JA
1906 case 'r':
1907 parm++;
1908 repeatable = !!atoi(parm);
1909 break;
02bdd9ba
JA
1910 case 'R':
1911 parm++;
1912 rate_quit = !!atoi(parm);
1913 break;
892199bd
JA
1914 case 'o':
1915 parm++;
47d45203 1916 def_thread.odirect = !!atoi(parm);
892199bd 1917 break;
7dd1389e
JA
1918 case 'f':
1919 if (i + 1 >= argc) {
1920 printf("-f needs file as arg\n");
1921 break;
1922 }
1923 ini_file = strdup(argv[i+1]);
a642279f 1924 i++;
7dd1389e 1925 break;
a0a9b35b
JA
1926 case 'l':
1927 write_lat_log = 1;
1928 break;
1929 case 'w':
1930 write_bw_log = 1;
1931 break;
892199bd 1932 default:
7dd1389e 1933 printf("bad option %s\n", argv[i]);
892199bd
JA
1934 break;
1935 }
1936 }
1937
892199bd
JA
1938 return i;
1939}
1940
3f39453a 1941static void print_thread_status(struct thread_data *td, int nr_running,
8dbff0b1 1942 int t_rate, int m_rate)
3f39453a 1943{
3f39453a
JA
1944 printf("Threads now running: %d", nr_running);
1945 if (m_rate || t_rate)
1946 printf(", commitrate %d/%dKiB/sec", t_rate, m_rate);
8dbff0b1
JA
1947 printf(" : [%s]\r", run_str);
1948 fflush(stdout);
3f39453a
JA
1949}
1950
213b446c 1951static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
02bdd9ba 1952{
213b446c 1953 int i;
02bdd9ba 1954
3f39453a
JA
1955 /*
1956 * reap exited threads (TD_EXITED -> TD_REAPED)
1957 */
02bdd9ba
JA
1958 for (i = 0; i < thread_number; i++) {
1959 struct thread_data *td = &threads[i];
1960
213b446c
JA
1961 if (td->runstate != TD_EXITED)
1962 continue;
02bdd9ba 1963
213b446c 1964 td->runstate = TD_REAPED;
8dbff0b1 1965 run_str[td->thread_number - 1] = '_';
213b446c
JA
1966 waitpid(td->pid, NULL, 0);
1967 (*nr_running)--;
1968 (*m_rate) -= td->ratemin;
1969 (*t_rate) -= td->rate;
e6402082
JA
1970
1971 if (td->terminate)
1972 continue;
1973
8dbff0b1 1974 print_thread_status(td, *nr_running, *t_rate, *m_rate);
213b446c 1975 }
02bdd9ba
JA
1976}
1977
fc24389f
JA
1978static void run_threads(char *argv[])
1979{
be33abe4 1980 struct timeval genesis;
fc24389f
JA
1981 struct thread_data *td;
1982 unsigned long spent;
213b446c 1983 int i, todo, nr_running, m_rate, t_rate;
fc24389f 1984
fc24389f
JA
1985 printf("Starting %d threads\n", thread_number);
1986 fflush(stdout);
1987
7292613b
JA
1988 signal(SIGINT, sig_handler);
1989
fc24389f 1990 todo = thread_number;
02bdd9ba 1991 nr_running = 0;
213b446c 1992 m_rate = t_rate = 0;
fc24389f 1993
8bdcfab5
JA
1994 for (i = 0; i < thread_number; i++) {
1995 td = &threads[i];
1996
fc097bfe
JA
1997 if (!td->create_serialize)
1998 continue;
1999
8bdcfab5
JA
2000 /*
2001 * do file setup here so it happens sequentially,
2002 * we don't want X number of threads getting their
2003 * client data interspersed on disk
2004 */
2005 if (setup_file(td)) {
2006 td->runstate = TD_REAPED;
2007 todo--;
2008 }
2009 }
2010
2011 gettimeofday(&genesis, NULL);
2012
213b446c 2013 while (todo) {
3f39453a
JA
2014 /*
2015 * create threads (TD_NOT_CREATED -> TD_CREATED)
2016 */
fc24389f
JA
2017 for (i = 0; i < thread_number; i++) {
2018 td = &threads[i];
2019
02bdd9ba 2020 if (td->runstate != TD_NOT_CREATED)
fc24389f
JA
2021 continue;
2022
213b446c
JA
2023 /*
2024 * never got a chance to start, killed by other
2025 * thread for some reason
2026 */
2027 if (td->terminate) {
2028 todo--;
2029 continue;
2030 }
2031
fc24389f 2032 if (td->start_delay) {
be33abe4 2033 spent = mtime_since_now(&genesis);
fc24389f
JA
2034
2035 if (td->start_delay * 1000 > spent)
2036 continue;
2037 }
2038
02bdd9ba 2039 td->runstate = TD_CREATED;
8dbff0b1 2040 run_str[td->thread_number - 1] = 'C';
fc24389f
JA
2041 sem_init(&startup_sem, 1, 1);
2042 todo--;
2043
2044 if (fork())
2045 sem_wait(&startup_sem);
2046 else {
2047 thread_main(shm_id, i, argv);
2048 exit(0);
2049 }
2050 }
2051
3f39453a 2052 /*
e8457004 2053 * start created threads (TD_CREATED -> TD_RUNNING)
3f39453a 2054 */
fc24389f
JA
2055 for (i = 0; i < thread_number; i++) {
2056 struct thread_data *td = &threads[i];
2057
3f39453a
JA
2058 if (td->runstate != TD_CREATED)
2059 continue;
2060
e8457004 2061 td->runstate = TD_RUNNING;
8dbff0b1 2062 run_str[td->thread_number - 1] = '+';
3f39453a
JA
2063 nr_running++;
2064 m_rate += td->ratemin;
2065 t_rate += td->rate;
2066 sem_post(&td->mutex);
2067
8dbff0b1 2068 print_thread_status(td, nr_running, t_rate, m_rate);
fc24389f
JA
2069 }
2070
e8457004
JA
2071 for (i = 0; i < thread_number; i++) {
2072 struct thread_data *td = &threads[i];
2073
2074 if (td->runstate == TD_RUNNING)
2075 run_str[td->thread_number - 1] = '+';
2076 else if (td->runstate == TD_VERIFYING)
2077 run_str[td->thread_number - 1] = 'V';
2078 else
2079 continue;
2080
2081 print_thread_status(td, nr_running, t_rate, m_rate);
2082 }
2083
213b446c 2084 reap_threads(&nr_running, &t_rate, &m_rate);
02bdd9ba 2085
fc24389f
JA
2086 if (todo)
2087 usleep(100000);
2088 }
02bdd9ba
JA
2089
2090 while (nr_running) {
213b446c 2091 reap_threads(&nr_running, &t_rate, &m_rate);
02bdd9ba
JA
2092 usleep(10000);
2093 }
fc24389f
JA
2094}
2095
8867c0a8 2096int setup_thread_area(void)
892199bd 2097{
8867c0a8
JA
2098 /*
2099 * 1024 is too much on some machines, scale max_jobs if
2100 * we get a failure that looks like too large a shm segment
2101 */
2102 do {
2103 int s = max_jobs * sizeof(struct thread_data);
18e0b78c 2104
8867c0a8
JA
2105 shm_id = shmget(0, s, IPC_CREAT | 0600);
2106 if (shm_id != -1)
2107 break;
2108 if (errno != EINVAL) {
2109 perror("shmget");
2110 break;
2111 }
2112
2113 max_jobs >>= 1;
d4fac444 2114 } while (max_jobs);
8867c0a8
JA
2115
2116 if (shm_id == -1)
892199bd 2117 return 1;
892199bd
JA
2118
2119 threads = shmat(shm_id, NULL, 0);
8867c0a8 2120 if (threads == (void *) -1) {
86184d14
JA
2121 perror("shmat");
2122 return 1;
2123 }
892199bd
JA
2124
2125 atexit(free_shm);
8867c0a8
JA
2126 return 0;
2127}
2128
2129int main(int argc, char *argv[])
2130{
8c033f93 2131 static unsigned long max_run[2], min_run[2];
57d753e3 2132 static unsigned long max_bw[2], min_bw[2];
22334044 2133 static unsigned long io_mb[2], agg[2];
8867c0a8
JA
2134 int i;
2135
2136 if (setup_thread_area())
2137 return 1;
892199bd 2138
47d45203 2139 if (sched_getaffinity(getpid(), sizeof(cpu_set_t), &def_thread.cpumask) == -1) {
4240cfa1
JA
2140 perror("sched_getaffinity");
2141 return 1;
2142 }
2143
47d45203
JA
2144 /*
2145 * fill globals
2146 */
2147 def_thread.ddir = DDIR_READ;
2148 def_thread.bs = DEF_BS;
7889f07b
JA
2149 def_thread.min_bs = -1;
2150 def_thread.max_bs = -1;
02983297 2151 def_thread.odirect = DEF_ODIRECT;
47d45203 2152 def_thread.ratecycle = DEF_RATE_CYCLE;
02983297 2153 def_thread.sequential = DEF_SEQUENTIAL;
47d45203 2154 def_thread.timeout = DEF_TIMEOUT;
02983297
JA
2155 def_thread.create_file = DEF_CREATE;
2156 def_thread.overwrite = DEF_OVERWRITE;
b95799ca 2157 def_thread.invalidate_cache = DEF_INVALIDATE;
99c6704f
JA
2158 def_thread.sync_io = DEF_SYNCIO;
2159 def_thread.mem_type = MEM_MALLOC;
1d035750 2160 def_thread.bw_avg_time = DEF_BWAVGTIME;
fc097bfe
JA
2161 def_thread.create_serialize = DEF_CREATE_SER;
2162 def_thread.create_fsync = DEF_CREATE_FSYNC;
b6794fbf 2163 def_thread.loops = DEF_LOOPS;
cfc702bd 2164 def_thread.verify = DEF_VERIFY;
47d45203 2165
892199bd 2166 i = parse_options(argc, argv);
7dd1389e 2167
5961d92c
JA
2168 if (!ini_file) {
2169 printf("Need job file\n");
2170 return 1;
2171 }
2172
2173 if (parse_jobs_ini(ini_file))
2174 return 1;
7dd1389e 2175
4240cfa1
JA
2176 if (!thread_number) {
2177 printf("Nothing to do\n");
2178 return 1;
2179 }
7dd1389e 2180
fc24389f 2181 run_threads(argv);
892199bd 2182
892199bd
JA
2183 min_bw[0] = min_run[0] = ~0UL;
2184 min_bw[1] = min_run[1] = ~0UL;
22334044
JA
2185 io_mb[0] = io_mb[1] = 0;
2186 agg[0] = agg[1] = 0;
892199bd
JA
2187 for (i = 0; i < thread_number; i++) {
2188 struct thread_data *td = &threads[i];
2189 unsigned long bw = 0;
2190
22334044
JA
2191 if (!td->error) {
2192 if (td->runtime < min_run[td->ddir])
2193 min_run[td->ddir] = td->runtime;
2194 if (td->runtime > max_run[td->ddir])
2195 max_run[td->ddir] = td->runtime;
892199bd 2196
892199bd 2197 if (td->runtime)
22334044
JA
2198 bw = td->io_kb * 1024 / td->runtime;
2199 if (bw < min_bw[td->ddir])
2200 min_bw[td->ddir] = bw;
2201 if (bw > max_bw[td->ddir])
2202 max_bw[td->ddir] = bw;
2203
2204 io_mb[td->ddir] += td->io_kb >> 10;
892199bd
JA
2205 }
2206
2207 show_thread_status(td);
2208 }
22334044
JA
2209
2210 if (max_run[0])
2211 agg[0] = io_mb[0] * 1024 * 1000 / max_run[0];
2212 if (max_run[1])
2213 agg[1] = io_mb[1] * 1024 * 1000 / max_run[1];
2214
57d753e3 2215 printf("\nRun status:\n");
892199bd 2216 if (max_run[DDIR_READ])
22334044 2217 printf(" READ: io=%luMiB, aggrb=%lu, minb=%lu, maxb=%lu, mint=%lumsec, maxt=%lumsec\n", io_mb[0], agg[0], min_bw[0], max_bw[0], min_run[0], max_run[0]);
892199bd 2218 if (max_run[DDIR_WRITE])
22334044 2219 printf(" WRITE: io=%luMiB, aggrb=%lu, minb=%lu, maxb=%lu, mint=%lumsec, maxt=%lumsec\n", io_mb[1], agg[1], min_bw[1], max_bw[1], min_run[1], max_run[1]);
fc24389f 2220
892199bd
JA
2221 return 0;
2222}