options: fix buffer overrun
[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
fa07eaa6 21 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
2e1df07d
JA
22 *
23 */
24#include <unistd.h>
2e1df07d 25#include <string.h>
2e1df07d 26#include <signal.h>
2e1df07d 27#include <assert.h>
e43606c2 28#include <inttypes.h>
2e1df07d
JA
29#include <sys/stat.h>
30#include <sys/wait.h>
ff6bb260 31#include <math.h>
c06379a6 32#include <pthread.h>
2e1df07d
JA
33
34#include "fio.h"
2e1df07d
JA
35#include "smalloc.h"
36#include "verify.h"
2e1df07d
JA
37#include "diskutil.h"
38#include "cgroup.h"
39#include "profile.h"
40#include "lib/rand.h"
f7690c4a 41#include "lib/memalign.h"
2e1df07d 42#include "server.h"
44404c5a 43#include "lib/getrusage.h"
f2a2ce0e 44#include "idletime.h"
002fe734 45#include "err.h"
a9da8ab2 46#include "workqueue.h"
e81ecca3 47#include "lib/mountcheck.h"
40511301 48#include "rate-submit.h"
a39fb9ea 49#include "helper_thread.h"
ae626d4e 50#include "pshared.h"
07776127 51#include "zone-dist.h"
2e1df07d 52
971caeb1 53static struct fio_sem *startup_sem;
2e1df07d 54static struct flist_head *cgroup_list;
c3dc516a 55static struct cgroup_mnt *cgroup_mnt;
2e1df07d 56static int exit_value;
f1867a7f 57static volatile bool fio_abort;
3a5f6bde
JA
58static unsigned int nr_process = 0;
59static unsigned int nr_thread = 0;
2e1df07d 60
6eaf09d6 61struct io_log *agg_io_log[DDIR_RWDIR_CNT];
2e1df07d 62
a3efc919
JA
63int groupid = 0;
64unsigned int thread_number = 0;
2fbe1e19
JA
65unsigned int nr_segments = 0;
66unsigned int cur_segment = 0;
108fea77 67unsigned int stat_number = 0;
a3efc919
JA
68int temp_stall_ts;
69unsigned long done_secs = 0;
a38c70a8
BVA
70#ifdef PTHREAD_ERRORCHECK_MUTEX_INITIALIZER_NP
71pthread_mutex_t overlap_check = PTHREAD_ERRORCHECK_MUTEX_INITIALIZER_NP;
72#else
c06379a6 73pthread_mutex_t overlap_check = PTHREAD_MUTEX_INITIALIZER;
a38c70a8 74#endif
a47591e4 75
2e1df07d
JA
76#define JOB_START_TIMEOUT (5 * 1000)
77
78static void sig_int(int sig)
79{
2fbe1e19 80 if (nr_segments) {
2e1df07d
JA
81 if (is_backend)
82 fio_server_got_signal(sig);
83 else {
84 log_info("\nfio: terminating on signal %d\n", sig);
e411c301 85 log_info_flush();
2e1df07d
JA
86 exit_value = 128;
87 }
88
64402a8a 89 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
2e1df07d
JA
90 }
91}
92
d2235e56 93void sig_show_status(int sig)
4c6d91e8
JA
94{
95 show_running_run_stats();
96}
97
2e1df07d
JA
98static void set_sig_handlers(void)
99{
100 struct sigaction act;
101
102 memset(&act, 0, sizeof(act));
103 act.sa_handler = sig_int;
104 act.sa_flags = SA_RESTART;
105 sigaction(SIGINT, &act, NULL);
106
107 memset(&act, 0, sizeof(act));
108 act.sa_handler = sig_int;
109 act.sa_flags = SA_RESTART;
110 sigaction(SIGTERM, &act, NULL);
111
2f694507
BC
112/* Windows uses SIGBREAK as a quit signal from other applications */
113#ifdef WIN32
114 memset(&act, 0, sizeof(act));
115 act.sa_handler = sig_int;
116 act.sa_flags = SA_RESTART;
117 sigaction(SIGBREAK, &act, NULL);
118#endif
119
4c6d91e8
JA
120 memset(&act, 0, sizeof(act));
121 act.sa_handler = sig_show_status;
122 act.sa_flags = SA_RESTART;
123 sigaction(SIGUSR1, &act, NULL);
124
2e1df07d
JA
125 if (is_backend) {
126 memset(&act, 0, sizeof(act));
127 act.sa_handler = sig_int;
128 act.sa_flags = SA_RESTART;
129 sigaction(SIGPIPE, &act, NULL);
130 }
131}
132
133/*
134 * Check if we are above the minimum rate given.
135 */
8b6a404c 136static bool __check_min_rate(struct thread_data *td, struct timespec *now,
e39c0676 137 enum fio_ddir ddir)
2e1df07d
JA
138{
139 unsigned long long bytes = 0;
140 unsigned long iops = 0;
141 unsigned long spent;
140a6888
SB
142 unsigned long long rate;
143 unsigned long long ratemin = 0;
2e1df07d
JA
144 unsigned int rate_iops = 0;
145 unsigned int rate_iops_min = 0;
146
147 assert(ddir_rw(ddir));
148
149 if (!td->o.ratemin[ddir] && !td->o.rate_iops_min[ddir])
e39c0676 150 return false;
2e1df07d
JA
151
152 /*
153 * allow a 2 second settle period in the beginning
154 */
155 if (mtime_since(&td->start, now) < 2000)
e39c0676 156 return false;
2e1df07d
JA
157
158 iops += td->this_io_blocks[ddir];
159 bytes += td->this_io_bytes[ddir];
160 ratemin += td->o.ratemin[ddir];
161 rate_iops += td->o.rate_iops[ddir];
162 rate_iops_min += td->o.rate_iops_min[ddir];
163
164 /*
165 * if rate blocks is set, sample is running
166 */
167 if (td->rate_bytes[ddir] || td->rate_blocks[ddir]) {
168 spent = mtime_since(&td->lastrate[ddir], now);
169 if (spent < td->o.ratecycle)
e39c0676 170 return false;
2e1df07d 171
20e37e4a 172 if (td->o.rate[ddir] || td->o.ratemin[ddir]) {
2e1df07d
JA
173 /*
174 * check bandwidth specified rate
175 */
176 if (bytes < td->rate_bytes[ddir]) {
140a6888 177 log_err("%s: rate_min=%lluB/s not met, only transferred %lluB\n",
420b104a 178 td->o.name, ratemin, bytes);
e39c0676 179 return true;
2e1df07d 180 } else {
49cba9b3
JA
181 if (spent)
182 rate = ((bytes - td->rate_bytes[ddir]) * 1000) / spent;
183 else
184 rate = 0;
185
2e1df07d
JA
186 if (rate < ratemin ||
187 bytes < td->rate_bytes[ddir]) {
140a6888 188 log_err("%s: rate_min=%lluB/s not met, got %lluB/s\n",
420b104a 189 td->o.name, ratemin, rate);
e39c0676 190 return true;
2e1df07d
JA
191 }
192 }
193 } else {
194 /*
195 * checks iops specified rate
196 */
197 if (iops < rate_iops) {
420b104a
RE
198 log_err("%s: rate_iops_min=%u not met, only performed %lu IOs\n",
199 td->o.name, rate_iops, iops);
e39c0676 200 return true;
2e1df07d 201 } else {
4c707a3b
JA
202 if (spent)
203 rate = ((iops - td->rate_blocks[ddir]) * 1000) / spent;
204 else
205 rate = 0;
206
2e1df07d
JA
207 if (rate < rate_iops_min ||
208 iops < td->rate_blocks[ddir]) {
140a6888 209 log_err("%s: rate_iops_min=%u not met, got %llu IOPS\n",
420b104a 210 td->o.name, rate_iops_min, rate);
e39c0676 211 return true;
2e1df07d
JA
212 }
213 }
214 }
215 }
216
217 td->rate_bytes[ddir] = bytes;
218 td->rate_blocks[ddir] = iops;
219 memcpy(&td->lastrate[ddir], now, sizeof(*now));
e39c0676 220 return false;
2e1df07d
JA
221}
222
8b6a404c 223static bool check_min_rate(struct thread_data *td, struct timespec *now)
2e1df07d 224{
e39c0676 225 bool ret = false;
2e1df07d 226
dde39f8c
AD
227 for_each_rw_ddir(ddir) {
228 if (td->bytes_done[ddir])
229 ret |= __check_min_rate(td, now, ddir);
230 }
2e1df07d
JA
231
232 return ret;
233}
234
235/*
236 * When job exits, we can cancel the in-flight IO if we are using async
237 * io. Attempt to do so.
238 */
239static void cleanup_pending_aio(struct thread_data *td)
240{
2e1df07d
JA
241 int r;
242
243 /*
244 * get immediately available events, if any
245 */
55312f9f 246 r = io_u_queued_complete(td, 0);
2e1df07d
JA
247
248 /*
249 * now cancel remaining active events
250 */
251 if (td->io_ops->cancel) {
2ae0b204
JA
252 struct io_u *io_u;
253 int i;
2e1df07d 254
2ae0b204
JA
255 io_u_qiter(&td->io_u_all, io_u, i) {
256 if (io_u->flags & IO_U_F_FLIGHT) {
2e1df07d
JA
257 r = td->io_ops->cancel(td, io_u);
258 if (!r)
259 put_io_u(td, io_u);
260 }
261 }
262 }
263
264 if (td->cur_depth)
55312f9f 265 r = io_u_queued_complete(td, td->cur_depth);
2e1df07d
JA
266}
267
268/*
269 * Helper to handle the final sync of a file. Works just like the normal
270 * io path, just does everything sync.
271 */
e39c0676 272static bool fio_io_sync(struct thread_data *td, struct fio_file *f)
2e1df07d
JA
273{
274 struct io_u *io_u = __get_io_u(td);
d3b07186 275 enum fio_q_status ret;
2e1df07d
JA
276
277 if (!io_u)
e39c0676 278 return true;
2e1df07d
JA
279
280 io_u->ddir = DDIR_SYNC;
281 io_u->file = f;
00615bfb 282 io_u_set(td, io_u, IO_U_F_NO_FILE_PUT);
2e1df07d
JA
283
284 if (td_io_prep(td, io_u)) {
285 put_io_u(td, io_u);
e39c0676 286 return true;
2e1df07d
JA
287 }
288
289requeue:
290 ret = td_io_queue(td, io_u);
18f6165e
BVA
291 switch (ret) {
292 case FIO_Q_QUEUED:
a80cb54b 293 td_io_commit(td);
55312f9f 294 if (io_u_queued_complete(td, 1) < 0)
e39c0676 295 return true;
18f6165e
BVA
296 break;
297 case FIO_Q_COMPLETED:
2e1df07d
JA
298 if (io_u->error) {
299 td_verror(td, io_u->error, "td_io_queue");
e39c0676 300 return true;
2e1df07d
JA
301 }
302
55312f9f 303 if (io_u_sync_complete(td, io_u) < 0)
e39c0676 304 return true;
18f6165e
BVA
305 break;
306 case FIO_Q_BUSY:
a80cb54b 307 td_io_commit(td);
2e1df07d
JA
308 goto requeue;
309 }
310
e39c0676 311 return false;
2e1df07d 312}
a3efc919 313
61ee0f86
JA
314static int fio_file_fsync(struct thread_data *td, struct fio_file *f)
315{
00615bfb 316 int ret, ret2;
61ee0f86
JA
317
318 if (fio_file_open(f))
319 return fio_io_sync(td, f);
320
321 if (td_io_open_file(td, f))
322 return 1;
323
324 ret = fio_io_sync(td, f);
00615bfb
SW
325 ret2 = 0;
326 if (fio_file_open(f))
327 ret2 = td_io_close_file(td, f);
328 return (ret || ret2);
61ee0f86
JA
329}
330
8b6a404c 331static inline void __update_ts_cache(struct thread_data *td)
2e1df07d 332{
8b6a404c 333 fio_gettime(&td->ts_cache, NULL);
2e1df07d
JA
334}
335
8b6a404c 336static inline void update_ts_cache(struct thread_data *td)
2e1df07d 337{
8b6a404c
VF
338 if ((++td->ts_cache_nr & td->ts_cache_mask) == td->ts_cache_mask)
339 __update_ts_cache(td);
2e1df07d
JA
340}
341
8b6a404c 342static inline bool runtime_exceeded(struct thread_data *td, struct timespec *t)
2e1df07d
JA
343{
344 if (in_ramp_time(td))
e39c0676 345 return false;
2e1df07d 346 if (!td->o.timeout)
e39c0676 347 return false;
0de5b26f 348 if (utime_since(&td->epoch, t) >= td->o.timeout)
e39c0676 349 return true;
2e1df07d 350
e39c0676 351 return false;
2e1df07d
JA
352}
353
95603b74
BF
354/*
355 * We need to update the runtime consistently in ms, but keep a running
356 * tally of the current elapsed time in microseconds for sub millisecond
357 * updates.
358 */
359static inline void update_runtime(struct thread_data *td,
360 unsigned long long *elapsed_us,
361 const enum fio_ddir ddir)
362{
d5c8ea29
JA
363 if (ddir == DDIR_WRITE && td_write(td) && td->o.verify_only)
364 return;
365
95603b74
BF
366 td->ts.runtime[ddir] -= (elapsed_us[ddir] + 999) / 1000;
367 elapsed_us[ddir] += utime_since_now(&td->start);
368 td->ts.runtime[ddir] += (elapsed_us[ddir] + 999) / 1000;
369}
370
e39c0676
JA
371static bool break_on_this_error(struct thread_data *td, enum fio_ddir ddir,
372 int *retptr)
2e1df07d
JA
373{
374 int ret = *retptr;
375
376 if (ret < 0 || td->error) {
8b28bd41
DM
377 int err = td->error;
378 enum error_type_bit eb;
2e1df07d
JA
379
380 if (ret < 0)
381 err = -ret;
2e1df07d 382
8b28bd41
DM
383 eb = td_error_type(ddir, err);
384 if (!(td->o.continue_on_error & (1 << eb)))
e39c0676 385 return true;
2e1df07d 386
8b28bd41 387 if (td_non_fatal_error(td, eb, err)) {
2e1df07d
JA
388 /*
389 * Continue with the I/Os in case of
390 * a non fatal error.
391 */
392 update_error_count(td, err);
393 td_clear_error(td);
394 *retptr = 0;
e39c0676 395 return false;
2e1df07d
JA
396 } else if (td->o.fill_device && err == ENOSPC) {
397 /*
398 * We expect to hit this error if
399 * fill_device option is set.
400 */
401 td_clear_error(td);
ebea2133 402 fio_mark_td_terminate(td);
e39c0676 403 return true;
2e1df07d
JA
404 } else {
405 /*
406 * Stop the I/O in case of a fatal
407 * error.
408 */
409 update_error_count(td, err);
e39c0676 410 return true;
2e1df07d
JA
411 }
412 }
413
e39c0676 414 return false;
2e1df07d
JA
415}
416
c97f1ad6
JA
417static void check_update_rusage(struct thread_data *td)
418{
419 if (td->update_rusage) {
420 td->update_rusage = 0;
421 update_rusage_stat(td);
971caeb1 422 fio_sem_up(td->rusage_sem);
c97f1ad6
JA
423 }
424}
425
8b6a404c 426static int wait_for_completions(struct thread_data *td, struct timespec *time)
69fea81e
JA
427{
428 const int full = queue_full(td);
429 int min_evts = 0;
430 int ret;
431
6be06c46
JA
432 if (td->flags & TD_F_REGROW_LOGS)
433 return io_u_quiesce(td);
1fed2080 434
69fea81e
JA
435 /*
436 * if the queue is full, we MUST reap at least 1 event
437 */
82407585 438 min_evts = min(td->o.iodepth_batch_complete_min, td->cur_depth);
4b157ac6 439 if ((full && !min_evts) || !td->o.iodepth_batch_complete_min)
69fea81e
JA
440 min_evts = 1;
441
46960d0d 442 if (time && __should_check_rate(td))
69fea81e
JA
443 fio_gettime(time, NULL);
444
445 do {
55312f9f 446 ret = io_u_queued_complete(td, min_evts);
69fea81e
JA
447 if (ret < 0)
448 break;
449 } while (full && (td->cur_depth > td->o.iodepth_low));
450
451 return ret;
452}
453
e9d512d8
JA
454int io_queue_event(struct thread_data *td, struct io_u *io_u, int *ret,
455 enum fio_ddir ddir, uint64_t *bytes_issued, int from_verify,
8b6a404c 456 struct timespec *comp_time)
e9d512d8 457{
e9d512d8
JA
458 switch (*ret) {
459 case FIO_Q_COMPLETED:
460 if (io_u->error) {
461 *ret = -io_u->error;
462 clear_io_u(td, io_u);
463 } else if (io_u->resid) {
5fff9543 464 long long bytes = io_u->xfer_buflen - io_u->resid;
e9d512d8
JA
465 struct fio_file *f = io_u->file;
466
467 if (bytes_issued)
468 *bytes_issued += bytes;
469
470 if (!from_verify)
94a78d52 471 trim_io_piece(io_u);
e9d512d8
JA
472
473 /*
474 * zero read, fail
475 */
476 if (!bytes) {
477 if (!from_verify)
478 unlog_io_piece(td, io_u);
479 td_verror(td, EIO, "full resid");
480 put_io_u(td, io_u);
481 break;
482 }
483
484 io_u->xfer_buflen = io_u->resid;
485 io_u->xfer_buf += bytes;
486 io_u->offset += bytes;
487
488 if (ddir_rw(io_u->ddir))
489 td->ts.short_io_u[io_u->ddir]++;
490
e9d512d8
JA
491 if (io_u->offset == f->real_file_size)
492 goto sync_done;
493
494 requeue_io_u(td, &io_u);
495 } else {
496sync_done:
46960d0d 497 if (comp_time && __should_check_rate(td))
e9d512d8
JA
498 fio_gettime(comp_time, NULL);
499
500 *ret = io_u_sync_complete(td, io_u);
501 if (*ret < 0)
502 break;
503 }
a0e3e5a6 504
cf2c8d52
JA
505 if (td->flags & TD_F_REGROW_LOGS)
506 regrow_logs(td);
507
a0e3e5a6
EW
508 /*
509 * when doing I/O (not when verifying),
510 * check for any errors that are to be ignored
511 */
512 if (!from_verify)
513 break;
514
e9d512d8
JA
515 return 0;
516 case FIO_Q_QUEUED:
517 /*
518 * if the engine doesn't have a commit hook,
519 * the io_u is really queued. if it does have such
520 * a hook, it has to call io_u_queued() itself.
521 */
522 if (td->io_ops->commit == NULL)
523 io_u_queued(td, io_u);
524 if (bytes_issued)
525 *bytes_issued += io_u->xfer_buflen;
526 break;
527 case FIO_Q_BUSY:
528 if (!from_verify)
529 unlog_io_piece(td, io_u);
530 requeue_io_u(td, &io_u);
a80cb54b 531 td_io_commit(td);
e9d512d8
JA
532 break;
533 default:
b0775325 534 assert(*ret < 0);
e9d512d8
JA
535 td_verror(td, -(*ret), "td_io_queue");
536 break;
537 }
538
539 if (break_on_this_error(td, ddir, ret))
540 return 1;
541
542 return 0;
543}
544
e39c0676 545static inline bool io_in_polling(struct thread_data *td)
82407585
RP
546{
547 return !td->o.iodepth_batch_complete_min &&
548 !td->o.iodepth_batch_complete_max;
549}
39c1c323 550/*
551 * Unlinks files from thread data fio_file structure
552 */
553static int unlink_all_files(struct thread_data *td)
554{
555 struct fio_file *f;
556 unsigned int i;
557 int ret = 0;
558
559 for_each_file(td, f, i) {
560 if (f->filetype != FIO_TYPE_FILE)
561 continue;
562 ret = td_io_unlink_file(td, f);
563 if (ret)
564 break;
565 }
566
567 if (ret)
568 td_verror(td, ret, "unlink_all_files");
569
570 return ret;
571}
82407585 572
997b5680
SW
573/*
574 * Check if io_u will overlap an in-flight IO in the queue
575 */
c06379a6 576bool in_flight_overlap(struct io_u_queue *q, struct io_u *io_u)
997b5680
SW
577{
578 bool overlap;
579 struct io_u *check_io_u;
580 unsigned long long x1, x2, y1, y2;
581 int i;
582
583 x1 = io_u->offset;
584 x2 = io_u->offset + io_u->buflen;
585 overlap = false;
586 io_u_qiter(q, check_io_u, i) {
587 if (check_io_u->flags & IO_U_F_FLIGHT) {
588 y1 = check_io_u->offset;
589 y2 = check_io_u->offset + check_io_u->buflen;
590
591 if (x1 < y2 && y1 < x2) {
592 overlap = true;
5fff9543 593 dprint(FD_IO, "in-flight overlap: %llu/%llu, %llu/%llu\n",
997b5680
SW
594 x1, io_u->buflen,
595 y1, check_io_u->buflen);
596 break;
597 }
598 }
599 }
600
601 return overlap;
602}
603
d3b07186 604static enum fio_q_status io_u_submit(struct thread_data *td, struct io_u *io_u)
08b2b386
JA
605{
606 /*
607 * Check for overlap if the user asked us to, and we have
608 * at least one IO in flight besides this one.
609 */
610 if (td->o.serialize_overlap && td->cur_depth > 1 &&
611 in_flight_overlap(&td->io_u_all, io_u))
612 return FIO_Q_BUSY;
613
614 return td_io_queue(td, io_u);
615}
616
2e1df07d
JA
617/*
618 * The main verify engine. Runs over the writes we previously submitted,
619 * reads the blocks back in, and checks the crc/md5 of the data.
620 */
100f49f1 621static void do_verify(struct thread_data *td, uint64_t verify_bytes)
2e1df07d
JA
622{
623 struct fio_file *f;
624 struct io_u *io_u;
625 int ret, min_events;
626 unsigned int i;
627
628 dprint(FD_VERIFY, "starting loop\n");
629
630 /*
631 * sync io first and invalidate cache, to make sure we really
632 * read from disk.
633 */
634 for_each_file(td, f, i) {
635 if (!fio_file_open(f))
636 continue;
637 if (fio_io_sync(td, f))
638 break;
639 if (file_invalidate_cache(td, f))
640 break;
641 }
642
c97f1ad6
JA
643 check_update_rusage(td);
644
2e1df07d
JA
645 if (td->error)
646 return;
647
8f380de2
CJ
648 /*
649 * verify_state needs to be reset before verification
650 * proceeds so that expected random seeds match actual
651 * random seeds in headers. The main loop will reset
652 * all random number generators if randrepeat is set.
653 */
654 if (!td->o.rand_repeatable)
655 td_fill_verify_state_seed(td);
656
2e1df07d
JA
657 td_set_runstate(td, TD_VERIFYING);
658
659 io_u = NULL;
660 while (!td->terminate) {
fbccf46c 661 enum fio_ddir ddir;
e9d512d8 662 int full;
2e1df07d 663
8b6a404c 664 update_ts_cache(td);
c97f1ad6 665 check_update_rusage(td);
2e1df07d 666
8b6a404c
VF
667 if (runtime_exceeded(td, &td->ts_cache)) {
668 __update_ts_cache(td);
669 if (runtime_exceeded(td, &td->ts_cache)) {
ebea2133 670 fio_mark_td_terminate(td);
2e1df07d
JA
671 break;
672 }
673 }
674
9e684a49
DE
675 if (flow_threshold_exceeded(td))
676 continue;
677
44cbc6da
JA
678 if (!td->o.experimental_verify) {
679 io_u = __get_io_u(td);
680 if (!io_u)
681 break;
2e1df07d 682
44cbc6da
JA
683 if (get_next_verify(td, io_u)) {
684 put_io_u(td, io_u);
685 break;
686 }
2e1df07d 687
44cbc6da
JA
688 if (td_io_prep(td, io_u)) {
689 put_io_u(td, io_u);
690 break;
691 }
692 } else {
55312f9f 693 if (ddir_rw_sum(td->bytes_done) + td->o.rw_min_bs > verify_bytes)
100f49f1
JA
694 break;
695
bcd5abfa 696 while ((io_u = get_io_u(td)) != NULL) {
059b61f2 697 if (IS_ERR_OR_NULL(io_u)) {
002fe734
JA
698 io_u = NULL;
699 ret = FIO_Q_BUSY;
700 goto reap;
701 }
702
bcd5abfa
JA
703 /*
704 * We are only interested in the places where
705 * we wrote or trimmed IOs. Turn those into
706 * reads for verification purposes.
707 */
708 if (io_u->ddir == DDIR_READ) {
709 /*
710 * Pretend we issued it for rwmix
711 * accounting
712 */
713 td->io_issues[DDIR_READ]++;
714 put_io_u(td, io_u);
715 continue;
716 } else if (io_u->ddir == DDIR_TRIM) {
717 io_u->ddir = DDIR_READ;
1651e431 718 io_u_set(td, io_u, IO_U_F_TRIMMED);
bcd5abfa
JA
719 break;
720 } else if (io_u->ddir == DDIR_WRITE) {
721 io_u->ddir = DDIR_READ;
5c5c33c1 722 populate_verify_io_u(td, io_u);
bcd5abfa
JA
723 break;
724 } else {
725 put_io_u(td, io_u);
726 continue;
727 }
728 }
44cbc6da 729
bcd5abfa 730 if (!io_u)
44cbc6da 731 break;
2e1df07d
JA
732 }
733
ca09be4b
JA
734 if (verify_state_should_stop(td, io_u)) {
735 put_io_u(td, io_u);
736 break;
737 }
738
2e1df07d
JA
739 if (td->o.verify_async)
740 io_u->end_io = verify_io_u_async;
741 else
742 io_u->end_io = verify_io_u;
743
fbccf46c 744 ddir = io_u->ddir;
10adc4a7
GG
745 if (!td->o.disable_slat)
746 fio_gettime(&io_u->start_time, NULL);
fbccf46c 747
08b2b386 748 ret = io_u_submit(td, io_u);
2e1df07d 749
e9d512d8 750 if (io_queue_event(td, io_u, &ret, ddir, NULL, 1, NULL))
2e1df07d
JA
751 break;
752
753 /*
754 * if we can queue more, do so. but check if there are
755 * completed io_u's first. Note that we can get BUSY even
756 * without IO queued, if the system is resource starved.
757 */
002fe734 758reap:
2e1df07d 759 full = queue_full(td) || (ret == FIO_Q_BUSY && td->cur_depth);
82407585 760 if (full || io_in_polling(td))
55312f9f 761 ret = wait_for_completions(td, NULL);
2e1df07d 762
2e1df07d
JA
763 if (ret < 0)
764 break;
765 }
766
c97f1ad6
JA
767 check_update_rusage(td);
768
2e1df07d
JA
769 if (!td->error) {
770 min_events = td->cur_depth;
771
772 if (min_events)
55312f9f 773 ret = io_u_queued_complete(td, min_events);
2e1df07d
JA
774 } else
775 cleanup_pending_aio(td);
776
777 td_set_runstate(td, TD_RUNNING);
778
779 dprint(FD_VERIFY, "exiting loop\n");
780}
781
e39c0676 782static bool exceeds_number_ios(struct thread_data *td)
3939fe85
JA
783{
784 unsigned long long number_ios;
785
786 if (!td->o.number_ios)
e39c0676 787 return false;
3939fe85 788
cf8a46a7 789 number_ios = ddir_rw_sum(td->io_blocks);
3939fe85
JA
790 number_ios += td->io_u_queued + td->io_u_in_flight;
791
cf8a46a7 792 return number_ios >= (td->o.number_ios * td->loops);
3939fe85
JA
793}
794
926098e0 795static bool io_bytes_exceeded(struct thread_data *td, uint64_t *this_bytes)
f7078f7b 796{
77731b29 797 unsigned long long bytes, limit;
f7078f7b
JA
798
799 if (td_rw(td))
926098e0 800 bytes = this_bytes[DDIR_READ] + this_bytes[DDIR_WRITE];
f7078f7b 801 else if (td_write(td))
926098e0 802 bytes = this_bytes[DDIR_WRITE];
6eaf09d6 803 else if (td_read(td))
926098e0 804 bytes = this_bytes[DDIR_READ];
f7078f7b 805 else
926098e0 806 bytes = this_bytes[DDIR_TRIM];
f7078f7b 807
5be9bf09
TK
808 if (td->o.io_size)
809 limit = td->o.io_size;
77731b29
JA
810 else
811 limit = td->o.size;
812
cf8a46a7 813 limit *= td->loops;
77731b29 814 return bytes >= limit || exceeds_number_ios(td);
f7078f7b
JA
815}
816
926098e0 817static bool io_issue_bytes_exceeded(struct thread_data *td)
e28dd2cf 818{
926098e0
JA
819 return io_bytes_exceeded(td, td->io_issue_bytes);
820}
e28dd2cf 821
926098e0
JA
822static bool io_complete_bytes_exceeded(struct thread_data *td)
823{
824 return io_bytes_exceeded(td, td->this_io_bytes);
e28dd2cf
JE
825}
826
50a8ce86
D
827/*
828 * used to calculate the next io time for rate control
829 *
830 */
831static long long usec_for_io(struct thread_data *td, enum fio_ddir ddir)
832{
1a9bf814 833 uint64_t bps = td->rate_bps[ddir];
50a8ce86
D
834
835 assert(!(td->flags & TD_F_CHILD));
ff6bb260 836
6de65959 837 if (td->o.rate_process == RATE_PROCESS_POISSON) {
1a9bf814
JA
838 uint64_t val, iops;
839
ff6bb260 840 iops = bps / td->o.bs[ddir];
a77d139b 841 val = (int64_t) (1000000 / iops) *
6c8611c7 842 -logf(__rand_0_1(&td->poisson_state[ddir]));
a77d139b 843 if (val) {
98e51d7c
JA
844 dprint(FD_RATE, "poisson rate iops=%llu, ddir=%d\n",
845 (unsigned long long) 1000000 / val,
846 ddir);
a77d139b 847 }
6c8611c7
JA
848 td->last_usec[ddir] += val;
849 return td->last_usec[ddir];
ff6bb260 850 } else if (bps) {
1a9bf814
JA
851 uint64_t bytes = td->rate_io_issue_bytes[ddir];
852 uint64_t secs = bytes / bps;
853 uint64_t remainder = bytes % bps;
854
50a8ce86 855 return remainder * 1000000 / bps + secs * 1000000;
e7b24047
JA
856 }
857
858 return 0;
50a8ce86
D
859}
860
1a9bf814
JA
861static void handle_thinktime(struct thread_data *td, enum fio_ddir ddir)
862{
863 unsigned long long b;
864 uint64_t total;
865 int left;
866
867 b = ddir_rw_sum(td->io_blocks);
868 if (b % td->o.thinktime_blocks)
869 return;
870
871 io_u_quiesce(td);
872
873 total = 0;
874 if (td->o.thinktime_spin)
875 total = usec_spin(td->o.thinktime_spin);
876
877 left = td->o.thinktime - total;
878 if (left)
879 total += usec_sleep(td, left);
880
881 /*
882 * If we're ignoring thinktime for the rate, add the number of bytes
1aa39b0c
JA
883 * we would have done while sleeping, minus one block to ensure we
884 * start issuing immediately after the sleep.
1a9bf814 885 */
1aa39b0c 886 if (total && td->rate_bps[ddir] && td->o.rate_ign_think) {
f2aedb17 887 uint64_t missed = (td->rate_bps[ddir] * total) / 1000000ULL;
62b858f6
JA
888 uint64_t bs = td->o.min_bs[ddir];
889 uint64_t usperop = bs * 1000000ULL / td->rate_bps[ddir];
f2aedb17
JA
890 uint64_t over;
891
62b858f6
JA
892 if (usperop <= total)
893 over = bs;
f2aedb17 894 else
62b858f6 895 over = (usperop - total) / usperop * -bs;
f2aedb17
JA
896
897 td->rate_io_issue_bytes[ddir] += (missed - over);
182cab24
JA
898 /* adjust for rate_process=poisson */
899 td->last_usec[ddir] += total;
1aa39b0c 900 }
1a9bf814
JA
901}
902
2e1df07d
JA
903/*
904 * Main IO worker function. It retrieves io_u's to process and queues
905 * and reaps them, checking for rate and errors along the way.
100f49f1
JA
906 *
907 * Returns number of bytes written and trimmed.
2e1df07d 908 */
95b03be0 909static void do_io(struct thread_data *td, uint64_t *bytes_done)
2e1df07d
JA
910{
911 unsigned int i;
912 int ret = 0;
c2703bf3 913 uint64_t total_bytes, bytes_issued = 0;
70c68076 914
95b03be0
JA
915 for (i = 0; i < DDIR_RWDIR_CNT; i++)
916 bytes_done[i] = td->bytes_done[i];
2e1df07d
JA
917
918 if (in_ramp_time(td))
919 td_set_runstate(td, TD_RAMP);
920 else
921 td_set_runstate(td, TD_RUNNING);
922
3e260a46
JA
923 lat_target_init(td);
924
1e564979
JE
925 total_bytes = td->o.size;
926 /*
5be9bf09 927 * Allow random overwrite workloads to write up to io_size
1e564979
JE
928 * before starting verification phase as 'size' doesn't apply.
929 */
930 if (td_write(td) && td_random(td) && td->o.norandommap)
5be9bf09 931 total_bytes = max(total_bytes, (uint64_t) td->o.io_size);
78a6469c
JA
932 /*
933 * If verify_backlog is enabled, we'll run the verify in this
934 * handler as well. For that case, we may need up to twice the
935 * amount of bytes.
936 */
78a6469c
JA
937 if (td->o.verify != VERIFY_NONE &&
938 (td_write(td) && td->o.verify_backlog))
c2703bf3
JA
939 total_bytes += td->o.size;
940
82a90686 941 /* In trimwrite mode, each byte is trimmed and then written, so
0e4dd95c 942 * allow total_bytes to be twice as big */
82a90686 943 if (td_trimwrite(td))
0e4dd95c
DE
944 total_bytes += td->total_io_size;
945
f7078f7b 946 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
e28dd2cf 947 (!flist_empty(&td->trim_list)) || !io_issue_bytes_exceeded(td) ||
c04e4661 948 td->o.time_based) {
8b6a404c 949 struct timespec comp_time;
2e1df07d 950 struct io_u *io_u;
e9d512d8 951 int full;
2e1df07d
JA
952 enum fio_ddir ddir;
953
c97f1ad6
JA
954 check_update_rusage(td);
955
7d7803fa 956 if (td->terminate || td->done)
2e1df07d
JA
957 break;
958
8b6a404c 959 update_ts_cache(td);
2e1df07d 960
8b6a404c
VF
961 if (runtime_exceeded(td, &td->ts_cache)) {
962 __update_ts_cache(td);
963 if (runtime_exceeded(td, &td->ts_cache)) {
ebea2133 964 fio_mark_td_terminate(td);
2e1df07d
JA
965 break;
966 }
967 }
968
9e684a49
DE
969 if (flow_threshold_exceeded(td))
970 continue;
971
f1a32461
JA
972 /*
973 * Break if we exceeded the bytes. The exception is time
974 * based runs, but we still need to break out of the loop
975 * for those to run verification, if enabled.
98e7161c 976 * Jobs read from iolog do not use this stop condition.
f1a32461
JA
977 */
978 if (bytes_issued >= total_bytes &&
98e7161c 979 !td->o.read_iolog_file &&
f1a32461
JA
980 (!td->o.time_based ||
981 (td->o.time_based && td->o.verify != VERIFY_NONE)))
20876c53
JC
982 break;
983
2e1df07d 984 io_u = get_io_u(td);
002fe734
JA
985 if (IS_ERR_OR_NULL(io_u)) {
986 int err = PTR_ERR(io_u);
987
988 io_u = NULL;
1a9bf814 989 ddir = DDIR_INVAL;
002fe734
JA
990 if (err == -EBUSY) {
991 ret = FIO_Q_BUSY;
992 goto reap;
993 }
3e260a46
JA
994 if (td->o.latency_target)
995 goto reap;
2e1df07d 996 break;
3e260a46 997 }
2e1df07d 998
5c5c33c1
BVA
999 if (io_u->ddir == DDIR_WRITE && td->flags & TD_F_DO_VERIFY)
1000 populate_verify_io_u(td, io_u);
1001
2e1df07d
JA
1002 ddir = io_u->ddir;
1003
1004 /*
82af2a7c
JA
1005 * Add verification end_io handler if:
1006 * - Asked to verify (!td_rw(td))
1007 * - Or the io_u is from our verify list (mixed write/ver)
2e1df07d
JA
1008 */
1009 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_READ &&
82af2a7c 1010 ((io_u->flags & IO_U_F_VER_LIST) || !td_rw(td))) {
c4b6117b 1011
ca09be4b
JA
1012 if (verify_state_should_stop(td, io_u)) {
1013 put_io_u(td, io_u);
1014 break;
1015 }
1016
2e1df07d
JA
1017 if (td->o.verify_async)
1018 io_u->end_io = verify_io_u_async;
1019 else
1020 io_u->end_io = verify_io_u;
1021 td_set_runstate(td, TD_VERIFYING);
1022 } else if (in_ramp_time(td))
1023 td_set_runstate(td, TD_RAMP);
1024 else
1025 td_set_runstate(td, TD_RUNNING);
1026
9a50c5c5 1027 /*
f9401285
JA
1028 * Always log IO before it's issued, so we know the specific
1029 * order of it. The logged unit will track when the IO has
1030 * completed.
9a50c5c5 1031 */
c4b6117b
PV
1032 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1033 td->o.do_verify &&
1034 td->o.verify != VERIFY_NONE &&
f9401285 1035 !td->o.experimental_verify)
c4b6117b
PV
1036 log_io_piece(td, io_u);
1037
a9da8ab2 1038 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
5fff9543 1039 const unsigned long long blen = io_u->xfer_buflen;
a43f4461 1040 const enum fio_ddir __ddir = acct_ddir(io_u);
0c5df5f9 1041
a9da8ab2
JA
1042 if (td->error)
1043 break;
0c5df5f9 1044
26de50cf
JA
1045 workqueue_enqueue(&td->io_wq, &io_u->work);
1046 ret = FIO_Q_QUEUED;
50a8ce86 1047
a43f4461
JA
1048 if (ddir_rw(__ddir)) {
1049 td->io_issues[__ddir]++;
1050 td->io_issue_bytes[__ddir] += blen;
1051 td->rate_io_issue_bytes[__ddir] += blen;
0c5df5f9
JA
1052 }
1053
50a8ce86 1054 if (should_check_rate(td))
a43f4461 1055 td->rate_next_io_time[__ddir] = usec_for_io(td, __ddir);
50a8ce86 1056
a9da8ab2 1057 } else {
08b2b386 1058 ret = io_u_submit(td, io_u);
2e1df07d 1059
50a8ce86
D
1060 if (should_check_rate(td))
1061 td->rate_next_io_time[ddir] = usec_for_io(td, ddir);
1062
fd727d9d 1063 if (io_queue_event(td, io_u, &ret, ddir, &bytes_issued, 0, &comp_time))
a9da8ab2 1064 break;
2e1df07d 1065
a9da8ab2
JA
1066 /*
1067 * See if we need to complete some commands. Note that
1068 * we can get BUSY even without IO queued, if the
1069 * system is resource starved.
1070 */
3e260a46 1071reap:
a9da8ab2
JA
1072 full = queue_full(td) ||
1073 (ret == FIO_Q_BUSY && td->cur_depth);
82407585 1074 if (full || io_in_polling(td))
a9da8ab2
JA
1075 ret = wait_for_completions(td, &comp_time);
1076 }
2e1df07d
JA
1077 if (ret < 0)
1078 break;
55312f9f 1079 if (!ddir_rw_sum(td->bytes_done) &&
9b87f09b 1080 !td_ioengine_flagged(td, FIO_NOIO))
2e1df07d
JA
1081 continue;
1082
55312f9f
JA
1083 if (!in_ramp_time(td) && should_check_rate(td)) {
1084 if (check_min_rate(td, &comp_time)) {
f9cafb12 1085 if (exitall_on_terminate || td->o.exitall_error)
64402a8a 1086 fio_terminate_threads(td->groupid, td->o.exit_what);
2e1df07d
JA
1087 td_verror(td, EIO, "check_min_rate");
1088 break;
1089 }
1090 }
3e260a46
JA
1091 if (!in_ramp_time(td) && td->o.latency_target)
1092 lat_target_check(td);
e155cb64 1093
1a9bf814
JA
1094 if (ddir_rw(ddir) && td->o.thinktime)
1095 handle_thinktime(td, ddir);
2e1df07d
JA
1096 }
1097
c97f1ad6
JA
1098 check_update_rusage(td);
1099
2e1df07d 1100 if (td->trim_entries)
4e0a8fa2 1101 log_err("fio: %lu trim entries leaked?\n", td->trim_entries);
2e1df07d
JA
1102
1103 if (td->o.fill_device && td->error == ENOSPC) {
1104 td->error = 0;
ebea2133 1105 fio_mark_td_terminate(td);
2e1df07d
JA
1106 }
1107 if (!td->error) {
1108 struct fio_file *f;
1109
a9da8ab2
JA
1110 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
1111 workqueue_flush(&td->io_wq);
1112 i = 0;
1113 } else
1114 i = td->cur_depth;
1115
2e1df07d 1116 if (i) {
55312f9f 1117 ret = io_u_queued_complete(td, i);
2e1df07d
JA
1118 if (td->o.fill_device && td->error == ENOSPC)
1119 td->error = 0;
1120 }
1121
00615bfb 1122 if (should_fsync(td) && (td->o.end_fsync || td->o.fsync_on_close)) {
2e1df07d
JA
1123 td_set_runstate(td, TD_FSYNCING);
1124
1125 for_each_file(td, f, i) {
61ee0f86 1126 if (!fio_file_fsync(td, f))
2e1df07d 1127 continue;
61ee0f86
JA
1128
1129 log_err("fio: end_fsync failed for file %s\n",
1130 f->file_name);
2e1df07d
JA
1131 }
1132 }
1133 } else
1134 cleanup_pending_aio(td);
1135
1136 /*
1137 * stop job if we failed doing any IO
1138 */
342f4be4 1139 if (!ddir_rw_sum(td->this_io_bytes))
2e1df07d 1140 td->done = 1;
100f49f1 1141
95b03be0
JA
1142 for (i = 0; i < DDIR_RWDIR_CNT; i++)
1143 bytes_done[i] = td->bytes_done[i] - bytes_done[i];
2e1df07d
JA
1144}
1145
94a6e1bb
JA
1146static void free_file_completion_logging(struct thread_data *td)
1147{
1148 struct fio_file *f;
1149 unsigned int i;
1150
1151 for_each_file(td, f, i) {
1152 if (!f->last_write_comp)
1153 break;
1154 sfree(f->last_write_comp);
1155 }
1156}
1157
1158static int init_file_completion_logging(struct thread_data *td,
1159 unsigned int depth)
1160{
1161 struct fio_file *f;
1162 unsigned int i;
1163
1164 if (td->o.verify == VERIFY_NONE || !td->o.verify_state_save)
1165 return 0;
1166
1167 for_each_file(td, f, i) {
1168 f->last_write_comp = scalloc(depth, sizeof(uint64_t));
1169 if (!f->last_write_comp)
1170 goto cleanup;
1171 }
1172
1173 return 0;
1174
1175cleanup:
1176 free_file_completion_logging(td);
1177 log_err("fio: failed to alloc write comp data\n");
1178 return 1;
1179}
1180
2e1df07d
JA
1181static void cleanup_io_u(struct thread_data *td)
1182{
2e1df07d
JA
1183 struct io_u *io_u;
1184
2ae0b204 1185 while ((io_u = io_u_qpop(&td->io_u_freelist)) != NULL) {
c73ed246
JA
1186
1187 if (td->io_ops->io_u_free)
1188 td->io_ops->io_u_free(td, io_u);
1189
3114b675 1190 fio_memfree(io_u, sizeof(*io_u), td_offload_overlap(td));
2e1df07d
JA
1191 }
1192
1193 free_io_mem(td);
2ae0b204
JA
1194
1195 io_u_rexit(&td->io_u_requeues);
3114b675
VF
1196 io_u_qexit(&td->io_u_freelist, false);
1197 io_u_qexit(&td->io_u_all, td_offload_overlap(td));
ca09be4b 1198
94a6e1bb 1199 free_file_completion_logging(td);
2e1df07d
JA
1200}
1201
1202static int init_io_u(struct thread_data *td)
1203{
1204 struct io_u *io_u;
2e1df07d 1205 int cl_align, i, max_units;
71e6e5a2 1206 int err;
2e1df07d
JA
1207
1208 max_units = td->o.iodepth;
59d8d0f5 1209
2ae0b204 1210 err = 0;
34851ad5 1211 err += !io_u_rinit(&td->io_u_requeues, td->o.iodepth);
3114b675
VF
1212 err += !io_u_qinit(&td->io_u_freelist, td->o.iodepth, false);
1213 err += !io_u_qinit(&td->io_u_all, td->o.iodepth, td_offload_overlap(td));
2ae0b204
JA
1214
1215 if (err) {
1216 log_err("fio: failed setting up IO queues\n");
1217 return 1;
1218 }
1219
71e6e5a2
AK
1220 cl_align = os_cache_line_size();
1221
1222 for (i = 0; i < max_units; i++) {
1223 void *ptr;
1224
1225 if (td->terminate)
1226 return 1;
1227
3114b675 1228 ptr = fio_memalign(cl_align, sizeof(*io_u), td_offload_overlap(td));
71e6e5a2
AK
1229 if (!ptr) {
1230 log_err("fio: unable to allocate aligned memory\n");
ab43b8cb 1231 return 1;
71e6e5a2
AK
1232 }
1233
1234 io_u = ptr;
1235 memset(io_u, 0, sizeof(*io_u));
1236 INIT_FLIST_HEAD(&io_u->verify_list);
1237 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
1238
1239 io_u->index = i;
1240 io_u->flags = IO_U_F_FREE;
1241 io_u_qpush(&td->io_u_freelist, io_u);
1242
1243 /*
1244 * io_u never leaves this stack, used for iteration of all
1245 * io_u buffers.
1246 */
1247 io_u_qpush(&td->io_u_all, io_u);
1248
1249 if (td->io_ops->io_u_init) {
1250 int ret = td->io_ops->io_u_init(td, io_u);
1251
1252 if (ret) {
1253 log_err("fio: failed to init engine data: %d\n", ret);
1254 return 1;
1255 }
1256 }
1257 }
1258
1259 init_io_u_buffers(td);
1260
1261 if (init_file_completion_logging(td, max_units))
1262 return 1;
1263
1264 return 0;
1265}
1266
1267int init_io_u_buffers(struct thread_data *td)
1268{
1269 struct io_u *io_u;
1270 unsigned long long max_bs, min_write;
1271 int i, max_units;
1272 int data_xfer = 1;
1273 char *p;
1274
1275 max_units = td->o.iodepth;
1276 max_bs = td_max_bs(td);
1277 min_write = td->o.min_bs[DDIR_WRITE];
1278 td->orig_buffer_size = (unsigned long long) max_bs
1279 * (unsigned long long) max_units;
1280
1281 if (td_ioengine_flagged(td, FIO_NOIO) || !(td_read(td) || td_write(td)))
1282 data_xfer = 0;
1283
fd8a09b8 1284 /*
1285 * if we may later need to do address alignment, then add any
1286 * possible adjustment here so that we don't cause a buffer
1287 * overflow later. this adjustment may be too much if we get
1288 * lucky and the allocator gives us an aligned address.
1289 */
d01612f3 1290 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
9b87f09b 1291 td_ioengine_flagged(td, FIO_RAWIO))
fd8a09b8 1292 td->orig_buffer_size += page_mask + td->o.mem_align;
1293
2e1df07d 1294 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE) {
5fff9543 1295 unsigned long long bs;
2e1df07d
JA
1296
1297 bs = td->orig_buffer_size + td->o.hugepage_size - 1;
1298 td->orig_buffer_size = bs & ~(td->o.hugepage_size - 1);
1299 }
1300
1301 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
1302 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
1303 return 1;
1304 }
1305
59d8d0f5 1306 if (data_xfer && allocate_io_mem(td))
2e1df07d
JA
1307 return 1;
1308
d01612f3 1309 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
9b87f09b 1310 td_ioengine_flagged(td, FIO_RAWIO))
248c9436 1311 p = PTR_ALIGN(td->orig_buffer, page_mask) + td->o.mem_align;
2e1df07d
JA
1312 else
1313 p = td->orig_buffer;
1314
2e1df07d 1315 for (i = 0; i < max_units; i++) {
71e6e5a2 1316 io_u = td->io_u_all.io_us[i];
2e1df07d
JA
1317 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
1318
59d8d0f5 1319 if (data_xfer) {
2e1df07d
JA
1320 io_u->buf = p;
1321 dprint(FD_MEM, "io_u %p, mem %p\n", io_u, io_u->buf);
1322
1323 if (td_write(td))
9c42684e 1324 io_u_fill_buffer(td, io_u, min_write, max_bs);
2e1df07d
JA
1325 if (td_write(td) && td->o.verify_pattern_bytes) {
1326 /*
1327 * Fill the buffer with the pattern if we are
1328 * going to be doing writes.
1329 */
ce35b1ec 1330 fill_verify_pattern(td, io_u->buf, max_bs, io_u, 0, 0);
2e1df07d
JA
1331 }
1332 }
2e1df07d
JA
1333 p += max_bs;
1334 }
1335
1336 return 0;
1337}
1338
bd4d9bdc
TK
1339/*
1340 * This function is Linux specific.
1341 * FIO_HAVE_IOSCHED_SWITCH enabled currently means it's Linux.
1342 */
2e1df07d
JA
1343static int switch_ioscheduler(struct thread_data *td)
1344{
db815fb3 1345#ifdef FIO_HAVE_IOSCHED_SWITCH
178ef27a 1346 char tmp[256], tmp2[128], *p;
2e1df07d
JA
1347 FILE *f;
1348 int ret;
1349
9b87f09b 1350 if (td_ioengine_flagged(td, FIO_DISKLESSIO))
2e1df07d
JA
1351 return 0;
1352
bd4d9bdc
TK
1353 assert(td->files && td->files[0]);
1354 sprintf(tmp, "%s/queue/scheduler", td->files[0]->du->sysfs_root);
2e1df07d
JA
1355
1356 f = fopen(tmp, "r+");
1357 if (!f) {
1358 if (errno == ENOENT) {
1359 log_err("fio: os or kernel doesn't support IO scheduler"
1360 " switching\n");
1361 return 0;
1362 }
1363 td_verror(td, errno, "fopen iosched");
1364 return 1;
1365 }
1366
1367 /*
1368 * Set io scheduler.
1369 */
1370 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
1371 if (ferror(f) || ret != 1) {
1372 td_verror(td, errno, "fwrite");
1373 fclose(f);
1374 return 1;
1375 }
1376
1377 rewind(f);
1378
1379 /*
1380 * Read back and check that the selected scheduler is now the default.
1381 */
0e23d456 1382 ret = fread(tmp, 1, sizeof(tmp) - 1, f);
2e1df07d
JA
1383 if (ferror(f) || ret < 0) {
1384 td_verror(td, errno, "fread");
1385 fclose(f);
1386 return 1;
1387 }
0e23d456 1388 tmp[ret] = '\0';
b44b9e45 1389 /*
178ef27a
BVA
1390 * either a list of io schedulers or "none\n" is expected. Strip the
1391 * trailing newline.
b44b9e45 1392 */
178ef27a
BVA
1393 p = tmp;
1394 strsep(&p, "\n");
49c6f33d 1395
67f28a8c
TK
1396 /*
1397 * Write to "none" entry doesn't fail, so check the result here.
1398 */
1399 if (!strcmp(tmp, "none")) {
1400 log_err("fio: io scheduler is not tunable\n");
1401 fclose(f);
1402 return 0;
1403 }
2e1df07d
JA
1404
1405 sprintf(tmp2, "[%s]", td->o.ioscheduler);
1406 if (!strstr(tmp, tmp2)) {
1407 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
1408 td_verror(td, EINVAL, "iosched_switch");
1409 fclose(f);
1410 return 1;
1411 }
1412
1413 fclose(f);
1414 return 0;
db815fb3
TK
1415#else
1416 return 0;
1417#endif
2e1df07d
JA
1418}
1419
e39c0676 1420static bool keep_running(struct thread_data *td)
2e1df07d 1421{
77731b29
JA
1422 unsigned long long limit;
1423
2e1df07d 1424 if (td->done)
e39c0676 1425 return false;
98413be7
SW
1426 if (td->terminate)
1427 return false;
2e1df07d 1428 if (td->o.time_based)
e39c0676 1429 return true;
2e1df07d
JA
1430 if (td->o.loops) {
1431 td->o.loops--;
e39c0676 1432 return true;
2e1df07d 1433 }
3939fe85 1434 if (exceeds_number_ios(td))
e39c0676 1435 return false;
26251d8d 1436
5be9bf09
TK
1437 if (td->o.io_size)
1438 limit = td->o.io_size;
77731b29
JA
1439 else
1440 limit = td->o.size;
1441
1442 if (limit != -1ULL && ddir_rw_sum(td->io_bytes) < limit) {
5bd5f71a
JA
1443 uint64_t diff;
1444
1445 /*
589d5d4f 1446 * If the difference is less than the maximum IO size, we
5bd5f71a
JA
1447 * are done.
1448 */
77731b29 1449 diff = limit - ddir_rw_sum(td->io_bytes);
74f4b020 1450 if (diff < td_max_bs(td))
e39c0676 1451 return false;
5bd5f71a 1452
5be9bf09 1453 if (fio_files_done(td) && !td->o.io_size)
e39c0676 1454 return false;
002fe734 1455
e39c0676 1456 return true;
5bd5f71a 1457 }
2e1df07d 1458
e39c0676 1459 return false;
2e1df07d
JA
1460}
1461
b7e4a53c
BVA
1462static int exec_string(struct thread_options *o, const char *string,
1463 const char *mode)
2e1df07d 1464{
f491a907 1465 int ret;
2e1df07d
JA
1466 char *str;
1467
b7e4a53c
BVA
1468 if (asprintf(&str, "%s > %s.%s.txt 2>&1", string, o->name, mode) < 0)
1469 return -1;
2e1df07d 1470
b7e4a53c
BVA
1471 log_info("%s : Saving output of %s in %s.%s.txt\n", o->name, mode,
1472 o->name, mode);
2e1df07d
JA
1473 ret = system(str);
1474 if (ret == -1)
1475 log_err("fio: exec of cmd <%s> failed\n", str);
1476
1477 free(str);
1478 return ret;
1479}
1480
62167762
JC
1481/*
1482 * Dry run to compute correct state of numberio for verification.
1483 */
1484static uint64_t do_dry_run(struct thread_data *td)
1485{
62167762
JC
1486 td_set_runstate(td, TD_RUNNING);
1487
1488 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
e28dd2cf 1489 (!flist_empty(&td->trim_list)) || !io_complete_bytes_exceeded(td)) {
62167762
JC
1490 struct io_u *io_u;
1491 int ret;
1492
1493 if (td->terminate || td->done)
1494 break;
1495
1496 io_u = get_io_u(td);
99955d3d 1497 if (IS_ERR_OR_NULL(io_u))
62167762
JC
1498 break;
1499
1651e431 1500 io_u_set(td, io_u, IO_U_F_FLIGHT);
62167762
JC
1501 io_u->error = 0;
1502 io_u->resid = 0;
1503 if (ddir_rw(acct_ddir(io_u)))
1504 td->io_issues[acct_ddir(io_u)]++;
1505 if (ddir_rw(io_u->ddir)) {
1506 io_u_mark_depth(td, 1);
1507 td->ts.total_io_u[io_u->ddir]++;
1508 }
1509
2e63e96b
PV
1510 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1511 td->o.do_verify &&
1512 td->o.verify != VERIFY_NONE &&
1513 !td->o.experimental_verify)
1514 log_io_piece(td, io_u);
1515
55312f9f 1516 ret = io_u_sync_complete(td, io_u);
62167762
JC
1517 (void) ret;
1518 }
1519
55312f9f 1520 return td->bytes_done[DDIR_WRITE] + td->bytes_done[DDIR_TRIM];
62167762
JC
1521}
1522
24660963
JA
1523struct fork_data {
1524 struct thread_data *td;
1525 struct sk_out *sk_out;
1526};
1527
2e1df07d
JA
1528/*
1529 * Entry point for the thread based jobs. The process based jobs end up
1530 * here as well, after a little setup.
1531 */
1532static void *thread_main(void *data)
1533{
24660963 1534 struct fork_data *fd = data;
95603b74 1535 unsigned long long elapsed_us[DDIR_RWDIR_CNT] = { 0, };
24660963 1536 struct thread_data *td = fd->td;
4896473e 1537 struct thread_options *o = &td->o;
24660963 1538 struct sk_out *sk_out = fd->sk_out;
48366f3a 1539 uint64_t bytes_done[DDIR_RWDIR_CNT];
ca0122d8 1540 int deadlock_loop_cnt;
ff3aa922 1541 bool clear_state;
a38c70a8 1542 int res, ret;
2e1df07d 1543
24660963
JA
1544 sk_out_assign(sk_out);
1545 free(fd);
1546
4896473e 1547 if (!o->use_thread) {
2e1df07d
JA
1548 setsid();
1549 td->pid = getpid();
1550 } else
1551 td->pid = gettid();
1552
a0eba820 1553 fio_local_clock_init();
5d879392 1554
2e1df07d
JA
1555 dprint(FD_PROCESS, "jobs pid=%d started\n", (int) td->pid);
1556
122c7725
JA
1557 if (is_backend)
1558 fio_server_send_start(td);
1559
2e1df07d
JA
1560 INIT_FLIST_HEAD(&td->io_log_list);
1561 INIT_FLIST_HEAD(&td->io_hist_list);
1562 INIT_FLIST_HEAD(&td->verify_list);
1563 INIT_FLIST_HEAD(&td->trim_list);
2e1df07d
JA
1564 td->io_hist_tree = RB_ROOT;
1565
34febb23 1566 ret = mutex_cond_init_pshared(&td->io_u_lock, &td->free_cond);
f9e5b5ee 1567 if (ret) {
34febb23 1568 td_verror(td, ret, "mutex_cond_init_pshared");
f9e5b5ee
JK
1569 goto err;
1570 }
34febb23 1571 ret = cond_init_pshared(&td->verify_cond);
f9e5b5ee 1572 if (ret) {
34febb23 1573 td_verror(td, ret, "mutex_cond_pshared");
f9e5b5ee
JK
1574 goto err;
1575 }
2e1df07d
JA
1576
1577 td_set_runstate(td, TD_INITIALIZED);
971caeb1
BVA
1578 dprint(FD_MUTEX, "up startup_sem\n");
1579 fio_sem_up(startup_sem);
1580 dprint(FD_MUTEX, "wait on td->sem\n");
1581 fio_sem_down(td->sem);
1582 dprint(FD_MUTEX, "done waiting on td->sem\n");
2e1df07d 1583
2e1df07d
JA
1584 /*
1585 * A new gid requires privilege, so we need to do this before setting
1586 * the uid.
1587 */
4896473e 1588 if (o->gid != -1U && setgid(o->gid)) {
2e1df07d
JA
1589 td_verror(td, errno, "setgid");
1590 goto err;
1591 }
4896473e 1592 if (o->uid != -1U && setuid(o->uid)) {
2e1df07d
JA
1593 td_verror(td, errno, "setuid");
1594 goto err;
1595 }
1596
07776127
JA
1597 td_zone_gen_index(td);
1598
2354d810
JA
1599 /*
1600 * Do this early, we don't want the compress threads to be limited
1601 * to the same CPUs as the IO workers. So do this before we set
1602 * any potential CPU affinity
1603 */
1604 if (iolog_compress_init(td, sk_out))
1605 goto err;
1606
2e1df07d
JA
1607 /*
1608 * If we have a gettimeofday() thread, make sure we exclude that
1609 * thread from this job
1610 */
4896473e
JA
1611 if (o->gtod_cpu)
1612 fio_cpu_clear(&o->cpumask, o->gtod_cpu);
2e1df07d
JA
1613
1614 /*
1615 * Set affinity first, in case it has an impact on the memory
1616 * allocations.
1617 */
b2a9e649 1618 if (fio_option_is_set(o, cpumask)) {
c2acfbac 1619 if (o->cpus_allowed_policy == FIO_CPUS_SPLIT) {
30cb4c65 1620 ret = fio_cpus_split(&o->cpumask, td->thread_number - 1);
c2acfbac
JA
1621 if (!ret) {
1622 log_err("fio: no CPUs set\n");
1623 log_err("fio: Try increasing number of available CPUs\n");
1624 td_verror(td, EINVAL, "cpus_split");
1625 goto err;
1626 }
1627 }
28727df7
JA
1628 ret = fio_setaffinity(td->pid, o->cpumask);
1629 if (ret == -1) {
4896473e
JA
1630 td_verror(td, errno, "cpu_set_affinity");
1631 goto err;
1632 }
2e1df07d
JA
1633 }
1634
67bf9823 1635#ifdef CONFIG_LIBNUMA
d0b937ed 1636 /* numa node setup */
b2a9e649
JA
1637 if (fio_option_is_set(o, numa_cpunodes) ||
1638 fio_option_is_set(o, numa_memnodes)) {
43522848 1639 struct bitmask *mask;
d0b937ed
YR
1640
1641 if (numa_available() < 0) {
1642 td_verror(td, errno, "Does not support NUMA API\n");
1643 goto err;
1644 }
1645
b2a9e649 1646 if (fio_option_is_set(o, numa_cpunodes)) {
43522848
DG
1647 mask = numa_parse_nodestring(o->numa_cpunodes);
1648 ret = numa_run_on_node_mask(mask);
1649 numa_free_nodemask(mask);
d0b937ed
YR
1650 if (ret == -1) {
1651 td_verror(td, errno, \
1652 "numa_run_on_node_mask failed\n");
1653 goto err;
1654 }
1655 }
1656
b2a9e649 1657 if (fio_option_is_set(o, numa_memnodes)) {
43522848
DG
1658 mask = NULL;
1659 if (o->numa_memnodes)
1660 mask = numa_parse_nodestring(o->numa_memnodes);
1661
4896473e 1662 switch (o->numa_mem_mode) {
d0b937ed 1663 case MPOL_INTERLEAVE:
43522848 1664 numa_set_interleave_mask(mask);
d0b937ed
YR
1665 break;
1666 case MPOL_BIND:
43522848 1667 numa_set_membind(mask);
d0b937ed
YR
1668 break;
1669 case MPOL_LOCAL:
1670 numa_set_localalloc();
1671 break;
1672 case MPOL_PREFERRED:
4896473e 1673 numa_set_preferred(o->numa_mem_prefer_node);
d0b937ed
YR
1674 break;
1675 case MPOL_DEFAULT:
1676 default:
1677 break;
1678 }
1679
43522848
DG
1680 if (mask)
1681 numa_free_nodemask(mask);
1682
d0b937ed
YR
1683 }
1684 }
1685#endif
1686
9a3f1100
JA
1687 if (fio_pin_memory(td))
1688 goto err;
1689
2e1df07d
JA
1690 /*
1691 * May alter parameters that init_io_u() will use, so we need to
1692 * do this first.
1693 */
b153f94a 1694 if (!init_iolog(td))
2e1df07d
JA
1695 goto err;
1696
08dc3bd5
JA
1697 if (td_io_init(td))
1698 goto err;
1699
2e1df07d
JA
1700 if (init_io_u(td))
1701 goto err;
1702
2041bd34
JA
1703 if (td->io_ops->post_init && td->io_ops->post_init(td))
1704 goto err;
1705
4896473e 1706 if (o->verify_async && verify_async_init(td))
2e1df07d
JA
1707 goto err;
1708
27d74836
JA
1709 if (fio_option_is_set(o, ioprio) ||
1710 fio_option_is_set(o, ioprio_class)) {
28727df7
JA
1711 ret = ioprio_set(IOPRIO_WHO_PROCESS, 0, o->ioprio_class, o->ioprio);
1712 if (ret == -1) {
2e1df07d
JA
1713 td_verror(td, errno, "ioprio_set");
1714 goto err;
1715 }
1716 }
1717
4896473e 1718 if (o->cgroup && cgroup_setup(td, cgroup_list, &cgroup_mnt))
2e1df07d
JA
1719 goto err;
1720
649c10c5 1721 errno = 0;
4896473e 1722 if (nice(o->nice) == -1 && errno != 0) {
2e1df07d
JA
1723 td_verror(td, errno, "nice");
1724 goto err;
1725 }
1726
4896473e 1727 if (o->ioscheduler && switch_ioscheduler(td))
2e1df07d
JA
1728 goto err;
1729
4896473e 1730 if (!o->create_serialize && setup_files(td))
2e1df07d
JA
1731 goto err;
1732
4d832322 1733 if (!init_random_map(td))
2e1df07d
JA
1734 goto err;
1735
0518f09f 1736 if (o->exec_prerun && exec_string(o, o->exec_prerun, "prerun"))
4896473e 1737 goto err;
2e1df07d 1738
c139f3b4
JA
1739 if (o->pre_read && !pre_read_files(td))
1740 goto err;
2e1df07d 1741
dc5bfbb2
JA
1742 fio_verify_init(td);
1743
24660963 1744 if (rate_submit_init(td, sk_out))
a9da8ab2
JA
1745 goto err;
1746
3aea75b1 1747 set_epoch_time(td, o->log_unix_epoch);
44404c5a 1748 fio_getrusage(&td->ru_start);
ac28d905
JA
1749 memcpy(&td->bw_sample_time, &td->epoch, sizeof(td->epoch));
1750 memcpy(&td->iops_sample_time, &td->epoch, sizeof(td->epoch));
16e56d25 1751 memcpy(&td->ss.prev_time, &td->epoch, sizeof(td->epoch));
ac28d905
JA
1752
1753 if (o->ratemin[DDIR_READ] || o->ratemin[DDIR_WRITE] ||
1754 o->ratemin[DDIR_TRIM]) {
1755 memcpy(&td->lastrate[DDIR_READ], &td->bw_sample_time,
1756 sizeof(td->bw_sample_time));
1757 memcpy(&td->lastrate[DDIR_WRITE], &td->bw_sample_time,
1758 sizeof(td->bw_sample_time));
1759 memcpy(&td->lastrate[DDIR_TRIM], &td->bw_sample_time,
1760 sizeof(td->bw_sample_time));
1761 }
1762
48366f3a 1763 memset(bytes_done, 0, sizeof(bytes_done));
c16035aa 1764 clear_state = false;
48366f3a 1765
2e1df07d 1766 while (keep_running(td)) {
100f49f1
JA
1767 uint64_t verify_bytes;
1768
2e1df07d 1769 fio_gettime(&td->start, NULL);
8b6a404c 1770 memcpy(&td->ts_cache, &td->start, sizeof(td->start));
2e1df07d 1771
39c1c323 1772 if (clear_state) {
ac28d905 1773 clear_io_state(td, 0);
2e1df07d 1774
39c1c323 1775 if (o->unlink_each_loop && unlink_all_files(td))
1776 break;
1777 }
1778
2e1df07d
JA
1779 prune_io_piece_log(td);
1780
dcf9844e 1781 if (td->o.verify_only && td_write(td))
62167762 1782 verify_bytes = do_dry_run(td);
095196b1 1783 else {
95b03be0
JA
1784 do_io(td, bytes_done);
1785
1786 if (!ddir_rw_sum(bytes_done)) {
095196b1 1787 fio_mark_td_terminate(td);
95b03be0
JA
1788 verify_bytes = 0;
1789 } else {
1790 verify_bytes = bytes_done[DDIR_WRITE] +
1791 bytes_done[DDIR_TRIM];
1792 }
095196b1 1793 }
2e1df07d 1794
49f0b8e0
JA
1795 /*
1796 * If we took too long to shut down, the main thread could
1797 * already consider us reaped/exited. If that happens, break
1798 * out and clean up.
1799 */
1800 if (td->runstate >= TD_EXITED)
1801 break;
1802
c16035aa 1803 clear_state = true;
2e1df07d 1804
40c666c8
JA
1805 /*
1806 * Make sure we've successfully updated the rusage stats
1807 * before waiting on the stat mutex. Otherwise we could have
1808 * the stat thread holding stat mutex and waiting for
1809 * the rusage_sem, which would never get upped because
1810 * this thread is waiting for the stat mutex.
1811 */
ca0122d8 1812 deadlock_loop_cnt = 0;
39d13e67
JA
1813 do {
1814 check_update_rusage(td);
971caeb1 1815 if (!fio_sem_down_trylock(stat_sem))
39d13e67
JA
1816 break;
1817 usleep(1000);
ca0122d8 1818 if (deadlock_loop_cnt++ > 5000) {
971caeb1 1819 log_err("fio seems to be stuck grabbing stat_sem, forcibly exiting\n");
43f248c4 1820 td->error = EDEADLK;
ca0122d8
TT
1821 goto err;
1822 }
39d13e67 1823 } while (1);
40c666c8 1824
95603b74
BF
1825 if (td_read(td) && td->io_bytes[DDIR_READ])
1826 update_runtime(td, elapsed_us, DDIR_READ);
1827 if (td_write(td) && td->io_bytes[DDIR_WRITE])
1828 update_runtime(td, elapsed_us, DDIR_WRITE);
1829 if (td_trim(td) && td->io_bytes[DDIR_TRIM])
1830 update_runtime(td, elapsed_us, DDIR_TRIM);
e5437a07 1831 fio_gettime(&td->start, NULL);
971caeb1 1832 fio_sem_up(stat_sem);
2e1df07d
JA
1833
1834 if (td->error || td->terminate)
1835 break;
1836
4896473e
JA
1837 if (!o->do_verify ||
1838 o->verify == VERIFY_NONE ||
9b87f09b 1839 td_ioengine_flagged(td, FIO_UNIDIR))
2e1df07d
JA
1840 continue;
1841
ac28d905 1842 clear_io_state(td, 0);
2e1df07d
JA
1843
1844 fio_gettime(&td->start, NULL);
1845
100f49f1 1846 do_verify(td, verify_bytes);
2e1df07d 1847
40c666c8
JA
1848 /*
1849 * See comment further up for why this is done here.
1850 */
1851 check_update_rusage(td);
1852
971caeb1 1853 fio_sem_down(stat_sem);
95603b74 1854 update_runtime(td, elapsed_us, DDIR_READ);
e5437a07 1855 fio_gettime(&td->start, NULL);
971caeb1 1856 fio_sem_up(stat_sem);
2e1df07d
JA
1857
1858 if (td->error || td->terminate)
1859 break;
1860 }
1861
817ae977
VF
1862 /*
1863 * Acquire this lock if we were doing overlap checking in
1864 * offload mode so that we don't clean up this job while
1865 * another thread is checking its io_u's for overlap
1866 */
a38c70a8
BVA
1867 if (td_offload_overlap(td)) {
1868 int res = pthread_mutex_lock(&overlap_check);
1869 assert(res == 0);
1870 }
2cea0b4c 1871 td_set_runstate(td, TD_FINISHING);
a38c70a8
BVA
1872 if (td_offload_overlap(td)) {
1873 res = pthread_mutex_unlock(&overlap_check);
1874 assert(res == 0);
1875 }
2cea0b4c 1876
2e1df07d 1877 update_rusage_stat(td);
2e1df07d 1878 td->ts.total_run_time = mtime_since_now(&td->epoch);
dde39f8c
AD
1879 for_each_rw_ddir(ddir) {
1880 td->ts.io_bytes[ddir] = td->io_bytes[ddir];
1881 }
2e1df07d 1882
ca09be4b 1883 if (td->o.verify_state_save && !(td->flags & TD_F_VSTATE_SAVED) &&
d264264a
JA
1884 (td->o.verify != VERIFY_NONE && td_write(td)))
1885 verify_save_state(td->thread_number);
ca09be4b 1886
9a3f1100
JA
1887 fio_unpin_memory(td);
1888
a47591e4 1889 td_writeout_logs(td, true);
2e1df07d 1890
155f2f02 1891 iolog_compress_exit(td);
103b174e 1892 rate_submit_exit(td);
aee2ab67 1893
4896473e 1894 if (o->exec_postrun)
0518f09f 1895 exec_string(o, o->exec_postrun, "postrun");
2e1df07d 1896
f9cafb12 1897 if (exitall_on_terminate || (o->exitall_error && td->error))
64402a8a 1898 fio_terminate_threads(td->groupid, td->o.exit_what);
2e1df07d
JA
1899
1900err:
1901 if (td->error)
1902 log_info("fio: pid=%d, err=%d/%s\n", (int) td->pid, td->error,
1903 td->verror);
1904
4896473e 1905 if (o->verify_async)
2e1df07d
JA
1906 verify_async_exit(td);
1907
1908 close_and_free_files(td);
2e1df07d 1909 cleanup_io_u(td);
32dbca2c 1910 close_ioengine(td);
c3dc516a 1911 cgroup_shutdown(td, cgroup_mnt);
ca09be4b 1912 verify_free_state(td);
07776127 1913 td_zone_free_index(td);
7c4d0fb7 1914
b2a9e649 1915 if (fio_option_is_set(o, cpumask)) {
8a1db9a1
JA
1916 ret = fio_cpuset_exit(&o->cpumask);
1917 if (ret)
1918 td_verror(td, ret, "fio_cpuset_exit");
2e1df07d
JA
1919 }
1920
1921 /*
1922 * do this very late, it will log file closing as well
1923 */
4896473e 1924 if (o->write_iolog_file)
2e1df07d 1925 write_iolog_close(td);
98e7161c
AK
1926 if (td->io_log_rfile)
1927 fclose(td->io_log_rfile);
2e1df07d
JA
1928
1929 td_set_runstate(td, TD_EXITED);
fda2cfac
JA
1930
1931 /*
1932 * Do this last after setting our runstate to exited, so we
1933 * know that the stat thread is signaled.
1934 */
1935 check_update_rusage(td);
1936
24660963 1937 sk_out_drop();
e43606c2 1938 return (void *) (uintptr_t) td->error;
2e1df07d
JA
1939}
1940
2e1df07d
JA
1941/*
1942 * Run over the job map and reap the threads that have exited, if any.
1943 */
90eff1c9
SW
1944static void reap_threads(unsigned int *nr_running, uint64_t *t_rate,
1945 uint64_t *m_rate)
2e1df07d
JA
1946{
1947 struct thread_data *td;
1948 unsigned int cputhreads, realthreads, pending;
1949 int i, status, ret;
1950
1951 /*
1952 * reap exited threads (TD_EXITED -> TD_REAPED)
1953 */
1954 realthreads = pending = cputhreads = 0;
1955 for_each_td(td, i) {
1956 int flags = 0;
1957
8847ae4c 1958 if (!strcmp(td->o.ioengine, "cpuio"))
2e1df07d
JA
1959 cputhreads++;
1960 else
1961 realthreads++;
1962
1963 if (!td->pid) {
1964 pending++;
1965 continue;
1966 }
1967 if (td->runstate == TD_REAPED)
1968 continue;
1969 if (td->o.use_thread) {
1970 if (td->runstate == TD_EXITED) {
1971 td_set_runstate(td, TD_REAPED);
1972 goto reaped;
1973 }
1974 continue;
1975 }
1976
1977 flags = WNOHANG;
1978 if (td->runstate == TD_EXITED)
1979 flags = 0;
1980
1981 /*
1982 * check if someone quit or got killed in an unusual way
1983 */
1984 ret = waitpid(td->pid, &status, flags);
1985 if (ret < 0) {
1986 if (errno == ECHILD) {
1987 log_err("fio: pid=%d disappeared %d\n",
1988 (int) td->pid, td->runstate);
a5e371a6 1989 td->sig = ECHILD;
2e1df07d
JA
1990 td_set_runstate(td, TD_REAPED);
1991 goto reaped;
1992 }
1993 perror("waitpid");
1994 } else if (ret == td->pid) {
1995 if (WIFSIGNALED(status)) {
1996 int sig = WTERMSIG(status);
1997
36d80bc7 1998 if (sig != SIGTERM && sig != SIGUSR2)
2e1df07d
JA
1999 log_err("fio: pid=%d, got signal=%d\n",
2000 (int) td->pid, sig);
a5e371a6 2001 td->sig = sig;
2e1df07d
JA
2002 td_set_runstate(td, TD_REAPED);
2003 goto reaped;
2004 }
2005 if (WIFEXITED(status)) {
2006 if (WEXITSTATUS(status) && !td->error)
2007 td->error = WEXITSTATUS(status);
2008
2009 td_set_runstate(td, TD_REAPED);
2010 goto reaped;
2011 }
2012 }
2013
cba5460c
JA
2014 /*
2015 * If the job is stuck, do a forceful timeout of it and
2016 * move on.
2017 */
2018 if (td->terminate &&
2c45a4ac 2019 td->runstate < TD_FSYNCING &&
cba5460c 2020 time_since_now(&td->terminate_time) >= FIO_REAP_TIMEOUT) {
86310a1f
TK
2021 log_err("fio: job '%s' (state=%d) hasn't exited in "
2022 "%lu seconds, it appears to be stuck. Doing "
2023 "forceful exit of this job.\n",
2024 td->o.name, td->runstate,
2025 (unsigned long) time_since_now(&td->terminate_time));
cba5460c
JA
2026 td_set_runstate(td, TD_REAPED);
2027 goto reaped;
2028 }
2029
2e1df07d
JA
2030 /*
2031 * thread is not dead, continue
2032 */
2033 pending++;
2034 continue;
2035reaped:
2036 (*nr_running)--;
342f4be4
JA
2037 (*m_rate) -= ddir_rw_sum(td->o.ratemin);
2038 (*t_rate) -= ddir_rw_sum(td->o.rate);
2e1df07d
JA
2039 if (!td->pid)
2040 pending--;
2041
2042 if (td->error)
2043 exit_value++;
2044
2045 done_secs += mtime_since_now(&td->epoch) / 1000;
4a88752a 2046 profile_td_exit(td);
42e26e94 2047 flow_exit_job(td);
2e1df07d
JA
2048 }
2049
2050 if (*nr_running == cputhreads && !pending && realthreads)
64402a8a 2051 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
2e1df07d
JA
2052}
2053
e39c0676 2054static bool __check_trigger_file(void)
ca09be4b
JA
2055{
2056 struct stat sb;
2057
2058 if (!trigger_file)
e39c0676 2059 return false;
ca09be4b
JA
2060
2061 if (stat(trigger_file, &sb))
e39c0676 2062 return false;
ca09be4b
JA
2063
2064 if (unlink(trigger_file) < 0)
2065 log_err("fio: failed to unlink %s: %s\n", trigger_file,
2066 strerror(errno));
2067
e39c0676 2068 return true;
ca09be4b
JA
2069}
2070
e39c0676 2071static bool trigger_timedout(void)
ca09be4b
JA
2072{
2073 if (trigger_timeout)
98413be7
SW
2074 if (time_since_genesis() >= trigger_timeout) {
2075 trigger_timeout = 0;
2076 return true;
2077 }
ca09be4b 2078
e39c0676 2079 return false;
ca09be4b
JA
2080}
2081
2082void exec_trigger(const char *cmd)
2083{
2084 int ret;
2085
98413be7 2086 if (!cmd || cmd[0] == '\0')
ca09be4b
JA
2087 return;
2088
2089 ret = system(cmd);
2090 if (ret == -1)
2091 log_err("fio: failed executing %s trigger\n", cmd);
2092}
2093
2094void check_trigger_file(void)
2095{
2096 if (__check_trigger_file() || trigger_timedout()) {
796fb3ce
JA
2097 if (nr_clients)
2098 fio_clients_send_trigger(trigger_remote_cmd);
2099 else {
d264264a 2100 verify_save_state(IO_LIST_ALL);
64402a8a 2101 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
ca09be4b
JA
2102 exec_trigger(trigger_cmd);
2103 }
2104 }
2105}
2106
2107static int fio_verify_load_state(struct thread_data *td)
2108{
2109 int ret;
2110
2111 if (!td->o.verify_state)
2112 return 0;
2113
2114 if (is_backend) {
2115 void *data;
2116
2117 ret = fio_server_get_verify_state(td->o.name,
94a6e1bb 2118 td->thread_number - 1, &data);
ca09be4b 2119 if (!ret)
94a6e1bb 2120 verify_assign_state(td, data);
67710881
AK
2121 } else {
2122 char prefix[PATH_MAX];
2123
2124 if (aux_path)
2125 sprintf(prefix, "%s%clocal", aux_path,
2126 FIO_OS_PATH_SEPARATOR);
2127 else
2128 strcpy(prefix, "local");
2129 ret = verify_load_state(td, prefix);
2130 }
ca09be4b
JA
2131
2132 return ret;
2133}
2134
06464907
JA
2135static void do_usleep(unsigned int usecs)
2136{
2137 check_for_running_stats();
ca09be4b 2138 check_trigger_file();
06464907
JA
2139 usleep(usecs);
2140}
2141
e39c0676 2142static bool check_mount_writes(struct thread_data *td)
e81ecca3
JA
2143{
2144 struct fio_file *f;
2145 unsigned int i;
2146
2147 if (!td_write(td) || td->o.allow_mounted_write)
e39c0676 2148 return false;
e81ecca3 2149
5e81f9c1
TK
2150 /*
2151 * If FIO_HAVE_CHARDEV_SIZE is defined, it's likely that chrdevs
2152 * are mkfs'd and mounted.
2153 */
e81ecca3 2154 for_each_file(td, f, i) {
5e81f9c1
TK
2155#ifdef FIO_HAVE_CHARDEV_SIZE
2156 if (f->filetype != FIO_TYPE_BLOCK && f->filetype != FIO_TYPE_CHAR)
2157#else
686fbd31 2158 if (f->filetype != FIO_TYPE_BLOCK)
5e81f9c1 2159#endif
e81ecca3
JA
2160 continue;
2161 if (device_is_mounted(f->file_name))
2162 goto mounted;
2163 }
2164
e39c0676 2165 return false;
e81ecca3 2166mounted:
c5839011 2167 log_err("fio: %s appears mounted, and 'allow_mounted_write' isn't set. Aborting.\n", f->file_name);
e39c0676 2168 return true;
e81ecca3
JA
2169}
2170
9cc8cb91
AK
2171static bool waitee_running(struct thread_data *me)
2172{
2173 const char *waitee = me->o.wait_for;
2174 const char *self = me->o.name;
2175 struct thread_data *td;
2176 int i;
2177
2178 if (!waitee)
2179 return false;
2180
2181 for_each_td(td, i) {
2182 if (!strcmp(td->o.name, self) || strcmp(td->o.name, waitee))
2183 continue;
2184
2185 if (td->runstate < TD_EXITED) {
2186 dprint(FD_PROCESS, "%s fenced by %s(%s)\n",
2187 self, td->o.name,
2188 runstate_to_name(td->runstate));
2189 return true;
2190 }
2191 }
2192
2193 dprint(FD_PROCESS, "%s: %s completed, can run\n", self, waitee);
2194 return false;
2195}
2196
2e1df07d
JA
2197/*
2198 * Main function for kicking off and reaping jobs, as needed.
2199 */
24660963 2200static void run_threads(struct sk_out *sk_out)
2e1df07d
JA
2201{
2202 struct thread_data *td;
90eff1c9
SW
2203 unsigned int i, todo, nr_running, nr_started;
2204 uint64_t m_rate, t_rate;
0de5b26f 2205 uint64_t spent;
2e1df07d 2206
2e1df07d
JA
2207 if (fio_gtod_offload && fio_start_gtod_thread())
2208 return;
334185e9 2209
f2a2ce0e 2210 fio_idle_prof_init();
2e1df07d
JA
2211
2212 set_sig_handlers();
2213
3a5f6bde
JA
2214 nr_thread = nr_process = 0;
2215 for_each_td(td, i) {
e81ecca3
JA
2216 if (check_mount_writes(td))
2217 return;
3a5f6bde
JA
2218 if (td->o.use_thread)
2219 nr_thread++;
2220 else
2221 nr_process++;
2222 }
2223
01cfefcc 2224 if (output_format & FIO_OUTPUT_NORMAL) {
a41fc529
JA
2225 struct buf_output out;
2226
2227 buf_output_init(&out);
c2fcb6bc 2228 __log_buf(&out, "Starting ");
2e1df07d 2229 if (nr_thread)
c2fcb6bc 2230 __log_buf(&out, "%d thread%s", nr_thread,
2e1df07d
JA
2231 nr_thread > 1 ? "s" : "");
2232 if (nr_process) {
2233 if (nr_thread)
c2fcb6bc
JA
2234 __log_buf(&out, " and ");
2235 __log_buf(&out, "%d process%s", nr_process,
2e1df07d
JA
2236 nr_process > 1 ? "es" : "");
2237 }
c2fcb6bc 2238 __log_buf(&out, "\n");
a41fc529 2239 log_info_buf(out.buf, out.buflen);
d5bb0a89 2240 buf_output_free(&out);
2e1df07d
JA
2241 }
2242
2243 todo = thread_number;
2244 nr_running = 0;
2245 nr_started = 0;
2246 m_rate = t_rate = 0;
2247
2248 for_each_td(td, i) {
2249 print_status_init(td->thread_number - 1);
2250
2251 if (!td->o.create_serialize)
2252 continue;
2253
ca09be4b
JA
2254 if (fio_verify_load_state(td))
2255 goto reap;
2256
2e1df07d
JA
2257 /*
2258 * do file setup here so it happens sequentially,
2259 * we don't want X number of threads getting their
2260 * client data interspersed on disk
2261 */
2262 if (setup_files(td)) {
ca09be4b 2263reap:
2e1df07d
JA
2264 exit_value++;
2265 if (td->error)
2266 log_err("fio: pid=%d, err=%d/%s\n",
2267 (int) td->pid, td->error, td->verror);
2268 td_set_runstate(td, TD_REAPED);
2269 todo--;
2270 } else {
2271 struct fio_file *f;
2272 unsigned int j;
2273
2274 /*
2275 * for sharing to work, each job must always open
2276 * its own files. so close them, if we opened them
2277 * for creation
2278 */
2279 for_each_file(td, f, j) {
2280 if (fio_file_open(f))
2281 td_io_close_file(td, f);
2282 }
2283 }
2284 }
2285
f2a2ce0e
HL
2286 /* start idle threads before io threads start to run */
2287 fio_idle_prof_start();
2288
2e1df07d
JA
2289 set_genesis_time();
2290
2291 while (todo) {
2292 struct thread_data *map[REAL_MAX_JOBS];
8b6a404c 2293 struct timespec this_start;
2e1df07d 2294 int this_jobs = 0, left;
ce8b6139 2295 struct fork_data *fd;
2e1df07d
JA
2296
2297 /*
2298 * create threads (TD_NOT_CREATED -> TD_CREATED)
2299 */
2300 for_each_td(td, i) {
2301 if (td->runstate != TD_NOT_CREATED)
2302 continue;
2303
2304 /*
2305 * never got a chance to start, killed by other
2306 * thread for some reason
2307 */
2308 if (td->terminate) {
2309 todo--;
2310 continue;
2311 }
2312
2313 if (td->o.start_delay) {
0de5b26f 2314 spent = utime_since_genesis();
2e1df07d 2315
74454ce4 2316 if (td->o.start_delay > spent)
2e1df07d
JA
2317 continue;
2318 }
2319
2320 if (td->o.stonewall && (nr_started || nr_running)) {
2321 dprint(FD_PROCESS, "%s: stonewall wait\n",
2322 td->o.name);
2323 break;
2324 }
2325
9cc8cb91
AK
2326 if (waitee_running(td)) {
2327 dprint(FD_PROCESS, "%s: waiting for %s\n",
2328 td->o.name, td->o.wait_for);
5c74fc76 2329 continue;
9cc8cb91
AK
2330 }
2331
2e1df07d
JA
2332 init_disk_util(td);
2333
971caeb1 2334 td->rusage_sem = fio_sem_init(FIO_SEM_LOCKED);
c97f1ad6
JA
2335 td->update_rusage = 0;
2336
2e1df07d
JA
2337 /*
2338 * Set state to created. Thread will transition
2339 * to TD_INITIALIZED when it's done setting up.
2340 */
2341 td_set_runstate(td, TD_CREATED);
2342 map[this_jobs++] = td;
2343 nr_started++;
2344
ce8b6139
JA
2345 fd = calloc(1, sizeof(*fd));
2346 fd->td = td;
2347 fd->sk_out = sk_out;
2348
2e1df07d
JA
2349 if (td->o.use_thread) {
2350 int ret;
2351
2352 dprint(FD_PROCESS, "will pthread_create\n");
2353 ret = pthread_create(&td->thread, NULL,
24660963 2354 thread_main, fd);
2e1df07d
JA
2355 if (ret) {
2356 log_err("pthread_create: %s\n",
2357 strerror(ret));
24660963 2358 free(fd);
2e1df07d
JA
2359 nr_started--;
2360 break;
2361 }
493dd6c1 2362 fd = NULL;
2e1df07d
JA
2363 ret = pthread_detach(td->thread);
2364 if (ret)
2365 log_err("pthread_detach: %s",
2366 strerror(ret));
2367 } else {
2368 pid_t pid;
2369 dprint(FD_PROCESS, "will fork\n");
2370 pid = fork();
2371 if (!pid) {
ce8b6139 2372 int ret;
2e1df07d 2373
ce8b6139 2374 ret = (int)(uintptr_t)thread_main(fd);
2e1df07d
JA
2375 _exit(ret);
2376 } else if (i == fio_debug_jobno)
2377 *fio_debug_jobp = pid;
2378 }
971caeb1
BVA
2379 dprint(FD_MUTEX, "wait on startup_sem\n");
2380 if (fio_sem_down_timeout(startup_sem, 10000)) {
2e1df07d 2381 log_err("fio: job startup hung? exiting.\n");
64402a8a 2382 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
f1867a7f 2383 fio_abort = true;
2e1df07d 2384 nr_started--;
6541f4e0 2385 free(fd);
2e1df07d
JA
2386 break;
2387 }
971caeb1 2388 dprint(FD_MUTEX, "done waiting on startup_sem\n");
2e1df07d
JA
2389 }
2390
2391 /*
2392 * Wait for the started threads to transition to
2393 * TD_INITIALIZED.
2394 */
2395 fio_gettime(&this_start, NULL);
2396 left = this_jobs;
2397 while (left && !fio_abort) {
2398 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
2399 break;
2400
06464907 2401 do_usleep(100000);
2e1df07d
JA
2402
2403 for (i = 0; i < this_jobs; i++) {
2404 td = map[i];
2405 if (!td)
2406 continue;
2407 if (td->runstate == TD_INITIALIZED) {
2408 map[i] = NULL;
2409 left--;
2410 } else if (td->runstate >= TD_EXITED) {
2411 map[i] = NULL;
2412 left--;
2413 todo--;
2414 nr_running++; /* work-around... */
2415 }
2416 }
2417 }
2418
2419 if (left) {
4e87c37a
JA
2420 log_err("fio: %d job%s failed to start\n", left,
2421 left > 1 ? "s" : "");
2e1df07d
JA
2422 for (i = 0; i < this_jobs; i++) {
2423 td = map[i];
2424 if (!td)
2425 continue;
2426 kill(td->pid, SIGTERM);
2427 }
2428 break;
2429 }
2430
2431 /*
2432 * start created threads (TD_INITIALIZED -> TD_RUNNING).
2433 */
2434 for_each_td(td, i) {
2435 if (td->runstate != TD_INITIALIZED)
2436 continue;
2437
2438 if (in_ramp_time(td))
2439 td_set_runstate(td, TD_RAMP);
2440 else
2441 td_set_runstate(td, TD_RUNNING);
2442 nr_running++;
2443 nr_started--;
342f4be4
JA
2444 m_rate += ddir_rw_sum(td->o.ratemin);
2445 t_rate += ddir_rw_sum(td->o.rate);
2e1df07d 2446 todo--;
971caeb1 2447 fio_sem_up(td->sem);
2e1df07d
JA
2448 }
2449
2450 reap_threads(&nr_running, &t_rate, &m_rate);
2451
122c7725 2452 if (todo)
06464907 2453 do_usleep(100000);
2e1df07d
JA
2454 }
2455
2456 while (nr_running) {
2457 reap_threads(&nr_running, &t_rate, &m_rate);
06464907 2458 do_usleep(10000);
2e1df07d
JA
2459 }
2460
f2a2ce0e
HL
2461 fio_idle_prof_stop();
2462
2e1df07d 2463 update_io_ticks();
2e1df07d
JA
2464}
2465
27357187
JA
2466static void free_disk_util(void)
2467{
27357187 2468 disk_util_prune_entries();
a39fb9ea 2469 helper_thread_destroy();
2e1df07d
JA
2470}
2471
24660963 2472int fio_backend(struct sk_out *sk_out)
2e1df07d
JA
2473{
2474 struct thread_data *td;
2475 int i;
2476
2477 if (exec_profile) {
2478 if (load_profile(exec_profile))
2479 return 1;
2480 free(exec_profile);
2481 exec_profile = NULL;
2482 }
2483 if (!thread_number)
2484 return 0;
2485
2486 if (write_bw_log) {
aee2ab67
JA
2487 struct log_params p = {
2488 .log_type = IO_LOG_TYPE_BW,
2489 };
2490
2491 setup_log(&agg_io_log[DDIR_READ], &p, "agg-read_bw.log");
2492 setup_log(&agg_io_log[DDIR_WRITE], &p, "agg-write_bw.log");
2493 setup_log(&agg_io_log[DDIR_TRIM], &p, "agg-trim_bw.log");
2e1df07d
JA
2494 }
2495
971caeb1 2496 startup_sem = fio_sem_init(FIO_SEM_LOCKED);
24a97130
LC
2497 if (!sk_out)
2498 is_local_backend = true;
971caeb1 2499 if (startup_sem == NULL)
2e1df07d 2500 return 1;
2e1df07d
JA
2501
2502 set_genesis_time();
cef9175e 2503 stat_init();
998e9ebb
BVA
2504 if (helper_thread_create(startup_sem, sk_out))
2505 log_err("fio: failed to create helper thread\n");
2e1df07d
JA
2506
2507 cgroup_list = smalloc(sizeof(*cgroup_list));
b2e6494c
JA
2508 if (cgroup_list)
2509 INIT_FLIST_HEAD(cgroup_list);
2e1df07d 2510
24660963 2511 run_threads(sk_out);
2e1df07d 2512
a39fb9ea 2513 helper_thread_exit();
8aab824f 2514
2e1df07d 2515 if (!fio_abort) {
83f7b64e 2516 __show_run_stats();
2e1df07d 2517 if (write_bw_log) {
cb7e0ace
JA
2518 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
2519 struct io_log *log = agg_io_log[i];
2520
60a25727 2521 flush_log(log, false);
518dac09 2522 free_log(log);
cb7e0ace 2523 }
2e1df07d
JA
2524 }
2525 }
2526
fda2cfac 2527 for_each_td(td, i) {
c27cc65f 2528 steadystate_free(td);
2e1df07d 2529 fio_options_free(td);
8049adc1 2530 if (td->rusage_sem) {
971caeb1 2531 fio_sem_remove(td->rusage_sem);
8049adc1
JA
2532 td->rusage_sem = NULL;
2533 }
971caeb1
BVA
2534 fio_sem_remove(td->sem);
2535 td->sem = NULL;
fda2cfac 2536 }
2e1df07d 2537
a462baef 2538 free_disk_util();
b2e6494c
JA
2539 if (cgroup_list) {
2540 cgroup_kill(cgroup_list);
2541 sfree(cgroup_list);
2542 }
2e1df07d 2543
971caeb1 2544 fio_sem_remove(startup_sem);
cef9175e 2545 stat_exit();
2e1df07d
JA
2546 return exit_value;
2547}