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