2 * gfio - gui front end for fio - the flexible io tester
4 * Copyright (C) 2012 Stephen M. Cameron <stephenmcameron@gmail.com>
6 * The license below covers all files distributed with fio unless otherwise
7 * noted in the file itself.
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License version 2 as
11 * published by the Free Software Foundation.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
32 #include "tickmarks.h"
41 struct graph_value *next;
48 struct graph_value *tail;
49 struct graph_value *values;
50 struct graph_label *next;
53 unsigned int tooltip_count;
61 unsigned int xdim, ydim;
62 double xoffset, yoffset;
63 struct graph_label *labels;
64 struct graph_label *tail;
67 graph_axis_unit_change_callback x_axis_unit_change_callback;
68 graph_axis_unit_change_callback y_axis_unit_change_callback;
75 void graph_set_size(struct graph *g, unsigned int xdim, unsigned int ydim)
81 void graph_set_position(struct graph *g, double xoffset, double yoffset)
87 struct graph *graph_new(unsigned int xdim, unsigned int ydim, const char *font)
91 g = calloc(1, sizeof(*g));
92 graph_set_size(g, xdim, ydim);
93 g->per_label_limit = -1;
100 void graph_x_axis_unit_change_notify(struct graph *g, graph_axis_unit_change_callback f)
102 g->x_axis_unit_change_callback = f;
105 void graph_y_axis_unit_change_notify(struct graph *g, graph_axis_unit_change_callback f)
107 g->y_axis_unit_change_callback = f;
110 static int count_labels(struct graph_label *labels)
113 struct graph_label *i;
115 for (i = labels; i; i = i->next)
120 static int count_values(struct graph_value *values)
123 struct graph_value *i;
125 for (i = values; i; i = i->next)
130 typedef double (*double_comparator)(double a, double b);
132 static double mindouble(double a, double b)
134 return a < b ? a : b;
137 static double maxdouble(double a, double b)
139 return a < b ? b : a;
142 static double find_double_values(struct graph_value *values, double_comparator cmp)
144 struct graph_value *i;
148 assert(values != NULL);
149 answer = 0.0; /* shut the compiler up, might need to think harder though. */
150 for (i = values; i; i = i->next) {
151 tmp = *(double *) i->value;
156 answer = cmp(answer, tmp);
162 static double find_double_data(struct graph_label *labels, double_comparator cmp)
164 struct graph_label *i;
168 assert(labels != NULL);
169 answer = 0.0; /* shut the compiler up, might need to think harder though. */
170 for (i = labels; i; i = i->next) {
171 tmp = find_double_values(i->values, cmp);
176 answer = cmp(tmp, answer);
182 static double find_min_data(struct graph_label *labels)
184 return find_double_data(labels, mindouble);
187 static double find_max_data(struct graph_label *labels)
189 return find_double_data(labels, maxdouble);
192 static void draw_bars(struct graph *bg, cairo_t *cr, struct graph_label *lb,
193 double label_offset, double bar_width,
194 double mindata, double maxdata)
196 struct graph_value *i;
197 double x1, y1, x2, y2;
199 double domain, range, v;
201 domain = (maxdata - mindata);
202 range = (double) bg->ydim * 0.80; /* FIXME */
204 for (i = lb->values; i; i = i->next) {
206 x1 = label_offset + (double) bar_num * bar_width + (bar_width * 0.05);
207 x2 = x1 + bar_width * 0.90;
208 y2 = bg->ydim * 0.90;
209 v = *(double *) i->value;
210 y1 = y2 - (((v - mindata) / domain) * range);
211 cairo_move_to(cr, x1, y1);
212 cairo_line_to(cr, x1, y2);
213 cairo_line_to(cr, x2, y2);
214 cairo_line_to(cr, x2, y1);
215 cairo_close_path(cr);
222 static void draw_aligned_text(struct graph *g, cairo_t *cr, double x, double y,
223 double fontsize, const char *text, int alignment)
226 #define LEFT_JUSTIFIED 1
227 #define RIGHT_JUSTIFIED 2
229 double factor, direction;
230 cairo_text_extents_t extents;
237 case RIGHT_JUSTIFIED:
247 cairo_select_font_face (cr, g->font, CAIRO_FONT_SLANT_NORMAL, CAIRO_FONT_WEIGHT_NORMAL);
249 cairo_set_font_size(cr, fontsize);
250 cairo_text_extents(cr, text, &extents);
251 x = x + direction * (factor * extents.width + extents.x_bearing);
252 y = y - (extents.height / 2 + extents.y_bearing);
254 cairo_move_to(cr, x, y);
255 cairo_show_text(cr, text);
258 static inline void draw_centered_text(struct graph *g, cairo_t *cr, double x, double y,
259 double fontsize, const char *text)
261 draw_aligned_text(g, cr, x, y, fontsize, text, CENTERED);
264 static inline void draw_right_justified_text(struct graph *g, cairo_t *cr,
266 double fontsize, const char *text)
268 draw_aligned_text(g, cr, x, y, fontsize, text, RIGHT_JUSTIFIED);
271 static inline void draw_left_justified_text(struct graph *g, cairo_t *cr,
273 double fontsize, const char *text)
275 draw_aligned_text(g, cr, x, y, fontsize, text, LEFT_JUSTIFIED);
278 static void draw_vertical_centered_text(struct graph *g, cairo_t *cr, double x,
279 double y, double fontsize,
283 cairo_text_extents_t extents;
285 cairo_select_font_face(cr, g->font, CAIRO_FONT_SLANT_NORMAL, CAIRO_FONT_WEIGHT_NORMAL);
287 cairo_set_font_size(cr, fontsize);
288 cairo_text_extents(cr, text, &extents);
291 y = y + (extents.width / 2.0 + extents.x_bearing);
292 x = x - (extents.height / 2.0 + extents.y_bearing);
294 cairo_move_to(cr, x, y);
296 cairo_translate(cr, -sx, -sy);
297 cairo_rotate(cr, -90.0 * M_PI / 180.0);
298 cairo_translate(cr, sx, sy);
299 cairo_show_text(cr, text);
303 static void graph_draw_common(struct graph *g, cairo_t *cr,
304 double *x1, double *y1, double *x2, double *y2)
306 cairo_set_source_rgb(cr, 0, 0, 0);
307 cairo_set_line_width (cr, 0.8);
309 *x1 = 0.15 * g->xdim;
310 *x2 = 0.95 * g->xdim;
311 *y1 = 0.10 * g->ydim;
312 *y2 = 0.90 * g->ydim;
314 cairo_move_to(cr, *x1, *y1);
315 cairo_line_to(cr, *x1, *y2);
316 cairo_line_to(cr, *x2, *y2);
317 cairo_line_to(cr, *x2, *y1);
318 cairo_line_to(cr, *x1, *y1);
321 draw_centered_text(g, cr, g->xdim / 2, g->ydim / 20, 20.0, g->title);
322 draw_centered_text(g, cr, g->xdim / 2, g->ydim * 0.97, 14.0, g->xtitle);
323 draw_vertical_centered_text(g, cr, g->xdim * 0.02, g->ydim / 2, 14.0, g->ytitle);
327 static void graph_draw_x_ticks(struct graph *g, cairo_t *cr,
328 double x1, double y1, double x2, double y2,
329 double minx, double maxx, int nticks)
334 static double dash[] = { 1.0, 2.0 };
336 nticks = calc_tickmarks(minx, maxx, nticks, &tm, &power_of_ten,
337 g->x_axis_unit_change_callback == NULL);
338 if (g->x_axis_unit_change_callback)
339 g->x_axis_unit_change_callback(g, power_of_ten);
341 for (i = 0; i < nticks; i++) {
342 tx = (((tm[i].value) - minx) / (maxx - minx)) * (x2 - x1) + x1;
343 if (tx < x1 || tx > x2)
347 cairo_set_line_width(cr, 0.8);
348 cairo_move_to(cr, tx, y2);
349 cairo_line_to(cr, tx, y2 + (y2 - y1) * 0.03);
352 /* draw grid lines */
354 cairo_set_dash(cr, dash, 2, 2.0);
355 cairo_set_line_width(cr, 0.5);
356 cairo_move_to(cr, tx, y1);
357 cairo_line_to(cr, tx, y2);
361 /* draw tickmark label */
362 draw_centered_text(g, cr, tx, y2 * 1.04, 12.0, tm[i].string);
368 static void graph_draw_y_ticks(struct graph *g, cairo_t *cr,
369 double x1, double y1, double x2, double y2,
370 double miny, double maxy, int nticks)
375 static double dash[] = { 2.0, 2.0 };
377 nticks = calc_tickmarks(miny, maxy, nticks, &tm, &power_of_ten,
378 g->y_axis_unit_change_callback == NULL);
379 if (g->y_axis_unit_change_callback)
380 g->y_axis_unit_change_callback(g, power_of_ten);
382 for (i = 0; i < nticks; i++) {
383 ty = y2 - (((tm[i].value) - miny) / (maxy - miny)) * (y2 - y1);
384 if (ty < y1 || ty > y2)
387 cairo_move_to(cr, x1, ty);
388 cairo_line_to(cr, x1 - (x2 - x1) * 0.02, ty);
391 /* draw grid lines */
393 cairo_set_dash(cr, dash, 2, 2.0);
394 cairo_set_line_width(cr, 0.5);
395 cairo_move_to(cr, x1, ty);
396 cairo_line_to(cr, x2, ty);
400 /* draw tickmark label */
401 draw_right_justified_text(g, cr, x1 - (x2 - x1) * 0.025, ty, 12.0, tm[i].string);
406 void bar_graph_draw(struct graph *bg, cairo_t *cr)
408 double x1, y1, x2, y2;
409 double space_per_label, bar_width;
410 double label_offset, mindata, maxdata;
412 struct graph_label *lb;
415 cairo_translate(cr, bg->xoffset, bg->yoffset);
416 graph_draw_common(bg, cr, &x1, &y1, &x2, &y2);
418 nlabels = count_labels(bg->labels);
419 space_per_label = (x2 - x1) / (double) nlabels;
421 mindata = find_min_data(bg->labels);
422 maxdata = find_max_data(bg->labels);
424 if (fabs(maxdata - mindata) < 1e-20) {
425 draw_centered_text(bg, cr,
426 x1 + (x2 - x1) / 2.0,
427 y1 + (y2 - y1) / 2.0, 20.0, "No good data");
431 graph_draw_y_ticks(bg, cr, x1, y1, x2, y2, mindata, maxdata, 10);
434 for (lb = bg->labels; lb; lb = lb->next) {
436 nvalues = count_values(lb->values);
437 bar_width = (space_per_label - space_per_label * 0.2) / (double) nvalues;
438 label_offset = bg->xdim * 0.1 + space_per_label * (double) i + space_per_label * 0.1;
439 draw_bars(bg, cr, lb, label_offset, bar_width, mindata, maxdata);
440 // draw_centered_text(cr, label_offset + (bar_width / 2.0 + bar_width * 0.1), bg->ydim * 0.93,
441 draw_centered_text(bg, cr, x1 + space_per_label * (i + 0.5), bg->ydim * 0.93,
449 typedef double (*xy_value_extractor)(struct graph_value *v);
451 static double getx(struct graph_value *v)
453 struct xyvalue *xy = v->value;
457 static double gety(struct graph_value *v)
459 struct xyvalue *xy = v->value;
463 static double find_xy_value(struct graph *g, xy_value_extractor getvalue, double_comparator cmp)
465 double tmp, answer = 0.0;
466 struct graph_label *i;
467 struct graph_value *j;
470 for (i = g->labels; i; i = i->next)
471 for (j = i->values; j; j = j->next) {
477 answer = cmp(tmp, answer);
482 void line_graph_draw(struct graph *g, cairo_t *cr)
484 double x1, y1, x2, y2;
485 double minx, miny, maxx, maxy, gminx, gminy, gmaxx, gmaxy;
486 double tx, ty, top_extra, bottom_extra, left_extra, right_extra;
487 struct graph_label *i;
488 struct graph_value *j;
489 int good_data = 1, first = 1;
492 cairo_translate(cr, g->xoffset, g->yoffset);
493 graph_draw_common(g, cr, &x1, &y1, &x2, &y2);
495 minx = find_xy_value(g, getx, mindouble);
496 maxx = find_xy_value(g, getx, maxdouble);
497 miny = find_xy_value(g, gety, mindouble);
498 maxy = find_xy_value(g, gety, maxdouble);
500 if (fabs(maxx - minx) < 1e-20 || fabs(maxy - miny) < 1e-20) {
513 if (g->top_extra > 0.001)
514 top_extra = fabs(maxy - miny) * g->top_extra;
515 if (g->bottom_extra > 0.001)
516 bottom_extra = fabs(maxy - miny) * g->bottom_extra;
517 if (g->left_extra > 0.001)
518 left_extra = fabs(maxx - minx) * g->left_extra;
519 if (g->right_extra > 0.001)
520 right_extra = fabs(maxx - minx) * g->right_extra;
522 gminx = minx - left_extra;
523 gmaxx = maxx + right_extra;
524 gminy = miny - bottom_extra;
525 gmaxy = maxy + top_extra;
527 graph_draw_x_ticks(g, cr, x1, y1, x2, y2, gminx, gmaxx, 10);
528 graph_draw_y_ticks(g, cr, x1, y1, x2, y2, gminy, gmaxy, 10);
533 cairo_set_line_width(cr, 1.5);
534 for (i = g->labels; i; i = i->next) {
536 if (i->r < 0) /* invisible data */
538 cairo_set_source_rgb(cr, i->r, i->g, i->b);
539 for (j = i->values; j; j = j->next) {
540 struct xyvalue *xy = j->value;
542 tx = ((getx(j) - gminx) / (gmaxx - gminx)) * (x2 - x1) + x1;
543 ty = y2 - ((gety(j) - gminy) / (gmaxy - gminy)) * (y2 - y1);
545 cairo_move_to(cr, tx, ty);
548 cairo_line_to(cr, tx, ty);
561 static void gfree(void *f)
567 static void setstring(char **str, const char *value)
570 *str = strdup(value);
573 void graph_title(struct graph *bg, const char *title)
575 setstring(&bg->title, title);
578 void graph_x_title(struct graph *bg, const char *title)
580 setstring(&bg->xtitle, title);
583 void graph_y_title(struct graph *bg, const char *title)
585 setstring(&bg->ytitle, title);
588 static struct graph_label *graph_find_label(struct graph *bg,
591 struct graph_label *i;
593 for (i = bg->labels; i; i = i->next)
594 if (strcmp(label, i->label) == 0)
599 void graph_add_label(struct graph *bg, const char *label)
601 struct graph_label *i;
603 i = graph_find_label(bg, label);
605 return; /* already present. */
606 i = calloc(1, sizeof(*i));
608 setstring(&i->label, label);
617 static void graph_label_add_value(struct graph_label *i, void *value,
620 struct graph_value *x;
622 x = malloc(sizeof(*x));
625 x->tooltip = strdup(tooltip);
639 if (i->parent->per_label_limit != -1 &&
640 i->value_count > i->parent->per_label_limit) {
644 * If the limit was dynamically reduced, making us more
645 * than 1 entry ahead after adding this one, drop two
646 * entries. This will make us (eventually) reach the
649 if (i->value_count - i->parent->per_label_limit >= 2)
654 i->values = i->values->next;
666 int graph_add_data(struct graph *bg, const char *label, const double value)
668 struct graph_label *i;
671 d = malloc(sizeof(*d));
674 i = graph_find_label(bg, label);
677 graph_label_add_value(i, d, NULL);
681 int graph_add_xy_data(struct graph *bg, const char *label,
682 const double x, const double y, const char *tooltip)
684 struct graph_label *i;
687 xy = malloc(sizeof(*xy));
691 i = graph_find_label(bg, label);
695 graph_label_add_value(i, xy, tooltip);
699 static void graph_free_values(struct graph_value *values)
701 struct graph_value *i, *next;
703 for (i = values; i; i = next) {
710 static void graph_free_labels(struct graph_label *labels)
712 struct graph_label *i, *next;
714 for (i = labels; i; i = next) {
716 graph_free_values(i->values);
721 void graph_set_color(struct graph *gr, const char *label,
722 double red, double green, double blue)
724 struct graph_label *i;
727 if (red < 0.0) { /* invisible color */
744 for (i = gr->labels; i; i = i->next)
745 if (strcmp(i->label, label) == 0) {
753 void graph_free(struct graph *bg)
758 graph_free_labels(bg->labels);
761 /* For each line in the line graph, up to per_label_limit segments may
762 * be added. After that, adding more data to the end of the line
763 * causes data to drop off of the front of the line.
765 void line_graph_set_data_count_limit(struct graph *g, int per_label_limit)
767 g->per_label_limit = per_label_limit;
770 void graph_add_extra_space(struct graph *g, double left_percent, double right_percent,
771 double top_percent, double bottom_percent)
773 g->left_extra = left_percent;
774 g->right_extra = right_percent;
775 g->top_extra = top_percent;
776 g->bottom_extra = bottom_percent;
779 int graph_has_tooltips(struct graph *g)
781 struct graph_label *i;
783 for (i = g->labels; i; i = i->next)
784 if (i->tooltip_count)
790 int graph_contains_xy(struct graph *g, int x, int y)
792 int first_x = g->xoffset;
793 int last_x = g->xoffset + g->xdim;
794 int first_y = g->yoffset;
795 int last_y = g->yoffset + g->ydim;
797 return (x >= first_x && x <= last_x) && (y >= first_y && y <= last_y);
800 static int xy_match(struct xyvalue *xy, int x, int y)
802 int xdiff = abs(xy->gx - x);
803 int ydiff = abs(xy->gy - y);
805 return xdiff <= 20 && ydiff <= 10;
808 const char *graph_find_tooltip(struct graph *g, int x, int y)
810 struct graph_label *i;
811 struct graph_value *j;
813 for (i = g->labels; i; i = i->next) {
814 for (j = i->values; j; j = j->next) {
815 struct xyvalue *xy = j->value;
817 if (xy_match(xy, x - g->xoffset, y))