btt/bt_timeline.c

   1 /*
   2  * blktrace output analysis: generate a timeline & gather statistics
   3  *
   4  * Copyright (C) 2006 Alan D. Brunelle <Alan.Brunelle@hp.com>
   5  *
   6  *  This program is free software; you can redistribute it and/or modify
   7  *  it under the terms of the GNU General Public License as published by
   8  *  the Free Software Foundation; either version 2 of the License, or
   9  *  (at your option) any later version.
  10  *
  11  *  This program is distributed in the hope that it will be useful,
  12  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  13  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14  *  GNU General Public License for more details.
  15  *
  16  *  You should have received a copy of the GNU General Public License
  17  *  along with this program; if not, write to the Free Software
  18  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  19  *
  20  */
  21 #include <stdio.h>
  22 #include <string.h>
  23 #include <unistd.h>
  24 #include <sys/time.h>
  25 #include <time.h>
  26 #include "globals.h"
  27
  28 char bt_timeline_version[] = "2.02";
  29
  30 char *devices, *exes, *input_name, *output_name, *seek_name, *bno_dump_name;
  31 char *d2c_name, *q2c_name, *per_io_name, *unplug_hist_name;
  32 FILE *ranges_ofp, *avgs_ofp, *per_io_ofp;
  33 int verbose, done, time_bounded, output_all_data, seek_absolute;
  34 double t_astart, t_aend;
  35 unsigned long n_traces;
  36 struct avgs_info all_avgs;
  37 unsigned int n_devs;
  38 time_t genesis, last_vtrace;
  39 LIST_HEAD(all_devs);
  40 LIST_HEAD(all_procs);
  41 LIST_HEAD(all_ios);
  42 LIST_HEAD(free_ios);
  43 LIST_HEAD(free_bilinks);
  44 __u64 q_histo[N_HIST_BKTS], d_histo[N_HIST_BKTS];
  45
  46 double range_delta = 0.1;
  47 __u64 last_q = (__u64)-1;
  48
  49 struct region_info all_regions = {
  50         .qranges = LIST_HEAD_INIT(all_regions.qranges),
  51         .cranges = LIST_HEAD_INIT(all_regions.cranges),
  52 };
  53
  54 int process(void);
  55
  56 int main(int argc, char *argv[])
  57 {
  58         handle_args(argc, argv);
  59
  60         init_dev_heads();
  61         iostat_init();
  62         if (process() || output_avgs(avgs_ofp) || output_ranges(ranges_ofp))
  63                 return 1;
  64
  65         if (iostat_ofp) {
  66                 fprintf(iostat_ofp, "\n");
  67                 iostat_dump_stats(iostat_last_stamp, 1);
  68         }
  69
  70         if (ranges_ofp != stdout)
  71                 fclose(ranges_ofp);
  72         if (avgs_ofp != stdout)
  73                 fclose(avgs_ofp);
  74
  75         seek_clean();
  76         latency_clean();
  77         bno_dump_clean();
  78         dev_map_exit();
  79         dip_exit();
  80         pip_exit();
  81         io_free_all();
  82         region_exit(&all_regions);
  83
  84         free(input_name);
  85         if (output_name) free(output_name);
  86
  87         clean_args();
  88         clean_bufs();
  89
  90         return 0;
  91 }
  92
  93 static inline double tv2dbl(struct timeval *tv)
  94 {
  95         return (double)tv->tv_sec + (((double)tv->tv_usec) / (1000.0 * 1000.0));
  96 }
  97
  98 int process(void)
  99 {
 100         int ret = 0;
 101         struct io *iop = io_alloc();
 102         struct timeval tvs, tve;
 103
 104         genesis = last_vtrace = time(NULL);
 105         gettimeofday(&tvs, NULL);
 106         while (!done && next_trace(&iop->t, &iop->pdu)) {
 107                 add_trace(iop);
 108                 iop = io_alloc();
 109         }
 110
 111         io_release(iop);
 112         gettimeofday(&tve, NULL);
 113
 114         if (verbose) {
 115                 double tps, dt_input = tv2dbl(&tve) - tv2dbl(&tvs);
 116
 117                 tps = (double)n_traces / dt_input;
 118                 printf("\r                                        "
 119                        "                                        \r");
 120                 printf("%10lu traces @ %.1lf Ktps in %.6lf seconds\n",
 121                         n_traces, tps/1000.0,
 122                         dt_input);
 123         }
 124
 125         return ret;
 126 }