fio.c

   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 "hash.h"
  39
  40 unsigned long page_mask;
  41 unsigned long page_size;
  42 #define ALIGN(buf)      \
  43         (char *) (((unsigned long) (buf) + page_mask) & ~page_mask)
  44
  45 int groupid = 0;
  46 int thread_number = 0;
  47 int nr_process = 0;
  48 int nr_thread = 0;
  49 int shm_id = 0;
  50 int temp_stall_ts;
  51
  52 static struct fio_sem *startup_sem;
  53 static volatile int fio_abort;
  54 static int exit_value;
  55
  56 struct io_log *agg_io_log[2];
  57
  58 #define TERMINATE_ALL           (-1)
  59 #define JOB_START_TIMEOUT       (5 * 1000)
  60
  61 static inline void td_set_runstate(struct thread_data *td, int runstate)
  62 {
  63         td->runstate = runstate;
  64 }
  65
  66 static 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->o.start_delay = 0;
  80                 }
  81         }
  82 }
  83
  84 static 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  */
 103 static 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->o.ratemin && !td->o.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->o.ratecycle)
 137                         return 0;
 138
 139                 if (td->o.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->o.name, td->o.ratemin);
 145                                 return 1;
 146                         } else {
 147                                 rate = (bytes - td->rate_bytes) / spent;
 148                                 if (rate < td->o.ratemin || bytes < td->rate_bytes) {
 149                                         log_err("%s: min rate %u not met, got %luKiB/sec\n", td->o.name, td->o.ratemin, rate);
 150                                         return 1;
 151                                 }
 152                         }
 153                 } else {
 154                         /*
 155                          * checks iops specified rate
 156                          */
 157                         if (iops < td->o.rate_iops) {
 158                                 log_err("%s: min iops rate %u not met\n", td->o.name, td->o.rate_iops);
 159                                 return 1;
 160                         } else {
 161                                 rate = (iops - td->rate_blocks) / spent;
 162                                 if (rate < td->o.rate_iops_min || iops < td->rate_blocks) {
 163                                         log_err("%s: min iops rate %u not met, got %lu\n", td->o.name, td->o.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
 175 static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
 176 {
 177         if (!td->o.timeout)
 178                 return 0;
 179         if (mtime_since(&td->epoch, t) >= td->o.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  */
 189 static 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  */
 233 static 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
 249 requeue:
 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  */
 279 static 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                         td->terminate = 1;
 315                         break;
 316                 }
 317
 318                 if (get_next_verify(td, io_u)) {
 319                         put_io_u(td, io_u);
 320                         break;
 321                 }
 322
 323                 if (td_io_prep(td, io_u)) {
 324                         put_io_u(td, io_u);
 325                         break;
 326                 }
 327
 328                 io_u->end_io = verify_io_u;
 329
 330                 ret = td_io_queue(td, io_u);
 331                 switch (ret) {
 332                 case FIO_Q_COMPLETED:
 333                         if (io_u->error)
 334                                 ret = -io_u->error;
 335                         else if (io_u->resid) {
 336                                 int bytes = io_u->xfer_buflen - io_u->resid;
 337                                 struct fio_file *f = io_u->file;
 338
 339                                 /*
 340                                  * zero read, fail
 341                                  */
 342                                 if (!bytes) {
 343                                         td_verror(td, ENODATA, "full resid");
 344                                         put_io_u(td, io_u);
 345                                         break;
 346                                 }
 347
 348                                 io_u->xfer_buflen = io_u->resid;
 349                                 io_u->xfer_buf += bytes;
 350                                 io_u->offset += bytes;
 351                                 f->last_completed_pos = io_u->offset;
 352
 353                                 td->ts.short_io_u[io_u->ddir]++;
 354
 355                                 if (io_u->offset == f->real_file_size)
 356                                         goto sync_done;
 357
 358                                 requeue_io_u(td, &io_u);
 359                         } else {
 360 sync_done:
 361                                 ret = io_u_sync_complete(td, io_u);
 362                                 if (ret < 0)
 363                                         break;
 364                         }
 365                         continue;
 366                 case FIO_Q_QUEUED:
 367                         break;
 368                 case FIO_Q_BUSY:
 369                         requeue_io_u(td, &io_u);
 370                         ret2 = td_io_commit(td);
 371                         if (ret2 < 0)
 372                                 ret = ret2;
 373                         break;
 374                 default:
 375                         assert(ret < 0);
 376                         td_verror(td, -ret, "td_io_queue");
 377                         break;
 378                 }
 379
 380                 if (ret < 0 || td->error)
 381                         break;
 382
 383                 /*
 384                  * if we can queue more, do so. but check if there are
 385                  * completed io_u's first.
 386                  */
 387                 min_events = 0;
 388                 if (queue_full(td) || ret == FIO_Q_BUSY) {
 389                         min_events = 1;
 390
 391                         if (td->cur_depth > td->o.iodepth_low)
 392                                 min_events = td->cur_depth - td->o.iodepth_low;
 393                 }
 394
 395                 /*
 396                  * Reap required number of io units, if any, and do the
 397                  * verification on them through the callback handler
 398                  */
 399                 if (io_u_queued_complete(td, min_events) < 0)
 400                         break;
 401         }
 402
 403         if (!td->error) {
 404                 min_events = td->cur_depth;
 405
 406                 if (min_events)
 407                         ret = io_u_queued_complete(td, min_events);
 408         } else
 409                 cleanup_pending_aio(td);
 410
 411         td_set_runstate(td, TD_RUNNING);
 412 }
 413
 414 /*
 415  * Main IO worker function. It retrieves io_u's to process and queues
 416  * and reaps them, checking for rate and errors along the way.
 417  */
 418 static void do_io(struct thread_data *td)
 419 {
 420         struct timeval s;
 421         unsigned long usec;
 422         unsigned int i;
 423         int ret = 0;
 424
 425         td_set_runstate(td, TD_RUNNING);
 426
 427         while ((td->this_io_bytes[0] + td->this_io_bytes[1]) < td->o.size) {
 428                 struct timeval comp_time;
 429                 long bytes_done = 0;
 430                 int min_evts = 0;
 431                 struct io_u *io_u;
 432                 int ret2;
 433
 434                 if (td->terminate)
 435                         break;
 436
 437                 io_u = get_io_u(td);
 438                 if (!io_u)
 439                         break;
 440
 441                 memcpy(&s, &io_u->start_time, sizeof(s));
 442
 443                 if (runtime_exceeded(td, &s)) {
 444                         put_io_u(td, io_u);
 445                         td->terminate = 1;
 446                         break;
 447                 }
 448
 449                 ret = td_io_queue(td, io_u);
 450                 switch (ret) {
 451                 case FIO_Q_COMPLETED:
 452                         if (io_u->error)
 453                                 ret = -io_u->error;
 454                         else if (io_u->resid) {
 455                                 int bytes = io_u->xfer_buflen - io_u->resid;
 456                                 struct fio_file *f = io_u->file;
 457
 458                                 /*
 459                                  * zero read, fail
 460                                  */
 461                                 if (!bytes) {
 462                                         td_verror(td, ENODATA, "full resid");
 463                                         put_io_u(td, io_u);
 464                                         break;
 465                                 }
 466
 467                                 io_u->xfer_buflen = io_u->resid;
 468                                 io_u->xfer_buf += bytes;
 469                                 io_u->offset += bytes;
 470                                 f->last_completed_pos = io_u->offset;
 471
 472                                 td->ts.short_io_u[io_u->ddir]++;
 473
 474                                 if (io_u->offset == f->real_file_size)
 475                                         goto sync_done;
 476
 477                                 requeue_io_u(td, &io_u);
 478                         } else {
 479 sync_done:
 480                                 fio_gettime(&comp_time, NULL);
 481                                 bytes_done = io_u_sync_complete(td, io_u);
 482                                 if (bytes_done < 0)
 483                                         ret = bytes_done;
 484                         }
 485                         break;
 486                 case FIO_Q_QUEUED:
 487                         /*
 488                          * if the engine doesn't have a commit hook,
 489                          * the io_u is really queued. if it does have such
 490                          * a hook, it has to call io_u_queued() itself.
 491                          */
 492                         if (td->io_ops->commit == NULL)
 493                                 io_u_queued(td, io_u);
 494                         break;
 495                 case FIO_Q_BUSY:
 496                         requeue_io_u(td, &io_u);
 497                         ret2 = td_io_commit(td);
 498                         if (ret2 < 0)
 499                                 ret = ret2;
 500                         break;
 501                 default:
 502                         assert(ret < 0);
 503                         put_io_u(td, io_u);
 504                         break;
 505                 }
 506
 507                 if (ret < 0 || td->error)
 508                         break;
 509
 510                 /*
 511                  * See if we need to complete some commands
 512                  */
 513                 if (ret == FIO_Q_QUEUED || ret == FIO_Q_BUSY) {
 514                         min_evts = 0;
 515                         if (queue_full(td) || ret == FIO_Q_BUSY) {
 516                                 min_evts = 1;
 517
 518                                 if (td->cur_depth > td->o.iodepth_low)
 519                                         min_evts = td->cur_depth - td->o.iodepth_low;
 520                         }
 521
 522                         fio_gettime(&comp_time, NULL);
 523                         bytes_done = io_u_queued_complete(td, min_evts);
 524                         if (bytes_done < 0)
 525                                 break;
 526                 }
 527
 528                 if (!bytes_done)
 529                         continue;
 530
 531                 /*
 532                  * the rate is batched for now, it should work for batches
 533                  * of completions except the very first one which may look
 534                  * a little bursty
 535                  */
 536                 usec = utime_since(&s, &comp_time);
 537
 538                 rate_throttle(td, usec, bytes_done);
 539
 540                 if (check_min_rate(td, &comp_time)) {
 541                         if (exitall_on_terminate)
 542                                 terminate_threads(td->groupid);
 543                         td_verror(td, ENODATA, "check_min_rate");
 544                         break;
 545                 }
 546
 547                 if (td->o.thinktime) {
 548                         unsigned long long b;
 549
 550                         b = td->io_blocks[0] + td->io_blocks[1];
 551                         if (!(b % td->o.thinktime_blocks)) {
 552                                 int left;
 553
 554                                 if (td->o.thinktime_spin)
 555                                         __usec_sleep(td->o.thinktime_spin);
 556
 557                                 left = td->o.thinktime - td->o.thinktime_spin;
 558                                 if (left)
 559                                         usec_sleep(td, left);
 560                         }
 561                 }
 562         }
 563
 564         if (!td->error) {
 565                 struct fio_file *f;
 566
 567                 i = td->cur_depth;
 568                 if (i)
 569                         ret = io_u_queued_complete(td, i);
 570
 571                 if (should_fsync(td) && td->o.end_fsync) {
 572                         td_set_runstate(td, TD_FSYNCING);
 573
 574                         for_each_file(td, f, i) {
 575                                 if (!(f->flags & FIO_FILE_OPEN))
 576                                         continue;
 577                                 fio_io_sync(td, f);
 578                         }
 579                 }
 580         } else
 581                 cleanup_pending_aio(td);
 582 }
 583
 584 static void cleanup_io_u(struct thread_data *td)
 585 {
 586         struct list_head *entry, *n;
 587         struct io_u *io_u;
 588
 589         list_for_each_safe(entry, n, &td->io_u_freelist) {
 590                 io_u = list_entry(entry, struct io_u, list);
 591
 592                 list_del(&io_u->list);
 593                 free(io_u);
 594         }
 595
 596         free_io_mem(td);
 597 }
 598
 599 /*
 600  * "randomly" fill the buffer contents
 601  */
 602 static void fill_io_buf(struct thread_data *td, struct io_u *io_u, int max_bs)
 603 {
 604         long *ptr = io_u->buf;
 605
 606         if (!td->o.zero_buffers) {
 607                 while ((void *) ptr - io_u->buf < max_bs) {
 608                         *ptr = rand() * GOLDEN_RATIO_PRIME;
 609                         ptr++;
 610                 }
 611         } else
 612                 memset(ptr, 0, max_bs);
 613 }
 614
 615 static int init_io_u(struct thread_data *td)
 616 {
 617         unsigned long long buf_size;
 618         struct io_u *io_u;
 619         unsigned int max_bs;
 620         int i, max_units;
 621         char *p;
 622
 623         if (td->io_ops->flags & FIO_SYNCIO)
 624                 max_units = 1;
 625         else
 626                 max_units = td->o.iodepth;
 627
 628         max_bs = max(td->o.max_bs[DDIR_READ], td->o.max_bs[DDIR_WRITE]);
 629         buf_size = (unsigned long long) max_bs * (unsigned long long) max_units;
 630         buf_size += page_mask;
 631         if (buf_size != (size_t) buf_size) {
 632                 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
 633                 return 1;
 634         }
 635
 636         td->orig_buffer_size = buf_size;
 637
 638         if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE)
 639                 td->orig_buffer_size = (td->orig_buffer_size + td->o.hugepage_size - 1) & ~(td->o.hugepage_size - 1);
 640         else if (td->orig_buffer_size & page_mask)
 641                 td->orig_buffer_size = (td->orig_buffer_size + page_mask) & ~page_mask;
 642
 643         if (allocate_io_mem(td))
 644                 return 1;
 645
 646         p = ALIGN(td->orig_buffer);
 647         for (i = 0; i < max_units; i++) {
 648                 if (td->terminate)
 649                         return 1;
 650                 io_u = malloc(sizeof(*io_u));
 651                 memset(io_u, 0, sizeof(*io_u));
 652                 INIT_LIST_HEAD(&io_u->list);
 653
 654                 io_u->buf = p + max_bs * i;
 655
 656                 if (td_write(td))
 657                         fill_io_buf(td, io_u, max_bs);
 658
 659                 io_u->index = i;
 660                 io_u->flags = IO_U_F_FREE;
 661                 list_add(&io_u->list, &td->io_u_freelist);
 662         }
 663
 664         io_u_init_timeout();
 665
 666         return 0;
 667 }
 668
 669 static int switch_ioscheduler(struct thread_data *td)
 670 {
 671         char tmp[256], tmp2[128];
 672         FILE *f;
 673         int ret;
 674
 675         if (td->io_ops->flags & FIO_DISKLESSIO)
 676                 return 0;
 677
 678         sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
 679
 680         f = fopen(tmp, "r+");
 681         if (!f) {
 682                 if (errno == ENOENT) {
 683                         log_err("fio: os or kernel doesn't support IO scheduler switching\n");
 684                         return 0;
 685                 }
 686                 td_verror(td, errno, "fopen iosched");
 687                 return 1;
 688         }
 689
 690         /*
 691          * Set io scheduler.
 692          */
 693         ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
 694         if (ferror(f) || ret != 1) {
 695                 td_verror(td, errno, "fwrite");
 696                 fclose(f);
 697                 return 1;
 698         }
 699
 700         rewind(f);
 701
 702         /*
 703          * Read back and check that the selected scheduler is now the default.
 704          */
 705         ret = fread(tmp, 1, sizeof(tmp), f);
 706         if (ferror(f) || ret < 0) {
 707                 td_verror(td, errno, "fread");
 708                 fclose(f);
 709                 return 1;
 710         }
 711
 712         sprintf(tmp2, "[%s]", td->o.ioscheduler);
 713         if (!strstr(tmp, tmp2)) {
 714                 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
 715                 td_verror(td, EINVAL, "iosched_switch");
 716                 fclose(f);
 717                 return 1;
 718         }
 719
 720         fclose(f);
 721         return 0;
 722 }
 723
 724 static int clear_io_state(struct thread_data *td)
 725 {
 726         struct fio_file *f;
 727         unsigned int i;
 728         int ret;
 729
 730         td->ts.stat_io_bytes[0] = td->ts.stat_io_bytes[1] = 0;
 731         td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
 732         td->zone_bytes = 0;
 733         td->rate_bytes = 0;
 734         td->rate_blocks = 0;
 735         td->rw_end_set[0] = td->rw_end_set[1] = 0;
 736
 737         td->last_was_sync = 0;
 738
 739         td->nr_done_files = 0;
 740
 741         for_each_file(td, f, i)
 742                 td_io_close_file(td, f);
 743
 744         ret = 0;
 745         for_each_file(td, f, i) {
 746                 f->flags &= ~FIO_FILE_DONE;
 747                 ret = td_io_open_file(td, f);
 748                 if (ret)
 749                         break;
 750         }
 751
 752         return ret;
 753 }
 754
 755 /*
 756  * Entry point for the thread based jobs. The process based jobs end up
 757  * here as well, after a little setup.
 758  */
 759 static void *thread_main(void *data)
 760 {
 761         unsigned long long runtime[2];
 762         struct thread_data *td = data;
 763         unsigned long elapsed;
 764         int clear_state;
 765
 766         if (!td->o.use_thread)
 767                 setsid();
 768
 769         td->pid = getpid();
 770
 771         INIT_LIST_HEAD(&td->io_u_freelist);
 772         INIT_LIST_HEAD(&td->io_u_busylist);
 773         INIT_LIST_HEAD(&td->io_u_requeues);
 774         INIT_LIST_HEAD(&td->io_log_list);
 775         INIT_LIST_HEAD(&td->io_hist_list);
 776         td->io_hist_tree = RB_ROOT;
 777
 778         td_set_runstate(td, TD_INITIALIZED);
 779         fio_sem_up(startup_sem);
 780         fio_sem_down(td->mutex);
 781
 782         /*
 783          * the ->mutex semaphore is now no longer used, close it to avoid
 784          * eating a file descriptor
 785          */
 786         fio_sem_remove(td->mutex);
 787
 788         /*
 789          * May alter parameters that init_io_u() will use, so we need to
 790          * do this first.
 791          */
 792         if (init_iolog(td))
 793                 goto err;
 794
 795         if (init_io_u(td))
 796                 goto err;
 797
 798         if (td->o.cpumask_set && fio_setaffinity(td) == -1) {
 799                 td_verror(td, errno, "cpu_set_affinity");
 800                 goto err;
 801         }
 802
 803         if (td->ioprio) {
 804                 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
 805                         td_verror(td, errno, "ioprio_set");
 806                         goto err;
 807                 }
 808         }
 809
 810         if (nice(td->o.nice) == -1) {
 811                 td_verror(td, errno, "nice");
 812                 goto err;
 813         }
 814
 815         if (td->o.ioscheduler && switch_ioscheduler(td))
 816                 goto err;
 817
 818         if (!td->o.create_serialize && setup_files(td))
 819                 goto err;
 820
 821         if (td_io_init(td))
 822                 goto err;
 823
 824         if (open_files(td))
 825                 goto err;
 826
 827         if (init_random_map(td))
 828                 goto err;
 829
 830         if (td->o.exec_prerun) {
 831                 if (system(td->o.exec_prerun) < 0)
 832                         goto err;
 833         }
 834
 835         fio_gettime(&td->epoch, NULL);
 836         memcpy(&td->timeout_end, &td->epoch, sizeof(td->epoch));
 837         getrusage(RUSAGE_SELF, &td->ts.ru_start);
 838
 839         runtime[0] = runtime[1] = 0;
 840         clear_state = 0;
 841         while (td->o.time_based || td->o.loops--) {
 842                 fio_gettime(&td->start, NULL);
 843                 memcpy(&td->ts.stat_sample_time, &td->start, sizeof(td->start));
 844
 845                 if (td->o.ratemin)
 846                         memcpy(&td->lastrate, &td->ts.stat_sample_time, sizeof(td->lastrate));
 847
 848                 if (clear_state && clear_io_state(td))
 849                         break;
 850
 851                 prune_io_piece_log(td);
 852
 853                 do_io(td);
 854
 855                 clear_state = 1;
 856
 857                 if (td_read(td) && td->io_bytes[DDIR_READ]) {
 858                         if (td->rw_end_set[DDIR_READ])
 859                                 elapsed = utime_since(&td->start, &td->rw_end[DDIR_READ]);
 860                         else
 861                                 elapsed = utime_since_now(&td->start);
 862
 863                         runtime[DDIR_READ] += elapsed;
 864                 }
 865                 if (td_write(td) && td->io_bytes[DDIR_WRITE]) {
 866                         if (td->rw_end_set[DDIR_WRITE])
 867                                 elapsed = utime_since(&td->start, &td->rw_end[DDIR_WRITE]);
 868                         else
 869                                 elapsed = utime_since_now(&td->start);
 870
 871                         runtime[DDIR_WRITE] += elapsed;
 872                 }
 873
 874                 if (td->error || td->terminate)
 875                         break;
 876
 877                 if (td->o.verify == VERIFY_NONE)
 878                         continue;
 879
 880                 if (clear_io_state(td))
 881                         break;
 882
 883                 fio_gettime(&td->start, NULL);
 884
 885                 do_verify(td);
 886
 887                 runtime[DDIR_READ] += utime_since_now(&td->start);
 888
 889                 if (td->error || td->terminate)
 890                         break;
 891         }
 892
 893         update_rusage_stat(td);
 894         td->ts.runtime[0] = runtime[0] / 1000;
 895         td->ts.runtime[1] = runtime[1] / 1000;
 896         td->ts.total_run_time = mtime_since_now(&td->epoch);
 897         td->ts.io_bytes[0] = td->io_bytes[0];
 898         td->ts.io_bytes[1] = td->io_bytes[1];
 899
 900         if (td->ts.bw_log)
 901                 finish_log(td, td->ts.bw_log, "bw");
 902         if (td->ts.slat_log)
 903                 finish_log(td, td->ts.slat_log, "slat");
 904         if (td->ts.clat_log)
 905                 finish_log(td, td->ts.clat_log, "clat");
 906         if (td->o.write_iolog_file)
 907                 write_iolog_close(td);
 908         if (td->o.exec_postrun) {
 909                 if (system(td->o.exec_postrun) < 0)
 910                         log_err("fio: postrun %s failed\n", td->o.exec_postrun);
 911         }
 912
 913         if (exitall_on_terminate)
 914                 terminate_threads(td->groupid);
 915
 916 err:
 917         if (td->error)
 918                 printf("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
 919         close_files(td);
 920         close_ioengine(td);
 921         cleanup_io_u(td);
 922         options_mem_free(td);
 923         td_set_runstate(td, TD_EXITED);
 924         return (void *) (unsigned long) td->error;
 925 }
 926
 927 /*
 928  * We cannot pass the td data into a forked process, so attach the td and
 929  * pass it to the thread worker.
 930  */
 931 static int fork_main(int shmid, int offset)
 932 {
 933         struct thread_data *td;
 934         void *data, *ret;
 935
 936         data = shmat(shmid, NULL, 0);
 937         if (data == (void *) -1) {
 938                 int __err = errno;
 939
 940                 perror("shmat");
 941                 return __err;
 942         }
 943
 944         td = data + offset * sizeof(struct thread_data);
 945         ret = thread_main(td);
 946         shmdt(data);
 947         return (int) (unsigned long) ret;
 948 }
 949
 950 /*
 951  * Run over the job map and reap the threads that have exited, if any.
 952  */
 953 static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
 954 {
 955         struct thread_data *td;
 956         int i, cputhreads, pending, status, ret;
 957
 958         /*
 959          * reap exited threads (TD_EXITED -> TD_REAPED)
 960          */
 961         pending = cputhreads = 0;
 962         for_each_td(td, i) {
 963                 int flags = 0;
 964
 965                 /*
 966                  * ->io_ops is NULL for a thread that has closed its
 967                  * io engine
 968                  */
 969                 if (td->io_ops && !strcmp(td->io_ops->name, "cpuio"))
 970                         cputhreads++;
 971
 972                 if (!td->pid || td->runstate == TD_REAPED)
 973                         continue;
 974                 if (td->o.use_thread) {
 975                         if (td->runstate == TD_EXITED) {
 976                                 td_set_runstate(td, TD_REAPED);
 977                                 goto reaped;
 978                         }
 979                         continue;
 980                 }
 981
 982                 flags = WNOHANG;
 983                 if (td->runstate == TD_EXITED)
 984                         flags = 0;
 985
 986                 /*
 987                  * check if someone quit or got killed in an unusual way
 988                  */
 989                 ret = waitpid(td->pid, &status, flags);
 990                 if (ret < 0) {
 991                         if (errno == ECHILD) {
 992                                 log_err("fio: pid=%d disappeared %d\n", td->pid, td->runstate);
 993                                 td_set_runstate(td, TD_REAPED);
 994                                 goto reaped;
 995                         }
 996                         perror("waitpid");
 997                 } else if (ret == td->pid) {
 998                         if (WIFSIGNALED(status)) {
 999                                 int sig = WTERMSIG(status);
1000
1001                                 if (sig != SIGQUIT)
1002                                         log_err("fio: pid=%d, got signal=%d\n", td->pid, sig);
1003                                 td_set_runstate(td, TD_REAPED);
1004                                 goto reaped;
1005                         }
1006                         if (WIFEXITED(status)) {
1007                                 if (WEXITSTATUS(status) && !td->error)
1008                                         td->error = WEXITSTATUS(status);
1009
1010                                 td_set_runstate(td, TD_REAPED);
1011                                 goto reaped;
1012                         }
1013                 }
1014
1015                 /*
1016                  * thread is not dead, continue
1017                  */
1018                 pending++;
1019                 continue;
1020 reaped:
1021                 if (td->o.use_thread) {
1022                         long ret;
1023
1024                         if (pthread_join(td->thread, (void *) &ret))
1025                                 perror("pthread_join");
1026                 }
1027
1028                 (*nr_running)--;
1029                 (*m_rate) -= td->o.ratemin;
1030                 (*t_rate) -= td->o.rate;
1031                 pending--;
1032
1033                 if (td->error)
1034                         exit_value++;
1035         }
1036
1037         if (*nr_running == cputhreads && !pending)
1038                 terminate_threads(TERMINATE_ALL);
1039 }
1040
1041 /*
1042  * Main function for kicking off and reaping jobs, as needed.
1043  */
1044 static void run_threads(void)
1045 {
1046         struct thread_data *td;
1047         unsigned long spent;
1048         int i, todo, nr_running, m_rate, t_rate, nr_started;
1049
1050         if (fio_pin_memory())
1051                 return;
1052
1053         if (!terse_output) {
1054                 printf("Starting ");
1055                 if (nr_thread)
1056                         printf("%d thread%s", nr_thread, nr_thread > 1 ? "s" : "");
1057                 if (nr_process) {
1058                         if (nr_thread)
1059                                 printf(" and ");
1060                         printf("%d process%s", nr_process, nr_process > 1 ? "es" : "");
1061                 }
1062                 printf("\n");
1063                 fflush(stdout);
1064         }
1065
1066         signal(SIGINT, sig_handler);
1067         signal(SIGALRM, sig_handler);
1068
1069         todo = thread_number;
1070         nr_running = 0;
1071         nr_started = 0;
1072         m_rate = t_rate = 0;
1073
1074         for_each_td(td, i) {
1075                 print_status_init(td->thread_number - 1);
1076
1077                 if (!td->o.create_serialize) {
1078                         init_disk_util(td);
1079                         continue;
1080                 }
1081
1082                 /*
1083                  * do file setup here so it happens sequentially,
1084                  * we don't want X number of threads getting their
1085                  * client data interspersed on disk
1086                  */
1087                 if (setup_files(td)) {
1088                         exit_value++;
1089                         if (td->error)
1090                                 log_err("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
1091                         td_set_runstate(td, TD_REAPED);
1092                         todo--;
1093                 }
1094
1095                 init_disk_util(td);
1096         }
1097
1098         set_genesis_time();
1099
1100         while (todo) {
1101                 struct thread_data *map[MAX_JOBS];
1102                 struct timeval this_start;
1103                 int this_jobs = 0, left;
1104
1105                 /*
1106                  * create threads (TD_NOT_CREATED -> TD_CREATED)
1107                  */
1108                 for_each_td(td, i) {
1109                         if (td->runstate != TD_NOT_CREATED)
1110                                 continue;
1111
1112                         /*
1113                          * never got a chance to start, killed by other
1114                          * thread for some reason
1115                          */
1116                         if (td->terminate) {
1117                                 todo--;
1118                                 continue;
1119                         }
1120
1121                         if (td->o.start_delay) {
1122                                 spent = mtime_since_genesis();
1123
1124                                 if (td->o.start_delay * 1000 > spent)
1125                                         continue;
1126                         }
1127
1128                         if (td->o.stonewall && (nr_started || nr_running))
1129                                 break;
1130
1131                         /*
1132                          * Set state to created. Thread will transition
1133                          * to TD_INITIALIZED when it's done setting up.
1134                          */
1135                         td_set_runstate(td, TD_CREATED);
1136                         map[this_jobs++] = td;
1137                         nr_started++;
1138
1139                         if (td->o.use_thread) {
1140                                 if (pthread_create(&td->thread, NULL, thread_main, td)) {
1141                                         perror("thread_create");
1142                                         nr_started--;
1143                                         break;
1144                                 }
1145                         } else {
1146                                 if (!fork()) {
1147                                         int ret = fork_main(shm_id, i);
1148
1149                                         exit(ret);
1150                                 }
1151                         }
1152                         fio_sem_down(startup_sem);
1153                 }
1154
1155                 /*
1156                  * Wait for the started threads to transition to
1157                  * TD_INITIALIZED.
1158                  */
1159                 fio_gettime(&this_start, NULL);
1160                 left = this_jobs;
1161                 while (left && !fio_abort) {
1162                         if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
1163                                 break;
1164
1165                         usleep(100000);
1166
1167                         for (i = 0; i < this_jobs; i++) {
1168                                 td = map[i];
1169                                 if (!td)
1170                                         continue;
1171                                 if (td->runstate == TD_INITIALIZED) {
1172                                         map[i] = NULL;
1173                                         left--;
1174                                 } else if (td->runstate >= TD_EXITED) {
1175                                         map[i] = NULL;
1176                                         left--;
1177                                         todo--;
1178                                         nr_running++; /* work-around... */
1179                                 }
1180                         }
1181                 }
1182
1183                 if (left) {
1184                         log_err("fio: %d jobs failed to start\n", left);
1185                         for (i = 0; i < this_jobs; i++) {
1186                                 td = map[i];
1187                                 if (!td)
1188                                         continue;
1189                                 kill(td->pid, SIGTERM);
1190                         }
1191                         break;
1192                 }
1193
1194                 /*
1195                  * start created threads (TD_INITIALIZED -> TD_RUNNING).
1196                  */
1197                 for_each_td(td, i) {
1198                         if (td->runstate != TD_INITIALIZED)
1199                                 continue;
1200
1201                         td_set_runstate(td, TD_RUNNING);
1202                         nr_running++;
1203                         nr_started--;
1204                         m_rate += td->o.ratemin;
1205                         t_rate += td->o.rate;
1206                         todo--;
1207                         fio_sem_up(td->mutex);
1208                 }
1209
1210                 reap_threads(&nr_running, &t_rate, &m_rate);
1211
1212                 if (todo)
1213                         usleep(100000);
1214         }
1215
1216         while (nr_running) {
1217                 reap_threads(&nr_running, &t_rate, &m_rate);
1218                 usleep(10000);
1219         }
1220
1221         update_io_ticks();
1222         fio_unpin_memory();
1223 }
1224
1225 int main(int argc, char *argv[])
1226 {
1227         long ps;
1228
1229         /*
1230          * We need locale for number printing, if it isn't set then just
1231          * go with the US format.
1232          */
1233         if (!getenv("LC_NUMERIC"))
1234                 setlocale(LC_NUMERIC, "en_US");
1235
1236         if (parse_options(argc, argv))
1237                 return 1;
1238
1239         if (!thread_number)
1240                 return 0;
1241
1242         ps = sysconf(_SC_PAGESIZE);
1243         if (ps < 0) {
1244                 log_err("Failed to get page size\n");
1245                 return 1;
1246         }
1247
1248         page_size = ps;
1249         page_mask = ps - 1;
1250
1251         if (write_bw_log) {
1252                 setup_log(&agg_io_log[DDIR_READ]);
1253                 setup_log(&agg_io_log[DDIR_WRITE]);
1254         }
1255
1256         startup_sem = fio_sem_init(0);
1257
1258         set_genesis_time();
1259
1260         disk_util_timer_arm();
1261
1262         run_threads();
1263
1264         if (!fio_abort) {
1265                 show_run_stats();
1266                 if (write_bw_log) {
1267                         __finish_log(agg_io_log[DDIR_READ],"agg-read_bw.log");
1268                         __finish_log(agg_io_log[DDIR_WRITE],"agg-write_bw.log");
1269                 }
1270         }
1271
1272         fio_sem_remove(startup_sem);
1273         return exit_value;
1274 }