Add disk utilization to terse format output
[fio.git] / fio.c
CommitLineData
ebac4655
JA
1/*
2 * fio - the flexible io tester
3 *
4 * Copyright (C) 2005 Jens Axboe <axboe@suse.de>
aae22ca7 5 * Copyright (C) 2006 Jens Axboe <axboe@kernel.dk>
ebac4655 6 *
8e9fe637
JA
7 * The license below covers all files distributed with fio unless otherwise
8 * noted in the file itself.
9 *
ebac4655 10 * This program is free software; you can redistribute it and/or modify
8e9fe637
JA
11 * it under the terms of the GNU General Public License version 2 as
12 * published by the Free Software Foundation.
ebac4655
JA
13 *
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
18 *
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 *
23 */
ebac4655
JA
24#include <unistd.h>
25#include <fcntl.h>
26#include <string.h>
9b836561 27#include <limits.h>
ebac4655
JA
28#include <signal.h>
29#include <time.h>
dbe1125e 30#include <locale.h>
36167d82 31#include <assert.h>
a5b01f1b 32#include <time.h>
ebac4655
JA
33#include <sys/stat.h>
34#include <sys/wait.h>
35#include <sys/ipc.h>
36#include <sys/shm.h>
ebac4655
JA
37#include <sys/mman.h>
38
39#include "fio.h"
210f43b3 40#include "hash.h"
2e5cdb11 41#include "smalloc.h"
4f5af7b2 42#include "verify.h"
a917a8b3 43#include "trim.h"
7c9b1bce 44#include "diskutil.h"
a696fa2a 45#include "cgroup.h"
07b3232d 46#include "profile.h"
d54a144d 47#include "lib/rand.h"
91aea6ec 48#include "memalign.h"
009b1be4 49#include "server.h"
ebac4655 50
cfc99db7
JA
51unsigned long page_mask;
52unsigned long page_size;
d529ee19
JA
53
54#define PAGE_ALIGN(buf) \
29d610e1 55 (char *) (((unsigned long) (buf) + page_mask) & ~page_mask)
ebac4655
JA
56
57int groupid = 0;
58int thread_number = 0;
9cedf167
JA
59int nr_process = 0;
60int nr_thread = 0;
ebac4655 61int shm_id = 0;
53cdc686 62int temp_stall_ts;
d3eeeabc 63unsigned long done_secs = 0;
ebac4655 64
d09a64a0
JA
65/*
66 * Just expose an empty list, if the OS does not support disk util stats
67 */
68#ifndef FIO_HAVE_DISK_UTIL
69FLIST_HEAD(disk_list);
70#endif
71
cdd18ad8 72static struct fio_mutex *startup_mutex;
d2bbb8d9 73static struct fio_mutex *writeout_mutex;
6ce15a32 74static volatile int fio_abort;
437c9b71 75static int exit_value;
be4ecfdf 76static pthread_t gtod_thread;
7985701b 77static pthread_t disk_util_thread;
dae5341c 78static struct flist_head *cgroup_list;
6adb38a1 79static char *cgroup_mnt;
ebac4655 80
d3cc4ebf
JA
81unsigned long arch_flags = 0;
82
bb3884d8
JA
83struct io_log *agg_io_log[2];
84
75154845 85#define JOB_START_TIMEOUT (5 * 1000)
ebac4655 86
cca84643
JA
87static const char *fio_os_strings[os_nr] = {
88 "Invalid",
89 "Linux",
90 "AIX",
91 "FreeBSD",
92 "HP-UX",
93 "OSX",
94 "NetBSD",
95 "Solaris",
96 "Windows"
97};
98
99static const char *fio_arch_strings[arch_nr] = {
100 "Invalid",
101 "x86-64",
102 "x86",
103 "ppc",
104 "ia64",
105 "s390",
106 "alpha",
107 "sparc",
108 "sparc64",
109 "arm",
110 "sh",
111 "hppa",
112 "generic"
113};
114
115const char *fio_get_os_string(int nr)
116{
117 if (nr < os_nr)
118 return fio_os_strings[nr];
119
120 return NULL;
121}
122
123const char *fio_get_arch_string(int nr)
124{
125 if (nr < arch_nr)
126 return fio_arch_strings[nr];
127
128 return NULL;
129}
130
b29ee5b3 131void td_set_runstate(struct thread_data *td, int runstate)
6ce15a32 132{
d8fab1b6
JA
133 if (td->runstate == runstate)
134 return;
135
5921e80c
JA
136 dprint(FD_PROCESS, "pid=%d: runstate %d -> %d\n", (int) td->pid,
137 td->runstate, runstate);
6ce15a32
JA
138 td->runstate = runstate;
139}
140
cc0df00a 141void fio_terminate_threads(int group_id)
ebac4655 142{
34572e28 143 struct thread_data *td;
ebac4655
JA
144 int i;
145
6f88bcb0
JA
146 dprint(FD_PROCESS, "terminate group_id=%d\n", group_id);
147
34572e28 148 for_each_td(td, i) {
ebac4655 149 if (group_id == TERMINATE_ALL || groupid == td->groupid) {
6f88bcb0 150 dprint(FD_PROCESS, "setting terminate on %s/%d\n",
5921e80c 151 td->o.name, (int) td->pid);
ad830ed7
JA
152 td->terminate = 1;
153 td->o.start_delay = 0;
154
7a93ab19
JA
155 /*
156 * if the thread is running, just let it exit
157 */
6aa27816
MC
158 if (!td->pid)
159 continue;
160 else if (td->runstate < TD_RAMP)
03e20d68 161 kill(td->pid, SIGTERM);
f63f7f3b
JA
162 else {
163 struct ioengine_ops *ops = td->io_ops;
164
03e20d68
BC
165 if (ops && (ops->flags & FIO_SIGTERM))
166 kill(td->pid, SIGTERM);
f63f7f3b 167 }
ebac4655
JA
168 }
169 }
170}
171
697a606c
JA
172static void sig_int(int sig)
173{
174 if (threads) {
7b821684
JA
175 if (is_backend)
176 fio_server_got_signal(sig);
177 else {
178 log_info("\nfio: terminating on signal %d\n", sig);
179 fflush(stdout);
180 exit_value = 128;
181 }
182
cc0df00a 183 fio_terminate_threads(TERMINATE_ALL);
ebac4655
JA
184 }
185}
186
7985701b 187static void *disk_thread_main(void *data)
a5b01f1b 188{
7985701b
JA
189 fio_mutex_up(startup_mutex);
190
191 while (threads) {
192 usleep(DISK_UTIL_MSEC * 1000);
9a793c2f
JA
193 if (!threads)
194 break;
7985701b 195 update_io_ticks();
cf451d1e 196
af9c9fb3 197 if (!is_backend)
cf451d1e 198 print_thread_status();
7985701b
JA
199 }
200
201 return NULL;
a5b01f1b
JA
202}
203
7985701b 204static int create_disk_util_thread(void)
a5b01f1b 205{
7985701b 206 int ret;
a5b01f1b 207
69204d6e 208 ret = pthread_create(&disk_util_thread, NULL, disk_thread_main, NULL);
7985701b
JA
209 if (ret) {
210 log_err("Can't create disk util thread: %s\n", strerror(ret));
211 return 1;
212 }
a5b01f1b 213
7985701b
JA
214 ret = pthread_detach(disk_util_thread);
215 if (ret) {
216 log_err("Can't detatch disk util thread: %s\n", strerror(ret));
217 return 1;
218 }
03e20d68 219
7985701b
JA
220 dprint(FD_MUTEX, "wait on startup_mutex\n");
221 fio_mutex_down(startup_mutex);
222 dprint(FD_MUTEX, "done waiting on startup_mutex\n");
223 return 0;
a5b01f1b
JA
224}
225
697a606c
JA
226static void set_sig_handlers(void)
227{
228 struct sigaction act;
229
697a606c
JA
230 memset(&act, 0, sizeof(act));
231 act.sa_handler = sig_int;
232 act.sa_flags = SA_RESTART;
233 sigaction(SIGINT, &act, NULL);
de79c915 234
5f8f9726 235 memset(&act, 0, sizeof(act));
b20b6be4 236 act.sa_handler = sig_int;
5f8f9726 237 act.sa_flags = SA_RESTART;
03e20d68 238 sigaction(SIGTERM, &act, NULL);
cc0df00a
JA
239
240 if (is_backend) {
241 memset(&act, 0, sizeof(act));
242 act.sa_handler = sig_int;
243 act.sa_flags = SA_RESTART;
244 sigaction(SIGPIPE, &act, NULL);
245 }
697a606c
JA
246}
247
906c8d75
JA
248/*
249 * Check if we are above the minimum rate given.
250 */
581e7141 251static int __check_min_rate(struct thread_data *td, struct timeval *now,
bd93e34b 252 enum fio_ddir ddir)
ebac4655 253{
0904200b 254 unsigned long long bytes = 0;
4e991c23 255 unsigned long iops = 0;
ebac4655
JA
256 unsigned long spent;
257 unsigned long rate;
581e7141
JA
258 unsigned int ratemin = 0;
259 unsigned int rate_iops = 0;
260 unsigned int rate_iops_min = 0;
ebac4655 261
ff58fced
JA
262 assert(ddir_rw(ddir));
263
d982d873
JA
264 if (!td->o.ratemin[ddir] && !td->o.rate_iops_min[ddir])
265 return 0;
266
ebac4655
JA
267 /*
268 * allow a 2 second settle period in the beginning
269 */
270 if (mtime_since(&td->start, now) < 2000)
271 return 0;
272
c8eeb9df 273 iops += td->this_io_blocks[ddir];
581e7141
JA
274 bytes += td->this_io_bytes[ddir];
275 ratemin += td->o.ratemin[ddir];
276 rate_iops += td->o.rate_iops[ddir];
277 rate_iops_min += td->o.rate_iops_min[ddir];
0904200b 278
ebac4655
JA
279 /*
280 * if rate blocks is set, sample is running
281 */
581e7141
JA
282 if (td->rate_bytes[ddir] || td->rate_blocks[ddir]) {
283 spent = mtime_since(&td->lastrate[ddir], now);
2dc1bbeb 284 if (spent < td->o.ratecycle)
ebac4655
JA
285 return 0;
286
581e7141 287 if (td->o.rate[ddir]) {
4e991c23
JA
288 /*
289 * check bandwidth specified rate
290 */
581e7141 291 if (bytes < td->rate_bytes[ddir]) {
5ec10eaa 292 log_err("%s: min rate %u not met\n", td->o.name,
581e7141 293 ratemin);
4e991c23
JA
294 return 1;
295 } else {
581e7141
JA
296 rate = ((bytes - td->rate_bytes[ddir]) * 1000) / spent;
297 if (rate < ratemin ||
298 bytes < td->rate_bytes[ddir]) {
5ec10eaa 299 log_err("%s: min rate %u not met, got"
b22989b9 300 " %luKB/sec\n", td->o.name,
581e7141 301 ratemin, rate);
4e991c23
JA
302 return 1;
303 }
304 }
413dd459 305 } else {
4e991c23
JA
306 /*
307 * checks iops specified rate
308 */
581e7141 309 if (iops < rate_iops) {
5ec10eaa 310 log_err("%s: min iops rate %u not met\n",
581e7141 311 td->o.name, rate_iops);
413dd459 312 return 1;
4e991c23 313 } else {
581e7141
JA
314 rate = ((iops - td->rate_blocks[ddir]) * 1000) / spent;
315 if (rate < rate_iops_min ||
316 iops < td->rate_blocks[ddir]) {
5ec10eaa
JA
317 log_err("%s: min iops rate %u not met,"
318 " got %lu\n", td->o.name,
581e7141 319 rate_iops_min, rate);
4e991c23 320 }
413dd459 321 }
ebac4655
JA
322 }
323 }
324
581e7141
JA
325 td->rate_bytes[ddir] = bytes;
326 td->rate_blocks[ddir] = iops;
327 memcpy(&td->lastrate[ddir], now, sizeof(*now));
ebac4655
JA
328 return 0;
329}
330
581e7141
JA
331static int check_min_rate(struct thread_data *td, struct timeval *now,
332 unsigned long *bytes_done)
333{
334 int ret = 0;
335
336 if (bytes_done[0])
337 ret |= __check_min_rate(td, now, 0);
338 if (bytes_done[1])
339 ret |= __check_min_rate(td, now, 1);
340
341 return ret;
342}
343
ebac4655
JA
344static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
345{
2dc1bbeb 346 if (!td->o.timeout)
ebac4655 347 return 0;
2dc1bbeb 348 if (mtime_since(&td->epoch, t) >= td->o.timeout * 1000)
ebac4655
JA
349 return 1;
350
351 return 0;
352}
353
906c8d75
JA
354/*
355 * When job exits, we can cancel the in-flight IO if we are using async
356 * io. Attempt to do so.
357 */
ebac4655
JA
358static void cleanup_pending_aio(struct thread_data *td)
359{
01743ee1 360 struct flist_head *entry, *n;
ebac4655
JA
361 struct io_u *io_u;
362 int r;
363
364 /*
365 * get immediately available events, if any
366 */
581e7141 367 r = io_u_queued_complete(td, 0, NULL);
b2fdda43
JA
368 if (r < 0)
369 return;
ebac4655
JA
370
371 /*
372 * now cancel remaining active events
373 */
2866c82d 374 if (td->io_ops->cancel) {
01743ee1
JA
375 flist_for_each_safe(entry, n, &td->io_u_busylist) {
376 io_u = flist_entry(entry, struct io_u, list);
ebac4655 377
0c6e7517
JA
378 /*
379 * if the io_u isn't in flight, then that generally
380 * means someone leaked an io_u. complain but fix
381 * it up, so we don't stall here.
382 */
383 if ((io_u->flags & IO_U_F_FLIGHT) == 0) {
384 log_err("fio: non-busy IO on busy list\n");
ebac4655 385 put_io_u(td, io_u);
0c6e7517
JA
386 } else {
387 r = td->io_ops->cancel(td, io_u);
388 if (!r)
389 put_io_u(td, io_u);
390 }
ebac4655
JA
391 }
392 }
393
97601024 394 if (td->cur_depth)
581e7141 395 r = io_u_queued_complete(td, td->cur_depth, NULL);
ebac4655
JA
396}
397
858a3d47
JA
398/*
399 * Helper to handle the final sync of a file. Works just like the normal
400 * io path, just does everything sync.
401 */
402static int fio_io_sync(struct thread_data *td, struct fio_file *f)
403{
404 struct io_u *io_u = __get_io_u(td);
858a3d47
JA
405 int ret;
406
407 if (!io_u)
408 return 1;
409
410 io_u->ddir = DDIR_SYNC;
411 io_u->file = f;
412
413 if (td_io_prep(td, io_u)) {
414 put_io_u(td, io_u);
415 return 1;
416 }
417
755200a3 418requeue:
858a3d47 419 ret = td_io_queue(td, io_u);
36167d82 420 if (ret < 0) {
e1161c32 421 td_verror(td, io_u->error, "td_io_queue");
858a3d47 422 put_io_u(td, io_u);
858a3d47 423 return 1;
36167d82 424 } else if (ret == FIO_Q_QUEUED) {
581e7141 425 if (io_u_queued_complete(td, 1, NULL) < 0)
36167d82 426 return 1;
36167d82
JA
427 } else if (ret == FIO_Q_COMPLETED) {
428 if (io_u->error) {
e1161c32 429 td_verror(td, io_u->error, "td_io_queue");
36167d82
JA
430 return 1;
431 }
858a3d47 432
581e7141 433 if (io_u_sync_complete(td, io_u, NULL) < 0)
b2fdda43 434 return 1;
755200a3
JA
435 } else if (ret == FIO_Q_BUSY) {
436 if (td_io_commit(td))
437 return 1;
438 goto requeue;
858a3d47
JA
439 }
440
441 return 0;
442}
443
687c6a23
JA
444static inline void __update_tv_cache(struct thread_data *td)
445{
446 fio_gettime(&td->tv_cache, NULL);
447}
448
993bf48b
JA
449static inline void update_tv_cache(struct thread_data *td)
450{
451 if ((++td->tv_cache_nr & td->tv_cache_mask) == td->tv_cache_mask)
687c6a23 452 __update_tv_cache(td);
993bf48b
JA
453}
454
f2bba182
RR
455static int break_on_this_error(struct thread_data *td, int *retptr)
456{
457 int ret = *retptr;
458
459 if (ret < 0 || td->error) {
460 int err;
461
1ec99eea
JA
462 if (!td->o.continue_on_error)
463 return 1;
f2bba182
RR
464
465 if (ret < 0)
466 err = -ret;
467 else
468 err = td->error;
469
f2bba182
RR
470 if (td_non_fatal_error(err)) {
471 /*
472 * Continue with the I/Os in case of
473 * a non fatal error.
474 */
8a4f8a24 475 update_error_count(td, err);
f2bba182
RR
476 td_clear_error(td);
477 *retptr = 0;
478 return 0;
8a4f8a24
RR
479 } else if (td->o.fill_device && err == ENOSPC) {
480 /*
481 * We expect to hit this error if
482 * fill_device option is set.
483 */
484 td_clear_error(td);
485 td->terminate = 1;
486 return 1;
f2bba182
RR
487 } else {
488 /*
489 * Stop the I/O in case of a fatal
490 * error.
491 */
8a4f8a24 492 update_error_count(td, err);
f2bba182
RR
493 return 1;
494 }
495 }
496
497 return 0;
498}
499
906c8d75 500/*
34403fb1 501 * The main verify engine. Runs over the writes we previously submitted,
906c8d75
JA
502 * reads the blocks back in, and checks the crc/md5 of the data.
503 */
1e97cce9 504static void do_verify(struct thread_data *td)
ebac4655 505{
53cdc686 506 struct fio_file *f;
36167d82 507 struct io_u *io_u;
af52b345
JA
508 int ret, min_events;
509 unsigned int i;
e5b401d4 510
008618a8
JA
511 dprint(FD_VERIFY, "starting loop\n");
512
e5b401d4
JA
513 /*
514 * sync io first and invalidate cache, to make sure we really
515 * read from disk.
516 */
517 for_each_file(td, f, i) {
d6aed795 518 if (!fio_file_open(f))
3d7b485f 519 continue;
b2fdda43
JA
520 if (fio_io_sync(td, f))
521 break;
522 if (file_invalidate_cache(td, f))
523 break;
e5b401d4 524 }
ebac4655 525
b2fdda43
JA
526 if (td->error)
527 return;
528
ebac4655
JA
529 td_set_runstate(td, TD_VERIFYING);
530
36167d82
JA
531 io_u = NULL;
532 while (!td->terminate) {
4950421a 533 int ret2, full;
5451792e 534
993bf48b
JA
535 update_tv_cache(td);
536
537 if (runtime_exceeded(td, &td->tv_cache)) {
687c6a23
JA
538 __update_tv_cache(td);
539 if (runtime_exceeded(td, &td->tv_cache)) {
540 td->terminate = 1;
541 break;
542 }
069c2918 543 }
02bcaa8c 544
dcb4830d
RR
545 io_u = __get_io_u(td);
546 if (!io_u)
547 break;
548
069c2918
JA
549 if (get_next_verify(td, io_u)) {
550 put_io_u(td, io_u);
ebac4655 551 break;
069c2918 552 }
ebac4655 553
069c2918
JA
554 if (td_io_prep(td, io_u)) {
555 put_io_u(td, io_u);
53cdc686 556 break;
069c2918 557 }
d7762cf8 558
e8462bd8
JA
559 if (td->o.verify_async)
560 io_u->end_io = verify_io_u_async;
561 else
562 io_u->end_io = verify_io_u;
53cdc686 563
11786802 564 ret = td_io_queue(td, io_u);
36167d82
JA
565 switch (ret) {
566 case FIO_Q_COMPLETED:
f2bba182 567 if (io_u->error) {
22819ec2 568 ret = -io_u->error;
f2bba182
RR
569 clear_io_u(td, io_u);
570 } else if (io_u->resid) {
36167d82 571 int bytes = io_u->xfer_buflen - io_u->resid;
ebac4655 572
9e9d164e
JA
573 /*
574 * zero read, fail
575 */
576 if (!bytes) {
41d9f0fd 577 td_verror(td, EIO, "full resid");
9e9d164e
JA
578 put_io_u(td, io_u);
579 break;
580 }
8400d9b2 581
36167d82
JA
582 io_u->xfer_buflen = io_u->resid;
583 io_u->xfer_buf += bytes;
8400d9b2
JA
584 io_u->offset += bytes;
585
ff58fced
JA
586 if (ddir_rw(io_u->ddir))
587 td->ts.short_io_u[io_u->ddir]++;
30061b97 588
2b13e716 589 f = io_u->file;
d460eb31 590 if (io_u->offset == f->real_file_size)
8400d9b2
JA
591 goto sync_done;
592
11786802
JA
593 requeue_io_u(td, &io_u);
594 } else {
8400d9b2 595sync_done:
581e7141 596 ret = io_u_sync_complete(td, io_u, NULL);
11786802
JA
597 if (ret < 0)
598 break;
36167d82 599 }
36167d82
JA
600 continue;
601 case FIO_Q_QUEUED:
602 break;
755200a3
JA
603 case FIO_Q_BUSY:
604 requeue_io_u(td, &io_u);
5451792e
JA
605 ret2 = td_io_commit(td);
606 if (ret2 < 0)
607 ret = ret2;
755200a3 608 break;
36167d82
JA
609 default:
610 assert(ret < 0);
e1161c32 611 td_verror(td, -ret, "td_io_queue");
ebac4655
JA
612 break;
613 }
614
f2bba182 615 if (break_on_this_error(td, &ret))
3af6ef39
JA
616 break;
617
ebac4655 618 /*
3af6ef39 619 * if we can queue more, do so. but check if there are
ccc02050
JA
620 * completed io_u's first. Note that we can get BUSY even
621 * without IO queued, if the system is resource starved.
ebac4655 622 */
ccc02050 623 full = queue_full(td) || (ret == FIO_Q_BUSY && td->cur_depth);
4950421a 624 if (full || !td->o.iodepth_batch_complete) {
6a96276c
RR
625 min_events = min(td->o.iodepth_batch_complete,
626 td->cur_depth);
1f84f1d9 627 if (full && !min_events && td->o.iodepth_batch_complete != 0)
838bc709 628 min_events = 1;
e916b390 629
4950421a
JA
630 do {
631 /*
632 * Reap required number of io units, if any,
633 * and do the verification on them through
634 * the callback handler
635 */
581e7141 636 if (io_u_queued_complete(td, min_events, NULL) < 0) {
4950421a
JA
637 ret = -1;
638 break;
639 }
640 } while (full && (td->cur_depth > td->o.iodepth_low));
641 }
642 if (ret < 0)
ebac4655 643 break;
36167d82 644 }
ebac4655 645
c01c0395
JA
646 if (!td->error) {
647 min_events = td->cur_depth;
648
649 if (min_events)
581e7141 650 ret = io_u_queued_complete(td, min_events, NULL);
c01c0395 651 } else
ebac4655
JA
652 cleanup_pending_aio(td);
653
654 td_set_runstate(td, TD_RUNNING);
008618a8
JA
655
656 dprint(FD_VERIFY, "exiting loop\n");
ebac4655
JA
657}
658
32cd46a0 659/*
906c8d75 660 * Main IO worker function. It retrieves io_u's to process and queues
32cd46a0
JA
661 * and reaps them, checking for rate and errors along the way.
662 */
ebac4655
JA
663static void do_io(struct thread_data *td)
664{
af52b345
JA
665 unsigned int i;
666 int ret = 0;
ebac4655 667
b29ee5b3
JA
668 if (in_ramp_time(td))
669 td_set_runstate(td, TD_RAMP);
670 else
671 td_set_runstate(td, TD_RUNNING);
5853e5a8 672
457bf399 673 while ( (td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
a917a8b3 674 (!flist_empty(&td->trim_list)) ||
457bf399 675 ((td->this_io_bytes[0] + td->this_io_bytes[1]) < td->o.size) ) {
97601024 676 struct timeval comp_time;
581e7141 677 unsigned long bytes_done[2] = { 0, 0 };
84585003 678 int min_evts = 0;
ebac4655 679 struct io_u *io_u;
4950421a 680 int ret2, full;
ebac4655
JA
681
682 if (td->terminate)
683 break;
684
993bf48b 685 update_tv_cache(td);
97601024 686
993bf48b 687 if (runtime_exceeded(td, &td->tv_cache)) {
687c6a23
JA
688 __update_tv_cache(td);
689 if (runtime_exceeded(td, &td->tv_cache)) {
690 td->terminate = 1;
691 break;
692 }
97601024 693 }
36167d82 694
dcb4830d
RR
695 io_u = get_io_u(td);
696 if (!io_u)
697 break;
698
b67740d3
JA
699 /*
700 * Add verification end_io handler, if asked to verify
701 * a previously written file.
702 */
715d2b3e
JA
703 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_READ &&
704 !td_rw(td)) {
e8462bd8
JA
705 if (td->o.verify_async)
706 io_u->end_io = verify_io_u_async;
707 else
708 io_u->end_io = verify_io_u;
d8fab1b6 709 td_set_runstate(td, TD_VERIFYING);
b29ee5b3
JA
710 } else if (in_ramp_time(td))
711 td_set_runstate(td, TD_RAMP);
712 else
d8fab1b6 713 td_set_runstate(td, TD_RUNNING);
b67740d3 714
11786802 715 ret = td_io_queue(td, io_u);
36167d82
JA
716 switch (ret) {
717 case FIO_Q_COMPLETED:
f2bba182 718 if (io_u->error) {
5451792e 719 ret = -io_u->error;
f2bba182
RR
720 clear_io_u(td, io_u);
721 } else if (io_u->resid) {
36167d82 722 int bytes = io_u->xfer_buflen - io_u->resid;
d460eb31 723 struct fio_file *f = io_u->file;
36167d82 724
9e9d164e
JA
725 /*
726 * zero read, fail
727 */
728 if (!bytes) {
41d9f0fd 729 td_verror(td, EIO, "full resid");
9e9d164e
JA
730 put_io_u(td, io_u);
731 break;
732 }
733
cec6b55d 734 io_u->xfer_buflen = io_u->resid;
36167d82 735 io_u->xfer_buf += bytes;
5a7c5680
JA
736 io_u->offset += bytes;
737
ff58fced
JA
738 if (ddir_rw(io_u->ddir))
739 td->ts.short_io_u[io_u->ddir]++;
30061b97 740
d460eb31 741 if (io_u->offset == f->real_file_size)
5a7c5680
JA
742 goto sync_done;
743
11786802
JA
744 requeue_io_u(td, &io_u);
745 } else {
5a7c5680 746sync_done:
581e7141
JA
747 if (__should_check_rate(td, 0) ||
748 __should_check_rate(td, 1))
993bf48b
JA
749 fio_gettime(&comp_time, NULL);
750
581e7141
JA
751 ret = io_u_sync_complete(td, io_u, bytes_done);
752 if (ret < 0)
753 break;
cec6b55d 754 }
36167d82
JA
755 break;
756 case FIO_Q_QUEUED:
7e77dd02
JA
757 /*
758 * if the engine doesn't have a commit hook,
759 * the io_u is really queued. if it does have such
760 * a hook, it has to call io_u_queued() itself.
761 */
762 if (td->io_ops->commit == NULL)
763 io_u_queued(td, io_u);
36167d82 764 break;
755200a3
JA
765 case FIO_Q_BUSY:
766 requeue_io_u(td, &io_u);
5451792e
JA
767 ret2 = td_io_commit(td);
768 if (ret2 < 0)
769 ret = ret2;
755200a3 770 break;
36167d82
JA
771 default:
772 assert(ret < 0);
773 put_io_u(td, io_u);
774 break;
ebac4655
JA
775 }
776
f2bba182 777 if (break_on_this_error(td, &ret))
36167d82
JA
778 break;
779
97601024 780 /*
ccc02050
JA
781 * See if we need to complete some commands. Note that we
782 * can get BUSY even without IO queued, if the system is
783 * resource starved.
97601024 784 */
ccc02050 785 full = queue_full(td) || (ret == FIO_Q_BUSY && td->cur_depth);
4950421a 786 if (full || !td->o.iodepth_batch_complete) {
6a96276c
RR
787 min_evts = min(td->o.iodepth_batch_complete,
788 td->cur_depth);
1f84f1d9 789 if (full && !min_evts && td->o.iodepth_batch_complete != 0)
36167d82 790 min_evts = 1;
4950421a 791
581e7141
JA
792 if (__should_check_rate(td, 0) ||
793 __should_check_rate(td, 1))
993bf48b 794 fio_gettime(&comp_time, NULL);
4950421a
JA
795
796 do {
581e7141
JA
797 ret = io_u_queued_complete(td, min_evts, bytes_done);
798 if (ret < 0)
4950421a
JA
799 break;
800
4950421a 801 } while (full && (td->cur_depth > td->o.iodepth_low));
ebac4655
JA
802 }
803
4950421a
JA
804 if (ret < 0)
805 break;
581e7141 806 if (!(bytes_done[0] + bytes_done[1]))
97601024
JA
807 continue;
808
581e7141
JA
809 if (!in_ramp_time(td) && should_check_rate(td, bytes_done)) {
810 if (check_min_rate(td, &comp_time, bytes_done)) {
721938ae 811 if (exitall_on_terminate)
cc0df00a 812 fio_terminate_threads(td->groupid);
721938ae
JA
813 td_verror(td, EIO, "check_min_rate");
814 break;
815 }
ebac4655
JA
816 }
817
2dc1bbeb 818 if (td->o.thinktime) {
9c1f7434
JA
819 unsigned long long b;
820
821 b = td->io_blocks[0] + td->io_blocks[1];
2dc1bbeb 822 if (!(b % td->o.thinktime_blocks)) {
48097d5c
JA
823 int left;
824
2dc1bbeb 825 if (td->o.thinktime_spin)
6dd6f2cd 826 usec_spin(td->o.thinktime_spin);
48097d5c 827
2dc1bbeb 828 left = td->o.thinktime - td->o.thinktime_spin;
48097d5c
JA
829 if (left)
830 usec_sleep(td, left);
831 }
9c1f7434 832 }
ebac4655
JA
833 }
834
d708ac5e
JA
835 if (td->trim_entries)
836 printf("trim entries %ld\n", td->trim_entries);
a917a8b3 837
aa31f1f1
SL
838 if (td->o.fill_device && td->error == ENOSPC) {
839 td->error = 0;
840 td->terminate = 1;
841 }
4d2413c6 842 if (!td->error) {
3d7c391d
JA
843 struct fio_file *f;
844
c01c0395 845 i = td->cur_depth;
d06093e7 846 if (i) {
581e7141 847 ret = io_u_queued_complete(td, i, NULL);
d06093e7
SL
848 if (td->o.fill_device && td->error == ENOSPC)
849 td->error = 0;
850 }
ebac4655 851
2dc1bbeb 852 if (should_fsync(td) && td->o.end_fsync) {
84585003 853 td_set_runstate(td, TD_FSYNCING);
3d7b485f
JA
854
855 for_each_file(td, f, i) {
d6aed795 856 if (!fio_file_open(f))
3d7b485f 857 continue;
858a3d47 858 fio_io_sync(td, f);
3d7b485f 859 }
84585003 860 }
c01c0395
JA
861 } else
862 cleanup_pending_aio(td);
2ba1c290
JA
863
864 /*
865 * stop job if we failed doing any IO
866 */
867 if ((td->this_io_bytes[0] + td->this_io_bytes[1]) == 0)
868 td->done = 1;
ebac4655
JA
869}
870
ebac4655
JA
871static void cleanup_io_u(struct thread_data *td)
872{
01743ee1 873 struct flist_head *entry, *n;
ebac4655
JA
874 struct io_u *io_u;
875
01743ee1
JA
876 flist_for_each_safe(entry, n, &td->io_u_freelist) {
877 io_u = flist_entry(entry, struct io_u, list);
ebac4655 878
01743ee1 879 flist_del(&io_u->list);
91aea6ec 880 fio_memfree(io_u, sizeof(*io_u));
ebac4655
JA
881 }
882
2f9ade3c 883 free_io_mem(td);
ebac4655
JA
884}
885
886static int init_io_u(struct thread_data *td)
887{
888 struct io_u *io_u;
a00735e6 889 unsigned int max_bs;
eb7ccf38 890 int cl_align, i, max_units;
ebac4655
JA
891 char *p;
892
1e3c09af 893 max_units = td->o.iodepth;
2dc1bbeb 894 max_bs = max(td->o.max_bs[DDIR_READ], td->o.max_bs[DDIR_WRITE]);
5ec10eaa
JA
895 td->orig_buffer_size = (unsigned long long) max_bs
896 * (unsigned long long) max_units;
897
898 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE) {
899 unsigned long bs;
74b025b0 900
5ec10eaa
JA
901 bs = td->orig_buffer_size + td->o.hugepage_size - 1;
902 td->orig_buffer_size = bs & ~(td->o.hugepage_size - 1);
903 }
ebac4655 904
c3990645
JA
905 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
906 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
907 return 1;
908 }
909
2f9ade3c
JA
910 if (allocate_io_mem(td))
911 return 1;
ebac4655 912
1c04bf78
JA
913 if (td->o.odirect || td->o.mem_align ||
914 (td->io_ops->flags & FIO_RAWIO))
d529ee19 915 p = PAGE_ALIGN(td->orig_buffer) + td->o.mem_align;
b3f378e9
JA
916 else
917 p = td->orig_buffer;
918
eb7ccf38
JA
919 cl_align = os_cache_line_size();
920
ebac4655 921 for (i = 0; i < max_units; i++) {
eb7ccf38
JA
922 void *ptr;
923
db1cd90b
JA
924 if (td->terminate)
925 return 1;
eb7ccf38 926
91aea6ec
JA
927 ptr = fio_memalign(cl_align, sizeof(*io_u));
928 if (!ptr) {
929 log_err("fio: unable to allocate aligned memory\n");
eb7ccf38
JA
930 break;
931 }
932
933 io_u = ptr;
ebac4655 934 memset(io_u, 0, sizeof(*io_u));
01743ee1 935 INIT_FLIST_HEAD(&io_u->list);
d529ee19 936 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
ebac4655 937
b4c5e1ac
JA
938 if (!(td->io_ops->flags & FIO_NOIO)) {
939 io_u->buf = p + max_bs * i;
d529ee19 940 dprint(FD_MEM, "io_u %p, mem %p\n", io_u, io_u->buf);
e9459e5a 941
3545a109 942 if (td_write(td))
5973cafb 943 io_u_fill_buffer(td, io_u, max_bs);
3545a109 944 if (td_write(td) && td->o.verify_pattern_bytes) {
cbe8d756
RR
945 /*
946 * Fill the buffer with the pattern if we are
947 * going to be doing writes.
948 */
7d9fb455 949 fill_pattern(td, io_u->buf, max_bs, io_u, 0, 0);
cbe8d756 950 }
b4c5e1ac 951 }
6b9cea23 952
b1ff3403 953 io_u->index = i;
0c6e7517 954 io_u->flags = IO_U_F_FREE;
01743ee1 955 flist_add(&io_u->list, &td->io_u_freelist);
ebac4655
JA
956 }
957
958 return 0;
959}
960
da86774e
JA
961static int switch_ioscheduler(struct thread_data *td)
962{
963 char tmp[256], tmp2[128];
964 FILE *f;
965 int ret;
966
ba0fbe10 967 if (td->io_ops->flags & FIO_DISKLESSIO)
f48b467c
JA
968 return 0;
969
da86774e
JA
970 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
971
972 f = fopen(tmp, "r+");
973 if (!f) {
cbf5c1d7 974 if (errno == ENOENT) {
5ec10eaa
JA
975 log_err("fio: os or kernel doesn't support IO scheduler"
976 " switching\n");
cbf5c1d7
JA
977 return 0;
978 }
979 td_verror(td, errno, "fopen iosched");
da86774e
JA
980 return 1;
981 }
982
983 /*
984 * Set io scheduler.
985 */
2dc1bbeb 986 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
da86774e 987 if (ferror(f) || ret != 1) {
e1161c32 988 td_verror(td, errno, "fwrite");
da86774e
JA
989 fclose(f);
990 return 1;
991 }
992
993 rewind(f);
994
995 /*
996 * Read back and check that the selected scheduler is now the default.
997 */
998 ret = fread(tmp, 1, sizeof(tmp), f);
999 if (ferror(f) || ret < 0) {
e1161c32 1000 td_verror(td, errno, "fread");
da86774e
JA
1001 fclose(f);
1002 return 1;
1003 }
1004
2dc1bbeb 1005 sprintf(tmp2, "[%s]", td->o.ioscheduler);
da86774e 1006 if (!strstr(tmp, tmp2)) {
2dc1bbeb 1007 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
e1161c32 1008 td_verror(td, EINVAL, "iosched_switch");
da86774e
JA
1009 fclose(f);
1010 return 1;
1011 }
1012
1013 fclose(f);
1014 return 0;
1015}
1016
492158cf
JA
1017static int keep_running(struct thread_data *td)
1018{
1019 unsigned long long io_done;
1020
20e354ef
JA
1021 if (td->done)
1022 return 0;
492158cf
JA
1023 if (td->o.time_based)
1024 return 1;
1025 if (td->o.loops) {
1026 td->o.loops--;
1027 return 1;
1028 }
1029
5ec10eaa
JA
1030 io_done = td->io_bytes[DDIR_READ] + td->io_bytes[DDIR_WRITE]
1031 + td->io_skip_bytes;
492158cf
JA
1032 if (io_done < td->o.size)
1033 return 1;
1034
1035 return 0;
1036}
1037
b29ee5b3 1038static void reset_io_counters(struct thread_data *td)
ebac4655 1039{
f0505a14 1040 td->stat_io_bytes[0] = td->stat_io_bytes[1] = 0;
ebac4655 1041 td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
c8eeb9df
JA
1042 td->stat_io_blocks[0] = td->stat_io_blocks[1] = 0;
1043 td->this_io_blocks[0] = td->this_io_blocks[1] = 0;
20dc95c4 1044 td->zone_bytes = 0;
581e7141
JA
1045 td->rate_bytes[0] = td->rate_bytes[1] = 0;
1046 td->rate_blocks[0] = td->rate_blocks[1] = 0;
ebac4655 1047
c1324df1
JA
1048 td->last_was_sync = 0;
1049
2ba1c290
JA
1050 /*
1051 * reset file done count if we are to start over
1052 */
1053 if (td->o.time_based || td->o.loops)
48f5abd3 1054 td->nr_done_files = 0;
b29ee5b3
JA
1055}
1056
1057void reset_all_stats(struct thread_data *td)
1058{
1059 struct timeval tv;
1060 int i;
1061
1062 reset_io_counters(td);
1063
1064 for (i = 0; i < 2; i++) {
1065 td->io_bytes[i] = 0;
1066 td->io_blocks[i] = 0;
1067 td->io_issues[i] = 0;
1068 td->ts.total_io_u[i] = 0;
1069 }
9b836561 1070
b29ee5b3 1071 fio_gettime(&tv, NULL);
cda99fa0
SSP
1072 td->ts.runtime[0] = 0;
1073 td->ts.runtime[1] = 0;
b29ee5b3
JA
1074 memcpy(&td->epoch, &tv, sizeof(tv));
1075 memcpy(&td->start, &tv, sizeof(tv));
1076}
1077
df9c26b1 1078static void clear_io_state(struct thread_data *td)
b29ee5b3
JA
1079{
1080 struct fio_file *f;
1081 unsigned int i;
b29ee5b3
JA
1082
1083 reset_io_counters(td);
281f9b63 1084
24ffd2c2 1085 close_files(td);
df9c26b1 1086 for_each_file(td, f, i)
d6aed795 1087 fio_file_clear_done(f);
f0153948
JA
1088
1089 /*
1090 * Set the same seed to get repeatable runs
1091 */
1092 td_fill_rand_seeds(td);
ebac4655
JA
1093}
1094
398e8c4d
JA
1095static int exec_string(const char *string)
1096{
1097 int ret, newlen = strlen(string) + 1 + 8;
1098 char *str;
1099
1100 str = malloc(newlen);
1101 sprintf(str, "sh -c %s", string);
1102
1103 ret = system(str);
1104 if (ret == -1)
1105 log_err("fio: exec of cmd <%s> failed\n", str);
1106
1107 free(str);
1108 return ret;
1109}
1110
906c8d75
JA
1111/*
1112 * Entry point for the thread based jobs. The process based jobs end up
1113 * here as well, after a little setup.
1114 */
ebac4655
JA
1115static void *thread_main(void *data)
1116{
cda99fa0 1117 unsigned long long elapsed;
ebac4655 1118 struct thread_data *td = data;
e8462bd8 1119 pthread_condattr_t attr;
a978ba68 1120 int clear_state;
ebac4655 1121
47f767c1 1122 if (!td->o.use_thread) {
ebac4655 1123 setsid();
47f767c1
JA
1124 td->pid = getpid();
1125 } else
1126 td->pid = gettid();
ebac4655 1127
5921e80c 1128 dprint(FD_PROCESS, "jobs pid=%d started\n", (int) td->pid);
ee56ad50 1129
01743ee1
JA
1130 INIT_FLIST_HEAD(&td->io_u_freelist);
1131 INIT_FLIST_HEAD(&td->io_u_busylist);
1132 INIT_FLIST_HEAD(&td->io_u_requeues);
1133 INIT_FLIST_HEAD(&td->io_log_list);
1134 INIT_FLIST_HEAD(&td->io_hist_list);
e8462bd8 1135 INIT_FLIST_HEAD(&td->verify_list);
0d29de83 1136 INIT_FLIST_HEAD(&td->trim_list);
e8462bd8 1137 pthread_mutex_init(&td->io_u_lock, NULL);
bb5d7d0b 1138 td->io_hist_tree = RB_ROOT;
aea47d44 1139
e8462bd8
JA
1140 pthread_condattr_init(&attr);
1141 pthread_cond_init(&td->verify_cond, &attr);
1142 pthread_cond_init(&td->free_cond, &attr);
1143
db1cd90b 1144 td_set_runstate(td, TD_INITIALIZED);
29adda3c 1145 dprint(FD_MUTEX, "up startup_mutex\n");
cdd18ad8 1146 fio_mutex_up(startup_mutex);
29adda3c 1147 dprint(FD_MUTEX, "wait on td->mutex\n");
cdd18ad8 1148 fio_mutex_down(td->mutex);
29adda3c 1149 dprint(FD_MUTEX, "done waiting on td->mutex\n");
db1cd90b
JA
1150
1151 /*
cdd18ad8 1152 * the ->mutex mutex is now no longer used, close it to avoid
db1cd90b
JA
1153 * eating a file descriptor
1154 */
cdd18ad8 1155 fio_mutex_remove(td->mutex);
db1cd90b 1156
dfc6e751
SH
1157 /*
1158 * A new gid requires privilege, so we need to do this before setting
1159 * the uid.
1160 */
e0b0d892
JA
1161 if (td->o.gid != -1U && setgid(td->o.gid)) {
1162 td_verror(td, errno, "setgid");
1163 goto err;
1164 }
dfc6e751
SH
1165 if (td->o.uid != -1U && setuid(td->o.uid)) {
1166 td_verror(td, errno, "setuid");
1167 goto err;
1168 }
e0b0d892 1169
be18a94f
JA
1170 /*
1171 * If we have a gettimeofday() thread, make sure we exclude that
1172 * thread from this job
1173 */
1174 if (td->o.gtod_cpu)
1175 fio_cpu_clear(&td->o.cpumask, td->o.gtod_cpu);
1176
1177 /*
1178 * Set affinity first, in case it has an impact on the memory
1179 * allocations.
1180 */
1181 if (td->o.cpumask_set && fio_setaffinity(td->pid, td->o.cpumask) == -1) {
1182 td_verror(td, errno, "cpu_set_affinity");
1183 goto err;
1184 }
1185
d84f8d49
JA
1186 /*
1187 * May alter parameters that init_io_u() will use, so we need to
1188 * do this first.
1189 */
1190 if (init_iolog(td))
1191 goto err;
1192
ebac4655 1193 if (init_io_u(td))
db1cd90b 1194 goto err;
ebac4655 1195
e8462bd8
JA
1196 if (td->o.verify_async && verify_async_init(td))
1197 goto err;
1198
ac684785 1199 if (td->ioprio_set) {
ebac4655 1200 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
e1161c32 1201 td_verror(td, errno, "ioprio_set");
db1cd90b 1202 goto err;
ebac4655
JA
1203 }
1204 }
1205
6adb38a1 1206 if (td->o.cgroup_weight && cgroup_setup(td, cgroup_list, &cgroup_mnt))
a696fa2a
JA
1207 goto err;
1208
2dc1bbeb 1209 if (nice(td->o.nice) == -1) {
e1161c32 1210 td_verror(td, errno, "nice");
db1cd90b 1211 goto err;
b6f4d880
JA
1212 }
1213
2dc1bbeb 1214 if (td->o.ioscheduler && switch_ioscheduler(td))
db1cd90b 1215 goto err;
37f56873 1216
2dc1bbeb 1217 if (!td->o.create_serialize && setup_files(td))
ebac4655
JA
1218 goto err;
1219
7d6c5283
JA
1220 if (td_io_init(td))
1221 goto err;
1222
68727076
JA
1223 if (init_random_map(td))
1224 goto err;
1225
2dc1bbeb 1226 if (td->o.exec_prerun) {
398e8c4d 1227 if (exec_string(td->o.exec_prerun))
69cfd7e0
JA
1228 goto err;
1229 }
4e0ba8af 1230
afad68f7
ZY
1231 if (td->o.pre_read) {
1232 if (pre_read_files(td) < 0)
1233 goto err;
1234 }
1235
69008999 1236 fio_gettime(&td->epoch, NULL);
c8aaba19 1237 getrusage(RUSAGE_SELF, &td->ru_start);
69008999 1238
a978ba68 1239 clear_state = 0;
492158cf 1240 while (keep_running(td)) {
02bcaa8c 1241 fio_gettime(&td->start, NULL);
c8eeb9df
JA
1242 memcpy(&td->bw_sample_time, &td->start, sizeof(td->start));
1243 memcpy(&td->iops_sample_time, &td->start, sizeof(td->start));
993bf48b 1244 memcpy(&td->tv_cache, &td->start, sizeof(td->start));
ebac4655 1245
cf2dd8d6 1246 if (td->o.ratemin[0] || td->o.ratemin[1])
c8eeb9df 1247 memcpy(&td->lastrate, &td->bw_sample_time,
5ec10eaa 1248 sizeof(td->lastrate));
ebac4655 1249
df9c26b1
JA
1250 if (clear_state)
1251 clear_io_state(td);
a978ba68 1252
ebac4655
JA
1253 prune_io_piece_log(td);
1254
ba0fbe10 1255 do_io(td);
ebac4655 1256
a978ba68
JA
1257 clear_state = 1;
1258
38d77cae 1259 if (td_read(td) && td->io_bytes[DDIR_READ]) {
0a4957c6 1260 elapsed = utime_since_now(&td->start);
cda99fa0 1261 td->ts.runtime[DDIR_READ] += elapsed;
38d77cae
JA
1262 }
1263 if (td_write(td) && td->io_bytes[DDIR_WRITE]) {
0a4957c6 1264 elapsed = utime_since_now(&td->start);
cda99fa0 1265 td->ts.runtime[DDIR_WRITE] += elapsed;
38d77cae 1266 }
5ec10eaa 1267
ebac4655
JA
1268 if (td->error || td->terminate)
1269 break;
1270
e84c73a8
SL
1271 if (!td->o.do_verify ||
1272 td->o.verify == VERIFY_NONE ||
b67740d3 1273 (td->io_ops->flags & FIO_UNIDIR))
ebac4655
JA
1274 continue;
1275
df9c26b1 1276 clear_io_state(td);
a978ba68 1277
02bcaa8c 1278 fio_gettime(&td->start, NULL);
ebac4655
JA
1279
1280 do_verify(td);
1281
cda99fa0 1282 td->ts.runtime[DDIR_READ] += utime_since_now(&td->start);
ebac4655
JA
1283
1284 if (td->error || td->terminate)
1285 break;
1286 }
1287
36dff966 1288 update_rusage_stat(td);
cda99fa0
SSP
1289 td->ts.runtime[0] = (td->ts.runtime[0] + 999) / 1000;
1290 td->ts.runtime[1] = (td->ts.runtime[1] + 999) / 1000;
756867bd
JA
1291 td->ts.total_run_time = mtime_since_now(&td->epoch);
1292 td->ts.io_bytes[0] = td->io_bytes[0];
1293 td->ts.io_bytes[1] = td->io_bytes[1];
1294
d2bbb8d9 1295 fio_mutex_down(writeout_mutex);
7b9f733a 1296 if (td->bw_log) {
f484470b 1297 if (td->o.bw_log_file) {
7b9f733a 1298 finish_log_named(td, td->bw_log,
f484470b
JA
1299 td->o.bw_log_file, "bw");
1300 } else
7b9f733a 1301 finish_log(td, td->bw_log, "bw");
e3cedca7 1302 }
7b9f733a 1303 if (td->lat_log) {
02af0988 1304 if (td->o.lat_log_file) {
7b9f733a 1305 finish_log_named(td, td->lat_log,
02af0988
JA
1306 td->o.lat_log_file, "lat");
1307 } else
7b9f733a 1308 finish_log(td, td->lat_log, "lat");
02af0988 1309 }
7b9f733a 1310 if (td->slat_log) {
f484470b 1311 if (td->o.lat_log_file) {
7b9f733a 1312 finish_log_named(td, td->slat_log,
1ca95738 1313 td->o.lat_log_file, "slat");
f484470b 1314 } else
7b9f733a 1315 finish_log(td, td->slat_log, "slat");
e3cedca7 1316 }
7b9f733a 1317 if (td->clat_log) {
f484470b 1318 if (td->o.lat_log_file) {
7b9f733a 1319 finish_log_named(td, td->clat_log,
f484470b
JA
1320 td->o.lat_log_file, "clat");
1321 } else
7b9f733a 1322 finish_log(td, td->clat_log, "clat");
e3cedca7 1323 }
c8eeb9df
JA
1324 if (td->iops_log) {
1325 if (td->o.iops_log_file) {
1326 finish_log_named(td, td->iops_log,
1327 td->o.iops_log_file, "iops");
1328 } else
1329 finish_log(td, td->iops_log, "iops");
1330 }
1331
d2bbb8d9 1332 fio_mutex_up(writeout_mutex);
398e8c4d
JA
1333 if (td->o.exec_postrun)
1334 exec_string(td->o.exec_postrun);
ebac4655
JA
1335
1336 if (exitall_on_terminate)
cc0df00a 1337 fio_terminate_threads(td->groupid);
ebac4655
JA
1338
1339err:
5bf13a5a 1340 if (td->error)
4ceb30d4 1341 log_info("fio: pid=%d, err=%d/%s\n", (int) td->pid, td->error,
5ec10eaa 1342 td->verror);
b4707ed7
JA
1343
1344 if (td->o.verify_async)
1345 verify_async_exit(td);
1346
24ffd2c2 1347 close_and_free_files(td);
2866c82d 1348 close_ioengine(td);
ebac4655 1349 cleanup_io_u(td);
6adb38a1 1350 cgroup_shutdown(td, &cgroup_mnt);
f29b25a3 1351
d2ce18b5
JA
1352 if (td->o.cpumask_set) {
1353 int ret = fio_cpuset_exit(&td->o.cpumask);
1354
1355 td_verror(td, ret, "fio_cpuset_exit");
1356 }
4e78e405 1357
f29b25a3
JA
1358 /*
1359 * do this very late, it will log file closing as well
1360 */
1361 if (td->o.write_iolog_file)
1362 write_iolog_close(td);
1363
d23bb327 1364 options_mem_free(td);
ebac4655 1365 td_set_runstate(td, TD_EXITED);
43d76807 1366 return (void *) (unsigned long) td->error;
ebac4655
JA
1367}
1368
906c8d75
JA
1369/*
1370 * We cannot pass the td data into a forked process, so attach the td and
1371 * pass it to the thread worker.
1372 */
a6418147 1373static int fork_main(int shmid, int offset)
ebac4655
JA
1374{
1375 struct thread_data *td;
a6418147 1376 void *data, *ret;
ebac4655 1377
65258961 1378#ifndef __hpux
ebac4655
JA
1379 data = shmat(shmid, NULL, 0);
1380 if (data == (void *) -1) {
a6418147
JA
1381 int __err = errno;
1382
ebac4655 1383 perror("shmat");
a6418147 1384 return __err;
ebac4655 1385 }
65258961
JA
1386#else
1387 /*
1388 * HP-UX inherits shm mappings?
1389 */
1390 data = threads;
1391#endif
ebac4655
JA
1392
1393 td = data + offset * sizeof(struct thread_data);
a6418147 1394 ret = thread_main(td);
ebac4655 1395 shmdt(data);
43d76807 1396 return (int) (unsigned long) ret;
ebac4655
JA
1397}
1398
906c8d75
JA
1399/*
1400 * Run over the job map and reap the threads that have exited, if any.
1401 */
ebac4655
JA
1402static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
1403{
34572e28 1404 struct thread_data *td;
1f809d15 1405 int i, cputhreads, realthreads, pending, status, ret;
ebac4655
JA
1406
1407 /*
1408 * reap exited threads (TD_EXITED -> TD_REAPED)
1409 */
1f809d15 1410 realthreads = pending = cputhreads = 0;
34572e28 1411 for_each_td(td, i) {
3707f45b 1412 int flags = 0;
a2f77c9f 1413
84585003
JA
1414 /*
1415 * ->io_ops is NULL for a thread that has closed its
1416 * io engine
1417 */
ba0fbe10 1418 if (td->io_ops && !strcmp(td->io_ops->name, "cpuio"))
b990b5c0 1419 cputhreads++;
1f809d15
JA
1420 else
1421 realthreads++;
b990b5c0 1422
a1dedc1f
AC
1423 if (!td->pid) {
1424 pending++;
1425 continue;
1426 }
1427 if (td->runstate == TD_REAPED)
a2f77c9f 1428 continue;
2dc1bbeb 1429 if (td->o.use_thread) {
3707f45b
JA
1430 if (td->runstate == TD_EXITED) {
1431 td_set_runstate(td, TD_REAPED);
1432 goto reaped;
1433 }
1434 continue;
1435 }
a2f77c9f
JA
1436
1437 flags = WNOHANG;
1438 if (td->runstate == TD_EXITED)
1439 flags = 0;
1440
1441 /*
1442 * check if someone quit or got killed in an unusual way
1443 */
1444 ret = waitpid(td->pid, &status, flags);
3707f45b 1445 if (ret < 0) {
a2f77c9f 1446 if (errno == ECHILD) {
5921e80c
JA
1447 log_err("fio: pid=%d disappeared %d\n",
1448 (int) td->pid, td->runstate);
a2f77c9f
JA
1449 td_set_runstate(td, TD_REAPED);
1450 goto reaped;
1451 }
1452 perror("waitpid");
1453 } else if (ret == td->pid) {
1454 if (WIFSIGNALED(status)) {
fab6aa71
JA
1455 int sig = WTERMSIG(status);
1456
03e20d68 1457 if (sig != SIGTERM)
5ec10eaa 1458 log_err("fio: pid=%d, got signal=%d\n",
5921e80c 1459 (int) td->pid, sig);
fab6aa71
JA
1460 td_set_runstate(td, TD_REAPED);
1461 goto reaped;
1462 }
a2f77c9f
JA
1463 if (WIFEXITED(status)) {
1464 if (WEXITSTATUS(status) && !td->error)
1465 td->error = WEXITSTATUS(status);
a2f77c9f 1466
a2f77c9f
JA
1467 td_set_runstate(td, TD_REAPED);
1468 goto reaped;
a6418147
JA
1469 }
1470 }
ebac4655 1471
a2f77c9f
JA
1472 /*
1473 * thread is not dead, continue
1474 */
e48676ba 1475 pending++;
a2f77c9f 1476 continue;
fab6aa71 1477reaped:
ebac4655 1478 (*nr_running)--;
581e7141
JA
1479 (*m_rate) -= (td->o.ratemin[0] + td->o.ratemin[1]);
1480 (*t_rate) -= (td->o.rate[0] + td->o.rate[1]);
6f88bcb0
JA
1481 if (!td->pid)
1482 pending--;
a2f77c9f
JA
1483
1484 if (td->error)
1485 exit_value++;
d3eeeabc
JA
1486
1487 done_secs += mtime_since_now(&td->epoch) / 1000;
ebac4655 1488 }
b990b5c0 1489
1f809d15 1490 if (*nr_running == cputhreads && !pending && realthreads)
cc0df00a 1491 fio_terminate_threads(TERMINATE_ALL);
ebac4655
JA
1492}
1493
be4ecfdf
JA
1494static void *gtod_thread_main(void *data)
1495{
1496 fio_mutex_up(startup_mutex);
1497
1498 /*
1499 * As long as we have jobs around, update the clock. It would be nice
1500 * to have some way of NOT hammering that CPU with gettimeofday(),
1501 * but I'm not sure what to use outside of a simple CPU nop to relax
1502 * it - we don't want to lose precision.
1503 */
1504 while (threads) {
1505 fio_gtod_update();
1506 nop;
1507 }
1508
1509 return NULL;
1510}
1511
1512static int fio_start_gtod_thread(void)
1513{
304a47c7 1514 pthread_attr_t attr;
f42c153d
JA
1515 int ret;
1516
304a47c7
VA
1517 pthread_attr_init(&attr);
1518 pthread_attr_setstacksize(&attr, PTHREAD_STACK_MIN);
1519 ret = pthread_create(&gtod_thread, &attr, gtod_thread_main, NULL);
1520 pthread_attr_destroy(&attr);
f42c153d
JA
1521 if (ret) {
1522 log_err("Can't create gtod thread: %s\n", strerror(ret));
be4ecfdf
JA
1523 return 1;
1524 }
f42c153d
JA
1525
1526 ret = pthread_detach(gtod_thread);
1527 if (ret) {
1528 log_err("Can't detatch gtod thread: %s\n", strerror(ret));
be4ecfdf
JA
1529 return 1;
1530 }
1531
29adda3c 1532 dprint(FD_MUTEX, "wait on startup_mutex\n");
be4ecfdf 1533 fio_mutex_down(startup_mutex);
29adda3c 1534 dprint(FD_MUTEX, "done waiting on startup_mutex\n");
be4ecfdf
JA
1535 return 0;
1536}
1537
906c8d75
JA
1538/*
1539 * Main function for kicking off and reaping jobs, as needed.
1540 */
ebac4655
JA
1541static void run_threads(void)
1542{
ebac4655
JA
1543 struct thread_data *td;
1544 unsigned long spent;
1545 int i, todo, nr_running, m_rate, t_rate, nr_started;
fcb6ade2 1546
2f9ade3c
JA
1547 if (fio_pin_memory())
1548 return;
ebac4655 1549
be4ecfdf
JA
1550 if (fio_gtod_offload && fio_start_gtod_thread())
1551 return;
1552
cc0df00a
JA
1553 set_sig_handlers();
1554
c6ae0a5b 1555 if (!terse_output) {
4ceb30d4 1556 log_info("Starting ");
9cedf167 1557 if (nr_thread)
4ceb30d4 1558 log_info("%d thread%s", nr_thread,
5ec10eaa 1559 nr_thread > 1 ? "s" : "");
9cedf167
JA
1560 if (nr_process) {
1561 if (nr_thread)
1562 printf(" and ");
4ceb30d4 1563 log_info("%d process%s", nr_process,
5ec10eaa 1564 nr_process > 1 ? "es" : "");
9cedf167 1565 }
4ceb30d4 1566 log_info("\n");
c6ae0a5b
JA
1567 fflush(stdout);
1568 }
c04f7ec3 1569
ebac4655
JA
1570 todo = thread_number;
1571 nr_running = 0;
1572 nr_started = 0;
1573 m_rate = t_rate = 0;
1574
34572e28 1575 for_each_td(td, i) {
263e529f 1576 print_status_init(td->thread_number - 1);
ebac4655 1577
067430bb 1578 if (!td->o.create_serialize)
ebac4655
JA
1579 continue;
1580
1581 /*
1582 * do file setup here so it happens sequentially,
1583 * we don't want X number of threads getting their
1584 * client data interspersed on disk
1585 */
53cdc686 1586 if (setup_files(td)) {
5bf13a5a
JA
1587 exit_value++;
1588 if (td->error)
5921e80c
JA
1589 log_err("fio: pid=%d, err=%d/%s\n",
1590 (int) td->pid, td->error, td->verror);
ebac4655
JA
1591 td_set_runstate(td, TD_REAPED);
1592 todo--;
c69e8875
JA
1593 } else {
1594 struct fio_file *f;
2b13e716 1595 unsigned int j;
c69e8875
JA
1596
1597 /*
1598 * for sharing to work, each job must always open
1599 * its own files. so close them, if we opened them
1600 * for creation
1601 */
2b13e716 1602 for_each_file(td, f, j) {
22a57ba8
JA
1603 if (fio_file_open(f))
1604 td_io_close_file(td, f);
22a57ba8 1605 }
5ec10eaa 1606 }
ebac4655
JA
1607 }
1608
a2f77c9f
JA
1609 set_genesis_time();
1610
ebac4655 1611 while (todo) {
fca70358 1612 struct thread_data *map[REAL_MAX_JOBS];
75154845
JA
1613 struct timeval this_start;
1614 int this_jobs = 0, left;
1615
ebac4655
JA
1616 /*
1617 * create threads (TD_NOT_CREATED -> TD_CREATED)
1618 */
34572e28 1619 for_each_td(td, i) {
ebac4655
JA
1620 if (td->runstate != TD_NOT_CREATED)
1621 continue;
1622
1623 /*
1624 * never got a chance to start, killed by other
1625 * thread for some reason
1626 */
1627 if (td->terminate) {
1628 todo--;
1629 continue;
1630 }
1631
2dc1bbeb 1632 if (td->o.start_delay) {
263e529f 1633 spent = mtime_since_genesis();
ebac4655 1634
2dc1bbeb 1635 if (td->o.start_delay * 1000 > spent)
ebac4655
JA
1636 continue;
1637 }
1638
6f88bcb0
JA
1639 if (td->o.stonewall && (nr_started || nr_running)) {
1640 dprint(FD_PROCESS, "%s: stonewall wait\n",
1641 td->o.name);
ebac4655 1642 break;
6f88bcb0 1643 }
ebac4655 1644
067430bb
JA
1645 init_disk_util(td);
1646
75154845
JA
1647 /*
1648 * Set state to created. Thread will transition
1649 * to TD_INITIALIZED when it's done setting up.
1650 */
ebac4655 1651 td_set_runstate(td, TD_CREATED);
75154845 1652 map[this_jobs++] = td;
ebac4655
JA
1653 nr_started++;
1654
2dc1bbeb 1655 if (td->o.use_thread) {
f42c153d
JA
1656 int ret;
1657
ee56ad50 1658 dprint(FD_PROCESS, "will pthread_create\n");
f42c153d
JA
1659 ret = pthread_create(&td->thread, NULL,
1660 thread_main, td);
1661 if (ret) {
1662 log_err("pthread_create: %s\n",
1663 strerror(ret));
ebac4655 1664 nr_started--;
c8bb6faf 1665 break;
ebac4655 1666 }
f42c153d
JA
1667 ret = pthread_detach(td->thread);
1668 if (ret)
1669 log_err("pthread_detach: %s",
1670 strerror(ret));
ebac4655 1671 } else {
5e1d306e 1672 pid_t pid;
ee56ad50 1673 dprint(FD_PROCESS, "will fork\n");
5e1d306e
JA
1674 pid = fork();
1675 if (!pid) {
a6418147
JA
1676 int ret = fork_main(shm_id, i);
1677
5e1d306e
JA
1678 _exit(ret);
1679 } else if (i == fio_debug_jobno)
1680 *fio_debug_jobp = pid;
ebac4655 1681 }
29adda3c 1682 dprint(FD_MUTEX, "wait on startup_mutex\n");
656b1393
JA
1683 if (fio_mutex_down_timeout(startup_mutex, 10)) {
1684 log_err("fio: job startup hung? exiting.\n");
cc0df00a 1685 fio_terminate_threads(TERMINATE_ALL);
656b1393
JA
1686 fio_abort = 1;
1687 nr_started--;
1688 break;
1689 }
29adda3c 1690 dprint(FD_MUTEX, "done waiting on startup_mutex\n");
ebac4655
JA
1691 }
1692
1693 /*
75154845
JA
1694 * Wait for the started threads to transition to
1695 * TD_INITIALIZED.
ebac4655 1696 */
02bcaa8c 1697 fio_gettime(&this_start, NULL);
75154845 1698 left = this_jobs;
6ce15a32 1699 while (left && !fio_abort) {
75154845
JA
1700 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
1701 break;
1702
1703 usleep(100000);
1704
1705 for (i = 0; i < this_jobs; i++) {
1706 td = map[i];
1707 if (!td)
1708 continue;
b6f4d880 1709 if (td->runstate == TD_INITIALIZED) {
75154845
JA
1710 map[i] = NULL;
1711 left--;
b6f4d880
JA
1712 } else if (td->runstate >= TD_EXITED) {
1713 map[i] = NULL;
1714 left--;
1715 todo--;
1716 nr_running++; /* work-around... */
75154845
JA
1717 }
1718 }
1719 }
1720
1721 if (left) {
3b70d7e5 1722 log_err("fio: %d jobs failed to start\n", left);
75154845
JA
1723 for (i = 0; i < this_jobs; i++) {
1724 td = map[i];
1725 if (!td)
1726 continue;
1727 kill(td->pid, SIGTERM);
1728 }
1729 break;
1730 }
1731
1732 /*
b6f4d880 1733 * start created threads (TD_INITIALIZED -> TD_RUNNING).
75154845 1734 */
34572e28 1735 for_each_td(td, i) {
75154845 1736 if (td->runstate != TD_INITIALIZED)
ebac4655
JA
1737 continue;
1738
b29ee5b3
JA
1739 if (in_ramp_time(td))
1740 td_set_runstate(td, TD_RAMP);
1741 else
1742 td_set_runstate(td, TD_RUNNING);
ebac4655
JA
1743 nr_running++;
1744 nr_started--;
581e7141
JA
1745 m_rate += td->o.ratemin[0] + td->o.ratemin[1];
1746 t_rate += td->o.rate[0] + td->o.rate[1];
75154845 1747 todo--;
cdd18ad8 1748 fio_mutex_up(td->mutex);
ebac4655
JA
1749 }
1750
1751 reap_threads(&nr_running, &t_rate, &m_rate);
1752
602d6ff9
JA
1753 if (todo) {
1754 if (is_backend)
1755 fio_server_idle_loop();
1756 else
1757 usleep(100000);
1758 }
ebac4655
JA
1759 }
1760
1761 while (nr_running) {
1762 reap_threads(&nr_running, &t_rate, &m_rate);
cc0df00a
JA
1763
1764 if (is_backend)
1765 fio_server_idle_loop();
70e0c316
JA
1766 else
1767 usleep(10000);
ebac4655
JA
1768 }
1769
1770 update_io_ticks();
2f9ade3c 1771 fio_unpin_memory();
ebac4655
JA
1772}
1773
50d16976 1774int exec_run(void)
ebac4655 1775{
a37f69b7 1776 if (nr_clients)
37db14fe 1777 return fio_handle_clients();
07b3232d
JA
1778 if (exec_profile && load_profile(exec_profile))
1779 return 1;
1780
74929ac2
JA
1781 if (!thread_number)
1782 return 0;
1783
bb3884d8
JA
1784 if (write_bw_log) {
1785 setup_log(&agg_io_log[DDIR_READ]);
1786 setup_log(&agg_io_log[DDIR_WRITE]);
1787 }
1788
cdd18ad8 1789 startup_mutex = fio_mutex_init(0);
03e20d68
BC
1790 if (startup_mutex == NULL)
1791 return 1;
d2bbb8d9 1792 writeout_mutex = fio_mutex_init(1);
03e20d68
BC
1793 if (writeout_mutex == NULL)
1794 return 1;
07739b57 1795
a2f77c9f 1796 set_genesis_time();
7985701b 1797 create_disk_util_thread();
ebac4655 1798
dae5341c
JA
1799 cgroup_list = smalloc(sizeof(*cgroup_list));
1800 INIT_FLIST_HEAD(cgroup_list);
1801
ebac4655 1802 run_threads();
6ce15a32 1803
bb3884d8 1804 if (!fio_abort) {
6ce15a32 1805 show_run_stats();
bb3884d8 1806 if (write_bw_log) {
5ec10eaa
JA
1807 __finish_log(agg_io_log[DDIR_READ], "agg-read_bw.log");
1808 __finish_log(agg_io_log[DDIR_WRITE],
1809 "agg-write_bw.log");
bb3884d8
JA
1810 }
1811 }
ebac4655 1812
dae5341c
JA
1813 cgroup_kill(cgroup_list);
1814 sfree(cgroup_list);
61eb313e 1815 sfree(cgroup_mnt);
39f22027 1816
cdd18ad8 1817 fio_mutex_remove(startup_mutex);
d2bbb8d9 1818 fio_mutex_remove(writeout_mutex);
437c9b71 1819 return exit_value;
ebac4655 1820}
50d16976
JA
1821
1822void reset_fio_state(void)
1823{
1824 groupid = 0;
1825 thread_number = 0;
1826 nr_process = 0;
1827 nr_thread = 0;
1828 done_secs = 0;
1829}
1830
0ad5edcc
JA
1831static int endian_check(void)
1832{
1833 union {
1834 uint8_t c[8];
1835 uint64_t v;
1836 } u;
1837 int le = 0, be = 0;
1838
1839 u.v = 0x12;
1840 if (u.c[7] == 0x12)
1841 be = 1;
1842 else if (u.c[0] == 0x12)
1843 le = 1;
1844
1845#if defined(FIO_LITTLE_ENDIAN)
1846 if (be)
1847 return 1;
1848#elif defined(FIO_BIG_ENDIAN)
1849 if (le)
1850 return 1;
1851#else
1852 return 1;
1853#endif
1854
1855 if (!le && !be)
1856 return 1;
1857
1858 return 0;
1859}
1860
50d16976
JA
1861int main(int argc, char *argv[], char *envp[])
1862{
1863 long ps;
1864
0ad5edcc
JA
1865 if (endian_check()) {
1866 log_err("fio: endianness settings appear wrong.\n");
1867 log_err("fio: please report this to fio@vger.kernel.org\n");
1868 return 1;
1869 }
1870
50d16976
JA
1871 arch_init(envp);
1872
1873 sinit();
1874
1875 /*
1876 * We need locale for number printing, if it isn't set then just
1877 * go with the US format.
1878 */
1879 if (!getenv("LC_NUMERIC"))
1880 setlocale(LC_NUMERIC, "en_US");
1881
1882 ps = sysconf(_SC_PAGESIZE);
1883 if (ps < 0) {
1884 log_err("Failed to get page size\n");
1885 return 1;
1886 }
1887
1888 page_size = ps;
1889 page_mask = ps - 1;
1890
1891 fio_keywords_init();
1892
1893 if (parse_options(argc, argv))
1894 return 1;
1895
1896 return exec_run();
1897}