gfio: shorten graph tick lables so x000000000 becomes
[fio.git] / graph.c
CommitLineData
af58ef32
SC
1/*
2 * gfio - gui front end for fio - the flexible io tester
3 *
4 * Copyright (C) 2012 Stephen M. Cameron <stephenmcameron@gmail.com>
5 *
6 * The license below covers all files distributed with fio unless otherwise
7 * noted in the file itself.
8 *
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.
12 *
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.
17 *
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
21 *
22 */
23#include <string.h>
24#include <malloc.h>
25#include <math.h>
26#include <assert.h>
27
28#include <cairo.h>
29#include <gtk/gtk.h>
30
31#include "tickmarks.h"
32
33struct xyvalue {
34 double x, y;
35};
36
37struct graph_value {
38 struct graph_value *next;
39 void *value;
40};
41
42struct graph_label {
43 char *label;
44 struct graph_value *tail;
45 struct graph_value *values;
46 struct graph_label *next;
47 double r, g, b;
48 int value_count;
49 struct graph *parent;
50};
51
52struct graph {
53 char *title;
54 char *xtitle;
55 char *ytitle;
87d5f276 56 unsigned int xdim, ydim;
af58ef32
SC
57 struct graph_label *labels;
58 struct graph_label *tail;
59 int per_label_limit;
f3e8440f 60 const char *font;
af58ef32
SC
61};
62
f3e8440f 63struct graph *graph_new(unsigned int xdim, unsigned int ydim, const char *font)
af58ef32
SC
64{
65 struct graph *g;
66
67 g = calloc(1, sizeof(*g));
68 g->xdim = xdim;
69 g->ydim = ydim;
70 g->per_label_limit = -1;
f3e8440f
JA
71 g->font = font;
72 if (!g->font)
73 g->font = "Sans";
af58ef32
SC
74 return g;
75}
76
77static int count_labels(struct graph_label *labels)
78{
79 int count = 0;
80 struct graph_label *i;
81
82 for (i = labels; i; i = i->next)
83 count++;
84 return count;
85}
86
87static int count_values(struct graph_value *values)
88{
89 int count = 0;
90 struct graph_value *i;
91
92 for (i = values; i; i = i->next)
93 count++;
94 return count;
95}
96
97typedef double (*double_comparator)(double a, double b);
98
99static double mindouble(double a, double b)
100{
101 return a < b ? a : b;
102}
103
104static double maxdouble(double a, double b)
105{
106 return a < b ? b : a;
107}
108
109static double find_double_values(struct graph_value *values, double_comparator cmp)
110{
111 struct graph_value *i;
112 int first = 1;
113 double answer, tmp;
114
115 assert(values != NULL);
116 answer = 0.0; /* shut the compiler up, might need to think harder though. */
117 for (i = values; i; i = i->next) {
118 tmp = *(double *) i->value;
119 if (first) {
120 answer = tmp;
121 first = 0;
122 } else {
123 answer = cmp(answer, tmp);
124 }
125 }
126 return answer;
127}
128
129static double find_double_data(struct graph_label *labels, double_comparator cmp)
130{
131 struct graph_label *i;
132 int first = 1;
133 double answer, tmp;
134
135 assert(labels != NULL);
136 answer = 0.0; /* shut the compiler up, might need to think harder though. */
137 for (i = labels; i; i = i->next) {
138 tmp = find_double_values(i->values, cmp);
139 if (first) {
140 answer = tmp;
141 first = 0;
142 } else {
143 answer = cmp(tmp, answer);
144 }
145 }
146 return answer;
147}
148
149static double find_min_data(struct graph_label *labels)
150{
151 return find_double_data(labels, mindouble);
152}
153
154static double find_max_data(struct graph_label *labels)
155{
156 return find_double_data(labels, maxdouble);
157}
158
159static void draw_bars(struct graph *bg, cairo_t *cr, struct graph_label *lb,
160 double label_offset, double bar_width,
161 double mindata, double maxdata)
162{
163 struct graph_value *i;
164 double x1, y1, x2, y2;
165 int bar_num = 0;
166 double domain, range, v;
167
168 domain = (maxdata - mindata);
169 range = (double) bg->ydim * 0.80; /* FIXME */
170 cairo_stroke(cr);
171 for (i = lb->values; i; i = i->next) {
172
173 x1 = label_offset + (double) bar_num * bar_width + (bar_width * 0.05);
174 x2 = x1 + bar_width * 0.90;
175 y2 = bg->ydim * 0.90;
176 v = *(double *) i->value;
177 y1 = y2 - (((v - mindata) / domain) * range);
178 cairo_move_to(cr, x1, y1);
179 cairo_line_to(cr, x1, y2);
180 cairo_line_to(cr, x2, y2);
181 cairo_line_to(cr, x2, y1);
182 cairo_close_path(cr);
183 cairo_fill(cr);
184 cairo_stroke(cr);
185 bar_num++;
186 }
187}
188
f3e8440f
JA
189static void draw_centered_text(struct graph *g, cairo_t *cr, double x, double y,
190 double fontsize, const char *text)
af58ef32
SC
191{
192 cairo_text_extents_t extents;
193
f3e8440f 194 cairo_select_font_face (cr, g->font, CAIRO_FONT_SLANT_NORMAL, CAIRO_FONT_WEIGHT_NORMAL);
af58ef32
SC
195
196 cairo_set_font_size(cr, fontsize);
197 cairo_text_extents(cr, text, &extents);
198 x = x - (extents.width / 2 + extents.x_bearing);
199 y = y - (extents.height / 2 + extents.y_bearing);
200
201 cairo_move_to(cr, x, y);
202 cairo_show_text(cr, text);
203}
204
f3e8440f
JA
205static void draw_vertical_centered_text(struct graph *g, cairo_t *cr, double x,
206 double y, double fontsize,
207 const char *text)
af58ef32
SC
208{
209 double sx, sy;
210 cairo_text_extents_t extents;
211
f3e8440f 212 cairo_select_font_face(cr, g->font, CAIRO_FONT_SLANT_NORMAL, CAIRO_FONT_WEIGHT_NORMAL);
af58ef32
SC
213
214 cairo_set_font_size(cr, fontsize);
215 cairo_text_extents(cr, text, &extents);
216 sx = x;
217 sy = y;
218 y = y + (extents.width / 2.0 + extents.x_bearing);
219 x = x - (extents.height / 2.0 + extents.y_bearing);
220
221 cairo_move_to(cr, x, y);
222 cairo_save(cr);
223 cairo_translate(cr, -sx, -sy);
224 cairo_rotate(cr, -90.0 * M_PI / 180.0);
225 cairo_translate(cr, sx, sy);
226 cairo_show_text(cr, text);
227 cairo_restore(cr);
228}
229
230static void graph_draw_common(struct graph *g, cairo_t *cr,
231 double *x1, double *y1, double *x2, double *y2)
232{
233 cairo_set_source_rgb(cr, 0, 0, 0);
f3e8440f 234 cairo_set_line_width (cr, 0.8);
af58ef32 235
af58ef32
SC
236 /* for now just set margins at 10% of width. This is not very good. */
237 *x1 = g->xdim / 10.0;
f3e8440f 238 *x2 = 9.0 * *x1;
af58ef32 239 *y1 = g->ydim / 10.0;
f3e8440f 240 *y2 = 9.0 * *y1;
af58ef32
SC
241
242 cairo_move_to(cr, *x1, *y1);
243 cairo_line_to(cr, *x1, *y2);
244 cairo_line_to(cr, *x2, *y2);
245 cairo_line_to(cr, *x2, *y1);
246 cairo_line_to(cr, *x1, *y1);
247 cairo_stroke(cr);
248
f3e8440f
JA
249 draw_centered_text(g, cr, g->xdim / 2, g->ydim / 20, 20.0, g->title);
250 draw_centered_text(g, cr, g->xdim / 2, g->ydim * 0.97, 14.0, g->xtitle);
251 draw_vertical_centered_text(g, cr, g->xdim * 0.02, g->ydim / 2, 14.0, g->ytitle);
af58ef32
SC
252 cairo_stroke(cr);
253}
254
255static void graph_draw_x_ticks(struct graph *g, cairo_t *cr,
256 double x1, double y1, double x2, double y2,
257 double minx, double maxx, int nticks)
258{
259 struct tickmark *tm;
260 double tx;
261 int i;
262 static double dash[] = { 1.0, 2.0 };
263
264 nticks = calc_tickmarks(minx, maxx, nticks, &tm);
265
266 for (i = 0; i < nticks; i++) {
267 tx = (((tm[i].value) - minx) / (maxx - minx)) * (x2 - x1) + x1;
268 if (tx < x1 || tx > x2)
269 continue;
270
271 /* Draw tick mark */
f3e8440f 272 cairo_set_line_width(cr, 0.8);
af58ef32
SC
273 cairo_move_to(cr, tx, y2);
274 cairo_line_to(cr, tx, y2 + (y2 - y1) * 0.03);
275 cairo_stroke(cr);
276
277 /* draw grid lines */
278 cairo_save(cr);
279 cairo_set_dash(cr, dash, 2, 2.0);
280 cairo_set_line_width(cr, 0.5);
281 cairo_move_to(cr, tx, y1);
282 cairo_line_to(cr, tx, y2);
283 cairo_stroke(cr);
284 cairo_restore(cr);
285
286 /* draw tickmark label */
f3e8440f 287 draw_centered_text(g, cr, tx, y2 * 1.04, 12.0, tm[i].string);
af58ef32
SC
288 cairo_stroke(cr);
289
290 }
291}
292
293static void graph_draw_y_ticks(struct graph *g, cairo_t *cr,
294 double x1, double y1, double x2, double y2,
295 double miny, double maxy, int nticks)
296{
297 struct tickmark *tm;
298 double ty;
299 int i;
300 static double dash[] = { 2.0, 2.0 };
301
302 nticks = calc_tickmarks(miny, maxy, nticks, &tm);
303
304 for (i = 0; i < nticks; i++) {
305 ty = y2 - (((tm[i].value) - miny) / (maxy - miny)) * (y2 - y1);
306 if (ty < y1 || ty > y2)
307 continue;
308 /* draw tick mark */
309 cairo_move_to(cr, x1, ty);
310 cairo_line_to(cr, x1 - (x2 - x1) * 0.02, ty);
311 cairo_stroke(cr);
312
313 /* draw grid lines */
314 cairo_save(cr);
315 cairo_set_dash(cr, dash, 2, 2.0);
316 cairo_set_line_width(cr, 0.5);
317 cairo_move_to(cr, x1, ty);
318 cairo_line_to(cr, x2, ty);
319 cairo_stroke(cr);
320 cairo_restore(cr);
321
322 /* draw tickmark label */
f3e8440f 323 draw_centered_text(g, cr, x1 - (x2 - x1) * 0.04, ty, 12.0, tm[i].string);
af58ef32
SC
324 cairo_stroke(cr);
325 }
326}
327
328void bar_graph_draw(struct graph *bg, cairo_t *cr)
329{
330 double x1, y1, x2, y2;
331 double space_per_label, bar_width;
332 double label_offset, mindata, maxdata;
333 int i, nlabels;
334 struct graph_label *lb;
335
336 cairo_save(cr);
337 graph_draw_common(bg, cr, &x1, &y1, &x2, &y2);
338
339 nlabels = count_labels(bg->labels);
340 space_per_label = (x2 - x1) / (double) nlabels;
341
342 mindata = find_min_data(bg->labels);
343 maxdata = find_max_data(bg->labels);
344
345 if (fabs(maxdata - mindata) < 1e-20) {
f3e8440f 346 draw_centered_text(bg, cr,
af58ef32
SC
347 x1 + (x2 - x1) / 2.0,
348 y1 + (y2 - y1) / 2.0, 20.0, "No good data");
349 return;
350 }
351
352 graph_draw_y_ticks(bg, cr, x1, y1, x2, y2, mindata, maxdata, 10);
353
354 i = 0;
355 for (lb = bg->labels; lb; lb = lb->next) {
356 int nvalues;
357 nvalues = count_values(lb->values);
358 bar_width = (space_per_label - space_per_label * 0.2) / (double) nvalues;
359 label_offset = bg->xdim * 0.1 + space_per_label * (double) i + space_per_label * 0.1;
360 draw_bars(bg, cr, lb, label_offset, bar_width, mindata, maxdata);
361 // draw_centered_text(cr, label_offset + (bar_width / 2.0 + bar_width * 0.1), bg->ydim * 0.93,
f3e8440f 362 draw_centered_text(bg, cr, x1 + space_per_label * (i + 0.5), bg->ydim * 0.93,
af58ef32
SC
363 12.0, lb->label);
364 i++;
365 }
366 cairo_stroke(cr);
367 cairo_restore(cr);
368}
369
370typedef double (*xy_value_extractor)(struct graph_value *v);
371
372static double getx(struct graph_value *v)
373{
374 struct xyvalue *xy = v->value;
375 return xy->x;
376}
377
378static double gety(struct graph_value *v)
379{
380 struct xyvalue *xy = v->value;
381 return xy->y;
382}
383
384static double find_xy_value(struct graph *g, xy_value_extractor getvalue, double_comparator cmp)
385{
386 double tmp, answer = 0.0;
387 struct graph_label *i;
388 struct graph_value *j;
389
390 for (i = g->labels; i; i = i->next)
391 for (j = i->values; j; j = j->next) {
392 tmp = getvalue(j);
393 answer = cmp(tmp, answer);
394 }
395 return answer;
396}
397
398void line_graph_draw(struct graph *g, cairo_t *cr)
399{
400 double x1, y1, x2, y2;
401 double minx, miny, maxx, maxy;
402 double tx, ty;
403 struct graph_label *i;
404 struct graph_value *j;
405 int first = 1;
406
407 cairo_save(cr);
408 graph_draw_common(g, cr, &x1, &y1, &x2, &y2);
409
410 minx = find_xy_value(g, getx, mindouble);
411 maxx = find_xy_value(g, getx, maxdouble);
412 miny = find_xy_value(g, gety, mindouble);
413 maxy = find_xy_value(g, gety, maxdouble);
414
415 if (fabs(maxx - minx) < 1e-20 || fabs(maxy - miny) < 1e-20) {
f3e8440f 416 draw_centered_text(g, cr,
af58ef32
SC
417 x1 + (x2 - x1) / 2.0,
418 y1 + (y2 - y1) / 2.0, 20.0, "No good Data");
419 return;
420 }
421
422 graph_draw_x_ticks(g, cr, x1, y1, x2, y2, minx, maxx, 10);
423 graph_draw_y_ticks(g, cr, x1, y1, x2, y2, miny, maxy, 10);
424
f3e8440f 425 cairo_set_line_width(cr, 1.5);
af58ef32
SC
426 for (i = g->labels; i; i = i->next) {
427 first = 1;
cae08727
SC
428 if (i->r < 0) /* invisible data */
429 continue;
af58ef32
SC
430 cairo_set_source_rgb(cr, i->r, i->g, i->b);
431 for (j = i->values; j; j = j->next) {
432 tx = ((getx(j) - minx) / (maxx - minx)) * (x2 - x1) + x1;
433 ty = y2 - ((gety(j) - miny) / (maxy - miny)) * (y2 - y1);
434 if (first) {
435 cairo_move_to(cr, tx, ty);
436 first = 0;
437 } else {
438 cairo_line_to(cr, tx, ty);
439 }
440 }
441 cairo_stroke(cr);
442 }
443 cairo_restore(cr);
444}
445
446static void gfree(void *f)
447{
448 if (f)
449 free(f);
450}
451
452static void setstring(char **str, const char *value)
453{
454 gfree(*str);
455 *str = strdup(value);
456}
457
458void graph_title(struct graph *bg, const char *title)
459{
460 setstring(&bg->title, title);
461}
462
463void graph_x_title(struct graph *bg, const char *title)
464{
465 setstring(&bg->xtitle, title);
466}
467
468void graph_y_title(struct graph *bg, const char *title)
469{
470 setstring(&bg->ytitle, title);
471}
472
473static struct graph_label *graph_find_label(struct graph *bg,
474 const char *label)
475{
476 struct graph_label *i;
477
478 for (i = bg->labels; i; i = i->next)
479 if (strcmp(label, i->label) == 0)
480 return i;
481 return NULL;
482}
483
484void graph_add_label(struct graph *bg, const char *label)
485{
486 struct graph_label *i;
487
488 i = graph_find_label(bg, label);
489 if (i)
490 return; /* already present. */
491 i = calloc(1, sizeof(*i));
492 i->parent = bg;
493 setstring(&i->label, label);
494 i->next = NULL;
495 if (!bg->tail)
496 bg->labels = i;
497 else
498 bg->tail->next = i;
499 bg->tail = i;
500}
501
502static void graph_label_add_value(struct graph_label *i, void *value)
503{
504 struct graph_value *x;
505
506 x = malloc(sizeof(*x));
507 x->value = value;
508 x->next = NULL;
509 if (!i->tail) {
510 i->values = x;
511 } else {
512 i->tail->next = x;
513 }
514 i->tail = x;
515 i->value_count++;
516
517 if (i->parent->per_label_limit != -1 &&
518 i->value_count > i->parent->per_label_limit) {
519 x = i->values;
520 i->values = i->values->next;
521 free(x->value);
522 free(x);
523 i->value_count--;
524 }
525}
526
527int graph_add_data(struct graph *bg, const char *label, const double value)
528{
529 struct graph_label *i;
530 double *d;
531
532 d = malloc(sizeof(*d));
533 *d = value;
534
535 i = graph_find_label(bg, label);
536 if (!i)
537 return -1;
538 graph_label_add_value(i, d);
539 return 0;
540}
541
542int graph_add_xy_data(struct graph *bg, const char *label,
543 const double x, const double y)
544{
545 struct graph_label *i;
546 struct xyvalue *xy;
547
548 xy = malloc(sizeof(*xy));
549 xy->x = x;
550 xy->y = y;
551
552 i = graph_find_label(bg, label);
553 if (!i)
554 return -1;
555 graph_label_add_value(i, xy);
556 return 0;
557}
558
559static void graph_free_values(struct graph_value *values)
560{
561 struct graph_value *i, *next;
562
563 for (i = values; i; i = next) {
564 next = i->next;
565 gfree(i->value);
566 gfree(i);
567 }
568}
569
570static void graph_free_labels(struct graph_label *labels)
571{
572 struct graph_label *i, *next;
573
574 for (i = labels; i; i = next) {
575 next = i->next;
576 graph_free_values(i->values);
577 gfree(i);
578 }
579}
580
581void graph_set_color(struct graph *gr, const char *label,
582 double red, double green, double blue)
583{
584 struct graph_label *i;
585 double r, g, b;
586
cae08727
SC
587 if (red < 0.0) { /* invisible color */
588 r = -1.0;
589 g = -1.0;
590 b = -1.0;
591 } else {
592 r = fabs(red);
593 g = fabs(green);
594 b = fabs(blue);
595
596 if (r > 1.0)
597 r = 1.0;
598 if (g > 1.0)
599 g = 1.0;
600 if (b > 1.0)
601 b =1.0;
602 }
af58ef32
SC
603
604 for (i = gr->labels; i; i = i->next)
605 if (strcmp(i->label, label) == 0) {
606 i->r = r;
607 i->g = g;
608 i->b = b;
609 break;
610 }
611}
612
613void graph_free(struct graph *bg)
614{
615 gfree(bg->title);
616 gfree(bg->xtitle);
617 gfree(bg->ytitle);
618 graph_free_labels(bg->labels);
619}
620
621/* For each line in the line graph, up to per_label_limit segments may
622 * be added. After that, adding more data to the end of the line
623 * causes data to drop off of the front of the line.
624 */
625void line_graph_set_data_count_limit(struct graph *g, int per_label_limit)
626{
627 g->per_label_limit = per_label_limit;
628}
629