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