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