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
23 static struct file_info *seek_files = NULL;
26 struct rb_node rb_node;
32 FILE *rfp, *wfp, *cfp;
36 long long last_start, last_end;
39 static FILE *seek_open(char *str, char rw)
44 if (seek_name == NULL) return NULL;
46 oname = malloc(strlen(seek_name) + strlen(str) + 32);
47 sprintf(oname, "%s_%s_%c.dat", seek_name, str, rw);
48 if ((fp = fopen(oname, "w")) == NULL)
51 add_file(&seek_files, fp, oname);
56 static void __insert(struct rb_root *root, long long sectors)
59 struct rb_node *parent = NULL;
60 struct rb_node **p = &root->rb_node;
64 sbp = rb_entry(parent, struct seek_bkt, rb_node);
65 if (sectors < sbp->sectors)
67 else if (sectors > sbp->sectors)
75 sbp = malloc(sizeof(struct seek_bkt));
77 sbp->sectors = sectors;
79 rb_link_node(&sbp->rb_node, parent, p);
80 rb_insert_color(&sbp->rb_node, root);
83 static void __destroy(struct rb_node *n)
86 struct seek_bkt *sbp = rb_entry(n, struct seek_bkt, rb_node);
88 __destroy(n->rb_left);
89 __destroy(n->rb_right);
96 clean_files(&seek_files);
99 long long seek_dist(struct seeki *sip, struct io *iop)
102 long long start = BIT_START(iop), end = BIT_END(iop);
105 dist = start - sip->last_end;
107 /* Some overlap means no seek */
108 if (((sip->last_start <= start) && (start <= sip->last_end)) ||
109 ((sip->last_start <= end) && (end <= sip->last_end)))
111 else if (start > sip->last_end)
112 dist = start - sip->last_end;
114 dist = start - sip->last_start;
118 sip->last_start = start;
123 void *seeki_init(char *str)
125 struct seeki *sip = malloc(sizeof(struct seeki));
127 sip->rfp = seek_open(str, 'r');
128 sip->wfp = seek_open(str, 'w');
129 sip->cfp = seek_open(str, 'c');
131 sip->total_sectors = 0.0;
132 sip->last_start = sip->last_end = 0;
133 memset(&sip->root, 0, sizeof(sip->root));
138 void seeki_exit(void *param)
140 struct seeki *sip = param;
143 * Associated files are cleaned up by seek_clean
145 __destroy(sip->root.rb_node);
149 void seeki_add(void *handle, struct io *iop)
151 struct seeki *sip = handle;
152 char rw = IOP_READ(iop) ? 'r' : 'w';
153 long long dist = seek_dist(sip, iop);
154 double tstamp = BIT_TIME(iop->t.time);
155 FILE *fp = IOP_READ(iop) ? sip->rfp : sip->wfp;
158 fprintf(fp, "%15.9lf %13lld %c\n", tstamp, dist, rw);
160 fprintf(sip->cfp, "%15.9lf %13lld %c\n", tstamp, dist, rw);
164 sip->total_sectors += dist;
165 __insert(&sip->root, dist);
168 long long seeki_nseeks(void *handle)
170 return ((struct seeki *)handle)->tot_seeks;
173 double seeki_mean(void *handle)
175 struct seeki *sip = handle;
176 return sip->total_sectors / sip->tot_seeks;
179 int __median(struct rb_node *n, long long sofar, long long target, long
182 struct seek_bkt *sbp;
184 sbp = rb_entry(n, struct seek_bkt, rb_node);
185 if ((sofar + sbp->nseeks) >= target) {
190 if (n->rb_left && __median(n->rb_left, sofar, target, rvp))
193 if (n->rb_right && __median(n->rb_right, sofar, target, rvp))
200 long long seeki_median(void *handle)
202 long long rval = 0LL;
203 struct seeki *sip = handle;
205 if (sip->root.rb_node)
206 (void)__median(sip->root.rb_node, 0LL, sip->tot_seeks / 2,
212 void __mode(struct rb_node *n, struct mode *mp)
214 struct seek_bkt *sbp;
216 if (n->rb_left) __mode(n->rb_left, mp);
217 if (n->rb_right) __mode(n->rb_right, mp);
219 sbp = rb_entry(n, struct seek_bkt, rb_node);
220 if (mp->modes == NULL) {
221 mp->modes = malloc(sizeof(long long));
224 else if (sbp->nseeks > mp->most_seeks)
226 else if (sbp->nseeks == mp->most_seeks)
227 mp->modes = realloc(mp->modes, (mp->nmds + 1) *
232 mp->most_seeks = sbp->nseeks;
233 mp->modes[mp->nmds++] = sbp->sectors;
236 int seeki_mode(void *handle, struct mode *mp)
238 struct seeki *sip = handle;
239 struct rb_root *root = &sip->root;
241 memset(mp, 0, sizeof(struct mode));
243 __mode(root->rb_node, mp);