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 "globals.h" 22 23#define BKT_WIDTH 5 24#define MAX_BKT 19 25#define EXCESS_BKT 20 26#define NBKTS (EXCESS_BKT + 1) 27 28struct hist_bkt { 29 __u32 dev; 30 int hist[NBKTS * sizeof(int)]; 31}; 32 33void *unplug_hist_alloc(__u32 device) 34{ 35 struct hist_bkt *hbp; 36 37 if (unplug_hist_name == NULL) return NULL; 38 39 hbp = malloc(sizeof(*hbp)); 40 hbp->dev = device; 41 memset(hbp->hist, 0, NBKTS * sizeof(int)); 42 43 return hbp; 44} 45 46void unplug_hist_add(struct io *u_iop) 47{ 48 struct d_info *dip; 49 50 dip = __dip_find(u_iop->t.device); 51 if (dip && dip->up_hist_handle) { 52 __u64 *val = u_iop->pdu; 53 int idx, n_unplugs = be64_to_cpu(*val); 54 struct hist_bkt *hbp = dip->up_hist_handle; 55 56 idx = (n_unplugs / BKT_WIDTH); 57 if (idx > EXCESS_BKT) 58 idx = EXCESS_BKT; 59 60 hbp->hist[idx]++; 61 } 62} 63 64void unplug_hist_free(void *arg) 65{ 66 if (arg) { 67 FILE *fp; 68 struct hist_bkt *hbp = arg; 69 int mjr = hbp->dev >> MINORBITS; 70 int mnr = hbp->dev & ((1 << MINORBITS) - 1); 71 char *oname = malloc(strlen(unplug_hist_name) + 32); 72 73 sprintf(oname, "%s_%03d,%03d.dat", unplug_hist_name, mjr, mnr); 74 if ((fp = my_fopen(oname, "w")) != NULL) { 75 int i; 76 77 for (i = 0; i < NBKTS; i++) 78 fprintf(fp, "%d %d\n", i, hbp->hist[i]); 79 fclose(fp); 80 81 } else 82 perror(oname); 83 84 free(oname); 85 free(hbp); 86 } 87} 88