mutex: add open init function and down_trylock() variant
[fio.git] / backend.c
CommitLineData
2e1df07d
JA
1/*
2 * fio - the flexible io tester
3 *
4 * Copyright (C) 2005 Jens Axboe <axboe@suse.de>
5 * Copyright (C) 2006-2012 Jens Axboe <axboe@kernel.dk>
6 *
7 * The license below covers all files distributed with fio unless otherwise
8 * noted in the file itself.
9 *
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License version 2 as
12 * published by the Free Software Foundation.
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 */
24#include <unistd.h>
25#include <fcntl.h>
26#include <string.h>
27#include <limits.h>
28#include <signal.h>
29#include <time.h>
30#include <locale.h>
31#include <assert.h>
32#include <time.h>
e43606c2 33#include <inttypes.h>
2e1df07d
JA
34#include <sys/stat.h>
35#include <sys/wait.h>
36#include <sys/ipc.h>
2e1df07d
JA
37#include <sys/mman.h>
38
39#include "fio.h"
a5e0ee11
O
40#ifndef FIO_NO_HAVE_SHM_H
41#include <sys/shm.h>
42#endif
2e1df07d
JA
43#include "hash.h"
44#include "smalloc.h"
45#include "verify.h"
46#include "trim.h"
47#include "diskutil.h"
48#include "cgroup.h"
49#include "profile.h"
50#include "lib/rand.h"
51#include "memalign.h"
52#include "server.h"
44404c5a 53#include "lib/getrusage.h"
f2a2ce0e 54#include "idletime.h"
002fe734 55#include "err.h"
2e1df07d
JA
56
57static pthread_t disk_util_thread;
9ec7779f 58static struct fio_mutex *disk_thread_mutex;
2e1df07d
JA
59static struct fio_mutex *startup_mutex;
60static struct fio_mutex *writeout_mutex;
61static struct flist_head *cgroup_list;
62static char *cgroup_mnt;
63static int exit_value;
64static volatile int fio_abort;
3a5f6bde
JA
65static unsigned int nr_process = 0;
66static unsigned int nr_thread = 0;
2e1df07d 67
6eaf09d6 68struct io_log *agg_io_log[DDIR_RWDIR_CNT];
2e1df07d 69
a3efc919
JA
70int groupid = 0;
71unsigned int thread_number = 0;
108fea77 72unsigned int stat_number = 0;
a3efc919
JA
73int shm_id = 0;
74int temp_stall_ts;
75unsigned long done_secs = 0;
27357187 76volatile int disk_util_exit = 0;
a3efc919 77
2e1df07d 78#define PAGE_ALIGN(buf) \
e43606c2 79 (char *) (((uintptr_t) (buf) + page_mask) & ~page_mask)
2e1df07d
JA
80
81#define JOB_START_TIMEOUT (5 * 1000)
82
83static void sig_int(int sig)
84{
85 if (threads) {
86 if (is_backend)
87 fio_server_got_signal(sig);
88 else {
89 log_info("\nfio: terminating on signal %d\n", sig);
90 fflush(stdout);
91 exit_value = 128;
92 }
93
94 fio_terminate_threads(TERMINATE_ALL);
95 }
96}
97
4c6d91e8
JA
98static void sig_show_status(int sig)
99{
100 show_running_run_stats();
101}
102
2e1df07d
JA
103static void set_sig_handlers(void)
104{
105 struct sigaction act;
106
107 memset(&act, 0, sizeof(act));
108 act.sa_handler = sig_int;
109 act.sa_flags = SA_RESTART;
110 sigaction(SIGINT, &act, NULL);
111
112 memset(&act, 0, sizeof(act));
113 act.sa_handler = sig_int;
114 act.sa_flags = SA_RESTART;
115 sigaction(SIGTERM, &act, NULL);
116
2f694507
BC
117/* Windows uses SIGBREAK as a quit signal from other applications */
118#ifdef WIN32
119 memset(&act, 0, sizeof(act));
120 act.sa_handler = sig_int;
121 act.sa_flags = SA_RESTART;
122 sigaction(SIGBREAK, &act, NULL);
123#endif
124
4c6d91e8
JA
125 memset(&act, 0, sizeof(act));
126 act.sa_handler = sig_show_status;
127 act.sa_flags = SA_RESTART;
128 sigaction(SIGUSR1, &act, NULL);
129
2e1df07d
JA
130 if (is_backend) {
131 memset(&act, 0, sizeof(act));
132 act.sa_handler = sig_int;
133 act.sa_flags = SA_RESTART;
134 sigaction(SIGPIPE, &act, NULL);
135 }
136}
137
138/*
139 * Check if we are above the minimum rate given.
140 */
141static int __check_min_rate(struct thread_data *td, struct timeval *now,
142 enum fio_ddir ddir)
143{
144 unsigned long long bytes = 0;
145 unsigned long iops = 0;
146 unsigned long spent;
147 unsigned long rate;
148 unsigned int ratemin = 0;
149 unsigned int rate_iops = 0;
150 unsigned int rate_iops_min = 0;
151
152 assert(ddir_rw(ddir));
153
154 if (!td->o.ratemin[ddir] && !td->o.rate_iops_min[ddir])
155 return 0;
156
157 /*
158 * allow a 2 second settle period in the beginning
159 */
160 if (mtime_since(&td->start, now) < 2000)
161 return 0;
162
163 iops += td->this_io_blocks[ddir];
164 bytes += td->this_io_bytes[ddir];
165 ratemin += td->o.ratemin[ddir];
166 rate_iops += td->o.rate_iops[ddir];
167 rate_iops_min += td->o.rate_iops_min[ddir];
168
169 /*
170 * if rate blocks is set, sample is running
171 */
172 if (td->rate_bytes[ddir] || td->rate_blocks[ddir]) {
173 spent = mtime_since(&td->lastrate[ddir], now);
174 if (spent < td->o.ratecycle)
175 return 0;
176
177 if (td->o.rate[ddir]) {
178 /*
179 * check bandwidth specified rate
180 */
181 if (bytes < td->rate_bytes[ddir]) {
182 log_err("%s: min rate %u not met\n", td->o.name,
183 ratemin);
184 return 1;
185 } else {
186 rate = ((bytes - td->rate_bytes[ddir]) * 1000) / spent;
187 if (rate < ratemin ||
188 bytes < td->rate_bytes[ddir]) {
189 log_err("%s: min rate %u not met, got"
190 " %luKB/sec\n", td->o.name,
191 ratemin, rate);
192 return 1;
193 }
194 }
195 } else {
196 /*
197 * checks iops specified rate
198 */
199 if (iops < rate_iops) {
200 log_err("%s: min iops rate %u not met\n",
201 td->o.name, rate_iops);
202 return 1;
203 } else {
204 rate = ((iops - td->rate_blocks[ddir]) * 1000) / spent;
205 if (rate < rate_iops_min ||
206 iops < td->rate_blocks[ddir]) {
207 log_err("%s: min iops rate %u not met,"
208 " got %lu\n", td->o.name,
209 rate_iops_min, rate);
210 }
211 }
212 }
213 }
214
215 td->rate_bytes[ddir] = bytes;
216 td->rate_blocks[ddir] = iops;
217 memcpy(&td->lastrate[ddir], now, sizeof(*now));
218 return 0;
219}
220
221static int check_min_rate(struct thread_data *td, struct timeval *now,
100f49f1 222 uint64_t *bytes_done)
2e1df07d
JA
223{
224 int ret = 0;
225
6eaf09d6
SL
226 if (bytes_done[DDIR_READ])
227 ret |= __check_min_rate(td, now, DDIR_READ);
228 if (bytes_done[DDIR_WRITE])
229 ret |= __check_min_rate(td, now, DDIR_WRITE);
230 if (bytes_done[DDIR_TRIM])
231 ret |= __check_min_rate(td, now, DDIR_TRIM);
2e1df07d
JA
232
233 return ret;
234}
235
236/*
237 * When job exits, we can cancel the in-flight IO if we are using async
238 * io. Attempt to do so.
239 */
240static void cleanup_pending_aio(struct thread_data *td)
241{
2e1df07d
JA
242 int r;
243
244 /*
245 * get immediately available events, if any
246 */
247 r = io_u_queued_complete(td, 0, NULL);
248 if (r < 0)
249 return;
250
251 /*
252 * now cancel remaining active events
253 */
254 if (td->io_ops->cancel) {
2ae0b204
JA
255 struct io_u *io_u;
256 int i;
2e1df07d 257
2ae0b204
JA
258 io_u_qiter(&td->io_u_all, io_u, i) {
259 if (io_u->flags & IO_U_F_FLIGHT) {
2e1df07d
JA
260 r = td->io_ops->cancel(td, io_u);
261 if (!r)
262 put_io_u(td, io_u);
263 }
264 }
265 }
266
267 if (td->cur_depth)
268 r = io_u_queued_complete(td, td->cur_depth, NULL);
269}
270
271/*
272 * Helper to handle the final sync of a file. Works just like the normal
273 * io path, just does everything sync.
274 */
275static int fio_io_sync(struct thread_data *td, struct fio_file *f)
276{
277 struct io_u *io_u = __get_io_u(td);
278 int ret;
279
280 if (!io_u)
281 return 1;
282
283 io_u->ddir = DDIR_SYNC;
284 io_u->file = f;
285
286 if (td_io_prep(td, io_u)) {
287 put_io_u(td, io_u);
288 return 1;
289 }
290
291requeue:
292 ret = td_io_queue(td, io_u);
293 if (ret < 0) {
294 td_verror(td, io_u->error, "td_io_queue");
295 put_io_u(td, io_u);
296 return 1;
297 } else if (ret == FIO_Q_QUEUED) {
298 if (io_u_queued_complete(td, 1, NULL) < 0)
299 return 1;
300 } else if (ret == FIO_Q_COMPLETED) {
301 if (io_u->error) {
302 td_verror(td, io_u->error, "td_io_queue");
303 return 1;
304 }
305
306 if (io_u_sync_complete(td, io_u, NULL) < 0)
307 return 1;
308 } else if (ret == FIO_Q_BUSY) {
309 if (td_io_commit(td))
310 return 1;
311 goto requeue;
312 }
313
314 return 0;
315}
a3efc919 316
61ee0f86
JA
317static int fio_file_fsync(struct thread_data *td, struct fio_file *f)
318{
319 int ret;
320
321 if (fio_file_open(f))
322 return fio_io_sync(td, f);
323
324 if (td_io_open_file(td, f))
325 return 1;
326
327 ret = fio_io_sync(td, f);
328 td_io_close_file(td, f);
329 return ret;
330}
331
2e1df07d
JA
332static inline void __update_tv_cache(struct thread_data *td)
333{
334 fio_gettime(&td->tv_cache, NULL);
335}
336
337static inline void update_tv_cache(struct thread_data *td)
338{
339 if ((++td->tv_cache_nr & td->tv_cache_mask) == td->tv_cache_mask)
340 __update_tv_cache(td);
341}
342
343static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
344{
345 if (in_ramp_time(td))
346 return 0;
347 if (!td->o.timeout)
348 return 0;
0de5b26f 349 if (utime_since(&td->epoch, t) >= td->o.timeout)
2e1df07d
JA
350 return 1;
351
352 return 0;
353}
354
355static int break_on_this_error(struct thread_data *td, enum fio_ddir ddir,
356 int *retptr)
357{
358 int ret = *retptr;
359
360 if (ret < 0 || td->error) {
8b28bd41
DM
361 int err = td->error;
362 enum error_type_bit eb;
2e1df07d
JA
363
364 if (ret < 0)
365 err = -ret;
2e1df07d 366
8b28bd41
DM
367 eb = td_error_type(ddir, err);
368 if (!(td->o.continue_on_error & (1 << eb)))
2e1df07d
JA
369 return 1;
370
8b28bd41 371 if (td_non_fatal_error(td, eb, err)) {
2e1df07d
JA
372 /*
373 * Continue with the I/Os in case of
374 * a non fatal error.
375 */
376 update_error_count(td, err);
377 td_clear_error(td);
378 *retptr = 0;
379 return 0;
380 } else if (td->o.fill_device && err == ENOSPC) {
381 /*
382 * We expect to hit this error if
383 * fill_device option is set.
384 */
385 td_clear_error(td);
386 td->terminate = 1;
387 return 1;
388 } else {
389 /*
390 * Stop the I/O in case of a fatal
391 * error.
392 */
393 update_error_count(td, err);
394 return 1;
395 }
396 }
397
398 return 0;
399}
400
c97f1ad6
JA
401static void check_update_rusage(struct thread_data *td)
402{
403 if (td->update_rusage) {
404 td->update_rusage = 0;
405 update_rusage_stat(td);
406 fio_mutex_up(td->rusage_sem);
407 }
408}
409
2e1df07d
JA
410/*
411 * The main verify engine. Runs over the writes we previously submitted,
412 * reads the blocks back in, and checks the crc/md5 of the data.
413 */
100f49f1 414static void do_verify(struct thread_data *td, uint64_t verify_bytes)
2e1df07d 415{
100f49f1 416 uint64_t bytes_done[DDIR_RWDIR_CNT] = { 0, 0, 0 };
2e1df07d
JA
417 struct fio_file *f;
418 struct io_u *io_u;
419 int ret, min_events;
420 unsigned int i;
421
422 dprint(FD_VERIFY, "starting loop\n");
423
424 /*
425 * sync io first and invalidate cache, to make sure we really
426 * read from disk.
427 */
428 for_each_file(td, f, i) {
429 if (!fio_file_open(f))
430 continue;
431 if (fio_io_sync(td, f))
432 break;
433 if (file_invalidate_cache(td, f))
434 break;
435 }
436
c97f1ad6
JA
437 check_update_rusage(td);
438
2e1df07d
JA
439 if (td->error)
440 return;
441
442 td_set_runstate(td, TD_VERIFYING);
443
444 io_u = NULL;
445 while (!td->terminate) {
fbccf46c 446 enum fio_ddir ddir;
2e1df07d
JA
447 int ret2, full;
448
449 update_tv_cache(td);
c97f1ad6 450 check_update_rusage(td);
2e1df07d
JA
451
452 if (runtime_exceeded(td, &td->tv_cache)) {
453 __update_tv_cache(td);
454 if (runtime_exceeded(td, &td->tv_cache)) {
455 td->terminate = 1;
456 break;
457 }
458 }
459
9e684a49
DE
460 if (flow_threshold_exceeded(td))
461 continue;
462
44cbc6da
JA
463 if (!td->o.experimental_verify) {
464 io_u = __get_io_u(td);
465 if (!io_u)
466 break;
2e1df07d 467
44cbc6da
JA
468 if (get_next_verify(td, io_u)) {
469 put_io_u(td, io_u);
470 break;
471 }
2e1df07d 472
44cbc6da
JA
473 if (td_io_prep(td, io_u)) {
474 put_io_u(td, io_u);
475 break;
476 }
477 } else {
100f49f1
JA
478 if (ddir_rw_sum(bytes_done) + td->o.rw_min_bs > verify_bytes)
479 break;
480
bcd5abfa 481 while ((io_u = get_io_u(td)) != NULL) {
002fe734
JA
482 if (IS_ERR(io_u)) {
483 io_u = NULL;
484 ret = FIO_Q_BUSY;
485 goto reap;
486 }
487
bcd5abfa
JA
488 /*
489 * We are only interested in the places where
490 * we wrote or trimmed IOs. Turn those into
491 * reads for verification purposes.
492 */
493 if (io_u->ddir == DDIR_READ) {
494 /*
495 * Pretend we issued it for rwmix
496 * accounting
497 */
498 td->io_issues[DDIR_READ]++;
499 put_io_u(td, io_u);
500 continue;
501 } else if (io_u->ddir == DDIR_TRIM) {
502 io_u->ddir = DDIR_READ;
503 io_u->flags |= IO_U_F_TRIMMED;
504 break;
505 } else if (io_u->ddir == DDIR_WRITE) {
506 io_u->ddir = DDIR_READ;
507 break;
508 } else {
509 put_io_u(td, io_u);
510 continue;
511 }
512 }
44cbc6da 513
bcd5abfa 514 if (!io_u)
44cbc6da 515 break;
2e1df07d
JA
516 }
517
518 if (td->o.verify_async)
519 io_u->end_io = verify_io_u_async;
520 else
521 io_u->end_io = verify_io_u;
522
fbccf46c
JA
523 ddir = io_u->ddir;
524
2e1df07d
JA
525 ret = td_io_queue(td, io_u);
526 switch (ret) {
527 case FIO_Q_COMPLETED:
528 if (io_u->error) {
529 ret = -io_u->error;
530 clear_io_u(td, io_u);
531 } else if (io_u->resid) {
532 int bytes = io_u->xfer_buflen - io_u->resid;
533
534 /*
535 * zero read, fail
536 */
537 if (!bytes) {
538 td_verror(td, EIO, "full resid");
539 put_io_u(td, io_u);
540 break;
541 }
542
543 io_u->xfer_buflen = io_u->resid;
544 io_u->xfer_buf += bytes;
545 io_u->offset += bytes;
546
547 if (ddir_rw(io_u->ddir))
548 td->ts.short_io_u[io_u->ddir]++;
549
550 f = io_u->file;
551 if (io_u->offset == f->real_file_size)
552 goto sync_done;
553
554 requeue_io_u(td, &io_u);
555 } else {
556sync_done:
100f49f1 557 ret = io_u_sync_complete(td, io_u, bytes_done);
2e1df07d
JA
558 if (ret < 0)
559 break;
560 }
561 continue;
562 case FIO_Q_QUEUED:
563 break;
564 case FIO_Q_BUSY:
565 requeue_io_u(td, &io_u);
566 ret2 = td_io_commit(td);
567 if (ret2 < 0)
568 ret = ret2;
569 break;
570 default:
571 assert(ret < 0);
572 td_verror(td, -ret, "td_io_queue");
573 break;
574 }
575
fbccf46c 576 if (break_on_this_error(td, ddir, &ret))
2e1df07d
JA
577 break;
578
579 /*
580 * if we can queue more, do so. but check if there are
581 * completed io_u's first. Note that we can get BUSY even
582 * without IO queued, if the system is resource starved.
583 */
002fe734 584reap:
2e1df07d
JA
585 full = queue_full(td) || (ret == FIO_Q_BUSY && td->cur_depth);
586 if (full || !td->o.iodepth_batch_complete) {
587 min_events = min(td->o.iodepth_batch_complete,
588 td->cur_depth);
8a74b56d
JA
589 /*
590 * if the queue is full, we MUST reap at least 1 event
591 */
592 if (full && !min_events)
2e1df07d
JA
593 min_events = 1;
594
595 do {
596 /*
597 * Reap required number of io units, if any,
598 * and do the verification on them through
599 * the callback handler
600 */
100f49f1 601 if (io_u_queued_complete(td, min_events, bytes_done) < 0) {
2e1df07d
JA
602 ret = -1;
603 break;
604 }
605 } while (full && (td->cur_depth > td->o.iodepth_low));
606 }
607 if (ret < 0)
608 break;
609 }
610
c97f1ad6
JA
611 check_update_rusage(td);
612
2e1df07d
JA
613 if (!td->error) {
614 min_events = td->cur_depth;
615
616 if (min_events)
617 ret = io_u_queued_complete(td, min_events, NULL);
618 } else
619 cleanup_pending_aio(td);
620
621 td_set_runstate(td, TD_RUNNING);
622
623 dprint(FD_VERIFY, "exiting loop\n");
624}
625
3939fe85
JA
626static unsigned int exceeds_number_ios(struct thread_data *td)
627{
628 unsigned long long number_ios;
629
630 if (!td->o.number_ios)
631 return 0;
632
633 number_ios = ddir_rw_sum(td->this_io_blocks);
634 number_ios += td->io_u_queued + td->io_u_in_flight;
635
636 return number_ios >= td->o.number_ios;
637}
638
f7078f7b
JA
639static int io_bytes_exceeded(struct thread_data *td)
640{
641 unsigned long long bytes;
642
643 if (td_rw(td))
6eaf09d6 644 bytes = td->this_io_bytes[DDIR_READ] + td->this_io_bytes[DDIR_WRITE];
f7078f7b 645 else if (td_write(td))
6eaf09d6
SL
646 bytes = td->this_io_bytes[DDIR_WRITE];
647 else if (td_read(td))
648 bytes = td->this_io_bytes[DDIR_READ];
f7078f7b 649 else
6eaf09d6 650 bytes = td->this_io_bytes[DDIR_TRIM];
f7078f7b 651
3939fe85 652 return bytes >= td->o.size || exceeds_number_ios(td);
f7078f7b
JA
653}
654
2e1df07d
JA
655/*
656 * Main IO worker function. It retrieves io_u's to process and queues
657 * and reaps them, checking for rate and errors along the way.
100f49f1
JA
658 *
659 * Returns number of bytes written and trimmed.
2e1df07d 660 */
100f49f1 661static uint64_t do_io(struct thread_data *td)
2e1df07d 662{
100f49f1 663 uint64_t bytes_done[DDIR_RWDIR_CNT] = { 0, 0, 0 };
2e1df07d
JA
664 unsigned int i;
665 int ret = 0;
c2703bf3 666 uint64_t total_bytes, bytes_issued = 0;
2e1df07d
JA
667
668 if (in_ramp_time(td))
669 td_set_runstate(td, TD_RAMP);
670 else
671 td_set_runstate(td, TD_RUNNING);
672
3e260a46
JA
673 lat_target_init(td);
674
78a6469c
JA
675 /*
676 * If verify_backlog is enabled, we'll run the verify in this
677 * handler as well. For that case, we may need up to twice the
678 * amount of bytes.
679 */
c2703bf3 680 total_bytes = td->o.size;
78a6469c
JA
681 if (td->o.verify != VERIFY_NONE &&
682 (td_write(td) && td->o.verify_backlog))
c2703bf3
JA
683 total_bytes += td->o.size;
684
f7078f7b 685 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
c04e4661
DE
686 (!flist_empty(&td->trim_list)) || !io_bytes_exceeded(td) ||
687 td->o.time_based) {
2e1df07d 688 struct timeval comp_time;
2e1df07d
JA
689 int min_evts = 0;
690 struct io_u *io_u;
691 int ret2, full;
692 enum fio_ddir ddir;
693
c97f1ad6
JA
694 check_update_rusage(td);
695
7d7803fa 696 if (td->terminate || td->done)
2e1df07d
JA
697 break;
698
699 update_tv_cache(td);
700
701 if (runtime_exceeded(td, &td->tv_cache)) {
702 __update_tv_cache(td);
703 if (runtime_exceeded(td, &td->tv_cache)) {
704 td->terminate = 1;
705 break;
706 }
707 }
708
9e684a49
DE
709 if (flow_threshold_exceeded(td))
710 continue;
711
c2703bf3 712 if (bytes_issued >= total_bytes)
20876c53
JC
713 break;
714
2e1df07d 715 io_u = get_io_u(td);
002fe734
JA
716 if (IS_ERR_OR_NULL(io_u)) {
717 int err = PTR_ERR(io_u);
718
719 io_u = NULL;
720 if (err == -EBUSY) {
721 ret = FIO_Q_BUSY;
722 goto reap;
723 }
3e260a46
JA
724 if (td->o.latency_target)
725 goto reap;
2e1df07d 726 break;
3e260a46 727 }
2e1df07d
JA
728
729 ddir = io_u->ddir;
730
731 /*
82af2a7c
JA
732 * Add verification end_io handler if:
733 * - Asked to verify (!td_rw(td))
734 * - Or the io_u is from our verify list (mixed write/ver)
2e1df07d
JA
735 */
736 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_READ &&
82af2a7c 737 ((io_u->flags & IO_U_F_VER_LIST) || !td_rw(td))) {
c4b6117b
PV
738
739 if (!td->o.verify_pattern_bytes) {
740 io_u->rand_seed = __rand(&td->__verify_state);
741 if (sizeof(int) != sizeof(long *))
742 io_u->rand_seed *= __rand(&td->__verify_state);
743 }
744
2e1df07d
JA
745 if (td->o.verify_async)
746 io_u->end_io = verify_io_u_async;
747 else
748 io_u->end_io = verify_io_u;
749 td_set_runstate(td, TD_VERIFYING);
750 } else if (in_ramp_time(td))
751 td_set_runstate(td, TD_RAMP);
752 else
753 td_set_runstate(td, TD_RUNNING);
754
9a50c5c5 755 /*
f9401285
JA
756 * Always log IO before it's issued, so we know the specific
757 * order of it. The logged unit will track when the IO has
758 * completed.
9a50c5c5 759 */
c4b6117b
PV
760 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
761 td->o.do_verify &&
762 td->o.verify != VERIFY_NONE &&
f9401285 763 !td->o.experimental_verify)
c4b6117b
PV
764 log_io_piece(td, io_u);
765
2e1df07d
JA
766 ret = td_io_queue(td, io_u);
767 switch (ret) {
768 case FIO_Q_COMPLETED:
769 if (io_u->error) {
770 ret = -io_u->error;
771 clear_io_u(td, io_u);
772 } else if (io_u->resid) {
773 int bytes = io_u->xfer_buflen - io_u->resid;
774 struct fio_file *f = io_u->file;
775
20876c53 776 bytes_issued += bytes;
2e1df07d
JA
777 /*
778 * zero read, fail
779 */
780 if (!bytes) {
781 td_verror(td, EIO, "full resid");
782 put_io_u(td, io_u);
783 break;
784 }
785
786 io_u->xfer_buflen = io_u->resid;
787 io_u->xfer_buf += bytes;
788 io_u->offset += bytes;
789
790 if (ddir_rw(io_u->ddir))
791 td->ts.short_io_u[io_u->ddir]++;
792
793 if (io_u->offset == f->real_file_size)
794 goto sync_done;
795
796 requeue_io_u(td, &io_u);
797 } else {
798sync_done:
6eaf09d6
SL
799 if (__should_check_rate(td, DDIR_READ) ||
800 __should_check_rate(td, DDIR_WRITE) ||
801 __should_check_rate(td, DDIR_TRIM))
2e1df07d
JA
802 fio_gettime(&comp_time, NULL);
803
804 ret = io_u_sync_complete(td, io_u, bytes_done);
805 if (ret < 0)
806 break;
20876c53 807 bytes_issued += io_u->xfer_buflen;
2e1df07d
JA
808 }
809 break;
810 case FIO_Q_QUEUED:
811 /*
812 * if the engine doesn't have a commit hook,
813 * the io_u is really queued. if it does have such
814 * a hook, it has to call io_u_queued() itself.
815 */
816 if (td->io_ops->commit == NULL)
817 io_u_queued(td, io_u);
20876c53 818 bytes_issued += io_u->xfer_buflen;
2e1df07d
JA
819 break;
820 case FIO_Q_BUSY:
821 requeue_io_u(td, &io_u);
822 ret2 = td_io_commit(td);
823 if (ret2 < 0)
824 ret = ret2;
825 break;
826 default:
827 assert(ret < 0);
828 put_io_u(td, io_u);
829 break;
830 }
831
832 if (break_on_this_error(td, ddir, &ret))
833 break;
834
835 /*
836 * See if we need to complete some commands. Note that we
837 * can get BUSY even without IO queued, if the system is
838 * resource starved.
839 */
3e260a46 840reap:
2e1df07d
JA
841 full = queue_full(td) || (ret == FIO_Q_BUSY && td->cur_depth);
842 if (full || !td->o.iodepth_batch_complete) {
843 min_evts = min(td->o.iodepth_batch_complete,
844 td->cur_depth);
8a74b56d
JA
845 /*
846 * if the queue is full, we MUST reap at least 1 event
847 */
848 if (full && !min_evts)
2e1df07d
JA
849 min_evts = 1;
850
6eaf09d6
SL
851 if (__should_check_rate(td, DDIR_READ) ||
852 __should_check_rate(td, DDIR_WRITE) ||
853 __should_check_rate(td, DDIR_TRIM))
2e1df07d
JA
854 fio_gettime(&comp_time, NULL);
855
856 do {
857 ret = io_u_queued_complete(td, min_evts, bytes_done);
858 if (ret < 0)
859 break;
860
861 } while (full && (td->cur_depth > td->o.iodepth_low));
862 }
863
864 if (ret < 0)
865 break;
d5abee06 866 if (!ddir_rw_sum(bytes_done) && !(td->io_ops->flags & FIO_NOIO))
2e1df07d
JA
867 continue;
868
869 if (!in_ramp_time(td) && should_check_rate(td, bytes_done)) {
870 if (check_min_rate(td, &comp_time, bytes_done)) {
871 if (exitall_on_terminate)
872 fio_terminate_threads(td->groupid);
873 td_verror(td, EIO, "check_min_rate");
874 break;
875 }
876 }
3e260a46
JA
877 if (!in_ramp_time(td) && td->o.latency_target)
878 lat_target_check(td);
2e1df07d
JA
879
880 if (td->o.thinktime) {
881 unsigned long long b;
882
342f4be4 883 b = ddir_rw_sum(td->io_blocks);
2e1df07d
JA
884 if (!(b % td->o.thinktime_blocks)) {
885 int left;
886
002e7183
JA
887 io_u_quiesce(td);
888
2e1df07d
JA
889 if (td->o.thinktime_spin)
890 usec_spin(td->o.thinktime_spin);
891
892 left = td->o.thinktime - td->o.thinktime_spin;
893 if (left)
894 usec_sleep(td, left);
895 }
896 }
897 }
898
c97f1ad6
JA
899 check_update_rusage(td);
900
2e1df07d 901 if (td->trim_entries)
4e0a8fa2 902 log_err("fio: %lu trim entries leaked?\n", td->trim_entries);
2e1df07d
JA
903
904 if (td->o.fill_device && td->error == ENOSPC) {
905 td->error = 0;
906 td->terminate = 1;
907 }
908 if (!td->error) {
909 struct fio_file *f;
910
911 i = td->cur_depth;
912 if (i) {
5bd5f71a 913 ret = io_u_queued_complete(td, i, bytes_done);
2e1df07d
JA
914 if (td->o.fill_device && td->error == ENOSPC)
915 td->error = 0;
916 }
917
918 if (should_fsync(td) && td->o.end_fsync) {
919 td_set_runstate(td, TD_FSYNCING);
920
921 for_each_file(td, f, i) {
61ee0f86 922 if (!fio_file_fsync(td, f))
2e1df07d 923 continue;
61ee0f86
JA
924
925 log_err("fio: end_fsync failed for file %s\n",
926 f->file_name);
2e1df07d
JA
927 }
928 }
929 } else
930 cleanup_pending_aio(td);
931
932 /*
933 * stop job if we failed doing any IO
934 */
342f4be4 935 if (!ddir_rw_sum(td->this_io_bytes))
2e1df07d 936 td->done = 1;
100f49f1
JA
937
938 return bytes_done[DDIR_WRITE] + bytes_done[DDIR_TRIM];
2e1df07d
JA
939}
940
941static void cleanup_io_u(struct thread_data *td)
942{
2e1df07d
JA
943 struct io_u *io_u;
944
2ae0b204 945 while ((io_u = io_u_qpop(&td->io_u_freelist)) != NULL) {
c73ed246
JA
946
947 if (td->io_ops->io_u_free)
948 td->io_ops->io_u_free(td, io_u);
949
2e1df07d
JA
950 fio_memfree(io_u, sizeof(*io_u));
951 }
952
953 free_io_mem(td);
2ae0b204
JA
954
955 io_u_rexit(&td->io_u_requeues);
956 io_u_qexit(&td->io_u_freelist);
957 io_u_qexit(&td->io_u_all);
2e1df07d
JA
958}
959
960static int init_io_u(struct thread_data *td)
961{
962 struct io_u *io_u;
9c42684e 963 unsigned int max_bs, min_write;
2e1df07d 964 int cl_align, i, max_units;
2ae0b204 965 int data_xfer = 1, err;
2e1df07d
JA
966 char *p;
967
968 max_units = td->o.iodepth;
74f4b020 969 max_bs = td_max_bs(td);
9c42684e 970 min_write = td->o.min_bs[DDIR_WRITE];
2e1df07d
JA
971 td->orig_buffer_size = (unsigned long long) max_bs
972 * (unsigned long long) max_units;
973
88045e04 974 if ((td->io_ops->flags & FIO_NOIO) || !(td_read(td) || td_write(td)))
59d8d0f5
JA
975 data_xfer = 0;
976
2ae0b204
JA
977 err = 0;
978 err += io_u_rinit(&td->io_u_requeues, td->o.iodepth);
979 err += io_u_qinit(&td->io_u_freelist, td->o.iodepth);
980 err += io_u_qinit(&td->io_u_all, td->o.iodepth);
981
982 if (err) {
983 log_err("fio: failed setting up IO queues\n");
984 return 1;
985 }
986
fd8a09b8 987 /*
988 * if we may later need to do address alignment, then add any
989 * possible adjustment here so that we don't cause a buffer
990 * overflow later. this adjustment may be too much if we get
991 * lucky and the allocator gives us an aligned address.
992 */
d01612f3
CM
993 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
994 (td->io_ops->flags & FIO_RAWIO))
fd8a09b8 995 td->orig_buffer_size += page_mask + td->o.mem_align;
996
2e1df07d
JA
997 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE) {
998 unsigned long bs;
999
1000 bs = td->orig_buffer_size + td->o.hugepage_size - 1;
1001 td->orig_buffer_size = bs & ~(td->o.hugepage_size - 1);
1002 }
1003
1004 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
1005 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
1006 return 1;
1007 }
1008
59d8d0f5 1009 if (data_xfer && allocate_io_mem(td))
2e1df07d
JA
1010 return 1;
1011
d01612f3 1012 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
2e1df07d
JA
1013 (td->io_ops->flags & FIO_RAWIO))
1014 p = PAGE_ALIGN(td->orig_buffer) + td->o.mem_align;
1015 else
1016 p = td->orig_buffer;
1017
1018 cl_align = os_cache_line_size();
1019
1020 for (i = 0; i < max_units; i++) {
1021 void *ptr;
1022
1023 if (td->terminate)
1024 return 1;
1025
1026 ptr = fio_memalign(cl_align, sizeof(*io_u));
1027 if (!ptr) {
1028 log_err("fio: unable to allocate aligned memory\n");
1029 break;
1030 }
1031
1032 io_u = ptr;
1033 memset(io_u, 0, sizeof(*io_u));
2ae0b204 1034 INIT_FLIST_HEAD(&io_u->verify_list);
2e1df07d
JA
1035 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
1036
59d8d0f5 1037 if (data_xfer) {
2e1df07d
JA
1038 io_u->buf = p;
1039 dprint(FD_MEM, "io_u %p, mem %p\n", io_u, io_u->buf);
1040
1041 if (td_write(td))
9c42684e 1042 io_u_fill_buffer(td, io_u, min_write, max_bs);
2e1df07d
JA
1043 if (td_write(td) && td->o.verify_pattern_bytes) {
1044 /*
1045 * Fill the buffer with the pattern if we are
1046 * going to be doing writes.
1047 */
ce35b1ec 1048 fill_verify_pattern(td, io_u->buf, max_bs, io_u, 0, 0);
2e1df07d
JA
1049 }
1050 }
1051
1052 io_u->index = i;
1053 io_u->flags = IO_U_F_FREE;
2ae0b204
JA
1054 io_u_qpush(&td->io_u_freelist, io_u);
1055
1056 /*
1057 * io_u never leaves this stack, used for iteration of all
1058 * io_u buffers.
1059 */
1060 io_u_qpush(&td->io_u_all, io_u);
c73ed246
JA
1061
1062 if (td->io_ops->io_u_init) {
1063 int ret = td->io_ops->io_u_init(td, io_u);
1064
1065 if (ret) {
1066 log_err("fio: failed to init engine data: %d\n", ret);
1067 return 1;
1068 }
1069 }
1070
2e1df07d
JA
1071 p += max_bs;
1072 }
1073
1074 return 0;
1075}
1076
1077static int switch_ioscheduler(struct thread_data *td)
1078{
1079 char tmp[256], tmp2[128];
1080 FILE *f;
1081 int ret;
1082
1083 if (td->io_ops->flags & FIO_DISKLESSIO)
1084 return 0;
1085
1086 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
1087
1088 f = fopen(tmp, "r+");
1089 if (!f) {
1090 if (errno == ENOENT) {
1091 log_err("fio: os or kernel doesn't support IO scheduler"
1092 " switching\n");
1093 return 0;
1094 }
1095 td_verror(td, errno, "fopen iosched");
1096 return 1;
1097 }
1098
1099 /*
1100 * Set io scheduler.
1101 */
1102 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
1103 if (ferror(f) || ret != 1) {
1104 td_verror(td, errno, "fwrite");
1105 fclose(f);
1106 return 1;
1107 }
1108
1109 rewind(f);
1110
1111 /*
1112 * Read back and check that the selected scheduler is now the default.
1113 */
1114 ret = fread(tmp, 1, sizeof(tmp), f);
1115 if (ferror(f) || ret < 0) {
1116 td_verror(td, errno, "fread");
1117 fclose(f);
1118 return 1;
1119 }
1120
1121 sprintf(tmp2, "[%s]", td->o.ioscheduler);
1122 if (!strstr(tmp, tmp2)) {
1123 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
1124 td_verror(td, EINVAL, "iosched_switch");
1125 fclose(f);
1126 return 1;
1127 }
1128
1129 fclose(f);
1130 return 0;
1131}
1132
1133static int keep_running(struct thread_data *td)
1134{
2e1df07d
JA
1135 if (td->done)
1136 return 0;
1137 if (td->o.time_based)
1138 return 1;
1139 if (td->o.loops) {
1140 td->o.loops--;
1141 return 1;
1142 }
3939fe85
JA
1143 if (exceeds_number_ios(td))
1144 return 0;
26251d8d 1145
ee98e234 1146 if (td->o.size != -1ULL && ddir_rw_sum(td->io_bytes) < td->o.size) {
5bd5f71a
JA
1147 uint64_t diff;
1148
1149 /*
1150 * If the difference is less than the minimum IO size, we
1151 * are done.
1152 */
1153 diff = td->o.size - ddir_rw_sum(td->io_bytes);
74f4b020 1154 if (diff < td_max_bs(td))
5bd5f71a
JA
1155 return 0;
1156
002fe734
JA
1157 if (fio_files_done(td))
1158 return 0;
1159
2e1df07d 1160 return 1;
5bd5f71a 1161 }
2e1df07d
JA
1162
1163 return 0;
1164}
1165
ce486495 1166static int exec_string(struct thread_options *o, const char *string, const char *mode)
2e1df07d 1167{
ce486495 1168 int ret, newlen = strlen(string) + strlen(o->name) + strlen(mode) + 9 + 1;
2e1df07d
JA
1169 char *str;
1170
1171 str = malloc(newlen);
ce486495 1172 sprintf(str, "%s &> %s.%s.txt", string, o->name, mode);
2e1df07d 1173
ce486495 1174 log_info("%s : Saving output of %s in %s.%s.txt\n",o->name, mode, o->name, mode);
2e1df07d
JA
1175 ret = system(str);
1176 if (ret == -1)
1177 log_err("fio: exec of cmd <%s> failed\n", str);
1178
1179 free(str);
1180 return ret;
1181}
1182
62167762
JC
1183/*
1184 * Dry run to compute correct state of numberio for verification.
1185 */
1186static uint64_t do_dry_run(struct thread_data *td)
1187{
1188 uint64_t bytes_done[DDIR_RWDIR_CNT] = { 0, 0, 0 };
1189
1190 td_set_runstate(td, TD_RUNNING);
1191
1192 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
1193 (!flist_empty(&td->trim_list)) || !io_bytes_exceeded(td)) {
1194 struct io_u *io_u;
1195 int ret;
1196
1197 if (td->terminate || td->done)
1198 break;
1199
1200 io_u = get_io_u(td);
1201 if (!io_u)
1202 break;
1203
1204 io_u->flags |= IO_U_F_FLIGHT;
1205 io_u->error = 0;
1206 io_u->resid = 0;
1207 if (ddir_rw(acct_ddir(io_u)))
1208 td->io_issues[acct_ddir(io_u)]++;
1209 if (ddir_rw(io_u->ddir)) {
1210 io_u_mark_depth(td, 1);
1211 td->ts.total_io_u[io_u->ddir]++;
1212 }
1213
2e63e96b
PV
1214 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1215 td->o.do_verify &&
1216 td->o.verify != VERIFY_NONE &&
1217 !td->o.experimental_verify)
1218 log_io_piece(td, io_u);
1219
62167762
JC
1220 ret = io_u_sync_complete(td, io_u, bytes_done);
1221 (void) ret;
1222 }
1223
1224 return bytes_done[DDIR_WRITE] + bytes_done[DDIR_TRIM];
1225}
1226
2e1df07d
JA
1227/*
1228 * Entry point for the thread based jobs. The process based jobs end up
1229 * here as well, after a little setup.
1230 */
1231static void *thread_main(void *data)
1232{
1233 unsigned long long elapsed;
1234 struct thread_data *td = data;
4896473e 1235 struct thread_options *o = &td->o;
2e1df07d
JA
1236 pthread_condattr_t attr;
1237 int clear_state;
28727df7 1238 int ret;
2e1df07d 1239
4896473e 1240 if (!o->use_thread) {
2e1df07d
JA
1241 setsid();
1242 td->pid = getpid();
1243 } else
1244 td->pid = gettid();
1245
334185e9
BC
1246 /*
1247 * fio_time_init() may not have been called yet if running as a server
1248 */
1249 fio_time_init();
1250
4896473e 1251 fio_local_clock_init(o->use_thread);
5d879392 1252
2e1df07d
JA
1253 dprint(FD_PROCESS, "jobs pid=%d started\n", (int) td->pid);
1254
122c7725
JA
1255 if (is_backend)
1256 fio_server_send_start(td);
1257
2e1df07d
JA
1258 INIT_FLIST_HEAD(&td->io_log_list);
1259 INIT_FLIST_HEAD(&td->io_hist_list);
1260 INIT_FLIST_HEAD(&td->verify_list);
1261 INIT_FLIST_HEAD(&td->trim_list);
1ae83d45 1262 INIT_FLIST_HEAD(&td->next_rand_list);
2e1df07d
JA
1263 pthread_mutex_init(&td->io_u_lock, NULL);
1264 td->io_hist_tree = RB_ROOT;
1265
1266 pthread_condattr_init(&attr);
1267 pthread_cond_init(&td->verify_cond, &attr);
1268 pthread_cond_init(&td->free_cond, &attr);
1269
1270 td_set_runstate(td, TD_INITIALIZED);
1271 dprint(FD_MUTEX, "up startup_mutex\n");
1272 fio_mutex_up(startup_mutex);
1273 dprint(FD_MUTEX, "wait on td->mutex\n");
1274 fio_mutex_down(td->mutex);
1275 dprint(FD_MUTEX, "done waiting on td->mutex\n");
1276
2e1df07d
JA
1277 /*
1278 * A new gid requires privilege, so we need to do this before setting
1279 * the uid.
1280 */
4896473e 1281 if (o->gid != -1U && setgid(o->gid)) {
2e1df07d
JA
1282 td_verror(td, errno, "setgid");
1283 goto err;
1284 }
4896473e 1285 if (o->uid != -1U && setuid(o->uid)) {
2e1df07d
JA
1286 td_verror(td, errno, "setuid");
1287 goto err;
1288 }
1289
1290 /*
1291 * If we have a gettimeofday() thread, make sure we exclude that
1292 * thread from this job
1293 */
4896473e
JA
1294 if (o->gtod_cpu)
1295 fio_cpu_clear(&o->cpumask, o->gtod_cpu);
2e1df07d
JA
1296
1297 /*
1298 * Set affinity first, in case it has an impact on the memory
1299 * allocations.
1300 */
4896473e 1301 if (o->cpumask_set) {
c2acfbac 1302 if (o->cpus_allowed_policy == FIO_CPUS_SPLIT) {
30cb4c65 1303 ret = fio_cpus_split(&o->cpumask, td->thread_number - 1);
c2acfbac
JA
1304 if (!ret) {
1305 log_err("fio: no CPUs set\n");
1306 log_err("fio: Try increasing number of available CPUs\n");
1307 td_verror(td, EINVAL, "cpus_split");
1308 goto err;
1309 }
1310 }
28727df7
JA
1311 ret = fio_setaffinity(td->pid, o->cpumask);
1312 if (ret == -1) {
4896473e
JA
1313 td_verror(td, errno, "cpu_set_affinity");
1314 goto err;
1315 }
2e1df07d
JA
1316 }
1317
67bf9823 1318#ifdef CONFIG_LIBNUMA
d0b937ed 1319 /* numa node setup */
4896473e 1320 if (o->numa_cpumask_set || o->numa_memmask_set) {
d0b937ed
YR
1321 int ret;
1322
1323 if (numa_available() < 0) {
1324 td_verror(td, errno, "Does not support NUMA API\n");
1325 goto err;
1326 }
1327
4896473e
JA
1328 if (o->numa_cpumask_set) {
1329 ret = numa_run_on_node_mask(o->numa_cpunodesmask);
d0b937ed
YR
1330 if (ret == -1) {
1331 td_verror(td, errno, \
1332 "numa_run_on_node_mask failed\n");
1333 goto err;
1334 }
1335 }
1336
4896473e 1337 if (o->numa_memmask_set) {
d0b937ed 1338
4896473e 1339 switch (o->numa_mem_mode) {
d0b937ed 1340 case MPOL_INTERLEAVE:
4896473e 1341 numa_set_interleave_mask(o->numa_memnodesmask);
d0b937ed
YR
1342 break;
1343 case MPOL_BIND:
4896473e 1344 numa_set_membind(o->numa_memnodesmask);
d0b937ed
YR
1345 break;
1346 case MPOL_LOCAL:
1347 numa_set_localalloc();
1348 break;
1349 case MPOL_PREFERRED:
4896473e 1350 numa_set_preferred(o->numa_mem_prefer_node);
d0b937ed
YR
1351 break;
1352 case MPOL_DEFAULT:
1353 default:
1354 break;
1355 }
1356
1357 }
1358 }
1359#endif
1360
9a3f1100
JA
1361 if (fio_pin_memory(td))
1362 goto err;
1363
2e1df07d
JA
1364 /*
1365 * May alter parameters that init_io_u() will use, so we need to
1366 * do this first.
1367 */
1368 if (init_iolog(td))
1369 goto err;
1370
1371 if (init_io_u(td))
1372 goto err;
1373
4896473e 1374 if (o->verify_async && verify_async_init(td))
2e1df07d
JA
1375 goto err;
1376
28727df7
JA
1377 if (o->ioprio) {
1378 ret = ioprio_set(IOPRIO_WHO_PROCESS, 0, o->ioprio_class, o->ioprio);
1379 if (ret == -1) {
2e1df07d
JA
1380 td_verror(td, errno, "ioprio_set");
1381 goto err;
1382 }
1383 }
1384
4896473e 1385 if (o->cgroup && cgroup_setup(td, cgroup_list, &cgroup_mnt))
2e1df07d
JA
1386 goto err;
1387
649c10c5 1388 errno = 0;
4896473e 1389 if (nice(o->nice) == -1 && errno != 0) {
2e1df07d
JA
1390 td_verror(td, errno, "nice");
1391 goto err;
1392 }
1393
4896473e 1394 if (o->ioscheduler && switch_ioscheduler(td))
2e1df07d
JA
1395 goto err;
1396
4896473e 1397 if (!o->create_serialize && setup_files(td))
2e1df07d
JA
1398 goto err;
1399
1400 if (td_io_init(td))
1401 goto err;
1402
1403 if (init_random_map(td))
1404 goto err;
1405
ce486495 1406 if (o->exec_prerun && exec_string(o, o->exec_prerun, (const char *)"prerun"))
4896473e 1407 goto err;
2e1df07d 1408
4896473e 1409 if (o->pre_read) {
2e1df07d
JA
1410 if (pre_read_files(td) < 0)
1411 goto err;
1412 }
1413
dc5bfbb2
JA
1414 fio_verify_init(td);
1415
2e1df07d 1416 fio_gettime(&td->epoch, NULL);
44404c5a 1417 fio_getrusage(&td->ru_start);
2e1df07d
JA
1418 clear_state = 0;
1419 while (keep_running(td)) {
100f49f1
JA
1420 uint64_t verify_bytes;
1421
2e1df07d
JA
1422 fio_gettime(&td->start, NULL);
1423 memcpy(&td->bw_sample_time, &td->start, sizeof(td->start));
1424 memcpy(&td->iops_sample_time, &td->start, sizeof(td->start));
1425 memcpy(&td->tv_cache, &td->start, sizeof(td->start));
1426
4896473e
JA
1427 if (o->ratemin[DDIR_READ] || o->ratemin[DDIR_WRITE] ||
1428 o->ratemin[DDIR_TRIM]) {
6eaf09d6 1429 memcpy(&td->lastrate[DDIR_READ], &td->bw_sample_time,
2e1df07d 1430 sizeof(td->bw_sample_time));
6eaf09d6
SL
1431 memcpy(&td->lastrate[DDIR_WRITE], &td->bw_sample_time,
1432 sizeof(td->bw_sample_time));
1433 memcpy(&td->lastrate[DDIR_TRIM], &td->bw_sample_time,
2e1df07d
JA
1434 sizeof(td->bw_sample_time));
1435 }
1436
1437 if (clear_state)
1438 clear_io_state(td);
1439
1440 prune_io_piece_log(td);
1441
62167762
JC
1442 if (td->o.verify_only && (td_write(td) || td_rw(td)))
1443 verify_bytes = do_dry_run(td);
1444 else
1445 verify_bytes = do_io(td);
2e1df07d
JA
1446
1447 clear_state = 1;
1448
1449 if (td_read(td) && td->io_bytes[DDIR_READ]) {
1450 elapsed = utime_since_now(&td->start);
1451 td->ts.runtime[DDIR_READ] += elapsed;
1452 }
1453 if (td_write(td) && td->io_bytes[DDIR_WRITE]) {
1454 elapsed = utime_since_now(&td->start);
1455 td->ts.runtime[DDIR_WRITE] += elapsed;
1456 }
6eaf09d6
SL
1457 if (td_trim(td) && td->io_bytes[DDIR_TRIM]) {
1458 elapsed = utime_since_now(&td->start);
1459 td->ts.runtime[DDIR_TRIM] += elapsed;
1460 }
2e1df07d
JA
1461
1462 if (td->error || td->terminate)
1463 break;
1464
4896473e
JA
1465 if (!o->do_verify ||
1466 o->verify == VERIFY_NONE ||
2e1df07d
JA
1467 (td->io_ops->flags & FIO_UNIDIR))
1468 continue;
1469
1470 clear_io_state(td);
1471
1472 fio_gettime(&td->start, NULL);
1473
100f49f1 1474 do_verify(td, verify_bytes);
2e1df07d
JA
1475
1476 td->ts.runtime[DDIR_READ] += utime_since_now(&td->start);
1477
1478 if (td->error || td->terminate)
1479 break;
1480 }
1481
1482 update_rusage_stat(td);
6eaf09d6
SL
1483 td->ts.runtime[DDIR_READ] = (td->ts.runtime[DDIR_READ] + 999) / 1000;
1484 td->ts.runtime[DDIR_WRITE] = (td->ts.runtime[DDIR_WRITE] + 999) / 1000;
1485 td->ts.runtime[DDIR_TRIM] = (td->ts.runtime[DDIR_TRIM] + 999) / 1000;
2e1df07d 1486 td->ts.total_run_time = mtime_since_now(&td->epoch);
6eaf09d6
SL
1487 td->ts.io_bytes[DDIR_READ] = td->io_bytes[DDIR_READ];
1488 td->ts.io_bytes[DDIR_WRITE] = td->io_bytes[DDIR_WRITE];
1489 td->ts.io_bytes[DDIR_TRIM] = td->io_bytes[DDIR_TRIM];
2e1df07d 1490
9a3f1100
JA
1491 fio_unpin_memory(td);
1492
2e1df07d 1493 fio_mutex_down(writeout_mutex);
99007068 1494 finalize_logs(td);
2e1df07d 1495 if (td->bw_log) {
4896473e 1496 if (o->bw_log_file) {
2e1df07d 1497 finish_log_named(td, td->bw_log,
4896473e 1498 o->bw_log_file, "bw");
2e1df07d
JA
1499 } else
1500 finish_log(td, td->bw_log, "bw");
1501 }
1502 if (td->lat_log) {
4896473e 1503 if (o->lat_log_file) {
2e1df07d 1504 finish_log_named(td, td->lat_log,
4896473e 1505 o->lat_log_file, "lat");
2e1df07d
JA
1506 } else
1507 finish_log(td, td->lat_log, "lat");
1508 }
1509 if (td->slat_log) {
4896473e 1510 if (o->lat_log_file) {
2e1df07d 1511 finish_log_named(td, td->slat_log,
4896473e 1512 o->lat_log_file, "slat");
2e1df07d
JA
1513 } else
1514 finish_log(td, td->slat_log, "slat");
1515 }
1516 if (td->clat_log) {
4896473e 1517 if (o->lat_log_file) {
2e1df07d 1518 finish_log_named(td, td->clat_log,
4896473e 1519 o->lat_log_file, "clat");
2e1df07d
JA
1520 } else
1521 finish_log(td, td->clat_log, "clat");
1522 }
1523 if (td->iops_log) {
4896473e 1524 if (o->iops_log_file) {
2e1df07d 1525 finish_log_named(td, td->iops_log,
4896473e 1526 o->iops_log_file, "iops");
2e1df07d
JA
1527 } else
1528 finish_log(td, td->iops_log, "iops");
1529 }
1530
1531 fio_mutex_up(writeout_mutex);
4896473e 1532 if (o->exec_postrun)
ce486495 1533 exec_string(o, o->exec_postrun, (const char *)"postrun");
2e1df07d
JA
1534
1535 if (exitall_on_terminate)
1536 fio_terminate_threads(td->groupid);
1537
1538err:
1539 if (td->error)
1540 log_info("fio: pid=%d, err=%d/%s\n", (int) td->pid, td->error,
1541 td->verror);
1542
4896473e 1543 if (o->verify_async)
2e1df07d
JA
1544 verify_async_exit(td);
1545
1546 close_and_free_files(td);
2e1df07d 1547 cleanup_io_u(td);
32dbca2c 1548 close_ioengine(td);
2e1df07d
JA
1549 cgroup_shutdown(td, &cgroup_mnt);
1550
4896473e
JA
1551 if (o->cpumask_set) {
1552 int ret = fio_cpuset_exit(&o->cpumask);
2e1df07d
JA
1553
1554 td_verror(td, ret, "fio_cpuset_exit");
1555 }
1556
1557 /*
1558 * do this very late, it will log file closing as well
1559 */
4896473e 1560 if (o->write_iolog_file)
2e1df07d
JA
1561 write_iolog_close(td);
1562
c97f1ad6
JA
1563 fio_mutex_remove(td->rusage_sem);
1564 td->rusage_sem = NULL;
1565
ea66e04f
JA
1566 fio_mutex_remove(td->mutex);
1567 td->mutex = NULL;
1568
2e1df07d 1569 td_set_runstate(td, TD_EXITED);
e43606c2 1570 return (void *) (uintptr_t) td->error;
2e1df07d
JA
1571}
1572
1573
1574/*
1575 * We cannot pass the td data into a forked process, so attach the td and
1576 * pass it to the thread worker.
1577 */
1578static int fork_main(int shmid, int offset)
1579{
1580 struct thread_data *td;
1581 void *data, *ret;
1582
1583#ifndef __hpux
1584 data = shmat(shmid, NULL, 0);
1585 if (data == (void *) -1) {
1586 int __err = errno;
1587
1588 perror("shmat");
1589 return __err;
1590 }
1591#else
1592 /*
1593 * HP-UX inherits shm mappings?
1594 */
1595 data = threads;
1596#endif
1597
1598 td = data + offset * sizeof(struct thread_data);
1599 ret = thread_main(td);
1600 shmdt(data);
e43606c2 1601 return (int) (uintptr_t) ret;
2e1df07d
JA
1602}
1603
1604/*
1605 * Run over the job map and reap the threads that have exited, if any.
1606 */
1607static void reap_threads(unsigned int *nr_running, unsigned int *t_rate,
1608 unsigned int *m_rate)
1609{
1610 struct thread_data *td;
1611 unsigned int cputhreads, realthreads, pending;
1612 int i, status, ret;
1613
1614 /*
1615 * reap exited threads (TD_EXITED -> TD_REAPED)
1616 */
1617 realthreads = pending = cputhreads = 0;
1618 for_each_td(td, i) {
1619 int flags = 0;
1620
1621 /*
1622 * ->io_ops is NULL for a thread that has closed its
1623 * io engine
1624 */
1625 if (td->io_ops && !strcmp(td->io_ops->name, "cpuio"))
1626 cputhreads++;
1627 else
1628 realthreads++;
1629
1630 if (!td->pid) {
1631 pending++;
1632 continue;
1633 }
1634 if (td->runstate == TD_REAPED)
1635 continue;
1636 if (td->o.use_thread) {
1637 if (td->runstate == TD_EXITED) {
1638 td_set_runstate(td, TD_REAPED);
1639 goto reaped;
1640 }
1641 continue;
1642 }
1643
1644 flags = WNOHANG;
1645 if (td->runstate == TD_EXITED)
1646 flags = 0;
1647
1648 /*
1649 * check if someone quit or got killed in an unusual way
1650 */
1651 ret = waitpid(td->pid, &status, flags);
1652 if (ret < 0) {
1653 if (errno == ECHILD) {
1654 log_err("fio: pid=%d disappeared %d\n",
1655 (int) td->pid, td->runstate);
a5e371a6 1656 td->sig = ECHILD;
2e1df07d
JA
1657 td_set_runstate(td, TD_REAPED);
1658 goto reaped;
1659 }
1660 perror("waitpid");
1661 } else if (ret == td->pid) {
1662 if (WIFSIGNALED(status)) {
1663 int sig = WTERMSIG(status);
1664
36d80bc7 1665 if (sig != SIGTERM && sig != SIGUSR2)
2e1df07d
JA
1666 log_err("fio: pid=%d, got signal=%d\n",
1667 (int) td->pid, sig);
a5e371a6 1668 td->sig = sig;
2e1df07d
JA
1669 td_set_runstate(td, TD_REAPED);
1670 goto reaped;
1671 }
1672 if (WIFEXITED(status)) {
1673 if (WEXITSTATUS(status) && !td->error)
1674 td->error = WEXITSTATUS(status);
1675
1676 td_set_runstate(td, TD_REAPED);
1677 goto reaped;
1678 }
1679 }
1680
1681 /*
1682 * thread is not dead, continue
1683 */
1684 pending++;
1685 continue;
1686reaped:
1687 (*nr_running)--;
342f4be4
JA
1688 (*m_rate) -= ddir_rw_sum(td->o.ratemin);
1689 (*t_rate) -= ddir_rw_sum(td->o.rate);
2e1df07d
JA
1690 if (!td->pid)
1691 pending--;
1692
1693 if (td->error)
1694 exit_value++;
1695
1696 done_secs += mtime_since_now(&td->epoch) / 1000;
4a88752a 1697 profile_td_exit(td);
2e1df07d
JA
1698 }
1699
1700 if (*nr_running == cputhreads && !pending && realthreads)
1701 fio_terminate_threads(TERMINATE_ALL);
1702}
1703
06464907
JA
1704static void do_usleep(unsigned int usecs)
1705{
1706 check_for_running_stats();
1707 usleep(usecs);
1708}
1709
2e1df07d
JA
1710/*
1711 * Main function for kicking off and reaping jobs, as needed.
1712 */
1713static void run_threads(void)
1714{
1715 struct thread_data *td;
2e1df07d 1716 unsigned int i, todo, nr_running, m_rate, t_rate, nr_started;
0de5b26f 1717 uint64_t spent;
2e1df07d 1718
2e1df07d
JA
1719 if (fio_gtod_offload && fio_start_gtod_thread())
1720 return;
334185e9 1721
f2a2ce0e 1722 fio_idle_prof_init();
2e1df07d
JA
1723
1724 set_sig_handlers();
1725
3a5f6bde
JA
1726 nr_thread = nr_process = 0;
1727 for_each_td(td, i) {
1728 if (td->o.use_thread)
1729 nr_thread++;
1730 else
1731 nr_process++;
1732 }
1733
f3afa57e 1734 if (output_format == FIO_OUTPUT_NORMAL) {
2e1df07d
JA
1735 log_info("Starting ");
1736 if (nr_thread)
1737 log_info("%d thread%s", nr_thread,
1738 nr_thread > 1 ? "s" : "");
1739 if (nr_process) {
1740 if (nr_thread)
1741 log_info(" and ");
1742 log_info("%d process%s", nr_process,
1743 nr_process > 1 ? "es" : "");
1744 }
1745 log_info("\n");
1746 fflush(stdout);
1747 }
1748
1749 todo = thread_number;
1750 nr_running = 0;
1751 nr_started = 0;
1752 m_rate = t_rate = 0;
1753
1754 for_each_td(td, i) {
1755 print_status_init(td->thread_number - 1);
1756
1757 if (!td->o.create_serialize)
1758 continue;
1759
1760 /*
1761 * do file setup here so it happens sequentially,
1762 * we don't want X number of threads getting their
1763 * client data interspersed on disk
1764 */
1765 if (setup_files(td)) {
1766 exit_value++;
1767 if (td->error)
1768 log_err("fio: pid=%d, err=%d/%s\n",
1769 (int) td->pid, td->error, td->verror);
1770 td_set_runstate(td, TD_REAPED);
1771 todo--;
1772 } else {
1773 struct fio_file *f;
1774 unsigned int j;
1775
1776 /*
1777 * for sharing to work, each job must always open
1778 * its own files. so close them, if we opened them
1779 * for creation
1780 */
1781 for_each_file(td, f, j) {
1782 if (fio_file_open(f))
1783 td_io_close_file(td, f);
1784 }
1785 }
1786 }
1787
f2a2ce0e
HL
1788 /* start idle threads before io threads start to run */
1789 fio_idle_prof_start();
1790
2e1df07d
JA
1791 set_genesis_time();
1792
1793 while (todo) {
1794 struct thread_data *map[REAL_MAX_JOBS];
1795 struct timeval this_start;
1796 int this_jobs = 0, left;
1797
1798 /*
1799 * create threads (TD_NOT_CREATED -> TD_CREATED)
1800 */
1801 for_each_td(td, i) {
1802 if (td->runstate != TD_NOT_CREATED)
1803 continue;
1804
1805 /*
1806 * never got a chance to start, killed by other
1807 * thread for some reason
1808 */
1809 if (td->terminate) {
1810 todo--;
1811 continue;
1812 }
1813
1814 if (td->o.start_delay) {
0de5b26f 1815 spent = utime_since_genesis();
2e1df07d 1816
74454ce4 1817 if (td->o.start_delay > spent)
2e1df07d
JA
1818 continue;
1819 }
1820
1821 if (td->o.stonewall && (nr_started || nr_running)) {
1822 dprint(FD_PROCESS, "%s: stonewall wait\n",
1823 td->o.name);
1824 break;
1825 }
1826
1827 init_disk_util(td);
1828
c97f1ad6
JA
1829 td->rusage_sem = fio_mutex_init(FIO_MUTEX_LOCKED);
1830 td->update_rusage = 0;
1831
2e1df07d
JA
1832 /*
1833 * Set state to created. Thread will transition
1834 * to TD_INITIALIZED when it's done setting up.
1835 */
1836 td_set_runstate(td, TD_CREATED);
1837 map[this_jobs++] = td;
1838 nr_started++;
1839
1840 if (td->o.use_thread) {
1841 int ret;
1842
1843 dprint(FD_PROCESS, "will pthread_create\n");
1844 ret = pthread_create(&td->thread, NULL,
1845 thread_main, td);
1846 if (ret) {
1847 log_err("pthread_create: %s\n",
1848 strerror(ret));
1849 nr_started--;
1850 break;
1851 }
1852 ret = pthread_detach(td->thread);
1853 if (ret)
1854 log_err("pthread_detach: %s",
1855 strerror(ret));
1856 } else {
1857 pid_t pid;
1858 dprint(FD_PROCESS, "will fork\n");
1859 pid = fork();
1860 if (!pid) {
1861 int ret = fork_main(shm_id, i);
1862
1863 _exit(ret);
1864 } else if (i == fio_debug_jobno)
1865 *fio_debug_jobp = pid;
1866 }
1867 dprint(FD_MUTEX, "wait on startup_mutex\n");
1868 if (fio_mutex_down_timeout(startup_mutex, 10)) {
1869 log_err("fio: job startup hung? exiting.\n");
1870 fio_terminate_threads(TERMINATE_ALL);
1871 fio_abort = 1;
1872 nr_started--;
1873 break;
1874 }
1875 dprint(FD_MUTEX, "done waiting on startup_mutex\n");
1876 }
1877
1878 /*
1879 * Wait for the started threads to transition to
1880 * TD_INITIALIZED.
1881 */
1882 fio_gettime(&this_start, NULL);
1883 left = this_jobs;
1884 while (left && !fio_abort) {
1885 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
1886 break;
1887
06464907 1888 do_usleep(100000);
2e1df07d
JA
1889
1890 for (i = 0; i < this_jobs; i++) {
1891 td = map[i];
1892 if (!td)
1893 continue;
1894 if (td->runstate == TD_INITIALIZED) {
1895 map[i] = NULL;
1896 left--;
1897 } else if (td->runstate >= TD_EXITED) {
1898 map[i] = NULL;
1899 left--;
1900 todo--;
1901 nr_running++; /* work-around... */
1902 }
1903 }
1904 }
1905
1906 if (left) {
4e87c37a
JA
1907 log_err("fio: %d job%s failed to start\n", left,
1908 left > 1 ? "s" : "");
2e1df07d
JA
1909 for (i = 0; i < this_jobs; i++) {
1910 td = map[i];
1911 if (!td)
1912 continue;
1913 kill(td->pid, SIGTERM);
1914 }
1915 break;
1916 }
1917
1918 /*
1919 * start created threads (TD_INITIALIZED -> TD_RUNNING).
1920 */
1921 for_each_td(td, i) {
1922 if (td->runstate != TD_INITIALIZED)
1923 continue;
1924
1925 if (in_ramp_time(td))
1926 td_set_runstate(td, TD_RAMP);
1927 else
1928 td_set_runstate(td, TD_RUNNING);
1929 nr_running++;
1930 nr_started--;
342f4be4
JA
1931 m_rate += ddir_rw_sum(td->o.ratemin);
1932 t_rate += ddir_rw_sum(td->o.rate);
2e1df07d
JA
1933 todo--;
1934 fio_mutex_up(td->mutex);
1935 }
1936
1937 reap_threads(&nr_running, &t_rate, &m_rate);
1938
122c7725 1939 if (todo)
06464907 1940 do_usleep(100000);
2e1df07d
JA
1941 }
1942
1943 while (nr_running) {
1944 reap_threads(&nr_running, &t_rate, &m_rate);
06464907 1945 do_usleep(10000);
2e1df07d
JA
1946 }
1947
f2a2ce0e
HL
1948 fio_idle_prof_stop();
1949
2e1df07d 1950 update_io_ticks();
2e1df07d
JA
1951}
1952
9ec7779f
JA
1953void wait_for_disk_thread_exit(void)
1954{
1955 fio_mutex_down(disk_thread_mutex);
1956}
1957
27357187
JA
1958static void free_disk_util(void)
1959{
1960 disk_util_start_exit();
1961 wait_for_disk_thread_exit();
1962 disk_util_prune_entries();
1963}
1964
2e1df07d
JA
1965static void *disk_thread_main(void *data)
1966{
9ec7779f
JA
1967 int ret = 0;
1968
2e1df07d
JA
1969 fio_mutex_up(startup_mutex);
1970
9ec7779f 1971 while (threads && !ret) {
2e1df07d
JA
1972 usleep(DISK_UTIL_MSEC * 1000);
1973 if (!threads)
1974 break;
9ec7779f 1975 ret = update_io_ticks();
2e1df07d
JA
1976
1977 if (!is_backend)
1978 print_thread_status();
1979 }
1980
9ec7779f 1981 fio_mutex_up(disk_thread_mutex);
2e1df07d
JA
1982 return NULL;
1983}
1984
1985static int create_disk_util_thread(void)
1986{
1987 int ret;
1988
9ec7779f
JA
1989 setup_disk_util();
1990
521da527 1991 disk_thread_mutex = fio_mutex_init(FIO_MUTEX_LOCKED);
9ec7779f 1992
2e1df07d
JA
1993 ret = pthread_create(&disk_util_thread, NULL, disk_thread_main, NULL);
1994 if (ret) {
9ec7779f 1995 fio_mutex_remove(disk_thread_mutex);
2e1df07d
JA
1996 log_err("Can't create disk util thread: %s\n", strerror(ret));
1997 return 1;
1998 }
1999
2000 ret = pthread_detach(disk_util_thread);
2001 if (ret) {
9ec7779f 2002 fio_mutex_remove(disk_thread_mutex);
2e1df07d
JA
2003 log_err("Can't detatch disk util thread: %s\n", strerror(ret));
2004 return 1;
2005 }
2006
2007 dprint(FD_MUTEX, "wait on startup_mutex\n");
2008 fio_mutex_down(startup_mutex);
2009 dprint(FD_MUTEX, "done waiting on startup_mutex\n");
2010 return 0;
2011}
2012
2e1df07d
JA
2013int fio_backend(void)
2014{
2015 struct thread_data *td;
2016 int i;
2017
2018 if (exec_profile) {
2019 if (load_profile(exec_profile))
2020 return 1;
2021 free(exec_profile);
2022 exec_profile = NULL;
2023 }
2024 if (!thread_number)
2025 return 0;
2026
2027 if (write_bw_log) {
5a812f9b
JA
2028 setup_log(&agg_io_log[DDIR_READ], 0, IO_LOG_TYPE_BW);
2029 setup_log(&agg_io_log[DDIR_WRITE], 0, IO_LOG_TYPE_BW);
2030 setup_log(&agg_io_log[DDIR_TRIM], 0, IO_LOG_TYPE_BW);
2e1df07d
JA
2031 }
2032
521da527 2033 startup_mutex = fio_mutex_init(FIO_MUTEX_LOCKED);
2e1df07d
JA
2034 if (startup_mutex == NULL)
2035 return 1;
521da527 2036 writeout_mutex = fio_mutex_init(FIO_MUTEX_UNLOCKED);
2e1df07d
JA
2037 if (writeout_mutex == NULL)
2038 return 1;
2039
2040 set_genesis_time();
cef9175e 2041 stat_init();
2e1df07d
JA
2042 create_disk_util_thread();
2043
2044 cgroup_list = smalloc(sizeof(*cgroup_list));
2045 INIT_FLIST_HEAD(cgroup_list);
2046
2047 run_threads();
2048
2049 if (!fio_abort) {
2050 show_run_stats();
2051 if (write_bw_log) {
2052 __finish_log(agg_io_log[DDIR_READ], "agg-read_bw.log");
2053 __finish_log(agg_io_log[DDIR_WRITE],
2054 "agg-write_bw.log");
6eaf09d6
SL
2055 __finish_log(agg_io_log[DDIR_TRIM],
2056 "agg-write_bw.log");
2e1df07d
JA
2057 }
2058 }
2059
2060 for_each_td(td, i)
2061 fio_options_free(td);
2062
a462baef 2063 free_disk_util();
2e1df07d
JA
2064 cgroup_kill(cgroup_list);
2065 sfree(cgroup_list);
2066 sfree(cgroup_mnt);
2067
2068 fio_mutex_remove(startup_mutex);
2069 fio_mutex_remove(writeout_mutex);
9ec7779f 2070 fio_mutex_remove(disk_thread_mutex);
cef9175e 2071 stat_exit();
2e1df07d
JA
2072 return exit_value;
2073}