Add some more options for commands
[fio.git] / fio.c
... / ...
CommitLineData
1/*
2 * fio - the flexible io tester
3 *
4 * Copyright (C) 2005 Jens Axboe <axboe@suse.de>
5 * Copyright (C) 2006 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 <signal.h>
28#include <time.h>
29#include <locale.h>
30#include <assert.h>
31#include <sys/stat.h>
32#include <sys/wait.h>
33#include <sys/ipc.h>
34#include <sys/shm.h>
35#include <sys/mman.h>
36
37#include "fio.h"
38#include "os.h"
39
40unsigned long page_mask;
41unsigned long page_size;
42#define ALIGN(buf) \
43 (char *) (((unsigned long) (buf) + page_mask) & ~page_mask)
44
45int groupid = 0;
46int thread_number = 0;
47int nr_process = 0;
48int nr_thread = 0;
49int shm_id = 0;
50int temp_stall_ts;
51
52static struct fio_sem *startup_sem;
53static volatile int fio_abort;
54static int exit_value;
55
56struct io_log *agg_io_log[2];
57
58#define TERMINATE_ALL (-1)
59#define JOB_START_TIMEOUT (5 * 1000)
60
61static inline void td_set_runstate(struct thread_data *td, int runstate)
62{
63 td->runstate = runstate;
64}
65
66static void terminate_threads(int group_id)
67{
68 struct thread_data *td;
69 int i;
70
71 for_each_td(td, i) {
72 if (group_id == TERMINATE_ALL || groupid == td->groupid) {
73 /*
74 * if the thread is running, just let it exit
75 */
76 if (td->runstate < TD_RUNNING)
77 kill(td->pid, SIGQUIT);
78 td->terminate = 1;
79 td->start_delay = 0;
80 }
81 }
82}
83
84static void sig_handler(int sig)
85{
86 switch (sig) {
87 case SIGALRM:
88 update_io_ticks();
89 disk_util_timer_arm();
90 print_thread_status();
91 break;
92 default:
93 printf("\nfio: terminating on signal %d\n", sig);
94 fflush(stdout);
95 terminate_threads(TERMINATE_ALL);
96 break;
97 }
98}
99
100/*
101 * Check if we are above the minimum rate given.
102 */
103static int check_min_rate(struct thread_data *td, struct timeval *now)
104{
105 unsigned long long bytes = 0;
106 unsigned long iops = 0;
107 unsigned long spent;
108 unsigned long rate;
109
110 /*
111 * No minimum rate set, always ok
112 */
113 if (!td->ratemin && !td->rate_iops_min)
114 return 0;
115
116 /*
117 * allow a 2 second settle period in the beginning
118 */
119 if (mtime_since(&td->start, now) < 2000)
120 return 0;
121
122 if (td_read(td)) {
123 iops += td->io_blocks[DDIR_READ];
124 bytes += td->this_io_bytes[DDIR_READ];
125 }
126 if (td_write(td)) {
127 iops += td->io_blocks[DDIR_WRITE];
128 bytes += td->this_io_bytes[DDIR_WRITE];
129 }
130
131 /*
132 * if rate blocks is set, sample is running
133 */
134 if (td->rate_bytes || td->rate_blocks) {
135 spent = mtime_since(&td->lastrate, now);
136 if (spent < td->ratecycle)
137 return 0;
138
139 if (td->rate) {
140 /*
141 * check bandwidth specified rate
142 */
143 if (bytes < td->rate_bytes) {
144 log_err("%s: min rate %u not met\n", td->name, td->ratemin);
145 return 1;
146 } else {
147 rate = (bytes - td->rate_bytes) / spent;
148 if (rate < td->ratemin || bytes < td->rate_bytes) {
149 log_err("%s: min rate %u not met, got %luKiB/sec\n", td->name, td->ratemin, rate);
150 return 1;
151 }
152 }
153 } else {
154 /*
155 * checks iops specified rate
156 */
157 if (iops < td->rate_iops) {
158 log_err("%s: min iops rate %u not met\n", td->name, td->rate_iops);
159 return 1;
160 } else {
161 rate = (iops - td->rate_blocks) / spent;
162 if (rate < td->rate_iops_min || iops < td->rate_blocks) {
163 log_err("%s: min iops rate %u not met, got %lu\n", td->name, td->rate_iops_min, rate);
164 }
165 }
166 }
167 }
168
169 td->rate_bytes = bytes;
170 td->rate_blocks = iops;
171 memcpy(&td->lastrate, now, sizeof(*now));
172 return 0;
173}
174
175static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
176{
177 if (!td->timeout)
178 return 0;
179 if (mtime_since(&td->epoch, t) >= td->timeout * 1000)
180 return 1;
181
182 return 0;
183}
184
185/*
186 * When job exits, we can cancel the in-flight IO if we are using async
187 * io. Attempt to do so.
188 */
189static void cleanup_pending_aio(struct thread_data *td)
190{
191 struct list_head *entry, *n;
192 struct io_u *io_u;
193 int r;
194
195 /*
196 * get immediately available events, if any
197 */
198 r = io_u_queued_complete(td, 0);
199 if (r < 0)
200 return;
201
202 /*
203 * now cancel remaining active events
204 */
205 if (td->io_ops->cancel) {
206 list_for_each_safe(entry, n, &td->io_u_busylist) {
207 io_u = list_entry(entry, struct io_u, list);
208
209 /*
210 * if the io_u isn't in flight, then that generally
211 * means someone leaked an io_u. complain but fix
212 * it up, so we don't stall here.
213 */
214 if ((io_u->flags & IO_U_F_FLIGHT) == 0) {
215 log_err("fio: non-busy IO on busy list\n");
216 put_io_u(td, io_u);
217 } else {
218 r = td->io_ops->cancel(td, io_u);
219 if (!r)
220 put_io_u(td, io_u);
221 }
222 }
223 }
224
225 if (td->cur_depth)
226 r = io_u_queued_complete(td, td->cur_depth);
227}
228
229/*
230 * Helper to handle the final sync of a file. Works just like the normal
231 * io path, just does everything sync.
232 */
233static int fio_io_sync(struct thread_data *td, struct fio_file *f)
234{
235 struct io_u *io_u = __get_io_u(td);
236 int ret;
237
238 if (!io_u)
239 return 1;
240
241 io_u->ddir = DDIR_SYNC;
242 io_u->file = f;
243
244 if (td_io_prep(td, io_u)) {
245 put_io_u(td, io_u);
246 return 1;
247 }
248
249requeue:
250 ret = td_io_queue(td, io_u);
251 if (ret < 0) {
252 td_verror(td, io_u->error, "td_io_queue");
253 put_io_u(td, io_u);
254 return 1;
255 } else if (ret == FIO_Q_QUEUED) {
256 if (io_u_queued_complete(td, 1) < 0)
257 return 1;
258 } else if (ret == FIO_Q_COMPLETED) {
259 if (io_u->error) {
260 td_verror(td, io_u->error, "td_io_queue");
261 return 1;
262 }
263
264 if (io_u_sync_complete(td, io_u) < 0)
265 return 1;
266 } else if (ret == FIO_Q_BUSY) {
267 if (td_io_commit(td))
268 return 1;
269 goto requeue;
270 }
271
272 return 0;
273}
274
275/*
276 * The main verify engine. Runs over the writes we previously submitted,
277 * reads the blocks back in, and checks the crc/md5 of the data.
278 */
279static void do_verify(struct thread_data *td)
280{
281 struct fio_file *f;
282 struct io_u *io_u;
283 int ret, min_events;
284 unsigned int i;
285
286 /*
287 * sync io first and invalidate cache, to make sure we really
288 * read from disk.
289 */
290 for_each_file(td, f, i) {
291 if (!(f->flags & FIO_FILE_OPEN))
292 continue;
293 if (fio_io_sync(td, f))
294 break;
295 if (file_invalidate_cache(td, f))
296 break;
297 }
298
299 if (td->error)
300 return;
301
302 td_set_runstate(td, TD_VERIFYING);
303
304 io_u = NULL;
305 while (!td->terminate) {
306 int ret2;
307
308 io_u = __get_io_u(td);
309 if (!io_u)
310 break;
311
312 if (runtime_exceeded(td, &io_u->start_time)) {
313 put_io_u(td, io_u);
314 break;
315 }
316
317 if (get_next_verify(td, io_u)) {
318 put_io_u(td, io_u);
319 break;
320 }
321
322 if (td_io_prep(td, io_u)) {
323 put_io_u(td, io_u);
324 break;
325 }
326
327 io_u->end_io = verify_io_u;
328
329 ret = td_io_queue(td, io_u);
330 switch (ret) {
331 case FIO_Q_COMPLETED:
332 if (io_u->error)
333 ret = -io_u->error;
334 else if (io_u->resid) {
335 int bytes = io_u->xfer_buflen - io_u->resid;
336
337 /*
338 * zero read, fail
339 */
340 if (!bytes) {
341 td_verror(td, ENODATA, "full resid");
342 put_io_u(td, io_u);
343 break;
344 }
345 io_u->xfer_buflen = io_u->resid;
346 io_u->xfer_buf += bytes;
347 requeue_io_u(td, &io_u);
348 } else {
349 ret = io_u_sync_complete(td, io_u);
350 if (ret < 0)
351 break;
352 }
353 continue;
354 case FIO_Q_QUEUED:
355 break;
356 case FIO_Q_BUSY:
357 requeue_io_u(td, &io_u);
358 ret2 = td_io_commit(td);
359 if (ret2 < 0)
360 ret = ret2;
361 break;
362 default:
363 assert(ret < 0);
364 td_verror(td, -ret, "td_io_queue");
365 break;
366 }
367
368 if (ret < 0 || td->error)
369 break;
370
371 /*
372 * if we can queue more, do so. but check if there are
373 * completed io_u's first.
374 */
375 min_events = 0;
376 if (queue_full(td) || ret == FIO_Q_BUSY) {
377 min_events = 1;
378
379 if (td->cur_depth > td->iodepth_low)
380 min_events = td->cur_depth - td->iodepth_low;
381 }
382
383 /*
384 * Reap required number of io units, if any, and do the
385 * verification on them through the callback handler
386 */
387 if (io_u_queued_complete(td, min_events) < 0)
388 break;
389 }
390
391 if (!td->error) {
392 min_events = td->cur_depth;
393
394 if (min_events)
395 ret = io_u_queued_complete(td, min_events);
396 } else
397 cleanup_pending_aio(td);
398
399 td_set_runstate(td, TD_RUNNING);
400}
401
402/*
403 * Main IO worker function. It retrieves io_u's to process and queues
404 * and reaps them, checking for rate and errors along the way.
405 */
406static void do_io(struct thread_data *td)
407{
408 struct timeval s;
409 unsigned long usec;
410 unsigned int i;
411 int ret = 0;
412
413 td_set_runstate(td, TD_RUNNING);
414
415 while ((td->this_io_bytes[0] + td->this_io_bytes[1]) < td->io_size) {
416 struct timeval comp_time;
417 long bytes_done = 0;
418 int min_evts = 0;
419 struct io_u *io_u;
420 int ret2;
421
422 if (td->terminate)
423 break;
424
425 io_u = get_io_u(td);
426 if (!io_u)
427 break;
428
429 memcpy(&s, &io_u->start_time, sizeof(s));
430
431 if (runtime_exceeded(td, &s)) {
432 put_io_u(td, io_u);
433 break;
434 }
435
436 ret = td_io_queue(td, io_u);
437 switch (ret) {
438 case FIO_Q_COMPLETED:
439 if (io_u->error)
440 ret = -io_u->error;
441 else if (io_u->resid) {
442 int bytes = io_u->xfer_buflen - io_u->resid;
443
444 /*
445 * zero read, fail
446 */
447 if (!bytes) {
448 td_verror(td, ENODATA, "full resid");
449 put_io_u(td, io_u);
450 break;
451 }
452
453 io_u->xfer_buflen = io_u->resid;
454 io_u->xfer_buf += bytes;
455 requeue_io_u(td, &io_u);
456 } else {
457 fio_gettime(&comp_time, NULL);
458 bytes_done = io_u_sync_complete(td, io_u);
459 if (bytes_done < 0)
460 ret = bytes_done;
461 }
462 break;
463 case FIO_Q_QUEUED:
464 /*
465 * if the engine doesn't have a commit hook,
466 * the io_u is really queued. if it does have such
467 * a hook, it has to call io_u_queued() itself.
468 */
469 if (td->io_ops->commit == NULL)
470 io_u_queued(td, io_u);
471 break;
472 case FIO_Q_BUSY:
473 requeue_io_u(td, &io_u);
474 ret2 = td_io_commit(td);
475 if (ret2 < 0)
476 ret = ret2;
477 break;
478 default:
479 assert(ret < 0);
480 put_io_u(td, io_u);
481 break;
482 }
483
484 if (ret < 0 || td->error)
485 break;
486
487 /*
488 * See if we need to complete some commands
489 */
490 if (ret == FIO_Q_QUEUED || ret == FIO_Q_BUSY) {
491 min_evts = 0;
492 if (queue_full(td) || ret == FIO_Q_BUSY) {
493 min_evts = 1;
494
495 if (td->cur_depth > td->iodepth_low)
496 min_evts = td->cur_depth - td->iodepth_low;
497 }
498
499 fio_gettime(&comp_time, NULL);
500 bytes_done = io_u_queued_complete(td, min_evts);
501 if (bytes_done < 0)
502 break;
503 }
504
505 if (!bytes_done)
506 continue;
507
508 /*
509 * the rate is batched for now, it should work for batches
510 * of completions except the very first one which may look
511 * a little bursty
512 */
513 usec = utime_since(&s, &comp_time);
514
515 rate_throttle(td, usec, bytes_done);
516
517 if (check_min_rate(td, &comp_time)) {
518 if (exitall_on_terminate)
519 terminate_threads(td->groupid);
520 td_verror(td, ENODATA, "check_min_rate");
521 break;
522 }
523
524 if (td->thinktime) {
525 unsigned long long b;
526
527 b = td->io_blocks[0] + td->io_blocks[1];
528 if (!(b % td->thinktime_blocks)) {
529 int left;
530
531 if (td->thinktime_spin)
532 __usec_sleep(td->thinktime_spin);
533
534 left = td->thinktime - td->thinktime_spin;
535 if (left)
536 usec_sleep(td, left);
537 }
538 }
539 }
540
541 if (!td->error) {
542 struct fio_file *f;
543
544 i = td->cur_depth;
545 if (i)
546 ret = io_u_queued_complete(td, i);
547
548 if (should_fsync(td) && td->end_fsync) {
549 td_set_runstate(td, TD_FSYNCING);
550
551 for_each_file(td, f, i) {
552 if (!(f->flags & FIO_FILE_OPEN))
553 continue;
554 fio_io_sync(td, f);
555 }
556 }
557 } else
558 cleanup_pending_aio(td);
559}
560
561static void cleanup_io_u(struct thread_data *td)
562{
563 struct list_head *entry, *n;
564 struct io_u *io_u;
565
566 list_for_each_safe(entry, n, &td->io_u_freelist) {
567 io_u = list_entry(entry, struct io_u, list);
568
569 list_del(&io_u->list);
570 free(io_u);
571 }
572
573 free_io_mem(td);
574}
575
576/*
577 * "randomly" fill the buffer contents
578 */
579static void fill_rand_buf(struct io_u *io_u, int max_bs)
580{
581 int *ptr = io_u->buf;
582
583 while ((void *) ptr - io_u->buf < max_bs) {
584 *ptr = rand() * 0x9e370001;
585 ptr++;
586 }
587}
588
589static int init_io_u(struct thread_data *td)
590{
591 struct io_u *io_u;
592 unsigned int max_bs;
593 int i, max_units;
594 char *p;
595
596 if (td->io_ops->flags & FIO_SYNCIO)
597 max_units = 1;
598 else
599 max_units = td->iodepth;
600
601 max_bs = max(td->max_bs[DDIR_READ], td->max_bs[DDIR_WRITE]);
602 td->orig_buffer_size = max_bs * max_units;
603
604 if (td->mem_type == MEM_SHMHUGE || td->mem_type == MEM_MMAPHUGE)
605 td->orig_buffer_size = (td->orig_buffer_size + td->hugepage_size - 1) & ~(td->hugepage_size - 1);
606 else
607 td->orig_buffer_size += page_mask;
608
609 if (allocate_io_mem(td))
610 return 1;
611
612 p = ALIGN(td->orig_buffer);
613 for (i = 0; i < max_units; i++) {
614 io_u = malloc(sizeof(*io_u));
615 memset(io_u, 0, sizeof(*io_u));
616 INIT_LIST_HEAD(&io_u->list);
617
618 io_u->buf = p + max_bs * i;
619 if (td_write(td) || td_rw(td))
620 fill_rand_buf(io_u, max_bs);
621
622 io_u->index = i;
623 io_u->flags = IO_U_F_FREE;
624 list_add(&io_u->list, &td->io_u_freelist);
625 }
626
627 io_u_init_timeout();
628
629 return 0;
630}
631
632static int switch_ioscheduler(struct thread_data *td)
633{
634 char tmp[256], tmp2[128];
635 FILE *f;
636 int ret;
637
638 if (td->io_ops->flags & FIO_DISKLESSIO)
639 return 0;
640
641 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
642
643 f = fopen(tmp, "r+");
644 if (!f) {
645 td_verror(td, errno, "fopen");
646 return 1;
647 }
648
649 /*
650 * Set io scheduler.
651 */
652 ret = fwrite(td->ioscheduler, strlen(td->ioscheduler), 1, f);
653 if (ferror(f) || ret != 1) {
654 td_verror(td, errno, "fwrite");
655 fclose(f);
656 return 1;
657 }
658
659 rewind(f);
660
661 /*
662 * Read back and check that the selected scheduler is now the default.
663 */
664 ret = fread(tmp, 1, sizeof(tmp), f);
665 if (ferror(f) || ret < 0) {
666 td_verror(td, errno, "fread");
667 fclose(f);
668 return 1;
669 }
670
671 sprintf(tmp2, "[%s]", td->ioscheduler);
672 if (!strstr(tmp, tmp2)) {
673 log_err("fio: io scheduler %s not found\n", td->ioscheduler);
674 td_verror(td, EINVAL, "iosched_switch");
675 fclose(f);
676 return 1;
677 }
678
679 fclose(f);
680 return 0;
681}
682
683static int clear_io_state(struct thread_data *td)
684{
685 struct fio_file *f;
686 unsigned int i;
687 int ret;
688
689 td->ts.stat_io_bytes[0] = td->ts.stat_io_bytes[1] = 0;
690 td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
691 td->zone_bytes = 0;
692 td->rate_bytes = 0;
693 td->rate_blocks = 0;
694
695 td->last_was_sync = 0;
696
697 for_each_file(td, f, i)
698 td_io_close_file(td, f);
699
700 ret = 0;
701 for_each_file(td, f, i) {
702 ret = td_io_open_file(td, f);
703 if (ret)
704 break;
705 }
706
707 return ret;
708}
709
710/*
711 * Entry point for the thread based jobs. The process based jobs end up
712 * here as well, after a little setup.
713 */
714static void *thread_main(void *data)
715{
716 unsigned long long runtime[2];
717 struct thread_data *td = data;
718 int clear_state;
719
720 if (!td->use_thread)
721 setsid();
722
723 td->pid = getpid();
724
725 INIT_LIST_HEAD(&td->io_u_freelist);
726 INIT_LIST_HEAD(&td->io_u_busylist);
727 INIT_LIST_HEAD(&td->io_u_requeues);
728 INIT_LIST_HEAD(&td->io_hist_list);
729 INIT_LIST_HEAD(&td->io_log_list);
730
731 if (init_io_u(td))
732 goto err_sem;
733
734 if (fio_setaffinity(td) == -1) {
735 td_verror(td, errno, "cpu_set_affinity");
736 goto err_sem;
737 }
738
739 if (init_iolog(td))
740 goto err_sem;
741
742 if (td->ioprio) {
743 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
744 td_verror(td, errno, "ioprio_set");
745 goto err_sem;
746 }
747 }
748
749 if (nice(td->nice) == -1) {
750 td_verror(td, errno, "nice");
751 goto err_sem;
752 }
753
754 if (td->ioscheduler && switch_ioscheduler(td))
755 goto err_sem;
756
757 td_set_runstate(td, TD_INITIALIZED);
758 fio_sem_up(startup_sem);
759 fio_sem_down(td->mutex);
760
761 /*
762 * the ->mutex semaphore is now no longer used, close it to avoid
763 * eating a file descriptor
764 */
765 fio_sem_remove(td->mutex);
766
767 if (!td->create_serialize && setup_files(td))
768 goto err;
769
770 if (td_io_init(td))
771 goto err;
772
773 if (open_files(td))
774 goto err;
775
776 if (td->exec_prerun) {
777 if (system(td->exec_prerun) < 0)
778 goto err;
779 }
780
781 fio_gettime(&td->epoch, NULL);
782 memcpy(&td->timeout_end, &td->epoch, sizeof(td->epoch));
783 getrusage(RUSAGE_SELF, &td->ts.ru_start);
784
785 runtime[0] = runtime[1] = 0;
786 clear_state = 0;
787 while (td->loops--) {
788 fio_gettime(&td->start, NULL);
789 memcpy(&td->ts.stat_sample_time, &td->start, sizeof(td->start));
790
791 if (td->ratemin)
792 memcpy(&td->lastrate, &td->ts.stat_sample_time, sizeof(td->lastrate));
793
794 if (clear_state && clear_io_state(td))
795 break;
796
797 prune_io_piece_log(td);
798
799 do_io(td);
800
801 clear_state = 1;
802
803 if (td_read(td) && td->io_bytes[DDIR_READ])
804 runtime[DDIR_READ] += utime_since_now(&td->start);
805 if (td_write(td) && td->io_bytes[DDIR_WRITE])
806 runtime[DDIR_WRITE] += utime_since_now(&td->start);
807
808 if (td->error || td->terminate)
809 break;
810
811 if (td->verify == VERIFY_NONE)
812 continue;
813
814 if (clear_io_state(td))
815 break;
816
817 fio_gettime(&td->start, NULL);
818
819 do_verify(td);
820
821 runtime[DDIR_READ] += utime_since_now(&td->start);
822
823 if (td->error || td->terminate)
824 break;
825 }
826
827 update_rusage_stat(td);
828 td->ts.runtime[0] = runtime[0] / 1000;
829 td->ts.runtime[1] = runtime[1] / 1000;
830 td->ts.total_run_time = mtime_since_now(&td->epoch);
831 td->ts.io_bytes[0] = td->io_bytes[0];
832 td->ts.io_bytes[1] = td->io_bytes[1];
833
834 if (td->ts.bw_log)
835 finish_log(td, td->ts.bw_log, "bw");
836 if (td->ts.slat_log)
837 finish_log(td, td->ts.slat_log, "slat");
838 if (td->ts.clat_log)
839 finish_log(td, td->ts.clat_log, "clat");
840 if (td->write_iolog_file)
841 write_iolog_close(td);
842 if (td->exec_postrun) {
843 if (system(td->exec_postrun) < 0)
844 log_err("fio: postrun %s failed\n", td->exec_postrun);
845 }
846
847 if (exitall_on_terminate)
848 terminate_threads(td->groupid);
849
850err:
851 if (td->error)
852 printf("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
853 close_files(td);
854 close_ioengine(td);
855 cleanup_io_u(td);
856 td_set_runstate(td, TD_EXITED);
857 return (void *) (unsigned long) td->error;
858err_sem:
859 fio_sem_up(startup_sem);
860 goto err;
861}
862
863/*
864 * We cannot pass the td data into a forked process, so attach the td and
865 * pass it to the thread worker.
866 */
867static int fork_main(int shmid, int offset)
868{
869 struct thread_data *td;
870 void *data, *ret;
871
872 data = shmat(shmid, NULL, 0);
873 if (data == (void *) -1) {
874 int __err = errno;
875
876 perror("shmat");
877 return __err;
878 }
879
880 td = data + offset * sizeof(struct thread_data);
881 ret = thread_main(td);
882 shmdt(data);
883 return (int) (unsigned long) ret;
884}
885
886/*
887 * Run over the job map and reap the threads that have exited, if any.
888 */
889static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
890{
891 struct thread_data *td;
892 int i, cputhreads, pending, status, ret;
893
894 /*
895 * reap exited threads (TD_EXITED -> TD_REAPED)
896 */
897 pending = cputhreads = 0;
898 for_each_td(td, i) {
899 int flags = 0;
900
901 /*
902 * ->io_ops is NULL for a thread that has closed its
903 * io engine
904 */
905 if (td->io_ops && !strcmp(td->io_ops->name, "cpuio"))
906 cputhreads++;
907
908 if (!td->pid || td->runstate == TD_REAPED)
909 continue;
910 if (td->use_thread) {
911 if (td->runstate == TD_EXITED) {
912 td_set_runstate(td, TD_REAPED);
913 goto reaped;
914 }
915 continue;
916 }
917
918 flags = WNOHANG;
919 if (td->runstate == TD_EXITED)
920 flags = 0;
921
922 /*
923 * check if someone quit or got killed in an unusual way
924 */
925 ret = waitpid(td->pid, &status, flags);
926 if (ret < 0) {
927 if (errno == ECHILD) {
928 log_err("fio: pid=%d disappeared %d\n", td->pid, td->runstate);
929 td_set_runstate(td, TD_REAPED);
930 goto reaped;
931 }
932 perror("waitpid");
933 } else if (ret == td->pid) {
934 if (WIFSIGNALED(status)) {
935 int sig = WTERMSIG(status);
936
937 if (sig != SIGQUIT)
938 log_err("fio: pid=%d, got signal=%d\n", td->pid, sig);
939 td_set_runstate(td, TD_REAPED);
940 goto reaped;
941 }
942 if (WIFEXITED(status)) {
943 if (WEXITSTATUS(status) && !td->error)
944 td->error = WEXITSTATUS(status);
945
946 td_set_runstate(td, TD_REAPED);
947 goto reaped;
948 }
949 }
950
951 /*
952 * thread is not dead, continue
953 */
954 continue;
955reaped:
956 if (td->use_thread) {
957 long ret;
958
959 if (pthread_join(td->thread, (void *) &ret))
960 perror("pthread_join");
961 }
962
963 (*nr_running)--;
964 (*m_rate) -= td->ratemin;
965 (*t_rate) -= td->rate;
966
967 if (td->error)
968 exit_value++;
969 }
970
971 if (*nr_running == cputhreads && !pending)
972 terminate_threads(TERMINATE_ALL);
973}
974
975/*
976 * Main function for kicking off and reaping jobs, as needed.
977 */
978static void run_threads(void)
979{
980 struct thread_data *td;
981 unsigned long spent;
982 int i, todo, nr_running, m_rate, t_rate, nr_started;
983
984 if (fio_pin_memory())
985 return;
986
987 if (!terse_output) {
988 printf("Starting ");
989 if (nr_thread)
990 printf("%d thread%s", nr_thread, nr_thread > 1 ? "s" : "");
991 if (nr_process) {
992 if (nr_thread)
993 printf(" and ");
994 printf("%d process%s", nr_process, nr_process > 1 ? "es" : "");
995 }
996 printf("\n");
997 fflush(stdout);
998 }
999
1000 signal(SIGINT, sig_handler);
1001 signal(SIGALRM, sig_handler);
1002
1003 todo = thread_number;
1004 nr_running = 0;
1005 nr_started = 0;
1006 m_rate = t_rate = 0;
1007
1008 for_each_td(td, i) {
1009 print_status_init(td->thread_number - 1);
1010
1011 if (!td->create_serialize) {
1012 init_disk_util(td);
1013 continue;
1014 }
1015
1016 /*
1017 * do file setup here so it happens sequentially,
1018 * we don't want X number of threads getting their
1019 * client data interspersed on disk
1020 */
1021 if (setup_files(td)) {
1022 exit_value++;
1023 if (td->error)
1024 log_err("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
1025 td_set_runstate(td, TD_REAPED);
1026 todo--;
1027 }
1028
1029 init_disk_util(td);
1030 }
1031
1032 set_genesis_time();
1033
1034 while (todo) {
1035 struct thread_data *map[MAX_JOBS];
1036 struct timeval this_start;
1037 int this_jobs = 0, left;
1038
1039 /*
1040 * create threads (TD_NOT_CREATED -> TD_CREATED)
1041 */
1042 for_each_td(td, i) {
1043 if (td->runstate != TD_NOT_CREATED)
1044 continue;
1045
1046 /*
1047 * never got a chance to start, killed by other
1048 * thread for some reason
1049 */
1050 if (td->terminate) {
1051 todo--;
1052 continue;
1053 }
1054
1055 if (td->start_delay) {
1056 spent = mtime_since_genesis();
1057
1058 if (td->start_delay * 1000 > spent)
1059 continue;
1060 }
1061
1062 if (td->stonewall && (nr_started || nr_running))
1063 break;
1064
1065 /*
1066 * Set state to created. Thread will transition
1067 * to TD_INITIALIZED when it's done setting up.
1068 */
1069 td_set_runstate(td, TD_CREATED);
1070 map[this_jobs++] = td;
1071 nr_started++;
1072
1073 if (td->use_thread) {
1074 if (pthread_create(&td->thread, NULL, thread_main, td)) {
1075 perror("thread_create");
1076 nr_started--;
1077 break;
1078 }
1079 } else {
1080 if (!fork()) {
1081 int ret = fork_main(shm_id, i);
1082
1083 exit(ret);
1084 }
1085 }
1086 fio_sem_down(startup_sem);
1087 }
1088
1089 /*
1090 * Wait for the started threads to transition to
1091 * TD_INITIALIZED.
1092 */
1093 fio_gettime(&this_start, NULL);
1094 left = this_jobs;
1095 while (left && !fio_abort) {
1096 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
1097 break;
1098
1099 usleep(100000);
1100
1101 for (i = 0; i < this_jobs; i++) {
1102 td = map[i];
1103 if (!td)
1104 continue;
1105 if (td->runstate == TD_INITIALIZED) {
1106 map[i] = NULL;
1107 left--;
1108 } else if (td->runstate >= TD_EXITED) {
1109 map[i] = NULL;
1110 left--;
1111 todo--;
1112 nr_running++; /* work-around... */
1113 }
1114 }
1115 }
1116
1117 if (left) {
1118 log_err("fio: %d jobs failed to start\n", left);
1119 for (i = 0; i < this_jobs; i++) {
1120 td = map[i];
1121 if (!td)
1122 continue;
1123 kill(td->pid, SIGTERM);
1124 }
1125 break;
1126 }
1127
1128 /*
1129 * start created threads (TD_INITIALIZED -> TD_RUNNING).
1130 */
1131 for_each_td(td, i) {
1132 if (td->runstate != TD_INITIALIZED)
1133 continue;
1134
1135 td_set_runstate(td, TD_RUNNING);
1136 nr_running++;
1137 nr_started--;
1138 m_rate += td->ratemin;
1139 t_rate += td->rate;
1140 todo--;
1141 fio_sem_up(td->mutex);
1142 }
1143
1144 reap_threads(&nr_running, &t_rate, &m_rate);
1145
1146 if (todo)
1147 usleep(100000);
1148 }
1149
1150 while (nr_running) {
1151 reap_threads(&nr_running, &t_rate, &m_rate);
1152 usleep(10000);
1153 }
1154
1155 update_io_ticks();
1156 fio_unpin_memory();
1157}
1158
1159int main(int argc, char *argv[])
1160{
1161 long ps;
1162
1163 /*
1164 * We need locale for number printing, if it isn't set then just
1165 * go with the US format.
1166 */
1167 if (!getenv("LC_NUMERIC"))
1168 setlocale(LC_NUMERIC, "en_US");
1169
1170 if (parse_options(argc, argv))
1171 return 1;
1172
1173 if (!thread_number) {
1174 log_err("Nothing to do\n");
1175 return 1;
1176 }
1177
1178 ps = sysconf(_SC_PAGESIZE);
1179 if (ps < 0) {
1180 log_err("Failed to get page size\n");
1181 return 1;
1182 }
1183
1184 page_size = ps;
1185 page_mask = ps - 1;
1186
1187 if (write_bw_log) {
1188 setup_log(&agg_io_log[DDIR_READ]);
1189 setup_log(&agg_io_log[DDIR_WRITE]);
1190 }
1191
1192 startup_sem = fio_sem_init(0);
1193
1194 set_genesis_time();
1195
1196 disk_util_timer_arm();
1197
1198 run_threads();
1199
1200 if (!fio_abort) {
1201 show_run_stats();
1202 if (write_bw_log) {
1203 __finish_log(agg_io_log[DDIR_READ],"agg-read_bw.log");
1204 __finish_log(agg_io_log[DDIR_WRITE],"agg-write_bw.log");
1205 }
1206 }
1207
1208 fio_sem_remove(startup_sem);
1209 return exit_value;
1210}