2 * blktrace output analysis: generate a timeline & gather statistics
4 * Copyright (C) 2006 Alan D. Brunelle <Alan.Brunelle@hp.com>
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.
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.
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
25 struct rb_node rb_node;
30 /* Seeks per second */
32 double t_start, t_last;
37 FILE *rfp, *wfp, *cfp, *sps_fp;
42 long long last_start, last_end;
45 static FILE *seek_open(char *str, char rw)
50 if (seek_name == NULL) return NULL;
52 oname = malloc(strlen(seek_name) + strlen(str) + 32);
53 sprintf(oname, "%s_%s_%c.dat", seek_name, str, rw);
54 if ((fp = my_fopen(oname, "w")) == NULL) {
63 static void __insert(struct rb_root *root, long long sectors)
66 struct rb_node *parent = NULL;
67 struct rb_node **p = &root->rb_node;
71 sbp = rb_entry(parent, struct seek_bkt, rb_node);
72 if (sectors < sbp->sectors)
74 else if (sectors > sbp->sectors)
82 sbp = malloc(sizeof(struct seek_bkt));
84 sbp->sectors = sectors;
86 rb_link_node(&sbp->rb_node, parent, p);
87 rb_insert_color(&sbp->rb_node, root);
90 static void __destroy(struct rb_node *n)
93 struct seek_bkt *sbp = rb_entry(n, struct seek_bkt, rb_node);
95 __destroy(n->rb_left);
96 __destroy(n->rb_right);
101 static void sps_emit(struct seeki *sip)
104 struct sps_bkt *sps = &sip->sps;
105 double delta = sps->t_last - sps->t_start;
107 if ((sps->nseeks == 1) || (delta < DBL_EPSILON))
108 s_p_s = (double)(sps->nseeks);
110 s_p_s = (double)(sps->nseeks) / delta;
112 fprintf(sip->sps_fp, "%15.9lf %.2lf\n", sps->t_start, s_p_s);
118 static void sps_add(struct seeki *sip, double t)
121 struct sps_bkt *sps = &sip->sps;
123 if (sps->nseeks != 0 && ((t - sps->t_start) >= 1.0))
127 if (sps->nseeks == 0) {
135 static int __median(struct rb_node *n, long long sofar, long long target,
138 struct seek_bkt *sbp;
140 sbp = rb_entry(n, struct seek_bkt, rb_node);
141 if ((sofar + sbp->nseeks) >= target) {
146 if (n->rb_left && __median(n->rb_left, sofar, target, rvp))
149 if (n->rb_right && __median(n->rb_right, sofar, target, rvp))
156 static void __mode(struct rb_node *n, struct mode *mp)
158 struct seek_bkt *sbp;
161 __mode(n->rb_left, mp);
163 __mode(n->rb_right, mp);
165 sbp = rb_entry(n, struct seek_bkt, rb_node);
166 if (mp->modes == NULL) {
167 mp->modes = malloc(sizeof(long long));
169 } else if (sbp->nseeks > mp->most_seeks)
171 else if (sbp->nseeks == mp->most_seeks)
172 mp->modes = realloc(mp->modes, (mp->nmds + 1) *
177 mp->most_seeks = sbp->nseeks;
178 mp->modes[mp->nmds++] = sbp->sectors;
181 long long seek_dist(struct seeki *sip, struct io *iop)
184 long long start = BIT_START(iop), end = BIT_END(iop);
187 dist = start - sip->last_end;
189 /* Some overlap means no seek */
190 if (((sip->last_start <= start) && (start <= sip->last_end)) ||
191 ((sip->last_start <= end) && (end <= sip->last_end)))
193 else if (start > sip->last_end)
194 dist = start - sip->last_end;
196 dist = start - sip->last_start;
200 sip->last_start = start;
205 void *seeki_alloc(struct d_info *dip, char *post)
208 struct seeki *sip = malloc(sizeof(struct seeki));
210 sprintf(str, "%s%s", dip->dip_name, post);
211 sip->rfp = seek_open(str, 'r');
212 sip->wfp = seek_open(str, 'w');
213 sip->cfp = seek_open(str, 'c');
215 sip->total_sectors = 0.0;
216 sip->last_start = sip->last_end = 0;
217 memset(&sip->root, 0, sizeof(sip->root));
222 memset(&sip->sps, 0, sizeof(sip->sps));
224 oname = malloc(strlen(sps_name) + strlen(dip->dip_name) + 32);
225 sprintf(oname, "%s_%s.dat", sps_name, dip->dip_name);
226 if ((sip->sps_fp = my_fopen(oname, "w")) == NULL) {
230 add_file(sip->sps_fp, oname);
237 void seeki_free(void *param)
239 struct seeki *sip = param;
241 if (sip->sps_fp && sip->sps.nseeks != 0)
245 * Associated files are cleaned up by seek_clean
247 __destroy(sip->root.rb_node);
251 void seeki_add(void *handle, struct io *iop)
253 struct seeki *sip = handle;
254 char rw = IOP_READ(iop) ? 'r' : 'w';
255 long long dist = seek_dist(sip, iop);
256 double tstamp = BIT_TIME(iop->t.time);
257 FILE *fp = IOP_READ(iop) ? sip->rfp : sip->wfp;
260 fprintf(fp, "%15.9lf %13lld %c\n", tstamp, dist, rw);
262 fprintf(sip->cfp, "%15.9lf %13lld %c\n", tstamp, dist, rw);
266 sip->total_sectors += dist;
267 __insert(&sip->root, dist);
269 sps_add(sip, tstamp);
272 long long seeki_nseeks(void *handle)
274 return ((struct seeki *)handle)->tot_seeks;
277 double seeki_mean(void *handle)
279 struct seeki *sip = handle;
280 return sip->total_sectors / sip->tot_seeks;
283 long long seeki_median(void *handle)
285 long long rval = 0LL;
286 struct seeki *sip = handle;
288 if (sip->root.rb_node)
289 (void)__median(sip->root.rb_node, 0LL, sip->tot_seeks / 2,
295 int seeki_mode(void *handle, struct mode *mp)
297 struct seeki *sip = handle;
298 struct rb_root *root = &sip->root;
300 memset(mp, 0, sizeof(struct mode));
302 __mode(root->rb_node, mp);